wroclaw-git-backups/nix
1
0
Fork 0
mirror of https://github.com/NixOS/nix synced 2025-07-06 21:41:48 +02:00
Code Activity

Format .nix files

Browse source 
This does not include any automation for the release branch, but
is based on the configuration of https://github.com/NixOS/nix/pull/12349

    pre-commit run -a nixfmt-rfc-style
This commit is contained in:
Robert Hensing 2025-01-24 20:40:21 +01:00
parent 6cb17fd836
commit 32aed360b8
266 changed files with 7443 additions and 5118 deletions
Download patch file Download diff file Expand all files Collapse all files

84
tests/functional/lang/lib.nix
View file

@ -2,60 +2,76 @@ with builtins;
rec {
fold = op: nul: list:
if list == []
then nul
else op (head list) (fold op nul (tail list));
fold =
op: nul: list:
if list == [ ] then nul else op (head list) (fold op nul (tail list));
concat =
fold (x: y: x + y) "";
concat = fold (x: y: x + y) "";
and = fold (x: y: x && y) true;
flatten = x:
if isList x
then fold (x: y: (flatten x) ++ y) [] x
else [x];
flatten = x: if isList x then fold (x: y: (flatten x) ++ y) [ ] x else [ x ];
sum = foldl' (x: y: add x y) 0;
hasSuffix = ext: fileName:
let lenFileName = stringLength fileName;
lenExt = stringLength ext;
in !(lessThan lenFileName lenExt) &&
substring (sub lenFileName lenExt) lenFileName fileName == ext;
hasSuffix =
ext: fileName:
let
lenFileName = stringLength fileName;
lenExt = stringLength ext;
in
!(lessThan lenFileName lenExt) && substring (sub lenFileName lenExt) lenFileName fileName == ext;
# Split a list at the given position.
splitAt = pos: list:
if pos == 0 then {first = []; second = list;} else
if list == [] then {first = []; second = [];} else
let res = splitAt (sub pos 1) (tail list);
in {first = [(head list)] ++ res.first; second = res.second;};
splitAt =
pos: list:
if pos == 0 then
{
first = [ ];
second = list;
}
else if list == [ ] then
{
first = [ ];
second = [ ];
}
else
let
res = splitAt (sub pos 1) (tail list);
in
{
first = [ (head list) ] ++ res.first;
second = res.second;
};
# Stable merge sort.
sortBy = comp: list:
if lessThan 1 (length list)
then
sortBy =
comp: list:
if lessThan 1 (length list) then
let
split = splitAt (div (length list) 2) list;
first = sortBy comp split.first;
second = sortBy comp split.second;
in mergeLists comp first second
else list;
in
mergeLists comp first second
else
list;
mergeLists = comp: list1: list2:
if list1 == [] then list2 else
if list2 == [] then list1 else
if comp (head list2) (head list1) then [(head list2)] ++ mergeLists comp list1 (tail list2) else
[(head list1)] ++ mergeLists comp (tail list1) list2;
mergeLists =
comp: list1: list2:
if list1 == [ ] then
list2
else if list2 == [ ] then
list1
else if comp (head list2) (head list1) then
[ (head list2) ] ++ mergeLists comp list1 (tail list2)
else
[ (head list1) ] ++ mergeLists comp (tail list1) list2;
id = x: x;
const = x: y: x;
range = first: last:
if first > last
then []
else genList (n: first + n) (last - first + 1);
range = first: last: if first > last then [ ] else genList (n: first + n) (last - first + 1);
}