where the `-t` tells `git-cat-file` to tell you what the "type" of the
object is. git will tell you that you have a "blob" object (ie just a
object is. git will tell you that you have a "blob" object (i.e., just a
regular file), and you can see the contents with
----------------
@ -619,7 +619,7 @@ $ git tag -s <tagname>
@@ -619,7 +619,7 @@ $ git tag -s <tagname>
----------------
which will sign the current `HEAD` (but you can also give it another
argument that specifies the thing to tag, ie you could have tagged the
argument that specifies the thing to tag, i.e., you could have tagged the
current `mybranch` point by using `git tag <tagname> mybranch`).
You normally only do signed tags for major releases or things
@ -1097,7 +1097,7 @@ commit object by downloading from `repo.git/objects/xx/xxx\...`
@@ -1097,7 +1097,7 @@ commit object by downloading from `repo.git/objects/xx/xxx\...`
using the object name of that commit object. Then it reads the
commit object to find out its parent commits and the associate
tree object; it repeats this process until it gets all the
necessary objects. Because of this behaviour, they are
necessary objects. Because of this behavior, they are
sometimes also called 'commit walkers'.
+
The 'commit walkers' are sometimes also called 'dumb
@ -16,7 +16,7 @@ which introduced the line. Start annotation from the given revision.
@@ -16,7 +16,7 @@ which introduced the line. Start annotation from the given revision.
OPTIONS
-------
-c, --compability::
-c, --compatibility::
Use the same output mode as git-annotate (Default: off).
@ -20,7 +20,7 @@ aka 9418. It waits for a connection, and will just execute "git-upload-pack"
@@ -20,7 +20,7 @@ aka 9418. It waits for a connection, and will just execute "git-upload-pack"
when it gets one.
It's careful in that there's a magic request-line that gives the command and
what directory to upload, and it verifies that the directory is ok.
what directory to upload, and it verifies that the directory is OK.
It verifies that the directory has the magic file "git-daemon-export-ok", and
it will refuse to export any git directory that hasn't explicitly been marked
@ -28,7 +28,7 @@ for export this way (unless the '--export-all' parameter is specified). If you
@@ -28,7 +28,7 @@ for export this way (unless the '--export-all' parameter is specified). If you
pass some directory paths as 'git-daemon' arguments, you can further restrict
the offers to a whitelist comprising of those.
This is ideally suited for read-only updates, ie pulling from git repositories.
This is ideally suited for read-only updates, i.e., pulling from git repositories.
@ -101,7 +101,7 @@ have not actually done a "git-update-index" on it yet - there is no
@@ -101,7 +101,7 @@ have not actually done a "git-update-index" on it yet - there is no
@ -71,7 +71,7 @@ sorted properly etc), but on the whole if "git-fsck-objects" is happy, you
@@ -71,7 +71,7 @@ sorted properly etc), but on the whole if "git-fsck-objects" is happy, you
do have a valid tree.
Any corrupt objects you will have to find in backups or other archives
(ie you can just remove them and do an "rsync" with some other site in
(i.e., you can just remove them and do an "rsync" with some other site in
the hopes that somebody else has the object you have corrupted).
Of course, "valid tree" doesn't mean that it wasn't generated by some
@ -205,7 +205,7 @@ The `git-write-tree` command refuses to write a nonsensical tree, and it
@@ -205,7 +205,7 @@ The `git-write-tree` command refuses to write a nonsensical tree, and it
will complain about unmerged entries if it sees a single entry that is not
stage 0.
Ok, this all sounds like a collection of totally nonsensical rules,
OK, this all sounds like a collection of totally nonsensical rules,
but it's actually exactly what you want in order to do a fast
merge. The different stages represent the "result tree" (stage 0, aka
"merged"), the original tree (stage 1, aka "orig"), and the two trees
@ -226,7 +226,7 @@ populated. Here is an outline of how the algorithm works:
@@ -226,7 +226,7 @@ populated. Here is an outline of how the algorithm works:
- the index file saves and restores with all this information, so you
can merge things incrementally, but as long as it has entries in
stages 1/2/3 (ie "unmerged entries") you can't write the result. So
stages 1/2/3 (i.e., "unmerged entries") you can't write the result. So
now the merge algorithm ends up being really simple:
* you walk the index in order, and ignore all entries of stage 0,
@ -12,7 +12,7 @@ This document presents a brief summary of each tool and the corresponding
@@ -12,7 +12,7 @@ This document presents a brief summary of each tool and the corresponding