HomeSort by relevance Sort by last modified time
    Searched refs:segment (Results 126 - 150 of 1112) sorted by null

1 2 3 4 56 7 8 91011>>

  /toolchain/binutils/binutils-2.25/gas/testsuite/gas/tic6x/
unwind-3.d 2 #name: C6X unwinding directives 3 (segment change)
  /toolchain/binutils/binutils-2.25/ld/testsuite/ld-elf/
textaddr1.d 2 #ld: -Ttext-segment 0x7000000 -z max-page-size=0x200000
textaddr4.d 2 #ld: -z max-page-size=0x10000 -Ttext-segment 0x10000
  /external/chromium-trace/catapult/third_party/graphy/graphy/
pie_chart.py 25 class Segment(common.DataSeries):
26 """A single segment of the pie chart.
29 size: relative size of the segment
30 label: label of the segment (if any)
31 color: color of the segment (if any)
41 super(Segment, self).__init__([size], label=label, style=style)
52 doc = """The relative size of this pie segment.""")
62 doc = """The color of this pie segment.""")
101 points: A list of pie segment sizes
136 """Add a pie segment to this chart, and return the segment
    [all...]
  /external/google-breakpad/src/common/mac/
macho_reader.h 155 // A segment in a Mach-O file. All these fields have been byte-swapped as
157 struct Segment {
159 // created this Segment.
161 ByteBuffer section_list; // This segment's section list.
162 ByteBuffer contents; // This segment's contents.
164 // This segment's name.
167 // The address at which this segment should be loaded in memory. If
171 // The size of this segment when loaded into memory. This may be larger
177 // The maximum and initial VM protection of this segment's contents.
184 // Flags describing this segment, from SegmentFlags
    [all...]
  /external/icu/android_icu4j/src/main/java/android/icu/text/
NormalizationTransliterator.java 95 StringBuilder segment = new StringBuilder(); local
102 segment.setLength(0);
104 segment.appendCodePoint(c);
114 norm2.normalize(segment, normalized);
115 if(!Normalizer2Impl.UTF16Plus.equal(segment, normalized)) {
  /external/icu/icu4j/main/classes/translit/src/com/ibm/icu/text/
NormalizationTransliterator.java 94 StringBuilder segment = new StringBuilder(); local
101 segment.setLength(0);
103 segment.appendCodePoint(c);
113 norm2.normalize(segment, normalized);
114 if(!Normalizer2Impl.UTF16Plus.equal(segment, normalized)) {
  /external/eigen/test/
block.cpp 116 VERIFY_IS_EQUAL(v1.template head<2>(), v1.segment(0,2));
117 VERIFY_IS_EQUAL(v1.template head<2>(), v1.template segment<2>(0));
121 VERIFY_IS_EQUAL(v1.template tail<2>(), v1.segment(i,2));
122 VERIFY_IS_EQUAL(v1.template tail<2>(), v1.template segment<2>(i));
124 VERIFY_IS_EQUAL(v1.segment(i,2), v1.template segment<2>(i));
138 VERIFY_IS_EQUAL( (m1.block(r1,c1,r2-r1+1,c2-c1+1).row(0)) , (m1.row(r1).segment(c1,c2-c1+1)) );
139 VERIFY_IS_EQUAL( (m1.block(r1,c1,r2-r1+1,c2-c1+1).col(0)) , (m1.col(c1).segment(r1,r2-r1+1)) );
140 VERIFY_IS_EQUAL( (m1.block(r1,c1,r2-r1+1,c2-c1+1).transpose().col(0)) , (m1.row(r1).segment(c1,c2-c1+1)).transpose() );
141 VERIFY_IS_EQUAL( (m1.transpose().block(c1,r1,c2-c1+1,r2-r1+1).col(0)) , (m1.row(r1).segment(c1,c2-c1+1)).transpose() )
    [all...]
  /external/eigen/unsupported/Eigen/src/NonLinearOptimization/
fdjac1.h 70 fjac.col(j).segment(start, length) = ( wa1.segment(start, length)-fvec.segment(start, length))/h;
  /external/icu/icu4c/source/common/
caniter.cpp 228 // allocate the arrays, and find the strings that are CE to each segment
242 // for each segment, get all the combinations that can produce
245 //if (PROGRESS) printf("SEGMENT\n");
341 // we have a segment, in NFD. Find all the strings that are canonically equivalent to it.
342 UnicodeString* CanonicalIterator::getEquivalents(const UnicodeString &segment, int32_t &result_len, UErrorCode &status) {
354 int32_t segLen = segment.extract(USeg, 256, status);
384 // TODO: check if operator == is semanticaly the same as attempt.equals(segment)
385 if (attempt==segment) {
430 Hashtable *CanonicalIterator::getEquivalents2(Hashtable *fillinResult, const UChar *segment, int32_t segLen, UErrorCode &status) {
436 //if (PROGRESS) printf("Adding: %s\n", UToS(Tr(segment)));
    [all...]
  /external/skia/src/pathops/
SkPathOpsOp.cpp 20 SkOpSegment* segment = (*startPtr)->segment(); local
23 if (SkOpAngle* last = segment->activeAngle(*startPtr, startPtr, endPtr, &done)) {
31 return last->segment();
44 segment = angle->segment();
45 sumMiWinding = segment->updateWindingReverse(angle);
46 sumSuWinding = segment->updateOppWindingReverse(angle);
47 if (segment->operand()) {
54 segment = angle->segment()
    [all...]
  /external/sonivox/jet_tools/JetCreator/
JetCreator.py 302 for segment in self.jet_file.GetSegments():
303 index = self.segList.InsertStringItem(sys.maxint, StrNoneChk(segment.segname))
304 self.segList.SetStringItem(index, 1, FileJustName(StrNoneChk(segment.filename)))
305 self.segList.SetStringItem(index, 2, FileJustName(StrNoneChk(segment.dlsfile)))
306 self.segList.SetStringItem(index, 3, mbtFct(segment.start, 1))
307 self.segList.SetStringItem(index, 4, mbtFct(segment.end, 1))
308 self.segList.SetStringItem(index, 5, StrNoneChk(segment.quantize))
309 self.segList.SetStringItem(index, 6, StrNoneChk(segment.transpose))
310 self.segList.SetStringItem(index, 7, StrNoneChk(segment.repeat))
311 self.segList.SetStringItem(index, 8, StrNoneChk(segment.mute_flags))
    [all...]
  /external/libxml2/
uri.c 536 * @empty: allow an empty segment
538 * Parse a segment and fills in the appropriate fields
541 * segment = *pchar
542 * segment-nz = 1*pchar
543 * segment-nz-nc = 1*( unreserved / pct-encoded / sub-delims / "@" )
544 * ; non-zero-length segment without any colon ":"
573 * path-abempty = *( "/" segment )
613 * path-absolute = "/" [ segment-nz *( "/" segment ) ]
659 * path-rootless = segment-nz *( "/" segment
1744 xmlChar *ret, *segment = NULL; local
    [all...]
  /external/sfntly/cpp/src/sfntly/table/core/
cmap_table.cc 607 int32_t segment = data_->SearchUShort(StartCodeOffset(seg_count_), local
613 if (segment == -1) {
616 int32_t start_code = StartCode(segment);
617 return RetrieveGlyphId(segment, start_code, character);
620 int32_t CMapTable::CMapFormat4::RetrieveGlyphId(int32_t segment,
626 int32_t id_range_offset = IdRangeOffset(segment);
628 return (character + IdDelta(segment)) % 65536;
631 IdRangeOffsetLocation(segment) +
643 int32_t CMapTable::CMapFormat4::StartCode(int32_t segment) {
644 if (!IsValidIndex(segment)) {
982 Ptr<Segment> segment = new Segment; local
    [all...]
  /external/eigen/blas/
BandTriangularSolver.h 47 other.coeffRef(i,col) -= cjLhs.row(i).segment(actual_start,actual_k).transpose()
48 .cwiseProduct(other.col(col).segment(IsLower ? i-actual_k : i+1,actual_k)).sum();
86 other.col(col).segment(IsLower ? i+1 : i-actual_k, actual_k)
87 -= other.coeff(i,col) * cjLhs.col(i).segment(actual_start,actual_k);
  /external/eigen/unsupported/Eigen/src/Splines/
SplineFitting.h 46 knots(j+degree) = parameters.segment(j,degree).mean();
48 knots.segment(0,degree+1) = KnotVectorType::Zero(degree+1);
49 knots.segment(knots.size()-degree-1,degree+1) = KnotVectorType::Ones(degree+1);
132 // The segment call should somehow be told the spline order at compile time.
133 A.row(i).segment(span-degree, degree+1) = SplineType::BasisFunctions(knot_parameters[i], degree, knots);
  /external/elfutils/libdwfl/
dwfl_getmodules.c 88 : m->segment + 1) << 2) | 2));
  /external/v8/src/
date.h 228 // Daylight Savings Time segment stores a segment of time where
242 // the before_ segment starts earlier than the given time and
243 // the after_ segment start later than the given time.
248 // Finds the least recently used segment from the DST cache that is not
249 // equal to the given 'skip' segment.
252 // Extends the after_ segment with the given point or resets it
256 // Makes the given segment invalid.
257 inline void ClearSegment(DST* segment);
259 bool InvalidSegment(DST* segment) {
    [all...]
  /frameworks/rs/api/
Scanner.cpp 45 void Scanner::readUpTo(char delimiter, string* segment) {
51 segment->push_back((char)c);
58 void Scanner::readRestOfLine(string* segment) {
64 segment->push_back((char)c);
  /toolchain/binutils/binutils-2.25/gas/testsuite/gas/cris/
rd-pcrel2.s 8 ; Region of relaxation is after insn, same segment
21 ; Region of relaxation is around insn, same segment
40 ; Region of relaxation is before insn, same segment.
50 ; Region of relaxation is in other segment.
  /toolchain/binutils/binutils-2.25/gas/testsuite/gas/i386/
x86-64-stack.s 32 # push a segment register
  /toolchain/binutils/binutils-2.25/gas/testsuite/gas/pe/
seh-x64-err-1.s 29 # test for wrong segment pseudos.
  /external/elfutils/tests/
run-readelf-d.sh 37 Dynamic segment contains 28 entries:
  /external/eigen/test/eigen2/
eigen2_submatrices.cpp 113 VERIFY_IS_APPROX(v1.template start<2>(), v1.segment(0,2));
114 VERIFY_IS_APPROX(v1.template start<2>(), v1.template segment<2>(0));
118 VERIFY_IS_APPROX(v1.template end<2>(), v1.segment(i,2));
119 VERIFY_IS_APPROX(v1.template end<2>(), v1.template segment<2>(i));
121 VERIFY_IS_APPROX(v1.segment(i,2), v1.template segment<2>(i));
  /external/icu/icu4c/source/layout/
StateTableProcessor2.cpp 126 const LookupSegment *segment = local
128 if (segment != NULL && LE_SUCCESS(success)) {
129 classCode = SWAPW(segment->value);
167 const LookupSingle *segment = lookupTable6->lookupSingle(lookupTable6, lookupTable6->entries, gid, success); local
168 if (segment != NULL) {
169 classCode = SWAPW(segment->value);

Completed in 1510 milliseconds

1 2 3 4 56 7 8 91011>>