00001 00002 00003 /* ------------------------------------------------------------ 00004 00005 Copyright (C) 1997 - 2009 Guntram Berti 00006 00007 This file is part of the Grid Algorithms Library (GrAL), 00008 available at http://gral.berti-cmm.de 00009 00010 GrAL is distributed under the MIT license, 00011 see the file LICENSE or http://gral.berti-cmm.de/license 00012 00013 --------------------------------------------------------------- */ 00014 00015 00019 #include "Gral/Grids/Cartesian2D/mapped-geometry.h" 00020 #include "Gral/Grids/Cartesian2D/test-cartesian-geometry2d.h" 00021 00022 #include "Container/functions.h" 00023 #include "Container/tuple.h" 00024 #include "Container/tuple-point-traits.h" 00025 00026 00027 using namespace GrAL; 00028 00029 namespace GrAL { namespace cartesian2d { 00030 typedef tuple<double,2> coord_type; 00031 typedef stdext::identity<coord_type> mapping_type; 00032 00033 template class mapped_geometry<mapping_type>; 00034 }} 00035 00036 int main() { 00037 using namespace std; 00038 using namespace GrAL; 00039 using namespace GrAL::cartesian2d; 00040 00041 typedef grid_types<CartesianGrid2D> gt; 00042 00043 { 00044 cout << "Test grid 1x1 cells \n"; 00045 CartesianGrid2D R(2,2); 00046 mapped_geometry<mapping_type> GeomR(R); 00047 test_cartesian2d_geometry(GeomR, cout); 00048 } 00049 { 00050 cout << "Test grid 2x2 cells \n"; 00051 CartesianGrid2D R(3,3); 00052 mapped_geometry<mapping_type> GeomR(R); 00053 test_cartesian2d_geometry(GeomR, cout); 00054 } 00055 00056 } 00057
1.5.8