| /external/freetype/src/cff/ |
| cffobjs.h | 53 /* A handle to an OpenType size object. */
130 cff_size_init( FT_Size size ); /* CFF_Size */ variable
133 cff_size_done( FT_Size size ); /* CFF_Size */ variable
136 cff_size_request( FT_Size size,
142 cff_size_select( FT_Size size,
|
| cffparse.h | 93 FT_Byte size; member in struct:CFF_Field_Handler_
|
| /external/freetype/src/sfnt/ |
| pngshim.c | 261 FT_ULong size; local
281 size = map->rows * (FT_ULong)map->pitch;
283 error = ft_glyphslot_alloc_bitmap( slot, size );
|
| /external/freetype/src/truetype/ |
| ttdriver.c | 275 tt_size_select( FT_Size size,
278 TT_Face ttface = (TT_Face)size->face;
279 TT_Size ttsize = (TT_Size)size;
285 if ( FT_IS_SCALABLE( size->face ) )
288 FT_Select_Metrics( size->face, strike_index );
295 FT_Size_Metrics* metrics = &size->metrics;
310 tt_size_request( FT_Size size,
313 TT_Size ttsize = (TT_Size)size;
319 if ( FT_HAS_FIXED_SIZES( size->face ) )
321 TT_Face ttface = (TT_Face)size->face
400 TT_Size size = (TT_Size)ttsize; local
[all...] |
| /external/gemmlowp/profiling/ |
| instrumentation.h | 121 std::size_t size; member in struct:gemmlowp::ProfilingStack
127 ReleaseBuildAssertion(size < kMaxSize, "ProfilingStack overflow");
128 labels[size] = label;
130 size++;
136 ReleaseBuildAssertion(size > 0, "ProfilingStack underflow");
137 size--;
143 assert(size);
144 labels[size - 1] = new_label;
160 "ProfilingStack should have power-of-two size to fit in cache lines");
|
| /external/glide/library/src/main/java/com/bumptech/glide/load/engine/bitmap_recycle/ |
| GroupedLinkedMap.java | 10 * of bitmaps rather than individual objects. The idea is to be able to find the LRU bitmap size, rather than the
11 * LRU bitmap object. We can then remove bitmaps from the least recently used size of bitmap when we need to
12 * reduce our cache size.
14 * For the purposes of the LRU, we count gets for a particular size of bitmap as an access, even if no bitmaps
15 * of that size are present. We do not count addition or removal of bitmaps as an access.
79 sb.append('{').append(current.key).append(':').append(current.size()).append("}, ");
131 final int valueSize = size();
135 public int size() { method in class:GroupedLinkedMap.LinkedEntry
136 return values != null ? values.size() : 0;
|
| /external/google-benchmark/src/ |
| string_util.cc | 22 // We require that all three arrays have the same size.
24 "SI and IEC unit arrays must be the same size");
26 "Small SI and Big SI unit arrays must be the same size");
128 // allocation guess what the size might be
130 std::size_t size = local_buff.size(); local
132 auto ret = vsnprintf(local_buff.data(), size, msg, args_cp);
139 if (static_cast<std::size_t>(ret) < size)
143 // add 1 to size to account for null-byte in size cast to prevent overflo
[all...] |
| /external/google-benchmark/test/ |
| benchmark_test.cc | 40 std::set<int> ConstructRandomSet(int size) {
42 for (int i = 0; i < size; ++i)
154 int size = state.range_x() / sizeof(int); local
155 int thread_size = size / state.threads;
160 test_vector = new std::vector<int>(size);
|
| /external/google-breakpad/src/common/ |
| test_assembler.h | 289 // Append the SIZE bytes at DATA or the contents of STRING to the
291 Section &Append(const uint8_t *data, size_t size) {
292 contents_.append(reinterpret_cast<const char *>(data), size); local
300 // Append SIZE copies of BYTE to the end of this section. Return a
302 Section &Append(size_t size, uint8_t byte) {
303 contents_.append(size, (char) byte);
308 // use to write the number. SIZE is the length of the number in
310 Section &Append(Endianness endianness, size_t size, uint64_t number);
311 Section &Append(Endianness endianness, size_t size, const Label &label);
330 // Append at most SIZE bytes from DATA; if DATA is less than SIZE byte
462 size_t size; member in struct:google_breakpad::test_assembler::Section::Reference
[all...] |
| /external/google-breakpad/src/third_party/libdisasm/ |
| ia32_insn.c | 245 if ( op->type == op_register && op->data.reg.size == 4 &&
264 size_t size, op_size; local
308 /* advance buffer, increase size if necessary */
311 size = op_size;
317 size += op_size;
321 size += op_size;
340 return size;
377 size_t size = 1, sub_size = 0, next_len; local
523 --size;
531 --size;
542 size_t size; local
577 size_t size, sfx_size; local
[all...] |
| ia32_modrm.c | 70 int32_t *dest, unsigned int size ) {
71 if ( size > buf_len ) {
75 switch (size) {
88 return size;
109 size_t size = 1; /* start at 1 for SIB byte */ local
125 size += 4; /* add sizeof disp to count */
140 return (size); /* return number of bytes processed */
146 size_t size = 1; /* # of bytes decoded [1 for modR/M byte] */ local
193 size += sizeof(char);
198 size += sizeof(short)
215 size_t size = 1; \/* # of bytes decoded [1 for modR\/M byte] *\/ local
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| AbstractMultiset.java | 38 * <p>The {@link #count} and {@link #size} implementations all iterate across
51 @Override public int size() { method in class:AbstractMultiset
183 @Override public int size() { method in class:AbstractMultiset.EntrySet
198 * of the same size and if, for each element, the two multisets have the same
|
| AbstractNavigableMap.java | 159 public abstract int size(); method in class:AbstractNavigableMap
|
| AbstractTable.java | 80 return size() == 0;
154 public int size() { method in class:AbstractTable.CellSet
155 return AbstractTable.this.size();
197 public int size() {
198 return AbstractTable.this.size();
|
| ArrayTable.java | 40 * Fixed-size {@link Table} implementation backed by a two-dimensional array.
47 * <p>The table's size is constant: the product of the number of supplied row
161 = (V[][]) new Object[rowList.size()][columnList.size()];
169 for (int i = 0; i < list.size(); i++) {
186 V[][] copy = (V[][]) new Object[rowList.size()][columnList.size()];
190 for (int i = 0; i < rowList.size(); i++) {
218 public int size() { method in class:ArrayTable.ArrayMap
219 return keyIndex.size();
[all...] |
| ConcurrentHashMultiset.java | 164 @Override public int size() { method in class:ConcurrentHashMultiset
173 * Note: the superclass toArray() methods assume that size() gives a correct
190 List<E> list = Lists.newArrayListWithExpectedSize(size());
480 return countMap.size();
538 * Note: the superclass toArray() methods assume that size() gives a correct
551 List<Multiset.Entry<E>> list = Lists.newArrayListWithExpectedSize(size());
|
| EmptyContiguousSet.java | 45 @Override public int size() { method in class:EmptyContiguousSet
|
| FilteredKeyMultimap.java | 59 public int size() { method in class:FilteredKeyMultimap
60 int size = 0; local
62 size += collection.size();
64 return size;
|
| ForwardingCollection.java | 63 public int size() { method in class:ForwardingCollection
64 return delegate().size();
214 * implement {@code isEmpty} as {@code size() == 0}.
241 Object[] newArray = new Object[size()];
247 * #size} and {@link #iterator}. If you override either of these methods, you
|
| ForwardingMap.java | 69 public int size() { method in class:ForwardingMap
70 return delegate().size();
188 * ForwardingMap#size}, and the {@link Set#iterator} method of {@link
218 * {@link ForwardingMap#isEmpty}, {@link ForwardingMap#size}, and the {@link
249 * ForwardingMap#remove}, and {@link ForwardingMap#size}. In many cases, you
|
| ImmutableCollection.java | 60 int size = size(); local
61 if (size == 0) {
64 Object[] result = new Object[size];
72 int size = size(); local
73 if (other.length < size) {
74 other = ObjectArrays.newArray(other, size);
75 } else if (other.length > size) {
76 other[size] = null
318 int size; field in class:ImmutableCollection.ArrayBasedBuilder
[all...] |
| Iterables.java | 107 public static int size(Iterable<?> iterable) { method in class:Iterables
109 ? ((Collection<?>) iterable).size()
110 : Iterators.size(iterable.iterator());
190 for (; from < list.size(); from++) {
206 list.subList(to, list.size()).clear();
222 for (int n = list.size() - 1; n > from; n--) {
262 if (collection1.size() != collection2.size()) {
316 T[] array = ObjectArrays.newArray(type, collection.size());
518 * Divides an iterable into unmodifiable sublists of the given size (the fina
[all...] |
| Lists.java | 166 * initial size; simply delegates to {@link ArrayList#ArrayList(int)}.
175 * @param initialArraySize the exact size of the initial backing array for
179 * itself unless its size reaches {@code initialArraySize + 1}
199 * @param estimatedSize an estimate of the eventual {@link List#size()} of
325 @Override public int size() { method in class:Lists.OnePlusArrayList
330 checkElementIndex(index, size());
370 @Override public int size() { method in class:Lists.TwoPlusArrayList
381 checkElementIndex(index, size());
426 * <p><i>Performance notes:</i> while the cartesian product of lists of size
427 * {@code m, n, p} is a list of size {@code m x n x p}, its actual memor
571 @Override public int size() { method in class:Lists.TransformingSequentialList
[all...] |
| RegularImmutableMap.java | 53 RegularImmutableMap(int size, TerminalEntry<?, ?>[] theEntries) {
54 entries = createEntryArray(size);
55 int tableSize = Hashing.closedTableSize(size, MAX_LOAD_FACTOR);
58 for (int entryIndex = 0; entryIndex < size; entryIndex++) {
78 int size = theEntries.length; local
79 entries = createEntryArray(size);
80 int tableSize = Hashing.closedTableSize(size, MAX_LOAD_FACTOR);
83 for (int entryIndex = 0; entryIndex < size; entryIndex++) {
147 private ImmutableMapEntry<K, V>[] createEntryArray(int size) {
148 return new ImmutableMapEntry[size];
175 public int size() { method in class:RegularImmutableMap
[all...] |
| Table.java | 111 int size(); method in interface:Table
|
