/external/webrtc/src/common_audio/signal_processing/ |
H A D | get_hanning_window.c | 56 void WebRtcSpl_GetHanningWindow(WebRtc_Word16 *v, WebRtc_Word16 size) argument 64 factor = WebRtcSpl_DivW32W16(factor, size); 65 if (size < 513) 71 for (jj = 0; jj < size; jj++)
|
/external/zopfli/src/zopfli/ |
H A D | lz77.h | 39 Parameter size: The size of both the litlens and dists arrays. 48 size_t size; member in struct:ZopfliLZ77Store 82 size: size of the data 93 size_t pos, size_t size, size_t limit, 109 ll_count: count of each lit/len symbol, must have size 288 (see deflate 111 d_count: count of each dist symbol, must have size 32 (see deflate standard)
|
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.JavaExtensions/ |
H A D | SetExtensions.cs | 77 public static int size<T>( this HashSet<T> set ) method in class:Antlr.Runtime.JavaExtensions.SetExtensions
|
H A D | StackExtensions.cs | 69 public static int size<T>( this Stack<T> stack ) method in class:Antlr.Runtime.JavaExtensions.StackExtensions 75 public static void setSize<T>( this Stack<T> stack, int size ) 77 if ( size > stack.Count ) 80 while ( stack.Count > size )
|
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/ |
H A D | IntStream.java | 115 int size(); method in interface:IntStream
|
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/misc/ |
H A D | IntArray.java | 65 public int size() { method in class:IntArray
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
H A D | FastQueue.h | 57 if ( p == data.size() ) { 59 clear(); // size goes to 0, but retains memory 66 public int size() { return data.size() - p; } function in class:FastQueue 75 if ( p+i >= data.size() ) { 76 throw new NoSuchElementException("queue index "+(p+i)+" > size "+data.size()); 86 int n = size();
|
H A D | IntArray.h | 65 public int size() { function in class:IntArray
|
/external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
H A D | ErrorQueue.java | 58 public int size() { method in class:ErrorQueue 59 return infos.size() + errors.size() + warnings.size();
|
/external/apache-xml/src/main/java/org/apache/xml/utils/ |
H A D | ObjectPool.java | 81 * @param size Size of vector to allocate 83 public ObjectPool(Class type, int size) argument 86 freeStack = new ArrayList(size); 113 Object result = freeStack.remove(freeStack.size() - 1); 148 Object result = freeStack.remove(freeStack.size() - 1);
|
/external/bouncycastle/bcpkix/src/main/java/org/bouncycastle/cms/ |
H A D | SignerInformationStore.java | 50 return list.size() == 0 ? null : (SignerInformation) list.iterator().next(); 58 public int size() method in class:SignerInformationStore 60 return all.size();
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/ |
H A D | ASN1EncodableVector.java | 32 public int size() method in class:ASN1EncodableVector 34 return v.size();
|
H A D | LazyEncodedSequence.java | 53 public synchronized int size() method in class:LazyEncodedSequence 60 return super.size();
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/generators/ |
H A D | DHParametersGenerator.java | 10 private int size; field in class:DHParametersGenerator 19 * @param size bit length for the prime p 24 int size, 28 this.size = size; 44 BigInteger[] safePrimes = DHParametersHelper.generateSafePrimes(size, certainty, random); 23 init( int size, int certainty, SecureRandom random) argument
|
H A D | DHParametersHelper.java | 25 static BigInteger[] generateSafePrimes(int size, int certainty, SecureRandom random) argument 33 int qLength = size - 1;
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/util/ |
H A D | IPAddress.java | 99 private static boolean isMaskValue(String component, int size) argument 105 return value >= 0 && value <= size;
|
/external/ceres-solver/internal/ceres/ |
H A D | array_utils.cc | 51 bool IsArrayValid(const int size, const double* x) { argument 53 for (int i = 0; i < size; ++i) { 62 int FindInvalidValue(const int size, const double* x) { argument 64 return size; 67 for (int i = 0; i < size; ++i) { 73 return size; 76 void InvalidateArray(const int size, double* x) { argument 78 for (int i = 0; i < size; ++i) { 84 void AppendArrayToString(const int size, const double* x, string* result) { argument 85 for (int i = 0; i < size; 98 MapValuesToContiguousRange(const int size, int* array) argument [all...] |
H A D | local_parameterization.cc | 39 IdentityParameterization::IdentityParameterization(const int size) argument 40 : size_(size) { 41 CHECK_GT(size, 0); 59 int size, 61 : local_size_(size - constant_parameters.size()), 62 constancy_mask_(size, 0) { 63 CHECK_GT(constant_parameters.size(), 0) 72 CHECK_LT(constant_parameters.size(), size) 58 SubsetParameterization( int size, const vector<int>& constant_parameters) argument 79 CHECK_LT(*max_element(constant.begin(), constant.end()), size); local [all...] |
/external/chromium_org/android_webview/native/ |
H A D | aw_assets.cc | 20 int64* size) { 28 DCHECK_EQ(3U, results.size()); 31 *size = results[2]; 17 OpenAsset(const std::string& filename, int* fd, int64* offset, int64* size) argument
|
/external/chromium_org/ash/system/tray/ |
H A D | fixed_sized_scroll_view.cc | 21 void FixedSizedScrollView::SetFixedSize(const gfx::Size& size) { argument 22 if (fixed_size_ == size) 24 fixed_size_ = size; 29 gfx::Size size = fixed_size_.IsEmpty() ? local 32 size.Enlarge(insets.width(), insets.height()); 33 return size;
|
/external/chromium_org/base/allocator/ |
H A D | allocator_extension.cc | 12 bool GetAllocatorWasteSize(size_t* size) { argument 16 get_allocator_waste_size_function(size);
|
H A D | type_profiler.cc | 13 void* NopIntercept(void* ptr, size_t size, const std::type_info& type) { argument 23 size_t size, 25 return g_new_intercept(ptr, size, type); 29 size_t size, 31 return g_delete_intercept(ptr, size, type); 22 __op_new_intercept__(void* ptr, size_t size, const std::type_info& type) argument 28 __op_delete_intercept__(void* ptr, size_t size, const std::type_info& type) argument
|
H A D | win_allocator.cc | 28 void* win_heap_malloc(size_t size) { argument 29 return HeapAlloc(win_heap, 0, size); 32 void win_heap_free(void* size) { argument 33 HeapFree(win_heap, 0, size); 36 void* win_heap_realloc(void* ptr, size_t size) { argument 38 return win_heap_malloc(size); 39 if (!size) { 43 return HeapReAlloc(win_heap, 0, ptr, size); 50 void* win_heap_memalign(size_t alignment, size_t size) { argument 53 size_t allocation_size = size [all...] |
/external/chromium_org/base/files/ |
H A D | memory_mapped_file.h | 27 // Used to hold information about a region [offset + size] of a file. 31 Region(int64 offset, int64 size); 39 int64 size; member in struct:base::MemoryMappedFile::Region 74 // Given the arbitrarily aligned memory region [start, size], returns the 78 // - |aligned_size| is a multiple of the VM granularity and >= |size|. 81 int64 size,
|
H A D | memory_mapped_file_win.cc | 47 // typically larger than a page size, for instance 32k). 49 // aligned and must be less than or equal the mapped file size. 50 // We map here the outer region [|aligned_start|, |aligned_start+size|] 55 region.offset, region.size, &aligned_start, &ignored, &data_offset); 56 int64 size = region.size + data_offset; local 59 if (aligned_start < 0 || size < 0 || 60 static_cast<uint64>(size) > std::numeric_limits<SIZE_T>::max()) { 65 map_size = static_cast<SIZE_T>(size); 66 length_ = static_cast<size_t>(region.size); [all...] |