Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
ogdf::AdjEntryArray< T > Class Template Reference

Dynamic arrays indexed with adjacency entries. More...

#include <ogdf/basic/AdjEntryArray.h>

+ Inheritance diagram for ogdf::AdjEntryArray< T >:

Public Types

using const_iterator = internal::GraphArrayConstIterator< AdjEntryArray< T > >
 The type for adjEntry array const iterators.
 
using iterator = internal::GraphArrayIterator< AdjEntryArray< T > >
 The type for adjEntry array iterators.
 
using key_type = adjEntry
 The type for array keys.
 
using value_type = T
 The type for array entries.
 

Public Member Functions

 AdjEntryArray ()
 Constructs an empty adjacency entry array associated with no graph.
 
 AdjEntryArray (AdjEntryArray< T > &&A)
 Constructs an adjacency entry array containing the elements of A (move semantics).
 
 AdjEntryArray (const AdjEntryArray< T > &A)
 Constructs an adjacency entry array that is a copy of A.
 
 AdjEntryArray (const Graph &G)
 Constructs an adjacency entry array associated with G.
 
 AdjEntryArray (const Graph &G, const T &x)
 Constructs an adjacency entry array associated with G.
 
Access methods

These methods provide access to elements, size, and corresponding graph.

bool valid () const
 Returns true iff the array is associated with a graph.
 
const GraphgraphOf () const
 Returns a pointer to the associated graph.
 
const T & operator[] (adjEntry adj) const
 Returns a reference to the element with index adj.
 
T & operator[] (adjEntry adj)
 Returns a reference to the element with index adj.
 
const T & operator() (adjEntry adj) const
 Returns a reference to the element with index adj.
 
T & operator() (adjEntry adj)
 Returns a reference to the element with index adj.
 
Iterators

These methods return bidirectional iterators to elements in the array.

iterator begin ()
 Returns an iterator to the first entry in the array.
 
const_iterator begin () const
 Returns a const iterator to the first entry in the array.
 
const_iterator cbegin () const
 Returns a const iterator to the first entry in the array.
 
iterator end ()
 Returns an iterator to one-past-last entry in the array.
 
const_iterator end () const
 Returns a const iterator to one-past-last entry in the array.
 
const_iterator cend () const
 Returns a const iterator to one-past-last entry in the array.
 
Initialization and assignment

These methods can be used to reinitialize the array, or to initialize all elements with a given value.

void init ()
 Reinitializes the array. Associates the array with no graph.
 
void init (const Graph &G)
 Reinitializes the array. Associates the array with G.
 
void init (const Graph &G, const T &x)
 Reinitializes the array. Associates the array with G.
 
void fill (const T &x)
 Sets all array elements to x.
 
AdjEntryArray< T > & operator= (const AdjEntryArray< T > &A)
 Assignment operator.
 
AdjEntryArray< T > & operator= (AdjEntryArray< T > &&a)
 Assignment operator (move semantics).
 

Static Public Member Functions

Helper functions

These methods are mainly intended for internal use.

static adjEntry findSuccKey (adjEntry adj)
 Returns the key succeeding adj.
 
static adjEntry findPredKey (adjEntry adj)
 Returns the key preceeding adj.
 

Private Member Functions

virtual void disconnect ()
 Virtual function called when array is disconnected from the graph.
 
virtual void enlargeTable (int newTableSize)
 Virtual function called when table size has to be enlarged.
 
adjEntry findFirstKey () const
 Returns the first key (adjacency entry in the graph).
 
adjEntry findLastKey () const
 Returns the last key (adjacency entry in the graph).
 
virtual void reinit (int initTableSize)
 Virtual function called when table has to be reinitialized.
 
virtual void resetIndex (int newIndex, int oldIndex)
 Virtual function called when the index of an adjacency entry is changed.
 
- Private Member Functions inherited from ogdf::Array< T >
 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.
 

Private Attributes

m_x
 The default value for array elements.
 

Additional Inherited Members

- Protected Member Functions inherited from ogdf::AdjEntryArrayBase
 AdjEntryArrayBase ()
 Initializes an adjacency entry array not associated with a graph.
 
 AdjEntryArrayBase (AdjEntryArrayBase &base)
 Moves adjacency entry array base to this adjacency entry array.
 
 AdjEntryArrayBase (const Graph *pG)
 Initializes an adjacency entry array associated with pG.
 
virtual ~AdjEntryArrayBase ()
 Destructor, unregisters the array.
 
void moveRegister (AdjEntryArrayBase &base)
 Moves array registration from base to this array.
 
void reregister (const Graph *pG)
 Associates the array with a new graph.
 
- Protected Attributes inherited from ogdf::AdjEntryArrayBase
const Graphm_pGraph
 The associated graph.
 
- Private Types inherited from ogdf::Array< T >
using const_iterator = ArrayConstIterator< T >
 Provides a random-access iterator that can read a const element in an array.
 
using const_reference = const T &
 Provides a reference to a const element stored in an array for reading and performing const operations.
 
using const_reverse_iterator = ArrayConstReverseIterator< T >
 Provides a reverse random-access iterator that can read a const element in an array.
 
using iterator = ArrayIterator< T >
 Provides a random-access iterator that can read or modify any element in an array.
 
using reference = T &
 Provides a reference to an element stored in an array.
 
using reverse_iterator = ArrayReverseIterator< T >
 Provides a reverse random-access iterator that can read or modify any element in an array.
 
using value_type = T
 Represents the data type stored in an array element.
 
- Static Private Attributes inherited from ogdf::Array< T >
static const int maxSizeInsertionSort
 Threshold used by quicksort() such that insertion sort is called for instances smaller than maxSizeInsertionSort.
 

Detailed Description

template<class T>
class ogdf::AdjEntryArray< T >

Dynamic arrays indexed with adjacency entries.

Adjacency entry arrays represent a mapping from adjacency entries to data of type T. They adjust their table size automatically when the graph grows.

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:
auto tmp = RHS; LHS = std::move(tmp);
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
Template Parameters
Tis the element type.

Definition at line 127 of file AdjEntryArray.h.

Member Typedef Documentation

◆ const_iterator

The type for adjEntry array const iterators.

Definition at line 139 of file AdjEntryArray.h.

◆ iterator

The type for adjEntry array iterators.

Definition at line 137 of file AdjEntryArray.h.

◆ key_type

template<class T >
using ogdf::AdjEntryArray< T >::key_type = adjEntry

The type for array keys.

Definition at line 132 of file AdjEntryArray.h.

◆ value_type

template<class T >
using ogdf::AdjEntryArray< T >::value_type = T

The type for array entries.

Definition at line 134 of file AdjEntryArray.h.

Constructor & Destructor Documentation

◆ AdjEntryArray() [1/5]

template<class T >
ogdf::AdjEntryArray< T >::AdjEntryArray ( )
inline

Constructs an empty adjacency entry array associated with no graph.

Definition at line 142 of file AdjEntryArray.h.

◆ AdjEntryArray() [2/5]

template<class T >
ogdf::AdjEntryArray< T >::AdjEntryArray ( const Graph G)
inlineexplicit

Constructs an adjacency entry array associated with G.

Definition at line 145 of file AdjEntryArray.h.

◆ AdjEntryArray() [3/5]

template<class T >
ogdf::AdjEntryArray< T >::AdjEntryArray ( const Graph G,
const T &  x 
)
inline

Constructs an adjacency entry array associated with G.

Parameters
Gis the associated graph.
xis the default value for all array elements.

Definition at line 153 of file AdjEntryArray.h.

◆ AdjEntryArray() [4/5]

template<class T >
ogdf::AdjEntryArray< T >::AdjEntryArray ( const AdjEntryArray< T > &  A)
inline

Constructs an adjacency entry array that is a copy of A.

Associates the array with the same graph as A and copies all elements.

Definition at line 160 of file AdjEntryArray.h.

◆ AdjEntryArray() [5/5]

template<class T >
ogdf::AdjEntryArray< T >::AdjEntryArray ( AdjEntryArray< T > &&  A)
inline

Constructs an adjacency entry array containing the elements of A (move semantics).

Adjacency entry array A is empty afterwards and not associated with any graph.

Definition at line 167 of file AdjEntryArray.h.

Member Function Documentation

◆ begin() [1/2]

template<class T >
iterator ogdf::AdjEntryArray< T >::begin ( )
inline

Returns an iterator to the first entry in the array.

If the array is empty, a null pointer iterator is returned.

Definition at line 221 of file AdjEntryArray.h.

◆ begin() [2/2]

template<class T >
const_iterator ogdf::AdjEntryArray< T >::begin ( ) const
inline

Returns a const iterator to the first entry in the array.

If the array is empty, a null pointer iterator is returned.

Definition at line 227 of file AdjEntryArray.h.

◆ cbegin()

template<class T >
const_iterator ogdf::AdjEntryArray< T >::cbegin ( ) const
inline

Returns a const iterator to the first entry in the array.

If the array is empty, a null pointer iterator is returned.

Definition at line 233 of file AdjEntryArray.h.

◆ cend()

template<class T >
const_iterator ogdf::AdjEntryArray< T >::cend ( ) const
inline

Returns a const iterator to one-past-last entry in the array.

This is always a null pointer iterator.

Definition at line 251 of file AdjEntryArray.h.

◆ disconnect()

template<class T >
virtual void ogdf::AdjEntryArray< T >::disconnect ( )
inlineprivatevirtual

Virtual function called when array is disconnected from the graph.

Implements ogdf::AdjEntryArrayBase.

Definition at line 373 of file AdjEntryArray.h.

◆ end() [1/2]

template<class T >
iterator ogdf::AdjEntryArray< T >::end ( )
inline

Returns an iterator to one-past-last entry in the array.

This is always a null pointer iterator.

Definition at line 239 of file AdjEntryArray.h.

◆ end() [2/2]

template<class T >
const_iterator ogdf::AdjEntryArray< T >::end ( ) const
inline

Returns a const iterator to one-past-last entry in the array.

This is always a null pointer iterator.

Definition at line 245 of file AdjEntryArray.h.

◆ enlargeTable()

template<class T >
virtual void ogdf::AdjEntryArray< T >::enlargeTable ( int  newTableSize)
inlineprivatevirtual

Virtual function called when table size has to be enlarged.

Implements ogdf::AdjEntryArrayBase.

Definition at line 363 of file AdjEntryArray.h.

◆ fill()

template<class T >
void ogdf::AdjEntryArray< T >::fill ( const T &  x)
inline

Sets all array elements to x.

Definition at line 283 of file AdjEntryArray.h.

◆ findFirstKey()

template<class T >
adjEntry ogdf::AdjEntryArray< T >::findFirstKey ( ) const
inlineprivate

Returns the first key (adjacency entry in the graph).

Definition at line 344 of file AdjEntryArray.h.

◆ findLastKey()

template<class T >
adjEntry ogdf::AdjEntryArray< T >::findLastKey ( ) const
inlineprivate

Returns the last key (adjacency entry in the graph).

Definition at line 354 of file AdjEntryArray.h.

◆ findPredKey()

template<class T >
static adjEntry ogdf::AdjEntryArray< T >::findPredKey ( adjEntry  adj)
inlinestatic

Returns the key preceeding adj.

Definition at line 329 of file AdjEntryArray.h.

◆ findSuccKey()

template<class T >
static adjEntry ogdf::AdjEntryArray< T >::findSuccKey ( adjEntry  adj)
inlinestatic

Returns the key succeeding adj.

Definition at line 317 of file AdjEntryArray.h.

◆ graphOf()

template<class T >
const Graph * ogdf::AdjEntryArray< T >::graphOf ( ) const
inline

Returns a pointer to the associated graph.

Definition at line 180 of file AdjEntryArray.h.

◆ init() [1/3]

template<class T >
void ogdf::AdjEntryArray< T >::init ( )
inline

Reinitializes the array. Associates the array with no graph.

Definition at line 261 of file AdjEntryArray.h.

◆ init() [2/3]

template<class T >
void ogdf::AdjEntryArray< T >::init ( const Graph G)
inline

Reinitializes the array. Associates the array with G.

Definition at line 267 of file AdjEntryArray.h.

◆ init() [3/3]

template<class T >
void ogdf::AdjEntryArray< T >::init ( const Graph G,
const T &  x 
)
inline

Reinitializes the array. Associates the array with G.

Parameters
Gis the associated graph.
xis the default value.

Definition at line 277 of file AdjEntryArray.h.

◆ operator()() [1/2]

template<class T >
T & ogdf::AdjEntryArray< T >::operator() ( adjEntry  adj)
inline

Returns a reference to the element with index adj.

Definition at line 204 of file AdjEntryArray.h.

◆ operator()() [2/2]

template<class T >
const T & ogdf::AdjEntryArray< T >::operator() ( adjEntry  adj) const
inline

Returns a reference to the element with index adj.

Definition at line 197 of file AdjEntryArray.h.

◆ operator=() [1/2]

template<class T >
AdjEntryArray< T > & ogdf::AdjEntryArray< T >::operator= ( AdjEntryArray< T > &&  a)
inline

Assignment operator (move semantics).

Adjacency entry array a is empty afterwards and not associated with any graph.

Definition at line 302 of file AdjEntryArray.h.

◆ operator=() [2/2]

template<class T >
AdjEntryArray< T > & ogdf::AdjEntryArray< T >::operator= ( const AdjEntryArray< T > &  A)
inline

Assignment operator.

Definition at line 291 of file AdjEntryArray.h.

◆ operator[]() [1/2]

template<class T >
T & ogdf::AdjEntryArray< T >::operator[] ( adjEntry  adj)
inline

Returns a reference to the element with index adj.

Definition at line 190 of file AdjEntryArray.h.

◆ operator[]() [2/2]

template<class T >
const T & ogdf::AdjEntryArray< T >::operator[] ( adjEntry  adj) const
inline

Returns a reference to the element with index adj.

Definition at line 183 of file AdjEntryArray.h.

◆ reinit()

template<class T >
virtual void ogdf::AdjEntryArray< T >::reinit ( int  initTableSize)
inlineprivatevirtual

Virtual function called when table has to be reinitialized.

Implements ogdf::AdjEntryArrayBase.

Definition at line 367 of file AdjEntryArray.h.

◆ resetIndex()

template<class T >
virtual void ogdf::AdjEntryArray< T >::resetIndex ( int  newIndex,
int  oldIndex 
)
inlineprivatevirtual

Virtual function called when the index of an adjacency entry is changed.

Implements ogdf::AdjEntryArrayBase.

Definition at line 369 of file AdjEntryArray.h.

◆ valid()

template<class T >
bool ogdf::AdjEntryArray< T >::valid ( ) const
inline

Returns true iff the array is associated with a graph.

Definition at line 177 of file AdjEntryArray.h.

Member Data Documentation

◆ m_x

template<class T >
T ogdf::AdjEntryArray< T >::m_x
private

The default value for array elements.

Definition at line 128 of file AdjEntryArray.h.


The documentation for this class was generated from the following file: