assertThat(matcher.toString()).isEqualTo(expectedNormal);
    assertThat(matcher.negate().negate().toString()).isEqualTo(expectedNormal);

    // The precomputed form is different on regular platforms but the same on j2cl and j2kt.
    // Hence isAnyOf here.
    assertThat(matcher.precomputed().toString()).isAnyOf(expectedNormal, expectedPrecomputed);
    assertThat(matcher.negate().precomputed().negate().toString())

  Iterator<C> createColumnKeyIterator() {
    return new ColumnKeyIterator();
  }

  private final class ColumnKeyIterator extends AbstractIterator<C> {
    // Use the same map type to support TreeMaps with comparators that aren't
    // consistent with equals().
    final Map<C, V> seen = factory.get();
    final Iterator<Map<C, V>> mapIterator = backingMap.values().iterator();

        ROUND_ROBIN,      // Rotate through channels
        LEAST_LOADED,     // Select least busy channel
        WEIGHTED_RANDOM,  // Random selection weighted by score
        AFFINITY_BASED,   // Stick to same channel for related operations
        ADAPTIVE         // Dynamically adjust based on performance
    }
    
    public ChannelLoadBalancer(ChannelManager manager) {
        this.manager = manager;

           * increased to look for separators beyond this point, without changing the start position
           * of the next returned substring -- so nextStart stays the same.
           */
          offset++;
          if (offset > toSplit.length()) {
            offset = -1;
          }
          continue;
        }

 * average, in the marking phase, not {@code 5.0} as in {@code java.util.HashSet}.
 *
 * <p>If there are no removals, then {@link #iterator iteration} order is the same as insertion
 * order. Any removal invalidates any ordering guarantees.
 *
 * <p>This class should not be assumed to be universally superior to {@code java.util.HashSet}.

            { (byte) 0x4b, (byte) 0x47, (byte) 0x53, (byte) 0x21, (byte) 0x40, (byte) 0x23, (byte) 0x24, (byte) 0x25 };

    /* Accepts key multiple of 7
     * Returns enc multiple of 8
     * Multiple is the same like: 21 byte key gives 24 byte result
     */
    private static void E(final byte[] key, final byte[] data, final byte[] e) {
        final byte[] key7 = new byte[7];
        final byte[] e8 = new byte[8];

  /** Helper method that asserts the arithmetic mean of x and y is equal to the expectedMean. */
  private static void assertMean(int expectedMean, int x, int y) {
    assertEquals(
        "The expectedMean should be the same as computeMeanSafely",
        expectedMean,
        computeMeanSafely(x, y));
    assertMean(x, y);
  }

  /**
   * Helper method that asserts the arithmetic mean of x and y is equal to the result of

    assertThat(multimap.entries().spliterator().characteristics() & Spliterator.DISTINCT)
        .isEqualTo(0);
  }

  // Yes, we want to test that inverse() returns the same instance each time that it's called.
  @SuppressWarnings("SelfAssertion")
  public void testInverseMinimizesWork() {
    ImmutableListMultimap<String, Character> multimap =

            buffer.putInt(4);
            buffer.putInt(1024);

            // When
            fileFsFullSizeInfo.decode(buffer.array(), 0, 32);

            // Then - multiple calls should return same values
            assertEquals(2000L * 4 * 1024, fileFsFullSizeInfo.getCapacity());
            assertEquals(2000L * 4 * 1024, fileFsFullSizeInfo.getCapacity());

        fireEvent(ResolutionListener.TEST_ARTIFACT, listeners, node);

        Object key = node.getKey();

        // TODO Does this check need to happen here? Had to add the same call
        // below when we iterate on child nodes -- will that suffice?
        if (managedVersions.containsKey(key)) {
            manageArtifact(node, managedVersions, listeners);
        }