alpar@209: /* -*- mode: C++; indent-tabs-mode: nil; -*- alpar@25: * alpar@209: * This file is a part of LEMON, a generic C++ optimization library. alpar@25: * alpar@440: * Copyright (C) 2003-2009 alpar@25: * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport alpar@25: * (Egervary Research Group on Combinatorial Optimization, EGRES). alpar@25: * alpar@25: * Permission to use, modify and distribute this software is granted alpar@25: * provided that this copyright notice appears in all copies. For alpar@25: * precise terms see the accompanying LICENSE file. alpar@25: * alpar@25: * This software is provided "AS IS" with no warranty of any kind, alpar@25: * express or implied, and with no claim as to its suitability for any alpar@25: * purpose. alpar@25: * alpar@25: */ alpar@25: alpar@25: #include alpar@25: #include alpar@25: alpar@25: #include alpar@25: #include alpar@25: #include kpeter@684: #include kpeter@694: #include kpeter@723: #include kpeter@723: #include alpar@25: alpar@25: #include "test_tools.h" alpar@25: alpar@25: using namespace lemon; alpar@25: using namespace lemon::concepts; alpar@25: alpar@25: struct A {}; alpar@25: inline bool operator<(A, A) { return true; } alpar@25: struct B {}; alpar@25: kpeter@94: class C { kpeter@94: int x; kpeter@94: public: kpeter@94: C(int _x) : x(_x) {} kpeter@94: }; kpeter@94: alpar@25: class F { alpar@25: public: alpar@25: typedef A argument_type; alpar@25: typedef B result_type; alpar@25: kpeter@80: B operator()(const A&) const { return B(); } kpeter@80: private: kpeter@80: F& operator=(const F&); alpar@25: }; alpar@25: kpeter@80: int func(A) { return 3; } alpar@25: kpeter@80: int binc(int a, B) { return a+1; } alpar@25: kpeter@80: typedef ReadMap DoubleMap; kpeter@80: typedef ReadWriteMap DoubleWriteMap; kpeter@80: typedef ReferenceMap DoubleRefMap; alpar@25: kpeter@80: typedef ReadMap BoolMap; alpar@25: typedef ReadWriteMap BoolWriteMap; kpeter@80: typedef ReferenceMap BoolRefMap; alpar@25: kpeter@723: template kpeter@723: void compareMap(const Map1& map1, const Map2& map2, ItemIt it) { kpeter@723: for (; it != INVALID; ++it) kpeter@723: check(map1[it] == map2[it], "The maps are not equal"); kpeter@723: } kpeter@723: alpar@25: int main() kpeter@80: { kpeter@80: // Map concepts alpar@25: checkConcept, ReadMap >(); kpeter@94: checkConcept, ReadMap >(); alpar@25: checkConcept, WriteMap >(); kpeter@94: checkConcept, WriteMap >(); alpar@25: checkConcept, ReadWriteMap >(); kpeter@94: checkConcept, ReadWriteMap >(); alpar@25: checkConcept, ReferenceMap >(); kpeter@94: checkConcept, ReferenceMap >(); alpar@25: kpeter@80: // NullMap kpeter@80: { kpeter@80: checkConcept, NullMap >(); kpeter@80: NullMap map1; kpeter@80: NullMap map2 = map1; kpeter@80: map1 = nullMap(); kpeter@80: } kpeter@80: kpeter@80: // ConstMap kpeter@80: { kpeter@80: checkConcept, ConstMap >(); kpeter@123: checkConcept, ConstMap >(); kpeter@80: ConstMap map1; deba@136: ConstMap map2 = B(); kpeter@80: ConstMap map3 = map1; kpeter@80: map1 = constMap(B()); kpeter@123: map1 = constMap(); kpeter@80: map1.setAll(B()); kpeter@123: ConstMap map4(C(1)); kpeter@123: ConstMap map5 = map4; kpeter@123: map4 = constMap(C(2)); kpeter@123: map4.setAll(C(3)); kpeter@82: kpeter@80: checkConcept, ConstMap >(); kpeter@80: check(constMap(10)[A()] == 10, "Something is wrong with ConstMap"); kpeter@80: kpeter@80: checkConcept, ConstMap > >(); kpeter@123: ConstMap > map6; kpeter@123: ConstMap > map7 = map6; kpeter@123: map6 = constMap(); kpeter@123: map7 = constMap >(); alpar@210: check(map6[A()] == 10 && map7[A()] == 10, alpar@210: "Something is wrong with ConstMap"); kpeter@80: } kpeter@80: kpeter@80: // IdentityMap kpeter@80: { kpeter@80: checkConcept, IdentityMap >(); kpeter@80: IdentityMap map1; kpeter@80: IdentityMap map2 = map1; kpeter@80: map1 = identityMap(); kpeter@82: kpeter@80: checkConcept, IdentityMap >(); alpar@210: check(identityMap()[1.0] == 1.0 && alpar@210: identityMap()[3.14] == 3.14, kpeter@80: "Something is wrong with IdentityMap"); kpeter@80: } kpeter@80: kpeter@80: // RangeMap kpeter@80: { kpeter@80: checkConcept, RangeMap >(); kpeter@80: RangeMap map1; kpeter@80: RangeMap map2(10); kpeter@80: RangeMap map3(10,B()); kpeter@80: RangeMap map4 = map1; kpeter@80: RangeMap map5 = rangeMap(); kpeter@80: RangeMap map6 = rangeMap(10); kpeter@80: RangeMap map7 = rangeMap(10,B()); kpeter@80: kpeter@80: checkConcept< ReferenceMap, kpeter@80: RangeMap >(); kpeter@80: std::vector v(10, 0); kpeter@80: v[5] = 100; kpeter@80: RangeMap map8(v); kpeter@80: RangeMap map9 = rangeMap(v); kpeter@80: check(map9.size() == 10 && map9[2] == 0 && map9[5] == 100, kpeter@80: "Something is wrong with RangeMap"); kpeter@80: } kpeter@80: kpeter@80: // SparseMap kpeter@80: { kpeter@80: checkConcept, SparseMap >(); kpeter@80: SparseMap map1; deba@136: SparseMap map2 = B(); kpeter@80: SparseMap map3 = sparseMap(); kpeter@80: SparseMap map4 = sparseMap(B()); kpeter@80: kpeter@80: checkConcept< ReferenceMap, kpeter@80: SparseMap >(); kpeter@80: std::map m; kpeter@80: SparseMap map5(m); kpeter@80: SparseMap map6(m,10); kpeter@80: SparseMap map7 = sparseMap(m); kpeter@80: SparseMap map8 = sparseMap(m,10); kpeter@80: alpar@210: check(map5[1.0] == 0 && map5[3.14] == 0 && alpar@210: map6[1.0] == 10 && map6[3.14] == 10, kpeter@80: "Something is wrong with SparseMap"); kpeter@80: map5[1.0] = map6[3.14] = 100; alpar@210: check(map5[1.0] == 100 && map5[3.14] == 0 && alpar@210: map6[1.0] == 10 && map6[3.14] == 100, kpeter@80: "Something is wrong with SparseMap"); kpeter@80: } kpeter@80: kpeter@80: // ComposeMap kpeter@80: { kpeter@80: typedef ComposeMap > CompMap; kpeter@80: checkConcept, CompMap>(); alpar@507: CompMap map1 = CompMap(DoubleMap(),ReadMap()); kpeter@80: CompMap map2 = composeMap(DoubleMap(), ReadMap()); kpeter@82: kpeter@80: SparseMap m1(false); m1[3.14] = true; kpeter@80: RangeMap m2(2); m2[0] = 3.0; m2[1] = 3.14; alpar@210: check(!composeMap(m1,m2)[0] && composeMap(m1,m2)[1], alpar@210: "Something is wrong with ComposeMap") kpeter@80: } kpeter@80: kpeter@80: // CombineMap kpeter@80: { kpeter@80: typedef CombineMap > CombMap; kpeter@80: checkConcept, CombMap>(); alpar@507: CombMap map1 = CombMap(DoubleMap(), DoubleMap()); kpeter@80: CombMap map2 = combineMap(DoubleMap(), DoubleMap(), std::plus()); kpeter@80: kpeter@80: check(combineMap(constMap(), identityMap(), &binc)[B()] == 3, kpeter@80: "Something is wrong with CombineMap"); kpeter@80: } kpeter@80: kpeter@80: // FunctorToMap, MapToFunctor kpeter@80: { kpeter@80: checkConcept, FunctorToMap >(); kpeter@80: checkConcept, FunctorToMap >(); kpeter@80: FunctorToMap map1; alpar@507: FunctorToMap map2 = FunctorToMap(F()); kpeter@80: B b = functorToMap(F())[A()]; kpeter@80: kpeter@80: checkConcept, MapToFunctor > >(); alpar@507: MapToFunctor > map = MapToFunctor >(ReadMap()); kpeter@80: alpar@210: check(functorToMap(&func)[A()] == 3, alpar@210: "Something is wrong with FunctorToMap"); alpar@210: check(mapToFunctor(constMap(2))(A()) == 2, alpar@210: "Something is wrong with MapToFunctor"); alpar@210: check(mapToFunctor(functorToMap(&func))(A()) == 3 && alpar@210: mapToFunctor(functorToMap(&func))[A()] == 3, kpeter@80: "Something is wrong with FunctorToMap or MapToFunctor"); kpeter@80: check(functorToMap(mapToFunctor(constMap(2)))[A()] == 2, kpeter@80: "Something is wrong with FunctorToMap or MapToFunctor"); kpeter@80: } kpeter@80: kpeter@80: // ConvertMap kpeter@80: { alpar@210: checkConcept, alpar@210: ConvertMap, double> >(); kpeter@80: ConvertMap, int> map1(rangeMap(1, true)); kpeter@80: ConvertMap, int> map2 = convertMap(rangeMap(2, false)); kpeter@80: } kpeter@80: kpeter@80: // ForkMap kpeter@80: { kpeter@80: checkConcept >(); kpeter@82: kpeter@80: typedef RangeMap RM; kpeter@80: typedef SparseMap SM; kpeter@80: RM m1(10, -1); kpeter@80: SM m2(-1); kpeter@80: checkConcept, ForkMap >(); kpeter@80: checkConcept, ForkMap >(); kpeter@80: ForkMap map1(m1,m2); kpeter@80: ForkMap map2 = forkMap(m2,m1); kpeter@80: map2.set(5, 10); alpar@210: check(m1[1] == -1 && m1[5] == 10 && m2[1] == -1 && alpar@210: m2[5] == 10 && map2[1] == -1 && map2[5] == 10, kpeter@80: "Something is wrong with ForkMap"); kpeter@80: } kpeter@82: kpeter@80: // Arithmetic maps: kpeter@80: // - AddMap, SubMap, MulMap, DivMap kpeter@80: // - ShiftMap, ShiftWriteMap, ScaleMap, ScaleWriteMap kpeter@80: // - NegMap, NegWriteMap, AbsMap kpeter@80: { kpeter@80: checkConcept >(); kpeter@80: checkConcept >(); kpeter@80: checkConcept >(); kpeter@80: checkConcept >(); kpeter@82: kpeter@80: ConstMap c1(1.0), c2(3.14); kpeter@80: IdentityMap im; kpeter@80: ConvertMap, double> id(im); alpar@210: check(addMap(c1,id)[0] == 1.0 && addMap(c1,id)[10] == 11.0, alpar@210: "Something is wrong with AddMap"); alpar@210: check(subMap(id,c1)[0] == -1.0 && subMap(id,c1)[10] == 9.0, alpar@210: "Something is wrong with SubMap"); alpar@210: check(mulMap(id,c2)[0] == 0 && mulMap(id,c2)[2] == 6.28, alpar@210: "Something is wrong with MulMap"); alpar@210: check(divMap(c2,id)[1] == 3.14 && divMap(c2,id)[2] == 1.57, alpar@210: "Something is wrong with DivMap"); kpeter@82: kpeter@80: checkConcept >(); kpeter@80: checkConcept >(); kpeter@80: checkConcept >(); kpeter@80: checkConcept >(); kpeter@80: checkConcept >(); kpeter@80: checkConcept >(); kpeter@80: checkConcept >(); alpar@25: kpeter@80: check(shiftMap(id, 2.0)[1] == 3.0 && shiftMap(id, 2.0)[10] == 12.0, kpeter@80: "Something is wrong with ShiftMap"); alpar@210: check(shiftWriteMap(id, 2.0)[1] == 3.0 && alpar@210: shiftWriteMap(id, 2.0)[10] == 12.0, kpeter@80: "Something is wrong with ShiftWriteMap"); kpeter@80: check(scaleMap(id, 2.0)[1] == 2.0 && scaleMap(id, 2.0)[10] == 20.0, kpeter@80: "Something is wrong with ScaleMap"); alpar@210: check(scaleWriteMap(id, 2.0)[1] == 2.0 && alpar@210: scaleWriteMap(id, 2.0)[10] == 20.0, kpeter@80: "Something is wrong with ScaleWriteMap"); kpeter@80: check(negMap(id)[1] == -1.0 && negMap(id)[-10] == 10.0, kpeter@80: "Something is wrong with NegMap"); kpeter@80: check(negWriteMap(id)[1] == -1.0 && negWriteMap(id)[-10] == 10.0, kpeter@80: "Something is wrong with NegWriteMap"); kpeter@80: check(absMap(id)[1] == 1.0 && absMap(id)[-10] == 10.0, kpeter@80: "Something is wrong with AbsMap"); kpeter@80: } kpeter@82: kpeter@82: // Logical maps: kpeter@82: // - TrueMap, FalseMap kpeter@82: // - AndMap, OrMap kpeter@82: // - NotMap, NotWriteMap kpeter@82: // - EqualMap, LessMap kpeter@80: { kpeter@82: checkConcept >(); kpeter@82: checkConcept >(); kpeter@82: checkConcept >(); kpeter@82: checkConcept >(); kpeter@80: checkConcept >(); kpeter@80: checkConcept >(); kpeter@82: checkConcept >(); kpeter@82: checkConcept >(); kpeter@82: kpeter@82: TrueMap tm; kpeter@82: FalseMap fm; kpeter@80: RangeMap rm(2); kpeter@80: rm[0] = true; rm[1] = false; alpar@210: check(andMap(tm,rm)[0] && !andMap(tm,rm)[1] && alpar@210: !andMap(fm,rm)[0] && !andMap(fm,rm)[1], kpeter@82: "Something is wrong with AndMap"); alpar@210: check(orMap(tm,rm)[0] && orMap(tm,rm)[1] && alpar@210: orMap(fm,rm)[0] && !orMap(fm,rm)[1], kpeter@82: "Something is wrong with OrMap"); alpar@210: check(!notMap(rm)[0] && notMap(rm)[1], alpar@210: "Something is wrong with NotMap"); alpar@210: check(!notWriteMap(rm)[0] && notWriteMap(rm)[1], alpar@210: "Something is wrong with NotWriteMap"); kpeter@82: kpeter@82: ConstMap cm(2.0); kpeter@82: IdentityMap im; kpeter@82: ConvertMap, double> id(im); kpeter@82: check(lessMap(id,cm)[1] && !lessMap(id,cm)[2] && !lessMap(id,cm)[3], kpeter@82: "Something is wrong with LessMap"); kpeter@82: check(!equalMap(id,cm)[1] && equalMap(id,cm)[2] && !equalMap(id,cm)[3], kpeter@82: "Something is wrong with EqualMap"); kpeter@80: } alpar@209: kpeter@167: // LoggerBoolMap kpeter@159: { kpeter@159: typedef std::vector vec; kpeter@720: checkConcept, LoggerBoolMap >(); kpeter@720: checkConcept, kpeter@720: LoggerBoolMap > >(); kpeter@720: kpeter@159: vec v1; kpeter@159: vec v2(10); alpar@210: LoggerBoolMap > alpar@210: map1(std::back_inserter(v1)); kpeter@167: LoggerBoolMap map2(v2.begin()); kpeter@159: map1.set(10, false); kpeter@159: map1.set(20, true); map2.set(20, true); kpeter@159: map1.set(30, false); map2.set(40, false); kpeter@159: map1.set(50, true); map2.set(50, true); kpeter@159: map1.set(60, true); map2.set(60, true); kpeter@159: check(v1.size() == 3 && v2.size() == 10 && alpar@210: v1[0]==20 && v1[1]==50 && v1[2]==60 && alpar@210: v2[0]==20 && v2[1]==50 && v2[2]==60, kpeter@167: "Something is wrong with LoggerBoolMap"); alpar@209: kpeter@159: int i = 0; kpeter@167: for ( LoggerBoolMap::Iterator it = map2.begin(); kpeter@159: it != map2.end(); ++it ) kpeter@167: check(v1[i++] == *it, "Something is wrong with LoggerBoolMap"); kpeter@723: kpeter@723: typedef ListDigraph Graph; kpeter@723: DIGRAPH_TYPEDEFS(Graph); kpeter@723: Graph gr; kpeter@723: kpeter@723: Node n0 = gr.addNode(); kpeter@723: Node n1 = gr.addNode(); kpeter@723: Node n2 = gr.addNode(); kpeter@723: Node n3 = gr.addNode(); kpeter@723: kpeter@723: gr.addArc(n3, n0); kpeter@723: gr.addArc(n3, n2); kpeter@723: gr.addArc(n0, n2); kpeter@723: gr.addArc(n2, n1); kpeter@723: gr.addArc(n0, n1); kpeter@723: kpeter@723: { kpeter@723: std::vector v; kpeter@723: dfs(gr).processedMap(loggerBoolMap(std::back_inserter(v))).run(); kpeter@723: kpeter@723: check(v.size()==4 && v[0]==n1 && v[1]==n2 && v[2]==n0 && v[3]==n3, kpeter@723: "Something is wrong with LoggerBoolMap"); kpeter@723: } kpeter@723: { kpeter@723: std::vector v(countNodes(gr)); kpeter@723: dfs(gr).processedMap(loggerBoolMap(v.begin())).run(); kpeter@723: kpeter@723: check(v.size()==4 && v[0]==n1 && v[1]==n2 && v[2]==n0 && v[3]==n3, kpeter@723: "Something is wrong with LoggerBoolMap"); kpeter@723: } kpeter@694: } kpeter@684: kpeter@720: // IdMap, RangeIdMap kpeter@720: { kpeter@720: typedef ListDigraph Graph; kpeter@720: DIGRAPH_TYPEDEFS(Graph); kpeter@720: kpeter@720: checkConcept, IdMap >(); kpeter@720: checkConcept, IdMap >(); kpeter@720: checkConcept, RangeIdMap >(); kpeter@720: checkConcept, RangeIdMap >(); kpeter@720: kpeter@720: Graph gr; kpeter@720: IdMap nmap(gr); kpeter@720: IdMap amap(gr); kpeter@720: RangeIdMap nrmap(gr); kpeter@720: RangeIdMap armap(gr); kpeter@720: kpeter@720: Node n0 = gr.addNode(); kpeter@720: Node n1 = gr.addNode(); kpeter@720: Node n2 = gr.addNode(); kpeter@720: kpeter@720: Arc a0 = gr.addArc(n0, n1); kpeter@720: Arc a1 = gr.addArc(n0, n2); kpeter@720: Arc a2 = gr.addArc(n2, n1); kpeter@720: Arc a3 = gr.addArc(n2, n0); kpeter@720: kpeter@720: check(nmap[n0] == gr.id(n0) && nmap(gr.id(n0)) == n0, "Wrong IdMap"); kpeter@720: check(nmap[n1] == gr.id(n1) && nmap(gr.id(n1)) == n1, "Wrong IdMap"); kpeter@720: check(nmap[n2] == gr.id(n2) && nmap(gr.id(n2)) == n2, "Wrong IdMap"); kpeter@720: kpeter@720: check(amap[a0] == gr.id(a0) && amap(gr.id(a0)) == a0, "Wrong IdMap"); kpeter@720: check(amap[a1] == gr.id(a1) && amap(gr.id(a1)) == a1, "Wrong IdMap"); kpeter@720: check(amap[a2] == gr.id(a2) && amap(gr.id(a2)) == a2, "Wrong IdMap"); kpeter@720: check(amap[a3] == gr.id(a3) && amap(gr.id(a3)) == a3, "Wrong IdMap"); kpeter@720: kpeter@720: check(nmap.inverse()[gr.id(n0)] == n0, "Wrong IdMap::InverseMap"); kpeter@720: check(amap.inverse()[gr.id(a0)] == a0, "Wrong IdMap::InverseMap"); kpeter@720: kpeter@720: check(nrmap.size() == 3 && armap.size() == 4, kpeter@720: "Wrong RangeIdMap::size()"); kpeter@720: kpeter@720: check(nrmap[n0] == 0 && nrmap(0) == n0, "Wrong RangeIdMap"); kpeter@720: check(nrmap[n1] == 1 && nrmap(1) == n1, "Wrong RangeIdMap"); kpeter@720: check(nrmap[n2] == 2 && nrmap(2) == n2, "Wrong RangeIdMap"); kpeter@720: kpeter@720: check(armap[a0] == 0 && armap(0) == a0, "Wrong RangeIdMap"); kpeter@720: check(armap[a1] == 1 && armap(1) == a1, "Wrong RangeIdMap"); kpeter@720: check(armap[a2] == 2 && armap(2) == a2, "Wrong RangeIdMap"); kpeter@720: check(armap[a3] == 3 && armap(3) == a3, "Wrong RangeIdMap"); kpeter@720: kpeter@720: check(nrmap.inverse()[0] == n0, "Wrong RangeIdMap::InverseMap"); kpeter@720: check(armap.inverse()[0] == a0, "Wrong RangeIdMap::InverseMap"); kpeter@720: kpeter@720: gr.erase(n1); kpeter@720: kpeter@720: if (nrmap[n0] == 1) nrmap.swap(n0, n2); kpeter@720: nrmap.swap(n2, n0); kpeter@720: if (armap[a1] == 1) armap.swap(a1, a3); kpeter@720: armap.swap(a3, a1); kpeter@720: kpeter@720: check(nrmap.size() == 2 && armap.size() == 2, kpeter@720: "Wrong RangeIdMap::size()"); kpeter@720: kpeter@720: check(nrmap[n0] == 1 && nrmap(1) == n0, "Wrong RangeIdMap"); kpeter@720: check(nrmap[n2] == 0 && nrmap(0) == n2, "Wrong RangeIdMap"); kpeter@720: kpeter@720: check(armap[a1] == 1 && armap(1) == a1, "Wrong RangeIdMap"); kpeter@720: check(armap[a3] == 0 && armap(0) == a3, "Wrong RangeIdMap"); kpeter@720: kpeter@720: check(nrmap.inverse()[0] == n2, "Wrong RangeIdMap::InverseMap"); kpeter@720: check(armap.inverse()[0] == a3, "Wrong RangeIdMap::InverseMap"); kpeter@720: } kpeter@720: kpeter@723: // SourceMap, TargetMap, ForwardMap, BackwardMap, InDegMap, OutDegMap kpeter@723: { kpeter@723: typedef ListGraph Graph; kpeter@723: GRAPH_TYPEDEFS(Graph); kpeter@723: kpeter@723: checkConcept, SourceMap >(); kpeter@723: checkConcept, TargetMap >(); kpeter@723: checkConcept, ForwardMap >(); kpeter@723: checkConcept, BackwardMap >(); kpeter@723: checkConcept, InDegMap >(); kpeter@723: checkConcept, OutDegMap >(); kpeter@723: kpeter@723: Graph gr; kpeter@723: Node n0 = gr.addNode(); kpeter@723: Node n1 = gr.addNode(); kpeter@723: Node n2 = gr.addNode(); kpeter@723: kpeter@723: gr.addEdge(n0,n1); kpeter@723: gr.addEdge(n1,n2); kpeter@723: gr.addEdge(n0,n2); kpeter@723: gr.addEdge(n2,n1); kpeter@723: gr.addEdge(n1,n2); kpeter@723: gr.addEdge(n0,n1); kpeter@723: kpeter@723: for (EdgeIt e(gr); e != INVALID; ++e) { kpeter@723: check(forwardMap(gr)[e] == gr.direct(e, true), "Wrong ForwardMap"); kpeter@723: check(backwardMap(gr)[e] == gr.direct(e, false), "Wrong BackwardMap"); kpeter@723: } kpeter@723: kpeter@723: compareMap(sourceMap(orienter(gr, constMap(true))), kpeter@723: targetMap(orienter(gr, constMap(false))), kpeter@723: EdgeIt(gr)); kpeter@723: kpeter@723: typedef Orienter > Digraph; kpeter@723: Digraph dgr(gr, constMap(true)); kpeter@723: OutDegMap odm(dgr); kpeter@723: InDegMap idm(dgr); kpeter@723: kpeter@723: check(odm[n0] == 3 && odm[n1] == 2 && odm[n2] == 1, "Wrong OutDegMap"); kpeter@723: check(idm[n0] == 0 && idm[n1] == 3 && idm[n2] == 3, "Wrong InDegMap"); kpeter@723: kpeter@723: gr.addEdge(n2, n0); kpeter@723: kpeter@723: check(odm[n0] == 3 && odm[n1] == 2 && odm[n2] == 2, "Wrong OutDegMap"); kpeter@723: check(idm[n0] == 1 && idm[n1] == 3 && idm[n2] == 3, "Wrong InDegMap"); kpeter@723: } kpeter@723: kpeter@684: // CrossRefMap kpeter@684: { kpeter@684: typedef ListDigraph Graph; kpeter@684: DIGRAPH_TYPEDEFS(Graph); kpeter@684: kpeter@684: checkConcept, kpeter@684: CrossRefMap >(); kpeter@720: checkConcept, kpeter@720: CrossRefMap >(); kpeter@720: checkConcept, kpeter@720: CrossRefMap >(); kpeter@684: kpeter@684: Graph gr; kpeter@684: typedef CrossRefMap CRMap; kpeter@684: CRMap map(gr); kpeter@684: kpeter@684: Node n0 = gr.addNode(); kpeter@684: Node n1 = gr.addNode(); kpeter@684: Node n2 = gr.addNode(); kpeter@684: kpeter@684: map.set(n0, 'A'); kpeter@684: map.set(n1, 'B'); kpeter@684: map.set(n2, 'C'); kpeter@720: kpeter@720: check(map[n0] == 'A' && map('A') == n0 && map.inverse()['A'] == n0, kpeter@720: "Wrong CrossRefMap"); kpeter@720: check(map[n1] == 'B' && map('B') == n1 && map.inverse()['B'] == n1, kpeter@720: "Wrong CrossRefMap"); kpeter@720: check(map[n2] == 'C' && map('C') == n2 && map.inverse()['C'] == n2, kpeter@720: "Wrong CrossRefMap"); kpeter@720: check(map.count('A') == 1 && map.count('B') == 1 && map.count('C') == 1, kpeter@720: "Wrong CrossRefMap::count()"); kpeter@720: kpeter@724: CRMap::ValueIt it = map.beginValue(); kpeter@720: check(*it++ == 'A' && *it++ == 'B' && *it++ == 'C' && kpeter@720: it == map.endValue(), "Wrong value iterator"); kpeter@720: kpeter@684: map.set(n2, 'A'); kpeter@720: kpeter@720: check(map[n0] == 'A' && map[n1] == 'B' && map[n2] == 'A', kpeter@720: "Wrong CrossRefMap"); kpeter@720: check(map('A') == n0 && map.inverse()['A'] == n0, "Wrong CrossRefMap"); kpeter@720: check(map('B') == n1 && map.inverse()['B'] == n1, "Wrong CrossRefMap"); kpeter@720: check(map('C') == INVALID && map.inverse()['C'] == INVALID, kpeter@720: "Wrong CrossRefMap"); kpeter@720: check(map.count('A') == 2 && map.count('B') == 1 && map.count('C') == 0, kpeter@720: "Wrong CrossRefMap::count()"); kpeter@720: kpeter@720: it = map.beginValue(); kpeter@720: check(*it++ == 'A' && *it++ == 'A' && *it++ == 'B' && kpeter@720: it == map.endValue(), "Wrong value iterator"); kpeter@720: kpeter@684: map.set(n0, 'C'); kpeter@684: kpeter@684: check(map[n0] == 'C' && map[n1] == 'B' && map[n2] == 'A', kpeter@684: "Wrong CrossRefMap"); kpeter@684: check(map('A') == n2 && map.inverse()['A'] == n2, "Wrong CrossRefMap"); kpeter@684: check(map('B') == n1 && map.inverse()['B'] == n1, "Wrong CrossRefMap"); kpeter@684: check(map('C') == n0 && map.inverse()['C'] == n0, "Wrong CrossRefMap"); kpeter@720: check(map.count('A') == 1 && map.count('B') == 1 && map.count('C') == 1, kpeter@720: "Wrong CrossRefMap::count()"); kpeter@684: kpeter@720: it = map.beginValue(); kpeter@684: check(*it++ == 'A' && *it++ == 'B' && *it++ == 'C' && kpeter@684: it == map.endValue(), "Wrong value iterator"); kpeter@159: } alpar@25: kpeter@684: // CrossRefMap kpeter@684: { alpar@695: typedef SmartDigraph Graph; kpeter@684: DIGRAPH_TYPEDEFS(Graph); kpeter@684: kpeter@684: checkConcept, kpeter@684: CrossRefMap >(); kpeter@684: kpeter@684: Graph gr; kpeter@684: typedef CrossRefMap CRMap; kpeter@684: typedef CRMap::ValueIterator ValueIt; kpeter@684: CRMap map(gr); kpeter@684: kpeter@684: Node n0 = gr.addNode(); kpeter@684: Node n1 = gr.addNode(); kpeter@684: Node n2 = gr.addNode(); kpeter@684: kpeter@684: map.set(n0, 'A'); kpeter@684: map.set(n1, 'B'); kpeter@684: map.set(n2, 'C'); kpeter@684: map.set(n2, 'A'); kpeter@684: map.set(n0, 'C'); kpeter@684: kpeter@684: check(map[n0] == 'C' && map[n1] == 'B' && map[n2] == 'A', kpeter@684: "Wrong CrossRefMap"); kpeter@684: check(map('A') == n2 && map.inverse()['A'] == n2, "Wrong CrossRefMap"); kpeter@684: check(map('B') == n1 && map.inverse()['B'] == n1, "Wrong CrossRefMap"); kpeter@684: check(map('C') == n0 && map.inverse()['C'] == n0, "Wrong CrossRefMap"); kpeter@684: kpeter@684: ValueIt it = map.beginValue(); kpeter@684: check(*it++ == 'A' && *it++ == 'B' && *it++ == 'C' && kpeter@684: it == map.endValue(), "Wrong value iterator"); kpeter@684: } alpar@695: deba@693: // Iterable bool map deba@693: { deba@693: typedef SmartGraph Graph; deba@693: typedef SmartGraph::Node Item; deba@693: deba@693: typedef IterableBoolMap Ibm; kpeter@694: checkConcept, Ibm>(); deba@693: deba@693: const int num = 10; deba@693: Graph g; deba@693: std::vector items; deba@693: for (int i = 0; i < num; ++i) { deba@693: items.push_back(g.addNode()); deba@693: } deba@693: deba@693: Ibm map1(g, true); deba@693: int n = 0; deba@693: for (Ibm::TrueIt it(map1); it != INVALID; ++it) { deba@693: check(map1[static_cast(it)], "Wrong TrueIt"); deba@693: ++n; deba@693: } deba@693: check(n == num, "Wrong number"); deba@693: deba@693: n = 0; deba@693: for (Ibm::ItemIt it(map1, true); it != INVALID; ++it) { deba@693: check(map1[static_cast(it)], "Wrong ItemIt for true"); deba@693: ++n; deba@693: } deba@693: check(n == num, "Wrong number"); deba@693: check(Ibm::FalseIt(map1) == INVALID, "Wrong FalseIt"); deba@693: check(Ibm::ItemIt(map1, false) == INVALID, "Wrong ItemIt for false"); deba@693: deba@693: map1[items[5]] = true; deba@693: deba@693: n = 0; deba@693: for (Ibm::ItemIt it(map1, true); it != INVALID; ++it) { deba@693: check(map1[static_cast(it)], "Wrong ItemIt for true"); deba@693: ++n; deba@693: } deba@693: check(n == num, "Wrong number"); deba@693: deba@693: map1[items[num / 2]] = false; deba@693: check(map1[items[num / 2]] == false, "Wrong map value"); deba@693: deba@693: n = 0; deba@693: for (Ibm::TrueIt it(map1); it != INVALID; ++it) { deba@693: check(map1[static_cast(it)], "Wrong TrueIt for true"); deba@693: ++n; deba@693: } deba@693: check(n == num - 1, "Wrong number"); deba@693: deba@693: n = 0; deba@693: for (Ibm::FalseIt it(map1); it != INVALID; ++it) { deba@693: check(!map1[static_cast(it)], "Wrong FalseIt for true"); deba@693: ++n; deba@693: } deba@693: check(n == 1, "Wrong number"); deba@693: deba@693: map1[items[0]] = false; deba@693: check(map1[items[0]] == false, "Wrong map value"); deba@693: deba@693: map1[items[num - 1]] = false; deba@693: check(map1[items[num - 1]] == false, "Wrong map value"); deba@693: deba@693: n = 0; deba@693: for (Ibm::TrueIt it(map1); it != INVALID; ++it) { deba@693: check(map1[static_cast(it)], "Wrong TrueIt for true"); deba@693: ++n; deba@693: } deba@693: check(n == num - 3, "Wrong number"); deba@693: check(map1.trueNum() == num - 3, "Wrong number"); deba@693: deba@693: n = 0; deba@693: for (Ibm::FalseIt it(map1); it != INVALID; ++it) { deba@693: check(!map1[static_cast(it)], "Wrong FalseIt for true"); deba@693: ++n; deba@693: } deba@693: check(n == 3, "Wrong number"); deba@693: check(map1.falseNum() == 3, "Wrong number"); deba@693: } deba@693: deba@693: // Iterable int map deba@693: { deba@693: typedef SmartGraph Graph; deba@693: typedef SmartGraph::Node Item; deba@693: typedef IterableIntMap Iim; deba@693: kpeter@694: checkConcept, Iim>(); deba@693: deba@693: const int num = 10; deba@693: Graph g; deba@693: std::vector items; deba@693: for (int i = 0; i < num; ++i) { deba@693: items.push_back(g.addNode()); deba@693: } deba@693: deba@693: Iim map1(g); deba@693: check(map1.size() == 0, "Wrong size"); deba@693: deba@693: for (int i = 0; i < num; ++i) { deba@693: map1[items[i]] = i; deba@693: } deba@693: check(map1.size() == num, "Wrong size"); deba@693: deba@693: for (int i = 0; i < num; ++i) { deba@693: Iim::ItemIt it(map1, i); deba@693: check(static_cast(it) == items[i], "Wrong value"); deba@693: ++it; deba@693: check(static_cast(it) == INVALID, "Wrong value"); deba@693: } deba@693: deba@693: for (int i = 0; i < num; ++i) { deba@693: map1[items[i]] = i % 2; deba@693: } deba@693: check(map1.size() == 2, "Wrong size"); deba@693: deba@693: int n = 0; deba@693: for (Iim::ItemIt it(map1, 0); it != INVALID; ++it) { kpeter@694: check(map1[static_cast(it)] == 0, "Wrong value"); deba@693: ++n; deba@693: } deba@693: check(n == (num + 1) / 2, "Wrong number"); deba@693: deba@693: for (Iim::ItemIt it(map1, 1); it != INVALID; ++it) { kpeter@694: check(map1[static_cast(it)] == 1, "Wrong value"); deba@693: ++n; deba@693: } deba@693: check(n == num, "Wrong number"); deba@693: deba@693: } deba@693: deba@693: // Iterable value map deba@693: { deba@693: typedef SmartGraph Graph; deba@693: typedef SmartGraph::Node Item; deba@693: typedef IterableValueMap Ivm; deba@693: deba@693: checkConcept, Ivm>(); deba@693: deba@693: const int num = 10; deba@693: Graph g; deba@693: std::vector items; deba@693: for (int i = 0; i < num; ++i) { deba@693: items.push_back(g.addNode()); deba@693: } deba@693: deba@693: Ivm map1(g, 0.0); deba@693: check(distance(map1.beginValue(), map1.endValue()) == 1, "Wrong size"); deba@693: check(*map1.beginValue() == 0.0, "Wrong value"); deba@693: deba@693: for (int i = 0; i < num; ++i) { deba@693: map1.set(items[i], static_cast(i)); deba@693: } deba@693: check(distance(map1.beginValue(), map1.endValue()) == num, "Wrong size"); deba@693: deba@693: for (int i = 0; i < num; ++i) { deba@693: Ivm::ItemIt it(map1, static_cast(i)); deba@693: check(static_cast(it) == items[i], "Wrong value"); deba@693: ++it; deba@693: check(static_cast(it) == INVALID, "Wrong value"); deba@693: } deba@693: kpeter@724: for (Ivm::ValueIt vit = map1.beginValue(); deba@693: vit != map1.endValue(); ++vit) { deba@693: check(map1[static_cast(Ivm::ItemIt(map1, *vit))] == *vit, kpeter@724: "Wrong ValueIt"); deba@693: } deba@693: deba@693: for (int i = 0; i < num; ++i) { deba@693: map1.set(items[i], static_cast(i % 2)); deba@693: } deba@693: check(distance(map1.beginValue(), map1.endValue()) == 2, "Wrong size"); deba@693: deba@693: int n = 0; deba@693: for (Ivm::ItemIt it(map1, 0.0); it != INVALID; ++it) { kpeter@694: check(map1[static_cast(it)] == 0.0, "Wrong value"); deba@693: ++n; deba@693: } deba@693: check(n == (num + 1) / 2, "Wrong number"); deba@693: deba@693: for (Ivm::ItemIt it(map1, 1.0); it != INVALID; ++it) { kpeter@694: check(map1[static_cast(it)] == 1.0, "Wrong value"); deba@693: ++n; deba@693: } deba@693: check(n == num, "Wrong number"); deba@693: deba@693: } alpar@25: return 0; alpar@25: }