Fossil SCM
Spelling corrections in comments and some help documents.
Commit
97a4f26609d11e7987126df1e78c5fea13a053770e6e369e3ebefa7d825c4850
Parent
9432ea9085c61c9…
2 files changed
+1
-1
+3
-3
+1
-1
| --- src/content.c | ||
| +++ src/content.c | ||
| @@ -864,11 +864,11 @@ | ||
| 864 | 864 | int srcid = aSrc[i]; |
| 865 | 865 | if( srcid==rid ) continue; |
| 866 | 866 | if( content_is_private(srcid) && !content_is_private(rid) ) continue; |
| 867 | 867 | |
| 868 | 868 | /* Compute all ancestors of srcid and make sure rid is not one of them. |
| 869 | - ** If rid is an ancestor of srcid, then making rid a descendent of srcid | |
| 869 | + ** If rid is an ancestor of srcid, then making rid a descendant of srcid | |
| 870 | 870 | ** would create a delta loop. */ |
| 871 | 871 | s = srcid; |
| 872 | 872 | while( (s = delta_source_rid(s))>0 ){ |
| 873 | 873 | if( s==rid ){ |
| 874 | 874 | content_undelta(srcid); |
| 875 | 875 |
| --- src/content.c | |
| +++ src/content.c | |
| @@ -864,11 +864,11 @@ | |
| 864 | int srcid = aSrc[i]; |
| 865 | if( srcid==rid ) continue; |
| 866 | if( content_is_private(srcid) && !content_is_private(rid) ) continue; |
| 867 | |
| 868 | /* Compute all ancestors of srcid and make sure rid is not one of them. |
| 869 | ** If rid is an ancestor of srcid, then making rid a descendent of srcid |
| 870 | ** would create a delta loop. */ |
| 871 | s = srcid; |
| 872 | while( (s = delta_source_rid(s))>0 ){ |
| 873 | if( s==rid ){ |
| 874 | content_undelta(srcid); |
| 875 |
| --- src/content.c | |
| +++ src/content.c | |
| @@ -864,11 +864,11 @@ | |
| 864 | int srcid = aSrc[i]; |
| 865 | if( srcid==rid ) continue; |
| 866 | if( content_is_private(srcid) && !content_is_private(rid) ) continue; |
| 867 | |
| 868 | /* Compute all ancestors of srcid and make sure rid is not one of them. |
| 869 | ** If rid is an ancestor of srcid, then making rid a descendant of srcid |
| 870 | ** would create a delta loop. */ |
| 871 | s = srcid; |
| 872 | while( (s = delta_source_rid(s))>0 ){ |
| 873 | if( s==rid ){ |
| 874 | content_undelta(srcid); |
| 875 |
+3
-3
| --- src/timeline.c | ||
| +++ src/timeline.c | ||
| @@ -1483,11 +1483,11 @@ | ||
| 1483 | 1483 | |
| 1484 | 1484 | /* |
| 1485 | 1485 | ** Find the first check-in encountered with a particular tag |
| 1486 | 1486 | ** when moving either forwards are backwards in time from a |
| 1487 | 1487 | ** particular starting point (iFrom). Return the rid of that |
| 1488 | -** first check-in. If there are no check-ins in the descendent | |
| 1488 | +** first check-in. If there are no check-ins in the descendant | |
| 1489 | 1489 | ** or ancestor set of check-in iFrom that match the tag, then |
| 1490 | 1490 | ** return 0. |
| 1491 | 1491 | */ |
| 1492 | 1492 | static int timeline_endpoint( |
| 1493 | 1493 | int iFrom, /* Starting point */ |
| @@ -1681,14 +1681,14 @@ | ||
| 1681 | 1681 | ** d2=CKIN2 ... Use CKIN2 if CHECKIN is not found |
| 1682 | 1682 | ** ft=DESCENDANT ... going forward to DESCENDANT |
| 1683 | 1683 | ** dp=CHECKIN Same as 'd=CHECKIN&p=CHECKIN' |
| 1684 | 1684 | ** dp2=CKIN2 Same as 'd2=CKIN2&p2=CKIN2' |
| 1685 | 1685 | ** df=CHECKIN Same as 'd=CHECKIN&n1=all&nd'. Mnemonic: "Derived From" |
| 1686 | -** bt=CHECKIN "Back To". Show ancenstors going back to CHECKIN | |
| 1686 | +** bt=CHECKIN "Back To". Show ancestors going back to CHECKIN | |
| 1687 | 1687 | ** p=CX ... from CX back to time of CHECKIN |
| 1688 | 1688 | ** from=CX ... path from CX back to CHECKIN |
| 1689 | -** ft=CHECKIN "Forward To": Show descendents forward to CHECKIN | |
| 1689 | +** ft=CHECKIN "Forward To": Show descendants forward to CHECKIN | |
| 1690 | 1690 | ** d=CX ... from CX up to the time of CHECKIN |
| 1691 | 1691 | ** from=CX ... path from CX up to CHECKIN |
| 1692 | 1692 | ** t=TAG Show only check-ins with the given TAG |
| 1693 | 1693 | ** r=TAG Same as 't=TAG&rel'. Mnemonic: "Related" |
| 1694 | 1694 | ** tl=TAGLIST Same as 't=TAGLIST&ms=brlist'. Mnemonic: "Tag List" |
| 1695 | 1695 |
| --- src/timeline.c | |
| +++ src/timeline.c | |
| @@ -1483,11 +1483,11 @@ | |
| 1483 | |
| 1484 | /* |
| 1485 | ** Find the first check-in encountered with a particular tag |
| 1486 | ** when moving either forwards are backwards in time from a |
| 1487 | ** particular starting point (iFrom). Return the rid of that |
| 1488 | ** first check-in. If there are no check-ins in the descendent |
| 1489 | ** or ancestor set of check-in iFrom that match the tag, then |
| 1490 | ** return 0. |
| 1491 | */ |
| 1492 | static int timeline_endpoint( |
| 1493 | int iFrom, /* Starting point */ |
| @@ -1681,14 +1681,14 @@ | |
| 1681 | ** d2=CKIN2 ... Use CKIN2 if CHECKIN is not found |
| 1682 | ** ft=DESCENDANT ... going forward to DESCENDANT |
| 1683 | ** dp=CHECKIN Same as 'd=CHECKIN&p=CHECKIN' |
| 1684 | ** dp2=CKIN2 Same as 'd2=CKIN2&p2=CKIN2' |
| 1685 | ** df=CHECKIN Same as 'd=CHECKIN&n1=all&nd'. Mnemonic: "Derived From" |
| 1686 | ** bt=CHECKIN "Back To". Show ancenstors going back to CHECKIN |
| 1687 | ** p=CX ... from CX back to time of CHECKIN |
| 1688 | ** from=CX ... path from CX back to CHECKIN |
| 1689 | ** ft=CHECKIN "Forward To": Show descendents forward to CHECKIN |
| 1690 | ** d=CX ... from CX up to the time of CHECKIN |
| 1691 | ** from=CX ... path from CX up to CHECKIN |
| 1692 | ** t=TAG Show only check-ins with the given TAG |
| 1693 | ** r=TAG Same as 't=TAG&rel'. Mnemonic: "Related" |
| 1694 | ** tl=TAGLIST Same as 't=TAGLIST&ms=brlist'. Mnemonic: "Tag List" |
| 1695 |
| --- src/timeline.c | |
| +++ src/timeline.c | |
| @@ -1483,11 +1483,11 @@ | |
| 1483 | |
| 1484 | /* |
| 1485 | ** Find the first check-in encountered with a particular tag |
| 1486 | ** when moving either forwards are backwards in time from a |
| 1487 | ** particular starting point (iFrom). Return the rid of that |
| 1488 | ** first check-in. If there are no check-ins in the descendant |
| 1489 | ** or ancestor set of check-in iFrom that match the tag, then |
| 1490 | ** return 0. |
| 1491 | */ |
| 1492 | static int timeline_endpoint( |
| 1493 | int iFrom, /* Starting point */ |
| @@ -1681,14 +1681,14 @@ | |
| 1681 | ** d2=CKIN2 ... Use CKIN2 if CHECKIN is not found |
| 1682 | ** ft=DESCENDANT ... going forward to DESCENDANT |
| 1683 | ** dp=CHECKIN Same as 'd=CHECKIN&p=CHECKIN' |
| 1684 | ** dp2=CKIN2 Same as 'd2=CKIN2&p2=CKIN2' |
| 1685 | ** df=CHECKIN Same as 'd=CHECKIN&n1=all&nd'. Mnemonic: "Derived From" |
| 1686 | ** bt=CHECKIN "Back To". Show ancestors going back to CHECKIN |
| 1687 | ** p=CX ... from CX back to time of CHECKIN |
| 1688 | ** from=CX ... path from CX back to CHECKIN |
| 1689 | ** ft=CHECKIN "Forward To": Show descendants forward to CHECKIN |
| 1690 | ** d=CX ... from CX up to the time of CHECKIN |
| 1691 | ** from=CX ... path from CX up to CHECKIN |
| 1692 | ** t=TAG Show only check-ins with the given TAG |
| 1693 | ** r=TAG Same as 't=TAG&rel'. Mnemonic: "Related" |
| 1694 | ** tl=TAGLIST Same as 't=TAGLIST&ms=brlist'. Mnemonic: "Tag List" |
| 1695 |