bump

Author: KevinZonda

pkg/arrayx/duplicate.go

@@ -1,9 +1,10 @@
 package arrayx
 
 import (
-	"github.com/KevinZonda/GoX/pkg/constrains"
 	"math/rand"
 	"time"
+
+	"github.com/KevinZonda/GoX/pkg/constraint"
 )
 
 // HasDuplicate returns true if the array has duplicate items.
@@ -49,7 +50,7 @@ func Reverse[T any](a []T) {
 	}
 }
 
-func Sum[T constrains.Calculable](arr []T) T {
+func Sum[T constraint.Calculable](arr []T) T {
 	var sum T
 	for _, v := range arr {
 		sum += v

pkg/arrayx/linq.go

@@ -2,15 +2,15 @@ package arrayx
 
 // Last returns the last element of an array.
 func Last[T any](l []T) (last T, ok bool) {
-	if l == nil || len(l) == 0 {
+	if len(l) == 0 {
 		return last, false
 	}
 	return l[len(l)-1], true
 }
 
 // First returns the first element of an array.
 func First[T any](l []T) (fst T, ok bool) {
-	if l == nil || len(l) == 0 {
+	if len(l) == 0 {
 		return fst, false
 	}
 	return l[0], true

pkg/boolx/any.go

@@ -0,0 +1,19 @@
+package boolx
+
+func Any(vs []bool) bool {
+	for _, v := range vs {
+		if v {
+			return true
+		}
+	}
+	return false
+}
+
+func All(vs []bool) bool {
+	for _, v := range vs {
+		if !v {
+			return false
+		}
+	}
+	return true
+}

pkg/constrains/number.go pkg/constraint/number.gopkg/constrains/number.go renamed to pkg/constraint/number.go

@@ -1,4 +1,4 @@
-package constrains
+package constraint
 
 type Int interface {
 	~int | ~int8 | ~int16 | ~int32 | ~int64

pkg/constrains/order.go pkg/constraint/order.gopkg/constrains/order.go renamed to pkg/constraint/order.go

@@ -1,4 +1,4 @@
-package constrains
+package constraint
 
 type Order interface {
 	Number | ~string

pkg/intx/range.go

@@ -0,0 +1,9 @@
+package intx
+
+func InRange(i int, min int, max int) bool {
+	return i >= min && i <= max
+}
+
+func InRange64(i int64, min int64, max int64) bool {
+	return i >= min && i <= max
+}

pkg/iox/read.go

@@ -16,6 +16,10 @@ func ReadAllByte(file string) (bs []byte, err error) {
 	return io.ReadAll(f)
 }
 
+func ReadAllBytes(file string) (bs []byte, err error) {
+	return ReadAllByte(file)
+}
+
 func ReadAllText(file string) (str string, err error) {
 	var bs []byte
 	bs, err = ReadAllByte(file)

pkg/iox/write.go

@@ -16,6 +16,10 @@ func WriteAllBytes(file string, content []byte) error {
 	return WriteAllText(file, string(content))
 }
 
+func WriteAllByte(file string, content []byte) error {
+	return WriteAllBytes(file, content)
+}
+
 func WriteAllLines(file string, content []string) error {
 	fo, err := os.Create(file)
 	if err != nil {

pkg/process/run.go

@@ -11,7 +11,7 @@ type Runnable struct {
 	Wait bool
 }
 
-func (r Runnable) run() (cmd *exec.Cmd, err error) {
+func (r Runnable) Run() (cmd *exec.Cmd, err error) {
 	if r.Wait {
 		return RunWithWait(r.Name, r.Args...)
 	}

pkg/ruby/ruby.go

@@ -0,0 +1,49 @@
+package ruby
+
+import "github.com/KevinZonda/GoX/pkg/panicx"
+
+func Rdr[L any, R any](l L, r R) L {
+	return l
+}
+
+func Rdl[L any, R any](l L, r R) R {
+	return r
+}
+
+func Fork[T any](t T) (T, T) {
+	return t, t
+}
+
+func Pow[T any](t T, n int) []T {
+	r := make([]T, n)
+	for i := 0; i < n; i++ {
+		r[i] = t
+	}
+	return r
+}
+
+func Map[T any, R any](t []T, f func(T) R) []R {
+	r := make([]R, len(t))
+	for i, v := range t {
+		r[i] = f(v)
+	}
+	return r
+}
+
+func RdrErr[L any](l L, r error) L {
+	panicx.NotNilErr(r)
+	return l
+}
+
+func RdlErr[R any](l error, r R) R {
+	panicx.NotNilErr(l)
+	return r
+}
+
+func Apl[T any](t T, list []T) []T {
+	return append([]T{t}, list...)
+}
+
+func Apr[T any](list []T, t T) []T {
+	return append(list, t)
+}