/dports/math/piranha/piranha-0.11/tests/ |
H A D | kronecker_monomial_01.cpp | 82 k_type k1; in operator ()() 121 k_type k10; in operator ()() 124 k_type k11; in operator ()() 205 k_type k1; in operator ()() 234 k_type k1; in operator ()() 272 k_type k1; in operator ()() 306 k_type k1; in operator ()() 558 k_type k1; in operator ()() 611 k_type k1; in operator ()() 678 k_type k1; in operator ()() [all …]
|
H A D | real_trigonometric_kronecker_monomial_01.cpp | 80 k_type k1; in operator ()() 94 k_type k3; in operator ()() 1720 BOOST_CHECK(!(k_type{} < k_type{})); in operator ()() 1721 BOOST_CHECK(!(k_type{0, true} < k_type{0, true})); in operator ()() 1722 BOOST_CHECK((k_type{0, false} < k_type{0, true})); in operator ()() 1723 BOOST_CHECK(!(k_type{0, true} < k_type{0, false})); in operator ()() 1724 BOOST_CHECK((k_type{1, true} < k_type{2, true})); in operator ()() 1725 BOOST_CHECK(!(k_type{2, true} < k_type{1, true})); in operator ()() 1726 BOOST_CHECK((k_type{1, false} < k_type{2, false})); in operator ()() 1727 BOOST_CHECK(!(k_type{2, false} < k_type{1, false})); in operator ()() [all …]
|
H A D | monomial_01.cpp | 685 k_type k1; in operator ()() 690 k_type k2(vs); in operator ()() 710 k_type k7; in operator ()() 780 k_type k1; in operator ()() 907 k_type k1; in operator ()() 989 k_type k1; in operator ()() 1071 k_type k1; in operator ()() 1134 k_type k1; in operator ()() 1218 k_type k1; in operator ()() 1263 using k_type = U; in overflow_check() typedef [all …]
|
H A D | kronecker_monomial_02.cpp | 114 using k_type = kronecker_monomial<T>; in operator ()() typedef 115 using w_type = boost_s11n_key_wrapper<k_type>; in operator ()() 138 k_type k; in operator ()() 140 k = k_type(expos); in operator ()() 165 k_type retval{T(1), T(2)}; in operator ()() 177 BOOST_CHECK((retval == k_type{T(1), T(2)})); in operator ()() 211 typedef kronecker_monomial<T> k_type; in operator ()() typedef 229 k_type k; in operator ()() 231 k = k_type(expos); in operator ()() 253 k_type retval{T(2)}; in operator ()() [all …]
|
H A D | real_trigonometric_kronecker_monomial_02.cpp | 110 using k_type = real_trigonometric_kronecker_monomial<T>; in operator ()() typedef 111 using w_type = boost_s11n_key_wrapper<k_type>; in operator ()() 135 k_type k; in operator ()() 137 k = k_type(expos.begin(), expos.end()); in operator ()() 161 boost_save(oa, w_type{k_type{}, symbol_set{}}); in operator ()() 163 k_type retval{T(1), T(2)}; in operator ()() 176 BOOST_CHECK((retval == k_type{T(1), T(2)})); in operator ()() 215 BOOST_CHECK((key_has_msgpack_convert<k_type>::value)); in operator ()() 229 k_type k; in operator ()() 256 k_type retval{T(2)}; in operator ()() [all …]
|
/dports/math/py-piranha/piranha-0.11/tests/ |
H A D | kronecker_monomial_01.cpp | 82 k_type k1; in operator ()() 121 k_type k10; in operator ()() 124 k_type k11; in operator ()() 205 k_type k1; in operator ()() 234 k_type k1; in operator ()() 272 k_type k1; in operator ()() 306 k_type k1; in operator ()() 558 k_type k1; in operator ()() 611 k_type k1; in operator ()() 678 k_type k1; in operator ()() [all …]
|
H A D | real_trigonometric_kronecker_monomial_01.cpp | 80 k_type k1; in operator ()() 94 k_type k3; in operator ()() 1720 BOOST_CHECK(!(k_type{} < k_type{})); in operator ()() 1721 BOOST_CHECK(!(k_type{0, true} < k_type{0, true})); in operator ()() 1722 BOOST_CHECK((k_type{0, false} < k_type{0, true})); in operator ()() 1723 BOOST_CHECK(!(k_type{0, true} < k_type{0, false})); in operator ()() 1724 BOOST_CHECK((k_type{1, true} < k_type{2, true})); in operator ()() 1725 BOOST_CHECK(!(k_type{2, true} < k_type{1, true})); in operator ()() 1726 BOOST_CHECK((k_type{1, false} < k_type{2, false})); in operator ()() 1727 BOOST_CHECK(!(k_type{2, false} < k_type{1, false})); in operator ()() [all …]
|
H A D | monomial_01.cpp | 685 k_type k1; in operator ()() 690 k_type k2(vs); in operator ()() 710 k_type k7; in operator ()() 780 k_type k1; in operator ()() 907 k_type k1; in operator ()() 989 k_type k1; in operator ()() 1071 k_type k1; in operator ()() 1134 k_type k1; in operator ()() 1218 k_type k1; in operator ()() 1263 using k_type = U; in overflow_check() typedef [all …]
|
H A D | real_trigonometric_kronecker_monomial_02.cpp | 110 using k_type = real_trigonometric_kronecker_monomial<T>; in operator ()() typedef 111 using w_type = boost_s11n_key_wrapper<k_type>; in operator ()() 135 k_type k; in operator ()() 137 k = k_type(expos.begin(), expos.end()); in operator ()() 161 boost_save(oa, w_type{k_type{}, symbol_set{}}); in operator ()() 163 k_type retval{T(1), T(2)}; in operator ()() 176 BOOST_CHECK((retval == k_type{T(1), T(2)})); in operator ()() 215 BOOST_CHECK((key_has_msgpack_convert<k_type>::value)); in operator ()() 229 k_type k; in operator ()() 256 k_type retval{T(2)}; in operator ()() [all …]
|
H A D | kronecker_monomial_02.cpp | 114 using k_type = kronecker_monomial<T>; in operator ()() typedef 115 using w_type = boost_s11n_key_wrapper<k_type>; in operator ()() 138 k_type k; in operator ()() 140 k = k_type(expos); in operator ()() 165 k_type retval{T(1), T(2)}; in operator ()() 177 BOOST_CHECK((retval == k_type{T(1), T(2)})); in operator ()() 211 typedef kronecker_monomial<T> k_type; in operator ()() typedef 229 k_type k; in operator ()() 231 k = k_type(expos); in operator ()() 253 k_type retval{T(2)}; in operator ()() [all …]
|
/dports/shells/ksh93-devel/ast-cc1bca27/src/lib/libvdelta/ |
H A D | vdexpand.c | 42 reg int inst, k_type, n; local 51 k_type = K_GET(inst); 53 if(!VD_ISCOPY(k_type)) 54 { if(K_ISMERGE(k_type)) /* merge/add instruction */ 70 if(K_ISMERGE(k_type)) 72 k_type -= K_MERGE; 87 if(k_type >= K_QUICK && k_type < (K_QUICK+K_QTYPE) ) 89 copy = tab->quick[copy + ((k_type-K_QUICK)<<VD_BITS)]; 93 if(k_type >= K_RECENT && k_type < (K_RECENT+K_RTYPE) ) 94 copy += tab->recent[k_type - K_RECENT]; [all …]
|
H A D | vdsqueeze.c | 61 reg int n_add, i_add, i_copy, k_type; local 67 k_type = 0; 73 k_type = K_SELF; 76 k_type = K_HERE; 82 k_type = K_RECENT+n; 89 k_type = K_QUICK+d; 99 if(MERGABLE(n_add,n_copy,k_type) ) 104 { i_copy = K_PUT(k_type); 113 if(!MERGABLE(n_add,n_copy,k_type) ) 123 { if(!MERGABLE(n_add,n_copy,k_type)) [all …]
|
H A D | vdupdate.c | 61 reg int inst, k_type, n, r; local 76 k_type = K_GET(inst); 78 if(!VD_ISCOPY(k_type)) 79 { if(K_ISMERGE(k_type)) /* merge/add instruction */ 117 if(K_ISMERGE(k_type)) 119 k_type -= K_MERGE; 140 if(k_type >= K_QUICK && k_type < (K_QUICK+K_QTYPE) ) 141 copy = tab->quick[copy + ((k_type-K_QUICK)<<VD_BITS)]; 146 if(k_type >= K_RECENT && k_type < (K_RECENT+K_RTYPE) ) 147 copy += tab->recent[k_type - K_RECENT]; [all …]
|
/dports/shells/ksh93/ast-93u/src/lib/libvdelta/ |
H A D | vdexpand.c | 42 reg int inst, k_type, n; local 51 k_type = K_GET(inst); 53 if(!VD_ISCOPY(k_type)) 54 { if(K_ISMERGE(k_type)) /* merge/add instruction */ 70 if(K_ISMERGE(k_type)) 72 k_type -= K_MERGE; 87 if(k_type >= K_QUICK && k_type < (K_QUICK+K_QTYPE) ) 89 copy = tab->quick[copy + ((k_type-K_QUICK)<<VD_BITS)]; 93 if(k_type >= K_RECENT && k_type < (K_RECENT+K_RTYPE) ) 94 copy += tab->recent[k_type - K_RECENT]; [all …]
|
H A D | vdsqueeze.c | 61 reg int n_add, i_add, i_copy, k_type; local 67 k_type = 0; 73 k_type = K_SELF; 76 k_type = K_HERE; 82 k_type = K_RECENT+n; 89 k_type = K_QUICK+d; 99 if(MERGABLE(n_add,n_copy,k_type) ) 104 { i_copy = K_PUT(k_type); 113 if(!MERGABLE(n_add,n_copy,k_type) ) 123 { if(!MERGABLE(n_add,n_copy,k_type)) [all …]
|
H A D | vdupdate.c | 61 reg int inst, k_type, n, r; local 76 k_type = K_GET(inst); 78 if(!VD_ISCOPY(k_type)) 79 { if(K_ISMERGE(k_type)) /* merge/add instruction */ 117 if(K_ISMERGE(k_type)) 119 k_type -= K_MERGE; 140 if(k_type >= K_QUICK && k_type < (K_QUICK+K_QTYPE) ) 141 copy = tab->quick[copy + ((k_type-K_QUICK)<<VD_BITS)]; 146 if(k_type >= K_RECENT && k_type < (K_RECENT+K_RTYPE) ) 147 copy += tab->recent[k_type - K_RECENT]; [all …]
|
/dports/shells/ast-ksh/ast-ksh93v/src/lib/libvdelta/ |
H A D | vdexpand.c | 42 reg int inst, k_type, n; local 51 k_type = K_GET(inst); 53 if(!VD_ISCOPY(k_type)) 54 { if(K_ISMERGE(k_type)) /* merge/add instruction */ 70 if(K_ISMERGE(k_type)) 72 k_type -= K_MERGE; 87 if(k_type >= K_QUICK && k_type < (K_QUICK+K_QTYPE) ) 89 copy = tab->quick[copy + ((k_type-K_QUICK)<<VD_BITS)]; 93 if(k_type >= K_RECENT && k_type < (K_RECENT+K_RTYPE) ) 94 copy += tab->recent[k_type - K_RECENT]; [all …]
|
H A D | vdsqueeze.c | 61 reg int n_add, i_add, i_copy, k_type; local 67 k_type = 0; 73 k_type = K_SELF; 76 k_type = K_HERE; 82 k_type = K_RECENT+n; 89 k_type = K_QUICK+d; 99 if(MERGABLE(n_add,n_copy,k_type) ) 104 { i_copy = K_PUT(k_type); 113 if(!MERGABLE(n_add,n_copy,k_type) ) 123 { if(!MERGABLE(n_add,n_copy,k_type)) [all …]
|
H A D | vdupdate.c | 61 reg int inst, k_type, n, r; local 76 k_type = K_GET(inst); 78 if(!VD_ISCOPY(k_type)) 79 { if(K_ISMERGE(k_type)) /* merge/add instruction */ 117 if(K_ISMERGE(k_type)) 119 k_type -= K_MERGE; 140 if(k_type >= K_QUICK && k_type < (K_QUICK+K_QTYPE) ) 141 copy = tab->quick[copy + ((k_type-K_QUICK)<<VD_BITS)]; 146 if(k_type >= K_RECENT && k_type < (K_RECENT+K_RTYPE) ) 147 copy += tab->recent[k_type - K_RECENT]; [all …]
|
/dports/net-mgmt/bosun/bosun-0.9.0-preview/vendor/github.com/siddontang/ledisdb/tools/redis_import/ |
H A D | redis_import.py | 33 def set_ttl(redis_client, ledis_client, key, k_type): argument 43 k_types[k_type](key, timeout) 48 k_type = redis_client.type(key) 50 if k_type == "string": 53 set_ttl(redis_client, ledis_client, key, k_type) 56 elif k_type == "list": 60 set_ttl(redis_client, ledis_client, key, k_type) 63 elif k_type == "hash": 66 set_ttl(redis_client, ledis_client, key, k_type) 69 elif k_type == "zset": [all …]
|
/dports/editors/uemacs/uemacs-4.0/src/ |
H A D | bind.c | 153 ktp->k_type = BINDFNC; 167 ktp->k_type = BINDNUL; 238 ktp->k_type = BINDBUF; 252 ktp->k_type = BINDNUL; 315 while (ktp->k_type != BINDNUL) 321 sktp->k_type = ktp->k_type; 322 if (sktp->k_type == BINDFNC) 329 ktp->k_type = BINDNUL; 1049 key->k_type = BINDNUL; 1056 key->k_type = BINDFNC; [all …]
|
/dports/devel/libfirm/libfirm-1.21.0/ir/tr/ |
H A D | type_t.h | 279 assert(tp && tp->kind == k_type); in _get_type_link() 285 assert(tp && tp->kind == k_type); in _set_type_link() 291 assert(tp && tp->kind == k_type); in _get_type_tpop() 297 assert(tp && tp->kind == k_type); in _get_type_tpop_nameid() 303 assert(tp && tp->kind == k_type); in _get_type_tpop_code() 309 assert(tp && tp->kind == k_type); in _get_type_mode() 315 assert(tp && tp->kind == k_type); in _get_type_size_bytes() 321 assert(tp && tp->kind == k_type); in _get_type_state() 327 assert(tp && tp->kind == k_type); in _get_type_visited() 333 assert(tp && tp->kind == k_type); in _set_type_visited() [all …]
|
/dports/shells/ksh93/ast-93u/src/lib/libvdelta/vd01/ |
H A D | vdupdate01.c | 59 reg int inst, k_type, n, r; local 74 k_type = K_GET(inst); 76 if(!VD_ISCOPY(k_type)) 77 { if(K_ISMERGE(k_type)) /* merge/add instruction */ 115 if(K_ISMERGE(k_type)) 117 k_type -= K_MERGE; 138 if(k_type >= K_QUICK && k_type < (K_QUICK+K_QTYPE) ) 139 copy = tab->quick[copy + ((k_type-K_QUICK)<<VD_BITS)]; 144 if(k_type >= K_RECENT && k_type < (K_RECENT+K_RTYPE) ) 145 copy += tab->recent[k_type - K_RECENT]; [all …]
|
/dports/shells/ksh93-devel/ast-cc1bca27/src/lib/libvdelta/vd01/ |
H A D | vdupdate01.c | 59 reg int inst, k_type, n, r; local 74 k_type = K_GET(inst); 76 if(!VD_ISCOPY(k_type)) 77 { if(K_ISMERGE(k_type)) /* merge/add instruction */ 115 if(K_ISMERGE(k_type)) 117 k_type -= K_MERGE; 138 if(k_type >= K_QUICK && k_type < (K_QUICK+K_QTYPE) ) 139 copy = tab->quick[copy + ((k_type-K_QUICK)<<VD_BITS)]; 144 if(k_type >= K_RECENT && k_type < (K_RECENT+K_RTYPE) ) 145 copy += tab->recent[k_type - K_RECENT]; [all …]
|
/dports/shells/ast-ksh/ast-ksh93v/src/lib/libvdelta/vd01/ |
H A D | vdupdate01.c | 59 reg int inst, k_type, n, r; local 74 k_type = K_GET(inst); 76 if(!VD_ISCOPY(k_type)) 77 { if(K_ISMERGE(k_type)) /* merge/add instruction */ 115 if(K_ISMERGE(k_type)) 117 k_type -= K_MERGE; 138 if(k_type >= K_QUICK && k_type < (K_QUICK+K_QTYPE) ) 139 copy = tab->quick[copy + ((k_type-K_QUICK)<<VD_BITS)]; 144 if(k_type >= K_RECENT && k_type < (K_RECENT+K_RTYPE) ) 145 copy += tab->recent[k_type - K_RECENT]; [all …]
|