n := testing.AllocsPerRun(100, func() {
		got.Reset()
		for i := 0; i < 1000; i++ {
			b := got.AvailableBuffer()
			b = strconv.AppendInt(b, int64(i), 10)
			got.Write(b)
		}
	})
	if n > 0 {
		t.Errorf("allocations occurred while appending")
	}
}

func TestRuneIO(t *testing.T) {
	const NRune = 1000
	// Built a test slice while we write the data
	b := make([]byte, utf8.UTFMax*NRune)
	var buf Buffer

         *
         * @return The complete FTP URL
         */
        public String toUrl() {
            return toUrl(uri.getPath());
        }

        /**
         * Constructs a child URL by appending the specified child path to the current URL.
         *
         * @param child The child path to append
         * @return The complete child URL
         */
        public String toChildUrl(final String child) {

          break // End of journal.
        }
      }

      redundantOpCount = lineCount - lruEntries.size

      // If we ended on a truncated line, rebuild the journal before appending to it.
      if (!exhausted()) {
        rebuildJournal()
      } else {
        journalWriter?.closeQuietly()
        journalWriter = newJournalWriter()
      }
    }
  }

    /** Property key for search log configuration. */
    public static final String SEARCH_LOG_PROPERTY = "search.log";

    /** Property key for appending query parameters configuration. */
    public static final String APPEND_QUERY_PARAMETER_PROPERTY = "append.query.parameter";

    /** Property key for incremental crawling configuration. */

Unification uses a combination of <i>exact</i> and <i>loose</i>
unification depending on whether two types have to be
<a href="#Type_identity">identical</a>,
<a href="#Assignability">assignment-compatible</a>, or
only structurally equal.
The respective <a href="#Type_unification_rules">type unification rules</a>
are spelled out in detail in the <a href="#Appendix">Appendix</a>.
</p>

<p>

	// string "id"
	o = append(o, 0x83, 0xa2, 0x69, 0x64)
	o = msgp.AppendString(o, z.DiskID)
	// string "m"
	o = append(o, 0xa1, 0x6d)
	o = msgp.AppendInt(o, z.ScanMode)
	// string "c"
	o = append(o, 0xa1, 0x63)
	if z.Cache == nil {
		o = msgp.AppendNil(o)
	} else {
		o, err = z.Cache.MarshalMsg(o)
		if err != nil {
			err = msgp.WrapError(err, "Cache")
			return
		}
	}
	return
}

	o = append(o, 0x86, 0xa7, 0x44, 0x69, 0x73, 0x61, 0x62, 0x6c, 0x65)
	if z.Disable == nil {
		o = msgp.AppendNil(o)
	} else {
		o = msgp.AppendBool(o, *z.Disable)
	}
	// string "Batch"
	o = append(o, 0xa5, 0x42, 0x61, 0x74, 0x63, 0x68)
	if z.Batch == nil {
		o = msgp.AppendNil(o)
	} else {
		o = msgp.AppendInt(o, *z.Batch)
	}
	// string "InMemory"
	o = append(o, 0xa8, 0x49, 0x6e, 0x4d, 0x65, 0x6d, 0x6f, 0x72, 0x79)

	o = msgp.AppendInt(o, z.Total)
	// string "Writes"
	o = append(o, 0xa6, 0x57, 0x72, 0x69, 0x74, 0x65, 0x73)
	o = msgp.AppendInt(o, z.Writes)
	// string "Reads"
	o = append(o, 0xa5, 0x52, 0x65, 0x61, 0x64, 0x73)
	o = msgp.AppendInt(o, z.Reads)
	// string "LockQueue"
	o = append(o, 0xa9, 0x4c, 0x6f, 0x63, 0x6b, 0x51, 0x75, 0x65, 0x75, 0x65)
	o = msgp.AppendInt(o, z.LockQueue)
	// string "LocksAbandoned"

	// string "lu"
	o = append(o, 0xa2, 0x6c, 0x75)
	o = msgp.AppendTime(o, z.LastUpdate)
	// string "ra"
	o = append(o, 0xa2, 0x72, 0x61)
	o = msgp.AppendInt(o, z.RetryAttempts)
	// string "at"
	o = append(o, 0xa2, 0x61, 0x74)
	o = msgp.AppendInt(o, z.Attempts)
	// string "cmp"
	o = append(o, 0xa3, 0x63, 0x6d, 0x70)
	o = msgp.AppendBool(o, z.Complete)
	// string "fld"
	o = append(o, 0xa3, 0x66, 0x6c, 0x64)

   * same value those two ranges will be coalesced.
   *
   * <p><b>Note:</b> coalescing requires calling {@code .equals()} on any connected values, which
   * may be expensive depending on the value type. Using this method on range maps with large values
   * such as {@link Collection} types is discouraged.
   *
   * @since 22.0
   */
  void putCoalescing(Range<K> range, V value);