Searched refs:entries (Results 1 - 25 of 1021) sorted by path

1234567891011>>

/external/antlr/antlr-3.4/runtime/C/include/
H A Dantlr3collections.h93 * may be NULL). Duplicate entries are chained from
96 pANTLR3_HASH_ENTRY entries; member in struct:ANTLR3_HASH_BUCKET_struct
241 /** Number of entries currently in the list;
257 * entries calling any free pointers for each entry.
261 /** Total number of entries in elements at any point in time
342 struct ANTLR3_TRIE_ENTRY_struct * next; /* Allows duplicate entries for same key in insertion order */
363 * Note also that this trie [can] accept multiple entries for the same key and is
397 * the vector entries in place, as well as a sort method that just returns an
/external/antlr/antlr-3.4/runtime/C/src/
H A Dantlr3collections.c163 table->buckets[bucket].entries = NULL;
166 /* Exclude duplicate entries by default
203 /* Free the table, all buckets and all entries, and all the
216 entry = thisBucket->entries;
218 /* Search all entries in the bucket and free them up
250 thisBucket->entries = NULL;
289 /* Now, we traverse the entries in the bucket until
290 * we find the key or the end of the entries in the bucket.
295 entry = bucket->entries; /* Entry to examine */
296 nextPointer = & bucket->entries; /* Wher
[all...]
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/
H A Dtask.rb178 if test( ?d, output_directory ) and ( Dir.entries( output_directory ) - %w( . .. ) ).empty?
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/test/
H A Dcore-extensions.rb213 entries = Dir.entries( directory ) - DOTS
214 entries.map! do |entry|
/external/bison/build-aux/
H A Dtexinfo.tex335 \normalturnoffactive % \ in index entries must not stay \, e.g., if
337 % We don't want .vr (or whatever) entries like this:
3117 % dummy definitions to worry about for index entries, etc.
3919 % We use \def instead of \let so that if one of the multitable entries
3963 % In order to keep entries from bumping into each other
3972 % will keep entries from bumping into each other. Table will start at
4306 % Define @defcodeindex, like @defindex except put all entries in @code.
4323 % @syncodeindex foo bar similar, but put all entries made for index foo
4715 \let\SETmarginindex=\relax % put index entries in margin (undocumented)?
4717 % Most index entries g
[all...]
/external/bison/
H A Dmaint.mk1072 # for any corrections to old entries.
/external/blktrace/btreplay/doc/
H A Dbtreplay.tex487 The only entries in the file that are allowed are these two element lines
/external/blktrace/doc/
H A Dblktrace.tex183 Events (8,0): 89 entries, 0 skips
296 Events (sdo): 0 entries, 0 skips
489 -m & --missing & Print missing entries\\ \hline
/external/bluetooth/bluedroid/osi/src/
H A Dconfig.c20 list_t *entries; member in struct:__anon1186
152 for (const list_node_t *node = list_begin(sec->entries); node != list_end(sec->entries); node = list_next(node)) {
162 list_append(sec->entries, entry);
224 section->entries = list_new(entry_free);
234 list_free(section->entries);
271 for (const list_node_t *node = list_begin(sec->entries); node != list_end(sec->entries); node = list_next(node)) {
/external/bouncycastle/bcpkix/src/main/java/org/bouncycastle/cert/
H A DX509CRLHolder.java160 TBSCertList.CRLEntry[] entries = x509CRL.getRevokedCertificates();
161 List l = new ArrayList(entries.length);
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/x509/
H A DTBSCertList.java254 CRLEntry[] entries = new CRLEntry[revokedCertificates.size()];
256 for (int i = 0; i < entries.length; i++)
258 entries[i] = CRLEntry.getInstance(revokedCertificates.getObjectAt(i));
261 return entries;
/external/chromium_org/android_webview/tools/
H A Dwebview_licenses.py113 entries = l.split('\t')
114 if entries[1] == "GENERATED FILE":
116 copyrights = entries[1].split(' / ')
119 offending_files.append(os.path.normpath(entries[0]))
144 and the whitelist contains no stale entries;
145 ScanResult.Warnings if there are stale entries;
146 ScanResult.Errors if new non-whitelisted entries found.
280 entries)
/external/chromium_org/apps/
H A Dsaved_files_service_unittest.cc75 // Check that a range of registered file entries have the correct values.
116 // Test that both entries #1 and #2 are unchanged because #2 is the most
139 // Test that after a clear, retained file entries are unchanged, but file
140 // entries that have been registered but not retained are no longer
163 std::vector<SavedFileEntry> entries = local
165 EXPECT_TRUE(entries.empty());
176 // Expect that entries 0 to 9 are in the queue, but 10 is not.
181 // Expect that entries 1 to 10 are in the queue, but entry 0 is not.
185 // Check that retained entries are unchanged after a clear.
191 // Expect that entry 2 is now at the back of the queue, and no further entries
[all...]
/external/chromium_org/ash/ime/
H A Dinfolist_window.cc170 const std::vector<ui::InfolistEntry>& entries)
203 for (size_t i = 0; i < entries.size(); ++i) {
205 entries[i], title_font_list_, description_font_list_));
225 void InfolistWindow::Relayout(const std::vector<ui::InfolistEntry>& entries) { argument
227 for (; i < entries.size(); ++i) {
229 entry_views_[i]->SetEntry(entries[i]);
232 entries[i], title_font_list_, description_font_list_);
241 entry_views_.resize(entries.size());
169 InfolistWindow(views::View* candidate_window, const std::vector<ui::InfolistEntry>& entries) argument
H A Dinfolist_window.h28 const std::vector<ui::InfolistEntry>& entries);
32 // Updates infolist contents with |entries|.
33 void Relayout(const std::vector<ui::InfolistEntry>& entries);
47 // The list of visible entries. Owned by views hierarchy.
/external/chromium_org/base/files/
H A Dfile_enumerator.h135 static bool ReadDirectory(std::vector<FileInfo>* entries,
H A Dfile_enumerator_posix.cc77 // 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/build/android/gyp/
H A Djava_cpp_enum.py17 def __init__(self, class_name=None, class_package=None, entries=None):
20 self.entries = collections.OrderedDict(entries or [])
24 if key in self.entries:
26 self.entries[key] = value
36 assert self.entries
44 if not all(self.entries.values()):
46 for key, value in self.entries.iteritems():
48 self.entries[key] = index
50 elif value in self.entries
[all...]
H A Djava_cpp_enum_tests.py19 entries=[('E1', 1), ('E2', '2 << 2')])
55 definition.entries)
84 definition.entries)
91 definition.entries)
102 definition.entries)
113 definition.entries)
126 definition.entries)
143 self.assertEqual(['A', 'B', 'C'], definition.entries.keys())
151 self.assertEqual(['A', 'B', 'C'], definition.entries.keys())
159 self.assertEqual(['A', 'B', 'NAME_LAST'], definition.entries
[all...]
/external/chromium_org/chrome/browser/android/
H A Drecently_closed_tabs_bridge.cc39 const TabRestoreService::Entries& entries,
43 for (TabRestoreService::Entries::const_iterator it = entries.begin();
44 it != entries.end() && added_count < max_tab_count; ++it) {
84 AddTabsToList(env, tab_restore_service_->entries(), jtabs_list,
38 AddTabsToList(JNIEnv* env, const TabRestoreService::Entries& entries, jobject jtabs_list, int max_tab_count) argument
/external/chromium_org/chrome/browser/chromeos/drive/
H A Dchange_list_processor.cc35 // Increments number of shared-with-me entries.
149 std::vector<ResourceEntry>* entries = change_list->mutable_entries(); local
150 for (size_t i = 0; i < entries->size(); ++i) {
151 ResourceEntry* entry = &(*entries)[i];
230 // Apply all entries except deleted ones to the metadata.
235 // Process deleted entries later to avoid deleting moved entries under it.
252 std::vector<ResourceEntryMap::iterator> entries; local
255 entries.push_back(it);
274 // for shared entries ma
[all...]
H A Dchange_list_processor.h77 const std::vector<ResourceEntry>& entries() const { return entries_; } function in class:drive::internal::ChangeList
122 // Adds or refreshes the child entries from |change_list| to the directory.
H A Ddebug_info_collector.cc44 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
H A Ddebug_info_collector.h21 scoped_ptr<ResourceEntryVector> entries)>
H A Ddirectory_loader.cc93 // Fetches the resource entries in the directory with |directory_resource_id|.
139 ResourceEntryVector* entries = new ResourceEntryVector; local
149 entries),
154 base::Owned(entries))));
421 // No need to read metadata when no one needs entries.
434 ResourceEntryVector* entries = new ResourceEntryVector; local
439 base::Unretained(resource_metadata_), local_id, entries),
443 base::Owned(entries)));
448 const ResourceEntryVector* entries,
454 if (error == FILE_ERROR_OK && entries)
446 OnDirectoryLoadCompleteAfterRead( const std::string& local_id, const ResourceEntryVector* entries, FileError error) argument
465 SendEntries(const std::string& local_id, const ResourceEntryVector& entries) argument
[all...]

Completed in 715 milliseconds

1234567891011>>