|
| KBiHash () |
|
| KBiHash (const KBiAssociativeContainer< QHash< T, U >, QHash< U, T > > &container) |
|
| KBiAssociativeContainer () |
|
| KBiAssociativeContainer (const KBiAssociativeContainer< QHash< T, U >, QHash< U, T > > &other) |
|
int | capacity () const |
|
void | clear () |
|
left_const_iterator | constFindLeft (left_type t) const |
|
right_const_iterator | constFindRight (right_type u) const |
|
int | count () const |
|
void | detach () |
|
left_iterator | eraseLeft (left_iterator it) |
|
right_iterator | eraseRight (right_iterator it) |
|
left_iterator | findLeft (left_type t) |
|
left_const_iterator | findLeft (left_type t) const |
|
right_iterator | findRight (right_type u) |
|
right_const_iterator | findRight (right_type u) const |
|
left_iterator | insert (left_type t, right_type u) |
|
KBiAssociativeContainer< QHash
< T, U >, QHash< U, T > > & | intersect (const KBiAssociativeContainer< QHash< T, U >, QHash< U, T > > &other) |
|
bool | isDetached () const |
|
bool | isEmpty () const |
|
bool | isSharedWith (const KBiAssociativeContainer< QHash< U, T >, QHash< T, U > > &other) const |
|
left_iterator | leftBegin () |
|
left_const_iterator | leftBegin () const |
|
left_const_iterator | leftConstBegin () const |
|
left_const_iterator | leftConstEnd () const |
|
bool | leftContains (left_type t) const |
|
left_iterator | leftEnd () |
|
left_const_iterator | leftEnd () const |
|
right_type | leftToRight (left_type t) const |
|
QList< left_type > | leftValues () const |
|
bool | operator!= (const KBiAssociativeContainer< QHash< T, U >, QHash< U, T > > &other) |
|
const KBiAssociativeContainer
< QHash< T, U >, QHash< U, T > > & | operator= (const KBiAssociativeContainer< QHash< T, U >, QHash< U, T > > &other) |
|
bool | operator== (const KBiAssociativeContainer< QHash< T, U >, QHash< U, T > > &other) |
|
const right_type | operator[] (const left_type &t) const |
|
bool | removeLeft (left_type t) |
|
bool | removeRight (right_type u) |
|
void | reserve (int size) |
|
right_iterator | rightBegin () |
|
right_const_iterator | rightBegin () const |
|
right_const_iterator | rightConstBegin () const |
|
right_const_iterator | rightConstEnd () const |
|
bool | rightContains (right_type u) const |
|
right_iterator | rightEnd () |
|
right_const_iterator | rightEnd () const |
|
left_type | rightToLeft (right_type u) const |
|
QList< right_type > | rightValues () const |
|
void | setSharable (bool sharable) |
|
int | size () const |
|
void | squeeze () |
|
KBiAssociativeContainer< QHash
< T, U >, QHash< U, T > > & | subtract (const KBiAssociativeContainer< QHash< T, U >, QHash< U, T > > &other) |
|
right_type | takeLeft (left_type t) |
|
left_type | takeRight (right_type u) |
|
left_iterator | toLeftIterator (right_iterator it) const |
|
right_iterator | toRightIterator (left_iterator it) const |
|
KBiAssociativeContainer< QHash
< T, U >, QHash< U, T > > & | unite (const KBiAssociativeContainer< QHash< T, U >, QHash< U, T > > &other) |
|
void | updateLeft (right_iterator it, left_type t) |
|
void | updateRight (left_iterator it, right_type u) |
|
|
typedef QHash< T, U >
::const_iterator | left_const_iterator |
|
typedef _iterator< QHash< T, U > > | left_iterator |
|
typedef QHash< U, T >::mapped_type | left_type |
|
typedef QHash< U, T >
::const_iterator | right_const_iterator |
|
typedef _iterator< QHash< U, T > > | right_iterator |
|
typedef QHash< T, U >::mapped_type | right_type |
|
static KBiAssociativeContainer
< QHash< T, U >, QHash< U, T > > | fromHash (const QHash< left_type, right_type > &hash) |
|
static KBiAssociativeContainer
< QHash< T, U >, QHash< U, T > > | fromMap (const QMap< left_type, right_type > &hash) |
|
QHash< T, U > | _leftToRight |
|
QHash< U, T > | _rightToLeft |
|
template<typename T, typename U>
struct KBiHash< T, U >
KBiHash provides a bi-directional hash container.
- Note
- This class is designed to make mapping easier in proxy model implementations.
- Todo:
- Figure out whether to discard this and use boost::bimap instead, submit it Qt or keep it here and make more direct use of QHashNode.
Definition at line 496 of file kbihash_p.h.