permlib::partition::Partition Class Reference

partition More...

#include <partition.h>

List of all members.

Public Types

typedef std::vector< ulong >
::const_iterator 
CellIt
typedef std::vector< ulong >
::const_iterator 
CellIt

Public Member Functions

 Partition (ulong n)
 constructs an empty partition of length n
template<class ForwardIterator >
bool intersect (ForwardIterator begin, ForwardIterator end, uint j)
 intersects the j-th cell of this partition with a given set
bool undoIntersection ()
 reverts the last intersection if there is one
template<class ForwardIterator >
bool intersects (ForwardIterator begin, ForwardIterator end, uint j) const
uint fixPointsSize () const
 number of fix points in this partition
std::vector< ulong >
::const_iterator 
fixPointsBegin () const
 iterator to the begin of fix points
std::vector< ulong >
::const_iterator 
fixPointsEnd () const
 iterator to the end of fix points
ulong cells () const
 number of cells in this partition
ulong cellSize (uint c) const
 size of the c-th cell
CellIt cellBegin (ulong cell) const
CellIt cellEnd (ulong cell) const
 Partition (ulong n)
 constructs an empty partition of length n
template<class ForwardIterator >
bool intersect (ForwardIterator begin, ForwardIterator end, uint j)
 intersects the j-th cell of this partition with a given set
bool undoIntersection ()
 reverts the last intersection if there is one
template<class ForwardIterator >
bool intersects (ForwardIterator begin, ForwardIterator end, uint j) const
uint fixPointsSize () const
 number of fix points in this partition
std::vector< ulong >
::const_iterator 
fixPointsBegin () const
 iterator to the begin of fix points
std::vector< ulong >
::const_iterator 
fixPointsEnd () const
 iterator to the end of fix points
ulong cells () const
 number of cells in this partition
ulong cellSize (uint c) const
 size of the c-th cell
CellIt cellBegin (ulong cell) const
CellIt cellEnd (ulong cell) const

Friends

class BacktrackRefinement
std::ostream & operator<< (std::ostream &out, const Partition &p)
std::ostream & operator<< (std::ostream &out, const Partition &p)

Detailed Description

partition


Member Function Documentation

template<class ForwardIterator >
bool permlib::partition::Partition::intersect ( ForwardIterator  begin,
ForwardIterator  end,
uint  j 
) [inline]

intersects the j-th cell of this partition with a given set

See also:
intersects
Parameters:
begin begin iterator(ulong) to a sorted list of elements
end end iterator(ulong) to a sorted list of elements
j 
Returns:
true if intersection really splits the j-th cell
template<class ForwardIterator >
bool permlib::partition::Partition::intersect ( ForwardIterator  begin,
ForwardIterator  end,
uint  j 
) [inline]

intersects the j-th cell of this partition with a given set

ASSUME INPUT IS SORTED!!!

See also:
intersects
Parameters:
begin begin iterator(ulong) to a sorted list of elements
end end iterator(ulong) to a sorted list of elements
j 
Returns:
true if intersection really splits the j-th cell
template<class ForwardIterator >
bool permlib::partition::Partition::intersects ( ForwardIterator  begin,
ForwardIterator  end,
uint  j 
) const [inline]

returns true iff given set actually intersects j-th cell of this partition

See also:
intersect
template<class ForwardIterator >
bool permlib::partition::Partition::intersects ( ForwardIterator  begin,
ForwardIterator  end,
uint  j 
) const [inline]

returns true iff given set actually intersects j-th cell of this partition

See also:
intersect

The documentation for this class was generated from the following files:
Generated on Fri Jun 18 22:00:24 2010 for PermLib by  doxygen 1.6.3