Home
last modified time | relevance | path

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

/third_party/skia/third_party/externals/abseil-cpp/absl/random/
H A Ddiscrete_distribution.h62 template <typename InputIterator>
63 explicit param_type(InputIterator begin, InputIterator end) in param_type()
115 template <typename InputIterator>
116 explicit discrete_distribution(InputIterator begin, InputIterator end) in discrete_distribution()
/third_party/skia/third_party/externals/abseil-cpp/absl/container/
H A Dinlined_vector.h154 template <typename InputIterator,
155 DisableIfAtLeastForwardIterator<InputIterator>* = nullptr>
156 InlinedVector(InputIterator first, InputIterator last, in InlinedVector()
524 template <typename InputIterator,
525 DisableIfAtLeastForwardIterator<InputIterator>* = nullptr>
526 void assign(InputIterator first, InputIterator last) { in assign()
618 template <typename InputIterator,
619 DisableIfAtLeastForwardIterator<InputIterator>*
[all...]
H A Dbtree_test.cc97 template <typename InputIterator>
98 base_checker(InputIterator b, InputIterator e) in base_checker()
330 template <class InputIterator>
331 unique_checker(InputIterator b, InputIterator e) : super_type(b, e) {} in unique_checker()
356 template <typename InputIterator>
357 void insert(InputIterator b, InputIterator e) { in insert()
378 template <class InputIterator>
[all...]
/third_party/gn/src/base/containers/
H A Dflat_map.h62 // flat_map(InputIterator first, InputIterator last,
111 // void insert(InputIterator first, InputIterator last,
182 template <class InputIterator>
183 flat_map(InputIterator first,
184 InputIterator last,
248 template <class InputIterator>
249 flat_map<Key, Mapped, Compare>::flat_map(InputIterator first, in flat_map()
250 InputIterator las in flat_map()
[all...]
H A Dcircular_deque.h42 // circular_deque(InputIterator first, InputIterator last);
52 // void assign(InputIterator first, InputIterator last);
96 // InputIterator first, InputIterator last);
426 template <class InputIterator>
427 circular_deque(InputIterator first, InputIterator last) { in circular_deque()
491 // This variant should be enabled only when InputIterator i
[all...]
H A Dflat_tree.h136 template <class InputIterator>
137 flat_tree(InputIterator first,
138 InputIterator last,
227 template <class InputIterator>
228 void insert(InputIterator first,
229 InputIterator last,
508 template <class InputIterator>
510 InputIterator first, in flat_tree()
511 InputIterator last, in flat_tree()
714 template <class InputIterator>
[all...]
/third_party/skia/third_party/externals/abseil-cpp/absl/container/internal/
H A Dbtree_container.h263 template <class InputIterator>
264 btree_set_container(InputIterator b, InputIterator e, in btree_set_container()
270 template <class InputIterator>
271 btree_set_container(InputIterator b, InputIterator e, in btree_set_container()
313 template <typename InputIterator>
314 void insert(InputIterator b, InputIterator e) { in insert()
558 template <class InputIterator>
[all...]
H A Dbtree.h1294 template <typename InputIterator,
1296 params_type::key(*std::declval<InputIterator>()),
1298 void insert_iterator_unique(InputIterator b, InputIterator e, int);
1301 template <typename InputIterator>
1302 void insert_iterator_unique(InputIterator b, InputIterator e, char);
1322 template <typename InputIterator>
1323 void insert_iterator_multi(InputIterator b, InputIterator
[all...]
/third_party/skia/third_party/externals/abseil-cpp/absl/algorithm/
H A Dalgorithm.h130 template <typename InputIterator, typename EqualityComparable>
131 bool linear_search(InputIterator first, InputIterator last, in linear_search()
/third_party/node/deps/v8/src/compiler/
H A Dstate-values-utils.h113 SparseInputMask::InputIterator* Top();
118 SparseInputMask::InputIterator stack_[kMaxInlineDepth];
H A Dschedule.h114 template <class InputIterator>
115 void InsertNodes(iterator insertion_point, InputIterator insertion_start, in InsertNodes()
116 InputIterator insertion_end) { in InsertNodes()
H A Dloop-analysis.h222 template <typename InputIterator>
224 base::iterator_range<InputIterator> nodes, in CopyNodes()
H A Dcommon-operator.h233 class InputIterator final {
235 InputIterator() = default;
236 InputIterator(BitMaskType bit_mask, Node* parent);
290 InputIterator IterateOverInputs(Node* node);
H A Dstate-values-utils.cc311 SparseInputMask::InputIterator* StateValuesAccess::iterator::Top() { in Top()
346 SparseInputMask::InputIterator* top = Top(); in EnsureValid()
419 SparseInputMask::InputIterator iterator = mask.IterateOverInputs(node_); in size()
H A Dcommon-operator.cc216 SparseInputMask::InputIterator::InputIterator( in InputIterator() function in v8::internal::compiler::SparseInputMask::InputIterator
228 void SparseInputMask::InputIterator::Advance() { in Advance()
237 size_t SparseInputMask::InputIterator::AdvanceToNextRealOrEnd() { in AdvanceToNextRealOrEnd()
246 Node* SparseInputMask::InputIterator::GetReal() const { in GetReal()
251 bool SparseInputMask::InputIterator::IsReal() const { in IsReal()
256 bool SparseInputMask::InputIterator::IsEnd() const { in IsEnd()
268 SparseInputMask::InputIterator SparseInputMask::IterateOverInputs(Node* node) { in IterateOverInputs()
270 return InputIterator(bit_mask_, node); in IterateOverInputs()
H A Dgraph-visualizer.cc431 template <typename InputIterator>
432 void PrintInputs(InputIterator* i, int count, const char* prefix);
529 template <typename InputIterator>
530 void GraphC1Visualizer::PrintInputs(InputIterator* i, int count, in PrintInputs()
/third_party/json/tests/thirdparty/fifo_map/
H A Dfifo_map.hpp132 template<class InputIterator>
133 fifo_map(InputIterator first, InputIterator last) in fifo_map()
/third_party/mesa3d/src/gallium/drivers/r600/sfn/
H A Dsfn_shader.h134 using InputIterator = std::map<int, ShaderInput>::iterator;
181 InputIterator find_input(int location) { return m_inputs.find(location);} in find_input()
183 InputIterator input_not_found() {return m_inputs.end();} in input_not_found()
/third_party/skia/third_party/externals/abseil-cpp/absl/memory/
H A Dmemory.h677 template <typename Allocator, typename Iterator, typename InputIterator>
678 void CopyRange(Allocator& alloc, Iterator destination, InputIterator first, in CopyRange()
679 InputIterator last) { in CopyRange()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ProfileData/
H A DInstrProf.h658 template <class InputIterator>
659 InstrProfValueSiteRecord(InputIterator F, InputIterator L) in InstrProfValueSiteRecord()
/third_party/protobuf/src/google/protobuf/stubs/
H A Dmap_util.h289 template <class Collection, class InputIterator>
291 InputIterator first, InputIterator last) { in InsertOrUpdateMany()
/third_party/libabigail/tests/lib/
H A Dcatch.hpp1829 template<typename InputIterator, typename Sentinel = InputIterator>
1830 std::string rangeToString(InputIterator first, Sentinel last) {
4721 template <typename InputIterator, typename InputSentinel>
4722 IteratorGenerator(InputIterator first, InputSentinel last):m_elems(first, last) {
4738 template <typename InputIterator,
4740 typename ResultType = typename std::iterator_traits<InputIterator>::value_type>
4741 GeneratorWrapper<ResultType> from_range(InputIterator from, InputSentinel to) {
/third_party/rust/crates/bindgen/bindgen-tests/tests/
H A Dstylo.hpp[all...]

Completed in 64 milliseconds