assertTrue(e.getCause() instanceof NullPointerException || e.getCause() instanceof ContainerNotAvailableException);
        } finally {
            tempPropFile.delete();
        }
    }

    public void test_process_withoutPropertiesPath() throws Exception {
        // Test process method without properties path

import org.codelibs.fess.unit.UnitFessTestCase;
import org.codelibs.fess.util.FacetResponse;
import org.opensearch.search.aggregations.Aggregations;
import org.opensearch.search.aggregations.InternalAggregations;
import org.dbflute.optional.OptionalThing;

public class RankFusionSearcherTest extends UnitFessTestCase {

    private SearchRequestParams createTestSearchRequestParams() {
        return new SearchRequestParams() {
            @Override

				return
			}
			if z.TargetsMap == nil {
				z.TargetsMap = make(map[string]TargetReplicationResyncStatus, zb0002)
			} else if len(z.TargetsMap) > 0 {
				for key := range z.TargetsMap {
					delete(z.TargetsMap, key)
				}
			}
			for zb0002 > 0 {
				zb0002--
				var za0001 string
				var za0002 TargetReplicationResyncStatus
				za0001, err = dc.ReadString()
				if err != nil {

        super.tearDown();
    }

    private void deleteDirectory(Path dir) throws IOException {
        Files.walk(dir).sorted((a, b) -> b.compareTo(a)).forEach(path -> {
            try {
                Files.delete(path);
            } catch (IOException e) {
                // Ignore
            }
        });
    }

    public void test_getThemeName() {
        Artifact artifact = new Artifact("fess-theme-simple", "1.0.0");

   * @param reference any array of the desired type
   * @param length the length of the new array
   */
  /*
   * The new array contains nulls, even if the old array did not. If we wanted to be accurate, we
   * would declare a return type of `@Nullable T[]`. However, we've decided not to think too hard
   * about arrays for now, as they're a mess. (We previously discussed this in the review of
   * ObjectArrays, which is the main caller of this method.)

        sb.append(dm).append(sortOrder);
        sb.append(dm).append(updatedBy);
        sb.append(dm).append(updatedTime);
        if (sb.length() > dm.length()) {
            sb.delete(0, dm.length());
        }
        sb.insert(0, "{").append("}");
        return sb.toString();
    }

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

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

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

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

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

        assertEquals(value1, settings.badword().get(false)[0]);
        assertEquals(value2, settings.badword().get(false)[1]);
        assertEquals(value3, settings.badword().get(false)[2]);

        settings.badword().delete(value2);
        assertEquals(2, settings.badword().get(false).length);
        assertEquals(value1, settings.badword().get(false)[0]);
        assertEquals(value3, settings.badword().get(false)[1]);

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

Mas ainda assim, é bastante poderoso, e permite que você declare grafos (árvores) de dependências com uma profundidade arbitrária.

/// tip | Dica

Tudo isso pode não parecer muito útil com esses exemplos.

Mas você verá o quão útil isso é nos capítulos sobre **segurança**.