| /external/javasqlite/src/main/java/SQLite/JDBC2z/ |
| JDBCResultSet.java | 710 public java.sql.Array getArray(int columnIndex) throws SQLException {
714 public java.sql.Array getArray(String columnName) throws SQLException {
[all...] |
| /external/llvm/lib/CodeGen/ |
| RegAllocGreedy.cpp | 771 assert(T < GroupSize && "Array overflow");
780 assert(B < GroupSize && "Array overflow");
796 ArrayRef<SpillPlacement::BlockConstraint> Array(BCS, B);
797 SpillPlacer->addConstraints(Array);
802 ArrayRef<SpillPlacement::BlockConstraint> Array(BCS, B);
803 SpillPlacer->addConstraints(Array);
[all...] |
| /external/webkit/Source/JavaScriptCore/tests/mozilla/ecma/GlobalObject/ |
| 15.1.2.3-2.js | 72 var array = new Array();
75 array[item++] = new TestCase( SECTION, "parseFloat(true)", Number.NaN, parseFloat(true) );
76 array[item++] = new TestCase( SECTION, "parseFloat(false)", Number.NaN, parseFloat(false) );
77 array[item++] = new TestCase( SECTION, "parseFloat('string')", Number.NaN, parseFloat("string") );
79 array[item++] = new TestCase( SECTION, "parseFloat(' Infinity')", Number.POSITIVE_INFINITY, parseFloat("Infinity") );
80 // array[item++] = new TestCase( SECTION, "parseFloat(Infinity)", Number.POSITIVE_INFINITY, parseFloat(Infinity) );
82 array[item++] = new TestCase( SECTION, "parseFloat(' 0')", 0, parseFloat(" 0") );
83 array[item++] = new TestCase( SECTION, "parseFloat(' -0')", -0, parseFloat(" -0") );
84 array[item++] = new TestCase( SECTION, "parseFloat(' +0')", 0, parseFloat(" (…)
[all...] |
| /external/webkit/Source/JavaScriptCore/tests/mozilla/ecma/LexicalConventions/ |
| 7.7.3.js | 48 var array = new Array();
51 array[item++] = new TestCase( SECTION, "0", 0, 0 );
52 array[item++] = new TestCase( SECTION, "1", 1, 1 );
53 array[item++] = new TestCase( SECTION, "2", 2, 2 );
54 array[item++] = new TestCase( SECTION, "3", 3, 3 );
55 array[item++] = new TestCase( SECTION, "4", 4, 4 );
56 array[item++] = new TestCase( SECTION, "5", 5, 5 );
57 array[item++] = new TestCase( SECTION, "6", 6, 6 );
58 array[item++] = new TestCase( SECTION, "7", 7, 7 )
[all...] |
| 7.7.4.js | 46 var array = new Array();
51 array[item++] = new TestCase( SECTION, "\"\"", "", "" );
52 array[item++] = new TestCase( SECTION, "\'\'", "", '' );
55 array[item++] = new TestCase( SECTION, "\\\"", String.fromCharCode(0x0022), "\"" );
56 array[item++] = new TestCase( SECTION, "\\\'", String.fromCharCode(0x0027), "\'" );
57 array[item++] = new TestCase( SECTION, "\\", String.fromCharCode(0x005C), "\\" );
58 array[item++] = new TestCase( SECTION, "\\b", String.fromCharCode(0x0008), "\b" );
59 array[item++] = new TestCase( SECTION, "\\f", String.fromCharCode(0x000C), "\f" );
60 array[item++] = new TestCase( SECTION, "\\n", String.fromCharCode(0x000A), "\n" )
[all...] |
| /external/webkit/Source/JavaScriptCore/tests/mozilla/ecma/String/ |
| 15.5.3.2-1.js | 52 var array = new Array();
55 array[item++] = new TestCase( SECTION, "typeof String.fromCharCode", "function", typeof String.fromCharCode );
56 array[item++] = new TestCase( SECTION, "typeof String.prototype.fromCharCode", "undefined", typeof String.prototype.fromCharCode );
57 array[item++] = new TestCase( SECTION, "var x = new String(); typeof x.fromCharCode", "undefined", eval("var x = new String(); typeof x.fromCharCode") );
58 array[item++] = new TestCase( SECTION, "String.fromCharCode.length", 1, String.fromCharCode.length );
60 array[item++] = new TestCase( SECTION, "String.fromCharCode()", "", String.fromCharCode() );
61 array[item++] = new TestCase( SECTION, "String.fromCharCode(0x0020)", " ", String.fromCharCode(0x0020) );
62 array[item++] = new TestCase( SECTION, "String.fromCharCode(0x0021)", "!", String.fromCharCode(0x0021) );
63 array[item++] = new TestCase( SECTION, "String.fromCharCode(0x0022)", "\"", String.fromCharCode( (…)
[all...] |
| /external/webkit/Source/JavaScriptCore/tests/mozilla/ecma/TypeConversion/ |
| 9.3.1-3.js | 53 var testcases = new Array();
|
| /external/webkit/Tools/Scripts/webkitpy/tool/commands/data/rebaselineserver/ |
| main.js | 175 var displayDirectoryName = new Array(index * 6).join(' ') + pathDirectory;
|
| /libcore/luni/src/main/java/java/util/ |
| ArrayDeque.java | 13 * Resizable-array implementation of the {@link Deque} interface. Array
57 * The array in which the elements of the deque are stored.
58 * The capacity of the deque is the length of this array, which is
59 * always a power of two. The array is never allowed to become
63 * other. We also guarantee that all array cells not holding
87 // ****** Array allocation and resizing utilities ******
90 * Allocate empty array to hold the given number of elements.
134 * Copies the elements from our element array into the specified array,
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/ |
| LinkedBlockingQueue.java | 31 * Linked queues typically have higher throughput than array-based queues but
557 * Returns an array containing all of the elements in this queue, in
560 * <p>The returned array will be "safe" in that no references to it are
562 * a new array). The caller is thus free to modify the returned array.
564 * <p>This method acts as bridge between array-based and collection-based
567 * @return an array containing all of the elements in this queue
584 * Returns an array containing all of the elements in this queue, in
585 * proper sequence; the runtime type of the returned array is that of
586 * the specified array. If the queue fits in the specified array, i
[all...] |
| /development/scripts/app_engine_server/gae_shell/static/ |
| shell.js | 36 * The shell history. history is an array of strings, ordered oldest to
41 * element is added to the end of the array for the new statement, and
44 * @type {Array}
|
| /external/chromium/chrome/browser/resources/file_manager/js/ |
| exif_reader.js | 51 // Step three, read the file header into a byte array.
163 var ary = Array.apply(null, arguments);
|
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| ProgramState.h | 270 /// Get the lvalue for an array index.
514 SVal ArrayToPointer(Loc Array) {
515 return StoreMgr->ArrayToPointer(Array);
|
| /external/eigen/Eigen/src/Core/ |
| PlainObjectBase.h | 63 struct dense_xpr_base_dispatcher_for_doxygen<Array<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols> >
64 : public ArrayBase<Array<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols> > {};
195 /** \returns a const pointer to the data array of this matrix */
199 /** \returns a pointer to the data array of this matrix */
[all...] |
| /external/eigen/blas/ |
| chbmv.f | 7 * .. Array Arguments ..
51 * A - COMPLEX array of DIMENSION ( LDA, n ).
53 * by n part of the array A must contain the upper triangular
56 * ( k + 1 ) of the array, the first super-diagonal starting at
58 * of the array A is not referenced.
71 * by n part of the array A must contain the lower triangular
74 * the array, the first sub-diagonal starting at position 1 in
76 * array A is not referenced.
98 * X - COMPLEX array of DIMENSION at least
100 * Before entry, the incremented array X must contain th
[all...] |
| chpmv.f | 7 * .. Array Arguments ..
27 * array AP as follows:
46 * AP - COMPLEX array of DIMENSION at least
48 * Before entry with UPLO = 'U' or 'u', the array AP must
53 * Before entry with UPLO = 'L' or 'l', the array AP must
62 * X - COMPLEX array of dimension at least
64 * Before entry, the incremented array X must contain the n
78 * Y - COMPLEX array of dimension at least
80 * Before entry, the incremented array Y must contain the n
157 * Start the operations. In this version the elements of the array A
[all...] |
| chpr.f | 7 * .. Array Arguments ..
27 * array AP as follows:
46 * X - COMPLEX array of dimension at least
48 * Before entry, the incremented array X must contain the n
57 * AP - COMPLEX array of DIMENSION at least
59 * Before entry with UPLO = 'U' or 'u', the array AP must
63 * and a( 2, 2 ) respectively, and so on. On exit, the array
66 * Before entry with UPLO = 'L' or 'l', the array AP must
70 * and a( 3, 1 ) respectively, and so on. On exit, the array
136 * Start the operations. In this version the elements of the array A
[all...] |
| chpr2.f | 7 * .. Array Arguments ..
27 * array AP as follows:
46 * X - COMPLEX array of dimension at least
48 * Before entry, the incremented array X must contain the n
57 * Y - COMPLEX array of dimension at least
59 * Before entry, the incremented array Y must contain the n
68 * AP - COMPLEX array of DIMENSION at least
70 * Before entry with UPLO = 'U' or 'u', the array AP must
74 * and a( 2, 2 ) respectively, and so on. On exit, the array
77 * Before entry with UPLO = 'L' or 'l', the array AP mus
[all...] |
| ctbmv.f | 6 * .. Array Arguments ..
69 * A - COMPLEX array of DIMENSION ( LDA, n ).
71 * by n part of the array A must contain the upper triangular
74 * ( k + 1 ) of the array, the first super-diagonal starting at
76 * of the array A is not referenced.
89 * by n part of the array A must contain the lower triangular
92 * the array, the first sub-diagonal starting at position 1 in
94 * array A is not referenced.
106 * Note that when DIAG = 'U' or 'u' the elements of the array A
117 * X - COMPLEX array of dimension at leas
[all...] |
| ctpmv.f | 6 * .. Array Arguments ..
61 * AP - COMPLEX array of DIMENSION at least
63 * Before entry with UPLO = 'U' or 'u', the array AP must
68 * Before entry with UPLO = 'L' or 'l', the array AP must
77 * X - COMPLEX array of dimension at least
79 * Before entry, the incremented array X must contain the n
|
| ctpsv.f | 6 * .. Array Arguments ..
64 * AP - COMPLEX array of DIMENSION at least
66 * Before entry with UPLO = 'U' or 'u', the array AP must
71 * Before entry with UPLO = 'L' or 'l', the array AP must
80 * X - COMPLEX array of dimension at least
82 * Before entry, the incremented array X must contain the n
|
| dsbmv.f | 7 * .. Array Arguments ..
51 * A - DOUBLE PRECISION array of DIMENSION ( LDA, n ).
53 * by n part of the array A must contain the upper triangular
56 * ( k + 1 ) of the array, the first super-diagonal starting at
58 * of the array A is not referenced.
71 * by n part of the array A must contain the lower triangular
74 * the array, the first sub-diagonal starting at position 1 in
76 * array A is not referenced.
96 * X - DOUBLE PRECISION array of DIMENSION at least
98 * Before entry, the incremented array X must contain th
[all...] |
| dspmv.f | 7 * .. Array Arguments ..
27 * array AP as follows:
46 * AP - DOUBLE PRECISION array of DIMENSION at least
48 * Before entry with UPLO = 'U' or 'u', the array AP must
53 * Before entry with UPLO = 'L' or 'l', the array AP must
60 * X - DOUBLE PRECISION array of dimension at least
62 * Before entry, the incremented array X must contain the n
76 * Y - DOUBLE PRECISION array of dimension at least
78 * Before entry, the incremented array Y must contain the n
150 * Start the operations. In this version the elements of the array A
[all...] |
| dspr2.f | 7 * .. Array Arguments ..
27 * array AP as follows:
46 * X - DOUBLE PRECISION array of dimension at least
48 * Before entry, the incremented array X must contain the n
57 * Y - DOUBLE PRECISION array of dimension at least
59 * Before entry, the incremented array Y must contain the n
68 * AP - DOUBLE PRECISION array of DIMENSION at least
70 * Before entry with UPLO = 'U' or 'u', the array AP must
74 * and a( 2, 2 ) respectively, and so on. On exit, the array
77 * Before entry with UPLO = 'L' or 'l', the array AP mus
[all...] |
| dtbmv.f | 6 * .. Array Arguments ..
69 * A - DOUBLE PRECISION array of DIMENSION ( LDA, n ).
71 * by n part of the array A must contain the upper triangular
74 * ( k + 1 ) of the array, the first super-diagonal starting at
76 * of the array A is not referenced.
89 * by n part of the array A must contain the lower triangular
92 * the array, the first sub-diagonal starting at position 1 in
94 * array A is not referenced.
106 * Note that when DIAG = 'U' or 'u' the elements of the array A
117 * X - DOUBLE PRECISION array of dimension at leas
[all...] |
