diff options
| author | Daniel Baumann <daniel.baumann@progress-linux.org> | 2018-11-07 12:19:29 +0000 |
|---|---|---|
| committer | Daniel Baumann <daniel.baumann@progress-linux.org> | 2018-11-07 12:20:17 +0000 |
| commit | a64a253794ac64cb40befee54db53bde17dd0d49 (patch) | |
| tree | c1024acc5f6e508814b944d99f112259bb28b1be /libnetdata/avl/README.md | |
| parent | New upstream version 1.10.0+dfsg (diff) | |
| download | netdata-a64a253794ac64cb40befee54db53bde17dd0d49.tar.xz netdata-a64a253794ac64cb40befee54db53bde17dd0d49.zip | |
New upstream version 1.11.0+dfsgupstream/1.11.0+dfsg
Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>
Diffstat (limited to '')
| -rw-r--r-- | libnetdata/avl/README.md | 11 |
1 files changed, 11 insertions, 0 deletions
diff --git a/libnetdata/avl/README.md b/libnetdata/avl/README.md new file mode 100644 index 000000000..48212a715 --- /dev/null +++ b/libnetdata/avl/README.md @@ -0,0 +1,11 @@ +# AVL + +AVL is a library indexing objects in B-Trees. + +`avl_insert()`, `avl_remove()` and `avl_search()` are adaptations +of the AVL algorithm found in `libavl` v2.0.3, so that they do not +use any memory allocations and their memory footprint is optimized +(by eliminating non-necessary data members). + +In addition to the above, this version of AVL, provides versions using locks +and traversal functions.
\ No newline at end of file |