Library of small but useful modules
Project description
Short module description
=========================
Module pd.lib content some simple modules
and fucntions.
Description of modules
----------------------
pd.lib.heapsort
...............
The module is simple lazy sort implementation realised therewith heapq
module. Items will be sorted only when accepted and using of computation
resource is minimazed.
Two classes are provided by module:
HeapSort
On initialization accepted item list and comparing
function;
HeapSortByIndex
On initialization accepted item list and index. List
items mapped on index values and can be compared by them. In this
case third parameter - revert - are used. Revert can be True or
False. If revert is True then array will be sorted in reverse order.
Parameter revert is False by default.
HeapSortByIndexSafe
It class liked on HeapSortByIndex above, but use index in extremely safe
manner: if item omited from index it mapped on infinity and any item are
comparable;
Classes, mentioned above, to provide methods:
chunk(n)
Return first n items from begin sorted list.
pd.lib.utility
..............
The module contents followed useful functions:
name2klass
Return klass by name
klass2name
Return name by klass
pd.lib.topsort
..............
The module contents classes developed to provide different kind of topologic
sort. All classes are use as:
TopSort([<Parameters>])(<Items>), где :
Parameters
Sort execution parameters;
Items
Each item is a pair of object reference and object reference list which one depend;
Followed classes are provided by module:
TopSort
Simple topologic sort;
TopSortIndex
Simple topologic sort for any kind of object;
TopSortFuzzy
Fuzzy topologic sort;
TopSortFuzzyIndex
Fuzzy topologic sort for any kind of object;
Fuzzy topologic sort can transform to linear ordered array graph with
cyclomatic value more then zero. Best results achieved on litle values:
the sort is for tree with a few cycles.
* Sat Dec 22 2007 Andrey Orlov <cray@neural.ru> 0.0.4
- Module topsort added
* Mon Dec 10 2007 Andrey Orlov <cray@neural.ru> 0.0.3
- Module utility added
* Tue Nov 13 2007 Andrey Orlov <cray@neural.ru> 0.0.2
- HeapSortIndexSafe class added
* Mon Nov 12 2007 Andrey Orlov <cray@neural.ru> 0.0.1
- first official release
=========================
Module pd.lib content some simple modules
and fucntions.
Description of modules
----------------------
pd.lib.heapsort
...............
The module is simple lazy sort implementation realised therewith heapq
module. Items will be sorted only when accepted and using of computation
resource is minimazed.
Two classes are provided by module:
HeapSort
On initialization accepted item list and comparing
function;
HeapSortByIndex
On initialization accepted item list and index. List
items mapped on index values and can be compared by them. In this
case third parameter - revert - are used. Revert can be True or
False. If revert is True then array will be sorted in reverse order.
Parameter revert is False by default.
HeapSortByIndexSafe
It class liked on HeapSortByIndex above, but use index in extremely safe
manner: if item omited from index it mapped on infinity and any item are
comparable;
Classes, mentioned above, to provide methods:
chunk(n)
Return first n items from begin sorted list.
pd.lib.utility
..............
The module contents followed useful functions:
name2klass
Return klass by name
klass2name
Return name by klass
pd.lib.topsort
..............
The module contents classes developed to provide different kind of topologic
sort. All classes are use as:
TopSort([<Parameters>])(<Items>), где :
Parameters
Sort execution parameters;
Items
Each item is a pair of object reference and object reference list which one depend;
Followed classes are provided by module:
TopSort
Simple topologic sort;
TopSortIndex
Simple topologic sort for any kind of object;
TopSortFuzzy
Fuzzy topologic sort;
TopSortFuzzyIndex
Fuzzy topologic sort for any kind of object;
Fuzzy topologic sort can transform to linear ordered array graph with
cyclomatic value more then zero. Best results achieved on litle values:
the sort is for tree with a few cycles.
* Sat Dec 22 2007 Andrey Orlov <cray@neural.ru> 0.0.4
- Module topsort added
* Mon Dec 10 2007 Andrey Orlov <cray@neural.ru> 0.0.3
- Module utility added
* Tue Nov 13 2007 Andrey Orlov <cray@neural.ru> 0.0.2
- HeapSortIndexSafe class added
* Mon Nov 12 2007 Andrey Orlov <cray@neural.ru> 0.0.1
- first official release
Project details
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
pd.lib-0.0.4.tar.gz
(6.0 kB
view details)
File details
Details for the file pd.lib-0.0.4.tar.gz
.
File metadata
- Download URL: pd.lib-0.0.4.tar.gz
- Upload date:
- Size: 6.0 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
File hashes
Algorithm | Hash digest | |
---|---|---|
SHA256 | 47bee7a20f1babb505d72844e3a6919a96f97c555288dca2505a2617898e14c2 |
|
MD5 | 3b3ece10114973055593e30de90315b2 |
|
BLAKE2b-256 | 95f8333dffd380a99ed0c74f175b2e34e0acfa88d7c940f17ec78f434989b7a2 |