| 12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061 |
- from .utility cimport pair
- cdef extern from "<set>" namespace "std" nogil:
- cdef cppclass set[T]:
- ctypedef T value_type
- cppclass iterator:
- T& operator*()
- iterator operator++()
- iterator operator--()
- bint operator==(iterator)
- bint operator!=(iterator)
- cppclass reverse_iterator:
- T& operator*()
- iterator operator++()
- iterator operator--()
- bint operator==(reverse_iterator)
- bint operator!=(reverse_iterator)
- cppclass const_iterator(iterator):
- pass
- cppclass const_reverse_iterator(reverse_iterator):
- pass
- set() except +
- set(set&) except +
- #set(key_compare&)
- #set& operator=(set&)
- bint operator==(set&, set&)
- bint operator!=(set&, set&)
- bint operator<(set&, set&)
- bint operator>(set&, set&)
- bint operator<=(set&, set&)
- bint operator>=(set&, set&)
- iterator begin()
- const_iterator const_begin "begin"()
- void clear()
- size_t count(const T&)
- bint empty()
- iterator end()
- const_iterator const_end "end"()
- pair[iterator, iterator] equal_range(const T&)
- #pair[const_iterator, const_iterator] equal_range(T&)
- iterator erase(iterator)
- iterator erase(iterator, iterator)
- size_t erase(T&)
- iterator find(T&)
- const_iterator const_find "find"(T&)
- pair[iterator, bint] insert(const T&) except +
- iterator insert(iterator, const T&) except +
- void insert(iterator, iterator) except +
- #key_compare key_comp()
- iterator lower_bound(T&)
- const_iterator const_lower_bound "lower_bound"(T&)
- size_t max_size()
- reverse_iterator rbegin()
- const_reverse_iterator const_rbegin "rbegin"()
- reverse_iterator rend()
- const_reverse_iterator const_rend "rend"()
- size_t size()
- void swap(set&)
- iterator upper_bound(const T&)
- const_iterator const_upper_bound "upper_bound"(const T&)
- #value_compare value_comp()
|
