// Copyright 2011-2014 Google
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
//     http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
//
//
//  Costum search limits.


#ifndef OR_TOOLS_TUTORIALS_CPLUSPLUS_LIMITS_H
#define OR_TOOLS_TUTORIALS_CPLUSPLUS_LIMITS_H

#include <ostream>
#include <iomanip>
#include <signal.h>
#include <stdlib.h>
#include <stdio.h>

#include "base/bitmap.h"
#include "base/logging.h"
#include "base/file.h"
#include "base/split.h"
#include "base/filelinereader.h"
#include "base/join.h"
#include "base/strtoint.h"

#include "constraint_solver/constraint_solver.h"


namespace operations_research {

namespace {

//  See jobshop_ls3.cc for more.
class LSInitialSolLimit : public ResultCallback<bool> {
  public:
    LSInitialSolLimit(Solver * solver, int64 global_time_limit,
                      int solution_nbr_tolerance) :
      solver_(solver), global_time_limit_(global_time_limit),
      solution_nbr_tolerance_(solution_nbr_tolerance),
      time_at_beginning_(solver_->wall_time()),
      solutions_at_beginning_(solver_->solutions()),
      solutions_since_last_check_(0) {}

    //  Returns true if limit is reached, false otherwise.
    virtual bool Run() {
      bool limit_reached = false;

      //  Test if time limit is reached.
      if ((solver_->wall_time() - time_at_beginning_)
                                            > global_time_limit_) {
        limit_reached = true;
        //  Test if we continue despite time limit reached.
        if (solver_->solutions() - solutions_since_last_check_
                                      >= solution_nbr_tolerance_) {
          //  We continue because we produce enough new solutions.
          limit_reached = false;
        }
      }
      solutions_since_last_check_ = solver_->solutions();

      return limit_reached;
    }

  private:
    Solver * solver_;
    int64 global_time_limit_;
    int solution_nbr_tolerance_;

    int64 time_at_beginning_;
    int solutions_at_beginning_;
    int solutions_since_last_check_;
};

  }

SearchLimit * MakeLSInitialSolLimit(Solver * solver,
                                          int64 global_time_limit,
                                          int solution_nbr_tolerance) {

  // By default, the solver takes the ownership of the callback, no need to delete it!
  return solver->MakeCustomLimit(new LSInitialSolLimit(solver, global_time_limit, solution_nbr_tolerance));
}

#if defined(__GNUC__)  // Linux

extern "C" {
  bool ctrl_catch_limit_reached = false;
  void CTRLBreakHandler(int s) {
    LG << "Ctrl-break catched! exit properly..";
    ctrl_catch_limit_reached = true;
  }
}

namespace {

class CatchCTRLBreakLimit : public ResultCallback<bool> {
  public:
    CatchCTRLBreakLimit(Solver * const solver) :
      solver_(solver) {
      sigIntHandler_.sa_handler = CTRLBreakHandler;
      sigemptyset(&sigIntHandler_.sa_mask);
      sigIntHandler_.sa_flags = 0;
      sigaction(SIGINT, &sigIntHandler_, NULL);
    }

    //  Returns true if limit is reached, false otherwise.
    virtual bool Run() {
      return ctrl_catch_limit_reached;
    }

  private:
    Solver * const solver_;
    struct sigaction sigIntHandler_;
};

} // namespace

SearchLimit * MakeCatchCTRLBreakLimit(Solver * const solver) {
  return solver->MakeCustomLimit(new CatchCTRLBreakLimit(solver));
}

#endif


namespace {

//  Don't use this class within a MakeLimit factory method!
class NoImprovementLimit : public SearchLimit {
  public:
    NoImprovementLimit(Solver * const solver, IntVar * const objective_var, int solution_nbr_tolerance, const bool minimize = true) :
    SearchLimit(solver),
      solver_(solver), prototype_(new Assignment(solver_)),
      solution_nbr_tolerance_(solution_nbr_tolerance),
      nbr_solutions_with_no_better_obj_(0),
      minimize_(minimize),
      limit_reached_(false) {
        if (minimize_) {
          best_result_ = kint64max;
        } else {
          best_result_ = kint64min;
        }
      
      CHECK_NOTNULL(objective_var);
      prototype_->AddObjective(objective_var);
    
  }

  virtual void Init() {
    nbr_solutions_with_no_better_obj_ = 0;
    limit_reached_ = false;
    if (minimize_) {
      best_result_ = kint64max;
    } else {
      best_result_ = kint64min;
    }
  }

  //  Returns true if limit is reached, false otherwise.
  virtual bool Check() {
    VLOG(2) << "NoImprovementLimit's limit reached? " << limit_reached_;

    return limit_reached_;
  }

  virtual bool AtSolution() {
    ++nbr_solutions_with_no_better_obj_;

    prototype_->Store();

    const IntVar* objective = prototype_->Objective();

    if (minimize_ && objective->Min() < best_result_) {
      best_result_ = objective->Min();
      nbr_solutions_with_no_better_obj_ = 0;
    } else if (!minimize_ && objective->Max() > best_result_) {
      best_result_ = objective->Max();
      nbr_solutions_with_no_better_obj_ = 0;
    }

    if (nbr_solutions_with_no_better_obj_ > solution_nbr_tolerance_) {
      limit_reached_ = true;
    }
    return true;
  }

  virtual void Copy(const SearchLimit* const limit) {
    const NoImprovementLimit* const copy_limit =
    reinterpret_cast<const NoImprovementLimit* const>(limit);

    best_result_ = copy_limit->best_result_;
    solution_nbr_tolerance_ = copy_limit->solution_nbr_tolerance_;
    minimize_ = copy_limit->minimize_;
    limit_reached_ = copy_limit->limit_reached_;
    nbr_solutions_with_no_better_obj_ = copy_limit->nbr_solutions_with_no_better_obj_;
  }

  // Allocates a clone of the limit
  virtual SearchLimit* MakeClone() const {
    // we don't to copy the variables
    return solver_->RevAlloc(new NoImprovementLimit(solver_, prototype_->Objective(), solution_nbr_tolerance_, minimize_));
  }

  virtual std::string DebugString() const {
    return StringPrintf("NoImprovementLimit(crossed = %i)", limit_reached_);
  }
  
  private:
    Solver * const solver_;
    int64 best_result_;
    int solution_nbr_tolerance_;
    bool minimize_;
    bool limit_reached_;
    int nbr_solutions_with_no_better_obj_;
    std::unique_ptr<Assignment> prototype_;
};

} // namespace

NoImprovementLimit * MakeNoImprovementLimit(Solver * const solver, IntVar * const objective_var, const int solution_nbr_tolerance, const bool minimize = true) {
  return solver->RevAlloc(new NoImprovementLimit(solver, objective_var, solution_nbr_tolerance, minimize));
}
}

#endif //  OR_TOOLS_TUTORIALS_CPLUSPLUS_LIMITS_H