Home
last modified time | relevance | path

Searched refs:pivot (Results 1 – 25 of 125) sorted by relevance

12345

/third_party/skia/src/core/
DSkStrokerPriv.cpp15 static void ButtCapper(SkPath* path, const SkPoint& pivot, const SkVector& normal, in ButtCapper() argument
20 static void RoundCapper(SkPath* path, const SkPoint& pivot, const SkVector& normal, in RoundCapper() argument
25 SkPoint projectedCenter = pivot + parallel; in RoundCapper()
31 static void SquareCapper(SkPath* path, const SkPoint& pivot, const SkVector& normal, in SquareCapper() argument
37 path->setLastPt(pivot.fX + normal.fX + parallel.fX, pivot.fY + normal.fY + parallel.fY); in SquareCapper()
38 path->lineTo(pivot.fX - normal.fX + parallel.fX, pivot.fY - normal.fY + parallel.fY); in SquareCapper()
40 path->lineTo(pivot.fX + normal.fX + parallel.fX, pivot.fY + normal.fY + parallel.fY); in SquareCapper()
41 path->lineTo(pivot.fX - normal.fX + parallel.fX, pivot.fY - normal.fY + parallel.fY); in SquareCapper()
70 static void HandleInnerJoin(SkPath* inner, const SkPoint& pivot, const SkVector& after) { in HandleInnerJoin() argument
78 inner->lineTo(pivot.fX, pivot.fY); in HandleInnerJoin()
[all …]
DSkTSort.h133 static T* SkTQSort_Partition(T* left, int count, T* pivot, const C& lessThan) { in SkTQSort_Partition() argument
136 T pivotValue = *pivot; in SkTQSort_Partition()
137 swap(*pivot, *right); in SkTQSort_Partition()
177 T* pivot = SkTQSort_Partition(left, count, middle, lessThan); in SkTIntroSort() local
178 int pivotCount = pivot - left; in SkTIntroSort()
DSkStrokerPriv.h27 const SkPoint& pivot,
34 const SkPoint& pivot,
/third_party/flutter/skia/src/core/
DSkStrokerPriv.cpp15 static void ButtCapper(SkPath* path, const SkPoint& pivot, const SkVector& normal, in ButtCapper() argument
20 static void RoundCapper(SkPath* path, const SkPoint& pivot, const SkVector& normal, in RoundCapper() argument
25 SkPoint projectedCenter = pivot + parallel; in RoundCapper()
31 static void SquareCapper(SkPath* path, const SkPoint& pivot, const SkVector& normal, in SquareCapper() argument
37 path->setLastPt(pivot.fX + normal.fX + parallel.fX, pivot.fY + normal.fY + parallel.fY); in SquareCapper()
38 path->lineTo(pivot.fX - normal.fX + parallel.fX, pivot.fY - normal.fY + parallel.fY); in SquareCapper()
40 path->lineTo(pivot.fX + normal.fX + parallel.fX, pivot.fY + normal.fY + parallel.fY); in SquareCapper()
41 path->lineTo(pivot.fX - normal.fX + parallel.fX, pivot.fY - normal.fY + parallel.fY); in SquareCapper()
70 static void HandleInnerJoin(SkPath* inner, const SkPoint& pivot, const SkVector& after) { in HandleInnerJoin() argument
78 inner->lineTo(pivot.fX, pivot.fY); in HandleInnerJoin()
[all …]
DSkTSort.h141 static T* SkTQSort_Partition(T* left, T* right, T* pivot, C lessThan) { in SkTQSort_Partition() argument
143 T pivotValue = *pivot; in SkTQSort_Partition()
144 swap(*pivot, *right); in SkTQSort_Partition()
182 T* pivot = left + ((right - left) >> 1); in SkTIntroSort() local
183 pivot = SkTQSort_Partition(left, right, pivot, lessThan); in SkTIntroSort()
185 SkTIntroSort(depth, left, pivot - 1, lessThan); in SkTIntroSort()
186 left = pivot + 1; in SkTIntroSort()
DSkStrokerPriv.h27 const SkPoint& pivot,
34 const SkPoint& pivot,
/third_party/protobuf/js/experimental/runtime/kernel/
Dmessage_set.js108 getMessageOrNull(typeId, instanceCreator, pivot) { argument
110 return item ? item.getMessageOrNull(instanceCreator, pivot) : null;
120 getMessageAttach(typeId, instanceCreator, pivot) { argument
123 return item.getMessageAttach(instanceCreator, pivot);
135 getMessageAccessorOrNull(typeId, pivot) { argument
137 return item ? item.getMessageAccessorOrNull(pivot) : null;
222 getMessage(instanceCreator, pivot) { argument
224 MSET_MESSAGE_FIELD_NUMBER, instanceCreator, pivot);
233 getMessageOrNull(instanceCreator, pivot) { argument
235 MSET_MESSAGE_FIELD_NUMBER, instanceCreator, pivot);
[all …]
Dkernel.js156 indexArray, bufferDecoder, fieldNumber, instanceCreator, pivot) { argument
160 bufferDecoder, indexArray[i], fieldNumber, instanceCreator, pivot);
185 function readAccessor(indexArray, bufferDecoder, pivot = undefined) { argument
200 return Kernel.fromBufferDecoder_(accessorBuffer, pivot);
213 function readMessage(indexArray, bufferDecoder, instanceCreator, pivot) { argument
215 const accessor = readAccessor(indexArray, bufferDecoder, pivot);
231 indexArray, bufferDecoder, fieldNumber, instanceCreator, pivot) { argument
236 instanceCreator, pivot);
251 bufferDecoder, indexEntry, fieldNumber, instanceCreator, pivot) { argument
260 const kernel = Kernel.fromBufferDecoder_(accessorBuffer, pivot);
[all …]
Dindexer.js37 function buildIndex(bufferDecoder, pivot) { argument
40 const storage = new BinaryStorage(pivot);
/third_party/boost/boost/sort/pdqsort/
Dpdqsort.hpp193 T pivot(BOOST_PDQSORT_PREFER_MOVE(*begin)); in partition_right_branchless() local
199 while (comp(*++first, pivot)); in partition_right_branchless()
203 if (first - 1 == begin) while (first < last && !comp(*--last, pivot)); in partition_right_branchless()
204 else while ( !comp(*--last, pivot)); in partition_right_branchless()
229 offsets_l[num_l] = i++; num_l += !comp(*it, pivot); ++it; in partition_right_branchless()
230 offsets_l[num_l] = i++; num_l += !comp(*it, pivot); ++it; in partition_right_branchless()
231 offsets_l[num_l] = i++; num_l += !comp(*it, pivot); ++it; in partition_right_branchless()
232 offsets_l[num_l] = i++; num_l += !comp(*it, pivot); ++it; in partition_right_branchless()
233 offsets_l[num_l] = i++; num_l += !comp(*it, pivot); ++it; in partition_right_branchless()
234 offsets_l[num_l] = i++; num_l += !comp(*it, pivot); ++it; in partition_right_branchless()
[all …]
/third_party/cmsis/CMSIS/DSP/Source/SupportFunctions/
Darm_quick_sort_f32.c35 float32_t pivot; in arm_quick_sort_partition_f32() local
40 pivot = pSrc[pivot_index]; in arm_quick_sort_partition_f32()
67 } while (pSrc[i] < pivot && i<last); in arm_quick_sort_partition_f32()
73 } while (pSrc[j] > pivot); in arm_quick_sort_partition_f32()
81 } while (pSrc[i] > pivot && i<last); in arm_quick_sort_partition_f32()
87 } while (pSrc[j] < pivot); in arm_quick_sort_partition_f32()
108 int32_t pivot; in arm_quick_sort_core_f32() local
111 pivot = arm_quick_sort_partition_f32(pSrc, first, last, dir); in arm_quick_sort_core_f32()
114 arm_quick_sort_core_f32(pSrc, first, pivot, dir); in arm_quick_sort_core_f32()
115 arm_quick_sort_core_f32(pSrc, pivot+1, last, dir); in arm_quick_sort_core_f32()
/third_party/boost/libs/numeric/interval/examples/
Dfilter.cpp74 int pivot = i; in det_sign_algo1() local
80 if (m > max) { max = m; pivot = j; } in det_sign_algo1()
83 if (pivot != i) { in det_sign_algo1()
86 p[i] = p[pivot]; in det_sign_algo1()
87 p[pivot] = tmp; in det_sign_algo1()
93 const I &pivot = line1[i]; in det_sign_algo1() local
94 if (boost::numeric::interval_lib::cerlt(pivot, 0.)) sig = -sig; in det_sign_algo1()
97 I fact = line2[i] / pivot; in det_sign_algo1()
121 int pivot = i; in det_sign_algo2() local
125 if (m > max) { max = m; pivot = j; } in det_sign_algo2()
[all …]
/third_party/flutter/skia/third_party/externals/spirv-tools/source/util/
Dmove_to_front.h580 const uint32_t pivot = RightOf(node); in RotateLeft() local
581 assert(pivot); in RotateLeft()
584 MutableRightOf(node) = LeftOf(pivot); in RotateLeft()
589 MutableParentOf(pivot) = ParentOf(node); in RotateLeft()
591 root_ = pivot; in RotateLeft()
593 MutableLeftOf(ParentOf(node)) = pivot; in RotateLeft()
595 MutableRightOf(ParentOf(node)) = pivot; in RotateLeft()
598 MutableLeftOf(pivot) = node; in RotateLeft()
599 MutableParentOf(node) = pivot; in RotateLeft()
604 UpdateNode(pivot); in RotateLeft()
[all …]
/third_party/skia/samplecode/
DSampleAndroidShadows.cpp269 SkPoint pivot = SkPoint::Make(fWideRectPath.getBounds().width()/2, in onDrawContent() local
278 persp.preTranslate(-pivot.fX, -pivot.fY); in onDrawContent()
279 persp.postTranslate(pivot.fX + translate.fX, pivot.fY + translate.fY); in onDrawContent()
284 std::max(1.0f, 16 + fZDelta) - SkScalarSin(radians)*pivot.fY); in onDrawContent()
288 pivot = SkPoint::Make(fWideOvalPath.getBounds().width() / 2, in onDrawContent()
295 persp.preTranslate(-pivot.fX, -pivot.fY); in onDrawContent()
296 persp.postTranslate(pivot.fX + translate.fX, pivot.fY + translate.fY); in onDrawContent()
300 std::max(1.0f, 32 + fZDelta) + SkScalarSin(radians)*pivot.fX); in onDrawContent()
304 pivot = SkPoint::Make(fStarPath.getBounds().width() / 2, in onDrawContent()
310 persp.preTranslate(-pivot.fX, -pivot.fY); in onDrawContent()
[all …]
/third_party/flutter/skia/samplecode/
DSampleAndroidShadows.cpp270 SkPoint pivot = SkPoint::Make(fWideRectPath.getBounds().width()/2, in onDrawContent() local
279 persp.preTranslate(-pivot.fX, -pivot.fY); in onDrawContent()
280 persp.postTranslate(pivot.fX + translate.fX, pivot.fY + translate.fY); in onDrawContent()
285 SkTMax(1.0f, 16 + fZDelta) - SkScalarSin(radians)*pivot.fY); in onDrawContent()
289 pivot = SkPoint::Make(fWideOvalPath.getBounds().width() / 2, in onDrawContent()
296 persp.preTranslate(-pivot.fX, -pivot.fY); in onDrawContent()
297 persp.postTranslate(pivot.fX + translate.fX, pivot.fY + translate.fY); in onDrawContent()
301 SkTMax(1.0f, 32 + fZDelta) + SkScalarSin(radians)*pivot.fX); in onDrawContent()
305 pivot = SkPoint::Make(fStarPath.getBounds().width() / 2, in onDrawContent()
311 persp.preTranslate(-pivot.fX, -pivot.fY); in onDrawContent()
[all …]
/third_party/flutter/skia/third_party/externals/sdl/src/stdlib/
DSDL_qsort.c303 while (compare(first,pivot)<0) first+=sz; \
304 while (compare(pivot,last)<0) last-=sz; \
342 memcpy(pivot,first,size); \
344 memcpy(test,pivot,size); \
410 char *pivot=malloc(size); in qsort_nonaligned() local
412 assert(pivot!=0); in qsort_nonaligned()
422 memcpy(pivot,mid,size); in qsort_nonaligned()
432 free(pivot); in qsort_nonaligned()
441 char *pivot=malloc(size); in qsort_aligned() local
443 assert(pivot!=0); in qsort_aligned()
[all …]
/third_party/boost/boost/move/algo/detail/
Dpdqsort.hpp160 T pivot(boost::move(*begin)); in partition_right() local
167 while (comp(*++first, pivot)); in partition_right()
171 if (first - 1 == begin) while (first < last && !comp(*--last, pivot)); in partition_right()
172 else while ( !comp(*--last, pivot)); in partition_right()
183 while (comp(*++first, pivot)); in partition_right()
184 while (!comp(*--last, pivot)); in partition_right()
190 *pivot_pos = boost::move(pivot); in partition_right()
203 T pivot(boost::move(*begin)); in partition_left() local
207 while (comp(pivot, *--last)); in partition_left()
209 if (last + 1 == end) while (first < last && !comp(pivot, *++first)); in partition_left()
[all …]
/third_party/boost/boost/algorithm/
Dgather.hpp88 …( BidirectionalIterator first, BidirectionalIterator last, BidirectionalIterator pivot, Pred pred ) in gather() argument
94 std::stable_partition ( first, pivot, !boost::bind<bool> ( pred, _1 )), in gather()
95 std::stable_partition ( pivot, last, boost::bind<bool> ( pred, _1 ))); in gather()
113 typename boost::range_iterator<const BidirectionalRange>::type pivot, in gather() argument
116 return boost::algorithm::gather ( boost::begin ( range ), boost::end ( range ), pivot, pred ); in gather()
/third_party/boost/boost/mpl/aux_/
Dsort_impl.hpp55 typedef typename begin<Seq>::type pivot; typedef
58 typename next<pivot>::type
61 , protect< aux::quick_sort_pred< Pred, typename deref<pivot>::type > >
70 joint_view< part1, single_view< typename deref<pivot>::type > >
/third_party/mindspore/mindspore/ccsrc/backend/kernel_compiler/cpu/
Dmultinomial_cpu_kernel.cc107 int pivot = begin + (end - begin) / 2; in Launch() local
108 float pivot_prob = cumulative_value[i * num_col + pivot]; in Launch()
110 end = pivot; in Launch()
112 begin = pivot + 1; in Launch()
/third_party/boost/libs/sort/doc/
Dpdqsort.qbk68 partition containing elements greater than the pivot. When a new pivot is chosen it's compared to
70 no elements smaller than the chosen pivot. When this happens we switch strategy for this partition,
71 and filter out all elements equal to the pivot.
84 median-of-3 pivot selection, switching to insertion sort if the number of elements to be
97 if (elements[i] < pivot) { buffer[buffer_num] = i; buffer_num++; }
99 buffer[buffer_num] = i; buffer_num += (elements[i] < pivot);
108 sort. Choosing a bad pivot will result in many comparisons that give little to no progress in the
112 Traditionally the solution to this is to randomize the pivot selection of quicksort. While this
114 small. Later, in introsort, pivot selection is kept deterministic, instead switching to the
124 A bad partition occurs when the position of the pivot after partitioning is under 12.5% (1/8th)
[all …]
/third_party/weston/shared/
Dmatrix.c176 unsigned pivot; in matrix_invert() local
186 pivot = find_pivot(&A[k * 4], k); in matrix_invert()
187 if (pivot != k) { in matrix_invert()
188 swap_unsigned(&p[k], &p[pivot]); in matrix_invert()
189 swap_rows(&A[k], &A[pivot]); in matrix_invert()
/third_party/boost/libs/mpl/doc/src/refmanual/
Dsort.rst90 typedef begin<s>::type pivot;
92 iterator_range< next<pivot>::type, end<s>::type >
93 , apply_wrap2<p,_1,deref<pivot>::type>
103 joint_view<part1,single_view< deref<pivot>::type > >
/third_party/ffmpeg/libavcodec/
Dmss12.c428 model_init(&sc->pivot, 3, THRESH_LOW); in slicecontext_init()
442 model_reset(&sc->pivot); in ff_mss12_slicecontext_reset()
452 val = acoder->get_model_sym(acoder, &sc->pivot) + 1; in decode_pivot()
545 int mode, pivot; in ff_mss12_decode_rect() local
553 if ((pivot = decode_pivot(sc, acoder, height)) < 1) in ff_mss12_decode_rect()
555 if (ff_mss12_decode_rect(sc, acoder, x, y, width, pivot)) in ff_mss12_decode_rect()
557 if (ff_mss12_decode_rect(sc, acoder, x, y + pivot, width, height - pivot)) in ff_mss12_decode_rect()
561 if ((pivot = decode_pivot(sc, acoder, width)) < 1) in ff_mss12_decode_rect()
563 if (ff_mss12_decode_rect(sc, acoder, x, y, pivot, height)) in ff_mss12_decode_rect()
565 if (ff_mss12_decode_rect(sc, acoder, x + pivot, y, width - pivot, height)) in ff_mss12_decode_rect()
/third_party/boost/libs/algorithm/doc/
Dgather.qbk14 …d moves the ones satisfying a predicate to them to a position (called the pivot) within the sequen…
27 gather ( BidirectionalIterator first, BidirectionalIterator last, BidirectionalIterator pivot, Pred…
31 …nalRange &range, typename boost::range_iterator<const BidirectionalRange>::type pivot, Pred pred );
49 pivot

12345