/external/aac/libSBRdec/src/ |
H A D | env_calc.cpp | 228 int nSfb, /*!< Number of bands in the table */ 617 /* Always do fully initialize the temporary energy table. This prevents negative energies and extreme gain factors in 667 UCHAR * table = hFreq->freqBandTable[freq_res]; local 683 int li = table[j]; 684 int ui = table[j+1]; 2122 Build frequency band table for the gain limiter dependent on
|
/external/antlr/antlr-3.4/lib/ |
H A D | antlr-3.4-complete.jar | META-INF/ META-INF/MANIFEST.MF org/ org/antlr/ org/antlr/analysis/ org/antlr/codegen/ org/ ... |
/external/antlr/antlr-3.4/runtime/ActionScript/project/lib/ |
H A D | FlexAntTasks.jar | META-INF/ META-INF/MANIFEST.MF com/ com/adobe/ com/adobe/ac/ com/adobe/ac/ant/ ... |
/external/antlr/antlr-3.4/runtime/C/include/ |
H A D | antlr3collections.h | 74 * is deleted from the table. 87 /** Internal structure of a hash table bucket, which tracks 101 /** Structure that tracks a hash table 105 /** Indicates whether the table allows duplicate keys 109 /** Number of buckets available in this table 118 /** How many elements currently exist in the table. 122 /** Whether the hash table should strdup the keys it is given or not. 126 /** Pointer to function to completely delete this table 128 void (*free) (struct ANTLR3_HASH_TABLE_struct * table); 131 void (*del) (struct ANTLR3_HASH_TABLE_struct * table, voi 161 pANTLR3_HASH_TABLE table; member in struct:ANTLR3_HASH_ENUM_struct 184 pANTLR3_HASH_TABLE table; member in struct:ANTLR3_LIST_struct [all...] |
/external/antlr/antlr-3.4/runtime/C/src/ |
H A D | antlr3collections.c | 42 // Interface functions for hash table 47 static void antlr3HashDelete (pANTLR3_HASH_TABLE table, void * key); 48 static void * antlr3HashGet (pANTLR3_HASH_TABLE table, void * key); 49 static pANTLR3_HASH_ENTRY antlr3HashRemove (pANTLR3_HASH_TABLE table, void * key); 50 static ANTLR3_INT32 antlr3HashPut (pANTLR3_HASH_TABLE table, void * key, void * element, void (ANTLR3_CDECL *freeptr)(void *)); 54 static void antlr3HashDeleteI (pANTLR3_HASH_TABLE table, ANTLR3_INTKEY key); 55 static void * antlr3HashGetI (pANTLR3_HASH_TABLE table, ANTLR3_INTKEY key); 56 static pANTLR3_HASH_ENTRY antlr3HashRemoveI (pANTLR3_HASH_TABLE table, ANTLR3_INTKEY key); 57 static ANTLR3_INT32 antlr3HashPutI (pANTLR3_HASH_TABLE table, ANTLR3_INTKEY key, void * element, void (ANTLR3_CDECL *freeptr)(void *)); 59 static void antlr3HashFree (pANTLR3_HASH_TABLE table); 131 pANTLR3_HASH_TABLE table; local 195 antlr3HashFree(pANTLR3_HASH_TABLE table) argument 266 antlr3HashSize(pANTLR3_HASH_TABLE table) argument 274 antlr3HashRemoveI(pANTLR3_HASH_TABLE table, ANTLR3_INTKEY key) argument 331 antlr3HashRemove(pANTLR3_HASH_TABLE table, void * key) argument 396 antlr3HashDeleteI(pANTLR3_HASH_TABLE table, ANTLR3_INTKEY key) argument 420 antlr3HashDelete(pANTLR3_HASH_TABLE table, void * key) argument 444 antlr3HashGetI(pANTLR3_HASH_TABLE table, ANTLR3_INTKEY key) argument 483 antlr3HashGet(pANTLR3_HASH_TABLE table, void * key) argument 523 antlr3HashPutI(pANTLR3_HASH_TABLE table, ANTLR3_INTKEY key, void * element, void (ANTLR3_CDECL *freeptr)(void *)) argument 594 antlr3HashPut(pANTLR3_HASH_TABLE table, void * key, void * element, void (ANTLR3_CDECL *freeptr)(void *)) argument 673 antlr3EnumNew(pANTLR3_HASH_TABLE table) argument [all...] |
/external/apache-harmony/security/src/test/api/java/org/apache/harmony/security/tests/java/security/ |
H A D | Security2Test.java | 58 // to the allSupported table then increment the count of the 127 * @param table 130 private void addOrIncrementTable(Hashtable table, String key) { argument 131 if (table.containsKey(key)) { 132 Integer before = (Integer) table.get(key); 133 table.put(key, new Integer(before.intValue() + 1)); 135 table.put(key, new Integer(1));
|
/external/apache-xml/src/main/java/org/apache/xalan/templates/ |
H A D | ElemNumber.java | 1585 * @param table a table containing one character for each digit in the radix 1590 * of the table. 1592 protected String int2singlealphaCount(long val, CharArrayWrapper table) argument 1595 int radix = table.getLength(); 1603 return (new Character(table.getChar((int)val - 1))).toString(); // index into table is off one, starts at 0 1611 * @param table a table containing one character for each digit in the radix 1618 * of the table [all...] |
/external/bison/lib/ |
H A D | hash.c | 1 /* hash - hashing table processing. 20 /* A generic hash table package. */ 56 are not empty, there are N_ENTRIES active entries in the table. */ 86 /* A hash table contains many internal entries, each holding a pointer to 91 and the current table size. At each slot position in the hash table, 97 entries divided by the table size. Finding the slot for a data is usually 100 larger hash table size (that is, a larger number of buckets) is prone to 103 Long buckets slow down the lookup algorithm. One might use big hash table 105 become inordinate, as unused slots in the hash table tak 150 hash_get_n_buckets(const Hash_table *table) argument 158 hash_get_n_buckets_used(const Hash_table *table) argument 166 hash_get_n_entries(const Hash_table *table) argument 174 hash_get_max_bucket_length(const Hash_table *table) argument 201 hash_table_ok(const Hash_table *table) argument 230 hash_print_statistics(const Hash_table *table, FILE *stream) argument 249 safe_hasher(const Hash_table *table, const void *key) argument 261 hash_lookup(const Hash_table *table, const void *entry) argument 288 hash_get_first(const Hash_table *table) argument 307 hash_get_next(const Hash_table *table, const void *entry) argument 336 hash_get_entries(const Hash_table *table, void **buffer, size_t buffer_size) argument 368 hash_do_for_each(const Hash_table *table, Hash_processor processor, void *processor_data) argument 512 check_tuning(Hash_table *table) argument 598 Hash_table *table; local 653 hash_clear(Hash_table *table) argument 696 hash_free(Hash_table *table) argument 751 allocate_entry(Hash_table *table) argument 776 free_entry(Hash_table *table, struct hash_entry *entry) argument 790 hash_find_entry(Hash_table *table, const void *entry, struct hash_entry **bucket_head, bool delete) argument 943 hash_rehash(Hash_table *table, size_t candidate) argument 1038 hash_insert_if_absent(Hash_table *table, void const *entry, void const **matched_ent) argument 1122 hash_insert0(Hash_table *table, void const *entry, void const **matched_ent) argument 1134 hash_insert(Hash_table *table, void const *entry) argument 1148 hash_delete(Hash_table *table, const void *entry) argument 1212 hash_print(const Hash_table *table) argument [all...] |
/external/bison/src/ |
H A D | scan-gram.c | 3614 /* A non-ASCII host. Use CODE to index into a table of the C 3616 all Standard C platforms. This table also includes '$', '@', 3620 static signed char const table[] = local 3640 code = code < sizeof table ? table[code] : -1;
|
H A D | tables.c | 125 base_number *table; variable 153 fprintf (stderr, "growing table and check from: %d to %d\n", 156 table = xnrealloc (table, table_size, sizeof *table); 163 table[old_size] = 0; 425 | The YYDEFACT table is output now. The detailed info is saved for | 563 | The YYDEFGOTO table is output now. The detailed info is saved for | 701 if (table[loc] != 0) 714 table[lo [all...] |
/external/blktrace/doc/ |
H A D | blktrace.tex | 486 & & action specifiers in section~\ref{sec:act-table} \\ \hline 593 \emph{a} & Action, a (small) string (1 or 2 characters) -- see table below for more details \\ \hline 627 \subsubsection{\label{sec:act-table}Action Table} 628 The following table shows the various actions which may be output. 648 \subsubsection{\label{sec:act-table}RWBS Description}
|
/external/bouncycastle/bcpkix/src/main/java/org/bouncycastle/cms/ |
H A D | DefaultSignedAttributeTableGenerator.java | 22 private final Hashtable table; field in class:DefaultSignedAttributeTableGenerator 29 table = new Hashtable(); 35 * @param attributeTable initial attribute table to use. 42 table = attributeTable.toHashtable(); 46 table = new Hashtable(); 51 * Create a standard attribute table from the passed in parameters - this will 56 * @param parameters source parameters for table generation. 63 Hashtable std = copyHashTable(table); 101 * @return the populated attribute table
|
H A D | SignerInformationStore.java | 13 private Map table = new HashMap(); field in class:SignerInformationStore 25 List list = (ArrayList)table.get(sid); 29 table.put(sid, list); 104 List list = (ArrayList)table.get(selector);
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/ |
H A D | DERBitString.java | 15 private static final char[] table = { '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F' }; field in class:DERBitString 262 buf.append(table[(string[i] >>> 4) & 0xf]); 263 buf.append(table[string[i] & 0xf]);
|
H A D | DERUniversalString.java | 15 private static final char[] table = { '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F' }; field in class:DERUniversalString 99 buf.append(table[(string[i] >>> 4) & 0xf]); 100 buf.append(table[string[i] & 0xf]);
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/x509/ |
H A D | CRLReason.java | 91 private static final Hashtable table = new Hashtable(); field in class:CRLReason 144 if (!table.containsKey(idx)) 146 table.put(idx, new CRLReason(value)); 149 return (CRLReason)table.get(idx);
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/engines/ |
H A D | BlowfishEngine.java | 402 * apply the encryption cycle to each value pair in the table. 407 int[] table) 409 int size = table.length; 423 table[s] = xr; 424 table[s + 1] = xl; 427 xl = table[s]; 404 processTable( int xl, int xr, int[] table) argument
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jcajce/provider/keystore/bc/ |
H A D | BcKeyStoreSpi.java | 85 protected Hashtable table = new Hashtable(); field in class:BcKeyStoreSpi 488 return table.keys(); 494 return (table.get(alias) != null); 501 Object entry = table.get(alias); 508 table.remove(alias); 514 StoreEntry entry = (StoreEntry)table.get(alias); 539 Enumeration e = table.elements(); 570 StoreEntry entry = (StoreEntry)table.get(alias); 582 StoreEntry entry = (StoreEntry)table.get(alias); 597 StoreEntry entry = (StoreEntry)table [all...] |
/external/chromium_org/android_webview/browser/ |
H A D | gpu_memory_buffer_factory_impl.cc | 112 AwDrawGLFunctionTable* table) { 113 g_gl_draw_functions = table; 111 SetAwDrawGLFunctionTable( AwDrawGLFunctionTable* table) argument
|
/external/chromium_org/android_webview/java/src/org/chromium/android_webview/ |
H A D | AwContentsClientBridge.java | 46 ClientCertLookupTable table) { 48 mLookupTable = table; 52 ClientCertLookupTable table) { 56 mLookupTable = table; 45 AwContentsClientBridge(DefaultAndroidKeyStore keyStore, ClientCertLookupTable table) argument 51 AwContentsClientBridge(AwContentsClient client, DefaultAndroidKeyStore keyStore, ClientCertLookupTable table) argument
|
/external/chromium_org/android_webview/native/ |
H A D | java_browser_view_renderer_helper.cc | 51 AwDrawSWFunctionTable* table) { 52 g_sw_draw_functions = table; 50 SetAwDrawSWFunctionTable( AwDrawSWFunctionTable* table) argument
|
/external/chromium_org/base/ |
H A D | id_map.h | 23 // pointers to objects. It is implemented as a hash table, optimized for 216 static inline void release_all(HashTable* table) {} argument 221 static inline void release_all(HashTable* table) { argument 222 for (typename HashTable::iterator i = table->begin(); 223 i != table->end(); ++i) { 226 table->clear();
|
/external/chromium_org/base/metrics/ |
H A D | stats_counters.cc | 40 StatsTable* table = StatsTable::current(); local 41 if (!table) 46 counter_id_ = table->FindCounter(name_); 47 if (table->GetSlot() == 0) { 48 if (!table->RegisterThread(std::string())) { 59 return table->GetLocation(counter_id_, table->GetSlot()); 61 // counter_id_ was zero, which means the table is full.
|
H A D | stats_table.cc | 24 // | Thread names table | 26 // | Thread TID table | 28 // | Thread PID table | 30 // | Counter names table | 47 // the rows and columns of the table to particular threads, locking is 51 // shared-memory table only, and is used when we create new counters (e.g. 53 // data from the table does not require any locking at the shared memory 56 // Each process which accesses the table will create a StatsTable object. 57 // The StatsTable maintains a hash table of the existing counters in the 58 // table fo 172 New( const StatsTable::TableIdentifier& table, int size, int max_threads, int max_counters) argument 199 CreateSharedMemory( const StatsTable::TableIdentifier& table, int size) argument 283 StatsTable* table; member in struct:base::StatsTable::TLSData 290 StatsTable(const TableIdentifier& table, int max_threads, int max_counters) argument 474 StatsTable *table = StatsTable::current(); local [all...] |
/external/chromium_org/base/strings/ |
H A D | string_piece.cc | 15 // to the ASCII code of that character to 1 in table. This is used by 17 // the lookup table in constant time. 18 // The argument `table' must be an array that is large enough to hold all 21 // bool table[UCHAR_MAX + 1] 23 bool* table) { 27 table[static_cast<unsigned char>(data[i])] = true; 195 // 8-bit version using lookup table. 227 // 8-bit version using lookup table. 299 // 8-bit version using lookup table. 338 // 8-bit version using lookup table 22 BuildLookupTable(const StringPiece& characters_wanted, bool* table) argument [all...] |