#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <chrono>
#include <cstring>
#include "twister.c"
#include "util.hpp"
#include "functions.hpp"
#include "random_walk.hpp"
#include "local_search.hpp"
#include "iterative_local_search.hpp"


// for each i in demension vals:
//      new solution[i] = best[i] - delta *(f(new) - f(old))
//
// if new solution better, set it as solution

int main(int argc, char* args[]) {

    std::map<int, function> function_lookup;

    function_lookup.emplace(std::make_pair(0, function(&schwefel, 512, -512)));
    function_lookup.emplace(std::make_pair(1, function(&first_de_jong, 100, -100)));
    function_lookup.emplace(std::make_pair(2, function(&rosenbrock, 100, -100)));
    function_lookup.emplace(std::make_pair(3, function(&rastrigin, 30, -30)));
    function_lookup.emplace(std::make_pair(4, function(&griewangk, 500, -500)));
    function_lookup.emplace(std::make_pair(5, function(&sine_envelope_sine_wave, 30, -30)));
    function_lookup.emplace(std::make_pair(6, function(&stretched_v_sine_wave, 30, -30)));
    function_lookup.emplace(std::make_pair(7, function(&ackleys_one, 32, -32)));
    function_lookup.emplace(std::make_pair(8, function(&ackleys_two, 32, -32)));
    function_lookup.emplace(std::make_pair(9, function(&egg_holder, 500, -500)));
    function_lookup.emplace(std::make_pair(10, function(&rana, 500, -500)));
    function_lookup.emplace(std::make_pair(11, function(&pathological, 100, -100)));
    function_lookup.emplace(std::make_pair(12, function(&michalewicz, M_PI, 0)));
    function_lookup.emplace(std::make_pair(13, function(&masters_cosine_wave, 30, -30)));
    function_lookup.emplace(std::make_pair(14, function(&shekels_foxholes, 10, 0)));

    function f;
    int dimensionality = 0;
    double seed = 0;
    int search_function = 0;

    // Get the command line args
    if (argc == 1){
        char arg_str[200];
        std::cin.get(arg_str, 200);
        char t = ' ';

        f = function_lookup[atoi(strtok(arg_str, &t))];
        dimensionality = atoi(strtok(NULL, &t));
        seed = atoi(strtok(NULL, &t));
        search_function = atoi(strtok(NULL, &t));

    } else {

        f = function_lookup[atoi(args[1])];
        dimensionality = atoi(args[2]);
        seed = atoi(args[3]);
        search_function = atoi(args[4]);
    }

    // Set up the search functions
    seedMT(seed);
    random_walk r_w(f);
    local_search l_s(f);
    iterative_local_search it_s(f);

    // return the results of the search
    if (search_function == 0)
        std::cout << r_w.search(1, dimensionality) << std::endl;
    else if (search_function == 1)
        std::cout << l_s.search(1, dimensionality) << std::endl;
    else if (search_function == 2)
        std::cout << it_s.search(1, dimensionality) << std::endl;

    return 0;
}