- Timestamp:
- 09/14/12 18:58:15 (12 years ago)
- Location:
- branches/GP-MoveOperators
- Files:
-
- 7 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/GP-MoveOperators
- Property svn:ignore
-
old new 21 21 protoc.exe 22 22 _ReSharper.HeuristicLab 3.3 Tests 23 Google.ProtocolBuffers-2.4.1.473.dll
-
- Property svn:mergeinfo changed
- Property svn:ignore
-
branches/GP-MoveOperators/HeuristicLab.Encodings.PermutationEncoding
- Property svn:mergeinfo changed
/trunk/sources/HeuristicLab.Encodings.PermutationEncoding (added) merged: 8246,8338,8600
- Property svn:mergeinfo changed
-
branches/GP-MoveOperators/HeuristicLab.Encodings.PermutationEncoding/3.3/HeuristicLab.Encodings.PermutationEncoding-3.3.csproj
r6866 r8660 285 285 --> 286 286 <PropertyGroup> 287 <PreBuildEvent>set Path=%25Path%25;$(ProjectDir);$(SolutionDir)287 <PreBuildEvent Condition=" '$(OS)' == 'Windows_NT' ">set Path=%25Path%25;$(ProjectDir);$(SolutionDir) 288 288 set ProjectDir=$(ProjectDir) 289 289 set SolutionDir=$(SolutionDir) … … 292 292 call PreBuildEvent.cmd 293 293 </PreBuildEvent> 294 <PreBuildEvent Condition=" '$(OS)' != 'Windows_NT' "> 295 export ProjectDir=$(ProjectDir) 296 export SolutionDir=$(SolutionDir) 297 298 $SolutionDir/PreBuildEvent.sh 299 </PreBuildEvent> 294 300 </PropertyGroup> 295 301 </Project> -
branches/GP-MoveOperators/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/ThreeOpt/ExhaustiveInsertionMoveGenerator.cs
r7259 r8660 21 21 22 22 using System; 23 using System.Collections.Generic; 24 using System.Linq; 23 25 using HeuristicLab.Common; 24 26 using HeuristicLab.Core; … … 39 41 } 40 42 41 public static TranslocationMove[] Apply(Permutation permutation) {43 public static IEnumerable<TranslocationMove> Generate(Permutation permutation) { 42 44 int length = permutation.Length; 43 45 if (length == 1) throw new ArgumentException("ExhaustiveInsertionMoveGenerator: There cannot be an insertion move given a permutation of length 1.", "permutation"); 44 TranslocationMove[] moves = null; 45 int count = 0; 46 46 47 if (permutation.PermutationType == PermutationTypes.Absolute) { 47 moves = new TranslocationMove[length * (length - 1)];48 48 for (int i = 0; i < length; i++) { 49 49 for (int j = 1; j <= length - 1; j++) { 50 moves[count++] =new TranslocationMove(i, i, (i + j) % length);50 yield return new TranslocationMove(i, i, (i + j) % length); 51 51 } 52 52 } 53 53 } else { 54 54 if (length > 2) { 55 moves = new TranslocationMove[length * (length - 1) - 2];56 55 for (int i = 0; i < length; i++) { 57 56 for (int j = 1; j <= length - 1; j++) { 58 57 if (i == 0 && j == length - 1 59 58 || i == length - 1 && j == 1) continue; 60 moves[count++] =new TranslocationMove(i, i, (i + j) % length);59 yield return new TranslocationMove(i, i, (i + j) % length); 61 60 } 62 61 } 63 62 } else { // doesn't make sense, but just create a dummy move to not crash the algorithms 64 moves = new TranslocationMove[1]; 65 moves[0] = new TranslocationMove(0, 0, 1); 63 yield return new TranslocationMove(0, 0, 1); 66 64 } 67 65 } 68 System.Diagnostics.Debug.Assert(count == moves.Length); 69 return moves; 66 } 67 68 public static TranslocationMove[] Apply(Permutation permutation) { 69 return Generate(permutation).ToArray(); 70 70 } 71 71 -
branches/GP-MoveOperators/HeuristicLab.Encodings.PermutationEncoding/3.3/Moves/TwoOpt/ExhaustiveInversionMoveGenerator.cs
r7259 r8660 21 21 22 22 using System; 23 using System.Collections.Generic; 24 using System.Linq; 23 25 using HeuristicLab.Common; 24 26 using HeuristicLab.Core; … … 40 42 41 43 public static InversionMove[] Apply(Permutation permutation) { 44 return Generate(permutation).ToArray(); 45 } 46 47 public static IEnumerable<InversionMove> Generate(Permutation permutation) { 42 48 int length = permutation.Length; 43 49 if (length == 1) throw new ArgumentException("ExhaustiveInversionMoveGenerator: There cannot be an inversion move given a permutation of length 1.", "permutation"); 44 50 int totalMoves = (length) * (length - 1) / 2; 45 InversionMove[] moves = null;46 int count = 0;47 51 48 52 if (permutation.PermutationType == PermutationTypes.RelativeUndirected) { 49 53 if (totalMoves - 3 > 0) { 50 moves = new InversionMove[totalMoves - 3];51 54 for (int i = 0; i < length - 1; i++) { 52 55 for (int j = i + 1; j < length; j++) { 53 56 // doesn't make sense to inverse the whole permutation or the whole but one in case of relative undirected permutations 54 57 if (j - i >= length - 2) continue; 55 moves[count++] =new InversionMove(i, j);58 yield return new InversionMove(i, j); 56 59 } 57 60 } 58 61 } else { // when length is 3 or less, there's actually no difference, but for the sake of not crashing the algorithm create a dummy move 59 moves = new InversionMove[1]; 60 moves[0] = new InversionMove(0, 1); 62 yield return new InversionMove(0, 1); 61 63 } 62 64 } else { 63 moves = new InversionMove[totalMoves];64 65 for (int i = 0; i < length - 1; i++) 65 66 for (int j = i + 1; j < length; j++) { 66 moves[count++] =new InversionMove(i, j);67 yield return new InversionMove(i, j); 67 68 } 68 69 } 69 return moves;70 70 } 71 71 -
branches/GP-MoveOperators/HeuristicLab.Encodings.PermutationEncoding/3.3/Plugin.cs.frame
r7259 r8660 26 26 /// Plugin class for HeuristicLab.Encodings.PermutationEncoding plugin. 27 27 /// </summary> 28 [Plugin("HeuristicLab.Encodings.PermutationEncoding", "3.3. 6.$WCREV$")]28 [Plugin("HeuristicLab.Encodings.PermutationEncoding", "3.3.7.$WCREV$")] 29 29 [PluginFile("HeuristicLab.Encodings.PermutationEncoding-3.3.dll", PluginFileType.Assembly)] 30 30 [PluginDependency("HeuristicLab.Collections", "3.3")] -
branches/GP-MoveOperators/HeuristicLab.Encodings.PermutationEncoding/3.3/Properties/AssemblyInfo.cs.frame
r7259 r8660 54 54 // by using the '*' as shown below: 55 55 [assembly: AssemblyVersion("3.3.0.0")] 56 [assembly: AssemblyFileVersion("3.3. 6.$WCREV$")]56 [assembly: AssemblyFileVersion("3.3.7.$WCREV$")]
Note: See TracChangeset
for help on using the changeset viewer.