anchor.diff:    void setRange(int start, int end, Iterable<E> iterable, [int skipCount = 0]);
   
     /**
  -   * Removes the elements in the range [start] to [end] exclusive.
  -   *
  -   * It is an error if [start]..[end] is not a valid range pointing into the
  -   * `this`.
  +   * Removes the objects in the range [start] inclusive to [end] exclusive.
  +   *
  +   * An error occurs if [start]..[end] is not a valid range for `this`.
  +   * Throws an [UnsupportedError] if this is a fixed-length list.
      */
     void removeRange(int start, int end);
   
     /**
  -   * Sets the elements in the range [start] to [end] exclusive to the given
  -   * [fillValue].
  -   *
  -   * It is an error if [start]..[end] is not a valid range pointing into the
  -   * `this`.
  +   * Sets the objects in the range [start] inclusive to [end] exclusive
  +   * to the given [fillValue].
  +   *
  +   * An error occurs if [start]..[end] is not a valid range for `this`.
      */
     void fillRange(int start, int end, [E fillValue]);
   
     /**
  -   * Removes the elements in the range [start] to [end] exclusive and replaces
  -   * them with the contents of the [iterable].
  -   *
  -   * It is an error if [start]..[end] is not a valid range pointing into the
  -   * `this`.
  +   * Removes the objects in the range [start] inclusive to [end] exclusive
  +   * and replaces them with the contents of the [iterable].
  +   *
  +   * An error occurs if [start]..[end] is not a valid range for `this`.
      *
      * Example:
      *
  
positive.code:   Iterable<E> getRange(int start, int end);
  
    /**
     * Copies the elements of [iterable], skipping the [skipCount] first elements,
     * into the range [start] to [end] exclusive of `this`.
     *
     * If [start] equals [end] and [start]..[end] represents a legal range, this
     * method has no effect.
     *
     * It is an error if [start]..[end] is not a valid range pointing into the
     * `this`.
     *
     * It is an error if the [iterable] does not have enough elements after
     * skipping [skipCount] elements.
     *
     * Example:
     *
  
negative.code:   /**
     * Returns an unmodifiable [Map] view of `this`.
     *
     * The map uses the indices of this list as keys and the corresponding objects
     * as values. The `Map.keys` [Iterable] iterates the indices of this list
     * in numerical order.
     */
    Map<int, E> asMap();
  