// Copyright (c) 2010-2011 CNRS and LIRIS' Establishments (France). // All rights reserved. // // This file is part of CGAL (www.cgal.org); you can redistribute it and/or // modify it under the terms of the GNU Lesser General Public License as // published by the Free Software Foundation; either version 3 of the License, // or (at your option) any later version. // // Licensees holding a valid commercial license may use this file in // accordance with the commercial license agreement provided with the software. // // This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE // WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. // // $URL$ // $Id$ // // Author(s) : Guillaume Damiand // #ifndef CGAL_COMBINATORIAL_MAP_MIN_ITEMS_H #define CGAL_COMBINATORIAL_MAP_MIN_ITEMS_H 1 #include namespace CGAL { /** @file Combinatorial_map_min_items.h * Definition of min item class for dD combinatorial map. */ /** Minimal items for dD combinatorial map. * Combinatorial_map_min_items defines what is the minimal item * class for a d-map It provides definitions for darts without attribute. */ template struct Combinatorial_map_min_items { /// Dart_wrapper defines the type of darts used, and enabled attributes. template < class Refs > struct Dart_wrapper { typedef CGAL::Dart< d, Refs > Dart; typedef CGAL::cpp11::tuple<> Attributes; }; }; } // namespace CGAL #endif // CGAL_COMBINATORIAL_MAP_MIN_ITEMS_H // // EOF //