funcs_aggregate.go 7.7 KB

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