|
344 | 344 | return quote |
345 | 345 | op = operators.binops[op_idx] |
346 | 346 | special_operator(op) && |
347 | | - return deg2_eval_special(tree, cX, op, eval_options, operators) |
| 347 | + return deg2_eval_special(tree, cX, operators, op, eval_options) |
348 | 348 | result_l = _eval_tree_array(tree.l, cX, operators, eval_options) |
349 | 349 | !result_l.ok && return result_l |
350 | 350 | @return_on_nonfinite_array(eval_options, result_l.x) |
|
361 | 361 | i -> i == op_idx, |
362 | 362 | i -> let op = operators.binops[i] |
363 | 363 | if special_operator(op) |
364 | | - deg2_eval_special(tree, cX, op, eval_options, operators) |
| 364 | + deg2_eval_special(tree, cX, operators, op, eval_options) |
365 | 365 | elseif tree.l.degree == 0 && tree.r.degree == 0 |
366 | 366 | deg2_l0_r0_eval(tree, cX, op, eval_options) |
367 | 367 | elseif tree.r.degree == 0 |
|
406 | 406 | return quote |
407 | 407 | op = operators.unaops[op_idx] |
408 | 408 | special_operator(op) && |
409 | | - return deg1_eval_special(tree, cX, op, eval_options, operators) |
| 409 | + return deg1_eval_special(tree, cX, operators, op, eval_options) |
410 | 410 | result = _eval_tree_array(tree.l, cX, operators, eval_options) |
411 | 411 | !result.ok && return result |
412 | 412 | @return_on_nonfinite_array(eval_options, result.x) |
|
421 | 421 | i -> i == op_idx, |
422 | 422 | i -> let op = operators.unaops[i] |
423 | 423 | if special_operator(op) |
424 | | - deg1_eval_special(tree, cX, op, eval_options, operators) |
| 424 | + deg1_eval_special(tree, cX, operators, op, eval_options) |
425 | 425 | elseif !$(special_operators) && |
426 | 426 | tree.l.degree == 2 && |
427 | 427 | tree.l.l.degree == 0 && |
|
0 commit comments