mirror of
https://github.com/Instagram/LibCST.git
synced 2025-12-23 10:35:53 +00:00
* rm: ci * rm: entry point * fix: tests * fix: remove combine step from ci * linter fixes * omit the _parser * fix newlines * fix: remove optional * fix: linter --------- Co-authored-by: thereversiblewheel <martin.li@uwaterloo.ca>
191 lines
6.4 KiB
Python
191 lines
6.4 KiB
Python
# Copyright (c) Meta Platforms, Inc. and affiliates.
|
|
#
|
|
# This source code is licensed under the MIT license found in the
|
|
# LICENSE file in the root directory of this source tree.
|
|
|
|
from typing import Any
|
|
|
|
import libcst as cst
|
|
from libcst import parse_expression
|
|
from libcst._nodes.tests.base import CSTNodeTest
|
|
from libcst.metadata import CodeRange
|
|
from libcst.testing.utils import data_provider
|
|
|
|
|
|
class BinaryOperationTest(CSTNodeTest):
|
|
@data_provider(
|
|
(
|
|
# Simple binary operations
|
|
{
|
|
"node": cst.BinaryOperation(
|
|
cst.Name("foo"), cst.Add(), cst.Float("5.5")
|
|
),
|
|
"code": "foo + 5.5",
|
|
"parser": parse_expression,
|
|
"expected_position": None,
|
|
},
|
|
{
|
|
"node": cst.BinaryOperation(
|
|
cst.Name("foo"), cst.Subtract(), cst.Float("5.5")
|
|
),
|
|
"code": "foo - 5.5",
|
|
"parser": parse_expression,
|
|
"expected_position": None,
|
|
},
|
|
{
|
|
"node": cst.BinaryOperation(
|
|
cst.Name("foo"), cst.LeftShift(), cst.Integer("5")
|
|
),
|
|
"code": "foo << 5",
|
|
"parser": parse_expression,
|
|
"expected_position": None,
|
|
},
|
|
{
|
|
"node": cst.BinaryOperation(
|
|
cst.Name("foo"), cst.RightShift(), cst.Integer("5")
|
|
),
|
|
"code": "foo >> 5",
|
|
"parser": parse_expression,
|
|
"expected_position": None,
|
|
},
|
|
{
|
|
"node": cst.BinaryOperation(
|
|
cst.Name("foo"), cst.BitAnd(), cst.Name("bar")
|
|
),
|
|
"code": "foo & bar",
|
|
"parser": parse_expression,
|
|
"expected_position": None,
|
|
},
|
|
{
|
|
"node": cst.BinaryOperation(
|
|
cst.Name("foo"), cst.BitXor(), cst.Name("bar")
|
|
),
|
|
"code": "foo ^ bar",
|
|
"parser": parse_expression,
|
|
"expected_position": None,
|
|
},
|
|
{
|
|
"node": cst.BinaryOperation(
|
|
cst.Name("foo"), cst.BitOr(), cst.Name("bar")
|
|
),
|
|
"code": "foo | bar",
|
|
"parser": parse_expression,
|
|
"expected_position": None,
|
|
},
|
|
{
|
|
"node": cst.BinaryOperation(
|
|
cst.Name("foo"), cst.Multiply(), cst.Float("5.5")
|
|
),
|
|
"code": "foo * 5.5",
|
|
"parser": parse_expression,
|
|
"expected_position": None,
|
|
},
|
|
{
|
|
"node": cst.BinaryOperation(
|
|
cst.Name("foo"), cst.MatrixMultiply(), cst.Float("5.5")
|
|
),
|
|
"code": "foo @ 5.5",
|
|
"parser": parse_expression,
|
|
"expected_position": None,
|
|
},
|
|
{
|
|
"node": cst.BinaryOperation(
|
|
cst.Name("foo"), cst.Divide(), cst.Float("5.5")
|
|
),
|
|
"code": "foo / 5.5",
|
|
"parser": parse_expression,
|
|
"expected_position": None,
|
|
},
|
|
{
|
|
"node": cst.BinaryOperation(
|
|
cst.Name("foo"), cst.Modulo(), cst.Float("5.5")
|
|
),
|
|
"code": "foo % 5.5",
|
|
"parser": parse_expression,
|
|
"expected_position": None,
|
|
},
|
|
{
|
|
"node": cst.BinaryOperation(
|
|
cst.Name("foo"), cst.FloorDivide(), cst.Float("5.5")
|
|
),
|
|
"code": "foo // 5.5",
|
|
"parser": parse_expression,
|
|
"expected_position": None,
|
|
},
|
|
# Parenthesized binary operation
|
|
{
|
|
"node": cst.BinaryOperation(
|
|
lpar=(cst.LeftParen(),),
|
|
left=cst.Name("foo"),
|
|
operator=cst.LeftShift(),
|
|
right=cst.Integer("5"),
|
|
rpar=(cst.RightParen(),),
|
|
),
|
|
"code": "(foo << 5)",
|
|
"parser": parse_expression,
|
|
"expected_position": None,
|
|
},
|
|
# Make sure that spacing works
|
|
{
|
|
"node": cst.BinaryOperation(
|
|
lpar=(cst.LeftParen(whitespace_after=cst.SimpleWhitespace(" ")),),
|
|
left=cst.Name("foo"),
|
|
operator=cst.Multiply(
|
|
whitespace_before=cst.SimpleWhitespace(" "),
|
|
whitespace_after=cst.SimpleWhitespace(" "),
|
|
),
|
|
right=cst.Name("bar"),
|
|
rpar=(cst.RightParen(whitespace_before=cst.SimpleWhitespace(" ")),),
|
|
),
|
|
"code": "( foo * bar )",
|
|
"parser": parse_expression,
|
|
"expected_position": CodeRange((1, 2), (1, 13)),
|
|
},
|
|
)
|
|
)
|
|
def test_valid(self, **kwargs: Any) -> None:
|
|
self.validate_node(**kwargs)
|
|
|
|
@data_provider(
|
|
(
|
|
{
|
|
"get_node": (
|
|
lambda: cst.BinaryOperation(
|
|
cst.Name("foo"),
|
|
cst.Add(),
|
|
cst.Name("bar"),
|
|
lpar=(cst.LeftParen(),),
|
|
)
|
|
),
|
|
"expected_re": "left paren without right paren",
|
|
},
|
|
{
|
|
"get_node": (
|
|
lambda: cst.BinaryOperation(
|
|
cst.Name("foo"),
|
|
cst.Add(),
|
|
cst.Name("bar"),
|
|
rpar=(cst.RightParen(),),
|
|
)
|
|
),
|
|
"expected_re": "right paren without left paren",
|
|
},
|
|
)
|
|
)
|
|
def test_invalid(self, **kwargs: Any) -> None:
|
|
self.assert_invalid(**kwargs)
|
|
|
|
@data_provider(
|
|
(
|
|
{
|
|
"code": '"a"' * 6000,
|
|
"parser": parse_expression,
|
|
},
|
|
{
|
|
"code": "[_" + " for _ in _" * 6000 + "]",
|
|
"parser": parse_expression,
|
|
},
|
|
)
|
|
)
|
|
def test_parse_error(self, **kwargs: Any) -> None:
|
|
self.assert_parses(**kwargs, expect_success=False)
|