@@ -k,l +n,m @@TEXTThisiscalled a hunk header. The"TEXT"portionisbydefaultalinethat beginswithan alphabet, an underscoreora dollar sign; this matches what GNU diff -p output uses. Thisdefaultselection howeverisnotsuitedforsome contents,andyou canusea customized patterntomake a selection. Fi...
maxEditLength: a number specifying the maximum edit distance to consider between the old and new texts. If the edit distance is higher than this, jsdiff will returnundefinedinstead of a diff. You can use this to limit the computational cost of diffing large, very different texts by giving u...
maxEditLength: a number specifying the maximum edit distance to consider between the old and new texts. You can use this to limit the computational cost of diffing large, very different texts by giving up early if the cost will be huge. This option can be passed either to diffing functions...
maxEditLength: a number specifying the maximum edit distance to consider between the old and new texts. You can use this to limit the computational cost of diffing large, very different texts by giving up early if the cost will be huge. This option can be passed either to diffing functions...
Compute a list of patches to turn text1 into text2. text2 is not provided, diffs are the delta between text1 and text2. Parameters: text1 - Old text. diffs - Array of Diff objects for text1 to text2. Returns: LinkedList of Patch objects. patchDeepCopy public LinkedList<DiffMatchPatch...
* D(T,Pj) - diff between T..Pj * D(T,P1...Pn) - combined diff from T to parents P1,...,Pn * * * We start from all trees, which are sorted, and compare their entries in * lock-step: * * T P1 Pn * - - -
#define FAST_ARRAY_FREE(x, nr) do { \ if ((nr) <= 2) \ xalloca_free((x)); \ else \ free((x)); \ } while(0) static struct combine_diff_path *ll_diff_tree_paths( struct combine_diff_path *p, const struct object_id *oid, ...
The following patience_sort function takes an array of Match objects and returns a linked list representing the longest increasing subsequence on b_line value. It does this by iterating over matches and assigning each match to a place in the stacks array. binary_search finds which position to ...
int depth) { struct tree_desc t, *tp; void *ttree, **tptree; int i; if (depth > max_allowed_tree_depth) die("exceeded maximum allowed tree depth"); FAST_ARRAY_ALLOC(tp, nparent); FAST_ARRAY_ALLOC(tptree, nparent); /* * load parents first, as they are probably already cached...
MTKTextureLoaderArrayCallback completionHandler); public void FromNames (string[] names, nfloat scaleFactor, AppKit.NSDisplayGamut displayGamut, Foundation.NSBundle bundle, MTKTextureLoaderOptions options, MTKTextureLoaderArrayCallback completionHandler); public virtual System.Threading.Tasks.Task<Metal....