Guillaume Nodet <******@****.***> 1729859506 +0200

java.util.List getSuccessorLabels(String); } org/codehaus/plexus/util/dag/TopologicalSorter.class package org.codehaus.plexus.util.dag; public synchronized class TopologicalSorter { private static final Integer NOT_VISTITED; private static final Integer VISITING; private static final Integer VISITED; public void TopologicalSorter(); public static java.util.List sort(DAG); public static java.util.List sort(Vertex); private static java.util.List dfs(DAG); private static boolean isNotVisited(Vertex, java.util.Map);...

     * </ul>
     * @throws DuplicateProjectException if any projects are duplicated by id
     */
    // MAVENAPI FIXME: the DAG used is NOT only used to represent the dependency relation,
    // but also for <parent>, <build><plugin>, <reports>. We need multiple DAG's
    // since a DAG can only handle 1 type of relationship properly.
    // Use case:  This is detected as a cycle:

    }

    @Test
    public void testPerf() throws IOException {
        List<String[]> data = new ArrayList<>();
        String k = null;
        for (String line : Files.readAllLines(Paths.get("src/test/resources/dag.txt"))) {
            if (line.startsWith("\t")) {
                data.add(new String[] {k, line.trim()});
            } else {
                k = line;
            }
        }
        Collections.shuffle(data);

labels.searchlog_log_type_search_count_day=Aantal zoekopdrachten/dag
labels.searchlog_log_type_search_user_hour=Aantal gebruikers/uur
labels.searchlog_log_type_search_user_day=Aantal gebruikers/dag
labels.searchlog_log_type_search_reqtimeavg_hour=Gemiddelde verzoektijd/uur
labels.searchlog_log_type_search_reqtimeavg_day=Gemiddelde verzoektijd/dag
labels.searchlog_log_type_click_count=Aantal klikken

 * before the {@link Service} reaches the {@linkplain State#RUNNING RUNNING} state. The set of legal
 * transitions form a <a href="http://en.wikipedia.org/wiki/Directed_acyclic_graph">DAG</a>,
 * therefore every method of the listener will be called at most once. N.B. The {@link State#FAILED}
 * and {@link State#TERMINATED} states are terminal states, once a service enters either of these

 * before the {@link Service} reaches the {@linkplain State#RUNNING RUNNING} state. The set of legal
 * transitions form a <a href="http://en.wikipedia.org/wiki/Directed_acyclic_graph">DAG</a>,
 * therefore every method of the listener will be called at most once. N.B. The {@link State#FAILED}
 * and {@link State#TERMINATED} states are terminal states, once a service enters either of these

"D. MMMM YYYY",LLL:"D. MMMM YYYY HH:mm",LLLL:"dddd [d.] D. MMMM YYYY [kl.] HH:mm"},calendar:{sameDay:"[i dag kl.] LT",nextDay:"[i morgen kl.] LT",nextWeek:"p\xe5 dddd [kl.] LT",lastDay:"[i g\xe5r kl.] LT",lastWeek:"[i] dddd[s kl.] LT",sameElse:"L"},relativeTime:{future:"om %s",past:"%s siden",s:"f\xe5 sekunder",ss:"%d sekunder",m:"et minut",mm:"%d minutter",h:"en time",hh:"%d timer",d:"en dag",dd:"%d dage",M:"en m\xe5ned",MM:"%d m\xe5neder",y:"et \xe5r",yy:"%d \xe5r"},dayOfMonthOrdinalParse:/\d{...