|
enum | { minLengthToMatch = 3
, maxComplexity = 16 * 1024 * 1024
} |
|
|
static void | addInsertion (TextDiff &td, String::CharPointerType text, int index, int length) |
|
static void | addDeletion (TextDiff &td, int index, int length) |
|
static void | diffSkippingCommonStart (TextDiff &td, StringRegion a, StringRegion b) |
|
static void | diffRecursively (TextDiff &td, StringRegion a, StringRegion b) |
|
static int | findLongestCommonSubstring (String::CharPointerType a, const int lenA, int &indexInA, String::CharPointerType b, const int lenB, int &indexInB) noexcept |
|
static int | findLongestCommonSubstring (String::CharPointerType a, const int lenA, int &indexInA, String::CharPointerType b, const int lenB, int &indexInB, const size_t scratchSpace, int *const lines) noexcept |
|
static int | findCommonSuffix (String::CharPointerType a, int lenA, int &indexInA, String::CharPointerType b, int lenB, int &indexInB) noexcept |
|
Definition at line 26 of file juce_TextDiff.cpp.
◆ anonymous enum
◆ addInsertion()
◆ addDeletion()
static void juce::TextDiffHelpers::addDeletion |
( |
TextDiff & |
td, |
|
|
int |
index, |
|
|
int |
length |
|
) |
| |
|
inlinestatic |
◆ diffSkippingCommonStart()
◆ diffRecursively()
◆ findLongestCommonSubstring() [1/2]
◆ findLongestCommonSubstring() [2/2]
◆ findCommonSuffix()
The documentation for this struct was generated from the following file: