#region License Information
/* HeuristicLab
 * Copyright (C) 2002-2011 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
 *
 * This file is part of HeuristicLab.
 *
 * HeuristicLab is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * HeuristicLab is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
 */
#endregion

using System.Linq;

namespace HeuristicLab.Services.ProblemInstances {
  public class QAP : IQAP {
    public string[] GetProblemInstances() {
      using (ProblemInstancesEntities context = new ProblemInstancesEntities()) {
        return context.QAPInstances.Select(x => x.name).ToArray();
      }
    }

    public QAPInstanceDto GetProblemInstanceData(string instance) {
      using (ProblemInstancesEntities context = new ProblemInstancesEntities()) {
        return new QAPInstanceDto(context.QAPInstances.Where(x => x.name == instance).Single());
      }
    }

    public QAPSolutionDto[] GetBestSolutionsData(string instance) {
      using (ProblemInstancesEntities context = new ProblemInstancesEntities()) {
        QAPInstance qap = context.QAPInstances.Where(x => x.name == instance).SingleOrDefault();
        if (qap == null) return new QAPSolutionDto[0];
        double best = double.NaN;
        if (qap.maximization) best = qap.QAPSolutions.Max(x => x.quality);
        else best = qap.QAPSolutions.Min(x => x.quality);

        return qap.QAPSolutions.Where(x => x.quality == best).Select(x => new QAPSolutionDto(x)).ToArray();
      }
    }
  }
}