tests: refactor constant folding tests

[itchyny]

As the title says, I refactored the constant folding tests.

[wader]

Do we constant fold and/or with constants? unary operators? something else?

[itchyny]

We don't, unfortunately.

 $ jq -n --debug-dump-disasm 'false and false'
0000 TOP
0001 DUP
0002 LOADK false
0004 JUMP_F 0019
0006 POP
0007 LOADK false
0009 JUMP_F 0015
0011 LOADK true
0013 JUMP 0017
0015 LOADK false
0017 JUMP 0022
0019 POP
0020 LOADK false
0022 RET

false

 $ jq -n --debug-dump-disasm 'false or false'
0000 TOP
0001 DUP
0002 LOADK false
0004 JUMP_F 0011
0006 POP
0007 LOADK true
0009 JUMP 0022
0011 POP
0012 LOADK false
0014 JUMP_F 0020
0016 LOADK true
0018 JUMP 0022
0020 LOADK false
0022 RET

false

 $ jq -n --debug-dump-disasm '(-1)'
0000 TOP
0001 LOADK 1
0003 CALL_BUILTIN _negate
0006 RET

-1

[itchyny]

jq/src/parser.y

Lines 202 to 231 in 588ff18

	static block constant_fold(block a, block b, int op) {
	if (!block_is_single(a) || !block_is_const(a) ||
	!block_is_single(b) || !block_is_const(b))
	return gen_noop();
	jv jv_a = block_const(a);
	block_free(a);
	jv jv_b = block_const(b);
	block_free(b);
	jv res = jv_invalid();
	switch (op) {
	case '+': res = binop_plus(jv_a, jv_b); break;
	case '-': res = binop_minus(jv_a, jv_b); break;
	case '*': res = binop_multiply(jv_a, jv_b); break;
	case '/': res = binop_divide(jv_a, jv_b); break;
	case '%': res = binop_mod(jv_a, jv_b); break;
	case EQ: res = binop_equal(jv_a, jv_b); break;
	case NEQ: res = binop_notequal(jv_a, jv_b); break;
	case '<': res = binop_less(jv_a, jv_b); break;
	case '>': res = binop_greater(jv_a, jv_b); break;
	case LESSEQ: res = binop_lesseq(jv_a, jv_b); break;
	case GREATEREQ: res = binop_greatereq(jv_a, jv_b); break;
	}
	if (jv_is_valid(res))
	return gen_const(res);
	return gen_error(jv_invalid_get_msg(res));
	}

[wader]

Thanks for digging, at lest for and/or i guess it's very uncommon that filters in practice have such constant expressions