| /external/llvm/include/llvm/MC/ |
| ConstantPools.h | 42 EntryVecTy Entries;
|
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DwarfAccelTable.cpp | 31 Entries(Allocator) {}
38 DataArray &DIEs = Entries[Name.getString()];
73 Data.reserve(Entries.size());
74 for (StringMap<DataArray>::iterator EI = Entries.begin(), EE = Entries.end();
77 // Unique the entries.
267 O << "Entries: \n";
268 for (StringMap<DataArray>::const_iterator EI = Entries.begin(),
269 EE = Entries.end();
|
| DwarfAccelTable.h | 236 StringEntries Entries;
|
| /external/clang/lib/Basic/ |
| SourceManager.cpp | 192 std::vector<LineEntry> &Entries = LineEntries[FID];
194 assert((Entries.empty() || Entries.back().FileOffset < Offset) &&
195 "Adding line entries out of order!");
200 if (!Entries.empty()) {
204 FilenameID = Entries.back().FilenameID;
208 Kind = Entries.back().FileKind;
209 IncludeOffset = Entries.back().IncludeOffset;
212 Entries.push_back(LineEntry::get(Offset, LineNo, FilenameID, Kind,
227 std::vector<LineEntry> &Entries = LineEntries[FID]
[all...] |
| VirtualFileSystem.cpp | 444 std::map<std::string, std::unique_ptr<InMemoryNode>> Entries;
450 auto I = Entries.find(Name);
451 if (I != Entries.end())
456 return Entries.insert(make_pair(Name, std::move(Child)))
460 typedef decltype(Entries)::const_iterator const_iterator;
461 const_iterator begin() const { return Entries.begin(); }
462 const_iterator end() const { return Entries.end(); }
467 for (const auto &Entry : Entries) {
754 /// <directory entries>
768 /// 'contents': [ <file or directory entries> ]
[all...] |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.jdt.debug_3.6.1.v20100715_r361/ |
| plugin.properties | 17 descriptionMap=Map Entries
|
| /external/v8/test/js-perf-test/Object/ |
| entries.js | 5 new BenchmarkSuite('Entries', [1000], [
15 result = Object.entries(object);
46 result[i] = Object.entries(object[i]);
|
| /prebuilts/tools/linux-x86_64/kythe/proto/ |
| storage.proto | 36 // Write atomically inserts or updates a collection of entries into the store.
41 // from the store; entries are only ever inserted or updated. Apart from
50 // Count returns the number of entries in the given shard.
149 message Entries {
150 repeated Entry entries = 1;
157 // Return entries having this source VName, which may not be empty.
160 // Return entries having this edge kind; if empty, only entries with an empty
161 // edge kind are returned; if "*", entries of any edge kind are returned.
184 // Return entries having this target VName; if empty, any target field i
[all...] |
| /external/clang/include/clang/Basic/ |
| SourceManagerInternals.h | 87 /// \brief Map from FileIDs to a list of line entries (sorted by the offset
123 void AddEntry(FileID FID, const std::vector<LineEntry> &Entries);
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/gdiplus/ |
| gdipluspixelformats.h | 92 ARGB Entries[1];
|
| /external/libgdx/gdx/src/com/badlogic/gdx/utils/ |
| ArrayMap.java | 38 private Entries entries1, entries2;
340 /** Reduces the size of the backing arrays to the size of the actual number of entries. This is useful to release memory when
341 * many items have been removed, or if it is known that more entries will not be added. */
347 /** Increases the size of the backing arrays to accommodate the specified number of additional entries. Useful before adding
348 * many entries to avoid multiple backing array resizes. */
457 return entries();
460 /** Returns an iterator for the entries in the map. Remove is supported. Note that the same iterator instance is returned each
461 * time this method is called. Use the {@link Entries} constructor for nested or multithreaded iteration. */
462 public Entries<K, V> entries () {
method in class:ArrayMap
[all...] |
| ObjectFloatMap.java | 47 private Entries entries1, entries2;
154 for (Entry<K> entry : map.entries())
554 public Entries<K> iterator () {
555 return entries();
558 /** Returns an iterator for the entries in the map. Remove is supported. Note that the same iterator instance is returned each
559 * time this method is called. Use the {@link Entries} constructor for nested or multithreaded iteration. */
560 public Entries<K> entries () { method in class:ObjectFloatMap
562 entries1 = new Entries(this);
563 entries2 = new Entries(this)
[all...] |
| ObjectIntMap.java | 47 private Entries entries1, entries2;
154 for (Entry<K> entry : map.entries())
555 public Entries<K> iterator () {
556 return entries();
559 /** Returns an iterator for the entries in the map. Remove is supported. Note that the same iterator instance is returned each
560 * time this method is called. Use the {@link Entries} constructor for nested or multithreaded iteration. */
561 public Entries<K> entries () {
method in class:ObjectIntMap
563 entries1 = new Entries(this);
564 entries2 = new Entries(this);
[all...] |
| ObjectMap.java | 47 private Entries entries1, entries2;
600 public Entries<K, V> iterator () {
601 return entries();
604 /** Returns an iterator for the entries in the map. Remove is supported. Note that the same iterator instance is returned each
605 * time this method is called. Use the {@link Entries} constructor for nested or multithreaded iteration. */
606 public Entries<K, V> entries () {
method in class:ObjectMap
608 entries1 = new Entries(this);
609 entries2 = new Entries(this);
714 static public class Entries<K, V> extends MapIterator<K, V, Entry<K, V>> {
[all...] |
| /external/chromium-trace/catapult/third_party/gsutil/third_party/boto/boto/gs/ |
| acl.py | 32 ENTRIES = 'Entries'
59 self.entries = Entries(self)
71 acl_entries = self.entries
82 self.entries.entry_list.append(entry)
88 self.entries.entry_list.append(entry)
93 self.entries.entry_list.append(entry)
97 self.entries.entry_list.append(entry)
103 elif name.lower() == ENTRIES.lower()
[all...] |
| /external/llvm/lib/DebugInfo/DWARF/ |
| DWARFDebugFrame.cpp | 28 /// entries implement.
489 Entries.emplace_back(std::move(Cie));
496 Entries.emplace_back(new FDE(StartOffset, Length, CIEPointer,
501 Entries.back()->parseInstructions(Data, &Offset, EndStructureOffset);
515 for (const auto &Entry : Entries) {
|
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| CStringChecker.cpp | [all...] |
| /external/bison/build-aux/ |
| vc-list-files | 93 if (f ~ /CVS\/Entries$/) \
97 `find "$dir" -name Entries -print` /dev/null' $postprocess
|
| /external/guava/guava/src/com/google/common/collect/ |
| FilteredKeyMultimap.java | 180 return new Entries();
183 class Entries extends ForwardingCollection<Entry<K, V>> {
186 return Collections2.filter(unfiltered.entries(), entryPredicate());
|
| /toolchain/binutils/binutils-2.25/gold/ |
| merge.h | 112 // A list of entries for a particular input section.
115 typedef std::vector<Input_merge_entry> Entries;
138 Entries entries; member in struct:gold::Object_merge_map::Input_merge_map
139 // Whether the ENTRIES field is sorted by input_offset.
143 : merge_map(NULL), entries(), sorted(true)
406 // Compare two entries in the hash table for equality. To do this
450 // The number of entries seen in input files.
566 // The number of entries seen in input files.
|
| /external/llvm/include/llvm/CodeGen/ |
| MIRYamlMapping.h | 302 std::vector<Entry> Entries;
328 YamlIO.mapOptional("entries", JT.Entries);
421 if (!YamlIO.outputting() || !MF.JumpTableInfo.Entries.empty())
|
| /external/libgdx/tests/gdx-tests/src/com/badlogic/gdx/tests/g3d/shadows/system/ |
| BaseShadowSystem.java | 49 import com.badlogic.gdx.utils.ObjectMap.Entries;
94 protected Entries<SpotLight, LightProperties> spotCameraIterator;
95 protected Entries<DirectionalLight, LightProperties> dirCameraIterator;
96 protected Entries<PointLight, PointLightProperties> pointCameraIterator;
|
| /external/llvm/lib/CodeGen/ |
| InterferenceCache.h | 133 // much memory. Instead, a fixed number of cache entries are used in a round-
145 // The actual cache entries.
146 Entry Entries[CacheEntries];
|
| /external/llvm/test/MC/ARM/ |
| eh-directive-unwind_raw.s | 60 @ CHECK: Entries [
|
| /external/clang/lib/AST/ |
| ExprConstant.cpp | 183 /// The entries on the path from the glvalue to the designated subobject.
184 SmallVector<PathEntry, 8> Entries;
200 Entries.insert(Entries.end(), VEntries.begin(), VEntries.end());
214 Entries.clear();
223 Entries[MostDerivedPathLength - 1].ArrayIndex == MostDerivedArraySize)
242 Entries.push_back(Entry);
248 MostDerivedPathLength = Entries.size();
256 Entries.push_back(Entry);
263 MostDerivedPathLength = Entries.size()
[all...] |
