aboutsummaryrefslogtreecommitdiffstats
path: root/contrib/tools/cython/Cython/Includes/libcpp/map.pxd
blob: 167d4678484d97b915275f91e9c81bc97a6d2b9e (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
from .utility cimport pair 
 
cdef extern from "<map>" namespace "std" nogil: 
    cdef cppclass map[T, U, COMPARE=*, ALLOCATOR=*]:
        ctypedef T key_type
        ctypedef U mapped_type
        ctypedef pair[const T, U] value_type
        ctypedef COMPARE key_compare
        ctypedef ALLOCATOR allocator_type
        cppclass iterator: 
            pair[T, U]& operator*() 
            iterator operator++() 
            iterator operator--() 
            bint operator==(iterator) 
            bint operator!=(iterator) 
        cppclass reverse_iterator: 
            pair[T, U]& 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
        map() except + 
        map(map&) except + 
        #map(key_compare&) 
        U& operator[](T&) 
        #map& operator=(map&) 
        bint operator==(map&, map&) 
        bint operator!=(map&, map&) 
        bint operator<(map&, map&) 
        bint operator>(map&, map&) 
        bint operator<=(map&, map&) 
        bint operator>=(map&, map&) 
        U& at(const T&) except +
        const U& const_at "at"(const T&) except +
        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(key_type&) 
        void erase(iterator) 
        void erase(iterator, iterator) 
        size_t erase(const T&)
        iterator find(const T&)
        const_iterator const_find "find" (const T&)
        pair[iterator, bint] insert(pair[T, U]) except + # XXX pair[T,U]&
        iterator insert(iterator, pair[T, U]) except + # XXX pair[T,U]&
        #void insert(input_iterator, input_iterator) 
        #key_compare key_comp() 
        iterator lower_bound(const T&)
        const_iterator const_lower_bound "lower_bound"(const 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(map&) 
        iterator upper_bound(const T&)
        const_iterator const_upper_bound "upper_bound"(const T&)
        #value_compare value_comp()