Home
last modified time | relevance | path

Searched refs:Container (Results 1 – 14 of 14) sorted by relevance

/art/libartbase/base/
Dtransform_array_ref.h180 template <typename Container, typename Function>
181 TransformArrayRef<typename Container::value_type, Function> MakeTransformArrayRef( in MakeTransformArrayRef()
182 Container& container, Function f) { in MakeTransformArrayRef()
183 return TransformArrayRef<typename Container::value_type, Function>( in MakeTransformArrayRef()
184 ArrayRef<typename Container::value_type>(container.data(), container.size()), f); in MakeTransformArrayRef()
187 template <typename Container, typename Function>
188 TransformArrayRef<const typename Container::value_type, Function> MakeTransformArrayRef( in MakeTransformArrayRef()
189 const Container& container, Function f) { in MakeTransformArrayRef()
190 return TransformArrayRef<const typename Container::value_type, Function>( in MakeTransformArrayRef()
191 ArrayRef<const typename Container::value_type>(container.data(), container.size()), f); in MakeTransformArrayRef()
Ddata_hash.h43 template <class Container>
44 size_t operator()(const Container& array) const { in operator()
47 uint32_t len = sizeof(typename Container::value_type) * array.size(); in operator()
Dstl_util.h95 template <typename Container, typename T>
96 size_t IndexOfElement(const Container& container, const T& value) { in IndexOfElement()
103 template <typename Container, typename T>
104 void RemoveElement(Container& container, const T& value) { in RemoveElement()
111 template <typename Container, typename T>
112 void ReplaceElement(Container& container, const T& old_value, const T& new_value) { in ReplaceElement()
119 template <typename Container, typename T>
120 bool ContainsElement(const Container& container, const T& value, size_t start_pos = 0u) {
Diteration_range.h65 template <typename Container>
66 inline auto ReverseRange(Container&& c) { in ReverseRange()
Dbit_utils_test.cc444 template <typename Container>
445 void CheckElements(const std::initializer_list<uint32_t>& expected, const Container& elements) { in CheckElements()
/art/runtime/mirror/
Dobject_array.h28 template<typename T, typename Container> class ArrayIter;
160 template <typename T, typename Container>
163 using Iter = ArrayIter<T, Container>;
166 ArrayIter(Container array, int32_t idx) NO_THREAD_SAFETY_ANALYSIS : array_(array), idx_(idx) { in ArrayIter()
213 Container array_;
/art/dexlayout/
Dcompact_dex_writer.h110 class Container : public DexContainer {
125 Container();
Dcompact_dex_writer.cc37 CompactDexWriter::Container::Container() in Container() function in art::CompactDexWriter::Container
385 Container* const container = down_cast<Container*>(output); in Write()
525 return std::unique_ptr<DexContainer>(new CompactDexWriter::Container()); in CreateDexContainer()
Ddex_writer.h193 class Container : public DexContainer {
Ddex_writer.cc1006 return std::unique_ptr<DexContainer>(new DexWriter::Container); in CreateDexContainer()
/art/libprofile/profile/
Dprofile_compilation_info.h511 template <typename Container>
513 const Container& dex_files) const { in FindDexFileForProfileIndex()
514 static_assert(std::is_same_v<typename Container::value_type, const DexFile*> || in FindDexFileForProfileIndex()
515 std::is_same_v<typename Container::value_type, std::unique_ptr<const DexFile>>); in FindDexFileForProfileIndex()
/art/compiler/optimizing/
Dgraph_visualizer.cc84 template <typename Container>
85 explicit StringList(const Container& list, Format format = kArrayBrackets) : StringList(format) { in StringList()
86 for (const typename Container::value_type& current : list) { in StringList()
Dregister_allocator_graph_color.cc1755 template <typename Container>
1756 static std::bitset<kMaxNumRegs> BuildConflictMask(const Container& intervals) { in BuildConflictMask()
/art/runtime/gc/space/
Dimage_space.cc769 template <typename Container>
771 const Container& old_spaces, in RemoveInternTableDuplicates()