diff options
| author | David Blaikie <dblaikie@gmail.com> | 2015-03-03 21:17:08 +0000 |
|---|---|---|
| committer | David Blaikie <dblaikie@gmail.com> | 2015-03-03 21:17:08 +0000 |
| commit | bb8da4c08fbe6380195c61d134b149a4f4ade037 (patch) | |
| tree | a1f321993e16ff8b26483f6de68cefc234e779f3 /llvm/unittests/ADT/ilistTest.cpp | |
| parent | e29d3963931e0a03100e88a23569eef6e84c4247 (diff) | |
| download | bcm5719-llvm-bb8da4c08fbe6380195c61d134b149a4f4ade037.tar.gz bcm5719-llvm-bb8da4c08fbe6380195c61d134b149a4f4ade037.zip | |
Remove the explicit SDNodeIterator::operator= in favor of the implicit default
There doesn't seem to be any need to assert that iterator assignment is
between iterators over the same node - if you want to reuse an iterator
variable to iterate another node, that's perfectly acceptable. Just
don't mix comparisons between iterators into disjoint sequences, as
usual.
llvm-svn: 231135
Diffstat (limited to 'llvm/unittests/ADT/ilistTest.cpp')
| -rw-r--r-- | llvm/unittests/ADT/ilistTest.cpp | 4 |
1 files changed, 3 insertions, 1 deletions
diff --git a/llvm/unittests/ADT/ilistTest.cpp b/llvm/unittests/ADT/ilistTest.cpp index 44442ebf75a..40b44ce3ca9 100644 --- a/llvm/unittests/ADT/ilistTest.cpp +++ b/llvm/unittests/ADT/ilistTest.cpp @@ -21,7 +21,9 @@ struct Node : ilist_node<Node> { int Value; Node() {} - Node(int _Value) : Value(_Value) {} + Node(int Value) : Value(Value) {} + Node(const Node&) = default; + Node(Node &&RHS) : Value(RHS.Value) { RHS.Value = -1; } ~Node() { Value = -1; } }; |

