HomeSort by relevance Sort by last modified time
    Searched full:step (Results 476 - 500 of 5260) sorted by null

<<11121314151617181920>>

  /external/chromium_org/third_party/WebKit/Source/core/html/forms/
RangeInputType.cpp 132 const Decimal step = equalIgnoringCase(precisionValue, "float") ? Decimal::nan() : 1; local
133 return StepRange(minimum, minimum, maximum, step, stepDescription);
136 const Decimal step = StepRange::parseStep(anyStepHandling, stepDescription, element().fastGetAttribute(stepAttr)); local
137 return StepRange(minimum, minimum, maximum, step, stepDescription);
197 // FIXME: We can't use stepUp() for the step value "any". So, we increase
199 const Decimal step = equalIgnoringCase(element().fastGetAttribute(stepAttr), "any") ? (stepRange.maximum() - stepRange.minimum()) / 100 : stepRange.step(); local
200 const Decimal bigStep = max((stepRange.maximum() - stepRange.minimum()) / 10, step);
210 newValue = current + step;
212 newValue = current - step;
    [all...]
InputType.cpp 412 Decimal candidate2 = candidate1 < numericValue ? candidate1 + stepRange.step() : candidate1 - stepRange.step();
824 Decimal newValue = current + stepRange.step() * count;
855 bool InputType::getAllowedValueStep(Decimal* step) const
858 *step = stepRange.step();
883 // * If 0 is in-range, and matches to step value
884 // - The value should be the +step if n > 0
885 // - The value should be the -step if n < 0
886 // If -step or +step is out of range, new value should be 0
929 const Decimal step = stepRange.step(); local
1001 const Decimal step = StepRange::parseStep(anyStepHandling, stepDescription, element().fastGetAttribute(stepAttr)); local
    [all...]
  /external/chromium_org/v8/src/
uri.h 79 int* step));
115 int step; local
116 if (UnescapeChar(vector, i, length, &step) >
120 i += step;
136 int step; local
138 UnescapeChar(vector, i, length, &step));
139 i += step;
148 int step; local
150 UnescapeChar(vector, i, length, &step));
151 i += step;
    [all...]
  /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/arm_neon/vc/m4p10/src/
armVCM4P10_DeblockingLuma_unsafe_s.s 185 ;// pQ0[-2*Step] = (OMX_U8)(p1 + delta);
193 ;// pQ0[1*Step] = (OMX_U8)(q1 + delta);
215 ;// pQ0[-1*Step] = (OMX_U8)armClip(0, 255, dP_0 - delta);
216 ;// pQ0[0*Step] = (OMX_U8)armClip(0, 255, dQ_0 - delta);
284 ;// pQ0[-1*Step] = (OMX_U8)((p2 + 2*p1 + 2*p0 + 2*q0 + q1 + 4)>>3);
285 ;// pQ0[-1*Step] = ( ( (p0 + q0 + p1) + (p2 + q1)>>1 ) >> 1 + 1 ) >> 1
291 ;// pQ0[-2*Step] = (OMX_U8)((p2 + p1 + p0 + q0 + 2)>>2);
296 ;// pQ0[-3*Step] = (OMX_U8)((2*p3 + 3*p2 + p1 + p0 + q0 + 4)>>3);
297 ;// pQ0[-3*Step] = (OMX_U8)(( (p3 + p2) + (p1 + p0 + q0 + p2) >> 1 + 2)>>2);
331 ;// pQ0[0*Step] = (OMX_U8)((q2 + 2*q1 + 2*q0 + 2*p0 + p1 + 4)>>3)
    [all...]
  /hardware/samsung_slsi/exynos5/libsecurepath/
content_protect.cpp 74 // Step 1: Call the Trustlet Open function.
83 // Step 2: Check TCI buffer.
92 // Step 3: Call the Trustlet functions
93 // Step 3.1: Prepare command message in TCI
99 // Step 3.2: Send Trustlet TCI Message
108 // Step 3.3: Verify that the Trustlet sent a response
116 // Step 3.4: Check the Trustlet return code
138 // Step 1: Call the Trustlet Open function.
147 // Step 2: Check TCI buffer.
156 // Step 3: Call the Trustlet function
    [all...]
  /external/ceres-solver/internal/ceres/
levenberg_marquardt_strategy.h 40 // Levenberg-Marquardt step computation and trust region sizing
56 double* step);
60 // Treat the current step as a rejected step with no increase in
79 // allocations in every iteration and reuse when a step fails and
  /external/chromium_org/chrome/browser/resources/file_manager/foreground/js/metadata/
function_sequence.js 53 * Error handling function, which traces current error step, stops sequence
60 this.logger.vlog('Failed step: ' + this.steps_[this.currentStepIdx_].name +
69 * Finishes sequence processing and jumps to the last step.
83 * Advances to next step.
99 this.logger.vlog('Attempting to start step [' +
  /external/chromium_org/third_party/WebKit/Source/core/xml/
XPathParser.h 47 Step::Axis axis;
53 Token(int t, Step::Axis v): type(t), axis(v) { }
88 void registerNodeTest(Step::NodeTest*);
89 void deleteNodeTest(Step::NodeTest*);
122 HashSet<Step::NodeTest*> m_nodeTests;
XPathParser.cpp 51 typedef HashMap<String, Step::Axis> AxisNamesMap;
74 Step::Axis axis;
77 { "ancestor", Step::AncestorAxis },
78 { "ancestor-or-self", Step::AncestorOrSelfAxis },
79 { "attribute", Step::AttributeAxis },
80 { "child", Step::ChildAxis },
81 { "descendant", Step::DescendantAxis },
82 { "descendant-or-self", Step::DescendantOrSelfAxis },
83 { "following", Step::FollowingAxis },
84 { "following-sibling", Step::FollowingSiblingAxis }
    [all...]
  /external/dropbear/libtommath/
bn_mp_jacobi.c 32 /* step 1. if a == 0, return 0 */
38 /* step 2. if a == 1, return 1 */
47 /* step 3. write a = a1 * 2**k */
62 /* step 4. if e is even set s=1 */
76 /* step 5. if p == 3 (mod 4) *and* a1 == 3 (mod 4) then s = -s */
  /external/llvm/test/Transforms/LoopVectorize/
2012-10-20-infloop.ll 51 %step.0121 = phi i32 [ 1, %cond.false28 ], [ %step.1, %for.inc50 ]
55 %inc47 = add nsw i32 %step.0121, 1
60 %step.1 = phi i32 [ %step.0121, %for.body40 ], [ %inc47, %if.then46 ]
  /frameworks/base/docs/html/training/notepad/
notepad-extra-credit.jd 24 <h2>Step 1</h2>
34 <h2>Step 2</h2>
50 <h2>Step 3</h2>
55 <h2>Step 4</h2>
60 <h2>Step 5</h2>
  /external/chromium/chrome/browser/webdata/
web_database_migration_unittest.cc 192 if (!s.Step())
250 ASSERT_TRUE(s.Step());
260 ASSERT_TRUE(s2.Step());
526 ASSERT_TRUE(s3.Step());
552 ASSERT_TRUE(s.Step());
596 ASSERT_TRUE(s3.Step());
626 ASSERT_TRUE(s.Step());
717 while (s_profiles.Step()) {
728 while (s_credit_cards.Step()) {
777 ASSERT_TRUE(s.Step());
    [all...]
  /external/chromium_org/ui/compositor/
layer_animator_unittest.cc 175 element->Step(now + base::TimeDelta::FromSeconds(1));
280 element->Step(start_time + base::TimeDelta::FromMilliseconds(500));
285 element->Step(start_time + base::TimeDelta::FromMilliseconds(1000));
326 element->Step(effective_start + delta/2);
335 element->Step(effective_start + delta);
342 // should start immediately and should progress in lock step.
379 element->Step(start_time + base::TimeDelta::FromMilliseconds(500));
385 element->Step(start_time + base::TimeDelta::FromMilliseconds(1000));
393 // animations should progress in lock step.
442 element->Step(effective_start + delta/2)
    [all...]
  /external/chromium_org/courgette/
ensemble.h 10 // Each of the elements has to go through the same set of steps in lock-step,
145 // The first step is an Init step. The parameters to the Init step identify the
155 // The Transform step takes some parameters. This allows the transform to be
159 // PredictTransformParameters step.
165 // First step: provides parameters for the patching. This would at a minimum
169 // Second step: predicts transform parameters.
173 // Third step: transforms element from original representation into alternate
178 // Final step: transforms element back from alternate representation int
    [all...]
  /external/chromium_org/third_party/sqlite/src/test/
walbak.test 134 B step 50
136 list [B step 1000] [B finish]
147 B step 50
155 B step 1000
159 list [B step 1000] [B finish]
170 B step 50
178 B step 1000
183 list [B step 1000] [B finish]
254 B step 10000
269 B step 1000
    [all...]
  /external/chromium_org/third_party/yasm/source/patched-yasm/libyasm/
linemap.c 250 unsigned long vindex, step; local
256 /* start step as the greatest power of 2 <= size */
257 step = 1;
258 while (step*2<=linemap->map_size)
259 step*=2;
260 while (step>0) {
261 if (vindex+step < linemap->map_size
262 && linemap->map_vector[vindex+step].line <= line)
263 vindex += step;
264 step /= 2
    [all...]
  /external/proguard/docs/manual/
introduction.html 14 preverifier. The shrinking step detects and removes unused classes, fields,
15 methods, and attributes. The optimization step analyzes and optimizes the
16 bytecode of the methods. The obfuscation step renames the remaining classes,
19 preverification step adds preverification information to the classes, which is
68 followed by another shrinking step. ProGuard writes the processed results to
85 <li>In the <b>shrinking step</b>, ProGuard starts from these seeds and
89 <li>In the <b>optimization step</b>, ProGuard further optimizes the code.
94 <li>In the <b>obfuscation step</b>, ProGuard renames classes and class members
98 <li>The <b>preverification step</b> is the only step that doesn't have to kno
    [all...]
  /libcore/luni/src/test/java/libcore/sqlite/
OldFunctionContextTest.java 97 assertEquals("error in step", e.getMessage());
115 st.step();
151 st.step();
209 public void step(FunctionContext fc, String[] args) {} method in class:OldFunctionContextTest.TestFCError
223 public void step(FunctionContext fc, String[] args) {} method in class:OldFunctionContextTest.TestFCCount
236 public void step(FunctionContext fc, String[] args) {} method in class:OldFunctionContextTest.TestFCZeroBlob
250 public void step(FunctionContext fc, String[] args) {} method in class:OldFunctionContextTest.TestFCString
264 public void step(FunctionContext fc, String[] args) {} method in class:OldFunctionContextTest.TestFCInt
278 public void step(FunctionContext fc, String[] args) {} method in class:OldFunctionContextTest.TestFCByteArray
292 public void step(FunctionContext fc, String[] args) { method in class:OldFunctionContextTest.SinFunc
    [all...]
  /external/chromium_org/third_party/libwebp/dsp/
dec.c 495 static WEBP_INLINE void do_filter2(uint8_t* p, int step) {
496 const int p1 = p[-2*step], p0 = p[-step], q0 = p[0], q1 = p[step];
500 p[-step] = clip1[255 + p0 + a2];
505 static WEBP_INLINE void do_filter4(uint8_t* p, int step) {
506 const int p1 = p[-2*step], p0 = p[-step], q0 = p[0], q1 = p[step];
511 p[-2*step] = clip1[255 + p1 + a3]
    [all...]
  /external/webp/src/dsp/
dec.c 495 static WEBP_INLINE void do_filter2(uint8_t* p, int step) {
496 const int p1 = p[-2*step], p0 = p[-step], q0 = p[0], q1 = p[step];
500 p[-step] = clip1[255 + p0 + a2];
505 static WEBP_INLINE void do_filter4(uint8_t* p, int step) {
506 const int p1 = p[-2*step], p0 = p[-step], q0 = p[0], q1 = p[step];
511 p[-2*step] = clip1[255 + p1 + a3]
    [all...]
  /external/opencv/cxcore/src/
cxutils.cpp 92 ids_delta = labels->step ? labels->step/(int)sizeof(int) : 1;
113 float* s = (float*)(samples->data.ptr + i*samples->step);
115 double* c = (double*)(centers->data.ptr + k*centers->step);
140 double* c = (double*)(centers->data.ptr + k*centers->step);
150 float* s = (float*)(samples->data.ptr + i*samples->step);
158 double* c_o = (double*)(old_centers->data.ptr + k*old_centers->step);
172 float* s = (float*)(samples->data.ptr + i*samples->step);
178 double* c = (double*)(centers->data.ptr + k*centers->step);
276 int step = 1, coeff_count local
819 int cont_flag, arr_size, elem_size, cols, step; local
915 int type, step; local
    [all...]
  /external/chromium/chrome/browser/sync/util/
user_settings.cc 5 // This class isn't pretty. It's just a step better than globals, which is what
38 if (SQLITE_DONE != statement.step()) {
117 int query_result = share_query.step();
170 if (SQLITE_DONE != statement.step()) {
197 int query_result = table_query.step();
205 query_result = version_query.step();
223 if (SQLITE_DONE != statement.step()) {
232 if (SQLITE_DONE != statement.step()) {
241 if (SQLITE_DONE != statement.step()) {
299 int query_result = query.step();
    [all...]
  /external/opencv/cv/src/
cvmotempl.cpp 141 mhi_step = mhi->step;
142 silh_step = silh->step;
227 dX_min_row.data.ptr = dX_min->data.ptr + y*dX_min->step;
228 dY_max_row.data.ptr = dY_max->data.ptr + y*dY_max->step;
229 orient_row.data.ptr = orient->data.ptr + y*orient->step;
230 mask_row.data.ptr = mask->data.ptr + y*mask->step;
257 dX_min_row.data.ptr = dX_min->data.ptr + y*dX_min->step;
258 dY_max_row.data.ptr = dY_max->data.ptr + y*dY_max->step;
259 mask_row.data.ptr = mask->data.ptr + y*mask->step;
260 orient_row.data.ptr = orient->data.ptr + y*orient->step;
    [all...]
  /external/opencv/cvaux/src/
cvsegment.cpp 84 icvSegmFloodFill_Stage1( uchar* pImage, int step,
91 uchar* img = pImage + step * seed.y;
103 img = pImage + seed.y*step;
144 /*curstep = flag * step;*/
145 img = pImage + (YC + flag) * step;
170 img = pImage + YC * step;
206 icvSegmFloodFill_Stage2( uchar* pImage, int step,
211 uchar* img = pImage + step * rect.y + rect.x * 3;
216 for( y = 0; y < rect.height; y++, img += step, mask += maskStep )
335 icvGetComponent( uchar* img, int step, CvRect rect
    [all...]

Completed in 771 milliseconds

<<11121314151617181920>>