mirror of
https://github.com/rjNemo/exercism-elixir
synced 2026-06-06 02:16:48 +00:00
anagram
This commit is contained in:
parent
c43da91eb3
commit
bcc4a9f076
2 changed files with 9 additions and 16 deletions
|
|
@ -3,6 +3,13 @@ defmodule Anagram do
|
|||
Returns all candidates that are anagrams of, but not equal to, 'base'.
|
||||
"""
|
||||
@spec match(String.t(), [String.t()]) :: [String.t()]
|
||||
def match(base, candidates) do
|
||||
end
|
||||
def match(base, candidates),
|
||||
do:
|
||||
Enum.filter(
|
||||
candidates,
|
||||
&(String.downcase(&1) != String.downcase(base) and
|
||||
to_graphemes(&1) == to_graphemes(base))
|
||||
)
|
||||
|
||||
defp to_graphemes(string), do: String.downcase(string) |> String.graphemes() |> Enum.sort()
|
||||
end
|
||||
|
|
|
|||
|
|
@ -1,85 +1,71 @@
|
|||
defmodule AnagramTest do
|
||||
use ExUnit.Case
|
||||
|
||||
# @tag :pending
|
||||
test "no matches" do
|
||||
matches = Anagram.match("diaper", ~w(hello world zombies pants))
|
||||
assert matches == []
|
||||
end
|
||||
|
||||
@tag :pending
|
||||
test "detects two anagrams" do
|
||||
matches = Anagram.match("solemn", ~w(lemons cherry melons))
|
||||
assert matches == ~w(lemons melons)
|
||||
end
|
||||
|
||||
@tag :pending
|
||||
test "does not detect anagram subsets" do
|
||||
matches = Anagram.match("good", ~w(dog goody))
|
||||
assert matches == []
|
||||
end
|
||||
|
||||
@tag :pending
|
||||
test "detects anagram" do
|
||||
matches = Anagram.match("listen", ~w(enlists google inlets banana))
|
||||
assert matches == ~w(inlets)
|
||||
end
|
||||
|
||||
@tag :pending
|
||||
test "detects three anagrams" do
|
||||
matches = Anagram.match("allergy", ~w(gallery ballerina regally clergy largely leading))
|
||||
assert matches == ~w(gallery regally largely)
|
||||
end
|
||||
|
||||
@tag :pending
|
||||
test "detects multiple anagrams with different case" do
|
||||
matches = Anagram.match("nose", ~w(Eons ONES))
|
||||
assert matches == ~w(Eons ONES)
|
||||
end
|
||||
|
||||
@tag :pending
|
||||
test "does not detect non-anagrams with identical checksum" do
|
||||
matches = Anagram.match("mass", ~w(last))
|
||||
assert matches == []
|
||||
end
|
||||
|
||||
@tag :pending
|
||||
test "detect anagrams case-insensitively" do
|
||||
matches = Anagram.match("orchestra", ~w(cashregister Carthorse radishes))
|
||||
assert matches == ~w(Carthorse)
|
||||
end
|
||||
|
||||
@tag :pending
|
||||
test "detects anagrams using case-insensitive subject" do
|
||||
matches = Anagram.match("Orchestra", ~w(cashregister carthorse radishes))
|
||||
assert matches == ~w(carthorse)
|
||||
end
|
||||
|
||||
@tag :pending
|
||||
test "detects anagrams using case-insensitive possible matches" do
|
||||
matches = Anagram.match("orchestra", ~w(cashregister Carthorse radishes))
|
||||
assert matches == ~w(Carthorse)
|
||||
end
|
||||
|
||||
@tag :pending
|
||||
test "does not detect an anagram if the original word is repeated" do
|
||||
matches = Anagram.match("go", ~w(go Go GO))
|
||||
assert matches == []
|
||||
end
|
||||
|
||||
@tag :pending
|
||||
test "anagrams must use all letters exactly once" do
|
||||
matches = Anagram.match("tapper", ~w(patter))
|
||||
assert matches == []
|
||||
end
|
||||
|
||||
@tag :pending
|
||||
test "words are not anagrams of themselves (case-insensitive)" do
|
||||
matches = Anagram.match("BANANA", ~w(BANANA Banana banana))
|
||||
assert matches == []
|
||||
end
|
||||
|
||||
@tag :pending
|
||||
test "words other than themselves can be anagrams" do
|
||||
matches = Anagram.match("LISTEN", ~w(Listen Silent LISTEN))
|
||||
assert matches == ~w(Silent)
|
||||
|
|
|
|||
Loading…
Reference in a new issue