anchor.diff:         else if start + count > len then len - start
          else count);
   
  -
  -  # Return the last element of a list.
  +  /* Return the last element of a list.
  +
  +     Example:
  +       last [ 1 2 3 ]
  +       => 3
  +  */
     last = list:
       assert list != []; elemAt list (length list - 1);
   
  -
  -  # Return all elements but the last
  +  /* Return all elements but the last
  +
  +     Example:
  +       init [ 1 2 3 ]
  +       => [ 1 2 ]
  +  */
     init = list: assert list != []; take (length list - 1) list;
   
   
  +  /* FIXME(zimbatm) Not used anywhere
  +   */
     crossLists = f: foldl (fs: args: concatMap (f: map f args) fs) [f];
   
   
  -  # Remove duplicate elements from the list. O(n^2) complexity.
  +  /* Remove duplicate elements from the list. O(n^2) complexity.
  +
  +     Example:
  +
  +       unique [ 3 2 3 4 ]
  +       => [ 3 2 4 ]
  +   */
     unique = list:
       if list == [] then
         []
  
positive.code:         then []
          else [first] ++ range (first + 1) last;
  
  
    # Partition the elements of a list in two lists, `right' and
    # `wrong', depending on the evaluation of a predicate.
    partition = pred:
      fold (h: t:
        if pred h
  
negative.code:               [ (elemAt list n) ] ++ take' (n + 1);
          in take' 0;
  
    /* Remove the first (at most) N elements of a list.
  
       Example:
         drop 2 [ "a" "b" "c" "d" ]
         => [ "c" "d" ]
         drop 2 [ ]
         => [ ]
    */
    drop =
      if builtins ? genList then
        count: list: sublist count (length list) list
  