| /external/swiftshader/third_party/LLVM/unittests/ADT/ |
| ilistTest.cpp | 12 #include "llvm/ADT/ilist.h"
27 ilist<Node> List;
38 const ilist<Node> &ConstList = List;
|
| /external/llvm/unittests/ADT/ |
| ilistTest.cpp | 10 #include "llvm/ADT/ilist.h"
30 ilist<Node> List;
41 const ilist<Node> &ConstList = List;
48 ilist<Node> List;
68 ilist<Node> List;
75 ilist<Node>::iterator E = List.end();
|
| /external/swiftshader/third_party/llvm-7.0/llvm/unittests/ADT/ |
| IListTest.cpp | 1 //===- unittests/ADT/IListTest.cpp - ilist unit tests ---------------------===//
10 #include "llvm/ADT/ilist.h"
30 ilist<Node> List;
41 const ilist<Node> &ConstList = List;
50 ilist<Node> L1, L2, L3;
79 ilist<Node> List;
99 ilist<Node> L;
115 ilist<Node> L;
131 ilist<Node> List;
138 ilist<Node>::iterator E = List.end()
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| IVUsers.h | 131 ilist<IVStrideUse> IVUses;
164 typedef ilist<IVStrideUse>::iterator iterator;
165 typedef ilist<IVStrideUse>::const_iterator const_iterator;
|
| AliasSetTracker.h | 21 #include "llvm/ADT/ilist.h"
229 // Can only be created by AliasSetTracker. Also, ilist creates one
308 ilist<AliasSet> AliasSets;
360 const ilist<AliasSet> &getAliasSets() const { return AliasSets; }
401 typedef ilist<AliasSet>::iterator iterator;
402 typedef ilist<AliasSet>::const_iterator const_iterator;
|
| /external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
| IVUsers.h | 131 ilist<IVStrideUse> IVUses;
161 typedef ilist<IVStrideUse>::iterator iterator;
162 typedef ilist<IVStrideUse>::const_iterator const_iterator;
|
| AliasSetTracker.h | 23 #include "llvm/ADT/ilist.h"
222 // Can only be created by AliasSetTracker. Also, ilist creates one
297 ilist<AliasSet> AliasSets;
350 const ilist<AliasSet> &getAliasSets() const { return AliasSets; }
392 typedef ilist<AliasSet>::iterator iterator;
393 typedef ilist<AliasSet>::const_iterator const_iterator;
|
| /external/cldr/tools/java/org/unicode/cldr/draft/ |
| CharacterListCompressor.java | 191 public static List<List<Integer>> getValueTypePairsFromStrRangeList(List<Interval> ilist) {
195 for (int i = 0; i < ilist.size(); i++) {
197 int first = ilist.get(i).first;
198 int last = ilist.get(i).last;
275 public static String strRangeList2string(List<Interval> ilist) {
278 for (int i = 0; i < ilist.size(); i++) {
279 int first = ilist.get(i).first;
280 int last = ilist.get(i).last;
369 List<Interval> ilist = getStrRangeListFromRangeStr(str); local
371 String encodedStr = base88EncodeList(ilist);
[all...] |
| /external/libchrome/base/containers/ |
| flat_map.h | 70 // flat_map(std::initializer_list<value_type> ilist,
195 flat_map(std::initializer_list<value_type> ilist,
204 flat_map& operator=(std::initializer_list<value_type> ilist);
263 std::initializer_list<value_type> ilist,
266 : flat_map(std::begin(ilist), std::end(ilist), dupe_handling, comp) {}
273 std::initializer_list<value_type> ilist) -> flat_map& {
280 tree::operator=(ilist);
|
| flat_tree.h | 149 flat_tree(std::initializer_list<value_type> ilist,
163 flat_tree& operator=(std::initializer_list<value_type> ilist);
533 std::initializer_list<value_type> ilist,
536 : flat_tree(std::begin(ilist), std::end(ilist), dupe_handling, comp) {}
554 std::initializer_list<value_type> ilist) -> flat_tree& {
555 impl_.body_ = ilist;
[all...] |
| circular_deque.h | 478 circular_deque& operator=(std::initializer_list<value_type> ilist) {
479 reserve(ilist.size());
480 assign(std::begin(ilist), std::end(ilist));
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Analysis/ |
| IVUsers.h | 105 ilist<IVStrideUse> IVUses;
143 typedef ilist<IVStrideUse>::iterator iterator;
144 typedef ilist<IVStrideUse>::const_iterator const_iterator;
|
| AliasSetTracker.h | 22 #include "llvm/ADT/ilist.h"
223 // Unfortunately, ilist::size() is linear, so we have to add code to keep
340 ilist<AliasSet> AliasSets;
380 const ilist<AliasSet> &getAliasSets() const { return AliasSets; }
415 using iterator = ilist<AliasSet>::iterator;
416 using const_iterator = ilist<AliasSet>::const_iterator;
|
| /external/autotest/server/cros/ap_configurators/ |
| pyauto_utils.py | 168 def Shard(ilist, shard_index, num_shards):
172 ilist: input list
176 chunk_size = len(ilist) / num_shards
179 chunk_end = len(ilist)
182 return ilist[chunk_start:chunk_end]
|
| /device/google/bonito/audio/ |
| convert_config_string.py | 40 ilist = [16,18,20]
42 for i in ilist:
94 ilist = [16,18,20]
96 for i in ilist:
|
| /device/google/crosshatch/audio/ |
| convert_config_string.py | 40 ilist = [16,18,20]
42 for i in ilist:
94 ilist = [16,18,20]
96 for i in ilist:
|
| /external/llvm/include/llvm/ADT/ |
| ilist.h | 1 //==-- llvm/ADT/ilist.h - Intrusive Linked List Template ---------*- C++ -*-==//
19 // The ilist class itself, should be a plug in replacement for list, assuming
24 // The ilist class is implemented by allocating a 'tail' node when the list is
73 /// strategy. The sentinel is stored in the prev field of ilist's Head.
83 /// provideInitialHead - when constructing an ilist, provide a starting
244 assert(NodePtr && "--'d off the beginning of an ilist!");
448 // an ilist (and potentially deleted) with iterators still pointing at it.
666 struct ilist : public iplist<NodeTy> { struct in namespace:llvm
670 ilist() {} function in struct:llvm::ilist
671 ilist(const ilist &right) function in struct:llvm::ilist
674 explicit ilist(size_type count) { function in struct:llvm::ilist
677 ilist(size_type count, const NodeTy &val) { function in struct:llvm::ilist
680 template<class InIt> ilist(InIt first, InIt last) { function in struct:llvm::ilist
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| ilist.h | 1 //==-- llvm/ADT/ilist.h - Intrusive Linked List Template ---------*- C++ -*-==//
19 // The ilist class itself, should be a plug in replacement for list, assuming
24 // The ilist class is implemented by allocating a 'tail' node when the list is
72 /// strategy. The sentinel is stored in the prev field of ilist's Head.
82 /// provideInitialHead - when constructing an ilist, provide a starting
214 assert(NodePtr && "--'d off the beginning of an ilist!");
448 // an ilist (and potentially deleted) with iterators still pointing at it.
622 struct ilist : public iplist<NodeTy> { struct in namespace:llvm
626 ilist() {} function in struct:llvm::ilist
627 ilist(const ilist &right) function in struct:llvm::ilist
630 explicit ilist(size_type count) { function in struct:llvm::ilist
633 ilist(size_type count, const NodeTy &val) { function in struct:llvm::ilist
636 template<class InIt> ilist(InIt first, InIt last) { function in struct:llvm::ilist
[all...] |
| /external/clang/include/clang/StaticAnalyzer/Core/BugReporter/ |
| BugReporter.h | 28 #include "llvm/ADT/ilist.h"
345 llvm::ilist<BugReport> Reports;
361 typedef llvm::ilist<BugReport>::iterator iterator;
362 typedef llvm::ilist<BugReport>::const_iterator const_iterator;
|
| /external/swiftshader/third_party/LLVM/lib/Analysis/ |
| IVUsers.cpp | 199 for (ilist<IVStrideUse>::const_iterator UI = IVUses.begin(),
|
| /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/ |
| MachineFunction.h | 22 #include "llvm/ADT/ilist.h"
112 typedef ilist<MachineBasicBlock> BasicBlockListType;
|
| SelectionDAG.h | 18 #include "llvm/ADT/ilist.h"
149 ilist<SDNode> AllNodes;
237 typedef ilist<SDNode>::const_iterator allnodes_const_iterator;
240 typedef ilist<SDNode>::iterator allnodes_iterator;
243 ilist<SDNode>::size_type allnodes_size() const {
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/ |
| Module.h | 124 typedef ilist<NamedMDNode> NamedMDListType;
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/ADT/ |
| ilist.h | 1 //==-- llvm/ADT/ilist.h - Intrusive Linked List Template ---------*- C++ -*-==//
14 // The ilist class itself should be a plug in replacement for list. This list
18 // The ilist class is implemented as a circular list. The list itself contains
34 /// Use delete by default for iplist and ilist.
61 /// Callbacks do nothing by default in iplist and ilist.
162 /// This is a subset of ilist functionality that can safely be used on nodes of
191 "ilist customization points have changed!");
407 template <class T, class... Options> using ilist = iplist<T, Options...>;
|
| /external/swiftshader/third_party/llvm-subzero/include/llvm/ADT/ |
| ilist.h | 1 //==-- llvm/ADT/ilist.h - Intrusive Linked List Template ---------*- C++ -*-==//
14 // The ilist class itself should be a plug in replacement for list. This list
18 // The ilist class is implemented as a circular list. The list itself contains
34 /// Use delete by default for iplist and ilist.
61 /// Callbacks do nothing by default in iplist and ilist.
172 /// This is a subset of ilist functionality that can safely be used on nodes of
204 "ilist customization points have changed!");
420 template <class T, class... Options> using ilist = iplist<T, Options...>;
|
