Home
last modified time | relevance | path

Searched full:minimal (Results 1 – 25 of 1344) sorted by relevance

12345678910>>...54

/external/skia/tests/
DSubsetPath.h13 /* Given a path, generate a the desired minimal subset of the original.
21 minimal set that fails using a pattern like:
24 SkPath minimal;
26 while (subsetContours.subset(testFailed, &minimal)) {
27 testFailed = myPathTest(minimal);
31 while (subsetVerbs.subset(testFailed, &minimal)) {
32 testFailed = myPathTest(minimal);
/external/clang/
DAndroid.mk4 .PHONY: clang-toolchain-minimal clang-toolchain-full llvm-tools
5 clang-toolchain-minimal: \
9 clang-toolchain-minimal \
66 clang-toolchain-minimal: \
93 clang-toolchain-minimal: \
/external/apache-commons-math/src/main/java/org/apache/commons/math/stat/ranking/
DNaNStrategy.java23 * <li>MINIMAL - NaNs are treated as minimal in the ordering, equivalent to
38 /** NaNs are considered minimal in the ordering */
39 MINIMAL, enumConstant
/external/llvm/test/DebugInfo/Generic/
Ddebuginfofinder-forward-declaration.ll15 ; CHECK: Type: Y from /tmp/minimal.c:3 DW_TAG_structure_type
16 ; CHECK: Type: x from /tmp/minimal.c:4 DW_TAG_member
18 ; CHECK: Type: X from /tmp/minimal.c:1 DW_TAG_structure_type
31 !1 = !DIFile(filename: "minimal.c", directory: "/tmp")
/external/apache-commons-math/src/main/java/org/apache/commons/math/ode/nonstiff/
DEmbeddedRungeKuttaIntegrator.java89 /** Minimal reduction factor for stepsize control. */
102 * @param minStep minimal step (must be positive even for backward
140 * @param minStep minimal step (must be positive even for backward
340 /** Get the minimal reduction factor for stepsize control.
341 * @return minimal reduction factor
347 /** Set the minimal reduction factor for stepsize control.
348 * @param minReduction minimal reduction factor
DAdaptiveStepsizeIntegrator.java86 /** Minimal step. */
95 * @param minStep minimal step (must be positive even for backward
125 * @param minStep minimal step (must be positive even for backward
287 * @param acceptSmall if true, steps smaller than the minimal value
335 /** Get the minimal step.
336 * @return minimal step
/external/autotest/client/site_tests/firmware_TouchMTB/geometry/
Dtwo_farthest_clusters.py10 two minimal enclosing circles
65 """Get the radii of the two minimal enclosing circles from points.
68 where circle1, circle2 are the two minimal enclosing circles
Dminicircle.py5 """minicircle: calculating the minimal enclosing circle given a set of points
15 two minimal enclosing circles
122 """Get the minimal enclosing circle of the points.
/external/iproute2/man/man8/
Dtc-bpf.864 classifier and actions. They both offer a minimal instruction set for
239 A minimal, stand-alone unit, which matches on all traffic with the
468 This man page will only provide two minimal, stand-alone examples, have a
517 To demonstrate restricted C syntax, a minimal toy classifier example is
759 but rather in a minimal assembler-like language or with the help of other
763 minimal classifier matching on every packet resulting in the default
784 Thus, for egress classification, Willem de Bruijn implemented a minimal stand-alone
844 Basically, such a minimal generator is equivalent to:
855 a minimal BPF assembler called
Dtc-tbf.831 It is able to shape up to 1mbit/s of normal traffic with ideal minimal burstiness,
34 Much higher rates are possible but at the cost of losing the minimal burstiness. In that
94 determines the minimal token usage (specified in bytes) for a packet. Defaults to zero.
/external/apache-commons-math/src/main/java/org/apache/commons/math/ode/
DMultistepIntegrator.java84 /** Minimal reduction factor for stepsize control. */
102 * @param minStep minimal step (must be positive even for backward
149 * @param minStep minimal step (must be positive even for backward
249 /** Get the minimal reduction factor for stepsize control.
250 * @return minimal reduction factor
256 /** Set the minimal reduction factor for stepsize control.
257 * @param minReduction minimal reduction factor
/external/skia/src/ports/
DSkFontMgr_fontconfig.cpp184 SkAutoFcPattern minimal(FcPatternFilter(pattern, requestedObjectOnly)); in is_weak() local
187 hasId = FcPatternRemove(minimal, object, 0); in is_weak()
193 result = FcPatternGet(minimal, object, 0, &value); in is_weak()
198 hasId = FcPatternRemove(minimal, object, 1); in is_weak()
202 // 1. the same 'object' as minimal and a lang object with only 'nomatchlang'. in is_weak()
203 // 2. a different 'object' from minimal and a lang object with only 'matchlang'. in is_weak()
208 SkAutoFcPattern strong(FcPatternDuplicate(minimal)); in is_weak()
221 FcPatternAddLangSet(minimal, FC_LANG, weakLangSet); in is_weak()
232 minimal, &result)); in is_weak()
248 SkAutoFcPattern minimal(FcPatternFilter(pattern, requestedObjectOnly)); in remove_weak() local
[all …]
/external/lz4/
Dappveyor.yml85 …msbuild "visual\VS2010\lz4.sln" %ADDITIONALPARAM% /m /verbosity:minimal /property:PlatformToolset=…
89 …msbuild "visual\VS2010\lz4.sln" /m /verbosity:minimal /property:PlatformToolset=v110 /t:Clean,Buil…
93 …msbuild "visual\VS2010\lz4.sln" /m /verbosity:minimal /property:PlatformToolset=v120 /t:Clean,Buil…
97 …msbuild "visual\VS2010\lz4.sln" /m /verbosity:minimal /property:PlatformToolset=v140 /t:Clean,Buil…
/external/valgrind/none/
Dnl_main.c3 /*--- Nulgrind: The minimal Valgrind tool. nl_main.c ---*/
7 This file is part of Nulgrind, the minimal Valgrind tool,
57 VG_(details_description) ("the minimal Valgrind tool"); in nl_pre_clo_init()
/external/valgrind/include/
Dpub_tool_libcsetjmp.h3 /*--- A minimal setjmp/longjmp facility. pub_tool_libcsetjmp.h ---*/
38 // PURPOSE: Provides a minimal setjmp/longjmp facility, that saves/
43 /* This provides an extremely minimal setjmp/longjmp facility, in
45 least, that is the minimal guaranteed functionality.
/external/apache-commons-math/src/main/java/org/apache/commons/math/linear/
DFieldDecompositionSolver.java27 * such that ||A &times; X - B|| is minimal.</p>
31 * with non-square matrix A and with non-null minimal norm. If an exact linear
32 * solution exists it is also the minimal norm solution.</p>
DDecompositionSolver.java26 * such that ||A &times; X - B|| is minimal.</p>
30 * with non-square matrix A and with non-null minimal norm. If an exact linear
31 * solution exists it is also the minimal norm solution.</p>
/external/llvm/unittests/MC/
DDwarfLineTables.cpp68 // Minimal line offset expressible through extended opcode, 0 addr delta in TEST()
80 // Minimal line offset expressible through extended opcode, max addr delta in TEST()
122 // Minimal line offset expressible through extended opcode, 0 addr delta in TEST()
134 // Minimal line offset expressible through extended opcode, max addr delta in TEST()
/external/nanohttpd/samples/
Dpom.xml25 <minimal.coverage>0.0</minimal.coverage>
/external/nanohttpd/core/
Dpom.xml26 <minimal.coverage>0.82</minimal.coverage>
/external/nanohttpd/nanolets/
Dpom.xml26 <minimal.coverage>0.99</minimal.coverage>
/external/libxml2/include/libxml/
Dnanohttp.h2 * Summary: minimal HTTP implementation
3 * Description: minimal HTTP implementation allowing to fetch resources
/external/flatbuffers/
Dappveyor.yml22 verbosity: minimal
39 …- "msbuild.exe /property:Configuration=Release;OutputPath=tempcs /verbosity:minimal FlatBuffers.Te…
/external/swiftshader/third_party/LLVM/lib/Analysis/
DProfileEstimatorPass.cpp190 // Check if there is a necessary minimal weight, if yes, subtract it in recurseBasicBlock()
229 // Read necessary minimal weight. in recurseBasicBlock()
236 // Add minimal weight to paths to all exit edges, this is used to ensure in recurseBasicBlock()
247 … DEBUG(dbgs() << "Minimal Weight for " << e << ": " << format("%.20g",MinimalWeight[e]) << "\n"); in recurseBasicBlock()
279 // If minimal weight is necessary, reserve weight by subtracting weight in recurseBasicBlock()
332 // Clear Minimal Edges. in runOnFunction()
/external/icu/icu4c/source/test/cintltst/
Dcloctst.c5626 const char* const minimal = basic_maximize_data[i][0]; in TestLikelySubtags() local
5631 minimal, in TestLikelySubtags()
5636 …status, " unexpected failure of uloc_addLikelySubtags(), minimal \"%s\" status %s\n", minimal, u_… in TestLikelySubtags()
5640 if (uprv_stricmp(minimal, buffer) != 0) { in TestLikelySubtags()
5641 …cted maximal value \"%s\" in uloc_addLikelySubtags(), minimal \"%s\" = \"%s\"\n", maximal, minimal… in TestLikelySubtags()
5645 …l doesn't match expected %s in uloc_addLikelySubtags(), minimal \"%s\" = %s\n", maximal, minimal, … in TestLikelySubtags()
5653 const char* const minimal = basic_minimize_data[i][1]; in TestLikelySubtags() local
5666 else if (uprv_strlen(minimal) == 0) { in TestLikelySubtags()
5668 …log_err(" unexpected minimal value \"%s\" in uloc_minimizeSubtags(), maximal \"%s\" = \"%s\"\n", … in TestLikelySubtags()
5671 else if (uprv_stricmp(minimal, buffer) != 0) { in TestLikelySubtags()
[all …]

12345678910>>...54