From 836e15635e6bee7fefe46cba4876facd2c6c98b7 Mon Sep 17 00:00:00 2001 From: Walter Weinmann Date: Mon, 21 Nov 2016 21:04:41 +0100 Subject: [PATCH] Version 1.1.0: Pluggable sort function. --- README.md | 12 ++++++------ 1 file changed, 6 insertions(+), 6 deletions(-) diff --git a/README.md b/README.md index 5a07c50..e67bad4 100644 --- a/README.md +++ b/README.md @@ -243,23 +243,23 @@ Types: Returns tuple {Key, Value}, where Key is the smallest key in B-Tree, and Value is the value associated with this key. Assumes that B-Tree is not empty. -### sort_ascending (Key_1, Key_2) -> equal | greater | less ### +### sort_ascending (Key1, Key2) -> equal | greater | less ### Types: - Key_1 = Key_2 = any() + Key1 = Key2 = any() equal = greater = less = atom() -Returns **greater** if Key_1 > Key_2, **less** if Key_1 < Key_2 and **equal** elsewise. +Returns **greater** if Key1 > Key2, **less** if Key1 < Key2 and **equal** else-wise. -### sort_dscending (Key_1, Key_2) -> equal | greater | less ### +### sort_descending (Key1, Key2) -> equal | greater | less ### Types: - Key_1 = Key_2 = any() + Key1 = Key2 = any() equal = greater = less = atom() -Returns **less** if Key_1 > Key_2, **greater** if Key_1 < Key_2 and **equal** elsewise. +Returns **less** if Key1 > Key2, **greater** if Key1 < Key2 and **equal** else-wise. ### take_largest (B-Tree1) -> {Key, Value, B-Tree2} ###