/external/chromium_org/third_party/skia/experimental/Intersection/ |
TSearch.h | 13 static T* QSort_Partition(T* left, T* right, T* pivot) 15 T pivotValue = *pivot; 16 SkTSwap(*pivot, *right); 35 T* pivot = left + (right - left >> 1); local 36 pivot = QSort_Partition(left, right, pivot); 37 QSort(left, pivot - 1); 38 QSort(pivot + 1, right); 42 static T** QSort_Partition(T** left, T** right, T** pivot) 44 T* pivotValue = *pivot; 64 T** pivot = left + (right - left >> 1); local 95 T* pivot = left + (right - left >> 1); local [all...] |
/external/skia/experimental/Intersection/ |
TSearch.h | 13 static T* QSort_Partition(T* left, T* right, T* pivot) 15 T pivotValue = *pivot; 16 SkTSwap(*pivot, *right); 35 T* pivot = left + (right - left >> 1); local 36 pivot = QSort_Partition(left, right, pivot); 37 QSort(left, pivot - 1); 38 QSort(pivot + 1, right); 42 static T** QSort_Partition(T** left, T** right, T** pivot) 44 T* pivotValue = *pivot; 64 T** pivot = left + (right - left >> 1); local 95 T* pivot = left + (right - left >> 1); local [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);
|
/development/perftests/panorama/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...] |
db_rob_image_homography.cpp | 683 /*Pivot for hypothesis pruning*/ 684 double pivot; local [all...] |
/external/chromium_org/third_party/skia/src/core/ |
SkTSort.h | 136 static T* SkTQSort_Partition(T* left, T* right, T* pivot, C lessThan) { 137 T pivotValue = *pivot; 138 SkTSwap(*pivot, *right); 176 T* pivot = left + ((right - left) >> 1); local 177 pivot = SkTQSort_Partition(left, right, pivot, lessThan); 179 SkTIntroSort(depth, left, pivot - 1, lessThan); 180 left = pivot + 1;
|
/external/skia/src/core/ |
SkTSort.h | 136 static T* SkTQSort_Partition(T* left, T* right, T* pivot, C lessThan) { 137 T pivotValue = *pivot; 138 SkTSwap(*pivot, *right); 176 T* pivot = left + ((right - left) >> 1); local 177 pivot = SkTQSort_Partition(left, right, pivot, lessThan); 179 SkTIntroSort(depth, left, pivot - 1, lessThan); 180 left = pivot + 1;
|
/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/chromium_org/third_party/tlslite/tlslite/utils/ |
rijndael.py | 115 pivot = AA[i][i] variable 116 if pivot == 0: 123 pivot = AA[i][i] variable 126 AA[i][j] = alog[(255 + log[AA[i][j] & 0xFF] - log[pivot & 0xFF]) % 255] 189 del pivot
|
/external/eigen/unsupported/Eigen/src/Skyline/ |
SkylineInplaceLU.h | 128 const double pivot = m_lu.coeffDiag(row); local 133 lIt.valueRef() /= pivot;
|
/packages/inputmethods/LatinIME/java/src/com/android/inputmethod/keyboard/internal/ |
MatrixUtils.java | 43 * Find a pivot and swap the row of squareMatrix0 and squareMatrix1 48 float pivot = Math.abs(squareMatrix0[row][row]); local 50 if (pivot < Math.abs(squareMatrix0[i][row])) { 52 pivot = Math.abs(squareMatrix0[i][row]); 73 final float pivot = squareMatrix0[row][row]; local 74 if (pivot == 0) { 75 throw new MatrixOperationFailedException("Inverse failed. Invalid pivot"); 78 squareMatrix0[row][j] /= pivot; 79 squareMatrix1[row][j] /= 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...] |
/external/chromium_org/third_party/icu/source/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,
|
/external/chromium_org/third_party/mesa/src/src/egl/main/ |
eglconfig.c | 673 const EGLint pivot = 0; local 679 _eglSwapConfigs(&configs[pivot], &configs[count / 2]); 683 while (i < count && compare(configs[i], configs[pivot], priv_data) < 0) 685 while (compare(configs[j], configs[pivot], priv_data) > 0) 698 _eglSwapConfigs(&configs[pivot], &configs[j]);
|
/external/icu/icu4c/source/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,
|
/external/mesa3d/src/egl/main/ |
eglconfig.c | 673 const EGLint pivot = 0; local 679 _eglSwapConfigs(&configs[pivot], &configs[count / 2]); 683 while (i < count && compare(configs[i], configs[pivot], priv_data) < 0) 685 while (compare(configs[j], configs[pivot], priv_data) > 0) 698 _eglSwapConfigs(&configs[pivot], &configs[j]);
|
/external/opencv/cv/src/ |
_cvkdtree.hpp | 127 const __instype & pivot; member in struct:CvKDTree::median_pr 132 : pivot(_pivot), dim(_dim), deref(_deref), ctor(_ctor) { 135 return deref(ctor(lhs), dim) <= deref(ctor(pivot), dim); 142 int pivot = (last - first) / 2; local 144 std::swap(first[pivot], last[-1]);
|
/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...] |
/libcore/luni/src/main/java/java/util/ |
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...] |
TimSort.java | 248 T pivot = a[start]; local 250 // Set left (and right) to the index where a[start] (pivot) belongs 256 * pivot >= all in [lo, left). 257 * pivot < all in [right, start). 261 if (c.compare(pivot, a[mid]) < 0) 269 * The invariants still hold: pivot >= all in [lo, left) and 270 * pivot < all in [left, start), so pivot belongs at left. Note 271 * that if there are elements equal to pivot, left points to the 273 * Slide elements over to make room for pivot [all...] |
/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...] |
/packages/apps/Launcher2/src/com/android/launcher2/ |
HolographicOutlineHelper.java | 84 final float pivot = 0.95f; local 85 if (r < pivot) { 86 return (float) Math.pow(r / pivot, 1.5f);
|
/external/pdfium/core/src/fxge/agg/agg23/ |
fx_agg_rasterizer_scanline_aa.cpp | 359 cell_aa** pivot; local 361 pivot = base + len / 2; 362 swap_cells(base, pivot);
|
/frameworks/opt/telephony/src/java/com/android/internal/telephony/ |
SubInfoRecordUpdater.java | 228 int pivot = 1 << (slotId * EVENT_OFFSET); local 229 if (msgNum >= pivot) {
|