generator.filePathMap.put("${temp}", "/tmp");
        assertEquals("/tmp", generator.expandPath("${temp}"));
        assertEquals("${temp}/file", generator.expandPath("${temp}/file")); // No partial replacement
    }

    @Test
    public void test_directoryNameLength() {
        // Test directoryNameLength setter
        generator = new TestThumbnailGenerator();

        // Default value

   *     instead.
   */
  @InlineMe(replacement = "this.contains(input)")
  @Deprecated
  @Override
  public boolean apply(C input) {
    return contains(input);
  }

  /**
   * @deprecated Provided only to satisfy the {@link java.util.function.Predicate} interface; use
   *     {@link #contains} instead.
   * @since 21.0
   */
  @InlineMe(replacement = "this.contains(input)")
  @Deprecated

## Migration depuis un autre fournisseur de recherche

Veuillez consulter [MIGRATION.md](MIGRATION.md).

## Data Store

Actuellement, Fess prend en charge le parcours des [emplacements de stockage et API](https://fess.codelibs.org/15.3/admin/dataconfig-guide.html) suivants :

 - [Confluence/Jira](https://github.com/codelibs/fess-ds-atlassian)
 - [Box](https://github.com/codelibs/fess-ds-box)

	if err != nil {
		return err
	}
	defer ch.Close()

	eventData, eErr := target.store.Get(key)
	if eErr != nil {
		// The last event key in a successful batch will be sent in the channel atmost once by the replayEvents()
		// Such events will not exist and wouldve been already been sent successfully.
		if os.IsNotExist(eErr) {
			return nil
		}
		return eErr
	}

	}
	switch {
	case key.ItemCount == 1:
		var event event.Event
		event, err = target.store.Get(key)
		if err != nil {
			// The last event key in a successful batch will be sent in the channel atmost once by the replayEvents()
			// Such events will not exist and wouldve been already been sent successfully.
			if os.IsNotExist(err) {
				return nil
			}
			return err
		}
		err = target.send(event)
	case key.ItemCount > 1:

  /**
   * Returns a hash code for {@code value}; obsolete alternative to {@link Integer#hashCode(int)}.
   *
   * @param value a primitive {@code int} value
   * @return a hash code for the value
   */
  @InlineMe(replacement = "Integer.hashCode(value)")
  @InlineMeValidationDisabled(
      "The hash code of a int is the int itself, so it's simplest to return that.")
  public static int hashCode(int value) {
    return value;
  }

  /**

 */
@GwtIncompatible // not worth using in GWT for now
class CompactHashMap<K extends @Nullable Object, V extends @Nullable Object>
    extends AbstractMap<K, V> implements Serializable {
  /*
   * TODO: Make this a drop-in replacement for j.u. versions, actually drop them in, and test the
   * world. Figure out what sort of space-time tradeoff we're actually going to get here with the

   * @return a string containing {@code string} repeated {@code count} times (the empty string if
   *     {@code count} is zero)
   * @throws IllegalArgumentException if {@code count} is negative
   */
  @InlineMe(replacement = "string.repeat(count)")
  @InlineMeValidationDisabled("Java 11+ API only")
  public static String repeat(String string, int count) {
    checkNotNull(string); // eager for GWT.

    if (count <= 1) {

 * used weak references, the entries are reconstructed as they were, but it's not unlikely they'll
 * be quickly garbage-collected before they are ever accessed.
 *
 * <p>{@code new MapMaker().weakKeys().makeMap()} is a recommended replacement for {@link
 * java.util.WeakHashMap}, but note that it compares keys using object identity whereas {@code
 * WeakHashMap} uses {@link Object#equals}.
 *
 * @author Bob Lee
 * @author Charles Fry

			}
			return err
		}
	}

	eventData, eErr := target.store.Get(key)
	if eErr != nil {
		// The last event key in a successful batch will be sent in the channel atmost once by the replayEvents()
		// Such events will not exist and wouldve been already been sent successfully.
		if os.IsNotExist(eErr) {
			return nil
		}
		return eErr
	}

	if err := target.send(eventData); err != nil {