| /external/easymock/src/org/easymock/internal/ |
| LastControl.java | 80 assertState(stack.size() >= count, "" + count + " matchers expected, "
81 + stack.size() + " recorded.");
83 result.addAll(stack.subList(stack.size() - count, stack.size()));
|
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.test.performance.ui/src/org/eclipse/test/internal/performance/results/model/ |
| ScenarioResultsElement.java | 82 int size = descriptors.size(); local
83 IPropertyDescriptor[] descriptorsArray = new IPropertyDescriptor[size];
86 for (int i=2; i<size; i++) {
|
| /external/eigen/Eigen/src/Core/ |
| Transpositions.h | 81 inline Index size() const { return indices().size(); } function in class:Eigen::TranspositionsBase
101 /** Resizes to given size. */
110 for(int i = 0; i < indices().size(); ++i)
121 for(Index k=0 ; k<size() ; ++k)
129 for(Index k=size()-1 ; k>=0 ; --k)
201 /** Constructs an uninitialized permutation matrix of given size.
203 inline Transpositions(Index size) : m_indices(size)
241 inline Map(const Index* indicesPtr, Index size)
376 const int size = m_transpositions.size(); local
410 inline int size() const { return m_transpositions.size(); } function in class:Eigen::Transpose
[all...] |
| /external/eigen/Eigen/src/Core/products/ |
| SelfadjointMatrixMatrix.h | 79 enum { PacketSize = packet_traits<Scalar>::size };
250 Index size = rows; local
257 Index kc = size; // cache block size along the K direction
258 Index mc = rows; // cache block size along the M direction
259 Index nc = cols; // cache block size along the N direction
275 for(Index k2=0; k2<size; k2+=kc)
277 const Index actual_kc = (std::min)(k2+kc,size)-k2;
298 const Index actual_mc = (std::min)(k2+kc,size)-k2;
305 for(Index i2=k2+kc; i2<size; i2+=mc
341 Index size = cols; local
[all...] |
| /external/eigen/Eigen/src/SparseCore/ |
| AmbiVector.h | 30 AmbiVector(Index size)
33 resize(size);
54 void resize(Index size)
56 if (m_allocatedSize < size)
57 reallocate(size);
58 m_size = size;
61 Index size() const { return m_size; } function in class:Eigen::internal::AmbiVector
65 void reallocate(Index size)
67 // if the size of the matrix is not too large, let's allocate a bit more than needed such
70 if (size<1000
[all...] |
| CompressedStorage.h | 39 CompressedStorage(size_t size)
42 resize(size);
53 resize(other.size());
73 void reserve(size_t size)
75 size_t newAllocatedSize = m_size + size;
86 void resize(size_t size, double reserveSizeFactor = 0)
88 if (m_allocatedSize<size)
89 reallocate(size + size_t(reserveSizeFactor*double(size)));
90 m_size = size;
101 inline size_t size() const { return m_size; } function in class:Eigen::internal::CompressedStorage
[all...] |
| /external/eigen/test/ |
| block.cpp | 104 // same tests with mixed fixed/dynamic size
185 Index size = m.size(); local
208 for (int i=0;i<size;++i)
|
| packetmath.cpp | 26 template<typename Scalar> bool areApproxAbs(const Scalar* a, const Scalar* b, int size, const typename NumTraits<Scalar>::Real& refvalue)
28 for (int i=0; i<size; ++i)
32 std::cout << "[" << Map<const Matrix<Scalar,1,Dynamic> >(a,size) << "]" << " != " << Map<const Matrix<Scalar,1,Dynamic> >(b,size) << "\n";
39 template<typename Scalar> bool areApprox(const Scalar* a, const Scalar* b, int size)
41 for (int i=0; i<size; ++i)
45 std::cout << "[" << Map<const Matrix<Scalar,1,Dynamic> >(a,size) << "]" << " != " << Map<const Matrix<Scalar,1,Dynamic> >(b,size) << "\n";
104 const int PacketSize = internal::packet_traits<Scalar>::size;
107 const int size = PacketSize*4 local
214 const int size = PacketSize*4; local
339 const int size = PacketSize*4; local
[all...] |
| sparse_solver.h | 97 if(refX.size() != 0)
152 int size = internal::random<int>(1,maxSize); local
153 double density = (std::max)(8./(size*size), 0.01);
155 Mat M(size, size);
156 DenseMatrix dM(size, size);
163 halfA.resize(size,size);
198 int size = generate_sparse_spd_problem(solver, A, halfA, dA); local
269 int size = internal::random<int>(1,maxSize); local
293 int size = generate_sparse_square_problem(solver, A, dA); local
[all...] |
| visitor.cpp | 23 for(Index i = 0; i < m.size(); i++)
65 Index size = w.size(); local
69 v = VectorType::Random(size);
70 for(Index i = 0; i < size; i++)
77 for(Index i = 0; i < size; i++)
101 Index idx0 = internal::random<Index>(0,size-1);
|
| /external/eigen/unsupported/Eigen/src/Skyline/ |
| SkylineMatrixBase.h | 116 inline Index size() const { function in class:Eigen::SkylineMatrixBase
126 /** \returns the size of the storage major dimension,
132 /** \returns the size of the inner dimension according to the storage order,
|
| /external/eigen/unsupported/test/ |
| matrix_function.cpp | 26 MatrixType randomMatrixWithRealEivals(const typename MatrixType::Index size)
31 MatrixType diag = MatrixType::Zero(size, size);
32 for (Index i = 0; i < size; ++i) {
36 MatrixType A = MatrixType::Random(size, size);
45 static MatrixType run(const typename MatrixType::Index size);
52 static MatrixType run(const typename MatrixType::Index size)
56 MatrixType diag = MatrixType::Zero(size, size);
176 const Index size = m.rows(); local
[all...] |
| /external/elfutils/libdwfl/ |
| gzip.c | 77 size_t size; member in struct:unzip_state
85 size_t more = state->size ? state->size * 2 : start;
87 while (unlikely (b == NULL) && more >= state->size + 1024)
92 state->size = more;
101 state->size = end;
181 .size = 0,
260 z.avail_out = state.size - pos;
301 int n = gzread (state.zf, state.buffer + pos, state.size - pos);
321 *whole_size = state.size;
[all...] |
| /external/elfutils/tests/ |
| elfstrtab.c | 110 size_t size = strlen (str) + 1; local
121 data->d_size = size;
125 stridx += size;
|
| /external/emma/core/java12/com/vladium/emma/data/ |
| CoverageData.java | 59 public int size () method in class:CoverageData
61 return m_coverageMap.size ();
166 final int size = in.readInt (); local
167 final HashMap coverageMap = new HashMap (size);
169 for (int i = 0; i < size; ++ i)
192 final int size = coverageMap.size (); local
193 out.writeInt (size);
196 for (int i = 0; i < size; ++ i)
|
| /external/emma/core/java12/com/vladium/jcd/cls/ |
| AttributeCollection.java | 56 public final int size () method in class:AttributeCollection
58 return m_attributes.size ();
67 int _attributes_count = m_attributes.size (); // use size() if this class becomes non-final
86 final int attributes_count = m_attributes.size (); // use size() if this class becomes non-final
105 int attributes_count = size ();
128 final int result = attributes.size ();
|
| ConstantCollection.java | 51 for (int i = 0; i < m_constants.size (); ++ i)
77 public int size () method in class:ConstantCollection
94 final int constants_count = m_constants.size ();
116 final int constant_pool_count = m_constants.size (); // note: this is not the same as size()
174 final int result = m_constants.size ();
258 if (m_next_index > m_constants.size ()) m_next_index = -1;
280 for (int i = 0; i < m_constants.size (); ++ i)
|
| /external/emma/core/java12/com/vladium/util/ |
| IntIntMap.java | 79 public int size () method in class:IntIntMap
104 * @param out holder for the found value [must be at least of size 1]
253 out.append ("size = " + m_size + ", bucket table size = " + m_buckets.length + ", load factor = " + m_loadFactor + EOL);
254 out.append ("size threshold = " + m_sizeThreshold + EOL);
288 // only grow in size
324 private int m_sizeThreshold; // size threshold for rehashing
|
| IntObjectMap.java | 79 public int size () method in class:IntObjectMap
211 out.append ("size = " + m_size + ", bucket table size = " + m_buckets.length + ", load factor = " + m_loadFactor + EOL);
212 out.append ("size threshold = " + m_sizeThreshold + EOL);
246 // only grow in size
282 private int m_sizeThreshold; // size threshold for rehashing
|
| IntSet.java | 77 public int size () method in class:IntSet
185 out.append ("size = " + m_size + ", bucket table size = " + m_buckets.length + ", load factor = " + m_loadFactor + EOL);
186 out.append ("size threshold = " + m_sizeThreshold + EOL);
218 // only grow in size
254 private int m_sizeThreshold; // size threshold for rehashing
|
| ObjectIntMap.java | 81 public int size () method in class:ObjectIntMap
110 * @param out holder for the found value [must be at least of size 1]
249 out.append ("size = " + m_size + ", bucket table size = " + m_buckets.length + ", load factor = " + m_loadFactor + EOL);
250 out.append ("size threshold = " + m_sizeThreshold + EOL);
284 // only grow in size
320 private int m_sizeThreshold; // size threshold for rehashing
|
| /external/fio/os/ |
| os-freebsd.h | 63 off_t size; local
65 if (!ioctl(f->fd, DIOCGMEDIASIZE, &size)) {
66 *bytes = size;
|
| /external/freetype/include/freetype/ |
| ftsystem.h | 75 * A function used to allocate `size' bytes from `memory'.
81 * size ::
82 * The size in bytes to allocate.
90 long size );
127 * The block's current size in bytes.
130 * The block's requested new size.
289 * size ::
290 * The stream size in bytes.
292 * In case of compressed streams where the size is unknown before
294 * (Note that this size value can occur for normal streams also; it i
333 unsigned long size; member in struct:FT_StreamRec_
[all...] |
| /external/freetype/src/cache/ |
| ftcbasic.c | 132 FT_Size size; local
135 error = FTC_Manager_LookupSize( manager, &family->attrs.scaler, &size );
138 FT_Face face = size->face;
163 FT_Size size; local
169 &size );
172 face = size->face;
|
| ftcsbits.c | 49 FT_ULong size; local
55 size = (FT_ULong)pitch * bitmap->rows;
57 if ( !FT_ALLOC( sbit->buffer, size ) )
58 FT_MEM_COPY( sbit->buffer, bitmap->buffer, size );
182 /* now, compute size */
286 FT_Offset size; local
294 size = sizeof ( *snode );
304 /* add the size of a given glyph image */
305 size += (FT_Offset)pitch * sbit->height;
309 return size;
381 FT_ULong size; local
[all...] |
