iterator container::end() //returns an iterator that points at the end, useful for...
bool iterator::operator==(const iterator &in) //checking if your iterator equals end
bool iterator::IsEnd() //check it with 1 c++ function call and no need for creating another iterator object
bool container::erase(const iterator &in) //erase at iterator, returns true if something was erased (if iterator was not end)
size_t container::erase(const iterator_range_begin &in,const iterator_range_end &in) //erase a range, returns amount of things erased
//non map containers
iterator container::find_iterator(const value &in) //find that returns an iterator, returns end if not found
//vector and list
void container::insert(const iterator &in, const value &in) //insert before iterator, using end iterator will insert at the end
//map / uo_map
iterator container::find_iterator(const key &in) //find that returns an iterator, returns end if not found
.
As usual, you can change all the names in the config. If you don't like the nonstandard "value find(value,bool& success", you can name that to "nonstd_find" and name "find_iterator" to just "find".
No reverse iterators yet.