| 1 | /* |
| 2 | * Copyright (c) 2020 - 2023 the ThorVG project. All rights reserved. |
| 3 | |
| 4 | * Permission is hereby granted, free of charge, to any person obtaining a copy |
| 5 | * of this software and associated documentation files (the "Software"), to deal |
| 6 | * in the Software without restriction, including without limitation the rights |
| 7 | * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell |
| 8 | * copies of the Software, and to permit persons to whom the Software is |
| 9 | * furnished to do so, subject to the following conditions: |
| 10 | |
| 11 | * The above copyright notice and this permission notice shall be included in all |
| 12 | * copies or substantial portions of the Software. |
| 13 | |
| 14 | * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR |
| 15 | * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, |
| 16 | * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE |
| 17 | * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER |
| 18 | * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, |
| 19 | * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE |
| 20 | * SOFTWARE. |
| 21 | */ |
| 22 | |
| 23 | #include <float.h> |
| 24 | #include <math.h> |
| 25 | #include "tvgFill.h" |
| 26 | |
| 27 | /************************************************************************/ |
| 28 | /* Internal Class Implementation */ |
| 29 | /************************************************************************/ |
| 30 | |
| 31 | struct LinearGradient::Impl |
| 32 | { |
| 33 | float x1 = 0; |
| 34 | float y1 = 0; |
| 35 | float x2 = 0; |
| 36 | float y2 = 0; |
| 37 | |
| 38 | Fill* duplicate() |
| 39 | { |
| 40 | auto ret = LinearGradient::gen(); |
| 41 | if (!ret) return nullptr; |
| 42 | |
| 43 | ret->pImpl->x1 = x1; |
| 44 | ret->pImpl->y1 = y1; |
| 45 | ret->pImpl->x2 = x2; |
| 46 | ret->pImpl->y2 = y2; |
| 47 | |
| 48 | return ret.release(); |
| 49 | } |
| 50 | }; |
| 51 | |
| 52 | /************************************************************************/ |
| 53 | /* External Class Implementation */ |
| 54 | /************************************************************************/ |
| 55 | |
| 56 | LinearGradient::LinearGradient():pImpl(new Impl()) |
| 57 | { |
| 58 | Fill::pImpl->id = TVG_CLASS_ID_LINEAR; |
| 59 | Fill::pImpl->method(new FillDup<LinearGradient::Impl>(pImpl)); |
| 60 | } |
| 61 | |
| 62 | |
| 63 | LinearGradient::~LinearGradient() |
| 64 | { |
| 65 | delete(pImpl); |
| 66 | } |
| 67 | |
| 68 | |
| 69 | Result LinearGradient::linear(float x1, float y1, float x2, float y2) noexcept |
| 70 | { |
| 71 | pImpl->x1 = x1; |
| 72 | pImpl->y1 = y1; |
| 73 | pImpl->x2 = x2; |
| 74 | pImpl->y2 = y2; |
| 75 | |
| 76 | return Result::Success; |
| 77 | } |
| 78 | |
| 79 | |
| 80 | Result LinearGradient::linear(float* x1, float* y1, float* x2, float* y2) const noexcept |
| 81 | { |
| 82 | if (x1) *x1 = pImpl->x1; |
| 83 | if (x2) *x2 = pImpl->x2; |
| 84 | if (y1) *y1 = pImpl->y1; |
| 85 | if (y2) *y2 = pImpl->y2; |
| 86 | |
| 87 | return Result::Success; |
| 88 | } |
| 89 | |
| 90 | |
| 91 | unique_ptr<LinearGradient> LinearGradient::gen() noexcept |
| 92 | { |
| 93 | return unique_ptr<LinearGradient>(new LinearGradient); |
| 94 | } |
| 95 | |
| 96 | |
| 97 | uint32_t LinearGradient::identifier() noexcept |
| 98 | { |
| 99 | return TVG_CLASS_ID_LINEAR; |
| 100 | } |
| 101 | |