SubtreeBase< NodeItem, LeafItem, Const >::QueryIterator< I, Key, BoundingFn, TestFn > Class Template Reference

A forward iterator over this type of Subtree, which visits all the nodes which pass the supplied TestFn. More...

#include <geomc/Tree.h>

Inheritance diagram for SubtreeBase< NodeItem, LeafItem, Const >::QueryIterator< I, Key, BoundingFn, TestFn >:

Public Member Functions
	QueryIterator (const I &start, const Key &key, BoundingFn bound, TestFn test)
	Construct a new QueryIterator.
bool	operator!= (const I &other) const
	Return true if this iterator does not point to the subtree at other.
QueryIterator &	operator= (const I &other)
	Find the next result at or beyond the Subtree other.
bool	operator== (const I &other) const
	Return true if this iterator points to the subtree at other.

Friends
class	boost::iterator_core_access

Detailed Description

template<typename NodeItem, typename LeafItem, bool Const = true>
template<typename I, typename Key, typename BoundingFn, typename TestFn>
class geom::SubtreeBase< NodeItem, LeafItem, Const >::QueryIterator< I, Key, BoundingFn, TestFn >

A forward iterator over this type of Subtree, which visits all the nodes which pass the supplied TestFn.

QueryIterator extends iterator_facade and is a forward iterator; as such it supports standard forward iterator semantics and operators like ++i, i->xxx, and *i.

Template Parameters

I	The type of Subtree to visit.
BoundingFn	A callable object which accepts an I and returns true if that Subtree may contain items which pass TestFn.
TestFn	A callable object which accepts an I and returns true if that Subtree should be visited by this QueryIterator.

---

The documentation for this class was generated from the following file:

• geomc/Tree.h