Searched defs:steps (Results 1 - 25 of 46) sorted by relevance

12

/external/clang/test/SemaCXX/
H A Dconstexpr-steps.cpp1 // RUN: %clang_cc1 -std=c++1y -fsyntax-only -verify %s -DMAX=1234 -fconstexpr-steps 1234
2 // RUN: %clang_cc1 -std=c++1y -fsyntax-only -verify %s -DMAX=10 -fconstexpr-steps 10
3 // RUN: %clang -std=c++1y -fsyntax-only -Xclang -verify %s -DMAX=12345 -fconstexpr-steps=12345
5 // This takes a total of n + 4 steps according to our current rules:
11 constexpr bool steps(int n) { function
16 static_assert(steps((MAX - 4)), ""); // ok
17 static_assert(steps((MAX - 3)), ""); // expected-error {{constant}} expected-note{{call}}
/external/guava/guava-testlib/src/com/google/common/collect/testing/
H A DIteratorTester.java30 * possible sequences of these operations, up to a given number of steps. So, if
31 * the caller specifies to use <i>n</i> steps, a total of <i>3^n</i> tests are
34 * <p>For instance, if <i>steps</i> is 5, one example sequence that will be
69 * @param steps how many operations to test for each tested pair of iterators
72 protected IteratorTester(int steps, argument
75 super(steps, Collections.<E>singleton(null), features, expectedElements,
H A DListIteratorTester.java35 * The items in {@code elementsToInsert} will be repeated if {@code steps} is
43 protected ListIteratorTester(int steps, Iterable<E> elementsToInsert, argument
46 super(steps, elementsToInsert, features, expectedElements,
H A DAbstractIteratorTester.java324 AbstractIteratorTester(int steps, Iterable<E> elementsToInsertIterable, argument
327 // periodically we should manually try (steps * 3 / 2) here; all tests but
329 stimuli = new Stimulus[steps];
379 // We're going to reuse the stimuli array 3^steps times by overwriting it
/external/skia/src/opts/
H A DSkChecksum_opts.h43 size_t steps = bytes/24; local
44 while (steps --> 0) {
97 size_t steps = bytes/12;
98 while (steps --> 0) {
137 size_t steps = bytes/24;
138 while (steps --> 0) {
/external/apache-commons-math/src/main/java/org/apache/commons/math/ode/
H A DContinuousOutputModel.java38 * stores a copy of all steps information in a sorted collection for
64 * output model handles the steps of all integration phases, the user
78 * is large, if the integration interval is long or if the steps are
108 private List<StepInterpolator> steps; field in class:ContinuousOutputModel
114 steps = new ArrayList<StepInterpolator>();
129 if (model.steps.size() == 0) {
133 if (steps.size() == 0) {
149 final StepInterpolator lastInterpolator = steps.get(index);
161 for (StepInterpolator interpolator : model.steps) {
162 steps
[all...]
/external/droiddriver/src/io/appium/droiddriver/actions/
H A DSwipeAction.java70 * not behave as expected, you can change steps with {@link #setScrollSteps}.
86 * expected, you can change steps with {@link #setFlingSteps}.
99 private final int steps; field in class:SwipeAction
108 public SwipeAction(PhysicalDirection direction, int steps) { argument
109 this(direction, steps, false, 1000L);
115 public SwipeAction(PhysicalDirection direction, int steps, boolean drag, long timeoutMillis) { argument
116 this(direction, steps, drag, timeoutMillis, 0.1F, 0.1F, 0.1F, 0.1F);
122 * @param steps minimum 2; (steps-1) is the number of {@code ACTION_MOVE} that
131 public SwipeAction(PhysicalDirection direction, int steps, boolea argument
[all...]
/external/pdfium/core/fpdfapi/page/
H A Dcpdf_contentparser.cpp127 int steps = 0; local
218 steps++;
/external/skia/samplecode/
H A DSamplePathEffects.cpp98 int steps = 20; variable
104 for (int i = 0; i < steps; i++) {
105 x += dist/steps;
107 if (i == steps/2) {
/external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/direct/
H A DDirectSearchOptimizer.java55 * steps.<p>
61 * with all steps set to +1 is triggered, thus building a default
131 * steps to (1, 10, 2) and the start point to (1, 1, 1) would imply the
135 * @param steps steps along the canonical axes representing box edges,
139 public void setStartConfiguration(final double[] steps) argument
143 final int n = steps.length;
148 if (steps[j] == 0.0) {
152 System.arraycopy(steps, 0, vertexI, 0, j + 1);
/external/libdrm/tests/modetest/
H A Dcursor.c68 * Timer driven program loops through these steps to move/enable/disable
129 static const struct cursor_step steps[] = { variable in typeref:struct:cursor_step
148 const struct cursor_step *step = &steps[indx % ARRAY_SIZE(steps)];
/external/guava/guava-tests/test/com/google/common/collect/
H A DMinMaxPriorityQueueTest.java511 final List<T> values, int steps) throws Exception {
514 steps,
510 runIterator( final List<T> values, int steps) argument
/external/libdrm/tests/exynos/
H A Dexynos_fimg2d_test.c330 } steps[] = { local
341 sizeof(steps) / sizeof(struct g2d_step);
408 s = &steps[random() % num_steps];
/external/opencv/cvaux/src/
H A Dcvtexture.cpp75 int* steps, int numSteps, int* memorySteps );
270 int* steps,
317 row2 = rowLoop + steps[stepLoop*2 + 0];
318 col2 = colLoop + steps[stepLoop*2 + 1];
266 icvCreateGLCM_LookupTable_8u_C1R( const uchar* srcImageData, int srcImageStep, CvSize srcImageSize, CvGLCM* destGLCM, int* steps, int numSteps, int* memorySteps ) argument
/external/python/cpython2/Demo/tkinter/guido/
H A Dsortvisu.py242 nsteps = steps(self.index, index)
256 nsteps = steps(self.index, other.index)
335 def steps(here, there): function
/external/libvpx/libvpx/vp9/encoder/
H A Dvp9_resize.c351 static int get_down2_length(int length, int steps) { argument
353 for (s = 0; s < steps; ++s) length = (length + 1) >> 1;
358 int steps = 0; local
361 ++steps;
364 return steps;
369 int steps; local
374 steps = get_down2_steps(length, olength);
376 if (steps > 0) {
384 for (s = 0; s < steps; ++s) {
387 if (s == steps
656 int steps; local
[all...]
/external/v8/src/heap/
H A Dgc-tracer.h110 IncrementalMarkingInfos() : duration(0), longest_step(0), steps(0) {}
113 steps++;
123 steps = 0;
128 int steps; member in struct:v8::internal::GCTracer::IncrementalMarkingInfos
219 // Duration of incremental marking steps for INCREMENTAL_MARK_COMPACTOR.
282 // Compute the overall mark compact speed including incremental steps
394 // Size of incremental marking steps (in bytes) accumulated since the end of
398 // Duration of incremental marking steps since the end of the last mark-
/external/icu/icu4c/source/test/cintltst/
H A Dreapits.c190 TestCallbackFn(const void *context, int32_t steps) { argument
192 if (info->lastSteps+1 != steps) {
193 log_err("incorrect steps in callback. Expected %d, got %d\n", info->lastSteps+1, steps);
195 info->lastSteps = steps;
2257 static UBool U_CALLCONV MatchCallback(const void *context, int32_t steps) { argument
/external/icu/icu4c/source/test/intltest/
H A Dconvtest.cpp1078 } steps[]={ local
1094 for(i=0; i<UPRV_LENGTHOF(steps) && ok; ++i) {
1095 step=steps[i].step;
1115 cc, cnv.getAlias(), steps[i].name,
1525 } steps[]={ local
1534 for(i=0; i<UPRV_LENGTHOF(steps) && ok; ++i) {
1535 step=steps[i].step;
1544 cc, cnv, steps[i].name,
1572 cc, cnv, steps[i].utf8Name,
/external/opencv/cv/src/
H A Dcvemd.cpp753 int steps; local
769 steps = icvFindLoop( state );
771 if( steps == 0 )
775 for( i = 1; i < steps; i += 2 )
787 for( i = 0; i < steps; i += 2 )
835 int i, steps = 1; local
845 steps = 1;
849 if( (steps & 1) == 1 )
869 loop[steps++] = new_x;
877 i = steps
[all...]
/external/selinux/libsepol/cil/src/
H A Dcil_verify.c623 int steps = 0; local
634 if (steps == limit) {
635 steps = 0;
641 steps++;
674 int steps = 0; local
685 if (steps == limit) {
686 steps = 0;
692 steps++;
705 int steps = 0; local
716 if (steps
[all...]
/external/vixl/src/aarch64/
H A Ddebugger-aarch64.cc1256 int64_t steps = count(); local
1257 if (steps <= 0) {
1258 if (steps < 0) {
1259 printf(" ** invalid value for steps: %" PRId64 " (<0) **\n", steps);
1264 debugger->SetSteps(steps - 1);
1266 // followed by `steps - 1` instructions, before starting the shell again.
1304 int64_t steps = count(); local
1305 if (steps < 0) {
1306 printf(" ** invalid value for steps
[all...]
/external/clang/include/clang/Sema/
H A DInitialization.h873 /// record of the steps required to perform the initialization.
956 step_range steps() const { return {step_begin(), step_end()}; } function in class:clang::InitializationSequence
1100 /// \brief Add steps to unwrap a initializer list for a reference around a
/external/libxml2/
H A Dpattern.c102 int nbStep; /* number of steps in the automata */
103 int maxStep; /* allocated number of steps */
104 xmlStreamStepPtr steps; /* the array of steps */ member in struct:_xmlStreamComp
172 xmlStepOpPtr steps; /* ops for computation */ member in struct:_xmlPattern
214 cur->steps = (xmlStepOpPtr) xmlMalloc(cur->maxStep * sizeof(xmlStepOp));
215 if (cur->steps == NULL) {
243 if (comp->steps != NULL) {
246 op = &comp->steps[i];
253 xmlFree(comp->steps);
[all...]
/external/skia/src/utils/
H A DSkShadowTessellator.cpp118 int steps = SkScalarFloorToInt(r*theta*kRecipPixelsPerArcSegment); local
120 SkScalar dTheta = theta / steps;
122 *n = steps;

Completed in 1815 milliseconds

12