HomeSort by: relevance | last modified time | path
    Searched refs:unsorted (Results 1 - 7 of 7) sorted by relevancy

  /src/external/bsd/libfido2/dist/udev/
check.sh 13 echo unsorted vendor section 1>&2
29 echo "${v}": unsorted product section 1>&2
  /src/crypto/external/apache2/openssl/dist/test/
stack_test.c 60 int unsorted; member in struct:__anon764
109 /* find unsorted -- the pointers are compared */
111 int *val = (finds[i].unsorted == -1) ? &notpresent
112 : v + finds[i].unsorted;
114 if (!TEST_int_eq(sk_sint_find(s, val), finds[i].unsorted)) {
115 TEST_info("int unsorted find %d", i);
120 /* find_ex unsorted */
122 int *val = (finds[i].unsorted == -1) ? &notpresent
123 : v + finds[i].unsorted;
125 if (!TEST_int_eq(sk_sint_find_ex(s, val), finds[i].unsorted)) {
    [all...]
  /src/crypto/external/bsd/openssl/dist/test/
stack_test.c 60 int unsorted; member in struct:__anon1775
109 /* find unsorted -- the pointers are compared */
111 int *val = (finds[i].unsorted == -1) ? &notpresent
112 : v + finds[i].unsorted;
114 if (!TEST_int_eq(sk_sint_find(s, val), finds[i].unsorted)) {
115 TEST_info("int unsorted find %d", i);
120 /* find_ex unsorted */
122 int *val = (finds[i].unsorted == -1) ? &notpresent
123 : v + finds[i].unsorted;
125 if (!TEST_int_eq(sk_sint_find_ex(s, val), finds[i].unsorted)) {
    [all...]
  /src/crypto/external/bsd/openssl.old/dist/test/
stack_test.c 60 int unsorted; member in struct:__anon2287
109 /* find unsorted -- the pointers are compared */
111 int *val = (finds[i].unsorted == -1) ? &notpresent
112 : v + finds[i].unsorted;
114 if (!TEST_int_eq(sk_sint_find(s, val), finds[i].unsorted)) {
115 TEST_info("int unsorted find %d", i);
120 /* find_ex unsorted */
122 int *val = (finds[i].unsorted == -1) ? &notpresent
123 : v + finds[i].unsorted;
125 if (!TEST_int_eq(sk_sint_find_ex(s, val), finds[i].unsorted)) {
    [all...]
  /src/external/gpl2/groff/dist/src/preproc/tbl/
table.cpp 1993 horizontal_span *unsorted = span_list; local
1995 while (unsorted) {
1998 if (unsorted->end_col < (*pp)->end_col
1999 || (unsorted->end_col == (*pp)->end_col
2000 && (unsorted->start_col > (*pp)->start_col)))
2002 horizontal_span *tem = unsorted->next;
2003 unsorted->next = *pp;
2004 *pp = unsorted;
2005 unsorted = tem;
  /src/external/bsd/zstd/dist/lib/dictBuilder/
divsufsort.c 1406 int t, skip, unsorted; local
1413 unsorted = 0;
1422 if(budget.count != 0) { unsorted += budget.count; }
1431 if(unsorted == 0) { break; }
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/uni/
package.d 4034 enum errMsg = "non-monotonic prefix function(s), an unsorted range or "~
4335 // unsorted range of pairs
4342 // build from unsorted array of pairs
4498 auto buildTrie(Range)(Range range, Value filler, bool unsorted)
4505 if (unsorted)

Completed in 44 milliseconds