| /external/archive-patcher/generator/src/test/java/com/google/archivepatcher/generator/ |
| PreDiffPlanTest.java | 44 private <T> List<T> reverse(List<T> list) { method in class:PreDiffPlanTest
46 Collections.reverse(reversed);
60 reverse(SORTED_VOID_LIST), method
70 reverse(SORTED_DEFLATE_LIST), method
80 reverse(SORTED_DEFLATE_LIST)); method
|
| /external/tensorflow/tensorflow/core/kernels/ |
| unravel_index_op.cc | 57 Eigen::array<bool, 1> reverse({true});
66 strides = dims.reverse(reverse)
68 .reverse(reverse);
77 strides_shifted = dims.reverse(reverse)
79 .reverse(reverse);
|
| scan_ops_test.cc | 25 static Graph* LargeOneDCumsum(int num_x, bool reverse = false) {
36 static Graph* ColCumsum(int num_x, int num_y, bool reverse = false) {
47 static Graph* RowCumsum(int num_x, int num_y, bool reverse = false) {
58 static Graph* ThreeDYCumsum(int num_y, int num_z, bool reverse = false) {
71 bool reverse = false) {
74 test::Benchmark(device, LargeOneDCumsum<T>(num_x, reverse)).Run(iters);
78 bool reverse = false) {
82 test::Benchmark(device, RowCumsum(num_x, num_y, reverse)).Run(iters);
86 bool reverse = false) {
90 test::Benchmark(device, ColCumsum(num_x, num_y, reverse)).Run(iters)
[all...] |
| scan_ops_gpu.h | 52 bool reverse = false)
53 : dimx_(dimx), dimy_(dimy), dimz_(dimz), reverse_(reverse) {}
162 bool exclusive, bool reverse, Op op) {
182 MapIndexToLocation map_op(dimx, dimy, dimz, reverse);
230 typename TTypes<T, 3>::Tensor out, Op op, const bool reverse,
248 out.data(), dimx, dimy, dimz, exclusive, reverse, op));
254 out.data(), dimx, dimy, dimz, exclusive, reverse, op));
260 out.data(), dimx, dimy, dimz, exclusive, reverse, op));
266 out.data(), dimx, dimy, dimz, exclusive, reverse, op));
272 out.data(), dimx, dimy, dimz, exclusive, reverse, op))
[all...] |
| /external/mesa3d/bin/ |
| get-fixes-pick-list.sh | 16 git log --reverse --pretty=%H $latest_branchpoint > already_landed
19 git log --reverse --grep="cherry picked from commit" $latest_branchpoint..HEAD |\
24 git log --reverse --pretty=%H -i --grep="fixes:" $latest_branchpoint..origin/master |\
|
| /external/curl/docs/cmdline-opts/ |
| haproxy-protocol.d | 7 is used by some load balancers and reverse proxies to indicate the client's
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| SortedIterablesTest.java | 37 assertTrue(SortedIterables.hasSameComparator(Ordering.natural().reverse(),
38 Sets.newTreeSet(Ordering.natural().reverse())));
|
| /external/mesa3d/src/gallium/drivers/nouveau/codegen/ |
| nv50_ir_graph.h | 79 EdgeIterator(Graph::Edge *first, int dir, bool reverse)
80 : d(dir), rev(reverse)
115 inline EdgeIterator outgoing(bool reverse = false) const;
116 inline EdgeIterator incident(bool reverse = false) const;
207 Graph::EdgeIterator Graph::Node::outgoing(bool reverse) const
209 return EdgeIterator(out, 0, reverse);
212 Graph::EdgeIterator Graph::Node::incident(bool reverse) const
214 return EdgeIterator(in, 1, reverse);
|
| /external/bouncycastle/repackaged/bcprov/src/main/java/com/android/org/bouncycastle/jce/ |
| X509Principal.java | 122 * some such, converting it into an ordered set of name attributes. If reverse
128 boolean reverse,
131 super(reverse, dirName);
141 * If reverse is true, create the encoded version of the sequence starting
145 boolean reverse,
149 super(reverse, lookUp, dirName);
|
| /external/skia/src/core/ |
| SkQuadClipper.cpp | 54 bool reverse; local
61 reverse = true;
64 reverse = false;
112 if (reverse) {
|
| SkEdgeClipper.h | 44 void appendVLine(SkScalar x, SkScalar y0, SkScalar y1, bool reverse);
45 void appendQuad(const SkPoint pts[3], bool reverse);
46 void appendCubic(const SkPoint pts[4], bool reverse);
|
| SkQuadClipper.h | 56 void appendVLine(SkScalar x, SkScalar y0, SkScalar y1, bool reverse);
57 void appendQuad(const SkPoint pts[3], bool reverse);
58 void appendCubic(const SkPoint pts[4], bool reverse);
|
| SkEdgeClipper.cpp | 32 it to be increasing in Y. If it had to reverse the order of the points,
146 bool reverse = sort_increasing_Y(pts, srcPts, 3); local
159 reverse = !reverse;
167 this->appendVLine(clip.fLeft, pts[0].fY, pts[2].fY, reverse);
172 this->appendVLine(clip.fRight, pts[0].fY, pts[2].fY, reverse);
184 this->appendVLine(clip.fLeft, tmp[0].fY, tmp[2].fY, reverse);
194 this->appendVLine(clip.fLeft, pts[0].fY, pts[2].fY, reverse);
207 this->appendQuad(tmp, reverse);
208 this->appendVLine(clip.fRight, tmp[2].fY, tmp[4].fY, reverse);
337 bool reverse = sort_increasing_Y(pts, src, 4); local
[all...] |
| /external/skqp/src/core/ |
| SkQuadClipper.cpp | 54 bool reverse; local
61 reverse = true;
64 reverse = false;
112 if (reverse) {
|
| SkEdgeClipper.h | 44 void appendVLine(SkScalar x, SkScalar y0, SkScalar y1, bool reverse);
45 void appendQuad(const SkPoint pts[3], bool reverse);
46 void appendCubic(const SkPoint pts[4], bool reverse);
|
| SkQuadClipper.h | 56 void appendVLine(SkScalar x, SkScalar y0, SkScalar y1, bool reverse);
57 void appendQuad(const SkPoint pts[3], bool reverse);
58 void appendCubic(const SkPoint pts[4], bool reverse);
|
| SkEdgeClipper.cpp | 32 it to be increasing in Y. If it had to reverse the order of the points,
146 bool reverse = sort_increasing_Y(pts, srcPts, 3); local
159 reverse = !reverse;
167 this->appendVLine(clip.fLeft, pts[0].fY, pts[2].fY, reverse);
172 this->appendVLine(clip.fRight, pts[0].fY, pts[2].fY, reverse);
184 this->appendVLine(clip.fLeft, tmp[0].fY, tmp[2].fY, reverse);
194 this->appendVLine(clip.fLeft, pts[0].fY, pts[2].fY, reverse);
207 this->appendQuad(tmp, reverse);
208 this->appendVLine(clip.fRight, tmp[2].fY, tmp[4].fY, reverse);
337 bool reverse = sort_increasing_Y(pts, src, 4); local
[all...] |
| /external/llvm/unittests/ADT/ |
| RangeAdapterTest.cpp | 36 // get a linker error if reverse() chooses begin()/end() over rbegin(), rend().
67 TestRev(reverse(v));
70 TestRev(reverse(c));
80 TestRev(reverse(TypeParam({0, 1, 2, 3})));
|
| /external/guava/guava-gwt/test-super/com/google/common/base/super/com/google/common/base/ |
| EnumsTest.java | 79 assertNull(converter.reverse().convert(null));
93 assertEquals("CHEETO", converter.reverse().convert(TestEnum.CHEETO));
94 assertEquals("HONDA", converter.reverse().convert(TestEnum.HONDA));
95 assertEquals("POODLE", converter.reverse().convert(TestEnum.POODLE));
101 assertNull(converter.reverse().convert(null));
|
| /external/python/cpython2/Lib/idlelib/ |
| IdleHistory.py | 32 self.fetch(reverse=False)
37 self.fetch(reverse=True)
40 def fetch(self, reverse):
58 if reverse:
68 pointer += -1 if reverse else 1
|
| /external/python/cpython3/Lib/idlelib/ |
| history.py | 33 self.fetch(reverse=False)
38 self.fetch(reverse=True)
41 def fetch(self, reverse):
59 if reverse:
69 pointer += -1 if reverse else 1
|
| /external/eigen/Eigen/src/Core/ |
| Reverse.h | 20 struct traits<Reverse<MatrixType, Direction> >
49 /** \class Reverse
52 * \brief Expression of the reverse of a vector or matrix
54 * \tparam MatrixType the type of the object of which we are taking the reverse
55 * \tparam Direction defines the direction of the reverse operation, can be Vertical, Horizontal, or BothDirections
57 * This class represents an expression of the reverse of a vector.
58 * It is the return type of MatrixBase::reverse() and VectorwiseOp::reverse()
61 * \sa MatrixBase::reverse(), VectorwiseOp::reverse()
118 DenseBase<Derived>::reverse() function in class:Eigen::DenseBase
[all...] |
| /external/deqp/modules/gles31/scripts/ |
| gen-implicit-conversions.py | 340 def __init__(self, name, op, in_type, out_type, reverse=False):
351 self.reverse = reverse
365 if self.reverse:
373 if self.reverse:
374 expr.reverse()
406 def __init__(self, name, op, in_type, out_type, reverse=False):
407 super(ComparisonsCase, self).__init__(name, op, in_type, out_type, reverse)
424 if self.reverse:
443 def __init__(self, name, in_type, out_type, reverse=False, input_in_parens=False)
[all...] |
| /external/skia/src/shaders/gradients/ |
| Sk4fGradientBase.cpp | 31 IntervalIterator(const SkGradientShaderBase& shader, bool reverse)
33 , fFirstPos(reverse ? SK_Scalar1 : 0)
34 , fBegin(reverse ? shader.fColorCount - 1 : 0)
35 , fAdvance(reverse ? -1 : 1) {
101 bool premulColors, bool reverse,
103 const IntervalIterator iter(shader, reverse);
142 SkScalar alpha, bool reverse) {
193 const int first_index = reverse ? count - 1 : 0;
195 const SkScalar first_pos = reverse ? SK_Scalar1 : 0;
205 const SkScalar clamp_pos = reverse ? SK_ScalarInfinity : SK_ScalarNegativeInfinity
[all...] |
| /external/skqp/src/shaders/gradients/ |
| Sk4fGradientBase.cpp | 31 IntervalIterator(const SkGradientShaderBase& shader, bool reverse)
33 , fFirstPos(reverse ? SK_Scalar1 : 0)
34 , fBegin(reverse ? shader.fColorCount - 1 : 0)
35 , fAdvance(reverse ? -1 : 1) {
101 bool premulColors, bool reverse,
103 const IntervalIterator iter(shader, reverse);
142 SkScalar alpha, bool reverse) {
193 const int first_index = reverse ? count - 1 : 0;
195 const SkScalar first_pos = reverse ? SK_Scalar1 : 0;
205 const SkScalar clamp_pos = reverse ? SK_ScalarInfinity : SK_ScalarNegativeInfinity
[all...] |
