mirror of
				https://github.com/k3s-io/kubernetes.git
				synced 2025-10-31 05:40:42 +00:00 
			
		
		
		
	Addressing comments from code review (https://github.com/kubernetes/kubernetes/pull/55824#pullrequestreview-78597250) in order to simplify the code.
		
			
				
	
	
		
			92 lines
		
	
	
		
			2.4 KiB
		
	
	
	
		
			Go
		
	
	
	
	
	
			
		
		
	
	
			92 lines
		
	
	
		
			2.4 KiB
		
	
	
	
		
			Go
		
	
	
	
	
	
| /*
 | |
| Copyright 2015 The Kubernetes Authors.
 | |
| 
 | |
| Licensed under the Apache License, Version 2.0 (the "License");
 | |
| you may not use this file except in compliance with the License.
 | |
| You may obtain a copy of the License at
 | |
| 
 | |
|     http://www.apache.org/licenses/LICENSE-2.0
 | |
| 
 | |
| Unless required by applicable law or agreed to in writing, software
 | |
| distributed under the License is distributed on an "AS IS" BASIS,
 | |
| WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 | |
| See the License for the specific language governing permissions and
 | |
| limitations under the License.
 | |
| */
 | |
| 
 | |
| // Package slice provides utility methods for common operations on slices.
 | |
| package slice
 | |
| 
 | |
| import (
 | |
| 	"sort"
 | |
| 
 | |
| 	utilrand "k8s.io/apimachinery/pkg/util/rand"
 | |
| )
 | |
| 
 | |
| // CopyStrings copies the contents of the specified string slice
 | |
| // into a new slice.
 | |
| func CopyStrings(s []string) []string {
 | |
| 	if s == nil {
 | |
| 		return nil
 | |
| 	}
 | |
| 	c := make([]string, len(s))
 | |
| 	copy(c, s)
 | |
| 	return c
 | |
| }
 | |
| 
 | |
| // SortStrings sorts the specified string slice in place. It returns the same
 | |
| // slice that was provided in order to facilitate method chaining.
 | |
| func SortStrings(s []string) []string {
 | |
| 	sort.Strings(s)
 | |
| 	return s
 | |
| }
 | |
| 
 | |
| // ShuffleStrings copies strings from the specified slice into a copy in random
 | |
| // order. It returns a new slice.
 | |
| func ShuffleStrings(s []string) []string {
 | |
| 	if s == nil {
 | |
| 		return nil
 | |
| 	}
 | |
| 	shuffled := make([]string, len(s))
 | |
| 	perm := utilrand.Perm(len(s))
 | |
| 	for i, j := range perm {
 | |
| 		shuffled[j] = s[i]
 | |
| 	}
 | |
| 	return shuffled
 | |
| }
 | |
| 
 | |
| // ContainsString checks if a given slice of strings contains the provided string.
 | |
| // If a modifier func is provided, it is called with the slice item before the comparation.
 | |
| func ContainsString(slice []string, s string, modifier func(s string) string) bool {
 | |
| 	for _, item := range slice {
 | |
| 		if item == s {
 | |
| 			return true
 | |
| 		}
 | |
| 		if modifier != nil && modifier(item) == s {
 | |
| 			return true
 | |
| 		}
 | |
| 	}
 | |
| 	return false
 | |
| }
 | |
| 
 | |
| // RemoveString returns a newly created []string that contains all items from slice that
 | |
| // are not equal to s and modifier(s) in case modifier func is provided.
 | |
| func RemoveString(slice []string, s string, modifier func(s string) string) []string {
 | |
| 	newSlice := make([]string, 0)
 | |
| 	for _, item := range slice {
 | |
| 		if item == s {
 | |
| 			continue
 | |
| 		}
 | |
| 		if modifier != nil && modifier(item) == s {
 | |
| 			continue
 | |
| 		}
 | |
| 		newSlice = append(newSlice, item)
 | |
| 	}
 | |
| 	if len(newSlice) == 0 {
 | |
| 		// Sanitize for unit tests so we don't need to distinguish empty array
 | |
| 		// and nil.
 | |
| 		newSlice = nil
 | |
| 	}
 | |
| 	return newSlice
 | |
| }
 |