HomeSort by relevance Sort by last modified time
    Searched full:pivot (Results 1 - 25 of 83) sorted by null

1 2 3 4

  /external/skia/src/core/
SkStrokerPriv.cpp 14 static void ButtCapper(SkPath* path, const SkPoint& pivot,
21 static void RoundCapper(SkPath* path, const SkPoint& pivot,
25 SkScalar px = pivot.fX;
26 SkScalar py = pivot.fY;
40 static void SquareCapper(SkPath* path, const SkPoint& pivot,
49 path->setLastPt(pivot.fX + normal.fX + parallel.fX, pivot.fY + normal.fY + parallel.fY);
50 path->lineTo(pivot.fX - normal.fX + parallel.fX, pivot.fY - normal.fY + parallel.fY);
54 path->lineTo(pivot.fX + normal.fX + parallel.fX, pivot.fY + normal.fY + parallel.fY)
    [all...]
SkStrokerPriv.h 25 const SkPoint& pivot,
32 const SkPoint& pivot,
SkTSearch.cpp 143 char* pivot = left; local
147 while (left < last && compare(left, pivot) < 0)
149 while (first < rite && compare(rite, pivot) > 0)
  /packages/apps/Camera/jni/feature_stab/db_vlvm/
db_utilities_indexing.cpp 35 a pivot element. Values equal to the pivot are ignored*/
36 void db_LeanPartitionOnPivot(double pivot,double *dest,const double *source,long first,long last,long *first_equal,long *last_equal)
52 if(temp<pivot) *(d_bottom++)=temp;
53 else if(temp>pivot) *(d_top--)=temp;
63 double pivot; local
78 pivot=db_TripleMedian(source[first],source[last],source[(first+last)/2]);
79 db_LeanPartitionOnPivot(pivot,dest,source,first,last,&first_equal,&last_equal);
85 return(pivot);
95 pivot=db_TripleMedian(source[first],source[last],source[(first+last)/2])
    [all...]
  /packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/
db_utilities_indexing.cpp 35 a pivot element. Values equal to the pivot are ignored*/
36 void db_LeanPartitionOnPivot(double pivot,double *dest,const double *source,long first,long last,long *first_equal,long *last_equal)
52 if(temp<pivot) *(d_bottom++)=temp;
53 else if(temp>pivot) *(d_top--)=temp;
63 double pivot; local
78 pivot=db_TripleMedian(source[first],source[last],source[(first+last)/2]);
79 db_LeanPartitionOnPivot(pivot,dest,source,first,last,&first_equal,&last_equal);
85 return(pivot);
95 pivot=db_TripleMedian(source[first],source[last],source[(first+last)/2])
    [all...]
  /external/jmonkeyengine/engine/src/test/jme3test/helloworld/
HelloNode.java 72 /** Create a pivot node at (0,0,0) and attach it to the root node */
73 Node pivot = new Node("pivot"); local
74 rootNode.attachChild(pivot); // put this node in the scene
76 /** Attach the two boxes to the *pivot* node. (And transitively to the root node.) */
77 pivot.attachChild(blue);
78 pivot.attachChild(red);
79 /** Rotate the pivot node: Note that both boxes have rotated! */
80 pivot.rotate(.4f,.4f,0f);
  /external/qemu/distrib/sdl-1.2.12/src/stdlib/
SDL_qsort.c 115 * 3. We choose a pivot by looking at the first, last
118 * choosing the pivot, and it makes things a little
119 * easier in the partitioning step. Anyway, the pivot
130 * 4. We copy the pivot element to a separate place
133 * and don't have to wonder "did we move the pivot
180 #define Pivot(swapper,sz) \
207 while (compare(first,pivot)<0) first+=sz; \
208 while (compare(pivot,last)<0) last-=sz; \
243 memcpy(pivot,first,size); \
245 memcpy(test,pivot,size);
308 char *pivot=malloc(size); local
339 char *pivot=malloc(size); local
370 char *pivot=malloc(WORD_BYTES); local
    [all...]
  /external/jmonkeyengine/engine/src/blender/com/jme3/scene/plugins/blender/constraints/
ConstraintPivot.java 12 * The pivot constraint. Available for blender 2.50+.
42 LOGGER.log(Level.WARNING, "'Pivot' constraint NOT implemented!");
  /external/jmonkeyengine/engine/src/core/com/jme3/collision/bih/
BIHTree.java 168 int pivot = l; local
177 while (pivot <= j) {
178 getTriangle(pivot, v1, v2, v3);
181 swapTriangles(pivot, j);
184 ++pivot;
189 pivot = (pivot == l && j < pivot) ? j : pivot;
190 return pivot;
322 int pivot = sortTriangles(l, r, split, axis); local
    [all...]
  /external/icu4c/test/perf/utfperf/
utfperf.cpp 34 static UChar pivot[INTERMEDIATE_CAPACITY]; variable
56 UOPTION_DEF("pivot", '\x01', UOPT_REQUIRES_ARG)
63 "\t--pivot Length (in UChars) of the UTF-16 pivot buffer, if applicable.\n"
82 fprintf(stderr, "error: pivot length must be 1..%ld\n", (long)PIVOT_CAPACITY);
298 pivotSource=pivotTarget=pivot;
299 pivotLimit=pivot+testcase.pivotLength;
308 pivot, &pivotSource, &pivotTarget, pivotLimit,
  /libcore/luni/src/main/java/java/util/
DualPivotQuicksort.java 21 * This class implements the Dual-Pivot Quicksort algorithm by
25 * faster than traditional (one-pivot) Quicksort implementations.
114 } else { // Use Dual-Pivot Quicksort on large arrays
121 * Dual-Pivot Quicksort algorithm.
223 * | < pivot | == pivot | ? | > pivot |
231 * all in (left, less) < pivot
232 * all in [less, k) == pivot
233 * all in (great, right) > pivot
    [all...]
TreeMap.java 524 Node<K, V> pivot = root.right; local
525 Node<K, V> pivotLeft = pivot.left;
526 Node<K, V> pivotRight = pivot.right;
528 // move the pivot's left child to the root's right
534 replaceInParent(root, pivot);
536 // move the root to the pivot's left
537 pivot.left = root;
538 root.parent = pivot;
543 pivot.height = Math.max(root.height,
551 Node<K, V> pivot = root.left local
    [all...]
ComparableTimSort.java 215 Comparable<Object> pivot = (Comparable) a[start]; local
217 // Set left (and right) to the index where a[start] (pivot) belongs
223 * pivot >= all in [lo, left).
224 * pivot < all in [right, start).
228 if (pivot.compareTo(a[mid]) < 0)
236 * The invariants still hold: pivot >= all in [lo, left) and
237 * pivot < all in [left, start), so pivot belongs at left. Note
238 * that if there are elements equal to pivot, left points to the
240 * Slide elements over to make room to make room for pivot
    [all...]
  /external/webkit/PerformanceTests/SunSpider/resources/
results-TEMPLATE.html 61 var output = pivot(outputJSON);
63 function pivot(input) {
100 var output1 = pivot(output1JSON);
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/
partition.h 50 * @param pred Partition predicate, possibly including some kind of pivot.
290 // Go right until key is geq than pivot.
294 // Go left until key is less than pivot.
367 // Divide, leave pivot unchanged in last place.
374 // Swap pivot back to middle.
384 // elements not strictly larger than the pivot.
390 // Find other end of pivot-equal range.
395 // Only skip the pivot.
quicksort.h 44 * @param pivot_rank Desired rank of the pivot.
45 * @param num_samples Choose pivot from that many samples.
80 value_type& pivot = samples[pivot_rank * num_samples / n]; local
83 pred(comp, pivot);
balanced_quicksort.h 126 // Swap pivot value to end.
138 // Swap back pivot to middle.
285 // Divide, leave pivot unchanged in last place.
293 // Swap pivot back to middle.
303 // elements not strictly larger than the pivot.
310 // Find other end of pivot-equal range.
315 // Only skip the pivot.
318 // Elements equal to pivot are done.
  /external/srec/srec/clib/
matrix_i.c 33 #define PIVOT 1
109 #if PIVOT
147 #if PIVOT
183 #if PIVOT
  /external/apache-xml/src/main/java/org/apache/xml/utils/
NodeVector.java 669 * Pick a pivot and move it out of the way
671 int pivot = a[(lo + hi) / 2]; local
674 a[hi] = pivot;
681 * is greater than the pivot or lo >= hi
683 while (a[lo] <= pivot && lo < hi)
690 * is less than the pivot, or lo >= hi
692 while (pivot <= a[hi] && lo < hi)
719 a[hi] = pivot;
723 * equal to pivot, elements a[hi+1] to a[hi0] are greater than
724 * pivot
    [all...]
  /packages/apps/Launcher2/src/com/android/launcher2/
HolographicOutlineHelper.java 91 final float pivot = 0.95f; local
92 if (r < pivot) {
93 return (float) Math.pow(r / pivot, 1.5f);
  /external/opencv/cxcore/include/
cxmisc.h 470 T* pivot; \
478 pivot = left + (n/2); \
487 a = pivot - d, b = pivot, c = pivot + d; \
488 pivot = LT(*a, *b) ? (LT(*b, *c) ? b : (LT(*a, *c) ? c : a)) \
496 a = left, b = pivot, c = right; \
497 pivot = LT(*a, *b) ? (LT(*b, *c) ? b : (LT(*a, *c) ? c : a)) \
499 if( pivot != left0 ) \
501 CV_SWAP( *pivot, *left0, t );
    [all...]
  /external/llvm/lib/Transforms/Utils/
LowerSwitch.cpp 145 CaseRange& Pivot = *(Begin + Mid);
146 DEBUG(dbgs() << "Pivot ==> "
147 << cast<ConstantInt>(Pivot.Low)->getValue() << " -"
148 << cast<ConstantInt>(Pivot.High)->getValue() << "\n");
155 // Create a new node that checks if the value is < pivot. Go to the
163 Val, Pivot.Low, "Pivot");
  /external/hyphenation/
substrings.c 69 swap2(a,b,p,right); // Move pivot to end
77 swap2(a,b,right,p); // Move pivot to its final place
91 int p = left + (right-left)/2; //select a pivot
  /external/skia/include/core/
SkMatrix.h 175 /** Set the matrix to scale by sx and sy, with a pivot point at (px, py).
176 The pivot point is the coordinate that should remain unchanged by the
188 pivot point at (px, py). The pivot point is the coordinate that should
196 a pivot point at (px, py). The pivot point is the coordinate that
204 /** Set the matrix to skew by sx and sy, with a pivot point at (px, py).
205 The pivot point is the coordinate that should remain unchanged by the
  /frameworks/base/core/java/android/view/animation/
RotateAnimation.java 154 * the pivot point. This is only possible for ABSOLUTE pivot values.

Completed in 796 milliseconds

1 2 3 4