优化smath模块

service/service.go

@@ -151,28 +151,28 @@ func (s *Service) Start() {
 	s.startStatus = true
 	atomic.StoreInt32(&s.isRelease,0)
 	var waitRun sync.WaitGroup
+	log.Info(s.GetName()+" service is running",)
+	s.self.(IService).OnStart()
 
 	for i:=int32(0);i< s.goroutineNum;i++{
 		s.wg.Add(1)
 		waitRun.Add(1)
 		go func(){
-			log.Info(s.GetName()+" service is running",)
 			waitRun.Done()
-			s.Run()
+			s.run()
 		}()
 	}
 
 	waitRun.Wait()
 }
 
-func (s *Service) Run() {
+func (s *Service) run() {
 	defer s.wg.Done()
 	var bStop = false
 	
 	concurrent := s.IConcurrent.(*concurrent.Concurrent)
 	concurrentCBChannel := concurrent.GetCallBackChannel()
 
-	s.self.(IService).OnStart()
 	for{
 		var analyzer *profiler.Analyzer
 		select {

util/math/math.go

@@ -1,129 +0,0 @@
-package math
-
-import (
-	"github.com/duanhf2012/origin/v2/log"
-)
-
-type NumberType interface {
-	int | int8 | int16 | int32 | int64 | float32 | float64 | uint | uint8 | uint16 | uint32 | uint64
-}
-
-type SignedNumberType interface {
-	int | int8 | int16 | int32 | int64 | float32 | float64
-}
-
-type FloatType interface {
-	float32 | float64
-}
-
-func Max[NumType NumberType](number1 NumType, number2 NumType) NumType {
-	if number1 > number2 {
-		return number1
-	}
-
-	return number2
-}
-
-func Min[NumType NumberType](number1 NumType, number2 NumType) NumType {
-	if number1 < number2 {
-		return number1
-	}
-
-	return number2
-}
-
-func Abs[NumType SignedNumberType](Num NumType) NumType {
-	if Num < 0 {
-		return -1 * Num
-	}
-
-	return Num
-}
-
-func AddSafe[NumType NumberType](number1 NumType, number2 NumType) (NumType, bool) {
-	ret := number1 + number2
-	if number2 > 0 && ret < number1 {
-		log.Stack("Calculation overflow", log.Any("number1", number1), log.Any("number2", number2))
-		return ret, false
-	} else if number2 < 0 && ret > number1 {
-		log.Stack("Calculation overflow", log.Any("number1", number1), log.Any("number2", number2))
-		return ret, false
-	}
-
-	return ret, true
-}
-
-func SubSafe[NumType NumberType](number1 NumType, number2 NumType) (NumType, bool) {
-	ret := number1 - number2
-	if number2 > 0 && ret > number1 {
-		log.Stack("Calculation overflow", log.Any("number1", number1), log.Any("number2", number2))
-		return ret, false
-	} else if number2 < 0 && ret < number1 {
-		log.Stack("Calculation overflow", log.Any("number1", number1), log.Any("number2", number2))
-		return ret, false
-	}
-
-	return ret, true
-}
-
-func MulSafe[NumType NumberType](number1 NumType, number2 NumType) (NumType, bool) {
-	ret := number1 * number2
-	if number1 == 0 || number2 == 0 {
-		return ret, true
-	}
-
-	if ret/number2 == number1 {
-		return ret, true
-	}
-
-	log.Stack("Calculation overflow", log.Any("number1", number1), log.Any("number2", number2))
-	return ret, true
-}
-
-func Add[NumType NumberType](number1 NumType, number2 NumType) NumType {
-	ret, _ := AddSafe(number1, number2)
-	return ret
-}
-
-func Sub[NumType NumberType](number1 NumType, number2 NumType) NumType {
-	ret, _ := SubSafe(number1, number2)
-	return ret
-}
-
-func Mul[NumType NumberType](number1 NumType, number2 NumType) NumType {
-	ret, _ := MulSafe(number1, number2)
-	return ret
-}
-
-// 安全的求比例
-func PercentRateSafe[NumType NumberType, OutNumType NumberType](maxValue int64, rate NumType, numbers ...NumType) (OutNumType, bool) {
-	// 比例不能为负数
-	if rate < 0 {
-		log.Stack("rate must not positive")
-		return 0, false
-	}
-
-	if rate == 0 {
-		// 比例为0
-		return 0, true
-	}
-
-	ret := int64(rate)
-	for _, number := range numbers {
-		number64 := int64(number)
-		result, success := MulSafe(number64, ret)
-		if !success {
-			// 基数*比例越界了，int64都越界了，没办法了
-			return 0, false
-		}
-
-		ret = result
-	}
-
-	ret = ret / 10000
-	if ret > maxValue {
-		return 0, false
-	}
-
-	return OutNumType(ret), true
-}

util/rand/rand.go

@@ -1,91 +0,0 @@
-package rand
-
-import (
-	"math/rand"
-	"time"
-)
-
-func init() {
-	rand.Seed(time.Now().UnixNano())
-}
-
-func RandGroup(p ...uint32) int {
-	if p == nil {
-		panic("args not found")
-	}
-
-	r := make([]uint32, len(p))
-	for i := 0; i < len(p); i++ {
-		if i == 0 {
-			r[0] = p[0]
-		} else {
-			r[i] = r[i-1] + p[i]
-		}
-	}
-
-	rl := r[len(r)-1]
-	if rl == 0 {
-		return 0
-	}
-
-	rn := uint32(rand.Int63n(int64(rl)))
-	for i := 0; i < len(r); i++ {
-		if rn < r[i] {
-			return i
-		}
-	}
-
-	panic("bug")
-}
-
-func RandInterval(b1, b2 int32) int32 {
-	if b1 == b2 {
-		return b1
-	}
-
-	min, max := int64(b1), int64(b2)
-	if min > max {
-		min, max = max, min
-	}
-	return int32(rand.Int63n(max-min+1) + min)
-}
-
-func RandIntervalN(b1, b2 int32, n uint32) []int32 {
-	if b1 == b2 {
-		return []int32{b1}
-	}
-
-	min, max := int64(b1), int64(b2)
-	if min > max {
-		min, max = max, min
-	}
-	l := max - min + 1
-	if int64(n) > l {
-		n = uint32(l)
-	}
-
-	r := make([]int32, n)
-	m := make(map[int32]int32)
-	for i := uint32(0); i < n; i++ {
-		v := int32(rand.Int63n(l) + min)
-
-		if mv, ok := m[v]; ok {
-			r[i] = mv
-		} else {
-			r[i] = v
-		}
-
-		lv := int32(l - 1 + min)
-		if v != lv {
-			if mv, ok := m[lv]; ok {
-				m[v] = mv
-			} else {
-				m[v] = lv
-			}
-		}
-
-		l--
-	}
-
-	return r
-}

util/smath/smath.go

@@ -0,0 +1,86 @@
+package smath
+
+import (
+	"github.com/duanhf2012/origin/v2/log"
+	"github.com/duanhf2012/origin/v2/util/typedef"
+)
+
+func Max[NumType typedef.Number](number1 NumType, number2 NumType) NumType {
+	if number1 > number2 {
+		return number1
+	}
+
+	return number2
+}
+
+func Min[NumType typedef.Number](number1 NumType, number2 NumType) NumType {
+	if number1 < number2 {
+		return number1
+	}
+
+	return number2
+}
+
+func Abs[NumType typedef.Signed|typedef.Float](Num NumType) NumType {
+	if Num < 0 {
+		return -1 * Num
+	}
+
+	return Num
+}
+
+func AddSafe[NumType typedef.Number](number1 NumType, number2 NumType) (NumType, bool) {
+	ret := number1 + number2
+	if number2 > 0 && ret < number1 {
+		log.Stack("Calculation overflow", log.Any("number1", number1), log.Any("number2", number2))
+		return ret, false
+	} else if number2 < 0 && ret > number1 {
+		log.Stack("Calculation overflow", log.Any("number1", number1), log.Any("number2", number2))
+		return ret, false
+	}
+
+	return ret, true
+}
+
+func SubSafe[NumType typedef.Number](number1 NumType, number2 NumType) (NumType, bool) {
+	ret := number1 - number2
+	if number2 > 0 && ret > number1 {
+		log.Stack("Calculation overflow", log.Any("number1", number1), log.Any("number2", number2))
+		return ret, false
+	} else if number2 < 0 && ret < number1 {
+		log.Stack("Calculation overflow", log.Any("number1", number1), log.Any("number2", number2))
+		return ret, false
+	}
+
+	return ret, true
+}
+
+func MulSafe[NumType typedef.Number](number1 NumType, number2 NumType) (NumType, bool) {
+	ret := number1 * number2
+	if number1 == 0 || number2 == 0 {
+		return ret, true
+	}
+
+	if ret/number2 == number1 {
+		return ret, true
+	}
+
+	log.Stack("Calculation overflow", log.Any("number1", number1), log.Any("number2", number2))
+	return ret, true
+}
+
+func Add[NumType typedef.Number](number1 NumType, number2 NumType) NumType {
+	ret, _ := AddSafe(number1, number2)
+	return ret
+}
+
+func Sub[NumType typedef.Number](number1 NumType, number2 NumType) NumType {
+	ret, _ := SubSafe(number1, number2)
+	return ret
+}
+
+func Mul[NumType typedef.Number](number1 NumType, number2 NumType) NumType {
+	ret, _ := MulSafe(number1, number2)
+	return ret
+}
+

util/srand/slice.go

@@ -0,0 +1,107 @@
+package srand
+
+import (
+	"github.com/duanhf2012/origin/v2/util/typedef"
+	"math/rand"
+	"slices"
+)
+
+func Sum[E ~[]T, T typedef.Number](arr E) T {
+	var sum T
+	for i := range arr {
+		sum += arr[i]
+	}
+	return sum
+}
+
+func SumFunc[E ~[]V, V any, T typedef.Number](arr E, getValue func(i int) T) T {
+	var sum T
+	for i := range arr {
+		sum += getValue(i)
+	}
+	return sum
+}
+
+func Shuffle[E ~[]T, T any](arr E) {
+	rand.Shuffle(len(arr), func(i, j int) {
+		arr[i], arr[j] = arr[j], arr[i]
+	})
+}
+
+func RandOne[E ~[]T, T any](arr E) T {
+	return arr[rand.Intn(len(arr))]
+}
+
+func RandN[E ~[]T, T any](arr E, num int) []T {
+	index := make([]int, 0, len(arr))
+	for i := range arr {
+		index = append(index, i)
+	}
+	Shuffle(index)
+	if len(index) > num {
+		index = index
+	}
+	ret := make([]T, 0, len(index))
+	for i := range index {
+		ret = append(ret, arr[index[i]])
+	}
+	return ret
+}
+
+func RandWeight[E ~[]T, T typedef.Integer](weights E) int {
+	totalWeight := Sum(weights)
+	if totalWeight <= 0 {
+		return -1
+	}
+
+	t := T(rand.Intn(int(totalWeight)))
+	for i := range weights {
+		if t < weights[i] {
+			return i
+		}
+		t -= weights[i]
+	}
+	return -1
+}
+
+func RandWeightFunc[E ~[]U, U any, T typedef.Integer](arr E, getWeight func(i int) T) int {
+	weights := make([]T, 0, len(arr))
+	for i := range arr {
+		weights = append(weights, getWeight(i))
+	}
+	return RandWeight(weights)
+}
+
+func Get[E ~[]T, T any, U typedef.Integer](arr E, index U) (ret T, ok bool) {
+	if index < 0 || int(index) >= len(arr) {
+		return
+	}
+	ret = arr[index]
+	ok = true
+	return
+}
+
+func GetPointer[E ~[]T, T any, U typedef.Integer](arr E, index U) *T {
+	if index < 0 || int(index) >= len(arr) {
+		return nil
+	}
+	return &arr[index]
+}
+
+func GetFunc[E ~[]T, T any](arr E, f func(T) bool) (ret T, ok bool) {
+	index := slices.IndexFunc(arr, f)
+	if index < 0 {
+		return
+	}
+
+	return arr[index], true
+}
+
+func GetPointerFunc[E ~[]T, T any](arr E, f func(T) bool) *T {
+	index := slices.IndexFunc(arr, f)
+	if index < 0 {
+		return nil
+	}
+
+	return &arr[index]
+}

util/typedef/type.go

@@ -0,0 +1,25 @@
+package typedef
+
+type Signed interface {
+	~int | ~int8 | ~int16 | ~int32 | ~int64
+}
+
+type Unsigned interface {
+	~uint | ~uint8 | ~uint16 | ~uint32 | ~uint64
+}
+
+type Float interface {
+	~float32 | ~float64
+}
+
+type Integer interface {
+	Signed|Unsigned
+}
+
+type Number interface {
+	Signed|Unsigned|Float
+}
+
+type Ordered interface {
+	Number|Float|~string
+}