/* -*- mode: C++; indent-tabs-mode: nil; -*- * * This file is a part of LEMON, a generic C++ optimization library. * * Copyright (C) 2003-2009 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport * (Egervary Research Group on Combinatorial Optimization, EGRES). * * Permission to use, modify and distribute this software is granted * provided that this copyright notice appears in all copies. For * precise terms see the accompanying LICENSE file. * * This software is provided "AS IS" with no warranty of any kind, * express or implied, and with no claim as to its suitability for any * purpose. * */ #include #include #include #include #include #include #include "test_tools.h" using namespace lemon; using namespace lemon::concepts; struct A {}; inline bool operator<(A, A) { return true; } struct B {}; class C { int x; public: C(int _x) : x(_x) {} }; class F { public: typedef A argument_type; typedef B result_type; B operator()(const A&) const { return B(); } private: F& operator=(const F&); }; int func(A) { return 3; } int binc(int a, B) { return a+1; } typedef ReadMap DoubleMap; typedef ReadWriteMap DoubleWriteMap; typedef ReferenceMap DoubleRefMap; typedef ReadMap BoolMap; typedef ReadWriteMap BoolWriteMap; typedef ReferenceMap BoolRefMap; int main() { // Map concepts checkConcept, ReadMap >(); checkConcept, ReadMap >(); checkConcept, WriteMap >(); checkConcept, WriteMap >(); checkConcept, ReadWriteMap >(); checkConcept, ReadWriteMap >(); checkConcept, ReferenceMap >(); checkConcept, ReferenceMap >(); // NullMap { checkConcept, NullMap >(); NullMap map1; NullMap map2 = map1; map1 = nullMap(); } // ConstMap { checkConcept, ConstMap >(); checkConcept, ConstMap >(); ConstMap map1; ConstMap map2 = B(); ConstMap map3 = map1; map1 = constMap(B()); map1 = constMap(); map1.setAll(B()); ConstMap map4(C(1)); ConstMap map5 = map4; map4 = constMap (C(2)); map4.setAll(C(3)); checkConcept, ConstMap >(); check(constMap (10)[A()] == 10, "Something is wrong with ConstMap"); checkConcept, ConstMap > >(); ConstMap > map6; ConstMap > map7 = map6; map6 = constMap(); map7 = constMap >(); check(map6[A()] == 10 && map7[A()] == 10, "Something is wrong with ConstMap"); } // IdentityMap { checkConcept, IdentityMap >(); IdentityMap map1; IdentityMap map2 = map1; map1 = identityMap (); checkConcept, IdentityMap >(); check(identityMap()[1.0] == 1.0 && identityMap()[3.14] == 3.14, "Something is wrong with IdentityMap"); } // RangeMap { checkConcept, RangeMap >(); RangeMap map1; RangeMap map2(10); RangeMap map3(10,B()); RangeMap map4 = map1; RangeMap map5 = rangeMap(); RangeMap map6 = rangeMap(10); RangeMap map7 = rangeMap(10,B()); checkConcept< ReferenceMap, RangeMap >(); std::vector v(10, 0); v[5] = 100; RangeMap map8(v); RangeMap map9 = rangeMap(v); check(map9.size() == 10 && map9[2] == 0 && map9[5] == 100, "Something is wrong with RangeMap"); } // SparseMap { checkConcept, SparseMap >(); SparseMap map1; SparseMap map2 = B(); SparseMap map3 = sparseMap(); SparseMap map4 = sparseMap(B()); checkConcept< ReferenceMap, SparseMap >(); std::map m; SparseMap map5(m); SparseMap map6(m,10); SparseMap map7 = sparseMap(m); SparseMap map8 = sparseMap(m,10); check(map5[1.0] == 0 && map5[3.14] == 0 && map6[1.0] == 10 && map6[3.14] == 10, "Something is wrong with SparseMap"); map5[1.0] = map6[3.14] = 100; check(map5[1.0] == 100 && map5[3.14] == 0 && map6[1.0] == 10 && map6[3.14] == 100, "Something is wrong with SparseMap"); } // ComposeMap { typedef ComposeMap > CompMap; checkConcept, CompMap>(); CompMap map1 = CompMap(DoubleMap(),ReadMap()); CompMap map2 = composeMap(DoubleMap(), ReadMap()); SparseMap m1(false); m1[3.14] = true; RangeMap m2(2); m2[0] = 3.0; m2[1] = 3.14; check(!composeMap(m1,m2)[0] && composeMap(m1,m2)[1], "Something is wrong with ComposeMap") } // CombineMap { typedef CombineMap > CombMap; checkConcept, CombMap>(); CombMap map1 = CombMap(DoubleMap(), DoubleMap()); CombMap map2 = combineMap(DoubleMap(), DoubleMap(), std::plus()); check(combineMap(constMap(), identityMap(), &binc)[B()] == 3, "Something is wrong with CombineMap"); } // FunctorToMap, MapToFunctor { checkConcept, FunctorToMap >(); checkConcept, FunctorToMap >(); FunctorToMap map1; FunctorToMap map2 = FunctorToMap(F()); B b = functorToMap(F())[A()]; checkConcept, MapToFunctor > >(); MapToFunctor > map = MapToFunctor >(ReadMap()); check(functorToMap(&func)[A()] == 3, "Something is wrong with FunctorToMap"); check(mapToFunctor(constMap(2))(A()) == 2, "Something is wrong with MapToFunctor"); check(mapToFunctor(functorToMap(&func))(A()) == 3 && mapToFunctor(functorToMap(&func))[A()] == 3, "Something is wrong with FunctorToMap or MapToFunctor"); check(functorToMap(mapToFunctor(constMap(2)))[A()] == 2, "Something is wrong with FunctorToMap or MapToFunctor"); } // ConvertMap { checkConcept, ConvertMap, double> >(); ConvertMap, int> map1(rangeMap(1, true)); ConvertMap, int> map2 = convertMap(rangeMap(2, false)); } // ForkMap { checkConcept >(); typedef RangeMap RM; typedef SparseMap SM; RM m1(10, -1); SM m2(-1); checkConcept, ForkMap >(); checkConcept, ForkMap >(); ForkMap map1(m1,m2); ForkMap map2 = forkMap(m2,m1); map2.set(5, 10); check(m1[1] == -1 && m1[5] == 10 && m2[1] == -1 && m2[5] == 10 && map2[1] == -1 && map2[5] == 10, "Something is wrong with ForkMap"); } // Arithmetic maps: // - AddMap, SubMap, MulMap, DivMap // - ShiftMap, ShiftWriteMap, ScaleMap, ScaleWriteMap // - NegMap, NegWriteMap, AbsMap { checkConcept >(); checkConcept >(); checkConcept >(); checkConcept >(); ConstMap c1(1.0), c2(3.14); IdentityMap im; ConvertMap, double> id(im); check(addMap(c1,id)[0] == 1.0 && addMap(c1,id)[10] == 11.0, "Something is wrong with AddMap"); check(subMap(id,c1)[0] == -1.0 && subMap(id,c1)[10] == 9.0, "Something is wrong with SubMap"); check(mulMap(id,c2)[0] == 0 && mulMap(id,c2)[2] == 6.28, "Something is wrong with MulMap"); check(divMap(c2,id)[1] == 3.14 && divMap(c2,id)[2] == 1.57, "Something is wrong with DivMap"); checkConcept >(); checkConcept >(); checkConcept >(); checkConcept >(); checkConcept >(); checkConcept >(); checkConcept >(); check(shiftMap(id, 2.0)[1] == 3.0 && shiftMap(id, 2.0)[10] == 12.0, "Something is wrong with ShiftMap"); check(shiftWriteMap(id, 2.0)[1] == 3.0 && shiftWriteMap(id, 2.0)[10] == 12.0, "Something is wrong with ShiftWriteMap"); check(scaleMap(id, 2.0)[1] == 2.0 && scaleMap(id, 2.0)[10] == 20.0, "Something is wrong with ScaleMap"); check(scaleWriteMap(id, 2.0)[1] == 2.0 && scaleWriteMap(id, 2.0)[10] == 20.0, "Something is wrong with ScaleWriteMap"); check(negMap(id)[1] == -1.0 && negMap(id)[-10] == 10.0, "Something is wrong with NegMap"); check(negWriteMap(id)[1] == -1.0 && negWriteMap(id)[-10] == 10.0, "Something is wrong with NegWriteMap"); check(absMap(id)[1] == 1.0 && absMap(id)[-10] == 10.0, "Something is wrong with AbsMap"); } // Logical maps: // - TrueMap, FalseMap // - AndMap, OrMap // - NotMap, NotWriteMap // - EqualMap, LessMap { checkConcept >(); checkConcept >(); checkConcept >(); checkConcept >(); checkConcept >(); checkConcept >(); checkConcept >(); checkConcept >(); TrueMap tm; FalseMap fm; RangeMap rm(2); rm[0] = true; rm[1] = false; check(andMap(tm,rm)[0] && !andMap(tm,rm)[1] && !andMap(fm,rm)[0] && !andMap(fm,rm)[1], "Something is wrong with AndMap"); check(orMap(tm,rm)[0] && orMap(tm,rm)[1] && orMap(fm,rm)[0] && !orMap(fm,rm)[1], "Something is wrong with OrMap"); check(!notMap(rm)[0] && notMap(rm)[1], "Something is wrong with NotMap"); check(!notWriteMap(rm)[0] && notWriteMap(rm)[1], "Something is wrong with NotWriteMap"); ConstMap cm(2.0); IdentityMap im; ConvertMap, double> id(im); check(lessMap(id,cm)[1] && !lessMap(id,cm)[2] && !lessMap(id,cm)[3], "Something is wrong with LessMap"); check(!equalMap(id,cm)[1] && equalMap(id,cm)[2] && !equalMap(id,cm)[3], "Something is wrong with EqualMap"); } // LoggerBoolMap { typedef std::vector vec; vec v1; vec v2(10); LoggerBoolMap > map1(std::back_inserter(v1)); LoggerBoolMap map2(v2.begin()); map1.set(10, false); map1.set(20, true); map2.set(20, true); map1.set(30, false); map2.set(40, false); map1.set(50, true); map2.set(50, true); map1.set(60, true); map2.set(60, true); check(v1.size() == 3 && v2.size() == 10 && v1[0]==20 && v1[1]==50 && v1[2]==60 && v2[0]==20 && v2[1]==50 && v2[2]==60, "Something is wrong with LoggerBoolMap"); int i = 0; for ( LoggerBoolMap::Iterator it = map2.begin(); it != map2.end(); ++it ) check(v1[i++] == *it, "Something is wrong with LoggerBoolMap"); } // CrossRefMap { typedef SmartDigraph Graph; DIGRAPH_TYPEDEFS(Graph); checkConcept, CrossRefMap >(); Graph gr; typedef CrossRefMap CRMap; typedef CRMap::ValueIterator ValueIt; CRMap map(gr); Node n0 = gr.addNode(); Node n1 = gr.addNode(); Node n2 = gr.addNode(); map.set(n0, 'A'); map.set(n1, 'B'); map.set(n2, 'C'); map.set(n2, 'A'); map.set(n0, 'C'); check(map[n0] == 'C' && map[n1] == 'B' && map[n2] == 'A', "Wrong CrossRefMap"); check(map('A') == n2 && map.inverse()['A'] == n2, "Wrong CrossRefMap"); check(map('B') == n1 && map.inverse()['B'] == n1, "Wrong CrossRefMap"); check(map('C') == n0 && map.inverse()['C'] == n0, "Wrong CrossRefMap"); ValueIt it = map.beginValue(); check(*it++ == 'A' && *it++ == 'B' && *it++ == 'C' && it == map.endValue(), "Wrong value iterator"); } // Iterable bool map { typedef SmartGraph Graph; typedef SmartGraph::Node Item; typedef IterableBoolMap Ibm; checkConcept, Ibm>(); const int num = 10; Graph g; std::vector items; for (int i = 0; i < num; ++i) { items.push_back(g.addNode()); } Ibm map1(g, true); int n = 0; for (Ibm::TrueIt it(map1); it != INVALID; ++it) { check(map1[static_cast(it)], "Wrong TrueIt"); ++n; } check(n == num, "Wrong number"); n = 0; for (Ibm::ItemIt it(map1, true); it != INVALID; ++it) { check(map1[static_cast(it)], "Wrong ItemIt for true"); ++n; } check(n == num, "Wrong number"); check(Ibm::FalseIt(map1) == INVALID, "Wrong FalseIt"); check(Ibm::ItemIt(map1, false) == INVALID, "Wrong ItemIt for false"); map1[items[5]] = true; n = 0; for (Ibm::ItemIt it(map1, true); it != INVALID; ++it) { check(map1[static_cast(it)], "Wrong ItemIt for true"); ++n; } check(n == num, "Wrong number"); map1[items[num / 2]] = false; check(map1[items[num / 2]] == false, "Wrong map value"); n = 0; for (Ibm::TrueIt it(map1); it != INVALID; ++it) { check(map1[static_cast(it)], "Wrong TrueIt for true"); ++n; } check(n == num - 1, "Wrong number"); n = 0; for (Ibm::FalseIt it(map1); it != INVALID; ++it) { check(!map1[static_cast(it)], "Wrong FalseIt for true"); ++n; } check(n == 1, "Wrong number"); map1[items[0]] = false; check(map1[items[0]] == false, "Wrong map value"); map1[items[num - 1]] = false; check(map1[items[num - 1]] == false, "Wrong map value"); n = 0; for (Ibm::TrueIt it(map1); it != INVALID; ++it) { check(map1[static_cast(it)], "Wrong TrueIt for true"); ++n; } check(n == num - 3, "Wrong number"); check(map1.trueNum() == num - 3, "Wrong number"); n = 0; for (Ibm::FalseIt it(map1); it != INVALID; ++it) { check(!map1[static_cast(it)], "Wrong FalseIt for true"); ++n; } check(n == 3, "Wrong number"); check(map1.falseNum() == 3, "Wrong number"); } // Iterable int map { typedef SmartGraph Graph; typedef SmartGraph::Node Item; typedef IterableIntMap Iim; checkConcept, Iim>(); const int num = 10; Graph g; std::vector items; for (int i = 0; i < num; ++i) { items.push_back(g.addNode()); } Iim map1(g); check(map1.size() == 0, "Wrong size"); for (int i = 0; i < num; ++i) { map1[items[i]] = i; } check(map1.size() == num, "Wrong size"); for (int i = 0; i < num; ++i) { Iim::ItemIt it(map1, i); check(static_cast(it) == items[i], "Wrong value"); ++it; check(static_cast(it) == INVALID, "Wrong value"); } for (int i = 0; i < num; ++i) { map1[items[i]] = i % 2; } check(map1.size() == 2, "Wrong size"); int n = 0; for (Iim::ItemIt it(map1, 0); it != INVALID; ++it) { check(map1[static_cast(it)] == 0, "Wrong value"); ++n; } check(n == (num + 1) / 2, "Wrong number"); for (Iim::ItemIt it(map1, 1); it != INVALID; ++it) { check(map1[static_cast(it)] == 1, "Wrong value"); ++n; } check(n == num, "Wrong number"); } // Iterable value map { typedef SmartGraph Graph; typedef SmartGraph::Node Item; typedef IterableValueMap Ivm; checkConcept, Ivm>(); const int num = 10; Graph g; std::vector items; for (int i = 0; i < num; ++i) { items.push_back(g.addNode()); } Ivm map1(g, 0.0); check(distance(map1.beginValue(), map1.endValue()) == 1, "Wrong size"); check(*map1.beginValue() == 0.0, "Wrong value"); for (int i = 0; i < num; ++i) { map1.set(items[i], static_cast(i)); } check(distance(map1.beginValue(), map1.endValue()) == num, "Wrong size"); for (int i = 0; i < num; ++i) { Ivm::ItemIt it(map1, static_cast(i)); check(static_cast(it) == items[i], "Wrong value"); ++it; check(static_cast(it) == INVALID, "Wrong value"); } for (Ivm::ValueIterator vit = map1.beginValue(); vit != map1.endValue(); ++vit) { check(map1[static_cast(Ivm::ItemIt(map1, *vit))] == *vit, "Wrong ValueIterator"); } for (int i = 0; i < num; ++i) { map1.set(items[i], static_cast(i % 2)); } check(distance(map1.beginValue(), map1.endValue()) == 2, "Wrong size"); int n = 0; for (Ivm::ItemIt it(map1, 0.0); it != INVALID; ++it) { check(map1[static_cast(it)] == 0.0, "Wrong value"); ++n; } check(n == (num + 1) / 2, "Wrong number"); for (Ivm::ItemIt it(map1, 1.0); it != INVALID; ++it) { check(map1[static_cast(it)] == 1.0, "Wrong value"); ++n; } check(n == num, "Wrong number"); } return 0; }