Searched refs:inner (Results 126 - 150 of 368) sorted by relevance

1234567891011>>

/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/guava/guava-tests/test/com/google/common/collect/
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/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.cpp153 for (int inner = 0; inner < index; ++inner) {
155 if (SkRect::Intersects(fPathRefs[inner].getBounds(), testBounds)) {
/external/eigen/Eigen/src/SparseCore/
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");
H A DSparseVector.h148 inline Scalar& insertBackByOuterInner(Index outer, Index inner) argument
152 return insertBack(inner);
160 Scalar& insertBackByOuterInnerUnordered(Index outer, Index inner) argument
164 return insertBackUnordered(inner);
176 Index inner = IsColVector ? row : col; local
180 return insert(inner);
/external/skia/tests/
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);
H A DPathOpsConicIntersectionTest.cpp335 static void oneOff(skiatest::Reporter* reporter, int outer, int inner) { argument
337 const ConicPts& c2 = testSet[inner];
343 for (int inner = outer + 1; inner < testSetCount; ++inner) {
344 oneOff(reporter, outer, inner);
/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::__anon5303
120 return mat.coeffByOuterInner(outer, inner);
162 inner = index % int(Derived::InnerSizeAtCompileTime), enumerator in enum:Eigen::internal::redux_vec_unroller::__anon5305
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
/external/wpa_supplicant_8/wpa_supplicant/wpa_gui-qt4/
H A Dnetworkconfig.cpp149 QStringList inner; local
150 inner << "PEAP" << "TTLS" << "FAST";
151 if (!inner.contains(eapSelect->itemText(sel)))
311 QString inner = phase2Select->currentText(); local
315 if (inner.startsWith("EAP-"))
317 inner.right(inner.size() - 4).
320 if (inner.startsWith("EAP-"))
322 inner.right(inner
[all...]
/external/clang/test/CXX/stmt.stmt/stmt.iter/stmt.ranged/
H A Dp1.cpp29 namespace inner { namespace in namespace:X
35 using namespace inner;
/external/clang/test/SemaTemplate/
H A Dclass-template-spec.cpp148 template<int B, int C> struct inner {}; struct in struct:PR18009::outer
149 template<int C> struct inner<A * 2, C> {}; struct in struct:PR18009::outer
H A Dtypename-specifier-4.cpp16 typedef typename MetaFun::template apply<T1, T2> inner; typedef in struct:metafun_apply2
17 typedef typename inner::type type;
H A Dalias-templates.cpp42 typedef T inner; typedef in struct:X::thing
43 typedef ptr<inner> inner_ptr;
44 typedef traits<thing<inner>> traits_type;
/external/libmojo/mojo/public/cpp/bindings/tests/
H A Darray_common_test.h207 ArrayType<int32_t> inner(4);
208 for (size_t i = 0; i < inner.size(); ++i)
209 inner[i] = static_cast<int32_t>(i + (j * 10));
210 array[j] = std::move(inner);
230 const ArrayType<int32_t>& inner = array2[j]; local
231 EXPECT_EQ(4U, inner.size());
232 for (size_t i = 0; i < inner.size(); ++i)
233 EXPECT_EQ(static_cast<int32_t>(i + (j * 10)), inner[i]);
/external/r8/src/test/examples/inlining/
H A DInlining.java68 Inner inner; field in class:InlineConstructorOfInner
71 inner = new Inner(10L).create();
/external/webrtc/webrtc/modules/audio_coding/codecs/isac/fix/source/
H A Dlattice_armv7.S24 @ r9: inner loop counter
43 ldr r9, [sp, #32] @ Restore the inner loop counter to order_coef
/external/skia/include/core/
H A DSkColorFilter.h79 * If this subclass can optimally createa composition with the inner filter, return it as
83 * e.g. result(color) == this_filter(inner(color))
101 /** Construct a colorfilter whose effect is to first apply the inner filter and then apply
102 * the outer filter to the result of the inner's.
103 * The reference counts for outer and inner are incremented.
109 sk_sp<SkColorFilter> inner);
H A DSkPathEffect.h39 * Returns a patheffect that applies the inner effect to the path, and then applies the
40 * outer effect to the result of the inner's.
42 * result = outer(inner(path))
44 static sk_sp<SkPathEffect> MakeCompose(sk_sp<SkPathEffect> outer, sk_sp<SkPathEffect> inner);
/external/eigen/unsupported/Eigen/src/SparseExtra/
H A DBlockSparseMatrix.h454 // Go to the inner block where this element belongs to
587 * \brief Allocate the internal array of pointers to blocks and their inner indices
636 * FIXME This can be unnecessarily expensive since only the inner indices have to be sorted
695 StorageIndex inner = IsColMajor ? it->row() : it->col(); local
696 m_indices[block_id(outer)] = inner;
790 /** \returns the block index where inner belongs to */
791 inline Index innerToBlock(Index inner) const
793 eigen_assert(inner < innerSize() && "OUTER INDEX OUT OF BOUNDS");
796 return (inner / m_blockSize); // Integer division
799 while(m_innerOffset[b_inner] <= inner)
[all...]

Completed in 3771 milliseconds

1234567891011>>