This class is the combination of std::set and hash_set.
By setting database handles of DB_BTREE or DB_HASH type, you will be using the equivalent of std::set or hash_set. This container stores the key in the key element of a key/data pair in the underlying database, but doesn't store anything in the data element. Database and environment handle requirement: The same as that of db_map .
| Member | Description | 
|---|---|
| db_set | Create a std::set/hash_set equivalent associative container. | 
| ~db_set | |
| insert | Insert a single key/data pair if the key is not in the container. | 
| operator= | Container content assignment operator. | 
| value_comp | Get value comparison functor. | 
| swap | Swap content with another container. | 
| operator== | Set content equality comparison operator. | 
| operator!= | Inequality comparison operator. | 
db_set(Db *dbp=NULL,
    DbEnv *envp=NULL)
 
          Create a std::set/hash_set equivalent associative container.
See the handle requirement in class details to pass correct database/environment handles.
db_set(Db *dbp, DbEnv *envp, InputIterator first,
    InputIterator last)
 
          Iteration constructor.
Iterates between first and last, copying each of the elements in the range into this container. Create a std::set/hash_set equivalent associative container. Insert a range of elements into the database. The range is [first, last), which contains elements that can be converted to type ddt automatically. This function supports auto-commit. See the handle requirement in class details to pass correct database/environment handles.
db_set(const self &x)
Copy constructor.
Create a database and insert all key/data pairs in x into this container. x's data members are not copied. This function supports auto-commit.