hash_t NoCaseComparer<JsUtil::CharacterBuffer<WCHAR>>::GetHashCode(JsUtil::CharacterBuffer<WCHAR> const& s1)
{
const char16* s = s1.GetBuffer();
size_t length = s1.GetLength();
hash_t hash = CC_HASH_OFFSET_VALUE;
for (size_t i = 0; i < length; i++)
{
CC_HASH_LOGIC(hash, tolower(s[i]));
}
return ((hash & 0x7fffffff) << 1) | 1;
}
uint NoCaseComparer<JsUtil::CharacterBuffer<WCHAR>>::GetHashCode(JsUtil::CharacterBuffer<WCHAR> const& s1)
{
const char16* s = s1.GetBuffer();
size_t length = s1.GetLength();
uint hash = 0;
for (size_t i = 0; i < length; i++)
{
hash = _rotl(hash, 7);
hash ^= tolower(s[i]);
}
return ((hash & 0x7fffffff) << 1) | 1;
}
int NoCaseComparer<JsUtil::CharacterBuffer<WCHAR>>::Compare(JsUtil::CharacterBuffer<WCHAR> const& s1, JsUtil::CharacterBuffer<WCHAR> const& s2)
{
if (s1.GetLength() != s2.GetLength()) return +1;
int count = s1.GetLength();
const char16* buf1 = s1.GetBuffer();
const char16* buf2 = s2.GetBuffer();
for (int i=0; i < count; i++)
{
if (tolower(buf1[i]) != tolower(buf2[i]))
{
return (buf1[i] < buf2[i] ? -1 : +1);
}
}
return (0);
}
bool NoCaseComparer<JsUtil::CharacterBuffer<WCHAR>>::Equals(JsUtil::CharacterBuffer<WCHAR> const& s1, JsUtil::CharacterBuffer<WCHAR> const& s2)
{
return (s1.GetLength() == s2.GetLength()) && (NoCaseComparer<JsUtil::CharacterBuffer<WCHAR>>::Compare(s1, s2)==0);
}