Searched refs:Entry (Results 51 - 75 of 736) sorted by relevance

1234567891011>>

/external/skia/src/core/
H A DSkDescriptor.h20 return sizeof(SkDescriptor) + entryCount * sizeof(Entry);
45 Entry* entry = (Entry*)((char*)this + fLength);
53 fLength += sizeof(Entry) + length;
68 const Entry* entry = (const Entry*)(this + 1);
78 entry = (const Entry*)((const char*)(entry + 1) + entry->fLen);
109 struct Entry { struct in class:SkDescriptor
155 + sizeof(SkDescriptor::Entry) + sizeof(SkScalerContext::Rec) // for rec
156 + sizeof(SkDescriptor::Entry)
[all...]
/external/chromium/net/base/
H A Dhost_cache.cc14 HostCache::Entry::Entry(int error, function in class:net::HostCache::Entry
20 HostCache::Entry::~Entry() {
36 const HostCache::Entry* HostCache::Lookup(const Key& key,
46 Entry* entry = it->second.get();
53 HostCache::Entry* HostCache::Set(const Key& key,
64 scoped_refptr<Entry>& entry = entries_[key];
66 // Entry didn't exist, creating one now.
67 Entry* pt
[all...]
/external/skia/legacy/src/effects/
H A DSkBitmapCache.cpp12 struct SkBitmapCache::Entry { struct in class:SkBitmapCache
13 Entry* fPrev;
14 Entry* fNext;
20 Entry(const void* buffer, size_t size, const SkBitmap& bm) function in struct:SkBitmapCache::Entry
29 ~Entry() { sk_free(fBuffer); }
46 Entry* entry = fHead;
48 Entry* next = entry->fNext;
54 SkBitmapCache::Entry* SkBitmapCache::detach(Entry* entry) const {
72 void SkBitmapCache::attachToHead(Entry* entr
[all...]
/external/skia/src/effects/gradients/
H A DSkBitmapCache.cpp12 struct SkBitmapCache::Entry { struct in class:SkBitmapCache
13 Entry* fPrev;
14 Entry* fNext;
20 Entry(const void* buffer, size_t size, const SkBitmap& bm) function in struct:SkBitmapCache::Entry
29 ~Entry() { sk_free(fBuffer); }
46 Entry* entry = fHead;
48 Entry* next = entry->fNext;
54 SkBitmapCache::Entry* SkBitmapCache::detach(Entry* entry) const {
72 void SkBitmapCache::attachToHead(Entry* entr
[all...]
/external/clang/tools/diagtool/
H A DListWarnings.cpp31 struct Entry { struct in namespace:__anon5055
35 Entry(llvm::StringRef diagN, llvm::StringRef flag) function in struct:__anon5055::Entry
38 bool operator<(const Entry &x) const { return DiagName < x.DiagName; }
42 static void printEntries(std::vector<Entry> &entries, llvm::raw_ostream &out) {
43 for (std::vector<Entry>::iterator it = entries.begin(), ei = entries.end();
53 std::vector<Entry> Flagged, Unflagged;
69 Entry entry(di->getName(),
/external/guava/guava-testlib/src/com/google/common/collect/testing/testers/
H A DMapHashCodeTester.java40 for (Map.Entry<K, V> entry : getSampleEntries()) {
51 Map.Entry<K, V> entryWithNull = entry(null, samples.e3.getValue());
58 Map.Entry<K, V> entryWithNull = entry(samples.e3.getKey(), null);
62 private void runEntryWithNullTest(Map.Entry<K, V> entryWithNull) {
63 Collection<Map.Entry<K, V>> entries = getSampleEntries(getNumEntries() - 1);
68 for (Map.Entry<K, V> entry : entries) {
79 private static int hash(Map.Entry<?, ?> e) {
/external/llvm/include/llvm/Support/
H A DArrayRecycler.h46 FreeList *Entry = Bucket[Idx];
47 if (!Entry)
49 Bucket[Idx] = Entry->Next;
50 return reinterpret_cast<T*>(Entry);
58 FreeList *Entry = reinterpret_cast<FreeList*>(Ptr); local
61 Entry->Next = Bucket[Idx];
62 Bucket[Idx] = Entry;
/external/webkit/Source/WebCore/fileapi/
H A DEntry.cpp31 #include "Entry.h"
49 Entry::Entry(PassRefPtr<DOMFileSystemBase> fileSystem, const String& fullPath) function in class:WebCore::Entry
54 void Entry::getMetadata(PassRefPtr<MetadataCallback> successCallback, PassRefPtr<ErrorCallback> errorCallbackRef)
61 void Entry::moveTo(PassRefPtr<DirectoryEntry> parent, const String& name, PassRefPtr<EntryCallback> successCallback, PassRefPtr<ErrorCallback> errorCallbackRef) const
68 void Entry::copyTo(PassRefPtr<DirectoryEntry> parent, const String& name, PassRefPtr<EntryCallback> successCallback, PassRefPtr<ErrorCallback> errorCallbackRef) const
75 void Entry::remove(PassRefPtr<VoidCallback> successCallback, PassRefPtr<ErrorCallback> errorCallbackRef) const
82 void Entry::getParent(PassRefPtr<EntryCallback> successCallback, PassRefPtr<ErrorCallback> errorCallbackRef) const
/external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/authoring/tracks/
H A DChangeTimeScaleTrack.java37 List<CompositionTimeToSample.Entry> ctts;
38 List<TimeToSampleBox.Entry> tts;
59 Queue<TimeToSampleBox.Entry> timeQueue = new LinkedList<TimeToSampleBox.Entry>(track.getDecodingTimeEntries());
73 TimeToSampleBox.Entry entry = timeQueue.poll();
87 public List<TimeToSampleBox.Entry> getDecodingTimeEntries() {
91 public List<CompositionTimeToSample.Entry> getCompositionTimeEntries() {
99 public List<SampleDependencyTypeBox.Entry> getSampleDependencies() {
142 static List<CompositionTimeToSample.Entry> adjustCtts(List<CompositionTimeToSample.Entry> sourc
[all...]
H A DCroppedTrack.java57 public List<TimeToSampleBox.Entry> getDecodingTimeEntries() {
64 LinkedList<TimeToSampleBox.Entry> returnDecodingEntries = new LinkedList<TimeToSampleBox.Entry>();
68 TimeToSampleBox.Entry e = new TimeToSampleBox.Entry(1, nuDecodingTime);
71 TimeToSampleBox.Entry e = returnDecodingEntries.getLast();
81 public List<CompositionTimeToSample.Entry> getCompositionTimeEntries() {
87 LinkedList<CompositionTimeToSample.Entry> returnDecodingEntries = new LinkedList<CompositionTimeToSample.Entry>();
91 CompositionTimeToSample.Entry
[all...]
/external/chromium/chrome/browser/
H A Dcustom_home_pages_table_model.h57 // Each item in the model is represented as an Entry. Entry stores the URL,
59 struct Entry;
62 void LoadTitleAndFavicon(Entry* entry);
64 // Callback from history service. Updates the title of the Entry whose
71 // Callback from history service. Updates the icon of the Entry whose
78 Entry* GetEntryByLoadHandle(CancelableRequestProvider::Handle Entry::* member,
86 std::vector<Entry> entries_;
/external/chromium/chrome/browser/sync/engine/
H A Dbuild_and_process_conflict_sets_command.h17 class Entry;
59 syncable::Entry* entry,
62 syncable::Entry* entry,
65 syncable::Entry* entry,
68 syncable::Entry* entry,
/external/guava/guava/src/com/google/common/cache/
H A DRemovalNotification.java24 import java.util.Map.Entry;
32 * <p>Like other {@code Map.Entry} instances associated with {@code CacheBuilder}, this class holds
40 public final class RemovalNotification<K, V> implements Entry<K, V> {
79 if (object instanceof Entry) {
80 Entry<?, ?> that = (Entry<?, ?>) object;
/external/guava/guava/src/com/google/common/collect/
H A DAbstractMapEntry.java22 import java.util.Map.Entry;
28 * methods of {@code Entry}.
33 abstract class AbstractMapEntry<K, V> implements Entry<K, V> {
47 if (object instanceof Entry) {
48 Entry<?, ?> that = (Entry<?, ?>) object;
H A DRegularImmutableMultiset.java71 UnmodifiableIterator<Entry<E>> entryIterator() {
72 final Iterator<Map.Entry<E, Integer>> mapIterator =
74 return new UnmodifiableIterator<Entry<E>>() {
81 public Entry<E> next() {
82 Map.Entry<E, Integer> mapEntry = mapIterator.next();
H A DSortedMultisets.java20 import com.google.common.collect.Multiset.Entry;
73 private static <E> E getElementOrThrow(Entry<E> entry) {
113 @Override public Entry<E> pollFirstEntry() {
117 @Override public Entry<E> pollLastEntry() {
147 @Override public Entry<E> firstEntry() {
151 @Override public Entry<E> lastEntry() {
155 abstract Iterator<Entry<E>> entryIterator();
157 private transient Set<Entry<E>> entrySet;
159 @Override public Set<Entry<E>> entrySet() {
160 Set<Entry<
[all...]
H A DWellBehavedMap.java36 private Set<Entry<K, V>> entrySet;
46 * {@code Set<Entry<K, V>>}. All other invocations are delegated as-is.
56 @Override public Set<Entry<K, V>> entrySet() {
57 Set<Entry<K, V>> es = entrySet;
66 extends Sets.InvertibleFunction<K, Map.Entry<K, V>> {
73 @Override public Map.Entry<K, V> apply(final K key) {
87 @Override public K invert(Map.Entry<K, V> entry) {
H A DEmptyImmutableMultiset.java49 UnmodifiableIterator<Entry<Object>> entryIterator() {
64 ImmutableSet<Entry<Object>> createEntrySet() {
/external/chromium/chrome/browser/sessions/
H A Dtab_restore_service.h52 struct Entry { struct in class:TabRestoreService
53 Entry();
54 explicit Entry(Type type);
55 virtual ~Entry();
74 struct Tab : public Entry {
104 struct Window : public Entry {
115 typedef std::list<Entry*> Entries;
170 std::vector<Entry*>* entries);
210 void AddEntry(Entry* entry, bool prune, bool to_front);
259 std::vector<Entry*>* loaded_entrie
[all...]
/external/mp4parser/isoparser/src/main/java/com/coremedia/iso/boxes/
H A DEditListBox.java48 * <li>Entry-count = 2</li>
57 private List<Entry> entries = new LinkedList<Entry>();
65 public List<Entry> getEntries() {
69 public void setEntries(List<Entry> entries) {
88 entries = new LinkedList<Entry>();
90 entries.add(new Entry(this, content));
99 for (Entry entry : entries) {
111 public static class Entry { class in class:EditListBox
118 * Creates a new <code>Entry</cod
124 public Entry(EditListBox editListBox, long segmentDuration, long mediaTime, double mediaRate) { method in class:EditListBox.Entry
131 public Entry(EditListBox editListBox, ByteBuffer bb) { method in class:EditListBox.Entry
[all...]
/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Dregister.h47 struct Entry { struct in class:fst::FstRegister
50 Entry() : reader(0), converter(0) {} function in struct:fst::FstRegister::Entry
66 void SetEntry(const string &type, const Entry &entry) {
77 Entry LookupEntry(const string &type) const {
79 typename map<string, Entry>::const_iterator it = fst_table_.find(type);
83 return Entry();
86 Entry GetEntry(const string &type) const {
88 Entry entry = LookupEntry(type);
113 map<string, Entry> fst_table_;
132 typedef typename FstRegister<Arc>::Entry Entr typedef in class:fst::FstRegisterer
[all...]
/external/chromium/net/disk_cache/
H A Ddisk_cache_test_base.h27 class Entry;
91 int OpenEntry(const std::string& key, disk_cache::Entry** entry);
92 int CreateEntry(const std::string& key, disk_cache::Entry** entry);
98 int OpenNextEntry(void** iter, disk_cache::Entry** next_entry);
101 int ReadData(disk_cache::Entry* entry, int index, int offset,
103 int WriteData(disk_cache::Entry* entry, int index, int offset,
105 int ReadSparseData(disk_cache::Entry* entry, int64 offset, net::IOBuffer* buf,
107 int WriteSparseData(disk_cache::Entry* entry, int64 offset,
/external/guava/guava-tests/test/com/google/common/collect/
H A DForwardingSortedMapTest.java34 import java.util.Map.Entry;
92 @Override public Set<Entry<K, V>> entrySet() {
95 public Iterator<Entry<K, V>> iterator() {
120 Entry<String, String>[] entries) {
122 for (Entry<String, String> entry : entries) {
128 @Override public Iterable<Entry<String, String>> order(
129 List<Entry<String, String>> insertionOrder) {
141 Entry<String, String>[] entries) {
144 for (Entry<String, String> entry : entries) {
150 @Override public Iterable<Entry<Strin
[all...]
/external/llvm/lib/IR/
H A DValue.cpp515 ValueHandleBase *&Entry = pImpl->ValueHandles[VP.getPointer()]; local
516 assert(Entry != 0 && "Value doesn't have any handles?");
517 AddToExistingUseList(&Entry);
529 ValueHandleBase *&Entry = Handles[VP.getPointer()]; local
530 assert(Entry == 0 && "Value really did already have handles?");
531 AddToExistingUseList(&Entry);
584 ValueHandleBase *Entry = pImpl->ValueHandles[V]; local
585 assert(Entry && "Value bit set but no entries exist");
596 for (ValueHandleBase Iterator(Assert, *Entry); Entry; Entr
642 ValueHandleBase *Entry = pImpl->ValueHandles[Old]; local
[all...]
/external/chromium/chrome/browser/notifications/
H A Dnotification_exceptions_table_model.cc18 struct NotificationExceptionsTableModel::Entry { struct in class:NotificationExceptionsTableModel
19 Entry(const GURL& origin, ContentSetting setting);
20 bool operator<(const Entry& b) const;
48 Entry* entry = &entries_[row];
75 const Entry& entry = entries_[row];
119 entries_.push_back(Entry(allowed[i], CONTENT_SETTING_ALLOW));
121 entries_.push_back(Entry(blocked[i], CONTENT_SETTING_BLOCK));
125 NotificationExceptionsTableModel::Entry::Entry( function in class:NotificationExceptionsTableModel::Entry
132 bool NotificationExceptionsTableModel::Entry
[all...]

Completed in 2718 milliseconds

1234567891011>>