return relatedQueryBhv.selectByPK(id);
    }

    /**
     * Stores (inserts or updates) a related query in the database.
     * After storing, the related query helper is updated to refresh the cache.
     *
     * @param relatedQuery the RelatedQuery entity to store
     */
    public void store(final RelatedQuery relatedQuery) {

	dt.logEntry(duration)
}

// LogFailure logs an action that hit the timeout
func (dt *dynamicTimeout) LogFailure() {
	dt.logEntry(maxDuration)
}

// logEntry stores a log entry
func (dt *dynamicTimeout) logEntry(duration time.Duration) {
	if duration < 0 {
		return
	}
	entries := int(atomic.AddInt64(&dt.entries, 1))
	index := entries - 1
	if index < dynamicTimeoutLogSize {

#
# Specification:
# map: {
#     [table-name or $$ALL$$] = map:{
#         ; [column-name (with hint)]=[classification-name]
#     }
# }
#
# *The line that starts with '#' means comment-out.
#
map:{
    #; $$ALL$$       = map:{suffix:_FLG=Flg}
}

## Overview

        return getStopwordsFile(dictId).map(file -> file.get(id).get());
    }

    /**
     * Stores a stopword item in the specified dictionary.
     *
     * @param dictId        The ID of the dictionary.
     * @param stopwordsItem The stopword item to store.
     */
    public void store(final String dictId, final StopwordsItem stopwordsItem) {
        getStopwordsFile(dictId).ifPresent(file -> {

        return getSynonymFile(dictId).map(file -> file.get(id).get());
    }

    /**
     * Stores a synonym item in the specified dictionary.
     *
     * @param dictId      The ID of the dictionary.
     * @param synonymItem The synonym item to store.
     */
    public void store(final String dictId, final SynonymItem synonymItem) {
        getSynonymFile(dictId).ifPresent(file -> {

package org.codelibs.core.collection;

import java.util.AbstractSet;
import java.util.ConcurrentModificationException;
import java.util.Iterator;
import java.util.Set;

/**
 * A {@link Set} implementation that stores its elements in a {@link LruHashMap}.
 * <p>
 * This set has a fixed maximum capacity. When the capacity is reached and a new element is added,
 * the least recently used element is removed.
 * </p>
 * @author shinsuke

	md5hex := getMD5Hash(textData)
	sha256hex := ""

	// benchmark utility which helps obtain number of allocations and bytes allocated per ops.
	b.ReportAllocs()
	// the actual benchmark for PutObject starts here. Reset the benchmark timer.

	for i := 0; b.Loop(); i++ {
		// insert the object.
		objInfo, err := obj.PutObject(b.Context(), bucket, "object"+strconv.Itoa(i),

event_system = s3.meta.events
event_system.register_first('before-sign.s3.*', _add_header)

# List zip contents
response = s3.list_objects_v2(Bucket="your-bucket", Prefix="path/to/file.zip/")
print(response)

# Download data.csv stored in the zip file

          double z = aa.getAndAccumulate(i, y, Double::sum);
          assertBitEquals(x, z);
          assertBitEquals(x + y, aa.get(i));
        }
      }
    }
  }

  /** getAndAccumulate with max stores max of given value to current, and returns previous value */
  public void testGetAndAccumulateWithMax() {
    AtomicDoubleArray aa = new AtomicDoubleArray(SIZE);
    for (int i : new int[] {0, SIZE - 1}) {