/dports/games/openclonk/openclonk-release-8.1-src/thirdparty/timsort/ |
H A D | sort.h | 12 #ifndef SORT_TYPE 106 SORT_TYPE temp = dst[i]; in SHELL_SORT() 121 static inline int64_t binary_insertion_find(SORT_TYPE *dst, const SORT_TYPE x, const size_t size) in binary_insertion_find() 127 SORT_TYPE lx, cx, rx; in binary_insertion_find() 182 SORT_TYPE x = dst[i]; in binary_insertion_sort_start() 227 SORT_TYPE* newdst = (SORT_TYPE*)malloc(size * sizeof(SORT_TYPE)); in MERGE_SORT() 229 SORT_TYPE newdst[size]; in MERGE_SORT() 264 SORT_TYPE value = dst[pivot]; in quick_sort_partition() 412 SORT_TYPE *storage; 420 SORT_TYPE *tempstore = (SORT_TYPE*)realloc(store->storage, new_size * sizeof(SORT_TYPE)); in tim_sort_resize() [all …]
|
/dports/science/siconos/siconos-4.4.0/externals/sort/ |
H A D | sort.h | 14 #ifndef SORT_TYPE 268 SORT_TYPE cx; in BINARY_INSERTION_FIND() 310 SORT_TYPE x; in BINARY_INSERTION_SORT_START() 599 newdst = (SORT_TYPE *) malloc(size * sizeof(SORT_TYPE)); in MERGE_SORT() 841 SORT_TYPE *tempstore = (SORT_TYPE *)realloc(store->storage, new_size * sizeof(SORT_TYPE)); in TIM_SORT_RESIZE() 1452 ExtBuf = (SORT_TYPE*)malloc(L * sizeof(SORT_TYPE)); in SQRT_SORT() 1495 static __inline void GRAIL_SWAP1(SORT_TYPE *a, SORT_TYPE *b) { in GRAIL_SWAP1() 1763 static void GRAIL_MERGE_BUFFERS_LEFT_WITH_X_BUF(SORT_TYPE *keys, SORT_TYPE *midkey, SORT_TYPE *arr, in GRAIL_MERGE_BUFFERS_LEFT_WITH_X_BUF() 1928 static void GRAIL_MERGE_BUFFERS_LEFT(SORT_TYPE *keys, SORT_TYPE *midkey, SORT_TYPE *arr, int nblock, in GRAIL_MERGE_BUFFERS_LEFT() 2196 ExtBuf = (SORT_TYPE*)malloc(L * sizeof(SORT_TYPE)); in GRAIL_SORT_DYN_BUFFER() [all …]
|
/dports/math/vtk9/VTK-9.1.0/ThirdParty/libxml2/vtklibxml2/ |
H A D | timsort.h | 47 #ifndef SORT_TYPE 173 void TIM_SORT(SORT_TYPE *dst, const size_t size); 177 static __inline size_t BINARY_INSERTION_FIND(SORT_TYPE *dst, const SORT_TYPE x, in BINARY_INSERTION_FIND() 180 SORT_TYPE cx; in BINARY_INSERTION_FIND() 222 SORT_TYPE x; in BINARY_INSERTION_SORT_START() 353 SORT_TYPE *storage; 358 SORT_TYPE *tempstore = (SORT_TYPE *)realloc(store->storage, new_size * sizeof(SORT_TYPE)); in TIM_SORT_RESIZE() 376 SORT_TYPE *storage; in TIM_SORT_MERGE() 488 static __inline int PUSH_NEXT(SORT_TYPE *dst, in PUSH_NEXT() 531 void TIM_SORT(SORT_TYPE *dst, const size_t size) { in TIM_SORT() [all …]
|
/dports/devel/gettext-runtime/gettext-0.21/libtextstyle/lib/libxml/ |
H A D | timsort.h | 78 #ifndef SORT_TYPE 204 void TIM_SORT(SORT_TYPE *dst, const size_t size); 208 static __inline size_t BINARY_INSERTION_FIND(SORT_TYPE *dst, const SORT_TYPE x, in BINARY_INSERTION_FIND() 211 SORT_TYPE cx; in BINARY_INSERTION_FIND() 253 SORT_TYPE x; in BINARY_INSERTION_SORT_START() 384 SORT_TYPE *storage; 389 SORT_TYPE *tempstore = (SORT_TYPE *)realloc(store->storage, new_size * sizeof(SORT_TYPE)); in TIM_SORT_RESIZE() 407 SORT_TYPE *storage; in TIM_SORT_MERGE() 518 static __inline int PUSH_NEXT(SORT_TYPE *dst, in PUSH_NEXT() 561 void TIM_SORT(SORT_TYPE *dst, const size_t size) { in TIM_SORT() [all …]
|
/dports/devel/gettext-tools/gettext-0.21/gettext-tools/gnulib-lib/libxml/ |
H A D | timsort.h | 78 #ifndef SORT_TYPE 204 void TIM_SORT(SORT_TYPE *dst, const size_t size); 208 static __inline size_t BINARY_INSERTION_FIND(SORT_TYPE *dst, const SORT_TYPE x, in BINARY_INSERTION_FIND() 211 SORT_TYPE cx; in BINARY_INSERTION_FIND() 253 SORT_TYPE x; in BINARY_INSERTION_SORT_START() 384 SORT_TYPE *storage; 389 SORT_TYPE *tempstore = (SORT_TYPE *)realloc(store->storage, new_size * sizeof(SORT_TYPE)); in TIM_SORT_RESIZE() 407 SORT_TYPE *storage; in TIM_SORT_MERGE() 518 static __inline int PUSH_NEXT(SORT_TYPE *dst, in PUSH_NEXT() 561 void TIM_SORT(SORT_TYPE *dst, const size_t size) { in TIM_SORT() [all …]
|
/dports/devel/gettext-tools/gettext-0.21/gnulib-local/lib/libxml/ |
H A D | timsort.h | 78 #ifndef SORT_TYPE 204 void TIM_SORT(SORT_TYPE *dst, const size_t size); 208 static __inline size_t BINARY_INSERTION_FIND(SORT_TYPE *dst, const SORT_TYPE x, in BINARY_INSERTION_FIND() 211 SORT_TYPE cx; in BINARY_INSERTION_FIND() 253 SORT_TYPE x; in BINARY_INSERTION_SORT_START() 384 SORT_TYPE *storage; 389 SORT_TYPE *tempstore = (SORT_TYPE *)realloc(store->storage, new_size * sizeof(SORT_TYPE)); in TIM_SORT_RESIZE() 407 SORT_TYPE *storage; in TIM_SORT_MERGE() 518 static __inline int PUSH_NEXT(SORT_TYPE *dst, in PUSH_NEXT() 561 void TIM_SORT(SORT_TYPE *dst, const size_t size) { in TIM_SORT() [all …]
|
/dports/devel/gettext-tools/gettext-0.21/libtextstyle/lib/libxml/ |
H A D | timsort.h | 78 #ifndef SORT_TYPE 204 void TIM_SORT(SORT_TYPE *dst, const size_t size); 208 static __inline size_t BINARY_INSERTION_FIND(SORT_TYPE *dst, const SORT_TYPE x, in BINARY_INSERTION_FIND() 211 SORT_TYPE cx; in BINARY_INSERTION_FIND() 253 SORT_TYPE x; in BINARY_INSERTION_SORT_START() 384 SORT_TYPE *storage; 389 SORT_TYPE *tempstore = (SORT_TYPE *)realloc(store->storage, new_size * sizeof(SORT_TYPE)); in TIM_SORT_RESIZE() 407 SORT_TYPE *storage; in TIM_SORT_MERGE() 518 static __inline int PUSH_NEXT(SORT_TYPE *dst, in PUSH_NEXT() 561 void TIM_SORT(SORT_TYPE *dst, const size_t size) { in TIM_SORT() [all …]
|
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/libxml/src/ |
H A D | timsort.h | 47 #ifndef SORT_TYPE 173 void TIM_SORT(SORT_TYPE *dst, const size_t size); 177 static __inline size_t BINARY_INSERTION_FIND(SORT_TYPE *dst, const SORT_TYPE x, in BINARY_INSERTION_FIND() 180 SORT_TYPE cx; in BINARY_INSERTION_FIND() 222 SORT_TYPE x; in BINARY_INSERTION_SORT_START() 353 SORT_TYPE *storage; 358 SORT_TYPE *tempstore = (SORT_TYPE *)realloc(store->storage, new_size * sizeof(SORT_TYPE)); in TIM_SORT_RESIZE() 376 SORT_TYPE *storage; in TIM_SORT_MERGE() 487 static __inline int PUSH_NEXT(SORT_TYPE *dst, in PUSH_NEXT() 530 void TIM_SORT(SORT_TYPE *dst, const size_t size) { in TIM_SORT() [all …]
|
/dports/devel/gettext-po-mode/gettext-0.21/gnulib-local/lib/libxml/ |
H A D | timsort.h | 78 #ifndef SORT_TYPE 204 void TIM_SORT(SORT_TYPE *dst, const size_t size); 208 static __inline size_t BINARY_INSERTION_FIND(SORT_TYPE *dst, const SORT_TYPE x, in BINARY_INSERTION_FIND() 211 SORT_TYPE cx; in BINARY_INSERTION_FIND() 253 SORT_TYPE x; in BINARY_INSERTION_SORT_START() 384 SORT_TYPE *storage; 389 SORT_TYPE *tempstore = (SORT_TYPE *)realloc(store->storage, new_size * sizeof(SORT_TYPE)); in TIM_SORT_RESIZE() 407 SORT_TYPE *storage; in TIM_SORT_MERGE() 518 static __inline int PUSH_NEXT(SORT_TYPE *dst, in PUSH_NEXT() 561 void TIM_SORT(SORT_TYPE *dst, const size_t size) { in TIM_SORT() [all …]
|
/dports/devel/gettext-po-mode/gettext-0.21/gettext-tools/gnulib-lib/libxml/ |
H A D | timsort.h | 78 #ifndef SORT_TYPE 204 void TIM_SORT(SORT_TYPE *dst, const size_t size); 208 static __inline size_t BINARY_INSERTION_FIND(SORT_TYPE *dst, const SORT_TYPE x, in BINARY_INSERTION_FIND() 211 SORT_TYPE cx; in BINARY_INSERTION_FIND() 253 SORT_TYPE x; in BINARY_INSERTION_SORT_START() 384 SORT_TYPE *storage; 389 SORT_TYPE *tempstore = (SORT_TYPE *)realloc(store->storage, new_size * sizeof(SORT_TYPE)); in TIM_SORT_RESIZE() 407 SORT_TYPE *storage; in TIM_SORT_MERGE() 518 static __inline int PUSH_NEXT(SORT_TYPE *dst, in PUSH_NEXT() 561 void TIM_SORT(SORT_TYPE *dst, const size_t size) { in TIM_SORT() [all …]
|
/dports/devel/gettext-runtime/gettext-0.21/gnulib-local/lib/libxml/ |
H A D | timsort.h | 78 #ifndef SORT_TYPE 204 void TIM_SORT(SORT_TYPE *dst, const size_t size); 208 static __inline size_t BINARY_INSERTION_FIND(SORT_TYPE *dst, const SORT_TYPE x, in BINARY_INSERTION_FIND() 211 SORT_TYPE cx; in BINARY_INSERTION_FIND() 253 SORT_TYPE x; in BINARY_INSERTION_SORT_START() 384 SORT_TYPE *storage; 389 SORT_TYPE *tempstore = (SORT_TYPE *)realloc(store->storage, new_size * sizeof(SORT_TYPE)); in TIM_SORT_RESIZE() 407 SORT_TYPE *storage; in TIM_SORT_MERGE() 518 static __inline int PUSH_NEXT(SORT_TYPE *dst, in PUSH_NEXT() 561 void TIM_SORT(SORT_TYPE *dst, const size_t size) { in TIM_SORT() [all …]
|
/dports/devel/gettext-runtime/gettext-0.21/gettext-tools/gnulib-lib/libxml/ |
H A D | timsort.h | 78 #ifndef SORT_TYPE 204 void TIM_SORT(SORT_TYPE *dst, const size_t size); 208 static __inline size_t BINARY_INSERTION_FIND(SORT_TYPE *dst, const SORT_TYPE x, in BINARY_INSERTION_FIND() 211 SORT_TYPE cx; in BINARY_INSERTION_FIND() 253 SORT_TYPE x; in BINARY_INSERTION_SORT_START() 384 SORT_TYPE *storage; 389 SORT_TYPE *tempstore = (SORT_TYPE *)realloc(store->storage, new_size * sizeof(SORT_TYPE)); in TIM_SORT_RESIZE() 407 SORT_TYPE *storage; in TIM_SORT_MERGE() 518 static __inline int PUSH_NEXT(SORT_TYPE *dst, in PUSH_NEXT() 561 void TIM_SORT(SORT_TYPE *dst, const size_t size) { in TIM_SORT() [all …]
|
/dports/devel/gettext-po-mode/gettext-0.21/libtextstyle/lib/libxml/ |
H A D | timsort.h | 78 #ifndef SORT_TYPE 204 void TIM_SORT(SORT_TYPE *dst, const size_t size); 208 static __inline size_t BINARY_INSERTION_FIND(SORT_TYPE *dst, const SORT_TYPE x, in BINARY_INSERTION_FIND() 211 SORT_TYPE cx; in BINARY_INSERTION_FIND() 253 SORT_TYPE x; in BINARY_INSERTION_SORT_START() 384 SORT_TYPE *storage; 389 SORT_TYPE *tempstore = (SORT_TYPE *)realloc(store->storage, new_size * sizeof(SORT_TYPE)); in TIM_SORT_RESIZE() 407 SORT_TYPE *storage; in TIM_SORT_MERGE() 518 static __inline int PUSH_NEXT(SORT_TYPE *dst, in PUSH_NEXT() 561 void TIM_SORT(SORT_TYPE *dst, const size_t size) { in TIM_SORT() [all …]
|
/dports/devel/libtextstyle/gettext-0.21/gettext-tools/gnulib-lib/libxml/ |
H A D | timsort.h | 78 #ifndef SORT_TYPE 204 void TIM_SORT(SORT_TYPE *dst, const size_t size); 208 static __inline size_t BINARY_INSERTION_FIND(SORT_TYPE *dst, const SORT_TYPE x, in BINARY_INSERTION_FIND() 211 SORT_TYPE cx; in BINARY_INSERTION_FIND() 253 SORT_TYPE x; in BINARY_INSERTION_SORT_START() 384 SORT_TYPE *storage; 389 SORT_TYPE *tempstore = (SORT_TYPE *)realloc(store->storage, new_size * sizeof(SORT_TYPE)); in TIM_SORT_RESIZE() 407 SORT_TYPE *storage; in TIM_SORT_MERGE() 518 static __inline int PUSH_NEXT(SORT_TYPE *dst, in PUSH_NEXT() 561 void TIM_SORT(SORT_TYPE *dst, const size_t size) { in TIM_SORT() [all …]
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/libxml/src/ |
H A D | timsort.h | 47 #ifndef SORT_TYPE 173 void TIM_SORT(SORT_TYPE *dst, const size_t size); 177 static __inline size_t BINARY_INSERTION_FIND(SORT_TYPE *dst, const SORT_TYPE x, in BINARY_INSERTION_FIND() 180 SORT_TYPE cx; in BINARY_INSERTION_FIND() 222 SORT_TYPE x; in BINARY_INSERTION_SORT_START() 353 SORT_TYPE *storage; 358 SORT_TYPE *tempstore = (SORT_TYPE *)realloc(store->storage, new_size * sizeof(SORT_TYPE)); in TIM_SORT_RESIZE() 376 SORT_TYPE *storage; in TIM_SORT_MERGE() 488 static __inline int PUSH_NEXT(SORT_TYPE *dst, in PUSH_NEXT() 531 void TIM_SORT(SORT_TYPE *dst, const size_t size) { in TIM_SORT() [all …]
|
/dports/textproc/libxml2/libxml2-2.9.12/ |
H A D | timsort.h | 47 #ifndef SORT_TYPE 173 void TIM_SORT(SORT_TYPE *dst, const size_t size); 177 static __inline size_t BINARY_INSERTION_FIND(SORT_TYPE *dst, const SORT_TYPE x, in BINARY_INSERTION_FIND() 180 SORT_TYPE cx; in BINARY_INSERTION_FIND() 222 SORT_TYPE x; in BINARY_INSERTION_SORT_START() 353 SORT_TYPE *storage; 358 SORT_TYPE *tempstore = (SORT_TYPE *)realloc(store->storage, new_size * sizeof(SORT_TYPE)); in TIM_SORT_RESIZE() 376 SORT_TYPE *storage; in TIM_SORT_MERGE() 488 static __inline int PUSH_NEXT(SORT_TYPE *dst, in PUSH_NEXT() 531 void TIM_SORT(SORT_TYPE *dst, const size_t size) { in TIM_SORT() [all …]
|
/dports/textproc/py-libxml2/libxml2-2.9.12/ |
H A D | timsort.h | 47 #ifndef SORT_TYPE 173 void TIM_SORT(SORT_TYPE *dst, const size_t size); 177 static __inline size_t BINARY_INSERTION_FIND(SORT_TYPE *dst, const SORT_TYPE x, in BINARY_INSERTION_FIND() 180 SORT_TYPE cx; in BINARY_INSERTION_FIND() 222 SORT_TYPE x; in BINARY_INSERTION_SORT_START() 353 SORT_TYPE *storage; 358 SORT_TYPE *tempstore = (SORT_TYPE *)realloc(store->storage, new_size * sizeof(SORT_TYPE)); in TIM_SORT_RESIZE() 376 SORT_TYPE *storage; in TIM_SORT_MERGE() 488 static __inline int PUSH_NEXT(SORT_TYPE *dst, in PUSH_NEXT() 531 void TIM_SORT(SORT_TYPE *dst, const size_t size) { in TIM_SORT() [all …]
|
/dports/ftp/horde-gollem/gollem-3.0.13/config/ |
H A D | prefs.php | 52 'value' => Gollem::SORT_TYPE, 55 Gollem::SORT_TYPE => _("File Type"),
|
/dports/devel/flatcc/flatcc-0.6.0/src/compiler/ |
H A D | codegen_c_sort.c | 127 static __inline void HEAP_SIFT_DOWN(SORT_TYPE *dst, const int64_t start, const int64_t end) { 146 static __inline void HEAPIFY(SORT_TYPE *dst, const size_t size) { 155 void HEAP_SORT(SORT_TYPE *dst, const size_t size) {
|
/dports/math/minizinc-ide/MiniZincIDE-2.5.5/cp-profiler/src/cpprofiler/analysis/ |
H A D | similar_subtree_window.hh | 53 static constexpr PatternProp SORT_TYPE = PatternProp::SIZE; variable 95 PatternProp sort_type = defaults::SORT_TYPE;
|
/dports/textproc/words/words-1.97F_3/ |
H A D | sorter.adb | 41 type SORT_TYPE is (A, C, G, U, N, F, P, R, S); type 42 package SORT_TYPE_IO is new TEXT_IO.ENUMERATION_IO(SORT_TYPE); 58 S1, S2, S3, S4, S5 : SORT_TYPE := A; 466 SX : out SORT_TYPE; 470 S : SORT_TYPE := A; 677 ST : SORT_TYPE := A; 784 ST : SORT_TYPE := A;
|
/dports/biology/bedtools/bedtools2-2.30.0/src/utils/KeyListOps/ |
H A D | KeyListOpsMethods.h | 106 typedef enum { UNSORTED, ASC, DESC} SORT_TYPE; typedef 121 void toArray(bool useNum, SORT_TYPE sortVal = UNSORTED);
|
/dports/finance/xtrader/xtrader-0.99.9_10/util/ |
H A D | MHFile.h | 45 SORT_TYPE, enumerator 52 …int Compare (const MH* o, int type) {if (type == SORT_TYPE) return compareType… in Compare()
|
/dports/x11-fm/worker/worker-4.10.0/src/ |
H A D | setsortmodeop.cc | 100 case SORT_TYPE: in save() 185 else if((mode&0xff)==SORT_TYPE) cyb[0]->setOption(5); in configure() 274 tsortmode=SORT_TYPE; in configure() 356 else if ( ( mode & 0xff ) == SORT_TYPE ) res += catalog.getLocale( 432 ); in getStringRepresentation()
|
H A D | verzeichnis.hh | 36 SORT_TYPE, enumerator
|