final int start = dstIndex;

        dst[dstIndex] = (byte) 0x01; /* BufferFormat */
        dstIndex++;
        writeInt2(count, dst, dstIndex); /* DataLength? */
        dstIndex += 2;
        System.arraycopy(b, off, dst, dstIndex, count);
        dstIndex += count;

        return dstIndex - start;
    }

    @Override
    int readParameterWordsWireFormat(final byte[] buffer, final int bufferIndex) {

  public int setCount(@ParametricNullness E element, int count) {
    return delegate().setCount(element, count);
  }

  @CanIgnoreReturnValue
  @Override
  public boolean setCount(@ParametricNullness E element, int oldCount, int newCount) {
    return delegate().setCount(element, oldCount, newCount);
  }

  /**
   * A sensible definition of {@link #contains} in terms of {@link #count}. If you override {@link

  }

  public void testAddAndGet() {
    Count holder = new Count(20);
    assertEquals(21, holder.addAndGet(1));
  }

  public void testGetAndSet() {
    Count holder = new Count(10);
    assertEquals(10, holder.getAndSet(20));
    assertEquals(20, holder.get());
  }

  public void testSet() {
    Count holder = new Count(10);
    holder.set(20);
    assertEquals(20, holder.get());
  }

        newEntry =
            canReuseEntry ? (ImmutableEntry<E>) entry : new ImmutableEntry<E>(element, count);
      } else {
        newEntry = new NonTerminalEntry<>(element, count, bucketHead);
      }
      hashCode += hash ^ count;
      entryArray[index++] = newEntry;
      hashTable[bucket] = newEntry;
      size += count;
    }

    return hashFloodingDetected(hashTable)

import org.junit.Before;
import org.junit.Test;

/**
 * @author taedium
 */
public class ClassTraversalTest {

    private static int count = 0;

    /**
     * @throws Exception
     */
    @Before
    public void setUp() throws Exception {
        count = 0;
    }

    /**
     * @throws Exception
     */
    @Test
    public void testForEachJarFile() throws Exception {

	latest := int64(0)

	// Find the common cardinality from previously collected
	// occurrences of elements.
	for nano, count := range timeOccurrenceMap {
		if count < maxima {
			continue
		}

		// We are at or above maxima
		if count > maxima || nano > latest {
			maxima = count
			latest = nano
		}
	}

	// Return the collected common max time, with maxima
	return time.Unix(0, latest).UTC(), maxima

    }

    /**
     * Gets the number of prompt tokens.
     *
     * @return the prompt tokens count
     */
    public Integer getPromptTokens() {
        return promptTokens;
    }

    /**
     * Sets the number of prompt tokens.
     *
     * @param promptTokens the prompt tokens count
     */
    public void setPromptTokens(final Integer promptTokens) {
        this.promptTokens = promptTokens;
    }

            final int count = searchLogHelper.getClickCount(url);
            doc.put(fessConfig.getIndexFieldClickCount(), count);
            if (logger.isDebugEnabled()) {
                logger.debug("Click count: count={}, url={}", count, url);
            }
        }
    }

    /**
     * Adds a favorite count field to the document based on user favorite data.

    protected static void waitJob(final String namePrefix) {
        Boolean isRunning = false;
        int count = 0;
        long sleepTime = 50; // Start with 50ms

        // Wait until the crawler starts (with exponential backoff)
        while (count < 1500 && !isRunning) {
            ThreadUtil.sleep(sleepTime);
            count++;
            final Map<String, Object> scheduler = getSchedulerItem(namePrefix);

		t.Fatalf("failed to delete person, got error: %v", err)
	}

	if count := DB.Unscoped().Model(&person2).Association("Addresses").Count(); count != 2 {
		t.Errorf("person's addresses expects 2, got %v", count)
	}

	if count := DB.Model(&person2).Association("Addresses").Count(); count != 0 {
		t.Errorf("person's addresses expects 2, got %v", count)
	}