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
19a453c4
Commit
19a453c4
authored
Jan 19, 2011
by
Stefan Behnel
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
clarifications and simplifications in C queue wrapping tutorial
parent
ac8538fb
Changes
1
Show whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
130 additions
and
83 deletions
+130
-83
src/tutorial/clibraries.rst
src/tutorial/clibraries.rst
+130
-83
No files found.
src/tutorial/clibraries.rst
View file @
19a453c4
...
@@ -4,11 +4,10 @@ Using C libraries
...
@@ -4,11 +4,10 @@ Using C libraries
Apart
from
writing
fast
code
,
one
of
the
main
use
cases
of
Cython
is
Apart
from
writing
fast
code
,
one
of
the
main
use
cases
of
Cython
is
to
call
external
C
libraries
from
Python
code
.
As
Cython
code
to
call
external
C
libraries
from
Python
code
.
As
Cython
code
compiles
down
to
C
code
itself
,
it
is
actually
trivial
to
call
C
compiles
down
to
C
code
itself
,
it
is
actually
trivial
to
call
C
functions
directly
in
the
code
.
You
may
have
already
seen
this
in
the
functions
directly
in
the
code
.
The
following
gives
a
complete
simple
tutorial
on
calling
C
functions
.
The
following
gives
a
example
for
using
(
and
wrapping
)
an
external
C
library
in
Cython
code
,
complete
example
for
using
(
and
wrapping
)
an
external
C
library
in
including
appropriate
error
handling
and
considerations
about
Cython
code
,
including
appropriate
error
handling
and
considerations
designing
a
suitable
API
for
Python
and
Cython
code
.
about
designing
a
suitable
API
for
Python
and
Cython
code
.
Imagine
you
need
an
efficient
way
to
store
integer
values
in
a
FIFO
Imagine
you
need
an
efficient
way
to
store
integer
values
in
a
FIFO
queue
.
Since
memory
really
matters
,
and
the
values
are
actually
queue
.
Since
memory
really
matters
,
and
the
values
are
actually
...
@@ -66,13 +65,20 @@ file, say, ``cqueue.pxd``::
...
@@ -66,13 +65,20 @@ file, say, ``cqueue.pxd``::
bint
queue_is_empty
(
Queue
*
queue
)
bint
queue_is_empty
(
Queue
*
queue
)
Note
how
these
declarations
are
almost
identical
to
the
header
file
Note
how
these
declarations
are
almost
identical
to
the
header
file
declarations
,
so
you
can
often
just
copy
them
over
.
One
noteworthy
declarations
,
so
you
can
often
just
copy
them
over
.
However
,
you
do
difference
is
the
first
line
.
``
Queue
``
is
in
this
case
used
as
an
not
need
to
provide
*
all
*
declarations
as
above
,
just
those
that
you
*
opaque
handle
*;
only
the
library
that
is
called
knows
what
is
really
use
in
your
code
or
in
other
declarations
,
so
that
Cython
gets
to
see
inside
.
Since
no
Cython
code
needs
to
know
the
contents
of
the
a
sufficient
and
consistent
subset
of
them
.
Then
,
consider
adapting
struct
,
we
do
not
need
to
declare
its
contents
,
so
we
simply
provide
them
somewhat
to
make
them
more
comfortable
to
work
with
in
Cython
.
an
empty
definition
(
as
we
do
not
want
to
declare
the
``
_Queue
``
type
which
is
referenced
in
the
C
header
)
[#]
_
.
One
noteworthy
difference
to
the
header
file
that
we
use
above
is
the
declaration
of
the
``
Queue
``
struct
in
the
first
line
.
``
Queue
``
is
in
this
case
used
as
an
*
opaque
handle
*;
only
the
library
that
is
called
knows
what
is
really
inside
.
Since
no
Cython
code
needs
to
know
the
contents
of
the
struct
,
we
do
not
need
to
declare
its
contents
,
so
we
simply
provide
an
empty
definition
(
as
we
do
not
want
to
declare
the
``
_Queue
``
type
which
is
referenced
in
the
C
header
)
[#]
_
.
..
[#]
There
's a subtle difference between ``cdef struct Queue: pass``
..
[#]
There
's a subtle difference between ``cdef struct Queue: pass``
and ``ctypedef struct Queue: pass``. The former declares a
and ``ctypedef struct Queue: pass``. The former declares a
...
@@ -82,20 +88,26 @@ which is referenced in the C header) [#]_.
...
@@ -82,20 +88,26 @@ which is referenced in the C header) [#]_.
libraries use the ``ctypedef`` kind of struct.
libraries use the ``ctypedef`` kind of struct.
Another exception is the last line. The integer return value of the
Another exception is the last line. The integer return value of the
``queue_is_empty`` method is actually a C boolean value, i.e. it is
``queue_is_empty()`` function is actually a C boolean value, i.e. the
either zero or non-zero, indicating if the queue is empty or not.
only interesting thing about it is whether it is non-zero or zero,
This is best expressed by Cython'
s
``
bint
``
type
,
which
is
a
normal
indicating if the queue is empty or not. This is best expressed by
``
int
``
type
when
used
in
C
but
maps
to
Python
's boolean values
Cython'
s
``
bint
``
type
,
which
is
a
normal
``
int
``
type
when
used
in
C
``True`` and ``False`` when converted to a Python object.
but
maps
to
Python
's boolean values ``True`` and ``False`` when
converted to a Python object. This way of tightening declarations in
Next, we need to design the Queue class that should wrap the C queue.
a ``.pxd`` file can often simplify the code that uses them.
It will live in a file called ``queue.pyx``. [#]_
After declaring our C library, we can start to design the Queue class
that should wrap the C queue. It will live in a file called
``queue.pyx``. [#]_
.. [#] Note that the name of the ``.pyx`` file must be different from
.. [#] Note that the name of the ``.pyx`` file must be different from
the ``cqueue.pxd`` file with declarations from the C library,
the ``cqueue.pxd`` file with declarations from the C library,
as both do not describe the same code. A ``.pxd`` file next to
as both do not describe the same code. A ``.pxd`` file next to
a ``.pyx`` file with the same name defines exported
a ``.pyx`` file with the same name defines exported
declarations for code in the ``.pyx`` file.
declarations for code in the ``.pyx`` file. As the
``cqueue.pxd`` file contains declarations of a regular C
library, there must not be a ``.pyx`` file with the same name
that Cython associates with it.
Here is a first start for the Queue class::
Here is a first start for the Queue class::
...
@@ -134,13 +146,9 @@ only reason why the above can fail is due to insufficient memory. In
...
@@ -134,13 +146,9 @@ only reason why the above can fail is due to insufficient memory. In
that
case
,
it
will
return
``
NULL
``,
whereas
it
would
normally
return
a
that
case
,
it
will
return
``
NULL
``,
whereas
it
would
normally
return
a
pointer
to
the
new
queue
.
pointer
to
the
new
queue
.
The
normal
Python
way
to
get
out
of
this
is
to
raise
an
exception
,
but
The
Python
way
to
get
out
of
this
is
to
raise
a
``
MemoryError
``
[#]
_
.
in
this
specific
case
,
allocating
a
new
exception
instance
may
We
can
thus
change
the
init
function
as
follows
::
actually
fail
because
we
are
running
out
of
memory
.
Luckily
,
CPython
provides
a
function
``
PyErr_NoMemory
()``
that
safely
raises
the
right
exception
for
us
.
We
can
thus
change
the
init
function
as
follows
::
cimport
cpython
.
exc
#
standard
cimport
from
CPython
's C-API
cimport
cqueue
cimport
cqueue
cdef
class
Queue
:
cdef
class
Queue
:
...
@@ -148,13 +156,22 @@ exception for us. We can thus change the init function as follows::
...
@@ -148,13 +156,22 @@ exception for us. We can thus change the init function as follows::
def
__cinit__
(
self
):
def
__cinit__
(
self
):
self
.
_c_queue
=
cqueue
.
queue_new
()
self
.
_c_queue
=
cqueue
.
queue_new
()
if
self
.
_c_queue
is
NULL
:
if
self
.
_c_queue
is
NULL
:
cpython.exc.PyErr_NoMemory()
raise
MemoryError
()
The ``cpython`` package contains pre-defined ``.pxd`` files that ship
..
[#]
In
the
specific
case
of
a
``
MemoryError
``,
creating
a
new
with Cython. If you need any CPython C-API functions, you can cimport
exception
instance
in
order
to
raise
it
may
actually
fail
because
them from this package. See Cython'
s
``
Cython
/
Includes
/``
source
we
are
running
out
of
memory
.
Luckily
,
CPython
provides
a
C
-
API
package
for
a
complete
list
of
``.
pxd
``
files
,
including
parts
of
the
function
``
PyErr_NoMemory
()``
that
safely
raises
the
right
standard
C
library
.
exception
for
us
.
As
of
version
0.14.1
,
Cython
automatically
substitutes
this
C
-
API
call
whenever
you
write
``
raise
MemoryError
``
or
``
raise
MemoryError
()``.
If
you
use
an
older
version
,
you
have
to
cimport
the
C
-
API
function
from
the
standard
package
``
cpython
.
exc
``
and
call
it
directly
.
This
package
contains
pre
-
defined
``.
pxd
``
files
that
ship
with
Cython
.
If
you
need
any
CPython
C
-
API
functions
,
you
can
cimport
them
from
there
.
See
Cython
's ``Cython/Includes/`` source package for a complete
list of provided ``.pxd`` files, including parts of the standard C
library.
The next thing to do is to clean up when the Queue instance is no
The next thing to do is to clean up when the Queue instance is no
longer used (i.e. all references to it have been deleted). To this
longer used (i.e. all references to it have been deleted). To this
...
@@ -169,7 +186,7 @@ the init method::
...
@@ -169,7 +186,7 @@ the init method::
At this point, we have a working Cython module that we can test. To
At this point, we have a working Cython module that we can test. To
compile it, we need to configure a ``setup.py`` script for distutils.
compile it, we need to configure a ``setup.py`` script for distutils.
Reusing
the
basic
script
from
the
main
tutorial
::
Here is the most basic script for compiling a Cython module
::
from distutils.core import setup
from distutils.core import setup
from distutils.extension import Extension
from distutils.extension import Extension
...
@@ -180,10 +197,10 @@ Reusing the basic script from the main tutorial::
...
@@ -180,10 +197,10 @@ Reusing the basic script from the main tutorial::
ext_modules = [Extension("queue", ["queue.pyx"])]
ext_modules = [Extension("queue", ["queue.pyx"])]
)
)
We
can
extend
this
script
to
include
the
necessary
setup
for
building
To build against the external C library, we must extend this script to
against
the
external
C
library
.
Assuming
it
's installed in the normal
include the necessary setup. Assuming the library is installed in the
places (e.g. under ``/usr/lib`` and ``/usr/include`` on a Unix-like
usual places (e.g. under ``/usr/lib`` and ``/usr/include`` on a
system), we could simply change the extension setup from
Unix-like
system), we could simply change the extension setup from
::
::
...
@@ -220,8 +237,8 @@ practice to look at what interfaces Python offers, e.g. in its
...
@@ -220,8 +237,8 @@ practice to look at what interfaces Python offers, e.g. in its
queue
,
it
's enough to provide the methods ``append()``, ``peek()`` and
queue
,
it
's enough to provide the methods ``append()``, ``peek()`` and
``pop()``, and additionally an ``extend()`` method to add multiple
``pop()``, and additionally an ``extend()`` method to add multiple
values at once. Also, since we already know that all values will be
values at once. Also, since we already know that all values will be
coming from C, it'
s
be
tter
to
provide
only
``
cdef
``
methods
for
now
,
coming from C, it'
s
be
st
to
provide
only
``
cdef
``
methods
for
now
,
and
and
to
give
them
a
straight
C
interface
.
to
give
them
a
straight
C
interface
.
In
C
,
it
is
common
for
data
structures
to
store
data
as
a
``
void
*``
to
In
C
,
it
is
common
for
data
structures
to
store
data
as
a
``
void
*``
to
whatever
data
item
type
.
Since
we
only
want
to
store
``
int
``
values
,
whatever
data
item
type
.
Since
we
only
want
to
store
``
int
``
values
,
...
@@ -242,18 +259,18 @@ implementation instead::
...
@@ -242,18 +259,18 @@ implementation instead::
cdef
append
(
self
,
int
value
):
cdef
append
(
self
,
int
value
):
if
not
cqueue
.
queue_push_tail
(
self
.
_c_queue
,
if
not
cqueue
.
queue_push_tail
(
self
.
_c_queue
,
<
void
*>
value
):
<
void
*>
value
):
cpython
.
exc
.
PyErr_NoMemory
()
raise
MemoryError
()
Adding
an
``
extend
()``
method
should
now
be
straight
forward
::
Adding
an
``
extend
()``
method
should
now
be
straight
forward
::
cdef
extend
(
self
,
int
*
values
,
Py_s
size_t
count
):
cdef
extend
(
self
,
int
*
values
,
size_t
count
):
"""Append all ints to the queue.
"""Append all ints to the queue.
"""
"""
cdef
Py_s
size_t
i
cdef
size_t
i
for
i
in
range
(
count
):
for
i
in
range
(
count
):
if
not
cqueue
.
queue_push_tail
(
if
not
cqueue
.
queue_push_tail
(
self
.
_c_queue
,
<
void
*>
values
[
i
]):
self
.
_c_queue
,
<
void
*>
values
[
i
]):
cpython
.
exc
.
PyErr_NoMemory
()
raise
MemoryError
()
This
becomes
handy
when
reading
values
from
a
NumPy
array
,
for
This
becomes
handy
when
reading
values
from
a
NumPy
array
,
for
example
.
example
.
...
@@ -278,7 +295,7 @@ first case to raise an exception, whereas the second case should
...
@@ -278,7 +295,7 @@ first case to raise an exception, whereas the second case should
simply
return
``
0
``.
To
deal
with
this
,
we
need
to
special
case
this
simply
return
``
0
``.
To
deal
with
this
,
we
need
to
special
case
this
value
,
and
check
if
the
queue
really
is
empty
or
not
::
value
,
and
check
if
the
queue
really
is
empty
or
not
::
cdef
int
peek
(
self
)
except
?
0
:
cdef
int
peek
(
self
)
except
?
-
1
:
cdef
int
value
=
\
cdef
int
value
=
\
<
int
>
cqueue
.
queue_peek_head
(
self
.
_c_queue
)
<
int
>
cqueue
.
queue_peek_head
(
self
.
_c_queue
)
if
value
==
0
:
if
value
==
0
:
...
@@ -288,44 +305,66 @@ value, and check if the queue really is empty or not::
...
@@ -288,44 +305,66 @@ value, and check if the queue really is empty or not::
raise
IndexError
(
"Queue is empty"
)
raise
IndexError
(
"Queue is empty"
)
return
value
return
value
The
``
except
?
0
``
declaration
is
worth
explaining
.
If
the
function
Note
how
we
have
effectively
created
a
fast
path
through
the
method
in
was
a
Python
function
returning
a
Python
object
value
,
CPython
would
the
hopefully
common
cases
that
the
return
value
is
not
``
0
``.
Only
simply
return
``
NULL
``
instead
of
a
Python
object
to
indicate
a
raised
that
specific
case
needs
an
additional
check
if
the
queue
is
empty
.
exception
,
which
would
immediately
be
propagated
by
the
surrounding
code
.
The
problem
is
that
any
``
int
``
value
is
a
valid
queue
item
The
``
except
?
-
1
``
declaration
in
the
method
signature
falls
into
the
value
,
so
there
is
no
way
to
explicitly
indicate
an
error
to
the
same
category
.
If
the
function
was
a
Python
function
returning
a
calling
code
.
Python
object
value
,
CPython
would
simply
return
``
NULL
``
internally
instead
of
a
Python
object
to
indicate
an
exception
,
which
would
The
only
way
CPython
(
and
Cython
)
can
deal
with
this
situation
is
to
immediately
be
propagated
by
the
surrounding
code
.
The
problem
is
call
``
PyErr_Occurred
()``
when
returning
from
a
function
to
check
if
that
the
return
type
is
``
int
``
and
any
``
int
``
value
is
a
valid
queue
an
exception
was
raised
,
and
if
so
,
propagate
the
exception
.
This
item
value
,
so
there
is
no
way
to
explicitly
signal
an
error
to
the
calling
code
.
In
fact
,
without
such
a
declaration
,
there
is
no
obvious
way
for
Cython
to
know
what
to
return
on
exceptions
and
for
calling
code
to
even
know
that
this
method
*
may
*
exit
with
an
exception
.
The
only
way
calling
code
can
deal
with
this
situation
is
to
call
``
PyErr_Occurred
()``
when
returning
from
a
function
to
check
if
an
exception
was
raised
,
and
if
so
,
propagate
the
exception
.
This
obviously
has
a
performance
penalty
.
Cython
therefore
allows
you
to
obviously
has
a
performance
penalty
.
Cython
therefore
allows
you
to
indicate
which
value
is
explicitly
returned
in
the
case
of
an
declare
which
value
it
should
implicitly
return
in
the
case
of
an
exception
,
so
that
the
surrounding
code
only
needs
to
check
for
an
exception
,
so
that
the
surrounding
code
only
needs
to
check
for
an
exception
when
receiving
this
exact
value
.
All
other
values
will
be
exception
when
receiving
this
exact
value
.
accepted
almost
without
a
penalty
.
We
chose
to
use
``-
1
``
as
the
exception
return
value
as
we
expect
it
to
be
an
unlikely
value
to
be
put
into
the
queue
.
The
question
mark
in
the
``
except
?
-
1
``
declaration
indicates
that
the
return
value
is
ambiguous
(
there
*
may
*
be
a
``-
1
``
value
in
the
queue
,
after
all
)
and
that
an
additional
exception
check
using
``
PyErr_Occurred
()``
is
needed
in
calling
code
.
Without
it
,
Cython
code
that
calls
this
method
and
receives
the
exception
return
value
would
silently
(
and
sometimes
incorrectly
)
assume
that
an
exception
has
been
raised
.
In
any
case
,
all
other
return
values
will
be
passed
through
almost
without
a
penalty
,
thus
again
creating
a
fast
path
for
'normal'
values
.
Now
that
the
``
peek
()``
method
is
implemented
,
the
``
pop
()``
method
Now
that
the
``
peek
()``
method
is
implemented
,
the
``
pop
()``
method
also
needs
adaptation
.
Since
it
removes
a
value
from
the
queue
,
also
needs
adaptation
.
Since
it
removes
a
value
from
the
queue
,
however
,
it
is
not
enough
to
test
if
the
queue
is
empty
*
after
*
the
however
,
it
is
not
enough
to
test
if
the
queue
is
empty
*
after
*
the
removal
.
Instead
,
we
must
test
it
on
entry
::
removal
.
Instead
,
we
must
test
it
on
entry
::
cdef
int
pop
(
self
)
except
?
0
:
cdef
int
pop
(
self
)
except
?
-
1
:
if
cqueue
.
queue_is_empty
(
self
.
_c_queue
):
if
cqueue
.
queue_is_empty
(
self
.
_c_queue
):
raise
IndexError
(
"Queue is empty"
)
raise
IndexError
(
"Queue is empty"
)
return
<
int
>
cqueue
.
queue_pop_head
(
self
.
_c_queue
)
return
<
int
>
cqueue
.
queue_pop_head
(
self
.
_c_queue
)
The
return
value
for
exception
propagation
is
declared
exactly
as
for
``
peek
()``.
Lastly
,
we
can
provide
the
Queue
with
an
emptiness
indicator
in
the
Lastly
,
we
can
provide
the
Queue
with
an
emptiness
indicator
in
the
normal
Python
way
by
defining
the
``
__bool__
()``
special
method
(
note
normal
Python
way
by
implementing
the
``
__bool__
()``
special
method
that
Python
2
calls
this
method
``
__nonzero__
``,
whereas
Cython
code
(
note
that
Python
2
calls
this
method
``
__nonzero__
``,
whereas
Cython
c
an
use
both
)::
c
ode
can
use
either
name
)::
def
__bool__
(
self
):
def
__bool__
(
self
):
return
not
cqueue
.
queue_is_empty
(
self
.
_c_queue
)
return
not
cqueue
.
queue_is_empty
(
self
.
_c_queue
)
Note
that
this
method
returns
either
``
True
``
or
``
False
``
as
we
Note
that
this
method
returns
either
``
True
``
or
``
False
``
as
we
declared
the
return
type
of
the
``
queue_is_empty
``
function
as
declared
the
return
type
of
the
``
queue_is_empty
``
function
as
``
bint
``.
``
bint
``
in
``
cqueue
.
pxd
``
.
Now
that
the
implementation
is
complete
,
you
may
want
to
write
some
Now
that
the
implementation
is
complete
,
you
may
want
to
write
some
tests
for
it
to
make
sure
it
works
correctly
.
Especially
doctests
are
tests
for
it
to
make
sure
it
works
correctly
.
Especially
doctests
are
...
@@ -345,14 +384,22 @@ The following listing shows the complete implementation that uses
...
@@ -345,14 +384,22 @@ The following listing shows the complete implementation that uses
``
cpdef
``
methods
where
possible
::
``
cpdef
``
methods
where
possible
::
cimport
cqueue
cimport
cqueue
cimport
cpython
.
exc
cdef
class
Queue
:
cdef
class
Queue
:
"""A queue class for C integer values.
>>> q = Queue()
>>> q.append(5)
>>> q.peek()
5
>>> q.pop()
5
"""
cdef
cqueue
.
Queue
*
_c_queue
cdef
cqueue
.
Queue
*
_c_queue
def
__cinit__
(
self
):
def
__cinit__
(
self
):
self
.
_c_queue
=
cqueue
.
queue_new
()
self
.
_c_queue
=
cqueue
.
queue_new
()
if
self
.
_c_queue
is
NULL
:
if
self
.
_c_queue
is
NULL
:
cpython
.
exc
.
PyErr_NoMemory
()
raise
MemoryError
()
def
__dealloc__
(
self
):
def
__dealloc__
(
self
):
if
self
.
_c_queue
is
not
NULL
:
if
self
.
_c_queue
is
not
NULL
:
...
@@ -361,16 +408,16 @@ The following listing shows the complete implementation that uses
...
@@ -361,16 +408,16 @@ The following listing shows the complete implementation that uses
cpdef
append
(
self
,
int
value
):
cpdef
append
(
self
,
int
value
):
if
not
cqueue
.
queue_push_tail
(
self
.
_c_queue
,
if
not
cqueue
.
queue_push_tail
(
self
.
_c_queue
,
<
void
*>
value
):
<
void
*>
value
):
cpython
.
exc
.
PyErr_NoMemory
()
raise
MemoryError
()
cdef
extend
(
self
,
int
*
values
,
Py_s
size_t
count
):
cdef
extend
(
self
,
int
*
values
,
size_t
count
):
cdef
Py_s
size_t
i
cdef
size_t
i
for
i
in
xrange
(
count
):
for
i
in
xrange
(
count
):
if
not
cqueue
.
queue_push_tail
(
if
not
cqueue
.
queue_push_tail
(
self
.
_c_queue
,
<
void
*>
values
[
i
]):
self
.
_c_queue
,
<
void
*>
values
[
i
]):
cpython
.
exc
.
PyErr_NoMemory
()
raise
MemoryError
()
cpdef
int
peek
(
self
)
except
?
0
:
cpdef
int
peek
(
self
)
except
?
-
1
:
cdef
int
value
=
\
cdef
int
value
=
\
<
int
>
cqueue
.
queue_peek_head
(
self
.
_c_queue
)
<
int
>
cqueue
.
queue_peek_head
(
self
.
_c_queue
)
if
value
==
0
:
if
value
==
0
:
...
@@ -380,7 +427,7 @@ The following listing shows the complete implementation that uses
...
@@ -380,7 +427,7 @@ The following listing shows the complete implementation that uses
raise
IndexError
(
"Queue is empty"
)
raise
IndexError
(
"Queue is empty"
)
return
value
return
value
cdef
int
pop
(
self
)
except
?
0
:
cdef
int
pop
(
self
)
except
?
-
1
:
if
cqueue
.
queue_is_empty
(
self
.
_c_queue
):
if
cqueue
.
queue_is_empty
(
self
.
_c_queue
):
raise
IndexError
(
"Queue is empty"
)
raise
IndexError
(
"Queue is empty"
)
return
<
int
>
cqueue
.
queue_pop_head
(
self
.
_c_queue
)
return
<
int
>
cqueue
.
queue_pop_head
(
self
.
_c_queue
)
...
@@ -394,23 +441,23 @@ types. However, if wanted, we can rename the C-ish ``extend()``
...
@@ -394,23 +441,23 @@ types. However, if wanted, we can rename the C-ish ``extend()``
method
to
e
.
g
.
``
c_extend
()``,
and
write
a
new
``
extend
()``
method
method
to
e
.
g
.
``
c_extend
()``,
and
write
a
new
``
extend
()``
method
instead
that
accepts
an
arbitrary
Python
iterable
::
instead
that
accepts
an
arbitrary
Python
iterable
::
cdef
c_extend
(
self
,
int
*
values
,
Py_s
size_t
count
):
cdef
c_extend
(
self
,
int
*
values
,
size_t
count
):
cdef
Py_s
size_t
i
cdef
size_t
i
for
i
in
range
(
count
):
for
i
in
range
(
count
):
if
not
cqueue
.
queue_push_tail
(
if
not
cqueue
.
queue_push_tail
(
self
.
_c_queue
,
<
void
*>
values
[
i
]):
self
.
_c_queue
,
<
void
*>
values
[
i
]):
cpython
.
exc
.
PyErr_NoMemory
()
raise
MemoryError
()
cpdef
extend
(
self
,
values
):
cpdef
extend
(
self
,
values
):
for
value
in
values
:
for
value
in
values
:
self
.
append
(
value
)
self
.
append
(
value
)
As
a
quick
test
with
numbers
from
0
to
9999
on
the
author
's machine
As
a
quick
test
with
10000
numbers
on
the
author
's machine indicates,
indicates, using this Queue from Cython code with C ``int`` values is
using this Queue from Cython code with C ``int`` values is about five
about five times as fast as using it from Cython code with Python
times as fast as using it from Cython code with Python object values,
values, almost eight times faster than using it from Python code in a
almost eight times faster than using it from Python code in a Python
Python loop, and still more than twice as fast as using Python'
s
loop, and still more than twice as fast as using Python'
s
highly
highly
optimised
``
collections
.
deque
``
type
from
Cython
code
with
optimised
``
collections
.
deque
``
type
from
Cython
code
with
Python
Python
integers
.
integers
.
..
[
CAlg
]
Simon
Howard
,
C
Algorithms
library
,
http
://
c
-
algorithms
.
sourceforge
.
net
/
..
[
CAlg
]
Simon
Howard
,
C
Algorithms
library
,
http
://
c
-
algorithms
.
sourceforge
.
net
/
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