This repository has been archived by the owner on Aug 8, 2023. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 1.3k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
kevin
committed
Feb 11, 2020
1 parent
a231005
commit 5b019c2
Showing
6 changed files
with
164 additions
and
9 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,43 @@ | ||
#pragma once | ||
|
||
#include <mbgl/style/conversion.hpp> | ||
#include <mbgl/style/expression/expression.hpp> | ||
#include <memory> | ||
|
||
namespace mbgl { | ||
namespace style { | ||
namespace expression { | ||
|
||
class In : public Expression { | ||
public: | ||
In(std::unique_ptr<Expression> needle_, std::unique_ptr<Expression> haystack_) | ||
: Expression(Kind::In, type::Boolean), needle(std::move(needle_)), haystack(std::move(haystack_)) {} | ||
|
||
static ParseResult parse(const mbgl::style::conversion::Convertible& value, ParsingContext& ctx); | ||
|
||
EvaluationResult evaluate(const EvaluationContext& params) const override; | ||
void eachChild(const std::function<void(const Expression&)>&) const override; | ||
|
||
bool operator==(const Expression& e) const override { | ||
if (e.getKind() == Kind::In) { | ||
auto rhs = static_cast<const In*>(&e); | ||
return *needle == *(rhs->needle) && *haystack == *(rhs->haystack); | ||
} | ||
return false; | ||
} | ||
|
||
std::vector<optional<Value>> possibleOutputs() const override { return {nullopt}; } | ||
|
||
std::string getOperator() const override { return "in"; } | ||
|
||
private: | ||
std::unique_ptr<Expression> needle; | ||
std::unique_ptr<Expression> haystack; | ||
static bool isComparableType(type::Type type); | ||
static bool isComparableRuntimeValue(type::Type type); | ||
static bool isSearchableRuntimeValue(type::Type type); | ||
}; | ||
|
||
} // namespace expression | ||
} // namespace style | ||
} // namespace mbgl |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,116 @@ | ||
#include <string.h> | ||
#include <mbgl/style/conversion_impl.hpp> | ||
#include <mbgl/style/expression/in.hpp> | ||
#include <mbgl/style/expression/type.hpp> | ||
#include <mbgl/util/string.hpp> | ||
|
||
namespace mbgl { | ||
namespace style { | ||
namespace expression { | ||
|
||
EvaluationResult In::evaluate(const EvaluationContext& params) const { | ||
const EvaluationResult evaluatedNeedle = needle->evaluate(params); | ||
const EvaluationResult evaluatedHeystack = haystack->evaluate(params); | ||
|
||
if (!evaluatedNeedle) { | ||
return evaluatedNeedle.error(); | ||
} | ||
if (!evaluatedHeystack) { | ||
return evaluatedHeystack.error(); | ||
} | ||
|
||
type::Type evaluatedNeedleType = typeOf(*evaluatedNeedle); | ||
if (!isComparableRuntimeValue(evaluatedNeedleType)) { | ||
return EvaluationError{"Expected first argument to be of type boolean, string or number, but found " + | ||
toString(evaluatedNeedleType) + " instead."}; | ||
} | ||
|
||
type::Type evaluatedHeystackType = typeOf(*evaluatedHeystack); | ||
if (!isSearchableRuntimeValue(evaluatedHeystackType)) { | ||
return EvaluationError{"Expected second argument to be of type array or string, but found " + | ||
toString(evaluatedHeystackType) + " instead."}; | ||
} | ||
|
||
if (evaluatedNeedleType == type::Null || evaluatedHeystackType == type::Null) { | ||
return EvaluationResult(false); | ||
} | ||
|
||
if (evaluatedHeystackType == type::String) { | ||
const auto heystackString = evaluatedHeystack->get<std::string>(); | ||
std::string needleValue = ""; | ||
if (evaluatedNeedleType == type::Boolean) { | ||
needleValue = evaluatedNeedle->get<bool>() ? "true" : " false"; | ||
} else if (evaluatedNeedleType == type::String) { | ||
needleValue = evaluatedNeedle->get<std::string>(); | ||
} else if (evaluatedNeedleType == type::Number) { | ||
needleValue = std::to_string(evaluatedNeedle->get<double>()); | ||
needleValue.erase(needleValue.find_last_not_of('0') + 1, std::string::npos); | ||
needleValue.erase(needleValue.find_last_not_of('.') + 1, std::string::npos); | ||
} | ||
return EvaluationResult(heystackString.find(needleValue) != std::string::npos); | ||
} else { | ||
const auto heystackArray = evaluatedHeystack->get<std::vector<Value>>(); | ||
|
||
bool result = false; | ||
if (evaluatedNeedleType == type::Boolean) { | ||
auto needleValue = evaluatedNeedle->get<bool>(); | ||
result = find(heystackArray.begin(), heystackArray.end(), needleValue) != heystackArray.end(); | ||
} else if (evaluatedNeedleType == type::String) { | ||
auto needleValue = evaluatedNeedle->get<std::string>(); | ||
result = find(heystackArray.begin(), heystackArray.end(), needleValue) != heystackArray.end(); | ||
} else if (evaluatedNeedleType == type::Number) { | ||
auto needleValue = evaluatedNeedle->get<double>(); | ||
result = find(heystackArray.begin(), heystackArray.end(), needleValue) != heystackArray.end(); | ||
} | ||
return EvaluationResult(result); | ||
} | ||
} | ||
|
||
void In::eachChild(const std::function<void(const Expression&)>& visit) const { | ||
visit(*needle); | ||
visit(*haystack); | ||
} | ||
|
||
using namespace mbgl::style::conversion; | ||
ParseResult In::parse(const Convertible& value, ParsingContext& ctx) { | ||
assert(isArray(value)); | ||
|
||
std::size_t length = arrayLength(value); | ||
if (length != 3) { | ||
ctx.error("Expected 2 arguments, but found " + util::toString(length - 1) + " instead."); | ||
return ParseResult(); | ||
} | ||
|
||
ParseResult needle = ctx.parse(arrayMember(value, 1), 1, {type::Value}); | ||
ParseResult haystack = ctx.parse(arrayMember(value, 2), 2, {type::Value}); | ||
|
||
if (!needle || !haystack) return ParseResult(); | ||
|
||
type::Type needleType = (*needle)->getType(); | ||
type::Type haystackType = (*haystack)->getType(); | ||
|
||
if (!isComparableType(needleType)) { | ||
ctx.error("Expected first argument to be of type boolean, string or number, but found " + toString(needleType) + | ||
" instead."); | ||
return ParseResult(); | ||
} | ||
|
||
return ParseResult(std::make_unique<In>(std::move(*needle), std::move(*haystack))); | ||
} | ||
|
||
bool In::isComparableType(type::Type type) { | ||
return type == type::Boolean || type == type::String || type == type::Number || type == type::Null || | ||
type == type::Value; | ||
} | ||
|
||
bool In::isComparableRuntimeValue(type::Type type) { | ||
return type == type::Boolean || type == type::String || type == type::Number || type == type::Null; | ||
} | ||
|
||
bool In::isSearchableRuntimeValue(type::Type type) { | ||
return type == type::String || type.is<type::Array>() || type == type::Null; | ||
} | ||
|
||
} // namespace expression | ||
} // namespace style | ||
} // namespace mbgl |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters