2024-06-01 11:00:53 +00:00
|
|
|
lib: {
|
|
|
|
attrs = {
|
|
|
|
## Merge two attribute sets at the base level.
|
|
|
|
##
|
|
|
|
## @type Attrs a b c => a -> b -> c
|
|
|
|
merge = x: y: x // y;
|
|
|
|
|
|
|
|
## Merge two attribute sets recursively until a given predicate returns true.
|
|
|
|
## Any values that are _not_ attribute sets will be overridden with the value
|
|
|
|
## from `y` first if it exists and then `x` otherwise.
|
|
|
|
##
|
|
|
|
## @type Attrs a b c => (String -> Any -> Any -> Bool) -> a -> b -> c
|
2024-06-22 17:58:44 +00:00
|
|
|
mergeRecursiveUntil =
|
|
|
|
predicate: x: y:
|
|
|
|
let
|
|
|
|
process =
|
|
|
|
path:
|
|
|
|
builtins.zipAttrsWith (
|
|
|
|
name: values:
|
|
|
|
let
|
|
|
|
currentPath = path ++ [ name ];
|
|
|
|
isSingleValue = builtins.length values == 1;
|
|
|
|
isComplete = predicate currentPath (builtins.elemAt values 1) (builtins.elemAt values 0);
|
|
|
|
in
|
|
|
|
if isSingleValue then
|
|
|
|
builtins.elemAt values 0
|
|
|
|
else if isComplete then
|
|
|
|
builtins.elemAt values 1
|
|
|
|
else
|
|
|
|
process currentPath values
|
|
|
|
);
|
|
|
|
in
|
|
|
|
process [ ] [
|
|
|
|
x
|
|
|
|
y
|
|
|
|
];
|
2024-06-01 11:00:53 +00:00
|
|
|
|
|
|
|
## Merge two attribute sets recursively. Any values that are _not_ attribute sets
|
|
|
|
## will be overridden with the value from `y` first if it exists and then `x`
|
|
|
|
## otherwise.
|
|
|
|
##
|
|
|
|
## @type Attrs a b c => a -> b -> c
|
2024-06-22 17:58:44 +00:00
|
|
|
mergeRecursive = lib.attrs.mergeRecursiveUntil (
|
|
|
|
path: x: y:
|
|
|
|
!(builtins.isAttrs x && builtins.isAttrs y)
|
|
|
|
);
|
2024-06-01 11:00:53 +00:00
|
|
|
|
|
|
|
## Get a value from an attribute set by a path. If the path does not exist,
|
|
|
|
## a fallback value will be returned instead.
|
|
|
|
##
|
|
|
|
## @type (List String) -> a -> Attrs -> a | b
|
2024-06-22 17:58:44 +00:00
|
|
|
select =
|
|
|
|
path: fallback: target:
|
|
|
|
let
|
|
|
|
name = builtins.head path;
|
|
|
|
rest = builtins.tail path;
|
|
|
|
in
|
|
|
|
if path == [ ] then
|
|
|
|
target
|
|
|
|
else if target ? ${name} then
|
|
|
|
lib.attrs.select rest fallback target.${name}
|
|
|
|
else
|
|
|
|
fallback;
|
2024-06-01 11:00:53 +00:00
|
|
|
|
|
|
|
## Get a value from an attribute set by a path. If the path does not exist,
|
|
|
|
## an error will be thrown.
|
|
|
|
##
|
|
|
|
## @type (List String) -> Attrs -> a
|
2024-06-22 17:58:44 +00:00
|
|
|
selectOrThrow =
|
|
|
|
path: target:
|
|
|
|
let
|
|
|
|
pathAsString = builtins.concatStringsSep "." path;
|
|
|
|
error = builtins.throw "Path not found in attribute set: ${pathAsString}";
|
|
|
|
in
|
|
|
|
if lib.attrs.has path target then lib.attrs.select path null target else error;
|
2024-06-01 11:00:53 +00:00
|
|
|
|
2024-06-13 05:00:03 +00:00
|
|
|
## Zip specific attributes from a list of attribute sets.
|
|
|
|
##
|
|
|
|
## @type List String -> (List Any -> Any) -> List Attrs -> Attrs
|
2024-06-22 17:58:44 +00:00
|
|
|
zipWithNames =
|
|
|
|
names: f: list:
|
|
|
|
let
|
|
|
|
transform = name: {
|
|
|
|
inherit name;
|
|
|
|
value = f name (builtins.catAttrs name list);
|
|
|
|
};
|
|
|
|
results = builtins.map transform names;
|
|
|
|
in
|
2024-06-13 05:00:03 +00:00
|
|
|
builtins.listToAttrs results;
|
|
|
|
|
|
|
|
## Match an attribute set against a pattern.
|
|
|
|
##
|
|
|
|
## @type Attrs -> Attrs -> Bool
|
2024-06-22 17:58:44 +00:00
|
|
|
match =
|
|
|
|
pattern: value:
|
|
|
|
let
|
|
|
|
process =
|
|
|
|
name: values:
|
|
|
|
let
|
|
|
|
first = builtins.elemAt values 0;
|
|
|
|
second = builtins.elemAt values 1;
|
|
|
|
in
|
|
|
|
if builtins.length values == 1 then
|
|
|
|
false
|
|
|
|
else if builtins.isAttrs first then
|
|
|
|
builtins.isAttrs second && lib.attrs.match first second
|
|
|
|
else
|
|
|
|
first == second;
|
2024-06-13 05:00:03 +00:00
|
|
|
|
2024-06-22 17:58:44 +00:00
|
|
|
result = lib.attrs.zipWithNames (builtins.attrNames pattern) process [
|
|
|
|
pattern
|
|
|
|
value
|
|
|
|
];
|
|
|
|
in
|
2024-06-13 05:00:03 +00:00
|
|
|
assert lib.errors.trace (builtins.isAttrs pattern) "Pattern must be an attribute set";
|
|
|
|
assert lib.errors.trace (builtins.isAttrs value) "Value must be an attribute set";
|
2024-06-22 17:58:44 +00:00
|
|
|
builtins.all lib.fp.id (builtins.attrValues result);
|
2024-06-13 05:00:03 +00:00
|
|
|
|
2024-06-03 09:57:13 +00:00
|
|
|
## Create a nested attribute set with a value as the leaf node.
|
|
|
|
##
|
|
|
|
## @type (List String) -> a -> Attrs
|
2024-06-22 17:58:44 +00:00
|
|
|
set =
|
|
|
|
path: value:
|
|
|
|
let
|
|
|
|
length = builtins.length path;
|
|
|
|
process =
|
|
|
|
depth: if depth == length then value else { ${builtins.elemAt path depth} = process (depth + 1); };
|
|
|
|
in
|
2024-06-01 11:00:53 +00:00
|
|
|
process 0;
|
|
|
|
|
|
|
|
## Check if a path exists in an attribute set.
|
|
|
|
##
|
|
|
|
## @type (List String) -> Attrs -> Bool
|
2024-06-22 17:58:44 +00:00
|
|
|
has =
|
|
|
|
path: target:
|
|
|
|
let
|
|
|
|
name = builtins.head path;
|
|
|
|
rest = builtins.tail path;
|
|
|
|
in
|
|
|
|
if path == [ ] then
|
|
|
|
true
|
|
|
|
else if target ? ${name} then
|
|
|
|
lib.attrs.has rest target.${name}
|
|
|
|
else
|
|
|
|
false;
|
2024-06-01 11:00:53 +00:00
|
|
|
|
|
|
|
## Depending on a given condition, either use the given value or an empty
|
|
|
|
## attribute set.
|
|
|
|
##
|
|
|
|
## @type Attrs a b => Bool -> a -> a | b
|
2024-06-22 17:58:44 +00:00
|
|
|
when = condition: value: if condition then value else { };
|
2024-06-01 11:00:53 +00:00
|
|
|
|
2024-06-03 09:57:13 +00:00
|
|
|
## Map an attribute set's names and values to a list.
|
2024-06-01 11:00:53 +00:00
|
|
|
##
|
|
|
|
## @type Any a => (String -> Any -> a) -> Attrs -> List a
|
2024-06-22 17:58:44 +00:00
|
|
|
mapToList = f: target: builtins.map (name: f name target.${name}) (builtins.attrNames target);
|
2024-06-01 11:00:53 +00:00
|
|
|
|
2024-06-03 09:57:13 +00:00
|
|
|
## Map an attribute set recursively. Only non-set leaf nodes will be mapped.
|
|
|
|
##
|
|
|
|
## @type (List String -> Any -> Any) -> Attrs -> Attrs
|
2024-06-22 17:58:44 +00:00
|
|
|
mapRecursive = f: target: lib.attrs.mapRecursiveWhen (lib.fp.const true) f target;
|
2024-06-01 11:00:53 +00:00
|
|
|
|
2024-06-03 09:57:13 +00:00
|
|
|
## Map an attribute set recursively when a given predicate returns true.
|
|
|
|
## Only leaf nodes according to the predicate will be mapped.
|
|
|
|
##
|
|
|
|
## @type (Attrs -> Bool) -> (List String -> Any -> Any) -> Attrs -> Attrs
|
2024-06-22 17:58:44 +00:00
|
|
|
mapRecursiveWhen =
|
|
|
|
predicate: f: target:
|
|
|
|
let
|
|
|
|
process =
|
|
|
|
path:
|
|
|
|
builtins.mapAttrs (
|
|
|
|
name: value:
|
|
|
|
if builtins.isAttrs value && predicate value then
|
|
|
|
process (path ++ [ name ]) value
|
|
|
|
else
|
|
|
|
f (path ++ [ name ]) value
|
|
|
|
);
|
|
|
|
in
|
|
|
|
process [ ] target;
|
2024-06-01 11:00:53 +00:00
|
|
|
|
2024-06-03 09:57:13 +00:00
|
|
|
## Filter an attribute set by a given predicate. The filter is only performed
|
|
|
|
## on the base level of the attribute set.
|
|
|
|
##
|
|
|
|
## @type (String -> Any -> Bool) -> Attrs -> Attrs
|
2024-06-22 17:58:44 +00:00
|
|
|
filter =
|
|
|
|
predicate: target:
|
|
|
|
let
|
|
|
|
names = builtins.attrNames target;
|
|
|
|
process =
|
|
|
|
name:
|
|
|
|
let
|
|
|
|
value = target.${name};
|
|
|
|
in
|
|
|
|
if predicate name value then [ { inherit name value; } ] else [ ];
|
|
|
|
valid = builtins.concatMap process names;
|
2024-06-01 11:00:53 +00:00
|
|
|
in
|
|
|
|
builtins.listToAttrs valid;
|
2024-06-05 02:04:40 +00:00
|
|
|
|
|
|
|
## Generate an attribute set from a list of names and a function that is
|
|
|
|
## applied to each name.
|
|
|
|
##
|
|
|
|
## @type (List String) -> (String -> Any) -> Attrs
|
2024-06-22 17:58:44 +00:00
|
|
|
generate =
|
|
|
|
names: f:
|
|
|
|
let
|
|
|
|
pairs = builtins.map (name: {
|
2024-06-05 02:04:40 +00:00
|
|
|
inherit name;
|
|
|
|
value = f name;
|
2024-06-22 17:58:44 +00:00
|
|
|
}) names;
|
|
|
|
in
|
2024-06-05 02:04:40 +00:00
|
|
|
builtins.listToAttrs pairs;
|
2024-06-01 11:00:53 +00:00
|
|
|
};
|
|
|
|
}
|