This is the com.gigamonkeys.prose-diff Reference Manual, generated automatically by Declt version 4.0 beta 2 "William Riker" on Sun Dec 15 07:06:23 2024 GMT+0.
com.gigamonkeys.prose-diff/com.gigamonkeys.prose-diff.asd
com.gigamonkeys.prose-diff/packages.lisp
com.gigamonkeys.prose-diff/lcs.lisp
com.gigamonkeys.prose-diff/tokenize.lisp
com.gigamonkeys.prose-diff/text.lisp
com.gigamonkeys.prose-diff/utilities.lisp
com.gigamonkeys.prose-diff/diff.lisp
com.gigamonkeys.prose-diff/html.lisp
The main system appears first, followed by any subsystem dependency.
com.gigamonkeys.prose-diff
cl-ppcre
(system).
com.gigamonkeys.pathnames
(system).
com.gigamonkeys.utilities
(system).
com.gigamonkeys.macro-utilities
(system).
com.gigamonkeys.markup
(system).
monkeylib-markup-html
(system).
packages.lisp
(file).
lcs.lisp
(file).
tokenize.lisp
(file).
text.lisp
(file).
utilities.lisp
(file).
diff.lisp
(file).
html.lisp
(file).
Files are sorted by type and then listed depth-first from the systems components trees.
com.gigamonkeys.prose-diff/com.gigamonkeys.prose-diff.asd
com.gigamonkeys.prose-diff/packages.lisp
com.gigamonkeys.prose-diff/lcs.lisp
com.gigamonkeys.prose-diff/tokenize.lisp
com.gigamonkeys.prose-diff/text.lisp
com.gigamonkeys.prose-diff/utilities.lisp
com.gigamonkeys.prose-diff/diff.lisp
com.gigamonkeys.prose-diff/html.lisp
com.gigamonkeys.prose-diff/com.gigamonkeys.prose-diff.asd
com.gigamonkeys.prose-diff
(system).
com.gigamonkeys.prose-diff/packages.lisp
com.gigamonkeys.prose-diff
(system).
com.gigamonkeys.prose-diff/lcs.lisp
packages.lisp
(file).
com.gigamonkeys.prose-diff
(system).
%lcs-table
(function).
lcs
(function).
lcs-length
(function).
lcs-positions
(function).
one-way-similarity
(function).
similarity
(function).
com.gigamonkeys.prose-diff/tokenize.lisp
packages.lisp
(file).
com.gigamonkeys.prose-diff
(system).
initialize-instance
(method).
print-object
(method).
print-object
(method).
*short-length*
(special variable).
as-pairs
(function).
chunk
(class).
clean-adds-and-deletes
(function).
clean-empties
(function).
cleaned-diff-output
(function).
combine-chunks
(function).
dediff
(function).
diff-pair
(function).
diff-to-markup
(function).
diff-to-markup/no-moves
(function).
edited
(reader method).
empty-chunk-p
(function).
establish-pairs
(function).
extract
(function).
find-most-refining
(function).
find-most-similar
(function).
finer-grained-p
(function).
has-nested-add-or-delete-p
(function).
identical-p
(function).
make-chunk
(function).
make-empty-chunk
(function).
mark-moves
(function).
markup
(reader method).
(setf markup)
(writer method).
most-similar
(reader method).
(setf most-similar)
(writer method).
nested-tags
(function).
original
(reader method).
pair
(reader method).
(setf pair)
(writer method).
pair
(class).
pair-adds-and-deletes
(function).
pair-chunks
(function).
pair-identical
(function).
pair-symmetrical
(function).
paragraphs
(function).
part-of-diff-p
(function).
promote-tag
(function).
refinement
(function).
remove-empties
(function).
remove-tag
(function).
rewrite-adds-and-deletes
(function).
set-most-similar
(function).
show-pairing
(function).
symmetrical-p
(function).
textified
(reader method).
undiffed
(function).
unpair
(function).
unpair-asymmetrical
(function).
unpair-short
(function).
com.gigamonkeys.prose-diff/text.lisp
packages.lisp
(file).
com.gigamonkeys.prose-diff
(system).
print-object
(method).
%detextify-markup
(function).
%textify-markup
(generic function).
*interned-text*
(special variable).
*token-scanner*
(special variable).
add-property
(function).
clear-interned-text
(function).
detextify-markup
(function).
diff-textified
(function).
has-property-p
(function).
intern-text
(function).
new-open-p
(function).
propertied-text
(class).
properties
(reader method).
(setf properties)
(writer method).
remove-properties
(function).
text
(reader method).
(setf text)
(writer method).
textify-markup
(function).
tokenize-text
(function).
unopen
(function).
com.gigamonkeys.prose-diff/utilities.lisp
packages.lisp
(file).
com.gigamonkeys.prose-diff
(system).
concatenate-vectors
(function).
longer
(function).
map-tree
(function).
maximum
(function).
split-list
(function).
take
(function).
vector-push-extend*
(function).
com.gigamonkeys.prose-diff/diff.lisp
packages.lisp
(file).
com.gigamonkeys.prose-diff
(system).
diff-vectors
(function).
emit-diffs
(function).
com.gigamonkeys.prose-diff/html.lisp
packages.lisp
(file).
com.gigamonkeys.prose-diff
(system).
*retagger*
(special variable).
block-element-p
(function).
commentref->html
(function).
comments->html
(function).
diff-to-html
(function).
extract-comments
(function).
remove-comments
(function).
wrap-add-delete
(function).
Packages are listed by definition order.
com.gigamonkeys.prose-diff
cl-ppcre
.
com.gigamonkeys.markup
.
com.gigamonkeys.markup.html
.
com.gigamonkeys.pathnames
.
com.gigamonkeys.utilities
.
common-lisp
.
%detextify-markup
(function).
%lcs-table
(function).
%textify-markup
(generic function).
*interned-text*
(special variable).
*retagger*
(special variable).
*short-length*
(special variable).
*token-scanner*
(special variable).
add-property
(function).
as-pairs
(function).
block-element-p
(function).
chunk
(class).
clean-adds-and-deletes
(function).
clean-empties
(function).
cleaned-diff-output
(function).
clear-interned-text
(function).
combine-chunks
(function).
commentref->html
(function).
comments->html
(function).
concatenate-vectors
(function).
dediff
(function).
detextify-markup
(function).
diff-pair
(function).
diff-textified
(function).
diff-to-html
(function).
diff-to-markup
(function).
diff-to-markup/no-moves
(function).
diff-vectors
(function).
edited
(generic reader).
emit-diffs
(function).
empty-chunk-p
(function).
establish-pairs
(function).
extract
(function).
extract-comments
(function).
find-most-refining
(function).
find-most-similar
(function).
finer-grained-p
(function).
has-nested-add-or-delete-p
(function).
has-property-p
(function).
identical-p
(function).
intern-text
(function).
lcs
(function).
lcs-length
(function).
lcs-positions
(function).
longer
(function).
make-chunk
(function).
make-empty-chunk
(function).
map-tree
(function).
mark-moves
(function).
markup
(generic reader).
(setf markup)
(generic writer).
maximum
(function).
most-similar
(generic reader).
(setf most-similar)
(generic writer).
nested-tags
(function).
new-open-p
(function).
one-way-similarity
(function).
original
(generic reader).
pair
(generic reader).
(setf pair)
(generic writer).
pair
(class).
pair-adds-and-deletes
(function).
pair-chunks
(function).
pair-identical
(function).
pair-symmetrical
(function).
paragraphs
(function).
part-of-diff-p
(function).
promote-tag
(function).
propertied-text
(class).
properties
(generic reader).
(setf properties)
(generic writer).
refinement
(function).
remove-comments
(function).
remove-empties
(function).
remove-properties
(function).
remove-tag
(function).
rewrite-adds-and-deletes
(function).
set-most-similar
(function).
show-pairing
(function).
similarity
(function).
split-list
(function).
symmetrical-p
(function).
take
(function).
text
(generic reader).
(setf text)
(generic writer).
textified
(generic reader).
textify-markup
(function).
tokenize-text
(function).
undiffed
(function).
unopen
(function).
unpair
(function).
unpair-asymmetrical
(function).
unpair-short
(function).
vector-push-extend*
(function).
wrap-add-delete
(function).
Definitions are sorted by export status, category, package, and then by lexicographic order.
Compute the MxN table from which we can extract the LCS, and a bunch of other good stuff.
Convert a vector of propertied-text object (such as produced by textify-markup into a list of Markup sexps.
Diff two vectors of propertied-text, returning a single vector containing the diff as propertied-text.
Diff two vectors returning a vector with the elements of old and new wrapped in conses whose CAR is either :LCS, :DELETE, or :ADD. Optionally frob the computed LCS before computing the diff.
Establish the pairing between two lists of chunks.
Find all the what elements in markup.
Is the new-diff finer-grained than the original?
Tree has a nested :add or :delete tag and it’s not the only tag. Returns which one it is since there should only be one or the other.
Compute the longest common subsequence of vectors ‘a’ and ‘b’
Compute the length of the longest common subsequence of vectors ‘a’ and ‘b’
Find the indices in a and b of the elements of the LCS.
Map fn down tree, replacing each element of the tree with the return value of fn. When the return value is identical to the original sub-tree it is recursively mapped.
Take the output of diff-to-markup/no-moves and find the adds and deletes which are actually moves.
Give a tree like ’(:a (:b (:c ...))) the nested tags are (:a :b :c)
Like ‘similarity’ but in only one direction.
Split file into chunks, one per paragraph.
Remove empty sub-trees from tree.
Rewrite the Markup tree so that :add and :delete tags are moved out as far as possible. E.g. given (:p (:add something)) we tranform it to: (:add (:p something)).
Make each chunk in original and edited point to the most similar chunk on the other side unless they have already been paired with an identical chunk.
Compute the similarity of vectors ‘a’ and ‘b’ in terms of the average of the ratios of the length of the LCS to their length.
Return a list of of the first n values of list and the left-over tail as a secondary value.
Convert a list of Markup sexps into a vector of interned propertied-text objects.
Split a text string into a list of tokens containing either all the text split into words, whitespace, and punctuation or just the words.
Unpair very short chunks.
Push all the elements of ‘list’ onto v as if by vector-push-extend
propertied-text
)) ¶automatically generated reader method
propertied-text
)) ¶automatically generated writer method
propertied-text
)) ¶automatically generated reader method
propertied-text
)) ¶automatically generated writer method
Jump to: | %
(
A B C D E F G H I L M N O P R S T U V W |
---|
Jump to: | %
(
A B C D E F G H I L M N O P R S T U V W |
---|
Jump to: | *
E M O P S T |
---|
Jump to: | *
E M O P S T |
---|
Jump to: | C D F H L P S T U |
---|
Jump to: | C D F H L P S T U |
---|