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

TEST_NO_ARG

I cant find any problem with my code.

import unittest

from string_fun import get_anagrams

class AnagramTestCase(unittest.TestCase): def test_empty_string(self): with self.assertRaises(ValueError):get_anagrams("")

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


    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

Steven Parker
Steven Parker
231,172 Points

It looks like you may have overlooked the part of the instructions that say "Important: In each task of this code challenge, the code you write should be added to the code from the previous task."

So the test_empty_string function that was completed in step 1 should remain in the code when the new test_no_args function is added.

Thanks Steven