代码搜索结果

@x l.35 main(argc,argv) int argc; /* the number of command-line arguments */ char *argv[]; /* an array of strings containing those arguments */ @y int main(@t\1\1@> int argc, /* the number of co

@x l.19 main() @y int main(void) @z

@x l.16 extern Graph *board(); /* moves on generalized chessboards */ extern Graph *simplex(); /* generalized triangular configurations */ extern Graph *subsets(); /* patterns of subset intersection *

@x l.68 extern long dijkstra(); /* procedure to calculate shortest paths */ #define print_dijkstra_result p_dijkstra_result /* shorthand for linker */ extern void print_dijkstra_result(); /* procedure

@x l.28 int main() @y int main(void) @z @x l.266 char *gb_alloc(n,s) long n; /* number of consecutive bytes desired */ Area s; /* storage area that will contain the new block */ @y char *gb_alloc

@x l.27 extern Graph *risc(); /* make a network for a microprocessor */ extern Graph *prod(); /* make a network for high-speed multiplication */ extern void print_gates(); /* write a network to standa

@x l.35 int main() @y int main(void) @z @x l.123 static void fill_buf() @y static void fill_buf(void) @z @x l.185 static char *imap="0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\ abcdefghijklmnopqrstuvwxyz_

@x l.90 main(argc,argv) int argc; /* the number of command-line arguments */ char *argv[]; /* an array of strings containing those arguments */ @y int main(@t\1\1@> int argc, /* the number of co

@x l.32 @t\4@>int main() @y int main(void) @z @x l.165 static void pr_vert(); /* a subroutine for printing a vertex is declared below */ static void pr_arc(); /* likewise for arcs */ static void p

@x l.21 extern long* lisa(); extern Graph *plane_lisa(); extern Graph *bi_lisa(); @y extern long* lisa(unsigned long,unsigned long,unsigned long,@| unsigned long,unsigned long,unsigned long,unsigne