funcs_aggregate.go 7.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350
  1. package xsql
  2. import (
  3. "fmt"
  4. "github.com/emqx/kuiper/common"
  5. "github.com/emqx/kuiper/xstream/api"
  6. "strings"
  7. )
  8. type AggregateFunctionValuer struct {
  9. data AggregateData
  10. fv *FunctionValuer
  11. funcPlugins *funcPlugins
  12. }
  13. func NewFunctionValuersForOp(ctx api.StreamContext) (*FunctionValuer, *AggregateFunctionValuer) {
  14. p := NewFuncPlugins(ctx)
  15. return NewAggregateFunctionValuers(p)
  16. }
  17. //Should only be called by stream to make sure a single instance for an operation
  18. func NewAggregateFunctionValuers(p *funcPlugins) (*FunctionValuer, *AggregateFunctionValuer) {
  19. fv := NewFunctionValuer(p)
  20. return fv, &AggregateFunctionValuer{
  21. fv: fv,
  22. funcPlugins: p,
  23. }
  24. }
  25. func (v *AggregateFunctionValuer) SetData(data AggregateData) {
  26. v.data = data
  27. }
  28. func (v *AggregateFunctionValuer) GetSingleCallValuer() CallValuer {
  29. return v.fv
  30. }
  31. func (v *AggregateFunctionValuer) Value(key string) (interface{}, bool) {
  32. return nil, false
  33. }
  34. func (v *AggregateFunctionValuer) Meta(key string) (interface{}, bool) {
  35. return nil, false
  36. }
  37. func (v *AggregateFunctionValuer) Call(name string, args []interface{}) (interface{}, bool) {
  38. lowerName := strings.ToLower(name)
  39. switch lowerName {
  40. case "avg":
  41. arg0 := args[0].([]interface{})
  42. c := getCount(arg0)
  43. if c > 0 {
  44. v := getFirstValidArg(arg0)
  45. switch v.(type) {
  46. case int, int64:
  47. if r, err := sliceIntTotal(arg0); err != nil {
  48. return err, false
  49. } else {
  50. return r / c, true
  51. }
  52. case float64:
  53. if r, err := sliceFloatTotal(arg0); err != nil {
  54. return err, false
  55. } else {
  56. return r / float64(c), true
  57. }
  58. case nil:
  59. return nil, true
  60. default:
  61. return fmt.Errorf("run avg function error: found invalid arg %[1]T(%[1]v)", v), false
  62. }
  63. }
  64. return 0, true
  65. case "count":
  66. arg0 := args[0].([]interface{})
  67. return getCount(arg0), true
  68. case "max":
  69. arg0 := args[0].([]interface{})
  70. if len(arg0) > 0 {
  71. v := getFirstValidArg(arg0)
  72. switch t := v.(type) {
  73. case int:
  74. if r, err := sliceIntMax(arg0, t); err != nil {
  75. return err, false
  76. } else {
  77. return r, true
  78. }
  79. case int64:
  80. if r, err := sliceIntMax(arg0, int(t)); err != nil {
  81. return err, false
  82. } else {
  83. return r, true
  84. }
  85. case float64:
  86. if r, err := sliceFloatMax(arg0, t); err != nil {
  87. return err, false
  88. } else {
  89. return r, true
  90. }
  91. case string:
  92. if r, err := sliceStringMax(arg0, t); err != nil {
  93. return err, false
  94. } else {
  95. return r, true
  96. }
  97. case nil:
  98. return nil, true
  99. default:
  100. return fmt.Errorf("run max function error: found invalid arg %[1]T(%[1]v)", v), false
  101. }
  102. }
  103. return fmt.Errorf("run max function error: empty data"), false
  104. case "min":
  105. arg0 := args[0].([]interface{})
  106. if len(arg0) > 0 {
  107. v := getFirstValidArg(arg0)
  108. switch t := v.(type) {
  109. case int:
  110. if r, err := sliceIntMin(arg0, t); err != nil {
  111. return err, false
  112. } else {
  113. return r, true
  114. }
  115. case int64:
  116. if r, err := sliceIntMin(arg0, int(t)); err != nil {
  117. return err, false
  118. } else {
  119. return r, true
  120. }
  121. case float64:
  122. if r, err := sliceFloatMin(arg0, t); err != nil {
  123. return err, false
  124. } else {
  125. return r, true
  126. }
  127. case string:
  128. if r, err := sliceStringMin(arg0, t); err != nil {
  129. return err, false
  130. } else {
  131. return r, true
  132. }
  133. case nil:
  134. return nil, true
  135. default:
  136. return fmt.Errorf("run min function error: found invalid arg %[1]T(%[1]v)", v), false
  137. }
  138. }
  139. return fmt.Errorf("run min function error: empty data"), false
  140. case "sum":
  141. arg0 := args[0].([]interface{})
  142. if len(arg0) > 0 {
  143. v := getFirstValidArg(arg0)
  144. switch v.(type) {
  145. case int, int64:
  146. if r, err := sliceIntTotal(arg0); err != nil {
  147. return err, false
  148. } else {
  149. return r, true
  150. }
  151. case float64:
  152. if r, err := sliceFloatTotal(arg0); err != nil {
  153. return err, false
  154. } else {
  155. return r, true
  156. }
  157. case nil:
  158. return nil, true
  159. default:
  160. return fmt.Errorf("run sum function error: found invalid arg %[1]T(%[1]v)", v), false
  161. }
  162. }
  163. return 0, true
  164. case "collect":
  165. return args[0], true
  166. case "deduplicate":
  167. v1, ok1 := args[0].([]interface{})
  168. v2, ok2 := args[1].([]interface{})
  169. v3a, ok3 := args[2].([]interface{})
  170. if ok1 && ok2 && ok3 && len(v3a) > 0 {
  171. v3, ok4 := getFirstValidArg(v3a).(bool)
  172. if ok4 {
  173. if r, err := dedup(v1, v2, v3); err != nil {
  174. return err, false
  175. } else {
  176. return r, true
  177. }
  178. }
  179. }
  180. return fmt.Errorf("Invalid argument type found."), false
  181. default:
  182. common.Log.Debugf("run aggregate func %s", name)
  183. nf, fctx, err := v.funcPlugins.GetFuncFromPlugin(name)
  184. if err != nil {
  185. return err, false
  186. }
  187. if !nf.IsAggregate() {
  188. return nil, false
  189. }
  190. result, ok := nf.Exec(args, fctx)
  191. common.Log.Debugf("run custom aggregate function %s, get result %v", name, result)
  192. return result, ok
  193. }
  194. }
  195. func getCount(s []interface{}) int {
  196. c := 0
  197. for _, v := range s {
  198. if v != nil {
  199. c++
  200. }
  201. }
  202. return c
  203. }
  204. func (v *AggregateFunctionValuer) GetAllTuples() AggregateData {
  205. return v.data
  206. }
  207. func getFirstValidArg(s []interface{}) interface{} {
  208. for _, v := range s {
  209. if v != nil {
  210. return v
  211. }
  212. }
  213. return nil
  214. }
  215. func sliceIntTotal(s []interface{}) (int, error) {
  216. var total int
  217. for _, v := range s {
  218. if vi, ok := v.(int); ok {
  219. total += vi
  220. } else if v != nil {
  221. return 0, fmt.Errorf("requires int but found %[1]T(%[1]v)", v)
  222. }
  223. }
  224. return total, nil
  225. }
  226. func sliceFloatTotal(s []interface{}) (float64, error) {
  227. var total float64
  228. for _, v := range s {
  229. if vf, ok := v.(float64); ok {
  230. total += vf
  231. } else if v != nil {
  232. return 0, fmt.Errorf("requires float64 but found %[1]T(%[1]v)", v)
  233. }
  234. }
  235. return total, nil
  236. }
  237. func sliceIntMax(s []interface{}, max int) (int, error) {
  238. for _, v := range s {
  239. if vi, ok := v.(int); ok {
  240. if max < vi {
  241. max = vi
  242. }
  243. } else if v != nil {
  244. return 0, fmt.Errorf("requires int but found %[1]T(%[1]v)", v)
  245. }
  246. }
  247. return max, nil
  248. }
  249. func sliceFloatMax(s []interface{}, max float64) (float64, error) {
  250. for _, v := range s {
  251. if vf, ok := v.(float64); ok {
  252. if max < vf {
  253. max = vf
  254. }
  255. } else if v != nil {
  256. return 0, fmt.Errorf("requires float64 but found %[1]T(%[1]v)", v)
  257. }
  258. }
  259. return max, nil
  260. }
  261. func sliceStringMax(s []interface{}, max string) (string, error) {
  262. for _, v := range s {
  263. if vs, ok := v.(string); ok {
  264. if max < vs {
  265. max = vs
  266. }
  267. } else if v != nil {
  268. return "", fmt.Errorf("requires string but found %[1]T(%[1]v)", v)
  269. }
  270. }
  271. return max, nil
  272. }
  273. func sliceIntMin(s []interface{}, min int) (int, error) {
  274. for _, v := range s {
  275. if vi, ok := v.(int); ok {
  276. if min > vi {
  277. min = vi
  278. }
  279. } else if v != nil {
  280. return 0, fmt.Errorf("requires int but found %[1]T(%[1]v)", v)
  281. }
  282. }
  283. return min, nil
  284. }
  285. func sliceFloatMin(s []interface{}, min float64) (float64, error) {
  286. for _, v := range s {
  287. if vf, ok := v.(float64); ok {
  288. if min > vf {
  289. min = vf
  290. }
  291. } else if v != nil {
  292. return 0, fmt.Errorf("requires float64 but found %[1]T(%[1]v)", v)
  293. }
  294. }
  295. return min, nil
  296. }
  297. func sliceStringMin(s []interface{}, min string) (string, error) {
  298. for _, v := range s {
  299. if vs, ok := v.(string); ok {
  300. if min < vs {
  301. min = vs
  302. }
  303. } else if v != nil {
  304. return "", fmt.Errorf("requires string but found %[1]T(%[1]v)", v)
  305. }
  306. }
  307. return min, nil
  308. }
  309. func dedup(r []interface{}, col []interface{}, all bool) (interface{}, error) {
  310. keyset := make(map[string]bool)
  311. result := make([]interface{}, 0)
  312. for i, m := range col {
  313. key := fmt.Sprintf("%v", m)
  314. if _, ok := keyset[key]; !ok {
  315. if all {
  316. result = append(result, r[i])
  317. } else if i == len(col)-1 {
  318. result = append(result, r[i])
  319. }
  320. keyset[key] = true
  321. }
  322. }
  323. if !all {
  324. if len(result) == 0 {
  325. return nil, nil
  326. } else {
  327. return result[0], nil
  328. }
  329. } else {
  330. return result, nil
  331. }
  332. }