// Copyright (c) 2010-2011 CNRS and LIRIS' Establishments (France). // All rights reserved. // // This file is part of CGAL (www.cgal.org) // // $URL: https://github.com/CGAL/cgal/blob/v5.2/Combinatorial_map/include/CGAL/Combinatorial_map_min_items.h $ // $Id: Combinatorial_map_min_items.h 52164b1 2019-10-19T15:34:59+02:00 Sébastien Loriot // SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial // // Author(s) : Guillaume Damiand // #ifndef CGAL_COMBINATORIAL_MAP_MIN_ITEMS_H #define CGAL_COMBINATORIAL_MAP_MIN_ITEMS_H 1 #if defined(CGAL_CMAP_DART_DEPRECATED) && !defined(CGAL_NO_DEPRECATED_CODE) #include #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 CGAL_DEPRECATED 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 std::tuple<> Attributes; }; }; } // namespace CGAL #endif // defined(CGAL_CMAP_DART_DEPRECATED) && !defined(CGAL_NO_DEPRECATED_CODE) #endif // CGAL_COMBINATORIAL_MAP_MIN_ITEMS_H // // EOF //