/external/eigen/Eigen/src/Core/ |
H A D | Redux.h | 97 inner = Start % Derived::InnerSizeAtCompileTime enumerator in enum:Eigen::internal::redux_novec_unroller::__anon4064 104 return mat.coeffByOuterInner(outer, inner); 145 inner = index % int(Derived::InnerSizeAtCompileTime), enumerator in enum:Eigen::internal::redux_vec_unroller::__anon4066 154 return mat.template packetByOuterInner<alignment>(outer, inner);
|
/external/eigen/Eigen/src/SparseCore/ |
H A D | MappedSparseMatrix.h | 71 const Index inner = IsRowMajor ? col : row; local 77 else if (end>0 && inner==m_innerIndices[end-1]) 82 const Index* r = std::lower_bound(&m_innerIndices[start],&m_innerIndices[end-1],inner); 84 return ((*r==inner) && (id<end)) ? m_values[id] : Scalar(0); 90 const Index inner = IsRowMajor ? col : row; local 96 Index* r = std::lower_bound(&m_innerIndices[start],&m_innerIndices[end],inner); 98 eigen_assert((*r==inner) && (id<end) && "coeffRef cannot be called on a zero coefficient");
|
/external/eigen/unsupported/Eigen/src/Skyline/ |
H A D | SkylineMatrix.h | 148 const Index inner = IsRowMajor ? col : row; local 151 eigen_assert(inner < innerSize()); 153 if (outer == inner) 157 if (inner > outer) //upper matrix 159 const Index minOuterIndex = inner - m_data.upperProfile(inner); 161 return this->m_data.upper(m_colStartIndex[inner] + outer - (inner - m_data.upperProfile(inner))); 165 if (inner < oute 197 const Index inner = IsRowMajor ? col : row; local [all...] |
/external/eigen/unsupported/Eigen/src/SparseExtra/ |
H A D | DynamicSparseMatrix.h | 29 * decrease as the number of nonzeros per inner-vector increase. In practice, we observed very good performance 95 const Index inner = IsRowMajor ? col : row; local 96 return m_data[outer].at(inner); 106 const Index inner = IsRowMajor ? col : row; local 107 return m_data[outer].atWithInsertion(inner); 147 * - the new coefficient is the last one of the given inner vector. 156 inline Scalar& insertBackByOuterInner(Index outer, Index inner) argument 158 eigen_assert(outer<Index(m_data.size()) && inner<m_innerSize && "out of range"); 159 eigen_assert(((m_data[outer].size()==0) || (m_data[outer].index(m_data[outer].size()-1)<inner)) 161 m_data[outer].append(0, inner); [all...] |
H A D | RandomSetter.h | 190 // compute number of bits needed to store inner indices 225 const Index inner = it->first & keyBitsMask; local 232 mp_target->insertBackByOuterInner(outer, inner) = it->second.value; 270 const Index inner = (it->first >> m_keyBitsOffset) + outerOffset; local 278 while ( (i >= posStart) && (mp_target->innerIndexPtr()[i] > inner) ) 284 mp_target->innerIndexPtr()[i+1] = inner; 296 const Index inner = SetterRowMajor ? col : row; local 298 const Index outerMinor = outer & OuterPacketMask; // index of the inner vector in the packet 299 const KeyType key = (KeyType(outerMinor)<<m_keyBitsOffset) | inner;
|
/external/skia/gm/ |
H A D | filterfastbounds.cpp | 45 SkRRect inner = outer; local 46 inner.inset(xRad, yRad); 47 canvas->drawDRRect(outer, inner, p);
|
/external/skia/src/animator/ |
H A D | SkDisplayXMLParser.cpp | 62 SkString inner; local 63 getErrorString(&inner); 64 inner.prepend(": "); 65 inner.prependS32(getLineNumber()); 66 inner.prepend(", line "); 67 inner.prepend(src); 68 parent->setErrorNoun(inner);
|
/external/skia/src/core/ |
H A D | SkLineClipper.cpp | 69 // 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
|
H A D | SkStrokerPriv.cpp | 79 static void HandleInnerJoin(SkPath* inner, const SkPoint& pivot, const SkVector& after) argument 83 just connecting the two inner segments may "show through" as a funny 88 inner->lineTo(pivot.fX, pivot.fY); 91 inner->lineTo(pivot.fX - after.fX, pivot.fY - after.fY); 94 static void BluntJoiner(SkPath* outer, SkPath* inner, const SkVector& beforeUnitNormal, argument 103 SkTSwap<SkPath*>(outer, inner); 108 HandleInnerJoin(inner, pivot, after); 111 static void RoundJoiner(SkPath* outer, SkPath* inner, const SkVector& beforeUnitNormal, argument 127 SkTSwap<SkPath*>(outer, inner); 143 HandleInnerJoin(inner, pivo 149 MiterJoiner(SkPath* outer, SkPath* inner, const SkVector& beforeUnitNormal, const SkPoint& pivot, const SkVector& afterUnitNormal, SkScalar radius, SkScalar invMiterLimit, bool prevIsLine, bool currIsLine) argument [all...] |
H A D | SkPicturePlayback.cpp | 202 SkRRect outer, inner; local 204 reader->readRRect(&inner); 205 canvas->drawDRRect(outer, inner, paint);
|
/external/skia/tests/ |
H A D | PathOpsQuadIntersectionTest.cpp | 325 static void oneOffTest1(skiatest::Reporter* reporter, size_t outer, size_t inner) { argument 328 const SkDQuad& quad2 = testSet[inner]; 339 __FUNCTION__, static_cast<int>(outer), static_cast<int>(inner), 345 outer, inner, tt1, xy1.fX, xy1.fY, tt2); 352 for (size_t inner = outer + 1; inner < testSetCount; ++inner) { 353 oneOffTest1(reporter, outer, inner); 519 int inner = outer + 1; local 522 const SkDQuad& quad2 = testSet[inner]; [all...] |
H A D | RegionTest.cpp | 124 static bool slow_contains(const SkRegion& outer, const SkRegion& inner) { argument 126 tmp.op(outer, inner, SkRegion::kUnion_Op); 136 static bool slow_intersects(const SkRegion& outer, const SkRegion& inner) { argument 138 return tmp.op(outer, inner, SkRegion::kIntersect_Op); 198 SkRegion inner; local 199 randRgn(rand, &inner, 2); 200 proc(reporter, outer, inner);
|
/external/clang/lib/ARCMigrate/ |
H A D | TransUnbridgedCasts.cpp | 134 Expr *inner = E->IgnoreParenCasts(); local 135 if (CallExpr *callE = dyn_cast<CallExpr>(inner)) { 182 Expr *base = inner->IgnoreParenImpCasts();
|
/external/clang/test/Analysis/inlining/ |
H A D | path-notes.cpp | 288 Inner *inner; member in class:PR17746::Outer 290 delete inner;
|
/external/clang/test/CodeGenCXX/ |
H A D | cxx0x-initializer-stdinitializerlist.cpp | 196 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/SemaTemplate/ |
H A D | friend-template.cpp | 118 namespace inner { namespace in namespace:PR6022 126 friend A<U1, U2, U3>& inner::f0(A<U1, U2, U3>&, T);
|
/external/jemalloc/test/src/ |
H A D | SFMT.c | 384 int inner = 0; local 390 inner ^= psfmt32[idxof(i)] & parity[i]; 392 inner ^= inner >> i; 393 inner &= 1; 395 if (inner == 1) {
|
/external/skia/src/effects/ |
H A D | SkAlphaThresholdFilter.cpp | 246 SkScalar inner = buffer.readScalar(); local 250 return SkAlphaThresholdFilter::Create(rgn, inner, outer, common.getInput(0)); 382 str->appendf("inner: %f outer: %f", fInnerThreshold, fOuterThreshold);
|
H A D | SkColorMatrix.cpp | 39 const SkScalar outer[20], const SkScalar inner[20]) { 43 if (outer == result || inner == result) { 52 target[index++] = outer[j + 0] * inner[i + 0] + 53 outer[j + 1] * inner[i + 5] + 54 outer[j + 2] * inner[i + 10] + 55 outer[j + 3] * inner[i + 15]; 57 target[index++] = outer[j + 0] * inner[4] + 58 outer[j + 1] * inner[9] + 59 outer[j + 2] * inner[14] + 60 outer[j + 3] * inner[1 38 SetConcat(SkScalar result[20], const SkScalar outer[20], const SkScalar inner[20]) argument [all...] |
/external/skia/src/pathops/ |
H A D | SkOpCoincidence.cpp | 133 SkCoincidentSpans* inner = outer; local 134 while ((inner = inner->fNext)) { 137 inner->fCoinPtTStart, inner->fCoinPtTEnd, &overS, &overE)) { 139 inner->fCoinPtTStart, inner->fCoinPtTEnd, overS, overE, 141 inner->fOppPtTStart, inner->fOppPtTEnd, allocator)) { 145 inner [all...] |
/external/skia/src/utils/ |
H A D | SkPaintFilterCanvas.cpp | 54 void SkPaintFilterCanvas::onDrawDRRect(const SkRRect& outer, const SkRRect& inner, argument 57 this->INHERITED::onDrawDRRect(outer, inner, *apf.paint());
|
/external/v8/test/mjsunit/ |
H A D | strict-mode.js | 34 function inner() {\n" 41 function inner() {\n" 1118 function inner() { 1121 return inner;
|
/external/wpa_supplicant_8/wpa_supplicant/wpa_gui-qt4/ |
H A D | networkconfig.cpp | 149 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/boringssl/mac-x86_64/crypto/bn/ |
H A D | x86_64-mont5.S | 181 L$inner: 203 jne L$inner
|
/external/clang/test/Sema/ |
H A D | designated-initializers.c | 98 struct outer { struct inner { int x, *y; } in, *inp; } zz[] = { struct in struct:outer
|