- Sort Score
- Num 10 results
- Language All
Results 1 - 10 of 44 for overhead (0.04 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
docs/en/docs/benchmarks.md
* If you didn't use FastAPI and used Starlette directly (or another tool, like Sanic, Flask, Responder, etc) you would have to implement all the data validation and serialization yourself. So, your final application would still have the same overhead as if it was built using FastAPI. And in many cases, this data validation and serialization...
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Thu Mar 05 18:13:19 GMT 2026 - 3.4K bytes - Click Count (0) -
src/test/java/org/codelibs/fess/helper/DataIndexHelperTest.java
private static final long serialVersionUID = 1L; @Override public int getCrawlingThreadCount() { return 1; // Reduced from 2 to minimize thread overhead } @Override public String getIndexFieldConfigId() { return "config_id"; } @OverrideCreated: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Fri Mar 13 23:01:26 GMT 2026 - 12.9K bytes - Click Count (0) -
architecture/standards/0002-avoid-using-java-serialization.md
This is due to Java's use of reflection and the need to maintain a lot of metadata. - **Size of Serialized Data:** Java serialization tends to produce larger serialized objects because it includes class metadata and other overhead. - **Flexibility and Control:** Java serialization offers limited control over the serialization process, such as excluding certain fields, customizing naming conventions, and handling complex data structures more gracefully.
Created: Wed Apr 01 11:36:16 GMT 2026 - Last Modified: Thu Mar 05 14:05:45 GMT 2026 - 2.3K bytes - Click Count (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/Headers.kt
* intended to be used as a metric: smaller headers are more efficient to encode and transmit. */ fun byteCount(): Long { // Each header name has 2 bytes of overhead for ': ' and every header value has 2 bytes of // overhead for '\r\n'. var result = (namesAndValues.size * 2).toLong() for (i in 0 until namesAndValues.size) { result += namesAndValues[i].length.toLong() }
Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Tue Feb 03 22:17:59 GMT 2026 - 11.6K bytes - Click Count (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/WebSocket.kt
/** Returns the original request that initiated this web socket. */ fun request(): Request /** * Returns the size in bytes of all messages enqueued to be transmitted to the server. This * doesn't include framing overhead. If compression is enabled, uncompressed messages size * is used to calculate this value. It also doesn't include any bytes buffered by the operating
Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Tue Mar 10 21:45:14 GMT 2026 - 6.1K bytes - Click Count (0) -
src/main/java/org/codelibs/fess/crawler/serializer/DataSerializer.java
* type is determined by the crawler data serializer configuration. * </p> * <p> * The class is thread-safe and uses ThreadLocal to maintain Kryo instances * per thread to avoid synchronization overhead. * </p> * */ public class DataSerializer { /** Logger for this class. */ private static final Logger logger = LogManager.getLogger(DataSerializer.class);Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sat Jan 10 01:54:09 GMT 2026 - 10.5K bytes - Click Count (3) -
android/guava/src/com/google/common/math/Quantiles.java
* form}), the memory requirement is 8*N bytes for the copy of the dataset plus an overhead which is * independent of N (but depends on the quantiles being computed). When calling {@link * ScaleAndIndex#computeInPlace computeInPlace} (in {@linkplain ScaleAndIndexes#computeInPlace * either form}), only the overhead is required. The number of object allocations is independent of * N in both cases. *Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Mar 23 21:06:42 GMT 2026 - 30.1K bytes - Click Count (0) -
src/test/java/org/codelibs/fess/helper/SearchHelperTest.java
byte[] decompressed = searchHelper.gzipDecompress(compressed); assertEquals(testData, new String(decompressed)); // For small strings, gzip overhead might make compressed data larger // So we just verify that compression/decompression works correctly assertNotNull(compressed); assertTrue(compressed.length > 0); }
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Fri Mar 13 23:01:26 GMT 2026 - 19.2K bytes - Click Count (0) -
src/main/java/org/codelibs/core/crypto/CachedCipher.java
/** * A high-performance utility class for encrypting and decrypting data using cached {@link Cipher} instances. * <p> * This class provides efficient encryption/decryption by pooling and reusing cipher instances, * reducing the overhead of repeated cipher initialization. It supports both string-based keys * and {@link Key} objects, with configurable algorithms and character encodings. * </p> * <p> * <strong>Key Features:</strong> * </p> * <ul>Created: Fri Apr 03 20:58:12 GMT 2026 - Last Modified: Sat Nov 22 11:21:59 GMT 2025 - 15.9K bytes - Click Count (0) -
android/guava/src/com/google/common/primitives/ImmutableLongArray.java
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Fri Dec 12 14:49:24 GMT 2025 - 22K bytes - Click Count (0)