| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | working links recorded | tv | 31 hours | 1 | -15/+27 |
| | | |||||
| * | reach sets bounded | tv | 32 hours | 1 | -0/+49 |
| | | |||||
| * | round trips in trees | tv | 2 days | 1 | -15/+46 |
| | | |||||
| * | overdue sync asked after from then | tv | 3 days | 1 | -1/+1 |
| | | |||||
| * | announcements answered when lacking | tv | 3 days | 1 | -4/+4 |
| | | | | | | | | A neighbour now answers an announcement only if it lacks some of the announced heads. Heads that merely differ are no longer enough, since they do while writes go on. The check reads the document, so it runs off the message consumer, as the pull check already does. | ||||
| * | unanswered members not reached | tv | 4 days | 1 | -7/+25 |
| | | |||||
| * | reach set for the session | tv | 4 days | 1 | -15/+9 |
| | | |||||
| * | measure 2-hop neighbourhood | tv | 4 days | 1 | -0/+119 |
 |
index : continuum | |
| P2P replicated document storage service |
| aboutsummaryrefslogtreecommitdiffstats |