Git Manpages/Translations — Polish @ Hosted Weblate: 1 A

The translation is temporarily closed for contributions due to maintenance, please come back later.
The translation was automatically locked due to following alerts: Could not merge the repository. Could not parse translation files.

Contributing to this translation requires agreeing to its contributor agreement.

Zen

Translation

English type: delimited block -

Polish

Needs editing

This translation is currently locked.

Skip

	English	Polish	Actions
	Algorithm
	The general idea is this: we generate a cost matrix between the commits in both commit ranges, then solve the least-cost assignment.
	The cost matrix is populated thusly: for each pair of commits, both diffs are generated and the "diff of diffs" is generated, with 3 context lines, then the number of lines in that diff is used as cost.
	To avoid false positives (e.g. when a patch has been removed, and an unrelated patch has been added between two iterations of the same patch series), the cost matrix is extended to allow for that, by adding fixed-cost entries for wholesale deletes/adds.
	Example: Let commits `1--2` be the first iteration of a patch series and `A--C` the second iteration. Let's assume that `A` is a cherry-pick of `2,` and `C` is a cherry-pick of `1` but with a small modification (say, a fixed typo). Visualize the commits as a bipartite graph:
	1 A	B D / / ---X---A
	2 B	B D / / ---X---A
	C
	We are looking for a "best" explanation of the new series in terms of the old one. We can represent an "explanation" as an edge in the graph:
	1 A / 2 --------' B	.----W / / -----H----I
	This explanation comes for "free" because there was no change. Similarly `C` could be explained using `1`, but that comes at some cost c>0 because of the modification: