Fix IterableValueMap (#420)
authorBalazs Dezso <deba@inf.elte.hu>
Sun, 24 Apr 2011 21:59:31 +0200
changeset 942633956ca9421
parent 931 f112c18bc304
child 943 4f9e5801224e
child 964 2b6bffe0e7e8
Fix IterableValueMap (#420)
lemon/maps.h
test/maps_test.cc
     1.1 --- a/lemon/maps.h	Thu Mar 17 00:35:33 2011 +0100
     1.2 +++ b/lemon/maps.h	Sun Apr 24 21:59:31 2011 +0200
     1.3 @@ -3252,7 +3252,7 @@
     1.4  
     1.5      virtual void add(const Key& key) {
     1.6        Parent::add(key);
     1.7 -      unlace(key);
     1.8 +      lace(key);
     1.9      }
    1.10  
    1.11      virtual void add(const std::vector<Key>& keys) {
     2.1 --- a/test/maps_test.cc	Thu Mar 17 00:35:33 2011 +0100
     2.2 +++ b/test/maps_test.cc	Sun Apr 24 21:59:31 2011 +0200
     2.3 @@ -641,6 +641,7 @@
     2.4  
     2.5      const int num = 10;
     2.6      Graph g;
     2.7 +    Ibm map0(g, true);
     2.8      std::vector<Item> items;
     2.9      for (int i = 0; i < num; ++i) {
    2.10        items.push_back(g.addNode());
    2.11 @@ -722,6 +723,7 @@
    2.12  
    2.13      const int num = 10;
    2.14      Graph g;
    2.15 +    Iim map0(g, 0);
    2.16      std::vector<Item> items;
    2.17      for (int i = 0; i < num; ++i) {
    2.18        items.push_back(g.addNode());
    2.19 @@ -772,6 +774,7 @@
    2.20  
    2.21      const int num = 10;
    2.22      Graph g;
    2.23 +    Ivm map0(g, 0.0);
    2.24      std::vector<Item> items;
    2.25      for (int i = 0; i < num; ++i) {
    2.26        items.push_back(g.addNode());