Commit graph

5 commits

Author SHA1 Message Date
397419d8ab
chore: format code 2025-03-11 22:47:02 -07:00
866b8902c9 fix(lib): swapped entries in test dag.sort.topological."sorts a graph" ()
I figure it's a simple typo. This test expects entries `"a"`, `"b"`, `"c"`, `"d"` to be lexicographically sorted but fails. The actual result is that entries are sorted in this order: `c, b, a, d`. This is because the test adds the entry `"b" = lib.dag.entry.between [ "c" ] [ "a" ] "b"`, i.e. after `"c"` and before `"a"`. I haven't checked if it was a logic error in the sort implementation, as other pieces of labs rely on it (and use `lib.dag.entry.between` with the arguments flipped relative to the test, which makes sense), and the arguments of the function `lib.dag.entry.between` are named "after", *then* "before".

Co-authored-by: Austreelis <dev.austreelis@swhaele.net>
Reviewed-on: 
Reviewed-by: Jake Hamilton <jake.hamilton@hey.com>
Co-authored-by: Austreelis <austreelis@noreply.git.auxolotl.org>
Co-committed-by: Austreelis <austreelis@noreply.git.auxolotl.org>
2024-10-08 18:44:31 +00:00
8233d4aedf use correct name for topological sort ()
I am 0.8 sure this is a typo, I've never seen this being referred to as topographic sorting!

Reviewed-on: 
Reviewed-by: Jake Hamilton <jake.hamilton@hey.com>
Co-authored-by: Alex Kladov <aleksey.kladov@gmail.com>
Co-committed-by: Alex Kladov <aleksey.kladov@gmail.com>
2024-06-23 18:39:30 +00:00
a707b0f06b
refactor: format all nix code 2024-06-22 10:58:44 -07:00
04bc516868
feat: dag, internal inputs solution, license update 2024-06-12 02:04:53 -07:00