1 | /* |
2 | * Copyright (C) 2014 Apple Inc. All rights reserved. |
3 | * |
4 | * Redistribution and use in source and binary forms, with or without |
5 | * modification, are permitted provided that the following conditions |
6 | * are met: |
7 | * 1. Redistributions of source code must retain the above copyright |
8 | * notice, this list of conditions and the following disclaimer. |
9 | * 2. Redistributions in binary form must reproduce the above copyright |
10 | * notice, this list of conditions and the following disclaimer in the |
11 | * documentation and/or other materials provided with the distribution. |
12 | * |
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, |
15 | * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
16 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS |
17 | * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
18 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
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 |
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 |
23 | * THE POSSIBILITY OF SUCH DAMAGE. |
24 | */ |
25 | |
26 | #pragma once |
27 | |
28 | #include "FloatRect.h" |
29 | #include "IntRect.h" |
30 | #include <wtf/Forward.h> |
31 | |
32 | namespace WebCore { |
33 | |
34 | float euclidianDistance(const FloatPoint&, const FloatPoint&); |
35 | |
36 | float findSlope(const FloatPoint& p1, const FloatPoint& p2, float& c); |
37 | |
38 | // Find point where lines through the two pairs of points intersect. Returns false if the lines don't intersect. |
39 | WEBCORE_EXPORT bool findIntersection(const FloatPoint& p1, const FloatPoint& p2, const FloatPoint& d1, const FloatPoint& d2, FloatPoint& intersection); |
40 | |
41 | IntRect unionRect(const Vector<IntRect>&); |
42 | WEBCORE_EXPORT FloatRect unionRect(const Vector<FloatRect>&); |
43 | |
44 | // Map point from srcRect to an equivalent point in destRect. |
45 | FloatPoint mapPoint(FloatPoint, const FloatRect& srcRect, const FloatRect& destRect); |
46 | |
47 | // Map rect from srcRect to an equivalent rect in destRect. |
48 | FloatRect mapRect(const FloatRect&, const FloatRect& srcRect, const FloatRect& destRect); |
49 | |
50 | WEBCORE_EXPORT FloatRect largestRectWithAspectRatioInsideRect(float aspectRatio, const FloatRect&); |
51 | WEBCORE_EXPORT FloatRect smallestRectWithAspectRatioAroundRect(float aspectRatio, const FloatRect&); |
52 | |
53 | FloatSize sizeWithAreaAndAspectRatio(float area, float aspectRatio); |
54 | |
55 | // Compute a rect that encloses all points covered by the given rect if it were rotated a full turn around (0,0). |
56 | FloatRect boundsOfRotatingRect(const FloatRect&); |
57 | |
58 | bool ellipseContainsPoint(const FloatPoint& center, const FloatSize& radii, const FloatPoint&); |
59 | } |
60 | |