verify(mockNdrBuffer).align(4);
        verify(mockNdrBuffer).enc_ndr_long(transSidArray.count);
        verify(mockNdrBuffer).enc_ndr_referent(transSidArray.sids, 1);

        verify(mockDeferredNdrBuffer).enc_ndr_long(transSidArray.count);
        verify(mockDeferredNdrBuffer).advance(12 * transSidArray.count);
        verify(transSidArray.sids[0]).encode(any(NdrBuffer.class)); // Buffer reassignment happens inside encode

         * Number of DFS entries in the array
         */
        public int count;
        /**
         * Array of DFS information level 1 structures
         */
        public DfsInfo1[] s;

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

labels.searchlog_log_type_search_keyword=Keyword Count
labels.searchlog_log_type_search_zerohit=Zero Hit Count
labels.searchlog_log_type_search_zeroclick=Zero Click Count
labels.searchlog_log_type_search_count_hour=Search Count/Hour
labels.searchlog_log_type_search_count_day=Search Count/Day
labels.searchlog_log_type_search_user_hour=User Count/Hour
labels.searchlog_log_type_search_user_day=User Count/Day

			[in] uint32_t access_mask,
			[in] sid_t *sid,
			[out] policy_handle *domain_handle);

	typedef struct {
		uint32_t idx;
		unicode_string name;
	} SamrSamEntry;

	typedef struct {
		uint32_t count;
		[size_is(count)] SamrSamEntry *entries;
	} SamrSamArray;

	[op(0x0f)]
	int SamrEnumerateAliasesInDomain([in] policy_handle *domain_handle,
			[in,out] uint32_t *resume_handle,
			[in] uint32_t acct_flags,

     * Gets the total number of records that match the search criteria.
     *
     * @return The total record count
     */
    public long getAllRecordCount() {
        return allRecordCount;
    }

    /**
     * Gets the relation type indicating how the record count should be interpreted.
     *
     * @return The record count relation (e.g., "eq" for exact, "gte" for greater than or equal)
     */

    void testGetEntries_largeNumberOfRoots() throws Exception {
        // Create array with many entries
        int count = 100;
        netdfs.DfsEnumArray200 largeArray = new netdfs.DfsEnumArray200();
        largeArray.count = count;
        largeArray.s = new netdfs.DfsInfo200[count];

        for (int i = 0; i < count; i++) {
            netdfs.DfsInfo200 entry = new netdfs.DfsInfo200();
            entry.dfs_name = "share_" + i;

     *
     * @param allRecordCount The total record count
     */
    public void setAllRecordCount(final long allRecordCount) {
        this.allRecordCount = allRecordCount;
    }

    /**
     * Sets the relation type for the record count (e.g., "eq", "gte").
     *
     * @param allRecordCountRelation The record count relation
     */

            samr.SamrSamArray array = new samr.SamrSamArray();
            when(mockNdrBuffer.dec_ndr_long()).thenReturn(0, 0); // count, _entriesp = 0

            // When: Decoding array
            array.decode(mockNdrBuffer);

            // Then: Should have null entries
            assertEquals(0, array.count);
            assertNull(array.entries);
        }

        @Test

                }
                file.send(reqx, rspx);
                fp += rspx.count;
                len -= rspx.count;
                off += rspx.count;
            } else {
                req.setParam(file.fid, fp, len - w, b, off, w);
                fp += rsp.count;
                len -= rsp.count;
                off += rsp.count;
                file.send(req, rsp);
            }
        } while (len > 0);

		Avg:  a.Avg,
		Max:  a.Max,
	}
	return w
}

// QStat holds queue stats for replication
type QStat struct {
	Count float64 `json:"count"`
	Bytes float64 `json:"bytes"`
}

func (q *QStat) add(o QStat) QStat {
	return QStat{Bytes: q.Bytes + o.Bytes, Count: q.Count + o.Count}
}

// InQueueMetric holds queue stats for replication
type InQueueMetric struct {
	Curr QStat `json:"curr" msg:"cq"`