Update changelog
This commit is contained in:
parent
730a9dac6c
commit
36512d7a24
10
CHANGES.md
10
CHANGES.md
|
@ -1,7 +1,11 @@
|
|||
UNRELEASED
|
||||
----------
|
||||
v0.12 Tue Mar 30 12:03:05 CEST 2021
|
||||
--------------------------
|
||||
|
||||
Dbseq: fast sequence datastructure for DeBruijn-indexed environments
|
||||
Balmap: alternative to Stdlib Maps and Sets based on baltree.
|
||||
Dbseq: fast sequence datastructure for DeBruijn-indexed environments.
|
||||
State elimination: convert e-NFA to regular expressions.
|
||||
|
||||
Fixed many bugs in and increased expressiveness of Valmari implementation.
|
||||
|
||||
v0.11 Wed Mar 4 10:07:08 CET 2020
|
||||
--------------------------
|
||||
|
|
|
@ -26,7 +26,7 @@ invariants cannot be broken. However, custom operations are much easier to
|
|||
implement (e.g. `rank` to access the n'th element, which enables uniform
|
||||
sampling in O(log n)).
|
||||
|
||||
## dbseq : Immutable list with random access
|
||||
## dbseq: fast sequence datastructure for DeBruijn-indexed environments
|
||||
|
||||
Dbseq is a small data structure that offers operations halfway between a list
|
||||
and an immutable array. Most operations have a logarithmic cost. In practice,
|
||||
|
|
Loading…
Reference in New Issue