This is the print-licenses Reference Manual, version 0.1.0, generated automatically by Declt version 4.0 beta 2 "William Riker" on Sun Dec 15 07:20:38 2024 GMT+0.
The main system appears first, followed by any subsystem dependency.
print-licenses
Print the licenses used by the given project and its dependencies.
vindarel
MIT
0.1.0
alexandria
(system).
iterate
(system).
print-licenses.lisp
(file).
Files are sorted by type and then listed depth-first from the systems components trees.
print-licenses/print-licenses.asd
print-licenses
(system).
print-licenses/print-licenses.lisp
print-licenses
(system).
print-licenses
(function).
aesthetic-string
(function).
dependency-tree
(function).
license-list
(function).
map-tree
(function).
print-table
(function).
shut-up
(macro).
weave
(function).
Packages are listed by definition order.
print-licenses
alexandria
.
common-lisp
.
iterate
.
print-licenses
(function).
aesthetic-string
(function).
dependency-tree
(function).
license-list
(function).
map-tree
(function).
print-table
(function).
shut-up
(macro).
weave
(function).
Definitions are sorted by export status, category, package, and then by lexicographic order.
Print the licenses used by the given project and its dependencies.
Note that in order to do this the project must be ‘quickload‘ed, so you might
want to do this in a separate Lisp image if you don’t want to clutter your
current one.
If the project does not specify its license in its ASDF system definition it
will be listed as ’Unspecified’. You should manually figure out what license
it uses (and maybe send a pull request).
Example:
(print-licenses ’fast-io)
=>
alexandria | Public Domain / 0-clause MIT
babel | MIT
cffi | MIT
cffi-grovel | MIT
cffi-toolchain | MIT
fast-io | NewBSD
static-vectors | MIT
trivial-features | MIT
trivial-gray-streams | MIT
uiop | Unspecified
Run ‘body‘ with stdout and stderr redirected to the void.
Return the string used to represent ‘thing‘ when printing aesthetically.
The difference between this function and ql-dist:dependency-tree
is that it uses caching and also it returns not a full tree but
each system is occur in the resulting tree only once.
This makes it 1000 times faster and makes difference on systems having large amount of dependencies like Reblocks.
Applies ‘function‘ to each of the leave of ‘tree‘. Returns no values, because function results are discarded.
Print ‘rows‘ as a nicely-formatted table.
Each row should have the same number of colums.
Columns will be justified properly to fit the longest item in each one.
Example:
(print-table ’((1 :red something)
(2 :green more)))
=>
1 | RED | SOMETHING
2 | GREEN | MORE
Return a list whose elements alternate between each of the lists ‘lists‘. Weaving stops when any of the lists has been exhausted.
Jump to: | A D F L M P S W |
---|
Jump to: | A D F L M P S W |
---|
Jump to: | F P S |
---|
Jump to: | F P S |
---|