rework Relation_next and HashVector_next to void query handling in HashVector

[rrq/rrqmisc.git] / vector / HashVector.h

diff --git a/vector/HashVector.h b/vector/HashVector.h
index 387f7ce53cbe3782fee880af84e5f6c0af71a238..b9316d688aedc1d42b9d3d099313c14f9a2ebd9e 100644 (file)
--- a/vector/HashVector.h
+++ b/vector/HashVector.h
@@ -35,7 +35,7 @@
  *
  * \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
@@ -86,24 +86,18 @@ typedef struct {
 void *HashVector_find(HashVector *hv,void *key);
 
 /**
- * \brief Scan the table for any subsequent item that admits to the
- * given partial key.
+ * \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.
  *
- * This function is used where the query key doesn't fully identify an
- * item, and is thus a partial key that 
- *
  * \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