Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
C
cpython
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
0
Issues
0
List
Boards
Labels
Milestones
Merge Requests
0
Merge Requests
0
Analytics
Analytics
Repository
Value Stream
Wiki
Wiki
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Commits
Issue Boards
Open sidebar
Kirill Smelkov
cpython
Commits
863983e8
Commit
863983e8
authored
Apr 23, 2003
by
Raymond Hettinger
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Add comment on performance.
Fix missing right parenthesis. Add three examples.
parent
a69d409f
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
21 additions
and
3 deletions
+21
-3
Doc/lib/libitertools.tex
Doc/lib/libitertools.tex
+21
-3
No files found.
Doc/lib/libitertools.tex
View file @
863983e8
...
...
@@ -27,14 +27,21 @@ which produces a sequence \code{f(0), f(1), ...}. This toolbox
provides
\function
{
imap()
}
and
\function
{
count()
}
which can be combined
to form
\code
{
imap(f, count())
}
and produce an equivalent result.
Likewise, the functional tools are designed to work well with the
high-speed functions provided by the
\refmodule
{
operator
}
module.
The module author welcomes suggestions for other basic building blocks
to be added to future versions of the module.
Whether cast in pure python form or C code, tools that use iterators
are more memory efficient (and faster) than their list based counterparts.
Adopting the principles of just-in-time manufacturing, they create
data when and where needed instead of consuming memory with the
computer equivalent of ``inventory''.
The module author welcomes suggestions for other basic building blocks
to be added to future versions of the module.
The performance advantage of iterators becomes more acute as the number
of elements increases -- at some point, lists grow large enough to
to severely impact memory cache performance and start running slowly.
\begin{seealso}
\seetext
{
The Standard ML Basis Library,
...
...
@@ -105,7 +112,7 @@ by functions or loops that truncate the stream.
Note, this is the only member of the toolkit that may require
significant auxiliary storage (depending on the length of the
iterable.
iterable
)
.
\end{funcdesc}
\begin{funcdesc}
{
dropwhile
}{
predicate, iterable
}
...
...
@@ -355,4 +362,15 @@ from building blocks.
... "s
-
>
(
s
0
,s
1
)
,
(
s
1
,s
2
)
,
(
s
2
, s
3
)
, ..."
... return izip
(
seq, islice
(
seq,
1
,len
(
seq
)))
>>> def padnone
(
seq
)
:
... "Returns the sequence elements and then returns None indefinitely"
... return chain
(
seq, repeat
(
None
))
>>> def ncycles
(
seq, n
)
:
... "Returns the sequence elements n times"
... return chain
(*
repeat
(
seq, n
))
>>> def dotproduct
(
vec
1
, vec
2
)
:
... return sum
(
imap
(
operator.mul, vec
1
, vec
2
))
\end
{
verbatim
}
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