This step depends upon having some notion of a token from the old array being "equal" to one from the new array, and this notion of equality affects the results. Usually two tokens are equal if===considers them equal, but some of the diff functions use an alternative notion of equality ...
* Let a 'state' be a given position in each file {pos1, pos2}. An array * 'fp' keeps track of the best possible state (largest values of * {pos1, pos2}) that can be achieved for a given cost 'p' (# moves away * from k=0), as well as a linked list of what matches ...
Find the smallest set of single-tokeninsertionsanddeletionsneeded to transform the first array of tokens into the second. This step depends upon having some notion of a token from the old array being "equal" to one from the new array, and this notion of equality affects the results. Usually...
Find the smallest set of single-tokeninsertionsanddeletionsneeded to transform the first array of tokens into the second. This step depends upon having some notion of a token from the old array being "equal" to one from the new array, and this notion of equality affects the results. Usually...
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...
FAST_ARRAY_FREE(parents_oid, nparent); }strbuf_setlen(base, old_baselen); }static void skip_uninteresting(struct tree_desc *t, struct strbuf *base, struct diff_options *opt) { enum interesting match;while (t->size) { match = tree_entry_interesting(opt->repo->index, &t->entry, ...
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...
#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, ...
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....