HomeSort by relevance Sort by last modified time
    Searched defs:segment (Results 26 - 50 of 129) sorted by null

12 3 4 5 6

  /external/chromium_org/third_party/skia/experimental/Intersection/
SimplifyFindNext_Test.cpp 20 static const SimplifyFindNextTest::Segment* testCommon(
32 SimplifyFindNextTest::Segment& segment = contours[0].debugSegments()[0]; local
34 pts[0] = segment.xyAtT(&segment.span(endIndex));
39 SimplifyFindNextTest::Segment* next = segment.findNextWinding(chaseArray,
ShapeOps.cpp 20 static Segment* findChaseOp(SkTDArray<Span*>& chase, int& nextStart, int& nextEnd) {
25 Segment* segment = backPtr.fOther; local
29 if (segment->activeAngle(nextStart, done, angles)) {
38 return last->segment();
44 bool sortable = Segment::SortAngles(angles, sorted);
47 sorted[0]->segment()->debugShowSort(__FUNCTION__, sorted, 0);
57 segment = angle->segment();
58 } while (segment->windSum(angle) == SK_MinS32)
    [all...]
  /external/chromium_org/third_party/skia/src/pathops/
SkIntersectionHelper.h 86 const SkOpSegment& segment = fContour->segments()[fIndex]; local
88 SkDPoint midPtByT = segment.dPtAtT(mid);
106 const SkOpSegment& segment = fContour->segments()[fIndex]; local
107 SegmentType type = (SegmentType) segment.verb();
111 if (segment.isHorizontal()) {
114 if (segment.isVertical()) {
SkOpAngle.h 53 void set(const SkOpSegment* segment, int start, int end);
59 SkOpSegment* segment() const { function in class:SkOpAngle
SkOpContour.h 102 SkOpSegment& segment = fSegments[sIndex]; local
103 if (segment.hasMultiples()) {
104 segment.alignMultiples(aligned);
123 SkOpSegment& segment = fSegments[sIndex]; local
124 if (segment.count() > 2) {
125 segment.checkDuplicates();
136 SkOpSegment* segment = &fSegments[sIndex]; local
137 if (segment->verb() == SkPath::kLine_Verb) {
140 if (segment->done()) {
143 segment->checkEnds()
150 SkOpSegment& segment = fSegments[sIndex]; local
161 SkOpSegment& segment = fSegments[sIndex]; local
176 SkOpSegment& segment = fSegments[sIndex]; local
206 const SkOpSegment& segment = fSegments.back(); local
291 SkOpSegment& segment = fSegments[index]; local
    [all...]
SkPathOpsOp.cpp 17 SkOpSegment* segment = backPtr.fOther; local
22 if (const SkOpAngle* last = segment->activeAngle(*tIndex, tIndex, endIndex, &done,
34 return last->segment();
43 const SkOpAngle* angle = segment->spanToAngle(*tIndex, *endIndex);
54 segment = angle->segment();
55 winding = segment->windSum(angle);
57 int sumMiWinding = segment->updateWindingReverse(angle);
58 int sumSuWinding = segment->updateOppWindingReverse(angle);
59 if (segment->operand())
    [all...]
SkOpContour.cpp 20 // or needs to check to see if the self-intersection bit was set on the cubic segment
239 const SkOpSegment& segment = fSegments[index]; local
241 *point = segment.pts()[0];
243 *point = segment.pts()[SkPathOpsVerbToPoints(segment.verb())];
  /external/chromium_org/third_party/webrtc/base/
stream_unittest.cc 100 StreamSegment* segment = new StreamSegment(test); local
102 SeekTest(segment, 20);
103 delete segment;
130 // Create a segment of test stream in range [100,600)
132 StreamSegment* segment = new StreamSegment(test, 500); local
135 StreamInterface* stream = segment;
158 delete segment;
  /external/chromium_org/v8/src/
zone.cc 16 // chained together forming a LIFO structure with the newest segment
20 class Segment {
22 void Initialize(Segment* next, int size) {
27 Segment* next() const { return next_; }
31 int capacity() const { return size_ - sizeof(Segment); }
33 Address start() const { return address(sizeof(Segment)); }
37 // Computes the address of the nth byte in this segment.
42 Segment* next_;
112 // Find a segment with a suitable size to keep around.
113 Segment* keep = NULL
236 Segment* segment = NewSegment(static_cast<int>(new_size)); local
    [all...]
  /external/eigen/Eigen/src/plugins/
BlockMethods.h 760 /** \returns a dynamic-size expression of a segment (i.e. a vector block) in *this.
764 * \param start the first coefficient in the segment
765 * \param n the number of coefficients in the segment
774 * \sa class Block, segment(Index)
776 inline SegmentReturnType segment(Index start, Index n) function
783 /** This is the const version of segment(Index,Index).*/
784 inline ConstSegmentReturnType segment(Index start, Index n) const function
794 * \param n the number of coefficients in the segment
822 * \param n the number of coefficients in the segment
846 /** \returns a fixed-size expression of a segment (i.e. a vector block) in \c *thi
863 inline typename FixedSegmentReturnType<N>::Type segment(Index start, Index n = N) function
871 inline typename ConstFixedSegmentReturnType<N>::Type segment(Index start, Index n = N) const function
    [all...]
  /external/emma/core/java12/com/vladium/util/
Files.java 100 String segment = path [i]; local
101 if (segment == null) throw new IllegalArgumentException ("null input: path[" + i + "]");
103 final StringTokenizer tokenizer = new StringTokenizer (segment, separators);
  /external/icu/icu4c/source/common/
normlzr.cpp 481 UnicodeString segment(text->next32PostInc());
488 segment.append(c);
492 fNorm2->normalize(segment, buffer, errorCode);
504 UnicodeString segment; local
507 segment.insert(0, c);
514 fNorm2->normalize(segment, buffer, errorCode);
  /external/guava/guava-tests/test/com/google/common/cache/
LocalLoadingCacheTest.java 25 import com.google.common.cache.LocalCache.Segment;
269 Segment<Object, Object> segment = cache.localCache.segments[0]; local
274 assertTrue(segment.recencyQueue.isEmpty());
276 assertSame(one, segment.recencyQueue.peek().getKey());
278 assertFalse(segment.recencyQueue.isEmpty());
  /external/okhttp/okio/src/test/java/okio/
OkBufferTest.java 54 buffer.writeUtf8(repeat('a', Segment.SIZE * 4));
55 assertEquals(Segment.SIZE * 4, buffer.completeSegmentByteCount());
60 buffer.writeUtf8(repeat('a', Segment.SIZE * 4 - 10));
61 assertEquals(Segment.SIZE * 3, buffer.completeSegmentByteCount());
66 buffer.writeUtf8(repeat('a', Segment.SIZE * 2));
67 buffer.readUtf8(Segment.SIZE - 1);
73 buffer.writeUtf8(repeat('a', Segment.SIZE));
74 assertEquals(repeat('a', Segment.SIZE), buffer.readUtf8(Segment.SIZE));
144 int size = (Segment.SIZE / 2) - 1
666 OkBuffer segment = new OkBuffer(); local
    [all...]
  /cts/tests/tests/content/src/android/content/cts/
MockContentProvider.java 140 String segment; local
152 segment = uri.getPathSegments().get(1);
153 count = db.delete("TestTable1", "_id=" + segment +
161 segment = uri.getPathSegments().get(1);
162 count = db.delete("TestTable2", "_id=" + segment +
316 String segment; local
325 segment = uri.getPathSegments().get(1);
326 count = db.update("TestTable1", values, "_id=" + segment +
336 segment = uri.getPathSegments().get(1);
337 count = db.update("TestTable2", values, "_id=" + segment
    [all...]
  /external/chromium_org/third_party/WebKit/Source/core/rendering/shapes/
ShapeOutsideInfo.cpp 291 LineSegment segment = computedShape().getExcludedInterval((borderBoxLineTop - logicalTopOffset()), std::min(lineHeight, shapeLogicalBottom() - borderBoxLineTop)); local
292 if (segment.isValid) {
294 LayoutUnit rawLeftMarginBoxDelta = segment.logicalLeft + logicalLeftOffset() + logicalLeftMargin;
298 LayoutUnit rawRightMarginBoxDelta = segment.logicalRight + logicalLeftOffset() - containingBlock.logicalWidthForChild(&m_renderer) - logicalRightMargin;
  /external/chromium_org/third_party/WebKit/Source/platform/
SharedBuffer.cpp 91 const char* segment; local
93 while (unsigned segmentLength = sharedBuffer->getSomeData(segment, offset)) {
95 memcpy(snippet + offset, segment, length);
235 const char* segment; local
237 while (size_t length = data->getSomeData(segment, position)) {
238 append(segment, length);
259 char* segment; local
261 segment = allocateSegment();
262 m_segments.append(segment);
264 segment = m_segments.last() + positionInSegment
304 const char* segment = 0; local
391 const char* segment = 0; local
    [all...]
  /external/chromium_org/third_party/WebKit/Source/platform/image-decoders/png/
PNGImageDecoder.cpp 148 const char* segment; local
149 while (unsigned segmentLength = data.getSomeData(segment, m_readOffset)) {
152 png_process_data(m_png, m_info, reinterpret_cast<png_bytep>(const_cast<char*>(segment)), segmentLength);
  /external/elfutils/0.153/libdwfl/
dwfl_segment_report_module.c 64 This more than covers the phdrs and note segment in the average 64-bit
76 /* Return user segment index closest to ADDR but not above it.
79 addr_segndx (Dwfl *dwfl, size_t segment, GElf_Addr addr, bool next)
84 if (dwfl->lookup_segndx[segment] >= 0)
85 ndx = dwfl->lookup_segndx[segment];
86 if (++segment >= dwfl->lookup_elts - 1)
89 while (dwfl->lookup_addr[segment] < addr);
93 while (dwfl->lookup_segndx[segment] < 0)
94 if (++segment >= dwfl->lookup_elts - 1)
96 ndx = dwfl->lookup_segndx[segment];
109 size_t segment = ndx; local
    [all...]
  /external/opencv/cv/src/
cvsmooth.cpp 730 ushort* segment; local
744 /* Update corresponding histogram segment */
764 /* Find median in segment */
765 segment = H[c].fine[k];
767 sum += segment[b];
    [all...]
  /bionic/libc/kernel/uapi/linux/
vfio.h 135 __u16 segment; member in struct:vfio_pci_dependent_device
  /external/chromium_org/third_party/codesighs/
codesighs.c 243 char segment[0x40]; local
255 ** size class scope module segment object symbol ....
267 segment,
277 ** Qualify the segment class.
290 ERROR_REPORT(retval, segClass, "Unable to determine segment class.");
393 if(NULL != strstr(segment, inOptions->mMatchSections[loop]))
    [all...]
  /external/chromium_org/third_party/freetype/src/autofit/
afhints.c 35 /* Get new segment for given axis. */
43 AF_Segment segment = NULL; local
50 FT_Int big_max = (FT_Int)( FT_INT_MAX / sizeof ( *segment ) );
69 segment = axis->segments + axis->num_segments++;
72 *asegment = segment;
549 * note that we don't need to free the segment and edge
1179 /* PASS 1: Move segment points to edge positions */
    [all...]
  /external/chromium_org/third_party/freetype/src/truetype/
ttgxvar.c 287 GX_AVarSegment segment; local
314 segment = &blend->avar_segment[0];
315 for ( i = 0; i < axisCount; ++i, ++segment )
317 segment->pairCount = FT_GET_USHORT();
318 if ( FT_NEW_ARRAY( segment->correspondence, segment->pairCount ) )
331 for ( j = 0; j < segment->pairCount; ++j )
333 segment->correspondence[j].fromCoord =
335 segment->correspondence[j].toCoord =
    [all...]
  /external/chromium_org/third_party/icu/source/common/
ustring.cpp 1369 const char *segment = src; local
    [all...]

Completed in 1409 milliseconds

12 3 4 5 6