forked from openkylin/astroid
127 lines
4.1 KiB
Python
127 lines
4.1 KiB
Python
# Copyright (c) 2008-2010, 2013 LOGILAB S.A. (Paris, FRANCE) <contact@logilab.fr>
|
|
# Copyright (c) 2014 Google, Inc.
|
|
# Copyright (c) 2015-2016, 2018, 2020 Claudiu Popa <pcmanticore@gmail.com>
|
|
# Copyright (c) 2016 Ceridwen <ceridwenv@gmail.com>
|
|
# Copyright (c) 2016 Dave Baum <dbaum@google.com>
|
|
# Copyright (c) 2019 Ashley Whetter <ashley@awhetter.co.uk>
|
|
# Copyright (c) 2020-2021 hippo91 <guillaume.peillex@gmail.com>
|
|
# Copyright (c) 2021 Pierre Sassoulas <pierre.sassoulas@gmail.com>
|
|
# Copyright (c) 2021 Marc Mueller <30130371+cdce8p@users.noreply.github.com>
|
|
|
|
# Licensed under the LGPL: https://www.gnu.org/licenses/old-licenses/lgpl-2.1.en.html
|
|
# For details: https://github.com/PyCQA/astroid/blob/main/LICENSE
|
|
|
|
import unittest
|
|
|
|
from astroid import Uninferable, builder, nodes
|
|
from astroid.exceptions import InferenceError
|
|
|
|
|
|
class InferenceUtil(unittest.TestCase):
|
|
def test_not_exclusive(self) -> None:
|
|
module = builder.parse(
|
|
"""
|
|
x = 10
|
|
for x in range(5):
|
|
print (x)
|
|
|
|
if x > 0:
|
|
print ('#' * x)
|
|
""",
|
|
__name__,
|
|
__file__,
|
|
)
|
|
xass1 = module.locals["x"][0]
|
|
assert xass1.lineno == 2
|
|
xnames = [n for n in module.nodes_of_class(nodes.Name) if n.name == "x"]
|
|
assert len(xnames) == 3
|
|
assert xnames[1].lineno == 6
|
|
self.assertEqual(nodes.are_exclusive(xass1, xnames[1]), False)
|
|
self.assertEqual(nodes.are_exclusive(xass1, xnames[2]), False)
|
|
|
|
def test_if(self) -> None:
|
|
module = builder.parse(
|
|
"""
|
|
if 1:
|
|
a = 1
|
|
a = 2
|
|
elif 2:
|
|
a = 12
|
|
a = 13
|
|
else:
|
|
a = 3
|
|
a = 4
|
|
"""
|
|
)
|
|
a1 = module.locals["a"][0]
|
|
a2 = module.locals["a"][1]
|
|
a3 = module.locals["a"][2]
|
|
a4 = module.locals["a"][3]
|
|
a5 = module.locals["a"][4]
|
|
a6 = module.locals["a"][5]
|
|
self.assertEqual(nodes.are_exclusive(a1, a2), False)
|
|
self.assertEqual(nodes.are_exclusive(a1, a3), True)
|
|
self.assertEqual(nodes.are_exclusive(a1, a5), True)
|
|
self.assertEqual(nodes.are_exclusive(a3, a5), True)
|
|
self.assertEqual(nodes.are_exclusive(a3, a4), False)
|
|
self.assertEqual(nodes.are_exclusive(a5, a6), False)
|
|
|
|
def test_try_except(self) -> None:
|
|
module = builder.parse(
|
|
"""
|
|
try:
|
|
def exclusive_func2():
|
|
"docstring"
|
|
except TypeError:
|
|
def exclusive_func2():
|
|
"docstring"
|
|
except:
|
|
def exclusive_func2():
|
|
"docstring"
|
|
else:
|
|
def exclusive_func2():
|
|
"this one redefine the one defined line 42"
|
|
"""
|
|
)
|
|
f1 = module.locals["exclusive_func2"][0]
|
|
f2 = module.locals["exclusive_func2"][1]
|
|
f3 = module.locals["exclusive_func2"][2]
|
|
f4 = module.locals["exclusive_func2"][3]
|
|
self.assertEqual(nodes.are_exclusive(f1, f2), True)
|
|
self.assertEqual(nodes.are_exclusive(f1, f3), True)
|
|
self.assertEqual(nodes.are_exclusive(f1, f4), False)
|
|
self.assertEqual(nodes.are_exclusive(f2, f4), True)
|
|
self.assertEqual(nodes.are_exclusive(f3, f4), True)
|
|
self.assertEqual(nodes.are_exclusive(f3, f2), True)
|
|
|
|
self.assertEqual(nodes.are_exclusive(f2, f1), True)
|
|
self.assertEqual(nodes.are_exclusive(f4, f1), False)
|
|
self.assertEqual(nodes.are_exclusive(f4, f2), True)
|
|
|
|
def test_unpack_infer_uninferable_nodes(self) -> None:
|
|
node = builder.extract_node(
|
|
"""
|
|
x = [A] * 1
|
|
f = [x, [A] * 2]
|
|
f
|
|
"""
|
|
)
|
|
inferred = next(node.infer())
|
|
unpacked = list(nodes.unpack_infer(inferred))
|
|
self.assertEqual(len(unpacked), 3)
|
|
self.assertTrue(all(elt is Uninferable for elt in unpacked))
|
|
|
|
def test_unpack_infer_empty_tuple(self) -> None:
|
|
node = builder.extract_node(
|
|
"""
|
|
()
|
|
"""
|
|
)
|
|
inferred = next(node.infer())
|
|
with self.assertRaises(InferenceError):
|
|
list(nodes.unpack_infer(inferred))
|
|
|
|
|
|
if __name__ == "__main__":
|
|
unittest.main()
|