*
* \extends Vector
*/
-typedef struct {
+typedef struct HashVector {
/**
* This is the backing \ref Vector for the HashVector. Items are
* placed in the Vector by means of their key hashcodes, at the
#define HV_HOLE ((void*) 1)
/**
- * \brief Find the keyed item.
+ * \brief Lookup the first item with the given key.
*
* \param hv is the \ref HashVector concerned.
*
void *HashVector_find(HashVector *hv,void *key);
/**
- * \brief Scan the table for th next key-matching item at or after the
- * given index.
+ * \brief Scan the table by index
*
* \param hv is the \ref HashVector concerned.
*
* \param index is a pointer to the index to advance.
- * \
- * \param key is the Query key
*
* \returns the next matching item, or \b 0 if none, with the index
* updated.
*
* \related HashVector
*/
-extern void *HashVector_next(HashVector *hv,VectorIndex *i,void *key);
+extern void *HashVector_next(HashVector *hv,VectorIndex *i);
/**
* \brief Add the given item into the \ref HashVector, growing it as