工作生活

Go 语言程序设计——过程式编程(6)

2019-07-14  本文已影响0人  hlemon

泛型函数

i := Minimum(4, 3, 8, 2, 9).(int)
fmt.Printf("%T %v\n", i, i)
f := Minimum(9.4, -5.4, 3.8, 17.0, -3.1, 0.0).(float64)
fmt.Printf("%T %v\n", f, f)
s := Minimum("K", "X", "B", "C", "CC", "CA", "D", "M").(string)
fmt.Printf("%T %v\n", s, s)
func Minimum(first interface{}, rest ...interface{}) interface{} {
  minimum := first
  for _, x := range rest {
    switch x := x.(type) {
    case int:
      if x < minimum.(int) {
        minimum = x
      }
    }
    case float64:
      if x < minimum.(float64) {
        minimum = x
      }
    }
    case string:
      if x < minimum.(string) {
        minimum = x
      }
    }
  }
  return minimum
}

高阶函数

func SliceIndex(limit int, predicate func(i int) bool) int {
  for i := 0; i < limit; i++ {
    if predicate(i) {
      return i
    }
  }
  return -1
}
xs := []int{2, 4, 6, 8}
ys := []string{"C", "B", "K", "A"}
fmt.Println(
  SliceIndex(len(xs), func(i int) boot {return xs[i] == 5}),
  SliceIndex(len(xs), func(i int) boot {return xs[i] == 6}),
  SliceIndex(len(ys), func(i int) boot {return ys[i] == "Z"}),
  SliceIndex(len(ys), func(i int) boot {return ys[i] == "A"})
)
纯记忆函数
func Memoize(function memoizeFunction) memoizeFunction {
  cache := make(map[string]interface{})
  return func(x int, xs ...int) interface{} {
    key := fmt.Sprint(x)
    for _, i := range xs {
      key += fmt.Sprintf(", %d", i)
    }
    if value, found := cache[key]; found {
      return value
    }
    value := function(x, xs...)
    cache[key] = value
    return value
  }
 }
上一篇 下一篇

猜你喜欢

热点阅读