avl_tree
→
binary_trie_xor
→
binomial_heap
→
bitset
→
cartesian_tree
→
challenge_coordinate_compress
→
challenge_difference_array
→
challenge_disjoint_sparse_table
→
challenge_fenwick_2d
→
challenge_prefix_sum
→
challenge_sliding_window_min
→
challenge_sparse_table_rmq
→
challenge_sqrt_decomposition_sum
→
challenge_union_find_rollback
→
disjoint_sparse
→
fenwick
→
fenwick2d
→
fenwick_range_add_range_sum
→
implicit_treap
→
lazy_segtree
→
lct
→
leftist_heap
→
lichao
→
linkcut
→
min_max_heap
→
pairing_heap
→
segment_tree
→
segment_tree_beats
→
skew_heap
→
skiplist
→
sparse_table
→
splay
→
splay_tree
→
sqrt
→
sqrt_decomposition
→
treap
→
tree
→
union_find
→
wavelet
→

loop_invariants_data_structures

Data structures with loop-invariant explanations

algorithms

data-structures

loop-invariants

moon add bobzhang/loop_invariants_data_structures@0.11.0

Download zip

Author

bobzhang

Version

0.11.0

License

Apache-2.0

Repository

github.com/moonbit-community/loop_invariants

Last updated

2 months ago

Downloads

README

#Data Structures

This module contains array, range-query, tree, heap, trie, and ordered-set style data structures, including Fenwick trees, segment trees, sparse tables, treaps, skip lists, wavelet trees, and union-find.

Packages are organized as one structure or closely related structure family per directory. Each package contains a README.mbt.md tutorial with examples that are checked by moon test.

Run from the workspace root:

moon check
moon test
moon info
moon fmt

Site source Report issue Packages Build queue Skills Statistics