Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
HashIterator2D.h
Go to the documentation of this file.
1
34#pragma once
35
36#include <ogdf/basic/tuples.h>
37
38namespace ogdf {
39
40
45template<class I1_, class I2_, class E_, class Hash1_ = DefHashFunc<I1_>, class Hash2_ = DefHashFunc<I2_>>
47 : private HashConstIterator<Tuple2<I1_, I2_>, E_, HashFuncTuple<I1_, I2_, Hash1_, Hash2_>> {
48public:
51
55
60
68
73
79
85
90
96};
97
98}
Const-iterator for 2D-hash arrays.
bool valid() const
Returns true iff the iterator points to an element.
const I2_ & key2() const
Returns the second key of the hash element pointed to.
const E_ & info() const
Returns the information of the element pointed to.
HashConstIterator2D()
Creates an (invalid) iterator.
HashConstIterator2D< I1_, I2_, E_, Hash1_, Hash2_ > & operator++()
Sets the iterator to the next element in the 2D-hash array.
const I1_ & key1() const
Returns the first key of the hash element pointed to.
HashConstIterator2D(const HashConstIterator< Tuple2< I1_, I2_ >, E_, HashFuncTuple< I1_, I2_, Hash1_, Hash2_ > > &it)
Copy constructor (from HashConstIterator).
HashConstIterator2D< I1_, I2_, E_, Hash1_, Hash2_ > & operator=(const HashConstIterator2D< I1_, I2_, E_, Hash1_, Hash2_ > &it)
Assignemnt operator.
HashConstIterator2D(const HashConstIterator2D< I1_, I2_, E_, Hash1_, Hash2_ > &it)
Copy constructor.
Iterators for hash tables.
Definition Hashing.h:429
const K & key() const
Returns the key of the hash element pointed to.
Definition Hashing.h:459
Tuples of two elements (2-tuples).
Definition tuples.h:46
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.
Declaration and implementation of class Tuple2, Tuple3 and Tuple4.