HomeSort by relevance Sort by last modified time
    Searched defs:size (Results 1101 - 1125 of 11184) sorted by null

<<41424344454647484950>>

  /external/google-breakpad/src/processor/
basic_code_module.h 59 size_(that->size()),
66 BasicCodeModule(uint64_t base_address, uint64_t size,
73 size_(size),
85 virtual uint64_t size() const { return size_; } function in class:google_breakpad::BasicCodeModule
module_serializer.cc 54 // Size of the "is_corrupt" flag.
57 // Compute memory size for each map component in Module class.
70 // Header size.
104 const BasicSourceLineResolver::Module &module, unsigned int *size) {
105 // Compute size of memory to allocate.
112 << "size to alloc: " << size_to_alloc;
113 if (size) *size = 0;
119 // Verify the allocated memory size is equal to the size of data been written
142 unsigned int size = 0; local
    [all...]
source_line_resolver_base_types.h 73 , size(code_size)
78 MemAddr size; member in struct:google_breakpad::SourceLineResolverBase::Line
89 : name(function_name), address(function_address), size(code_size),
94 MemAddr size; member in struct:google_breakpad::SourceLineResolverBase::Function
96 // The size of parameters passed to this function on the stack.
113 // is set to the size of the parameters passed to the funciton on the
124 // The passed in |memory buffer| is of size |memory_buffer_size|. If it is
static_map.h 59 // StaticMap only supports up to 4GB size of memory data.
96 inline unsigned int size() const { return num_nodes_; } function in class:google_breakpad::StaticMap
  /external/guava/guava/src/com/google/common/cache/
ForwardingCache.java 108 public long size() { method in class:ForwardingCache
109 return delegate().size();
  /external/guava/guava/src/com/google/common/collect/
AbstractMapBasedMultiset.java 54 * Cache the size for efficiency. Using a long lets us avoid the need for
55 * overflow checking and ensures that size() will function correctly even if
58 private transient long size; field in class:AbstractMapBasedMultiset
63 this.size = super.size();
123 size -= toRemove.getValue().getAndSet(0);
136 size = 0L;
141 return backingMap.size();
146 @Override public int size() {
147 return Ints.saturatedCast(size);
    [all...]
EmptyImmutableSortedMap.java 57 public int size() { method in class:EmptyImmutableSortedMap
EmptyImmutableSortedMultiset.java 58 public int size() { method in class:EmptyImmutableSortedMultiset
FilteredMultimapValues.java 56 public int size() { method in class:FilteredMultimapValues
57 return multimap.size();
RegularImmutableList.java 33 private final transient int size; field in class:RegularImmutableList
36 RegularImmutableList(Object[] array, int offset, int size) {
38 this.size = size;
47 public int size() { method in class:RegularImmutableList
48 return size;
52 return size != array.length;
57 System.arraycopy(array, offset, dst, dstOff, size);
58 return dstOff + size;
65 Preconditions.checkElementIndex(index, size);
    [all...]
RegularImmutableSet.java 61 public int size() { method in class:RegularImmutableSet
SingletonImmutableSet.java 57 public int size() { method in class:SingletonImmutableSet
89 return that.size() == 1 && element.equals(that.iterator().next());
SingletonImmutableTable.java 63 @Override public int size() { method in class:SingletonImmutableTable
  /external/guava/guava/src/com/google/common/util/concurrent/
Striped.java 109 * {@code size()}, exclusively.
111 * @param index the index of the stripe to return; must be in {@code [0...size())}
124 public abstract int size(); method in class:Striped
313 /** Size is a power of two. */
331 @Override public int size() {
338 * AtomicReferenceArray of size 2^k. To map a user key into a stripe, we take a k-bit slice of the
344 final int size;
349 this.size = (mask == ALL_SET) ? Integer.MAX_VALUE : mask + 1;
350 this.locks = new AtomicReferenceArray<ArrayReference<? extends L>>(size);
355 if (size != Integer.MAX_VALUE)
    [all...]
  /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
AbstractMapBasedMultiset.java 51 * Cache the size for efficiency. Using a long lets us avoid the need for
52 * overflow checking and ensures that size() will function correctly even if
55 private transient long size; field in class:AbstractMapBasedMultiset
60 this.size = super.size();
120 size -= toRemove.getValue().getAndSet(0);
133 size = 0L;
138 return backingMap.size();
143 @Override public int size() {
144 return Ints.saturatedCast(size);
    [all...]
ForwardingImmutableList.java 56 return delegateList().toArray(new Object[size()]);
79 public int size() { method in class:ForwardingImmutableList
80 return delegateList().size();
  /external/guava/guava-tests/benchmark/com/google/common/collect/
SetContainsBenchmark.java 37 private int size; field in class:SetContainsBenchmark
60 isUserTypeFast, random, hitRate, size);
  /external/guice/core/src/com/google/inject/internal/
SingleParameterInjector.java 53 int numErrorsBefore = errors.size();
55 int size = parameterInjectors.length; local
56 Object[] parameters = new Object[size];
59 for (int i = 0; i < size; i++) {
  /external/icu/android_icu4j/src/main/java/android/icu/impl/coll/
UVector32.java 22 public int size() { return length; } method in class:UVector32
UVector64.java 22 public int size() { return length; } method in class:UVector64
  /external/icu/icu4c/source/common/
uvector.h 111 * equal if they are of the same size and all elements are equal,
169 int32_t size(void) const;
176 * Change the size of this vector as follows: If newSize is
203 * one index and shortening the size of the vector by one. If the
351 inline int32_t UVector::size(void) const { function in class:UVector
uvectr64.h 83 * equal if they are of the same size and all elements are equal,
123 int32_t size(void) const;
127 // Inline. Use this one for speedy size check.
134 * Change the size of this vector as follows: If newSize is
195 int64_t *reserveBlock(int32_t size, UErrorCode &status);
196 int64_t *popFrame(int32_t size);
222 inline int64_t *UVector64::reserveBlock(int32_t size, UErrorCode &status) {
223 if (ensureCapacity(count+size, status) == FALSE) {
227 count += size;
231 inline int64_t *UVector64::popFrame(int32_t size) {
242 inline int32_t UVector64::size(void) const { function in class:UVector64
    [all...]
  /external/icu/icu4c/source/tools/gentest/
gentest.c 10 * tab size: 8 (not used)
109 uint32_t size; local
129 size=sizeof(stringValue) + sizeof(intValue);
132 if(dataLength!=(long)size) {
133 fprintf(stderr, "gentest: data length %ld != calculated size %lu\n",
134 dataLength, (unsigned long)size);
  /external/icu/icu4j/demos/src/com/ibm/icu/dev/demo/translit/
DemoApplet.java 60 Dimension size = button.getPreferredSize(); local
61 size.width += 10;
62 size.height += 10;
64 resize(size);
  /external/jacoco/org.jacoco.core/src/org/jacoco/core/internal/flow/
FrameSnapshot.java 63 final int size = source.size() - popCount; local
64 copy.subList(size, source.size()).clear();
65 for (int i = size; --i >= 0;) {

Completed in 431 milliseconds

<<41424344454647484950>>