/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Objects/ |
H A D | sliceobject.c | 56 start, stop, and step are python objects with None indicating no
61 PySlice_New(PyObject *start, PyObject *stop, PyObject *step)
argument 68 if (step == NULL) step = Py_None;
69 Py_INCREF(step);
75 obj->step = step;
103 Py_ssize_t *start, Py_ssize_t *stop, Py_ssize_t *step)
106 if (r->step == Py_None) {
107 *step 102 PySlice_GetIndices(PySliceObject *r, Py_ssize_t length, Py_ssize_t *start, Py_ssize_t *stop, Py_ssize_t *step) argument 133 PySlice_GetIndicesEx(PySliceObject *r, Py_ssize_t length, Py_ssize_t *start, Py_ssize_t *stop, Py_ssize_t *step, Py_ssize_t *slicelength) argument 194 PyObject *start, *stop, *step; local 255 Py_ssize_t ilen, start, stop, step, slicelength; local [all...] |
H A D | rangeobject.c | 8 long step;
member in struct:__anon3148 12 /* Return number of items in range (lo, hi, step). step != 0
16 get_len_of_range(long lo, long hi, long step)
argument 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:__anon3149 315 long start, step, len; local [all...] |
H A D | bufferobject.c | 514 Py_ssize_t start, stop, step, slicelength, cur, i;
local 517 &start, &stop, &step, &slicelength) < 0) {
523 else if (step == 1)
535 cur += step, i++) {
701 Py_ssize_t start, stop, step, slicelength;
local 704 &start, &stop, &step, &slicelength) < 0)
719 else if (step == 1) {
727 cur += step, i++) {
|
H A D | bytearrayobject.c | 438 Py_ssize_t start, stop, step, slicelength, cur, i;
local 441 &start, &stop, &step, &slicelength) < 0) {
447 else if (step == 1) {
460 cur += step, i++) {
590 Py_ssize_t start, stop, step, slicelen, needed;
local 611 step = 1;
625 &start, &stop, &step, &slicelen) < 0) {
660 if ((step < 0 && start < stop) ||
661 (step > 0 && start > stop))
663 if (step [all...] |
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Objects/ |
H A D | sliceobject.c | 56 start, stop, and step are python objects with None indicating no
61 PySlice_New(PyObject *start, PyObject *stop, PyObject *step)
argument 68 if (step == NULL) step = Py_None;
69 Py_INCREF(step);
75 obj->step = step;
103 Py_ssize_t *start, Py_ssize_t *stop, Py_ssize_t *step)
106 if (r->step == Py_None) {
107 *step 102 PySlice_GetIndices(PySliceObject *r, Py_ssize_t length, Py_ssize_t *start, Py_ssize_t *stop, Py_ssize_t *step) argument 133 PySlice_GetIndicesEx(PySliceObject *r, Py_ssize_t length, Py_ssize_t *start, Py_ssize_t *stop, Py_ssize_t *step, Py_ssize_t *slicelength) argument 194 PyObject *start, *stop, *step; local 254 Py_ssize_t ilen, start, stop, step, slicelength; local [all...] |
H A D | rangeobject.c | 8 long step;
member in struct:__anon3493 12 /* Return number of items in range (lo, hi, step). step != 0
16 get_len_of_range(long lo, long hi, long step)
argument 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 < 208 long step; member in struct:__anon3494 290 long start, step, len; local [all...] |
H A D | bufferobject.c | 504 Py_ssize_t start, stop, step, slicelength, cur, i;
local 507 &start, &stop, &step, &slicelength) < 0) {
513 else if (step == 1)
525 cur += step, i++) {
691 Py_ssize_t start, stop, step, slicelength;
local 694 &start, &stop, &step, &slicelength) < 0)
709 else if (step == 1) {
717 cur += step, i++) {
|
/device/google/contexthub/lib/nanohub/ |
H A D | 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) argument 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) argument 118 if (!step) 124 r = (uint64_t)a[step] * b[j] + c + ret[step + j]; 125 ret[step 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...] |
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/test/ |
H A D | 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])
|
H A D | test_xrange.py | 13 def pyrange(start, stop, step):
14 if (start - stop) // step < 0:
16 # that are congruent to start modulo step.
17 stop += (start - stop) % step
20 start += step
22 def pyrange_reversed(start, stop, step):
23 stop += (start - stop) % step
24 return pyrange(stop - step, start - step, -step)
[all...] |
H A D | test_userstring.py | 98 for step in (None, 1, -1):
103 data = L[start:stop:step]
105 L[start:stop:step] = data
106 s[start:stop:step] = "".join(data)
109 del L[start:stop:step]
110 del s[start:stop:step]
|
H A D | test_colorsys.py | 4 def frange(start, stop, step):
7 start += step
|
H A D | test_slice.py | 57 self.assertEqual(s.step, None)
62 self.assertEqual(s.step, None)
67 self.assertEqual(s.step, 3)
|
H A D | test_structseq.py | 111 # Skip step 0 (invalid)
112 for step in indices[1:]:
113 self.assertEqual(list(t[start:stop:step]),
114 L[start:stop:step])
|
/device/google/contexthub/firmware/lib/libc/ |
H A D | crt.c | 26 const int32_t step = from_addr < to_addr ? 1 : -1; local 27 const int32_t count = step > 0 ? end - start : start - end; 30 if (&start[step * count] != end) 33 for (; start != end; start += step) {
|
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Include/ |
H A D | sliceobject.h | 17 A slice object containing start, stop, and step data members (the
24 PyObject *start, *stop, *step; /* not NULL */
member in struct:__anon2996 33 PyObject* step);
36 Py_ssize_t *start, Py_ssize_t *stop, Py_ssize_t *step);
39 Py_ssize_t *step, Py_ssize_t *slicelength);
|
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Include/ |
H A D | sliceobject.h | 17 A slice object containing start, stop, and step data members (the
24 PyObject *start, *stop, *step; /* not NULL */
member in struct:__anon3302 33 PyObject* step);
36 Py_ssize_t *start, Py_ssize_t *stop, Py_ssize_t *step);
39 Py_ssize_t *step, Py_ssize_t *slicelength);
|
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Demo/classes/ |
H A D | Range.py | 9 """Take list of arguments and extract/create proper start, stop, and step
18 raise ValueError("step argument must not be zero")
28 start, stop, step = handleargs(a)
32 value += step
45 """ Initialize start, stop, and step values along with calculating the
47 self.start, self.stop, self.step = handleargs(a)
48 self.len = max(0, (self.stop - self.start) // self.step)
52 return 'range(%r, %r, %r)' % (self.start, self.stop, self.step)
61 return self.start + self.step * i
|
/device/google/contexthub/firmware/os/algos/common/math/ |
H A D | levenberg_marquardt.c | 13 static bool checkRelativeStepSize(const float *step, const float *state, 25 float damping_factor, size_t dim, float *step); 98 // Compute new solver step. 100 state_dim, data->step)) { 104 // If the new step is already sufficiently small, we have a solution. 105 if (checkRelativeStepSize(data->step, state, state_dim, 110 // state_new = state + step. 111 vecAdd(state_new, state, data->step, state_dim); 116 // Compute ratio of expected to actual cost function gain for this step. 119 data->step, dat 155 computeGainRatio(const float *residual, const float *residual_new, const float *step, const float *gradient, float damping_factor, size_t state_dim, size_t meas_dim) argument 185 checkRelativeStepSize(const float *step, const float *state, size_t dim, float relative_error_threshold) argument 257 computeStep(const float *gradient, float *hessian, float *L, float damping_factor, size_t dim, float *step) argument [all...] |
H A D | levenberg_marquardt.h | 12 * method where the solver step on each iteration is chosen such that: 13 * (J' J + uI) * step = - J' f(x) 65 // magnitude of relative error required for solution step, i.e. 66 // ||step|| / ||state|| < relative_step_thresold. 74 float step[MAX_LM_STATE_DIMENSION]; member in struct:LmData 86 RELATIVE_STEP_SUFFICIENTLY_SMALL, // solver step is sufficiently small. 142 * function gain for the given solver step. This ratio is used to adjust 143 * the solver step size for the next solver iteration. 147 * residual_new: f(x + step) for the new state after the solver step [all...] |
/device/linaro/hikey/gralloc960/ |
H A D | gralloc_module.cpp | 208 int step = 0; local 219 step = 2; 227 step = 2; 240 step = 1; 254 ycbcr->chroma_step = step;
|
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/ |
H A D | UserString.py | 163 start, stop, step = index.indices(len(self.data))
164 if step == -1:
167 elif step != 1:
170 raise TypeError, "invalid step in slicing assignment"
180 start, stop, step = index.indices(len(self.data))
181 if step == -1:
183 elif step != 1:
185 raise TypeError, "invalid step in slicing deletion"
|
/device/linaro/bootloader/edk2/AppPkg/Applications/Lua/src/ |
H A D | lstring.c | 54 size_t step = (l >> LUAI_HASHLIMIT) + 1; local 55 for (l1 = l; l1 >= step; l1 -= step)
|
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Modules/ |
H A D | arraymodule.c | 1672 Py_ssize_t start, stop, step, slicelength, cur, i;
local 1678 &start, &stop, &step, &slicelength) < 0) {
1685 else if (step == 1) {
1702 cur += step, i++) {
1721 Py_ssize_t start, stop, step, slicelength, needed;
local 1741 step = 1;
1750 &step, &slicelength) < 0) {
1789 if ((step > 0 && stop < start) ||
1790 (step < 0 && stop > start))
1792 if (step [all...] |
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/ |
H A D | arraymodule.c | 1657 Py_ssize_t start, stop, step, slicelength, cur, i;
local 1663 &start, &stop, &step, &slicelength) < 0) {
1670 else if (step == 1) {
1687 cur += step, i++) {
1706 Py_ssize_t start, stop, step, slicelength, needed;
local 1726 step = 1;
1735 &step, &slicelength) < 0) {
1774 if ((step > 0 && stop < start) ||
1775 (step < 0 && stop > start))
1777 if (step [all...] |