Iterator to lazely get elements of a set intersection. More...
#include <setop.h>
Public Member Functions | |
| iterator (const S1 &s1, const S2 &s2) | |
| iterator (const typename S1::const_iterator &i1, const typename S2::const_iterator &i2) | |
| const S1::key_type | operator* () const |
| iterator & | operator++ () |
| iterator | operator++ (int) |
| bool | operator== (const iterator &rhs) const |
| bool | operator!= (const iterator &rhs) const |
| void | find () |
| void | next () |
Public Attributes | |
| S1::const_iterator | i1 |
| S1::const_iterator | i1_end |
| S2::const_iterator | i2 |
| S2::const_iterator | i2_end |
| S1::key_compare | lt |
Iterator to lazely get elements of a set intersection.
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
| S1::const_iterator reflex::lazy_intersection< S1, S2 >::iterator::i1 |
| S1::const_iterator reflex::lazy_intersection< S1, S2 >::iterator::i1_end |
| S2::const_iterator reflex::lazy_intersection< S1, S2 >::iterator::i2 |
| S2::const_iterator reflex::lazy_intersection< S1, S2 >::iterator::i2_end |
| S1::key_compare reflex::lazy_intersection< S1, S2 >::iterator::lt |