kfm/niveum
1
0
Fork 0
mirror of https://github.com/kmein/niveum synced 2026-03-17 18:41:09 +01:00
Code Releases Activity

format

Browse Source
This commit is contained in:
Kierán Meinhardt
2025-12-27 22:22:54 +01:00
parent cb0307e8bf
commit c3db0404b3
139 changed files with 2630 additions and 1976 deletions
Download Patch File Download Diff File Expand all files Collapse all files

85
.bin/toposort.nix
View File

@@ -1,50 +1,81 @@
let
lib = import <nixpkgs/lib>;
in rec {
in
rec {
inherit lib;
input = [
{
x = ["pool" "zfs"];
y = ["mdadm" "raid1"];
x = [
"pool"
"zfs"
];
y = [
"mdadm"
"raid1"
];
}
{
x = ["pool" "zfs"];
y = ["disk" "sda"];
x = [
"pool"
"zfs"
];
y = [
"disk"
"sda"
];
}
{
x = ["mdadm" "raid1"];
y = ["disk" "sdb"];
x = [
"mdadm"
"raid1"
];
y = [
"disk"
"sdb"
];
}
{
x = ["mdadm" "raid1"];
y = ["disk" "sdc"];
x = [
"mdadm"
"raid1"
];
y = [
"disk"
"sdc"
];
}
];
outNodes = node: graph:
lib.unique
(builtins.map (e: e.y)
(builtins.filter (v: v.x == node) graph));
outNodes = node: graph: lib.unique (builtins.map (e: e.y) (builtins.filter (v: v.x == node) graph));
vertices = graph:
lib.unique
(builtins.map (x: x.y) graph ++ builtins.map (x: x.x) graph);
vertices = graph: lib.unique (builtins.map (x: x.y) graph ++ builtins.map (x: x.x) graph);
deleteVertex = node: graph: (builtins.filter (v: v.x != node && v.y != node) graph);
findSink = graph:
lib.findFirst
(v: outNodes v graph == [])
(lib.trace graph (builtins.abort "No sink found"))
(vertices graph);
findSink =
graph:
lib.findFirst (v: outNodes v graph == [ ]) (lib.trace graph (builtins.abort "No sink found")) (
vertices graph
);
topSort = graph:
if graph == []
then []
else if builtins.length graph == 1
then let only = builtins.head graph; in [only.y only.x]
else let sink = findSink graph; in [sink] ++ topSort (deleteVertex sink graph);
topSort =
graph:
if graph == [ ] then
[ ]
else if builtins.length graph == 1 then
let
only = builtins.head graph;
in
[
only.y
only.x
]
else
let
sink = findSink graph;
in
[ sink ] ++ topSort (deleteVertex sink graph);
output = topSort input;
}