KDE 4.4 API Reference util
KDevelop::ConvenientEmbeddedSetFilterIterator< Data, Handler, Data2, Handler2, KeyExtractor > Class Template Reference
An iterator that allows efficient matching between two lists with different data type. More...
#include <convenientfreelist.h>
Public Member Functions | |
| ConvenientEmbeddedSetFilterIterator (const ConvenientEmbeddedSetIterator< Data, Handler > &base, const ConvenientEmbeddedSetIterator< Data2, Handler2 > &rhs) | |
| operator bool () const | |
| const Data & | operator* () const |
| ConvenientEmbeddedSetFilterIterator & | operator++ () |
| const Data * | operator-> () const |
Detailed Description
template<class Data, class Handler, class Data2, class Handler2, class KeyExtractor>
class KDevelop::ConvenientEmbeddedSetFilterIterator< Data, Handler, Data2, Handler2, KeyExtractor >
An iterator that allows efficient matching between two lists with different data type.
Important: It must be possible to extract the data-type of the second list from the items in the first list The second list must be sorted by that data. The first list must primarily be sorted by that data, but is allowed to be sub-ordered by something else, and multiple items in the first list are allowed to match one item in the second. This iterator iterates through all items in the first list that have extracted key-data that is in represented in the second.
Definition at line 196 of file convenientfreelist.h.
Member Function Documentation
| KDevelop::ConvenientEmbeddedSetFilterIterator< Data, Handler, Data2, Handler2, KeyExtractor >::operator bool | ( | ) | const [inline] |
Returns true of this iterator has a value to return.
Reimplemented from KDevelop::ConvenientEmbeddedSetIterator< Data, Handler >.
Definition at line 205 of file convenientfreelist.h.
The documentation for this class was generated from the following file:
