// Verify structure size
            assertEquals(41, SMBUtil.readInt2(buffer, 64));

            // Verify info type and file info class
            // setFileInfoClass sets the info type to SMB2_0_INFO_FILE (1)
            assertEquals(Smb2Constants.SMB2_0_INFO_FILE, buffer[66]);
            assertEquals((byte) 0x08, buffer[67]);

            // Verify output buffer length

    ImmutableSortedSet<Integer> set = ContiguousSet.create(Range.closed(1, 3), integers());
    for (Set<Integer> subset : Sets.powerSet(ImmutableSet.of(1, 2, 3))) {
      assertTrue(set.containsAll(subset));
    }
    for (Set<Integer> subset : Sets.powerSet(ImmutableSet.of(1, 2, 3))) {
      assertFalse(set.containsAll(Sets.union(subset, ImmutableSet.of(9))));
    }
  }

		t.Fatalf("Unable to initialize server config. %s", err)
	}

	defer removeRoots(fsDirs)

	z := obj.(*erasureServerPools)
	er := z.serverPools[0].sets[0]

	// Create "bucket"
	err = obj.MakeBucket(ctx, "bucket", MakeBucketOptions{})
	if err != nil {
		t.Fatal(err)
	}

	bucket := "bucket"
	object := "object"

		nerrs = 1
	}
	if wks > nerrs {
		wks = nerrs
	}
	wk, _ := workers.New(wks)
	return &NotificationGroup{errs: make([]NotificationPeerErr, nerrs), workers: wk, retryCount: 3}
}

// WithRetries sets the retry count for all function calls from the Go method.
func (g *NotificationGroup) WithRetries(retryCount int) *NotificationGroup {
	if g != nil {
		g.retryCount = retryCount
	}
	return g
}

            throw new ParserConfigurationRuntimeException(e);
        } catch (final SAXException e) {
            throw new SAXRuntimeException(e);
        }
    }

    /**
     * Sets the enable/disable state of XInclude.
     *
     * @param spf
     *            {@link SAXParserFactory}. Must not be {@literal null}.
     * @param state
     *            <code>true</code> to enable XInclude.

    int destSize = dest.length;
    int destIndex = 0;
    int lastEscape = 0;

    // Loop through the rest of the string, replacing when needed into the
    // destination buffer, which gets grown as needed as well.
    for (; index < slen; index++) {

      // Get a replacement for the current character.
      char[] r = escape(s.charAt(index));

      // If no replacement is needed, just continue.

        return len;

    }

    @Override
    public String toString() {
        return ("TransTransactNamedPipeResponse[" + super.toString() + "]");
    }

    /**
     * Gets the length of the response data received from the named pipe.
     *
     * @return response data length
     */
    public int getResponseLength() {
        return getDataCount();
    }

     */
    public DictionaryManager() {
        // Default constructor
    }

    /**
     * Initializes the dictionary manager after construction.
     * Sets up the relationship between this manager and all registered creators.
     */
    @PostConstruct
    public void init() {
        if (logger.isDebugEnabled()) {

          .put(1, 0x8199675ecaa6fe64L)
          .put(0, 0x23ad7c904aa665e3L)
          .build();
  private static final HashFunction HASH_FN = Hashing.fingerprint2011();

  // If this test fails, all bets are off
  @SuppressWarnings("InlineMeInliner") // String.repeat unavailable under Java 8
  public void testReallySimpleFingerprints() {
    assertEquals(8473225671271759044L, fingerprint("test".getBytes(UTF_8)));

          intersection(newFeatures, earlierFeatures),
          source);
    }
  }

  /**
   * Construct a new {@link java.util.Set} that is the intersection of the given sets.
   *
   * @deprecated Use {@link com.google.common.collect.Sets#intersection(Set, Set)} instead.
   */
  @Deprecated
  public static <T> Set<T> intersection(Set<? extends T> set1, Set<? extends T> set2) {
    Set<T> result = copyToSet(set1);