| 729 | |
| 730 | template<class Data, class Handler> |
| 731 | ConvenientEmbeddedSetIterator<Data, Handler> ConstantConvenientEmbeddedSet<Data, Handler>::iterator() const |
| 732 | { |
| 733 | return ConvenientEmbeddedSetIterator<Data, Handler>(m_data, m_dataSize, m_centralFreeItem); |
| 734 | } |
| 735 | |
| 736 | ///This is a simple set implementation based on the embedded free tree algorithms. |
| 737 | ///The core advantage of the whole thing is that the wole set is represented by a consecutive |
no outgoing calls