| 51 | } |
| 52 | |
| 53 | func TestOptimize_count_threshold_lt(t *testing.T) { |
| 54 | tree, err := parser.Parse(`count(items, .active) < 100`) |
| 55 | require.NoError(t, err) |
| 56 | |
| 57 | err = optimizer.Optimize(&tree.Node, nil) |
| 58 | require.NoError(t, err) |
| 59 | |
| 60 | // Operator should remain <, but count should have threshold set |
| 61 | binary, ok := tree.Node.(*BinaryNode) |
| 62 | require.True(t, ok, "expected BinaryNode, got %T", tree.Node) |
| 63 | assert.Equal(t, "<", binary.Operator) |
| 64 | |
| 65 | count, ok := binary.Left.(*BuiltinNode) |
| 66 | require.True(t, ok, "expected BuiltinNode, got %T", binary.Left) |
| 67 | assert.Equal(t, "count", count.Name) |
| 68 | require.NotNil(t, count.Threshold) |
| 69 | assert.Equal(t, 100, *count.Threshold) // threshold = N for < operator |
| 70 | } |
| 71 | |
| 72 | func TestOptimize_count_threshold_lte(t *testing.T) { |
| 73 | tree, err := parser.Parse(`count(items, .active) <= 50`) |