getCsvEncoding()))) { L160: badWordService.importCsv(reader); L161: suggestHelper.storeAllBadWords(false); L162: } catch (final Exception e) { L163: throw new FessSystemException("Failed to import data.", e); L164: } L165: }); L166: return asJson(new ApiResult.ApiResponse().status(ApiResult.Status.OK).result()); L167: } L168: L169: // GET /api/admin/badword/download L170: @Execute L171: public StreamResponse get$download(final...

example, {@code copyOf(copyOf(anArrayList))} should copy the data only L131: * once. This reduces the expense of habitually making defensive copies at API boundaries. L132: * However, the precise conditions for skipping the copy operation are undefined. L133: * <li><b>Warning:</b> a view collection such as {@link ImmutableMap#keySet} or {@link L134: * ImmutableList#subList} may retain a reference to the entire data set, preventing it from L135: * being garbage collected....

trackFailure( L84: call: RealCall, L85: e: IOException?, L86: ) L87: L88: fun noNewExchanges() L89: L90: fun cancel() L91: } L92: L93: companion object { L94: /** L95: * The timeout to use while discarding a stream of input data. Since this is used for connection L96: * reuse, this timeout should be significantly less than the time it takes to establish a new L97: * connection. L98: */ L99: const val DISCARD_STREAM_TIMEOUT_MILLIS = 100 L100: } L101:}...

</ol> L33: </div> L34: </div> L35: </div> L36: </div> L37: <section class="content"> L38: <la:form action="/admin/badword/upload/" enctype="multipart/form-data"> L39: <div class="row"> L40: <div class="col-md-12"> L41: <div class="card card-outline card-success"> L42: <div class="card-header"> L43: <h3 class="card-title">...

out whether to use the network, the cache, or L40: * both. L41: * L42: * Selecting a cache strategy may add conditions to the request (like the "If-Modified-Since" header L43: * for conditional GETs) or warnings to the cached response (if the cached data is potentially L44: * stale). L45: */ L46:class CacheStrategy internal constructor( L47: /** The request to send on the network, or null if this call doesn't use the network. */ L48: val networkRequest: Request?, L49: /** The cached response to...

L117: // it. To preserve FIFO order and failure atomicity of rejected execution when the same L118: // Runnable is executed more than once, allocate a wrapper that we know is safe to remove by L119: // object identity. L120: // A data structure that returned a removal handle from add() would allow eliminating this L121: // allocation. L122: submittedTask = L123: new Runnable() { L124: @Override L125: public void run() { L126: ...

input to read L62: * @return a long of a concatenated 8 bytes L63: */ L64: static long load64Safely(byte[] input, int offset, int length) { L65: long result = 0; L66: // Due to the way we shift, we can stop iterating once we've run out of data, the rest L67: // of the result already being filled with zeros. L68: L69: // This loop is critical to performance, so please check HashBenchmark if altering it. L70: int limit = min(length, 8); L71: for (int i = 0; i < limit; i++) { L72:...

L117: // it. To preserve FIFO order and failure atomicity of rejected execution when the same L118: // Runnable is executed more than once, allocate a wrapper that we know is safe to remove by L119: // object identity. L120: // A data structure that returned a removal handle from add() would allow eliminating this L121: // allocation. L122: submittedTask = L123: new Runnable() { L124: @Override L125: public void run() { L126: ...

(); L881: keyToKeyList = Maps.newLinkedHashMap(); L882: int size = stream.readInt(); L883: for (int i = 0; i < size; i++) { L884: @SuppressWarnings("unchecked") // reading data stored by writeObject L885: K key = (K) stream.readObject(); L886: @SuppressWarnings("unchecked") // reading data stored by writeObject L887: V value = (V) stream.readObject(); L888: put(key, value); L889: } L890: } L891: L892: @GwtIncompatible // java serialization not supported L893:...

ons.CanIgnoreReturnValue; L23:import java.util.AbstractSet; L24:import java.util.Iterator; L25:import java.util.Map; L26:import java.util.Map.Entry; L27:import java.util.Set; L28:import javax.annotation.CheckForNull; L29: L30:/** L31: * A map-like data structure that wraps a backing map and caches values while iterating through L32: * {@link #unmodifiableKeySet()}. By design, the cache is cleared when this structure is mutated. If L33: * this structure is never mutated, it provides a thread-safe...