Searched refs:pos (Results 1 - 25 of 2187) sorted by relevance

1234567891011>>

/prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/strings/basic.string/string.access/
H A Dat.pass.cpp12 // const_reference at(size_type pos) const;
13 // reference at(size_type pos);
25 test(S s, typename S::size_type pos) argument
28 if (pos < s.size())
30 assert(s.at(pos) == s[pos]);
31 assert(cs.at(pos) == cs[pos]);
38 s.at(pos);
43 assert(pos >
[all...]
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/strings/basic.string/string.access/
H A Dat.pass.cpp12 // const_reference at(size_type pos) const;
13 // reference at(size_type pos);
25 test(S s, typename S::size_type pos) argument
28 if (pos < s.size())
30 assert(s.at(pos) == s[pos]);
31 assert(cs.at(pos) == cs[pos]);
38 s.at(pos);
43 assert(pos >
[all...]
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/cc_hash_table_map_/
H A Derase_fn_imps.hpp62 for (size_type pos = 0; pos < m_num_e; ++pos)
64 while (m_entries[pos] != 0 && pred(m_entries[pos]->m_value))
67 entry_pointer p_next_e = m_entries[pos]->m_p_next;
68 erase_entry_pointer(m_entries[pos]);
69 m_entries[pos] = p_next_e;
72 entry_pointer p_e = m_entries[pos];
94 for (size_type pos
[all...]
H A Dconstructor_destructor_no_store_hash_fn_imps.hpp45 constructor_insert_new_imp(mapped_const_reference r_val, size_type pos, argument
52 p->m_p_next = m_entries[pos];
53 m_entries[pos] = p;
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/mingw/include/c++/4.8.3/ext/pb_ds/detail/cc_hash_table_map_/
H A Derase_fn_imps.hpp62 for (size_type pos = 0; pos < m_num_e; ++pos)
64 while (m_entries[pos] != 0 && pred(m_entries[pos]->m_value))
67 entry_pointer p_next_e = m_entries[pos]->m_p_next;
68 erase_entry_pointer(m_entries[pos]);
69 m_entries[pos] = p_next_e;
72 entry_pointer p_e = m_entries[pos];
94 for (size_type pos
[all...]
H A Dconstructor_destructor_no_store_hash_fn_imps.hpp45 constructor_insert_new_imp(mapped_const_reference r_val, size_type pos, argument
52 p->m_p_next = m_entries[pos];
53 m_entries[pos] = p;
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/cc_hash_table_map_/
H A Derase_fn_imps.hpp62 for (size_type pos = 0; pos < m_num_e; ++pos)
64 while (m_entries[pos] != 0 && pred(m_entries[pos]->m_value))
67 entry_pointer p_next_e = m_entries[pos]->m_p_next;
68 erase_entry_pointer(m_entries[pos]);
69 m_entries[pos] = p_next_e;
72 entry_pointer p_e = m_entries[pos];
94 for (size_type pos
[all...]
H A Dconstructor_destructor_no_store_hash_fn_imps.hpp45 constructor_insert_new_imp(mapped_const_reference r_val, size_type pos, argument
52 p->m_p_next = m_entries[pos];
53 m_entries[pos] = p;
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/gp_hash_table_map_/
H A Diterator_fn_imps.hpp56 size_type pos; local
57 get_start_it_state(p_value, pos);
58 return iterator(p_value, pos, this);
73 size_type pos; local
74 get_start_it_state(p_value, pos);
75 return const_iterator(p_value, pos, this);
H A Ddebug_no_store_hash_fn_imps.hpp50 for (size_type pos = 0; pos < m_num_e; ++pos)
52 const_entry_pointer p_e = &a_entries[pos];
H A Dconstructor_destructor_no_store_hash_fn_imps.hpp45 constructor_insert_new_imp(mapped_const_reference r_val, size_type pos, argument
48 _GLIBCXX_DEBUG_ASSERT(m_entries[pos].m_stat != valid_entry_status)k;
49 entry* const p_e = m_entries + pos;
H A Dinsert_no_store_hash_fn_imps.hpp57 const size_type pos = ranged_probe_fn_base::operator()(r_key, hash, i); local
58 _GLIBCXX_DEBUG_ASSERT(pos < m_num_e);
59 entry* const p_e = m_entries + pos;
66 return (ins_pos == m_num_e) ? pos : ins_pos;
71 ins_pos = pos;
78 return pos;
99 const size_type pos = find_ins_pos(r_key, local
102 if (m_entries[pos].m_stat == valid_entry_status)
105 return std::make_pair(&(m_entries + pos)->m_value, false);
109 return std::make_pair(insert_new_imp(r_val, pos), tru
[all...]
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/mingw/include/c++/4.8.3/ext/pb_ds/detail/gp_hash_table_map_/
H A Diterator_fn_imps.hpp56 size_type pos; local
57 get_start_it_state(p_value, pos);
58 return iterator(p_value, pos, this);
73 size_type pos; local
74 get_start_it_state(p_value, pos);
75 return const_iterator(p_value, pos, this);
H A Ddebug_no_store_hash_fn_imps.hpp50 for (size_type pos = 0; pos < m_num_e; ++pos)
52 const_entry_pointer p_e = &a_entries[pos];
H A Dconstructor_destructor_no_store_hash_fn_imps.hpp45 constructor_insert_new_imp(mapped_const_reference r_val, size_type pos, argument
48 _GLIBCXX_DEBUG_ASSERT(m_entries[pos].m_stat != valid_entry_status)k;
49 entry* const p_e = m_entries + pos;
H A Dinsert_no_store_hash_fn_imps.hpp57 const size_type pos = ranged_probe_fn_base::operator()(r_key, hash, i); local
58 _GLIBCXX_DEBUG_ASSERT(pos < m_num_e);
59 entry* const p_e = m_entries + pos;
66 return (ins_pos == m_num_e) ? pos : ins_pos;
71 ins_pos = pos;
78 return pos;
99 const size_type pos = find_ins_pos(r_key, local
102 if (m_entries[pos].m_stat == valid_entry_status)
105 return std::make_pair(&(m_entries + pos)->m_value, false);
109 return std::make_pair(insert_new_imp(r_val, pos), tru
[all...]
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/gp_hash_table_map_/
H A Diterator_fn_imps.hpp56 size_type pos; local
57 get_start_it_state(p_value, pos);
58 return iterator(p_value, pos, this);
73 size_type pos; local
74 get_start_it_state(p_value, pos);
75 return const_iterator(p_value, pos, this);
H A Ddebug_no_store_hash_fn_imps.hpp50 for (size_type pos = 0; pos < m_num_e; ++pos)
52 const_entry_pointer p_e = &a_entries[pos];
H A Dconstructor_destructor_no_store_hash_fn_imps.hpp45 constructor_insert_new_imp(mapped_const_reference r_val, size_type pos, argument
48 _GLIBCXX_DEBUG_ASSERT(m_entries[pos].m_stat != valid_entry_status)k;
49 entry* const p_e = m_entries + pos;
H A Dinsert_no_store_hash_fn_imps.hpp57 const size_type pos = ranged_probe_fn_base::operator()(r_key, hash, i); local
58 _GLIBCXX_DEBUG_ASSERT(pos < m_num_e);
59 entry* const p_e = m_entries + pos;
66 return (ins_pos == m_num_e) ? pos : ins_pos;
71 ins_pos = pos;
78 return pos;
99 const size_type pos = find_ins_pos(r_key, local
102 if (m_entries[pos].m_stat == valid_entry_status)
105 return std::make_pair(&(m_entries + pos)->m_value, false);
109 return std::make_pair(insert_new_imp(r_val, pos), tru
[all...]
/prebuilts/gdb/darwin-x86/lib/python2.7/bsddb/
H A Ddbrecio.py10 pos = f.tell() # get current position
11 f.seek(pos) # set current position
12 f.seek(pos, mode) # mode 0: absolute; 1: relative; 2: relative to EOF
15 f.truncate([size]) # truncate file at to at most size (default: current pos)
40 self.pos = 0
54 def seek(self, pos, mode = 0):
58 pos = pos + self.pos
60 pos
[all...]
/prebuilts/gdb/linux-x86/lib/python2.7/bsddb/
H A Ddbrecio.py10 pos = f.tell() # get current position
11 f.seek(pos) # set current position
12 f.seek(pos, mode) # mode 0: absolute; 1: relative; 2: relative to EOF
15 f.truncate([size]) # truncate file at to at most size (default: current pos)
40 self.pos = 0
54 def seek(self, pos, mode = 0):
58 pos = pos + self.pos
60 pos
[all...]
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/bsddb/
H A Ddbrecio.py10 pos = f.tell() # get current position
11 f.seek(pos) # set current position
12 f.seek(pos, mode) # mode 0: absolute; 1: relative; 2: relative to EOF
15 f.truncate([size]) # truncate file at to at most size (default: current pos)
40 self.pos = 0
54 def seek(self, pos, mode = 0):
58 pos = pos + self.pos
60 pos
[all...]
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/bsddb/
H A Ddbrecio.py10 pos = f.tell() # get current position
11 f.seek(pos) # set current position
12 f.seek(pos, mode) # mode 0: absolute; 1: relative; 2: relative to EOF
15 f.truncate([size]) # truncate file at to at most size (default: current pos)
40 self.pos = 0
54 def seek(self, pos, mode = 0):
58 pos = pos + self.pos
60 pos
[all...]
/prebuilts/gdb/darwin-x86/lib/python2.7/email/
H A D_parseaddr.py189 self.pos = 0
203 while self.pos < len(self.field):
204 if self.field[self.pos] in self.LWS + '\n\r':
205 self.pos += 1
206 elif self.field[self.pos] == '(':
217 while self.pos < len(self.field):
230 oldpos = self.pos
237 if self.pos >= len(self.field):
242 elif self.field[self.pos] in '.@':
245 self.pos
[all...]

Completed in 326 milliseconds

1234567891011>>