Home
last modified time | relevance | path

Searched refs:minimal (Results 1 - 25 of 33) sorted by relevance

12

/third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/
H A DPrefixTree.java68 * 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()
300 recursivelyMinimize( DfaNode node, RangeSpecification path, DfaNode exclude, RangeTree minimal, int minLength) recursivelyMinimize() argument
339 emit( DfaNode node, RangeSpecification path, RangeTree minimal, int minLength) emit() argument
[all...]
/third_party/libphonenumber/metadata/src/test/java/com/google/i18n/phonenumbers/metadata/
H A DPrefixTreeTest.java153 // If there are no ranges to include, the minimal prefix is empty (matching nothing). in testMinimal()
154 assertThat(PrefixTree.minimal(RangeTree.empty(), ranges("123x"), 0)).isEmpty(); in testMinimal()
158 assertThat(PrefixTree.minimal(ranges("xxxx"), ranges("123"), 0).isIdentity()).isTrue(); in testMinimal()
160 assertThat(PrefixTree.minimal(ranges("123x"), RangeTree.empty(), 0).isIdentity()).isTrue(); in testMinimal()
162 assertThat(PrefixTree.minimal(ranges("123x", "456x"), ranges("13xx", "459x"), 0)) in testMinimal()
165 assertThat(PrefixTree.minimal(ranges("123x", "456x"), empty(), 1)).containsExactly("[14]"); in testMinimal()
166 assertThat(PrefixTree.minimal(ranges("123x", "456x"), empty(), 2)).containsExactly("12", "45"); in testMinimal()
169 assertThat(PrefixTree.minimal(ranges("12", "1234", "56"), ranges("1xx", "5xxx"), 0)) in testMinimal()
171 assertThat(PrefixTree.minimal(ranges("12", "1234", "56"), ranges("1xx", "5xxx"), 3)) in testMinimal()
175 assertThat(PrefixTree.minimal(range in testMinimal()
[all...]
/third_party/curl/lib/vtls/
H A Dbearssl.c48 br_x509_minimal_context minimal; member
282 x509->minimal.vtable->start_chain(&x509->minimal.vtable, server_name); in x509_start_chain()
296 x509->minimal.vtable->start_cert(&x509->minimal.vtable, length); in x509_start_cert()
310 x509->minimal.vtable->append(&x509->minimal.vtable, buf, len); in x509_append()
322 x509->minimal.vtable->end_cert(&x509->minimal.vtable); in x509_end_cert()
333 return x509->minimal in x509_end_chain()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/subzero/src/
H A DIceCompileServer.cpp153 {"minimal_build", BuildDefs::minimal()},
231 if (BuildDefs::minimal() && Flags.getBitcodeAsText()) in run()
233 "minimal build"); in run()
237 (!BuildDefs::minimal() && Flags.getBitcodeAsText()) in run()
254 if (!BuildDefs::minimal() && getFlags().getSanitizeAddresses()) { in run()
H A DIceBuildDefs.h92 constexpr bool minimal() { return ALLOW_MINIMAL_BUILD; } in minimal() function
H A DIceGlobalContext.h371 if (!BuildDefs::minimal()) in setInstrumentation()
376 if (!BuildDefs::minimal() && Instrumentor) in instrumentFunc()
544 if (!BuildDefs::minimal() && Instrumentor != nullptr) in accumulateGlobals()
H A DIceClFlags.h132 /* TODO(jpp): figure out which optional flags are used in minimal, and \
136 !BuildDefs::minimal() || true; \
H A DIceBrowserCompileServer.cpp92 if (BuildDefs::minimal()) in getExternalArgs()
H A DIceVariableSplitting.cpp219 if (!BuildDefs::minimal() && in handleUnwantedInstruction()
H A DIceCfg.cpp210 if (!BuildDefs::minimal() && getFlags().getSanitizeAddresses()) { in translate()
515 // container will use minimal memory when left unused. in localCSE()
1043 if (BuildDefs::minimal()) in rematerializeAssign()
1059 if (BuildDefs::minimal()) in rematerializeCast()
/third_party/skia/src/ports/
H A DSkFontMgr_fontconfig.cpp176 SkAutoFcPattern minimal(FcPatternFilter(pattern, requestedObjectOnly)); in is_weak()
179 hasId = FcPatternRemove(minimal, object, 0); in is_weak()
185 result = FcPatternGet(minimal, object, 0, &value); in is_weak()
190 hasId = FcPatternRemove(minimal, object, 1); in is_weak()
194 // 1. the same 'object' as minimal and a lang object with only 'nomatchlang'. in is_weak()
195 // 2. a different 'object' from minimal and a lang object with only 'matchlang'. in is_weak()
200 SkAutoFcPattern strong(FcPatternDuplicate(minimal)); in is_weak()
213 FcPatternAddLangSet(minimal, FC_LANG, weakLangSet); in is_weak()
224 minimal, &result)); in is_weak()
240 SkAutoFcPattern minimal(FcPatternFilte in remove_weak()
[all...]
/third_party/icu/icu4c/source/test/cintltst/
H A Dcloctst.c5993 const char* const minimal = basic_maximize_data[i][0]; in TestLikelySubtags() local
5998 minimal, in TestLikelySubtags()
6003 log_err_status(status, " unexpected failure of uloc_addLikelySubtags(), minimal \"%s\" status %s\n", minimal, u_errorName(status)); in TestLikelySubtags()
6007 if (uprv_stricmp(minimal, buffer) != 0) { in TestLikelySubtags()
6008 log_err(" unexpected maximal value \"%s\" in uloc_addLikelySubtags(), minimal \"%s\" = \"%s\"\n", maximal, minimal, buffer); in TestLikelySubtags()
6012 log_err(" maximal doesn't match expected %s in uloc_addLikelySubtags(), minimal \"%s\" = %s\n", maximal, minimal, buffer); in TestLikelySubtags()
6020 const char* const minimal in TestLikelySubtags() local
6046 const char* const minimal = full_data[i][0]; TestLikelySubtags() local
6073 const char* const minimal = full_data[i][2]; TestLikelySubtags() local
6102 const char* const minimal = maximizeErrors[i].tag; TestLikelySubtags() local
6137 const char* const minimal = minimizeErrors[i].expected; TestLikelySubtags() local
[all...]
/third_party/jerryscript/targets/riot-stm32f4/
H A DMakefile45 USEMODULE += libjerry-core libjerry-port-default-minimal libjerry-ext
/third_party/mesa3d/src/gallium/tools/trace/
H A Dtracediff.sh66 echo " -d, --minimal try hard to find a smaller set of changes"
118 -d|--minimal)
/third_party/rust/crates/clap/
H A DMakefile15 _FEATURES = minimal default wasm full debug release
/third_party/musl/porting/liteos_m/kernel/src/regex/
H A Dregcomp.c130 unsigned int minimal:1; member
170 tre_ast_new_iter(tre_mem_t mem, tre_ast_node_t *arg, int min, int max, int minimal) in tre_ast_new_iter() argument
182 iter->minimal = minimal; in tre_ast_new_iter()
1214 int num_minimals = 0; /* Number of special minimal tags. */ in tre_add_tags()
1219 int minimal_tag = -1; /* Tag that marks the beginning of a minimal match. */ in tre_add_tags()
1409 STACK_PUSHX(stack, int, regset[0] >= 0 || iter->minimal); in tre_add_tags()
1414 STACK_PUSHX(stack, int, iter->minimal); in tre_add_tags()
1423 if (regset[0] >= 0 || iter->minimal) in tre_add_tags()
1429 if (iter->minimal) in tre_add_tags()
1544 int minimal = 0; tre_add_tags() local
[all...]
/third_party/musl/porting/liteos_m_iccarm/kernel/src/regex/
H A Dregcomp.c130 unsigned int minimal:1; member
170 tre_ast_new_iter(tre_mem_t mem, tre_ast_node_t *arg, int min, int max, int minimal) in tre_ast_new_iter() argument
182 iter->minimal = minimal; in tre_ast_new_iter()
1215 int num_minimals = 0; /* Number of special minimal tags. */ in tre_add_tags()
1220 int minimal_tag = -1; /* Tag that marks the beginning of a minimal match. */ in tre_add_tags()
1410 STACK_PUSHX(stack, int, regset[0] >= 0 || iter->minimal); in tre_add_tags()
1415 STACK_PUSHX(stack, int, iter->minimal); in tre_add_tags()
1424 if (regset[0] >= 0 || iter->minimal) in tre_add_tags()
1430 if (iter->minimal) in tre_add_tags()
1545 int minimal = 0; tre_add_tags() local
[all...]
/third_party/musl/porting/uniproton/kernel/src/regex/
H A Dregcomp.c130 unsigned int minimal:1; member
170 tre_ast_new_iter(tre_mem_t mem, tre_ast_node_t *arg, int min, int max, int minimal) in tre_ast_new_iter() argument
182 iter->minimal = minimal; in tre_ast_new_iter()
1214 int num_minimals = 0; /* Number of special minimal tags. */ in tre_add_tags()
1219 int minimal_tag = -1; /* Tag that marks the beginning of a minimal match. */ in tre_add_tags()
1409 STACK_PUSHX(stack, int, regset[0] >= 0 || iter->minimal); in tre_add_tags()
1414 STACK_PUSHX(stack, int, iter->minimal); in tre_add_tags()
1423 if (regset[0] >= 0 || iter->minimal) in tre_add_tags()
1429 if (iter->minimal) in tre_add_tags()
1544 int minimal = 0; tre_add_tags() local
[all...]
/third_party/musl/src/regex/
H A Dregcomp.c130 unsigned int minimal:1; member
170 tre_ast_new_iter(tre_mem_t mem, tre_ast_node_t *arg, int min, int max, int minimal) in tre_ast_new_iter() argument
182 iter->minimal = minimal; in tre_ast_new_iter()
1214 int num_minimals = 0; /* Number of special minimal tags. */ in tre_add_tags()
1219 int minimal_tag = -1; /* Tag that marks the beginning of a minimal match. */ in tre_add_tags()
1409 STACK_PUSHX(stack, int, regset[0] >= 0 || iter->minimal); in tre_add_tags()
1414 STACK_PUSHX(stack, int, iter->minimal); in tre_add_tags()
1423 if (regset[0] >= 0 || iter->minimal) in tre_add_tags()
1429 if (iter->minimal) in tre_add_tags()
1544 int minimal = 0; tre_add_tags() local
[all...]
/third_party/skia/tests/
H A DPathOpsBuilderConicTest.cpp147 SkPath minimal; in subset_simplify_fail() local
148 while (subsetContours.subset(failed, &minimal)) { in subset_simplify_fail()
149 failed = simplify_fails(reporter, minimal); in subset_simplify_fail()
152 lastFailed = minimal; in subset_simplify_fail()
158 while (subsetVerbs.subset(failed, &minimal)) { in subset_simplify_fail()
159 failed = simplify_fails(reporter, minimal); in subset_simplify_fail()
162 lastFailed = minimal; in subset_simplify_fail()
/third_party/libcoap/examples/lwip/
H A DMakefile117 # lwip and coap opts (include early to shadow the lwip-contrib/ports/unix/proj/minimal/ file and any ../../config.h)
124 -Ilwip-contrib/ports/unix/proj/minimal/
129 vpath %.c lwip/src/core/ lwip-contrib/ports/unix/proj/minimal/ \
/third_party/ntfs-3g/ntfsprogs/
H A Dntfsusermap.c749 static boolean minimal(unsigned char *sid) in minimal() function
1050 fprintf(stderr, "When outputting to file, a minimal" in checkoptions()
1121 ok = minimal(currentsid); in main()
/third_party/libwebsockets/scripts/
H A Dattack.sh26 LWS_NC=./bin/lws-minimal-raw-netcat
/third_party/icu/icu4j/tools/misc/src/com/ibm/icu/dev/tool/translit/
H A DdumpICUrules.bat27 # The transformation that is done is very minimal. The script assumes
/third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/table/
H A DRangeTable.java359 /** Builds a minimal version of this table in which empty columns are no longer present. */
531 * Returns the assigned rows of a RangeTable as a minimal list of disjoint changes, which can
533 * in the same way and changes are ordered by the minimal values of their ranges. This is
538 // Note that the minimal nature of the returned changes is essential for some algorithms that
599 * Extracts a map for a single column in this table containing the minimal prefix tree for each
604 * <p>A minimal length can be specified to avoid creating prefixes that are "too short" for some
612 * matters. See {@link PrefixTree#minimal(RangeTree, RangeTree, int)} for more information.
629 map.put(value, PrefixTree.minimal(include, allRanges.subtract(include), minPrefixLength)); in getPrefixMap()
668 // This only works because "toChanges()" produces the minimal set of changes such that each in simplify()
839 // Helper method to convert a table of values into a minimal se
[all...]

Completed in 32 milliseconds

12