if l.root.next == nil {
		l.Init()
	}
}

// insert inserts e after at, increments l.len, and returns e.
func (l *LruList[K, V]) insert(e, at *Entry[K, V]) *Entry[K, V] {
	e.prev = at
	e.next = at.next
	e.prev.next = e
	e.next.prev = e
	e.list = l
	l.len++
	return e
}

// insertValue is a convenience wrapper for insert(&Entry{Value: v, ExpiresAt: ExpiresAt}, at).

        return getCharMappingFile(dictId).map(file -> file.get(id).get());
    }

    /**
     * Stores a character mapping item in the specified dictionary.
     * <p>
     * This method performs either an insert operation (for new items with ID 0)
     * or an update operation (for existing items with non-zero ID) depending on
     * the item's current state.
     * </p>
     *

        << entry.InitializationErrorString();
    for (int i = 0; i < entry.slices_size(); ++i) {
      const auto& slice_proto = entry.slices(i);
      CHECK(filtered_keys
                .insert(EncodeTensorNameSlice(
                    string(v2_reader_->key()) /* full var's name */,
                    TensorSlice(slice_proto)))
                .second);
    }
  }

        return crawlingInfoBhv.selectByPK(id);
    }

    /**
     * Stores (inserts or updates) a crawling information record.
     * Sets up the store conditions including creation time if not already set,
     * then performs an insert or update operation with immediate refresh.
     *
     * @param crawlingInfo the crawling information entity to store

     *
     * @param group the group entity to store
     */
    public void store(final Group group) {
        ComponentUtil.getLdapManager().insert(group);

        groupBhv.insertOrUpdate(group, op -> {
            op.setRefreshPolicy(Constants.TRUE);
        });

    }

    /**

     * @return an optional containing the item if found
     */
    public abstract OptionalEntity<T> get(long id);

    /**
     * Inserts a new dictionary item.
     *
     * @param item the item to insert
     */
    public abstract void insert(T item);

    /**
     * Updates an existing dictionary item.
     *
     * @param item the item to update
     */

            // Mock implementation that doesn't require client
            entity.setLastUpdated(System.currentTimeMillis());
        }

        @Override
        public void insert(JobLog entity) {
            // Mock implementation that doesn't require client
            entity.setLastUpdated(System.currentTimeMillis());
        }

        @Override
        public void update(JobLog entity) {

            unencodedCharsFunnel(), numInsertions, 0.03, BloomFilterStrategies.MURMUR128_MITZ_32);

    // Insert "numInsertions" even numbers into the BF.
    for (int i = 0; i < numInsertions * 2; i += 2) {
      bf.put(Integer.toString(i));
    }
    assertApproximateElementCountGuess(bf, numInsertions);

    // Assert that the BF "might" have all of the even numbers.
    for (int i = 0; i < numInsertions * 2; i += 2) {

            // write log
            if (fessConfig.isLoggingSearchUseLogfile()) {
                searchLogList.forEach(this::writeSearchLogEvent);
            }
            // insert search log
            storeSearchLogList(searchLogList);
            // update suggest index
            if (fessConfig.isSuggestSearchLog()) {

                        do {
                            if (path == null) {
                                /* Store references to the map and key so that
                                 * SmbFile.resolveDfs can re-insert the dr list with
                                 * the dr that was successful so that subsequent
                                 * attempts to resolve DFS use the last successful