C_Polyhedron_defs.hh

Go to the documentation of this file.

/* C_Polyhedron class declaration.
   Copyright (C) 2001-2010 Roberto Bagnara <bagnara@cs.unipr.it>
   Copyright (C) 2010-2016 BUGSENG srl (http://bugseng.com)

This file is part of the Parma Polyhedra Library (PPL).

The PPL is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by the
Free Software Foundation; either version 3 of the License, or (at your
option) any later version.

The PPL is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
for more details.

You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software Foundation,
Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.

For the most up-to-date information see the Parma Polyhedra Library
site: http://bugseng.com/products/ppl/ . */

#ifndef PPL_C_Polyhedron_defs_hh
#define PPL_C_Polyhedron_defs_hh 1

#include "C_Polyhedron_types.hh"
#include "NNC_Polyhedron_types.hh"
#include "Polyhedron_defs.hh"
#include "Grid_types.hh"
#include "BD_Shape_types.hh"
#include "Octagonal_Shape_types.hh"


class Parma_Polyhedra_Library::C_Polyhedron : public Polyhedron {
public:

  explicit C_Polyhedron(dimension_type num_dimensions = 0,
                        Degenerate_Element kind = UNIVERSE);


  explicit C_Polyhedron(const Constraint_System& cs);


  C_Polyhedron(Constraint_System& cs, Recycle_Input dummy);


  explicit C_Polyhedron(const Generator_System& gs);


  C_Polyhedron(Generator_System& gs, Recycle_Input dummy);


  explicit C_Polyhedron(const Congruence_System& cgs);


  C_Polyhedron(Congruence_System& cgs, Recycle_Input dummy);

  explicit C_Polyhedron(const NNC_Polyhedron& y,
                        Complexity_Class complexity = ANY_COMPLEXITY);


  template <typename Interval>
  explicit C_Polyhedron(const Box<Interval>& box,
                        Complexity_Class complexity = ANY_COMPLEXITY);


  template <typename U>
  explicit C_Polyhedron(const BD_Shape<U>& bd,
                        Complexity_Class complexity = ANY_COMPLEXITY);


  template <typename U>
  explicit C_Polyhedron(const Octagonal_Shape<U>& os,
                        Complexity_Class complexity = ANY_COMPLEXITY);


  explicit C_Polyhedron(const Grid& grid,
                        Complexity_Class complexity = ANY_COMPLEXITY);


  C_Polyhedron(const C_Polyhedron& y,
               Complexity_Class complexity = ANY_COMPLEXITY);

  C_Polyhedron& operator=(const C_Polyhedron& y);

  C_Polyhedron& operator=(const NNC_Polyhedron& y);

  ~C_Polyhedron();

  bool poly_hull_assign_if_exact(const C_Polyhedron& y);

  bool upper_bound_assign_if_exact(const C_Polyhedron& y);

  void positive_time_elapse_assign(const Polyhedron& y);
};

#include "C_Polyhedron_inlines.hh"

#endif // !defined(PPL_C_Polyhedron_defs_hh)