}
        esCb.request().build(builder);
        SearchResponse response = esCb.build(builder).execute().actionGet(scrollSearchTimeout);
        String scrollId = response.getScrollId();
        int count = 0;
        try {
            while (scrollId != null) {
                final SearchHits searchHits = getSearchHits(response);
                final SearchHit[] hits = searchHits.getHits();

            int count = 0;
            try {
                while (scrollId != null) {
                    final SearchHit[] hits = response.getHits().getHits();
                    if (hits.length == 0) {
                        break;
                    }
                    for (final SearchHit hit : hits) {
                        array[count] = hit.getSourceAsMap();

	return 0, &fs.PathError{Op: "read", Path: d.e.name, Err: errors.New("is a directory")}
}

func (d *openDir) ReadDir(count int) ([]fs.DirEntry, error) {
	n := len(d.files) - d.offset
	if count > 0 && n > count {
		n = count
	}
	if n == 0 {
		if count <= 0 {
			return nil, nil
		}
		return nil, io.EOF
	}
	list := make([]fs.DirEntry, n)
	for i := range list {

         * The number of shares in the array.
         */
        public int count;
        /**
         * Array of ShareInfo0 structures containing share information.
         */
        public ShareInfo0[] array;

        @Override
        public void encode(NdrBuffer _dst) throws NdrException {
            _dst.align(4);
            _dst.enc_ndr_long(this.count);
            _dst.enc_ndr_referent(this.array, 1);

        super(config, command);
        this.subCommand = subcommand;
    }

    /**
     * Gets the data count for this transaction response
     * @return the dataCount
     */
    protected final int getDataCount() {
        return this.dataCount;
    }

    /**
     * Sets the data count for this transaction response
     * @param dataCount
     *            the dataCount to set
     */

    }

    // Test getBucketOrder with count.desc
    @Test
    public void test_getBucketOrder_countDesc() {
        facetInfo.sort = "count.desc";
        BucketOrder order = facetInfo.getBucketOrder();
        assertNotNull(order);
        assertEquals(BucketOrder.count(false), order);
    }

    // Test getBucketOrder with count.asc
    @Test
    public void test_getBucketOrder_countAsc() {

			// appear earlier in this array of intervals, see
			// ObjectsHistogramIntervals
			splCount += count
			fallthrough
		default:
			res[szInt.name] = count
		}
	}
	return res
}

// add a version count to the histogram.
func (h *versionsHistogram) add(versions uint64) {
	// Fetch the histogram interval corresponding
	// to the passed object size.

            @SuppressWarnings("unchecked")
            final List<String> existingKinds = (List<String>) kindsObj;
            concatValues(existingKinds, Stream.of(item.getKinds()).map(SuggestItem.Kind::toString).toArray(count -> new String[count]));
            map.put(FieldNames.KINDS, existingKinds);
        } else {
            map.put(FieldNames.KINDS, Stream.of(item.getKinds()).map(SuggestItem.Kind::toString).toArray());
        }

func ARM64RegisterShift(reg, op, count int16) (int64, error) {
	// the base register of shift operations must be general register.
	if reg > arm64.REG_R31 || reg < arm64.REG_R0 {
		return 0, errors.New("invalid register for shift operation")
	}
	return int64(reg&31)<<16 | int64(op)<<22 | int64(uint16(count)), nil
}

  // Java 9. This function is just returns the same result that
  // Arrays.equals(array1, 0, count, array2, 0, count) would. It assumes that both arrays have a
  // length of at least count.
  private static boolean arraysEqual(byte[] array1, byte[] array2, int count) {
    for (int i = 0; i < count; i++) {
      if (array1[i] != array2[i]) {
        return false;
      }
    }
    return true;
  }