s416496/musique
1
0
Fork 0
Code Issues 3 Pull Requests 1 Projects Releases Wiki Activity

partition function

Browse Source
This commit is contained in:
Robert Bendun 2022-06-14 11:21:37 +02:00
parent 5ab750b93b
commit 55554606a1
1 changed files with 30 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

31
src/interpreter.cc
View File

@ -47,13 +47,19 @@ static constexpr bool is_indexable(Value::Type type)
return type == Value::Type::Array || type == Value::Type::Block; return type == Value::Type::Array || type == Value::Type::Block;
} }
/// Returns if type can be called
static constexpr bool is_callable(Value::Type type)
{
return type == Value::Type::Block || type == Value::Type::Intrinsic;
}
/// Binary operation may be vectorized when there are two argument which one is indexable and other is not /// Binary operation may be vectorized when there are two argument which one is indexable and other is not
static bool may_be_vectorized(std::vector<Value> const& args) static bool may_be_vectorized(std::vector<Value> const& args)
{ {
return args.size() == 2 && (is_indexable(args[0].type) != is_indexable(args[1].type)); return args.size() == 2 && (is_indexable(args[0].type) != is_indexable(args[1].type));
} }
static Result<Array> into_flat_array(Interpreter &i, std::vector<Value> args) static Result<Array> into_flat_array(Interpreter &i, std::span<Value> args)
{ {
Array array; Array array;
for (auto &arg : args) { for (auto &arg : args) {
@ -75,6 +81,11 @@ static Result<Array> into_flat_array(Interpreter &i, std::vector<Value> args)
return array; return array;
} }
static Result<Array> into_flat_array(Interpreter &i, std::vector<Value> args)
{
return into_flat_array(i, std::span(args));
}
/// Intrinsic implementation primitive to ease operation vectorization /// Intrinsic implementation primitive to ease operation vectorization
/// @invariant args.size() == 2 /// @invariant args.size() == 2
Result<Value> vectorize(auto &&operation, Interpreter &interpreter, std::vector<Value> args) Result<Value> vectorize(auto &&operation, Interpreter &interpreter, std::vector<Value> args)
@ -401,6 +412,24 @@ Interpreter::Interpreter()
return *max; return *max;
}); });
global.force_define("partition", +[](Interpreter &i, std::vector<Value> args) -> Result<Value> {
assert(!args.empty(), "partition requires function to partition with"); // TODO(assert)
auto predicate = std::move(args.front());
assert(is_callable(predicate.type), "partition requires function to partition with"); // TODO(assert)
auto array = Try(into_flat_array(i, std::span(args).subspan(1)));
Array tuple[2] = {};
for (auto &value : array.elements) {
tuple[Try(predicate(i, { std::move(value) })).truthy()].elements.push_back(std::move(value));
}
return Value::from(Array { .elements = {
Value::from(std::move(tuple[true])),
Value::from(std::move(tuple[false]))
}});
});
global.force_define("chord", +[](Interpreter &i, std::vector<Value> args) -> Result<Value> { global.force_define("chord", +[](Interpreter &i, std::vector<Value> args) -> Result<Value> {
Chord chord; Chord chord;
Try(create_chord(chord.notes, i, std::move(args))); Try(create_chord(chord.notes, i, std::move(args)));