LMMS
Loading...
Searching...
No Matches
juce::TextDiffHelpers Struct Reference

Classes

struct  StringRegion

Public Types

enum  { minLengthToMatch = 3 , maxComplexity = 16 * 1024 * 1024 }

Static Public Member Functions

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

Member Enumeration Documentation

◆ anonymous enum

anonymous enum
Enumerator
minLengthToMatch 
maxComplexity 

Member Function Documentation

◆ addDeletion()

void juce::TextDiffHelpers::addDeletion ( TextDiff & td,
int index,
int length )
inlinestatic

◆ addInsertion()

void juce::TextDiffHelpers::addInsertion ( TextDiff & td,
String::CharPointerType text,
int index,
int length )
inlinestatic

◆ diffRecursively()

void juce::TextDiffHelpers::diffRecursively ( TextDiff & td,
StringRegion a,
StringRegion b )
inlinestatic

◆ diffSkippingCommonStart()

void juce::TextDiffHelpers::diffSkippingCommonStart ( TextDiff & td,
StringRegion a,
StringRegion b )
inlinestatic

◆ findCommonSuffix()

int juce::TextDiffHelpers::findCommonSuffix ( String::CharPointerType a,
int lenA,
int & indexInA,
String::CharPointerType b,
int lenB,
int & indexInB )
inlinestaticnoexcept

◆ findLongestCommonSubstring() [1/2]

int juce::TextDiffHelpers::findLongestCommonSubstring ( String::CharPointerType a,
const int lenA,
int & indexInA,
String::CharPointerType b,
const int lenB,
int & indexInB )
inlinestaticnoexcept

◆ findLongestCommonSubstring() [2/2]

int juce::TextDiffHelpers::findLongestCommonSubstring ( String::CharPointerType a,
const int lenA,
int & indexInA,
String::CharPointerType b,
const int lenB,
int & indexInB,
const size_t scratchSpace,
int *const lines )
inlinestaticnoexcept

The documentation for this struct was generated from the following file: