/external/libcxx/test/containers/sequences/deque/deque.cons/ |
H A D | alloc.pass.cpp | 21 template <class T, class Allocator> 23 test(const Allocator& a) 25 std::deque<T, Allocator> d(a);
|
H A D | default.pass.cpp | 21 template <class T, class Allocator> 25 std::deque<T, Allocator> d; 28 std::deque<T, Allocator> d1 = {};
|
H A D | size.pass.cpp | 21 template <class T, class Allocator> 26 typedef std::deque<T, Allocator> C; 30 C d(n, Allocator()); 43 template <class T, class Allocator> 47 typedef std::deque<T, Allocator> C; 63 template <class T, class Allocator> 65 test3(unsigned n, Allocator const &alloc = Allocator()) argument 68 typedef std::deque<T, Allocator> C; 78 template <class T, class Allocator> [all...] |
/external/libcxx/test/re/re.results/re.results.all/ |
H A D | get_allocator.pass.cpp | 12 // class match_results<BidirectionalIterator, Allocator> 21 template <class CharT, class Allocator> 23 test(const Allocator& a) 25 std::match_results<const CharT*, Allocator> m(a);
|
/external/libcxx/test/re/re.results/re.results.const/ |
H A D | allocator.pass.cpp | 12 // class match_results<BidirectionalIterator, Allocator> 14 // match_results(const Allocator& a = Allocator()); 21 template <class CharT, class Allocator> 23 test(const Allocator& a) 25 std::match_results<const CharT*, Allocator> m(a);
|
/external/llvm/include/llvm/Support/ |
H A D | RecyclingAllocator.h | 1 //==- llvm/Support/RecyclingAllocator.h - Recycling Allocator ----*- C++ -*-==// 22 /// RecyclingAllocator - This class wraps an Allocator, adding the 33 /// Allocator - The wrapped allocator. 35 AllocatorType Allocator; member in class:llvm::RecyclingAllocator 38 ~RecyclingAllocator() { Base.clear(Allocator); } 44 SubClass *Allocate() { return Base.template Allocate<SubClass>(Allocator); } 46 T *Allocate() { return Base.Allocate(Allocator); } 52 void Deallocate(SubClass* E) { return Base.Deallocate(Allocator, E); } 55 Allocator.PrintStats(); 65 T, Size, Align> &Allocator) { 63 operator new(size_t size, llvm::RecyclingAllocator<AllocatorType, T, Size, Align> &Allocator) argument [all...] |
H A D | Allocator.h | 1 //===--- Allocator.h - Simple memory allocation abstraction -----*- C++ -*-===// 12 /// of these conform to an LLVM "Allocator" concept which consists of an 14 /// a pointer and size. Further, the LLVM "Allocator" concept has overloads of 111 // printing code uses Allocator.h in its implementation. 142 : CurPtr(nullptr), End(nullptr), BytesAllocated(0), Allocator() {} 144 BumpPtrAllocatorImpl(T &&Allocator) argument 146 Allocator(std::forward<T &&>(Allocator)) {} 154 Allocator(std::move(Old.Allocator)) { 293 AllocatorT Allocator; member in class:llvm::BumpPtrAllocatorImpl 358 BumpPtrAllocator Allocator; member in class:llvm::SpecificBumpPtrAllocator 408 operator new(size_t Size, llvm::BumpPtrAllocatorImpl<AllocatorT, SlabSize, SizeThreshold> &Allocator) argument [all...] |
/external/chromium_org/third_party/WebKit/Source/wtf/ |
H A D | Deque.h | 41 template<typename T, size_t inlineCapacity, typename Allocator> class DequeIteratorBase; 42 template<typename T, size_t inlineCapacity, typename Allocator> class DequeIterator; 43 template<typename T, size_t inlineCapacity, typename Allocator> class DequeConstIterator; 45 template<typename T, size_t inlineCapacity = 0, typename Allocator = DefaultAllocator> 46 class Deque : public VectorDestructorBase<Deque<T, inlineCapacity, Allocator>, T, (inlineCapacity > 0), Allocator::isGarbageCollected> { 47 WTF_USE_ALLOCATOR(Deque, Allocator); 49 typedef DequeIterator<T, inlineCapacity, Allocator> iterator; 50 typedef DequeConstIterator<T, inlineCapacity, Allocator> const_iterator; 57 Deque(const Deque<T, inlineCapacity, Allocator> [all...] |
H A D | Vector.h | 46 template<typename T, size_t inlineBuffer, typename Allocator> 286 template<typename T, typename Allocator> 292 typedef typename Allocator::template VectorBackingHelper<T, VectorTraits<T> >::Type VectorBacking; 295 m_buffer = Allocator::template backingMalloc<T*, VectorBacking>(sizeToAllocate); 301 return Allocator::Quantizer::template quantizedSize<T>(capacity); 310 VectorUnusedSlotClearer<Allocator::isGarbageCollected && (VectorTraits<T>::needsDestruction || ShouldBeTraced<VectorTraits<T> >::value), T>::clear(from, to); 331 template<typename T, size_t inlineCapacity, typename Allocator = DefaultAllocator> 334 template<typename T, typename Allocator> 335 class VectorBuffer<T, 0, Allocator> : protected VectorBufferBase<T, Allocator> { [all...] |
H A D | HashTable.h | 92 template<typename Key, typename Value, typename Extractor, typename HashFunctions, typename Traits, typename KeyTraits, typename Allocator> 94 template<typename Key, typename Value, typename Extractor, typename HashFunctions, typename Traits, typename KeyTraits, typename Allocator> 96 template<typename Key, typename Value, typename Extractor, typename HashFunctions, typename Traits, typename KeyTraits, typename Allocator> 98 template<typename Value, typename HashFunctions, typename HashTraits, typename Allocator> 105 template<typename Key, typename Value, typename Extractor, typename HashFunctions, typename Traits, typename KeyTraits, typename Allocator> 108 typedef HashTable<Key, Value, Extractor, HashFunctions, Traits, KeyTraits, Allocator> HashTableType; 109 typedef HashTableIterator<Key, Value, Extractor, HashFunctions, Traits, KeyTraits, Allocator> iterator; 110 typedef HashTableConstIterator<Key, Value, Extractor, HashFunctions, Traits, KeyTraits, Allocator> const_iterator; 115 friend class HashTable<Key, Value, Extractor, HashFunctions, Traits, KeyTraits, Allocator>; 116 friend class HashTableIterator<Key, Value, Extractor, HashFunctions, Traits, KeyTraits, Allocator>; [all...] |
H A D | TerminatedArrayBuilder.h | 16 explicit TerminatedArrayBuilder(typename ArrayType<T>::Allocator::PassPtr array) 33 m_array = ArrayType<T>::Allocator::create(m_capacity); 37 m_array = ArrayType<T>::Allocator::resize(m_array.release(), m_capacity); 48 typename ArrayType<T>::Allocator::PassPtr release() 70 typename ArrayType<T>::Allocator::Ptr m_array;
|
/external/chromium_org/v8/src/ |
H A D | splay-tree-inl.h | 14 template<typename Config, class Allocator> 15 SplayTree<Config, Allocator>::~SplayTree() { 21 template<typename Config, class Allocator> 22 bool SplayTree<Config, Allocator>::Insert(const Key& key, 46 template<typename Config, class Allocator> 47 void SplayTree<Config, Allocator>::InsertInternal(int cmp, Node* node) { 61 template<typename Config, class Allocator> 62 bool SplayTree<Config, Allocator>::FindInternal(const Key& key) { 70 template<typename Config, class Allocator> 71 bool SplayTree<Config, Allocator> [all...] |
H A D | v8.h | 72 static v8::ArrayBuffer::Allocator* ArrayBufferAllocator() { 76 static void SetArrayBufferAllocator(v8::ArrayBuffer::Allocator *allocator) { 89 // Allocator for external array buffers. 90 static v8::ArrayBuffer::Allocator* array_buffer_allocator_;
|
/external/chromium_org/skia/ext/ |
H A D | image_operations.h | 105 SkBitmap::Allocator* allocator = NULL); 112 SkBitmap::Allocator* allocator = NULL); 122 SkBitmap::Allocator* allocator = NULL); 128 SkBitmap::Allocator* allocator = NULL);
|
/external/libcxx/test/containers/sequences/vector.bool/ |
H A D | types.pass.cpp | 14 // template <class Allocator> 15 // class vector<bool, Allocator 19 // typedef Allocator allocator_type; 38 template <class Allocator> 42 typedef std::vector<bool, Allocator> C; 45 static_assert((std::is_same<typename C::value_type, typename Allocator::value_type>::value), ""); 46 static_assert((std::is_same<typename C::allocator_type, Allocator>::value), ""); 47 static_assert((std::is_same<typename C::size_type, typename std::allocator_traits<Allocator>::size_type>::value), ""); 48 static_assert((std::is_same<typename C::difference_type, typename std::allocator_traits<Allocator>::difference_type>::value), "");
|
/external/libcxx/test/containers/sequences/deque/ |
H A D | types.pass.cpp | 14 // template <class T, class Allocator = allocator<T> > 19 // typedef Allocator allocator_type; 40 template <class T, class Allocator> 44 typedef std::deque<T, Allocator> C; 47 static_assert((std::is_same<typename C::value_type, typename Allocator::value_type>::value), ""); 48 static_assert((std::is_same<typename C::allocator_type, Allocator>::value), ""); 49 static_assert((std::is_same<typename C::size_type, typename Allocator::size_type>::value), ""); 50 static_assert((std::is_same<typename C::difference_type, typename Allocator::difference_type>::value), ""); 51 static_assert((std::is_same<typename C::reference, typename Allocator::reference>::value), ""); 52 static_assert((std::is_same<typename C::const_reference, typename Allocator [all...] |
/external/libcxx/test/containers/sequences/vector/ |
H A D | types.pass.cpp | 14 // template <class T, class Allocator = allocator<T> > 19 // typedef Allocator allocator_type; 40 template <class T, class Allocator> 44 typedef std::vector<T, Allocator> C; 47 static_assert((std::is_same<typename C::value_type, typename Allocator::value_type>::value), ""); 48 static_assert((std::is_same<typename C::allocator_type, Allocator>::value), ""); 49 static_assert((std::is_same<typename C::size_type, typename Allocator::size_type>::value), ""); 50 static_assert((std::is_same<typename C::difference_type, typename Allocator::difference_type>::value), ""); 51 static_assert((std::is_same<typename C::reference, typename Allocator::reference>::value), ""); 52 static_assert((std::is_same<typename C::const_reference, typename Allocator [all...] |
/external/llvm/unittests/Support/ |
H A D | ArrayRecyclerTest.cpp | 11 #include "llvm/Support/Allocator.h" 52 BumpPtrAllocator Allocator; local 56 Object *A1 = DUT.allocate(Cap, Allocator); 60 Object *A2 = DUT.allocate(Cap, Allocator); 64 Object *A3 = DUT.allocate(Cap, Allocator); 84 Object *A2x = DUT.allocate(Cap, Allocator); 93 Object *A3x = DUT.allocate(Cap, Allocator); 95 Object *A1x = DUT.allocate(Cap, Allocator); 97 Object *A2y = DUT.allocate(Cap, Allocator); 101 Object *A4 = DUT.allocate(Cap, Allocator); [all...] |
/external/libcxx/test/containers/sequences/dynarray/dynarray.cons/ |
H A D | alloc.pass.cpp | 38 template <class T, class Allocator> 39 void check_allocator ( const dynarray<T> &dyn, const Allocator &alloc ) { 44 template <class T, class Allocator> 45 void test ( const std::initializer_list<T> &vals, const Allocator &alloc ) { 55 template <class T, class Allocator> 56 void test ( const T &val, const Allocator &alloc1, const Allocator &alloc2 ) {
|
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkBitmapScaler.h | 86 SkBitmap::Allocator* allocator = NULL); 91 SkBitmap::Allocator* allocator = NULL);
|
/external/libcxx/test/strings/basic.string/ |
H A D | types.pass.cpp | 15 // class Allocator = allocator<charT> > 21 // typedef Allocator allocator_type; 22 // typedef typename Allocator::size_type size_type; 23 // typedef typename Allocator::difference_type difference_type; 24 // typedef typename Allocator::reference reference; 25 // typedef typename Allocator::const_reference const_reference; 26 // typedef typename Allocator::pointer pointer; 27 // typedef typename Allocator::const_pointer const_pointer; 43 template <class Traits, class Allocator> 47 typedef std::basic_string<typename Traits::char_type, Traits, Allocator> [all...] |
/external/clang/include/clang/Basic/ |
H A D | PartialDiagnostic.h | 122 /// \brief Allocator used to allocate storage for this diagnostic. 123 StorageAllocator *Allocator; member in class:clang::PartialDiagnostic 130 if (Allocator) 131 DiagStorage = Allocator->Allocate(); 133 assert(Allocator != reinterpret_cast<StorageAllocator *>(~uintptr_t(0))); 153 if (Allocator) 154 Allocator->Deallocate(DiagStorage); 155 else if (Allocator != reinterpret_cast<StorageAllocator *>(~uintptr_t(0))) 182 : DiagID(0), DiagStorage(nullptr), Allocator(nullptr) { } 184 PartialDiagnostic(unsigned DiagID, StorageAllocator &Allocator) argument 210 PartialDiagnostic(const Diagnostic &Other, StorageAllocator &Allocator) argument [all...] |
/external/libcxx/test/containers/sequences/forwardlist/forwardlist.cons/ |
H A D | size.pass.cpp | 21 template <class T, class Allocator> 22 void check_allocator(unsigned n, Allocator const &alloc = Allocator()) argument 25 typedef std::forward_list<T, Allocator> C;
|
/external/chromium_org/third_party/WebKit/Source/platform/ |
H A D | PODArena.h | 49 class Allocator : public RefCounted<Allocator> { class in class:blink::FINAL 54 virtual ~Allocator() { } 55 friend class WTF::RefCounted<Allocator>; 60 class FastMallocAllocator : public Allocator { 80 // Creates a new PODArena configured with the given Allocator. 81 static PassRefPtr<PODArena> create(PassRefPtr<Allocator> allocator) 112 explicit PODArena(PassRefPtr<Allocator> allocator) 153 // Allocator. 154 Chunk(Allocator* allocato [all...] |
/external/llvm/include/llvm/ADT/ |
H A D | ScopedHashTable.h | 35 #include "llvm/Support/Allocator.h" 64 AllocatorTy &Allocator) { 65 ScopedHashTableVal *New = Allocator.template Allocate<ScopedHashTableVal>(); 74 void Destroy(AllocatorTy &Allocator) { argument 77 Allocator.Deallocate(this); 157 AllocatorTy Allocator; member in class:llvm::ScopedHashTable 164 ScopedHashTable(AllocatorTy A) : CurScope(0), Allocator(A) {} 171 AllocatorTy &getAllocator() { return Allocator; } 172 const AllocatorTy &getAllocator() const { return Allocator; } 213 Allocator); 61 Create(ScopedHashTableVal *nextInScope, ScopedHashTableVal *nextForKey, const K &key, const V &val, AllocatorTy &Allocator) argument [all...] |