map.pxd 2.6 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071
  1. from .utility cimport pair
  2. cdef extern from "<map>" namespace "std" nogil:
  3. cdef cppclass map[T, U, COMPARE=*, ALLOCATOR=*]:
  4. ctypedef T key_type
  5. ctypedef U mapped_type
  6. ctypedef pair[const T, U] value_type
  7. ctypedef COMPARE key_compare
  8. ctypedef ALLOCATOR allocator_type
  9. cppclass iterator:
  10. pair[T, U]& operator*()
  11. iterator operator++()
  12. iterator operator--()
  13. bint operator==(iterator)
  14. bint operator!=(iterator)
  15. cppclass const_iterator:
  16. pair[const T, U]& operator*()
  17. const_iterator operator++()
  18. const_iterator operator--()
  19. bint operator==(const_iterator)
  20. bint operator!=(const_iterator)
  21. cppclass reverse_iterator:
  22. pair[T, U]& operator*()
  23. iterator operator++()
  24. iterator operator--()
  25. bint operator==(reverse_iterator)
  26. bint operator!=(reverse_iterator)
  27. cppclass const_reverse_iterator(reverse_iterator):
  28. pass
  29. map() except +
  30. map(map&) except +
  31. #map(key_compare&)
  32. U& operator[](T&)
  33. #map& operator=(map&)
  34. bint operator==(map&, map&)
  35. bint operator!=(map&, map&)
  36. bint operator<(map&, map&)
  37. bint operator>(map&, map&)
  38. bint operator<=(map&, map&)
  39. bint operator>=(map&, map&)
  40. U& at(const T&) except +
  41. iterator begin()
  42. const_iterator const_begin "begin" ()
  43. void clear()
  44. size_t count(const T&)
  45. bint empty()
  46. iterator end()
  47. const_iterator const_end "end" ()
  48. pair[iterator, iterator] equal_range(const T&)
  49. #pair[const_iterator, const_iterator] equal_range(key_type&)
  50. void erase(iterator)
  51. void erase(iterator, iterator)
  52. size_t erase(const T&)
  53. iterator find(const T&)
  54. const_iterator const_find "find" (const T&)
  55. pair[iterator, bint] insert(pair[T, U]) except + # XXX pair[T,U]&
  56. iterator insert(iterator, pair[T, U]) except + # XXX pair[T,U]&
  57. #void insert(input_iterator, input_iterator)
  58. #key_compare key_comp()
  59. iterator lower_bound(const T&)
  60. const_iterator const_lower_bound "lower_bound"(const T&)
  61. size_t max_size()
  62. reverse_iterator rbegin()
  63. const_reverse_iterator const_rbegin "rbegin"()
  64. reverse_iterator rend()
  65. const_reverse_iterator const_rend "rend"()
  66. size_t size()
  67. void swap(map&)
  68. iterator upper_bound(const T&)
  69. const_iterator const_upper_bound "upper_bound"(const T&)
  70. #value_compare value_comp()