diff options
author | Craig Topper <craig.topper@gmail.com> | 2014-04-28 04:05:08 +0000 |
---|---|---|
committer | Craig Topper <craig.topper@gmail.com> | 2014-04-28 04:05:08 +0000 |
commit | c34a25d59d382aa00a94b3f0603ce8724c66606d (patch) | |
tree | 183fcfd0dfc47544b17e5a6c3b3281fb5bfca3c4 /include/llvm/ADT/EquivalenceClasses.h | |
parent | 1c5e4e50211ad2a8024c28fa0237a8026ba51f8f (diff) | |
download | llvm-c34a25d59d382aa00a94b3f0603ce8724c66606d.tar.gz llvm-c34a25d59d382aa00a94b3f0603ce8724c66606d.tar.bz2 llvm-c34a25d59d382aa00a94b3f0603ce8724c66606d.tar.xz |
[C++] Use 'nullptr'.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@207394 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'include/llvm/ADT/EquivalenceClasses.h')
-rw-r--r-- | include/llvm/ADT/EquivalenceClasses.h | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/include/llvm/ADT/EquivalenceClasses.h b/include/llvm/ADT/EquivalenceClasses.h index f50992ee60..e0396c7e79 100644 --- a/include/llvm/ADT/EquivalenceClasses.h +++ b/include/llvm/ADT/EquivalenceClasses.h @@ -86,14 +86,14 @@ class EquivalenceClasses { } void setNext(const ECValue *NewNext) const { - assert(getNext() == 0 && "Already has a next pointer!"); + assert(getNext() == nullptr && "Already has a next pointer!"); Next = (const ECValue*)((intptr_t)NewNext | (intptr_t)isLeader()); } public: ECValue(const ECValue &RHS) : Leader(this), Next((ECValue*)(intptr_t)1), Data(RHS.Data) { // Only support copying of singleton nodes. - assert(RHS.isLeader() && RHS.getNext() == 0 && "Not a singleton!"); + assert(RHS.isLeader() && RHS.getNext() == nullptr && "Not a singleton!"); } bool operator<(const ECValue &UFN) const { return Data < UFN.Data; } @@ -251,13 +251,13 @@ public: explicit member_iterator(const ECValue *N) : Node(N) {} reference operator*() const { - assert(Node != 0 && "Dereferencing end()!"); + assert(Node != nullptr && "Dereferencing end()!"); return Node->getData(); } reference operator->() const { return operator*(); } member_iterator &operator++() { - assert(Node != 0 && "++'d off the end of the list!"); + assert(Node != nullptr && "++'d off the end of the list!"); Node = Node->getNext(); return *this; } |