Searched refs:Entry (Results 251 - 275 of 1050) sorted by relevance

<<11121314151617181920>>

/external/chromium_org/third_party/WebKit/Source/modules/filesystem/
H A DDataTransferItemFileSystem.cpp43 #include "modules/filesystem/Entry.h"
51 Entry* DataTransferItemFileSystem::webkitGetAsEntry(ExecutionContext* executionContext, DataTransferItem& item)
/external/chromium_org/third_party/webrtc/base/
H A Ddiskcache.h63 struct Entry { struct in class:rtc::DiskCache
70 typedef std::map<std::string, Entry> EntryMap;
79 const Entry* GetEntry(const std::string& id) const {
82 Entry* GetOrCreateEntry(const std::string& id, bool create);
H A Ddiskcache.cc98 Entry* entry = GetOrCreateEntry(id, true);
112 Entry* entry = GetOrCreateEntry(id, false);
140 Entry* entry = GetOrCreateEntry(id, false);
156 const Entry* entry = GetEntry(id);
172 const Entry* entry = GetEntry(id);
177 const Entry* entry = GetEntry(id);
187 Entry* entry = GetOrCreateEntry(id, false);
297 DiskCache::Entry* DiskCache::GetOrCreateEntry(const std::string& id,
304 Entry e;
315 const Entry* entr
[all...]
/external/clang/include/clang/Basic/
H A DIdentifierTable.h74 llvm::StringMapEntry<IdentifierInfo*> *Entry; member in class:clang::IdentifierInfo
97 if (Entry) return Entry->getKeyData();
110 if (Entry) return Entry->getKeyLength();
447 llvm::StringMapEntry<IdentifierInfo*> &Entry = local
450 IdentifierInfo *II = Entry.getValue();
458 Entry.setValue(II);
466 Entry.setValue(II);
470 II->Entry
489 llvm::StringMapEntry<IdentifierInfo*> &Entry = local
[all...]
/external/clang/lib/Lex/
H A DMacroArgs.cpp35 for (MacroArgs **Entry = &PP.MacroArgCache; *Entry;
36 Entry = &(*Entry)->ArgCache)
37 if ((*Entry)->NumUnexpArgTokens >= UnexpArgTokens.size() &&
38 (*Entry)->NumUnexpArgTokens < ClosestMatch) {
39 ResultEnt = Entry;
42 if ((*Entry)->NumUnexpArgTokens == UnexpArgTokens.size())
45 ClosestMatch = (*Entry)->NumUnexpArgTokens;
/external/clang/unittests/Tooling/
H A DRewriterTestContext.h52 const FileEntry *Entry = local
54 Sources.overrideFileContents(Entry, Source);
55 assert(Entry != nullptr);
56 return Sources.createFileID(Entry, SourceLocation(), SrcMgr::C_User);
/external/guava/guava-testlib/src/com/google/common/collect/testing/
H A DSafeTreeMap.java72 @Override public Entry<K, V> ceilingEntry(K key) {
115 @Override public Set<Entry<K, V>> entrySet() {
119 @Override public Entry<K, V> firstEntry() {
127 @Override public Entry<K, V> floorEntry(K key) {
148 @Override public Entry<K, V> higherEntry(K key) {
164 @Override public Entry<K, V> lastEntry() {
172 @Override public Entry<K, V> lowerEntry(K key) {
184 @Override public Entry<K, V> pollFirstEntry() {
188 @Override public Entry<K, V> pollLastEntry() {
H A DMapInterfaceTest.java29 import java.util.Map.Entry;
181 Set<Entry<K, V>> entrySet = map.entrySet();
218 for (Entry<K, V> entry : entrySet) {
228 assertTrue(entrySet.containsAll(new HashSet<Entry<K, V>>(entrySet)));
229 assertTrue(entrySet.equals(new HashSet<Entry<K, V>>(entrySet)));
236 Entry<?, ?>[] entrySetToArray2 = new Entry<?, ?>[map.size() + 2];
254 for (Entry<K, V> entry : entrySet) {
344 final Set<Entry<K, V>> entrySet;
361 for (Entry<
[all...]
H A DHelpers.java36 import java.util.Map.Entry;
69 static <K, V> Entry<K, V> mapEntry(K key, V value) {
164 public static <K, V> Comparator<Entry<K, V>> entryComparator(
166 return new Comparator<Entry<K, V>>() {
168 public int compare(Entry<K, V> a, Entry<K, V> b) {
251 public static <K, V> Map.Entry<K, V> nefariousMapEntry(final K key,
253 return new Map.Entry<K, V>() {
265 if (o instanceof Map.Entry<?, ?>) {
266 Map.Entry<
[all...]
/external/guava/guava-tests/test/com/google/common/collect/
H A DAbstractMapEntryTest.java24 import java.util.Map.Entry;
36 private static <K, V> Entry<K, V> entry(final K key, final V value) {
47 private static <K, V> Entry<K, V> control(K key, V value) {
62 Entry<String, Integer> foo1 = entry("foo", 1);
H A DFilteredMultimapTest.java24 import java.util.Map.Entry;
34 private static final Predicate<Map.Entry<String, Integer>> ENTRY_PREDICATE
35 = new Predicate<Map.Entry<String, Integer>>() {
36 @Override public boolean apply(Entry<String, Integer> entry) {
H A DLinkedListMultimapTest.java40 import java.util.Map.Entry;
246 Iterator<Map.Entry<String, Integer>> entries = map.entries().iterator();
247 Map.Entry<String, Integer> entry = entries.next();
267 Iterator<Map.Entry<String, Collection<Integer>>> entries
269 Map.Entry<String, Collection<Integer>> entry = entries.next();
291 Collection<Map.Entry<String, Integer>> entries = multimap.entries();
292 Iterator<Map.Entry<String, Integer>> iterator = entries.iterator();
293 Map.Entry<String, Integer> entrya = iterator.next();
294 Map.Entry<String, Integer> entryb = iterator.next();
309 Collection<Map.Entry<Strin
[all...]
/external/lldb/source/Plugins/SymbolFile/DWARF/
H A DDWARFDebugAranges.cpp77 m_aranges.Append(RangeToDIE::Entry (descriptor.address, descriptor.length, cu_offset));
119 const RangeToDIE::Entry *entry = m_aranges.GetEntryAtIndex(i);
132 m_aranges.Append(RangeToDIE::Entry (low_pc, high_pc - low_pc, offset));
173 const RangeToDIE::Entry *entry = m_aranges.FindEntryThatContains(address);
/external/openfst/src/include/fst/
H A Dgeneric-register.h44 typedef EntryType Entry; typedef in class:fst::GenericRegister
142 // and Entry, and have appropriate static GetRegister() and instance
149 typedef typename RegisterType::Entry Entry; typedef in class:fst::GenericRegisterer
151 GenericRegisterer(Key key, Entry entry) {
H A Dregister.h91 typedef typename FstRegister<Arc>::Entry Entry; typedef in class:fst::FstRegisterer
99 Entry BuildEntry() {
103 return Entry(reinterpret_cast<Reader>(reader),
/external/smack/src/org/apache/qpid/management/common/sasl/
H A DJCAProvider.java50 for (Map.Entry<String, Class<? extends SaslClientFactory>> me : providerMap.entrySet())
/external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/authoring/tracks/
H A DAppendTrack.java249 public List<TimeToSampleBox.Entry> getDecodingTimeEntries() {
256 LinkedList<TimeToSampleBox.Entry> returnDecodingEntries = new LinkedList<TimeToSampleBox.Entry>();
260 TimeToSampleBox.Entry e = new TimeToSampleBox.Entry(1, nuDecodingTime);
263 TimeToSampleBox.Entry e = returnDecodingEntries.getLast();
274 public List<CompositionTimeToSample.Entry> getCompositionTimeEntries() {
280 LinkedList<CompositionTimeToSample.Entry> compositionTimeEntries = new LinkedList<CompositionTimeToSample.Entry>();
284 CompositionTimeToSample.Entry
[all...]
/external/chromium_org/content/browser/appcache/
H A Dappcache_disk_cache.cc49 // An implementation of AppCacheDiskCacheInterface::Entry that's a thin
50 // wrapper around disk_cache::Entry.
51 class AppCacheDiskCache::EntryImpl : public Entry {
53 EntryImpl(disk_cache::Entry* disk_cache_entry,
61 // Entry implementation.
105 disk_cache::Entry* disk_cache_entry_;
119 int CreateEntry(int64 key, Entry** entry,
127 int OpenEntry(int64 key, Entry** entry,
143 int HandleImmediateReturnValue(int rv, Entry** entry,
167 Entry** entry
[all...]
/external/chromium_org/third_party/skia/src/gpu/gl/
H A DGrGpuGL_program.cpp24 struct GrGpuGL::ProgramCache::Entry { struct in class:GrGpuGL::ProgramCache
25 SK_DECLARE_INST_COUNT_ROOT(Entry);
26 Entry() : fProgram(NULL), fLRUStamp(0) {} function in struct:GrGpuGL::ProgramCache::Entry
33 bool operator() (const GrGLProgramDesc& desc, const Entry* entry) {
38 bool operator() (const Entry* entry, const GrGLProgramDesc& desc) {
90 return SkTSearch(fEntries, fCount, desc, sizeof(Entry*), less);
101 Entry* entry = NULL;
109 Entry* hashedEntry = fHashTable[hashIdx];
138 entry = SkNEW(Entry);
166 size_t copySize = (purgeIdx - entryIdx) * sizeof(Entry*);
[all...]
/external/guava/guava/src/com/google/common/collect/
H A DAbstractMapBasedMultiset.java81 * <p>Invoking {@link Multiset.Entry#getCount} on an entry in the returned
86 public Set<Multiset.Entry<E>> entrySet() {
91 Iterator<Entry<E>> entryIterator() {
92 final Iterator<Map.Entry<E, Count>> backingEntries =
94 return new Iterator<Multiset.Entry<E>>() {
95 Map.Entry<E, Count> toRemove;
103 public Multiset.Entry<E> next() {
104 final Map.Entry<E, Count> mapEntry = backingEntries.next();
162 * retrieve the Map.Entry<E, AtomicInteger> entry, which can then be used for
166 final Iterator<Map.Entry<
[all...]
H A DArrayTable.java34 import java.util.Map.Entry;
542 @Override public Set<Entry<R, V>> entrySet() {
568 private class ColumnEntrySet extends AbstractSet<Entry<R, V>> {
575 @Override public Iterator<Entry<R, V>> iterator() {
576 return new AbstractIndexedListIterator<Entry<R, V>>(size()) {
577 @Override protected Entry<R, V> get(final int rowIndex) {
620 @Override public Set<Entry<C, Map<R, V>>> entrySet() {
643 private class ColumnMapEntrySet extends AbstractSet<Entry<C, Map<R, V>>> {
644 @Override public Iterator<Entry<C, Map<R, V>>> iterator() {
645 return new AbstractIndexedListIterator<Entry<
[all...]
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
H A DAbstractMapBasedMultiset.java78 * <p>Invoking {@link Multiset.Entry#getCount} on an entry in the returned
83 public Set<Multiset.Entry<E>> entrySet() {
88 Iterator<Entry<E>> entryIterator() {
89 final Iterator<Map.Entry<E, Count>> backingEntries =
91 return new Iterator<Multiset.Entry<E>>() {
92 Map.Entry<E, Count> toRemove;
100 public Multiset.Entry<E> next() {
101 final Map.Entry<E, Count> mapEntry = backingEntries.next();
159 * retrieve the Map.Entry<E, AtomicInteger> entry, which can then be used for
163 final Iterator<Map.Entry<
[all...]
/external/llvm/lib/MC/
H A DMCContext.cpp102 StringMapEntry<MCSymbol*> &Entry = Symbols.GetOrCreateValue(Name); local
103 MCSymbol *Sym = Entry.getValue();
109 Entry.setValue(Sym);
222 const MCSectionMachO *&Entry = MachOUniquingMap[Name.str()]; local
223 if (Entry) return Entry;
226 return Entry = new (*this) MCSectionMachO(Segment, Section, TypeAndAttributes,
255 auto &Entry = *IterBool.first; local
256 if (!IterBool.second) return Entry.second;
267 StringRef CachedName = Entry
[all...]
/external/skia/src/gpu/gl/
H A DGrGpuGL_program.cpp23 struct GrGpuGL::ProgramCache::Entry { struct in class:GrGpuGL::ProgramCache
24 SK_DECLARE_INST_COUNT_ROOT(Entry);
25 Entry() : fProgram(NULL), fLRUStamp(0) {} function in struct:GrGpuGL::ProgramCache::Entry
32 bool operator() (const GrGLProgramDesc& desc, const Entry* entry) {
37 bool operator() (const Entry* entry, const GrGLProgramDesc& desc) {
89 return SkTSearch(fEntries, fCount, desc, sizeof(Entry*), less);
99 Entry* entry = NULL;
107 Entry* hashedEntry = fHashTable[hashIdx];
135 entry = SkNEW(Entry);
163 size_t copySize = (purgeIdx - entryIdx) * sizeof(Entry*);
[all...]
/external/llvm/lib/CodeGen/
H A DMachineModuleInfo.cpp103 AddrLabelSymEntry &Entry = AddrLabelSymbols[BB]; local
106 if (!Entry.Symbols.isNull()) {
107 assert(BB->getParent() == Entry.Fn && "Parent changed");
108 if (Entry.Symbols.is<MCSymbol*>())
109 return Entry.Symbols.get<MCSymbol*>();
110 return (*Entry.Symbols.get<std::vector<MCSymbol*>*>())[0];
117 Entry.Index = BBCallbacks.size()-1;
118 Entry.Fn = BB->getParent();
120 Entry.Symbols = Result;
128 AddrLabelSymEntry &Entry local
163 AddrLabelSymEntry Entry = AddrLabelSymbols[BB]; local
[all...]

Completed in 629 milliseconds

<<11121314151617181920>>