What effect does the -d/--minimal option have with diff?

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
19
down vote

favorite
1












The diff implementation on OpenBSD has a non-standard -d option with the following documentation:




-d



Try very hard to produce a diff as small as possible. This may
consume a lot of processing power and memory when processing
large files with many changes.




The GNU diff implementation has the same option with the shorter documentation




-d, --minimal



try hard to find a smaller set of changes




From time to time I've used this option just to see if it generates output that is in any shape or form different from the same diff command without the option, but I've never seen any difference (no pun intended).



Could someone provide or point to an example where this option actually produces a different result from the same command without -d? Alternatively, if someone could explain the circumstances required for this option to kick in. I'm also uncertain whether "minimal" means "fewer lines of output" or "fewer hunks".



An uneducated guess is that it has to do with very large hunks.






diff







share|improve this question























  • unix.stackexchange.com/questions/472528 piqued your curiosity did it? (-:
    – JdeBP
    18 hours ago










  • @JdeBP Yes indeed. It reminded me about this flag and the fact that I simply don't know what it does since I've never seen it do anything.
    – Kusalananda
    18 hours ago






  • 1




    info diff performance explains it IIRC
    – Stéphane Chazelas
    18 hours ago














up vote
19
down vote

favorite
1












The diff implementation on OpenBSD has a non-standard -d option with the following documentation:




-d



Try very hard to produce a diff as small as possible. This may
consume a lot of processing power and memory when processing
large files with many changes.




The GNU diff implementation has the same option with the shorter documentation




-d, --minimal



try hard to find a smaller set of changes




From time to time I've used this option just to see if it generates output that is in any shape or form different from the same diff command without the option, but I've never seen any difference (no pun intended).



Could someone provide or point to an example where this option actually produces a different result from the same command without -d? Alternatively, if someone could explain the circumstances required for this option to kick in. I'm also uncertain whether "minimal" means "fewer lines of output" or "fewer hunks".



An uneducated guess is that it has to do with very large hunks.






diff







share|improve this question























  • unix.stackexchange.com/questions/472528 piqued your curiosity did it? (-:
    – JdeBP
    18 hours ago










  • @JdeBP Yes indeed. It reminded me about this flag and the fact that I simply don't know what it does since I've never seen it do anything.
    – Kusalananda
    18 hours ago






  • 1




    info diff performance explains it IIRC
    – Stéphane Chazelas
    18 hours ago












up vote
19
down vote

favorite
1









up vote
19
down vote

favorite
1






1





The diff implementation on OpenBSD has a non-standard -d option with the following documentation:




-d



Try very hard to produce a diff as small as possible. This may
consume a lot of processing power and memory when processing
large files with many changes.




The GNU diff implementation has the same option with the shorter documentation




-d, --minimal



try hard to find a smaller set of changes




From time to time I've used this option just to see if it generates output that is in any shape or form different from the same diff command without the option, but I've never seen any difference (no pun intended).



Could someone provide or point to an example where this option actually produces a different result from the same command without -d? Alternatively, if someone could explain the circumstances required for this option to kick in. I'm also uncertain whether "minimal" means "fewer lines of output" or "fewer hunks".



An uneducated guess is that it has to do with very large hunks.






diff







share|improve this question















The diff implementation on OpenBSD has a non-standard -d option with the following documentation:




-d



Try very hard to produce a diff as small as possible. This may
consume a lot of processing power and memory when processing
large files with many changes.




The GNU diff implementation has the same option with the shorter documentation




-d, --minimal



try hard to find a smaller set of changes




From time to time I've used this option just to see if it generates output that is in any shape or form different from the same diff command without the option, but I've never seen any difference (no pun intended).



Could someone provide or point to an example where this option actually produces a different result from the same command without -d? Alternatively, if someone could explain the circumstances required for this option to kick in. I'm also uncertain whether "minimal" means "fewer lines of output" or "fewer hunks".



An uneducated guess is that it has to do with very large hunks.






diff




diff






share|improve this question















share|improve this question













share|improve this question




share|improve this question








edited 4 mins ago









muru

33.8k577146




33.8k577146










asked 19 hours ago









Kusalananda

108k14209332




108k14209332











  • unix.stackexchange.com/questions/472528 piqued your curiosity did it? (-:
    – JdeBP
    18 hours ago










  • @JdeBP Yes indeed. It reminded me about this flag and the fact that I simply don't know what it does since I've never seen it do anything.
    – Kusalananda
    18 hours ago






  • 1




    info diff performance explains it IIRC
    – Stéphane Chazelas
    18 hours ago
















  • unix.stackexchange.com/questions/472528 piqued your curiosity did it? (-:
    – JdeBP
    18 hours ago










  • @JdeBP Yes indeed. It reminded me about this flag and the fact that I simply don't know what it does since I've never seen it do anything.
    – Kusalananda
    18 hours ago






  • 1




    info diff performance explains it IIRC
    – Stéphane Chazelas
    18 hours ago















unix.stackexchange.com/questions/472528 piqued your curiosity did it? (-:
– JdeBP
18 hours ago




unix.stackexchange.com/questions/472528 piqued your curiosity did it? (-:
– JdeBP
18 hours ago












@JdeBP Yes indeed. It reminded me about this flag and the fact that I simply don't know what it does since I've never seen it do anything.
– Kusalananda
18 hours ago




@JdeBP Yes indeed. It reminded me about this flag and the fact that I simply don't know what it does since I've never seen it do anything.
– Kusalananda
18 hours ago




1




1




info diff performance explains it IIRC
– Stéphane Chazelas
18 hours ago




info diff performance explains it IIRC
– Stéphane Chazelas
18 hours ago










1 Answer
1






active

oldest

votes

















up vote
12
down vote



accepted










In GNU diff, also used on FreeBSD, the --minimal flag triggers an algorithm variation by Paul Eggert that causes it "to limit the cost to O(N**1.5 log N) at the price of producing suboptimal output for large inputs with differences". More specifically, it causes it to not apply several heuristics that deal in finding merely close to optimal solutions and in throwing out "confusing" lines as extra differences.



In OpenBSD diff, which uses the older Unix diff algorithm from the 1970s, the algorithm employed is credited to Harold Stone, and the --minimal flag triggers a search that is (effectively un-) bounded by the maximum value of an unsigned integer instead of by the square root of the size of the range of lines being compared (or 256 if it is greater).



Further reading



  • Eugene W. Myers (November 1986). "An O(ND) difference algorithm and its variations". Algorithmica. Volume 1. Issue 1–4. pp. 251–266. DOI 10.1007/BF01840446.

  • J. W. Hunt and M. D. McIlroy (June 1976). "An Algorithm for Differential File Comparison". Report 41. Computing Science. Bell Laboratories.

  • Richard Hartman (1988-01-13). Unix diff(1) algorithm.
    23225@cca.CCA.COM. comp.unix.questions.

  • https://github.com/openbsd/src/blob/d1e24f318523607c98dc6fbe5a06a5d9e5c87293/usr.bin/diff/diffreg.c#L93

  • https://github.com/freebsd/freebsd/blob/40ec4fdc9a74bfdb83f13672acdb88af5c91ab46/contrib/diff/src/analyze.c#L23

  • Comprehensive review of diff algorithms, their history and implementations





share|improve this answer






















  • When I created a better diff from the UNIX sources, I checked that OpenBSD enhancement and could not find any better results. Note that the original stone() function uses: ` } while ((y = b[++j]) > 0);` and BTW: for normal file sizes, my enhanced UNIX diff is faster than GNU diff.
    – schily
    17 hours ago










  • Thanks for the references!
    – Kusalananda
    13 hours ago










Your Answer







StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "106"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);

else
createEditor();

);

function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
convertImagesToLinks: false,
noModals: false,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);



);













 

draft saved


draft discarded


















StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2funix.stackexchange.com%2fquestions%2f472540%2fwhat-effect-does-the-d-minimal-option-have-with-diff%23new-answer', 'question_page');

);

Post as a guest

















1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes








up vote
12
down vote



accepted










In GNU diff, also used on FreeBSD, the --minimal flag triggers an algorithm variation by Paul Eggert that causes it "to limit the cost to O(N**1.5 log N) at the price of producing suboptimal output for large inputs with differences". More specifically, it causes it to not apply several heuristics that deal in finding merely close to optimal solutions and in throwing out "confusing" lines as extra differences.



In OpenBSD diff, which uses the older Unix diff algorithm from the 1970s, the algorithm employed is credited to Harold Stone, and the --minimal flag triggers a search that is (effectively un-) bounded by the maximum value of an unsigned integer instead of by the square root of the size of the range of lines being compared (or 256 if it is greater).



Further reading



  • Eugene W. Myers (November 1986). "An O(ND) difference algorithm and its variations". Algorithmica. Volume 1. Issue 1–4. pp. 251–266. DOI 10.1007/BF01840446.

  • J. W. Hunt and M. D. McIlroy (June 1976). "An Algorithm for Differential File Comparison". Report 41. Computing Science. Bell Laboratories.

  • Richard Hartman (1988-01-13). Unix diff(1) algorithm.
    23225@cca.CCA.COM. comp.unix.questions.

  • https://github.com/openbsd/src/blob/d1e24f318523607c98dc6fbe5a06a5d9e5c87293/usr.bin/diff/diffreg.c#L93

  • https://github.com/freebsd/freebsd/blob/40ec4fdc9a74bfdb83f13672acdb88af5c91ab46/contrib/diff/src/analyze.c#L23

  • Comprehensive review of diff algorithms, their history and implementations





share|improve this answer






















  • When I created a better diff from the UNIX sources, I checked that OpenBSD enhancement and could not find any better results. Note that the original stone() function uses: ` } while ((y = b[++j]) > 0);` and BTW: for normal file sizes, my enhanced UNIX diff is faster than GNU diff.
    – schily
    17 hours ago










  • Thanks for the references!
    – Kusalananda
    13 hours ago














up vote
12
down vote



accepted










In GNU diff, also used on FreeBSD, the --minimal flag triggers an algorithm variation by Paul Eggert that causes it "to limit the cost to O(N**1.5 log N) at the price of producing suboptimal output for large inputs with differences". More specifically, it causes it to not apply several heuristics that deal in finding merely close to optimal solutions and in throwing out "confusing" lines as extra differences.



In OpenBSD diff, which uses the older Unix diff algorithm from the 1970s, the algorithm employed is credited to Harold Stone, and the --minimal flag triggers a search that is (effectively un-) bounded by the maximum value of an unsigned integer instead of by the square root of the size of the range of lines being compared (or 256 if it is greater).



Further reading



  • Eugene W. Myers (November 1986). "An O(ND) difference algorithm and its variations". Algorithmica. Volume 1. Issue 1–4. pp. 251–266. DOI 10.1007/BF01840446.

  • J. W. Hunt and M. D. McIlroy (June 1976). "An Algorithm for Differential File Comparison". Report 41. Computing Science. Bell Laboratories.

  • Richard Hartman (1988-01-13). Unix diff(1) algorithm.
    23225@cca.CCA.COM. comp.unix.questions.

  • https://github.com/openbsd/src/blob/d1e24f318523607c98dc6fbe5a06a5d9e5c87293/usr.bin/diff/diffreg.c#L93

  • https://github.com/freebsd/freebsd/blob/40ec4fdc9a74bfdb83f13672acdb88af5c91ab46/contrib/diff/src/analyze.c#L23

  • Comprehensive review of diff algorithms, their history and implementations





share|improve this answer






















  • When I created a better diff from the UNIX sources, I checked that OpenBSD enhancement and could not find any better results. Note that the original stone() function uses: ` } while ((y = b[++j]) > 0);` and BTW: for normal file sizes, my enhanced UNIX diff is faster than GNU diff.
    – schily
    17 hours ago










  • Thanks for the references!
    – Kusalananda
    13 hours ago












up vote
12
down vote



accepted







up vote
12
down vote



accepted






In GNU diff, also used on FreeBSD, the --minimal flag triggers an algorithm variation by Paul Eggert that causes it "to limit the cost to O(N**1.5 log N) at the price of producing suboptimal output for large inputs with differences". More specifically, it causes it to not apply several heuristics that deal in finding merely close to optimal solutions and in throwing out "confusing" lines as extra differences.



In OpenBSD diff, which uses the older Unix diff algorithm from the 1970s, the algorithm employed is credited to Harold Stone, and the --minimal flag triggers a search that is (effectively un-) bounded by the maximum value of an unsigned integer instead of by the square root of the size of the range of lines being compared (or 256 if it is greater).



Further reading



  • Eugene W. Myers (November 1986). "An O(ND) difference algorithm and its variations". Algorithmica. Volume 1. Issue 1–4. pp. 251–266. DOI 10.1007/BF01840446.

  • J. W. Hunt and M. D. McIlroy (June 1976). "An Algorithm for Differential File Comparison". Report 41. Computing Science. Bell Laboratories.

  • Richard Hartman (1988-01-13). Unix diff(1) algorithm.
    23225@cca.CCA.COM. comp.unix.questions.

  • https://github.com/openbsd/src/blob/d1e24f318523607c98dc6fbe5a06a5d9e5c87293/usr.bin/diff/diffreg.c#L93

  • https://github.com/freebsd/freebsd/blob/40ec4fdc9a74bfdb83f13672acdb88af5c91ab46/contrib/diff/src/analyze.c#L23

  • Comprehensive review of diff algorithms, their history and implementations





share|improve this answer














In GNU diff, also used on FreeBSD, the --minimal flag triggers an algorithm variation by Paul Eggert that causes it "to limit the cost to O(N**1.5 log N) at the price of producing suboptimal output for large inputs with differences". More specifically, it causes it to not apply several heuristics that deal in finding merely close to optimal solutions and in throwing out "confusing" lines as extra differences.



In OpenBSD diff, which uses the older Unix diff algorithm from the 1970s, the algorithm employed is credited to Harold Stone, and the --minimal flag triggers a search that is (effectively un-) bounded by the maximum value of an unsigned integer instead of by the square root of the size of the range of lines being compared (or 256 if it is greater).



Further reading



  • Eugene W. Myers (November 1986). "An O(ND) difference algorithm and its variations". Algorithmica. Volume 1. Issue 1–4. pp. 251–266. DOI 10.1007/BF01840446.

  • J. W. Hunt and M. D. McIlroy (June 1976). "An Algorithm for Differential File Comparison". Report 41. Computing Science. Bell Laboratories.

  • Richard Hartman (1988-01-13). Unix diff(1) algorithm.
    23225@cca.CCA.COM. comp.unix.questions.

  • https://github.com/openbsd/src/blob/d1e24f318523607c98dc6fbe5a06a5d9e5c87293/usr.bin/diff/diffreg.c#L93

  • https://github.com/freebsd/freebsd/blob/40ec4fdc9a74bfdb83f13672acdb88af5c91ab46/contrib/diff/src/analyze.c#L23

  • Comprehensive review of diff algorithms, their history and implementations






share|improve this answer














share|improve this answer



share|improve this answer








edited 9 hours ago









bishop

1,7932719




1,7932719










answered 17 hours ago









JdeBP

29.9k462137




29.9k462137











  • When I created a better diff from the UNIX sources, I checked that OpenBSD enhancement and could not find any better results. Note that the original stone() function uses: ` } while ((y = b[++j]) > 0);` and BTW: for normal file sizes, my enhanced UNIX diff is faster than GNU diff.
    – schily
    17 hours ago










  • Thanks for the references!
    – Kusalananda
    13 hours ago
















  • When I created a better diff from the UNIX sources, I checked that OpenBSD enhancement and could not find any better results. Note that the original stone() function uses: ` } while ((y = b[++j]) > 0);` and BTW: for normal file sizes, my enhanced UNIX diff is faster than GNU diff.
    – schily
    17 hours ago










  • Thanks for the references!
    – Kusalananda
    13 hours ago















When I created a better diff from the UNIX sources, I checked that OpenBSD enhancement and could not find any better results. Note that the original stone() function uses: ` } while ((y = b[++j]) > 0);` and BTW: for normal file sizes, my enhanced UNIX diff is faster than GNU diff.
– schily
17 hours ago




When I created a better diff from the UNIX sources, I checked that OpenBSD enhancement and could not find any better results. Note that the original stone() function uses: ` } while ((y = b[++j]) > 0);` and BTW: for normal file sizes, my enhanced UNIX diff is faster than GNU diff.
– schily
17 hours ago












Thanks for the references!
– Kusalananda
13 hours ago




Thanks for the references!
– Kusalananda
13 hours ago

















 

draft saved


draft discarded















































 


draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2funix.stackexchange.com%2fquestions%2f472540%2fwhat-effect-does-the-d-minimal-option-have-with-diff%23new-answer', 'question_page');

);

Post as a guest
































































Comments

Post a Comment

Popular posts from this blog

Long meetings (6-7 hours a day): Being “babysat” by supervisor

Image
Clash Royale CLAN TAG #URR8PPP .everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty margin-bottom:0; up vote 31 down vote favorite 4 I hold a PhD in mechanical engineering with a 7 year background in self-guided, self-paced research including 2 years as a graduate level course instructor and a subject matter expert for various engineering projects in a university setting in the United States. For the last 10-11 months, I am working in a research industry in France where my task is to debug C++ spaghetti code written over a period of several years by my current supervisor. It is a team of 2: just I and my supervisor. Diurnally, I am posed with a "bug of the day" to get out of this C++ code. My supervisor generally gives me about 15-30 minutes to solve it and then accosts me about whether or not the task is completed and then rinses and repeats this until the end of the day. Off-late, my supervisor has been holding 6-7 hour long "meetin
Read more

Is the Concept of Multiple Fantasy Races Scientifically Flawed? [closed]

Image
Clash Royale CLAN TAG #URR8PPP up vote 2 down vote favorite Many fantasy worlds have multiple humanoid species (elves, orcs, humans, etc) living in the same world, in addition to that, they often have the ability to interbreed. And I can't help but question their believability... fantasy-races reproduction interspecies-relations share | improve this question edited Aug 9 at 14:46 Michael Kjörling ♦ 21.1k 10 85 161 asked Aug 9 at 13:13 Chlodio 118 6 closed as unclear what you're asking by MichaelK, Gryphon, John, Vincent, Frostfyre Aug 9 at 15:25 Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question. 3 Stack Exchange exist to
Read more

Confectionery

Image
Prepared foods made with a lot of sugar or other cabohydrates "Sweetmeat" redirects here. For the racehorse, see Sweetmeat (horse). Not to be confused with Sweetbread. This Kransekake is a traditional Scandinavian baker's confection. Confectionery is the art of making confections , which are food items that are rich in sugar and carbohydrates. Exact definitions are difficult. [1] In general, though, confectionery is divided into two broad and somewhat overlapping categories, bakers' confections and sugar confections. [2] Bakers' confectionery, also called flour confections , includes principally sweet pastries, cakes, and similar baked goods. Sugar confectionery includes candies ( sweets in British English), candied nuts, chocolates, chewing gum, bubble gum, pastillage, and other confections that are made primarily of sugar. In some cases, chocolate confections (confections made of chocolate) are treated as a separate category, as are sugar-free versions of
Read more