Gecko [ fernandoquevedodop.com ]

Name	Size	Permission
advice.elc	54 KB	-rw-r--r--
autoload.elc	28.25 KB	-rw-r--r--
avl-tree.elc	27.45 KB	-rw-r--r--
backquote.elc	4.68 KB	-rw-r--r--
backtrace.elc	40.98 KB	-rw-r--r--
benchmark.elc	3.74 KB	-rw-r--r--
bindat.elc	10.73 KB	-rw-r--r--
byte-opt.elc	39.59 KB	-rw-r--r--
byte-run.elc	17.44 KB	-rw-r--r--
bytecomp.elc	154.17 KB	-rw-r--r--
cconv.elc	20.71 KB	-rw-r--r--
chart.elc	25.98 KB	-rw-r--r--
check-declare.elc	9.01 KB	-rw-r--r--
checkdoc.elc	74.78 KB	-rw-r--r--
cl-extra.elc	29.37 KB	-rw-r--r--
cl-generic.elc	59.25 KB	-rw-r--r--
cl-indent.elc	18.03 KB	-rw-r--r--
cl-lib.elc	31.72 KB	-rw-r--r--
cl-loaddefs.el	45.79 KB	-rw-r--r--
cl-macs.elc	90.7 KB	-rw-r--r--
cl-preloaded.elc	27.28 KB	-rw-r--r--
cl-print.elc	14.77 KB	-rw-r--r--
cl-seq.elc	38.35 KB	-rw-r--r--
copyright.elc	10.17 KB	-rw-r--r--
crm.elc	7.62 KB	-rw-r--r--
cursor-sensor.elc	6.74 KB	-rw-r--r--
debug.elc	36.42 KB	-rw-r--r--
derived.elc	11.88 KB	-rw-r--r--
disass.elc	6.11 KB	-rw-r--r--
easy-mmode.elc	19.78 KB	-rw-r--r--
easymenu.elc	19.88 KB	-rw-r--r--
edebug.elc	123.13 KB	-rw-r--r--
eieio-base.elc	17.17 KB	-rw-r--r--
eieio-compat.elc	8.41 KB	-rw-r--r--
eieio-core.elc	36.91 KB	-rw-r--r--
eieio-custom.elc	15.8 KB	-rw-r--r--
eieio-datadebug.elc	3.17 KB	-rw-r--r--
eieio-loaddefs.el	3.96 KB	-rw-r--r--
eieio-opt.elc	9.32 KB	-rw-r--r--
eieio-speedbar.elc	13.13 KB	-rw-r--r--
eieio.elc	33.03 KB	-rw-r--r--
eldoc.elc	19.14 KB	-rw-r--r--
elint.elc	30.6 KB	-rw-r--r--
elp.elc	12.68 KB	-rw-r--r--
ert-x.elc	11.48 KB	-rw-r--r--
ert.elc	177.96 KB	-rw-r--r--
ewoc.elc	25.26 KB	-rw-r--r--
faceup.elc	16.97 KB	-rw-r--r--
find-func.elc	21.61 KB	-rw-r--r--
float-sup.elc	1.21 KB	-rw-r--r--
generator.elc	27.42 KB	-rw-r--r--
generic.elc	7.18 KB	-rw-r--r--
gv.elc	22.69 KB	-rw-r--r--
helper.elc	3.96 KB	-rw-r--r--
inline.elc	8.37 KB	-rw-r--r--
let-alist.elc	3.04 KB	-rw-r--r--
lisp-mnt.elc	22.59 KB	-rw-r--r--
lisp-mode.elc	38.03 KB	-rw-r--r--
lisp.elc	21.44 KB	-rw-r--r--
macroexp.elc	18.01 KB	-rw-r--r--
map-ynp.elc	10.54 KB	-rw-r--r--
map.elc	18.25 KB	-rw-r--r--
nadvice.elc	17.65 KB	-rw-r--r--
package-x.elc	9.06 KB	-rw-r--r--
package.elc	146.54 KB	-rw-r--r--
pcase.elc	23.11 KB	-rw-r--r--
pp.elc	5.5 KB	-rw-r--r--
radix-tree.elc	5.88 KB	-rw-r--r--
re-builder.elc	25.78 KB	-rw-r--r--
regexp-opt.elc	6.3 KB	-rw-r--r--
regi.elc	6 KB	-rw-r--r--
ring.elc	6.32 KB	-rw-r--r--
rmc.elc	4.79 KB	-rw-r--r--
rx.elc	40.69 KB	-rw-r--r--
seq.elc	23.64 KB	-rw-r--r--
shadow.elc	9.34 KB	-rw-r--r--
smie.elc	48.84 KB	-rw-r--r--
subr-x.elc	11.17 KB	-rw-r--r--
syntax.elc	26.13 KB	-rw-r--r--
tabulated-list.elc	26.57 KB	-rw-r--r--
tcover-ses.elc	14.29 KB	-rw-r--r--
tcover-unsafep.elc	3.87 KB	-rw-r--r--
testcover.elc	23.03 KB	-rw-r--r--
text-property-search.elc	8.13 KB	-rw-r--r--
thunk.elc	3.06 KB	-rw-r--r--
timer-list.elc	4.3 KB	-rw-r--r--
timer.elc	21.65 KB	-rw-r--r--
tq.elc	3.99 KB	-rw-r--r--
trace.elc	7.27 KB	-rw-r--r--
unsafep.elc	4.45 KB	-rw-r--r--
warnings.elc	9.75 KB	-rw-r--r--

Code Editor : radix-tree.elc

;ELC���
;;; Compiled
;;; in Emacs version 27.1
;;; with all optimizations.

;;; This file uses dynamic docstrings, first added in Emacs 19.29.

;;; This file does not contain utf-8 non-ASCII characters,
;;; and so can be loaded in Emacs versions earlier than 23.

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

#@23

(fn TREE KEY VAL I)
(defalias 'radix-tree--insert #[1028 "\300:\203\300�@\211:\203\244�\211@AA\211G\\\301\302\211&\211\303=\203A�\304$BB\262\202\233�\211\305W\203M�\306Z\202O�\211S\211\305U\203j�\304$BB\262\202\231�\307\305#\307\\\"\307\"\310\232\203\207�\202\214�BC\nBBB\nB\266\204\262\266\202\266\203\266\203\202\273�GU\203\257�\202\273�\307\"\211BB\262\262\202\306�\211$\207" [#[1028 "GU\203	�\207\300\"\211BB\207" [substring] 7 "\n\n(fn TREE KEY VAL I)"] compare-strings nil t radix-tree--insert 0 -1 substring ""] 22 (#$ . 408)])
#@19

(fn TREE KEY I)
(defalias 'radix-tree--remove #[771 "\300:\203\313�@\211:\203\275�\211@AA\211G\\\301\302\211&\211\303=\203\211�\304
#\305\204>�\202\204�:\203}�@\211:\203q�\211@AA\211\204d�\nPB
B\266\202\202l�\n#\266\203\202x�#\262\202\204�\211#\266\202\202\264�\211\306W\203\225�\307Z\202\227�\211S\211\306U\203\260�\304#BB\262\202\262�
\262\266\202\266\203\266\203\202\306�GU?\205\306�\262\202\320�\211#\207" [#[771 "GU?\205	�\207" #1=[] 5 "\n\n(fn TREE KEY I)"] compare-strings nil t radix-tree--remove #[771 "BB\207" #1# 5 "\n\n(fn RTREE PREFIX NPTREE)"] 0 -1] 23 (#$ . 1037)])
#@22

(fn TREE STRING I)
(defalias 'radix-tree--lookup #[771 "\300:\203p�@\211:\203e�\211@AA\211G\\\301\302\211&\211\303=\2037�\304
#\202\\�\211\305W\203C�\306Z\202E�\211S\211\305U\203V�\304#\202Z�\\\262\266\202\266\203\266\203\202k�#\262\202v�\211#\207" [#[771 "\211\203�G\232\203�\211\250\203�\300B\207\207\207" [t] 5 "\n\n(fn STRING I VAL)"] compare-strings nil t radix-tree--lookup 0 -1] 19 (#$ . 1705)])
#@31

(fn TREE STRING I PREFIXES)
(defalias 'radix-tree--prefixes #[1028 "\300:\203\\�@\211:\203P�\211@AA\211	G\\\301\302\211&\n\303$\304=\203F�\303$\202G�\211\266\204\266\203\266\203\202W�	$\262\202c�\211$\207" [#[1028 "\211\204�\207\300\301#\242\302=\203�A\202�BB\207" [substring 0 t] 8 "\n\n(fn STRING I PREFIXES VAL)"] compare-strings nil radix-tree--prefixes t] 21 (#$ . 2165)])
#@22

(fn TREE STRING I)
(defalias 'radix-tree--subtree #[771 "G\232\203	�\207:\205\201�@\211:\205�\211@AA\211G\\\300\301\211

&\211\302=\203>�\303\f#\202y�\211\304W\203J�\305Z\202L�\211S\211\304U\203]�\303

#\202w�\211\\\fG\232\203v�\306\"\211BC\262\202w�\301\262\266\202\266\203\266\203\262\207" [compare-strings nil t radix-tree--subtree 0 -1 substring] 18 (#$ . 2606)])
#@23 The empty radix-tree.
(defconst radix-tree-empty nil (#$ . 3019))
#@68 Insert a mapping from KEY to VAL in radix TREE.

(fn TREE KEY VAL)
(defalias 'radix-tree-insert #[771 "\211:\203\n�\300B\262\211\203�\301\302$\207\303\302#\207" [t radix-tree--insert 0 radix-tree--remove] 8 (#$ . 3091)])
#@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@\211\302=\203�A\211\211\262\262\202!�\211\262\262\2023�\211\247\203/�\303\2023�\211\211\262\207" [radix-tree--lookup 0 t nil] 7 (#$ . 3326)])
#@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 (#$ . 3636)])
#@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 (#$ . 3810)])
#@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 atom)] 6 (#$ . 4003)])
(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\205F�\300\242:\203=�\242@\211:\203/�\211@A\242A\211	\"\210\240\266\2029�\301\242\"\210\302\240\210\210\202B�\211\"\210\210\202�\207" [#[514 "\211\300\242\"\210\301\240\207" [#1="" nil] 5 "\n\n(fn TREE FUN)"] #1# nil] 14 (#$ . 4437)])
#@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\303\304\305\"\306\"\307\310%\"\207" [radix-tree-iter-subtrees make-byte-code 514 "\301P:\203(�@\211\302=\203�A\211\300\"\262\262\202#�\303\300#\262\202<�:\2047�\300\"\262\202<�\303\300#\207" vconcat vector [t radix-tree-iter-mappings] 9 "\n\n(fn P S)"] 12 (#$ . 4978)])
#@13

(fn TREE)
(defalias 'radix-tree-count #[257 "\300C\301\302\303\304\305\306!\307\"\310\311%\"\210\211\242\207" [0 radix-tree-iter-mappings make-byte-code 514 "\300\211\242T\240\207" vconcat vector [] 4 "\n\n(fn K V)"] 10 (#$ . 5481)])
#@12

(fn MAP)
(defalias 'radix-tree-from-map #[257 "\300\301!\210\302C\303\304\305\306\307\310!\311\"\312\313%\"\210\211\242\207" [require map nil map-apply make-byte-code 514 "\300\301\300\242#\240\207" vconcat vector [radix-tree-insert] 7 "\n\n(fn K V)"] 9 (#$ . 5726)])
(provide 'radix-tree)

${this.title}

Code Editor : radix-tree.elc