Implementing custom STL-like data structures

I have already implemented and tested the data structure and now I would like to make it compatible with the collection of STL algorithms. Recommendations for implementing a custom iterator and the like. In particular:

  • What is the minimum set of operations that need to be supported? (eg, ++, +=, ==, !=?)
  • Are there any properties of these operations expected by the algorithms?

Ideally, these answers will be part of a more detailed help for implementing an STL-compatible data structure, but I'm not sure if such a document exists.

+3
source share
1 answer

SGI STL. STL, iterators.

, : , , , . .

+5

Source: https://habr.com/ru/post/1750872/


All Articles