|
| virtual void | disconnect () |
| | Disconnetion from the hypergraph.
|
| |
| virtual void | enlargeTable (int newTableSize) |
| | Table size enlargement.
|
| |
| virtual void | reinit (int initTableSize) |
| | Table re-initialization.
|
| |
| | Array () |
| | Creates an array with empty index set.
|
| |
| | Array (Array< T, int > &&A) |
| | Creates an array containing the elements of A (move semantics).
|
| |
| | Array (const Array< T, int > &A) |
| | Creates an array that is a copy of A.
|
| |
| | Array (const ArrayBuffer< T, int > &A) |
| | Creates an array that is a copy of A. The array-size is set to be the number of elements (not the capacity) of the buffer.
|
| |
| | Array (int a, int b) |
| | Creates an array with index set [a..b].
|
| |
| | Array (int a, int b, const T &x) |
| | Creates an array with index set [a..b] and initializes each element with x.
|
| |
| | Array (int s) |
| | Creates an array with index set [0..s-1].
|
| |
| | Array (std::initializer_list< T > initList) |
| | Creates an array containing the elements in the initializer list initList.
|
| |
| | ~Array () |
| | Destruction.
|
| |
| int | low () const |
| | Returns the minimal array index.
|
| |
| int | high () const |
| | Returns the maximal array index.
|
| |
| int | size () const |
| | Returns the size (number of elements) of the array.
|
| |
| bool | empty () const |
| | Returns true iff there are no elements in the array.
|
| |
| const_reference | operator[] (int i) const |
| | Returns a reference to the element at position i.
|
| |
| reference | operator[] (int i) |
| | Returns a reference to the element at position i.
|
| |
| iterator | begin () |
| | Returns an iterator to the first element.
|
| |
| const_iterator | begin () const |
| | Returns a const iterator to the first element.
|
| |
| const_iterator | cbegin () const |
| | Returns a const iterator to the first element.
|
| |
| iterator | end () |
| | Returns an iterator to one past the last element.
|
| |
| const_iterator | end () const |
| | Returns a const iterator to one past the last element.
|
| |
| const_iterator | cend () const |
| | Returns a const iterator to one past the last element.
|
| |
| reverse_iterator | rbegin () |
| | Returns an reverse iterator to the last element.
|
| |
| const_reverse_iterator | rbegin () const |
| | Returns a const reverse iterator to the last element.
|
| |
| const_reverse_iterator | crbegin () const |
| | Returns a const reverse iterator to the last element.
|
| |
| reverse_iterator | rend () |
| | Returns an reverse iterator to one before the first element.
|
| |
| const_reverse_iterator | rend () const |
| | Returns a const reverse iterator to one before the first element.
|
| |
| const_reverse_iterator | crend () const |
| | Returns a const reverse iterator to one before the first element.
|
| |
| void | init () |
| | Reinitializes the array to an array with empty index set.
|
| |
| void | init (int s) |
| | Reinitializes the array to an array with index set [0..s-1].
|
| |
| void | init (int a, int b) |
| | Reinitializes the array to an array with index set [a..b].
|
| |
| void | init (int a, int b, const T &x) |
| | Reinitializes the array to an array with index set [a..b] and sets all entries to x.
|
| |
| void | fill (const T &x) |
| | Sets all elements to x.
|
| |
| void | fill (int i, int j, const T &x) |
| | Sets elements in the intervall [i..j] to x.
|
| |
| void | grow (int add, const T &x) |
| | Enlarges the array by add elements and sets new elements to x.
|
| |
| void | grow (int add) |
| | Enlarges the array by add elements.
|
| |
| void | resize (int newSize, const T &x) |
| | Resizes (enlarges or shrinks) the array to hold newSize elements and sets new elements to x.
|
| |
| void | resize (int newSize) |
| | Resizes (enlarges or shrinks) the array to hold newSize elements.
|
| |
| Array< T, int > & | operator= (const Array< T, int > &A) |
| | Assignment operator.
|
| |
| Array< T, int > & | operator= (Array< T, int > &&A) |
| | Assignment operator (move semantics).
|
| |
| bool | operator== (const Array< T, int > &L) const |
| | Equality operator.
|
| |
| bool | operator!= (const Array< T, int > &L) const |
| | Inequality operator.
|
| |
| void | swap (int i, int j) |
| | Swaps the elements at position i and j.
|
| |
| void | permute (int l, int r) |
| | Randomly permutes the subarray with index set [l..r].
|
| |
| void | permute () |
| | Randomly permutes the array.
|
| |
| void | permute (int l, int r, RNG &rng) |
| | Randomly permutes the subarray with index set [l..r] using random number generator rng.
|
| |
| void | permute (RNG &rng) |
| | Randomly permutes the array using random number generator rng.
|
| |
| int | binarySearch (const T &e) const |
| | Performs a binary search for element e.
|
| |
| int | binarySearch (int l, int r, const T &e) const |
| | Performs a binary search for element e within the array section [l, ..., r] .
|
| |
| int | binarySearch (const T &e, const COMPARER &comp) const |
| | Performs a binary search for element e with comparer comp.
|
| |
| int | binarySearch (int l, int r, const T &e, const COMPARER &comp) const |
| | Performs a binary search for element e within the array section [l, ..., r] with comparer comp.
|
| |
| int | linearSearch (const T &e) const |
| | Performs a linear search for element e.
|
| |
| int | linearSearch (const T &e, const COMPARER &comp) const |
| | Performs a linear search for element e with comparer comp.
|
| |
| void | quicksort () |
| | Sorts array using Quicksort.
|
| |
| void | quicksort (int l, int r) |
| | Sorts subarray with index set [l, ..., r] using Quicksort.
|
| |
| void | quicksort (const COMPARER &comp) |
| | Sorts array using Quicksort and a user-defined comparer comp.
|
| |
| void | quicksort (int l, int r, const COMPARER &comp) |
| | Sorts the subarray with index set [l, ..., r] using Quicksort and a user-defined comparer comp.
|
| |
| void | leftShift (ArrayBuffer< int, int > &ind) |
| | Removes the components listed in ind by shifting the remaining components to the left.
|
| |
| void | leftShift (ArrayBuffer< int, int > &ind, const T &val) |
| | Removes the components listed in ind by shifting the remaining components to the left.
|
| |
template<
class T>
class ogdf::HyperedgeArray< T >
Dynamic arrays indexed with nodes.
- Warning
- Undefined behavior can occur when the array is used in the left-hand side of an assignment and the observed graph is changed in the right-hand side. To resolve the issue, use:
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
Definition at line 159 of file HypergraphArray.h.
Inheritance diagram for ogdf::HyperedgeArray< T >:
