|
| Generated on: Thu Mar 29 07:46:58 PDT 2012 for custom file set | ||
|
||
| operations_research::ArrayIndexCycleHandler< DataType, IndexType > | A generic cycle handler class for the common case in which the object to be permuted is indexable with T& operator[](int), and the permutation is represented by a mutable array of nonnegative int-typed index values |
| operations_research::CachedLog | This class is used when manipulating search space estimations |
| operations_research::ConstIntArray | This class is used to store constant copies of int64 arrays |
| operations_research::ConstIntPtrArray< T > | This class is used to store pairs of <T*, int64> |
| operations_research::ConstIntPtrArray< T >::Cell | A cell is used to store pairs of <T, int64> |
| operations_research::ConstIntPtrArray< T >::CompareValuesGT | Comparison helpers. This one sorts in a decreasing way |
| operations_research::ConstIntPtrArray< T >::CompareValuesLT | Comparison helpers. This one sorts in a increasing way |
| operations_research::ConstPtrArray< T > | This class is used to store an const array of T* |
| operations_research::GraphExporter | Export to graph file |
| operations_research::IntTupleSet | Main IntTupleSet class |
| operations_research::MonoidOperationTree< T > | A monoid is an algebraic structure consisting of a set S with an associative binary operation * :S x S -> S that has an identity element |
| operations_research::PermutationApplier< IndexType > | Note that this template is not implemented in an especially performance-sensitive way |
| operations_research::PermutationCycleHandler< IndexType > | Abstract base class template defining the interface needed by PermutationApplier to handle a single cycle of a permutation |
| operations_research::VectorMap< T > | This class stores a vector of distinct elements, as well as a map from elements to index to find the index in the vector |
| operations_research::XmlHelper | Lightweight XML writer that is optimized for CPViz output |
| operations_research::ZVector< T > |