Fintan Halpenny b4f2614d6c cob: chronological ordering of concurrent values ... The underlying `Dag` for a COB will use the `Ord` implementation of whatever is provided as the key. This means that the lexicographical ordering of the `Oid` SHA will be used, which in turn means that if the SHAs change in our tests, then the ordering will be broken for concurrent updates. To prevent this from happening, a variant of the `prune` method is introduced that takes an ordering of the keys and values – this method being called `prune_by`. This allows `prune` to be replaced with `prune_by` in the `ChangeGraph::evaluate` method. The ordering used is first comparing the `Entry::timestamp` and then the `EntryId` (`Oid`).		2024-10-23 13:02:55 +01:00
..
src	cob: chronological ordering of concurrent values	2024-10-23 13:02:55 +01:00
Cargo.toml	Update radicle crates to 0.9.0	2024-03-26 11:56:27 +01:00