Home
last modified time | relevance | path

Searched refs:cmp_t (Results 1 – 25 of 118) sorted by relevance

12345

/dports/net/osrtspproxy/osrtspproxy_2_0/libapp/
H A DAvl.h13 enum cmp_t { CMP_LT=-1, CMP_EQ=0, CMP_GT=1 }; enum
49 cmp_t res; in Search()
69 Delete( const KeyType& key, AvlNode<KeyType>*& root, cmp_t cmp = CMP_EQ )
111 cmp_t
112 Compare( const KeyType& key, cmp_t cmp = CMP_EQ ) const;
261 cmp_t
262 AvlNode<KeyType>::Compare( const KeyType& key, cmp_t cmp ) const in Compare()
264 cmp_t res = CMP_EQ; in Compare()
301 cmp_t result = root->Compare( item ); in Insert()
327 int& change, cmp_t cmp ) in Delete()
[all …]
/dports/math/igraph/igraph-0.9.5/src/internal/
H A Dqsort.c59 typedef int cmp_t(void *, const void *, const void *); typedef
61 typedef int cmp_t(const void *, const void *, void *); typedef
63 typedef int cmp_t(const void *, const void *); typedef
65 static inline char *med3(char *, char *, char *, cmp_t *, void *);
97 med3(char *a, char *b, char *c, cmp_t *cmp, void *thunk in med3()
118 local_qsort(void *a, size_t n, size_t es, cmp_t *cmp, void *thunk) in local_qsort()
226 igraph_qsort_r(void *a, size_t n, size_t es, void *thunk, cmp_t *cmp) in igraph_qsort_r()
232 igraph_qsort_s(void *a, rsize_t n, rsize_t es, cmp_t *cmp, void *thunk) in igraph_qsort_s()
258 igraph_qsort(void *a, size_t n, size_t es, cmp_t *cmp) in igraph_qsort()
/dports/devel/arm-none-eabi-newlib/newlib-2.4.0/newlib/libc/search/
H A Dqsort.c82 typedef int cmp_t(void *, const void *, const void *); typedef
84 typedef int cmp_t(const void *, const void *, void *); typedef
86 typedef int cmp_t(const void *, const void *); typedef
88 static inline char *med3 _PARAMS((char *, char *, char *, cmp_t *, void *));
146 cmp_t *cmp _AND
165 cmp_t *cmp)
172 cmp_t *cmp _AND
181 cmp_t *cmp)
/dports/devel/tinygo/tinygo-0.14.1/lib/picolibc/newlib/libc/search/
H A Dqsort.c74 typedef int cmp_t(void *, const void *, const void *); typedef
76 typedef int cmp_t(const void *, const void *, void *); typedef
78 typedef int cmp_t(const void *, const void *); typedef
80 static inline char *med3 (char *, char *, char *, cmp_t *, void *);
136 cmp_t *cmp, in med3()
170 cmp_t *cmp) in __bsd_qsort_r()
176 cmp_t *cmp, in __bsd_qsort_r()
184 cmp_t *cmp) in __bsd_qsort_r()
/dports/science/netcdf/netcdf-c-4.7.4/ncdump/
H A Dref_tst_compounds3.cdl3 compound cmp_t {
6 }; // cmp_t
10 cmp_t var(n) ;
/dports/math/libmesh/libmesh-1.6.2/contrib/netcdf/netcdf-c-4.6.2/ncdump/
H A Dref_tst_compounds3.cdl3 compound cmp_t {
6 }; // cmp_t
10 cmp_t var(n) ;
/dports/graphics/cptutils/cptutils-1.74/src/common/
H A Didenttab.c91 typedef int (*cmp_t)(const void*, const void*); typedef
113 return (tsearch(ident, root, (cmp_t)cmp) == NULL ? 1 : 0); in tree_insert()
135 static ident_t* identtab_lookup(const void *key, void **root, cmp_t cmp) in identtab_lookup()
146 return identtab_lookup(&id, tab->ids, (cmp_t)ident_id_fcmp); in identtab_id_lookup()
151 return identtab_lookup(name, tab->names, (cmp_t)ident_name_fcmp); in identtab_name_lookup()
/dports/databases/speedtables/speedtables-1.13.12/ctables/
H A Dctable_qsort.c40 typedef int cmp_t(void *, const void *, const void *); typedef
42 typedef int cmp_t(const void *, const void *); typedef
44 static inline char *med3(char *, char *, char *, cmp_t *, void *);
92 med3(char *a, char *b, char *c, cmp_t *cmp, void *thunk in med3()
105 ctable_qsort_r(void *a, size_t n, size_t es, void *thunk, cmp_t *cmp) in ctable_qsort_r()
109 qsort(void *a, size_t n, size_t es, cmp_t *cmp) in ctable_qsort_r()
/dports/math/R-cran-igraph/igraph/src/
H A Dqsort.c54 typedef int cmp_t(void *, const void *, const void *); typedef
56 typedef int cmp_t(const void *, const void *); typedef
58 static inline char *med3(char *, char *, char *, cmp_t *, void *);
106 med3(char *a, char *b, char *c, cmp_t *cmp, void *thunk in med3()
118 igraph_qsort_r(void *a, size_t n, size_t es, void *thunk, cmp_t *cmp) in igraph_qsort_r()
122 igraph_qsort(void *a, size_t n, size_t es, cmp_t *cmp) in igraph_qsort_r()
/dports/astro/stellarsolver/stellarsolver-1.8/stellarsolver/astrometry/util/
H A Dqsort_reentrant.c42 typedef int cmp_t(void *, const void *, const void *); typedef
44 typedef int cmp_t(const void *, const void *); typedef
46 static __inline char *med3(char *, char *, char *, cmp_t *, void *);
94 med3(char *a, char *b, char *c, cmp_t *cmp, void *thunk in med3()
107 qsort_r(void *a, size_t n, size_t es, void *thunk, cmp_t *cmp) in qsort_r()
111 qsort(void *a, size_t n, size_t es, cmp_t *cmp) in qsort_r()
/dports/math/nlopt/nlopt-2.7.1/src/util/
H A Dqsort_r.c26 typedef int cmp_t(void *, const void *, const void *); typedef
28 static char *med3(char *, char *, char *, cmp_t *, void *);
54 med3(char *a, char *b, char *c, cmp_t *cmp, void *thunk) in med3()
62 void qsort_r_fallback(void *a, size_t n, size_t es, void *thunk, cmp_t *cmp) in qsort_r_fallback()
165 cmp_t* compar;
182 void nlopt_qsort_r(void *base_, size_t nmemb, size_t size, void *thunk, cmp_t* compar) in nlopt_qsort_r()
/dports/ftp/lftp/lftp-4.9.2/src/
H A Dxarray.h114 typedef int (*cmp_t)(const T*,const T*); typedef
115 void qsort(cmp_t cmp) { in qsort()
118 void insert_ordered(const T& n,cmp_t cmp) { in insert_ordered()
129 bool bsearch(const T &x,cmp_t cmp,int *pos) { in bsearch()
132 int bsearch(const T &x,cmp_t cmp) { in bsearch()
169 typedef int (*cmp_t)(const RefT*,const RefT*); typedef
170 void qsort(cmp_t cmp) { in qsort()
224 typedef int (*cmp_t)(const T**,const T**); typedef
225 void qsort(cmp_t cmp) { in qsort()
/dports/misc/rump/buildrump.sh-b914579/src/sys/lib/libsa/
H A Dqsort.c40 typedef int cmp_t(const void *, const void *); typedef
41 static inline char *med3(char *, char *, char *, cmp_t *);
46 void qsort(void *a, size_t n, size_t es, cmp_t *cmp);
85 med3(char *a, char *b, char *c, cmp_t *cmp) in med3()
93 qsort(void *a, size_t n, size_t es, cmp_t *cmp) in qsort()
/dports/devel/cc65/cc65-2.19/src/cc65/
H A Dcodeinfo.h119 } cmp_t; typedef
166 cmp_t FindBoolCmpCond (const char* Name);
172 cmp_t FindTosCmpCond (const char* Name);
/dports/databases/pecl-mongodb/mongodb-1.9.1/src/libmongoc/src/kms-message/src/
H A Dsort.h18 typedef int (*cmp_t) (const void *, const void *); typedef
21 insertionsort (unsigned char *a, size_t n, size_t size, cmp_t cmp);
/dports/databases/pecl-mongodb/mongodb-1.9.1/src/libmongocrypt/kms-message/src/
H A Dsort.h18 typedef int (*cmp_t) (const void *, const void *); typedef
21 insertionsort (unsigned char *a, size_t n, size_t size, cmp_t cmp);
/dports/devel/avr-libc/avr-libc-2.0.0/libc/stdlib/
H A Dqsort.c33 typedef int cmp_t(const void *, const void *); typedef
34 static char *med3(char *, char *, char *, cmp_t *);
66 med3(char *a, char *b, char *c, cmp_t *cmp) in med3()
75 qsort(void *a, size_t n, size_t es, cmp_t *cmp) in qsort()
/dports/math/lrcalc/lrcalc-1.3/src/
H A Dset.h10 typedef int (*cmp_t) (void *, void *); /* return 0 if equal */ typedef
16 cmp_t cmp;
51 set *s_new(cmp_t cm, hash_t hsh);
/dports/lang/spidermonkey78/firefox-78.9.0/xpcom/ds/
H A DnsQuickSort.cpp50 typedef int cmp_t(const void*, const void*, void*); typedef
51 static INLINE char* med3(char*, char*, char*, cmp_t*, void*);
89 static INLINE char* med3(char* a, char* b, char* c, cmp_t* cmp, void* data) { in med3()
95 void NS_QuickSort(void* a, unsigned int n, unsigned int es, cmp_t* cmp, in NS_QuickSort()
/dports/lang/spidermonkey60/firefox-60.9.0/xpcom/ds/
H A DnsQuickSort.cpp50 typedef int cmp_t(const void *, const void *, void *); typedef
51 static INLINE char *med3(char *, char *, char *, cmp_t *, void *);
89 static INLINE char *med3(char *a, char *b, char *c, cmp_t *cmp, void *data) { in med3()
95 void NS_QuickSort(void *a, unsigned int n, unsigned int es, cmp_t *cmp, in NS_QuickSort()
/dports/www/firefox-legacy/firefox-52.8.0esr/xpcom/glue/
H A DnsQuickSort.cpp50 typedef int cmp_t(const void *, const void *, void *); typedef
51 static INLINE char *med3(char *, char *, char *, cmp_t *, void *);
91 med3(char *a, char *b, char *c, cmp_t* cmp, void *data) in med3()
102 cmp_t *cmp, in NS_QuickSort()
/dports/mail/thunderbird/thunderbird-91.8.0/xpcom/ds/
H A DnsQuickSort.cpp50 typedef int cmp_t(const void*, const void*, void*); typedef
51 static INLINE char* med3(char*, char*, char*, cmp_t*, void*);
89 static INLINE char* med3(char* a, char* b, char* c, cmp_t* cmp, void* data) { in med3()
95 void NS_QuickSort(void* a, unsigned int n, unsigned int es, cmp_t* cmp, in NS_QuickSort()
/dports/www/firefox/firefox-99.0/xpcom/ds/
H A DnsQuickSort.cpp50 typedef int cmp_t(const void*, const void*, void*); typedef
51 static INLINE char* med3(char*, char*, char*, cmp_t*, void*);
89 static INLINE char* med3(char* a, char* b, char* c, cmp_t* cmp, void* data) { in med3()
95 void NS_QuickSort(void* a, unsigned int n, unsigned int es, cmp_t* cmp, in NS_QuickSort()
/dports/sysutils/uefi-edk2-bhyve-csm/uefi-edk2-aa8d718/StdLib/LibC/StdLib/
H A DQsort.c62 typedef int cmp_t(const void *, const void *); typedef
64 static __inline char *med3(char *, char *, char *, cmp_t *);
104 med3(char *a, char *b, char *c, cmp_t *cmp ) in med3()
125 qsort(void *a, size_t n, size_t es, cmp_t *cmp) in qsort()
/dports/www/firefox-esr/firefox-91.8.0/xpcom/ds/
H A DnsQuickSort.cpp50 typedef int cmp_t(const void*, const void*, void*); typedef
51 static INLINE char* med3(char*, char*, char*, cmp_t*, void*);
89 static INLINE char* med3(char* a, char* b, char* c, cmp_t* cmp, void* data) { in med3()
95 void NS_QuickSort(void* a, unsigned int n, unsigned int es, cmp_t* cmp, in NS_QuickSort()

12345