;ELC
;;; Compiled
;;; in Emacs version 28.2
;;; with all optimizations.



(require 'generator)
#@67 compiler-macro for inlining `avl-tree-p'.

(fn CL-WHOLE-ARG CL-X)
(defalias 'avl-tree-p--cmacro #[514 "\300\301\302\303\211\211&\207" [cl--defsubst-expand (cl-x) (cl-block avl-tree-p (and (memq (type-of cl-x) cl-struct-avl-tree--tags) t)) nil] 9 (#$ . 105)])
(put 'avl-tree-p 'compiler-macro 'avl-tree-p--cmacro)
#@13 

(fn CL-X)
(defalias 'avl-tree-p #[257 "\301
!>\205	\302\207" [cl-struct-avl-tree--tags type-of t] 3 (#$ . 427)])
(byte-code "\300\301\302\303#\304\305\306\301#\207" [function-put avl-tree-p side-effect-free error-free put avl-tree- cl-deftype-satisfies] 5)
#@76 compiler-macro for inlining `avl-tree--dummyroot'.

(fn CL-WHOLE-ARG CL-X)
(defalias 'avl-tree--dummyroot--cmacro #[514 "\300\301\302\303\211\211&\207" [cl--defsubst-expand (cl-x) (cl-block avl-tree--dummyroot (progn (or (avl-tree-p cl-x) (signal 'wrong-type-argument (list 'avl-tree- cl-x))) (aref cl-x 1))) nil] 9 (#$ . 694)])
(put 'avl-tree--dummyroot 'compiler-macro 'avl-tree--dummyroot--cmacro)
#@64 Access slot "dummyroot" of `avl-tree-' struct CL-X.

(fn CL-X)
(defalias 'avl-tree--dummyroot #[257 "\301
!>\204\302\303\304D\"\210\211\305H\207" [cl-struct-avl-tree--tags type-of signal wrong-type-argument avl-tree- 1] 5 (#$ . 1104)])
(byte-code "\300\301\302\303#\300\207" [function-put avl-tree--dummyroot side-effect-free t] 4)
#@73 compiler-macro for inlining `avl-tree--cmpfun'.

(fn CL-WHOLE-ARG CL-X)
(defalias 'avl-tree--cmpfun--cmacro #[514 "\300\301\302\303\211\211&\207" [cl--defsubst-expand (cl-x) (cl-block avl-tree--cmpfun (progn (or (avl-tree-p cl-x) (signal 'wrong-type-argument (list 'avl-tree- cl-x))) (aref cl-x 2))) nil] 9 (#$ . 1446)])
(put 'avl-tree--cmpfun 'compiler-macro 'avl-tree--cmpfun--cmacro)
#@61 Access slot "cmpfun" of `avl-tree-' struct CL-X.

(fn CL-X)
(defalias 'avl-tree--cmpfun #[257 "\301
!>\204\302\303\304D\"\210\211\305H\207" [cl-struct-avl-tree--tags type-of signal wrong-type-argument avl-tree- 2] 5 (#$ . 1842)])
(byte-code "\300\301\302\303#\300\207" [function-put avl-tree--cmpfun side-effect-free t] 4)
#@75 compiler-macro for inlining `avl-tree--create'.

(fn CL-WHOLE-ARG CMPFUN)
(defalias 'avl-tree--create--cmacro #[514 "\300\301\302\303\211\211&\207" [cl--defsubst-expand (cmpfun) (cl-block avl-tree--create (record 'avl-tree- (avl-tree--node-create nil nil nil 0) cmpfun)) nil] 9 (#$ . 2175)])
(put 'avl-tree--create 'compiler-macro 'avl-tree--create--cmacro)
#@59 Constructor for objects of type `avl-tree-'.

(fn CMPFUN)
(defalias 'avl-tree--create #[257 "\300\301\302\303\211\211\304$#\207" [record avl-tree- avl-tree--node-create nil 0] 8 (#$ . 2542)])
(cl-struct-define 'avl-tree- nil 'cl-structure-object 'record nil '((cl-tag-slot) (dummyroot (avl-tree--node-create nil nil nil 0)) (cmpfun)) 'cl-struct-avl-tree--tags 'avl-tree- t)
#@70 Return the root node for an AVL TREE.  INTERNAL USE ONLY.

(fn TREE)
(defalias 'avl-tree--root '(macro . #[257 "\300\301DD\207" [avl-tree--node-left avl-tree--dummyroot] 4 (#$ . 2923)]))
#@76 compiler-macro for inlining `avl-tree--node-left'.

(fn CL-WHOLE-ARG CL-X)
(defalias 'avl-tree--node-left--cmacro #[514 "\300\301\302\303\211\211&\207" [cl--defsubst-expand (cl-x) (cl-block avl-tree--node-left (progn (aref cl-x 0))) nil] 9 (#$ . 3117)])
(put 'avl-tree--node-left 'compiler-macro 'avl-tree--node-left--cmacro)
#@64 Access slot "left" of `avl-tree--node' struct CL-X.

(fn CL-X)
(defalias 'avl-tree--node-left #[257 "\211\300H\207" [0] 3 (#$ . 3452)])
(byte-code "\300\301\302\303#\300\207" [function-put avl-tree--node-left side-effect-free t] 4)
#@77 compiler-macro for inlining `avl-tree--node-right'.

(fn CL-WHOLE-ARG CL-X)
(defalias 'avl-tree--node-right--cmacro #[514 "\300\301\302\303\211\211&\207" [cl--defsubst-expand (cl-x) (cl-block avl-tree--node-right (progn (aref cl-x 1))) nil] 9 (#$ . 3690)])
(put 'avl-tree--node-right 'compiler-macro 'avl-tree--node-right--cmacro)
#@65 Access slot "right" of `avl-tree--node' struct CL-X.

(fn CL-X)
(defalias 'avl-tree--node-right #[257 "\211\300H\207" [1] 3 (#$ . 4030)])
(byte-code "\300\301\302\303#\300\207" [function-put avl-tree--node-right side-effect-free t] 4)
#@76 compiler-macro for inlining `avl-tree--node-data'.

(fn CL-WHOLE-ARG CL-X)
(defalias 'avl-tree--node-data--cmacro #[514 "\300\301\302\303\211\211&\207" [cl--defsubst-expand (cl-x) (cl-block avl-tree--node-data (progn (aref cl-x 2))) nil] 9 (#$ . 4271)])
(put 'avl-tree--node-data 'compiler-macro 'avl-tree--node-data--cmacro)
#@64 Access slot "data" of `avl-tree--node' struct CL-X.

(fn CL-X)
(defalias 'avl-tree--node-data #[257 "\211\300H\207" [2] 3 (#$ . 4606)])
(byte-code "\300\301\302\303#\300\207" [function-put avl-tree--node-data side-effect-free t] 4)
#@79 compiler-macro for inlining `avl-tree--node-balance'.

(fn CL-WHOLE-ARG CL-X)
(defalias 'avl-tree--node-balance--cmacro #[514 "\300\301\302\303\211\211&\207" [cl--defsubst-expand (cl-x) (cl-block avl-tree--node-balance (progn (aref cl-x 3))) nil] 9 (#$ . 4844)])
(put 'avl-tree--node-balance 'compiler-macro 'avl-tree--node-balance--cmacro)
#@67 Access slot "balance" of `avl-tree--node' struct CL-X.

(fn CL-X)
(defalias 'avl-tree--node-balance #[257 "\211\300H\207" [3] 3 (#$ . 5194)])
(byte-code "\300\301\302\303#\300\207" [function-put avl-tree--node-balance side-effect-free t] 4)
#@97 compiler-macro for inlining `avl-tree--node-create'.

(fn CL-WHOLE-ARG LEFT RIGHT DATA BALANCE)
(defalias 'avl-tree--node-create--cmacro #[1285 "\300\301\302\303\211\211				&	\207" [cl--defsubst-expand (left right data balance) (cl-block avl-tree--node-create (vector left right data balance)) nil] 15 (#$ . 5441)])
(put 'avl-tree--node-create 'compiler-macro 'avl-tree--node-create--cmacro)
#@81 Constructor for objects of type `avl-tree--node'.

(fn LEFT RIGHT DATA BALANCE)
(defalias 'avl-tree--node-create #[1028 "\300$\207" [vector] 9 (#$ . 5843)])
(byte-code "\300\301\302\303#\304\305\306\211\307\306\310\311\305\306&	\210\312\313\314\315#\210\300\313\316\317#\306\207" [function-put avl-tree--node-create side-effect-free t cl-struct-define avl-tree--node nil vector ((left) (right) (data) (balance)) cl-struct-avl-tree--node-tags defalias avl-tree--node-branch aref "Get value of a branch of a node.\nNODE is the node, and BRANCH is the branch.\n0 for left pointer, 1 for right pointer and 2 for the data.\n\n(fn BRANCH NODE)" gv-expander #[385 "\300\301\302$\207" [gv--defsetter avl-tree--node-branch #[385 "\300\301C\"B\207" [aset append] 6 "\n\n(fn VAL &rest ARGS)"]] 7 "\n\n(fn DO &rest ARGS)"]] 11)
#@67 Return opposite direction to DIR (0 = left, 1 = right).

(fn DIR)
(defalias 'avl-tree--switch-dir '(macro . #[257 "\300\301E\207" [- 1] 4 (#$ . 6673)]))
#@63 Convert direction DIR (0,1) to sign factor (-1,+1).

(fn DIR)
(defalias 'avl-tree--dir-to-sign '(macro . #[257 "\300\301\302ED\207" [1- * 2] 5 (#$ . 6833)]))
#@66 Convert sign factor in DIR (-x,+x) to direction (0,1).

(fn DIR)
(defalias 'avl-tree--sign-to-dir '(macro . #[257 "\300\301\302BB\303BB\207" [if < (0) (0 1)] 5 (#$ . 6998)]))
#@238 Rebalance a tree after deleting a NODE.
The deletion was done from the left (DIR=0) or right (DIR=1) sub-tree
of the left (BRANCH=0) or right (BRANCH=1) child of NODE.
Return t if the height of the tree has shrunk.

(fn NODE BRANCH DIR)
(defalias 'avl-tree--del-balance #[771 "\300\"\301Z\302_S\303\211\211\211\304H_\305V\203\"\304\305I\210\306\207\304H\305U\2035\304[I\210\303\207\300\"\262\304H\262_\305X\203\207\300\"I\210I\210		I\210\305U\203z\304[I\210\304I\210\303\207\304\305I\210\304\305I\210\306\207\300	\"\262
\304H\262
\300	\"I\210
I\210\300\"I\210
I\210\304_\305W\203\306\202\307\305I\210\304_\305V\203\332[\202\333\305I\210		I\210
\304\305I\210\306\207" [avl-tree--node-branch 1 2 nil 3 0 t] 15 (#$ . 7181)])
#@22 

(fn NODE BRANCH Q)
(defalias 'avl-tree--do-del-internal #[771 "\300\"\211\301H\203\302
\301#\205'\303\301#\207
\304\304HI\210\305HI\210\306\207" [avl-tree--node-branch 1 avl-tree--do-del-internal avl-tree--del-balance 2 0 t] 8 (#$ . 8006)])
#@267 Delete DATA from BRANCH of node ROOT.
(See `avl-tree-delete' for TEST and NILFLAG).

Return cons cell (SHRUNK . DATA), where SHRUNK is t if the
height of the tree has shrunk and nil otherwise, and DATA is
the related data.

(fn CMPFUN ROOT BRANCH DATA TEST NILFLAG)
(defalias 'avl-tree--do-delete #[1542 "\300\"\211\204\f\301B\207\302H\"\2033\303\304&\211@\205/\305\304#
AB\207
\302H\"\203Z\303\306&\211@\205V\305\306#
AB\207\203j
\302H!\204j\301B\207\211\306H\204}\304HI\210\307
\302HB\207\211\304H\204\220\306HI\210\307
\302HB\207\310
\304#\203\244\305\304#
\302HB\207\301
\302HB\207" [avl-tree--node-branch nil 2 avl-tree--do-delete 0 avl-tree--del-balance 1 t avl-tree--do-del-internal] 14 (#$ . 8268)])
#@233 Rebalance tree after insertion of NODE.
NODE was inserted into the left (DIR=0) or right (DIR=1) sub-tree
of the left (BRANCH=0) or right (BRANCH=1) child of NODE.
Return t if the height of the tree has grown.

(fn NODE BRANCH DIR)
(defalias 'avl-tree--enter-balance #[771 "\300\"\301Z\302_S\303\211\211\304H_\305W\203 \304\305I\210\303\207\304H\305U\203/\304I\210\306\207\300\"\262\304H_\305V\203`\300\"I\210I\210\304\305I\210I\210\202\265\300\"\262
\304H\262
\300\n\"I\210
I\210\300\"I\210
I\210\304_\305V\203\232[\202\233\305I\210\304_\305W\203\253\202\254\305I\210I\210\300		\"\211\304\305I\266\303\207" [avl-tree--node-branch 1 2 nil 3 0 t] 14 (#$ . 9045)])
#@256 Enter DATA in BRANCH of ROOT node.
(See `avl-tree-enter' for UPDATEFUN).

Return cons cell (GREW . DATA), where GREW is t if height
of tree ROOT has grown and nil otherwise, and DATA is the
inserted data.

(fn CMPFUN ROOT BRANCH DATA &optional UPDATEFUN)
(defalias 'avl-tree--do-enter #[1284 "\300\"\211\204\301\302\211\303$I\210\304B\207\305H\"\203:\306\303%\211@\2056\307\303#
AB\207
\305H\"\203]\306\310%\211@\205Y\307\310#
AB\207
\203j
\305H\"\202k
\"\204{\"\203\311\312!\210
\305I\210\302
B\207" [avl-tree--node-branch vector nil 0 t 2 avl-tree--do-enter avl-tree--enter-balance 1 error "avl-tree-enter: Updated data does not match existing data"] 13 (#$ . 9793)])
#@39 Check the balance of TREE.

(fn TREE)
(defalias 'avl-tree--check #[257 "\301\302!>\204\303\304\305D\"\210
\306H\307H!\207" [cl-struct-avl-tree--tags avl-tree--check-node type-of signal wrong-type-argument avl-tree- 1 0] 6 (#$ . 10525)])
#@13 

(fn NODE)
(defalias 'avl-tree--check-node #[257 "\211\204\300\207\301
\300H!\301\302H!\211Z\303HU\204\304\305!\210

]T\207" [0 avl-tree--check-node 1 3 cl--assertion-failed (= (- dr dl) (avl-tree--node-balance node))] 6 (#$ . 10773)])
#@246 Apply MAP-FUNCTION to all nodes in the tree starting with ROOT.
The function is applied in-order, either ascending (DIR=0) or
descending (DIR=1).

Note: MAP-FUNCTION is applied to the node and not to the data
itself.

(fn MAP-FUNCTION ROOT DIR)
(defalias 'avl-tree--mapc #[771 "
\300\301\300C\262\205J\211\203$\302\"\203$B\262\302\"\262\202!\210\302\303Z\"\211\262\203?\302\303Z\"\202E
\211A\262\242\262\202\207" [nil t avl-tree--node-branch 1] 10 (#$ . 11024)])
#@85 Copy the AVL tree wiath ROOT as root.
This function is highly recursive.

(fn ROOT)
(defalias 'avl-tree--do-copy #[257 "\211\205\300
\301H!\300\302H!\303H\304H\305$\266\204\207" [avl-tree--do-copy 0 1 2 3 vector] 10 (#$ . 11523)])
#@74 compiler-macro for inlining `avl-tree--stack-p'.

(fn CL-WHOLE-ARG CL-X)
(defalias 'avl-tree--stack-p--cmacro #[514 "\300\301\302\303\211\211&\207" [cl--defsubst-expand (cl-x) (cl-block avl-tree--stack-p (and (memq (type-of cl-x) cl-struct-avl-tree--stack-tags) t)) nil] 9 (#$ . 11769)])
(put 'avl-tree--stack-p 'compiler-macro 'avl-tree--stack-p--cmacro)
#@13 

(fn CL-X)
(defalias 'avl-tree--stack-p #[257 "\301
!>\205	\302\207" [cl-struct-avl-tree--stack-tags type-of t] 3 (#$ . 12134)])
(byte-code "\300\301\302\303#\304\305\306\301#\207" [function-put avl-tree--stack-p side-effect-free error-free put avl-tree--stack cl-deftype-satisfies] 5)
#@80 compiler-macro for inlining `avl-tree--stack-reverse'.

(fn CL-WHOLE-ARG CL-X)
(defalias 'avl-tree--stack-reverse--cmacro #[514 "\300\301\302\303\211\211&\207" [cl--defsubst-expand (cl-x) (cl-block avl-tree--stack-reverse (progn (or (avl-tree--stack-p cl-x) (signal 'wrong-type-argument (list 'avl-tree--stack cl-x))) (aref cl-x 1))) nil] 9 (#$ . 12429)])
(put 'avl-tree--stack-reverse 'compiler-macro 'avl-tree--stack-reverse--cmacro)
#@68 Access slot "reverse" of `avl-tree--stack' struct CL-X.

(fn CL-X)
(defalias 'avl-tree--stack-reverse #[257 "\301
!>\204\302\303\304D\"\210\211\305H\207" [cl-struct-avl-tree--stack-tags type-of signal wrong-type-argument avl-tree--stack 1] 5 (#$ . 12874)])
(byte-code "\300\301\302\303#\300\207" [function-put avl-tree--stack-reverse side-effect-free t] 4)
#@78 compiler-macro for inlining `avl-tree--stack-store'.

(fn CL-WHOLE-ARG CL-X)
(defalias 'avl-tree--stack-store--cmacro #[514 "\300\301\302\303\211\211&\207" [cl--defsubst-expand (cl-x) (cl-block avl-tree--stack-store (progn (or (avl-tree--stack-p cl-x) (signal 'wrong-type-argument (list 'avl-tree--stack cl-x))) (aref cl-x 2))) nil] 9 (#$ . 13241)])
(put 'avl-tree--stack-store 'compiler-macro 'avl-tree--stack-store--cmacro)
#@66 Access slot "store" of `avl-tree--stack' struct CL-X.

(fn CL-X)
(defalias 'avl-tree--stack-store #[257 "\301
!>\204\302\303\304D\"\210\211\305H\207" [cl-struct-avl-tree--stack-tags type-of signal wrong-type-argument avl-tree--stack 2] 5 (#$ . 13676)])
(byte-code "\300\301\302\303#\300\207" [function-put avl-tree--stack-store side-effect-free t] 4)
#@81 Constructor for objects of type `avl-tree--stack'.

(fn TREE &optional REVERSE)
(defalias 'avl-tree--stack-create #[641 "\301!?\205\302!>\204\303\304\305D\"\210\306H\307HC
\203*\303\310\311\312G\\D\"\210\313\314#\207" [cl-struct-avl-tree--tags avl-tree-empty type-of signal wrong-type-argument avl-tree- 1 0 wrong-number-of-arguments avl-tree--stack-create 2 record avl-tree--stack] 9 (#$ . 14037)])
(byte-code "\300\301\302\303#\304\305\306\307\310\306\311\312\305\303&	\210\313\314\315\316#\207" [function-put avl-tree--stack-create side-effect-free t cl-struct-define avl-tree--stack nil cl-structure-object record ((cl-tag-slot) (reverse) (store)) cl-struct-avl-tree--stack-tags defalias avl-tree-stack-p avl-tree--stack-p "Return t if OBJ is an avl-tree-stack, nil otherwise.\n\n(fn OBJ)"] 11)
#@177 Recursively push children of STACK onto the front.
This pushes the children of the node at the head of STACK onto
the front of STACK, until a leaf node is reached.

(fn STACK)
(defalias 'avl-tree--stack-repopulate #[257 "\301
!>\204\302\303\304D\"\210\211\305H@\301!>\204\"\302\303\304D\"\210
\306H\203,\306\202-\307
\205V\310\"\211\262\205V\301!>\204J\302\303\304D\"\210\305\305HBI\210\2021\207" [cl-struct-avl-tree--stack-tags type-of signal wrong-type-argument avl-tree--stack 2 1 0 avl-tree--node-branch] 8 (#$ . 14856)])
(byte-code "\300\301\302\303#\210\300\304\305\306#\207" [defalias avl-tree-create avl-tree--create "Create an empty AVL tree.\nCOMPARE-FUNCTION is a function which takes two arguments, A and B,\nand returns non-nil if A is less than B, and nil otherwise.\n\n(fn COMPARE-FUNCTION)" avl-tree-compare-function avl-tree--cmpfun "Return the comparison function for the AVL tree TREE.\n\n(fn TREE)"] 4)
#@65 Return t if AVL TREE is empty, otherwise return nil.

(fn TREE)
(defalias 'avl-tree-empty #[257 "\301
!>\204\302\303\304D\"\210\211\305H\306H?\207" [cl-struct-avl-tree--tags type-of signal wrong-type-argument avl-tree- 1 0] 5 (#$ . 15808)])
#@558 Insert DATA into the AVL tree TREE.

If an element that matches DATA (according to the tree's
comparison function, see `avl-tree-create') already exists in
TREE, it will be replaced by DATA by default.

If UPDATEFUN is supplied and an element matching DATA already
exists in TREE, UPDATEFUN is called with two arguments: DATA, and
the matching element.  Its return value replaces the existing
element.  This value *must* itself match DATA (and hence the
pre-existing data), or an error will occur.

Returns the new data.

(fn TREE DATA &optional UPDATEFUN)
(defalias 'avl-tree-enter #[770 "\301\302!>\204\303\304\305D\"\210\306H\302!>\204$\303\304\305D\"\210\307H\310%A\207" [cl-struct-avl-tree--tags avl-tree--do-enter type-of signal wrong-type-argument avl-tree- 2 1 0] 9 (#$ . 16060)])
#@667 Delete the element matching DATA from the AVL TREE.
Matching uses the comparison function previously specified in
`avl-tree-create' when TREE was created.

Returns the deleted element, or nil if no matching element was
found.

Optional argument NILFLAG specifies a value to return instead of
nil if nothing was deleted, so that this case can be
distinguished from the case of a successfully deleted null
element.

If supplied, TEST specifies a test that a matching element must
pass before it is deleted.  If a matching element is found, it is
passed as an argument to TEST, and is deleted only if the return
value is non-nil.

(fn TREE DATA &optional TEST NILFLAG)
(defalias 'avl-tree-delete #[1026 "\301\302!>\204\303\304\305D\"\210\306H\302!>\204%\303\304\305D\"\210\307H\310&A\207" [cl-struct-avl-tree--tags avl-tree--do-delete type-of signal wrong-type-argument avl-tree- 2 1 0] 11 (#$ . 16871)])
#@469 Return the element in the AVL TREE which matches DATA.
Matching uses the comparison function previously specified in
`avl-tree-create' when TREE was created.

If there is no such element in the tree, nil is returned.
Optional argument NILFLAG specifies a value to return instead of nil
in this case.  This allows non-existent elements to be distinguished
from a null element.  (See also `avl-tree-member-p', which does this
for you.)

(fn TREE DATA &optional NILFLAG)
(defalias 'avl-tree-member #[770 "\301!>\204\302\303\304D\"\210\305H\306H\301!>\204$\302\303\304D\"\210\307H\3102]
\203[\211\307H\"\203@
\306H\262\202+\211\307H\"\203Q
\305H\262\202+\311\310\307H\"\210\202+0\207" [cl-struct-avl-tree--tags type-of signal wrong-type-argument avl-tree- 1 0 2 found throw] 9 (#$ . 17801)])
#@204 Return t if an element matching DATA exists in the AVL TREE.
Otherwise return nil.  Matching uses the comparison function
previously specified in `avl-tree-create' when TREE was created.

(fn TREE DATA)
(defalias 'avl-tree-member-p #[514 "\300\301#
=?\207" [(nil) avl-tree-member] 7 (#$ . 18623)])
#@269 Modify all elements in the AVL TREE by applying function FUN.

Each element is replaced by the return value of FUN applied to
that element.

FUN is applied to the elements in ascending order, or descending
order if REVERSE is non-nil.

(fn FUN TREE &optional REVERSE)
(defalias 'avl-tree-map #[770 "\301\302\303\"\304!>\204\305\306\307D\"\210\310H\311H\203\"\310\202#\311#\207" [cl-struct-avl-tree--tags avl-tree--mapc make-closure #[257 "\211\301\300\301H!I\207" [V0 2] 6 "\n\n(fn NODE)"] type-of signal wrong-type-argument avl-tree- 1 0] 9 (#$ . 18931)])
#@204 Apply function FUN to all elements in AVL TREE, for side-effect only.

FUNCTION is applied to the elements in ascending order, or
descending order if REVERSE is non-nil.

(fn FUN TREE &optional REVERSE)
(defalias 'avl-tree-mapc #[770 "\301\302\303\"\304!>\204\305\306\307D\"\210\310H\311H\203\"\310\202#\311#\207" [cl-struct-avl-tree--tags avl-tree--mapc make-closure #[257 "\300
\301H!\207" [V0 2] 4 "\n\n(fn NODE)"] type-of signal wrong-type-argument avl-tree- 1 0] 9 (#$ . 19507)])
#@235 Apply FUN to all elements in AVL TREE, combine results using COMBINATOR.

The FUNCTION is applied and the results are combined in ascending
order, or descending order if REVERSE is non-nil.

(fn FUN COMBINATOR TREE &optional REVERSE)
(defalias 'avl-tree-mapf #[1027 "\301C\302\303\304$\305!>\204\306\307\310D\"\210\311H\312H\203(\312\202)\311#\210\211\242\237\207" [cl-struct-avl-tree--tags nil avl-tree--mapc make-closure #[257 "\302\301\300\303H!\302\242\"\240\207" [V0 V1 V2 2] 6 "\n\n(fn NODE)"] type-of signal wrong-type-argument avl-tree- 1 0] 11 (#$ . 20010)])
#@422 Apply FUN to all elements in AVL TREE, and make a list of the results.

The function is applied and the list constructed in ascending
order, or descending order if REVERSE is non-nil.

Note that if you don't care about the order in which FUN is
applied, just that the resulting list is in the correct order,
then

  (avl-tree-mapf function \='cons tree (not reverse))

is more efficient.

(fn FUN TREE &optional REVERSE)
(defalias 'avl-tree-mapcar #[770 "\300\301$\237\207" [avl-tree-mapf cons] 8 (#$ . 20601)])
#@71 Return the first element in TREE, or nil if TREE is empty.

(fn TREE)
(defalias 'avl-tree-first #[257 "\301
!>\204\302\303\304D\"\210\211\305H\306H\211\205)\211\306H\203&\211\306H\262
\202\211\307H\207" [cl-struct-avl-tree--tags type-of signal wrong-type-argument avl-tree- 1 0 2] 5 (#$ . 21122)])
#@70 Return the last element in TREE, or nil if TREE is empty.

(fn TREE)
(defalias 'avl-tree-last #[257 "\301
!>\204\302\303\304D\"\210\211\305H\306H\211\205)\211\305H\203&\211\305H\262
\202\211\307H\207" [cl-struct-avl-tree--tags type-of signal wrong-type-argument avl-tree- 1 0 2] 5 (#$ . 21434)])
#@43 Return a copy of the AVL TREE.

(fn TREE)
(defalias 'avl-tree-copy #[257 "\301\302!>\204\303\304\305D\"\210
\306H!\302
!>\204#\303\304\305D\"\210\211\307H\211\310\311\302!>\204:\303\304\305D\"\210\307H\310H!I\266\207" [cl-struct-avl-tree--tags avl-tree-create type-of signal wrong-type-argument avl-tree- 2 1 0 avl-tree--do-copy] 10 (#$ . 21744)])
#@66 Return a sorted list containing all elements of TREE.

(fn TREE)
(defalias 'avl-tree-flatten #[257 "\301C\302\303\304\"\305!>\204\306\307\310D\"\210\311H\312H\311#\210\211\242\207" [cl-struct-avl-tree--tags nil avl-tree--mapc make-closure #[257 "\300
\301H\300\242B\240\207" [V0 2] 4 "\n\n(fn NODE)"] type-of signal wrong-type-argument avl-tree- 1 0] 8 (#$ . 22114)])
#@51 Return the number of elements in TREE.

(fn TREE)
(defalias 'avl-tree-size #[257 "\301C\302\303\304\"\305!>\204\306\307\310D\"\210\311H\301H\301#\210\211\242\207" [cl-struct-avl-tree--tags 0 avl-tree--mapc make-closure #[257 "\300\211\242T\240\207" [V0] 3 "\n\n(fn _)"] type-of signal wrong-type-argument avl-tree- 1] 8 (#$ . 22496)])
#@32 Clear the AVL TREE.

(fn TREE)
(defalias 'avl-tree-clear #[257 "\301
!>\204\302\303\304D\"\210\211\305H\211\306\307I\207" [cl-struct-avl-tree--tags type-of signal wrong-type-argument avl-tree- 1 0 nil] 5 (#$ . 22845)])
#@786 Return an object that behaves like a sorted stack of all elements of TREE.

If REVERSE is non-nil, the stack is sorted in reverse order.
(See also `avl-tree-stack-pop').

Note that any modification to TREE *immediately* invalidates all
avl-tree-stacks created before the modification (in particular,
calling `avl-tree-stack-pop' will give unpredictable results).

Operations on these objects are significantly more efficient than
constructing a real stack with `avl-tree-flatten' and using
standard stack functions.  As such, they can be useful in
implementing efficient algorithms of AVL trees.  However, in cases
where mapping functions `avl-tree-mapc', `avl-tree-mapcar' or
`avl-tree-mapf' would be sufficient, it is better to use one of
those instead.

(fn TREE &optional REVERSE)
(defalias 'avl-tree-stack #[513 "\300\"\301
!\210\207" [avl-tree--stack-create avl-tree--stack-repopulate] 5 (#$ . 23075)])
#@272 Pop the first element from AVL-TREE-STACK.
(See also `avl-tree-stack').

Returns nil if the stack is empty, or NILFLAG if specified.
(The latter allows an empty stack to be distinguished from
a null element stored in the AVL tree.)

(fn AVL-TREE-STACK &optional NILFLAG)
(defalias 'avl-tree-stack-pop #[513 "\301\211\302!>\204\303\304\305D\"\210\306H\211\306AI\210\262
\242\211\262\204'\207\307\302!>\204:\303\304\305D\"\210\310H\203D\311\202E\310\"\211\262\203j\302!>\204\\\303\304\305D\"\210\306\306HBI\210\312!\210
\306H\207" [cl-struct-avl-tree--stack-tags nil type-of signal wrong-type-argument avl-tree--stack 2 avl-tree--node-branch 1 0 avl-tree--stack-repopulate] 10 (#$ . 23993)])
#@276 Return the first element of AVL-TREE-STACK, without removing it from stack.

Returns nil if the stack is empty, or NILFLAG if specified.
(The latter allows an empty stack to be distinguished from
a null element stored in the AVL tree.)

(fn AVL-TREE-STACK &optional NILFLAG)
(defalias 'avl-tree-stack-first #[513 "\301!>\204\302\303\304D\"\210
\305H@\206\211\207" [cl-struct-avl-tree--stack-tags type-of signal wrong-type-argument avl-tree--stack 2] 6 (#$ . 24724)])
#@74 Return t if AVL-TREE-STACK is empty, nil otherwise.

(fn AVL-TREE-STACK)
(defalias 'avl-tree-stack-empty-p #[257 "\301
!>\204\302\303\304D\"\210\211\305H?\207" [cl-struct-avl-tree--stack-tags type-of signal wrong-type-argument avl-tree--stack 2] 5 (#$ . 25204)])
#@396 Return an AVL tree iterator object.

Calling `iter-next' on this object will retrieve the next element
from TREE.  If REVERSE is non-nil, elements are returned in
reverse order.

Note that any modification to TREE *immediately* invalidates all
iterators created from TREE before the modification (in
particular, calling `iter-next' will give unpredictable results).

(fn TREE &optional REVERSE)
(defalias 'avl-tree-iter #[513 "\300C\300C\300C\300C\300C\300C\300C\300C\300C\300C\300C\300C\300\n\301\302\"\240\210\301\303
\n%\240\210\301\304\f$\240\210\301\305
\f%\240\210\301\306%\240\210\301\307

%\240\210\301\310	%\240\210
\301\311%\240\210\301\312&\262
\f
\240\210\301\313$\207" [nil make-closure #[0 "\301\302\300\242\"\207" [V0 signal iter-end-of-sequence] 3] #[0 "\301\304\302\242!?\300\303\242\240\210\240\207" [V0 V1 V2 V3 avl-tree-stack-empty-p] 4] #[0 "\300\302\242\240\210\303\304\301\242\"\207" [V0 V1 V2 throw cps--yield] 3] #[0 "\301\304\302\242!\300\303\242\240\210\240\207" [V0 V1 V2 V3 avl-tree-stack-pop] 4] #[0 "\300\301\242\203\303\242\202
\302\242\240\207" [V0 V1 V2 V3] 2] #[0 "\302\301\242\240\210\300\303\242\240\207" [V0 V1 V2 V3] 2] #[0 "\301\302\242\300\303\242\240\210\240\207" [V0 V1 V2 V3] 4] #[0 "\302\301\242\240\210\300\303\242\240\207" [V0 V1 V2 V3] 2] #[0 "\303\305\300\301\"\302\304\242\240\210\240\207" [V0 V1 V2 V3 V4 avl-tree-stack] 4] #[514 "
\303\267\202/\300\302\242\240\210\301\304\240\207\301
\240\210\304C\305\306\300\301\302%\216\3072)\300\242 \210\202!0
\310\240\210)\207\311\312\"\207" [V0 V1 V2 #s(hash-table size 2 test eq rehash-size 1.5 rehash-threshold 0.8125 purecopy t data (:close 6 :next 15)) nil make-closure #[0 "\303\242?\205\300\302\242\240\210\301\304\240\207" [V0 V1 V2 V3 nil] 2] cps--yield t error "Unknown iterator operation %S"] 9 "\n\n(fn OP VALUE)"]] 22 (#$ . 25478)])
(provide 'avl-tree)