diff options
author | Argyrios Kyrtzidis <akyrtzi@gmail.com> | 2010-07-12 20:47:08 +0000 |
---|---|---|
committer | Argyrios Kyrtzidis <akyrtzi@gmail.com> | 2010-07-12 20:47:08 +0000 |
commit | c7ff023de4ab3287ebdef708c07ac9d7f077e02d (patch) | |
tree | 82008086fafc5fab338822e4909ecd70df9f823f | |
parent | 51e6d9bbf63cd2dc334fc9ba3e85cd7bf5ca00cb (diff) | |
download | bcm5719-llvm-c7ff023de4ab3287ebdef708c07ac9d7f077e02d.tar.gz bcm5719-llvm-c7ff023de4ab3287ebdef708c07ac9d7f077e02d.zip |
Add convenience method FoldingSetImpl::InsertNode(Node *N) that asserts if the node is already inserted.
llvm-svn: 108192
-rw-r--r-- | llvm/include/llvm/ADT/FoldingSet.h | 8 |
1 files changed, 8 insertions, 0 deletions
diff --git a/llvm/include/llvm/ADT/FoldingSet.h b/llvm/include/llvm/ADT/FoldingSet.h index c03ee5e8d1b..fc8490abf73 100644 --- a/llvm/include/llvm/ADT/FoldingSet.h +++ b/llvm/include/llvm/ADT/FoldingSet.h @@ -166,6 +166,14 @@ public: /// FindNodeOrInsertPos. void InsertNode(Node *N, void *InsertPos); + /// InsertNode - Insert the specified node into the folding set, knowing that + /// it is not already in the folding set. + void InsertNode(Node *N) { + Node *Inserted = GetOrInsertNode(N); + (void)Inserted; + assert(Inserted == N && "Node already inserted!"); + } + /// size - Returns the number of nodes in the folding set. unsigned size() const { return NumNodes; } |