anchor.diff:        in
         drop' (len - 1);
   
  -
  -  # Return a list consisting of at most ‘count’ elements of ‘list’,
  -  # starting at index ‘start’.
  +  /**
  +   * Return a list consisting of at most ‘count’ elements of ‘list’,
  +   * starting at index ‘start’.
  +   */
     sublist = start: count: list:
       let
         len = length list;
  
positive.code:       in
        take' 0;
  
  
    # Remove the first (at most) N elements of a list.
    drop =
      if builtins ? genList then
        count: list: sublist count (length list) list
  
negative.code:     else
        fold (e: acc: acc ++ [ e ]) [];
  
    /**
     * Sort a list based on a comparator function which compares two
     * elements and returns true if the first argument is strictly below
     * the second argument.  The returned list is sorted in an increasing
     * order.  The implementation does a quick-sort.
     */
    sort = builtins.sort or (
      strictLess: list:
      let
  