feat(Go-Tool)：
2020/12/16: 添加YAML和结构体转换工具
This commit is contained in:
Huangzj
+300
-36
@@ -18,6 +18,27 @@ func (q Query) All(predicate func(interface{}) bool) bool {
|
||||
return true
|
||||
}
|
||||
|
||||
// AllT is the typed version of All.
|
||||
//
|
||||
// - predicateFn is of type "func(TSource) bool"
|
||||
//
|
||||
// NOTE: All has better performance than AllT.
|
||||
func (q Query) AllT(predicateFn interface{}) bool {
|
||||
|
||||
predicateGenericFunc, err := newGenericFunc(
|
||||
"AllT", "predicateFn", predicateFn,
|
||||
simpleParamValidator(newElemTypeSlice(new(genericType)), newElemTypeSlice(new(bool))),
|
||||
)
|
||||
if err != nil {
|
||||
panic(err)
|
||||
}
|
||||
predicateFunc := func(item interface{}) bool {
|
||||
return predicateGenericFunc.Call(item).(bool)
|
||||
}
|
||||
|
||||
return q.All(predicateFunc)
|
||||
}
|
||||
|
||||
// Any determines whether any element of a collection exists.
|
||||
func (q Query) Any() bool {
|
||||
_, ok := q.Iterate()()
|
||||
@@ -37,6 +58,28 @@ func (q Query) AnyWith(predicate func(interface{}) bool) bool {
|
||||
return false
|
||||
}
|
||||
|
||||
// AnyWithT is the typed version of AnyWith.
|
||||
//
|
||||
// - predicateFn is of type "func(TSource) bool"
|
||||
//
|
||||
// NOTE: AnyWith has better performance than AnyWithT.
|
||||
func (q Query) AnyWithT(predicateFn interface{}) bool {
|
||||
|
||||
predicateGenericFunc, err := newGenericFunc(
|
||||
"AnyWithT", "predicateFn", predicateFn,
|
||||
simpleParamValidator(newElemTypeSlice(new(genericType)), newElemTypeSlice(new(bool))),
|
||||
)
|
||||
if err != nil {
|
||||
panic(err)
|
||||
}
|
||||
|
||||
predicateFunc := func(item interface{}) bool {
|
||||
return predicateGenericFunc.Call(item).(bool)
|
||||
}
|
||||
|
||||
return q.AnyWith(predicateFunc)
|
||||
}
|
||||
|
||||
// Average computes the average of a collection of numeric values.
|
||||
func (q Query) Average() (r float64) {
|
||||
next := q.Iterate()
|
||||
@@ -104,8 +147,8 @@ func (q Query) Count() (r int) {
|
||||
return
|
||||
}
|
||||
|
||||
// CountWith returns a number that represents how many elements
|
||||
// in the specified collection satisfy a condition.
|
||||
// CountWith returns a number that represents how many elements in the specified
|
||||
// collection satisfy a condition.
|
||||
func (q Query) CountWith(predicate func(interface{}) bool) (r int) {
|
||||
next := q.Iterate()
|
||||
|
||||
@@ -118,14 +161,36 @@ func (q Query) CountWith(predicate func(interface{}) bool) (r int) {
|
||||
return
|
||||
}
|
||||
|
||||
// CountWithT is the typed version of CountWith.
|
||||
//
|
||||
// - predicateFn is of type "func(TSource) bool"
|
||||
//
|
||||
// NOTE: CountWith has better performance than CountWithT.
|
||||
func (q Query) CountWithT(predicateFn interface{}) int {
|
||||
|
||||
predicateGenericFunc, err := newGenericFunc(
|
||||
"CountWithT", "predicateFn", predicateFn,
|
||||
simpleParamValidator(newElemTypeSlice(new(genericType)), newElemTypeSlice(new(bool))),
|
||||
)
|
||||
if err != nil {
|
||||
panic(err)
|
||||
}
|
||||
|
||||
predicateFunc := func(item interface{}) bool {
|
||||
return predicateGenericFunc.Call(item).(bool)
|
||||
}
|
||||
|
||||
return q.CountWith(predicateFunc)
|
||||
}
|
||||
|
||||
// First returns the first element of a collection.
|
||||
func (q Query) First() interface{} {
|
||||
item, _ := q.Iterate()()
|
||||
return item
|
||||
}
|
||||
|
||||
// FirstWith returns the first element of a collection that satisfies
|
||||
// a specified condition.
|
||||
// FirstWith returns the first element of a collection that satisfies a
|
||||
// specified condition.
|
||||
func (q Query) FirstWith(predicate func(interface{}) bool) interface{} {
|
||||
next := q.Iterate()
|
||||
|
||||
@@ -138,6 +203,99 @@ func (q Query) FirstWith(predicate func(interface{}) bool) interface{} {
|
||||
return nil
|
||||
}
|
||||
|
||||
// FirstWithT is the typed version of FirstWith.
|
||||
//
|
||||
// - predicateFn is of type "func(TSource) bool"
|
||||
//
|
||||
// NOTE: FirstWith has better performance than FirstWithT.
|
||||
func (q Query) FirstWithT(predicateFn interface{}) interface{} {
|
||||
|
||||
predicateGenericFunc, err := newGenericFunc(
|
||||
"FirstWithT", "predicateFn", predicateFn,
|
||||
simpleParamValidator(newElemTypeSlice(new(genericType)), newElemTypeSlice(new(bool))),
|
||||
)
|
||||
if err != nil {
|
||||
panic(err)
|
||||
}
|
||||
|
||||
predicateFunc := func(item interface{}) bool {
|
||||
return predicateGenericFunc.Call(item).(bool)
|
||||
}
|
||||
|
||||
return q.FirstWith(predicateFunc)
|
||||
}
|
||||
|
||||
// ForEach performs the specified action on each element of a collection.
|
||||
func (q Query) ForEach(action func(interface{})) {
|
||||
next := q.Iterate()
|
||||
|
||||
for item, ok := next(); ok; item, ok = next() {
|
||||
action(item)
|
||||
}
|
||||
}
|
||||
|
||||
// ForEachT is the typed version of ForEach.
|
||||
//
|
||||
// - actionFn is of type "func(TSource)"
|
||||
//
|
||||
// NOTE: ForEach has better performance than ForEachT.
|
||||
func (q Query) ForEachT(actionFn interface{}) {
|
||||
actionGenericFunc, err := newGenericFunc(
|
||||
"ForEachT", "actionFn", actionFn,
|
||||
simpleParamValidator(newElemTypeSlice(new(genericType)), nil),
|
||||
)
|
||||
|
||||
if err != nil {
|
||||
panic(err)
|
||||
}
|
||||
|
||||
actionFunc := func(item interface{}) {
|
||||
actionGenericFunc.Call(item)
|
||||
}
|
||||
|
||||
q.ForEach(actionFunc)
|
||||
}
|
||||
|
||||
// ForEachIndexed performs the specified action on each element of a collection.
|
||||
//
|
||||
// The first argument to action represents the zero-based index of that
|
||||
// element in the source collection. This can be useful if the elements are in a
|
||||
// known order and you want to do something with an element at a particular
|
||||
// index, for example. It can also be useful if you want to retrieve the index
|
||||
// of one or more elements. The second argument to action represents the
|
||||
// element to process.
|
||||
func (q Query) ForEachIndexed(action func(int, interface{})) {
|
||||
next := q.Iterate()
|
||||
index := 0
|
||||
|
||||
for item, ok := next(); ok; item, ok = next() {
|
||||
action(index, item)
|
||||
index++
|
||||
}
|
||||
}
|
||||
|
||||
// ForEachIndexedT is the typed version of ForEachIndexed.
|
||||
//
|
||||
// - actionFn is of type "func(int, TSource)"
|
||||
//
|
||||
// NOTE: ForEachIndexed has better performance than ForEachIndexedT.
|
||||
func (q Query) ForEachIndexedT(actionFn interface{}) {
|
||||
actionGenericFunc, err := newGenericFunc(
|
||||
"ForEachIndexedT", "actionFn", actionFn,
|
||||
simpleParamValidator(newElemTypeSlice(new(int), new(genericType)), nil),
|
||||
)
|
||||
|
||||
if err != nil {
|
||||
panic(err)
|
||||
}
|
||||
|
||||
actionFunc := func(index int, item interface{}) {
|
||||
actionGenericFunc.Call(index, item)
|
||||
}
|
||||
|
||||
q.ForEachIndexed(actionFunc)
|
||||
}
|
||||
|
||||
// Last returns the last element of a collection.
|
||||
func (q Query) Last() (r interface{}) {
|
||||
next := q.Iterate()
|
||||
@@ -149,8 +307,8 @@ func (q Query) Last() (r interface{}) {
|
||||
return
|
||||
}
|
||||
|
||||
// LastWith returns the last element of a collection that satisfies
|
||||
// a specified condition.
|
||||
// LastWith returns the last element of a collection that satisfies a specified
|
||||
// condition.
|
||||
func (q Query) LastWith(predicate func(interface{}) bool) (r interface{}) {
|
||||
next := q.Iterate()
|
||||
|
||||
@@ -163,6 +321,28 @@ func (q Query) LastWith(predicate func(interface{}) bool) (r interface{}) {
|
||||
return
|
||||
}
|
||||
|
||||
// LastWithT is the typed version of LastWith.
|
||||
//
|
||||
// - predicateFn is of type "func(TSource) bool"
|
||||
//
|
||||
// NOTE: LastWith has better performance than LastWithT.
|
||||
func (q Query) LastWithT(predicateFn interface{}) interface{} {
|
||||
|
||||
predicateGenericFunc, err := newGenericFunc(
|
||||
"LastWithT", "predicateFn", predicateFn,
|
||||
simpleParamValidator(newElemTypeSlice(new(genericType)), newElemTypeSlice(new(bool))),
|
||||
)
|
||||
if err != nil {
|
||||
panic(err)
|
||||
}
|
||||
|
||||
predicateFunc := func(item interface{}) bool {
|
||||
return predicateGenericFunc.Call(item).(bool)
|
||||
}
|
||||
|
||||
return q.LastWith(predicateFunc)
|
||||
}
|
||||
|
||||
// Max returns the maximum value in a collection of values.
|
||||
func (q Query) Max() (r interface{}) {
|
||||
next := q.Iterate()
|
||||
@@ -230,8 +410,8 @@ func (q Query) SequenceEqual(q2 Query) bool {
|
||||
return !ok2
|
||||
}
|
||||
|
||||
// Single returns the only element of a collection, and nil
|
||||
// if there is not exactly one element in the collection.
|
||||
// Single returns the only element of a collection, and nil if there is not
|
||||
// exactly one element in the collection.
|
||||
func (q Query) Single() interface{} {
|
||||
next := q.Iterate()
|
||||
item, ok := next()
|
||||
@@ -247,8 +427,8 @@ func (q Query) Single() interface{} {
|
||||
return item
|
||||
}
|
||||
|
||||
// SingleWith returns the only element of a collection that satisfies
|
||||
// a specified condition, and nil if more than one such element exists.
|
||||
// SingleWith returns the only element of a collection that satisfies a
|
||||
// specified condition, and nil if more than one such element exists.
|
||||
func (q Query) SingleWith(predicate func(interface{}) bool) (r interface{}) {
|
||||
next := q.Iterate()
|
||||
found := false
|
||||
@@ -267,10 +447,31 @@ func (q Query) SingleWith(predicate func(interface{}) bool) (r interface{}) {
|
||||
return
|
||||
}
|
||||
|
||||
// SingleWithT is the typed version of SingleWith.
|
||||
//
|
||||
// - predicateFn is of type "func(TSource) bool"
|
||||
//
|
||||
// NOTE: SingleWith has better performance than SingleWithT.
|
||||
func (q Query) SingleWithT(predicateFn interface{}) interface{} {
|
||||
predicateGenericFunc, err := newGenericFunc(
|
||||
"SingleWithT", "predicateFn", predicateFn,
|
||||
simpleParamValidator(newElemTypeSlice(new(genericType)), newElemTypeSlice(new(bool))),
|
||||
)
|
||||
if err != nil {
|
||||
panic(err)
|
||||
}
|
||||
|
||||
predicateFunc := func(item interface{}) bool {
|
||||
return predicateGenericFunc.Call(item).(bool)
|
||||
}
|
||||
|
||||
return q.SingleWith(predicateFunc)
|
||||
}
|
||||
|
||||
// SumInts computes the sum of a collection of numeric values.
|
||||
//
|
||||
// Values can be of any integer type: int, int8, int16, int32, int64.
|
||||
// The result is int64. Method returns zero if collection contains no elements.
|
||||
// Values can be of any integer type: int, int8, int16, int32, int64. The result
|
||||
// is int64. Method returns zero if collection contains no elements.
|
||||
func (q Query) SumInts() (r int64) {
|
||||
next := q.Iterate()
|
||||
item, ok := next()
|
||||
@@ -290,8 +491,9 @@ func (q Query) SumInts() (r int64) {
|
||||
|
||||
// SumUInts computes the sum of a collection of numeric values.
|
||||
//
|
||||
// Values can be of any unsigned integer type: uint, uint8, uint16, uint32, uint64.
|
||||
// The result is uint64. Method returns zero if collection contains no elements.
|
||||
// Values can be of any unsigned integer type: uint, uint8, uint16, uint32,
|
||||
// uint64. The result is uint64. Method returns zero if collection contains no
|
||||
// elements.
|
||||
func (q Query) SumUInts() (r uint64) {
|
||||
next := q.Iterate()
|
||||
item, ok := next()
|
||||
@@ -330,8 +532,8 @@ func (q Query) SumFloats() (r float64) {
|
||||
return
|
||||
}
|
||||
|
||||
// ToChannel iterates over a collection and outputs each element
|
||||
// to a channel, then closes it.
|
||||
// ToChannel iterates over a collection and outputs each element to a channel,
|
||||
// then closes it.
|
||||
func (q Query) ToChannel(result chan<- interface{}) {
|
||||
next := q.Iterate()
|
||||
|
||||
@@ -343,8 +545,9 @@ func (q Query) ToChannel(result chan<- interface{}) {
|
||||
}
|
||||
|
||||
// ToMap iterates over a collection and populates result map with elements.
|
||||
// Collection elements have to be of KeyValue type to use this method.
|
||||
// To populate a map with elements of different type use ToMapBy method.
|
||||
// Collection elements have to be of KeyValue type to use this method. To
|
||||
// populate a map with elements of different type use ToMapBy method. ToMap
|
||||
// doesn't empty the result map before populating it.
|
||||
func (q Query) ToMap(result interface{}) {
|
||||
q.ToMapBy(
|
||||
result,
|
||||
@@ -356,15 +559,14 @@ func (q Query) ToMap(result interface{}) {
|
||||
})
|
||||
}
|
||||
|
||||
// ToMapBy iterates over a collection and populates result map with elements.
|
||||
// Functions keySelector and valueSelector are executed for each element of the collection
|
||||
// to generate key and value for the map. Generated key and value types must be assignable
|
||||
// to the map's key and value types.
|
||||
func (q Query) ToMapBy(
|
||||
result interface{},
|
||||
// ToMapBy iterates over a collection and populates the result map with
|
||||
// elements. Functions keySelector and valueSelector are executed for each
|
||||
// element of the collection to generate key and value for the map. Generated
|
||||
// key and value types must be assignable to the map's key and value types.
|
||||
// ToMapBy doesn't empty the result map before populating it.
|
||||
func (q Query) ToMapBy(result interface{},
|
||||
keySelector func(interface{}) interface{},
|
||||
valueSelector func(interface{}) interface{},
|
||||
) {
|
||||
valueSelector func(interface{}) interface{}) {
|
||||
res := reflect.ValueOf(result)
|
||||
m := reflect.Indirect(res)
|
||||
next := q.Iterate()
|
||||
@@ -379,16 +581,78 @@ func (q Query) ToMapBy(
|
||||
res.Elem().Set(m)
|
||||
}
|
||||
|
||||
// ToSlice iterates over a collection and populates result slice with elements.
|
||||
// Collection elements must be assignable to the slice's element type.
|
||||
func (q Query) ToSlice(result interface{}) {
|
||||
res := reflect.ValueOf(result)
|
||||
slice := reflect.Indirect(res)
|
||||
next := q.Iterate()
|
||||
|
||||
for item, ok := next(); ok; item, ok = next() {
|
||||
slice = reflect.Append(slice, reflect.ValueOf(item))
|
||||
// ToMapByT is the typed version of ToMapBy.
|
||||
//
|
||||
// - keySelectorFn is of type "func(TSource)TKey"
|
||||
// - valueSelectorFn is of type "func(TSource)TValue"
|
||||
//
|
||||
// NOTE: ToMapBy has better performance than ToMapByT.
|
||||
func (q Query) ToMapByT(result interface{},
|
||||
keySelectorFn interface{}, valueSelectorFn interface{}) {
|
||||
keySelectorGenericFunc, err := newGenericFunc(
|
||||
"ToMapByT", "keySelectorFn", keySelectorFn,
|
||||
simpleParamValidator(newElemTypeSlice(new(genericType)), newElemTypeSlice(new(genericType))),
|
||||
)
|
||||
if err != nil {
|
||||
panic(err)
|
||||
}
|
||||
|
||||
res.Elem().Set(slice)
|
||||
keySelectorFunc := func(item interface{}) interface{} {
|
||||
return keySelectorGenericFunc.Call(item)
|
||||
}
|
||||
|
||||
valueSelectorGenericFunc, err := newGenericFunc(
|
||||
"ToMapByT", "valueSelectorFn", valueSelectorFn,
|
||||
simpleParamValidator(newElemTypeSlice(new(genericType)), newElemTypeSlice(new(genericType))),
|
||||
)
|
||||
if err != nil {
|
||||
panic(err)
|
||||
}
|
||||
|
||||
valueSelectorFunc := func(item interface{}) interface{} {
|
||||
return valueSelectorGenericFunc.Call(item)
|
||||
}
|
||||
|
||||
q.ToMapBy(result, keySelectorFunc, valueSelectorFunc)
|
||||
}
|
||||
|
||||
// ToSlice iterates over a collection and saves the results in the slice pointed
|
||||
// by v. It overwrites the existing slice, starting from index 0.
|
||||
//
|
||||
// If the slice pointed by v has sufficient capacity, v will be pointed to a
|
||||
// resliced slice. If it does not, a new underlying array will be allocated and
|
||||
// v will point to it.
|
||||
func (q Query) ToSlice(v interface{}) {
|
||||
res := reflect.ValueOf(v)
|
||||
slice := reflect.Indirect(res)
|
||||
|
||||
cap := slice.Cap()
|
||||
res.Elem().Set(slice.Slice(0, cap)) // make len(slice)==cap(slice) from now on
|
||||
|
||||
next := q.Iterate()
|
||||
index := 0
|
||||
for item, ok := next(); ok; item, ok = next() {
|
||||
if index >= cap {
|
||||
slice, cap = grow(slice)
|
||||
}
|
||||
slice.Index(index).Set(reflect.ValueOf(item))
|
||||
index++
|
||||
}
|
||||
|
||||
// reslice the len(res)==cap(res) actual res size
|
||||
res.Elem().Set(slice.Slice(0, index))
|
||||
}
|
||||
|
||||
// grow grows the slice s by doubling its capacity, then it returns the new
|
||||
// slice (resliced to its full capacity) and the new capacity.
|
||||
func grow(s reflect.Value) (v reflect.Value, newCap int) {
|
||||
cap := s.Cap()
|
||||
if cap == 0 {
|
||||
cap = 1
|
||||
} else {
|
||||
cap *= 2
|
||||
}
|
||||
newSlice := reflect.MakeSlice(s.Type(), cap, cap)
|
||||
reflect.Copy(newSlice, s)
|
||||
return newSlice, cap
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user