grantjenks/python-sortedcontainers
Python Sortedcontainers
This is a Python library providing sorted list, set, and dictionary data structures that maintain their order automatically during insertions and deletions.
The library provides a sorted list for fast random access and logarithmic lookups, a sorted set for unique elements and set-theoretic operations, and a sorted dictionary for managing key-value pairs where keys remain sorted. These collections support custom sorting logic through user-defined key functions to determine the order of elements.
Core capabilities include positional indexing, range queries, and the use of bisection methods to locate element positions and insertion points. The project also enables slicing of sorted collections and the calculation of unions, intersections, and differences between sorted sets.
Features
- Sorted - Implements a sorted dictionary that maintains key order to facilitate fast range queries and positional lookups.
- List-of-Lists Implementations - Uses a list-of-lists architecture to maintain sorted order while ensuring efficient insertions and deletions.
- Bisection Insertion Points - Provides bisection methods to locate the precise index where a new value should be inserted to maintain order.
- Custom Key Ordering - Allows determining the sort order of collections through a provided key extraction function.
- Bisection-Based Range Retrieval - Provides efficient extraction of element subsets that fall between specific minimum and maximum values.
- Sorted Indexing - Utilizes sorted indexing and bisection to efficiently locate the position of elements within a collection.
- Position-Based Data Selection - Enables retrieving elements by their integer position using optimized lookups across internal sublists.
- Collection Sorting - Maintains elements in sorted order during insertions and deletions without requiring manual re-sorting.
- Sorted Sets - Implements a sorted set for unique elements, supporting set-theoretic operations and index-based access.
- Positional Key Indexing - Enables retrieval of keys from sorted dictionaries using their integer positional indices.
- Sorting Key Functions - Supports custom sorting logic through user-defined key functions to determine element order.
- Sorted List Maintenance - Provides a sorted list that maintains order during insertions to enable fast random-access indexing.
- Custom Sorting Logic - Allows defining flexible sorting criteria by extracting comparison values from elements via key functions.
- Index-Based Data Access - Provides fast random access to elements using integer indices across a list-of-lists structure.
- Array Element Finding - Implements methods to locate the index of existing elements or the insertion point for new values.
- Set Operations - Implements standard set-theoretic operations including unions, intersections, and differences for sorted sets.
- Sorted Collection Libraries - Provides a comprehensive suite of sorted list, set, and dictionary structures for Python.
- Binary Search Algorithms - Implements binary search algorithms to locate element positions and insertion points in logarithmic time.
- Sequential Iterators - Ships sequential iterators for extracting slices of elements between two specified bounds.
- Collection Range Slicing - Provides the ability to extract contiguous sub-sequences from sorted collections using range-based indexing.
- Range Key Iteration - Provides iterators that traverse elements falling within a specific minimum and maximum value range.
- Binary Search Utilities - Ships utilities for locating insertion points and element positions using binary search algorithms.
- Internal Data Load Balancing - Maintains sublist sizes within a specific range by splitting or merging lists to preserve performance.
- Algorithms and Patterns - Fast, pure-Python implementation of sorted collections.
