From e9504aed11ed98e53b34e95394631f2f0809fd1c Mon Sep 17 00:00:00 2001
From: Padraic Fanning <fanninpm@miamioh.edu>
Date: Fri, 23 Apr 2021 17:51:27 -0400
Subject: [PATCH] Mark erroring/failing tests

---
 Lib/test/test_weakset.py | 22 ++++++++++++++++++++++
 1 file changed, 22 insertions(+)

diff --git a/Lib/test/test_weakset.py b/Lib/test/test_weakset.py
index 569facdd3..40a3bee49 100644
--- a/Lib/test/test_weakset.py
+++ b/Lib/test/test_weakset.py
@@ -43,6 +43,8 @@ class TestWeakSet(unittest.TestCase):
     def test_new_or_init(self):
         self.assertRaises(TypeError, WeakSet, [], 2)
 
+    # TODO: RUSTPYTHON
+    @unittest.expectedFailure
     def test_len(self):
         self.assertEqual(len(self.s), len(self.d))
         self.assertEqual(len(self.fs), 1)
@@ -58,6 +60,8 @@ class TestWeakSet(unittest.TestCase):
         del self.obj
         self.assertNotIn(ustr('F'), self.fs)
 
+    # TODO: RUSTPYTHON
+    @unittest.expectedFailure
     def test_union(self):
         u = self.s.union(self.items2)
         for c in self.letters:
@@ -80,6 +84,8 @@ class TestWeakSet(unittest.TestCase):
         self.assertEqual(self.s | set(self.items2), i)
         self.assertEqual(self.s | frozenset(self.items2), i)
 
+    # TODO: RUSTPYTHON
+    @unittest.expectedFailure
     def test_intersection(self):
         s = WeakSet(self.letters)
         i = s.intersection(self.items2)
@@ -117,6 +123,8 @@ class TestWeakSet(unittest.TestCase):
         self.assertEqual(self.s - set(self.items2), i)
         self.assertEqual(self.s - frozenset(self.items2), i)
 
+    # TODO: RUSTPYTHON
+    @unittest.expectedFailure
     def test_symmetric_difference(self):
         i = self.s.symmetric_difference(self.items2)
         for c in self.letters:
@@ -192,6 +200,8 @@ class TestWeakSet(unittest.TestCase):
         t = WeakSet(s)
         self.assertNotEqual(id(s), id(t))
 
+    # TODO: RUSTPYTHON
+    @unittest.expectedFailure
     def test_hash(self):
         self.assertRaises(TypeError, hash, self.s)
 
@@ -205,6 +215,8 @@ class TestWeakSet(unittest.TestCase):
         self.assertEqual(self.s, dup)
         self.assertNotEqual(id(self.s), id(dup))
 
+    # TODO: RUSTPYTHON
+    @unittest.expectedFailure
     def test_add(self):
         x = ustr('Q')
         self.s.add(x)
@@ -310,6 +322,8 @@ class TestWeakSet(unittest.TestCase):
             else:
                 self.assertNotIn(c, self.s)
 
+    # TODO: RUSTPYTHON
+    @unittest.expectedFailure
     def test_inplace_on_self(self):
         t = self.s.copy()
         t |= t
@@ -338,6 +352,8 @@ class TestWeakSet(unittest.TestCase):
         s2 = WeakSet()
         self.assertFalse(s1 != s2)
 
+    # TODO: RUSTPYTHON
+    @unittest.expectedFailure
     def test_weak_destroy_while_iterating(self):
         # Issue #7105: iterators shouldn't crash when a key is implicitly removed
         # Create new items to be sure no-one else holds a reference
@@ -354,6 +370,8 @@ class TestWeakSet(unittest.TestCase):
         # The removal has been committed
         self.assertEqual(len(s), len(items))
 
+    # TODO: RUSTPYTHON
+    @unittest.expectedFailure
     def test_weak_destroy_and_mutate_while_iterating(self):
         # Issue #7105: iterators shouldn't crash when a key is implicitly removed
         items = [ustr(c) for c in string.ascii_letters]
@@ -391,6 +409,8 @@ class TestWeakSet(unittest.TestCase):
             s.clear()
         self.assertEqual(len(s), 0)
 
+    # TODO: RUSTPYTHON
+    @unittest.expectedFailure
     def test_len_cycles(self):
         N = 20
         items = [RefCycle() for i in range(N)]
@@ -410,6 +430,8 @@ class TestWeakSet(unittest.TestCase):
         self.assertIn(n1, (0, 1))
         self.assertEqual(n2, 0)
 
+    # TODO: RUSTPYTHON
+    @unittest.expectedFailure
     def test_len_race(self):
         # Extended sanity checks for len() in the face of cyclic collection
         self.addCleanup(gc.set_threshold, *gc.get_threshold())