HomeSort by relevance Sort by last modified time
    Searched full:size (Results 476 - 500 of 15447) sorted by null

<<11121314151617181920>>

  /sdk/eclipse/sites/external/web/
site.css 4 .bodyText { font-family: sans-serif; font-size: 9pt; color:#000000; }
5 .sub-header { font-family: sans-serif; font-style: normal; font-weight: bold; font-size: 9pt; color: white;}
6 .log-text {font-family: sans-serif; font-style: normal; font-weight: lighter; font-size: 8pt; color:black;}
7 .big-header { font-family: sans-serif; font-style: normal; font-weight: bold; font-size: 9pt; color: white; border-top:10px solid white;}
  /sdk/eclipse/sites/internal/web/
site.css 4 .bodyText { font-family: sans-serif; font-size: 9pt; color:#000000; }
5 .sub-header { font-family: sans-serif; font-style: normal; font-weight: bold; font-size: 9pt; color: white;}
6 .log-text {font-family: sans-serif; font-style: normal; font-weight: lighter; font-size: 8pt; color:black;}
7 .big-header { font-family: sans-serif; font-style: normal; font-weight: bold; font-size: 9pt; color: white; border-top:10px solid white;}
  /dalvik/dx/src/com/android/dx/rop/cst/
ConstantPool.java 25 * Get the "size" of the constant pool. This corresponds to the
27 * always at least one more than the actual size of the constant pool,
30 * @return {@code >= 1;} the size
32 public int size(); method in interface:ConstantPool
38 * @param n {@code n >= 0, n < size();} the constant pool index
50 * @param n {@code n >= 0, n < size();} the constant pool index
65 * @param n {@code n >= 0, n < size();} the constant pool index
  /dalvik/libcore/nio/src/main/java/org/apache/harmony/nio/internal/
WriteOnlyFileChannel.java 53 return append ? size() : super.position();
89 public MappedByteBuffer map(MapMode mode, long position, long size)
95 if (position < 0 || size < 0 || size > Integer.MAX_VALUE) {
103 position(size()); method
108 protected final FileLock basicLock(long position, long size,
113 return super.basicLock(position, size, shared, wait);
  /external/dropbear/libtomcrypt/src/pk/asn1/der/sequence/
der_decode_sequence_flexi.c 109 l->size = 1;
124 l->size = 1;
143 l->size = len * 8; /* *8 because we store decoded bits one per char and they are encoded 8 per char. */
145 if ((l->data = XCALLOC(1, l->size)) == NULL) {
150 if ((err = der_decode_bit_string(in, *inlen, l->data, &l->size)) != CRYPT_OK) {
154 if ((err = der_length_bit_string(l->size, &len)) != CRYPT_OK) {
163 l->size = len;
165 if ((l->data = XCALLOC(1, l->size)) == NULL) {
170 if ((err = der_decode_octet_string(in, *inlen, l->data, &l->size)) != CRYPT_OK) {
174 if ((err = der_length_octet_string(l->size, &len)) != CRYPT_OK)
    [all...]
der_decode_sequence_multi.c 26 @remark <...> is of the form <type, size, data> (int, unsigned long, void*)
32 unsigned long size, x; local
39 /* get size of output that will be required */
44 size = va_arg(args, unsigned long);
92 size = va_arg(args, unsigned long);
116 list[x].size = size;
der_encode_sequence_multi.c 26 @remark <...> is of the form <type, size, data> (int, unsigned long, void*)
32 unsigned long size, x; local
40 /* get size of output that will be required */
45 size = va_arg(args, unsigned long);
92 size = va_arg(args, unsigned long);
115 list[x].size = size;
  /external/opencore/fileformats/mp4/composer/src/
boxrecord.cpp 99 int32 size = 0; local
101 size += 2;
102 size += 2;
103 size += 2;
104 size += 2;
106 _size = size;
108 // Update size of parent
chunkoffsetatom.cpp 59 PVA_FF_ChunkOffsetAtom::nextSample(uint32 size,
76 // Increment the size of the offset by the length of this sample
83 _currentDataOffset += size;
110 for (uint32 i = 0; i < _pchunkOffsets->size(); i++)
138 if (_pchunkOffsets->size() < getEntryCount())
157 int size = getDefaultSize(); local
158 size += 4; // For entryCount
159 size += 4 * getEntryCount();
161 _size = size;
163 // Update the parent atom size
    [all...]
trackextendsatom.cpp 63 // recompute size of atom
67 int32 size = getDefaultSize(); local
69 size += 4; // For trackId
70 size += 4; // For sample description
71 size += 4; // For sample duration
72 size += 4; // For sample size
73 size += 4; // For sample flags
75 _size = size;
77 // Update the parent atom size
    [all...]
  /external/stlport/test/unit/
merge_test.cpp 57 vector<int> v2(v1.size());
61 vector <int> result(v1.size() + v2.size());
79 vector <int> v2(v1.size());
80 for (int i = 0; (size_t)i < v1.size(); ++i) {
84 vector<int> result(v1.size() + v2.size());
  /external/webkit/JavaScriptCore/runtime/
StringBuilder.h 47 buffer.reserveCapacity(buffer.size() + len);
59 buffer.append(str.data(), str.size());
64 void resize(size_t size) { buffer.resize(size); }
65 size_t size() const { return buffer.size(); } function in class:JSC::StringBuilder
72 if (buffer.size() && !buffer.data())
  /external/webkit/WebCore/platform/graphics/
GeneratedImage.h 39 static PassRefPtr<GeneratedImage> create(PassRefPtr<Generator> generator, const IntSize& size)
41 return adoptRef(new GeneratedImage(generator, size));
48 virtual void setContainerSize(const IntSize& size) { m_size = size; }
53 virtual IntSize size() const { return m_size; } function in class:WebCore::GeneratedImage
64 GeneratedImage(PassRefPtr<Generator> generator, const IntSize& size)
66 , m_size(size)
  /external/webkit/WebCore/platform/win/
SearchPopupMenuWin.cpp 51 size_t size = searchItems.size(); local
52 if (size) {
53 items.adoptCF(CFArrayCreateMutable(0, size, &kCFTypeArrayCallBacks));
54 for (size_t i = 0; i < size; ++i) {
75 size_t size = CFArrayGetCount(items.get());
76 for (size_t i = 0; i < size; ++i) {
  /external/webkit/WebCore/svg/graphics/filters/
SVGFEMerge.cpp 60 for (unsigned i = 1; i < m_mergeInputs.size(); i++)
70 for (unsigned i = 0; i < m_mergeInputs.size(); i++) {
80 for (unsigned i = 0; i < m_mergeInputs.size(); i++) {
96 unsigned size = m_mergeInputs.size(); local
97 while (x < size) {
100 if (x < m_mergeInputs.size())
  /frameworks/base/core/java/com/google/android/mms/util/
AbstractCache.java 43 if (mCacheMap.size() >= MAX_CACHED_ITEMS) {
47 Log.v(TAG, "Failed! size limitation reached.");
58 Log.v(TAG, key + " cached, " + mCacheMap.size() + " items total.");
91 Log.v(TAG, mCacheMap.size() + " items cached.");
99 Log.v(TAG, "Purging cache, " + mCacheMap.size()
105 public int size() { method in class:AbstractCache
106 return mCacheMap.size();
  /packages/apps/Email/src/org/apache/commons/io/input/
NullInputStream.java 25 * a stream of a specified size.
46 * public TestInputStream(int size) {
47 * super(size);
65 private long size; field in class:NullInputStream
74 * Create an {@link InputStream} that emulates a specified size
77 * @param size The size of the input stream to emulate.
79 public NullInputStream(long size) {
80 this(size, true, false);
85 * size with option settings.
    [all...]
  /system/core/libcutils/
buffer.h 31 * Byte buffer of known size. Keeps track of how much data has been read
47 size_t size; member in struct:__anon13042
56 #define bufferReadComplete(buffer) (buffer->expected == buffer->size)
71 Buffer* bufferWrap(char* data, size_t capacity, size_t size);
87 * errno (see read()). Returns 0 for EOF. Updates buffer->size and returns
88 * the new size after a succesful read.
90 * Precondition: buffer->size < buffer->expected
memory.c 19 void android_memset16(uint16_t* dst, uint16_t value, size_t size)
21 size >>= 1;
22 while (size--) {
27 void android_memset32(uint32_t* dst, uint32_t value, size_t size)
29 size >>= 2;
30 while (size--) {
58 * Copy src to string dst of size siz. At most siz-1 characters
  /dalvik/dx/src/com/android/dx/util/
LabeledList.java 33 public LabeledList(int size) {
34 super(size);
36 labelToIndex = new IntList(size);
45 super(old.size());
48 int sz = old.size();
64 int sz = labelToIndex.size();
92 int origSz = labelToIndex.size();
110 if (label >= labelToIndex.size()) {
131 int szItems = size();
145 * @param n {@code >= 0, < size();} which elemen
    [all...]
  /dalvik/libcore/security/src/main/java/org/bouncycastle/asn1/x509/
X509NameElementList.java 51 private int size; field in class:X509NameElementList
81 int sz = size;
120 size = sz + 1;
127 added.set(size - 1);
133 public int size() { method in class:X509NameElementList
134 return size;
144 if ((n < 0) || (n >= size)) {
164 if ((n < 0) || (n >= size)) {
184 if ((n < 0) || (n >= size)) {
200 for (int i = size - 1; i >= 0; i--)
    [all...]
  /external/e2fsprogs/intl/
xsize.h 32 /* The size of memory objects is often computed through expressions of
44 size_t size = xsum (header_size, xtimes (n, element_size));
45 void *p = (size_in_bounds_p (size) ? malloc (size) : NULL);
95 /* Multiplication of a count with an element size, with overflow check.
96 The count must be >= 0 and the element size must be > 0.
103 #define size_overflow_p(SIZE) \
104 ((SIZE) == SIZE_MAX)
106 #define size_in_bounds_p(SIZE) \
107 ((SIZE) != SIZE_MAX
    [all...]
  /external/e2fsprogs/tests/progs/
random_exercise.c 76 int size; local
87 size = random() & (DATA_SIZE-1);
89 write(fd, data_buffer, size);
90 printf("Created temp file %s, fd = %d, size=%d\n",
91 template, fd, size);
103 int size; local
105 size = random() & (DATA_SIZE-1);
110 ftruncate(fd, size);
111 printf("Truncating temp file %s, fd = %d, ino=%u, size=%d\n",
112 state_array[fd].name, fd, get_inode_num(fd), size);
    [all...]
  /external/quake/quake/src/QW/client/
zone.h 43 can usefully stay persistant between levels. The size of the cache
49 Temp_??? Temp memory is used for file loading and surface caching. The size
86 void Memory_Init (void *buf, int size);
89 void *Z_Malloc (int size); // returns 0 filled memory
90 void *Z_TagMalloc (int size, int tag);
96 void *Hunk_Alloc (int size); // returns 0 filled memory
97 void *Hunk_AllocName (int size, char *name);
99 void *Hunk_HighAllocName (int size, char *name);
107 void *Hunk_TempAlloc (int size);
124 void *Cache_Alloc (cache_user_t *c, int size, char *name)
    [all...]
  /external/quake/quake/src/WinQuake/
zone.h 43 can usefully stay persistant between levels. The size of the cache
49 Temp_??? Temp memory is used for file loading and surface caching. The size
86 void Memory_Init (void *buf, int size);
89 void *Z_Malloc (int size); // returns 0 filled memory
90 void *Z_TagMalloc (int size, int tag);
96 void *Hunk_Alloc (int size); // returns 0 filled memory
97 void *Hunk_AllocName (int size, const char *name);
99 void *Hunk_HighAllocName (int size, const char *name);
107 void *Hunk_TempAlloc (int size);
124 void *Cache_Alloc (cache_user_t *c, int size, const char *name)
    [all...]

Completed in 76 milliseconds

<<11121314151617181920>>