Next: Introduction, Previous: (dir), Up: (dir) [Contents][Index]
This is the gadgets Reference Manual, generated automatically by Declt version 3.0 "Montgomery Scott" on Tue Dec 22 13:32:01 2020 GMT+0.
| • Introduction | What gadgets is all about | |
| • Systems | The systems documentation | |
| • Files | The files documentation | |
| • Packages | The packages documentation | |
| • Definitions | The symbols documentation | |
| • Indexes | Concepts, functions, variables and data types |
Ben McGunigle's collection of gadgets, odds, ends and utilities general.
Function Parameters: entity &key package Turns a string into an upcased symbol. The symbol will be interned in the current package if a package is not specified
Paul Graham's mkstr. Returns a string representation of the parameters.
A single variable let that returns the variable when the body completes.
Set a variable in the function namespace.
Find if a key is in a list, return the next item after it. if in-list is true, test the first element of any sublists for the key and if found return the rest of the sublist. A bit coarser in function than getf. Will tolerate improper plists.
Traverses a plist or lambda list, removing the specified keywords and the value that immediately follows each. Found key/value pairs are returned as a plist. The cleaned list is returned as the second value.
This, or the related macro bind-extracted-keywords, is particularly useful for adding features to macros. It will strip out added keywords from parameter lists, allowing the remainder to be passed to the original macro processing code.
Removes the keywords named in keys, with their accompanying parameters, from the expression supplied in source. Source, minus the keys, is bound to remainder. The names of the keys are used for bindings for the accompanying values.
(bind-extracted-keywords ((1 2 :x 3) data :x) <body>)
Results in the body being executed with data bound to (1 2) and x bound to 3.
Cause the item at the targeted location to become quoted:
> (defparameter *list* '(zero one two three))
> (quotef (elt *list* 2))
> *list*
(ZERO ONE 'TWO THREE)
Macro utility to test if an item has been quoted by the macro user.
Macro utility to test if an item has been passed into a macro as a quoted symbol. If so, returns the symbol without the quote.
Utility to test if a macro parameter is a quoted list. Returns the list if it is.
Like use-package, but shadows existing symbols from target-package without asking. Target-package is the current package unless otherwise specified.
Returns a string representation of item with the first letter capitalized and the remaining characters lower-case, where applicable. Item can be a string or a symbol.
Returns a lowercase copy of the supplied string.
Returns an uppercase copy of the supplied string.
For processing user input. Return the input as a string unless it can be recognized as an integer.
Convert the input string into a symbol unless it can be converted into a number.
Attempts to guess when a string or number should be interpreted as T. Postive integers and strings like "true" and "yes" will be interpreted as true. Non-empty lists and sequences are true. Most other things are NIL. This function is useful for interactions in which a human is expected to answer a true or false question.
A predicate to detect 0 length sequences.
Given two sequences, are they the same until one runs out? This function does not care which sequence contains the other. Use sequence-starts-with for more specific results.
Does the sequence begin with the test sequence?
Does the sequence end with the test sequence?
Returns a string consisting of one each of the items in strings with filler interspersed between all of the items.
> (string-join " and " '("one" "two" "three"))
"one and two and three"
(#\Space #\Newline #\Backspace #\Tab #\Linefeed #\Page #\Return #\Rubout)
Broad version of string-equal. Will take input that is not a string or symbol.
A case sensitive version of string-equal.
Trim a string to the length specified by length - default 20, appending instead the string specified by indicator - default "...".
A shortcut for (cdr (assoc ...)).
Gets all items associated with a key, not just the first. Returns a list
(assoc-all :a '((:a . 1) (:b . 2) (:c . 3) (:a . 4)))
=> (1 4)
Finds the first key in keys that has a match in alist. Uses equal to match strings.
Does an item appear to be an assoc-list?
Determine if an item qualifies as a plist
Returns a new hash table with keys and values swapped:
(:a 1 :b 3 :c 5) => (1 :a 3 :b 5 :c)
The hash table test can be set with :test. The method of value collection can be controlled with :mode. Modes are those available for cl-hash-util:collecting-hash-table.
Takes a store (one of hash, alist or plist) and a mapping (also a hash, alist or plist) and returns a new hash table with the values from store rekeyed according to the oldkey -> newkey pairs found in mapping. Ignore-missing instructs rekey on what to do when a key is found in store but not in mapping. If true, rekey will drop the item that has no match. When false, it will include the item as is.
The result hash table will be created with the supplied test parameter.
Iterate over an alist.
Iterate over a hash table
Check if a hash table has a key.
Shortcut for (nth-value 1 (gethash key hash))
Returns a source code representation of a hash table.
Returns copy of sequence with start->end chopped out of it.
Returns a list consisting of the contents of the input sequence.
Returns the last item in a list proper.
Breaks a list up into n sized chunks.
>(chunk 3 '(a b c d e f g))
((A B C) (D E F) (G))
Flattens conses found in the top level of a list. Nils in the top level will be removed.
(flatten-1 '((1 2 3) nil (nil) ((4 5) (6 7))))
(1 2 3 NIL (4 5) (6 7))
Recursively flattens any conses found in items if the predicate returns true on them. Will not flatten NILs unless the predicate indicates it. The predicate will not be called on non-cons items. Flatten-when will not normally descend into lists which it will not flatten, passing unchanged any list or cons item that fails the predicate. To cause it to descend into non-matching portions of the tree, set the :descend-all keyword.
Returns a list with any conses in it flattened if predicate returns true when called with that item. Will not flatten NILs unless the predicate indicates it. The predicate will not be called on non-cons items.
Divides a list into two parts at the specified index. The two parts are returned as values. If the index is too large for the sequence, part-on-index will silently return the sequence as the first value. Set the :fail keyword T to raise an error instead.
Divides a list or sequence into two parts, with the second part starting with the first item to cause test to return true. The two parts of the sequence are returned as values. If a dividing point is not found, part-on-true will return the whole sequence as the first value. If you wish it to raise an error instead, set the :fail parameter to true.
Like part-on-true, but includes the first matching item in the first list.
Returns a copy of sequence without items that are a member of things. You can modify the test function which is used by member - default eq - with the :test keyword. The :key keyword allows a single parameter function that receives a sequence item and should return a modified item for comparison to the items in things.
Performs the remove-if-not and remove-if operations on a list simultaneously, returning each list as the first and second values respectively.
Searches for a phrase or phrases in a sequence. When it finds one, it returns as values the subsequence up to the match, the subsequence after the match, and the matching subsequence. If no match is found, the whole sequence is returned as the first value.
Like the built in function some, first-match returns the first item in the list that evaluates true in the predicate. First-match uses the second value to indicate success, unlike some.
Returns the index of the first item in list that satisfies predicate.
Returns a unique list of the items in list in the order in which they first appear.
A dolist for situations where access to the whole list is needed. Do-list-with-rest will iterate through the list supplied in source, initially binding the list to tail. On each iteration an item is removed from the first position of tail and pushed onto head. Note that the contents of head will be in reverse from those in source
Returns a copy of the list with index set to value. If index is beyond the length of the list, pad out the list with the value in padding.
Creates a list containing a sequential range of integers. By default the range runs from 0 to one below the supplied stop value:
(range 3) -> (0 1 2)
If a second parameter is supplied, the first is treated as a starting value, and the second as a stop:
(range 7 10) -> (7 8 9)
The third parameter specifies a step size:
(range 0 10 2) -> (0 2 4 6 8)
A negative step parameter causes the range to travel down from the start to the stop:
(range 10 5) -> (10 9 8 7 6)
Returns a value indicating where num is positioned relative to start and end. If num lies between start and end, the return value will be between 0.0 and 1.0.
Complement of relative-of-range function. Treats num as if it were a fraction of the range specified by start and end. Returns the absolute number that results.
A version of or that bases its decision on the second value of each clause. Forms that return no second value are considered T.
Like dolist, iterates over a list, but instead of binding a single list item per iteration binds a segment of the list as a sliding window.
(do-window (x '(1 2 3 4 5 6)) ...)
will execute the body 5 times with x bound respectively to:
(1 2) (2 3) (3 4) (4 5) (5 6)
The step keyword adjusts how far the window slides per iteration. A destructuring spec can be provided in place of the variable. Therefore do-window can be used to iterate over a plist like so:
(do-window ((k v) '(:a 1 :b 2 :c 3) :step 2) ...)
Each key and value will be bound to k and v, respectively.
The size keyword allows adjustment of the window size.
Leading padding may be provided to do-window with the start-padding keyword.
Execute the code in the body, returning T as the second value if the code executes without error, but returning (NIL NIL) if an exception is thrown. This provides a quick way to turn an error into a boolean value.
WARNING: This isn't always a great idea for production code. Tryit will mask all raised errors, So if your code throws an error outside of what you expected, you won't be warned of the variance.
If test results in a number that is less than zero, minus-clause will be evaluated. If zero, then zero-clause. Otherwise, plus-clause.
Take the values returned by expression, pass the first of them to func, returning its first value as the primary value and appending the remaining values from expression as unchanged.
(1+ (values 1 2 3)) => 2
(preserve-other-values (values 1 2 3)
#'1+) => 2 2 3
Maps through the supplied lists, passing a step-sized chunk from each into func. Returns a list of the results. The lists should all be the same length. That length should be divisible by the value specified in step.
Maps over a list two items at a time. The items are passed to the function as first and second parameters.
This function is ideal for processing plists. As with map-by-2, func will receive items 2 at a time as the first and second parameters. It should return a list. For example:
(mapcan-by-2 (lambda (key value) (list key value)) <some-list>)
will copy a plist with no changes.
Map over an assoc list, with the key and value from each pair being sent to func as, respectively, the first and second parameters.
Map over a list, proper or not. The return mapping will be a proper list.
Mapc over a list, proper or not. Original list is returned. Like mapc, mapc-improper is used for side effects only.
Executes return/return-from on the result of clause if it is true
Will continue to call function until either it returns success or a given amount of time elapses. Duration can be set with the :wait keyword. It defaults to 1 second. Try-awhile will sleep between function calls unless the :sleep keyword is set to nil. Default sleep is 0.001 of a second.
Try-awhile will return the function value on success or nil on failure. If a function is supplied to the :on-success argument, it will be executed if the function succeeds and its result will be returned instead. The :on-fail keyword may be used to supply a function that will be run if the time elapses without a successful function run. Its result will be returned instead of the default nil.
Try-awhile blocks until completion.
Divides the s-expression supplied in tree into an inner and an outer portion. The outer portion is returned in the first value as a closure. The inner portion is returned as the second value. The inner portion consists of the first part of the tree that passes test. The tree is traversed breadth-first.
> (part-tree
(lambda (x) (eq 'deepest (car (ensure-list x))))
'(deep (deeper (deeperer (deepest (deepester you-are-here))))))
#<CLOSURE (LAMBDA (GADGETS::X) :IN GADGETS:PART-TREE) {C19C81D}>
(DEEPEST (DEEPESTER YOU-ARE-HERE))
> (funcall * :xyz)
(DEEP (DEEPER (DEEPERER :XYZ)))
The returned closure should be called with a single argument. It will return the outer portion with the supplied argument in place of the inner portion.
Steps through a file or stream, one line at a time, binding the contents of the line to the variable specified in line. If a pathname is supplied, the file will be closed on completion or other exit. Streams will not be closed.
A wrapper around do-file-by-line. The specified file or stream will be passed to the supplied function one line at a time. The function results will be accumulated in a list and returned.
Get an exclusive lock on a file. If lock cannot be obtained, keep trying after waiting a while
A utility function for creating a time delta. Returns the time delta as an integer representing seconds.
Returns a timer closure that, on execution, returns the number of units of time elapsed since make-clock returned it.
Merge the supplied pathname onto the path of the current user's home directory.
Generates a temporary directory in the appropriate location (specified by uiop), calls the supplied function, then cleans up the directory.
By default, the created pathname is passed to the function. If want-pathname-p is set to NIL, the current directory will instead be set to the temporary directory for the duration of the call.
Generates a temporary directory in the appropriate location (specified by uiop), executes the body of the macro, then cleans up the directory.
When a symbol is supplied to :pathname the temporary name will be bound to it. Otherwise the current directory will be set to the temporary directory for the duration of body execution.
Certain forms are awkward to debug using plain print. These tools provide some extra options.
This macro is a drop in replacement for if. It prints the test expression and the result of the test, indicating which way the if statement has branched.
A drop in replacement for lambda that behaves as trace does for defined functions.
A verbose drop in replacement for cond.
A verbose drop in replacement for and.
Like print, but prints - and passes on - all values received. Useful for debugging expressions that return multiple values.
For situations where print can't reach out. Put an item into storage for later retrieval by dive.
Retrieve dumped item.
Next: Files, Previous: Introduction, Up: Top [Contents][Index]
The main system appears first, followed by any subsystem dependency.
| • The gadgets system |
Ben McGunigle <bnmcgn@gmail.com>
Apache License, version 2.0
Ben McGunigle’s utility collection
gadgets.asd (file)
Files are sorted by type and then listed depth-first from the systems components trees.
| • Lisp files |
| • The gadgets.asd file | ||
| • The gadgets/package.lisp file | ||
| • The gadgets/early.lisp file | ||
| • The gadgets/gadgets.lisp file |
Next: The gadgets/package․lisp file, Previous: Lisp files, Up: Lisp files [Contents][Index]
gadgets.asd
gadgets (system)
Next: The gadgets/early․lisp file, Previous: The gadgets․asd file, Up: Lisp files [Contents][Index]
Next: The gadgets/gadgets․lisp file, Previous: The gadgets/package․lisp file, Up: Lisp files [Contents][Index]
package.lisp (file)
gadgets (system)
early.lisp
eval-always (macro)
Previous: The gadgets/early․lisp file, Up: Lisp files [Contents][Index]
gadgets (system)
gadgets.lisp
Next: Definitions, Previous: Files, Up: Top [Contents][Index]
Packages are listed by definition order.
| • The gadgets package |
package.lisp (file)
Definitions are sorted by export status, category, package, and then by lexicographic order.
| • Exported definitions | ||
| • Internal definitions |
Next: Internal definitions, Previous: Definitions, Up: Definitions [Contents][Index]
| • Exported special variables | ||
| • Exported macros | ||
| • Exported functions | ||
| • Exported generic functions |
Next: Exported macros, Previous: Exported definitions, Up: Exported definitions [Contents][Index]
gadgets.lisp (file)
Next: Exported functions, Previous: Exported special variables, Up: Exported definitions [Contents][Index]
Removes the keywords named in keys, with their accompanying parameters, from the expression supplied in source. Source, minus the keys, is bound to remainder. The names of the keys are used for bindings for the accompanying values. (bind-extracted-keywords ((1 2 :x 3) data :x) <body>) Results in the body being executed with data bound to (1 2) and x bound to 3.
gadgets.lisp (file)
Set a variable in the function namespace.
gadgets.lisp (file)
gadgets.lisp (file)
gadgets.lisp (file)
gadgets.lisp (file)
gadgets.lisp (file)
Like dolist, iterates over a list, but instead of binding a single list
item per iteration binds a segment of the list as a sliding window.
(do-window (x ’(1 2 3 4 5 6)) ...)
will execute the body 5 times with x bound respectively to:
(1 2) (2 3) (3 4) (4 5) (5 6)
The step keyword adjusts how far the window slides per iteration. A destructuring spec can be provided in place of the variable. Therefore do-window
can be used to iterate over a plist like so:
(do-window ((k v) ’(:a 1 :b 2 :c 3) :step 2) ...)
Each key and value will be bound to k and v, respectively.
The size keyword allows adjustment of the window size.
Leading padding may be provided to do-window with the start-padding
keyword.
gadgets.lisp (file)
early.lisp (file)
A version of or that bases its decision on the second value of each clause. Forms that return no second value are considered T.
gadgets.lisp (file)
gadgets.lisp (file)
Take the values returned by expression, pass the first of them to func,
returning its first value as the primary value and appending the remaining
values from expression as unchanged.
(1+ (values 1 2 3)) => 2
(preserve-other-values (values 1 2 3)
#’1+) => 2 2 3
gadgets.lisp (file)
Like print, but prints - and passes on - all values received. Useful for debugging expressions that return multiple values.
gadgets.lisp (file)
gadgets.lisp (file)
gadgets.lisp (file)
gadgets.lisp (file)
gadgets.lisp (file)
A single variable let that returns the variable when the body completes.
(ret x 3 (incf x)) => 4
gadgets.lisp (file)
Executes return/return-from on the result of clause if it is true
gadgets.lisp (file)
gadgets.lisp (file)
Execute the code in the body, returning T as the second value if the code executes without error, but returning (NIL NIL) if an exception is thrown. This provides a quick way to turn an error into a boolean value.
WARNING: This isn’t always a great idea for production code. Tryit will mask all raised errors, So if your code causes an error aside from the one you expect, you won’t be warned of the variance.
gadgets.lisp (file)
Get an exclusive lock on a file. If lock cannot be obtained, keep trying after waiting a while
gadgets.lisp (file)
gadgets.lisp (file)
Next: Exported generic functions, Previous: Exported macros, Up: Exported definitions [Contents][Index]
Determine if an item appears to be an assoc list
gadgets.lisp (file)
Complement of relative-of-range function. Treats num as if it were a fraction of the range specified by start and end. Returns the absolute number that results.
gadgets.lisp (file)
Gets all items associated with a key, not just the first. Returns a list
(assoc-all :a ’((:a . 1) (:b . 2) (:c . 3) (:a . 4)))
=> (1 4)
gadgets.lisp (file)
A shortcut for (cdr (assoc ...)) to give immediate access to an alist value.
gadgets.lisp (file)
Finds the first key in keys that has a match in alist. Will use equal to match strings.
gadgets.lisp (file)
Attempts to guess when a string or number should be interpreted as T. Postive integers and strings like "true" and "yes" will be interpreted as true. Non-empty lists and sequences are true. Most other things are NIL
gadgets.lisp (file)
gadgets.lisp (file)
Returns a string representation of item with the first letter capitalized and the remaining characters lower-case, where applicable. Item can be a string or a symbol
gadgets.lisp (file)
gadgets.lisp (file)
gadgets.lisp (file)
gadgets.lisp (file)
Edit an existing file in place. The file location is specified in path. An input and an output stream are passed as parameters to the supplied function. The input function reads from the specified file; the output stream writes to a temporary file. The supplied function is assumed to read from the input stream, make any desired changes, and write to the output stream. If it returns without error, the streams are closed and the temporary file is copied over the original.
gadgets.lisp (file)
gadgets.lisp (file)
Traverses a plist or lambda list, removing the specified keywords and the
value that immediately follows each. Found key/value pairs are returned as a
plist in the first value. The cleaned list is returned as the second value.
This, or the related macro bind-extracted-keywords, is particularly useful for adding features to macros. It will strip out added keywords from parameter lists, allowing the remainder to be passed to the original macro processing code.
gadgets.lisp (file)
Find if a key is in a list, return the next item after it. if checklist is true, test the first element of any sublists for the key and if found return rest of list as parameter. A bit coarser in function than getf. Will tolerate improper plists.
gadgets.lisp (file)
See also ’some’
gadgets.lisp (file)
Flattens conses found in the top level of a list. Nils in the top level will be removed.
(flatten-1 ’((1 2 3) nil (nil) ((4 5) (6 7))))
(1 2 3 NIL (4 5) (6 7))
gadgets.lisp (file)
Returns a list with any conses in it flattened if predicate returns true when called with that item. Will not flatten NILs unless the predicate indicates it. The predicate will not be called on non-cons items.
gadgets.lisp (file)
Recursively flattens any conses found in items if the predicate returns true on them. Will not flatten NILs unless the predicate indicates it. The predicate will not be called on non-cons items. Flatten-when will not normally descend into lists which it will not flatten, passing unchanged any list or cons item that fails the predicate. To cause it to descend into non-matching portions of the tree, set the :descend-all keyword.
gadgets.lisp (file)
Returns a source code representation of a hash table.
gadgets.lisp (file)
gadgets.lisp (file)
Returns a new hash table with keys and values swapped:
(:a 1 :b 3 :c 5) => (1 :a 3 :b 5 :c)
The hash table test can be set with :test. The method of value collection can be controlled with :mode. Modes are those available for cl-hash-util:collecting-hash-table.
gadgets.lisp (file)
gadgets.lisp (file)
gadgets.lisp (file)
gadgets.lisp (file)
gadgets.lisp (file)
gadgets.lisp (file)
gadgets.lisp (file)
gadgets.lisp (file)
Map over a list, proper or not. The return mapping will be a proper list.
gadgets.lisp (file)
Mapc over a list, proper or not. Original list is returned. Like mapc, mapc-improper is used for side effects only.
gadgets.lisp (file)
gadgets.lisp (file)
gadgets.lisp (file)
gadgets.lisp (file)
A predicate to detect 0 length sequences.
gadgets.lisp (file)
Returns a unique list of the items in list in the order in which they first appear.
gadgets.lisp (file)
Divides a list into two parts at the specified index. The two parts are returned as values. If the index is too large for the sequence, part-on-index will silently return the sequence as the first value. Set the :fail keyword T to raise an error instead.
gadgets.lisp (file)
Divides the s-expression supplied in tree into an inner and an outer portion. The outer portion is returned in the first value as a closure. The inner portion is returned as the second value. The inner portion consists of the first part of the tree that passes test. The tree is traversed breadth-first.
> (part-tree
(lambda (x) (eq ’deepest (car (ensure-list x))))
’(deep (deeper (deeperer (deepest (deepester you-are-here))))))
#<CLOSURE (LAMBDA (GADGETS::X) :IN GADGETS:PART-TREE) {C19C81D}>
(DEEPEST (DEEPESTER YOU-ARE-HERE))
> (funcall * :xyz)
(DEEP (DEEPER (DEEPERER :XYZ)))
The returned closure should be called with a single argument. It will return the outer portion with the supplied argument in place of the inner portion.
gadgets.lisp (file)
Determine if an item qualifies as a plist
gadgets.lisp (file)
Utility to test if a macro parameter is a quoted list. Returns the list if it is.
gadgets.lisp (file)
Macro utility to test if an item has been quoted by the macro user.
gadgets.lisp (file)
Macro utility to test if an item has been passed into a macro as a quoted symbol. If so, returns the symbol without the quote.
gadgets.lisp (file)
Creates a list containing a sequential range of integers. By default the
range runs from 0 to one below the supplied stop value:
(range 3) -> (0 1 2)
If a second parameter is supplied, the first is treated as a starting value, and
the second as a stop:
(range 7 10) -> (7 8 9)
The third parameter specifies a step size:
(range 0 10 2) -> (0 2 4 6 8)
A negative step parameter causes the range to travel down from the start to the
stop:
(range 10 5) -> (10 9 8 7 6)
gadgets.lisp (file)
gadgets.lisp (file)
Returns a value indicating where num is positioned relative to start and end. If num lies between start and end, the return value will be between 0.0 and 1.0.
gadgets.lisp (file)
gadgets.lisp (file)
gadgets.lisp (file)
Does the sequence end with the test sequence?
gadgets.lisp (file)
Does the sequence begin with the test sequence?
gadgets.lisp (file)
Given two sequences, are they the same until one runs out? This function does not care which sequence contains the other. Use sequence-starts-with if you need something more specific.
gadgets.lisp (file)
gadgets.lisp (file)
gadgets.lisp (file)
Broad version of string-equal. Will take input that is not a string or symbol.
gadgets.lisp (file)
A case sensitive version of string-equal.
gadgets.lisp (file)
For things that send multiple items with "[]" appended to the var name, a convention started by the PHP people. Mostly useful for web programming.
gadgets.lisp (file)
gadgets.lisp (file)
Return the input as a string unless it can be recognized as an integer.
gadgets.lisp (file)
gadgets.lisp (file)
Convert the input string into a symbol unless it can be converted into a number.
gadgets.lisp (file)
gadgets.lisp (file)
gadgets.lisp (file)
gadgets.lisp (file)
gadgets.lisp (file)
Will continue to call predicate until either it returns success or a given amount of time elapses. Duration can be set with the :wait keyword. It defaults to 1 second. Try-awhile will sleep between predicate calls unless the :sleep keyword is set to nil. Default sleep is 0.001 of a second.
Try-awhile will return the predicate value on success or nil on failure. If a function is supplied to the :on-success argument, it will be executed if the predicate succeeds and its result will be returned instead of the predicate result. The :on-fail keyword may be used to supply a function that will be run if the time elapses without a predicate success. It’s result will be returned instead of the default nil.
gadgets.lisp (file)
gadgets.lisp (file)
OS independent functions to supply the recommended locations for user writable cache, config and data directories on the current platform. It’s best not to place application files in the returned directory. ’common-lisp/[appname]’ or perhaps ’[appname]/’ should first be appended to the diectory.
gadgets.lisp (file)
OS independent functions to supply the recommended locations for user writable cache, config and data directories on the current platform. It’s best not to place application files in the returned directory. ’common-lisp/[appname]’ or perhaps ’[appname]/’ should first be appended to the diectory.
gadgets.lisp (file)
OS independent functions to supply the recommended locations for user writable cache, config and data directories on the current platform. It’s best not to place application files in the returned directory. ’common-lisp/[appname]’ or perhaps ’[appname]/’ should first be appended to the diectory.
gadgets.lisp (file)
Returns sequence with start->end chopped out of it
gadgets.lisp (file)
Previous: Exported functions, Up: Exported definitions [Contents][Index]
Like part-on-true, but includes the first matching item in the first list.
gadgets.lisp (file)
Divides a list or sequence into two parts, with the second part starting with the first item to cause test to return true. The two parts of the sequence are returned as values. If a dividing point is not found, part-on-true will return the whole sequence as the first value. If you wish it to raise an error instead, set the :fail parameter to true.
gadgets.lisp (file)
Previous: Exported definitions, Up: Definitions [Contents][Index]
| • Internal special variables | ||
| • Internal functions |
Next: Internal functions, Previous: Internal definitions, Up: Internal definitions [Contents][Index]
gadgets.lisp (file)
Previous: Internal special variables, Up: Internal definitions [Contents][Index]
gadgets.lisp (file)
Returns the index of the first item in list that satisfies predicate.
gadgets.lisp (file)
Previous: Definitions, Up: Top [Contents][Index]
| • Concept index | ||
| • Function index | ||
| • Variable index | ||
| • Data type index |
Next: Function index, Previous: Indexes, Up: Indexes [Contents][Index]
| Jump to: | F G L |
|---|
| Jump to: | F G L |
|---|
Next: Variable index, Previous: Concept index, Up: Indexes [Contents][Index]
| Jump to: | %
A B C D E F G H I K L M N O P Q R S T U W X |
|---|
| Jump to: | %
A B C D E F G H I K L M N O P Q R S T U W X |
|---|
Next: Data type index, Previous: Function index, Up: Indexes [Contents][Index]
| Jump to: | *
S |
|---|
| Jump to: | *
S |
|---|
Previous: Variable index, Up: Indexes [Contents][Index]
| Jump to: | G P S |
|---|
| Index Entry | Section | ||
|---|---|---|---|
| | |||
| G | |||
gadgets: | The gadgets system | ||
gadgets: | The gadgets package | ||
| | |||
| P | |||
Package, gadgets: | The gadgets package | ||
| | |||
| S | |||
System, gadgets: | The gadgets system | ||
| | |||
| Jump to: | G P S |
|---|