/external/guava/guava-testlib/src/com/google/common/collect/testing/ |
H A D | TestStringMapGenerator.java | 48 public final Map<String, String> create(Object... entries) { argument 50 Entry<String, String>[] array = new Entry[entries.length]; 52 for (Object o : entries) { 61 Entry<String, String>[] entries); 60 create( Entry<String, String>[] entries) argument
|
/external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
H A D | BiMapGenerators.java | 71 Entry<String, String>[] entries) { 73 for (Entry<String, String> entry : entries) { 110 Entry<String, String>[] entries) { 112 for (Entry<String, String> entry : entries) { 70 createFromEntries( Entry<String, String>[] entries) argument 109 createFromEntries( Entry<String, String>[] entries) argument
|
/external/guava/guava-testlib/src/com/google/common/collect/testing/testers/ |
H A D | MapCreationTester.java | 81 Entry<K, V>[] entries = createSamplesArray(); 82 entries[getNullLocation()] = entry(null, null); 83 resetMap(entries); 84 expectContents(entries); 103 Entry<K, V>[] entries = getEntriesMultipleNullKeys(); 105 resetMap(entries); 114 Entry<K, V>[] entries = getEntriesMultipleNonNullKeys(); 116 resetMap(entries); 123 Entry<K, V>[] entries = createArrayWithNullKey(); 124 entries[ 134 expectFirstRemoved(Entry<K, V>[] entries) argument [all...] |
H A D | MapEqualsTester.java | 43 "A Map should equal any other Map containing the same entries.", 53 "A Map should not equal another Map containing different entries.", 61 Collection<Map.Entry<K, V>> entries = getSampleEntries(getNumEntries() - 1); 62 entries.add(entry(null, samples.e3.getValue())); 64 resetContainer(getSubjectGenerator().create(entries.toArray())); 65 assertTrue("A Map should equal any other Map containing the same entries," 67 getMap().equals(newHashMap(entries))); 72 Collection<Map.Entry<K, V>> entries = getSampleEntries(getNumEntries() - 1); 73 entries.add(entry(null, samples.e3.getValue())); 74 Map<K, V> other = newHashMap(entries); 126 newHashMap( Collection<? extends Map.Entry<? extends K, ? extends V>> entries) argument [all...] |
/external/javassist/src/main/javassist/tools/reflect/ |
H A D | Compiler.java | 78 CompiledClass[] entries = new CompiledClass[args.length]; 79 int n = parse(args, entries); 86 processClasses(entries, n); 89 private static void processClasses(CompiledClass[] entries, int n) argument 97 CtClass c = pool.get(entries[i].classname); 98 if (entries[i].metaobject != null 99 || entries[i].classobject != null) { 102 if (entries[i].metaobject == null) 105 metaobj = entries[i].metaobject; 107 if (entries[ [all...] |
/external/libexif/libexif/olympus/ |
H A D | exif-mnote-data-olympus.h | 47 MnoteOlympusEntry *entries; member in struct:_ExifMnoteDataOlympus
|
/external/libmtp/examples/ |
H A D | hotplug.c | 48 LIBMTP_device_entry_t *entries; local 86 ret = LIBMTP_Get_Supported_Devices_List(&entries, &numentries); 117 LIBMTP_device_entry_t * entry = &entries[i]; 188 LIBMTP_device_entry_t * entry = &entries[i];
|
/external/qemu/ |
H A D | gen-charmap.py | 67 entries = [] variable
|
/external/skia/src/core/ |
H A D | SkTObjectPool.h | 84 * The type for a new block of entries for the list. 87 T entries[numItemsPerBlock]; member in struct:SkTObjectPool::Block 103 fAvailable.push(&block->entries[index]);
|
/external/smack/src/org/jivesoftware/smack/ |
H A D | RosterGroup.java | 34 * A group of roster entries. 43 private final List<RosterEntry> entries; field in class:RosterGroup 54 entries = new ArrayList<RosterEntry>(); 67 * Sets the name of the group. Changing the group's name is like moving all the group entries 68 * of the group to a new group specified by the new name. Since this group won't have entries 75 synchronized (entries) { 76 for (RosterEntry entry : entries) { 89 * Returns the number of entries in the group. 91 * @return the number of entries in the group. 94 synchronized (entries) { [all...] |
/external/speex/libspeex/ |
H A D | vq.c | 51 int scal_quant(spx_word16_t in, const spx_word16_t *boundary, int entries) argument 54 while (i<entries-1 && in>boundary[0]) 62 int scal_quant32(spx_word32_t in, const spx_word32_t *boundary, int entries) argument 65 while (i<entries-1 && in>boundary[0]) 75 /*Finds the indices of the n-best entries in a codebook*/ 76 void vq_nbest(spx_word16_t *in, const spx_word16_t *codebook, int len, int entries, spx_word32_t *E, int N, int *nbest, spx_word32_t *best_dist, char *stack) argument 80 for (i=0;i<entries;i++) 109 /*Finds the indices of the n-best entries in a codebook with sign*/ 110 void vq_nbest_sign(spx_word16_t *in, const spx_word16_t *codebook, int len, int entries, spx_word32_t *E, int N, int *nbest, spx_word32_t *best_dist, char *stack) argument 114 for (i=0;i<entries; [all...] |
H A D | vq_sse.h | 36 void vq_nbest(spx_word16_t *_in, const __m128 *codebook, int len, int entries, __m128 *E, int N, int *nbest, spx_word32_t *best_dist, char *stack) argument 43 ALLOC(dist, entries, float); 48 for (i=0;i<entries>>2;i++) 55 for (i=0;i<entries;i++) 75 void vq_nbest_sign(spx_word16_t *_in, const __m128 *codebook, int len, int entries, __m128 *E, int N, int *nbest, spx_word32_t *best_dist, char *stack) argument 82 ALLOC(dist, entries, float); 87 for (i=0;i<entries>>2;i++) 94 for (i=0;i<entries;i++) 117 nbest[k]+=entries;
|
/external/tremolo/Tremolo/ |
H A D | codebook.h | 61 long used_entries; /* populated codebook entries */ 68 long entries; /* codebook entries */ member in struct:codebook
|
/external/chromium_org/base/files/ |
H A D | file_enumerator_posix.cc | 77 // While we've exhausted the entries in the current directory, do the next 86 std::vector<FileInfo> entries; local 87 if (!ReadDirectory(&entries, root_path_, file_type_ & SHOW_SYM_LINKS)) 92 for (std::vector<FileInfo>::const_iterator i = entries.begin(); 93 i != entries.end(); ++i) { 119 bool FileEnumerator::ReadDirectory(std::vector<FileInfo>* entries, argument 153 entries->push_back(info);
|
/external/chromium_org/chrome/browser/chromeos/drive/ |
H A D | debug_info_collector.cc | 44 scoped_ptr<ResourceEntryVector> entries, 48 entries.reset(); 49 callback.Run(error, entries.Pass()); 92 scoped_ptr<ResourceEntryVector> entries(new ResourceEntryVector); 93 ResourceEntryVector* entries_ptr = entries.get(); 101 base::Bind(&RunReadDirectoryCallback, callback, base::Passed(&entries))); 42 RunReadDirectoryCallback( const DebugInfoCollector::ReadDirectoryCallback& callback, scoped_ptr<ResourceEntryVector> entries, FileError error) argument
|
/external/chromium_org/chrome/browser/chromeos/drive/file_system/ |
H A D | remove_operation.cc | 41 ResourceEntryVector entries; local 42 error = metadata->ReadDirectoryByPath(path, &entries); 45 if (!entries.empty())
|
H A D | search_operation.cc | 41 const ScopedVector<google_apis::FileResource>& entries = file_list->items(); local 42 result->reserve(entries.size()); 43 for (size_t i = 0; i < entries.size(); ++i) { 46 entries[i]->file_id(), &local_id); 54 if (!ConvertFileResourceToResourceEntry(*entries[i], &entry, 56 continue; // Skip non-file entries. 145 // ResolveSearchResultOnBlockingPool() may add entries newly created on the
|
/external/chromium_org/chrome/browser/sessions/ |
H A D | in_memory_tab_restore_service.cc | 51 const TabRestoreService::Entries& InMemoryTabRestoreService::entries() const { function in class:InMemoryTabRestoreService 52 return helper_.entries();
|
/external/chromium_org/chrome/browser/ui/ |
H A D | browser_tabrestore.cc | 72 std::vector<NavigationEntry*> entries = local 78 &entries); 79 DCHECK_EQ(0u, entries.size());
|
/external/chromium_org/chrome/browser/ui/webui/ |
H A D | instant_ui.cc | 132 base::ListValue* entries = new base::ListValue(); local 138 entries->Append(entry); 140 data.Set("entries", entries);
|
/external/chromium_org/chrome/browser/ui/webui/options/ |
H A D | password_manager_handler.cc | 155 base::ListValue entries; local 170 entries.Append(entry); 174 entries); 179 base::ListValue entries; local 181 entries.Append(new base::StringValue( 186 entries);
|
/external/chromium_org/chrome/installer/gcapi/ |
H A D | gcapi_omaha_experiment.cc | 45 std::vector<base::string16> entries; local 47 &entries); 51 for (std::vector<base::string16>::const_iterator it = entries.begin(); 52 it != entries.end(); ++it) {
|
/external/chromium_org/components/dom_distiller/core/ |
H A D | dom_distiller_test_util.cc | 19 const FakeDB<ArticleEntry>::EntryMap& entries) { 21 for (FakeDB<ArticleEntry>::EntryMap::const_iterator it = entries.begin(); 22 it != entries.end(); ++it) { 18 EntryMapToList( const FakeDB<ArticleEntry>::EntryMap& entries) argument
|
/external/chromium_org/components/dom_distiller/webui/ |
H A D | dom_distiller_handler.cc | 104 base::ListValue entries; local 117 entries.Append(entry.release()); 120 web_ui()->CallJavascriptFunction("domDistiller.onReceivedEntries", entries);
|
/external/chromium_org/content/child/ |
H A D | ftp_directory_listing_response_delegate.cc | 83 std::vector<FtpDirectoryListingEntry> entries; local 86 rv = net::ParseFtpDirectoryListing(buffer_, base::Time::Now(), &entries); 92 for (size_t i = 0; i < entries.size(); i++) { 93 const FtpDirectoryListingEntry& entry = entries[i]; 95 // Skip the current and parent directory entries in the listing. Our header
|