From 96953d74e224c92916df4c6743122371895a626e Mon Sep 17 00:00:00 2001
From: kercylan98 <kercylan@gmail.com>
Date: Fri, 5 Jan 2024 09:31:41 +0800
Subject: [PATCH] =?UTF-8?q?feat:=20sher=20=E5=8C=85=E6=96=B0=E5=A2=9E=20Fi?=
 =?UTF-8?q?ndInSlice=20=E5=92=8C=20FindInSliceByBinary=20=E5=87=BD?=
 =?UTF-8?q?=E6=95=B0?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 utils/sher/find.go | 31 +++++++++++++++++++++++++++++++
 1 file changed, 31 insertions(+)

diff --git a/utils/sher/find.go b/utils/sher/find.go
index 891ff7a..9dad6a1 100644
--- a/utils/sher/find.go
+++ b/utils/sher/find.go
@@ -2,6 +2,37 @@ package sher
 
 import "github.com/kercylan98/minotaur/utils/generic"
 
+// FindInSlice 判断切片中是否存在某个元素，返回第一个匹配的索引和元素，不存在则索引返回 -1
+func FindInSlice[S ~[]V, V any](slice S, handler func(v V) bool) (i int, t V) {
+	if slice == nil {
+		return -1, t
+	}
+	for i, v := range slice {
+		if handler(v) {
+			return i, v
+		}
+	}
+	return -1, t
+}
+
+// FindInSliceByBinary 判断切片中是否存在某个元素，返回第一个匹配的索引和元素，不存在则索引返回 -1
+func FindInSliceByBinary[S ~[]V, V any](slice S, handler func(v V) bool) (i int, t V) {
+	low := 0
+	high := len(slice) - 1
+
+	for low <= high {
+		mid := low + (high-low)/2
+		if handler(slice[mid]) {
+			return mid, slice[mid]
+		} else if handler(slice[mid]) {
+			high = mid - 1
+		} else {
+			low = mid + 1
+		}
+	}
+	return -1, t
+}
+
 // FindMinimumInSlice 获取切片中的最小值
 func FindMinimumInSlice[S ~[]V, V generic.Number](slice S, handler ComparisonHandler[V]) (result V) {
 	if slice == nil {