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

1 2 3 4 56 7 8 91011>>

  /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
Normalizer.java 1906 StringBuilder segment=new StringBuilder().appendCodePoint(c); local
1923 StringBuilder segment=new StringBuilder(); 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/skia/tests/
PathOpsDebug.cpp 820 return this->segment()->debugAngle(id);
824 return this->segment()->debugCoincidence();
828 return this->segment()->debugContour(id);
832 return this->segment()->debugPtT(id);
836 return this->segment()->debugSegment(id);
845 return this->segment()->debugSpan(id);
855 const SkOpSegment* segment = this->segment(); local
860 SkDebugf("[%d", segment->debugID());
864 SkDebugf("%d", fNext->fStart->segment()->debugID())
937 SkOpSegment* segment = next->segment(); local
1279 const SkOpSegment* segment = &fHead; local
1293 const SkOpSegment* segment = &fHead; local
1305 const SkOpSegment* segment = &fHead; local
1313 const SkOpSegment* segment = &fHead; local
1323 const SkOpSegment* segment = &fHead; local
1335 const SkOpSegment* segment = &fHead; local
1365 const SkOpSegment* segment = &fHead; local
1386 const SkOpSegment* segment = contour->first(); local
1423 const SkOpSegment* segment = contour->first(); local
1446 const SkOpSegment* segment = contour->first(); local
1460 const SkOpSegment* segment = contour->first(); local
    [all...]
  /external/skqp/tests/
PathOpsDebug.cpp 820 return this->segment()->debugAngle(id);
824 return this->segment()->debugCoincidence();
828 return this->segment()->debugContour(id);
832 return this->segment()->debugPtT(id);
836 return this->segment()->debugSegment(id);
845 return this->segment()->debugSpan(id);
855 const SkOpSegment* segment = this->segment(); local
860 SkDebugf("[%d", segment->debugID());
864 SkDebugf("%d", fNext->fStart->segment()->debugID())
937 SkOpSegment* segment = next->segment(); local
1279 const SkOpSegment* segment = &fHead; local
1293 const SkOpSegment* segment = &fHead; local
1305 const SkOpSegment* segment = &fHead; local
1313 const SkOpSegment* segment = &fHead; local
1323 const SkOpSegment* segment = &fHead; local
1335 const SkOpSegment* segment = &fHead; local
1365 const SkOpSegment* segment = &fHead; local
1386 const SkOpSegment* segment = contour->first(); local
1423 const SkOpSegment* segment = contour->first(); local
1446 const SkOpSegment* segment = contour->first(); local
1460 const SkOpSegment* segment = contour->first(); local
    [all...]
  /external/v8/src/wasm/
module-decoder.cc 643 WasmDataSegment* segment = &module->data_segments.back(); local
644 DecodeDataSegmentInModule(module, segment);
791 // Decodes a single data segment entry inside a module starting at {pc_}.
792 void DecodeDataSegmentInModule(WasmModule* module, WasmDataSegment* segment) {
795 segment->dest_addr = consume_init_expr(module, kWasmI32);
796 segment->source_size = consume_u32v("source size");
797 segment->source_offset = static_cast<uint32_t>(pc_ - start_);
801 if (!IsWithinLimit(module_limit, segment->source_offset,
802 segment->source_size)) {
803 error(start, "segment out of bounds of module")
    [all...]
  /external/webp/src/enc/
frame_enc.c 180 // Finalize Segment probability based on the coding tree
312 const int segment = it->mb_->segment_; local
353 it->bit_count_[segment][i16] += it->luma_bits_;
354 it->bit_count_[segment][2] += it->uv_bits_;
550 VP8SetSegmentParams(enc, q); // setup segment quantizations and filters
551 SetSegmentProbas(enc); // compute segment probabilities
  /frameworks/layoutlib/bridge/src/android/graphics/
Path_Delegate.java 492 float segment[] = new float[6]; local
497 int type = iterator.currentSegment(segment);
498 Point2D.Float currentPoint = new Point2D.Float(segment[0], segment[1]);
811 * first point of the contour, a line segment is automatically added.
  /prebuilts/go/darwin-x86/src/cmd/vendor/golang.org/x/arch/x86/x86asm/testdata/
libmach8db.c 74 char *segment; /* segment override */ member in struct:Instr
88 short seg; /* segment of far address */
142 %g - segment register
185 SEG, /* Segment Prefix */
    [all...]
  /prebuilts/go/linux-x86/src/cmd/vendor/golang.org/x/arch/x86/x86asm/testdata/
libmach8db.c 74 char *segment; /* segment override */ member in struct:Instr
88 short seg; /* segment of far address */
142 %g - segment register
185 SEG, /* Segment Prefix */
    [all...]
  /toolchain/binutils/binutils-2.27/gas/config/
tc-mn10300.c 2466 segT segment; local
    [all...]
  /bionic/libc/kernel/uapi/linux/
vfio.h 162 __u16 segment; member in struct:vfio_pci_dependent_device
  /development/samples/JetBoy/src/com/example/android/jetboy/
JetBoyView.java 105 public JetGameEvent(JetPlayer player, short segment, byte track, byte channel,
108 this.segment = segment;
116 public short segment; field in class:JetBoyView.JetGameEvent
452 // JET info: in this example, the game uses segment 0 for the duration of the game play,
453 // JET info: and plays segment 1 several times as the "outro" music, so we're going to
458 // JET info: it is located at segment 0
733 processJetEvent(jetEvent.player, jetEvent.segment, jetEvent.track,
    [all...]
  /external/ImageMagick/MagickCore/
draw.c 2341 segment; local
    [all...]
  /external/freetype/src/autofit/
aflatin.c 551 /* segment; we first need to find in which contour the extremum */
633 /* get the blue zone distance: Find a segment of the topmost */
639 /* If this segment is long enough, we are done. Otherwise, */
640 /* search the segment next to the extremum that is long */
643 /* algorithm doesn't check whether the found segment is */
761 /* all constraints are met; update segment after */
823 /* now set the `round' flag depending on the segment's kind: */
827 /* we have a flat segment */
828 /* - if either the first or the last point of the segment is */
829 /* an `off' point, the segment is round, otherwise it is *
1485 AF_Segment segment = NULL; local
    [all...]
aflatin2.c 300 /* segment; we first need to find in which contour the extremum */
344 /* now, set the `round' flag depending on the segment's kind */
737 AF_Segment segment = NULL; local
798 else /* otherwise, find first segment start, if any */
816 /* we're at the start of a new segment */
843 /* record new segment */
844 error = af_axis_hints_new_segment( axis, memory, &segment );
848 segment[0] = seg0;
849 segment->dir = first->out_dir;
850 segment->first = first
    [all...]
  /external/freetype/src/truetype/
ttgxvar.c 314 GX_AVarSegment segment; local
358 segment = &blend->avar_segment[0];
359 for ( i = 0; i < axisCount; i++, segment++ )
363 segment->pairCount = FT_GET_USHORT();
364 if ( (FT_ULong)segment->pairCount * 4 > table_len ||
365 FT_NEW_ARRAY( segment->correspondence, segment->pairCount ) )
378 for ( j = 0; j < segment->pairCount; j++ )
381 segment->correspondence[j].fromCoord = FT_GET_SHORT() * 4;
382 segment->correspondence[j].toCoord = FT_GET_SHORT() * 4
    [all...]
  /external/kernel-headers/original/uapi/linux/
vfio.h 477 __u16 segment; member in struct:vfio_pci_dependent_device
  /external/replicaisland/src/com/replica/replicaisland/
CollisionSystem.java 95 * The first intersecting segment that is found is returned; in the case where more than one
96 * segment is found, the segment closest to the start point is returned.
429 * returns the closest intersecting segment, if any exists.
443 LineSegment segment = (LineSegment)segmentArray[x]; local
448 movementDirection.dot(segment.mNormal) : -1.0f;
451 (excludeObject == null || segment.owner != excludeObject) &&
452 segment.calculateIntersection(startPoint, endPoint, hitPoint)) {
458 normalX = segment.mNormal.x;
459 normalY = segment.mNormal.y
490 LineSegment segment = (LineSegment)segmentArray[x]; local
    [all...]
  /external/skia/src/gpu/
GrDistanceFieldGenFromVector.cpp 22 * of a segment to the kLeft_SegSide, the winding score should
27 * the segment. Winding score should be zero in this case.
34 * ...R|L......L|R.....L|R......R|L..... <= Scanline & side of segment
51 int fDeltaWindingScore; // +1 or -1 whenever a scanline cross over a segment
405 const PathSegment& segment,
428 if (!between_closed(result, segment.fP0T.x(), segment.fP2T.x())) {
433 if (!between_closed(result, segment.fP0T.x(), segment.fP2T.x())) {
442 // It is used to calculate segment side of a quadratic bezier
650 PathSegment& segment = (*segments)[a]; local
    [all...]
  /external/skia/src/pathops/
SkOpAngle.cpp 67 lh->fPart.fCurve.offset(lh->segment()->verb(), fPart.fCurve[0] - lh->fPart.fCurve[0]);
69 rh->fPart.fCurve.offset(rh->segment()->verb(), fPart.fCurve[0] - rh->fPart.fCurve[0]);
76 lh->segment()->debugID(), lh->debugID(), lh->fSectorStart, lh->fSectorEnd,
78 segment()->debugID(), debugID(), fSectorStart, fSectorEnd, fStart->t(), fEnd->t(),
79 rh->segment()->debugID(), rh->debugID(), rh->fSectorStart, rh->fSectorEnd,
96 lh->segment()->debugID(), lh->debugID(), lh->fSectorStart, lh->fSectorEnd,
98 segment()->debugID(), debugID(), fSectorStart, fSectorEnd, fStart->t(), fEnd->t(),
99 rh->segment()->debugID(), rh->debugID(), rh->fSectorStart, rh->fSectorEnd,
187 SkPath::Verb testVerb = test->segment()->verb();
237 int iMax = SkPathOpsVerbToPoints(this->segment()->verb())
409 const SkOpSegment& segment = *this->segment(); local
444 const SkOpSegment& segment = index ? *rh->segment() : *this->segment(); local
472 const SkOpSegment& segment = index ? *rh->segment() : *this->segment(); local
522 const SkOpSegment& segment = sIndex ? *rh->segment() : *this->segment(); local
536 const SkOpSegment* segment = this->segment(); local
757 const SkOpSegment* segment = this->segment(); local
852 SkOpSegment* SkOpAngle::segment() const { function in class:SkOpAngle
874 const SkOpSegment* segment = fStart->segment(); local
962 const SkOpSegment* segment = fStart->segment(); local
    [all...]
SkOpCoincidence.cpp 46 // makes all span ends agree with the segment's spans that define them
58 const SkOpSegment* segment = coinPtTStart()->segment(); local
59 const SkOpSegment* oppSegment = oppPtTStart()->segment();
68 if (!segment->isClose(midT, oppSegment)) {
85 if (!segment->isClose(midT, oppSegment)) {
125 if (s->segment() == fCoinPtTStart->segment()) {
128 SkASSERT(s->segment() == fOppPtTStart->segment());
1020 SkOpSegment* segment = start->segment(); local
1335 const SkOpSegment* segment = start->segment(); local
    [all...]
SkOpSegment.cpp 101 SkOpSegment* other = oPtT->segment();
167 start->segment()->subDivide(start, end, &curvePart.fCurve);
212 if (loop->segment() == this && loop->fT == t && loop->fPt == pt) {
266 span->segment()->debugID(), span->debugID());
339 SkOpSegment* baseSegment = baseAngle->segment();
349 SkOpSegment* nextSegment = nextAngle->segment();
368 SkOpSegment* baseSegment = baseAngle->segment();
378 SkOpSegment* nextSegment = nextAngle->segment();
497 const SkOpSegment* oppSegment = oppAngle->segment();
581 nextSegment = nextAngle->segment();
1154 SkOpSegment* segment = priorPtT->span()->segment(); local
    [all...]
  /external/skqp/src/gpu/
GrDistanceFieldGenFromVector.cpp 22 * of a segment to the kLeft_SegSide, the winding score should
27 * the segment. Winding score should be zero in this case.
34 * ...R|L......L|R.....L|R......R|L..... <= Scanline & side of segment
51 int fDeltaWindingScore; // +1 or -1 whenever a scanline cross over a segment
405 const PathSegment& segment,
428 if (!between_closed(result, segment.fP0T.x(), segment.fP2T.x())) {
433 if (!between_closed(result, segment.fP0T.x(), segment.fP2T.x())) {
442 // It is used to calculate segment side of a quadratic bezier
650 PathSegment& segment = (*segments)[a]; local
    [all...]
  /external/skqp/src/pathops/
SkOpAngle.cpp 67 lh->fPart.fCurve.offset(lh->segment()->verb(), fPart.fCurve[0] - lh->fPart.fCurve[0]);
69 rh->fPart.fCurve.offset(rh->segment()->verb(), fPart.fCurve[0] - rh->fPart.fCurve[0]);
76 lh->segment()->debugID(), lh->debugID(), lh->fSectorStart, lh->fSectorEnd,
78 segment()->debugID(), debugID(), fSectorStart, fSectorEnd, fStart->t(), fEnd->t(),
79 rh->segment()->debugID(), rh->debugID(), rh->fSectorStart, rh->fSectorEnd,
96 lh->segment()->debugID(), lh->debugID(), lh->fSectorStart, lh->fSectorEnd,
98 segment()->debugID(), debugID(), fSectorStart, fSectorEnd, fStart->t(), fEnd->t(),
99 rh->segment()->debugID(), rh->debugID(), rh->fSectorStart, rh->fSectorEnd,
187 SkPath::Verb testVerb = test->segment()->verb();
237 int iMax = SkPathOpsVerbToPoints(this->segment()->verb())
409 const SkOpSegment& segment = *this->segment(); local
444 const SkOpSegment& segment = index ? *rh->segment() : *this->segment(); local
472 const SkOpSegment& segment = index ? *rh->segment() : *this->segment(); local
522 const SkOpSegment& segment = sIndex ? *rh->segment() : *this->segment(); local
536 const SkOpSegment* segment = this->segment(); local
757 const SkOpSegment* segment = this->segment(); local
852 SkOpSegment* SkOpAngle::segment() const { function in class:SkOpAngle
874 const SkOpSegment* segment = fStart->segment(); local
962 const SkOpSegment* segment = fStart->segment(); local
    [all...]
SkOpCoincidence.cpp 46 // makes all span ends agree with the segment's spans that define them
58 const SkOpSegment* segment = coinPtTStart()->segment(); local
59 const SkOpSegment* oppSegment = oppPtTStart()->segment();
68 if (!segment->isClose(midT, oppSegment)) {
85 if (!segment->isClose(midT, oppSegment)) {
125 if (s->segment() == fCoinPtTStart->segment()) {
128 SkASSERT(s->segment() == fOppPtTStart->segment());
1020 SkOpSegment* segment = start->segment(); local
1335 const SkOpSegment* segment = start->segment(); local
    [all...]

Completed in 624 milliseconds

1 2 3 4 56 7 8 91011>>