Algorithm for testing if two strings of the form /[A-Z][a-z]*/ are anagrams

gistfile1.coffee

isAnagram = (a,b)->
	if a.length != b.length
		return false
	[a,b] = [a,b].map (x)->x.toLowerCase().split('')
	length = a.length
	if length > 12852
		throw new Error "This algorithm can only reliably handle strings smaller than 12,852 characters"
	anagramHash = (hash, letter)->
		charCode = letter.charCodeAt(0)-96
		if !(1 <= charCode <= 26)
			throw new Error "This algorithm is for the purpose of comparing strings of the form /[A-Za-z]*/"
		hash+(length*charCode)
	a.reduce(anagramHash, 0) == b.reduce(anagramHash, 0)