[13210] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[17180] | 3 | * Copyright (C) Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[13210] | 4 | *
|
---|
| 5 | * This file is part of HeuristicLab.
|
---|
| 6 | *
|
---|
| 7 | * HeuristicLab is free software: you can redistribute it and/or modify
|
---|
| 8 | * it under the terms of the GNU General Public License as published by
|
---|
| 9 | * the Free Software Foundation, either version 3 of the License, or
|
---|
| 10 | * (at your option) any later version.
|
---|
| 11 | *
|
---|
| 12 | * HeuristicLab is distributed in the hope that it will be useful,
|
---|
| 13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
---|
| 14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
---|
| 15 | * GNU General Public License for more details.
|
---|
| 16 | *
|
---|
| 17 | * You should have received a copy of the GNU General Public License
|
---|
| 18 | * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
|
---|
| 19 | */
|
---|
| 20 | #endregion
|
---|
| 21 |
|
---|
| 22 | using System;
|
---|
| 23 | using System.Collections.Generic;
|
---|
| 24 | using System.IO;
|
---|
| 25 | using System.Linq;
|
---|
| 26 | using HeuristicLab.Common;
|
---|
| 27 | using HeuristicLab.Core;
|
---|
| 28 | using HeuristicLab.Data;
|
---|
[16565] | 29 | using HEAL.Attic;
|
---|
[13210] | 30 |
|
---|
| 31 | namespace HeuristicLab.Problems.GeneticProgramming.Robocode {
|
---|
| 32 | [Item("EnemyCollection", "A collection of enemy robots for the Robocode genetic programming problem.")]
|
---|
[16565] | 33 | [StorableType("78324566-09C2-4D2F-A54F-79613934D7F1")]
|
---|
[13210] | 34 | public class EnemyCollection : CheckedItemList<StringValue> {
|
---|
| 35 | private const string sampleRobotToSelect = "sample.Crazy";
|
---|
| 36 |
|
---|
| 37 | [Storable]
|
---|
| 38 | public string RobocodePath { get; set; }
|
---|
| 39 |
|
---|
| 40 | [StorableConstructor]
|
---|
[16565] | 41 | protected EnemyCollection(StorableConstructorFlag _) : base(_) { }
|
---|
[13210] | 42 | protected EnemyCollection(EnemyCollection original, Cloner cloner)
|
---|
| 43 | : base(original, cloner) {
|
---|
| 44 | RobocodePath = original.RobocodePath;
|
---|
| 45 | }
|
---|
| 46 | public EnemyCollection() : base() { }
|
---|
| 47 |
|
---|
| 48 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 49 | return new EnemyCollection(this, cloner);
|
---|
| 50 | }
|
---|
| 51 |
|
---|
| 52 | public static EnemyCollection ReloadEnemies(string robocodeDir) {
|
---|
| 53 | EnemyCollection robotList = new EnemyCollection();
|
---|
| 54 |
|
---|
| 55 | try {
|
---|
| 56 | var robotsDir = new DirectoryInfo(Path.Combine(robocodeDir, "robots"));
|
---|
| 57 | var robotFiles = robotsDir.GetFiles("*", SearchOption.AllDirectories)
|
---|
| 58 | .Where(x => x.Extension == ".class" || x.Extension == ".jar");
|
---|
| 59 | var robotSet = new Dictionary<string, StringValue>();
|
---|
| 60 | foreach (var robot in robotFiles) {
|
---|
| 61 | string robotName = Path.Combine(robot.DirectoryName, Path.GetFileNameWithoutExtension(robot.FullName));
|
---|
| 62 | robotName = robotName.Remove(0, robotsDir.FullName.Length);
|
---|
| 63 | string[] nameParts = robotName.Split(new[] { Path.DirectorySeparatorChar },
|
---|
| 64 | StringSplitOptions.RemoveEmptyEntries);
|
---|
| 65 | robotName = string.Join(".", nameParts);
|
---|
| 66 | robotSet[robot.FullName] = new StringValue(robotName);
|
---|
| 67 | }
|
---|
| 68 | robotList.AddRange(robotSet.Values);
|
---|
| 69 |
|
---|
| 70 | foreach (var robot in robotList) {
|
---|
| 71 | robotList.SetItemCheckedState(robot, false);
|
---|
| 72 | }
|
---|
| 73 | }
|
---|
| 74 | catch { }
|
---|
| 75 |
|
---|
| 76 | //select one robot so that if a user tries out the Robocode problem it works with the default settings
|
---|
| 77 | if (robotList.Exists(x => x.Value == sampleRobotToSelect)) {
|
---|
| 78 | StringValue sampleRobot = robotList.Single(x => x.Value == sampleRobotToSelect);
|
---|
| 79 | robotList.SetItemCheckedState(sampleRobot, true);
|
---|
| 80 | }
|
---|
| 81 |
|
---|
| 82 | return robotList;
|
---|
| 83 | }
|
---|
| 84 | }
|
---|
| 85 | }
|
---|