/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */

/*
 *  Main authors:
 *     Jip J. Dekker <jip.dekker@monash.edu>
 */

/* This Source Code Form is subject to the terms of the Mozilla Public
 * License, v. 2.0. If a copy of the MPL was not distributed with this
 * file, You can obtain one at http://mozilla.org/MPL/2.0/. */

#pragma once

#include <minizinc/model.hh>

#include <map>

namespace MiniZinc {

class ChainCompressor {
public:
  ChainCompressor(EnvI& env, Model& m, std::vector<VarDecl*>& deletedVarDecls)
      : _env(env), _m(m), _deletedVarDecls(deletedVarDecls){};

  virtual bool trackItem(Item* i) = 0;

  virtual void compress() = 0;

protected:
  EnvI& _env;
  Model& _m;
  std::vector<VarDecl*>& _deletedVarDecls;

  std::multimap<VarDecl*, Item*> _items;
  typedef std::multimap<VarDecl*, Item*>::iterator iterator;

  void storeItem(VarDecl* v, Item* i) { _items.emplace(v, i); }

  void updateCount();

  unsigned long count(VarDecl* v) { return static_cast<unsigned long>(_items.count(v)); }

  std::pair<iterator, iterator> find(VarDecl* v) { return _items.equal_range(v); };

  void removeItem(Item* i);
  int addItem(Item* i);

  // Replaces the Nth argument of a Call c by Expression e, c must be located on Item i
  void replaceCallArgument(Item* i, Call* c, unsigned int n, Expression* e);
};

class ImpCompressor : public ChainCompressor {
public:
  ImpCompressor(EnvI& env, Model& m, std::vector<VarDecl*>& deletedVarDecls,
                std::vector<unsigned int>& boolConstraints0)
      : ChainCompressor(env, m, deletedVarDecls), _boolConstraints(boolConstraints0){};

  bool trackItem(Item* i) override;

  void compress() override;

protected:
  std::vector<unsigned int>& _boolConstraints;

  // Compress two implications. e.g. (x -> y) /\ (y -> z) => x -> z
  // In this case i: (y -> z), newLHS: x
  // Function returns true if compression was successful (and the implication that contains newLHS
  // can be removed) Side effect: Item i might be removed.
  bool compressItem(Item* i, VarDecl* oldLHS, VarDecl* newLHS);

  // Constructs a clause constraint item with pos and neg as parameters.
  // if pos/neg are not ArrayLit then they will inserted into an ArrayLit.
  ConstraintI* constructClause(Expression* pos, Expression* neg);

  // Copy an ArrayLit replacing one variable.
  static ArrayLit* arrayLitCopyReplace(ArrayLit* ar, VarDecl* oldVar, VarDecl* newVar);

  ConstraintI* constructHalfReif(Call* call, Id* control);
};

class LECompressor : public ChainCompressor {
public:
  LECompressor(EnvI& env, Model& m, std::vector<VarDecl*>& deletedVarDecls)
      : ChainCompressor(env, m, deletedVarDecls){};

  bool trackItem(Item* i) override;

  void compress() override;

protected:
  std::map<VarDecl*, VarDecl*> _aliasMap;

  /// Replace the use a variable within an inequality
  /// e.g. i: int_lin_le([1,2,3], [a,b,c], 10), oldVar: a, newVar d -> int_lin_le([1,2,3], [d,b,c],
  /// 10) Occurrence count is updated for variables involved.
  template <class Lit>
  void leReplaceVar(Item* i, VarDecl* oldVar, VarDecl* newVar);

  /// Check if the bounds of two Variables are equal
  bool eqBounds(Expression* a, Expression* b);
};

}  // namespace MiniZinc
