return OK;
// Handle a bitwise left or right shift operator
- if (rettv->v_type != VAR_NUMBER)
+ evaluate = evalarg == NULL ? 0 : (evalarg->eval_flags & EVAL_EVALUATE);
+ if (evaluate && rettv->v_type != VAR_NUMBER)
{
// left operand should be a number
emsg(_(e_bitshift_ops_must_be_number));
return FAIL;
}
- evaluate = evalarg == NULL ? 0 : (evalarg->eval_flags & EVAL_EVALUATE);
vim9script = in_vim9script();
if (getnext)
{
return FAIL;
}
- if (var2.v_type != VAR_NUMBER || var2.vval.v_number < 0)
- {
- // right operand should be a positive number
- if (var2.v_type != VAR_NUMBER)
- emsg(_(e_bitshift_ops_must_be_number));
- else
- emsg(_(e_bitshift_ops_must_be_positive));
- clear_tv(rettv);
- clear_tv(&var2);
- return FAIL;
- }
-
if (evaluate)
{
+ if (var2.v_type != VAR_NUMBER || var2.vval.v_number < 0)
+ {
+ // right operand should be a positive number
+ if (var2.v_type != VAR_NUMBER)
+ emsg(_(e_bitshift_ops_must_be_number));
+ else
+ emsg(_(e_bitshift_ops_must_be_positive));
+ clear_tv(rettv);
+ clear_tv(&var2);
+ return FAIL;
+ }
+
if (var2.vval.v_number > MAX_LSHIFT_BITS)
// shifting more bits than we have always results in zero
rettv->vval.v_number = 0;
assert_equal(16, a)
END
call v9.CheckDefAndScriptSuccess(lines)
+
+ let lines =<< trim END
+ # Use in a lambda function
+ const DivBy2Ref_A = (n: number): number => n >> 1
+ assert_equal(16, DivBy2Ref_A(32))
+ const DivBy2Ref_B = (n: number): number => (<number>n) >> 1
+ assert_equal(16, DivBy2Ref_B(32))
+ const MultBy2Ref_A = (n: number): number => n << 1
+ assert_equal(8, MultBy2Ref_A(4))
+ const MultBy2Ref_B = (n: number): number => (<number>n) << 1
+ assert_equal(8, MultBy2Ref_B(4))
+
+ def DivBy2_A(): func(number): number
+ return (n: number): number => n >> 1
+ enddef
+ assert_equal(16, DivBy2_A()(32))
+ def DivBy2_B(): func(number): number
+ return (n: number): number => (<number>n) >> 1
+ enddef
+ assert_equal(16, DivBy2_B()(32))
+ def MultBy2_A(): func(number): number
+ return (n: number): number => n << 1
+ enddef
+ assert_equal(64, MultBy2_A()(32))
+ def MultBy2_B(): func(number): number
+ return (n: number): number => (<number>n) << 1
+ enddef
+ assert_equal(64, MultBy2_B()(32))
+ END
+ call v9.CheckDefAndScriptSuccess(lines)
+
+ " Use in a legacy lambda function
+ const DivBy2Ref_A = {n -> n >> 1}
+ call assert_equal(16, DivBy2Ref_A(32))
+ func DivBy2_A()
+ return {n -> n >> 1}
+ endfunc
+ call assert_equal(16, DivBy2_A()(32))
+ const MultBy2Ref_A = {n -> n << 1}
+ call assert_equal(64, MultBy2Ref_A(32))
+ func MultBy2_A()
+ return {n -> n << 1}
+ endfunc
+ call assert_equal(64, MultBy2_A()(32))
endfunc
" vim: shiftwidth=2 sts=2 expandtab