/dports/math/py-bitmath/bitmath-1.3.3.1/tests/ |
H A D | test_sorting.py | 44 sorted_list = sorted(unsorted_list) 45 self.assertIs(sorted_list[0], first) 46 self.assertIs(sorted_list[1], second) 47 self.assertIs(sorted_list[2], third) 48 self.assertIs(sorted_list[3], fourth) 60 sorted_list = sorted(unsorted_list) 61 self.assertIs(sorted_list[0], first) 63 self.assertIs(sorted_list[2], third) 74 self.assertIs(sorted_list[0], first) 76 self.assertIs(sorted_list[2], third) [all …]
|
/dports/graphics/urt/urt-3.1b1_12/tools/ |
H A D | rleselect.c | 99 int *sorted_list; local 141 insert( &sorted_list, j, nsorted++ ); 168 fprintf( stderr, "%d%s", sorted_list[i], 253 sorted_list = (int *)malloc( sizeof(int) ); 254 RLE_CHECK_ALLOC( my_name, sorted_list, 0 ); 255 *sorted_list = i; 259 sorted_list = (int *)realloc( sorted_list, (n + 1) * sizeof(int) ); 260 RLE_CHECK_ALLOC( my_name, sorted_list, 0 ); 263 sorted_list[j+1] = sorted_list[j]; 264 sorted_list[j+1] = i; [all …]
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/components/history/core/browser/ |
H A D | url_utils_unittest.cc | 19 const char* sorted_list[] = { in TEST() local 39 for (size_t i = 0; i < base::size(sorted_list); ++i) { in TEST() 40 EXPECT_FALSE(CanonicalURLStringCompare(sorted_list[i], sorted_list[i])) in TEST() 41 << " for \"" << sorted_list[i] << "\" < \"" << sorted_list[i] << "\""; in TEST() 43 for (size_t j = i + 1; j < base::size(sorted_list); ++j) { in TEST() 44 EXPECT_TRUE(CanonicalURLStringCompare(sorted_list[i], sorted_list[j])) in TEST() 45 << " for \"" << sorted_list[i] << "\" < \"" << sorted_list[j] << "\""; in TEST() 46 EXPECT_FALSE(CanonicalURLStringCompare(sorted_list[j], sorted_list[i])) in TEST() 47 << " for \"" << sorted_list[j] << "\" < \"" << sorted_list[i] << "\""; in TEST()
|
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/components/history/core/browser/ |
H A D | url_utils_unittest.cc | 19 const char* sorted_list[] = { in TEST() local 39 for (size_t i = 0; i < base::size(sorted_list); ++i) { in TEST() 40 EXPECT_FALSE(CanonicalURLStringCompare(sorted_list[i], sorted_list[i])) in TEST() 41 << " for \"" << sorted_list[i] << "\" < \"" << sorted_list[i] << "\""; in TEST() 43 for (size_t j = i + 1; j < base::size(sorted_list); ++j) { in TEST() 44 EXPECT_TRUE(CanonicalURLStringCompare(sorted_list[i], sorted_list[j])) in TEST() 45 << " for \"" << sorted_list[i] << "\" < \"" << sorted_list[j] << "\""; in TEST() 46 EXPECT_FALSE(CanonicalURLStringCompare(sorted_list[j], sorted_list[i])) in TEST() 47 << " for \"" << sorted_list[j] << "\" < \"" << sorted_list[i] << "\""; in TEST()
|
/dports/databases/percona56-client/percona-server-5.6.51-91.0/sql/ |
H A D | plistsort.c | 48 LS_LIST_ITEM *sorted_list; in LS_NAME() local 63 sorted_list= list; in LS_NAME() 64 e1= LS_NEXT(sorted_list); in LS_NAME() 68 sorted_list= e1; in LS_NAME() 73 LS_SET_NEXT(sorted_list, e1); in LS_NAME() 89 sorted_list= e1; in LS_NAME() 94 LS_SET_NEXT(sorted_list, e1); in LS_NAME() 108 sp->list1= sorted_list; in LS_NAME() 118 LS_LIST_ITEM **hook= &sorted_list; in LS_NAME() 120 LS_LIST_ITEM *list2= sorted_list; in LS_NAME() [all …]
|
/dports/databases/percona-pam-for-mysql/percona-server-5.6.51-91.0/sql/ |
H A D | plistsort.c | 48 LS_LIST_ITEM *sorted_list; in LS_NAME() local 63 sorted_list= list; in LS_NAME() 64 e1= LS_NEXT(sorted_list); in LS_NAME() 68 sorted_list= e1; in LS_NAME() 73 LS_SET_NEXT(sorted_list, e1); in LS_NAME() 89 sorted_list= e1; in LS_NAME() 94 LS_SET_NEXT(sorted_list, e1); in LS_NAME() 108 sp->list1= sorted_list; in LS_NAME() 118 LS_LIST_ITEM **hook= &sorted_list; in LS_NAME() 120 LS_LIST_ITEM *list2= sorted_list; in LS_NAME() [all …]
|
/dports/databases/mysqlwsrep56-server/mysql-wsrep-wsrep_5.6.51-25.33/sql/ |
H A D | plistsort.c | 48 LS_LIST_ITEM *sorted_list; in LS_NAME() local 63 sorted_list= list; in LS_NAME() 64 e1= LS_NEXT(sorted_list); in LS_NAME() 66 if (LS_COMPARE_FUNC_CALL(sorted_list, e1)) in LS_NAME() 68 sorted_list= e1; in LS_NAME() 73 LS_SET_NEXT(sorted_list, e1); in LS_NAME() 88 LS_LIST_ITEM *tmp_e= sorted_list; in LS_NAME() 89 sorted_list= e1; in LS_NAME() 94 LS_SET_NEXT(sorted_list, e1); in LS_NAME() 108 sp->list1= sorted_list; in LS_NAME() [all …]
|
/dports/databases/percona57-server/percona-server-5.7.36-39/sql/ |
H A D | plistsort.c | 48 LS_LIST_ITEM *sorted_list; in LS_NAME() local 63 sorted_list= list; in LS_NAME() 64 e1= LS_NEXT(sorted_list); in LS_NAME() 68 sorted_list= e1; in LS_NAME() 73 LS_SET_NEXT(sorted_list, e1); in LS_NAME() 89 sorted_list= e1; in LS_NAME() 94 LS_SET_NEXT(sorted_list, e1); in LS_NAME() 108 sp->list1= sorted_list; in LS_NAME() 118 LS_LIST_ITEM **hook= &sorted_list; in LS_NAME() 120 LS_LIST_ITEM *list2= sorted_list; in LS_NAME() [all …]
|
/dports/databases/mysqlwsrep57-server/mysql-wsrep-wsrep_5.7.35-25.27/sql/ |
H A D | plistsort.c | 48 LS_LIST_ITEM *sorted_list; in LS_NAME() local 63 sorted_list= list; in LS_NAME() 64 e1= LS_NEXT(sorted_list); in LS_NAME() 68 sorted_list= e1; in LS_NAME() 73 LS_SET_NEXT(sorted_list, e1); in LS_NAME() 89 sorted_list= e1; in LS_NAME() 94 LS_SET_NEXT(sorted_list, e1); in LS_NAME() 108 sp->list1= sorted_list; in LS_NAME() 118 LS_LIST_ITEM **hook= &sorted_list; in LS_NAME() 120 LS_LIST_ITEM *list2= sorted_list; in LS_NAME() [all …]
|
/dports/databases/percona57-client/percona-server-5.7.36-39/sql/ |
H A D | plistsort.c | 48 LS_LIST_ITEM *sorted_list; in LS_NAME() local 63 sorted_list= list; in LS_NAME() 64 e1= LS_NEXT(sorted_list); in LS_NAME() 68 sorted_list= e1; in LS_NAME() 73 LS_SET_NEXT(sorted_list, e1); in LS_NAME() 89 sorted_list= e1; in LS_NAME() 94 LS_SET_NEXT(sorted_list, e1); in LS_NAME() 108 sp->list1= sorted_list; in LS_NAME() 118 LS_LIST_ITEM **hook= &sorted_list; in LS_NAME() 120 LS_LIST_ITEM *list2= sorted_list; in LS_NAME() [all …]
|
/dports/databases/mysql57-client/mysql-5.7.36/sql/ |
H A D | plistsort.c | 48 LS_LIST_ITEM *sorted_list; in LS_NAME() local 63 sorted_list= list; in LS_NAME() 64 e1= LS_NEXT(sorted_list); in LS_NAME() 68 sorted_list= e1; in LS_NAME() 73 LS_SET_NEXT(sorted_list, e1); in LS_NAME() 89 sorted_list= e1; in LS_NAME() 94 LS_SET_NEXT(sorted_list, e1); in LS_NAME() 108 sp->list1= sorted_list; in LS_NAME() 118 LS_LIST_ITEM **hook= &sorted_list; in LS_NAME() 120 LS_LIST_ITEM *list2= sorted_list; in LS_NAME() [all …]
|
/dports/databases/xtrabackup/percona-xtrabackup-2.4.21/sql/ |
H A D | plistsort.c | 48 LS_LIST_ITEM *sorted_list; in LS_NAME() local 63 sorted_list= list; in LS_NAME() 64 e1= LS_NEXT(sorted_list); in LS_NAME() 68 sorted_list= e1; in LS_NAME() 73 LS_SET_NEXT(sorted_list, e1); in LS_NAME() 89 sorted_list= e1; in LS_NAME() 94 LS_SET_NEXT(sorted_list, e1); in LS_NAME() 108 sp->list1= sorted_list; in LS_NAME() 118 LS_LIST_ITEM **hook= &sorted_list; in LS_NAME() 120 LS_LIST_ITEM *list2= sorted_list; in LS_NAME() [all …]
|
/dports/databases/percona57-pam-for-mysql/percona-server-5.7.36-39/sql/ |
H A D | plistsort.c | 48 LS_LIST_ITEM *sorted_list; in LS_NAME() local 63 sorted_list= list; in LS_NAME() 64 e1= LS_NEXT(sorted_list); in LS_NAME() 68 sorted_list= e1; in LS_NAME() 73 LS_SET_NEXT(sorted_list, e1); in LS_NAME() 89 sorted_list= e1; in LS_NAME() 94 LS_SET_NEXT(sorted_list, e1); in LS_NAME() 108 sp->list1= sorted_list; in LS_NAME() 118 LS_LIST_ITEM **hook= &sorted_list; in LS_NAME() 120 LS_LIST_ITEM *list2= sorted_list; in LS_NAME() [all …]
|
/dports/databases/percona56-server/percona-server-5.6.51-91.0/sql/ |
H A D | plistsort.c | 48 LS_LIST_ITEM *sorted_list; in LS_NAME() local 63 sorted_list= list; in LS_NAME() 64 e1= LS_NEXT(sorted_list); in LS_NAME() 68 sorted_list= e1; in LS_NAME() 73 LS_SET_NEXT(sorted_list, e1); in LS_NAME() 89 sorted_list= e1; in LS_NAME() 94 LS_SET_NEXT(sorted_list, e1); in LS_NAME() 108 sp->list1= sorted_list; in LS_NAME() 118 LS_LIST_ITEM **hook= &sorted_list; in LS_NAME() 120 LS_LIST_ITEM *list2= sorted_list; in LS_NAME() [all …]
|
/dports/databases/mariadb105-client/mariadb-10.5.15/sql/ |
H A D | plistsort.c | 41 LS_LIST_ITEM *sorted_list; in LS_NAME() local 56 sorted_list= list; in LS_NAME() 57 e1= LS_NEXT(sorted_list); in LS_NAME() 61 sorted_list= e1; in LS_NAME() 66 LS_SET_NEXT(sorted_list, e1); in LS_NAME() 82 sorted_list= e1; in LS_NAME() 87 LS_SET_NEXT(sorted_list, e1); in LS_NAME() 101 sp->list1= sorted_list; in LS_NAME() 111 LS_LIST_ITEM **hook= &sorted_list; in LS_NAME() 113 LS_LIST_ITEM *list2= sorted_list; in LS_NAME() [all …]
|
/dports/databases/mariadb104-server/mariadb-10.4.24/sql/ |
H A D | plistsort.c | 41 LS_LIST_ITEM *sorted_list; in LS_NAME() local 56 sorted_list= list; in LS_NAME() 57 e1= LS_NEXT(sorted_list); in LS_NAME() 61 sorted_list= e1; in LS_NAME() 66 LS_SET_NEXT(sorted_list, e1); in LS_NAME() 82 sorted_list= e1; in LS_NAME() 87 LS_SET_NEXT(sorted_list, e1); in LS_NAME() 101 sp->list1= sorted_list; in LS_NAME() 111 LS_LIST_ITEM **hook= &sorted_list; in LS_NAME() 113 LS_LIST_ITEM *list2= sorted_list; in LS_NAME() [all …]
|
/dports/databases/mariadb104-client/mariadb-10.4.24/sql/ |
H A D | plistsort.c | 41 LS_LIST_ITEM *sorted_list; in LS_NAME() local 56 sorted_list= list; in LS_NAME() 57 e1= LS_NEXT(sorted_list); in LS_NAME() 61 sorted_list= e1; in LS_NAME() 66 LS_SET_NEXT(sorted_list, e1); in LS_NAME() 82 sorted_list= e1; in LS_NAME() 87 LS_SET_NEXT(sorted_list, e1); in LS_NAME() 101 sp->list1= sorted_list; in LS_NAME() 111 LS_LIST_ITEM **hook= &sorted_list; in LS_NAME() 113 LS_LIST_ITEM *list2= sorted_list; in LS_NAME() [all …]
|
/dports/databases/mariadb103-client/mariadb-10.3.34/sql/ |
H A D | plistsort.c | 41 LS_LIST_ITEM *sorted_list; in LS_NAME() local 56 sorted_list= list; in LS_NAME() 57 e1= LS_NEXT(sorted_list); in LS_NAME() 61 sorted_list= e1; in LS_NAME() 66 LS_SET_NEXT(sorted_list, e1); in LS_NAME() 82 sorted_list= e1; in LS_NAME() 87 LS_SET_NEXT(sorted_list, e1); in LS_NAME() 101 sp->list1= sorted_list; in LS_NAME() 111 LS_LIST_ITEM **hook= &sorted_list; in LS_NAME() 113 LS_LIST_ITEM *list2= sorted_list; in LS_NAME() [all …]
|
/dports/databases/mariadb103-server/mariadb-10.3.34/sql/ |
H A D | plistsort.c | 41 LS_LIST_ITEM *sorted_list; in LS_NAME() local 56 sorted_list= list; in LS_NAME() 57 e1= LS_NEXT(sorted_list); in LS_NAME() 61 sorted_list= e1; in LS_NAME() 66 LS_SET_NEXT(sorted_list, e1); in LS_NAME() 82 sorted_list= e1; in LS_NAME() 87 LS_SET_NEXT(sorted_list, e1); in LS_NAME() 101 sp->list1= sorted_list; in LS_NAME() 111 LS_LIST_ITEM **hook= &sorted_list; in LS_NAME() 113 LS_LIST_ITEM *list2= sorted_list; in LS_NAME() [all …]
|
/dports/databases/mysql56-client/mysql-5.6.51/sql/ |
H A D | plistsort.c | 48 LS_LIST_ITEM *sorted_list; in LS_NAME() local 63 sorted_list= list; in LS_NAME() 64 e1= LS_NEXT(sorted_list); in LS_NAME() 66 if (LS_COMPARE_FUNC_CALL(sorted_list, e1)) in LS_NAME() 68 sorted_list= e1; in LS_NAME() 73 LS_SET_NEXT(sorted_list, e1); in LS_NAME() 88 LS_LIST_ITEM *tmp_e= sorted_list; in LS_NAME() 89 sorted_list= e1; in LS_NAME() 94 LS_SET_NEXT(sorted_list, e1); in LS_NAME() 108 sp->list1= sorted_list; in LS_NAME() [all …]
|
/dports/databases/mariadb105-server/mariadb-10.5.15/sql/ |
H A D | plistsort.c | 41 LS_LIST_ITEM *sorted_list; in LS_NAME() local 56 sorted_list= list; in LS_NAME() 57 e1= LS_NEXT(sorted_list); in LS_NAME() 61 sorted_list= e1; in LS_NAME() 66 LS_SET_NEXT(sorted_list, e1); in LS_NAME() 82 sorted_list= e1; in LS_NAME() 87 LS_SET_NEXT(sorted_list, e1); in LS_NAME() 101 sp->list1= sorted_list; in LS_NAME() 111 LS_LIST_ITEM **hook= &sorted_list; in LS_NAME() 113 LS_LIST_ITEM *list2= sorted_list; in LS_NAME() [all …]
|
/dports/math/stanmath/math-4.2.0/lib/tbb_2020.3/src/test/ |
H A D | test_parallel_sort.cpp | 137 std::sort(sorted_list, sorted_list + n, compare); in init_iter() 167 sorted_list[i] = T(i); in init_iter() 175 sorted_list[i] = T(n - i); in init_iter() 181 std::sort(sorted_list, sorted_list + n, compare); in init_iter() 227 std::sort(sorted_list, sorted_list + n, compare); in init_iter() 273 std::sort(sorted_list, sorted_list + n, compare); in init_iter() 308 std::sort(sorted_list, sorted_list + n, compare); in init_iter() 341 if (!Validate(iter, sorted_list, n)) in parallel_sortTest() 355 init_iter(iter, sorted_list, n, *compare, true); in parallel_sortTest() 362 if (!Validate(iter, sorted_list, n)) in parallel_sortTest() [all …]
|
/dports/devel/tbb/oneTBB-2020.3/src/test/ |
H A D | test_parallel_sort.cpp | 137 std::sort(sorted_list, sorted_list + n, compare); in init_iter() 167 sorted_list[i] = T(i); in init_iter() 175 sorted_list[i] = T(n - i); in init_iter() 181 std::sort(sorted_list, sorted_list + n, compare); in init_iter() 227 std::sort(sorted_list, sorted_list + n, compare); in init_iter() 273 std::sort(sorted_list, sorted_list + n, compare); in init_iter() 308 std::sort(sorted_list, sorted_list + n, compare); in init_iter() 341 if (!Validate(iter, sorted_list, n)) in parallel_sortTest() 355 init_iter(iter, sorted_list, n, *compare, true); in parallel_sortTest() 362 if (!Validate(iter, sorted_list, n)) in parallel_sortTest() [all …]
|
/dports/devel/taskflow/taskflow-3.2.0/3rd-party/tbb/src/test/ |
H A D | test_parallel_sort.cpp | 137 std::sort(sorted_list, sorted_list + n, compare); in init_iter() 167 sorted_list[i] = T(i); in init_iter() 175 sorted_list[i] = T(n - i); in init_iter() 181 std::sort(sorted_list, sorted_list + n, compare); in init_iter() 227 std::sort(sorted_list, sorted_list + n, compare); in init_iter() 273 std::sort(sorted_list, sorted_list + n, compare); in init_iter() 308 std::sort(sorted_list, sorted_list + n, compare); in init_iter() 341 if (!Validate(iter, sorted_list, n)) in parallel_sortTest() 355 init_iter(iter, sorted_list, n, *compare, true); in parallel_sortTest() 362 if (!Validate(iter, sorted_list, n)) in parallel_sortTest() [all …]
|
/dports/devel/py-rx1/Rx-1.6.1/rx/linq/observable/ |
H A D | statistics.py | 6 def determine_median(sorted_list): argument 7 if len(sorted_list) == 0: 10 if len(sorted_list) % 2 == 1: 11 return sorted_list[int((len(sorted_list) + 1) / 2) - 1] 13 median_1 = sorted_list[int((len(sorted_list) + 1) / 2) - 1] 14 median_2 = sorted_list[int((len(sorted_list) + 1) / 2)]
|