;ELC ;;; Compiled ;;; in Emacs version 29.4 ;;; with all optimizations. (require 'seq)#@654 Build a `pcase' pattern matching map elements. ARGS is a list of elements to be matched in the map. Each element of ARGS can be of the form (KEY PAT), in which case KEY is evaluated and searched for in the map. The match fails if for any KEY found in the map, the corresponding PAT doesn't match the value associated with the KEY. Each element can also be a SYMBOL, which is an abbreviation of a (KEY PAT) tuple of the form (\='SYMBOL SYMBOL). When SYMBOL is a keyword, it is an abbreviation of the form (:SYMBOL SYMBOL), useful for binding plist values. Keys in ARGS not found in the map are ignored, and the match doesn't fail. (fn &rest ARGS) (defalias 'map--pcase-macroexpander #[128 "\300\301\302!BB\207" [and (pred mapp) map--make-pcase-bindings] 5 (#$ . 99)]) (byte-code "\300\301\302\303#\300\304\305\301#\303\207" [define-symbol-prop map--pcase-macroexpander edebug-form-spec nil map pcase-macroexpander] 5)#@340 Bind the variables in KEYS to the elements of MAP then evaluate BODY. KEYS can be a list of symbols, in which case each element will be bound to the looked up value in MAP. KEYS can also be a list of (KEY VARNAME) pairs, in which case KEY is an unquoted form. MAP can be an alist, plist, hash-table, or array. (fn KEYS MAP &rest BODY) (defalias 'map-let '(macro . #[642 "\300\301!DCBB\207" [pcase-let map--make-pcase-patterns] 6 (#$ . 1030)])) (byte-code "\300\301\302\303#\304\301\305\306#\210\307\310\311\"\207" [function-put map-let lisp-indent-function 2 put edebug-form-spec ((&rest &or symbolp ([form symbolp])) form body) define-error map-not-inplace "Cannot modify map in-place"] 5)#@73 Return non-nil if LIST is the start of a nonempty plist map. (fn LIST) (defalias 'map--plist-p #[257 "\211:\205 \211@:?\207" [] 2 (#$ . 1733)]) (byte-code "\300\301\302\303#\304\301\305\306#\207" [function-put map--plist-p speed -1 put byte-optimizer byte-compile-inline-expand] 5)#@139 Non-nil means `plist-get' & co. accept a predicate in Emacs 29+. Note that support for this predicate in map.el is patchy and deprecated. (defconst map--plist-has-predicate (byte-code "\3001 \301\302\211\303#\210\3040\207\210\302\207" [(wrong-number-of-arguments) plist-get nil eq t] 4) (#$ . 2023))#@151 Compatibility shim for the PREDICATE argument of `plist-member'. Assumes non-nil PLIST satisfies `map--plist-p'. (fn PLIST PROP &optional PREDICATE) (defalias 'map--plist-member-1 #[770 "\211\300>\204\n\204\301\"\207\302@\"\211\262\204.A\211\262:\203.A\211\262:\204\203>\211\204>\303\304\305D\"\210\207" [(nil eq) plist-member nil signal wrong-type-argument plistp] 9 (#$ . 2330)]) (byte-code "\301\302\203\n\303\202 \304\305#\207" [map--plist-has-predicate defalias map--plist-member plist-member map--plist-member-1 "Compatibility shim for `plist-member' in Emacs 29+.\n\n(fn PLIST PROP &optional PREDICATE)"] 4)#@152 Compatibility shim for the PREDICATE argument of `plist-put'. Assumes non-nil PLIST satisfies `map--plist-p'. (fn PLIST PROP VAL &optional PREDICATE) (defalias 'map--plist-put-1 #[1027 "\211\300>\204\n\204\301#\207\302\211A:\2032@\"\211\262\2042\262AA\211\262:\204\211\203>A\240\210\202i\203M\303\304\305 D\"\210\202i\203aAAABB\241\210\202iBB\262\207" [(nil eq) plist-put nil signal wrong-type-argument plistp] 11 (#$ . 2980)]) (byte-code "\301\302\203\n\303\202 \304\305#\210\301\306\307\306\310\311#\312#\210\313\306\314\315#\210\316\306\317\320#\321\306\311\322\311\323%\210\321\306\311\324\311\325%\210\321\306\311\326\311\327%\207" [map--plist-has-predicate defalias map--plist-put plist-put map--plist-put-1 "Compatibility shim for `plist-put' in Emacs 29+.\n\n(fn PLIST PROP VAL &optional PREDICATE)" map-elt cl-generic-define (map key &optional default testfn) nil "Look up KEY in MAP and return its associated value.\nIf KEY is not found, return DEFAULT which defaults to nil.\n\nTESTFN is the function to use for comparing keys. It is\ndeprecated because its default and valid values depend on the MAP\nargument, and it was never consistently supported by the map.el\nAPI. Generally, alist keys are compared with `equal', plist keys\nwith `eq', and hash-table keys with the hash-table's test\nfunction.\n\nIn the base definition, MAP can be an alist, plist, hash-table,\nor array.\n\n(fn MAP KEY &optional DEFAULT TESTFN)" set-advertised-calling-convention (map key &optional default) "27.1" function-put gv-expander #[1283 "\300\301D\302\303 %\"\207" [gv-get gv-delay-error make-closure #[514 "\304\302!\203\n\302\202 \305\306!\304\301!\203\301\202\305\307!\304\300!\203$\300\202'\305\310!\303\311\2053CBBBB\312\313  %\"\300=\203N\211\266\202\202W\314\300DC\"\266\202\301=\203c\211\266\202\202l\314\301DC\"\266\202\302=\203s\207\314\302DC\"\207" [V0 V1 V2 V3 macroexp-const-p make-symbol "key" "default" "testfn" map-elt make-closure #[257 "\304!\203\n\211\202 \305\306!\307\310\311\312\303\301\300\257D\313\302\314\303\301F!EF=\203,\207\315DC\"\207" [V0 V1 V2 V3 macroexp-const-p make-symbol "v" condition-case nil with-no-warnings map-put! map-not-inplace map-insert macroexp-let*] 11 "\n\n(fn V)"] macroexp-let*] 13 "\n\n(fn MGETTER MSETTER)"]] 13 "\n\n(fn DO MAP KEY &optional DEFAULT TESTFN)"] cl-generic-define-method ((map list) key &optional default testfn) #[1026 "\211:\205\n\211@:?\262\203\300#\211\203\211A@\207\207\301\302\206(\303%\207" [map--plist-member alist-get nil equal] 10 "\n\n(fn MAP KEY &optional DEFAULT TESTFN)"] ((map hash-table) key &optional default _testfn) #[1026 "\300#\207" [gethash] 8 "\n\n(fn MAP KEY &optional DEFAULT TESTFN)"] ((map array) key &optional default _testfn) #[1026 "\300\"\203 H\207\207" [map-contains-key] 7 "\n\n(fn MAP KEY &optional DEFAULT TESTFN)"]] 7)#@297 Associate KEY with VALUE in MAP and return VALUE. If KEY is already present in MAP, replace the associated value with VALUE. When MAP is an alist, test equality with TESTFN if non-nil, otherwise use `equal'. MAP can be an alist, plist, hash-table, or array. (fn MAP KEY VALUE &optional TESTFN) (defalias 'map-put '(macro . #[1027 "\211\203\300\301\302\303\257ED\207\301\302EE\207" [with-no-warnings setf map-elt nil] 11 (#$ . 5938)])) (make-obsolete 'map-put "use `map-put!' or `(setf (map-elt ...) ...)' instead." "27.1")#@16 (fn MAP KEY) (defalias 'map--plist-delete #[514 "\300:\203?@=\204\262\211AA\262\202\211\203*AA\262\211A\241\210\202=\2044\301\302!\210AA\262\262\202\207" [nil cl--assertion-failed (eq tail map)] 6 (#$ . 6481)]) (byte-code "\300\301\302\301\303\304#\305#\210\306\301\304\307\304\310%\210\306\301\304\311\304\312%\210\306\301\304\313\304\314%\207" [defalias map-delete cl-generic-define (map key) nil "Delete KEY in-place from MAP and return MAP.\nKeys not present in MAP are ignored.\n\nNote that if MAP is a list (either alist or plist), and you're\ndeleting the final element in the list, the list isn't actually\ndestructively modified (but the return value will reflect the\ndeletion). So if you're using this method on a list, you have to\nsay\n\n (setq map (map-delete map key))\n\nfor this to work reliably.\n\n(fn MAP KEY)" cl-generic-define-method ((map list) key) #[514 "\211:\205\n\211@:?\262\203\300\"\207\301\302#\211\203#\303\"\262\210\207" [map--plist-delete assoc equal delq] 6 "\n\n(fn MAP KEY)"] ((map hash-table) key) #[514 "\300\"\210\207" [remhash] 5 "\n\n(fn MAP KEY)"] ((map array) key) #[514 "\300\"\203\f\301I\210\207" [map-contains-key nil] 5 "Store nil at index KEY.\n\n(fn MAP KEY)"]] 6)#@186 Traverse MAP using KEYS and return the looked up value or DEFAULT if nil. MAP can be a nested map composed of alists, plists, hash-tables, and arrays. (fn MAP KEYS &optional DEFAULT) (defalias 'map-nested-elt #[770 "\300\301#\206 \211\207" [seq-reduce #[514 "\300!\205\n\301\"\207" [mapp map-elt] 5 "\n\n(fn ACC KEY)"]] 7 (#$ . 7757)]) (byte-code "\300\301\302\301\303\304#\305#\210\306\301\304\303\304\307%\210\300\310\302\310\311\304#\312#\210\306\310\304\311\304\313%\210\306\310\304\314\304\315%\210\300\316\302\316\317\304#\320#\210\306\316\304\317\304\321%\210\300\322\302\322\323\304#\324#\210\306\322\304\323\304\325%\210\306\322\304\326\304\327%\210\306\322\304\330\304\331%\210\306\322\304\332\304\333%\210\300\334\302\334\335\304#\336#\210\306\334\304\337\304\340%\210\306\334\304\341\304\342%\210\306\334\304\343\304\344%\210\300\345\302\345\346\304#\347#\210\306\345\304\346\304\350%\210\300\351\302\351\352\304#\353#\210\306\351\304\354\304\355%\210\300\356\302\356\357\304#\360#\210\306\356\304\357\304\361%\210\300\362\302\362\363\304#\364#\210\306\362\304\363\304\365%\210\306\362\304\366\304\367%\210\300\370\302\370\371\304#\372#\210\306\370\304\371\304\373%\210\300\374\302\374\375\304#\376#\210\306\374\304\375\304\377%\210\300\201@\302\201@\201A\304#\201B#\210\306\201@\304\201A\304\201C%\210\300\201D\302\201D\201E\304#\201F#\210\306\201D\304\201E\304\201G%\210\306\201D\304\201H\304\201I%\210\300\201J\302\201J\201K\304#\201L#\207" [defalias map-keys cl-generic-define (map) nil "Return the list of keys in MAP.\nThe default implementation delegates to `map-apply'.\n\n(fn MAP)" cl-generic-define-method #[257 "\300\301\"\207" [map-apply #[514 "\207" #1=[] 3 "\n\n(fn KEY _)"]] 4 "\n\n(fn MAP)"] map-values (map) "Return the list of values in MAP.\nThe default implementation delegates to `map-apply'.\n\n(fn MAP)" #[257 "\300\301\"\207" [map-apply #[514 "\207" #1# 3 "\n\n(fn _ VALUE)"]] 4 "\n\n(fn MAP)"] ((map array)) #[257 "\300\301\"\207" [append nil] 4 "Convert MAP into a list.\n\n(fn MAP)"] map-pairs (map) "Return the key/value pairs in MAP as an alist.\nThe default implementation delegates to `map-apply'.\n\n(fn MAP)" #[257 "\300\301\"\207" [map-apply cons] 4 "\n\n(fn MAP)"] map-length (map) "Return the number of key/value pairs in MAP.\nNote that this does not always reflect the number of unique keys.\nThe default implementation delegates to `map-do'.\n\n(fn MAP)" #[257 "\300C\301\302\303\"\"\210\211\242\207" [0 map-do make-closure #[514 "\300\211\242T\240\207" [V0] 4 "\n\n(fn K V)"]] 6 "\n\n(fn MAP)"] ((map hash-table)) #[257 "\300!\207" [hash-table-count] 3 "\n\n(fn MAP)"] ((map list)) #[257 "\211\211:\205\n\211@:?\262\203\211G\300\245\207\211G\207" [2] 3 "\n\n(fn MAP)"] ((map array)) #[257 "\211G\207" #1# 2 "\n\n(fn MAP)"] map-copy (map) "Return a copy of MAP.\n\n(fn MAP)" ((map list)) #[257 "\211\211:\205\n\211@:?\262\203\300!\207\301!\207" [copy-sequence copy-alist] 3 "Use `copy-alist' on alists and `copy-sequence' on plists.\n\n(fn MAP)"] ((map hash-table)) #[257 "\300!\207" [copy-hash-table] 3 "\n\n(fn MAP)"] ((map array)) #[257 "\300!\207" [copy-sequence] 3 "\n\n(fn MAP)"] map-apply #'map "Apply FUNCTION to each element of MAP and return the result as a list.\nFUNCTION is called with two arguments, the key and the value.\nThe default implementation delegates to `map-do'.\n\n(fn FUNCTION MAP)" #[514 "\300C\301\302\303#\"\210\211\242\237\207" [nil map-do make-closure #[514 "\300\301\"\300\242B\240\207" [V0 V1] 6 "\n\n(fn K V)"]] 8 "\n\n(fn FUNCTION MAP)"] map-do #'map "Apply FUNCTION to each element of MAP and return nil.\nFUNCTION is called with two arguments, the key and the value.\n\n(fn FUNCTION MAP)" #'(map hash-table) #[514 "\300\"\207" [maphash] 5 "\n\n(fn FUNCTION MAP)"] map-keys-apply #'map "Return the result of applying FUNCTION to each key in MAP.\nThe default implementation delegates to `map-apply'.\n\n(fn FUNCTION MAP)" #[514 "\300\301\302\"\"\207" [map-apply make-closure #[514 "\300!\207" [V0] 4 "\n\n(fn KEY _)"]] 6 "\n\n(fn FUNCTION MAP)"] map-values-apply #'map "Return the result of applying FUNCTION to each value in MAP.\nThe default implementation delegates to `map-apply'.\n\n(fn FUNCTION MAP)" #[514 "\300\301\302\"\"\207" [map-apply make-closure #[514 "\300!\207" [V0] 4 "\n\n(fn _ VAL)"]] 6 "\n\n(fn FUNCTION MAP)"] #'(map array) #[514 "\300\"\207" [mapcar] 5 "\n\n(fn FUNCTION MAP)"] map-filter (pred map) "Return an alist of key/val pairs for which (PRED key val) is non-nil in MAP.\nThe default implementation delegates to `map-apply'.\n\n(fn PRED MAP)" #[514 "\300\301\302\303\304\"\"\"\207" [delq nil map-apply make-closure #[514 "\300\"\205\nB\207" [V0] 5 "\n\n(fn KEY VAL)"]] 8 "\n\n(fn PRED MAP)"] map-remove (pred map) "Return an alist of the key/val pairs for which (PRED key val) is nil in MAP.\nThe default implementation delegates to `map-filter'.\n\n(fn PRED MAP)" #[514 "\300\301\302\"\"\207" [map-filter make-closure #[514 "\300\"?\207" [V0] 5 "\n\n(fn KEY VAL)"]] 6 "\n\n(fn PRED MAP)"] mapp (map) "Return non-nil if MAP is a map (alist/plist, hash-table, array, ...).\n\n(fn MAP)" #[257 "\211<\206\300!\206\301!\207" [hash-table-p arrayp] 3 "\n\n(fn MAP)"] map-empty-p (map) "Return non-nil if MAP is empty.\nThe default implementation delegates to `map-length'.\n\n(fn MAP)" #[257 "\300!\301U\207" [map-length 0] 3 "\n\n(fn MAP)"] ((map list)) #[257 "\211?\207" #1# 2 "\n\n(fn MAP)"] map-contains-key (map key &optional testfn) "Return non-nil if and only if MAP contains KEY.\nTESTFN is deprecated. Its default depends on MAP.\nThe default implementation delegates to `map-some'.\n\n(fn MAP KEY &optional TESTFN)"] 6) (byte-code "\300\301\302\303\302\304%\210\305\301\306\307#\210\300\301\302\310\302\311%\210\300\301\302\312\302\313%\210\300\301\302\314\302\315%\210\316\317\320\317\321\302#\322#\210\300\317\302\321\302\323%\210\316\324\320\324\325\302#\326#\210\300\324\302\325\302\327%\207" [cl-generic-define-method map-contains-key nil (map key &optional testfn) #[770 "\211C\211\242\204 \211\300\240\210\301\302\303#\"\207" [equal map-some make-closure #[514 "\300\242\301\"\207" [V0 V1] 5 "\n\n(fn K V)"]] 9 "\n\n(fn MAP KEY &optional TESTFN)"] set-advertised-calling-convention (map key) "27.1" ((map list) key &optional testfn) #[770 "\211:\205\n\211@:?\262\203\300#\207\301\211\302\303\206#\304%=?\207" [map--plist-member (nil) alist-get nil equal] 11 "Return non-nil if MAP contains KEY.\nIf MAP is an alist, TESTFN defaults to `equal'.\nIf MAP is a plist, TESTFN defaults to `eq'.\n\n(fn MAP KEY &optional TESTFN)"] ((map array) key &optional _testfn) #[770 "\300!\205\nGW\207" [natnump] 5 "Return non-nil if KEY is an index of MAP, ignoring TESTFN.\n\n(fn MAP KEY &optional TESTFN)"] ((map hash-table) key &optional _testfn) #[770 "\300\211\301#=?\207" [(nil) gethash] 9 "Return non-nil if MAP contains KEY, ignoring TESTFN.\n\n(fn MAP KEY &optional TESTFN)"] defalias map-some cl-generic-define (pred map) "Return the first non-nil (PRED key val) in MAP.\nReturn nil if no such element is found.\nThe default implementation delegates to `map-do'.\n\n(fn PRED MAP)" #[514 "\3002\301\302\303\"\"\210\3040\207" [map--break map-do make-closure #[514 "\300\"\211\205\f\301\302\"\207" [V0 throw map--break] 6 "\n\n(fn KEY VALUE)"] nil] 6 "\n\n(fn PRED MAP)"] map-every-p (pred map) "Return non-nil if (PRED key val) is non-nil for all elements of MAP.\nThe default implementation delegates to `map-do'.\n\n(fn PRED MAP)" #[514 "\3002\301\302\303\"\"\210\3040\207" [map--break map-do make-closure #[514 "\300\"\206 \301\302\303\"\207" [V0 throw map--break nil] 5 "\n\n(fn KEY VALUE)"] t] 6 "\n\n(fn PRED MAP)"]] 6)#@247 Merge into a map of TYPE all the key/value pairs in MAPS. MERGE is a function that takes the target MAP, a KEY, and a VALUE, merges KEY and VALUE into MAP, and returns the result. MAP may be of a type other than TYPE. (fn MERGE TYPE &rest MAPS) (defalias 'map--merge #[642 "\300>\301\211A\262\242\302=\203\303\202\203\304\202\"C\211\2037\211@\305\306\307\n#\"\210A\266\202\202 \210\203B\301\242\"\207\211\242\207" [(list alist plist) map-into plist (hash-table :test eq) (hash-table :test equal) map-do make-closure #[514 "\300\301\300\242#\240\207" [V0 V1] 7 "\n\n(fn KEY VALUE)"]] 12 (#$ . 15539)])#@130 Merge into a map of TYPE all the key/value pairs in MAPS. See `map-into' for all supported values of TYPE. (fn TYPE &rest MAPS) (defalias 'map-merge #[385 "\300\301\302$\207" [apply map--merge #[771 "\3001\301\302$0\210\202\210\303#\262\207" [(map-not-inplace) map-put! nil map-insert] 8 "\n\n(fn RESULT KEY VALUE)"]] 7 (#$ . 16174)])#@300 Merge into a map of TYPE all the key/value pairs in MAPS. When two maps contain the same key, call FUNCTION on the two values and use the value returned by it. Each of MAPS can be an alist, plist, hash-table, or array. See `map-into' for all supported values of TYPE. (fn TYPE FUNCTION &rest MAPS) (defalias 'map-merge-with #[642 "\300C\301\302\303\304#$\207" [nil apply map--merge make-closure #[771 "\302\300#\303\300\"\203\202\301\"\262\3041&\305\306$0\266\202/\210\307#\262\210\207" [V0 V1 map-elt eql (map-not-inplace) map-put! nil map-insert] 9 "\n\n(fn RESULT KEY VALUE)"]] 10 (#$ . 16530)]) (byte-code "\300\301\302\301\303\304#\305#\210\306\301\304\307\304\310%\210\306\301\304\311\304\312%\210\306\301\304\313\304\314%\210\300\315\302\315\316\304#\317#\210\320\315\321\322#\210\306\315\304\323\304\324%\210\306\315\304\325\304\326%\210\306\315\304\327\304\330%\210\300\331\315\304#\210\332\331\315\322#\210\300\333\302\333\334\304#\335#\210\306\333\304\334\304\336%\210\306\333\304\337\304\340%\210\306\341\304\342\343\344%\210\306\341\304\345\304\346%\210\306\341\304\347\304\350%\210\306\351\304\352\304\353%\210\306\351\304\354\304\355%\207" [defalias map-into cl-generic-define (map type) nil "Convert MAP into a map of TYPE.\n\n(fn MAP TYPE)" cl-generic-define-method (map (_type (eql list))) #[514 "\300!\207" [map-pairs] 4 "Convert MAP into an alist.\n\n(fn MAP TYPE)"] (map (_type (eql alist))) #[514 "\300!\207" [map-pairs] 4 "Convert MAP into an alist.\n\n(fn MAP TYPE)"] (map (_type (eql plist))) #[514 "\300C\301\302\303\"\"\210\211\242\237\207" [nil map-do make-closure #[514 "\300\300\242BB\240\207" [V0] 6 "\n\n(fn K V)"]] 7 "Convert MAP into a plist.\n\n(fn MAP TYPE)"] map-put! (map key value &optional testfn) "Associate KEY with VALUE in MAP.\nIf KEY is already present in MAP, replace the associated value\nwith VALUE.\nThis operates by modifying MAP in place.\nIf it cannot do that, it signals a `map-not-inplace' error.\nTo insert an element without modifying MAP, use `map-insert'.\n\n(fn MAP KEY VALUE &optional TESTFN)" set-advertised-calling-convention (map key value) "27.1" ((map list) key value &optional testfn) #[1027 "\211:\205\n\211@:?\262\203\300$\210\202Y\206\301\302=\2041\303\206-\301#\2024\236\211\203@\211\241\266\202LB\211\262B\262\210\211=\204X\304\305C\"\210\210\207" [map--plist-put equal eq assoc signal map-not-inplace] 9 "\n\n(fn MAP KEY VALUE &optional TESTFN)"] ((map hash-table) key value &optional _testfn) #[1027 "\300#\207" [puthash] 8 "\n\n(fn MAP KEY VALUE &optional TESTFN)"] ((map array) key value &optional _testfn) #[1027 "I\207" #1=[] 7 "\n\n(fn MAP KEY VALUE &optional TESTFN)"] map--put make-obsolete map-insert (map key value) "Return a new map like MAP except that it associates KEY with VALUE.\nThis does not modify MAP.\nIf you want to insert an element in place, use `map-put!'.\nThe default implementation defaults to `map-copy' and `map-put!'.\n\n(fn MAP KEY VALUE)" #[771 "\300!\301#\210\207" [map-copy map-put!] 8 "\n\n(fn MAP KEY VALUE)"] ((map list) key value) #[771 "\211:\205\n\211@:?\262\203BB\207BB\207" #1# 6 "Cons KEY and VALUE to the front of MAP.\n\n(fn MAP KEY VALUE)"] map-apply #'(map list) curried #[257 "\300!\210\301\302\303\"\207" [cl--generic-isnot-nnm-p nil make-closure #[128 "\301\302\300#\303\304#\207" [V0 make-closure #[128 "\302\301\206\300\"\207" [V0 V1 apply] 4 "\n\n(fn &rest ARGS)"] apply #[771 "\211\211:\205\n\211@:?\262\203 \207\300\301\302\"\"\207" [mapcar make-closure #[257 "\300@A\"\207" [V0] 4 "\n\n(fn PAIR)"]] 7 "\n\n(fn CL--CNM FUNCTION MAP)"]] 6 "\n\n(fn FUNCTION MAP)"]] 5 "\n\n(fn CL--NM)"] #'(map hash-table) #[514 "\300C\301\302\303#\"\210\211\242\237\207" [nil maphash make-closure #[514 "\300\301\"\300\242B\240\207" [V0 V1] 6 "\n\n(fn KEY VALUE)"]] 8 "\n\n(fn FUNCTION MAP)"] #'(map array) #[514 "\300\301\302\"\"\207" [seq-map-indexed make-closure #[514 "\300\"\207" [V0] 5 "\n\n(fn ELT INDEX)"]] 6 "\n\n(fn FUNCTION MAP)"] map-do #'(map list) #[514 "\211\211:\205\n\211@:?\262\203%\211\205.\211A\262\242\211A\262\242\"\210\202\300\301\302\"\"\210\303\207" [mapc make-closure #[257 "\300@A\"\207" [V0] 4 "\n\n(fn PAIR)"] nil] 6 "\n\n(fn FUNCTION MAP)"] #'(map array) #[514 "\300\301\302\"\"\207" [seq-do-indexed make-closure #[514 "\300\"\207" [V0] 5 "\n\n(fn ELT INDEX)"]] 6 "\n\n(fn FUNCTION MAP)"]] 6)#@104 Convert MAP into a hash-table. KEYWORD-ARGS are forwarded to `make-hash-table'. (fn MAP KEYWORD-ARGS) (defalias 'map--into-hash #[514 "\300\301\"\302\303\304\"\"\210\207" [apply make-hash-table map-do make-closure #[514 "\301\300#\207" [V0 puthash] 6 "\n\n(fn KEY VALUE)"]] 7 (#$ . 21010)]) (byte-code "\300\301\302\303\302\304%\210\300\301\302\305\302\306%\207" [cl-generic-define-method map-into nil (map (_type (eql hash-table))) #[514 "\300\301\302!\303\304F\"\207" [map--into-hash :size map-length :test equal] 8 "Convert MAP into a hash-table with keys compared with `equal'.\n\n(fn MAP TYPE)"] (map (type (head hash-table))) #[514 "\300A\"\207" [map--into-hash] 5 "Convert MAP into a hash-table.\nTYPE is a list whose car is `hash-table' and cdr a list of\nkeyword-args forwarded to `make-hash-table'.\n\nExample:\n (map-into \\='((1 . 3)) \\='(hash-table :test eql))\n\n(fn MAP TYPE)"]] 6)#@80 Return a list of pcase bindings from ARGS to the elements of a map. (fn ARGS) (defalias 'map--make-pcase-bindings #[257 "\300\301\"\207" [mapcar #[257 "\211:\203\300\301\302@EA@E\207\303!\203&\304\305!\306\307O!\300\301\302EE\207\300\301\302\310DEE\207" [app pcase--flip map-elt keywordp intern symbol-name 1 nil quote] 6 "\n\n(fn ELT)"]] 4 (#$ . 21926)])#@73 Return a list of `(map ...)' pcase patterns built from ARGS. (fn ARGS) (defalias 'map--make-pcase-patterns #[257 "\300\301\302\"B\207" [map mapcar #[257 "\211\242\300=\203 \301!\207\207" [map map--make-pcase-patterns] 3 "\n\n(fn ELT)"]] 5 (#$ . 22300)]) (provide 'map)