| /external/autotest/client/common_lib/ |
| priorities.py | 9 'PFQ', 'CQ', 'Super', start_value=10, step=10)
|
| /external/skia/infra/bots/recipes/ |
| bundle_recipes.py | 14 'recipe_engine/step',
24 api.step('git init', infra_step=True,
26 api.step('git add', infra_step=True,
28 api.step('git commit', infra_step=True,
30 api.step('Bundle Recipes', infra_step=True,
|
| /external/skqp/infra/bots/recipes/ |
| bundle_recipes.py | 14 'recipe_engine/step',
24 api.step('git init', infra_step=True,
26 api.step('git add', infra_step=True,
28 api.step('git commit', infra_step=True,
30 api.step('Bundle Recipes', infra_step=True,
|
| /frameworks/native/opengl/tests/gl_jni/src/com/android/gljni/ |
| GLJNILib.java | 32 public static native void step(); method in class:GLJNILib
|
| /external/tensorflow/tensorflow/python/training/ |
| learning_rate_decay_test.py | 39 step = 5
40 decayed_lr = learning_rate_decay.exponential_decay(0.05, step, 10, 0.96)
46 step = gen_state_ops._variable(shape=[], dtype=dtypes.int32,
47 name="step", container="", shared_name="")
48 assign_100 = state_ops.assign(step, 100)
49 assign_1 = state_ops.assign(step, 1)
50 assign_2 = state_ops.assign(step, 2)
51 decayed_lr = learning_rate_decay.exponential_decay(.1, step, 3, 0.96,
65 step = variables.Variable(1)
66 assign_1 = step.assign(1
[all...] |
| /external/python/cpython3/Objects/ |
| sliceobject.c | 109 /* start, stop, and step are python objects with None indicating no
114 PySlice_New(PyObject *start, PyObject *stop, PyObject *step)
127 if (step == NULL) step = Py_None;
128 Py_INCREF(step);
134 obj->step = step;
163 Py_ssize_t *start, Py_ssize_t *stop, Py_ssize_t *step)
167 if (r->step == Py_None) {
168 *step = 1
294 PyObject *start, *stop, *step; local
371 PyObject *start=NULL, *stop=NULL, *step=NULL; local
515 PyObject *start, *stop, *step; local
[all...] |
| /device/google/contexthub/lib/nanohub/ |
| rsa.c | 23 static bool biModIterative(uint32_t *num, const uint32_t *denum, uint32_t *tmp, uint32_t *state1, uint32_t *state2, uint32_t step)
32 //first step is init
33 if (!step) {
43 if (step == 1) {
112 static void biMulIterative(uint32_t *ret, const uint32_t *a, const uint32_t *b, uint32_t step) //ret = a * b, call with step = [0..RSA_LIMBS)
118 if (!step)
124 r = (uint64_t)a[step] * b[j] + c + ret[step + j];
125 ret[step + j] = r
170 uint32_t step = *stepP, gigastep, gigastepBase, gigastepSubstep, megaSubstep; local
217 uint32_t state1 = 0, state2 = 0, step = 0, ns = 0; local
231 uint32_t state1 = 0, state2 = 0, step; local
238 uint32_t step; local
[all...] |
| /dalvik/dx/tests/086-ssa-edge-split/ |
| run | 17 dx --dump --width=1000 --ssa-blocks --ssa-step=edge-split Blort.class
|
| /external/skia/infra/bots/recipe_modules/isolate/tests/ |
| isolated_tests.py | 8 'recipe_engine/step',
13 api.step('isolated_tests', [])
14 api.step.active_result.presentation.logs['details'] = [
|
| /external/skqp/infra/bots/recipe_modules/isolate/tests/ |
| isolated_tests.py | 8 'recipe_engine/step',
13 api.step('isolated_tests', [])
14 api.step.active_result.presentation.logs['details'] = [
|
| /packages/apps/Test/connectivity/sl4n/rapidjson/test/unittest/ |
| simdtest.cpp | 44 for (int step = 1; step < 32; step++) {
48 for (size_t i = 0; i < 1024; i += step)
60 i += step;
|
| /cts/tests/tests/renderscript/src/android/renderscript/cts/generated/ |
| TestStep.rs | 26 return step(inEdge, inV);
31 return step(inEdge, inV);
36 return step(inEdge, inV);
41 return step(inEdge, inV);
46 return step(inEdge, inV);
51 return step(inEdge, inV);
56 return step(inEdge, inV);
61 return step(inEdge, inV);
66 return step(inEdge, inV);
71 return step(inEdge, inV)
[all...] |
| /external/skia/infra/bots/recipe_modules/run/examples/ |
| full.py | 10 'recipe_engine/step',
17 api.run(api.step, 'run %d' % i, cmd=['echo', str(i)])
23 api.run(api.step, 'fail', cmd=['false'])
24 except api.step.StepFailure:
26 api.run(api.step, 'fail again', cmd=['false'], abort_on_failure=False)
27 api.run(api.step, 'do a thing', cmd=['echo', 'do the thing'])
41 api.run(api.step, 'env', cmd=['env'])
47 api.run(api.step, 'between_attempts #%d' % attempt,
52 api.run.with_retry(api.step, 'retry fail', 5, cmd=['false'],
54 except api.step.StepFailure
[all...] |
| /external/skqp/infra/bots/recipe_modules/run/examples/ |
| full.py | 10 'recipe_engine/step',
17 api.run(api.step, 'run %d' % i, cmd=['echo', str(i)])
23 api.run(api.step, 'fail', cmd=['false'])
24 except api.step.StepFailure:
26 api.run(api.step, 'fail again', cmd=['false'], abort_on_failure=False)
27 api.run(api.step, 'do a thing', cmd=['echo', 'do the thing'])
41 api.run(api.step, 'env', cmd=['env'])
47 api.run(api.step, 'between_attempts #%d' % attempt,
52 api.run.with_retry(api.step, 'retry fail', 5, cmd=['false'],
54 except api.step.StepFailure
[all...] |
| /external/brotli/csharp/org/brotli/dec/ |
| Huffman.cs | 26 int step = 1 << (len - 1);
27 while ((key & step) != 0)
29 step >>= 1;
31 return (key & (step - 1)) + step;
38 /// <c>table[0], table[step], table[2 * step] .., table[end]</c>
40 /// <p> Assumes that end is an integer multiple of step.
42 private static void ReplicateValue(int[] table, int offset, int step, int end, int item)
46 end -= step;
[all...] |
| /external/brotli/java/org/brotli/dec/ |
| Huffman.java | 22 int step = 1 << (len - 1); local
23 while ((key & step) != 0) {
24 step >>= 1;
26 return (key & (step - 1)) + step;
30 * Stores {@code item} in {@code table[0], table[step], table[2 * step] .., table[end]}.
32 * <p> Assumes that end is an integer multiple of step.
34 private static void replicateValue(int[] table, int offset, int step, int end, int item) {
36 end -= step;
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Objects/ |
| rangeobject.c | 8 long step;
member in struct:__anon4514
12 /* Return number of items in range (lo, hi, step). step != 0
16 get_len_of_range(long lo, long hi, long step)
19 If step > 0 and lo >= hi, or step < 0 and lo <= hi, the range is empty.
20 Else for step > 0, if n values are in the range, the last one is
21 lo + (n-1)*step, which must be <= hi-1. Rearranging,
22 n <= (hi - lo - 1)/step + 1, so taking the floor of the RHS gives
28 precision to compute the RHS exactly. The analysis for step < 0
233 long step; member in struct:__anon4515
315 long start, step, len; local
[all...] |
| /external/python/cpython2/Objects/ |
| rangeobject.c | 8 long step; member in struct:__anon32918
12 /* Return number of items in range (lo, hi, step). step != 0
16 get_len_of_range(long lo, long hi, long step)
19 If step > 0 and lo >= hi, or step < 0 and lo <= hi, the range is empty.
20 Else for step > 0, if n values are in the range, the last one is
21 lo + (n-1)*step, which must be <= hi-1. Rearranging,
22 n <= (hi - lo - 1)/step + 1, so taking the floor of the RHS gives
28 precision to compute the RHS exactly. The analysis for step <
233 long step; member in struct:__anon32919
315 long start, step, len; local
[all...] |
| /external/bart/bart/common/ |
| Utils.py | 70 def area_under_curve(series, sign=None, method="trapz", step="post"):
88 :param step: The step behaviour for `rect` method
89 :type step: str
93 - Step: Post
119 - Step: Pre
153 if step == "post":
155 elif step == "pre":
158 raise ValueError("Invalid Value for step: {}".format(step))
[all...] |
| /external/python/cpython3/Include/ |
| sliceobject.h | 17 A slice object containing start, stop, and step data members (the
24 PyObject *start, *stop, *step; /* not NULL */ member in struct:__anon33190
34 PyObject* step);
42 Py_ssize_t *start, Py_ssize_t *stop, Py_ssize_t *step);
45 Py_ssize_t *step, Py_ssize_t *slicelength);
48 #define PySlice_GetIndicesEx(slice, length, start, stop, step, slicelen) ( \
49 PySlice_Unpack((slice), (start), (stop), (step)) < 0 ? \
51 ((*(slicelen) = PySlice_AdjustIndices((length), (start), (stop), *(step))), \
54 Py_ssize_t *start, Py_ssize_t *stop, Py_ssize_t *step);
57 Py_ssize_t step);
[all...] |
| /external/strace/tests/ |
| qual_fault.test | 42 local trace fault err first step procs extra
47 step=$1; shift
52 if [ -z "$first$step" ]; then
54 step=1
56 case "$step" in
57 '') when=":when=$first"; step=0 ;;
58 +) when=":when=$first+"; step=1 ;;
59 *) when=":when=$first+$step" ;;
83 ../$NAME $raw "$err" "$first" "$step" $N \
|
| /external/strace/tests-m32/ |
| qual_fault.test | 42 local trace fault err first step procs extra
47 step=$1; shift
52 if [ -z "$first$step" ]; then
54 step=1
56 case "$step" in
57 '') when=":when=$first"; step=0 ;;
58 +) when=":when=$first+"; step=1 ;;
59 *) when=":when=$first+$step" ;;
83 ../$NAME $raw "$err" "$first" "$step" $N \
|
| /external/strace/tests-mx32/ |
| qual_fault.test | 42 local trace fault err first step procs extra
47 step=$1; shift
52 if [ -z "$first$step" ]; then
54 step=1
56 case "$step" in
57 '') when=":when=$first"; step=0 ;;
58 +) when=":when=$first+"; step=1 ;;
59 *) when=":when=$first+$step" ;;
83 ../$NAME $raw "$err" "$first" "$step" $N \
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/test/ |
| test_buffer.py | 19 # Skip step 0 (invalid)
20 for step in indices[1:]:
21 self.assertEqual(b[start:stop:step],
22 s[start:stop:step])
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Objects/ |
| rangeobject.c | 8 long step;
member in struct:__anon4859
12 /* Return number of items in range (lo, hi, step). step != 0
16 get_len_of_range(long lo, long hi, long step)
19 If step > 0 and lo >= hi, or step < 0 and lo <= hi, the range is empty.
20 Else for step > 0, if n values are in the range, the last one is
21 lo + (n-1)*step, which must be <= hi-1. Rearranging,
22 n <= (hi - lo - 1)/step + 1, so taking the floor of the RHS gives
28 precision to compute the RHS exactly. The analysis for step < 0
208 long step; member in struct:__anon4860
290 long start, step, len; local
[all...] |
