HomeSort by relevance Sort by last modified time
    Searched refs:Array (Results 276 - 300 of 1046) sorted by null

<<11121314151617181920>>

  /external/deqp/framework/delibs/depool/
dePoolHashArray.h 23 * \brief Memory pool hash-array class.
37 * \brief Declare a template pool hash-array (array with hash) class interface.
38 * \param TYPENAME Type name of the declared hash-array.
41 * \param KEYARRAYTYPE Type of the key array.
42 * \param VALUEARRAYTYPE Type of the value array.
61 DE_DECLARE_POOL_ARRAY(TYPENAME##Array, VALUETYPE); \
67 TYPENAME##Array* array; \
80 return TYPENAME##Array_getNumElements(hashArray->array); \
    [all...]
  /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.jdt.debug_3.6.1.v20100715_r361/
plugin.properties 16 descriptionCollection=Array
  /external/eigen/bench/btl/libs/blitz/
blitz_interface.hh 25 #include <blitz/array.h>
43 typedef blitz::Array<real, 2> gene_matrix;
44 typedef blitz::Array<real, 1> gene_vector;
  /external/eigen/test/
rand.cpp 27 Array<int,1,Dynamic> mask(y-x+1);
42 Array<int,1,Dynamic> hist(bins);
  /external/guava/guava/src/com/google/common/collect/
ObjectArrays.java 24 import java.lang.reflect.Array;
42 * Returns a new array of the given length with the specified component type.
45 * @param length the length of the new array
47 @GwtIncompatible("Array.newInstance(Class, int)")
50 return (T[]) Array.newInstance(type, length);
54 * Returns a new array of the given length with the same type as a reference
55 * array.
57 * @param reference any array of the desired type
58 * @param length the length of the new array
65 * Returns a new array that contains the concatenated contents of two arrays
    [all...]
  /external/guava/guava-tests/test/com/google/common/collect/
ForwardingTestCase.java 24 import java.lang.reflect.Array;
117 return Array.newInstance(returnType.getComponentType(), 0);
  /external/libvncserver/webclients/novnc/include/
jsunzip.js 216 this.table = new Array(16); /* table of code length counts */
217 this.trans = new Array(288); /* code -> symbol translation table */
242 this.length_bits = new Array(30);
243 this.length_base = new Array(30);
246 this.dist_bits = new Array(30);
247 this.dist_base = new Array(30);
302 /* given an array of code lengths, build a tree */
305 var offs = new Array(16);
408 var lengths = new Array(288+32);
util.js 26 addFunc(Array, 'push8', function (num) {
31 addFunc(Array, 'push16', function (num) {
37 addFunc(Array, 'push32', function (num) {
49 addFunc(Array, 'map', function (fun /*, thisp*/) {
56 var res = new Array(len);
71 addFunc(Array, 'indexOf', function (elt /*, from*/) {
145 var aArgs = Array.prototype.slice.call(arguments, 1),
151 aArgs.concat(Array.prototype.slice.call(arguments)));
  /external/llvm/examples/OCaml-Kaleidoscope/Chapter6/
parser.ml 42 Ast.Call (id, Array.of_list (List.rev args))
160 Ast.Prototype (id, Array.of_list (List.rev args))
169 let args = Array.of_list (List.rev args) in
172 if Array.length args != kind
  /external/llvm/lib/CodeGen/
LiveIntervalUnion.cpp 184 void LiveIntervalUnion::Array::init(LiveIntervalUnion::Allocator &Alloc,
197 void LiveIntervalUnion::Array::clear() {
  /external/swiftshader/third_party/LLVM/examples/OCaml-Kaleidoscope/Chapter6/
parser.ml 42 Ast.Call (id, Array.of_list (List.rev args))
160 Ast.Prototype (id, Array.of_list (List.rev args))
169 let args = Array.of_list (List.rev args) in
172 if Array.length args != kind
  /external/v8/src/inspector/
injected_script_externs.js 37 * @return {!Array.<*>}
v8-console-message.cc 106 if (value->IsArray()) return append(v8::Local<v8::Array>::Cast(value));
125 bool append(v8::Local<v8::Array> array) {
127 if (it == array) return true;
129 uint32_t length = array->Length();
135 m_visitedArrays.push_back(array);
139 if (!array->Get(m_context, i).ToLocal(&value)) continue;
170 std::vector<v8::Local<v8::Array>> m_visitedArrays;
229 std::unique_ptr<protocol::Array<protocol::Runtime::RemoteObject>>
244 std::unique_ptr<protocol::Array<protocol::Runtime::RemoteObject>> args
    [all...]
  /frameworks/base/media/tests/MediaFrameworkTest/src/com/android/mediaframeworktest/unit/
ByteArrayHelpers.java 21 import java.lang.reflect.Array;
32 * Convert an array of byte primitives to a {@code byte[]} using native endian order.
37 * @param array array of primitives
38 * @return array
40 public static byte[] toByteArray(byte[] array) {
41 return array;
45 * Convert an array of shorts to a {@code byte[]} using native endian order.
47 * @param array array of short
    [all...]
  /frameworks/base/tools/aapt2/test/
Common.h 133 template std::ostream& operator<<<Array>(std::ostream&, const Array&);
  /frameworks/data-binding/compiler/src/main/java/android/databinding/tool/
MergedBinding.java 27 import java.lang.reflect.Array;
122 return result.toArray((T[]) Array.newInstance(klass, result.size()));
  /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/
SimpleImmutableEntryTest.java 22 import java.lang.reflect.Array;
122 Object array = Array.newInstance((byte[].class).getComponentType(), 10); local
123 assertEquals(10, ((byte[]) array).length);
  /prebuilts/misc/common/swig/include/2.0.11/ocaml/
std_vector.i 61 T *array = new T[self->size() + 1];
63 array[i] = (*self)[i];
64 return array;
72 let array_to_vector v argcons array =
73 for i = 0 to (Array.length array) - 1 do
74 (invoke v) "set" (C_list [ C_int i ; (argcons array.(i)) ])
78 let vector_to_array v argcons array =
80 array.(i) <- argcons ((invoke v) "[]" (C_int i))
87 val array_to_vector : c_obj -> ('a -> c_obj) -> 'a array -> c_ob
    [all...]
  /art/runtime/entrypoints/quick/
quick_entrypoints.h 33 class Array;
  /external/autotest/client/cros/tendo/n_faced_peerd/
dbus_property_exposer.py 42 dbus.Array([], 's'))
101 ARRAY<STRING> invalidated_properties);
  /external/autotest/client/site_tests/security_EnableChromeTesting/
security_EnableChromeTesting.py 50 # Pass an empty dbus.Array with the correct signature, taken from
52 empty_string_array = dbus.Array(signature="as")
  /external/caliper/examples/src/main/java/examples/
ListModificationBenchmark.java 37 Array {
54 @Param({"Array", "Linked"})
  /external/clang/test/Parser/
declarators.c 10 int f5(int [static]); /* expected-error {{'static' may not be used without an array size}} */
25 // Hard case for array decl, not Array[*].
26 int Array[*(int*)P+A];
  /external/eigen/Eigen/src/SparseCore/
SparseCompressedBase.h 68 /** \returns a const pointer to the array of values.
72 /** \returns a non-const pointer to the array of values.
77 /** \returns a const pointer to the array of inner indices.
81 /** \returns a non-const pointer to the array of inner indices.
86 /** \returns a const pointer to the array of the starting positions of the inner vectors.
91 /** \returns a non-const pointer to the array of the starting positions of the inner vectors.
97 /** \returns a const pointer to the array of the number of non zeros of the inner vectors.
101 /** \returns a non-const pointer to the array of the number of non zeros of the inner vectors.
109 /** \returns a read-only view of the stored coefficients as a 1D array expression.
114 const Map<const Array<Scalar,Dynamic,1> > coeffs() const { eigen_assert(isCompressed()); return Array<Scalar,Dynamic,1>: (…)
    [all...]
  /external/eigen/doc/special_examples/
Tutorial_sparse_example_details.cpp 39 Eigen::Array<unsigned char,Eigen::Dynamic,Eigen::Dynamic> bits = (x*255).cast<unsigned char>();

Completed in 315 milliseconds

<<11121314151617181920>>