- sortedcontainers VS python-patterns
- sortedcontainers VS algorithms
- sortedcontainers VS TheAlgorithms
- sortedcontainers VS more-itertools
- sortedcontainers VS python-ds
- sortedcontainers VS PyPattyrn
- sortedcontainers VS ClointFusion
- sortedcontainers VS indradb
- sortedcontainers VS mongodb-memory-server
- sortedcontainers VS mongita
Similar projects and alternatives to sortedcontainers
A collection of design patterns/idioms in Python
Access the most powerful time series database as a service. Ingest, store, & analyze all types of time series data in a fully-managed, purpose-built database. Keep data forever with low-cost storage and superior data compression.
All Algorithms implemented in Python
More routines for operating on iterables, beyond itertools
No non-sense and no BS repo for how data structure code should be in Python - simple and elegant.
A simple library for implementing common design patterns.
A graph database written in rust
Write Clean Python Code. Always.. Sonar helps you commit clean code every time. With over 225 unique rules to find Python bugs, code smells & vulnerabilities, Sonar finds the issues while you focus on the work.
Cloint India Pvt. Ltd's (ClointFusion) Pythonic RPA (Automation) Platform
"Mongita is to MongoDB as SQLite is to SQL"
Spinning up mongod in memory for fast tests. If you run tests in parallel this lib helps to spin up dedicated mongodb servers for every test file in MacOS, *nix, Windows or CI environments (in most cases with zero-config).
:mailbox_with_mail: Easily and securely share files from the command line. A fully featured Firefox Send client.
A MongoDB compatible embeddable database and toolkit for Go.
document store on sqlite
sortedcontainers reviews and mentions
Blog Post: Large Rust Workspaces
2 projects | reddit.com/r/rust | 22 Aug 2021
Even the Gentoo package repository manages fine with a two-level hierarchy. There's also a Python library, sortedcontainers, that suggests two-level trees are pretty good at any reasonable human-scale (and beyond), even while fixed-arity trees are asymptotically optimal.
Show HN: Mongita is to MongoDB as SQLite is to SQL
7 projects | news.ycombinator.com | 20 Apr 2021
It's a good question and to be accurate, depending on the benchmark, Mongita is about the same speed at SQLite to several-times slower.
There is less happening algorithmically than you would think. Where the tricky slow bits do exist, they have largely fallen into the happy-path of fast data structures in the Python language/stdlib. I also use sortedcontainers for indexes which helped quite a bit (http://www.grantjenks.com/docs/sortedcontainers/).
If you're curious, the benchmark code is in the repo: https://github.com/scottrogowski/mongita/blob/master/benchma...
grantjenks/python-sortedcontainers is an open source project licensed under GNU General Public License v3.0 or later which is an OSI approved license.