Gecko [ 122.154.134.11 ]

Name	Size	Permission
advice.elc	60.71 KB	-rw-r--r--
assoc.elc	4.37 KB	-rw-r--r--
authors.elc	27.41 KB	-rw-r--r--
autoload.elc	15.7 KB	-rw-r--r--
avl-tree.elc	15.92 KB	-rw-r--r--
backquote.elc	4.46 KB	-rw-r--r--
benchmark.elc	3.33 KB	-rw-r--r--
bindat.elc	10.84 KB	-rw-r--r--
byte-opt.elc	34.22 KB	-rw-r--r--
byte-run.elc	6.65 KB	-rw-r--r--
bytecomp.elc	124.99 KB	-rw-r--r--
check-declare.elc	8.77 KB	-rw-r--r--
checkdoc.elc	65.08 KB	-rw-r--r--
cl-compat.elc	4.28 KB	-rw-r--r--
cl-extra.elc	21.48 KB	-rw-r--r--
cl-indent.elc	13.98 KB	-rw-r--r--
cl-loaddefs.el	39.57 KB	-rw-r--r--
cl-macs.elc	99.36 KB	-rw-r--r--
cl-seq.elc	43.98 KB	-rw-r--r--
cl-specs.el	13.87 KB	-rw-r--r--
cl.elc	20.74 KB	-rw-r--r--
copyright.elc	8.64 KB	-rw-r--r--
crm.elc	7.94 KB	-rw-r--r--
cust-print.elc	12.77 KB	-rw-r--r--
debug.elc	24.86 KB	-rw-r--r--
derived.elc	10.72 KB	-rw-r--r--
disass.elc	5.09 KB	-rw-r--r--
easy-mmode.elc	14.85 KB	-rw-r--r--
easymenu.elc	20.15 KB	-rw-r--r--
edebug.elc	100.82 KB	-rw-r--r--
eldoc.elc	15.31 KB	-rw-r--r--
elint.elc	19.76 KB	-rw-r--r--
elp.elc	12.78 KB	-rw-r--r--
ewoc.elc	28.62 KB	-rw-r--r--
find-func.elc	17.26 KB	-rw-r--r--
find-gc.elc	3.74 KB	-rw-r--r--
float-sup.elc	1.39 KB	-rw-r--r--
generic.elc	6.55 KB	-rw-r--r--
gulp.elc	4.82 KB	-rw-r--r--
helper.elc	3.84 KB	-rw-r--r--
levents.elc	10.29 KB	-rw-r--r--
lisp-mnt.elc	21.87 KB	-rw-r--r--
lisp-mode.elc	37.14 KB	-rw-r--r--
lisp.elc	21.61 KB	-rw-r--r--
lmenu.elc	11.67 KB	-rw-r--r--
lucid.elc	6.22 KB	-rw-r--r--
macroexp.elc	4.45 KB	-rw-r--r--
map-ynp.elc	6.3 KB	-rw-r--r--
pp.elc	5.09 KB	-rw-r--r--
re-builder.elc	22.36 KB	-rw-r--r--
regexp-opt.elc	4.43 KB	-rw-r--r--
regi.elc	6.15 KB	-rw-r--r--
ring.elc	6.41 KB	-rw-r--r--
rx.elc	26.61 KB	-rw-r--r--
shadow.elc	5.63 KB	-rw-r--r--
sregex.elc	12.45 KB	-rw-r--r--
syntax.elc	5.18 KB	-rw-r--r--
tcover-ses.elc	14.68 KB	-rw-r--r--
tcover-unsafep.elc	4.09 KB	-rw-r--r--
testcover.elc	13.41 KB	-rw-r--r--
timer.elc	22.73 KB	-rw-r--r--
tq.elc	3.94 KB	-rw-r--r--
trace.elc	5.28 KB	-rw-r--r--
unsafep.elc	5.01 KB	-rw-r--r--
warnings.elc	9.61 KB	-rw-r--r--

Code Editor : avl-tree.elc

;ELC���
;;; Compiled by mockbuild@c6b8.bsys.dev.centos.org on Thu Feb 19 13:02:52 2015
;;; from file /builddir/build/BUILD/emacs-23.1/lisp/emacs-lisp/avl-tree.el
;;; in Emacs version 23.1.1
;;; with all optimizations.

;;; This file uses dynamic docstrings, first added in Emacs 19.29.
(if (and (boundp 'emacs-version)
	 (< (aref emacs-version (1- (length emacs-version))) ?A)
	 (or (and (boundp 'epoch::version) epoch::version)
	     (string-lessp emacs-version "19.29")))
    (error "`avl-tree.el' was compiled for Emacs 19.29 or later"))

;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;

(byte-code "\300\301\302\303#\210\301\304N\204�\300\301\304\305#\210\300\207" [put avl-tree--node-left cl-compiler-macro #[(--cl-whole-arg-- cl-x) "\301\302\303\304\305\211&\207" [cl-x cl-defsubst-expand (cl-x) (block avl-tree--node-left (aref cl-x 0)) t nil] 7] byte-compile cl-byte-compile-compiler-macro] 4)
(defalias 'avl-tree--node-left #[(cl-x) "\301H\207" [cl-x 0] 2])
(byte-code "\300\301\302\303#\210\300\304\305\306#\210\304\307N\204�\300\304\307\310#\210\300\207" [put avl-tree--node-left setf-method #[(cl-x) "\301\302\303\304\305%\207" [cl-x cl-struct-setf-expander avl-tree--node avl-tree--node-left nil 0] 6] avl-tree--node-right cl-compiler-macro #[(--cl-whole-arg-- cl-x) "\301\302\303\304\305\211&\207" [cl-x cl-defsubst-expand (cl-x) (block avl-tree--node-right (aref cl-x 1)) t nil] 7] byte-compile cl-byte-compile-compiler-macro] 4)
(defalias 'avl-tree--node-right #[(cl-x) "\301H\207" [cl-x 1] 2])
(byte-code "\300\301\302\303#\210\300\304\305\306#\210\304\307N\204�\300\304\307\310#\210\300\207" [put avl-tree--node-right setf-method #[(cl-x) "\301\302\303\304\305%\207" [cl-x cl-struct-setf-expander avl-tree--node avl-tree--node-right nil 1] 6] avl-tree--node-data cl-compiler-macro #[(--cl-whole-arg-- cl-x) "\301\302\303\304\305\211&\207" [cl-x cl-defsubst-expand (cl-x) (block avl-tree--node-data (aref cl-x 2)) t nil] 7] byte-compile cl-byte-compile-compiler-macro] 4)
(defalias 'avl-tree--node-data #[(cl-x) "\301H\207" [cl-x 2] 2])
(byte-code "\300\301\302\303#\210\300\304\305\306#\210\304\307N\204�\300\304\307\310#\210\300\207" [put avl-tree--node-data setf-method #[(cl-x) "\301\302\303\304\305%\207" [cl-x cl-struct-setf-expander avl-tree--node avl-tree--node-data nil 2] 6] avl-tree--node-balance cl-compiler-macro #[(--cl-whole-arg-- cl-x) "\301\302\303\304\305\211&\207" [cl-x cl-defsubst-expand (cl-x) (block avl-tree--node-balance (aref cl-x 3)) t nil] 7] byte-compile cl-byte-compile-compiler-macro] 4)
(defalias 'avl-tree--node-balance #[(cl-x) "\301H\207" [cl-x 3] 2])
(byte-code "\300\301\302\303#\210\300\304\305\306#\210\304\307N\204�\300\304\307\310#\210\300\207" [put avl-tree--node-balance setf-method #[(cl-x) "\301\302\303\304\305%\207" [cl-x cl-struct-setf-expander avl-tree--node avl-tree--node-balance nil 3] 6] avl-tree--node-create cl-compiler-macro #[(--cl-whole-arg-- left right data balance) "\304\305\306\307\310\211	\n&	\207" [left right data balance cl-defsubst-expand (left right data balance) (block avl-tree--node-create (vector left right data balance)) t nil] 10] byte-compile cl-byte-compile-compiler-macro] 4)
(defalias 'avl-tree--node-create #[(left right data balance) "\304	\n$\207" [left right data balance vector] 5])
(byte-code "\301C\302\303\304\305#\210\302\303\306\307#\210\302\303\310\311#\210\302\303\312\311#\210\302\313\314\315#\210\302\316\314\315#\210\302\317\314\315#\210\302\320\314\315#\210\302\321\314\315#\210\322\323\324\325#\210\302\323\326\327#\210\302\330\331\332#\210\330\333N\204W�\302\330\333\334#\210\311\207" [cl-struct-avl-tree--node-tags cl-struct-avl-tree--node put avl-tree--node cl-struct-slots ((left) (right) (data) (balance)) cl-struct-type (vector nil) cl-struct-include nil cl-struct-print avl-tree--node-create side-effect-free t avl-tree--node-balance avl-tree--node-data avl-tree--node-right avl-tree--node-left defalias avl-tree--node-branch aref "Get value of a branch of a node.\n\nNODE is the node, and BRANCH is the branch.\n0 for left pointer, 1 for right pointer and 2 for the data.\"\n(fn node branch)" setf-method #[(&rest args) "\304\305\"\306\307!	\nC	\n\310\311C\"*B\312	B\257*\207" [args --args--temp-- --store--temp-- store mapcar #[(_) "\300\301!\207" [make-symbol "--cl-var--"] 2] make-symbol "--cl-store--" aset append avl-tree--node-branch] 7 "Not documented\n\n(fn &rest ARGS)"] avl-tree--dummyroot cl-compiler-macro #[(--cl-whole-arg-- cl-x) "\301\302\303\304\211\211&\207" [cl-x cl-defsubst-expand (cl-x) (block avl-tree--dummyroot (or (and (memq (aref cl-x 0) cl-struct-avl-tree--tags)) (error "avl-tree--dummyroot accessing a non-avl-tree-")) (aref cl-x 1)) nil] 7] byte-compile cl-byte-compile-compiler-macro] 4)
(defalias 'avl-tree--dummyroot #[(cl-x) "\302H	>\204\f�\303\304!\210\305H\207" [cl-x cl-struct-avl-tree--tags 0 error "avl-tree--dummyroot accessing a non-avl-tree-" 1] 2])
(byte-code "\300\301\302\303#\210\300\304\305\306#\210\304\307N\204�\300\304\307\310#\210\300\207" [put avl-tree--dummyroot setf-method #[(cl-x) "\301\302\303\304\305%\207" [cl-x cl-struct-setf-expander avl-tree- avl-tree--dummyroot #1=(and (memq (aref cl-x 0) cl-struct-avl-tree--tags)) 1] 6] avl-tree--cmpfun cl-compiler-macro #[(--cl-whole-arg-- cl-x) "\301\302\303\304\211\211&\207" [cl-x cl-defsubst-expand (cl-x) (block avl-tree--cmpfun (or #1# (error "avl-tree--cmpfun accessing a non-avl-tree-")) (aref cl-x 2)) nil] 7] byte-compile cl-byte-compile-compiler-macro] 4)
(defalias 'avl-tree--cmpfun #[(cl-x) "\302H	>\204\f�\303\304!\210\305H\207" [cl-x cl-struct-avl-tree--tags 0 error "avl-tree--cmpfun accessing a non-avl-tree-" 2] 2])
(byte-code "\300\301\302\303#\210\300\304\305\306#\210\304\307N\204�\300\304\307\310#\210\300\207" [put avl-tree--cmpfun setf-method #[(cl-x) "\301\302\303\304\305%\207" [cl-x cl-struct-setf-expander avl-tree- avl-tree--cmpfun (and #1=(memq (aref cl-x 0) cl-struct-avl-tree--tags)) 2] 6] avl-tree-p cl-compiler-macro #[(--cl-whole-arg-- cl-x) "\301\302\303\304\211\211&\207" [cl-x cl-defsubst-expand (cl-x) (block avl-tree-p (and (vectorp cl-x) (>= (length cl-x) 3) #1# t)) nil] 7] byte-compile cl-byte-compile-compiler-macro] 4)
(defalias 'avl-tree-p #[(cl-x) "\302!\205�G\303Y\205�\304H	>\205�\305\207" [cl-x cl-struct-avl-tree--tags vectorp 3 0 t] 2])
(byte-code "\300\301\302\303#\210\301\304N\204�\300\301\304\305#\210\300\207" [put avl-tree-create cl-compiler-macro #[(--cl-whole-arg-- cmpfun) "\301\302\303\304\305\211&\207" [cmpfun cl-defsubst-expand (cmpfun) (block avl-tree-create (vector 'cl-struct-avl-tree- (avl-tree--node-create nil nil nil 0) cmpfun)) t nil] 7] byte-compile cl-byte-compile-compiler-macro] 4)
(defalias 'avl-tree-create #[(cmpfun) "\301\302\301\303\211\211\304$#\207" [cmpfun vector cl-struct-avl-tree- nil 0] 7])
(byte-code "\302B\303C\304\305\306\307#\210\304\305\310\311#\210\304\305\312\313#\210\304\305\314\315#\210\304\316\317\315#\210\304\320\317\321#\210\304\322\317\315#\210\304\323\317\315#\207" [custom-print-functions cl-struct-avl-tree--tags #[(cl-x cl-s cl-n) "\303!\205P�G\304Y\205P�\305H	>\205P�\306\307\n\"\210\306\310\n\"\210\311\305H	>\204,�\312\313!\210\314H\n\"\210\306\315\n\"\210\311\305H	>\204D�\312\316!\210\317H\n\"\210\306\320\n\"\210\321\207" [cl-x cl-struct-avl-tree--tags cl-s vectorp 3 0 princ "#S(avl-tree-" " dummyroot" prin1 error "avl-tree--dummyroot accessing a non-avl-tree-" 1 " cmpfun" "avl-tree--cmpfun accessing a non-avl-tree-" 2 ")" t] 3] cl-struct-avl-tree- put avl-tree- cl-struct-slots ((cl-tag-slot) (dummyroot (avl-tree--node-create nil nil nil 0)) (cmpfun)) cl-struct-type (vector nil) cl-struct-include nil cl-struct-print t avl-tree-create side-effect-free avl-tree-p error-free avl-tree--cmpfun avl-tree--dummyroot] 4)
(defalias 'avl-tree--root '(macro . #[(tree) "\300\207" [(avl-tree--node-left (avl-tree--dummyroot tree))] 1]))
(put 'avl-tree--root 'setf-method #[(tree) "\304\305!\304\306!C\nC	C	\307\310\311\nDDE*\312D\257*\207" [--tree--temp-- --node--temp-- tree node make-symbol "--cl-tree--" "--cl-node--" setf avl-tree--node-left avl-tree--dummyroot avl-tree--root] 7])
(defalias 'avl-tree--del-balance1 #[(node branch) "\306	\"\307\211\211\211\211
\211\310H\311W\203#�\310\311I\210\312\202\325�\310H\311U\2036�\310\313I\210\307\202\325�\313H\211
\310H\211\311Y\203\205�\313
\311HI\210
\311I\210
\311U\203m�\310\313I\210
\310\314I\210\307\202{�\310\311I\210
\310\311I\210\312	
I\210\n\202\325�
\311H\211\310H
\311\f\313HI\210\f\313
I\210\313\f\311HI\210\f\311I\210\310\311V\203\267�\314\202\270�\311I\210
\310\311W\203\307�\313\202\310�\311I\210	\fI\210\f\310\311I\210\312.\207" [node branch result b2 p2 b1 avl-tree--node-branch nil 3 0 t 1 -1 p1 br] 7])
(defalias 'avl-tree--del-balance2 #[(node branch) "\306	\"\307\211\211\211\211
\211\310H\311V\203#�\310\311I\210\312\202\325�\310H\311U\2036�\310\313I\210\307\202\325�\311H\211
\310H\211\311X\203\205�\311
\314HI\210
\314I\210
\311U\203m�\310\313I\210
\310\314I\210\307\202{�\310\311I\210
\310\311I\210\312	
I\210\n\202\325�
\314H\211\310H
\314\f\311HI\210\f\311
I\210\311\f\314HI\210\f\314I\210\310\311W\203\267�\314\202\270�\311I\210
\310\311V\203\307�\313\202\310�\311I\210	\fI\210\f\310\311I\210\312.\207" [node branch result b2 p2 b1 avl-tree--node-branch nil 3 0 t -1 1 p1 br] 7])
(defalias 'avl-tree--do-del-internal #[(node branch q) "\304	\"\211\305H\203�\306\n\305#\205)�\307	\"\202)�\310\n\310HI\210	\n\311HI\210\312)\207" [node branch br q avl-tree--node-branch 1 avl-tree--do-del-internal avl-tree--del-balance2 2 0 t] 5])
(defalias 'avl-tree--do-delete #[(cmpfun root branch data) "\305	\"\211\204
�\306\202m�\f\n\307H\"\203&�\310\n\311\f$\205m�\312	\"\202m�\n\307H\f\"\203?�\310\n\313\f$\205m�\314	\"\202m�\n\313H\204P�	\n\311HI\210\315\202m�\n\311H\204a�	\n\313HI\210\315\202m�\316\n\311\n#\205m�\312	\")\207" [root branch br cmpfun data avl-tree--node-branch nil 2 avl-tree--do-delete 0 avl-tree--del-balance1 1 avl-tree--del-balance2 t avl-tree--do-del-internal] 6])
(defalias 'avl-tree--enter-balance1 #[(node branch) "\306	\"\307\211\211\211\211
\310H\311W\203 �
\310\311I\210\307\202\257�
\310H\311U\2033�
\310\312I\210\313\202\257�
\312H\211\310H\311V\203\\�
\312
\311HI\210
\311
I\210
\310\311I\210	
I\210\202\242�
\311H\211\310H
\311\f\312HI\210\f\312
I\210
\312\f\311HI\210\f\311
I\210
\310\311V\203\213�\314\202\214�\311I\210
\310\311W\203\232�\312\202\233�\311I\210	\fI\210\306	\"\211\310\311I\210)\307-\207" [node branch result b2 p2 p1 avl-tree--node-branch nil 3 0 1 t -1 br #1=#:--cl-x--] 6])
(defalias 'avl-tree--enter-balance2 #[(node branch) "\306	\"\307\211\211\211\310H\311V\203�
\310\311I\210\307\202\242�
\310H\311U\203-�
\310\312I\210\313\202\242�
\311H\211\310H\311W\203R�
\311\f\314HI\210\f\314
I\210
\310\311I\210	\fI\210\202\225�\f\314H\211\310H\f\314\311HI\210\311\fI\210
\311\314HI\210\314
I\210
\310\n\311W\203~�\314\202�\311I\210\f\310\n\311V\203\215�\312\202\216�\311I\210	I\210\306	\"\211
\310\311I\210)\307,\207" [node branch b2 p2 p1 br avl-tree--node-branch nil 3 0 -1 t 1 #1=#:--cl-x--] 5])
(defalias 'avl-tree--do-enter #[(cmpfun root branch data) "\305	\"\211\204�	\306\307\211\310$I\210\311\202O�\f\n\312H\"\2030�\313\f\n\310$\205O�\314	\"\202O�\f\n\312H\"\203I�\313\f\n\315$\205O�\316	\"\202O�\n\312I\210\307)\207" [root branch br data cmpfun avl-tree--node-branch vector nil 0 t 2 avl-tree--do-enter avl-tree--enter-balance2 1 avl-tree--enter-balance1] 8])
(defalias 'avl-tree--mapc #[(map-function root) "\305\306\305\nB\205A�	\203$�\307H\203$�\nB\307H\211\202�\f!\210\310H\211\2036�\310H\202;�\n\211A@\211\204�\305+\207" [root go-left stack node map-function nil t 0 1] 4])
(defalias 'avl-tree--do-copy #[(root) "\205�\301\302\303H!\302\304H!\305H\306H$\207" [root vector avl-tree--do-copy 0 1 2 3] 6])
(defalias 'avl-tree-compare-function 'avl-tree--cmpfun "Return the comparison function for the avl tree TREE.\n\n(fn TREE)")
#@59 Return t if avl tree TREE is emtpy, otherwise return nil.
(defalias 'avl-tree-empty #[(tree) "\302H	>\204\f�\303\304!\210\305H\302H?\207" [tree cl-struct-avl-tree--tags 0 error "avl-tree--dummyroot accessing a non-avl-tree-" 1] 2 (#$ . 12198)])
#@48 In the avl tree TREE insert DATA.
Return DATA.
(defalias 'avl-tree-enter #[(tree data) "\303\304H	>\204
�\305\306!\210\307H\304H	>\204�\305\310!\210\311H\304\n$\210\n\207" [tree cl-struct-avl-tree--tags data avl-tree--do-enter 0 error "avl-tree--cmpfun accessing a non-avl-tree-" 2 "avl-tree--dummyroot accessing a non-avl-tree-" 1] 5 (#$ . 12451)])
#@112 From the avl tree TREE, delete DATA.
Return the element in TREE which matched DATA,
nil if no element matched.
(defalias 'avl-tree-delete #[(tree data) "\303\304H	>\204
�\305\306!\210\307H\304H	>\204�\305\310!\210\311H\304\n$\207" [tree cl-struct-avl-tree--tags data avl-tree--do-delete 0 error "avl-tree--cmpfun accessing a non-avl-tree-" 2 "avl-tree--dummyroot accessing a non-avl-tree-" 1] 5 (#$ . 12813)])
#@221 Return the element in the avl tree TREE which matches DATA.
Matching uses the compare function previously specified in
`avl-tree-create' when TREE was created.

If there is no such element in the tree, the value is nil.
(defalias 'avl-tree-member #[(tree data) "\306H	>\204\f�\307\310!\210\311H\306H\306H	>\204�\307\312!\210\313H\314\f\203S�\n\204S�
\f\313H\"\203=�\f\306H\211\202%�\f\313H
\"\203N�\f\311H\211\202%�\315\202$�\f\205Z�\f\313H+\207" [tree cl-struct-avl-tree--tags found compare-function node data 0 error "avl-tree--dummyroot accessing a non-avl-tree-" 1 "avl-tree--cmpfun accessing a non-avl-tree-" 2 nil t] 5 (#$ . 13235)])
#@62 Apply __MAP-FUNCTION__ to all elements in the avl tree TREE.
(defalias 'avl-tree-map #[(__map-function__ tree) "\302\303\304H	>\204�\305\306!\210\307H\304H\"\207" [tree cl-struct-avl-tree--tags avl-tree--mapc #[(node) "\n\304H!	\304I*\207" [node #1=#:--cl-x-- __map-function__ #2=#:--cl-store-- 2] 3] 0 error "avl-tree--dummyroot accessing a non-avl-tree-" 1] 4 (#$ . 13894)])
#@60 Return the first element in TREE, or nil if TREE is empty.
(defalias 'avl-tree-first #[(tree) "\303H	>\204\f�\304\305!\210\306H\303H\211\205'�\n\303H\203$�\n\303H\211\202�\n\307H)\207" [tree cl-struct-avl-tree--tags node 0 error "avl-tree--dummyroot accessing a non-avl-tree-" 1 2] 3 (#$ . 14285)])
#@59 Return the last element in TREE, or nil if TREE is empty.
(defalias 'avl-tree-last #[(tree) "\303H	>\204\f�\304\305!\210\306H\303H\211\205'�\n\306H\203$�\n\306H\211\202�\n\307H)\207" [tree cl-struct-avl-tree--tags node 0 error "avl-tree--dummyroot accessing a non-avl-tree-" 1 2] 3 (#$ . 14595)])
#@37 Return a copy of the avl tree TREE.
(defalias 'avl-tree-copy #[(tree) "\305\306\305\307\211\211\310$\310H	>\204�\311\312!\210\313H#\211\314\310H	>\204(�\311\315!\210\316H\310H!\310H	>\204;�\311\315!\210\316H\310\fI\210*\n)\207" [tree cl-struct-avl-tree--tags new-tree #1=#:--cl-tree-- #2=#:--cl-node-- vector cl-struct-avl-tree- nil 0 error "avl-tree--cmpfun accessing a non-avl-tree-" 2 avl-tree--do-copy "avl-tree--dummyroot accessing a non-avl-tree-" 1] 8 (#$ . 14903)])
#@55 Return a sorted list containing all elements of TREE.
(defalias 'avl-tree-flatten #[(tree) "\303\304\305	\306H\n>\204�\307\310!\210	\311H\306H\"\210)\237\207" [treelist tree cl-struct-avl-tree--tags nil avl-tree--mapc #[(node) "\302H	B\211\207" [node treelist 2] 2] 0 error "avl-tree--dummyroot accessing a non-avl-tree-" 1] 4 (#$ . 15393)])
#@40 Return the number of elements in TREE.
(defalias 'avl-tree-size #[(tree) "\303\304\305	\303H\n>\204�\306\307!\210	\310H\303H\"\210)\207" [treesize tree cl-struct-avl-tree--tags 0 avl-tree--mapc #[(data) "T\211\207" [treesize] 2] error "avl-tree--dummyroot accessing a non-avl-tree-" 1] 4 (#$ . 15746)])
#@26 Clear the avl tree TREE.
(defalias 'avl-tree-clear #[(tree) "\302H	>\204\f�\303\304!\210\305H\302\306I\207" [tree cl-struct-avl-tree--tags 0 error "avl-tree--dummyroot accessing a non-avl-tree-" 1 nil] 3 (#$ . 16060)])
(provide 'avl-tree)

${this.title}

Code Editor : avl-tree.elc