CharStreams.copy(reader, sb);
        }
        return sb.toString();
      }
    },
    // It really seems like this should be faster than TO_BYTE_ARRAY_NEW_STRING.  But it just isn't
    // my best guess is that the jdk authors have spent more time optimizing that callpath than this
    // one. (StringCoding$StringDecoder vs. StreamDecoder).  StringCoding has a ton of special cases

Shinsuke Sugaya <******@****.***> 1472095477 +0900

# Ensure UTF-8 encoding by default (e.g. filenames)
FESS_JAVA_OPTS="$FESS_JAVA_OPTS -Dfile.encoding=UTF-8"

# Application Configuration
if [ "x$APP_NAME" = "x" ]; then
  APP_NAME=fess
fi
if [ "x$SEARCH_ENGINE_HOME" = "x" ]; then
  SEARCH_ENGINE_HOME=$FESS_HOME/es
fi
if [ "x$FESS_TEMP_PATH" = "x" ]; then
  FESS_TEMP_PATH=$FESS_HOME/temp
fi
if [ "x$FESS_LOG_PATH" = "x" ]; then

Shinsuke Sugaya <******@****.***> 1472095477 +0900

  }

  // I guess it's technically a bug that ThrowIfUncheckedKnownUnchecked fires here.
  @SuppressWarnings("ThrowIfUncheckedKnownUnchecked")
  public void testThrowIfUnchecked_null() {
    assertThrows(NullPointerException.class, () -> throwIfUnchecked(null));
  }

  @J2ktIncompatible
  @GwtIncompatible // propagateIfPossible

	</component>
	<component name="indexingHelper" class="org.codelibs.fess.helper.IndexingHelper">
	</component>
	<component name="notificationHelper" class="org.codelibs.fess.helper.NotificationHelper">
	</component>
	<component name="pathMappingHelper" class="org.codelibs.fess.helper.PathMappingHelper">
	</component>
	<component name="permissionHelper" class="org.codelibs.fess.helper.PermissionHelper">

import java.util.LinkedList;
import junit.framework.TestCase;
import org.jspecify.annotations.NullUnmarked;
import org.jspecify.annotations.Nullable;

/**
 * Tests for {@link Synchronized#deque} and {@link Queues#synchronizedDeque}.
 *
 * @author Kurt Alfred Kluever
 */
@NullUnmarked
public class SynchronizedDequeTest extends TestCase {

  protected Deque<String> create() {
    TestDeque<String> inner = new TestDeque<>();

Matsutani Kenji <******@****.***> 1477575947 +0900

import org.codelibs.core.stream.StreamUtil;
import org.codelibs.fess.Constants;
import org.codelibs.fess.entity.FacetInfo;
import org.codelibs.fess.entity.GeoInfo;
import org.codelibs.fess.entity.HighlightInfo;
import org.codelibs.fess.entity.SearchRequestParams;
import org.codelibs.fess.mylasta.action.FessUserBean;
import org.codelibs.fess.mylasta.direction.FessConfig;
import org.codelibs.fess.util.ComponentUtil;
import org.codelibs.fess.util.DocumentUtil;

    // TODO(cpovirk): Consider using Object[] anyway.
    E[] array = (E[]) elements.toArray();
    /*
     * For a Set, we guess that it contains no duplicates. That's just a guess for purpose of
     * sizing; if the Set uses different equality semantics, it might contain duplicates according
     * to equals(), and we will deduplicate those properly, albeit at some cost in allocations.
     */