funcsAggregate.go 8.4 KB

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