[Python-modules-commits] [python-datrie] 01/03: import python-datrie_0.7.1.orig.tar.gz

Ondřej Nový onovy at moszumanska.debian.org
Mon Jun 27 12:42:27 UTC 2016


This is an automated email from the git hooks/post-receive script.

onovy pushed a commit to branch master
in repository python-datrie.

commit 2a0b14f84a2b1c84d01e5e90a0f9cd22197402f5
Author: Filip Pytloun <filip at pytloun.cz>
Date:   Mon Jun 27 14:33:10 2016 +0200

    import python-datrie_0.7.1.orig.tar.gz
---
 CHANGES.rst                           |    95 +
 COPYING                               |   510 +
 MANIFEST.in                           |    15 +
 PKG-INFO                              |   472 +
 README.rst                            |   350 +
 datrie.egg-info/PKG-INFO              |   472 +
 datrie.egg-info/SOURCES.txt           |    52 +
 datrie.egg-info/dependency_links.txt  |     1 +
 datrie.egg-info/top_level.txt         |     1 +
 libdatrie/datrie/alpha-map-private.h  |    56 +
 libdatrie/datrie/alpha-map.c          |   458 +
 libdatrie/datrie/alpha-map.h          |    90 +
 libdatrie/datrie/darray.c             |   848 +
 libdatrie/datrie/darray.h             |   112 +
 libdatrie/datrie/dstring-private.h    |    45 +
 libdatrie/datrie/dstring.c            |   189 +
 libdatrie/datrie/dstring.h            |    62 +
 libdatrie/datrie/fileutils.c          |   114 +
 libdatrie/datrie/fileutils.h          |    49 +
 libdatrie/datrie/tail.c               |   521 +
 libdatrie/datrie/tail.h               |   100 +
 libdatrie/datrie/trie-private.h       |    63 +
 libdatrie/datrie/trie-string.c        |   114 +
 libdatrie/datrie/trie-string.h        |    65 +
 libdatrie/datrie/trie.c               |  1125 ++
 libdatrie/datrie/trie.h               |   235 +
 libdatrie/datrie/triedefs.h           |    84 +
 libdatrie/datrie/typedefs.h           |   132 +
 libdatrie/tests/test_file.c           |   131 +
 libdatrie/tests/test_iterator.c       |   136 +
 libdatrie/tests/test_nonalpha.c       |    92 +
 libdatrie/tests/test_null_trie.c      |    97 +
 libdatrie/tests/test_store-retrieve.c |   201 +
 libdatrie/tests/test_walk.c           |   549 +
 libdatrie/tests/utils.c               |   168 +
 libdatrie/tests/utils.h               |    59 +
 libdatrie/tools/trietool.c            |   606 +
 setup.cfg                             |     8 +
 setup.py                              |    58 +
 src/cdatrie.c                         |  1557 ++
 src/cdatrie.pxd                       |   112 +
 src/datrie.c                          | 28049 ++++++++++++++++++++++++++++++++
 src/datrie.pyx                        |  1139 ++
 src/stdio_ext.c                       |  1554 ++
 src/stdio_ext.pxd                     |     4 +
 tests/__init__.py                     |     2 +
 tests/test_iteration.py               |   113 +
 tests/test_random.py                  |    73 +
 tests/test_state.py                   |    26 +
 tests/test_trie.py                    |   425 +
 tox-bench.ini                         |     8 +
 tox.ini                               |     8 +
 update_c.sh                           |     2 +
 53 files changed, 41607 insertions(+)

diff --git a/CHANGES.rst b/CHANGES.rst
new file mode 100644
index 0000000..5232067
--- /dev/null
+++ b/CHANGES.rst
@@ -0,0 +1,95 @@
+
+CHANGES
+=======
+
+0.7.1 (2016-03-12)
+------------------
+
+* updated the bundled C library to version 0.2.9;
+* implemented ``Trie.__len__`` in terms of ``trie_enumerate``;
+* rebuilt Cython wrapper with Cython 0.23.4;
+* changed ``Trie`` to implement ``collections.abc.MutableMapping``;
+* fixed ``Trie`` pickling, which segfaulted on Python2.X.
+
+0.7 (2014-02-18)
+----------------
+
+* bundled libdatrie C library is updated to version 0.2.8;
+* new `.suffixes()` method (thanks Ahmed T. Youssef);
+* wrapper is rebuilt with Cython 0.20.1.
+
+0.6.1 (2013-09-21)
+------------------
+
+* fixed build for Visual Studio (thanks Gabi Davar).
+
+0.6 (2013-07-09)
+----------------
+
+* datrie is rebuilt with Cython 0.19.1;
+* ``iter_prefix_values``, ``prefix_values`` and ``longest_prefix_value``
+  methods for ``datrie.BaseTrie`` and ``datrie.Trie`` (thanks Jared Suttles).
+
+0.5.1 (2013-01-30)
+------------------
+
+* Recently introduced memory leak in ``longest_prefix``
+  and ``longest_prefix_item`` is fixed.
+
+0.5 (2013-01-29)
+----------------
+
+* ``longest_prefix`` and ``longest_prefix_item`` methods are fixed;
+* datrie is rebuilt with Cython 0.18;
+* misleading benchmark results in README are fixed;
+* State._walk is renamed to State.walk_char.
+
+0.4.2 (2012-09-02)
+------------------
+
+* Update to latest libdatrie; this makes ``.keys()`` method a bit slower but
+  removes a keys length limitation.
+
+0.4.1 (2012-07-29)
+------------------
+
+* cPickle is used for saving/loading ``datrie.Trie`` if it is available.
+
+0.4 (2012-07-27)
+----------------
+
+* ``libdatrie`` improvements and bugfixes, including C iterator API support;
+* custom iteration support using ``datrie.State`` and ``datrie.Iterator``.
+* speed improvements: ``__length__``, ``keys``, ``values`` and
+  ``items`` methods should be up to 2x faster.
+* keys longer than 32768 are not supported in this release.
+
+
+0.3 (2012-07-21)
+----------------
+
+There are no new features or speed improvements in this release.
+
+* ``datrie.new`` is deprecated; use ``datrie.Trie`` with the same arguments;
+* small test & benchmark improvements.
+
+0.2 (2012-07-16)
+----------------
+
+* ``datrie.Trie`` items can have any Python object as a value
+  (``Trie`` from 0.1.x becomes ``datrie.BaseTrie``);
+* ``longest_prefix`` and ``longest_prefix_items`` are fixed;
+* ``save`` & ``load`` are rewritten;
+* ``setdefault`` method.
+
+
+0.1.1 (2012-07-13)
+------------------
+
+* Windows support (upstream libdatrie changes are merged);
+* license is changed from LGPL v3 to LGPL v2.1 to match the libdatrie license.
+
+0.1 (2012-07-12)
+----------------
+
+Initial release.
diff --git a/COPYING b/COPYING
new file mode 100644
index 0000000..2d2d780
--- /dev/null
+++ b/COPYING
@@ -0,0 +1,510 @@
+
+                  GNU LESSER GENERAL PUBLIC LICENSE
+                       Version 2.1, February 1999
+
+ Copyright (C) 1991, 1999 Free Software Foundation, Inc.
+	51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+[This is the first released version of the Lesser GPL.  It also counts
+ as the successor of the GNU Library Public License, version 2, hence
+ the version number 2.1.]
+
+                            Preamble
+
+  The licenses for most software are designed to take away your
+freedom to share and change it.  By contrast, the GNU General Public
+Licenses are intended to guarantee your freedom to share and change
+free software--to make sure the software is free for all its users.
+
+  This license, the Lesser General Public License, applies to some
+specially designated software packages--typically libraries--of the
+Free Software Foundation and other authors who decide to use it.  You
+can use it too, but we suggest you first think carefully about whether
+this license or the ordinary General Public License is the better
+strategy to use in any particular case, based on the explanations
+below.
+
+  When we speak of free software, we are referring to freedom of use,
+not price.  Our General Public Licenses are designed to make sure that
+you have the freedom to distribute copies of free software (and charge
+for this service if you wish); that you receive source code or can get
+it if you want it; that you can change the software and use pieces of
+it in new free programs; and that you are informed that you can do
+these things.
+
+  To protect your rights, we need to make restrictions that forbid
+distributors to deny you these rights or to ask you to surrender these
+rights.  These restrictions translate to certain responsibilities for
+you if you distribute copies of the library or if you modify it.
+
+  For example, if you distribute copies of the library, whether gratis
+or for a fee, you must give the recipients all the rights that we gave
+you.  You must make sure that they, too, receive or can get the source
+code.  If you link other code with the library, you must provide
+complete object files to the recipients, so that they can relink them
+with the library after making changes to the library and recompiling
+it.  And you must show them these terms so they know their rights.
+
+  We protect your rights with a two-step method: (1) we copyright the
+library, and (2) we offer you this license, which gives you legal
+permission to copy, distribute and/or modify the library.
+
+  To protect each distributor, we want to make it very clear that
+there is no warranty for the free library.  Also, if the library is
+modified by someone else and passed on, the recipients should know
+that what they have is not the original version, so that the original
+author's reputation will not be affected by problems that might be
+introduced by others.
+

+  Finally, software patents pose a constant threat to the existence of
+any free program.  We wish to make sure that a company cannot
+effectively restrict the users of a free program by obtaining a
+restrictive license from a patent holder.  Therefore, we insist that
+any patent license obtained for a version of the library must be
+consistent with the full freedom of use specified in this license.
+
+  Most GNU software, including some libraries, is covered by the
+ordinary GNU General Public License.  This license, the GNU Lesser
+General Public License, applies to certain designated libraries, and
+is quite different from the ordinary General Public License.  We use
+this license for certain libraries in order to permit linking those
+libraries into non-free programs.
+
+  When a program is linked with a library, whether statically or using
+a shared library, the combination of the two is legally speaking a
+combined work, a derivative of the original library.  The ordinary
+General Public License therefore permits such linking only if the
+entire combination fits its criteria of freedom.  The Lesser General
+Public License permits more lax criteria for linking other code with
+the library.
+
+  We call this license the "Lesser" General Public License because it
+does Less to protect the user's freedom than the ordinary General
+Public License.  It also provides other free software developers Less
+of an advantage over competing non-free programs.  These disadvantages
+are the reason we use the ordinary General Public License for many
+libraries.  However, the Lesser license provides advantages in certain
+special circumstances.
+
+  For example, on rare occasions, there may be a special need to
+encourage the widest possible use of a certain library, so that it
+becomes a de-facto standard.  To achieve this, non-free programs must
+be allowed to use the library.  A more frequent case is that a free
+library does the same job as widely used non-free libraries.  In this
+case, there is little to gain by limiting the free library to free
+software only, so we use the Lesser General Public License.
+
+  In other cases, permission to use a particular library in non-free
+programs enables a greater number of people to use a large body of
+free software.  For example, permission to use the GNU C Library in
+non-free programs enables many more people to use the whole GNU
+operating system, as well as its variant, the GNU/Linux operating
+system.
+
+  Although the Lesser General Public License is Less protective of the
+users' freedom, it does ensure that the user of a program that is
+linked with the Library has the freedom and the wherewithal to run
+that program using a modified version of the Library.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.  Pay close attention to the difference between a
+"work based on the library" and a "work that uses the library".  The
+former contains code derived from the library, whereas the latter must
+be combined with the library in order to run.
+

+                  GNU LESSER GENERAL PUBLIC LICENSE
+   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+  0. This License Agreement applies to any software library or other
+program which contains a notice placed by the copyright holder or
+other authorized party saying it may be distributed under the terms of
+this Lesser General Public License (also called "this License").
+Each licensee is addressed as "you".
+
+  A "library" means a collection of software functions and/or data
+prepared so as to be conveniently linked with application programs
+(which use some of those functions and data) to form executables.
+
+  The "Library", below, refers to any such software library or work
+which has been distributed under these terms.  A "work based on the
+Library" means either the Library or any derivative work under
+copyright law: that is to say, a work containing the Library or a
+portion of it, either verbatim or with modifications and/or translated
+straightforwardly into another language.  (Hereinafter, translation is
+included without limitation in the term "modification".)
+
+  "Source code" for a work means the preferred form of the work for
+making modifications to it.  For a library, complete source code means
+all the source code for all modules it contains, plus any associated
+interface definition files, plus the scripts used to control
+compilation and installation of the library.
+
+  Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope.  The act of
+running a program using the Library is not restricted, and output from
+such a program is covered only if its contents constitute a work based
+on the Library (independent of the use of the Library in a tool for
+writing it).  Whether that is true depends on what the Library does
+and what the program that uses the Library does.
+
+  1. You may copy and distribute verbatim copies of the Library's
+complete source code as you receive it, in any medium, provided that
+you conspicuously and appropriately publish on each copy an
+appropriate copyright notice and disclaimer of warranty; keep intact
+all the notices that refer to this License and to the absence of any
+warranty; and distribute a copy of this License along with the
+Library.
+
+  You may charge a fee for the physical act of transferring a copy,
+and you may at your option offer warranty protection in exchange for a
+fee.
+

+  2. You may modify your copy or copies of the Library or any portion
+of it, thus forming a work based on the Library, and copy and
+distribute such modifications or work under the terms of Section 1
+above, provided that you also meet all of these conditions:
+
+    a) The modified work must itself be a software library.
+
+    b) You must cause the files modified to carry prominent notices
+    stating that you changed the files and the date of any change.
+
+    c) You must cause the whole of the work to be licensed at no
+    charge to all third parties under the terms of this License.
+
+    d) If a facility in the modified Library refers to a function or a
+    table of data to be supplied by an application program that uses
+    the facility, other than as an argument passed when the facility
+    is invoked, then you must make a good faith effort to ensure that,
+    in the event an application does not supply such function or
+    table, the facility still operates, and performs whatever part of
+    its purpose remains meaningful.
+
+    (For example, a function in a library to compute square roots has
+    a purpose that is entirely well-defined independent of the
+    application.  Therefore, Subsection 2d requires that any
+    application-supplied function or table used by this function must
+    be optional: if the application does not supply it, the square
+    root function must still compute square roots.)
+
+These requirements apply to the modified work as a whole.  If
+identifiable sections of that work are not derived from the Library,
+and can be reasonably considered independent and separate works in
+themselves, then this License, and its terms, do not apply to those
+sections when you distribute them as separate works.  But when you
+distribute the same sections as part of a whole which is a work based
+on the Library, the distribution of the whole must be on the terms of
+this License, whose permissions for other licensees extend to the
+entire whole, and thus to each and every part regardless of who wrote
+it.
+
+Thus, it is not the intent of this section to claim rights or contest
+your rights to work written entirely by you; rather, the intent is to
+exercise the right to control the distribution of derivative or
+collective works based on the Library.
+
+In addition, mere aggregation of another work not based on the Library
+with the Library (or with a work based on the Library) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+
+  3. You may opt to apply the terms of the ordinary GNU General Public
+License instead of this License to a given copy of the Library.  To do
+this, you must alter all the notices that refer to this License, so
+that they refer to the ordinary GNU General Public License, version 2,
+instead of to this License.  (If a newer version than version 2 of the
+ordinary GNU General Public License has appeared, then you can specify
+that version instead if you wish.)  Do not make any other change in
+these notices.
+

+  Once this change is made in a given copy, it is irreversible for
+that copy, so the ordinary GNU General Public License applies to all
+subsequent copies and derivative works made from that copy.
+
+  This option is useful when you wish to copy part of the code of
+the Library into a program that is not a library.
+
+  4. You may copy and distribute the Library (or a portion or
+derivative of it, under Section 2) in object code or executable form
+under the terms of Sections 1 and 2 above provided that you accompany
+it with the complete corresponding machine-readable source code, which
+must be distributed under the terms of Sections 1 and 2 above on a
+medium customarily used for software interchange.
+
+  If distribution of object code is made by offering access to copy
+from a designated place, then offering equivalent access to copy the
+source code from the same place satisfies the requirement to
+distribute the source code, even though third parties are not
+compelled to copy the source along with the object code.
+
+  5. A program that contains no derivative of any portion of the
+Library, but is designed to work with the Library by being compiled or
+linked with it, is called a "work that uses the Library".  Such a
+work, in isolation, is not a derivative work of the Library, and
+therefore falls outside the scope of this License.
+
+  However, linking a "work that uses the Library" with the Library
+creates an executable that is a derivative of the Library (because it
+contains portions of the Library), rather than a "work that uses the
+library".  The executable is therefore covered by this License.
+Section 6 states terms for distribution of such executables.
+
+  When a "work that uses the Library" uses material from a header file
+that is part of the Library, the object code for the work may be a
+derivative work of the Library even though the source code is not.
+Whether this is true is especially significant if the work can be
+linked without the Library, or if the work is itself a library.  The
+threshold for this to be true is not precisely defined by law.
+
+  If such an object file uses only numerical parameters, data
+structure layouts and accessors, and small macros and small inline
+functions (ten lines or less in length), then the use of the object
+file is unrestricted, regardless of whether it is legally a derivative
+work.  (Executables containing this object code plus portions of the
+Library will still fall under Section 6.)
+
+  Otherwise, if the work is a derivative of the Library, you may
+distribute the object code for the work under the terms of Section 6.
+Any executables containing that work also fall under Section 6,
+whether or not they are linked directly with the Library itself.
+

+  6. As an exception to the Sections above, you may also combine or
+link a "work that uses the Library" with the Library to produce a
+work containing portions of the Library, and distribute that work
+under terms of your choice, provided that the terms permit
+modification of the work for the customer's own use and reverse
+engineering for debugging such modifications.
+
+  You must give prominent notice with each copy of the work that the
+Library is used in it and that the Library and its use are covered by
+this License.  You must supply a copy of this License.  If the work
+during execution displays copyright notices, you must include the
+copyright notice for the Library among them, as well as a reference
+directing the user to the copy of this License.  Also, you must do one
+of these things:
+
+    a) Accompany the work with the complete corresponding
+    machine-readable source code for the Library including whatever
+    changes were used in the work (which must be distributed under
+    Sections 1 and 2 above); and, if the work is an executable linked
+    with the Library, with the complete machine-readable "work that
+    uses the Library", as object code and/or source code, so that the
+    user can modify the Library and then relink to produce a modified
+    executable containing the modified Library.  (It is understood
+    that the user who changes the contents of definitions files in the
+    Library will not necessarily be able to recompile the application
+    to use the modified definitions.)
+
+    b) Use a suitable shared library mechanism for linking with the
+    Library.  A suitable mechanism is one that (1) uses at run time a
+    copy of the library already present on the user's computer system,
+    rather than copying library functions into the executable, and (2)
+    will operate properly with a modified version of the library, if
+    the user installs one, as long as the modified version is
+    interface-compatible with the version that the work was made with.
+
+    c) Accompany the work with a written offer, valid for at least
+    three years, to give the same user the materials specified in
+    Subsection 6a, above, for a charge no more than the cost of
+    performing this distribution.
+
+    d) If distribution of the work is made by offering access to copy
+    from a designated place, offer equivalent access to copy the above
+    specified materials from the same place.
+
+    e) Verify that the user has already received a copy of these
+    materials or that you have already sent this user a copy.
+
+  For an executable, the required form of the "work that uses the
+Library" must include any data and utility programs needed for
+reproducing the executable from it.  However, as a special exception,
+the materials to be distributed need not include anything that is
+normally distributed (in either source or binary form) with the major
+components (compiler, kernel, and so on) of the operating system on
+which the executable runs, unless that component itself accompanies
+the executable.
+
+  It may happen that this requirement contradicts the license
+restrictions of other proprietary libraries that do not normally
+accompany the operating system.  Such a contradiction means you cannot
+use both them and the Library together in an executable that you
+distribute.
+

+  7. You may place library facilities that are a work based on the
+Library side-by-side in a single library together with other library
+facilities not covered by this License, and distribute such a combined
+library, provided that the separate distribution of the work based on
+the Library and of the other library facilities is otherwise
+permitted, and provided that you do these two things:
+
+    a) Accompany the combined library with a copy of the same work
+    based on the Library, uncombined with any other library
+    facilities.  This must be distributed under the terms of the
+    Sections above.
+
+    b) Give prominent notice with the combined library of the fact
+    that part of it is a work based on the Library, and explaining
+    where to find the accompanying uncombined form of the same work.
+
+  8. You may not copy, modify, sublicense, link with, or distribute
+the Library except as expressly provided under this License.  Any
+attempt otherwise to copy, modify, sublicense, link with, or
+distribute the Library is void, and will automatically terminate your
+rights under this License.  However, parties who have received copies,
+or rights, from you under this License will not have their licenses
+terminated so long as such parties remain in full compliance.
+
+  9. You are not required to accept this License, since you have not
+signed it.  However, nothing else grants you permission to modify or
+distribute the Library or its derivative works.  These actions are
+prohibited by law if you do not accept this License.  Therefore, by
+modifying or distributing the Library (or any work based on the
+Library), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Library or works based on it.
+
+  10. Each time you redistribute the Library (or any work based on the
+Library), the recipient automatically receives a license from the
+original licensor to copy, distribute, link with or modify the Library
+subject to these terms and conditions.  You may not impose any further
+restrictions on the recipients' exercise of the rights granted herein.
+You are not responsible for enforcing compliance by third parties with
+this License.
+

+  11. If, as a consequence of a court judgment or allegation of patent
+infringement or for any other reason (not limited to patent issues),
+conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot
+distribute so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you
+may not distribute the Library at all.  For example, if a patent
+license would not permit royalty-free redistribution of the Library by
+all those who receive copies directly or indirectly through you, then
+the only way you could satisfy both it and this License would be to
+refrain entirely from distribution of the Library.
+
+If any portion of this section is held invalid or unenforceable under
+any particular circumstance, the balance of the section is intended to
+apply, and the section as a whole is intended to apply in other
+circumstances.
+
+It is not the purpose of this section to induce you to infringe any
+patents or other property right claims or to contest validity of any
+such claims; this section has the sole purpose of protecting the
+integrity of the free software distribution system which is
+implemented by public license practices.  Many people have made
+generous contributions to the wide range of software distributed
+through that system in reliance on consistent application of that
+system; it is up to the author/donor to decide if he or she is willing
+to distribute software through any other system and a licensee cannot
+impose that choice.
+
+This section is intended to make thoroughly clear what is believed to
+be a consequence of the rest of this License.
+
+  12. If the distribution and/or use of the Library is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Library under this License
+may add an explicit geographical distribution limitation excluding those
+countries, so that distribution is permitted only in or among
+countries not thus excluded.  In such case, this License incorporates
+the limitation as if written in the body of this License.
+
+  13. The Free Software Foundation may publish revised and/or new
+versions of the Lesser General Public License from time to time.
+Such new versions will be similar in spirit to the present version,
+but may differ in detail to address new problems or concerns.
+
+Each version is given a distinguishing version number.  If the Library
+specifies a version number of this License which applies to it and
+"any later version", you have the option of following the terms and
+conditions either of that version or of any later version published by
+the Free Software Foundation.  If the Library does not specify a
+license version number, you may choose any version ever published by
+the Free Software Foundation.
+

+  14. If you wish to incorporate parts of the Library into other free
+programs whose distribution conditions are incompatible with these,
+write to the author to ask for permission.  For software which is
+copyrighted by the Free Software Foundation, write to the Free
+Software Foundation; we sometimes make exceptions for this.  Our
+decision will be guided by the two goals of preserving the free status
+of all derivatives of our free software and of promoting the sharing
+and reuse of software generally.
+
+                            NO WARRANTY
+
+  15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO
+WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW.
+EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR
+OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY
+KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE
+LIBRARY IS WITH YOU.  SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME
+THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN
+WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY
+AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU
+FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR
+CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE
+LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING
+RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A
+FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF
+SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
+DAMAGES.
+
+                     END OF TERMS AND CONDITIONS
+

+           How to Apply These Terms to Your New Libraries
+
+  If you develop a new library, and you want it to be of the greatest
+possible use to the public, we recommend making it free software that
+everyone can redistribute and change.  You can do so by permitting
+redistribution under these terms (or, alternatively, under the terms
+of the ordinary General Public License).
+
+  To apply these terms, attach the following notices to the library.
+It is safest to attach them to the start of each source file to most
+effectively convey the exclusion of warranty; and each file should
+have at least the "copyright" line and a pointer to where the full
+notice is found.
+
+
+    <one line to give the library's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2.1 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
+
+Also add information on how to contact you by electronic and paper mail.
+
+You should also get your employer (if you work as a programmer) or
+your school, if any, to sign a "copyright disclaimer" for the library,
+if necessary.  Here is a sample; alter the names:
+
+  Yoyodyne, Inc., hereby disclaims all copyright interest in the
+  library `Frob' (a library for tweaking knobs) written by James
+  Random Hacker.
+
+  <signature of Ty Coon>, 1 April 1990
+  Ty Coon, President of Vice
+
+That's all there is to it!
+
+
diff --git a/MANIFEST.in b/MANIFEST.in
new file mode 100644
index 0000000..4279900
--- /dev/null
+++ b/MANIFEST.in
@@ -0,0 +1,15 @@
+include README.rst
+include CHANGES.rst
+include COPYING
+include tox.ini
+include tox-bench.ini
+include update_c.sh
+recursive-include libdatrie *.h
+recursive-include libdatrie *.c
+include tests/words100k.txt.zip
+recursive-include tests *.py
+
+include src/datrie.pyx
+include src/cdatrie.pxd
+include src/stdio_ext.pxd
+
diff --git a/PKG-INFO b/PKG-INFO
new file mode 100644
index 0000000..5f9684f
--- /dev/null
+++ b/PKG-INFO
@@ -0,0 +1,472 @@
+Metadata-Version: 1.1
+Name: datrie
+Version: 0.7.1
+Summary: Super-fast, efficiently stored Trie for Python.
+Home-page: https://github.com/kmike/datrie
+Author: Mikhail Korobov
+Author-email: kmike84 at gmail.com
+License: LGPLv2+
+Description: datrie |travis| |appveyor|
+        ======
+        
+        .. |travis| image:: https://travis-ci.org/kmike/datrie.png
+           :target: https://travis-ci.org/kmike/datrie
+        
+        .. |appveyor| image:: https://ci.appveyor.com/api/projects/status/6bpvhllpjhlau7x0?svg=true
+           :target: https://ci.appveyor.com/project/superbobry/datrie
+        
+        Super-fast, efficiently stored Trie for Python (2.x and 3.x).
+        Uses `libdatrie`_.
+        
+        .. _libdatrie: http://linux.thai.net/~thep/datrie/datrie.html
+        
+        Installation
+        ============
+        
+        ::
+        
+            pip install datrie
+        
+        Usage
+        =====
+        
+        Create a new trie capable of storing items with lower-case ascii keys::
+        
+            >>> import string
+            >>> import datrie
+            >>> trie = datrie.Trie(string.ascii_lowercase)
+        
+        ``trie`` variable is a dict-like object that can have unicode keys of
+        certain ranges and Python objects as values.
+        
+        In addition to implementing the mapping interface, tries facilitate
+        finding the items for a given prefix, and vice versa, finding the
+        items whose keys are prefixes of a given string. As a common special
+        case, finding the longest-prefix item is also supported.
+        
+        .. warning::
+        
+            For efficiency you must define allowed character range(s) while
+            creating trie. ``datrie`` doesn't check if keys are in allowed
+            ranges at runtime, so be careful! Invalid keys are OK at lookup time
+            but values won't be stored correctly for such keys.
+        
+        Add some values to it (datrie keys must be unicode; the examples
+        are for Python 2.x)::
+        
+            >>> trie[u'foo'] = 5
+            >>> trie[u'foobar'] = 10
+            >>> trie[u'bar'] = 'bar value'
+            >>> trie.setdefault(u'foobar', 15)
+            10
+        
+        Check if u'foo' is in trie::
+        
+            >>> u'foo' in trie
+            True
+        
+        Get a value::
+        
+            >>> trie[u'foo']
+            5
+        
+        Find all prefixes of a word::
+        
+            >>> trie.prefixes(u'foobarbaz')
+            [u'foo', u'foobar']
+        
+            >>> trie.prefix_items(u'foobarbaz')
+            [(u'foo', 5), (u'foobar', 10)]
+        
+            >>> trie.iter_prefixes(u'foobarbaz')
+            <generator object ...>
+        
+            >>> trie.iter_prefix_items(u'foobarbaz')
+            <generator object ...>
+        
+        Find the longest prefix of a word::
+        
+            >>> trie.longest_prefix(u'foo')
+            u'foo'
+        
+            >>> trie.longest_prefix(u'foobarbaz')
+            u'foobar'
+        
+            >>> trie.longest_prefix(u'gaz')
+            KeyError: u'gaz'
+        
+            >>> trie.longest_prefix(u'gaz', default=u'vasia')
+            u'vasia'
+        
+            >>> trie.longest_prefix_item(u'foobarbaz')
+            (u'foobar', 10)
+        
+        Check if the trie has keys with a given prefix::
+        
+            >>> trie.has_keys_with_prefix(u'fo')
+            True
+        
+            >>> trie.has_keys_with_prefix(u'FO')
+            False
+        
+        Get all items with a given prefix from a trie::
+        
+            >>> trie.keys(u'fo')
+            [u'foo', u'foobar']
+        
+            >>> trie.items(u'ba')
+            [(u'bar', 'bar value')]
+        
+            >>> trie.values(u'foob')
+            [10]
+        
+        Get all suffixes of certain word starting with a given prefix from a trie::
+        
+            >>> trie.suffixes()
+            [u'pro', u'producer', u'producers', u'product', u'production', u'productivity', u'prof']
+            >>> trie.suffixes(u'prod')
+            [u'ucer', u'ucers', u'uct', u'uction', u'uctivity']
+        
+        
+        Save & load a trie (values must be picklable)::
+        
+            >>> trie.save('my.trie')
+            >>> trie2 = datrie.Trie.load('my.trie')
+        
+        
+        
+        Trie and BaseTrie
+        =================
+        
+        There are two Trie classes in datrie package: ``datrie.Trie`` and
+        ``datrie.BaseTrie``. ``datrie.BaseTrie`` is slightly faster and uses less
+        memory but it can store only integer numbers -2147483648 <= x <= 2147483647.
+        ``datrie.Trie`` is a bit slower but can store any Python object as a value.
+        
+        If you don't need values or integer values are OK then use ``datrie.BaseTrie``::
+        
+            import datrie
+            import string
+            trie = datrie.BaseTrie(string.ascii_lowercase)
+        
+        Custom iteration
+        ================
+        
+        If the built-in trie methods don't fit you can use ``datrie.State`` and
+        ``datrie.Iterator`` to implement custom traversal.
+        
+        .. note::
+        
+            If you use ``datrie.BaseTrie`` you need ``datrie.BaseState`` and
+            ``datrie.BaseIterator`` for custom traversal.
+        
+        
+        For example, let's find all suffixes of ``'fo'`` for our trie and get
+        the values::
+        
+            >>> state = datrie.State(trie)
+            >>> state.walk(u'foo')
+            >>> it = datrie.Iterator(state)
+            >>> while it.next():
+            ...     print(it.key())
+            ...     print(it.data))
+            o
+            5
+            obar
+            10
+        
+        Performance
+        ===========
+        
+        Performance is measured for ``datrie.Trie`` against Python's dict with
+        100k unique unicode words (English and Russian) as keys and '1' numbers
+        as values.
+        
+        ``datrie.Trie`` uses about 5M memory for 100k words; Python's dict
+        uses about 22M for this according to my unscientific tests.
+        
+        This trie implementation is 2-6 times slower than python's dict
+        on __getitem__. Benchmark results (macbook air i5 1.8GHz,
+        "1.000M ops/sec" == "1 000 000 operations per second")::
+        
+            Python 2.6:
+            dict __getitem__: 7.107M ops/sec
+            trie __getitem__: 2.478M ops/sec
+        
+            Python 2.7:
+            dict __getitem__: 6.550M ops/sec
+            trie __getitem__: 2.474M ops/sec
+        
+            Python 3.2:
+            dict __getitem__: 8.185M ops/sec
+            trie __getitem__: 2.684M ops/sec
+        
+            Python 3.3:
+            dict __getitem__: 7.050M ops/sec
+            trie __getitem__: 2.755M ops/sec
+        
+        Looking for prefixes of a given word is almost as fast as
+        ``__getitem__`` (results are for Python 3.3)::
+        
+            trie.iter_prefix_items (hits):      0.461M ops/sec
+            trie.prefix_items (hits):           0.743M ops/sec
+            trie.prefix_items loop (hits):      0.629M ops/sec
+            trie.iter_prefixes (hits):          0.759M ops/sec
+            trie.iter_prefixes (misses):        1.538M ops/sec
+            trie.iter_prefixes (mixed):         1.359M ops/sec
+            trie.has_keys_with_prefix (hits):   1.896M ops/sec
+            trie.has_keys_with_prefix (misses): 2.590M ops/sec
+            trie.longest_prefix (hits):         1.710M ops/sec
+            trie.longest_prefix (misses):       1.506M ops/sec
+            trie.longest_prefix (mixed):        1.520M ops/sec
+            trie.longest_prefix_item (hits):    1.276M ops/sec
+            trie.longest_prefix_item (misses):  1.292M ops/sec
+            trie.longest_prefix_item (mixed):   1.379M ops/sec
+        
+        Looking for all words starting with a given prefix is mostly limited
+        by overall result count (this can be improved in future because a
+        lot of time is spent decoding strings from utf_32_le to Python's
+        unicode)::
+        
+            trie.items(prefix="xxx"), avg_len(res)==415:        0.609K ops/sec
+            trie.keys(prefix="xxx"), avg_len(res)==415:         0.642K ops/sec
+            trie.values(prefix="xxx"), avg_len(res)==415:       4.974K ops/sec
+            trie.items(prefix="xxxxx"), avg_len(res)==17:       14.781K ops/sec
+            trie.keys(prefix="xxxxx"), avg_len(res)==17:        15.766K ops/sec
+            trie.values(prefix="xxxxx"), avg_len(res)==17:      96.456K ops/sec
+            trie.items(prefix="xxxxxxxx"), avg_len(res)==3:     75.165K ops/sec
+            trie.keys(prefix="xxxxxxxx"), avg_len(res)==3:      77.225K ops/sec
+            trie.values(prefix="xxxxxxxx"), avg_len(res)==3:    320.755K ops/sec
+            trie.items(prefix="xxxxx..xx"), avg_len(res)==1.4:  173.591K ops/sec
+            trie.keys(prefix="xxxxx..xx"), avg_len(res)==1.4:   180.678K ops/sec
+            trie.values(prefix="xxxxx..xx"), avg_len(res)==1.4: 503.392K ops/sec
+            trie.items(prefix="xxx"), NON_EXISTING:             2023.647K ops/sec
+            trie.keys(prefix="xxx"), NON_EXISTING:              1976.928K ops/sec
+            trie.values(prefix="xxx"), NON_EXISTING:            2060.372K ops/sec
+        
+        Random insert time is very slow compared to dict, this is the limitation
+        of double-array tries; updates are quite fast. If you want to build a trie,
+        consider sorting keys before the insertion::
+        
+            dict __setitem__ (updates):            6.497M ops/sec
+            trie __setitem__ (updates):            2.633M ops/sec
+            dict __setitem__ (inserts, random):    5.808M ops/sec
+            trie __setitem__ (inserts, random):    0.053M ops/sec
+            dict __setitem__ (inserts, sorted):    5.749M ops/sec
+            trie __setitem__ (inserts, sorted):    0.624M ops/sec
+            dict setdefault (updates):             3.455M ops/sec
+            trie setdefault (updates):             1.910M ops/sec
+            dict setdefault (inserts):             3.466M ops/sec
+            trie setdefault (inserts):             0.053M ops/sec
+        
+        Other results (note that ``len(trie)`` is currently implemented
+        using trie traversal)::
+        
+            dict __contains__ (hits):    6.801M ops/sec
+            trie __contains__ (hits):    2.816M ops/sec
+            dict __contains__ (misses):  5.470M ops/sec
+            trie __contains__ (misses):  4.224M ops/sec
+            dict __len__:                334336.269 ops/sec
+            trie __len__:                22.900 ops/sec
+            dict values():               406.507 ops/sec
+            trie values():               20.864 ops/sec
+            dict keys():                 189.298 ops/sec
+            trie keys():                 2.773 ops/sec
+            dict items():                48.734 ops/sec
+            trie items():                2.611 ops/sec
+        
+        Please take this benchmark results with a grain of salt; this
+        is a very simple benchmark and may not cover your use case.
+        
+        Current Limitations
+        ===================
+        
+        * keys must be unicode (no implicit conversion for byte strings
+          under Python 2.x, sorry);
+        * there are no iterator versions of keys/values/items (this is not
+          implemented yet);
+        * it is painfully slow and maybe buggy under pypy;
+        * library is not tested with narrow Python builds.
+        
+        Contributing
+        ============
+        
+        Development happens at github and bitbucket:
+        
... 40989 lines suppressed ...

-- 
Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/python-modules/packages/python-datrie.git



More information about the Python-modules-commits mailing list