src/api/search.c

   1 #include <search.h>
   2 #define T(t) (t*)0;
   3 #define F(t,n) {t *y = &x.n;}
   4 #define C(n) switch(n){case n:;}
   5 static void f()
   6 {
   7 T(size_t)
   8 T(ACTION)
   9 T(VISIT)
  10 T(ENTRY)
  11 {
  12 struct entry x;
  13 F(char*,key)
  14 F(void*,data)
  15 }
  16 switch((ACTION)0){
  17 case FIND:
  18 case ENTER:;
  19 }
  20 switch((VISIT)0){
  21 case preorder:
  22 case postorder:
  23 case endorder:
  24 case leaf:;
  25 }
  26 {int(*p)(size_t) = hcreate;}
  27 {void(*p)(void) = hdestroy;}
  28 {ENTRY*(*p)(ENTRY,ACTION) = hsearch;}
  29 {void(*p)(void*,void*) = insque;}
  30 {void*(*p)(const void*,const void*,size_t*,size_t,int(*)(const void*,const void*)) = lfind;}
  31 {void*(*p)(const void*,void*,size_t*,size_t,int(*)(const void*,const void*)) = lsearch;}
  32 {void(*p)(void*) = remque;}
  33 {void*(*p)(const void*restrict,void**restrict,int(*)(const void*,const void*)) = tdelete;}
  34 {void*(*p)(const void*,void*const*,int(*)(const void*,const void*)) = tfind;}
  35 {void*(*p)(const void*,void**,int(*)(const void*,const void*)) = tsearch;}
  36 {void(*p)(const void*,void(*)(const void*,VISIT,int)) = twalk;}
  37 }