// Copyright (c) 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$ // SPDX-License-Identifier: LGPL-3.0+ // // Author(s) : Guillaume Damiand // #ifndef CGAL_LINEAR_CELL_COMPLEX_H #define CGAL_LINEAR_CELL_COMPLEX_H 1 #include #include #include #include #include namespace CGAL { /** @file Linear_cell_complex.h * Definition of a linear cell complex, i.e. a combinatorial map with points * associated to all vertices. Deprecated class. */ #if !defined(CGAL_NO_DEPRECATED_CODE) template < unsigned int d_, unsigned int ambient_dim = d_, class Traits_ = Linear_cell_complex_traits, #if defined(CGAL_CMAP_DART_DEPRECATED) class Items_ = Linear_cell_complex_min_items, #else class Items_ = Linear_cell_complex_min_items, #endif class Alloc_ = CGAL_ALLOCATOR(int), template class CMap = Combinatorial_map_base, class Storage_ = CMap_linear_cell_complex_storage_1 > class CGAL_DEPRECATED Linear_cell_complex: public Linear_cell_complex_for_combinatorial_map {}; #endif } // namespace CGAL #endif // CGAL_LINEAR_CELL_COMPLEX_H // // EOF //