Working on implementing a weightvector neighborhood

src/MetaJul.jl

@@ -34,6 +34,10 @@ export CrowdingDistanceComparator
 export compare
 include("util/comparator.jl")
 
+export Neighborhood
+export minFastSort
+include("util/neighborhood.jl")
+
 export NonDominatedArchive, CrowdingDistanceArchive
 export add!, isEmpty, contain, getSolutions
 include("util/archive.jl")
@@ -176,8 +180,5 @@ export AggregationFunction, WeightedSum
 export compute
 include("util/aggregationFunction.jl")
 
-export Neighborhood
-export minFastSort
-include("util/neighborhood.jl")
 end 
 # module metajul

src/component/evolutionaryAlgorithm/selection.jl

@@ -52,7 +52,7 @@ end
     ARCHIVE
 end
 
-abstract type Neighborhood{S} end
+#abstract type Neighborhood{S} end
 
 struct PopulationAndNeighborhoodSelection{T} <: Selection
     matingPoolSize::Int

src/util/neighborhood.jl

@@ -1,4 +1,4 @@
-abstract type Neighborhood end
+abstract type Neighborhood{S} end
 
 function minFastSort(x::Vector{Float64}, idx::Vector{Int}, n::Int, m::Int)
     for i in 1:m

test/runtests.jl

@@ -12,8 +12,6 @@ function createContinuousSolution(numberOfObjectives::Int)::ContinuousSolution{F
     return ContinuousSolution{Float64}([1.0], objectives, [], Dict(), [Bounds{Float64}(1.0, 10.0), Bounds{Float64}(1.0, 10.0)])
 end
 
-#=
-
 coreTests = [
     "core/constraintHandlingTest.jl"
     ]
@@ -110,7 +108,7 @@ end
 include("util/pointTest.jl")
 include("util/aggregationFunctionTest.jl")
 
-=#
 
+include("util/neighborhoodTest.jl")
 
 

test/util/neighborhoodTest.jl

@@ -0,0 +1,11 @@
+# Unit Tests for method minFastSort
+@testset "minFastSort Tests" begin
+    # Test 1
+    x = [2.0, 1.0]
+    idx = [1, 2]
+    n = length(x)
+    m = 2
+    minFastSort(x, idx, n, m)
+    @test x == [1.0, 2.0]
+    @test idx == [2, 1]
+end