indradb
sortedcontainers
Our great sponsors
indradb | sortedcontainers | |
---|---|---|
5 | 6 | |
2,075 | 3,224 | |
2.0% | - | |
3.5 | 7.4 | |
about 2 months ago | about 2 months ago | |
Rust | Python | |
Mozilla Public License 2.0 | GNU General Public License v3.0 or later |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
indradb
-
IndraDB Help / Tutorial
I've been racking my brain for a few days now trying to get an IndraDB prototype up and running but having no luck. My goal is to use the indra-lib with Sled as the datastore.
- IndraDB ā A graph database written in Rust
-
Call for Help - Open Source Datom/EAV/Fact database in Rust.
[1] https://github.com/indradb/indradb
-
Show HN: Mongita is to MongoDB as SQLite is to SQL
For rust, I manage a graph database that can be embedded as a library: https://github.com/indradb/indradb/
-
IndraDB: A graph database written in rust
https://docs.rs/indradb-lib/2.0.0/indradb/ and https://github.com/indradb/indradb
sortedcontainers
-
Ask HN: Where do I find good code to read?
If you like Python, the library sortedcontainers as a clear, well documented, yet short source code that is a joy to read for a non trivial problem:
https://github.com/grantjenks/python-sortedcontainers/blob/m...
-
Problem #2353 Design a food rating system
See for yourself. Looks like sortedset uses sortedlist under the hood, which itself uses a list of lists under the hood.
-
Discussion Thread
You could use http://www.grantjenks.com/docs/sortedcontainers/ instead!
-
Blog Post: Large Rust Workspaces
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
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...
-
Top 15 Python Packages You Must Try
Iād like to add sortedcontainers. I use it all the time. It basically does what it says on the tin. Other than the SortedList, the fact that the container is sorted only comes into play when you iterate over it or perform a bisect left/right.
What are some alternatives?
oxigraph - SPARQL graph database
python-patterns - A collection of design patterns/idioms in Python
ArangoDB - š„ ArangoDB is a native multi-model database with flexible data models for documents, graphs, and key-values. Build high performance applications using a convenient SQL-like query language or JavaScript extensions.
algorithms
mongita - "Mongita is to MongoDB as SQLite is to SQL"
TheAlgorithms - All Algorithms implemented in Python
GraphScope - šØ š š» š GraphScope: A One-Stop Large-Scale Graph Computing System from Alibaba | äøē«å¼å¾č®”ē®ē³»ē»
more-itertools - More routines for operating on iterables, beyond itertools
mongodb-memory-server - 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).
PyPattyrn - A simple library for implementing common design patterns.
datalevin - A simple, fast and versatile Datalog database
python-ds - No non-sense and no BS repo for how data structure code should be in Python - simple and elegant.