Welcome to the Treehouse Community
Want to collaborate on code errors? Have bugs you need feedback on? Looking for an extra set of eyes on your latest project? Get support with fellow developers, designers, and programmers of all backgrounds and skill levels here with the Treehouse Community! While you're at it, check out some resources Treehouse students have shared here.
Looking to learn something new?
Treehouse offers a seven day free trial for new students. Get access to thousands of hours of content and join thousands of Treehouse students and alumni in the community today.
Start your free trialfrankgenova
Python Web Development Techdegree Student 15,616 PointsPython Testing assertRaises challenge 2 of 2 fails with looks like Task 1 is no longer passing
I continue to get the error that task 1 is no longer passing when I submit code on task 2 of 2. This is even though I do not change the code for task 1 and despite the fact that it looks like it should work and is similar to answers given in forum posts?
import unittest
from string_fun import get_anagrams
class AnagramTestCase(unittest.TestCase):
def test_empty_string(self):
with self.assertRaises(ValueError):
self.get_anagrams("")
def test_no_args(unittest.TestCase):
with self.assertRaises(ValueError):
self.get_anagrams()
import itertools
def is_palindrome(yarn):
"""Return whether or not a string is a palindrome.
A palindrome is a word/phrase that's the same in
both directions.
"""
return yarn == yarn[::-1]
def get_anagrams(*yarn):
"""Return a list of anagrams for a string."""
# If only one letter came in, return it
if yarn:
if len(yarn[0]) == 1:
return list(yarn)
elif len(yarn[0] == 0):
raise ValueError("Must provide at least two letters")
else:
raise ValueError("Must provide at least two letters")
# Get all of the words from the dictionary
words = set([
w.strip().lower() for w in open('words.txt')
])
output = set()
for thread in yarn:
thread = thread.lower()
# Find all possible anagrams
for i in range(2, len(thread)):
fibers = set(
[''.join(w) for w in itertools.permutations(thread, i)]
)
output.update(fibers.intersection(words))
# Finally, return all of the combinations that are in the dictionary
return sorted(list(output))
1 Answer
Steven Parker
231,236 PointsA syntax error invalidates the entire program, and the challenge re-checks the tasks in order, so you can get that message from just adding new code.
And if you use the previous test as an example, you'll see it takes "self" as an argument (not "unittest.TestCase").