inline Value* HashTable<Key, Value, Extractor, HashFunctions, Traits, KeyTraits>::lookup(const T& key)
{
ASSERT(m_table);
-#if !ASSERT_DISABLED && false
+#if !ASSERT_DISABLED && 0
if (HashFunctions::safeToCompareToEmptyOrDeleted) {
ASSERT(!HashTranslator::equal(KeyTraits::emptyValue(), key));
ASSERT(!HashTranslator::equal(KeyTraits::deletedValue(), key));
inline typename HashTable<Key, Value, Extractor, HashFunctions, Traits, KeyTraits>::LookupType HashTable<Key, Value, Extractor, HashFunctions, Traits, KeyTraits>::lookupForWriting(const T& key)
{
ASSERT(m_table);
-#if !ASSERT_DISABLED && false
+#if !ASSERT_DISABLED && 0
if (HashFunctions::safeToCompareToEmptyOrDeleted) {
ASSERT(!HashTranslator::equal(KeyTraits::emptyValue(), key));
ASSERT(!HashTranslator::equal(KeyTraits::deletedValue(), key));
inline typename HashTable<Key, Value, Extractor, HashFunctions, Traits, KeyTraits>::FullLookupType HashTable<Key, Value, Extractor, HashFunctions, Traits, KeyTraits>::fullLookupForWriting(const T& key)
{
ASSERT(m_table);
-#if !ASSERT_DISABLED && false
+#if !ASSERT_DISABLED && 0
if (HashFunctions::safeToCompareToEmptyOrDeleted) {
ASSERT(!HashTranslator::equal(KeyTraits::emptyValue(), key));
ASSERT(!HashTranslator::equal(KeyTraits::deletedValue(), key));
template<typename T, typename Extra, typename HashTranslator>
inline pair<typename HashTable<Key, Value, Extractor, HashFunctions, Traits, KeyTraits>::iterator, bool> HashTable<Key, Value, Extractor, HashFunctions, Traits, KeyTraits>::add(const T& key, const Extra& extra)
{
-#if !ASSERT_DISABLED && false
+#if !ASSERT_DISABLED && 0
if (HashFunctions::safeToCompareToEmptyOrDeleted) {
ASSERT(!HashTranslator::equal(KeyTraits::emptyValue(), key));
ASSERT(!HashTranslator::equal(KeyTraits::deletedValue(), key));