parse-lambda-list.elc

;ELC
;;; Compiled by toups@deluge on Tue Aug 30 14:21:49 2011
;;; from file /home/toups/elisp/utils/parse-lambda-list.el
;;; in Emacs version 23.2.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\303\304!\207" [require utils multi-methods provide parse-lambda-list] 2)
#@40 Initial state for lambda-list parsing.
(defvar *default-parse-state* (alist>> :state :normal) (#$ . 625))
#@51 Detects whether a token indicates a state change.
(defalias 'state-changer-p #[(possible-new-state) "\301=\203\302\207\303=\203\304\207\305=\203\306\207\307\207" [possible-new-state &rest :rest &optional :optional &key :key nil] 2 (#$ . 737)])
#@190 Detects a state change but also makes sure that the change is valid for a lambda list.  Any state 
may follow after normal arguments, but only keywords can follow after optional arguments.
(defalias 'state-changer-p-with-checking #[(possible-new-state old-state) "\304!\211\205B\n	D\211\305\232\203	\202A\306\232\203 	\202A\307\232\203*	\202A\310\232\2034	\202A\311\232\203>	\202A\312\313!))\207" [possible-new-state new-state old-state pair state-changer-p (:normal :rest) (:optional :rest) (:normal :key) (:normal :optional) (:optional :key) error "Malformed lambda-list"] 3 (#$ . 997)])
#@161 The reducing function for parsing a lambda list by folding.  Each step detects a state change or adds a
token to the appropriate key in the accumulation alist.
(defalias 'lambda-list-reducer #[(item acc) "\305	\306\"\307\n\"\211\203\310\306\f\n\311\305\n\"!%\202$\312\n#+\207" [acc #1=#:table-58604 state item new-state alist :state state-changer-p-with-checking alist>> reverse alist-cons] 10 (#$ . 1613)])
#@246 Parses a (common-lisp-like) lambda list using a fold and a LAMBDA-LIST-REDUCER.  Checks for malformed
argument lists.  Returns an association-list for the :normal, :key, :optional and :rest parts of the list.

(fn LAMBDA-LIST &key (EXTENDED t))
(defalias 'parse-lambda-list #[(lambda-list &rest #1=#:--cl-rest--) "\305>\206\306A@\n\2036\n@\307>\203\nAA\211\202
\310>A@\203-\311\211\202
\312\313\n@\"\210\202\f)\314\315\316\317\320\f#\321\"\322\323\311$!)\207" [#1# extended #2=#:--cl-keys-- *default-parse-state* lambda-list :extended (nil t) (:extended :allow-other-keys) :allow-other-keys nil error "Keyword argument %s not one of (:extended)" reverse alist-conjugate dissoc foldl lambda-list-reducer :state :rest car] 8 (#$ . 2040)])
#@84 Returns the symbol part of a lambda-list sub form: (x 10) or (x) -> x, but y -> y.
(defalias 'lambda-list-sub-form-get-name #[(sub-form) "<\203@\207\207" [sub-form] 1 (#$ . 2800)])
#@82 Return a list of the symbols in lambda-list, in the order they were encountered.
(defalias 'lambda-list-names-in-order #[(lambda-list) "\305!\306\211	:\203D	@\307\n\2059\310\n@\311\"\2030\n\211A@)\2059\n\211A@)C\2029\312\313\n\211A@)\"!\244	A\211\202	\237+\207" [lambda-list #1=#:--cl-var-- item #2=#:--cl-var-- x parse-lambda-list nil reverse memql (:rest) mapcar lambda-list-sub-form-get-name] 5 (#$ . 2992)])
#@180 Return a list of the symbols in lambda-list, in the order they were encountered.
In this version of the function, the rest form is enclosed in a list, for subsequent macro magic.
(defalias 'lambda-list-names-in-order-explicit-rest-list #[(lambda-list) "\305!\306\211	:\203F	@\307\n\205;\310\n@\311\"\2032\n\211A@)\205;\312\n\211A@)DC\202;\313\314\n\211A@)\"!\244	A\211\202	\237+\207" [lambda-list #1=#:--cl-var-- item #2=#:--cl-var-- x parse-lambda-list nil reverse memql (:rest) list mapcar lambda-list-sub-form-get-name] 5 (#$ . 3429)])