/external/clang/tools/scan-build/ |
sorttable.js | 140 // build an array to sort. This is a Schwartzian transform thing, 447 // array-like enumeration 448 if (!Array.forEach) { // mozilla already supports this 449 Array.forEach = function(array, block, context) { 450 for (var i = 0; i < array.length; i++) { 451 block.call(context, array[i], i, array); 467 Array.forEach(string.split(""), function(chr, index) { 487 // the object is array-lik [all...] |
/external/eigen/Eigen/src/Core/ |
Array.h | 15 /** \class Array 20 * The %Array class is very similar to the Matrix class. It provides 22 * %Array and the %Matrix class is primarily in the API: the API for the 23 * %Array class provides easy access to coefficient-wise operations, while the 34 struct traits<Array<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols> > : traits<Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols> > 37 typedef ArrayBase<Array<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols> > XprBase; 42 class Array 43 : public PlainObjectBase<Array<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols> > 47 typedef PlainObjectBase<Array> Base; 48 EIGEN_DENSE_PUBLIC_INTERFACE(Array) [all...] |
Map.h | 19 * \brief A matrix or vector expression mapping an existing array of data. 25 * of an ordinary, contiguous array. This can be overridden by specifying strides. 28 * This class represents a matrix or vector expression mapping an existing array of data. 34 * Here's an example of simply mapping a contiguous array as a \ref TopicStorageOrders "column-major" matrix: 40 * Here's an example of mapping an array as a vector, specifying an inner stride, that is, the pointer 46 * Here's an example of mapping an array while specifying an outer stride. Here, since we're mapping 56 * \b Tip: to change the array of data mapped by a Map object, you can use the C++ 136 * \param data pointer to the array to map 147 * \param data pointer to the array to map 159 * \param data pointer to the array to ma [all...] |
/external/javassist/src/main/javassist/bytecode/annotation/ |
ArrayMemberValue.java | 20 import java.lang.reflect.Array; 24 * Array member. 34 * Constructs an array. The initial value or type are not specified. 43 * Constructs an array. The initial value is not specified. 45 * @param t the type of the array elements. 58 "no array elements found: " + method.getName()); 65 throw new ClassNotFoundException("broken array type: " 71 Object a = Array.newInstance(clazz, size); 73 Array.set(a, i, values[i].getValue(cl, cp, method)); 80 throw new ClassNotFoundException("no array type specified") [all...] |
/external/mesa3d/src/gallium/tools/trace/ |
model.py | 74 class Array(Node):
|
/frameworks/base/tools/preload/ |
sorttable.js | 140 // build an array to sort. This is a Schwartzian transform thing, 447 // array-like enumeration 448 if (!Array.forEach) { // mozilla already supports this 449 Array.forEach = function(array, block, context) { 450 for (var i = 0; i < array.length; i++) { 451 block.call(context, array[i], i, array); 467 Array.forEach(string.split(""), function(chr, index) { 487 // the object is array-lik [all...] |
/libcore/luni/src/main/java/java/security/cert/ |
TrustAnchor.java | 23 import org.apache.harmony.security.utils.Array; 35 * representation of a so called "Name Constraints" extension as a byte array. 257 sb.append(Array.toString(nameConstraints, " "));
|
/libcore/luni/src/main/java/org/apache/harmony/security/utils/ |
Array.java | 30 public class Array { 33 private Array() { 46 * Represents <code>array</code> as <code>String</code> 47 * for printing. Array length can be up to 32767 49 * @param array to be represented as <code>String</code> 51 * @return <code>String</code> representation of the <code>array</code> 53 public static String toString(byte[] array, String prefix) { 66 for (i=0; i<array.length; i++) { 79 sb.append(Byte.toHexString(array[i], false)); 81 int currentByte = (0xff & array[i]) [all...] |
/libcore/luni/src/main/java/org/apache/harmony/security/x509/ |
AuthorityKeyIdentifier.java | 33 import org.apache.harmony.security.utils.Array; 112 sb.append(Array.toString(keyIdentifier, prefix + " "));
|
/external/chromium_org/chrome/browser/resources/inspect/ |
inspect.js | 121 Array.prototype.forEach.call( 193 Array.prototype.forEach.call(
|
/external/chromium_org/chrome/common/extensions/docs/examples/apps/calculator/app/ |
view.js | 11 Array.prototype.forEach.call(this.buttons, function(button) {
|
/external/chromium_org/chrome/common/extensions/docs/examples/extensions/benchmark/ |
background.js | 28 window.results.data = new Array(); 40 var benchmarks = new Array(); 49 // Array Remove - By John Resig (MIT Licensed) 50 Array.prototype.remove = function(from, to) { 157 current_.startLoadResults = new Array(); // times to start 158 current_.commitLoadResults = new Array(); // times to commit 159 current_.docLoadResults = new Array(); // times to docload 160 current_.paintResults = new Array(); // times to paint 161 current_.totalResults = new Array(); // times to complete load 162 current_.KbytesRead = new Array(); [all...] |
/external/chromium_org/v8/test/mjsunit/ |
array-sort.js | 30 // Test array sort. 151 // Test array sorting with holes in the array. 164 // Test array sorting with undefined elemeents in the array. 175 // in the array. 193 Array.prototype.sort.call(obj); 209 var x = new Array(4); 213 Array.prototype.sort.call(x); 232 Array.prototype.sort.call(x) [all...] |
stack-traces.js | 249 testTrace("testArrayNative", testArrayNative, ["Array.map (native)"]); 263 testTrace("testAnonymousMethod", testAnonymousMethod, ["Array.<anonymous>"]); 303 Array.prototype.push = function(x) { assertUnreachable(); }; 304 Array.prototype.join = function(x) { assertUnreachable(); };
|
array-feedback.js | 43 // support_smi_only_arrays = %HasFastSmiElements(new Array(1,2,3,4,5,6,7,8)); 91 // array calls (as long as the call is made through an IC, and not 95 return Array(); 109 return Array(arg); 126 return Array(arg1, arg2, arg3); 145 name = "Array"; 158 return Array(); 165 var oldArray = this.Array; 166 this.Array = function() { return ["hi"]; }; 169 this.Array = oldArray [all...] |
/external/chromium_org/v8/tools/profviz/ |
composer.js | 28 Array.prototype.top = function() {
|
/external/llvm/include/llvm/CodeGen/ |
LiveIntervalUnion.h | 180 // Array of LiveIntervalUnions. 181 class Array { 185 Array() : Size(0), LIUs(0) {} 186 ~Array() { clear(); } 188 // Initialize the array to have Size entries.
|
/external/v8/test/mjsunit/ |
array-sort.js | 30 // Test array sort. 151 // Test array sorting with holes in the array. 164 // Test array sorting with undefined elemeents in the array. 175 // in the array. 193 Array.prototype.sort.call(obj); 209 var x = new Array(4); 213 Array.prototype.sort.call(x); 232 Array.prototype.sort.call(x) [all...] |
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/ |
externs.js | 70 /** @type {Array.<Node>} */ this.addedNodes = []; 71 /** @type {Array.<Node>} */ this.removedNodes = []; 76 * @param {function(Array.<WebKitMutation>)} callback 96 * @this {Array.<T>} 99 Array.prototype.remove = function(value, onlyFirst) {} 102 * @this {Array.<*>} 104 Array.prototype.keySet = function() {} 107 * @return {!Array.<T>} 108 * @this {Array.<T>} 111 Array.prototype.rotate = function(index) { [all...] |
/external/chromium_org/third_party/skia/include/utils/ |
SkJSON.h | 27 class Array; 48 * parameter is copied, but ownership of the Array parameter is 49 * transferred. The Array parameter may be null, but the name must 52 void addArray(const char name[], Array* value); 90 bool findArray(const char name[], Array** = NULL) const; 146 Array* arrayValue() const; 184 friend class Array; 187 class Array { 190 * Creates an array with the specified Type and element count. All 193 Array(Type, int count) [all...] |
/external/clang/test/CodeGen/ |
2002-07-14-MiscTests3.c | 9 int Array[12]; 111 int SumArray(int Array[], int Num) { 114 Result += Array[i];
|
/external/clang/test/Sema/ |
offsetof.c | 56 int test2[__builtin_offsetof(struct incomplete[10], [4].foo)]; // expected-error {{array has incomplete element type 'struct incomplete'}} 66 typedef struct Array { int array[1]; } Array; member in struct:Array 67 int test4 = __builtin_offsetof(Array, array); 70 return __builtin_offsetof(Array, array[*(int*)0]); // expected-warning{{indirection of non-volatile null pointer}} expected-note{{__builtin_trap}}
|
/external/skia/include/utils/ |
SkJSON.h | 27 class Array; 48 * parameter is copied, but ownership of the Array parameter is 49 * transferred. The Array parameter may be null, but the name must 52 void addArray(const char name[], Array* value); 90 bool findArray(const char name[], Array** = NULL) const; 146 Array* arrayValue() const; 184 friend class Array; 187 class Array { 190 * Creates an array with the specified Type and element count. All 193 Array(Type, int count) [all...] |
/libcore/luni/src/main/java/java/lang/reflect/ |
Array.java | 38 public final class Array { 39 private Array() { 43 throw new IllegalArgumentException("Not an array: " + o.getClass()); 47 throw new IllegalArgumentException("Array has incompatible type: " + o.getClass()); 50 private static RuntimeException badArray(Object array) { 51 if (array == null) { 52 throw new NullPointerException("array == null"); 53 } else if (!array.getClass().isArray()) { 54 throw notAnArray(array); 56 throw incompatibleType(array); [all...] |
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/multiprocessing/ |
__init__.py | 51 'Event', 'Queue', 'JoinableQueue', 'Pool', 'Value', 'Array', 243 Returns a shared array 255 def Array(typecode_or_type, size_or_initializer, **kwds): 257 Returns a synchronized shared array 259 from multiprocessing.sharedctypes import Array 260 return Array(typecode_or_type, size_or_initializer, **kwds)
|