alpar@25: /* -*- C++ -*- alpar@25: * alpar@25: * This file is a part of LEMON, a generic C++ optimization library alpar@25: * alpar@39: * Copyright (C) 2003-2008 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 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: alpar@25: class F { alpar@25: public: alpar@25: typedef A argument_type; alpar@25: typedef B result_type; alpar@25: alpar@25: B operator()(const A &) const {return B();} alpar@25: }; alpar@25: alpar@25: int func(A) {return 3;} alpar@25: alpar@25: int binc(int, B) {return 4;} alpar@25: alpar@25: typedef ReadMap DoubleMap; alpar@25: typedef ReadWriteMap WriteDoubleMap; alpar@25: alpar@25: typedef ReadMap BoolMap; alpar@25: typedef ReadWriteMap BoolWriteMap; alpar@25: alpar@25: int main() alpar@25: { // checking graph components alpar@25: alpar@25: checkConcept, ReadMap >(); alpar@25: checkConcept, WriteMap >(); alpar@25: checkConcept, ReadWriteMap >(); alpar@25: checkConcept, ReferenceMap >(); alpar@25: alpar@25: checkConcept, AddMap >(); alpar@25: checkConcept, SubMap >(); alpar@25: checkConcept, MulMap >(); alpar@25: checkConcept, DivMap >(); alpar@25: checkConcept, NegMap >(); alpar@25: checkConcept, NegWriteMap >(); alpar@25: checkConcept, AbsMap >(); alpar@25: checkConcept, ShiftMap >(); alpar@25: checkConcept, ShiftWriteMap >(); alpar@25: checkConcept, ScaleMap >(); alpar@25: checkConcept, ScaleWriteMap >(); alpar@25: checkConcept, ForkMap >(); alpar@25: checkConcept, alpar@25: ForkWriteMap >(); alpar@25: alpar@25: checkConcept, ComposeMap > >(); alpar@25: alpar@25: checkConcept, FunctorMap >(); alpar@25: alpar@25: checkConcept, NotMap >(); alpar@25: checkConcept, NotWriteMap >(); alpar@25: alpar@25: checkConcept, StoreBoolMap >(); alpar@25: checkConcept, BackInserterBoolMap > >(); alpar@25: checkConcept, FrontInserterBoolMap > >(); alpar@25: checkConcept, InserterBoolMap > >(); alpar@25: checkConcept, FillBoolMap > >(); alpar@25: checkConcept, SettingOrderBoolMap > >(); alpar@25: alpar@25: int a; alpar@25: alpar@25: a=mapFunctor(constMap(2))(A()); alpar@25: check(a==2,"Something is wrong with mapFunctor"); alpar@25: alpar@25: B b; alpar@25: b=functorMap(F())[A()]; alpar@25: alpar@25: a=functorMap(&func)[A()]; alpar@25: check(a==3,"Something is wrong with functorMap"); alpar@25: alpar@25: a=combineMap(constMap(), identityMap(), &binc)[B()]; alpar@25: check(a==4,"Something is wrong with combineMap"); alpar@25: alpar@25: alpar@25: std::cout << __FILE__ ": All tests passed.\n"; alpar@25: alpar@25: return 0; alpar@25: }