Searched refs:inner (Results 101 - 125 of 350) sorted by relevance

1234567891011>>

/external/skia/experimental/SkV8Example/js/
H A Dgears.js15 var inner = 0.7 * r;
19 pathLike.lineTo(Math.sin(dT*i+dTq)*inner, Math.cos(dT*i+dTq)*inner);
20 pathLike.lineTo(Math.sin(dT*(i+1)-dTq)*inner, Math.cos(dT*(i+1)-dTq)*inner);
/external/skia/tests/
H A DPathOpsConicLineIntersectionTest.cpp80 for (int inner = 0; inner < result; ++inner) {
81 double conicT = intersections[0][inner];
83 double lineT = intersections[1][inner];
H A DPathOpsCubicIntersectionTest.cpp437 static void oneOff(skiatest::Reporter* reporter, int outer, int inner) { argument
439 const CubicPts& cubic2 = testSet[inner];
443 static void newOneOff(skiatest::Reporter* reporter, int outer, int inner) { argument
445 const CubicPts& cubic2 = newTestSet[inner];
457 for (int inner = outer + 1; inner < testSetCount; ++inner) {
458 oneOff(reporter, outer, inner);
462 for (int inner = outer + 1; inner < newTestSetCoun
[all...]
H A DRegionTest.cpp125 static bool slow_contains(const SkRegion& outer, const SkRegion& inner) { argument
127 tmp.op(outer, inner, SkRegion::kUnion_Op);
137 static bool slow_intersects(const SkRegion& outer, const SkRegion& inner) { argument
139 return tmp.op(outer, inner, SkRegion::kIntersect_Op);
199 SkRegion inner; local
200 randRgn(rand, &inner, 2);
201 proc(reporter, outer, inner);
/external/elfutils/src/
H A Dstrip.c674 size_t inner; local
675 for (inner = 1;
676 inner < shdr_info[cnt].data->d_size / sizeof (Elf32_Word);
677 ++inner)
679 if (grpref[inner] < shnum)
680 shdr_info[grpref[inner]].group_idx = cnt;
685 if (inner == 1 || (inner == 2 && (grpref[0] & GRP_COMDAT) == 0))
690 shdr_info[cnt].group_cnt = inner - 1;
851 for (size_t inner
1295 size_t inner; local
[all...]
/external/guava/guava-tests/test/com/google/common/collect/
H A DSynchronizedQueueTest.java33 TestQueue<String> inner = new TestQueue<String>();
34 Queue<String> outer = Synchronized.queue(inner, inner.mutex);
H A DSynchronizedSetTest.java50 TestSet<String> inner = new TestSet<String>(new HashSet<String>(), MUTEX);
51 Set<String> outer = Synchronized.set(inner, inner.mutex);
H A DSynchronizedNavigableSetTest.java48 TestSet<E> inner = new TestSet<E>(
51 Synchronized.navigableSet(inner, MUTEX);
160 TestSet<String> inner = new TestSet<String>(innermost, MUTEX);
162 Synchronized.navigableSet(inner, MUTEX);
/external/clang/docs/tools/
H A Ddump_ast_matchers.py146 result, inner, name = m.groups()
147 if not inner:
148 inner = result
149 add_matcher(result, name, 'Matcher<%s>...' % inner,
159 inner, name = m.groups()
160 add_matcher('Type', name, 'Matcher<%s>...' % inner,
164 # add_matcher('TypeLoc', '%sLoc' % name, 'Matcher<%sLoc>...' % inner,
/external/fmtlib/doc/bootstrap/
H A Dnormalize.less308 // Remove inner padding and border in Firefox 4+.
311 button::-moz-focus-inner,
312 input::-moz-focus-inner {
346 input[type="number"]::-webkit-inner-spin-button,
365 // Remove inner padding and search cancel button in Safari and Chrome on OS X.
/external/clang/test/Analysis/inlining/
H A Dpath-notes.cpp288 Inner *inner; member in class:PR17746::Outer
290 delete inner;
/external/libbrillo/brillo/errors/
H A Derror_unittest.cc22 brillo::ErrorPtr inner = GenerateNetworkError(); local
23 return Error::Create(FROM_HERE, "HTTP", "404", "Not found", std::move(inner));
/external/eigen/Eigen/src/SparseCore/
H A DSparseMatrix.h154 /** \returns a const pointer to the array of inner indices.
158 /** \returns a non-const pointer to the array of inner indices.
163 /** \returns a const pointer to the array of the starting positions of the inner vectors.
167 /** \returns a non-const pointer to the array of the starting positions of the inner vectors.
172 /** \returns a const pointer to the array of the number of non zeros of the inner vectors.
176 /** \returns a non-const pointer to the array of the number of non zeros of the inner vectors.
193 const Index inner = IsRowMajor ? col : row; local
195 return m_data.atInRange(m_outerIndex[outer], end, StorageIndex(inner));
211 const Index inner = IsRowMajor ? col : row; local
218 const Index p = m_data.searchLowerIndex(start,end-1,StorageIndex(inner));
390 insertBackByOuterInner(Index outer, Index inner) argument
402 insertBackByOuterInnerUnordered(Index outer, Index inner) argument
889 const Index inner = IsRowMajor ? col : row; local
1134 const Index inner = IsRowMajor ? col : row; local
1286 const Index inner = IsRowMajor ? col : row; local
[all...]
H A DSparseMap.h108 const Index inner = IsRowMajor ? col : row; local
114 else if (end>0 && inner==m_innerIndices[end-1])
119 const StorageIndex* r = std::lower_bound(&m_innerIndices[start],&m_innerIndices[end-1],inner);
121 return ((*r==inner) && (id<end)) ? m_values[id] : Scalar(0);
183 const Index inner = IsRowMajor ? col : row; local
189 StorageIndex* r = std::lower_bound(&Base::m_innerIndices[start],&Base::m_innerIndices[end],inner);
191 eigen_assert((*r==inner) && (id<end) && "coeffRef cannot be called on a zero coefficient");
/external/bison/etc/
H A Dbench.pl.in85 static int inner = 1;
89 else if (inner > outer)
91 inner = 1;
95 return inner++;
/external/clang/test/CodeGenCXX/
H A Dcxx0x-initializer-stdinitializerlist.cpp196 std::initializer_list<destroyme1> inner; local
197 target({ inner, { destroyme1() } });
199 // Only one destroy loop, since only one inner init list is directly inited.
208 std::initializer_list<destroyme1> inner; local
210 { inner, { destroyme1() } };
214 // Only one destroy loop, since only one inner init list is directly inited.
/external/clang/test/Modules/
H A Dusing-decl.cpp61 UsingDecl::inner y = x;
/external/clang/test/SemaCXX/
H A Dmissing-namespace-qualifier-typo-corrections.cpp43 namespace inner { namespace in namespace:N
44 class myvector { /* ... */ }; // expected-note{{'inner::myvector' declared here}}
48 myvector v; // expected-error{{unknown type name 'myvector'; did you mean 'inner::myvector'?}}
/external/skia/include/core/
H A DSkColorFilter.h90 * If this subclass can optimally createa composition with the inner filter, return it as
94 * e.g. result(color) == this_filter(inner(color))
122 /** Construct a colorfilter whose effect is to first apply the inner filter and then apply
123 * the outer filter to the result of the inner's.
124 * The reference counts for outer and inner are incremented.
130 sk_sp<SkColorFilter> inner);
/external/skia/include/effects/
H A DSkColorMatrix.h67 static void SetConcat(SkScalar result[20], const SkScalar outer[20], const SkScalar inner[20]);
/external/skia/src/pathops/
H A DSkOpBuilder.cpp155 for (int inner = 0; inner < index; ++inner) {
157 if (SkRect::Intersects(fPathRefs[inner].getBounds(), testBounds)) {
/external/Microsoft-GSL/tests/
H A Dstring_span_tests.cpp584 const span<const char> inner = vec; local
585 cstring_span<> span = inner;
592 span<char> inner = vec; local
593 cstring_span<> span = inner;
691 const span<const char> inner = vec; local
692 string_span<> span = inner;
700 span<char> inner = vec; local
701 string_span<> span = inner;
709 const span<char> inner = vec; local
710 string_span<> span = inner;
[all...]
/external/eigen/Eigen/src/Core/
H A DRedux.h112 inner = Start % Derived::InnerSizeAtCompileTime enumerator in enum:Eigen::internal::redux_novec_unroller::__anon5202
120 return mat.coeffByOuterInner(outer, inner);
162 inner = index % int(Derived::InnerSizeAtCompileTime), enumerator in enum:Eigen::internal::redux_vec_unroller::__anon5204
171 return mat.template packetByOuterInner<alignment,PacketScalar>(outer, inner);
380 CoeffReturnType coeffByOuterInner(Index outer, Index inner) const
381 { return m_evaluator.coeff(IsRowMajor ? outer : inner, IsRowMajor ? inner : outer); }
384 PacketType packetByOuterInner(Index outer, Index inner) const
385 { return m_evaluator.template packet<LoadMode,PacketType>(IsRowMajor ? outer : inner, IsRowMajor ? inner
[all...]
/external/skia/bench/
H A DShapesBench.cpp24 DEFINE_string(innerShapesType, "none", "Type of inner shape to use in ShapesBench. Must be one of: "
195 const SkRRect* inner; variable
197 case kRect_ShapesType: inner = &fInnerRect; break;
198 case kOval_ShapesType: inner = &fInnerOval; break;
199 case kRRect_ShapesType: inner = &fInnerRRect; break;
202 std::cref(*outer), std::cref(*inner),
/external/skia/src/core/
H A DSkLineClipper.cpp69 // returns true if outer contains inner, even if inner is empty.
70 // note: outer.contains(inner) always returns false if inner is empty.
72 const SkRect& inner) {
73 return outer.fLeft <= inner.fLeft && outer.fTop <= inner.fTop &&
74 outer.fRight >= inner.fRight && outer.fBottom >= inner.fBottom;
71 containsNoEmptyCheck(const SkRect& outer, const SkRect& inner) argument

Completed in 1940 milliseconds

1234567891011>>