* specified array and the size of the specified collection.
   *
   * <p>If the collection fits in the specified array with room to spare (i.e., the array has more
   * elements than the collection), the element in the array immediately following the end of the
   * collection is set to {@code null}. This is useful in determining the length of the collection

   * specified array and the size of the specified collection.
   *
   * <p>If the collection fits in the specified array with room to spare (i.e., the array has more
   * elements than the collection), the element in the array immediately following the end of the
   * collection is set to {@code null}. This is useful in determining the length of the collection

   * allocated with the runtime type of the specified array and the size of this queue.
   *
   * <p>If this queue fits in the specified array with room to spare (i.e., the array has more
   * elements than this queue), the element in the array immediately following the end of the queue
   * is set to {@code null}.
   *

   * array, it is returned therein. Otherwise, a new array is allocated with the runtime type of the
   * specified array and the size of this queue.
   *
   * <p>If this queue fits in the specified array with room to spare (i.e., the array has more
   * elements than this queue), the element in the array immediately following the end of the queue
   * is set to {@code null}.
   *

</li>
<li>
<code>NOSPLIT</code> = 4
<br>
(For <code>TEXT</code> items.)
Don't insert the preamble to check if the stack must be split.
The frame for the routine, plus anything it calls, must fit in the
spare space remaining in the current stack segment.
Used to protect routines such as the stack splitting code itself.
</li>
<li>
<code>RODATA</code> = 8
<br>
(For <code>DATA</code> and <code>GLOBL</code> items.)

			if allocs > 1 {
				t.Errorf("Replace(%q, %q, %q, %d) allocates %.2f objects", tt.in, tt.old, tt.new, tt.n, allocs)
			}
		}
		in = append(in, "<spare>"...)
		in = in[:len(tt.in)]
		out := Replace(in, old, new, tt.n)
		if s := string(out); s != tt.out {
			t.Errorf("Replace(%q, %q, %q, %d) = %q, want %q", tt.in, tt.old, tt.new, tt.n, s, tt.out)
		}

pkg syscall (freebsd-arm64), type Stat_t struct, Rdev uint64
pkg syscall (freebsd-arm64), type Stat_t struct, Size int64
pkg syscall (freebsd-arm64), type Stat_t struct, Spare [10]uint64
pkg syscall (freebsd-arm64), type Stat_t struct, Uid uint32
pkg syscall (freebsd-arm64), type Statfs_t struct
pkg syscall (freebsd-arm64), type Statfs_t struct, Asyncreads uint64

pkg syscall (freebsd-riscv64), type Stat_t struct, Rdev uint64 #53466
pkg syscall (freebsd-riscv64), type Stat_t struct, Size int64 #53466
pkg syscall (freebsd-riscv64), type Stat_t struct, Spare [10]uint64 #53466
pkg syscall (freebsd-riscv64), type Stat_t struct, Uid uint32 #53466
pkg syscall (freebsd-riscv64), type Statfs_t struct #53466
pkg syscall (freebsd-riscv64), type Statfs_t struct, Asyncreads uint64 #53466

================================================================

github.com/cespare/xxhash/v2
https://github.com/cespare/xxhash/v2
----------------------------------------------------------------
Copyright (c) 2016 Caleb Spare

MIT License

Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and associated documentation files (the