| /external/skia/legacy/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)
|
| /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,
|
| SkTSort.h | 136 static T* SkTQSort_Partition(T* left, T* right, T* pivot, C lessThan) {
137 T pivotValue = *pivot;
138 SkTSwap(*pivot, *right);
164 T* pivot = left + ((right - left) >> 1); local
165 pivot = SkTQSort_Partition(left, right, pivot, lessThan);
167 ptrdiff_t leftSize = pivot - left;
168 ptrdiff_t rightSize = right - pivot;
171 SkTInsertionSort(left, pivot - 1, lessThan);
173 SkTIntroSort(depth, left, pivot - 1, lessThan)
[all...] |
| /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/Gallery2/jni_mosaic/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);
|
| /packages/apps/Gallery2/src/com/android/gallery3d/filtershow/filters/ |
| SplineMath.java | 41 int pivot = 0; local
44 pivot = j;
47 cur = points[pivot];
48 next = points[pivot + 1];
63 double tc = (a * a * a - a) * derivatives[pivot];
64 double td = (b * b * b - b) * derivatives[pivot + 1];
82 int pivot = 0; local
84 pivot = j;
89 cur = mPoints[pivot];
90 next = mPoints[pivot + 1]
[all...] |
| /external/eigen/bench/btl/actions/ |
| action_lu_solve.hh | 74 typename Interface::Pivot_Vector pivot; // pivot vector local
75 Interface::new_Pivot_Vector(pivot,size);
89 Interface::LU_factor(LU,pivot,size);
93 Interface::LU_solve(LU,pivot,B,X,size);
125 Interface::free_Pivot_Vector(pivot);
|
| /external/qemu/distrib/sdl-1.2.15/src/stdlib/ |
| SDL_qsort.c | 133 * 3. We choose a pivot by looking at the first, last
136 * choosing the pivot, and it makes things a little
137 * easier in the partitioning step. Anyway, the pivot
148 * 4. We copy the pivot element to a separate place
151 * and don't have to wonder "did we move the pivot
198 #define Pivot(swapper,sz) \
225 while (compare(first,pivot)<0) first+=sz; \
226 while (compare(pivot,last)<0) last-=sz; \
261 memcpy(pivot,first,size); \
263 memcpy(test,pivot,size);
326 char *pivot=malloc(size); local
357 char *pivot=malloc(size); local
388 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/eigen/bench/btl/libs/blitz/ |
| blitz_LU_solve_interface.hh | 39 inline static void new_Pivot_Vector(Pivot_Vector & pivot,int N)
42 pivot.resize(N);
46 inline static void free_Pivot_Vector(Pivot_Vector & pivot)
87 inline static void LU_factor(gene_matrix & LU, Pivot_Vector & pivot, int N)
117 // Search for the largest pivot element :
139 pivot( j ) = index_max ;
141 // Divide by the pivot element :
150 inline static void LU_solve(const gene_matrix & LU, const Pivot_Vector pivot, gene_vector &B, gene_vector X, int N)
161 int ip = pivot( i ) ;
|
| /external/eigen/bench/btl/libs/gmm/ |
| gmm_LU_solve_interface.hh | 39 inline static void new_Pivot_Vector(Pivot_Vector & pivot,int N)
42 pivot.resize(N);
46 inline static void free_Pivot_Vector(Pivot_Vector & pivot)
87 inline static void LU_factor(gene_matrix & LU, Pivot_Vector & pivot, int N)
117 // Search for the largest pivot element :
139 pivot( j ) = index_max ;
141 // Divide by the pivot element :
150 inline static void LU_solve(const gene_matrix & LU, const Pivot_Vector pivot, gene_vector &B, gene_vector X, int N)
161 int ip = pivot( i ) ;
|
| /external/eigen/bench/btl/libs/mtl4/ |
| mtl4_LU_solve_interface.hh | 39 inline static void new_Pivot_Vector(Pivot_Vector & pivot,int N)
42 pivot.resize(N);
46 inline static void free_Pivot_Vector(Pivot_Vector & pivot)
87 inline static void LU_factor(gene_matrix & LU, Pivot_Vector & pivot, int N)
117 // Search for the largest pivot element :
139 pivot( j ) = index_max ;
141 // Divide by the pivot element :
150 inline static void LU_solve(const gene_matrix & LU, const Pivot_Vector pivot, gene_vector &B, gene_vector X, int N)
161 int ip = pivot( i ) ;
|
| /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...] |
| /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);
|
| /external/srec/srec/clib/ |
| matrix_i.c | 33 #define PIVOT 1
109 #if PIVOT
147 #if PIVOT
183 #if PIVOT
|
| /external/llvm/lib/Transforms/Utils/ |
| LowerSwitch.cpp | 133 CaseRange& Pivot = *(Begin + Mid);
134 DEBUG(dbgs() << "Pivot ==> "
135 << cast<ConstantInt>(Pivot.Low)->getValue() << " -"
136 << cast<ConstantInt>(Pivot.High)->getValue() << "\n");
143 // Create a new node that checks if the value is < pivot. Go to the
151 Val, Pivot.Low, "Pivot");
|
