File: CalculationTree%2BEvaluation.cpp

package info (click to toggle)
webkit2gtk 2.48.5-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 429,764 kB
  • sloc: cpp: 3,697,587; javascript: 194,444; ansic: 169,997; python: 46,499; asm: 19,295; ruby: 18,528; perl: 16,602; xml: 4,650; yacc: 2,360; sh: 2,098; java: 1,993; lex: 1,327; pascal: 366; makefile: 298
file content (164 lines) | stat: -rw-r--r-- 6,485 bytes parent folder | download | duplicates (7)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
/*
 * Copyright (C) 2024 Samuel Weinig <sam@webkit.org>
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
 * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL APPLE INC. OR
 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */

#include "config.h"
#include "CalculationTree+Evaluation.h"

#include "CalculationExecutor.h"
#include "CalculationTree.h"
#include <wtf/StdLibExtras.h>

namespace WebCore {
namespace Calculation {

static auto evaluate(const None&, double percentResolutionLength) -> None;
static auto evaluate(const ChildOrNone&, double percentResolutionLength) -> std::variant<double, None>;
static auto evaluate(const std::optional<Child>&, double percentResolutionLength) -> std::optional<double>;
static auto evaluate(const Child&, double percentResolutionLength) -> double;
static auto evaluate(const Number&, double percentResolutionLength) -> double;
static auto evaluate(const Percentage&, double percentResolutionLength) -> double;
static auto evaluate(const Dimension&, double percentResolutionLength) -> double;
static auto evaluate(const IndirectNode<Sum>&, double percentResolutionLength) -> double;
static auto evaluate(const IndirectNode<Product>&, double percentResolutionLength) -> double;
static auto evaluate(const IndirectNode<Min>&, double percentResolutionLength) -> double;
static auto evaluate(const IndirectNode<Max>&, double percentResolutionLength) -> double;
static auto evaluate(const IndirectNode<Hypot>&, double percentResolutionLength) -> double;
static auto evaluate(const IndirectNode<Random>&, double percentResolutionLength) -> double;
static auto evaluate(const IndirectNode<Blend>&, double percentResolutionLength) -> double;
template<typename Op>
static auto evaluate(const IndirectNode<Op>&, double percentResolutionLength) -> double;

// MARK: Evaluation.

None evaluate(const None& root, double)
{
    return root;
}

std::variant<double, None> evaluate(const ChildOrNone& root, double percentResolutionLength)
{
    return WTF::switchOn(root, [&](const auto& root) { return std::variant<double, None> { evaluate(root, percentResolutionLength) }; });
}

double evaluate(const Child& root, double percentResolutionLength)
{
    return WTF::switchOn(root, [&](const auto& root) { return evaluate(root, percentResolutionLength); });
}

std::optional<double> evaluate(const std::optional<Child>& root, double percentResolutionLength)
{
    if (root)
        return static_cast<double>(evaluate(*root, percentResolutionLength));
    return std::nullopt;
}

double evaluate(const Number& number, double)
{
    return number.value;
}

double evaluate(const Percentage& percentage, double percentResolutionLength)
{
    return percentResolutionLength * percentage.value / 100.0;
}

double evaluate(const Dimension& root, double)
{
    return root.value;
}

double evaluate(const IndirectNode<Sum>& root, double percentResolutionLength)
{
    return executeOperation<Sum>(root->children.value, [&](const auto& child) -> double {
        return evaluate(child, percentResolutionLength);
    });
}

double evaluate(const IndirectNode<Product>& root, double percentResolutionLength)
{
    return executeOperation<Product>(root->children.value, [&](const auto& child) -> double {
        return evaluate(child, percentResolutionLength);
    });
}

double evaluate(const IndirectNode<Min>& root, double percentResolutionLength)
{
    return executeOperation<Min>(root->children.value, [&](const auto& child) -> double {
        return evaluate(child, percentResolutionLength);
    });
}

double evaluate(const IndirectNode<Max>& root, double percentResolutionLength)
{
    return executeOperation<Max>(root->children.value, [&](const auto& child) -> double {
        return evaluate(child, percentResolutionLength);
    });
}

double evaluate(const IndirectNode<Hypot>& root, double percentResolutionLength)
{
    return executeOperation<Hypot>(root->children.value, [&](const auto& child) -> double {
        return evaluate(child, percentResolutionLength);
    });
}

double evaluate(const IndirectNode<Random>& root, double percentResolutionLength)
{
    auto min = evaluate(root->min, percentResolutionLength);
    auto max = evaluate(root->max, percentResolutionLength);
    auto step = evaluate(root->step, percentResolutionLength);

    // RandomKeyMap relies on using NaN for HashTable deleted/empty values but
    // the result is always NaN if either is NaN, so we can return early here.
    if (std::isnan(min) || std::isnan(max))
        return std::numeric_limits<double>::quiet_NaN();

    Ref keyMap = root->cachingOptions.keyMap;
    auto randomUnitInterval = keyMap->lookupUnitInterval(
        root->cachingOptions.identifier,
        min,
        max,
        step
    );

    return executeOperation<Random>(randomUnitInterval, min, max, step);
}

double evaluate(const IndirectNode<Blend>& root, double percentResolutionLength)
{
    return (1.0 - root->progress) * evaluate(root->from, percentResolutionLength) + root->progress * evaluate(root->to, percentResolutionLength);
}

template<typename Op> double evaluate(const IndirectNode<Op>& root, double percentResolutionLength)
{
    return WTF::apply([&](const auto& ...x) { return executeOperation<Op>(evaluate(x, percentResolutionLength)...); } , *root);
}

double evaluate(const Tree& tree, double percentResolutionLength)
{
    return evaluate(tree.root, percentResolutionLength);
}

} // namespace Calculation
} // namespace WebCore