HOME

Mini Shell 1.0
Current File : //usr/share/emacs/26.1/lisp/registry.elc
;ELC
;;; Compiled
;;; in Emacs version 26.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.

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


(byte-code "\300\301!\210\300\302!\210\300\303!\207" [require cl-lib eieio eieio-base] 2)
#@45 The current version of the registry format.
(defvar registry-db-version 0.2 (#$ . 498))
(byte-code "\300\301\302\303!\"\210\300\304\305\303!\"\210\300\306\304\"\210\307\306\310\311#\210\312\303\313\304#\314\303\315\316\317$\207" [defalias registry-db-p eieio-make-class-predicate registry-db registry-db--eieio-childp eieio-make-child-predicate registry-db-child-p make-obsolete "use (cl-typep ... \\='registry-db) instead" "25.1" define-symbol-prop cl-deftype-satisfies eieio-defclass-internal (eieio-persistent) ((version :initarg :version :initform nil :type (or null float) :documentation "The registry version.") (max-size :initarg :max-size :initform (symbol-value 'most-positive-fixnum) :type integer :custom integer :documentation "The maximum number of registry entries.") (prune-factor :initarg :prune-factor :initform 0.1 :type float :custom float :documentation "Prune to (:max-size * :prune-factor) less\n    than the :max-size limit.  Should be a float between 0 and 1.") (tracked :initarg :tracked :initform nil :type t :documentation "The tracked (indexed) fields, a list of symbols.") (precious :initarg :precious :initform nil :type t :documentation "The precious fields, a list of symbols.") (tracker :initarg :tracker :type hash-table :documentation "The field tracking hash table.") (data :initarg :data :type hash-table :documentation "The data hash table.")) nil] 6)
#@50 Create a new object of class type `registry-db'.
(defalias 'registry-db #[(&rest slots) "\301\302\303#\207" [slots apply make-instance registry-db] 4 (#$ . 1894)])
(byte-code "\300\301\302\303#\300\207" [function-put registry-db compiler-macro registry-db--anon-cmacro] 4)
(defalias 'registry-db--anon-cmacro #[(whole &rest slots) "@;\204	\207\302\303\304@	@#	@\305@DABB\"\207" [slots whole macroexp--warn-and-return format "Obsolete name arg %S to constructor %S" identity] 5])
(byte-code "\300\301\302\303\304\305%\210\300\301\306\307\304\310%\210\300\311\304\312\304\313%\210\300\314\304\315\304\316%\210\300\317\304\320\304\321%\210\300\322\304\323\304\324%\207" [cl-generic-define-method initialize-instance (:before) ((this registry-db) slots) nil #[(this slots) "\303\304\"\205\305\304\"\211\203\306	\307\"\205L\310\311\305\312\"#\310\304\n#\211@\312=\2034AA\2029\313\312\"\210@\314=\203HAA\315\202L\313\314\")\207" [slots current-version registry-db-version plist-member :version plist-get eql 0.1 plist-put :max-size :max-hard cl--do-remf :max-soft t] 7 "Check whether a registry object needs to be upgraded."] (:after) ((this registry-db) slots) #[(this slots) "\305\n\235\204	\306\307\310\311\312\313\314\315\316&#\210)\317\n\235?\205-	\306\f\320\310\311\321\313\322$#))\207" [this #:object slots #:v #:v :data eieio-oset data make-hash-table :size 10000 :rehash-size 2.0 :test equal :tracker tracker 100 2.0] 10 "Set value of data slot of THIS after initialization."] registry-lookup ((db registry-db) keys) #[(db keys) "\303\301\"\304\305\306\307\n\"\")\207" [db data keys eieio-oref delq nil mapcar #[(k) "\302	\"\205
\302	\"D\207" [k data gethash] 4]] 5 "Search for KEYS in the registry-db THIS.\nReturns an alist of the key followed by the entry in a list, not a cons cell."] registry-lookup-breaks-before-lexbind ((db registry-db) keys) #[(db keys) "\306\301\"\307\310\n\310\211:\203,@\311\f	\"\203%\f\311\f	\"D
BA\211\202
\237+\")\207" [db data keys #:--cl-var-- key #:--cl-var-- eieio-oref delq nil gethash] 7 "Search for KEYS in the registry-db THIS.\nReturns an alist of the key followed by the entry in a list, not a cons cell."] registry-lookup-secondary ((db registry-db) tracksym &optional create) #[(db tracksym &optional create) "\304\305	\306\"\"\211\203\n\202,\205,\307\310\311\312\313\314\315\316&\305	\306\"#\210\304\305	\306\"\")\207" [tracksym db h create gethash eieio-oref tracker puthash make-hash-table :size 800 :rehash-size 2.0 :test equal] 10 "Search for TRACKSYM in the registry-db THIS.\nWhen CREATE is not nil, create the secondary index hash table if needed."] registry-lookup-secondary-value ((db registry-db) tracksym val &optional set) #[(db tracksym val &optional set) "\204\304	\n\"\205'\203 \305\306=?\205\304	\n\306##\210\307\304	\n\"\"\207" [set db tracksym val registry-lookup-secondary puthash t gethash] 7 "Search for TRACKSYM with value VAL in the registry-db THIS.\nWhen SET is not nil, set it for VAL (use t for an empty list)."]] 6)
(defalias 'registry--match #[(mode entry check-list) "\205N@@@\243\306\203C\n\203C	\204C\f\307\267\202;\n\242\310
\"\243\235\202<\311\n@\312\313\310
\"\243\314#\"\202<\306\n\243\202	\206M\315\f
\243#+\207" [check-list found vals key mode entry nil #s(hash-table size 2 test eql rehash-size 1.5 rehash-threshold 0.8125 purecopy t data (:member 32 :regex 43)) assoc string-match mapconcat prin1-to-string "" registry--match] 7])
(byte-code "\300\301\302\303\302\304%\210\300\305\302\306\302\307%\210\300\310\302\311\302\312%\210\300\313\302\314\302\315%\210\300\316\302\317\302\320%\210\300\321\302\322\302\323%\210\300\324\302\325\302\326%\210\300\327\302\330\302\331%\210\332\333!\207" [cl-generic-define-method registry-search nil ((db registry-db) &rest spec) #[(db &rest spec) "\205 \306	\307\"\306	\310\"\306	\311\"\312\313\314\315\316\"\"\210
\237,\207" [db spec regex member all #1=#:--cl-var-- plist-get :all :member :regex nil maphash #[(k v) "\204	\203\306\307\n	#\204\205!\306\310\n#\205!\f
B\211\207" [all member v regex k #1# registry--match :member :regex] 4] eieio-oref data] 5 "Search for SPEC across the registry-db THIS.\nFor example calling with `:member \\='(a 1 2)' will match entry ((a 3 1)).\nCalling with `:all t' (any non-nil value) will match all.\nCalling with `:regex \\='(a \"h.llo\")' will match entry (a \"hullo\" \"bye\").\nThe test order is to check :all first, then :member, then :regex.\n\n(fn DB &rest SPEC)"] registry-delete ((db registry-db) keys assert &rest spec) #[(db keys assert &rest spec) "\306\301\"\n\206\307\310#\306\304\"\n\311\211\203\251@\312
	\"\f\2039\f\2049\313\314\315\311
C$\210\f\311\211\203\231@\316\"\203\220\f\236\243\311\211\203\217@\317#
\235\203\205\317\320
\"\206\203\321$\210)A\211\204_*A\211\204C*\322
	\"\210)A\211\204*\n+\207" [db data keys spec tracked key eieio-oref apply registry-search nil gethash cl--assertion-failed entry "Key %s does not exist in database" registry-lookup-secondary registry-lookup-secondary-value delete t remhash --dolist-tail-- assert tr val value-keys] 8 "Delete KEYS from the registry-db THIS.\nIf KEYS is nil, use SPEC to do a search.\nUpdates the secondary ('tracked') indices as well.\nWith assert non-nil, errors out if the key does not exist already.\n\n(fn DB KEYS ASSERT &rest SPEC)"] registry-size ((db registry-db)) #[(db) "\301\302\303\"!\207" [db hash-table-count eieio-oref data] 4 "Returns the size of the registry-db object THIS.\nThis is the key count of the `data' slot."] registry-full ((db registry-db)) #[(db) "\301!\302\303\"Y\207" [db registry-size eieio-oref max-size] 4 "Checks if registry-db THIS is full."] registry-insert ((db registry-db) key entry) #[(db key entry) "\306\307	\310\"\"\203\311\312\313\314\211$\210\315	!\203\311\316\317\314\211$\210\320\n\307	\310\"#\210\307	\321\"\314\211\203t\f@\211\n\236\243\314\211\203l\f@\322	
#\235\203V\202ZB\322	
$\210)\fA\211\204@*\fA\211\2042*\n\207" [key db entry tr --dolist-tail-- val gethash eieio-oref data cl--assertion-failed (not (gethash key (oref db data))) "Key already exists in database" nil registry-full (not (registry-full db)) "registry max-size limit reached" puthash tracked registry-lookup-secondary-value value-keys] 7 "Insert ENTRY under KEY into the registry-db THIS.\nUpdates the secondary ('tracked') indices as well.\nErrors out if the key exists already."] registry-reindex ((db registry-db)) #[(db) "\306\307\310\"G\311!_\307\310\"\312\211\205-\f@\312\313\314\307\315\"\"\210)\fA\211\204\312,\207" [db expected count tr --dolist-tail-- values 0 eieio-oref tracked registry-size nil maphash #[(key v) "T\306	W\203\307\310\"\306U\203\311\312	\313_	\245$\210\n\236\243\314\211\205L
@\315\n\f#B\315\n\f$\210)
A\211\204(\314*\207" [count expected tr v val --dolist-tail-- 0 mod 1000 message "reindexing: %d of %d (%.2f%%)" 100.0 nil registry-lookup-secondary-value db value-keys key] 7] data] 6 "Rebuild the secondary indices of registry-db THIS."] registry-prune ((db registry-db) &optional sortfunc) #[(db &optional sortfunc) "\305!\306\307\310\"\307\310\"\307\311\"_Z!\312\313!\203.\314\nZ\f#\315	\312#G\202/\316+\207" [db candidates target-size size sortfunc registry-size floor eieio-oref max-size prune-factor nil registry-full registry-collect-prune-candidates registry-delete 0] 7 "Prunes the registry-db object DB.\n\nAttempts to prune the number of entries down to (*\n:max-size :prune-factor) less than the max-size limit, so\npruning doesn't need to happen on every save. Removes only\nentries without the :precious keys, so it may not be possible to\nreach the target limit.\n\nEntries to be pruned are first sorted using SORTFUNC.  Entries\nfrom the front of the list are deleted first.\n\nReturns the number of deleted entries."] registry-collect-prune-candidates ((db registry-db) limit sortfunc) #[(db limit sortfunc) "\306\301\"\307\306\303\"\310\311\312\"\210\f\237)\203\"\313
\"\314\315\316
\"\317
G^#,\207" [db precious precious-p data #2=#:--cl-var-- candidates eieio-oref #[(entry-key) "@	>A\207" [entry-key precious] 2] nil maphash #[(k v) "	\304\305\306$?\266\203\205\n	BB\211\207" [precious-p v k #2# nil apply cl-some] 8] sort cl-subseq mapcar car 0 sortfunc limit] 5 "Collects pruning candidates from the registry-db object DB.\n\nProposes only entries without the :precious keys, and attempts to\nreturn LIMIT such candidates.  If SORTFUNC is provided, sort\nentries first and return candidates from beginning of list."] provide registry] 6)