Lines Matching full:begin
61 void STLDeleteContainerPointers(ForwardIterator begin, ForwardIterator end) {
62 while (begin != end) {
63 ForwardIterator temp = begin;
64 ++begin;
78 void STLDeleteContainerPairPointers(ForwardIterator begin,
80 while (begin != end) {
81 ForwardIterator temp = begin;
82 ++begin;
93 void STLDeleteContainerPairFirstPointers(ForwardIterator begin,
95 while (begin != end) {
96 ForwardIterator temp = begin;
97 ++begin;
106 void STLDeleteContainerPairSecondPointers(ForwardIterator begin,
108 while (begin != end) {
109 delete begin->second;
110 ++begin;
139 memcpy(&*str->begin(), ptr, n);
143 // If you know the array will never be empty, you can use &*v.begin()
154 return &*v->begin();
156 return v->empty() ? NULL : &*v->begin();
163 return &*v->begin();
165 return v->empty() ? NULL : &*v->begin();
183 return str->empty() ? NULL : &*str->begin();
195 for (typename HashSet::const_iterator i = set_a.begin();
206 for (typename HashMap::const_iterator i = map_a.begin();
220 // hash_set, or any other STL container which defines sensible begin(), end(),
231 STLDeleteContainerPointers(container->begin(), container->end());
242 for (typename T::iterator i = v->begin(); i != v->end(); ++i) {
441 result.insert(result.begin(), values.begin(), values.end());
