/**
* Creates a new pset.
*
- * @param func the compare function of this pset
- * @param slots number of initial slots
+ * @param func The compare function of this pset.
+ * @param slots Initial number of collision chains. I.e., #slots
+ * different keys can be hashed without collisions.
*
* @returns
* created pset
/**
* Deletes a pset.
*
+ * @param pset the pset
+ *
* @note
* This does NOT delete the elements of this pset, just it's pointers!
*/
* Searches an element pointer in a pset.
*
* @param pset the pset to search in
- * @param key the element to is searched
+ * @param key the element to search
* @param hash the hash value of key
*
* @return
* @note
* It is not possible to insert on element more than once. If a element
* that should be inserted is already in the set, this functions does
- * nothing but returning its set_entry.
+ * nothing but returning its already existing set_entry.
*/
void *pset_insert (pset *pset, const void *key, unsigned hash);