/dports/misc/py-gluonnlp/gluon-nlp-0.10.0/src/gluonnlp/data/batchify/ |
H A D | batchify.py | 45 if isinstance(arrs[0], mx.nd.NDArray): 47 arrs = [arr.asnumpy() for arr in arrs] 48 elif not isinstance(arrs[0], np.ndarray): 49 arrs = [np.asarray(ele) for ele in arrs] 58 ret_shape = list(arrs[0].shape) 64 for i, arr in enumerate(arrs): 81 def _stack_arrs(arrs, use_shared_mem, dtype): argument 82 if isinstance(arrs[0], mx.nd.NDArray): 85 out = mx.nd.empty((len(arrs),) + arrs[0].shape, dtype=dtype, 89 return mx.nd.stack(*arrs) [all …]
|
/dports/security/vault/vault-1.8.2/vendor/github.com/snowflakedb/gosnowflake/vendor/github.com/apache/arrow/go/arrow/array/ |
H A D | record.go | 140 arrs []Interface member 154 copy(rec.arrs, cols) 155 for _, arr := range rec.arrs { 160 switch len(rec.arrs) { 182 for i, arr := range rec.arrs { 213 for _, arr := range rec.arrs { 216 rec.arrs = nil 234 arrs := make([]Interface, len(rec.arrs)) 235 for ii, arr := range rec.arrs { 239 for _, arr := range arrs { [all …]
|
/dports/www/grafana8/grafana-8.3.6/vendor/github.com/apache/arrow/go/arrow/array/ |
H A D | record.go | 140 arrs []Interface member 154 copy(rec.arrs, cols) 155 for _, arr := range rec.arrs { 160 switch len(rec.arrs) { 182 for i, arr := range rec.arrs { 213 for _, arr := range rec.arrs { 216 rec.arrs = nil 234 arrs := make([]Interface, len(rec.arrs)) 235 for ii, arr := range rec.arrs { 239 for _, arr := range arrs { [all …]
|
/dports/databases/arrow/apache-arrow-6.0.1/go/arrow/array/ |
H A D | record.go | 140 arrs []Interface member 154 copy(rec.arrs, cols) 155 for _, arr := range rec.arrs { 160 switch len(rec.arrs) { 182 for i, arr := range rec.arrs { 213 for _, arr := range rec.arrs { 216 rec.arrs = nil 234 arrs := make([]Interface, len(rec.arrs)) 235 for ii, arr := range rec.arrs { 239 for _, arr := range arrs { [all …]
|
/dports/security/vault/vault-1.8.2/vendor/github.com/apache/arrow/go/arrow/array/ |
H A D | record.go | 140 arrs []Interface member 154 copy(rec.arrs, cols) 155 for _, arr := range rec.arrs { 160 switch len(rec.arrs) { 182 for i, arr := range rec.arrs { 213 for _, arr := range rec.arrs { 216 rec.arrs = nil 234 arrs := make([]Interface, len(rec.arrs)) 235 for ii, arr := range rec.arrs { 239 for _, arr := range arrs { [all …]
|
/dports/misc/py-gluoncv/gluon-cv-0.9.0/gluoncv/data/ |
H A D | batchify.py | 28 arrs = [np.asarray(ele) for ele in arrs] 57 for i, arr in enumerate(arrs): 68 def _stack_arrs(arrs, use_shared_mem=False): argument 70 if isinstance(arrs[0], mx.nd.NDArray): 72 out = mx.nd.empty((len(arrs),) + arrs[0].shape, dtype=arrs[0].dtype, 74 return mx.nd.stack(*arrs, out=out) 76 return mx.nd.stack(*arrs) 78 out = np.asarray(arrs) 87 if isinstance(arrs[0], mx.nd.NDArray): 91 out = arrs [all …]
|
/dports/lang/fpc-source/fpc-3.2.2/tests/webtbs/ |
H A D | tw30203.pp | 34 arrs: array of String; 41 SetLength(arrs, 4); 42 arrs[0] := 'World'; 43 arrs[1] := 'Alpha'; 44 arrs[2] := 'Hello'; 45 arrs[3] := 'Foo'; 47 QuickSort<String>(arrs, Low(arrs), High(arrs));
|
H A D | tw30202.pp | 39 arrs: array of String; 46 SetLength(arrs, 4); 47 arrs[0] := 'World'; 48 arrs[1] := 'Alpha'; 49 arrs[2] := 'Hello'; 50 arrs[3] := 'Foo'; 52 TArray.QuickSort<String>(arrs, Low(arrs), High(arrs));
|
/dports/math/py-yt/yt-4.0.1/yt/utilities/lib/tests/ |
H A D | test_allocation_container.py | 16 arrs = bmp.to_arrays() 17 assert_equal(arrs[0].size, 100) 18 assert_equal(arrs[1].size, 200) 19 arrs[0][:] = 1 20 arrs = bmp.to_arrays() 21 assert_array_equal(arrs[0], 1)
|
/dports/lang/racket/racket-8.3/share/pkgs/math-lib/math/private/array/ |
H A D | untyped-array-pointwise.rkt | 32 (with-syntax ([(arrs ...) (generate-temporaries #'(arr-exprs ...))] 36 [arrs (ensure-array 'array-map arr-exprs)] ...) 37 (define ds (array-shape-broadcast (list (array-shape arr) (array-shape arrs) ...))) 39 [arrs (array-broadcast arrs ds)] ...) 41 (define procs (unsafe-array-proc arrs)) ... 67 [(f arr0 arr1 . arrs) 70 (map array-shape arrs)))) 73 [arrs (map (λ (arr) (array-broadcast arr ds)) arrs)]) 76 (define gs (map unsafe-array-proc arrs))
|
H A D | array-pointwise.rkt | 20 (define-syntax-rule (name arr0 arrs (... ...)) (array-map op arr0 arrs (... ...)))) 23 (define-syntax-rule (name arr0 arr1 arrs (... ...)) (array-map op arr0 arr1 arrs (... ...)))) 26 (define-syntax-rule (name arrs (... ...)) (array-map op arrs (... ...)))) 60 (define-syntax-rule (array-and arrs ...) (inline-array-map and arrs ...)) 61 (define-syntax-rule (array-or arrs ...) (inline-array-map or arrs ...))
|
H A D | typed-array-transform.rkt | 159 (define (array-broadcast-for-append arrs k) 160 (define dss (map (λ: ([arr : (Array A)]) (array-shape arr)) arrs)) 174 (define new-arrs 176 (values new-arrs dks))])) 180 (define (array-append* arrs [k 0]) 181 (when (null? arrs) (raise-argument-error 'array-append* "nonempty (Listof (Array A))" arrs)) 182 (let-values ([(arrs dks) (array-broadcast-for-append arrs k)]) 195 (let arrs-loop ([arrs arrs] [dks dks] [#{jk : Nonnegative-Fixnum} 0]) 196 (unless (null? arrs) 197 (define arr (car arrs)) [all …]
|
H A D | flarray-pointwise.rkt | 41 (with-syntax ([(arrs ...) (generate-temporaries #'(arr-exprs ...))] 46 [arrs : FlArray arr-exprs] ...) 48 (define dss (array-shape arrs)) ... 51 ds (inline-flvector-map f (flarray-data arr) (flarray-data arrs) ...))] 55 (define procs (unsafe-array-proc (array-broadcast arrs new-ds))) ... 71 [([f : (Float Float Float * -> Float)] [arr0 : FlArray] [arr1 : FlArray] . [arrs : FlArray *]) 73 (define dss (map (λ: ([arr : FlArray]) (array-shape arr)) (cons arr1 arrs))) 77 [arrs : (Listof (Array Float)) 78 (map (λ: ([arr : FlArray]) (array-broadcast arr new-ds)) arrs)]) 81 (define procs (map (λ: ([arr : (Array Float)]) (unsafe-array-proc arr)) arrs))
|
H A D | typed-array-pointwise.rkt | 22 [([f : (A B T ... T -> R)] [arr0 : (Array A)] [arr1 : (Array B)] . [arrs : (Array T) ... T]) 25 (map array-shape arrs)))) 28 [arrs (map (plambda: (S) ([arr : (Array S)]) (array-broadcast arr ds)) arrs)]) 31 (define gs (map unsafe-array-proc arrs))
|
H A D | fcarray-pointwise.rkt | 63 (with-syntax ([(arrs ...) (generate-temporaries #'(arr-exprs ...))] 70 [arrs : FCArray arr-exprs] ...) 72 (define dss (array-shape arrs)) ... 76 (define xss (fcarray-real-data arrs)) ... 77 (define yss (fcarray-imag-data arrs)) ... 96 [arrs : (Array Float-Complex) (array-broadcast arrs new-ds)] ...) 98 (define procs (unsafe-array-proc arrs)) ... 117 [arr0 : FCArray] [arr1 : FCArray] . [arrs : FCArray *]) 119 (define dss (map (λ: ([arr : FCArray]) (array-shape arr)) (cons arr1 arrs))) 123 [arrs : (Listof (Array Float-Complex)) [all …]
|
/dports/math/py-numpy/numpy-1.20.3/numpy/core/ |
H A D | shape_base.py | 280 arrs = atleast_2d(*tup) 281 if not isinstance(arrs, list): 282 arrs = [arrs] 283 return _nx.concatenate(arrs, 0) 339 arrs = atleast_1d(*tup) 340 if not isinstance(arrs, list): 341 arrs = [arrs] 343 if arrs and arrs[0].ndim == 1: 344 return _nx.concatenate(arrs, 0) 346 return _nx.concatenate(arrs, 1) [all …]
|
/dports/misc/py-mxnet/incubator-mxnet-1.9.0/src/operator/custom/ |
H A D | custom-inl.h | 76 bool training, const std::vector<NDArray>& arrs, 89 for (size_t i = 0, out_idx = 0; i < arrs.size(); i++) { 90 if (arrs[i].storage_type() == kDefaultStorage || 91 arrs[i].storage_type() == kUndefinedStorage) 94 outputs[out_idx].SparseUpdateChunk(arrs[i]); 124 for (const auto& i : arrs) { 139 for (const auto& i : arrs) { 147 for (size_t i = 0, out_idx = 0; i < arrs.size(); i++) { 148 if (arrs[i].storage_type() == kDefaultStorage || 149 arrs[i].storage_type() == kUndefinedStorage) [all …]
|
/dports/misc/mxnet/incubator-mxnet-1.9.0/src/operator/custom/ |
H A D | custom-inl.h | 76 bool training, const std::vector<NDArray>& arrs, 89 for (size_t i = 0, out_idx = 0; i < arrs.size(); i++) { 90 if (arrs[i].storage_type() == kDefaultStorage || 91 arrs[i].storage_type() == kUndefinedStorage) 94 outputs[out_idx].SparseUpdateChunk(arrs[i]); 124 for (const auto& i : arrs) { 139 for (const auto& i : arrs) { 147 for (size_t i = 0, out_idx = 0; i < arrs.size(); i++) { 148 if (arrs[i].storage_type() == kDefaultStorage || 149 arrs[i].storage_type() == kUndefinedStorage) [all …]
|
/dports/math/py-PyWavelets/pywt-1.2.0/pywt/tests/ |
H A D | test_concurrent.py | 47 arrs = [x.copy() for _ in range(100)] 49 results = list(ex.map(transform, arrs)) 64 arrs = [x.copy() for _ in range(100)] 66 results = list(ex.map(transform, arrs)) 81 arrs = [x.copy() for _ in range(100)] 83 results = list(ex.map(transform, arrs)) 98 arrs = [sst.copy() for _ in range(50)] 100 results = list(ex.map(transform, arrs))
|
/dports/databases/mongodb36/mongodb-src-r3.6.23/src/mongo/db/repl/ |
H A D | idempotency_document_structure.cpp | 76 std::vector<BSONArray>* arrs) { in _enumerateFixedLenArrs() argument 79 arrs->push_back(arr); in _enumerateFixedLenArrs() 91 _enumerateFixedLenArrs(nextElementConfig, scalarGenerator, scalarArr.arr(), arrs); in _enumerateFixedLenArrs() 105 _enumerateFixedLenArrs(nextElementConfig, scalarGenerator, arrayArr.arr(), arrs); in _enumerateFixedLenArrs() 116 _enumerateFixedLenArrs(nextElementConfig, scalarGenerator, docArr.arr(), arrs); in _enumerateFixedLenArrs() 186 std::vector<BSONArray> arrs; in _enumerateArrs() local 196 _enumerateFixedLenArrs(nextConfig, scalarGenerator, emptyArr, &arrs); in _enumerateArrs() 199 return arrs; in _enumerateArrs()
|
/dports/science/smoldyn/smoldyn-2.67/source/BioNetGen/Perl2/Visualization/ |
H A D | VisOptParse.pm | 17 my ($names,$arrs) = getblocks(\@lines,['background','classes','toggle','filter']); 26 my @arr = @{$arrs->[$i]}; 88 my @arrs = (); 110 push @arrs,\@arr2; 122 return (\@names,\@arrs);
|
/dports/graphics/piglit/piglit-136a7f5fa0703603be1ffb338abe4865e76a8058/tests/cl/program/execute/ |
H A D | program-scope-arrays.cl | 182 } arrs[] = { 191 outa[i] = arrs[1].a; 192 outb[i] = arrs[1].b; 197 outa[i] = arrs[c].a; 198 outb[i] = arrs[c].b; 203 outa[i] = arrs[i].a; 204 outb[i] = arrs[i].b; 209 outa[i] = arrs[in[i]].a; 210 outb[i] = arrs[in[i]].b;
|
/dports/lang/gcc12-devel/gcc-12-20211205/libphobos/libdruntime/core/internal/array/ |
H A D | concatenation.d | 12 private extern (C) void[] _d_arraycatnTX(const TypeInfo ti, scope byte[][] arrs) pure nothrow; 33 ResultArrT _d_arraycatnTX(scope const Tarr arrs) @trusted pure nothrow in _d_arraycatnTX() argument 40 byte[][] arrs2 = (cast(byte[]*)arrs.ptr)[0 .. arrs.length]; in _d_arraycatnTX()
|
/dports/biology/bowtie/bowtie-1.3.1/ |
H A D | ebwt.h | 2087 countUpToEx(l, arrs); 2190 countUpToEx(l, arrs); 2191 arrs[rowL(l)]++; 2216 arrs[0] = (ac[0] - arrs[0] + this->_fchr[0]); 2217 arrs[1] = (ac[1] - arrs[1] + this->_fchr[1]); 2218 arrs[2] = (gt[0] - arrs[2] + this->_fchr[2]); 2219 arrs[3] = (gt[1] - arrs[3] + this->_fchr[3]); 2299 countUpToEx(l, arrs); 2309 WITHIN_FCHR(arrs); 2327 WITHIN_FCHR(arrs); [all …]
|
/dports/lang/racket/racket-8.3/share/pkgs/math-lib/math/private/matrix/ |
H A D | typed-matrix-arithmetic.rkt | 29 [([f : (A B T ... T -> R)] [arr0 : (Matrix A)] [arr1 : (Matrix B)] . [arrs : (Matrix T) ... T]) 30 (define-values (m n) (apply matrix-shapes 'matrix-map arr0 arr1 arrs)) 33 (define gs (map unsafe-array-proc arrs)) 59 [([arr0 : (Matrix Number)] [arr1 : (Matrix Number)] . [arrs : (Matrix Number) *]) 62 [arrs : (Listof (Matrix Number)) arrs]) 63 (cond [(empty? arrs) #t] 64 [else (and (matrix=? arr1 (first arrs)) 65 (loop (first arrs) (rest arrs)))])))]))
|