<commit_before>
# Rust libtrees

Implementation of concurrent, disk or memory based trees in Rust.

Concrete plans are:
    * Lehmann and Yao concurrent B-Tree [see](http://www.cs.cornell.edu/courses/CS4411/2009sp/blink.pdf)
    * mutlidimensional R-Tree
    * Kd-Tree


<commit_msg>fixed README.md<commit_after>
# Rust libtrees

Implementation of concurrent, disk or memory based trees in Rust.

My concrete plans are:

* Lehmann and Yao concurrent B-Tree [see](http://www.cs.cornell.edu/courses/CS4411/2009sp/blink.pdf)
* mutlidimensional R-Tree
* Kd-Tree



{'fraction_non_alphanumeric': 0.10178571428571428, 'fraction_numerical': 0.02857142857142857, 'mean_word_length': 4.054054054054054, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, 'https://': 0, 'lorem ipsum': 0, 'www.': 2, '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': '585329', 'n_tokens_mistral': 221, 'n_tokens_neox': 193, 'n_words': 52}