Home | Trees | Indices | Help |
|
---|
|
|
|||
SortedDict A very rudamentary sorted dictionary, whose main purpose is to allow dictionaries to be displayed in a consistent order in regression tests. |
|||
OrderedDict This implementation of a dictionary keeps track of the order in which keys were inserted. |
|||
MinimalSet Find contexts where more than one possible target value can appear. |
|||
Counter A counter that auto-increments each time its value is read. |
|||
Trie A Trie is like a dictionary in that it maps keys to values. |
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
string
|
|
||
|
|||
|
|||
|
|
Pretty print a sequence of data items
|
Pretty print a string, breaking lines on whitespace
|
Calculate the Levenshtein edit-distance between two strings. The edit distance is the number of characters that need to be substituted, inserted, or deleted, to transform s1 into s2. For example, transforming "rain" to "shine" requires three steps, consisting of two substitutions and one insertion: "rain" -> "sain" -> "shin" -> "shine". These operations could have been done in other orders, but at least three steps are needed.
|
Search
|
Traverse the nodes of a tree in breadth-first order. The first argument should be the tree root; children should be a function taking as argument a tree node and returning an iterator of the node's children. |
Given a byte string, attempt to decode it. Tries the standard 'UTF8' and 'latin-1' encodings, Plus several gathered from locale information. The calling program *must* first call locale.setlocale(locale.LC_ALL, '') If successful it returns (decoded_unicode, successful_encoding) If unsuccessful it raises a ``UnicodeError`` |
Home | Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0beta1 on Wed May 16 22:47:20 2007 | http://epydoc.sourceforge.net |