*
   * <p>This method refines {@link Collection#add}, which only <i>ensures</i> the presence of the
   * element, to further specify that a successful call must always increment the count of the
   * element, and the overall size of the collection, by one.
   *
   * <p>To both add the element and obtain the previous count of that element, use {@link

*[SeedSize]byte) { // CTR_DRBG_Update, per Section 10.2.1.2. temp := make([]byte, SeedSize) c.c.XORKeyStream(temp, seed[:]) K := temp[:keySize] V := temp[keySize:] // Again, we pre-increment V, like in NewCounter. increment((*[aes.BlockSize]byte)(V)) cipher, err := aes.New(K) if err != nil { panic(err) } c.c = *aes.NewCTR(cipher, V) } func increment(v *[aes.BlockSize]byte) { hi := byteorder.BEUint64(v[:8]) lo := byteorder.BEUint64(v[8:]) lo, c := bits.Add64(lo, 1, 0) hi, _ = bits.Add64(hi, 0, c) byteorder.BEPutUint64(v[:8],...

    // clear absent
    assertFalse(segment.clearValueForTesting(key, hash, valueRef));

    segment.setTableEntryForTesting(0, entry);
    // don't increment count; this is used during computation
    assertTrue(segment.clearValueForTesting(key, hash, valueRef));
    // no notification sent with clearValue
    assertEquals(0, segment.count);
    assertThat(table.get(0)).isNull();

    // clear absent
    assertFalse(segment.clearValueForTesting(key, hash, valueRef));

    segment.setTableEntryForTesting(0, entry);
    // don't increment count; this is used during computation
    assertTrue(segment.clearValueForTesting(key, hash, valueRef));
    // no notification sent with clearValue
    assertEquals(0, segment.count);
    assertThat(table.get(0)).isNull();

  - If the custom resource participates the spec/status convention, the metadata.generation of the CR increments when there is any change, except for the changes to the metadata or the changes to the status.
  - If the custom resource does not participate the spec/status convention, the metadata.generation of the CR increments when there is any change to the CR, except for changes to the metadata.

func TestManyToManyPreloadWithMultiPrimaryKeys(t *testing.T) {
	if name := DB.Dialector.Name(); name == "sqlite" || name == "sqlserver" {
		t.Skip("skip sqlite, sqlserver due to it doesn't support multiple primary keys with auto increment")
	}

	if name := DB.Dialector.Name(); name == "mysql" {
		t.Skip("skip mysql due to it only allow unique constraint matching given keys")
	}

	type (
		Level1 struct {

*[SeedSize]byte) { // CTR_DRBG_Update, per Section 10.2.1.2. temp := make([]byte, SeedSize) c.c.XORKeyStream(temp, seed[:]) K := temp[:keySize] V := temp[keySize:] // Again, we pre-increment V, like in NewCounter. increment((*[aes.BlockSize]byte)(V)) cipher, err := aes.New(K) if err != nil { panic(err) } c.c = *aes.NewCTR(cipher, V) } func increment(v *[aes.BlockSize]byte) { hi := byteorder.BEUint64(v[:8]) lo := byteorder.BEUint64(v[8:]) lo, c := bits.Add64(lo, 1, 0) hi, _ = bits.Add64(hi, 0, c) byteorder.BEPutUint64(v[:8],...

     *
     * @param <E> the element type of {@link Vector}
     * @param initialCapacity the initial capacity of the vector
     * @param capacityIncrement the capacity increment when the vector overflows
     * @return a new instance of {@link Vector}
     * @see Vector#Vector(int, int)
     */
    public static <E> Vector<E> newVector(final int initialCapacity, final int capacityIncrement) {

         *
         * @return The directory context.
         */
        public DirContext get() {
            return context;
        }

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

        @Override
        public void close() {
            if (counter > 1) {

// size `nx`.
//
// Gradient nodes are automatically named under the "gradients/" prefix. To
// guarantee name uniqueness, subsequent calls to the same graph will
// append an incremental tag to the prefix: "gradients_1/", "gradients_2/", ...
// See TF_AddGradientsWithPrefix, which provides a means to specify a custom
// name prefix for operations added to a graph to compute the gradients.
//