Lines Matching +full:- +full:i
2 * Copyright © 2005-2020 Rich Felker
36 long d = *(long*)a - *(long*)b; in icmp()
37 return (d > 0) ? 1 : (d < 0) ? -1 : 0; in icmp()
52 int i; in tcmp() local
54 for (i = 0; i < 3; i++) { in tcmp()
55 c = (int) a->b[i] - (int) b->b[i]; in tcmp()
67 /* 26 items -- even */
77 /* 23 items -- odd, prime */
92 int i; in test_qsort() local
96 for (i=0; i<(int) (sizeof(s)/sizeof(char *)-1); i++) { in test_qsort()
97 if (strcmp(s[i], s[i+1]) > 0) { in test_qsort()
99 for (i=0; i<(int)(sizeof(s)/sizeof(char *)); i++) in test_qsort()
100 printf("\t%s\n", s[i]); in test_qsort()
106 for (i=0; i<(int)(sizeof(n)/sizeof(n[0])-1); i++) { in test_qsort()
107 if (n[i] > n[i+1]) { in test_qsort()
109 for (i=0; i<(int)(sizeof(n)/sizeof(n[0])); i++) in test_qsort()
110 printf("\t%ld\n", n[i]); in test_qsort()
116 for (i=0; i<(int)(sizeof(t)/sizeof(t[0])-1); i++) { in test_qsort()
117 if (tcmp(&t[i], &t[i+1]) > 0) { in test_qsort()
119 for (i=0; i<(int)(sizeof(t)/sizeof(t[0])); i++) in test_qsort()
120 printf("\t0x%02x%02x%02x\n", t[i].b[0], t[i].b[1], t[i].b[2]); in test_qsort()