Fossil SCM
Fix typo in the sync.wiki document.
Commit
3cb82905e105cc00c26e0b65495bb8b3e609e5619cbd0ca3ad6ef2b9d0b7c048
Parent
a7343c6a0cb227f…
1 file changed
+1
-1
+1
-1
| --- www/sync.wiki | ||
| +++ www/sync.wiki | ||
| @@ -12,11 +12,11 @@ | ||
| 12 | 12 | repositories so that all repositories have copies of all artifacts. Because |
| 13 | 13 | artifacts are unordered, the order in which artifacts are received |
| 14 | 14 | is unimportant. It is assumed that the hash names |
| 15 | 15 | of artifacts are unique - that every artifact has a different hash. |
| 16 | 16 | To a first approximation, synchronization proceeds by sharing lists |
| 17 | -hash values for available artifacts, then sharing the content of artifacts | |
| 17 | +of hashes for available artifacts, then sharing the content of artifacts | |
| 18 | 18 | whose names are missing from one side or the other of the connection. |
| 19 | 19 | In practice, a repository might contain millions of artifacts. The list of |
| 20 | 20 | hash names for this many artifacts can be large. So optimizations are |
| 21 | 21 | employed that usually reduce the number of hashes that need to be |
| 22 | 22 | shared to a few hundred.</p> |
| 23 | 23 |
| --- www/sync.wiki | |
| +++ www/sync.wiki | |
| @@ -12,11 +12,11 @@ | |
| 12 | repositories so that all repositories have copies of all artifacts. Because |
| 13 | artifacts are unordered, the order in which artifacts are received |
| 14 | is unimportant. It is assumed that the hash names |
| 15 | of artifacts are unique - that every artifact has a different hash. |
| 16 | To a first approximation, synchronization proceeds by sharing lists |
| 17 | hash values for available artifacts, then sharing the content of artifacts |
| 18 | whose names are missing from one side or the other of the connection. |
| 19 | In practice, a repository might contain millions of artifacts. The list of |
| 20 | hash names for this many artifacts can be large. So optimizations are |
| 21 | employed that usually reduce the number of hashes that need to be |
| 22 | shared to a few hundred.</p> |
| 23 |
| --- www/sync.wiki | |
| +++ www/sync.wiki | |
| @@ -12,11 +12,11 @@ | |
| 12 | repositories so that all repositories have copies of all artifacts. Because |
| 13 | artifacts are unordered, the order in which artifacts are received |
| 14 | is unimportant. It is assumed that the hash names |
| 15 | of artifacts are unique - that every artifact has a different hash. |
| 16 | To a first approximation, synchronization proceeds by sharing lists |
| 17 | of hashes for available artifacts, then sharing the content of artifacts |
| 18 | whose names are missing from one side or the other of the connection. |
| 19 | In practice, a repository might contain millions of artifacts. The list of |
| 20 | hash names for this many artifacts can be large. So optimizations are |
| 21 | employed that usually reduce the number of hashes that need to be |
| 22 | shared to a few hundred.</p> |
| 23 |