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 trial

Python Python Testing Be Assertive assertRaises

Now add a new test, test_no_args that should also assertRaises(ValueError). This time, call get_anagrams() with no argum

keeps saying "Oops!! It looks like Task 1 is no longer passing",, i am stuck ,help please

tests.py
import unittest

from string_fun import get_anagrams


class AnagramTestCase(unittest.TestCase):
    def test_empty_string(self):

        with self.assertRaises(ValueError):
            get_anagrams()
        pass
    def test_no_args(self):
        with self.assertRaises(ValueError):
            get_anagrams()
string_fun.py
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

Chris Freeman
MOD
Chris Freeman
Treehouse Moderator 68,441 Points

The call to get_anagrams() In the test test_empty_string, the call to get_anagrams() is missing the actual empty string ""

Edit: Also, the pass statement is no longer needed and should be removed for clarity.

Edit2: Typo fix

Did you mean get_anagrams()? :laughing:

Chris Freeman
Chris Freeman
Treehouse Moderator 68,441 Points

Yikes! Will edit to fix! Pitfalls of answering questions via iPhone!

Yeah, the iPhone keyboard is awful. I always use Treehouse on a desktop computer :smiley:

Sometimes, I just hate the word completion thing on the iPhone keyboard. Other times, I love it. :laughing:

You still have a typo :laughing: :laughing: :laughing:

Time for an edit 3 xD