Skip to content

C
cython
Commit 699c8113 authored by Stefan Behnel's avatar Stefan Behnel
Browse files
Options

remove clutter from 'nogil' declarations in libcpp

parent ddad9533
Show whitespace changes
Inline Side-by-side
Showing with 444 additions and 444 deletions
Cython/Includes/libcpp/deque.pxd
View file @ 699c8113
from pair cimport pair from pair cimport pair
cdef extern from "<deque>" namespace "std": cdef extern from "<deque>" namespace "std" nogil:
cdef cppclass deque[T]: cdef cppclass deque[T]:
cppclass iterator: cppclass iterator:
T& operator*() nogil T& operator*()
iterator operator++() nogil iterator operator++()
iterator operator--() nogil iterator operator--()
bint operator==(iterator) nogil bint operator==(iterator)
bint operator!=(iterator) nogil bint operator!=(iterator)
cppclass reverse_iterator: cppclass reverse_iterator:
T& operator*() nogil T& operator*()
iterator operator++() nogil iterator operator++()
iterator operator--() nogil iterator operator--()
bint operator==(reverse_iterator) nogil bint operator==(reverse_iterator)
bint operator!=(reverse_iterator) nogil bint operator!=(reverse_iterator)
#cppclass const_iterator(iterator): #cppclass const_iterator(iterator):
# pass # pass
#cppclass const_reverse_iterator(reverse_iterator): #cppclass const_reverse_iterator(reverse_iterator):
# pass # pass
deque() nogil except + deque() except +
deque(deque&) nogil except + deque(deque&) except +
deque(size_t) nogil except + deque(size_t) except +
deque(size_t, T&) nogil except + deque(size_t, T&) except +
#deque[input_iterator](input_iterator, input_iterator) #deque[input_iterator](input_iterator, input_iterator)
T& operator[](size_t) nogil T& operator[](size_t)
#deque& operator=(deque&) #deque& operator=(deque&)
bint operator==(deque&, deque&) nogil bint operator==(deque&, deque&)
bint operator!=(deque&, deque&) nogil bint operator!=(deque&, deque&)
bint operator<(deque&, deque&) nogil bint operator<(deque&, deque&)
bint operator>(deque&, deque&) nogil bint operator>(deque&, deque&)
bint operator<=(deque&, deque&) nogil bint operator<=(deque&, deque&)
bint operator>=(deque&, deque&) nogil bint operator>=(deque&, deque&)
void assign(size_t, T&) nogil void assign(size_t, T&)
void assign(input_iterator, input_iterator) nogil void assign(input_iterator, input_iterator)
T& at(size_t) nogil T& at(size_t)
T& back() nogil T& back()
iterator begin() nogil iterator begin()
#const_iterator begin() #const_iterator begin()
void clear() nogil void clear()
bint empty() nogil bint empty()
iterator end() nogil iterator end()
#const_iterator end() #const_iterator end()
iterator erase(iterator) nogil iterator erase(iterator)
iterator erase(iterator, iterator) nogil iterator erase(iterator, iterator)
T& front() nogil T& front()
iterator insert(iterator, T&) nogil iterator insert(iterator, T&)
void insert(iterator, size_t, T&) nogil void insert(iterator, size_t, T&)
void insert(iterator, input_iterator, input_iterator) nogil void insert(iterator, input_iterator, input_iterator)
size_t max_size() nogil size_t max_size()
void pop_back() nogil void pop_back()
void pop_front() nogil void pop_front()
void push_back(T&) nogil void push_back(T&)
void push_front(T&) nogil void push_front(T&)
reverse_iterator rbegin() nogil reverse_iterator rbegin()
#const_reverse_iterator rbegin() #const_reverse_iterator rbegin()
reverse_iterator rend() nogil reverse_iterator rend()
#const_reverse_iterator rend() #const_reverse_iterator rend()
void resize(size_t) nogil void resize(size_t)
void resize(size_t, T&) nogil void resize(size_t, T&)
size_t size() nogil size_t size()
void swap(deque&) nogil void swap(deque&)
Cython/Includes/libcpp/list.pxd
View file @ 699c8113
cdef extern from "<list>" namespace "std": cdef extern from "<list>" namespace "std" nogil:
cdef cppclass list[T]: cdef cppclass list[T]:
cppclass iterator: cppclass iterator:
T& operator*() nogil T& operator*()
iterator operator++() nogil iterator operator++()
iterator operator--() nogil iterator operator--()
bint operator==(iterator) nogil bint operator==(iterator)
bint operator!=(iterator) nogil bint operator!=(iterator)
cppclass reverse_iterator: cppclass reverse_iterator:
T& operator*() nogil T& operator*()
iterator operator++() nogil iterator operator++()
iterator operator--() nogil iterator operator--()
bint operator==(reverse_iterator) nogil bint operator==(reverse_iterator)
bint operator!=(reverse_iterator) nogil bint operator!=(reverse_iterator)
#cppclass const_iterator(iterator): #cppclass const_iterator(iterator):
# pass # pass
#cppclass const_reverse_iterator(reverse_iterator): #cppclass const_reverse_iterator(reverse_iterator):
# pass # pass
list() nogil except + list() except +
list(list&) nogil except + list(list&) except +
list(size_t, T&) nogil except + list(size_t, T&) except +
#list operator=(list&) #list operator=(list&)
bint operator==(list&, list&) nogil bint operator==(list&, list&)
bint operator!=(list&, list&) nogil bint operator!=(list&, list&)
bint operator<(list&, list&) nogil bint operator<(list&, list&)
bint operator>(list&, list&) nogil bint operator>(list&, list&)
bint operator<=(list&, list&) nogil bint operator<=(list&, list&)
bint operator>=(list&, list&) nogil bint operator>=(list&, list&)
void assign(size_t, T&) nogil void assign(size_t, T&)
T& back() nogil T& back()
iterator begin() nogil iterator begin()
#const_iterator begin() #const_iterator begin()
void clear() nogil void clear()
bint empty() nogil bint empty()
iterator end() nogil iterator end()
#const_iterator end() #const_iterator end()
iterator erase(iterator) nogil iterator erase(iterator)
iterator erase(iterator, iterator) nogil iterator erase(iterator, iterator)
T& front() nogil T& front()
iterator insert(iterator, T&) nogil iterator insert(iterator, T&)
void insert(iterator, size_t, T&) nogil void insert(iterator, size_t, T&)
size_t max_size() nogil size_t max_size()
void merge(list&) nogil void merge(list&)
#void merge(list&, BinPred) #void merge(list&, BinPred)
void pop_back() nogil void pop_back()
void pop_front() nogil void pop_front()
void push_back(T&) nogil void push_back(T&)
void push_front(T&) nogil void push_front(T&)
reverse_iterator rbegin() nogil reverse_iterator rbegin()
#const_reverse_iterator rbegin() #const_reverse_iterator rbegin()
void remove(T&) nogil void remove(T&)
#void remove_if(UnPred) #void remove_if(UnPred)
reverse_iterator rend() nogil reverse_iterator rend()
#const_reverse_iterator rend() #const_reverse_iterator rend()
void resize(size_t, T&) nogil void resize(size_t, T&)
void reverse() nogil void reverse()
size_t size() nogil size_t size()
void sort() nogil void sort()
#void sort(BinPred) #void sort(BinPred)
void splice(iterator, list&) nogil void splice(iterator, list&)
void splice(iterator, list&, iterator) nogil void splice(iterator, list&, iterator)
void splice(iterator, list&, iterator, iterator) nogil void splice(iterator, list&, iterator, iterator)
void swap(list&) nogil void swap(list&)
void unique() nogil void unique()
#void unique(BinPred) #void unique(BinPred)
Cython/Includes/libcpp/map.pxd
View file @ 699c8113
from utility cimport pair from utility cimport pair
cdef extern from "<map>" namespace "std": cdef extern from "<map>" namespace "std" nogil:
cdef cppclass map[T, U]: cdef cppclass map[T, U]:
cppclass iterator: cppclass iterator:
pair[T, U]& operator*() nogil pair[T, U]& operator*()
iterator operator++() nogil iterator operator++()
iterator operator--() nogil iterator operator--()
bint operator==(iterator) nogil bint operator==(iterator)
bint operator!=(iterator) nogil bint operator!=(iterator)
cppclass reverse_iterator: cppclass reverse_iterator:
pair[T, U]& operator*() nogil pair[T, U]& operator*()
iterator operator++() nogil iterator operator++()
iterator operator--() nogil iterator operator--()
bint operator==(reverse_iterator) nogil bint operator==(reverse_iterator)
bint operator!=(reverse_iterator) nogil bint operator!=(reverse_iterator)
#cppclass const_iterator(iterator): #cppclass const_iterator(iterator):
# pass # pass
#cppclass const_reverse_iterator(reverse_iterator): #cppclass const_reverse_iterator(reverse_iterator):
# pass # pass
map() nogil except + map() except +
map(map&) nogil except + map(map&) except +
#map(key_compare&) #map(key_compare&)
U& operator[](T&) nogil U& operator[](T&)
#map& operator=(map&) #map& operator=(map&)
bint operator==(map&, map&) nogil bint operator==(map&, map&)
bint operator!=(map&, map&) nogil bint operator!=(map&, map&)
bint operator<(map&, map&) nogil bint operator<(map&, map&)
bint operator>(map&, map&) nogil bint operator>(map&, map&)
bint operator<=(map&, map&) nogil bint operator<=(map&, map&)
bint operator>=(map&, map&) nogil bint operator>=(map&, map&)
U& at(T&) nogil U& at(T&)
iterator begin() nogil iterator begin()
#const_iterator begin() #const_iterator begin()
void clear() nogil void clear()
size_t count(T&) nogil size_t count(T&)
bint empty() nogil bint empty()
iterator end() nogil iterator end()
#const_iterator end() #const_iterator end()
pair[iterator, iterator] equal_range(T&) nogil pair[iterator, iterator] equal_range(T&)
#pair[const_iterator, const_iterator] equal_range(key_type&) #pair[const_iterator, const_iterator] equal_range(key_type&)
void erase(iterator) nogil void erase(iterator)
void erase(iterator, iterator) nogil void erase(iterator, iterator)
size_t erase(T&) nogil size_t erase(T&)
iterator find(T&) nogil iterator find(T&)
#const_iterator find(key_type&) #const_iterator find(key_type&)
pair[iterator, bint] insert(pair[T, U]) nogil # XXX pair[T,U]& pair[iterator, bint] insert(pair[T, U]) # XXX pair[T,U]&
iterator insert(iterator, pair[T, U]) nogil # XXX pair[T,U]& iterator insert(iterator, pair[T, U]) # XXX pair[T,U]&
#void insert(input_iterator, input_iterator) #void insert(input_iterator, input_iterator)
#key_compare key_comp() #key_compare key_comp()
iterator lower_bound(T&) nogil iterator lower_bound(T&)
#const_iterator lower_bound(key_type&) #const_iterator lower_bound(key_type&)
size_t max_size() nogil size_t max_size()
reverse_iterator rbegin() nogil reverse_iterator rbegin()
#const_reverse_iterator rbegin() #const_reverse_iterator rbegin()
reverse_iterator rend() nogil reverse_iterator rend()
#const_reverse_iterator rend() #const_reverse_iterator rend()
size_t size() nogil size_t size()
void swap(map&) nogil void swap(map&)
iterator upper_bound(T&) nogil iterator upper_bound(T&)
#const_iterator upper_bound(key_type&) #const_iterator upper_bound(key_type&)
#value_compare value_comp() #value_compare value_comp()
Cython/Includes/libcpp/queue.pxd
View file @ 699c8113
cdef extern from "<queue>" namespace "std": cdef extern from "<queue>" namespace "std" nogil:
cdef cppclass queue[T]: cdef cppclass queue[T]:
queue() nogil except + queue() except +
queue(queue&) nogil except + queue(queue&) except +
#queue(Container&) #queue(Container&)
T& back() nogil T& back()
bint empty() nogil bint empty()
T& front() nogil T& front()
void pop() nogil void pop()
void push(T&) nogil void push(T&)
size_t size() nogil size_t size()
cdef cppclass priority_queue[T]: cdef cppclass priority_queue[T]:
priority_queue() nogil except + priority_queue() except +
priority_queue(priority_queue&) nogil except + priority_queue(priority_queue&) except +
#priority_queue(Container&) #priority_queue(Container&)
bint empty() nogil bint empty()
void pop() nogil void pop()
void push(T&) nogil void push(T&)
size_t size() nogil size_t size()
T& top() nogil T& top()
Cython/Includes/libcpp/set.pxd
View file @ 699c8113
from pair cimport pair from pair cimport pair
cdef extern from "<set>" namespace "std": cdef extern from "<set>" namespace "std" nogil:
cdef cppclass set[T]: cdef cppclass set[T]:
cppclass iterator: cppclass iterator:
T& operator*() T& operator*()
iterator operator++() nogil iterator operator++()
iterator operator--() nogil iterator operator--()
bint operator==(iterator) nogil bint operator==(iterator)
bint operator!=(iterator) nogil bint operator!=(iterator)
cppclass reverse_iterator: cppclass reverse_iterator:
T& operator*() nogil T& operator*()
iterator operator++() nogil iterator operator++()
iterator operator--() nogil iterator operator--()
bint operator==(reverse_iterator) nogil bint operator==(reverse_iterator)
bint operator!=(reverse_iterator) nogil bint operator!=(reverse_iterator)
#cppclass const_iterator(iterator): #cppclass const_iterator(iterator):
# pass # pass
#cppclass const_reverse_iterator(reverse_iterator): #cppclass const_reverse_iterator(reverse_iterator):
# pass # pass
set() nogil except + set() except +
set(set&) nogil except + set(set&) except +
#set(key_compare&) #set(key_compare&)
#set& operator=(set&) #set& operator=(set&)
bint operator==(set&, set&) nogil bint operator==(set&, set&)
bint operator!=(set&, set&) nogil bint operator!=(set&, set&)
bint operator<(set&, set&) nogil bint operator<(set&, set&)
bint operator>(set&, set&) nogil bint operator>(set&, set&)
bint operator<=(set&, set&) nogil bint operator<=(set&, set&)
bint operator>=(set&, set&) nogil bint operator>=(set&, set&)
iterator begin() nogil iterator begin()
#const_iterator begin() #const_iterator begin()
void clear() nogil void clear()
size_t count(T&) nogil size_t count(T&)
bint empty() nogil bint empty()
iterator end() nogil iterator end()
#const_iterator end() #const_iterator end()
pair[iterator, iterator] equal_range(T&) nogil pair[iterator, iterator] equal_range(T&)
#pair[const_iterator, const_iterator] equal_range(T&) #pair[const_iterator, const_iterator] equal_range(T&)
void erase(iterator) nogil void erase(iterator)
void erase(iterator, iterator) nogil void erase(iterator, iterator)
size_t erase(T&) nogil size_t erase(T&)
iterator find(T&) nogil iterator find(T&)
#const_iterator find(T&) #const_iterator find(T&)
pair[iterator, bint] insert(T&) nogil pair[iterator, bint] insert(T&)
iterator insert(iterator, T&) nogil iterator insert(iterator, T&)
#void insert(input_iterator, input_iterator) #void insert(input_iterator, input_iterator)
#key_compare key_comp() #key_compare key_comp()
iterator lower_bound(T&) nogil iterator lower_bound(T&)
#const_iterator lower_bound(T&) #const_iterator lower_bound(T&)
size_t max_size() nogil size_t max_size()
reverse_iterator rbegin() nogil reverse_iterator rbegin()
#const_reverse_iterator rbegin() #const_reverse_iterator rbegin()
reverse_iterator rend() nogil reverse_iterator rend()
#const_reverse_iterator rend() #const_reverse_iterator rend()
size_t size() nogil size_t size()
void swap(set&) nogil void swap(set&)
iterator upper_bound(T&) nogil iterator upper_bound(T&)
#const_iterator upper_bound(T&) #const_iterator upper_bound(T&)
#value_compare value_comp() #value_compare value_comp()
Cython/Includes/libcpp/stack.pxd
View file @ 699c8113
cdef extern from "<stack>" namespace "std": cdef extern from "<stack>" namespace "std" nogil:
cdef cppclass stack[T]: cdef cppclass stack[T]:
stack() nogil except + stack() except +
stack(stack&) nogil except + stack(stack&) except +
#stack(Container&) #stack(Container&)
bint empty() nogil bint empty()
void pop() nogil void pop()
void push(T&) nogil void push(T&)
size_t size() nogil size_t size()
T& top() nogil T& top()
Cython/Includes/libcpp/string.pxd
View file @ 699c8113
...@@ -3,120 +3,120 @@ ...@@ -3,120 +3,120 @@
from libc.string cimport const_char from libc.string cimport const_char
cdef extern from "<string>" namespace "std": cdef extern from "<string>" namespace "std" nogil:
size_t npos = -1 size_t npos = -1
cdef cppclass string: cdef cppclass string:
string() nogil except + string() except +
string(char *) nogil except + string(char *) except +
string(char *, size_t) nogil except + string(char *, size_t) except +
string(string&) nogil except + string(string&) except +
# as a string formed by a repetition of character c, n times. # as a string formed by a repetition of character c, n times.
string(size_t, char) nogil except + string(size_t, char) except +
const char* c_str() nogil const char* c_str()
const char* data() nogil const char* data()
size_t size() nogil size_t size()
size_t max_size() nogil size_t max_size()
size_t length() nogil size_t length()
void resize(size_t) nogil void resize(size_t)
void resize(size_t, char c) nogil void resize(size_t, char c)
size_t capacity() nogil size_t capacity()
void reserve(size_t) nogil void reserve(size_t)
void clear() nogil void clear()
bint empty() nogil bint empty()
char& at(size_t) nogil char& at(size_t)
char& operator[](size_t) nogil char& operator[](size_t)
int compare(string&) nogil int compare(string&)
string& append(string&) nogil string& append(string&)
string& append(string&, size_t, size_t) nogil string& append(string&, size_t, size_t)
string& append(char *) nogil string& append(char *)
string& append(char *, size_t) nogil string& append(char *, size_t)
string& append(size_t, char) nogil string& append(size_t, char)
void push_back(char c) nogil void push_back(char c)
string& assign (string&) nogil string& assign (string&)
string& assign (string&, size_t, size_t) nogil string& assign (string&, size_t, size_t)
string& assign (char *, size_t) nogil string& assign (char *, size_t)
string& assign (char *) nogil string& assign (char *)
string& assign (size_t n, char c) nogil string& assign (size_t n, char c)
string& insert(size_t, string&) nogil string& insert(size_t, string&)
string& insert(size_t, string&, size_t, size_t) nogil string& insert(size_t, string&, size_t, size_t)
string& insert(size_t, char* s, size_t) nogil string& insert(size_t, char* s, size_t)
string& insert(size_t, char* s) nogil string& insert(size_t, char* s)
string& insert(size_t, size_t, char c) nogil string& insert(size_t, size_t, char c)
size_t copy(char *, size_t, size_t) nogil size_t copy(char *, size_t, size_t)
size_t find(string&) nogil size_t find(string&)
size_t find(string&, size_t) nogil size_t find(string&, size_t)
size_t find(char*, size_t pos, size_t) nogil size_t find(char*, size_t pos, size_t)
size_t find(char*, size_t pos) nogil size_t find(char*, size_t pos)
size_t find(char, size_t pos) nogil size_t find(char, size_t pos)
size_t rfind(string&, size_t) nogil size_t rfind(string&, size_t)
size_t rfind(char* s, size_t, size_t) nogil size_t rfind(char* s, size_t, size_t)
size_t rfind(char*, size_t pos) nogil size_t rfind(char*, size_t pos)
size_t rfind(char c, size_t) nogil size_t rfind(char c, size_t)
size_t rfind(char c) nogil size_t rfind(char c)
size_t find_first_of(string&, size_t) nogil size_t find_first_of(string&, size_t)
size_t find_first_of(char* s, size_t, size_t) nogil size_t find_first_of(char* s, size_t, size_t)
size_t find_first_of(char*, size_t pos) nogil size_t find_first_of(char*, size_t pos)
size_t find_first_of(char c, size_t) nogil size_t find_first_of(char c, size_t)
size_t find_first_of(char c) nogil size_t find_first_of(char c)
size_t find_first_not_of(string&, size_t) nogil size_t find_first_not_of(string&, size_t)
size_t find_first_not_of(char* s, size_t, size_t) nogil size_t find_first_not_of(char* s, size_t, size_t)
size_t find_first_not_of(char*, size_t pos) nogil size_t find_first_not_of(char*, size_t pos)
size_t find_first_not_of(char c, size_t) nogil size_t find_first_not_of(char c, size_t)
size_t find_first_not_of(char c) nogil size_t find_first_not_of(char c)
size_t find_last_of(string&, size_t) nogil size_t find_last_of(string&, size_t)
size_t find_last_of(char* s, size_t, size_t) nogil size_t find_last_of(char* s, size_t, size_t)
size_t find_last_of(char*, size_t pos) nogil size_t find_last_of(char*, size_t pos)
size_t find_last_of(char c, size_t) nogil size_t find_last_of(char c, size_t)
size_t find_last_of(char c) nogil size_t find_last_of(char c)
size_t find_last_not_of(string&, size_t) nogil size_t find_last_not_of(string&, size_t)
size_t find_last_not_of(char* s, size_t, size_t) nogil size_t find_last_not_of(char* s, size_t, size_t)
size_t find_last_not_of(char*, size_t pos) nogil size_t find_last_not_of(char*, size_t pos)
string substr(size_t, size_t) nogil string substr(size_t, size_t)
string substr() nogil string substr()
string substr(size_t) nogil string substr(size_t)
size_t find_last_not_of(char c, size_t) nogil size_t find_last_not_of(char c, size_t)
size_t find_last_not_of(char c) nogil size_t find_last_not_of(char c)
#string& operator= (string&) #string& operator= (string&)
#string& operator= (char*) #string& operator= (char*)
#string& operator= (char) #string& operator= (char)
string operator+ (string& rhs) nogil string operator+ (string& rhs)
string operator+ (char* rhs) nogil string operator+ (char* rhs)
bint operator==(string&) nogil bint operator==(string&)
bint operator==(char*) nogil bint operator==(char*)
bint operator!= (string& rhs ) nogil bint operator!= (string& rhs )
bint operator!= (char* ) nogil bint operator!= (char* )
bint operator< (string&) nogil bint operator< (string&)
bint operator< (char*) nogil bint operator< (char*)
bint operator> (string&) nogil bint operator> (string&)
bint operator> (char*) nogil bint operator> (char*)
bint operator<= (string&) nogil bint operator<= (string&)
bint operator<= (char*) nogil bint operator<= (char*)
bint operator>= (string&) nogil bint operator>= (string&)
bint operator>= (char*) nogil bint operator>= (char*)
Cython/Includes/libcpp/unordered_map.pxd
View file @ 699c8113
from utility cimport pair from utility cimport pair
cdef extern from "<unordered_map>" namespace "std": cdef extern from "<unordered_map>" namespace "std" nogil:
cdef cppclass unordered_map[T, U]: cdef cppclass unordered_map[T, U]:
cppclass iterator: cppclass iterator:
pair[T, U]& operator*() nogil pair[T, U]& operator*()
iterator operator++() nogil iterator operator++()
iterator operator--() nogil iterator operator--()
bint operator==(iterator) nogil bint operator==(iterator)
bint operator!=(iterator) nogil bint operator!=(iterator)
cppclass reverse_iterator: cppclass reverse_iterator:
pair[T, U]& operator*() nogil pair[T, U]& operator*()
iterator operator++() nogil iterator operator++()
iterator operator--() nogil iterator operator--()
bint operator==(reverse_iterator) nogil bint operator==(reverse_iterator)
bint operator!=(reverse_iterator) nogil bint operator!=(reverse_iterator)
#cppclass const_iterator(iterator): #cppclass const_iterator(iterator):
# pass # pass
#cppclass const_reverse_iterator(reverse_iterator): #cppclass const_reverse_iterator(reverse_iterator):
# pass # pass
unordered_map() nogil except + unordered_map() except +
unordered_map(unordered_map&) nogil except + unordered_map(unordered_map&) except +
#unordered_map(key_compare&) #unordered_map(key_compare&)
U& operator[](T&) nogil U& operator[](T&)
#unordered_map& operator=(unordered_map&) #unordered_map& operator=(unordered_map&)
bint operator==(unordered_map&, unordered_map&) nogil bint operator==(unordered_map&, unordered_map&)
bint operator!=(unordered_map&, unordered_map&) nogil bint operator!=(unordered_map&, unordered_map&)
bint operator<(unordered_map&, unordered_map&) nogil bint operator<(unordered_map&, unordered_map&)
bint operator>(unordered_map&, unordered_map&) nogil bint operator>(unordered_map&, unordered_map&)
bint operator<=(unordered_map&, unordered_map&) nogil bint operator<=(unordered_map&, unordered_map&)
bint operator>=(unordered_map&, unordered_map&) nogil bint operator>=(unordered_map&, unordered_map&)
U& at(T&) nogil U& at(T&)
iterator begin() nogil iterator begin()
#const_iterator begin() #const_iterator begin()
void clear() nogil void clear()
size_t count(T&) nogil size_t count(T&)
bint empty() nogil bint empty()
iterator end() nogil iterator end()
#const_iterator end() #const_iterator end()
pair[iterator, iterator] equal_range(T&) nogil pair[iterator, iterator] equal_range(T&)
#pair[const_iterator, const_iterator] equal_range(key_type&) #pair[const_iterator, const_iterator] equal_range(key_type&)
void erase(iterator) nogil void erase(iterator)
void erase(iterator, iterator) nogil void erase(iterator, iterator)
size_t erase(T&) nogil size_t erase(T&)
iterator find(T&) nogil iterator find(T&)
#const_iterator find(key_type&) #const_iterator find(key_type&)
pair[iterator, bint] insert(pair[T, U]) nogil # XXX pair[T,U]& pair[iterator, bint] insert(pair[T, U]) # XXX pair[T,U]&
iterator insert(iterator, pair[T, U]) nogil # XXX pair[T,U]& iterator insert(iterator, pair[T, U]) # XXX pair[T,U]&
#void insert(input_iterator, input_iterator) #void insert(input_iterator, input_iterator)
#key_compare key_comp() #key_compare key_comp()
iterator lower_bound(T&) nogil iterator lower_bound(T&)
#const_iterator lower_bound(key_type&) #const_iterator lower_bound(key_type&)
size_t max_size() nogil size_t max_size()
reverse_iterator rbegin() nogil reverse_iterator rbegin()
#const_reverse_iterator rbegin() #const_reverse_iterator rbegin()
reverse_iterator rend() nogil reverse_iterator rend()
#const_reverse_iterator rend() #const_reverse_iterator rend()
size_t size() nogil size_t size()
void swap(unordered_map&) nogil void swap(unordered_map&)
iterator upper_bound(T&) nogil iterator upper_bound(T&)
#const_iterator upper_bound(key_type&) #const_iterator upper_bound(key_type&)
#value_compare value_comp() #value_compare value_comp()
Cython/Includes/libcpp/unordered_set.pxd
View file @ 699c8113
from pair cimport pair from pair cimport pair
cdef extern from "<unordered_set>" namespace "std": cdef extern from "<unordered_set>" namespace "std" nogil:
cdef cppclass unordered_set[T]: cdef cppclass unordered_set[T]:
cppclass iterator: cppclass iterator:
T& operator*() T& operator*()
iterator operator++() nogil iterator operator++()
iterator operator--() nogil iterator operator--()
bint operator==(iterator) nogil bint operator==(iterator)
bint operator!=(iterator) nogil bint operator!=(iterator)
cppclass reverse_iterator: cppclass reverse_iterator:
T& operator*() nogil T& operator*()
iterator operator++() nogil iterator operator++()
iterator operator--() nogil iterator operator--()
bint operator==(reverse_iterator) nogil bint operator==(reverse_iterator)
bint operator!=(reverse_iterator) nogil bint operator!=(reverse_iterator)
#cppclass const_iterator(iterator): #cppclass const_iterator(iterator):
# pass # pass
#cppclass const_reverse_iterator(reverse_iterator): #cppclass const_reverse_iterator(reverse_iterator):
# pass # pass
unordered_set() nogil except + unordered_set() except +
unordered_set(unordered_set&) nogil except + unordered_set(unordered_set&) except +
#unordered_set(key_compare&) #unordered_set(key_compare&)
#unordered_set& operator=(unordered_set&) #unordered_set& operator=(unordered_set&)
bint operator==(unordered_set&, unordered_set&) nogil bint operator==(unordered_set&, unordered_set&)
bint operator!=(unordered_set&, unordered_set&) nogil bint operator!=(unordered_set&, unordered_set&)
bint operator<(unordered_set&, unordered_set&) nogil bint operator<(unordered_set&, unordered_set&)
bint operator>(unordered_set&, unordered_set&) nogil bint operator>(unordered_set&, unordered_set&)
bint operator<=(unordered_set&, unordered_set&) nogil bint operator<=(unordered_set&, unordered_set&)
bint operator>=(unordered_set&, unordered_set&) nogil bint operator>=(unordered_set&, unordered_set&)
iterator begin() nogil iterator begin()
#const_iterator begin() #const_iterator begin()
void clear() nogil void clear()
size_t count(T&) nogil size_t count(T&)
bint empty() nogil bint empty()
iterator end() nogil iterator end()
#const_iterator end() #const_iterator end()
pair[iterator, iterator] equal_range(T&) nogil pair[iterator, iterator] equal_range(T&)
#pair[const_iterator, const_iterator] equal_range(T&) #pair[const_iterator, const_iterator] equal_range(T&)
void erase(iterator) nogil void erase(iterator)
void erase(iterator, iterator) nogil void erase(iterator, iterator)
size_t erase(T&) nogil size_t erase(T&)
iterator find(T&) nogil iterator find(T&)
#const_iterator find(T&) #const_iterator find(T&)
pair[iterator, bint] insert(T&) nogil pair[iterator, bint] insert(T&)
iterator insert(iterator, T&) nogil iterator insert(iterator, T&)
#void insert(input_iterator, input_iterator) #void insert(input_iterator, input_iterator)
#key_compare key_comp() #key_compare key_comp()
iterator lower_bound(T&) nogil iterator lower_bound(T&)
#const_iterator lower_bound(T&) #const_iterator lower_bound(T&)
size_t max_size() nogil size_t max_size()
reverse_iterator rbegin() nogil reverse_iterator rbegin()
#const_reverse_iterator rbegin() #const_reverse_iterator rbegin()
reverse_iterator rend() nogil reverse_iterator rend()
#const_reverse_iterator rend() #const_reverse_iterator rend()
size_t size() nogil size_t size()
void swap(unordered_set&) nogil void swap(unordered_set&)
iterator upper_bound(T&) nogil iterator upper_bound(T&)
#const_iterator upper_bound(T&) #const_iterator upper_bound(T&)
#value_compare value_comp() #value_compare value_comp()
Cython/Includes/libcpp/utility.pxd
View file @ 699c8113
cdef extern from "<utility>" namespace "std": cdef extern from "<utility>" namespace "std" nogil:
cdef cppclass pair[T, U]: cdef cppclass pair[T, U]:
T first T first
U second U second
pair() nogil except + pair() except +
pair(pair&) nogil except + pair(pair&) except +
pair(T&, U&) nogil except + pair(T&, U&) except +
bint operator==(pair&, pair&) nogil bint operator==(pair&, pair&)
bint operator!=(pair&, pair&) nogil bint operator!=(pair&, pair&)
bint operator<(pair&, pair&) nogil bint operator<(pair&, pair&)
bint operator>(pair&, pair&) nogil bint operator>(pair&, pair&)
bint operator<=(pair&, pair&) nogil bint operator<=(pair&, pair&)
bint operator>=(pair&, pair&) nogil bint operator>=(pair&, pair&)
Cython/Includes/libcpp/vector.pxd
View file @ 699c8113
cdef extern from "<vector>" namespace "std": cdef extern from "<vector>" namespace "std" nogil:
cdef cppclass vector[T]: cdef cppclass vector[T]:
cppclass iterator: cppclass iterator:
T& operator*() nogil T& operator*()
iterator operator++() nogil iterator operator++()
iterator operator--() nogil iterator operator--()
iterator operator+(size_t) nogil iterator operator+(size_t)
iterator operator-(size_t) nogil iterator operator-(size_t)
bint operator==(iterator) nogil bint operator==(iterator)
bint operator!=(iterator) nogil bint operator!=(iterator)
bint operator<(iterator) nogil bint operator<(iterator)
bint operator>(iterator) nogil bint operator>(iterator)
bint operator<=(iterator) nogil bint operator<=(iterator)
bint operator>=(iterator) nogil bint operator>=(iterator)
cppclass reverse_iterator: cppclass reverse_iterator:
T& operator*() nogil T& operator*()
iterator operator++() nogil iterator operator++()
iterator operator--() nogil iterator operator--()
iterator operator+(size_t) nogil iterator operator+(size_t)
iterator operator-(size_t) nogil iterator operator-(size_t)
bint operator==(reverse_iterator) nogil bint operator==(reverse_iterator)
bint operator!=(reverse_iterator) nogil bint operator!=(reverse_iterator)
bint operator<(reverse_iterator) nogil bint operator<(reverse_iterator)
bint operator>(reverse_iterator) nogil bint operator>(reverse_iterator)
bint operator<=(reverse_iterator) nogil bint operator<=(reverse_iterator)
bint operator>=(reverse_iterator) nogil bint operator>=(reverse_iterator)
#cppclass const_iterator(iterator): #cppclass const_iterator(iterator):
# pass # pass
#cppclass const_reverse_iterator(reverse_iterator): #cppclass const_reverse_iterator(reverse_iterator):
# pass # pass
vector() nogil except + vector() except +
vector(vector&) nogil except + vector(vector&) except +
vector(size_t) nogil except + vector(size_t) except +
vector(size_t, T&) nogil except + vector(size_t, T&) except +
#vector[input_iterator](input_iterator, input_iterator) #vector[input_iterator](input_iterator, input_iterator)
T& operator[](size_t) nogil T& operator[](size_t)
#vector& operator=(vector&) #vector& operator=(vector&)
bint operator==(vector&, vector&) nogil bint operator==(vector&, vector&)
bint operator!=(vector&, vector&) nogil bint operator!=(vector&, vector&)
bint operator<(vector&, vector&) nogil bint operator<(vector&, vector&)
bint operator>(vector&, vector&) nogil bint operator>(vector&, vector&)
bint operator<=(vector&, vector&) nogil bint operator<=(vector&, vector&)
bint operator>=(vector&, vector&) nogil bint operator>=(vector&, vector&)
void assign(size_t, T&) nogil void assign(size_t, T&)
void assign[input_iterator](input_iterator, input_iterator) void assign[input_iterator](input_iterator, input_iterator)
T& at(size_t) nogil T& at(size_t)
T& back() nogil T& back()
iterator begin() nogil iterator begin()
#const_iterator begin() #const_iterator begin()
size_t capacity() nogil size_t capacity()
void clear() nogil void clear()
bint empty() nogil bint empty()
iterator end() nogil iterator end()
#const_iterator end() #const_iterator end()
iterator erase(iterator) nogil iterator erase(iterator)
iterator erase(iterator, iterator) nogil iterator erase(iterator, iterator)
T& front() nogil T& front()
iterator insert(iterator, T&) nogil iterator insert(iterator, T&)
void insert(iterator, size_t, T&) nogil void insert(iterator, size_t, T&)
void insert(iterator, iterator, iterator) nogil void insert(iterator, iterator, iterator)
size_t max_size() nogil size_t max_size()
void pop_back() nogil void pop_back()
void push_back(T&) nogil void push_back(T&)
reverse_iterator rbegin() nogil reverse_iterator rbegin()
#const_reverse_iterator rbegin() #const_reverse_iterator rbegin()
reverse_iterator rend() nogil reverse_iterator rend()
#const_reverse_iterator rend() #const_reverse_iterator rend()
void reserve(size_t) nogil void reserve(size_t)
void resize(size_t) nogil void resize(size_t)
void resize(size_t, T&) nogil void resize(size_t, T&)
size_t size() nogil size_t size()
void swap(vector&) nogil void swap(vector&)
#C++0x methods #C++0x methods
T* data() nogil T* data()
void shrink_to_fit() void shrink_to_fit()
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment
GitLab Nexedi Edition | About GitLab | About Nexedi | 沪ICP备2021021310号-2 | 沪ICP备2021021310号-7