COIN-OR::LEMON - Graph Library

Ignore:
File:
1 edited

Legend:

Unmodified
Added
Removed
  • test/maps_test.cc

    r1158 r1157  
    33 * This file is a part of LEMON, a generic C++ optimization library.
    44 *
    5  * Copyright (C) 2003-2011
     5 * Copyright (C) 2003-2009
    66 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    77 * (Egervary Research Group on Combinatorial Optimization, EGRES).
     
    7171  checkConcept<ReadWriteMap<A,B>, ReadWriteMap<A,B> >();
    7272  checkConcept<ReadWriteMap<A,C>, ReadWriteMap<A,C> >();
    73   checkConcept<ReferenceMap<A,B,B&,const B&>,
    74                ReferenceMap<A,B,B&,const B&> >();
    75   checkConcept<ReferenceMap<A,C,C&,const C&>,
    76                ReferenceMap<A,C,C&,const C&> >();
     73  checkConcept<ReferenceMap<A,B,B&,const B&>, ReferenceMap<A,B,B&,const B&> >();
     74  checkConcept<ReferenceMap<A,C,C&,const C&>, ReferenceMap<A,C,C&,const C&> >();
    7775
    7876  // NullMap
     
    371369      check(v1[i++] == *it, "Something is wrong with LoggerBoolMap");
    372370  }
    373 
     371 
    374372  // CrossRefMap
    375373  {
     
    379377    checkConcept<ReadWriteMap<Node, int>,
    380378                 CrossRefMap<Graph, Node, int> >();
    381 
     379   
    382380    Graph gr;
    383381    typedef CrossRefMap<Graph, Node, char> CRMap;
    384382    typedef CRMap::ValueIterator ValueIt;
    385383    CRMap map(gr);
    386 
     384   
    387385    Node n0 = gr.addNode();
    388386    Node n1 = gr.addNode();
    389387    Node n2 = gr.addNode();
    390 
     388   
    391389    map.set(n0, 'A');
    392390    map.set(n1, 'B');
Note: See TracChangeset for help on using the changeset viewer.