| /external/clang/test/SemaCXX/ |
| constexpr-steps.cpp | 1 // 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}}
|
| /developers/samples/android/input/autofill/AutofillFramework/Application/src/main/java/com/example/android/autofill/app/edgecases/ |
| MultipleStepsCreditCardActivity.java | 30 LinkedHashMap<Integer, String> steps = new LinkedHashMap<>(4); local
31 steps.put(R.string.credit_card_number_label,
33 steps.put(R.string.credit_card_expiration_month_label,
35 steps.put(R.string.credit_card_expiration_year_label,
37 steps.put(R.string.credit_card_security_code_abbrev_label,
39 return ImmutableMap.copyOf(steps);
|
| MultipleStepsSignInActivity.java | 30 LinkedHashMap<Integer, String> steps = new LinkedHashMap<>(2); local
31 steps.put(R.string.username_label, View.AUTOFILL_HINT_USERNAME);
32 steps.put(R.string.password_label, View.AUTOFILL_HINT_PASSWORD);
33 return ImmutableMap.copyOf(steps);
|
| /external/javaparser/javaparser-testing/src/test/java/com/github/javaparser/bdd/ |
| CommentParsingTest.java | 24 import com.github.javaparser.bdd.steps.CommentParsingSteps;
26 import org.jbehave.core.steps.InjectableStepsFactory;
27 import org.jbehave.core.steps.InstanceStepsFactory;
|
| PrettyPrintingTest.java | 24 import com.github.javaparser.bdd.steps.PrettyPrintingSteps;
26 import org.jbehave.core.steps.InjectableStepsFactory;
27 import org.jbehave.core.steps.InstanceStepsFactory;
|
| ComparingTest.java | 24 import com.github.javaparser.bdd.steps.ComparingSteps;
25 import com.github.javaparser.bdd.steps.SharedSteps;
27 import org.jbehave.core.steps.InjectableStepsFactory;
28 import org.jbehave.core.steps.InstanceStepsFactory;
|
| ManipulationTest.java | 24 import com.github.javaparser.bdd.steps.ManipulationSteps;
25 import com.github.javaparser.bdd.steps.SharedSteps;
27 import org.jbehave.core.steps.InjectableStepsFactory;
28 import org.jbehave.core.steps.InstanceStepsFactory;
|
| ParsingTest.java | 24 import com.github.javaparser.bdd.steps.ParsingSteps;
25 import com.github.javaparser.bdd.steps.SharedSteps;
27 import org.jbehave.core.steps.InjectableStepsFactory;
28 import org.jbehave.core.steps.InstanceStepsFactory;
|
| PositionRangeTest.java | 24 import com.github.javaparser.bdd.steps.PositionRangeSteps;
25 import com.github.javaparser.bdd.steps.SharedSteps;
27 import org.jbehave.core.steps.InjectableStepsFactory;
28 import org.jbehave.core.steps.InstanceStepsFactory;
|
| VisitorTest.java | 24 import com.github.javaparser.bdd.steps.SharedSteps;
25 import com.github.javaparser.bdd.steps.VisitorSteps;
27 import org.jbehave.core.steps.InjectableStepsFactory;
28 import org.jbehave.core.steps.InstanceStepsFactory;
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/ode/ |
| ContinuousOutputModel.java | 38 * 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
107 /** Steps table. */
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) {
[all...] |
| /dalvik/dx/src/com/android/dx/ssa/ |
| Optimizer.java | 34 /** optional optimizer steps */
87 * @param steps set of optional optimization steps to run
92 TranslationAdvice inAdvice, EnumSet<OptionalStep> steps) {
99 runSsaFormSteps(ssaMeth, steps);
107 steps);
124 * @param steps set of optional optimization steps to run
129 EnumSet<OptionalStep> steps) {
136 EnumSet<OptionalStep> newSteps = steps.clone()
[all...] |
| /external/droiddriver/src/io/appium/droiddriver/actions/ |
| SwipeAction.java | 70 * 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) {
109 this(direction, steps, false, 1000L);
115 public SwipeAction(PhysicalDirection direction, int steps, boolean drag, long timeoutMillis) {
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, boolean drag, long timeoutMillis
[all...] |
| /external/guava/guava-testlib/src/com/google/common/collect/testing/ |
| IteratorTester.java | 30 * 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,
75 super(steps, Collections.<E>singleton(null), features, expectedElements,
|
| /external/tensorflow/tensorflow/contrib/learn/python/learn/estimators/ |
| linear_test.py | 96 classifier.fit(input_fn=input_fn, steps=100)
97 loss1 = classifier.evaluate(input_fn=input_fn, steps=1)['loss']
98 classifier.fit(input_fn=input_fn, steps=200)
99 loss2 = classifier.evaluate(input_fn=input_fn, steps=1)['loss']
122 classifier.fit(input_fn=input_fn, steps=100)
123 loss1 = classifier.evaluate(input_fn=input_fn, steps=1)['loss']
124 classifier.fit(input_fn=input_fn, steps=200)
125 loss2 = classifier.evaluate(input_fn=input_fn, steps=1)['loss']
137 classifier.fit(input_fn=test_data.iris_input_multiclass_fn, steps=100)
139 input_fn=test_data.iris_input_multiclass_fn, steps=100
[all...] |
| svm_test.py | 46 svm_classifier.fit(input_fn=input_fn, steps=30)
47 metrics = svm_classifier.evaluate(input_fn=input_fn, steps=1)
72 svm_classifier.fit(input_fn=input_fn, steps=30)
73 metrics = svm_classifier.evaluate(input_fn=input_fn, steps=1)
104 svm_classifier.fit(input_fn=input_fn, steps=30)
105 metrics = svm_classifier.evaluate(input_fn=input_fn, steps=1)
127 svm_classifier.fit(input_fn=input_fn, steps=30)
128 metrics = svm_classifier.evaluate(input_fn=input_fn, steps=1)
155 svm_classifier.fit(input_fn=input_fn, steps=30)
156 metrics = svm_classifier.evaluate(input_fn=input_fn, steps=1
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/ |
| pipes.py | 8 conversion involves several steps (e.g. piping it through compress or
9 uuencode). Some of the conversion steps may require that their input
15 more conversion steps together. It will take care of creating and
22 different conversion steps and store them in a dictionary, for
92 return '<Template instance, steps=%r>' % (self.steps,)
96 self.steps = []
102 t.steps = self.steps[:]
121 if self.steps and self.steps[-1][1] == SINK:
[all...] |
| /external/python/cpython2/Lib/ |
| pipes.py | 8 conversion involves several steps (e.g. piping it through compress or
9 uuencode). Some of the conversion steps may require that their input
15 more conversion steps together. It will take care of creating and
22 different conversion steps and store them in a dictionary, for
90 return '<Template instance, steps=%r>' % (self.steps,)
94 self.steps = []
100 t.steps = self.steps[:]
119 if self.steps and self.steps[-1][1] == SINK
[all...] |
| /external/python/cpython3/Lib/ |
| pipes.py | 8 conversion involves several steps (e.g. piping it through compress or
9 uuencode). Some of the conversion steps may require that their input
15 more conversion steps together. It will take care of creating and
22 different conversion steps and store them in a dictionary, for
92 return '<Template instance, steps=%r>' % (self.steps,)
96 self.steps = []
102 t.steps = self.steps[:]
118 if self.steps and self.steps[-1][1] == SINK
[all...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/ |
| pipes.py | 8 conversion involves several steps (e.g. piping it through compress or
9 uuencode). Some of the conversion steps may require that their input
15 more conversion steps together. It will take care of creating and
22 different conversion steps and store them in a dictionary, for
90 return '<Template instance, steps=%r>' % (self.steps,)
94 self.steps = []
100 t.steps = self.steps[:]
119 if self.steps and self.steps[-1][1] == SINK
[all...] |
| /prebuilts/gdb/linux-x86/lib/python2.7/ |
| pipes.py | 8 conversion involves several steps (e.g. piping it through compress or
9 uuencode). Some of the conversion steps may require that their input
15 more conversion steps together. It will take care of creating and
22 different conversion steps and store them in a dictionary, for
90 return '<Template instance, steps=%r>' % (self.steps,)
94 self.steps = []
100 t.steps = self.steps[:]
119 if self.steps and self.steps[-1][1] == SINK
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| pipes.py | 8 conversion involves several steps (e.g. piping it through compress or
9 uuencode). Some of the conversion steps may require that their input
15 more conversion steps together. It will take care of creating and
22 different conversion steps and store them in a dictionary, for
90 return '<Template instance, steps=%r>' % (self.steps,)
94 self.steps = []
100 t.steps = self.steps[:]
119 if self.steps and self.steps[-1][1] == SINK
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| pipes.py | 8 conversion involves several steps (e.g. piping it through compress or
9 uuencode). Some of the conversion steps may require that their input
15 more conversion steps together. It will take care of creating and
22 different conversion steps and store them in a dictionary, for
90 return '<Template instance, steps=%r>' % (self.steps,)
94 self.steps = []
100 t.steps = self.steps[:]
119 if self.steps and self.steps[-1][1] == SINK
[all...] |
| /external/tensorflow/tensorflow/contrib/kernel_methods/python/ |
| kernel_estimators_test.py | 88 input_fn=_linearly_separable_binary_input_fn, steps=100)
91 input_fn=_linearly_separable_binary_input_fn, steps=1)
119 input_fn=_linearly_inseparable_binary_input_fn, steps=50)
121 input_fn=_linearly_inseparable_binary_input_fn, steps=1)
141 input_fn=_linearly_inseparable_binary_input_fn, steps=50)
143 input_fn=_linearly_inseparable_binary_input_fn, steps=1)
157 input_fn=_linearly_inseparable_binary_input_fn, steps=50)
171 input_fn=_linearly_inseparable_binary_input_fn, steps=50)
211 linear_classifier.fit(input_fn=input_fn, steps=100)
212 linear_metrics = linear_classifier.evaluate(input_fn=input_fn, steps=1
[all...] |
| /platform_testing/libraries/app-helpers/interfaces/common/src/android/platform/helpers/ |
| IGoogleFitHelper.java | 47 * @param mode the goal type by steps (1), duration (2), or run times (3)
59 * @param steps value of Steps
63 int steps, int distance);
|
