// evict 9, 1, 2, 10
    getAll(cache, asList(15));
    CacheTesting.drainRecencyQueues(cache);
    assertThat(keySet).containsExactly(0, 6, 7, 8, 15);

    // fill empty space
    getAll(cache, asList(9));
    CacheTesting.drainRecencyQueues(cache);
    assertThat(keySet).containsExactly(0, 6, 7, 8, 15, 9);

    // evict 6
    getAll(cache, asList(1));

    if (elements instanceof ImmutableCollection) {
      /*
       * TODO: When given an ImmutableList that's a sublist, copy the referenced
       * portion of the array into a new array to save space?
       */
      @SuppressWarnings("unchecked") // all supported methods are covariant
      ImmutableCollection<E> list = (ImmutableCollection<E>) elements;
      return list.asList();
    }

        long expectedCapacity = alloc * sectPerAlloc * bytesPerSect;
        assertEquals(expectedCapacity, smbInfoAllocation.getCapacity());

        // Verify free space calculation: free * sectPerAlloc * bytesPerSect
        long expectedFree = free * sectPerAlloc * bytesPerSect;
        assertEquals(expectedFree, smbInfoAllocation.getFree());
    }

    @Test

		if disk == nil {
			continue
		}
		if di, err := disk.DiskInfo(ctx, opts); err == nil {
			res[i] = &di
		}
	}
	return res
}

// hasSpaceFor returns whether the disks in `di` have space for and object of a given size.
func hasSpaceFor(di []*DiskInfo, size int64) (bool, error) {
	// We multiply the size by 2 to account for erasure coding.
	size *= 2
	if size < 0 {

          override fun encode(
            writer: DerWriter,
            value: String,
          ) = writer.writeUtf8(value)
        },
    )

  /**
   * Permits alphanumerics, spaces, and these:
   *
   * ```
   *   ' () + , - . / : = ?
   * ```
   *
   * TODO(jwilson): constrain to printable string characters.
   */
  val PRINTABLE_STRING =
    BasicDerAdapter(

   * uniform, the actual concurrency observed may vary. Ideally, you should choose a value to
   * accommodate as many threads as will ever concurrently modify the table. Using a significantly
   * higher value than you need can waste space and time, and a significantly lower value can lead
   * to thread contention. But overestimates and underestimates within an order of magnitude do not

        int offsetSize = 4;
        int remarkSize = remark.length() + 1;
        int totalSize = shareNameSize + typeSize + offsetSize + remarkSize;

        byte[] buffer = new byte[totalSize + 100]; // Extra space for safety
        int bufferIndex = 0;
        int start = 0;

        // Set converter value first
        setConverter(response, 0);

        // Set number of entries
        setNumEntries(response, 1);

        return createValidBuffer(filename, shortName, false);
    }

    private byte[] createValidBufferWithNullTermination(String filename, String shortName, boolean unicode) {
        // Create buffer with extra space for null termination
        int filenameLength = unicode ? (filename.length() * 2) + 2 : filename.length() + 1;
        byte[] buffer = new byte[94 + filenameLength];

        // Set default values

sorfold.no
sorocaba.br
sorreisa.no
sortland.no
sorum.no
sos.pl
sosa.chiba.jp
sosnowiec.pl
soundcast.me
sowa.ibaraki.jp
soy
sp.gov.br
sp.it
sp.leg.br
spa
space
space-to-rent.com
spacekit.io
spb.ru
spb.su
spdns.de
spdns.eu
spdns.org
sphinx.mythic-beasts.com
spjelkavik.no
spock.replit.dev
sport
sport.hu
spot
spydeberg.no

        assertEquals("test{}|\\", result);

        result = systemHelper.encodeUrlFilter("test^path");
        assertEquals("test^path", result);

        result = systemHelper.encodeUrlFilter("test space");
        assertEquals("test+space", result);
    }

    @Test
    public void test_normalizeLang_caseVariations() {
        assertEquals("ja", systemHelper.normalizeLang("JA"));