final int size = accessResultList.size();
            dataService.update(accessResultList);
            accessResultList.clear();
            final long time = systemHelper.getCurrentTimeAsLong() - execTime;
            if (logger.isDebugEnabled()) {
                logger.debug("Updated {} access results. The execution time is {}ms.", size, time);
            }
            return time;

func (z *MRFReplicateEntries) MarshalMsg(b []byte) (o []byte, err error) {
	o = msgp.Require(b, z.Msgsize())
	// map header, size 2
	// string "e"
	o = append(o, 0x82, 0xa1, 0x65)
	o = msgp.AppendMapHeader(o, uint32(len(z.Entries)))
	for za0001, za0002 := range z.Entries {
		o = msgp.AppendString(o, za0001)
		// map header, size 3
		// string "b"
		o = append(o, 0x83, 0xa1, 0x62)
		o = msgp.AppendString(o, za0002.Bucket)
		// string "o"

     *
     * @return the version
     */
    public final int getVersion() {
        return this.version;
    }

    /**
     * Gets the size of this referral entry in bytes.
     *
     * @return the size
     */
    public final int getSize() {
        return this.size;
    }

    /**
     * Gets the server type of this referral.
     *
     * @return the serverType
     */

        writeLittleEndianInt(baos, PacConstants.LOGON_INFO); // type
        writeLittleEndianInt(baos, 10); // size
        writeLittleEndianLong(baos, 25); // Unaligned offset (not multiple of 8)
        // Add enough data to avoid array bounds issues
        while (baos.size() < 35) {
            baos.write(0);
        }
        byte[] pacData = baos.toByteArray();

  int size;

  // use concrete classes to remove any possible polymorphic overhead?
  Object[] array;
  ArrayList<Object> arrayList;
  LinkedList<Object> linkedList;

  @BeforeExperiment
  void setUp() {
    array = new Object[size];
    arrayList = Lists.newArrayListWithCapacity(size);
    linkedList = new LinkedList<>();

    for (int i = 0; i < size; i++) {
      Object value = new Object();

    int len = string.length();
    int size = len * count;
    char[] array = new char[size];
    string.getChars(0, len, array, 0);
    int n;
    for (n = len; n < size - n; n <<= 1) {
      System.arraycopy(array, 0, array, n, n);
    }
    System.arraycopy(array, 0, array, n, size - n);
    return new String(array);
  }

        request.setIndex(index);
        return this;
    }

    /**
     * Sets the size of results for the request.
     * @param size The size.
     * @return This builder instance.
     */
    public PopularWordsRequestBuilder setSize(final int size) {
        request.setSize(size);
        return this;
    }

    /**
     * Adds a tag to filter by.
     * @param tag The tag.

    }

    /**
     * Get the standard lease size for encoding/decoding
     * @return the standard lease context size
     */
    protected int getStandardLeaseSize() {
        // Standard lease V2 size: LeaseKey(16) + LeaseState(4) + Flags(4) + reserved fields
        return 32;
    }

    @Override
    public int size() {
        // Context header: 16 bytes
        // Name: 4 bytes ("DLse")

    /**
     * Gets the last access time.
     *
     * @return the last access time in milliseconds since epoch
     */
    long lastAccess();

    /**
     * Gets the file size.
     *
     * @return the file size in bytes
     */
    long length();

    /**
     * Gets the file index.
     *
     * @return the file index inside the parent directory
     */
    int getFileIndex();

        DictionaryFile.PagingList<StopwordsItem> result = stopwordsFile.selectList(10, 2);
        // When offset is out of bounds, all items may still be returned
        assertTrue(result.size() <= 5);
        assertEquals(6, result.getCurrentPageNumber()); // offset 10 with size 2 = page 6
        assertEquals(2, result.getPageSize());
        assertEquals(5, result.getAllRecordCount());
    }

    public void test_selectList_negativeOffset() {