* case, we must take care not to "backtrack" over an edge (i.e. going from A to B and then going
   * from B to A).
   */
  private static boolean canTraverseWithoutReusingEdge(
      Graph<?> graph, Object nextNode, @Nullable Object previousNode) {
    if (graph.isDirected() || !Objects.equals(previousNode, nextNode)) {
      return true;
    }
    // This falls into the undirected A->B->A case. The Graph interface does not support parallel

    //                                                                              ======
    @Override
    public Map<String, Object> toSource() {
        Map<String, Object> sourceMap = new HashMap<>();
        if (boostExpr != null) {
            addFieldToSource(sourceMap, "boostExpr", boostExpr);
        }
        if (createdBy != null) {

        String testPluginArtifactId = "maven-compiler-plugin";

        // this is the plugin we're looking for.
        validPluginCounts.put(testPluginArtifactId, 0);

        // these are injected if -DperformRelease=true
        validPluginCounts.put("maven-deploy-plugin", 0);
        validPluginCounts.put("maven-javadoc-plugin", 0);
        validPluginCounts.put("maven-source-plugin", 0);

    //                                                                              ======
    @Override
    public Map<String, Object> toSource() {
        Map<String, Object> sourceMap = new HashMap<>();
        if (boost != null) {
            addFieldToSource(sourceMap, "boost", boost);
        }
        if (createdBy != null) {

     */
    public void store(final String dictId, final StopwordsItem stopwordsItem) {
        getStopwordsFile(dictId).ifPresent(file -> {
            if (stopwordsItem.getId() == 0) {
                file.insert(stopwordsItem);
            } else {
                file.update(stopwordsItem);
            }
        });
    }

    /**
     * Deletes a stopword item from the specified dictionary.
     *

     */
    public void store(final String dictId, final SynonymItem synonymItem) {
        getSynonymFile(dictId).ifPresent(file -> {
            if (synonymItem.getId() == 0) {
                file.insert(synonymItem);
            } else {
                file.update(synonymItem);
            }
        });
    }

    /**
     * Deletes a synonym item from the specified dictionary.
     *

    //                                                                              ======
    @Override
    public Map<String, Object> toSource() {
        Map<String, Object> sourceMap = new HashMap<>();
        if (endTime != null) {
            addFieldToSource(sourceMap, "endTime", endTime);
        }
        if (jobName != null) {

    return {"fresh_value": fresh_value}
```

////

## Recapitulando

Com exceção de todas as palavras complicadas usadas aqui, o sistema de **Injeção de Dependência** é bastante simples.

Consiste apenas de funções que parecem idênticas a *funções de operação de rota*.

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

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

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

 *
 * <p>
 * The class is a singleton, and is injected using the {@link Resource} annotation.
 * </p>
 *
 */
public class DataServiceImpl implements DataService<AccessResultImpl<Long>> {

    /** Counter for generating unique IDs */
    protected static volatile long idCount = 0L;

    /** Lock object for synchronizing access to idCount */
    private static Object idCountLock = new Object();