HomeSort by relevance Sort by last modified time
    Searched refs:Entry (Results 401 - 425 of 2434) sorted by null

<<11121314151617181920>>

  /external/sl4a/ScriptingLayerForAndroid/src/org/connectbot/util/
EncodingPreference.java 10 import java.util.Map.Entry;
20 for (Entry<String, Charset> entry : Charset.availableCharsets().entrySet()) {
21 Charset c = entry.getValue();
23 String key = entry.getKey();
29 charsetIdsList.add(entry.getKey());
  /external/slf4j/slf4j-log4j12/src/main/java/org/slf4j/impl/
Log4jMDCAdapter.java 83 Map.Entry mapEntry = (Map.Entry) entrySetIterator.next();
  /external/v8/src/ast/
modules.cc 27 ZoneHashMap::Entry* p =
52 ZoneHashMap::Entry* entry = exports_->Lookup(
54 if (entry == nullptr) return nullptr;
55 DCHECK_NOT_NULL(entry->value);
56 return static_cast<const AstRawString*>(entry->value);
  /frameworks/base/core/tests/benchmarks/src/android/net/
NetworkStatsBenchmark.java 35 NetworkStats.Entry recycle = new NetworkStats.Entry();
  /frameworks/base/tools/preload2/src/com/android/preload/
DumpData.java 73 for (Map.Entry<String, String> e : dumpData.entrySet()) {
83 for (Map.Entry<String, String> e : dumpData.entrySet()) {
  /frameworks/compile/mclinker/lib/Target/AArch64/
AArch64PLT.h 38 class AArch64PLT0 : public PLT::Entry<sizeof(aarch64_plt0)> {
43 class AArch64PLT1 : public PLT::Entry<sizeof(aarch64_plt1)> {
59 // hasPLT1 - return if this plt section has any plt1 entry
  /frameworks/compile/mclinker/lib/Target/Hexagon/
HexagonPLT.h 47 // HexagonPLT Entry
49 class HexagonPLT0 : public PLT::Entry<sizeof(hexagon_plt0)> {
70 // hasPLT1 - return if this PLT has any PLT1 entry
90 class HexagonPLT1 : public PLT::Entry<sizeof(hexagon_plt1)> {
  /libcore/ojluni/src/main/java/sun/security/util/
ManifestDigester.java 43 private HashMap<String, Entry> entries; // key is a UTF-8 string
111 entries = new HashMap<String, Entry>();
120 // create an entry for main attributes
122 new Entry(0, pos.endOfSection + 1, pos.startOfNext, rawBytes));
169 new Entry(start, sectionLen, sectionLenWithBlank,
192 public static class Entry {
199 public Entry(int offset, int length,
255 public Entry get(String name, boolean oldStyle) {
256 Entry e = entries.get(name);
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/binary_heap_/
const_iterator.hpp 53 binary_heap_point_const_iterator_<Value_Type, Entry, Simple, _Alloc>
57 typename Entry,
point_const_iterator.hpp 53 template<typename Value_Type, typename Entry, bool Simple,
58 typedef typename _Alloc::template rebind<Entry>::other::pointer entry_pointer;
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/binary_heap_/
const_iterator.hpp 53 binary_heap_point_const_iterator_<Value_Type, Entry, Simple, _Alloc>
57 typename Entry,
point_const_iterator.hpp 53 template<typename Value_Type, typename Entry, bool Simple,
58 typedef typename _Alloc::template rebind<Entry>::other::pointer entry_pointer;
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/binary_heap_/
const_iterator.hpp 53 binary_heap_point_const_iterator_<Value_Type, Entry, Simple, _Alloc>
57 typename Entry,
point_const_iterator.hpp 53 template<typename Value_Type, typename Entry, bool Simple,
58 typedef typename _Alloc::template rebind<Entry>::other::pointer entry_pointer;
  /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/binary_heap_/
const_iterator.hpp 53 binary_heap_point_const_iterator_<Value_Type, Entry, Simple, _Alloc>
57 typename Entry,
point_const_iterator.hpp 53 template<typename Value_Type, typename Entry, bool Simple,
58 typedef typename _Alloc::template rebind<Entry>::other::pointer entry_pointer;
  /toolchain/binutils/binutils-2.25/ld/testsuite/ld-powerpc/
vle-multiseg-1.d 3 Entry point 0x0
vle-multiseg-2.d 3 Entry point 0x0
vle-multiseg-3.d 3 Entry point 0x0
vle-multiseg-4.d 3 Entry point 0x0
vle-multiseg-5.d 3 Entry point 0x0
  /external/guava/guava/src/com/google/common/collect/
ConcurrentHashMultiset.java 64 * the entry from the Map. If another operation sees a zero in the map, it knows that the entry is
108 * <p>If this {@link MapMaker} is configured to use entry eviction of any kind, this eviction
111 * stored in the map, so {@link MapMaker#expireAfterAccess} makes sense (evict the entry that
191 for (Multiset.Entry<E> entry : entrySet()) {
192 E element = entry.getElement();
193 for (int i = entry.getCount(); i > 0; i--) {
292 // Just CASed to 0; remove the entry to clean up the map. If the removal fails,
333 // Just CASed to 0; remove the entry to clean up the map. If the removal fails
    [all...]
RegularImmutableBiMap.java 53 * <p>This allows reuse of the entry objects from the array in the actual implementation.
65 TerminalEntry<K, V> entry = (TerminalEntry<K, V>) entriesToAdd[i]; local
66 K key = entry.getKey();
67 V value = entry.getValue();
77 checkNoConflict(!key.equals(keyEntry.getKey()), "key", entry, keyEntry);
82 checkNoConflict(!value.equals(valueEntry.getValue()), "value", entry, valueEntry);
86 ? entry
87 : new NonTerminalBiMapEntry<K, V>(entry, nextInKeyBucket, nextInValueBucket);
103 RegularImmutableBiMap(Entry<?, ?>[] entriesToAdd) {
114 Entry<K, V> entry = (Entry<K, V>) entriesToAdd[i] local
    [all...]
  /external/guava/guava-tests/test/com/google/common/collect/
SynchronizedNavigableMapTest.java 34 import java.util.Map.Entry;
56 private final Entry<K, V> delegate;
59 TestEntry(Entry<K, V> delegate, Object mutex) {
64 @Override protected Entry<K, V> delegate() {
107 @Override public Entry<K, V> ceilingEntry(K key) {
127 @Override public Entry<K, V> firstEntry() {
132 @Override public Entry<K, V> floorEntry(K key) {
151 @Override public Entry<K, V> higherEntry(K key) {
161 @Override public Entry<K, V> lastEntry() {
166 @Override public Entry<K, V> lowerEntry(K key)
    [all...]
  /external/llvm/lib/CodeGen/
MachineModuleInfo.cpp 97 AddrLabelSymEntry &Entry = AddrLabelSymbols[BB];
99 // If we already had an entry for this block, just return it.
100 if (!Entry.Symbols.empty()) {
101 assert(BB->getParent() == Entry.Fn && "Parent changed");
102 return Entry.Symbols;
105 // Otherwise, this is a new entry, create a new symbol for it and add an
106 // entry to BBCallbacks so we can be notified if the BB is deleted or RAUWd.
109 Entry.Index = BBCallbacks.size() - 1;
110 Entry.Fn = BB->getParent();
111 Entry.Symbols.push_back(Context.createTempSymbol())
    [all...]

Completed in 460 milliseconds

<<11121314151617181920>>