208     using iterator = solist_iterator<self_type, value_type>;  variable
210     using local_iterator = iterator;
397     iterator begin() noexcept { return iterator(first_value_node(&my_head)); }  in begin()
401     iterator end() noexcept { return iterator(nullptr); }  in end()
413     std::pair<iterator, bool> insert( const value_type& value ) {  in insert()
417     std::pair<iterator, bool> insert( value_type&& value ) {  in insert()
421     iterator insert( const_iterator, const value_type& value ) {  in insert()
426     iterator insert( const_iterator, value_type&& value ) {  in insert()
442     std::pair<iterator, bool> insert( node_type&& nh ) {  in insert()
456             return { iterator(insert_result.node_with_equal_key), insert_result.inserted };  in insert()
461     iterator insert( const_iterator, node_type&& nh ) {  in insert()
467     std::pair<iterator, bool> emplace( Args&&... args ) {  in emplace()
485         return { iterator(insert_result.node_with_equal_key), insert_result.inserted };  in emplace()
489     iterator emplace_hint( const_iterator, Args&&... args ) {  in emplace_hint()
494     iterator unsafe_erase( const_iterator pos ) {  in unsafe_erase()
495         return iterator(first_value_node(internal_erase(pos.get_node_ptr())));  in unsafe_erase()
498     iterator unsafe_erase( iterator pos ) {  in unsafe_erase()
499         return iterator(first_value_node(internal_erase(pos.get_node_ptr())));  in unsafe_erase()
502     iterator unsafe_erase( const_iterator first, const_iterator last ) {  in unsafe_erase()
506         return iterator(first.get_node_ptr());  in unsafe_erase()
516                             && !std::is_convertible<K, iterator>::value,
527     node_type unsafe_extract( iterator pos ) {  in unsafe_extract()
533         iterator item = find(key);  in unsafe_extract()
540                             && !std::is_convertible<K, iterator>::value,
543         iterator item = find(key);  in unsafe_extract()
548     iterator find( const key_type& key ) {  in find()
550         return result == nullptr ? end() : iterator(result);  in find()
559     typename std::enable_if<is_transparent<K>::value, iterator>::type find( const K& key ) {  in find()
561         return result == nullptr ? end() : iterator(result);  in find()
570     std::pair<iterator, iterator> equal_range( const key_type& key ) {  in equal_range()
572         return std::make_pair(iterator(result.first), iterator(result.second));  in equal_range()
581 …typename std::enable_if<is_transparent<K>::value, std::pair<iterator, iterator>>::type equal_range…  in equal_range()
583         return std::make_pair(iterator(result.first), iterator(result.second));  in equal_range()
589         return std::make_pair(iterator(result.first), iterator(result.second));  in equal_range()
708         using iterator = typename concurrent_unordered_base::const_iterator;  variable
730         iterator begin() const { return iterator(my_instance.first_value_node(my_begin_node)); }  in begin()
731         iterator end() const { return iterator(my_instance.first_value_node(my_end_node)); }  in end()
766         using iterator = typename concurrent_unordered_base::iterator;
769         iterator begin() const { return iterator(const_range_type::begin().get_node_ptr()); }  in begin()
770         iterator end() const { return iterator(const_range_type::end().get_node_ptr()); }  in end()
952     std::pair<iterator, bool> internal_insert_value( ValueType&& value ) {  in internal_insert_value()
967         return { iterator(insert_result.node_with_equal_key), insert_result.inserted };  in internal_insert_value()