- 14 Apr, 2022 4 commits
-
-
Pacien TRAN-GIRARD authored
-
Pacien TRAN-GIRARD authored
-
Pacien TRAN-GIRARD authored
Disambiguating the type of leaps and for consistency.
-
Pacien TRAN-GIRARD authored
-
- 17 Mar, 2022 1 commit
-
-
Pacien TRAN-GIRARD authored
Making firm leaps generation independent from the larger lists of soft and hard leaps, so that they can be dropped at a later point.
-
- 02 Mar, 2022 1 commit
-
-
Pacien TRAN-GIRARD authored
This adds a new ordered ancestor iterator implementation using the firm leap information, which is lighter to store than the soft and hard leaps.
-
- 13 Apr, 2022 1 commit
-
-
Pacien TRAN-GIRARD authored
This adds a function to retrieve the parents of a given revision linearising oedipal merge nodes, which is commonly useful to walk over the ancestors without having to deal with that special case. The introduced functions are tested on basic cases.
-
- 28 Apr, 2022 1 commit
-
-
Pacien TRAN-GIRARD authored
The import is also dependent on the identifier parameter.
-
- 29 Apr, 2022 1 commit
-
-
Pacien TRAN-GIRARD authored
This trait is required for testing the ordered ancestor iterators.
-
- 28 Apr, 2022 3 commits
-
-
Pacien TRAN-GIRARD authored
This sets the MinRankComparator as the default parent comparator. This is the most useful one so far as determined experimentally for the purpose of stable range. Dynamic comparator choice at runtime is a bit tricky due to the use of generics. This could be improved later by using some function pointer or generating variants with a macro…
-
Pacien TRAN-GIRARD authored
Those internal references are useful for debugging and understand results more easily.
-
Pacien TRAN-GIRARD authored
This normalises the output of the testing CLI for easier analysis with tools such as VisiData.
-
- 13 Apr, 2022 3 commits
-
-
Pacien TRAN-GIRARD authored
This implements the stub `firm_leaps` method of the `StableOrderGraph` trait for `InMemoryGraph`.
-
Pacien TRAN-GIRARD authored
This adds a function to compute the list of `FirmLeap`s of a new node being inserted. A basic corresponding unit test is also added.
-
Pacien TRAN-GIRARD authored
This introduces a new distinct set of leap types for caching the ordered iteration over revisions in stable order graphs. This new type aims to reduce the number of leap information to store to achieve the same result. This requires a different iterator implementation which will be introduced later on.
-
- 28 Apr, 2022 2 commits
-
-
Pacien TRAN-GIRARD authored
This was previously only tested indirectly by the iterator's test. It's better to have an explicit test case here.
-
Pacien TRAN-GIRARD authored
This will be used in other unit tests.
-
- 02 May, 2022 2 commits
-
-
Pacien TRAN-GIRARD authored
-
Pacien TRAN-GIRARD authored
-
- 13 Apr, 2022 1 commit
-
-
Pacien TRAN-GIRARD authored
This is an interesting case which caused troubles with early re-implemention of the ordered ancestor iterator without soft leaps.
-
- 27 Apr, 2022 1 commit
-
-
Pacien TRAN-GIRARD authored
This allows alternative implementations of ordered ancestor iterators to be tested against the same test suite.
-
- 20 Apr, 2022 1 commit
-
-
Pacien TRAN-GIRARD authored
This allows easily building and running the testing CLI on any machine having Nix installed, automatically using the pinned version of the Rust toolchain. This is especially useful for running computation-intensive tests on a remote machine by simply using something like: `nix run hg+https://foss.heptapod.net/mercurial/vcsgraph#testing -- --help` For now, only the x86_64 variant of the derivation is defined, because I do not have other systems for testing (yet).
-
- 22 Apr, 2022 2 commits
-
-
Pacien TRAN-GIRARD authored
The project also contains end-product binaries (testing, analytics) which require Cargo.lock to be built in a reproducible manner. This is a pre-requisite for defining the Nix Flake.
-
Pacien TRAN-GIRARD authored
The GNU GPL requires including the licence file with distributed copies of the program. Heptapod: closes #16
-
- 21 Dec, 2021 4 commits
-
-
Simon Sapin authored
-
Simon Sapin authored
-
Pacien TRAN-GIRARD authored
Some implementation may not have cheap was of retrieving both the merge-rank and the usual rank of revisions.
-
Pacien TRAN-GIRARD authored
Making a clear distinction between graphs with cheap rank queries and those which require more intensive computations.
-
- 16 Nov, 2021 2 commits
-
-
Pacien TRAN-GIRARD authored
-
Pacien TRAN-GIRARD authored
-
- 09 Dec, 2021 5 commits
-
-
Pacien TRAN-GIRARD authored
This replaces the outdated rust-crypto crate with sha-1, used to shuffle NodeIDs in a reproducible way with different hashing seeds for testing.
-
Pacien TRAN-GIRARD authored
The testing CLI was moved from the examples to a testing binary hidden behind a feature flag in commit 1e6d303c9bfa.
-
Pacien TRAN-GIRARD authored
-
Pacien TRAN-GIRARD authored
… to match the oldest Rust version that we support, following the one packaged on Debian stable.
-
Pacien TRAN-GIRARD authored
This caused a warning with the newer Rust compiler.
-
- 16 Nov, 2021 1 commit
-
-
Pacien TRAN-GIRARD authored
-
- 09 Dec, 2021 1 commit
-
-
Pacien TRAN-GIRARD authored
Those are needed to publish the crate.
-
- 14 Sep, 2020 1 commit
-
-
Pacien TRAN-GIRARD authored
Replacing the previous subcommands to instead have some CSV output that is easier to analyse.
-
- 07 Sep, 2020 2 commits
-
-
Pacien TRAN-GIRARD authored
Preparing their replacement with a combined CSV output.
-
Pacien TRAN-GIRARD authored
-