| D | PrefixTree.java | 68 * Returns the minimal prefix tree which includes all the paths in "include", and none of the
71 * minimal({ "123x", "456x" }, { "13xx", "459x" }, 0) == { "12", "456" }
72 * minimal({ "123x", "456x" }, {}, 0) == { "" }
73 * minimal({ "123x", "456x" }, {}, 1) == { "[14]" }
76 * <p>A minimal length can be specified to avoid creating prefixes that are "too short" for some
82 * minimal({ "12", "1234", "56" }, { "123", "5678" }) == { "12", "56" }
84 * This means that it may not always be true that {@code minimal(A, B).intersect(minimal(B, A))}
87 public static PrefixTree minimal(RangeTree include, RangeTree exclude, int minLength) { in minimal() method in PrefixTree
101 RangeTree minimal; in minimal() local
105 minimal = emit(root, RangeSpecification.empty(), RangeTree.empty(), minLength); in minimal()
[all …]
|