[elpa] externals/dict-tree 77f7b3a 133/154: Minor code refactoring.

[Stefan Monnier]

branch: externals/dict-tree
commit 77f7b3ae545211fe8b39d3db376fd8f836a724cc
Author: Toby S. Cubitt <toby-predictive@dr-qubit.org>
Commit: Toby S. Cubitt <toby-predictive@dr-qubit.org>

    Minor code refactoring.
---
 dict-tree.el | 23 +++++++++++++++--------
 1 file changed, 15 insertions(+), 8 deletions(-)

diff --git a/dict-tree.el b/dict-tree.el
index faa0970..6cf4021 100644
--- a/dict-tree.el
+++ b/dict-tree.el
@@ -2057,14 +2057,21 @@ Interactively, DICT is read from the mini-buffer."
 
 
 
-(defun dictree--construct-meta-stack-heapfun (sortfun &optional reverse)
-  ;; Wrap SORTFUN, which sorts keys, so it can act on
-  ;; dictree--meta-stack elements.
-  (if reverse
-      `(lambda (b a) (,sortfun (car (dictree-stack-first a))
-                              (car (dictree-stack-first b))))
-    `(lambda (a b) (,sortfun (car (dictree-stack-first a))
-                            (car (dictree-stack-first b))))))
+;; Wrap SORTFUN, which sorts keys, so it can act on dictree--meta-stack
+;; elements.
+(trie--if-lexical-binding
+    (defun dictree--construct-meta-stack-heapfun (sortfun &optional reverse)
+      (if reverse
+         (lambda (b a) (funcall sortfun (car (dictree-stack-first a))
+                                (car (dictree-stack-first b))))
+       (lambda (a b) (funcall sortfun (car (dictree-stack-first a))
+                              (car (dictree-stack-first b))))))
+  (defun dictree--construct-meta-stack-heapfun (sortfun &optional reverse)
+    (if reverse
+       `(lambda (b a) (,sortfun (car (dictree-stack-first a))
+                                (car (dictree-stack-first b))))
+      `(lambda (a b) (,sortfun (car (dictree-stack-first a))
+                              (car (dictree-stack-first b)))))))
 
 
 (defun dictree-stack (dict &optional type reverse)