;ELC ;;; Compiled ;;; in Emacs version 30.2 ;;; with all optimizations. (defalias 'rtree-make-node '(macro . #[0 "\300\207" [(list (list nil) nil)] 1]))#@18 (fn NODE LEFT) (defalias 'rtree-set-left '(macro . #[514 "\300\301DE\207" [setcar cdr] 5 (#$ . 164)]))#@19 (fn NODE RIGHT) (defalias 'rtree-set-right '(macro . #[514 "\300\301DE\207" [setcdr cdr] 5 (#$ . 276)]))#@19 (fn NODE RANGE) (defalias 'rtree-set-range '(macro . #[514 "\300E\207" [setcar] 5 (#$ . 390)]))#@13 (fn NODE) (defalias 'rtree-low '(macro . #[257 "\300D\207" [caar] 3 (#$ . 495)])) (defalias 'rtree-high '(macro . #[257 "\300D\207" [cdar] 3 (#$ . 495)]))#@20 (fn NODE NUMBER) (defalias 'rtree-set-low '(macro . #[514 "\300\301DE\207" [setcar car] 5 (#$ . 659)])) (defalias 'rtree-set-high '(macro . #[514 "\300\301DE\207" [setcdr car] 5 (#$ . 659)])) (defalias 'rtree-left '(macro . #[257 "\300D\207" [cadr] 3 (#$ . 495)])) (defalias 'rtree-right '(macro . #[257 "\300D\207" [cddr] 3 (#$ . 495)])) (defalias 'rtree-range '(macro . #[257 "\300D\207" [car] 3 (#$ . 495)]))#@14 (fn RANGE) (defalias 'rtree-normalize-range #[257 "\211\247\203\n\211B\262\207" [] 3 (#$ . 1085)])#@39 Make an rtree from RANGE. (fn RANGE) (byte-code "\300\301\302\303#\304\301\305\306#\210\307\310\301\311#\210\312\310\301\313#\207" [function-put rtree-normalize-range speed -1 put byte-optimizer byte-compile-inline-expand defalias rtree-normalise-range nil make-obsolete "25.1"] 5) (defalias 'rtree-make #[257 "\211\243<\204C\300\301BG\"\207" [rtree-make-1 nil] 4 (#$ . 1194)])#@21 (fn RANGE LENGTH) (defalias 'rtree-make-1 #[514 "\211\300\245\301C\301D\302V\203\211A\303\"\240\210\211A@\211\247\203#\211B\262\240\210\211AA\241\210ZS\302V\203?\211A\303ZS\"\241\210\207" [2 nil 0 rtree-make-1] 9 (#$ . 1582)])#@64 Return non-nil if NUMBER is present in TREE. (fn TREE NUMBER) (defalias 'rtree-memq #[514 "\203*\211@@Y\203\211@AX\204*\211@@W\203\"A@\202%AA\262\202\207" [] 4 (#$ . 1832)])#@39 Add NUMBER to TREE. (fn TREE NUMBER) (defalias 'rtree-add #[514 "\205\340\211@@Y\203\211@AX\203\300\262\202\211@@W\203\201\211@@SU\203Y@\240\210A@\203SA@@ASU\203S@A@@@\240\210AA@A@\240\210\300\262\202A@\203gA@\262\202\300C\300D\211@\240\210\211@\241\210A\240\210\300\262\210\202\211@ATU\203\270@\241\210AA\203\262AA@@TU\203\262@AA@A\241\210AAAAA\241\210\300\262\202AA\203\306AA\262\202\300C\300D\211@\240\210\211@\241\210A\241\210\300\262\210\202\207" [nil] 5 (#$ . 2028)])#@80 Remove NUMBER from TREE destructively. Return the new tree. (fn TREE NUMBER) (defalias 'rtree-delq #[514 "\300\2030@@W\203\210\211A@\262\202@AV\203*\210\211AA\262\202@@@AU\203\216A@\203bAA\203b\211AA\211A@\203R\211\262A@\202D@\240\210AAA\240\266\202*A@\206kAA\204t\262\202*A@=\203\205A\240\266\202*A\241\266\202*@@U\203\237@T\240\210\202*@AU\203\260@S\241\210\202*\300C\300D\211@@@\240\210\211@S\241\210@T\240\210A@\203\352AA\203\352A@\211AA\203\341AA\202\326\211A\241\266\202*A@\203$\211A\241\210\211AA@\240\210A\300\240\210\204\n\262\202*A@=\203A\240\266\202*A\241\266\202*A\240\266\300\262\202\207" [nil] 8 (#$ . 2579)])#@40 Convert TREE to range form. (fn TREE) (defalias 'rtree-extract #[257 "\300\211\204\n\203A\203B\262AA\262\202\211A\262\242\262@@@AU\2033@@\2025@B\262A@\262\202\207" [nil] 5 (#$ . 3317)])#@57 Return the number of numbers stored in TREE. (fn TREE) (defalias 'rtree-length #[257 "\211\204\300\207\301A@!@A@@ZT\\\301AA!\\\207" [0 rtree-length] 4 (#$ . 3538)]) (provide 'rtree)