Powerful data structures for data analysis, time series, and statistics
Python bindings to Rust's persistent data structures (rpds)
Persistent/Functional/Immutable data structures
A light-weight and flexible data validation and testing tool for statistical data objects.
A powerful declarative symmetric parser/builder for binary data
Tree is a library for working with nested data structures.
Probabilistic data structures for processing and searching very large datasets
Kaitai Struct declarative parser generator for binary data: runtime library for Python
Editable interval tree data structure for Python 2 and 3
A pure Python trie data structure implementation.
A diff/patch pair for JSON-serialized data structures.
High performance graph data structures and algorithms
Simple YAML configuration file parser with easy access for structured data
Bloom filter: A Probabilistic data structure
A library for converting a token stream into a data structure for use in web form posts
A Python implementation of tree structure.
Advanced data structures for handling temporal segments with attached labels.
The data structure for multimodal data
Python Data Structures for Humans
Extension for the python package 'construct' that adds typing features
A simple python fuzzyset implementation.
TableLogger is a handy Python utility for logging tabular data into a console or a file.
The agile query language for semi-structured data. #JSON
T-Digest data structure
High performance graph data structures and algorithms (legacy package)
Red/black tree with support for fast accumulation of values in a key range
Probabilistic data structures in python
A data-structure parameterization system written for embedding context in JSON objects
Hierarchical tree-like data structures for xarray
A Python 3 library for sci-kit learn, XGBoost, LightGBM, Spark, and TensorFlow decision tree visualization
CircularDict is a high-performance Python data structure that blends the functionality of dictionaries and circular buffers. Inheriting the usage of traditional dictionaries, it allows you to define constraints on size and memory usage. This way, the CircularDict will be always up-to-date with the last N added elements, ensuring that neither the maximum length nor the memory usage limit is exceeded. It is ideal for caching large data structures while maintaining control over memory footprint.
Continuous Range, RangeSet, and RangeDict data structures
Parse C++ header files and generate a data structure representing the class
jxmlease converts between XML and intelligent Python data structures.
Standalone Python library for generating ROS message and service data structures for various languages.
Recursive diff and patch for nested structures.
Parse C++ header files and generate a data structure representing the class
Recursively compare two Python data structures
Disjoint set data structure implementation for Python
Validator for the Brain Imaging Data Structure
The PySubnetTree package provides a Python data structure SubnetTree