FilesExpand file tree

 master

/

in_array.go

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

65 lines (58 loc) · 1.43 KB

 master

/

in_array.go

Copy path

Top

File metadata and controls

• Code
• Blame

65 lines (58 loc) · 1.43 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

64

65

package optimizer

import (

"reflect"

. "github.com/antonmedv/expr/ast"

)

type inArray struct{}

func (*inArray) Enter(*Node) {}

func (*inArray) Exit(node *Node) {

switch n := (*node).(type) {

case *BinaryNode:

if n.Operator == "in" || n.Operator == "not in" {

if array, ok := n.Right.(*ArrayNode); ok {

if len(array.Nodes) > 0 {

t := n.Left.Type()

if t == nil || t.Kind() != reflect.Int {

// This optimization can be only performed if left side is int type,

// as runtime.in func uses reflect.Map.MapIndex and keys of map must,

// be same as checked value type.

goto string

}

for _, a := range array.Nodes {

if _, ok := a.(*IntegerNode); !ok {

goto string

}

}

{

value := make(map[int]struct{})

for _, a := range array.Nodes {

value[a.(*IntegerNode).Value] = struct{}{}

}

Patch(node, &BinaryNode{

Operator: n.Operator,

Left: n.Left,

Right: &ConstantNode{Value: value},

})

}

string:

for _, a := range array.Nodes {

if _, ok := a.(*StringNode); !ok {

return

}

}

{

value := make(map[string]struct{})

for _, a := range array.Nodes {

value[a.(*StringNode).Value] = struct{}{}

}

Patch(node, &BinaryNode{

Operator: n.Operator,

Left: n.Left,

Right: &ConstantNode{Value: value},

})

}

}

}

}

}

}