Home
last modified time | relevance | path

Searched refs:ilist (Results 1 - 23 of 23) sorted by relevance

/third_party/gn/src/base/containers/
H A Dflat_map.h70 // 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, in flat_map()
266 : flat_map(std::begin(ilist), std::end(ilist), dupe_handling, comp) {} in flat_map()
273 std::initializer_list<value_type> ilist) -> flat_map& {
280 tree::operator=(ilist);
262 flat_map( std::initializer_list<value_type> ilist, FlatContainerDupes dupe_handling, const Compare& comp) flat_map() argument
H A Dflat_tree.h149 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, in flat_tree()
536 : flat_tree(std::begin(ilist), std::end(ilist), dupe_handling, comp) {} in flat_tree()
554 std::initializer_list<value_type> ilist) -> flat_tree& {
555 impl_.body_ = ilist;
532 flat_tree( std::initializer_list<value_type> ilist, FlatContainerDupes dupe_handling, const KeyCompare& comp) flat_tree() argument
H A Dcircular_deque.h477 circular_deque& operator=(std::initializer_list<value_type> ilist) { in operator =() argument
478 reserve(ilist.size()); in operator =()
479 assign(std::begin(ilist), std::end(ilist)); in operator =()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/
H A DIVUsers.h104 ilist<IVStrideUse> IVUses;
142 typedef ilist<IVStrideUse>::iterator iterator;
143 typedef ilist<IVStrideUse>::const_iterator const_iterator;
H A DAliasSetTracker.h21 #include "llvm/ADT/ilist.h"
227 // Unfortunately, ilist::size() is linear, so we have to add code to keep
349 ilist<AliasSet> AliasSets;
392 const ilist<AliasSet> &getAliasSets() const { return AliasSets; } in getAliasSets()
415 using iterator = ilist<AliasSet>::iterator;
416 using const_iterator = ilist<AliasSet>::const_iterator;
/third_party/skia/third_party/externals/abseil-cpp/absl/status/
H A Dstatusor.h424 explicit StatusOr(absl::in_place_t, std::initializer_list<U> ilist,
597 T& emplace(std::initializer_list<U> ilist, Args&&... args) { in emplace() argument
600 this->MakeValue(ilist, std::forward<Args>(args)...); in emplace()
602 this->MakeValue(ilist, std::forward<Args>(args)...); in emplace()
667 StatusOr<T>::StatusOr(absl::in_place_t, std::initializer_list<U> ilist, in StatusOr() argument
669 : Base(absl::in_place, ilist, std::forward<Args>(args)...) {} in StatusOr()
/third_party/json/tests/thirdparty/fifo_map/
H A Dfifo_map.hpp336 void insert(std::initializer_list<value_type> ilist) in insert() argument
338 for (auto value : ilist) in insert()
343 m_map.insert(ilist); in insert()
/third_party/skia/third_party/externals/abseil-cpp/absl/types/
H A Dany.h253 explicit any(in_place_type_t<T> /*tag*/, std::initializer_list<U> ilist,
255 : obj_(new Obj<VT>(in_place, ilist, std::forward<Args>(args)...)) {}
324 VT& emplace(std::initializer_list<U> ilist, Args&&... args) {
327 new Obj<VT>(in_place, ilist, std::forward<Args>(args)...);
H A Dany_test.cc62 explicit MoveOnlyWithListConstructor(std::initializer_list<int> /*ilist*/, in MoveOnlyWithListConstructor()
80 ListMoveOnlyCopyOnly(std::initializer_list<int> ilist, MoveOnly /*move_only*/, in ListMoveOnlyCopyOnly()
82 : values(ilist) {} in ListMoveOnlyCopyOnly()
/third_party/backends/backend/genesys/
H A Dregister.h370 RegisterSettingSet(std::initializer_list<SettingType> ilist) : in RegisterSettingSet() argument
371 registers_(ilist) in RegisterSettingSet()
/third_party/skia/third_party/externals/abseil-cpp/absl/container/internal/
H A Draw_hash_set.h1160 void insert(std::initializer_list<T> ilist) {
1161 insert(ilist.begin(), ilist.end());
1164 void insert(std::initializer_list<init_type> ilist) {
1165 insert(ilist.begin(), ilist.end());
/third_party/ltp/testcases/kernel/fs/fsstress/
H A Dfsstress.c218 int *ilist; variable
347 ilist = realloc(ilist, ++ilistlen * sizeof(*ilist)); in main()
348 ilist[ilistlen - 1] = strtol(optarg, &p, 16); in main()
853 if (ilist[j] == id) { in generate_fname()
897 if (ilist[j] == fep->id) { in get_fname()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/
H A DSelectionDAG.h26 #include "llvm/ADT/ilist.h"
250 ilist<SDNode> AllNodes;
460 using allnodes_const_iterator = ilist<SDNode>::const_iterator;
465 using allnodes_iterator = ilist<SDNode>::iterator;
470 ilist<SDNode>::size_type allnodes_size() const { in allnodes_size()
H A DSlotIndexes.h25 #include "llvm/ADT/ilist.h"
319 using IndexList = ilist<IndexListEntry>;
H A DMachineBasicBlock.h17 #include "llvm/ADT/ilist.h"
81 using Instructions = ilist<MachineInstr, ilist_sentinel_tracking<true>>;
H A DMachineFunction.h28 #include "llvm/ADT/ilist.h"
272 using BasicBlockListType = ilist<MachineBasicBlock>;
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/IR/
H A DModule.h79 using NamedMDListType = ilist<NamedMDNode>;
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-subzero/include/llvm/ADT/
H A Dilist.h1 //==-- 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...>;
/third_party/skia/third_party/externals/swiftshader/third_party/subzero/src/
H A DIceDefs.h26 #include "llvm/ADT/ilist.h"
127 using InstList = llvm::ilist<Inst>;
128 // Ideally PhiList would be llvm::ilist<InstPhi>, and similar for AssignList,
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
H A Dilist.h1 //==-- llvm/ADT/ilist.h - Intrusive Linked List Template ---------*- C++ -*-==//
13 // The ilist class itself should be a plug in replacement for list. This list
17 // The ilist class is implemented as a circular list. The list itself contains
33 /// Use delete by default for iplist and ilist.
60 /// Callbacks do nothing by default in iplist and ilist.
160 /// This is a subset of ilist functionality that can safely be used on nodes of
189 "ilist customization points have changed!");
405 template <class T, class... Options> using ilist = iplist<T, Options...>;
/third_party/json/include/nlohmann/
H A Djson.hpp3355 iterator insert(const_iterator pos, initializer_list_t ilist) in insert() argument
3370 return insert_iterator(pos, ilist.begin(), ilist.end()); in insert()
/third_party/json/tests/abi/include/nlohmann/
H A Djson_v3_10_5.hpp20261 iterator insert(const_iterator pos, initializer_list_t ilist)
20276 return insert_iterator(pos, ilist.begin(), ilist.end());
/third_party/json/single_include/nlohmann/
H A Djson.hpp22533 iterator insert(const_iterator pos, initializer_list_t ilist)
22548 return insert_iterator(pos, ilist.begin(), ilist.end());

Completed in 85 milliseconds