로딩중...
검색중...
일치하는것 없음
by::smultimap< K, V > 클래스 템플릿 참조

#include <smultimap.hpp>

클래스

class  iterator
 
struct  wrap
 

Public 타입

typedef std::unordered_multimap< K, wrapstlMap
 

Public 멤버 함수

ncnt size () const
 
iterator begin () const
 
iterator end () const
 
iterator begin (const K &key) const
 
iterator begin (const K *key) const BY_SIDE_FUNC(key
 
iterator begin begin ())
 
iterator rbegin () const
 
iterator rend () const
 
iterator rbegin (const K &key) const
 
iterator rbegin (const K *key) const BY_SIDE_FUNC(key
 
iterator rbegin rbegin ())
 
void insert (const K &key, V &&val)
 
void erase (const K &key)
 
void erase (const K *it) BY_SIDE_FUNC(erase)
 
void erase (const iterator &it)
 
void erase (const iterator *it) BY_SIDE_FUNC(erase)
 
void erase (const iterator &from, const iterator &to)
 
void erase (const iterator *from, const iterator &to) BY_SIDE_FUNC(from
 
void erase void ())
 
void erase (const iterator &from, const iterator *to) BY_SIDE_FUNC(to
 
void erase (from, *to)
 
void void ())
 
void erase (const iterator *from, const iterator *to) BY_SIDE_FUNC(from &&to
 
void erase void ())
 
iterator find (const K &key) const
 
void clear ()
 

Public 속성

iterator begin key
 
iterator rbegin key
 
void erase from
 

상세한 설명

template<typename K, typename V>
class by::smultimap< K, V >

smultimap: a multimap container class that preserves insertion order. in C++, a general map operates regardless of the insertion order when iteration is performed.

this class manages key and value as a pair like multimap, but when iteration is performed, it remembers the insertion order and iterates like a queue. This function is used in arguments capture features, etc., because when a nested function is exported to a closure, there is a requirement to capture and maintain the local scope at that time. Local variables that occurred after the time of capture should have no relation to the nested function.

in order to implement these functions quickly and effectively, a map container that remembers the insertion order is required.

the core ideas come from Oliver Schönrock and several great developers at bit.ly/41CwjLL

멤버 함수 문서화

◆ erase()

template<typename K , typename V >
void by::smultimap< K, V >::erase ( const K & key)

delete all elements matching given key.


이 클래스에 대한 문서화 페이지는 다음의 파일로부터 생성되었습니다.:
to Top