panic("crypto/cipher: incorrect nonce length given to GCM") } counter := byteorder.BEUint64(nonce[len(nonce)-8:]) if !g.ready { // In the first call, the counter is zero, so we learn the XOR mask. g.ready = true g.mask = counter } counter ^= g.mask // Ensure the counter is monotonically increasing. if counter == math.MaxUint64 { panic("crypto/cipher: counter wrapped") } if counter < g.next { panic("crypto/cipher: counter decreased") } g.next = counter + 1 fips140.RecordApproved() return g.g.sealAfterIndicator(dst,...

import java.util.Iterator;
import java.util.NavigableSet;
import org.jspecify.annotations.Nullable;

/**
 * This class provides a skeletal implementation of the {@link SortedMultiset} interface.
 *
 * <p>The {@link #count} and {@link #size} implementations all iterate across the set returned by
 * {@link Multiset#entrySet()}, as do many methods acting on the set returned by {@link
 * #elementSet()}. Override those methods for better performance.
 *

     * This method applies search conditions from the pager and updates the pager with
     * pagination information including page numbers and result counts.
     *
     * @param fileConfigPager the pager containing search criteria and pagination settings
     * @return a list of file configurations matching the criteria
     */

    return isEmpty() ? null : getEntry(0);
  }

  @Override
  public @Nullable Entry<E> lastEntry() {
    return isEmpty() ? null : getEntry(length - 1);
  }

  @Override
  public int count(@Nullable Object element) {
    int index = elementSet.indexOf(element);
    return (index >= 0) ? getCount(index) : 0;
  }

  @Override
  public int size() {

        });
    }

    /**
     * Gets the total number of documents that match the specified query.
     *
     * @param searchEngineClient the search engine client to use for the count
     * @param queryBuilder the query to count documents for
     * @param fessConfig the Fess configuration
     * @return the number of documents that match the query
     */

			if testCase.result != gotGCD {
				t.Errorf("Expected %v, got %v", testCase.result, gotGCD)
			}
		})
	}
}

// Test tests calculating set indexes with ENV override for drive count.
func TestGetSetIndexesEnvOverride(t *testing.T) {
	testCases := []struct {
		args        []string
		totalSizes  []uint64
		indexes     [][]uint64
		envOverride uint64
		success     bool
	}{
		{

        assertEquals(sampleTimeMillis + serverTimeZoneOffset, response.getLastWriteTime());
        assertEquals(1024, response.getSize());
    }

    /**
     * Test of readParameterWordsWireFormat method with zero word count.
     */
    @Test
    public void testReadParameterWordsWireFormatWithZeroWordCount() {
        byte[] buffer = new byte[20];
        response.wordCount = 0;

   * </ul>
   *
   * @throws IllegalArgumentException if {@code node} is not an element of this network
   */
  Set<E> outEdges(N node);

  /**
   * Returns the count of {@code node}'s {@link #incidentEdges(Object) incident edges}, counting
   * self-loops twice (equivalently, the number of times an edge touches {@code node}).
   *
   * <p>For directed networks, this is equal to {@code inDegree(node) + outDegree(node)}.
   *

            return context;
        }

        /**
         * Increments the counter.
         */
        public void inc() {
            counter++;
        }

        @Override
        public void close() {
            if (counter > 1) {
                counter--;
            } else {
                try {
                    if (context != null) {

        }

        @Test
        @DisplayName("Binary constructor happy path and round-trip via toByteArray")
        void testBinaryConstructorAndToByteArray() {
            // Arrange: revision=1, count=2, identAuth zeros except last byte, subauth 10, 20
            byte[] ident = new byte[] { 0, 0, 0, 0, 0, 5 };
            rpc.sid_t st = buildSidT((byte) 1, ident, 10, 20);

            byte[] bytes = SID.toByteArray(st);