HomeSort by relevance Sort by last modified time
    Searched defs:subs (Results 1 - 25 of 34) sorted by null

1 2

  /external/eigen/test/
bandmatrix.cpp 22 Index subs = _m.subs(); local
24 MatrixType m(rows,cols,supers,subs);
36 for (int i=1; i<=m.subs();++i)
51 Index b = std::max<Index>(0,rows-d-subs);
54 dm1.block(subs+1,0,rows-subs-1-b,rows-subs-1-b).template triangularView<Lower>().setZero();
55 if(b>0) dm1.block(d+subs,0,b,cols).setZero();
71 Index subs = internal::random<Index>(0,rows-1) local
    [all...]
  /external/chromium_org/third_party/re2/re2/
prefilter.h 27 AND, // All in subs() must match
28 OR, // One of subs() must match
40 vector<Prefilter*>* subs() { function in class:re2::Prefilter
45 // Set the children vector. Prefilter takes ownership of subs and
47 void set_subs(vector<Prefilter*>* subs) { subs_ = subs; }
simplify.cc 43 Regexp** subs; local
62 subs = sub();
64 if (!subs[i]->simple_)
73 subs = sub();
74 return subs[0]->simple_;
78 subs = sub();
79 if (!subs[0]->simple_)
81 switch (subs[0]->op_) {
201 Regexp** subs = re->sub(); local
203 Regexp* sub = subs[i]
301 Regexp** subs = re->sub(); local
    [all...]
prefilter_tree.cc 55 vector<Prefilter*>* subs = prefilter->subs(); local
56 for (int i = 0; i < subs->size(); i++)
57 if (KeepPart((*subs)[i], level + 1))
58 (*subs)[j++] = (*subs)[i];
60 delete (*subs)[i];
62 subs->resize(j);
67 for (int i = 0; i < prefilter->subs()->size(); i++)
68 if (!KeepPart((*prefilter->subs())[i], level + 1)
189 const vector<Prefilter*>& subs = *f->subs(); local
    [all...]
regexp.cc 137 Regexp** subs = re->sub(); local
139 Regexp* sub = subs[i];
152 delete[] subs;
234 Regexp** subs = re->sub(); local
236 subs[i] = ConcatOrAlternate(op, sub+i*kMaxNsub, kMaxNsub, flags, false);
237 subs[nbigsub - 1] = ConcatOrAlternate(op, sub+(nbigsub-1)*kMaxNsub,
246 Regexp** subs = re->sub(); local
248 subs[i] = sub[i];
  /external/libselinux/src/
label_internal.h 62 struct selabel_sub *subs; member in struct:selabel_handle
  /external/regex-re2/re2/
prefilter.h 27 AND, // All in subs() must match
28 OR, // One of subs() must match
40 vector<Prefilter*>* subs() { function in class:re2::Prefilter
45 // Set the children vector. Prefilter takes ownership of subs and
47 void set_subs(vector<Prefilter*>* subs) { subs_ = subs; }
simplify.cc 43 Regexp** subs; local
62 subs = sub();
64 if (!subs[i]->simple_)
73 subs = sub();
74 return subs[0]->simple_;
78 subs = sub();
79 if (!subs[0]->simple_)
81 switch (subs[0]->op_) {
201 Regexp** subs = re->sub(); local
203 Regexp* sub = subs[i]
301 Regexp** subs = re->sub(); local
    [all...]
prefilter_tree.cc 50 vector<Prefilter*>* subs = prefilter->subs(); local
51 for (int i = 0; i < subs->size(); i++)
52 if (KeepPart((*subs)[i], level + 1))
53 (*subs)[j++] = (*subs)[i];
55 delete (*subs)[i];
57 subs->resize(j);
62 for (int i = 0; i < prefilter->subs()->size(); i++)
63 if (!KeepPart((*prefilter->subs())[i], level + 1)
182 const vector<Prefilter*>& subs = *f->subs(); local
    [all...]
regexp.cc 137 Regexp** subs = re->sub(); local
139 Regexp* sub = subs[i];
152 delete[] subs;
234 Regexp** subs = re->sub(); local
236 subs[i] = ConcatOrAlternate(op, sub+i*kMaxNsub, kMaxNsub, flags, false);
237 subs[nbigsub - 1] = ConcatOrAlternate(op, sub+(nbigsub-1)*kMaxNsub,
246 Regexp** subs = re->sub(); local
248 subs[i] = sub[i];
  /ndk/tests/build/ssax-instructions/jni/
test.S 28 subs lr, lr, #2 @ 0x2 label
  /external/javassist/src/test/test/javassist/bytecode/analysis/
ScannerTest.java 32 Subroutine[] subs = scanner.scan(method.getMethodInfo2()); local
34 verifySubroutine(subs, 31, 31, new int[]{125, 25});
35 verifySubroutine(subs, 32, 31, new int[]{125, 25});
36 verifySubroutine(subs, 33, 31, new int[]{125, 25});
37 verifySubroutine(subs, 60, 31, new int[]{125, 25});
38 verifySubroutine(subs, 61, 31, new int[]{125, 25});
39 verifySubroutine(subs, 63, 31, new int[]{125, 25});
40 verifySubroutine(subs, 66, 31, new int[]{125, 25});
41 verifySubroutine(subs, 69, 31, new int[]{125, 25});
42 verifySubroutine(subs, 71, 31, new int[]{125, 25})
    [all...]
  /external/chromium_org/third_party/icu/source/test/intltest/
mnkytst.cpp 84 UnicodeString subs, subt; local
86 source.extract(MIN(s, slen), MAX(s, slen), subs); local
93 myCollator->getCollationKey(subs, collationKey1, status1);
97 report( subs, subt, result, revResult);
100 myCollator->getCollationKey(subs, collationKey1, status1);
104 report( subs, subt, result, revResult);
107 myCollator->getCollationKey(subs, collationKey1, status1);
111 report(subs, subt, result, revResult);
114 UnicodeString addOne(subs);
117 myCollator->getCollationKey(subs, collationKey1, status1)
159 UnicodeString subs, subt; local
161 source.extract(MIN(s, slen), MAX(s, slen), subs); local
    [all...]
  /external/elfutils/libebl/
eblwstrtab.c 270 struct Ebl_WStrent *subs; local
273 for (subs = (*sep)->next; subs != NULL; subs = subs->next)
274 if (subs->len == newstr->len)
281 return subs;
322 struct Ebl_WStrent *subs; local
332 for (subs = nodep->next; subs != NULL; subs = subs->next
    [all...]
eblgstrtab.c 276 struct Ebl_GStrent *subs; local
279 for (subs = (*sep)->next; subs != NULL; subs = subs->next)
280 if (subs->len == newstr->len)
287 return subs;
328 struct Ebl_GStrent *subs; local
338 for (subs = nodep->next; subs != NULL; subs = subs->next
    [all...]
  /external/icu4c/test/intltest/
mnkytst.cpp 84 UnicodeString subs, subt; local
86 source.extract(MIN(s, slen), MAX(s, slen), subs); local
93 myCollator->getCollationKey(subs, collationKey1, status1);
97 report( subs, subt, result, revResult);
100 myCollator->getCollationKey(subs, collationKey1, status1);
104 report( subs, subt, result, revResult);
107 myCollator->getCollationKey(subs, collationKey1, status1);
111 report(subs, subt, result, revResult);
114 UnicodeString addOne(subs);
117 myCollator->getCollationKey(subs, collationKey1, status1)
159 UnicodeString subs, subt; local
161 source.extract(MIN(s, slen), MAX(s, slen), subs); local
    [all...]
  /external/eigen/Eigen/src/Core/
BandMatrix.h 30 Subs = internal::traits<Derived>::Subs,
41 DataRowsAtCompileTime = ((Supers!=Dynamic) && (Subs!=Dynamic))
42 ? 1 + Supers + Subs
57 inline Index subs() const { return derived().subs(); } function in class:Eigen::internal::BandMatrixBase
78 else if (i>=rows()-subs())
79 len = std::max<Index>(0,coeffs().rows() - (i + 1 - rows() + subs()));
93 ReturnOpposite = (Options&SelfAdjoint) && (((Index)>0 && Supers==0) || ((Index)<0 && Subs==0)),
123 eigen_assert((i<0 && -i<=subs()) || (i>=0 && i<=supers()))
223 inline Index subs() const { return m_subs.value(); } function in class:Eigen::internal::BandMatrix
287 inline Index subs() const { return m_subs.value(); } function in class:Eigen::internal::BandMatrixWrapper
    [all...]
  /external/gcc-demangle/
cp-demangle.h 110 struct demangle_component **subs; member in struct:d_info
113 /* The number of available entries in the subs array. */
115 /* The number of substitutions which we actually made from the subs
  /external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/authoring/tracks/
QuicktimeTextTrackImpl.java 43 List<Line> subs = new LinkedList<Line>(); field in class:QuicktimeTextTrackImpl
46 return subs;
67 for (Line sub : subs) {
96 for (Line sub : subs) {
TextTrackImpl.java 39 List<Line> subs = new LinkedList<Line>(); field in class:TextTrackImpl
42 return subs;
70 for (Line sub : subs) {
99 for (Line sub : subs) {
  /external/valgrind/main/coregrind/m_demangle/
cp-demangle.h 110 struct demangle_component **subs; member in struct:d_info
113 /* The number of available entries in the subs array. */
115 /* The number of substitutions which we actually made from the subs
  /external/chromium/chrome/browser/safe_browsing/
safe_browsing_util.h 119 std::string subs; // The ranges for sub chunks. member in struct:SBListChunkRanges
139 // For subs:
219 // For subs: if prefix_count is 0 then this is the add chunk that this sub
230 // Helper to return the size of each prefix entry (i.e. for subs this
  /external/chromium_org/chrome/browser/safe_browsing/
safe_browsing_util.h 118 std::string subs; // The ranges for sub chunks. member in struct:SBListChunkRanges
162 // For subs:
242 // For subs: if prefix_count is 0 then this is the add chunk that this sub
253 // Helper to return the size of each prefix entry (i.e. for subs this
  /external/pixman/pixman/
pixman-arm-simd-asm.h 241 PF subs, WK1, WK1, #32 variable
431 subs X, X, #pix_per_block
465 subs X, X, #128/dst_w_bpp
520 subs Y, Y, #1
685 subs Y, Y, #1
821 172: subs X, X, #1
833 subs X, X, #1
  /external/chromium_org/third_party/freetype/src/sfnt/
ttcmap.c 231 /* subs 518 SUBHEAD[NSUBS] sub-headers array */
238 /* Note that for any n, `keys[n]' is a byte offset within the `subs' */
268 /* within the glyph IDs table (and not within the `subs' table itself or */
282 FT_Byte* subs; /* sub-headers */ local
311 subs = p;
312 glyph_ids = subs + (max_subs + 1) * 8;
386 FT_Byte* subs = table + 518; /* subheaders table */ local
395 sub = subs; /* jump to first sub-header */
412 sub = subs + ( FT_PAD_FLOOR( TT_PEEK_USHORT( p ), 8 ) );
415 if ( sub == subs )
    [all...]

Completed in 411 milliseconds

1 2