anchor.diff:      if builtins ? genList then
         count: sublist 0 count
       else
  -      count: list:
  -        let
  -          len = length list;
  -          take' = n:
  -            if n == len || n == count
  -              then []
  -            else
  -              [ (elemAt list n) ] ++ take' (n + 1);
  -        in take' 0;
  +    count: list:
  +      let
  +        len = length list;
  +        take' = n:
  +          if n == len || n == count
  +            then []
  +          else
  +            [ (elemAt list n) ] ++ take' (n + 1);
  +      in
  +      take' 0;
   
   
     # Remove the first (at most) N elements of a list.
  
positive.code:   # spliced into the top-level lists.  E.g., `flatten [1 [2 [3] 4] 5]
    # == [1 2 3 4 5]' and `flatten 1 == [1]'.
    flatten = x:
      if isList x
      then foldl' (x: y: x ++ (flatten y)) [] x
      else [x];
  
  
    # Remove elements equal to 'e' from a list.  Useful for buildInputs.
  
negative.code:           if n != len then
              [ (f (elemAt fst n) (elemAt snd n)) ]
              ++ zipListsWith' (n + 1)
            else [ ];
        in
        zipListsWith' 0;
  
    zipLists = zipListsWith (fst: snd: { inherit fst snd; });
  
  