Brothersoft.com Windows | Games | Mobile | Wallpapers

Advertisement

Implementation of sets using sorted lists 1.1

This implementation of sets.py uses sorted lists instead of dictionaries.

Advertisement

Last Week downloads: 0
Total downloads: 60
  • Last Updated: Aug 23, 2010
  • License: Open Source Free
  • OS: Windows /Linux/Mac OS/BSD/Solaris
  • Requirements: No special requirements
screenshot

User reviews

4 out of 5 based on 1 ratings for Implementation of sets using sorted lists 1.1

For Implementation of sets using sorted lists 1.1Publisher's description

Advertisement

Implementation of sets using sorted lists is a Scripts software developed by Raymond Hettinger. After our trial and test, the software is proved to be official, secure and free. Here is the official description for Implementation of sets using sorted lists:

EditByBSEditor: Inspired by Py2.3's TimSort, this implementation of sets.py uses sorted lists instead of dictionaries. For clumped data patterns, the set operations can be super-efficient (for example, two sets can be determined to be disjoint with only O(n) comparisons). Also note, that the set elements are not required to be hashable; this provides a great deal more Freedom than dictionary based implementations.
you can free download Implementation of sets using sorted lists 1.1 now.

For Implementation of sets using sorted lists 1.1Related Software

Statement

Please be aware that Brothersoft do not supply any crack, patches, serial numbers or keygen for Implementation of sets using sorted lists,and please consult directly with program authors for any problem with Implementation of sets using sorted lists.

Top Shareware

in Python