/*
* Searches for sha1 in table, using the given fanout table to determine the
- * interval to search, then using binary search. Returns the element index of
- * the position found if successful, -i-1 if not (where i is the index of the
- * least element that is greater than sha1).
+ * interval to search, then using binary search. Returns 1 if found, 0 if not.
*
* Takes the following parameters:
*
* - sha1: the hash to search for
- * - fanout: a 256-element array of NETWORK-order 32-bit integers; the integer
- * at position i represents the number of elements in table whose first byte
- * is less than or equal to i
+ * - fanout_nbo: a 256-element array of NETWORK-order 32-bit integers; the
+ * integer at position i represents the number of elements in table whose
+ * first byte is less than or equal to i
* - table: a sorted list of hashes with optional extra information in between
* - stride: distance between two consecutive elements in table (should be
* GIT_MAX_RAWSZ or greater)
+ * - result: if not NULL, this function stores the element index of the
+ * position found (if the search is successful) or the index of the least
+ * element that is greater than sha1 (if the search is not successful)
*
* This function does not verify the validity of the fanout table.
*/
-extern int bsearch_hash(const unsigned char *sha1, const void *fanout,
- const void *table, size_t stride);
+int bsearch_hash(const unsigned char *sha1, const uint32_t *fanout_nbo,
+ const unsigned char *table, size_t stride, uint32_t *result);
#endif