*
   * <p><b>Note:</b> This tests exact equality of the calculated statistics, including the floating
   * point values. Two instances are guaranteed to be considered equal if one is copied from the
   * other using {@code second = new PairedStatsAccumulator().addAll(first).snapshot()}, if both
   * were obtained by calling {@code snapshot()} on the same {@link PairedStatsAccumulator} without

        // Path consumed (2 bytes)
        SMBUtil.writeInt2(10, buffer, 0);

        // Number of referrals (2 bytes)
        SMBUtil.writeInt2(numReferrals, buffer, 2);

        // Flags (2 bytes) - not using FLAGS_NAME_LIST_REFERRAL to avoid special name handling
        SMBUtil.writeInt2(0, buffer, 4);

        // Padding (2 bytes)
        buffer[6] = 0;
        buffer[7] = 0;

        // Add referrals

	reader, err := sanitizePolicy(r)
	if err != nil {
		return PostPolicyForm{}, err
	}

	d := json.NewDecoder(reader)

	// Convert po into interfaces and
	// perform strict type conversion using reflection.
	var rawPolicy struct {
		Expiration string `json:"expiration"`
		Conditions []any  `json:"conditions"`
	}

	d.DisallowUnknownFields()
	if err := d.Decode(&rawPolicy); err != nil {

      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
      PARTICULAR PURPOSE. You are solely responsible for determining the
      appropriateness of using or redistributing the Work and assume any
      risks associated with Your exercise of permissions under this License.

   8. Limitation of Liability. In no event and under no legal theory,

      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
      PARTICULAR PURPOSE. You are solely responsible for determining the
      appropriateness of using or redistributing the Work and assume any
      risks associated with Your exercise of permissions under this License.

   8. Limitation of Liability. In no event and under no legal theory,

The capacity of a slice <code>a</code> can be discovered using the
built-in function <a href="#Length_and_capacity"><code>cap(a)</code></a>.
</p>

<p>
A new, initialized slice value for a given element type <code>T</code> may be
made using the built-in function
<a href="#Making_slices_maps_and_channels"><code>make</code></a>,
which takes a slice type

                log.debug("It appears we previously lost some credits");
            }

            if (this.smb2 || this.getContext().getConfig().isUseSMB2OnlyNegotiation()) {
                log.debug("Using SMB2 only negotiation");
                return negotiate2(null);
            }

            final SmbComNegotiate comNeg = new SmbComNegotiate(getContext().getConfig(), this.signingEnforced);

    assertThat(graphAsMutableGraph.putEdge(N2, N1)).isFalse();
  }

  /**
   * Tests that the method {@code putEdge} will silently add the missing nodes to the graph, then
   * add the edge connecting them. We are not using the proxy methods here as we want to test {@code
   * putEdge} when the end-points are not elements of the graph.
   */
  @Test
  public void putEdge_nodesNotInGraph() {
    assume().that(graphIsMutable()).isTrue();

        assertInstanceOf(SmbShareInfo.class, entries[1]);
        assertEquals("normal_share", entries[1].getName());
        assertEquals(8, entries[1].getType());
    }

    // Helper method to set DfsEnumArray using reflection
    private void setDfsEnumArray(MsrpcDfsRootEnum target, netdfs.DfsEnumArray200 array) throws Exception {
        Field eField = netdfs.DfsEnumStruct.class.getDeclaredField("e");
        eField.setAccessible(true);

	}
	if err != nil {
		logger.Fatal(err, "Unable to generate root access key using KMS")
	}

	sKey, err := GlobalKMS.MAC(GlobalContext, &kms.MACRequest{Message: []byte("root secret key")})
	if err != nil {
		// Here, we must have permission. Otherwise, we would have failed earlier.
		logger.Fatal(err, "Unable to generate root secret key using KMS")
	}

	accessKey, err := auth.GenerateAccessKey(20, bytes.NewReader(aKey))