/external/llvm/include/llvm/ADT/ |
H A D | edit_distance.h | 55 typename ArrayRef<T>::size_type m = FromArray.size(); 56 typename ArrayRef<T>::size_type n = ToArray.size(); 71 for (typename ArrayRef<T>::size_type y = 1; y <= m; ++y) { 75 for (typename ArrayRef<T>::size_type x = 1; x <= n; ++x) {
|
H A D | IndexedMap.h | 53 void reserve(typename StorageT::size_type s) { 57 void resize(typename StorageT::size_type s) { 75 typename StorageT::size_type size() const {
|
/external/chromium_org/base/containers/ |
H A D | mru_cache.h | 56 typedef typename PayloadList::size_type size_type; typedef in class:base::MRUCacheBase 69 explicit MRUCacheBase(size_type max_size) : max_size_(max_size) { 72 MRUCacheBase(size_type max_size, const DeletorType& deletor) 82 size_type max_size() const { return max_size_; } 159 void ShrinkToSize(size_type new_size) { 160 for (size_type i = size(); i > new_size; i--) 174 size_type size() const { 203 size_type max_size_; 232 explicit MRUCache(typename ParentType::size_type max_siz [all...] |
/external/libcxx/test/containers/container.adaptors/priority.queue/ |
H A D | types.pass.cpp | 21 // typedef typename container_type::size_type size_type; 46 typedef int size_type; typedef in struct:C 56 static_assert((std::is_same<std::priority_queue<int>::size_type, std::vector<int>::size_type>::value), "");
|
/external/libcxx/test/containers/container.adaptors/queue/queue.defn/ |
H A D | types.pass.cpp | 20 // typedef typename container_type::size_type size_type; 44 typedef int size_type; typedef in struct:C 54 static_assert((std::is_same<std::queue<int>::size_type, std::deque<int>::size_type>::value), "");
|
/external/libcxx/test/containers/container.adaptors/stack/stack.defn/ |
H A D | types.pass.cpp | 20 // typedef typename container_type::size_type size_type; 45 typedef int size_type; typedef in struct:C 55 static_assert((std::is_same<std::stack<int>::size_type, std::deque<int>::size_type>::value), "");
|
/external/libcxx/test/containers/sequences/vector/vector.cons/ |
H A D | construct_size.pass.cpp | 12 // explicit vector(size_type n); 23 test2(typename C::size_type n, typename C::allocator_type const& a = typename C::allocator_type ()) 39 test1(typename C::size_type n) 53 test(typename C::size_type n)
|
H A D | construct_size_value.pass.cpp | 12 // vector(size_type n, const value_type& x); 22 test(typename C::size_type n, const typename C::value_type& x)
|
H A D | construct_size_value_alloc.pass.cpp | 12 // vector(size_type n, const value_type& x, const allocator_type& a); 20 test(typename C::size_type n, const typename C::value_type& x,
|
/external/libcxx/test/containers/sequences/vector.bool/ |
H A D | construct_size.pass.cpp | 13 // explicit vector(size_type n); 23 test2(typename C::size_type n, typename C::allocator_type const& a = typename C::allocator_type ()) 39 test1(typename C::size_type n) 51 test(typename C::size_type n)
|
H A D | construct_size_value.pass.cpp | 13 // vector(size_type n, const value_type& x); 22 test(typename C::size_type n, const typename C::value_type& x)
|
H A D | construct_size_value_alloc.pass.cpp | 13 // vector(size_type n, const value_type& x, const allocator_type& a); 22 test(typename C::size_type n, const typename C::value_type& x,
|
/external/llvm/lib/Support/ |
H A D | StringExtras.cpp | 22 StringRef::size_type llvm::StrInStrNoCase(StringRef s1, StringRef s2) { 41 StringRef::size_type Start = Source.find_first_not_of(Delimiters); 44 StringRef::size_type End = Source.find_first_of(Delimiters, Start);
|
H A D | StringRef.cpp | 119 for (size_type i = 0, e = size(); i != e; ++i) { 127 for (size_type i = 0, e = size(); i != e; ++i) { 198 StringRef::size_type StringRef::find_first_of(StringRef Chars, 201 for (size_type i = 0; i != Chars.size(); ++i) 204 for (size_type i = min(From, Length), e = Length; i != e; ++i) 212 StringRef::size_type StringRef::find_first_not_of(char C, size_t From) const { 213 for (size_type i = min(From, Length), e = Length; i != e; ++i) 223 StringRef::size_type StringRef::find_first_not_of(StringRef Chars, 226 for (size_type i = 0; i != Chars.size(); ++i) 229 for (size_type [all...] |
/external/stlport/stlport/stl/ |
H A D | _hash_map.h | 68 typedef typename _Ht::size_type size_type; typedef in class:hash_map 89 explicit hash_map(size_type __n) 91 hash_map(size_type __n, const hasher& __hf) 93 hash_map(size_type __n, const hasher& __hf, const key_equal& __eql, 109 hash_map(_InputIterator __f, _InputIterator __l, size_type __n) 113 hash_map(_InputIterator __f, _InputIterator __l, size_type __n, 119 hash_map(_InputIterator __f, _InputIterator __l, size_type __n, 125 hash_map(_InputIterator __f, _InputIterator __l, size_type __n, 135 hash_map(const value_type* __f, const value_type* __l, size_type __ 259 typedef typename _Ht::size_type size_type; typedef in class:hash_multimap [all...] |
H A D | _vector.c | 62 void vector<_Tp, _Alloc>::reserve(size_type __n) { 68 const size_type __old_size = size(); 82 size_type __fill_len, bool __atend ) { 87 size_type __len = _M_compute_next_size(__fill_len); 109 size_type __fill_len, bool __atend ) { 110 size_type __len = _M_compute_next_size(__fill_len); 122 void vector<_Tp, _Alloc>::_M_fill_insert_aux(iterator __pos, size_type __n, 140 void vector<_Tp, _Alloc>::_M_fill_insert_aux (iterator __pos, size_type __n, 150 const size_type __elems_after = this->_M_finish - __pos; 167 size_type __ [all...] |
H A D | _pthread_alloc.h | 100 typedef size_t size_type; typedef in class:pthread_allocator 129 _Tp* allocate(size_type __n, const void* = 0) { 134 size_type __buf_size = __n * sizeof(value_type); 145 void deallocate(pointer __p, size_type __n) { 155 size_type max_size() const _STLP_NOTHROW 168 _Tp* allocate(size_type __n, size_type& __allocated_n) { 173 size_type __buf_size = __n * sizeof(value_type); 192 typedef size_t size_type; typedef in class:pthread_allocator 281 typedef size_t size_type; typedef in class:per_thread_allocator 375 typedef size_t size_type; typedef in class:per_thread_allocator [all...] |
H A D | _string.c | 47 # define size_type size_t macro 50 # define __size_type__ _STLP_TYPENAME_ON_RETURN_TYPE basic_string<_CharT,_Traits,_Alloc>::size_type 158 void basic_string<_CharT,_Traits,_Alloc>::reserve(size_type __res_arg) { 162 size_type __n = (max)(__res_arg, size()) + 1; 170 void basic_string<_CharT,_Traits,_Alloc>::_M_reserve(size_type __n) { 180 basic_string<_CharT,_Traits,_Alloc>::append(size_type __n, _CharT __c) { 198 size_type __n = __STATIC_CAST(size_type, __last - __first); 200 size_type __len = _M_compute_next_size(__n); 222 basic_string<_CharT,_Traits,_Alloc>::assign(size_type __ 665 # undef size_type macro [all...] |
H A D | _deque.h | 94 typedef size_t size_type; typedef in struct:_Deque_iterator_base 167 typedef size_t size_type; typedef in struct:_Deque_iterator 413 typedef size_t size_type; typedef in class:deque 444 reference operator[](size_type __n) 446 const_reference operator[](size_type __n) const 449 void _M_range_check(size_type __n) const { 453 reference at(size_type __n) 455 const_reference at(size_type __n) const 471 size_type size() const { return this->_M_finish - this->_M_start; } 472 size_type max_siz [all...] |
/external/chromium_org/chrome/installer/util/ |
H A D | channel_info.cc | 69 std::wstring::size_type* position, 70 std::wstring::size_type* length) { 72 std::wstring::size_type mod_position = std::wstring::npos; 73 std::wstring::size_type mod_length = 76 std::wstring::size_type pos = 0; 101 std::wstring::size_type position; 105 std::wstring::size_type FindInsertionPoint(ModifierIndex index, 108 std::wstring::size_type result; 122 std::wstring::size_type position; 123 std::wstring::size_type lengt [all...] |
/external/chromium_org/courgette/ |
H A D | memory_allocator.h | 131 typedef size_t size_type; typedef in class:courgette::MemoryAllocator 169 void deallocate(pointer ptr, size_type size) { 181 pointer allocate(size_type count) { 191 size_type bytes = count * sizeof(T); 211 pointer allocate(size_type count, const void* hint) { 223 size_type max_size() const _THROW0() { 224 size_type count = static_cast<size_type>(-1) / sizeof(T); 241 typedef size_t size_type; 263 void deallocate(pointer ptr, size_type siz [all...] |
/external/chromium_org/third_party/angle/src/compiler/translator/ |
H A D | PoolAlloc.h | 235 typedef size_t size_type; typedef in class:pool_allocator 267 void* allocate(size_type n) { 270 void* allocate(size_type n, const void*) { 273 void deallocate(void*, size_type) {} 275 pointer allocate(size_type n) { 278 pointer allocate(size_type n, const void*) { 281 void deallocate(pointer, size_type) {} 290 size_type max_size() const { return static_cast<size_type>(-1) / sizeof(T); } 291 size_type max_siz [all...] |
/external/stlport/stlport/stl/debug/ |
H A D | _hashtable.h | 134 hashtable(size_type __n, 142 hashtable(size_type __n, 165 size_type size() const { return _M_non_dbg_impl.size(); } 166 size_type max_size() const { return _M_non_dbg_impl.max_size(); } 185 local_iterator begin(size_type __n) { 190 local_iterator end(size_type __n) { 198 const_local_iterator begin(size_type __n) const { 203 const_local_iterator end(size_type __n) const { 268 size_type count(const _KT& __key) const { return _M_non_dbg_impl.count(__key); } 284 size_type eras [all...] |
/external/chromium_org/components/bookmarks/test/ |
H A D | bookmark_test_helpers.cc | 52 std::string::size_type AddNodesFromString(BookmarkModel* model, 55 std::string::size_type start_pos) { 59 std::string::size_type end_pos = model_string.find(' ', start_pos); 61 std::string::size_type part_length = end_pos - start_pos; 133 std::string::size_type start_pos = 0; 134 std::string::size_type end_pos =
|
/external/libcxx/test/strings/basic.string/string.capacity/ |
H A D | reserve.pass.cpp | 12 // void reserve(size_type res_arg=0); 24 typename S::size_type old_cap = s.capacity(); 35 test(S s, typename S::size_type res_arg) 37 typename S::size_type old_cap = s.capacity();
|