Changeset 783:81bf2d766164 in lemon-0.x for src
- Timestamp:
- 09/02/04 12:54:26 (20 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1076
- Location:
- src
- Files:
-
- 4 edited
Legend:
- Unmodified
- Added
- Removed
-
src/hugo/array_map_factory.h
r782 r783 25 25 26 26 typedef V Value; 27 typedef V ValueType; 27 28 typedef A Allocator; 28 29 … … 57 58 58 59 template <typename CMap> Map(const CMap& copy) 59 : capacity(0), values(0), MapBase(copy) {60 : MapBase(copy), capacity(0), values(0) { 60 61 if (MapBase::getGraph()) { 61 62 allocate_memory(); -
src/hugo/map_registry.h
r782 r783 57 57 */ 58 58 59 MapBase(const MapBase& copy) : registry(0), graph(copy.graph) {59 MapBase(const MapBase& copy) : graph(copy.graph), registry(0) { 60 60 if (copy.registry) { 61 61 copy.registry->attach(*this); … … 75 75 copy.registry->attach(*this); 76 76 } 77 return *this; 77 78 } 78 79 … … 233 234 * Notify all the registered maps about a Key added. 234 235 */ 235 v irtual void add(Key& key) {236 void add(Key& key) { 236 237 typename Container::iterator it; 237 238 for (it = container.begin(); it != container.end(); ++it) { … … 243 244 * Notify all the registered maps about a Key erased. 244 245 */ 245 v irtual void erase(Key& key) {246 void erase(Key& key) { 246 247 typename Container::iterator it; 247 248 for (it = container.begin(); it != container.end(); ++it) { … … 253 254 * Notify all the registered maps about the map should be cleared. 254 255 */ 255 v irtual void clear() {256 void clear() { 256 257 typename Container::iterator it; 257 258 for (it = container.begin(); it != container.end(); ++it) { -
src/test/graph_test.cc
r774 r783 321 321 //Compile SmartGraph 322 322 template void checkCompile<SmartGraph>(SmartGraph &); 323 323 324 //Compile SymSmartGraph 324 325 template void checkCompile<SymSmartGraph>(SymSmartGraph &); … … 328 329 template void checkCompileErase<ListGraph>(ListGraph &); 329 330 template void checkCompileFindEdge<ListGraph>(ListGraph &); 331 330 332 331 333 //Compile SymListGraph -
src/work/deba/map_defines.h
r703 r783 62 62 } \ 63 63 template <typename CMap>NodeMap& operator=(const CMap& copy) { \ 64 this->Factory::Map<V>::operator=<CMap>( copy);\64 this->Factory::Map<V>::operator=<CMap>(static_cast<Factory::Map<V>&>(copy));\ 65 65 return *this; \ 66 66 } \ … … 88 88 } \ 89 89 template <typename CMap>EdgeMap& operator=(const CMap& copy) { \ 90 this->Factory::Map<V>::operator=<CMap>( copy);\90 this->Factory::Map<V>::operator=<CMap>(static_cast<Factory::Map<V>&>(copy));\ 91 91 return *this; \ 92 92 } \
Note: See TracChangeset
for help on using the changeset viewer.