branch: externals/dict-tree
commit cfdc73db884559617b832779291bc8212653f675
Author: Toby S. Cubitt <toby-predict...@dr-qubit.org>
Commit: Toby S. Cubitt <toby-predict...@dr-qubit.org>
Fixed calls to dictree-create-meta-dict.
dictree-meta-dict-create was renamed to dictree-create-meta-dict in
dictree.el.
---
dict-tree.el | 4 ++--
1 file changed, 2 insertions(+), 2 deletions(-)
diff --git a/dict-tree.el b/dict-tree.el
index b51f7aa..280ee01 100644
--- a/dict-tree.el
+++ b/dict-tree.el
@@ -2399,7 +2399,7 @@ that if the same key appears in multiple dictionaries,
the alist
may contain the same key multiple times, each copy associated
with the data from a different dictionary. If you want to combine
identical keys, use a meta-dictionary; see
-`dictree-meta-dict-create'.)
+`dictree-create-meta-dict'.)
If optional argument RANK-FUNCTION is any non-nil value that is
not a function, the completions are sorted according to the
@@ -2482,7 +2482,7 @@ are sought in all dictionaries in the list. (Note that if
the
same key appears in multiple dictionaries, the alist may contain
the same key multiple times, each copy associated with the data
from a different dictionary. If you want to combine identical
-keys, use a meta-dictionary; see `dictree-meta-dict-create'.)
+keys, use a meta-dictionary; see `dictree-create-meta-dict'.)
REGEXP is a regular expression, but it need not necessarily be a
string. It must be a sequence (vector, list of string) whose
