| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2010, 2011 Apple Inc. All rights reserved. | 2 * Copyright (C) 2010, 2011 Apple Inc. All rights reserved. |
| 3 * | 3 * |
| 4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
| 5 * modification, are permitted provided that the following conditions | 5 * modification, are permitted provided that the following conditions |
| 6 * are met: | 6 * are met: |
| 7 * 1. Redistributions of source code must retain the above copyright | 7 * 1. Redistributions of source code must retain the above copyright |
| 8 * notice, this list of conditions and the following disclaimer. | 8 * notice, this list of conditions and the following disclaimer. |
| 9 * 2. Redistributions in binary form must reproduce the above copyright | 9 * 2. Redistributions in binary form must reproduce the above copyright |
| 10 * notice, this list of conditions and the following disclaimer in the | 10 * notice, this list of conditions and the following disclaimer in the |
| 11 * documentation and/or other materials provided with the distribution. | 11 * documentation and/or other materials provided with the distribution. |
| 12 * | 12 * |
| 13 * THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS'' | 13 * THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS'' |
| 14 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, | 14 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, |
| 15 * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | 15 * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
| 16 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS | 16 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS |
| 17 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR | 17 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
| 18 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF | 18 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
| 19 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS | 19 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
| 20 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN | 20 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
| 21 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | 21 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
| 22 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF | 22 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF |
| 23 * THE POSSIBILITY OF SUCH DAMAGE. | 23 * THE POSSIBILITY OF SUCH DAMAGE. |
| 24 */ | 24 */ |
| 25 | 25 |
| 26 #ifndef Region_h | 26 #ifndef Region_h |
| 27 #define Region_h | 27 #define Region_h |
| 28 | 28 |
| 29 #include "platform/PlatformExport.h" |
| 29 #include "platform/geometry/IntRect.h" | 30 #include "platform/geometry/IntRect.h" |
| 30 #include "wtf/Vector.h" | 31 #include "wtf/Vector.h" |
| 31 | 32 |
| 32 namespace WebCore { | 33 namespace WebCore { |
| 33 | 34 |
| 34 class Region { | 35 class PLATFORM_EXPORT Region { |
| 35 public: | 36 public: |
| 36 Region(); | 37 Region(); |
| 37 Region(const IntRect&); | 38 Region(const IntRect&); |
| 38 | 39 |
| 39 IntRect bounds() const { return m_bounds; } | 40 IntRect bounds() const { return m_bounds; } |
| 40 bool isEmpty() const { return m_bounds.isEmpty(); } | 41 bool isEmpty() const { return m_bounds.isEmpty(); } |
| 41 bool isRect() const { return m_shape.isRect(); } | 42 bool isRect() const { return m_shape.isRect(); } |
| 42 | 43 |
| 43 Vector<IntRect> rects() const; | 44 Vector<IntRect> rects() const; |
| 44 | 45 |
| (...skipping 31 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 76 class Shape { | 77 class Shape { |
| 77 public: | 78 public: |
| 78 Shape(); | 79 Shape(); |
| 79 Shape(const IntRect&); | 80 Shape(const IntRect&); |
| 80 | 81 |
| 81 IntRect bounds() const; | 82 IntRect bounds() const; |
| 82 bool isEmpty() const { return m_spans.isEmpty(); } | 83 bool isEmpty() const { return m_spans.isEmpty(); } |
| 83 bool isRect() const { return m_spans.size() <= 2 && m_segments.size() <=
2; } | 84 bool isRect() const { return m_spans.size() <= 2 && m_segments.size() <=
2; } |
| 84 | 85 |
| 85 typedef const Span* SpanIterator; | 86 typedef const Span* SpanIterator; |
| 86 SpanIterator spans_begin() const; | 87 SpanIterator spansBegin() const; |
| 87 SpanIterator spans_end() const; | 88 SpanIterator spansEnd() const; |
| 88 | 89 |
| 89 typedef const int* SegmentIterator; | 90 typedef const int* SegmentIterator; |
| 90 SegmentIterator segments_begin(SpanIterator) const; | 91 SegmentIterator segmentsBegin(SpanIterator) const; |
| 91 SegmentIterator segments_end(SpanIterator) const; | 92 SegmentIterator segmentsEnd(SpanIterator) const; |
| 92 | 93 |
| 93 static Shape unionShapes(const Shape& shape1, const Shape& shape2); | 94 static Shape unionShapes(const Shape& shape1, const Shape& shape2); |
| 94 static Shape intersectShapes(const Shape& shape1, const Shape& shape2); | 95 static Shape intersectShapes(const Shape& shape1, const Shape& shape2); |
| 95 static Shape subtractShapes(const Shape& shape1, const Shape& shape2); | 96 static Shape subtractShapes(const Shape& shape1, const Shape& shape2); |
| 96 | 97 |
| 97 void translate(const IntSize&); | 98 void translate(const IntSize&); |
| 98 void swap(Shape&); | 99 void swap(Shape&); |
| 99 | 100 |
| 100 struct CompareContainsOperation; | 101 struct CompareContainsOperation; |
| 101 struct CompareIntersectsOperation; | 102 struct CompareIntersectsOperation; |
| (...skipping 69 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 171 } | 172 } |
| 172 | 173 |
| 173 inline bool operator==(const Region::Span& a, const Region::Span& b) | 174 inline bool operator==(const Region::Span& a, const Region::Span& b) |
| 174 { | 175 { |
| 175 return a.y == b.y && a.segmentIndex == b.segmentIndex; | 176 return a.y == b.y && a.segmentIndex == b.segmentIndex; |
| 176 } | 177 } |
| 177 | 178 |
| 178 } // namespace WebCore | 179 } // namespace WebCore |
| 179 | 180 |
| 180 #endif // Region_h | 181 #endif // Region_h |
| OLD | NEW |