/*
- * $Id: reclists.c,v 1.4 2007-01-08 18:32:35 quinn Exp $
+ * $Id: reclists.c,v 1.6 2007-01-10 10:04:23 adam Exp $
*/
#include <assert.h>
hashsize <<= 1;
res = nmem_malloc(nmem, sizeof(struct reclist));
res->hashtable = nmem_malloc(nmem, hashsize * sizeof(struct reclist_bucket*));
- bzero(res->hashtable, hashsize * sizeof(struct reclist_bucket*));
+ memset(res->hashtable, 0, hashsize * sizeof(struct reclist_bucket*));
res->hashtable_size = hashsize;
res->nmem = nmem;
res->hashmask = hashsize - 1; // Creates a bitmask
// Insert a record. Return record cluster (newly formed or pre-existing)
struct record_cluster *reclist_insert(struct reclist *l, struct record *record,
- char *merge_key)
+ char *merge_key, int *total)
{
unsigned int bucket;
struct reclist_bucket **p;
newc->merge_key = merge_key;
newc->relevance = 0;
newc->term_frequency_vec = 0;
+ newc->recid = (*total)++;
newc->metadata = 0;
newc->metadata = nmem_malloc(l->nmem,
sizeof(struct record_metadata*) * service->num_metadata);
- bzero(newc->metadata, sizeof(struct record_metadata*) * service->num_metadata);
+ memset(newc->metadata, 0, sizeof(struct record_metadata*) * service->num_metadata);
*p = new;
l->flatlist[l->num_records++] = newc;