KDevelop::ConvenientEmbeddedSetTreeFilterVisitor< Data, Handler, Data2, TreeSet, KeyExtractor, Visitor > Class Template Reference

Same as above, except that it visits all filtered items with a visitor, instead of iterating over them. More...

#include <convenientfreelist.h>

Inheritance diagram for KDevelop::ConvenientEmbeddedSetTreeFilterVisitor< Data, Handler, Data2, TreeSet, KeyExtractor, Visitor >:

[legend]

List of all members.

Public Types
typedef QPair< QPair< uint, uint >, typename TreeSet::Node >	Bounds
Public Member Functions
	ConvenientEmbeddedSetTreeFilterVisitor (Visitor &visitor, const ConvenientEmbeddedSetIterator< Data, Handler > &base, const TreeSet &rhs, bool noFiltering=false)

---

Detailed Description

template<class Data, class Handler, class Data2, class TreeSet, class KeyExtractor, class Visitor>
class KDevelop::ConvenientEmbeddedSetTreeFilterVisitor< Data, Handler, Data2, TreeSet, KeyExtractor, Visitor >

Same as above, except that it visits all filtered items with a visitor, instead of iterating over them.

This is more efficient. The visiting is done directly from within the constructor.

Definition at line 505 of file convenientfreelist.h.

---

Constructor & Destructor Documentation

template<class Data , class Handler , class Data2 , class TreeSet , class KeyExtractor , class Visitor >

KDevelop::ConvenientEmbeddedSetTreeFilterVisitor< Data, Handler, Data2, TreeSet, KeyExtractor, Visitor >::ConvenientEmbeddedSetTreeFilterVisitor	(	Visitor &	visitor,
		const ConvenientEmbeddedSetIterator< Data, Handler > &	base,
		const TreeSet &	rhs,
		bool	noFiltering = false
	)			[inline]

Parameters:

noFiltering

whether the given input is pre-filtered. If this is true, base will be iterated without skipping any items.

Definition at line 523 of file convenientfreelist.h.

---

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

• convenientfreelist.h