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";
            }

            @Override

   * 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()
    }

 *
 * @author David Richter
 */
@NullUnmarked
public class IteratorBenchmark {
  @Param({"0", "1", "16", "256", "4096", "65536"})
  int size;

  // use concrete classes to remove any possible polymorphic overhead?
  Object[] array;
  ArrayList<Object> arrayList;
  LinkedList<Object> linkedList;

  @BeforeExperiment
  void setUp() {
    array = new Object[size];
    arrayList = Lists.newArrayListWithCapacity(size);

   *
   * <p>Although all tasks are immediately executed in the thread that submitted the task, this
   * {@code ExecutorService} imposes a small locking overhead on each task submission in order to
   * implement shutdown and termination behavior.
   *
   * <p>Because of the nature of single-thread execution, the methods {@code scheduleAtFixedRate}

   *
   * <p>Although all tasks are immediately executed in the thread that submitted the task, this
   * {@code ExecutorService} imposes a small locking overhead on each task submission in order to
   * implement shutdown and termination behavior.
   *
   * <p>Because of the nature of single-thread execution, the methods {@code scheduleAtFixedRate}

 * 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);

- **Memory efficient** - Specialized collections like `LruHashMap` and `ArrayMap` for memory-conscious applications
- **Java 21 features** - Switch expressions and pattern matching for reduced overhead

## 🧪 Building and Testing

### Development Setup
```bash
# Clone the repository
git clone https://github.com/codelibs/corelib.git
cd corelib

# Compile the project
mvn clean compile

        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);
    }

 * 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.
 *

 *       allocating garbage).
 * </ul>
 *
 * <p>Disadvantages compared to {@code long[]}:
 *
 * <ul>
 *   <li>Memory footprint has a fixed overhead (about 24 bytes per instance).
 *   <li><i>Some</i> construction use cases force the data to be copied (though several construction
 *       APIs are offered that don't).