Bit_Matrix_defs.hh

Go to the documentation of this file.

/* Bit_Matrix 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_Bit_Matrix_defs_hh
#define PPL_Bit_Matrix_defs_hh 1

#include "Bit_Matrix_types.hh"
#include "Linear_System_types.hh"
#include "Bit_Row_defs.hh"
#include <vector>
#include <iosfwd>

namespace Parma_Polyhedra_Library {

#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS

void swap(Bit_Matrix& x, Bit_Matrix& y);
#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)

} // namespace Parma_Polyhedra_Library

#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS

#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
class Parma_Polyhedra_Library::Bit_Matrix {
public:
  Bit_Matrix();

  Bit_Matrix(dimension_type n_rows, dimension_type n_columns);

  Bit_Matrix(const Bit_Matrix& y);

  ~Bit_Matrix();

  Bit_Matrix& operator=(const Bit_Matrix& y);

  void m_swap(Bit_Matrix& y);

  Bit_Row& operator[](dimension_type k);

  const Bit_Row& operator[](dimension_type k) const;

  void clear();

  void transpose();

  void transpose_assign(const Bit_Matrix& y);

  static dimension_type max_num_rows();

  dimension_type num_columns() const;

  dimension_type num_rows() const;

  void sort_rows();


  bool sorted_contains(const Bit_Row& row) const;


  void add_recycled_row(Bit_Row& row);

  void remove_trailing_rows(dimension_type n);


  void remove_trailing_columns(dimension_type n);

  void resize(dimension_type new_n_rows, dimension_type new_n_columns);

  bool OK() const;

  PPL_OUTPUT_DECLARATIONS

  bool ascii_load(std::istream& s);

  memory_size_type total_memory_in_bytes() const;

  memory_size_type external_memory_in_bytes() const;

#ifndef NDEBUG
  bool check_sorted() const;
#endif

private:
  std::vector<Bit_Row> rows;

  dimension_type row_size;


  struct Bit_Row_Less_Than {
    bool operator()(const Bit_Row& x, const Bit_Row& y) const;
  };

  template <typename Row>
  friend class Parma_Polyhedra_Library::Linear_System;
};

namespace Parma_Polyhedra_Library {

#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS

#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
bool operator==(const Bit_Matrix& x, const Bit_Matrix& y);

#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS

#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS)
bool operator!=(const Bit_Matrix& x, const Bit_Matrix& y);

} // namespace Parma_Polyhedra_Library

#include "Bit_Matrix_inlines.hh"

#endif // !defined(PPL_Bit_Matrix_defs_hh)