Sorting not needed
parent
dfb1aa070a
commit
3c185aa40f
|
@ -5,7 +5,6 @@ import (
|
||||||
"log"
|
"log"
|
||||||
"net"
|
"net"
|
||||||
"slices"
|
"slices"
|
||||||
"sort"
|
|
||||||
"strconv"
|
"strconv"
|
||||||
"time"
|
"time"
|
||||||
)
|
)
|
||||||
|
@ -16,7 +15,6 @@ func (mip *AbstractMulticast) AddUniqueAndSort(hier int64) {
|
||||||
log.Println("Element already in the array:", hier)
|
log.Println("Element already in the array:", hier)
|
||||||
} else {
|
} else {
|
||||||
mip.HierarchyArray = append(mip.HierarchyArray, hier)
|
mip.HierarchyArray = append(mip.HierarchyArray, hier)
|
||||||
sort.Slice(mip.HierarchyArray, func(i, j int) bool { return mip.HierarchyArray[i] < mip.HierarchyArray[j] })
|
|
||||||
log.Println("Here the numbers known:", mip.HierarchyArray)
|
log.Println("Here the numbers known:", mip.HierarchyArray)
|
||||||
|
|
||||||
}
|
}
|
||||||
|
|
Loading…
Reference in New Issue