<commit_before># grenier

A collection of various algorithms in OCaml.

Licensed under ISC license.

## baltree : Generic balanced-tree
  
A binary tree with smart constructors that ensure the resulting tree is
balanced.

This data structure can be used as a primitive on top of which one can easily
build balanced data structures, including but not limited to binary search
trees.

For instance, implementing stdlib-like Set/Map is trivial and suffers only a ~5
% overhead (and one gains a O(1) length/cardinal operation).<commit_msg>dune-releasify - pffff<commit_after># grenier — A collection of various algorithms in OCaml.

Licensed under ISC license.

## baltree : Generic balanced-tree
  
A binary tree with smart constructors that ensure the resulting tree is
balanced.

This data structure can be used as a primitive on top of which one can easily
build balanced data structures, including but not limited to binary search
trees.

For instance, implementing stdlib-like Set/Map is trivial and suffers only a ~5
% overhead (and one gains a O(1) length/cardinal operation).
{'fraction_non_alphanumeric': 0.04722222222222222, 'fraction_numerical': 0.003703703703703704, 'mean_word_length': 4.4873096446700504, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '4166076', 'n_tokens_mistral': 287, 'n_tokens_neox': 277, 'n_words': 155}