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



#@23 

(fn TREE KEY VAL I)
(defalias 'radix-tree--insert #[1028 "\300:\203\225\242\211:\203\212\211\242
\243\243G\\\301\302\211\f&\211\303=\2038\304$
BB\207\211\305W\203D\306
Z\202F\211S\211\305U\203]\304\f\f\f$B
B\207\305O\n\\\302O\302O
\307\232\203y\f\202~

BC\nBBBB\207
$\207\211$\207" [#[1028 "G
U\203	
\207
\300O\211BB\207" [nil] 7 "\n\n(fn TREE KEY VAL I)"] compare-strings nil t radix-tree--insert 0 -1 ""] 19 (#$ . 84)])
#@19 

(fn TREE KEY I)
(defalias 'radix-tree--remove #[771 "\300:\203\234\242\211:\203\226\211\242
\243\243G\\\301\302\211&\211\303=\203p\304\305#\211\2047\207\211:\203h\211\242\211:\203`\211\242
\243\243\211\204W\nPB	B\207\n#\207#\207
#\207\211\306W\203|\307
Z\202~\211S\211\306U\203\223\305#B
B\207\n\207
#\207\211#\207" [#[771 "
G
U?\205	\207" #1=[] 5 "\n\n(fn TREE KEY I)"] compare-strings nil t #[771 "
BB\207" #1# 5 "\n\n(fn PREFIX RTREE NPTREE)"] radix-tree--remove 0 -1] 20 (#$ . 585)])
#@22 

(fn TREE STRING I)
(defalias 'radix-tree--lookup #[771 "\300:\203Y\242\211:\203R\211\242
\243\243G\\\301\302\211&\211\303=\2031\304\n#\207\211\305W\203=\306
Z\202?\211S\211\305U\203M\304#\207
\\\207
#\207\211#\207" [#[771 "\211\203G\232\203\211\250\203\300
B\207\207
\207" [t] 5 "\n\n(fn STRING I VAL)"] compare-strings nil t radix-tree--lookup 0 -1] 16 (#$ . 1152)])
#@31 

(fn TREE STRING I PREFIXES)
(defalias 'radix-tree--prefixes #[1028 "\300:\203E\242\211:\203=\211\242
\243\243G\\\301\302\211\f\f&\303$
\304=\203<\303\f$\207\207
	$\207\211$\207" [#[1028 "\211\204
\207\300O
\242\301=\203
A\202
BB\207" [0 t] 7 "\n\n(fn STRING I PREFIXES VAL)"] compare-strings nil radix-tree--prefixes t] 17 (#$ . 1574)])
#@22 

(fn TREE STRING I)
(defalias 'radix-tree--subtree #[771 "
G
\232\203	\207:\205z\242\211:\205x\211\242
\243\243G\\\300\301\211\n\n&\211\302=\203<\303	#\266\205\202x\211\304W\203H\305
Z\202J\211S\211\304U\203Z\303\n\n#\202t\211\\	G\232\203s
\301O\211BC\262
\202t\301\262
\266\205\262
\207" [compare-strings nil t radix-tree--subtree 0 -1] 15 (#$ . 1964)])
#@23 The empty radix-tree.
(defconst radix-tree-empty nil (#$ . 2361))
#@68 Insert a mapping from KEY to VAL in radix TREE.

(fn TREE KEY VAL)
(defalias 'radix-tree-insert #[771 "\211:\203\n\300
B\262
\211\203\301\302$\207\303\302#\207" [t radix-tree--insert 0 radix-tree--remove] 8 (#$ . 2433)])
#@92 Return the value associated to KEY in radix TREE.
If not found, return nil.

(fn TREE KEY)
(defalias 'radix-tree-lookup #[514 "\300\301#\211:\203\211\242\211\302=\203
\243\207
\207\211\247\203\303\207\207" [radix-tree--lookup 0 t nil] 6 (#$ . 2668)])
#@75 Return the subtree of TREE rooted at the prefix STRING.

(fn TREE STRING)
(defalias 'radix-tree-subtree #[514 "\300\301#\207" [radix-tree--subtree 0] 6 (#$ . 2933)])
#@83 Return an alist of all bindings in TREE for prefixes of STRING.

(fn TREE STRING)
(defalias 'radix-tree-prefixes #[514 "\300\301\302$\207" [radix-tree--prefixes 0 nil] 7 (#$ . 3107)])
#@115 Pattern which matches a radix-tree leaf.
The pattern VPAT is matched against the leaf's carried value.

(fn VPAT)
(defalias 'radix-tree-leaf--pcase-macroexpander #[257 "\300\301\302\303CBBCB\304\305EE\207" [or \` t \, and (pred (not consp))] 6 (#$ . 3300)])
(byte-code "\300\301\302\303#\300\304\305\301#\303\207" [define-symbol-prop radix-tree-leaf--pcase-macroexpander edebug-form-spec nil radix-tree-leaf pcase-macroexpander] 5)
#@226 Apply FUN to every immediate subtree of radix TREE.
FUN is called with two arguments: PREFIX and SUBTREE.
You can test if SUBTREE is a leaf (and extract its value) with the
pcase pattern (radix-tree-leaf PAT).

(fn TREE FUN)
(defalias 'radix-tree-iter-subtrees #[514 "
C\211\242\205=\300
\242:\2034
\242\242\211:\203+\211\242
\243\242\243\"\210
\240\266\202
\"\266\202\211\"\266\202\207" [#[514 "\211\300\242\"\210
\301\240\207" ["" nil] 5 "\n\n(fn TREE FUN)"]] 11 (#$ . 3741)])
#@148 Apply FUN to every mapping in TREE.
FUN is called with two arguments: KEY and VAL.
PREFIX is only used internally.

(fn TREE FUN &optional PREFIX)
(defalias 'radix-tree-iter-mappings #[770 "\300\301\302#\"\207" [radix-tree-iter-subtrees make-closure #[514 "\301P
:\203
\242\211\302=\203\243\300\"\207\303\300#\207\300
\"\207" [V0 V1 t radix-tree-iter-mappings] 8 "\n\n(fn P S)"]] 9 (#$ . 4250)])
#@13 

(fn TREE)
(defalias 'radix-tree-count #[257 "\300C\301\302\303\"\"\210\211\242\207" [0 radix-tree-iter-mappings make-closure #[514 "\300\211\242T\240\207" [V0] 4 "\n\n(fn K V)"]] 7 (#$ . 4666)])
#@12 

(fn MAP)
(defalias 'radix-tree-from-map #[257 "\300\301!\210\302C\303\304\305\"\"\210\211\242\207" [require map nil map-apply make-closure #[514 "\300\301\300\242#\240\207" [V0 radix-tree-insert] 7 "\n\n(fn K V)"]] 6 (#$ . 4871)])
(provide 'radix-tree)