final URL url = new URL(null, "zip:/Program Files/foo.zip!/", new URLStreamHandler() {
            @Override
            protected void parseURL(final URL u, final String spec, final int start, final int limit) {
                setURL(u, "zip", null, 0, null, null, spec.substring(4), null, null);
            }

            @Override
            protected URLConnection openConnection(final URL u) throws IOException {

 */
public class NdrLong extends NdrObject {

    /**
     * The long integer value.
     */
    public int value;

    /**
     * Constructs an NdrLong with the specified value.
     *
     * @param value the long integer value
     */
    public NdrLong(final int value) {
        this.value = value;
    }

    @Override
    public void encode(final NdrBuffer dst) throws NdrException {

        this.scope = scope;

        addScopeInternal(scope);
    }

    public String getScope() {
        return scope;
    }

    @Override
    public int hashCode() {
        int hash = 17;

        hash = hash * 31 + (scope != null ? scope.hashCode() : 0);

        return hash;
    }

    @Override
    public boolean equals(Object obj) {
        if (this == obj) {

        }

        @Override
        public int getRemotePort() {
            return 0;
        }

        @Override
        public String getLocalName() {
            return null;
        }

        @Override
        public String getLocalAddr() {
            return null;
        }

        @Override
        public int getLocalPort() {
            return 0;
        }

    UNIFORM_0_TO_2(0, 2),
    UNIFORM_0_TO_9(0, 9),
    ALWAYS_0(0, 0),
    ALWAYS_10(10, 10);

    final int min;
    final int max;

    ListSizeDistribution(int min, int max) {
      this.min = min;
      this.max = max;
    }

    public int chooseSize(Random random) {
      return random.nextInt(max - min + 1) + min;
    }
  }

  private BenchmarkHelpers() {}

    }

    /**
     * Force cleanup of all resources
     *
     * @return number of resources cleaned
     */
    public int forceCleanup() {
        log.info("Forcing cleanup of all resources");

        int cleaned = 0;
        for (ResourceHolder holder : activeResources.values()) {
            if (!holder.closed) {
                AutoCloseable resource = holder.resourceRef.get();

	// The real disk
	disk StorageAPI
	// Programmed errors: API call number => error to return
	errors map[int]error
	// The error to return when no error value is programmed
	defaultErr error
	// The current API call number
	callNR int
	// Data protection
	mu sync.Mutex
}

func newNaughtyDisk(d StorageAPI, errs map[int]error, defaultErr error) *naughtyDisk {
	return &naughtyDisk{disk: d, errors: errs, defaultErr: defaultErr}
}

      Object[] duplicated = new Object[elements.length * 2];
      for (int i = 0; i < elements.length; i++) {
        duplicated[i] = elements[i];
        duplicated[i + elements.length] = elements[i];
      }
      return ((Multiset<E>) gen.create(duplicated)).elementSet();
    }

    @Override
    public E[] createArray(int length) {
      return gen.createArray(length);
    }

    @Override

    expected.addAll(asList(elements));
    expectContents(expected);
  }

  protected final void expectAdded(int index, E... elements) {
    expectAdded(index, asList(elements));
  }

  protected final void expectAdded(int index, Collection<E> elements) {
    List<E> expected = copyToList(getSampleElements());
    expected.addAll(index, elements);
    expectContents(expected);
  }

    };
  }

  @Override
  public int degree(N node) {
    if (isDirected()) {
      return IntMath.saturatedAdd(inEdges(node).size(), outEdges(node).size());
    } else {
      return IntMath.saturatedAdd(incidentEdges(node).size(), edgesConnecting(node, node).size());
    }
  }

  @Override
  public int inDegree(N node) {
    return isDirected() ? inEdges(node).size() : degree(node);