Skip navigation links
C D E F H L M O P S T V 

C

chars1 - Variable in class fun.mike.dmp.LinesToCharsResult
 
chars2 - Variable in class fun.mike.dmp.LinesToCharsResult
 

D

Diff - Class in fun.mike.dmp
Class representing one diff operation.
Diff(Operation, String) - Constructor for class fun.mike.dmp.Diff
Constructor.
diff_bisect(String, String, long) - Method in class fun.mike.dmp.DiffMatchPatch
Find the 'middle snake' of a diff, split the problem in two and return the recursively constructed diff.
diff_charsToLines(LinkedList<Diff>, List<String>) - Method in class fun.mike.dmp.DiffMatchPatch
Rehydrate the dmp in a diff from a string of line hashes to real lines of dmp.
diff_cleanupEfficiency(LinkedList<Diff>) - Method in class fun.mike.dmp.DiffMatchPatch
Reduce the number of edits by eliminating operationally trivial equalities.
diff_cleanupMerge(LinkedList<Diff>) - Method in class fun.mike.dmp.DiffMatchPatch
Reorder and merge like edit sections.
diff_cleanupSemanticLossless(LinkedList<Diff>) - Method in class fun.mike.dmp.DiffMatchPatch
Look for single edits surrounded on both sides by equalities which can be shifted sideways to align the edit to a word boundary.
diff_commonOverlap(String, String) - Method in class fun.mike.dmp.DiffMatchPatch
Determine if the suffix of one string is the prefix of another.
Diff_EditCost - Variable in class fun.mike.dmp.DiffMatchPatch
Cost of an empty edit operation in terms of edit characters.
diff_halfMatch(String, String) - Method in class fun.mike.dmp.DiffMatchPatch
Do the two texts share a substring which is at least half the length of the longer dmp? This speedup can produce non-minimal diffs.
diff_levenshtein(LinkedList<Diff>) - Method in class fun.mike.dmp.DiffMatchPatch
Compute the Levenshtein distance; the number of inserted, deleted or substituted characters.
diff_lineMode(String, String, long) - Method in class fun.mike.dmp.DiffMatchPatch
Do a quick line-level diff on both strings, then rediff the parts for greater accuracy.
diff_linesToChars(String, String) - Method in class fun.mike.dmp.DiffMatchPatch
Split two texts into a list of strings.
diff_main(String, String) - Method in class fun.mike.dmp.DiffMatchPatch
Find the differences between two texts.
diff_main(String, String, boolean) - Method in class fun.mike.dmp.DiffMatchPatch
Find the differences between two texts.
diff_text1(LinkedList<Diff>) - Method in class fun.mike.dmp.DiffMatchPatch
Compute and return the source dmp (all equalities and deletions).
diff_text2(LinkedList<Diff>) - Method in class fun.mike.dmp.DiffMatchPatch
Compute and return the destination dmp (all equalities and insertions).
Diff_Timeout - Variable in class fun.mike.dmp.DiffMatchPatch
Number of seconds to map a diff before giving up (0 for infinity).
diff_toDelta(LinkedList<Diff>) - Method in class fun.mike.dmp.DiffMatchPatch
Crush the diff into an encoded string which describes the operations required to transform text1 into text2.
diff_xIndex(LinkedList<Diff>, int) - Method in class fun.mike.dmp.DiffMatchPatch
loc is a location in text1, compute and return the equivalent location in text2.
diffCleanupSemantic(LinkedList<Diff>) - Method in class fun.mike.dmp.DiffMatchPatch
Reduce the number of edits by eliminating semantically trivial equalities.
diffCommonPrefix(String, String) - Method in class fun.mike.dmp.DiffMatchPatch
Determine the common prefix of two strings
diffCommonSuffix(String, String) - Method in class fun.mike.dmp.DiffMatchPatch
Determine the common suffix of two strings
diffFromDelta(String, String) - Method in class fun.mike.dmp.DiffMatchPatch
Given the original text1, and an encoded string which describes the operations required to transform text1 into text2, compute the full diff.
DiffMatchPatch - Class in fun.mike.dmp
Class containing the diff, match and patch methods.
DiffMatchPatch() - Constructor for class fun.mike.dmp.DiffMatchPatch
 
diffPrettyHtml(LinkedList<Diff>) - Method in class fun.mike.dmp.DiffMatchPatch
Convert a Diff list into a pretty HTML report.
diffs - Variable in class fun.mike.dmp.Patch
 

E

equals(Object) - Method in class fun.mike.dmp.Diff
Is this Diff equivalent to another Diff?

F

fun.mike.dmp - package fun.mike.dmp
 

H

hashCode() - Method in class fun.mike.dmp.Diff
Create a numeric hash value for a Diff.

L

length1 - Variable in class fun.mike.dmp.Patch
 
length2 - Variable in class fun.mike.dmp.Patch
 
lineArray - Variable in class fun.mike.dmp.LinesToCharsResult
 
LinesToCharsResult - Class in fun.mike.dmp
Internal class for returning results from diff_linesToChars().
LinesToCharsResult(String, String, List<String>) - Constructor for class fun.mike.dmp.LinesToCharsResult
 

M

match_alphabet(String) - Method in class fun.mike.dmp.DiffMatchPatch
Initialise the alphabet for the Bitap algorithm.
match_bitap(String, String, int) - Method in class fun.mike.dmp.DiffMatchPatch
Locate the best instance of 'pattern' in 'dmp' near 'loc' using the Bitap algorithm.
Match_Distance - Variable in class fun.mike.dmp.DiffMatchPatch
How far to search for a match (0 = exact location, 1000+ = broad match).
match_main(String, String, int) - Method in class fun.mike.dmp.DiffMatchPatch
Locate the best instance of 'pattern' in 'dmp' near 'loc'.
Match_Threshold - Variable in class fun.mike.dmp.DiffMatchPatch
At what point is no match declared (0.0 = perfection, 1.0 = very loose).

O

operation - Variable in class fun.mike.dmp.Diff
One of: INSERT, DELETE or EQUAL.
Operation - Enum in fun.mike.dmp
 

P

Patch - Class in fun.mike.dmp
Class representing one patch operation.
Patch() - Constructor for class fun.mike.dmp.Patch
Constructor.
patch_addContext(Patch, String) - Method in class fun.mike.dmp.DiffMatchPatch
Increase the context until it is unique, but don't let the pattern expand beyond Match_MaxBits.
patch_addPadding(LinkedList<Patch>) - Method in class fun.mike.dmp.DiffMatchPatch
Add some padding on dmp start and end so that edges can match something.
patch_apply(LinkedList<Patch>, String) - Method in class fun.mike.dmp.DiffMatchPatch
Merge a set of patches onto the dmp.
patch_deepCopy(LinkedList<Patch>) - Method in class fun.mike.dmp.DiffMatchPatch
Given an array of patches, return another array that is identical.
Patch_DeleteThreshold - Variable in class fun.mike.dmp.DiffMatchPatch
When deleting a large block of dmp (over ~64 characters), how close do the contents have to be to match the expected contents.
patch_fromText(String) - Method in class fun.mike.dmp.DiffMatchPatch
Parse a textual representation of patches and return a List of Patch objects.
patch_make(String, String) - Method in class fun.mike.dmp.DiffMatchPatch
Compute a list of patches to turn text1 into text2.
patch_make(LinkedList<Diff>) - Method in class fun.mike.dmp.DiffMatchPatch
Compute a list of patches to turn text1 into text2.
patch_make(String, String, LinkedList<Diff>) - Method in class fun.mike.dmp.DiffMatchPatch
Deprecated.
Prefer patch_make(String text1, LinkedList<Diff> diffs).
patch_make(String, LinkedList<Diff>) - Method in class fun.mike.dmp.DiffMatchPatch
Compute a list of patches to turn text1 into text2.
Patch_Margin - Variable in class fun.mike.dmp.DiffMatchPatch
Chunk size for context length.
patch_splitMax(LinkedList<Patch>) - Method in class fun.mike.dmp.DiffMatchPatch
Look through the patches and break up any which are longer than the maximum limit of the match algorithm.
patch_toText(List<Patch>) - Method in class fun.mike.dmp.DiffMatchPatch
Take a list of patches and return a textual representation.

S

start1 - Variable in class fun.mike.dmp.Patch
 
start2 - Variable in class fun.mike.dmp.Patch
 

T

text - Variable in class fun.mike.dmp.Diff
The dmp associated with this diff operation.
toString() - Method in class fun.mike.dmp.Diff
Display a human-readable version of this Diff.
toString() - Method in class fun.mike.dmp.Patch
Emmulate GNU diff's format.

V

valueOf(String) - Static method in enum fun.mike.dmp.Operation
Returns the enum constant of this type with the specified name.
values() - Static method in enum fun.mike.dmp.Operation
Returns an array containing the constants of this enum type, in the order they are declared.
C D E F H L M O P S T V 
Skip navigation links

Copyright © 2018. All Rights Reserved.