p.Elem().Set(rv)
			results = append(results, p.Interface())
		} else if rv.IsValid() {
			results = append(results, rv.Interface())
		}
	}

	// Process each argument; if an argument is a slice/array, expand its elements
	for _, value := range values {
		rv := reflect.ValueOf(value)
		if rv.Kind() == reflect.Slice || rv.Kind() == reflect.Array {
			for i := 0; i < rv.Len(); i++ {
				appendToResult(rv.Index(i))
			}

// due to a missing new pool. This function tries to handle this
// scenario, albeit rare it seems to have occurred in the wild.
//
// since we do not explicitly disallow it, but it is okay for them
// expand and then we continue to rebalance.
func (z *erasureServerPools) updateRebalanceStats(ctx context.Context) error {
	var ok bool
	for i := range z.serverPools {
		if z.findIndex(i) == -1 {

getStackFrames(Throwable); static String[] getStackFrames(String); static java.util.List getStackFrameList(Throwable); static void <clinit>(); } org/codehaus/plexus/util/Expand.class package org.codehaus.plexus.util; public synchronized class Expand { private java.io.File dest; private java.io.File source; private boolean overwrite; public void Expand(); public void execute() throws Exception; protected void expandFile(java.io.File, java.io.File) throws Exception; protected void extractFile(java.io.File, java.io.File,...

        && ipString.charAt(ipString.length() - 2) != IPV6_DELIMITER) {
      return null; // :$ requires ::$
    }
    if (hasSkip && partsSkipped <= 0) {
      return null; // :: must expand to at least one '0'
    }
    if (!hasSkip && delimiterCount + 1 != IPV6_PART_COUNT) {
      return null; // Incorrect number of parts
    }

    ByteBuffer rawBytes = ByteBuffer.allocate(2 * IPV6_PART_COUNT);

)

# DO NOT ADD ANY NEW EXCEPTIONS TO THIS LIST!
# Instead, please use public APIs or public build rules TF provides.
# If you need functionality that is not exposed, we will work with you to expand our public APIs.
# TODO(b/173549186): Move Google-internal TF code out of learning/brain
package_group(
    name = "internal",
    packages = [
        "//devtools/python/indexer/...",

    }.start();

    // give the second get a chance to run; it is okay for this to be racy
    // as the end result should be the same either way
    thirdSignal.await();
    Thread.yield();

    // Expand!
    CacheTesting.forceExpandSegment(cache, key);

    // start another waiting thread
    new Thread() {
      @Override
      public void run() {
        fourthSignal.countDown();

    assertThat(originalMap).hasSize(originalCount);
    assertThat(map).isEqualTo(originalMap);

    for (int i = 1; i <= originalCount * 2; i *= 2) {
      if (i > 1) {
        segment.expand();
      }
      assertThat(segment.table.length()).isEqualTo(i);
      assertThat(countLiveEntries(map, 0)).isEqualTo(originalCount);
      assertThat(segment.count).isEqualTo(originalCount);

    assertThat(originalMap).hasSize(originalCount);
    assertThat(map).isEqualTo(originalMap);

    for (int i = 1; i <= originalCount * 2; i *= 2) {
      if (i > 1) {
        segment.expand();
      }
      assertThat(segment.table.length()).isEqualTo(i);
      assertThat(countLiveEntries(map, 0)).isEqualTo(originalCount);
      assertThat(segment.count).isEqualTo(originalCount);

      Java8Compatibility.clear(buf);
    }
    return total;
  }

  /** Max array length on JVM. */
  private static final int MAX_ARRAY_LEN = Integer.MAX_VALUE - 8;

  /** Large enough to never need to expand, given the geometric progression of buffer sizes. */
  private static final int TO_BYTE_ARRAY_DEQUE_SIZE = 20;

  /**
   * Returns a byte array containing the bytes from the buffers already in {@code bufs} (which have

          uniques++;
        }
      }
      Arrays.fill(sortedElements, uniques, length, null);
      if (maybeExpand && uniques * 4 > length * 3) {
        // lots of nonduplicated elements, expand the array by 50%
        sortedElements =
            Arrays.copyOf(sortedElements, IntMath.saturatedAdd(length, length / 2 + 1));
      }
      int[] sortedCounts = new int[sortedElements.length];