#include <hamiltonian_path.h>
|
typedef Integer | IntegerType |
| Make this visible to classes using this class.
|
|
|
static Set | FullSet (Integer card) |
|
static Set | Singleton (Integer n) |
| Returns the singleton set with 'n' as its only element.
|
|
|
static constexpr Integer | One = static_cast<Integer>(1) |
| Useful constants.
|
|
static constexpr Integer | Zero = static_cast<Integer>(0) |
|
static const int | MaxCardinality = 8 * sizeof(Integer) |
|
template<typename Integer>
class operations_research::Set< Integer >
Definition at line 126 of file hamiltonian_path.h.
◆ IntegerType
template<typename Integer >
◆ Set()
template<typename Integer >
◆ AddElement()
template<typename Integer >
Returns a set equal to the calling object, with element n added. If n is already in the set, no operation occurs.
Definition at line 154 of file hamiltonian_path.h.
◆ begin()
template<typename Integer >
◆ Cardinality() [1/2]
template<typename Integer >
Returns the number of elements in the set. Uses the 32-bit version for types that have 32-bits or less. Specialized for uint64_t.
Definition at line 170 of file hamiltonian_path.h.
◆ Cardinality() [2/2]
◆ Contains()
template<typename Integer >
◆ ElementRank()
template<typename Integer >
Returns the rank of an element in a set. For the set 11100, ElementRank(4) would return 2. (Ranks start at zero).
Definition at line 182 of file hamiltonian_path.h.
◆ end()
template<typename Integer >
◆ FullSet()
template<typename Integer >
◆ Includes()
template<typename Integer >
Returns true if 'other' is included in the calling set.
Definition at line 164 of file hamiltonian_path.h.
◆ operator!=()
template<typename Integer >
◆ RemoveElement()
template<typename Integer >
Returns a set equal to the calling object, with element n removed. If n is not in the set, no operation occurs.
Definition at line 158 of file hamiltonian_path.h.
◆ RemoveSmallestElement()
template<typename Integer >
Returns a set equal to the calling object, with its smallest element removed.
Definition at line 178 of file hamiltonian_path.h.
◆ Singleton()
template<typename Integer >
Returns the singleton set with 'n' as its only element.
Definition at line 150 of file hamiltonian_path.h.
◆ SingletonRank()
template<typename Integer >
◆ SmallestElement() [1/2]
template<typename Integer >
Returns the index of the smallest element in the set. Uses the 32-bit version for types that have 32-bits or less. Specialized for uint64_t.
Definition at line 174 of file hamiltonian_path.h.
◆ SmallestElement() [2/2]
◆ SmallestSingleton()
template<typename Integer >
Returns the set consisting of the smallest element of the calling object.
Definition at line 188 of file hamiltonian_path.h.
◆ value()
template<typename Integer >
◆ MaxCardinality
template<typename Integer >
◆ One
template<typename Integer >
◆ Zero
template<typename Integer >
The documentation for this class was generated from the following file: