-
A few I have in mind:
- [ ] Graphs
- [ ] Records (like mutable namedtuples)
- [ ] Bimaps (bi-directional dictionaries)
darkf updated
7 years ago
-
-
### Data Structures to be implemented are:
- [ ] Segment Trees
- [ ] Binary Search Tree
- [x] Graphs
-
- [x] HyperLogLog
- [x] HyperLogLog ++
- [x] Count Min Sketch
- [ ] Bloom Filter
- [ ] MinHash
-
There should be a python version of queue data structure
-
First I will make efficient programs and then you may contribute to it
-
-
Could the binary structures serve as the basis for persistent data structures, implemented as [HAMT](https://en.wikipedia.org/wiki/Hash_array_mapped_trie)?
-
Capitalize your data structure classes:
https://github.com/webwizard99/salt-store-backend/blob/dc880294543b5bbce10963657e84ac953de71e56/utilities/storeitems.js#L4
It makes it clear later on when y…
-
**Shared Memory**
- [ ] Queue
- [ ] Stack
- [ ] Vector
- [x] PriorityQueue
**Distributed**
- [ ] DistBag
- [ ] DistQueue
- [ ] RCUArray