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

1234567891011>>

/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/eigen/Eigen/src/SparseCore/
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 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);
H A DStrokeTest.cpp80 SkRect inner(r);
81 inner.inset(width/2, width/2);
83 REPORTER_ASSERT(reporter, equal(nested[1], inner));
/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/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/boringssl/include/openssl/
H A Dstack.h176 #define DEFINE_SPECIAL_STACK_OF(type, inner) \
/external/boringssl/src/include/openssl/
H A Dstack.h176 #define DEFINE_SPECIAL_STACK_OF(type, inner) \
/external/skia/include/core/
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...]
/external/guava/guava-tests/test/com/google/common/collect/
H A DSynchronizedDequeTest.java33 TestDeque<String> inner = new TestDeque<String>();
34 Deque<String> outer = Synchronized.deque(inner, inner.mutex);
/external/skia/src/gpu/
H A DSkGpuDevice_drawTexture.cpp63 SkIRect outer, inner; local
65 innerTransformedRect.round(&inner);
66 // If the inner and outer rects round to the same result, it means the
68 return inner != outer;
/external/webrtc/webrtc/base/
H A Dmessagedigest.cc135 // Inner hash; hash the inner padding, and then the input buffer.
136 scoped_ptr<uint8_t[]> inner(new uint8_t[digest->Size()]);
139 digest->Finish(inner.get(), digest->Size());
140 // Outer hash; hash the outer padding, and then the result of the inner hash.
142 digest->Update(inner.get(), digest->Size());
/external/deqp/modules/gles31/functional/
H A Des31fTessellationTests.cpp546 static string tessellationLevelsString (const float* inner, int numInner, const float* outer, int numOuter)
549 return "inner: " + elemsStr(inner, inner+numInner) + ", outer: " + elemsStr(outer, outer+numOuter);
552 static string tessellationLevelsString (const float* inner, const float* outer, TessPrimitiveType primType)
554 return tessellationLevelsString(inner, numInnerTessellationLevels(primType), outer, numOuterTessellationLevels(primType));
557 static string tessellationLevelsString (const float* inner, const float* outer)
559 return tessellationLevelsString(inner, 2, outer, 4);
659 static vector<Vec3> generateReferenceTriangleTessCoords (SpacingMode spacingMode, int inner, int outer0, int outer1, int outer2)
663 if (inner
[all...]
/external/eigen/unsupported/Eigen/CXX11/src/Tensor/
H A DTensorScan.h151 EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const TensorEvaluator<ArgType, Device>& inner() const { function in struct:Eigen::TensorEvaluator
233 self.accumulator().reduce(self.inner().coeff(curr), &accum);
235 self.accumulator().reduce(self.inner().coeff(curr), &accum);
263 self.accumulator().reduce(self.inner().coeff(curr), &accum);
265 self.accumulator().reduce(self.inner().coeff(curr), &accum);
/external/skia/src/image/
H A DSkImageShader.cpp171 sk_sp<GrFragmentProcessor> inner; local
173 inner = GrBicubicEffect::Make(args.fContext->resourceProvider(), std::move(proxy),
176 inner = GrSimpleTextureEffect::Make(args.fContext->resourceProvider(), std::move(proxy),
181 return inner;
183 return sk_sp<GrFragmentProcessor>(GrFragmentProcessor::MulOutputByInputAlpha(std::move(inner)));
/external/skia/src/pathops/
H A DSkDConicLineIntersection.cpp317 for (int inner = 0; inner < fIntersections->used(); ++inner) {
318 if (fIntersections->pt(inner) != pt) {
321 double existingConicT = (*fIntersections)[0][inner];
H A DSkDCubicLineIntersection.cpp207 for (int inner = 0; inner < fIntersections->used(); ++inner) {
208 if (fIntersections->pt(inner) != pt) {
211 double existingCubicT = (*fIntersections)[0][inner];
H A DSkDQuadLineIntersection.cpp221 for (int inner = 0; inner < fIntersections->used(); ++inner) {
222 if (fIntersections->pt(inner) != pt) {
225 double existingQuadT = (*fIntersections)[0][inner];
H A DSkOpCoincidence.cpp801 SkCoincidentSpans* inner = outer; local
802 while ((inner = inner->next())) {
805 const SkOpPtT* ics = inner->coinPtTStart();
809 const SkOpPtT* ios = inner->oppPtTStart();
820 const SkOpPtT* ice = inner->coinPtTEnd();
831 const SkOpPtT* ioe = inner->oppPtTEnd();
842 const SkOpPtT* ice = inner->coinPtTEnd();
854 const SkOpPtT* ioe = inner->oppPtTEnd();
1235 SkCoincidentSpans* inner local
[all...]
/external/boringssl/src/crypto/bn/asm/
H A Darmv4-mont.pl274 my ($tinptr,$toutptr,$inner,$outer)=map("r$_",(6..9));
297 subs $inner,$num,#8
397 mov $inner,$num
410 subs $inner,$inner,#8
473 sub $inner,$num,#8
500 subs $inner,$inner,#8
558 mov $inner,$num
621 subs $inner,
[all...]

Completed in 693 milliseconds

1234567891011>>