#include <Teuchos_HashSet.hpp>
Public Member Functions | |
| HashSet (int capacity=19) | |
| Create an empty HashSet. | |
| bool | containsKey (const Key &key) const |
| Check for the presence of a key. | |
| void | put (const Key &key) |
| Put a new object into the table. | |
| void | remove (const Key &key) |
| Remove from the table the element given by key. | |
| int | size () const |
| Get the number of elements in the table. | |
| Array< Key > | arrayify () const |
| Get list of keys in Array form. | |
| void | arrayify (Array< Key > &keys) const |
| Get list of keys in Array form. | |
| std::string | toString () const |
| Write to a std::string. | |
Related Functions | |
| (Note that these are not member functions.) | |
| std::ostream & | operator<< (std::ostream &os, const HashSet< Key > &h) |
| Write HashSet to a stream. | |
HashSet is a hashtable-based set, similar to the STL set class or the Java HashSet class.
Definition at line 51 of file Teuchos_HashSet.hpp.
| Teuchos::HashSet< Key >::HashSet | ( | int | capacity = 19 |
) | [inline] |
| bool Teuchos::HashSet< Key >::containsKey | ( | const Key & | key | ) | const [inline] |
| void Teuchos::HashSet< Key >::put | ( | const Key & | key | ) | [inline] |
| void Teuchos::HashSet< Key >::remove | ( | const Key & | key | ) | [inline] |
| int Teuchos::HashSet< Key >::size | ( | ) | const [inline] |
| Array< Key > Teuchos::HashSet< Key >::arrayify | ( | ) | const [inline] |
| void Teuchos::HashSet< Key >::arrayify | ( | Array< Key > & | keys | ) | const [inline] |
| std::string Teuchos::HashSet< Key >::toString | ( | ) | const [inline] |
| std::ostream & operator<< | ( | std::ostream & | os, | |
| const HashSet< Key > & | h | |||
| ) | [related] |
1.4.7