From 3c185aa40f7a286baa21aecad8d7e4cddad44973 Mon Sep 17 00:00:00 2001 From: Uriel Fanelli Date: Sat, 12 Aug 2023 23:57:06 +0200 Subject: [PATCH] Sorting not needed --- orchestrator.go | 2 -- 1 file changed, 2 deletions(-) diff --git a/orchestrator.go b/orchestrator.go index 8dcbfda..c666d26 100644 --- a/orchestrator.go +++ b/orchestrator.go @@ -5,7 +5,6 @@ import ( "log" "net" "slices" - "sort" "strconv" "time" ) @@ -16,7 +15,6 @@ func (mip *AbstractMulticast) AddUniqueAndSort(hier int64) { log.Println("Element already in the array:", hier) } else { 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) }