Chromium Code Reviews| Index: core/src/fxcrt/fx_basic_maps.cpp |
| diff --git a/core/src/fxcrt/fx_basic_maps.cpp b/core/src/fxcrt/fx_basic_maps.cpp |
| index aadeb15cb4fc894b24e80f06d2ac5ee2341fd157..c2b1c4c9c921d7f25a7912b732c28a903e1cdbdd 100644 |
| --- a/core/src/fxcrt/fx_basic_maps.cpp |
| +++ b/core/src/fxcrt/fx_basic_maps.cpp |
| @@ -34,15 +34,15 @@ FX_DWORD CFX_MapPtrToPtr::HashKey(void* key) const { |
| void CFX_MapPtrToPtr::GetNextAssoc(FX_POSITION& rNextPosition, |
| void*& rKey, |
| void*& rValue) const { |
| - ASSERT(m_pHashTable != NULL); |
| + ASSERT(m_pHashTable); |
| CAssoc* pAssocRet = (CAssoc*)rNextPosition; |
| - ASSERT(pAssocRet != NULL); |
| + ASSERT(pAssocRet); |
| if (pAssocRet == (CAssoc*)-1) { |
| for (FX_DWORD nBucket = 0; nBucket < m_nHashTableSize; nBucket++) |
| if ((pAssocRet = m_pHashTable[nBucket]) != NULL) { |
|
Tom Sepez
2015/12/14 19:14:11
nit: {} in for statement, not if statement.
Lei Zhang
2015/12/15 01:38:33
Done.
|
| break; |
| } |
| - ASSERT(pAssocRet != NULL); |
| + ASSERT(pAssocRet); |
| } |
| CAssoc* pAssocNext; |
| if ((pAssocNext = pAssocRet->pNext) == NULL) { |
| @@ -95,7 +95,7 @@ CFX_MapPtrToPtr::CAssoc* CFX_MapPtrToPtr::GetAssocAt(void* key, |
| return NULL; |
| } |
| CAssoc* pAssoc; |
| - for (pAssoc = m_pHashTable[nHash]; pAssoc != NULL; pAssoc = pAssoc->pNext) { |
| + for (pAssoc = m_pHashTable[nHash]; pAssoc; pAssoc = pAssoc->pNext) { |
| if (pAssoc->key == key) { |
|
Tom Sepez
2015/12/14 19:14:11
nit: no {} for if
Lei Zhang
2015/12/15 01:38:33
Done.
|
| return pAssoc; |
| } |
| @@ -114,7 +114,7 @@ CFX_MapPtrToPtr::CAssoc* CFX_MapPtrToPtr::NewAssoc() { |
| m_pFreeList = pAssoc; |
| } |
| } |
| - ASSERT(m_pFreeList != NULL); |
| + ASSERT(m_pFreeList); |
|
Tom Sepez
2015/12/14 19:14:11
nit: seg at 119.
Lei Zhang
2015/12/15 01:38:33
Done.
|
| CFX_MapPtrToPtr::CAssoc* pAssoc = m_pFreeList; |
| m_pFreeList = m_pFreeList->pNext; |
| m_nCount++; |
| @@ -140,7 +140,7 @@ FX_BOOL CFX_MapPtrToPtr::RemoveKey(void* key) { |
| CAssoc** ppAssocPrev; |
| ppAssocPrev = &m_pHashTable[HashKey(key) % m_nHashTableSize]; |
| CAssoc* pAssoc; |
| - for (pAssoc = *ppAssocPrev; pAssoc != NULL; pAssoc = pAssoc->pNext) { |
| + for (pAssoc = *ppAssocPrev; pAssoc; pAssoc = pAssoc->pNext) { |
| if (pAssoc->key == key) { |
| *ppAssocPrev = pAssoc->pNext; |
| FreeAssoc(pAssoc); |
| @@ -293,7 +293,7 @@ FX_BOOL CFX_CMapByteStringToPtr::Lookup(const CFX_ByteStringC& key, |
| return TRUE; |
| } |
| void CFX_CMapByteStringToPtr::SetAt(const CFX_ByteStringC& key, void* value) { |
| - ASSERT(value != NULL); |
| + ASSERT(value); |
| int index, key_len = key.GetLength(); |
|
Tom Sepez
2015/12/14 19:14:11
nit: one per line.
Lei Zhang
2015/12/15 01:38:33
Done.
|
| int size = m_Buffer.GetSize(); |
| for (index = 0; index < size; index++) { |
| @@ -319,7 +319,7 @@ void CFX_CMapByteStringToPtr::SetAt(const CFX_ByteStringC& key, void* value) { |
| } |
| void CFX_CMapByteStringToPtr::AddValue(const CFX_ByteStringC& key, |
| void* value) { |
| - ASSERT(value != NULL); |
| + ASSERT(value); |
| _CompactString* pKey = (_CompactString*)m_Buffer.Add(); |
| _CompactStringStore(pKey, key.GetPtr(), key.GetLength()); |
| *(void**)(pKey + 1) = value; |