HomeSort by: relevance | last modified time | path
    Searched defs:stone (Results 1 - 3 of 3) sorted by relevancy

  /src/usr.bin/diff/
diffreg.c 97 * Uses an algorithm due to Harold Stone, which finds a pair of longest
116 * The cleverness lies in routine stone. This marches through the lines of
197 static int stone(int *, int, int *, int *, int);
404 i = stone(class, slen[0], member, klist, flags);
580 stone(int *a, int n, int *b, int *c, int flags) function
diffreg.c 97 * Uses an algorithm due to Harold Stone, which finds a pair of longest
116 * The cleverness lies in routine stone. This marches through the lines of
197 static int stone(int *, int, int *, int *, int);
404 i = stone(class, slen[0], member, klist, flags);
580 stone(int *a, int n, int *b, int *c, int flags) function
diffreg.c 97 * Uses an algorithm due to Harold Stone, which finds a pair of longest
116 * The cleverness lies in routine stone. This marches through the lines of
197 static int stone(int *, int, int *, int *, int);
404 i = stone(class, slen[0], member, klist, flags);
580 stone(int *a, int n, int *b, int *c, int flags) function

Completed in 50 milliseconds