quadtree
Generic, zero-alloc, 100%-test covered Quadtree for golang (by s0rg)
willf/bloom
Go package implementing Bloom filters, used by Milvus and Beego. (by willf)
| quadtree | willf/bloom | |
|---|---|---|
| 1 | 2 | |
| 37 | 2,520 | |
| - | 1.2% | |
| 2.8 | 4.1 | |
| over 1 year ago | 3 months ago | |
| Go | Go | |
| MIT License | BSD 2-clause "Simplified" License |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.
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.
quadtree
Posts with mentions or reviews of quadtree.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-09-08.
-
generic quadtree for golang
https://github.com/s0rg/quadtree - generic, zero-alloc, 100%-test covered quadtree
willf/bloom
Posts with mentions or reviews of willf/bloom.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-03-17.
-
willf/bloom VS bloom_cpp - a user suggested alternative
2 projects | 17 Mar 2023
-
There are 87 bloom filter crates. Strategies for choosing one?
I also have a lot of sympathy for the casual user that has a bloom-filter-shaped hole in their program that all of these filters will fill, and having reduced this part of their task to a well-known solved problem, just want to plug in a random thing & move on, with the possibility of revisiting the selection later if bloomfiltering shows up in the profiler.
What are some alternatives?
When comparing quadtree and willf/bloom you can also consider the following projects:
swiss - Golang port of Abseil's SwissTable
hilbert - Go package for mapping values to and from space-filling curves, such as Hilbert and Peano curves.
go-geoindex - Go native library for fast point tracking and K-Nearest queries
bloom - Bloom filters implemented in Go.
conjungo - A small flexible merge library in go
bit - Bitset data structure