vorce / dasie Goto Github PK

Travis doesn't work...

https://github.com/whatyouhide/stream_data

https://courses.csail.mit.edu/6.851/fall17/

It's how NaiveDateTime.compare works for example.

Should also document it better :)

Can probably extract some properties from the wikipedia page: https://en.wikipedia.org/wiki/Partially_ordered_set

Fail build on dialyzer errors

Kino + mermaid graph?

• https://github.com/livebook-dev/kino
• https://jojozhuang.github.io/tutorial/creating-data-structure-diagrams-with-mermaid/

https://hexdocs.pm/elixir/Inspect.html

• https://crypto.stanford.edu/pbc/notes/zdd/
• https://www.youtube.com/watch?v=SQE21efsf7Y

https://www.cs.cmu.edu/%7Edga/papers/cuckoo-conext2014.pdf
https://github.com/bdupras/guava-probably/blob/master/src/main/java/com/duprasville/guava/probably/CuckooFilter.java
https://github.com/seiflotfy/cuckoofilter/blob/master/cuckoofilter.go

Backed by the red-black tree.

https://lemire.me/blog/2019/12/19/xor-filters-faster-and-smaller-than-bloom-filters/ and remove cuckoo filter? :D

paper: https://arxiv.org/abs/1912.08258

too many functions that should be private are exposed. This was done when test driving the code.

Suggestion:

Move internal functions into separate module.

https://chrispenner.ca/posts/intro-to-finger-trees

A Finger Tree is an efficient purely functional data structure that can retrieve its leaves in constant time and perform concatenating and splitting in logarithmic time. One of its key features is that it accepts a split function which is used during search. Depending on the function given, the data structure can represent a sequence, a priority queue, a search tree and more.

• new looks quite different in the different implementations
• Maybe implementing some core elixir protocol would help? https://hexdocs.pm/elixir/Collectable.html (and/or https://hexdocs.pm/elixir/Enumerable.html)

https://www.cs.cornell.edu/courses/cs312/2003sp/lectures/lec26.html