#include "domain_abstracted_task_factory.h"

#include "domain_abstracted_task.h"

#include "../task_utils/task_properties.h"
#include "../utils/language.h"

#include <sstream>
#include <string>
#include <unordered_set>

using namespace std;

namespace extra_tasks {
class DomainAbstractedTaskFactory {
private:
    vector<int> domain_size;
    vector<int> initial_state_values;
    vector<FactPair> goals;
    vector<vector<string>> fact_names;
    vector<vector<int>> value_map;
    shared_ptr<AbstractTask> task;

    void initialize(const AbstractTask &parent);
    void combine_values(int var, const ValueGroups &groups);
    string get_combined_fact_name(int var, const ValueGroup &values) const;

public:
    DomainAbstractedTaskFactory(
        const shared_ptr<AbstractTask> &parent,
        const VarToGroups &value_groups);
    ~DomainAbstractedTaskFactory() = default;

    shared_ptr<AbstractTask> get_task() const;
};

DomainAbstractedTaskFactory::DomainAbstractedTaskFactory(
    const shared_ptr<AbstractTask> &parent,
    const VarToGroups &value_groups) {
    TaskProxy parent_proxy(*parent);
    if (task_properties::has_axioms(parent_proxy)) {
        ABORT("DomainAbstractedTask doesn't support axioms.");
    }
    if (task_properties::has_conditional_effects(parent_proxy)) {
        ABORT("DomainAbstractedTask doesn't support conditional effects.");
    }

    initialize(*parent);
    for (const auto &pair : value_groups) {
        int var = pair.first;
        const ValueGroups &groups = pair.second;
        assert(utils::in_bounds(var, domain_size));
        for (const ValueGroup &group : groups) {
            for (int value : group) {
                utils::unused_variable(value);
                assert(0 <= value && value < domain_size[var]);
            }
        }
        combine_values(var, groups);
    }

    // Apply domain abstraction to initial state.
    for (size_t var_id = 0; var_id < initial_state_values.size(); ++var_id) {
        initial_state_values[var_id] = value_map[var_id][initial_state_values[var_id]];
    }

    // Apply domain abstraction to goals.
    for (FactPair &goal : goals) {
        goal.value = value_map[goal.var][goal.value];
    }

    task = make_shared<DomainAbstractedTask>(
        parent, move(domain_size), move(initial_state_values), move(goals),
        move(fact_names), move(value_map));
}

void DomainAbstractedTaskFactory::initialize(const AbstractTask &parent) {
    int num_vars = parent.get_num_variables();
    domain_size.resize(num_vars);
    initial_state_values = parent.get_initial_state_values();
    value_map.resize(num_vars);
    fact_names.resize(num_vars);
    for (int var = 0; var < num_vars; ++var) {
        int num_values = parent.get_variable_domain_size(var);
        domain_size[var] = num_values;
        value_map[var].resize(num_values);
        fact_names[var].resize(num_values);
        for (int value = 0; value < num_values; ++value) {
            value_map[var][value] = value;
            fact_names[var][value] = parent.get_fact_name(FactPair(var, value));
        }
    }
}

string DomainAbstractedTaskFactory::get_combined_fact_name(
    int var, const ValueGroup &values) const {
    stringstream name;
    string sep = "";
    for (int value : values) {
        name << sep << fact_names[var][value];
        sep = " OR ";
    }
    return name.str();
}

void DomainAbstractedTaskFactory::combine_values(int var, const ValueGroups &groups) {
    vector<string> combined_fact_names;
    unordered_set<int> groups_union;
    int num_merged_values = 0;
    for (const ValueGroup &group : groups) {
        combined_fact_names.push_back(get_combined_fact_name(var, group));
        groups_union.insert(group.begin(), group.end());
        num_merged_values += group.size();
    }
    assert(static_cast<int>(groups_union.size()) == num_merged_values);

    int next_free_pos = 0;

    // Move all facts that are not part of groups to the front.
    for (int before = 0; before < domain_size[var]; ++before) {
        if (groups_union.count(before) == 0) {
            value_map[var][before] = next_free_pos;
            fact_names[var][next_free_pos] = move(fact_names[var][before]);
            ++next_free_pos;
        }
    }
    int num_single_values = next_free_pos;
    assert(num_single_values + num_merged_values == domain_size[var]);

    // Add new facts for merged groups.
    for (size_t group_id = 0; group_id < groups.size(); ++group_id) {
        const ValueGroup &group = groups[group_id];
        for (int before : group) {
            value_map[var][before] = next_free_pos;
        }
        assert(utils::in_bounds(next_free_pos, fact_names[var]));
        fact_names[var][next_free_pos] = move(combined_fact_names[group_id]);
        ++next_free_pos;
    }
    int new_domain_size = num_single_values + static_cast<int>(groups.size());
    assert(next_free_pos == new_domain_size);

    // Update domain size.
    fact_names[var].resize(new_domain_size);
    domain_size[var] = new_domain_size;
}

shared_ptr<AbstractTask> DomainAbstractedTaskFactory::get_task() const {
    return task;
}

shared_ptr<AbstractTask> build_domain_abstracted_task(
    const shared_ptr<AbstractTask> &parent,
    const VarToGroups &value_groups) {
    return DomainAbstractedTaskFactory(parent, value_groups).get_task();
}
}
