--- /dev/null
+*.a
+*.la
+*.lo
+*.o
+.libs
+/Makefile
+/btree
+/build
+/chash.test
+/config.log
+/config.status
+/hashtime
+/lcrand.test
+/libtool
+/mime.test
+/mlparse.test
+/mlparse_wrap.test
+/objalloc.test
+/poolalloc.test
+/psettings_gen
+/psettings_gen.test
+/setup.py
+/src/.deps
+/src/.dirstamp
+/src/.libs
+/src/include/config.h
+/src/include/stamp-h1
+/src/libtextcodec/.deps
+/src/libtextcodec/.dirstamp
+/src/libtextcodec/.libs
+/src/test/.deps
+/src/test/.dirstamp
+/src/test/binsearch_1
+/src/test/bit_1
+/src/test/bucket_1
+/src/test/docmap_1
+/src/test/freemap_1
+/src/test/getlongopt_1
+/src/test/heap_1
+/src/test/iobtree_1
+/src/test/mem_1
+/src/test/mlparse_1
+/src/test/poolalloc_1
+/src/test/rbtree_1
+/src/test/stack_1
+/src/test/stop_1
+/src/test/str_1
+/src/pyzet/index.map.0
+/src/pyzet/index.param.0
+/src/pyzet/index.v.0
+/src/pyzet/index.vocab.0
+/staticalloc.test
+/stem.test
+/stop_gen
+/tools/.deps
+/tools/.dirstamp
+/zet
+/zet_cat
+/zet_dict
+/zet_diff
+/zet_file
+/zet_impactify
+/zet_trec
void *prefix, unsigned int *prefix_size);
/* size of a btbucket internal node entry */
-unsigned int btbucket_entry_size();
+unsigned int btbucket_entry_size(void);
/* decodes a btbucket internal node entry (entry must be of size
* btbucket_entry_size) */
struct crc;
/* create a new CRC object */
-struct crc *crc_new();
+struct crc *crc_new(void);
/* reinitialise the CRC object, to restart the checksumming */
void crc_reinit(struct crc *crc);
/*
* Is there an error to report?.
*/
-int error_has_msg();
+int error_has_msg(void);
/*
* Get the last error message as set by error_loc()/ERROR().
*/
-const char * error_last_msg();
+const char * error_last_msg(void);
/*
* Get the last error code as set by error_loc()/ERROR().
*/
-int error_last_code();
+int error_last_code(void);
/*
* Set the stream that errors are logged to.
/* alignment stuff */
/* get alignments of basic types */
-unsigned int mem_align_char();
-unsigned int mem_align_short();
-unsigned int mem_align_int();
-unsigned int mem_align_long();
-unsigned int mem_align_float();
-unsigned int mem_align_double();
-unsigned int mem_align_ptr();
+unsigned int mem_align_char(void);
+unsigned int mem_align_short(void);
+unsigned int mem_align_int(void);
+unsigned int mem_align_long(void);
+unsigned int mem_align_float(void);
+unsigned int mem_align_double(void);
+unsigned int mem_align_ptr(void);
/* return the maximum alignment (probably) for this platform */
-unsigned int mem_align_max();
+unsigned int mem_align_max(void);
/* return the next point in the buffer that conforms to the given alignment.
* align is assumed to be a power of two. */
#define METRIC_H
/* okapi metric */
-const struct search_metric *okapi_k3();
+const struct search_metric *okapi_k3(void);
/* dirichlet metric */
-const struct search_metric *dirichlet();
+const struct search_metric *dirichlet(void);
/* pivoted cosine metric */
-const struct search_metric *pcosine();
+const struct search_metric *pcosine(void);
/* (incredibly simple) cosine metric */
-const struct search_metric *cosine();
+const struct search_metric *cosine(void);
/* Dave Hawking's AF1 metric */
-const struct search_metric *hawkapi();
+const struct search_metric *hawkapi(void);
#endif
unsigned int objalloc_objsize(struct objalloc *obj);
/* overhead on first block allocated */
-unsigned int objalloc_overhead_first();
+unsigned int objalloc_overhead_first(void);
/* overhead on blocks after first allocated */
-unsigned int objalloc_overhead();
+unsigned int objalloc_overhead(void);
/* returns the amount of memory held by the allocator */
-unsigned int objalloc_memsize();
+unsigned int objalloc_memsize(struct objalloc *obj, void *ptr);
#ifdef __cplusplus
}
int poolalloc_is_managed(struct poolalloc *pool, void *ptr);
/* memory overhead of the first and subsequent chunks allocated */
-unsigned int poolalloc_overhead_first();
-unsigned int poolalloc_overhead();
+unsigned int poolalloc_overhead_first(void);
+unsigned int poolalloc_overhead(void);
#ifdef __cplusplus
}
/* create a new red-black tree that will have unsigned long ints as keys, with
* natural ordering. Returns NULL on failure. */
-struct rbtree *rbtree_luint_new();
+struct rbtree *rbtree_luint_new(void);
/* delete a red-black tree. This operation can fail (as traversing the tree to
* free the contained nodes requires dynamic memory), but operates on a best
struct reposset;
-struct reposset *reposset_new();
+struct reposset *reposset_new(void);
void reposset_delete(struct reposset *rset);
/* add a new repository. reposno will contain the number assigned to this
* otherwise. */
int staticalloc_is_managed(struct staticalloc *alloc, void *ptr);
-unsigned int staticalloc_overhead();
+unsigned int staticalloc_overhead(void);
/* STATICALLOC_DECL is a macro to make it convenient to allocate space
* on the stack. Provide the variable name and a constant number of bytes
};
/* return the space needed to store a set of storage parameters */
-unsigned int storagep_size();
+unsigned int storagep_size(void);
/* read a set of storage parameters from memory (where memory is at least
* storagep_size bytes long) */
/* indicates whether characters are signed or not by default (1 if they are, 0
* if they are not) */
-int str_signed_char();
+int str_signed_char(void);
#define STR_SIGNED_CHAR (((int) ((char) 255)) == -1) /* macro version */
/* get an integer value from a character, forcing character values into [0,255]
};
/* create a new stream */
-struct stream *stream_new();
+struct stream *stream_new(void);
/* flush output from a stream. The exact behaviour depends on which flush value
* is given. Currently only FLUSH_FINISH is available, which flushes all output
extern int tu_sample_data_inited;
-void tu_sample_data_rand_init();
+void tu_sample_data_rand_init(void);
int tu_sample_data_file_init(const char * fname);
/* initialises an new treceval: sets memory aside for raw results;
* returns a pointer to a new struct treceval which needs to be freed by
* a call to the next function after useage */
-struct treceval *treceval_new();
+struct treceval *treceval_new(void);
/* releases all memory and points *trecResults to NULL;
* expects a pointer to a pointer of a treceval structure for which
return pages;
}
-unsigned int poolalloc_overhead_first(struct poolalloc *pool) {
+unsigned int poolalloc_overhead_first(void) {
return sizeof(struct poolalloc);
}
-unsigned int poolalloc_overhead(struct poolalloc *pool) {
+unsigned int poolalloc_overhead(void) {
return sizeof(struct poolalloc_chunk);
}
}
}
-int luintcmp(const void *key1, const void *key2) {
+/*int luintcmp(const void *key1, const void *key2) {
const unsigned long int *lu1 = key1,
*lu2 = key2;
} else {
return 0;
}
-}
+}*/
int test_file(FILE *fp, int argc, char **argv) {
char *pos;
/* read parameters */
if ((fscanf(fp, "%255s", name) == 1)
- && (rbtree = rbtree_luint_new(luintcmp))) {
+ && (rbtree = rbtree_luint_new(/*luintcmp*/))) {
/* succeeded, do nothing */
if (params.verbose) {
printf("%s: new rbtree\n", name);