Map from edge (expressed as its endpoints) to value. For easier forward declaration it is currently implemented as a separate class rather than a template alias. More...
Additional Inherited Members | |
 Public Types inherited from HashTable< T, edge, Hash< edge > > | |
| typedef HashTable< T, Key, Hash > | this_type |
| typedef Key | key_type |
| typedef T | mapped_type |
| typedef T | value_type |
| typedef Hash | hasher |
| typedef T * | pointer |
| typedef T & | reference |
| typedef label | difference_type |
| typedef label | size_type |
| using | key_iterator = key_iterator_base< iterator > |
| using | const_key_iterator = key_iterator_base< const_iterator > |
| Public Member Functions inherited from HashTable< T, edge, Hash< edge > > | |
| HashTable () | |
| HashTable (const label size) | |
| HashTable (Istream &is, const label size=128) | |
| HashTable (const this_type &ht) | |
| HashTable (this_type &&rhs) | |
| HashTable (std::initializer_list< std::pair< Key, T >> list) | |
| ~HashTable () | |
| label | capacity () const noexcept |
| label | size () const noexcept |
| bool | empty () const noexcept |
| T & | at (const Key &key) |
| const T & | at (const Key &key) const |
| bool | found (const Key &key) const |
| iterator | find (const Key &key) |
| const_iterator | find (const Key &key) const |
| const_iterator | cfind (const Key &key) const |
| const T & | lookup (const Key &key, const T &deflt) const |
| List< Key > | toc () const |
| List< Key > | sortedToc () const |
| List< Key > | sortedToc (const Compare &comp) const |
| Foam::List< Key > | sortedToc (const Compare &comp) const |
| List< Key > | tocKeys (const UnaryPredicate &pred, const bool invert=false) const |
| Foam::List< Key > | tocKeys (const UnaryPredicate &pred, const bool invert) const |
| List< Key > | tocValues (const UnaryPredicate &pred, const bool invert=false) const |
| Foam::List< Key > | tocValues (const UnaryPredicate &pred, const bool invert) const |
| List< Key > | tocEntries (const BinaryPredicate &pred, const bool invert=false) const |
| Foam::List< Key > | tocEntries (const BinaryPredicate &pred, const bool invert) const |
| label | countKeys (const UnaryPredicate &pred, const bool invert=false) const |
| Foam::label | countKeys (const UnaryPredicate &pred, const bool invert) const |
| label | countValues (const UnaryPredicate &pred, const bool invert=false) const |
| Foam::label | countValues (const UnaryPredicate &pred, const bool invert) const |
| label | countEntries (const BinaryPredicate &pred, const bool invert=false) const |
| Foam::label | countEntries (const BinaryPredicate &pred, const bool invert) const |
| bool | emplace (const Key &key, Args &&... args) |
| bool | emplace_set (const Key &key, Args &&... args) |
| bool | insert (const Key &key, const T &obj) |
| bool | insert (const Key &key, T &&obj) |
| bool | set (const Key &key, const T &obj) |
| bool | set (const Key &key, T &&obj) |
| bool | erase (const iterator &iter) |
| bool | erase (const Key &key) |
| label | erase (const HashTable< AnyType, Key, AnyHash > &other) |
| label | erase (std::initializer_list< Key > keys) |
| label | erase (InputIter first, InputIter last) |
| label | erase (const FixedList< Key, N > &keys) |
| label | erase (const UList< Key > &keys) |
| Foam::label | erase (InputIter first, InputIter last) |
| Foam::label | erase (const FixedList< Key, N > &keys) |
| Foam::label | erase (const HashTable< AnyType, Key, AnyHash > &other) |
| label | retain (const HashTable< AnyType, Key, AnyHash > &other) |
| Foam::label | retain (const HashTable< AnyType, Key, AnyHash > &other) |
| label | filterKeys (const UnaryPredicate &pred, const bool pruning=false) |
| Foam::label | filterKeys (const UnaryPredicate &pred, const bool pruning) |
| label | filterValues (const UnaryPredicate &pred, const bool pruning=false) |
| Foam::label | filterValues (const UnaryPredicate &pred, const bool pruning) |
| label | filterEntries (const BinaryPredicate &pred, const bool pruning=false) |
| Foam::label | filterEntries (const BinaryPredicate &pred, const bool pruning) |
| void | resize (const label sz) |
| void | clear () |
| void | clearStorage () |
| void | swap (HashTable< T, Key, Hash > &rhs) |
| void | transfer (HashTable< T, Key, Hash > &rhs) |
| T & | operator[] (const Key &key) |
| const T & | operator[] (const Key &key) const |
| T & | operator() (const Key &key) |
| T & | operator() (const Key &key, const T &deflt) |
| void | operator= (const this_type &rhs) |
| void | operator= (std::initializer_list< std::pair< Key, T >> rhs) |
| void | operator= (this_type &&rhs) |
| bool | operator== (const this_type &rhs) const |
| bool | operator!= (const this_type &rhs) const |
| this_type & | operator+= (const this_type &rhs) |
| const_iterator_pair< const_key_iterator, this_type > | keys () const |
| iterator | begin () |
| const_iterator | begin () const |
| const_iterator | cbegin () const |
| iterator | end () noexcept |
| const_iterator | end () const noexcept |
| constexpr const_iterator | cend () const noexcept |
| Ostream & | printInfo (Ostream &os) const |
| Ostream & | writeKeys (Ostream &os, const label shortLen=0) const |
| Public Attributes inherited from HashTable< T, edge, Hash< edge > > | |
| const typedef T * | const_pointer |
| const typedef T & | const_reference |
| Protected Member Functions inherited from HashTable< T, edge, Hash< edge > > | |
| bool | iterator_erase (node_type *&entry, label &index) |
Map from edge (expressed as its endpoints) to value. For easier forward declaration it is currently implemented as a separate class rather than a template alias.
Copyright © 2011-2018 OpenFOAM | OPENFOAM® is a registered trademark of OpenCFD Ltd.
Generated by
1.8.17
