sb.append(dm).append(value);
        sb.append(dm).append(virtualHost);
        if (sb.length() > dm.length()) {
            sb.delete(0, dm.length());
        }
        sb.insert(0, "{").append("}");
        return sb.toString();
    }

    // ===================================================================================

     */
    public OptionalEntity<BoostDocumentRule> getBoostDocumentRule(final String id) {
        return boostDocumentRuleBhv.selectByPK(id);
    }

    /**
     * Stores (inserts or updates) a boost document rule.
     * @param boostDocumentRule The boost document rule to store.
     */
    public void store(final BoostDocumentRule boostDocumentRule) {

        sb.append(dm).append(startTime);
        sb.append(dm).append(target);
        if (sb.length() > dm.length()) {
            sb.delete(0, dm.length());
        }
        sb.insert(0, "{").append("}");
        return sb.toString();
    }

    // ===================================================================================

   * <p>For <i>small</i> immutable maps, the {@code ImmutableMap.of()} methods are even more
   * convenient.
   *
   * <p>By default, a {@code Builder} will generate maps that iterate over entries in the order they
   * were inserted into the builder, equivalently to {@code LinkedHashMap}. For example, in the
   * above example, {@code WORD_TO_INT.entrySet()} is guaranteed to iterate over the entries in the

        super.insert(accessResult, accessResult.getId() == null ? OpType.CREATE : OpType.INDEX);
    }

    /**
     * Updates an access result in the OpenSearch index.
     *
     * @param accessResult The access result to update.
     */
    @Override
    public void update(final OpenSearchAccessResult accessResult) {
        super.insert(accessResult, OpType.INDEX);
    }

    /**

    return ElementOrder.stable();
  }

  private static <N> ImmutableMap<N, GraphConnections<N, Presence>> getNodeConnections(
      Graph<N> graph) {
    // ImmutableMap.Builder maintains the order of the elements as inserted, so the map will have
    // whatever ordering the graph's nodes do, so ImmutableSortedMap is unnecessary even if the
    // input nodes are sorted.

        sb.append(dm).append(threadName);
        sb.append(dm).append(url);
        if (sb.length() > dm.length()) {
            sb.delete(0, dm.length());
        }
        sb.insert(0, "{").append("}");
        return sb.toString();
    }

    // ===================================================================================

    }

    @Test
    public void test_insert() {
        // Create new item for insertion
        ProtwordsItem newItem = new ProtwordsItem(0, "newWord");

        // Insert the item
        protwordsFile.insert(newItem);

        // Verify the item was added
        protwordsFile.reload(null);
        boolean found = false;
        PagingList<ProtwordsItem> list = protwordsFile.selectList(0, 100);

    #
    #; repsEnvType = ut
    # - - - - - - - - - -/

    # /- - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    # o isLoggingInsertSql: (NotRequired - Default true)
    #  Does it show insert values on log?
    #
    #; isLoggingInsertSql = true
    # - - - - - - - - - -/

    # /- - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    # o isLoggingReplaceSql: (NotRequired - Default true)

        sb.append(dm).append(url);
        sb.append(dm).append(userSessionId);
        if (sb.length() > dm.length()) {
            sb.delete(0, dm.length());
        }
        sb.insert(0, "{").append("}");
        return sb.toString();
    }

    // ===================================================================================