aboutsummaryrefslogtreecommitdiffstats
path: root/contrib/tools/cython/Cython/Includes/libcpp/unordered_set.pxd
blob: 9379003a455c3a563c7bc6e20eb8bf330f7b9c57 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
from .utility cimport pair 
 
cdef extern from "<unordered_set>" namespace "std" nogil: 
    cdef cppclass unordered_set[T,HASH=*,PRED=*,ALLOCATOR=*]:
        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
        unordered_set() except + 
        unordered_set(unordered_set&) except + 
        #unordered_set(key_compare&) 
        #unordered_set& operator=(unordered_set&) 
        bint operator==(unordered_set&, unordered_set&) 
        bint operator!=(unordered_set&, unordered_set&) 
        bint operator<(unordered_set&, unordered_set&) 
        bint operator>(unordered_set&, unordered_set&) 
        bint operator<=(unordered_set&, unordered_set&) 
        bint operator>=(unordered_set&, unordered_set&) 
        iterator begin() 
        const_iterator const_begin "begin"()
        void clear() 
        size_t count(T&) 
        bint empty() 
        iterator end() 
        const_iterator const_end "end"()
        pair[iterator, iterator] equal_range(T&) 
        pair[const_iterator, const_iterator] const_equal_range "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(T&) 
        iterator insert(iterator, T&) 
        #key_compare key_comp() 
        iterator insert(iterator, iterator)
        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(unordered_set&) 
        iterator upper_bound(T&) 
        const_iterator const_upper_bound "upper_bound"(T&)
        #value_compare value_comp() 
        void max_load_factor(float)
        float max_load_factor()
        void rehash(size_t)
        void reserve(size_t)
        size_t bucket_count()
        size_t max_bucket_count()
        size_t bucket_size(size_t)
        size_t bucket(const T&)