#include <iostream>
#include <vector>
#include "utils.hpp"
Go to the source code of this file.
|
| class | node< X1 > |
| | The node class definition. This is a template of a class whose objects are used to build a tree of relationships between processed data. More...
|
| |
|
| template<class T > |
| std::vector< T >::const_iterator const & | Null_iterator (T) |
| | An iterator that is supposed to point to "nothing" of specified type ;).
|
| |
◆ Null_iterator()
template<class T >
| std::vector< T >::const_iterator const & Null_iterator |
( |
T | | ) |
|
An iterator that is supposed to point to "nothing" of specified type ;).
Since an iterator can never point to nothing (it can never be null - like a raw pointer), this function "emulates" such a case.
It provides an iterator to a vector that contains nothing, that is, to some empty vector of type T .
- Template Parameters
-
- Returns
- std::vector<T>::const_iterator const& - the iterator returned by the begin() function of the empty vector<T>.
Definition at line 20 of file node.hpp.