radoburansky / scala-struct Goto Github PK

Apply Huffman to all strings and automatically compute intervals for all numerical fields.

Support definition of minimal and maximal value for a numeric field so that less bits are needed to store it.

What about speed performance?

For instance, the time usage when perform head or last operation, compare to original standard collections provided by scala?

Dynamic structures have variable length. Therefore dynamic buffer cannot be an indexed sequence but a linear sequence. It should be possible to mix fixed and dynamic structures. Fixed structures with dynamic structures as children would require an additional dynamic buffer to the fixed buffer. In the fixed buffer, references (indexes) to the dynamic buffer would be stored.

String is a dynamic structure so we need support for dynamic structures first.

It should be able to efficiently handle structures with variabel size. It could extend from LinearSeq and therefore behave similar to linked list.