<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en">\r
<head>\r
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8" />\r
-<meta name="generator" content="AsciiDoc 7.0.1" />\r
+<meta name="generator" content="AsciiDoc 7.0.2" />\r
<style type="text/css">\r
/* Debug borders */\r
p, li, dt, dd, div, pre, h1, h2, h3, h4, h5, h6 {\r
</div>\r
<h2>SYNOPSIS</h2>\r
<div class="sectionbody">\r
-<p><em>git-rev-list</em> [ --max-count=number ]\r
- [ --max-age=timestamp ]\r
- [ --min-age=timestamp ]\r
- [ --sparse ]\r
- [ --no-merges ]\r
- [ --all ]\r
- [ [ --merge-order [ --show-breaks ] ] | [ --topo-order ] | ]\r
- [ --parents ]\r
- [ --objects [ --unpacked ] ]\r
- [ --pretty | --header | ]\r
- [ --bisect ]\r
- <commit>… [ -- <paths>… ]</p>\r
+<div class="verseblock">\r
+<div class="content"><em>git-rev-list</em> [ --max-count=number ]\r
+ [ --max-age=timestamp ]\r
+ [ --min-age=timestamp ]\r
+ [ --sparse ]\r
+ [ --no-merges ]\r
+ [ --remove-empty ]\r
+ [ --all ]\r
+ [ --topo-order ]\r
+ [ --parents ]\r
+ [ [--objects | --objects-edge] [ --unpacked ] ]\r
+ [ --pretty | --header ]\r
+ [ --bisect ]\r
+ <commit>… [ -- <paths>… ]</div></div>\r
</div>\r
<h2>DESCRIPTION</h2>\r
<div class="sectionbody">\r
</p>\r
</dd>\r
<dt>\r
+--objects-edge\r
+</dt>\r
+<dd>\r
+<p>\r
+ Similar to <tt>--objects</tt>, but also print the IDs of\r
+ excluded commits refixed with a <tt>-</tt> character. This is\r
+ used by <tt>git-pack-objects</tt> to build <em>thin</em> pack, which\r
+ records objects in deltified form based on objects\r
+ contained in these excluded commits to reduce network\r
+ traffic.\r
+</p>\r
+</dd>\r
+<dt>\r
--unpacked\r
</dt>\r
<dd>\r
<p>\r
Limit output to the one commit object which is roughly halfway\r
between the included and excluded commits. Thus, if <em>git-rev-list\r
- --bisect foo <sup>bar </sup>baz</em> outputs <em>midpoint</em>, the output\r
+ --bisect foo ^bar ^baz</em> outputs <em>midpoint</em>, the output\r
of <em>git-rev-list foo ^midpoint</em> and <em>git-rev-list midpoint\r
- <sup>bar </sup>baz</em> would be of roughly the same length. Finding the change\r
+ ^bar ^baz</em> would be of roughly the same length.\r
+ Finding the change\r
which introduces a regression is thus reduced to a binary search:\r
repeatedly generate and test new 'midpoint's until the commit chain\r
is of length one.\r
</p>\r
</dd>\r
<dt>\r
+--remove-empty\r
+</dt>\r
+<dd>\r
+<p>\r
+ Stop when a given path disappears from the tree.\r
+</p>\r
+</dd>\r
+<dt>\r
--all\r
</dt>\r
<dd>\r
before their parents).\r
</p>\r
</dd>\r
-<dt>\r
---merge-order\r
-</dt>\r
-<dd>\r
-<p>\r
- When specified the commit history is decomposed into a unique\r
- sequence of minimal, non-linear epochs and maximal, linear epochs.\r
- Non-linear epochs are then linearised by sorting them into merge\r
- order, which is described below.\r
-</p>\r
-<p>Maximal, linear epochs correspond to periods of sequential development.\r
-Minimal, non-linear epochs correspond to periods of divergent development\r
-followed by a converging merge. The theory of epochs is described in more\r
-detail at\r
-<a href="http://blackcubes.dyndns.org/epoch/">http://blackcubes.dyndns.org/epoch/</a>.</p>\r
-<p>The merge order for a non-linear epoch is defined as a linearisation for which\r
-the following invariants are true:</p>\r
-<ol>\r
-<li>\r
-<p>\r
-if a commit P is reachable from commit N, commit P sorts after commit N\r
- in the linearised list.\r
-</p>\r
-</li>\r
-<li>\r
-<p>\r
-if Pi and Pj are any two parents of a merge M (with i < j), then any\r
- commit N, such that N is reachable from Pj but not reachable from Pi,\r
- sorts before all commits reachable from Pi.\r
-</p>\r
-<p>Invariant 1 states that later commits appear before earlier commits they are\r
-derived from.</p>\r
-<p>Invariant 2 states that commits unique to "later" parents in a merge, appear\r
-before all commits from "earlier" parents of a merge.</p>\r
-</li>\r
-</ol>\r
-</dd>\r
-<dt>\r
---show-breaks\r
-</dt>\r
-<dd>\r
-<p>\r
- Each item of the list is output with a 2-character prefix consisting\r
- of one of: (|), (^), (=) followed by a space.\r
-</p>\r
-<p>Commits marked with (=) represent the boundaries of minimal, non-linear epochs\r
-and correspond either to the start of a period of divergent development or to\r
-the end of such a period.</p>\r
-<p>Commits marked with (|) are direct parents of commits immediately preceding\r
-the marked commit in the list.</p>\r
-<p>Commits marked with (^) are not parents of the immediately preceding commit.\r
-These "breaks" represent necessary discontinuities implied by trying to\r
-represent an arbtirary DAG in a linear form.</p>\r
-<p><tt>--show-breaks</tt> is only valid if <tt>--merge-order</tt> is also specified.</p>\r
-</dd>\r
</dl>\r
</div>\r
<h2>Author</h2>\r
<div class="sectionbody">\r
<p>Written by Linus Torvalds <torvalds@osdl.org></p>\r
-<p>Original <strong>--merge-order</strong> logic by Jon Seymour <jon.seymour@gmail.com></p>\r
</div>\r
<h2>Documentation</h2>\r
<div class="sectionbody">\r
</div>\r
<div id="footer">\r
<div id="footer-text">\r
-Last updated 27-Dec-2005 00:16:38 PDT\r
+Last updated 09-May-2006 00:32:26 UTC\r
</div>\r
</div>\r
</body>\r