Return true if s1 is an Anagram of s2.
Equal arguments are not considered to be an anagrams of each other.
TODO: Is there a faster way of calculating anagrams? TODO: Allow const input TODO: Move to Phobos std.algorithm.sorting. TODO: Should requirement isInputRange be relaxed?
Note that implementations in http://rosettacode.org/wiki/Anagrams#D doesn't correctly handle multi-byte encoded characters in string and wstring.
See Implementation
Return true if s1 is an Anagram of s2.
Equal arguments are not considered to be an anagrams of each other.
TODO: Is there a faster way of calculating anagrams? TODO: Allow const input TODO: Move to Phobos std.algorithm.sorting. TODO: Should requirement isInputRange be relaxed?
Note that implementations in http://rosettacode.org/wiki/Anagrams#D doesn't correctly handle multi-byte encoded characters in string and wstring.