ref: 15d72b39beda5af6024b645493facd5b9d0d4a9c
dir: /asif.h/
typedef struct String String; struct String{ char *s; int n; }; typedef struct VArray VArray; struct VArray{ int n; int elsize; int vsize; int bufsize; void *p; }; void vfree(VArray*); void vinsert(VArray*, char*); VArray* valloc(ulong, int); typedef struct Vector Vector; struct Vector{ void *p; ulong n; ulong elsz; ulong bufsz; ulong totsz; int firstempty; }; void freevec(Vector*); void clearvec(Vector*); void popsparsevec(Vector*, int); void* pushsparsevec(Vector*, void*); void* pushvec(Vector*, void*); void* newvec(Vector*, int, int); typedef struct QNode QNode; struct QNode{ QNode *left; QNode *right; QNode *up; QNode *down; void *aux; QNode *prev; QNode *next; }; QNode* qtmerge(QNode*); QNode* qtsplit(QNode*); u32int next32pow2(u32int); int lsb64(uvlong); int msb64(uvlong); int modpow(int, int, int); VArray* naivestrfind(String, String); VArray* morrispratt(String, String); VArray* knuthmorrispratt(String, String); VArray* rabinkarp(String, String, int, int); VArray* rabinkarp8(String, String); typedef struct Pairheap Pairheap; struct Pairheap{ double n; void *aux; Pairheap *parent; Pairheap *left; Pairheap *right; }; void nukequeue(Pairheap**); Pairheap* popqueue(Pairheap**); void decreasekey(Pairheap*, double, Pairheap**); Pairheap* pushqueue(double, void*, Pairheap**); void four1(double*, int, int); void realft(double*, int, int); char* estrdup(char*); void* erealloc(void*, ulong, ulong); void* emalloc(ulong); #define MIN(a,b) ((a) <= (b) ? (a) : (b)) #define MAX(a,b) ((a) >= (b) ? (a) : (b)) #define SQRT2 1.4142135623730951