val data = ByteArray(1024 * 1024)
    var i = 0
    while (i < 1024) {
      try {
        out!!.write(data)
        out.flush()
        if (i == 513) {
          // pause slightly after half way to make result more predictable
          Thread.sleep(100)
        }
      } catch (e: IOException) {
        break
      }
      i++
    }
    // Halfway +/- 0.5%

     *
     * Property {@code jcifs.smb.client.dfs.disabled} (boolean, default false)
     *
     * @return whether DFS lookup is disabled
     */
    boolean isDfsDisabled();

    /**
     * Enable hack to make kerberos auth work with DFS sending short names
     *
     * This works by appending the domain name to the netbios short name and will fail horribly if this mapping is not
     * correct for your domain.
     *

            int behavior = random.nextInt(4);
            if (behavior == 0) { // throw an exception
              exceptionCount.incrementAndGet();
              throw new RuntimeException("fake exception for test");
            } else if (behavior == 1) { // return null
              computeNullCount.incrementAndGet();
              return null;
            } else if (behavior == 2) { // slight delay before returning

        }

        return url;
    }

    @Override
    public ArtifactResolutionResult resolve(ArtifactResolutionRequest request) {
        /*
         * Probably is not worth it, but here I make sure I restore request
         * to its original state.
         */
        try {
            LocalArtifactRepository ideWorkspace =

AA,MAAA,KAKE,8DACE,WAAA,IAAA,MAAA,QAEF,+DlGyl8BR,qEkGvl8BU,WAAA,IAAA,MAAA,KlG4l8BV,qDkGll8BM,4ClGml8BN,iEkGll8BQ,MAAA,kBlGul8BR,2DkGrl8BQ,kDlGsl8BR,uEkGrl8BU,MAAA,QlG2l8BV,8EACA,8EkGnl8BM,qElGil8BN,qEkG/k8BQ,OAAA,KlG2l8BR,uFACA,wFACA,0FACA,0FAJA,wGAJA,8EACA,+EACA,iFACA,iFkGtl8BM,+FAKE,iBAAA,QACA,MAAA,QlG2l8BR,2FkGxl8BM,kFACE,oBAAA,QlG6l8BR,oFACA,0FkG3l8BM,2ElGyl8BN,iFkGvl8BQ,iBAAA,KACA,MAAA,QArEF,sDACE,iBAAA,QAEA,sDlGoq8BR,wDkGlq8BU,MAAA,KAGF,+DACE,MAAA,QAKN,mCACE,WAAA,IAAA,MAAA,QAKE,6DACE,WAAA,...

         */
        Runnable localTask = requireNonNull(task);
        task = null;
        localTask.run();
        return;
      }
      // Executor called reentrantly! Make sure that further calls don't overflow stack. Further
      // reentrant calls will see that their current thread is the same as the one set in
      // latestTaskQueue, and queue rather than calling execute() directly.

    if (length == 0) {
      return of();
    }
    return new RegularImmutableList<E>(elements, length);
  }

  ImmutableList() {}

  // This declaration is needed to make List.iterator() and
  // ImmutableCollection.iterator() consistent.
  @Override
  public UnmodifiableIterator<E> iterator() {
    return listIterator();
  }

  @Override

    BufferedReader reader = openBufferedStream();
    return reader.lines().onClose(() -> closeUnchecked(reader));
  }

  @IgnoreJRERequirement // helper for lines()
  /*
   * If we make these calls inline inside the lambda inside lines(), we get an Animal Sniffer error,
   * despite the @IgnoreJRERequirement annotation there. For details, see ImmutableSortedMultiset.
   */

  }

  public void testAsList_toArray_roundTrip() {
    int[] array = {(int) 0, (int) 1, (int) 2};
    List<Integer> list = Ints.asList(array);
    int[] newArray = Ints.toArray(list);

    // Make sure it returned a copy
    list.set(0, (int) 4);
    assertThat(newArray).isEqualTo(new int[] {(int) 0, (int) 1, (int) 2});
    newArray[1] = (int) 5;
    assertThat((int) list.get(1)).isEqualTo((int) 1);
  }

   */
  @CanIgnoreReturnValue
  @Override
  public List<V> removeAll(@Nullable Object key) {
    /*
     * Safe because all we do is remove values for the key, not add them. (If we wanted to make sure
     * to call getCopy and removeAllNodes only with a true K, then we could check containsKey first.
     * But that check wouldn't eliminate the warnings.)
     */
    @SuppressWarnings({"unchecked", "nullness"})