normalizers.cpp

Go to the documentation of this file.

#include <absl/container/btree_set.h>
 
#include <mim/plug/core/core.h>
 
#include "mim/tuple.h"
#include "mim/world.h"
 
#include "mim/plug/vec/vec.h"
 
namespace mim::plug::vec {
 
template<fold id>
const Def* normalize_fold(const Def*, const Def* c, const Def* arg) {
    auto& w     = c->world();
    auto callee = c->as<App>();
    auto f      = callee->arg();
 
    auto [acc, vec] = arg->projs<2>();
    if constexpr (id == fold::r) std::swap(acc, vec);
 
    if (auto tuple = vec->isa<Tuple>()) {
        if constexpr (id == fold::l)
            for (auto op : tuple->ops())
                acc = w.app(f, {acc, op});
        else // fold::r
            for (auto op : tuple->ops() | std::ranges::views::reverse)
                acc = w.app(f, {op, acc});
        return acc;
    }
 
    if (auto pack = vec->isa_imm<Pack>()) w.WLOG("packs not yet implemented: {}", pack);
 
    if (auto l = vec->isa<Lit>()) {
        if constexpr (id == fold::l)
            return w.app(f, {acc, l});
        else
            return w.app(f, {l, acc});
    }
 
    return nullptr;
}
 
template<scan id>
const Def* normalize_scan(const Def*, const Def* c, const Def* vec) {
    auto& w     = c->world();
    auto callee = c->as<App>();
    auto p      = callee->arg();
 
    if (auto tuple = vec->isa<Tuple>()) {
        const Def* acc = w.lit_bool(id != scan::exists);
        for (auto op : tuple->ops())
            acc = w.call(id == scan::exists ? core::bit2::or_ : core::bit2::and_, 0_n, Defs{acc, w.app(p, op)});
        return acc;
    }
 
    if (auto pack = vec->isa_imm<Pack>()) w.WLOG("packs not yet implemented: {}", pack);
 
    return nullptr;
}
 
const Def* normalize_is_unique(const Def*, const Def*, const Def* vec) {
    auto& w = vec->world();
 
    if (auto tuple = vec->isa<Tuple>()) {
        auto seen = DefSet();
        for (auto op : tuple->ops()) {
            auto [_, ins] = seen.emplace(op);
            if (!ins) return w.lit_ff();
        }
        return tuple->is_closed() ? w.lit_tt() : nullptr;
    }
 
    if (auto pack = vec->isa_imm<Pack>()) {
        if (auto l = Lit::isa(pack->arity())) return w.lit_ff();
    }
 
    if (vec->isa<Lit>()) return w.lit_tt();
 
    return nullptr;
}
 
const Def* normalize_cat(const Def*, const Def* callee, const Def* arg) {
    auto [a, b] = arg->projs<2>();
    auto [n, m] = callee->as<App>()->decurry()->args<2>([](auto def) { return Lit::isa(def); });
    if (n && *n == 0) return b;
    if (m && *m == 0) return a;
    if (n && m) return mim::cat_tuple(*n, *m, a, b);
    return nullptr;
}
 
const Def* normalize_diff(const Def* type, const Def* c, const Def* arg) {
    if (auto arr = type->isa<Arr>()) {
        if (arr->arity()->isa<Bot>()) return nullptr; // ack error
    }
 
    auto& w        = type->world();
    auto callee    = c->as<App>();
    auto [n, m]    = callee->args<2>([](auto def) { return Lit::isa(def); });
    auto [vec, is] = arg->projs<2>();
 
    if (!n || !m) return nullptr;
    if (n == 1 && m == 1) return w.tuple();
 
    if (auto tup_vec = vec->isa<Tuple>()) {
        if (auto tup_is = is->isa<Tuple>(); tup_is && tup_is->is_closed()) {
            auto defs = DefVec();
            auto set  = absl::btree_set<nat_t>();
            for (auto opi : tup_is->ops())
                set.emplace(Lit::as(opi));
 
            for (size_t i = 0, e = tup_vec->num_ops(); i != e; ++i)
                if (!set.contains(i)) defs.emplace_back(tup_vec->op(i));
            return w.tuple(defs);
        }
        if (auto lit_is = Lit::isa(is)) {
            auto defs = DefVec();
 
            for (size_t i = 0, e = tup_vec->num_ops(); i != e; ++i)
                if (i != lit_is) defs.emplace_back(tup_vec->op(i));
            return w.tuple(defs);
        }
    }
 
    if (auto tup_pack = vec->isa_imm<Pack>()) return w.pack(*n - *m, tup_pack->body());
 
    return nullptr;
}
 
MIM_vec_NORMALIZER_IMPL
 
} // namespace mim::plug::vec