Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
C
cython
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Labels
Merge Requests
0
Merge Requests
0
Analytics
Analytics
Repository
Value Stream
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Commits
Open sidebar
nexedi
cython
Commits
bcf2668c
Commit
bcf2668c
authored
Mar 09, 2010
by
daniloaf
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
some .pxd for stl on Cython/Includes/libcpp. Tests missing
parent
fa945265
Changes
6
Show whitespace changes
Inline
Side-by-side
Showing
6 changed files
with
248 additions
and
0 deletions
+248
-0
Cython/Includes/libcpp/deque.pxd
Cython/Includes/libcpp/deque.pxd
+56
-0
Cython/Includes/libcpp/pair.pxd
Cython/Includes/libcpp/pair.pxd
+7
-0
Cython/Includes/libcpp/queue.pxd
Cython/Includes/libcpp/queue.pxd
+12
-0
Cython/Includes/libcpp/set.pxd
Cython/Includes/libcpp/set.pxd
+55
-0
Cython/Includes/libcpp/stack.pxd
Cython/Includes/libcpp/stack.pxd
+61
-0
Cython/Includes/libcpp/vector.pxd
Cython/Includes/libcpp/vector.pxd
+57
-0
No files found.
Cython/Includes/libcpp/deque.pxd
0 → 100644
View file @
bcf2668c
from
pair
cimport
pair
cdef
extern
from
"<deque>"
namespace
"std"
:
cdef
cppclass
deque
[
T
]:
cppclass
iterator
:
T
operator
*
()
iterator
operator
++
()
bint
operator
==
(
iterator
)
bint
operator
!=
(
iterator
)
cppclass
const_iterator
(
iterator
):
pass
cppclass
reverse_iterator
(
iterator
):
pass
cppclass
const_reverse_iterator
(
iterator
):
pass
deque
()
deque
(
deque
&
)
deque
(
size_t
,
T
&
val
=
T
())
#deque(input_iterator, input_iterator)
TYPE
&
operator
[](
size_type
index
)
const
TYPE
&
operator
[](
size_type
index
)
const
#deque& operator=(deque&)
bool
operator
==
(
deque
&
,
deque
&
)
bool
operator
!=
(
deque
&
,
deque
&
)
bool
operator
<
(
deque
&
,
deque
&
)
bool
operator
>
(
deque
&
,
deque
&
)
bool
operator
<=
(
deque
&
,
deque
&
)
bool
operator
>=
(
deque
&
,
deque
&
)
void
assign
(
size_t
,
TYPE
&
)
void
assign
(
input_iterator
,
input_iterator
)
T
&
at
(
size_t
)
T
&
back
()
iterator
begin
()
const_iterator
begin
()
void
clear
()
bool
empty
()
iterator
end
()
const_iterator
end
()
iterator
erase
(
iterator
)
iterator
erase
(
iterator
,
iterator
)
T
&
front
()
iterator
insert
(
iterator
,
T
&
)
void
insert
(
iterator
,
size_t
,
T
&
)
void
insert
(
iterator
,
input_iterator
,
input_iterator
)
size_t
max_size
()
void
pop_back
()
void
pop_front
()
void
push_back
(
T
&
)
void
push_front
(
T
&
)
reverse_iterator
rbegin
()
const_reverse_iterator
rbegin
()
reverse_iterator
rend
()
const_reverse_iterator
rend
()
void
resize
(
size_t
,
T
val
=
T
())
size_t
size
()
void
swap
(
deque
&
)
Cython/Includes/libcpp/pair.pxd
0 → 100644
View file @
bcf2668c
cdef
extern
from
"pair.h"
:
cdef
cppclass
pair
[
T
,
U
]:
T
first
U
second
pair
()
pair
(
T
&
,
U
&
)
Cython/Includes/libcpp/queue.pxd
0 → 100644
View file @
bcf2668c
from
pair
cimport
pair
cdef
extern
from
"<queue>"
namespace
"std"
:
cdef
cppclass
queue
[
T
]:
queue
()
#queue(Container&)
T
&
back
()
bool
empty
()
T
&
front
()
void
pop
()
void
push
(
T
&
)
size_t
size
()
Cython/Includes/libcpp/set.pxd
0 → 100644
View file @
bcf2668c
from
pair
cimport
pair
cdef
extern
from
"<set>"
namespace
"std"
:
cdef
cppclass
set
[
T
]:
cppclass
iterator
:
T
operator
*
()
iterator
operator
++
()
bint
operator
==
(
iterator
)
bint
operator
!=
(
iterator
)
cppclass
const_iterator
(
iterator
):
pass
cppclass
reverse_iterator
(
iterator
):
pass
cppclass
const_reverse_iterator
(
iterator
):
pass
set
()
set
(
set
&
)
#set set(key_compare&)
#set& operator=(set&)
bool
operator
==
(
set
&
,
set
&
)
bool
operator
!=
(
set
&
,
set
&
)
bool
operator
<
(
set
&
,
set
&
)
bool
operator
>
(
set
&
,
set
&
)
bool
operator
<=
(
set
&
,
set
&
)
bool
operator
>=
(
set
&
,
set
&
)
iterator
begin
()
const_iterator
begin
()
void
clear
()
#size_t count(key_type&)
bool
empty
()
iterator
end
()
const_iterator
end
()
#pair[iterator, iterator] equal_range(key_type&)
#pair[const_iterator, const_iterator] equal_range(key_type&)
void
erase
(
iterator
)
void
erase
(
iterator
,
iterator
)
#size_t erase(key_type&)
#iterator find(key_type&)
#const_iterator find(key_type&)
#pair[iterator, bool] insert(T&)
iterator
insert
(
iterator
,
T
&
)
#void insert(input_iterator, input_iterator)
#key_compare key_comp()
#iterator lower_bound(key_type&)
#const_iterator lower_bound(key_type&)
size_t
max_size
()
reverse_iterator
rbegin
()
const_reverse_iterator
rbegin
()
reverse_iterator
rend
()
const_reverse_iterator
rend
()
size_t
size
()
void
swap
(
set
&
)
#iterator upper_bound(key_type&)
#const_iterator upper_bound(key_type&)
#value_compare value_comp()
Cython/Includes/libcpp/stack.pxd
0 → 100644
View file @
bcf2668c
from
pair
cimport
pair
cdef
extern
from
"<list>"
namespace
"std"
:
cdef
cppclass
list
[
T
]:
cppclass
iterator
:
T
operator
*
()
iterator
operator
++
()
bint
operator
==
(
iterator
)
bint
operator
!=
(
iterator
)
cppclass
const_iterator
(
iterator
):
pass
cppclass
reverse_iterator
(
iterator
):
pass
cppclass
const_reverse_iterator
(
iterator
):
pass
list
()
list
(
list
&
)
list
(
size_t
,
T
&
)
#list operator=(list&)
bool
operator
==
(
list
&
,
list
&
)
bool
operator
!=
(
list
&
,
list
&
)
bool
operator
<
(
list
&
,
list
&
)
bool
operator
>
(
list
&
,
list
&
)
bool
operator
<=
(
list
&
,
list
&
)
bool
operator
>=
(
list
&
,
list
&
)
void
assign
(
size_t
,
T
&
)
T
&
back
()
iterator
begin
()
const_iterator
begin
()
bool
empty
()
iterator
end
()
const_iterator
end
()
iterator
erase
(
iterator
)
iterator
erase
(
iterator
,
iterator
)
T
&
front
()
iterator
insert
(
iterator
,
T
&
)
void
insert
(
iterator
,
size_t
,
T
&
)
size_t
max_size
()
void
merge
(
list
&
)
#voide merge(list&, BinPred)
void
pop_back
()
void
pop_front
()
void
push_back
(
T
&
)
void
push_front
(
T
&
)
reverse_iterator
rbegin
()
const_reverse_iterator
rbegin
()
void
remove
(
T
&
)
#void remove_if(UnPred)
reverse_iterator
rend
()
const_reverse_iterator
rend
()
void
resize
(
size_t
,
T
&
)
void
reverse
()
size_t
size
()
void
sort
()
#void sort(BinPred)
void
splice
(
iterator
,
list
&
)
void
splice
(
iterator
,
list
&
,
iterator
)
void
splice
(
iterator
,
list
&
,
iterator
,
iterator
)
void
swap
(
list
&
)
void
unique
()
#void unique(BinPred)
Cython/Includes/libcpp/vector.pxd
0 → 100644
View file @
bcf2668c
from
pair
cimport
pair
cdef
extern
from
"<vector>"
namespace
"std"
:
cdef
cppclass
vector
[
T
]:
cppclass
iterator
:
T
operator
*
()
iterator
operator
++
()
bint
operator
==
(
iterator
)
bint
operator
!=
(
iterator
)
cppclass
const_iterator
(
iterator
):
pass
cppclass
reverse_iterator
(
iterator
):
pass
cppclass
const_reverse_iterator
(
iterator
):
pass
#cppclass input_iterator(iterator):
# pass
vector
()
#vector(vector&)
#vector(size_t, T&)
#vector[input_iterator](input_iterator, input_iterator)
T
&
operator
[](
size_t
)
#vector& operator=(vector&)
bool
operator
==
(
vector
&
,
vector
&
)
bool
operator
!=
(
vector
&
,
vector
&
)
bool
operator
<
(
vector
&
,
vector
&
)
bool
operator
>
(
vector
&
,
vector
&
)
bool
operator
<=
(
vector
&
,
vector
&
)
bool
operator
>=
(
vector
&
,
vector
&
)
void
assign
(
size_t
,
T
&
)
#void assign(input_iterator, input_iterator)
T
&
at
(
size_t
)
T
&
back
()
iterator
begin
()
const_iterator
begin
()
size_t
capacity
()
void
clear
()
bool
empty
()
iterator
end
()
const_iterator
end
()
iterator
erase
(
iterator
)
iterator
erase
(
iterator
,
iterator
)
T
&
front
()
iterator
insert
(
iterator
,
T
&
)
void
insert
(
iterator
,
size_t
,
T
&
)
void
insert
(
iterator
,
iterator
,
iterator
)
size_t
max_size
()
void
pop_back
()
void
push_back
(
T
&
)
reverse_iterator
rbegin
()
const_reverse_iterator
rbegin
()
reverse_iterator
rend
()
const_reverse_iterator
rend
()
void
reserve
(
size_t
)
void
resize
(
size_t
,
T
)
size_t
size
()
void
swap
(
vector
&
)
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment