mirror of
https://github.com/kubesphere/kubekey.git
synced 2025-12-25 17:12:50 +00:00
348c9b2d15
* feat: enhance precheck tasks for image registry and network validation - Added a task to ensure successful authentication to the image registry. - Updated existing tasks to provide clearer failure messages for required configurations. - Improved validation for network interfaces and CIDR configurations, ensuring dual-stack support. - Enhanced error handling in the resource handler for playbook creation. Signed-off-by: joyceliu <joyceliu@yunify.com> * feat: enhance configuration and query handling - Added `-trimpath` flag to Go build configuration for improved binary paths. - Updated REST configuration to set QPS and Burst limits for better performance. - Refactored query handling to use string types for field and value, improving type consistency. - Enhanced error handling in resource configuration updates and improved parsing of request bodies. Signed-off-by: joyceliu <joyceliu@yunify.com> * feat: check inventory when it's changed Signed-off-by: joyceliu <joyceliu@yunify.com> * feat: enhance playbook execution and query handling - Added a new optional query parameter `promise` to the playbook and inventory endpoints, allowing for asynchronous execution control. - Introduced a new result state `ResultPending` to indicate ongoing operations. - Refactored the executor function to handle the `promise` parameter, enabling conditional execution of playbooks. - Improved error handling and logging during playbook execution. Signed-off-by: joyceliu <joyceliu@yunify.com> --------- Signed-off-by: joyceliu <joyceliu@yunify.com>
19 lines
548 B
Go
19 lines
548 B
Go
package utils
|
|
|
|
// RemoveDuplicatesInOrder removes duplicate elements from a slice while preserving the original order.
|
|
// It works for any slice of comparable type T.
|
|
// Example: RemoveDuplicatesInOrder([]int{1,2,2,3}) returns []int{1,2,3}
|
|
func RemoveDuplicatesInOrder[T comparable](arr []T) []T {
|
|
encountered := make(map[T]bool)
|
|
result := make([]T, 0, len(arr)) // Preallocate capacity to avoid multiple allocations
|
|
|
|
for _, v := range arr {
|
|
if !encountered[v] {
|
|
encountered[v] = true
|
|
result = append(result, v)
|
|
}
|
|
}
|
|
|
|
return result
|
|
}
|