zuckerberg/AoC-2022-Nix
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Optimize list intersection

Browse Source
This commit is contained in:
zuckerberg 2022-12-05 13:08:13 -07:00
parent cd80733367
commit 6b3d803456
1 changed files with 1 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
util.nix
View File

@ -20,10 +20,7 @@ let
[(take cnt l)] ++ chunksOf cnt (drop cnt l) [(take cnt l)] ++ chunksOf cnt (drop cnt l)
else []; else [];
# same as intersectLists but takes an array of lists to intersect instead of just two # same as intersectLists but takes an array of lists to intersect instead of just two
intersectManyLists = l: intersectManyLists = ll: foldr intersectLists (head ll) ll;
if length l == 0 then []
else if length l == 1 then head l
else intersectLists (head l) (intersectManyLists (tail l));
# converts a boolean to a int (c style) # converts a boolean to a int (c style)
boolToInt = b: if b then 1 else 0; boolToInt = b: if b then 1 else 0;
# drops the last element of a list # drops the last element of a list