algorithms/map.go

@@ -1,6 +1,15 @@
 package algorithms
 
-func Merge(m1, m2 map[string]interface{}) map[string]interface{} {
+func Merge(maps ...map[string]interface{}) map[string]interface{} {
+	res := maps[0]
+	for _, m := range maps[1:] {
+		res = deepMerge(res, m)
+	}
+
+	return res
+}
+
+func deepMerge(m1, m2 map[string]interface{}) map[string]interface{} {
 	// lifted from helm's merge code
 	out := make(map[string]interface{}, len(m1))
 	for k, v := range m1 {
@@ -11,7 +20,7 @@ func Merge(m1, m2 map[string]interface{}) map[string]interface{} {
 		if v, ok := v.(map[string]interface{}); ok {
 			if bv, ok := out[k]; ok {
 				if bv, ok := bv.(map[string]interface{}); ok {
-					out[k] = Merge(bv, v)
+					out[k] = deepMerge(bv, v)
 					continue
 				}
 			}

algorithms/pager.go

@@ -0,0 +1,50 @@
+package algorithms
+
+type FetchPageFunc[T any] func(page *string, size int64) ([]T, *PageInfo, error)
+
+type PageInfo struct {
+	HasNext  bool
+	After    *string
+	PageSize int64
+}
+
+type Pager[T any] struct {
+	pageInfo *PageInfo
+	err      error
+
+	fetchPage FetchPageFunc[T]
+}
+
+type PageIter[T any] interface {
+	NextPage() ([]T, error)
+}
+
+func NewPager[T any](pageSize int64, fetchPage FetchPageFunc[T]) *Pager[T] {
+	p := &Pager[T]{
+		fetchPage: fetchPage,
+	}
+	p.pageInfo = &PageInfo{
+		HasNext:  true,
+		After:    nil,
+		PageSize: pageSize,
+	}
+	return p
+}
+
+func (p *Pager[T]) NextPage() ([]T, error) {
+	var list []T
+
+	if !p.pageInfo.HasNext {
+		return nil, nil
+	}
+
+	list, p.pageInfo, p.err = p.fetchPage(p.pageInfo.After, p.pageInfo.PageSize)
+	if p.err != nil {
+		return nil, p.err
+	}
+	return list, nil
+}
+
+func (p *Pager[T]) HasNext() bool {
+	return p.pageInfo.HasNext
+}