// value seen so far
    while (cache.getUnchecked(nextRandomKey()) < maximumSize) {}

    requests.set(0);
    misses.set(0);
  }

  @Benchmark
  int time(int reps) {
    int dummy = 0;
    for (int i = 0; i < reps; i++) {
      dummy += cache.getUnchecked(nextRandomKey());
    }
    requests.addAndGet(reps);
    return dummy;
  }

  private int nextRandomKey() {

 * elements FIFO (first-in-first-out). The head of the queue is that element that has been
 * on the queue the longest time. The tail of the queue is that element that has been on
 * the queue the shortest time. New elements are inserted at the tail of the queue, and the queue
 * retrieval operations obtain elements at the head of the queue.
 *

 * either express or implied. See the License for the specific language
 * governing permissions and limitations under the License.
 */
package org.codelibs.fess.opensearch.log.bsentity.dbmeta;

import java.time.LocalDateTime;
import java.util.List;
import java.util.Map;

import org.codelibs.fess.opensearch.log.exentity.UserInfo;
import org.dbflute.Entity;
import org.dbflute.dbmeta.AbstractDBMeta;

 * either express or implied. See the License for the specific language
 * governing permissions and limitations under the License.
 */
package org.codelibs.fess.opensearch.config.bsentity;

import java.time.LocalDateTime;
import java.util.HashMap;
import java.util.Map;

import org.codelibs.fess.opensearch.config.allcommon.EsAbstractEntity;
import org.codelibs.fess.opensearch.config.bsentity.dbmeta.PathMappingDbm;

/**

     * @return property name
     */
    @Nonnull
    String property() default "";

    /**
     * parameter default value, may contain <code>${...}</code> expressions which will be interpreted at
     * inject time: see
     * <a href="/ref/current/maven-core/apidocs/org/apache/maven/plugin/PluginParameterExpressionEvaluator.html">
     * PluginParameterExpressionEvaluator</a>.
     * @return the default value
     */
    @Nonnull

        // Referral flags (2 bytes)
        SMBUtil.writeInt2(0, buffer, 14);

        // Proximity (2 bytes for v3)
        SMBUtil.writeInt2(0, buffer, 16);

        // Time to live (2 bytes for v3)
        SMBUtil.writeInt2(300, buffer, 18);

        // DFS path offset (2 bytes) - points to string data
        SMBUtil.writeInt2(stringDataStart - 8, buffer, 20); // Offset from start of referral

   * types. CharBuffer has poor performance when being written into or read out of so round tripping
   * all the bytes through the buffer takes a long time. With these specialized types we can just
   * use a char array.
   *
   * @param from the object to read from
   * @param to the object to write to
   * @return the number of characters copied

        long create = 1600000000000L;
        long lastAccess = 1600000100000L;
        long lastWrite = 1600000200000L;
        long change = 1600000300000L;
        int attributes = 0x1234;
        // Convert Unix time to Windows FILETIME (100-nanosecond intervals since 1601)
        long MILLISECONDS_BETWEEN_1970_AND_1601 = 11644473600000L;
        writeLong(buffer, 0, (create + MILLISECONDS_BETWEEN_1970_AND_1601) * 10000L);

    return new MinimalIterable<>(asList(elements).iterator());
  }

  /**
   * Returns an iterable whose iterator returns the given elements in order. The elements are copied
   * out of the source collection at the time this method is called.
   */
  @SuppressWarnings("unchecked") // Es come in, Es go out
  public static <E extends @Nullable Object> MinimalIterable<E> from(Collection<E> elements) {

import java.lang.reflect.Constructor;
import java.lang.reflect.Field;
import java.lang.reflect.Method;
import java.lang.reflect.Type;
import java.lang.reflect.TypeVariable;
import java.sql.Time;
import java.sql.Timestamp;
import java.util.Collection;
import java.util.Map;

import org.codelibs.core.beans.BeanDesc;
import org.codelibs.core.beans.ParameterizedClassDesc;