version 1.2, 2011/11/13 10:49:57 |
version 1.5, 2011/11/18 07:02:19 |
|
|
#ifndef APROPOS_H |
#ifndef APROPOS_H |
#define APROPOS_H |
#define APROPOS_H |
|
|
struct rec { |
struct res { |
char *file; /* file in file-system */ |
char *file; /* file in file-system */ |
char *cat; /* category (3p, 3, etc.) */ |
char *cat; /* category (3p, 3, etc.) */ |
char *title; /* title (FOO, etc.) */ |
char *title; /* title (FOO, etc.) */ |
char *arch; /* arch (or empty string) */ |
char *arch; /* arch (or empty string) */ |
char *desc; /* description (from Nd) */ |
char *desc; /* description (from Nd) */ |
unsigned int rec; /* record in index */ |
unsigned int rec; /* record in index */ |
/* |
|
* By the time the apropos_search() callback is called, these |
|
* are superfluous. |
|
* Maintain a binary tree for checking the uniqueness of `rec' |
|
* when adding elements to the results array. |
|
* Since the results array is dynamic, use offset in the array |
|
* instead of a pointer to the structure. |
|
*/ |
|
int lhs; |
|
int rhs; |
|
}; |
}; |
|
|
struct opts { |
struct opts { |
|
|
|
|
struct expr; |
struct expr; |
|
|
void apropos_search(const struct opts *, |
int apropos_search(const struct opts *, |
const struct expr *, void *, |
const struct expr *, size_t, void *, |
void (*)(struct rec *, size_t, void *)); |
void (*)(struct res *, size_t, void *)); |
|
struct expr *exprcomp(int, char *[], size_t *); |
struct expr *exprcomp(int, char *[], int); |
|
void exprfree(struct expr *); |
void exprfree(struct expr *); |
|
|
__END_DECLS |
__END_DECLS |