/haiku/3rdparty/proj2make/ |
H A D | proj2make.cpp | 96 gProjFile.seekg(0, ios::end);
|
/haiku/docs/develop/kits/storage/resources/ |
H A D | ResourcesFormat.tex | 15 \end{itemize} 20 % begin/end a code block 22 \newcommand{\codeblockend}{\end{minipage}\end{flushleft}} 62 at the end of the files. They are completely independent of their location. 74 \end{verbatim} 102 \end{verbatim} 110 \end{verbatim} 119 \end{nitemize} 135 a size field, it has to be deduced, where the file ends. This end offse [all...] |
/haiku/headers/cpp/ |
H A D | editbuf.h | 59 // A edit_string is defined as the region between the 'start' and 'end' marks. 61 // and 'end->insert_before()' should be true. 64 struct edit_buffer *buffer; // buffer that 'start' and 'end' belong to 65 struct edit_mark *start, *end; member in struct:edit_string 69 { buffer = b; start = ms; end = me; } 168 void delete_range(struct edit_mark *start, struct edit_mark *end);
|
H A D | sstream | 174 else if (way == ios::end)
|
H A D | stl_bvector.h | 431 _M_finish = copy(__position, end(), __i); 476 copy_backward(__position, end(), _M_finish + difference_type(__n)); 485 _M_finish = copy(__position, end(), __i); 498 iterator end() { return _M_finish; } function in class:vector 499 const_iterator end() const { return _M_finish; } function in class:vector 501 reverse_iterator rbegin() { return reverse_iterator(end()); } 503 return const_reverse_iterator(end()); 510 size_type size() const { return size_type(end() - begin()); } 515 bool empty() const { return begin() == end(); } 543 copy(__x.begin(), __x.end(), _M_star [all...] |
H A D | stl_deque.h | 42 * pointer, even if i is a past-the-end iterator. 532 iterator end() { return _M_finish; } function in class:_Deque_iterator::deque 534 const_iterator end() const { return _M_finish; } function in class:_Deque_iterator::deque 569 { uninitialized_copy(__x.begin(), __x.end(), _M_start); } 617 erase(copy(__x.begin(), __x.end(), _M_start), _M_finish); 621 insert(_M_finish, __mid, __x.end()); 642 fill(begin(), end(), __val); 643 insert(end(), __n - size(), __val); 646 erase(begin() + __n, end()); 647 fill(begin(), end(), __va [all...] |
H A D | stl_hash_map.h | 155 iterator end() { return _M_ht.end(); } function in class:hash_map 157 const_iterator end() const { return _M_ht.end(); } function in class:hash_map 339 iterator end() { return _M_ht.end(); } function in class:hash_multimap 341 const_iterator end() const { return _M_ht.end(); } function in class:hash_multimap
|
H A D | stl_hash_set.h | 153 iterator end() const { return _M_ht.end(); } function in class:hash_set 332 iterator end() const { return _M_ht.end(); } function in class:hash_multiset
|
H A D | stl_hashtable.h | 321 return end(); 324 iterator end() { return iterator(0, this); } function in class:hashtable 331 return end(); 334 const_iterator end() const { return const_iterator(0, this); } function in class:hashtable 515 _M_buckets.insert(_M_buckets.end(), __n_buckets, (_Node*) 0); 777 return _Pii(iterator(__first, this), end()); 779 return _Pii(end(), end()); 805 return _Pii(const_iterator(__first, this), end()); 808 return _Pii(end(), en [all...] |
H A D | stl_list.h | 315 iterator end() { return _M_node; } function in class:list 316 const_iterator end() const { return _M_node; } function in class:list 319 { return reverse_iterator(end()); } 321 { return const_reverse_iterator(end()); } 331 distance(begin(), end(), __result); 338 reference back() { return *(--end()); } 339 const_reference back() const { return *(--end()); } 381 void push_back(const _Tp& __x) { insert(end(), __x); } 382 void push_back() {insert(end());} 401 iterator __tmp = end(); [all...] |
H A D | stl_map.h | 141 iterator end() { return _M_t.end(); } function in class:map 142 const_iterator end() const { return _M_t.end(); } function in class:map 153 if (__i == end() || key_comp()(__k, (*__i).first))
|
H A D | stl_multimap.h | 138 iterator end() { return _M_t.end(); } function in class:multimap 139 const_iterator end() const { return _M_t.end(); } function in class:multimap
|
H A D | stl_multiset.h | 129 iterator end() const { return _M_t.end(); } function in class:multiset
|
H A D | stl_queue.h | 135 { make_heap(c.begin(), c.end(), comp); } 140 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); } 146 { make_heap(c.begin(), c.end(), comp); } 153 c.insert(c.end(), __first, __last); 154 make_heap(c.begin(), c.end(), comp); 159 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); } 164 { make_heap(c.begin(), c.end(), comp); } 170 c.insert(c.end(), __first, __last); 171 make_heap(c.begin(), c.end(), comp); 181 push_heap(c.begin(), c.end(), com [all...] |
H A D | stl_rope.h | 43 // convert to/from C-like strings to detect the end of the string. 45 // The end-of-C-string character. 1356 // begin and end are assumed to be in range. 1815 const_iterator end() const { function in class:rope 1846 return const_reverse_iterator(end()); 1850 return const_reverse_iterator(end()); 2285 iterator end() { return mutable_end(); } function in class:rope 2295 const_iterator end() { return const_end(); } function in class:rope
|
H A D | stl_set.h | 123 iterator end() const { return _M_t.end(); } function in class:set
|
H A D | stl_slist.h | 380 { _M_insert_after_range(&_M_head, __x.begin(), __x.end()); } 418 iterator end() { return iterator(0); } function in class:slist 419 const_iterator end() const { return const_iterator(0); } function in class:slist 762 return lexicographical_compare(_SL1.begin(), _SL1.end(), 763 _SL2.begin(), _SL2.end());
|
H A D | stl_tempbuf.h | 109 _Tp* end() { return _M_buffer + _M_len; } function in class:_Temporary_buffer
|
H A D | stl_tree.h | 688 iterator end() { return _M_header; } function in class:_Rb_tree 689 const_iterator end() const { return _M_header; } function in class:_Rb_tree 690 reverse_iterator rbegin() { return reverse_iterator(end()); } 692 return const_reverse_iterator(end()); 766 equal(__x.begin(), __x.end(), __y.begin()); 775 return lexicographical_compare(__x.begin(), __x.end(), 776 __y.begin(), __y.end()); 912 } else if (__position._M_node == _M_header) { // end() 945 } else if (__position._M_node == _M_header) {// end() 1098 if (__first == begin() && __last == end()) [all...] |
H A D | stl_vector.h | 199 iterator end() { return _M_finish; } function in class:vector 200 const_iterator end() const { return _M_finish; } function in class:vector 203 { return reverse_iterator(end()); } 205 { return const_reverse_iterator(end()); } 212 { return size_type(end() - begin()); } 218 { return begin() == end(); } 249 { _M_finish = uninitialized_copy(__x.begin(), __x.end(), _M_start); } 330 reference back() { return *(end() - 1); } 331 const_reference back() const { return *(end() - 1); } 339 _M_insert_aux(end(), __ [all...] |
H A D | streambuf.h | 149 enum seek_dir { beg, cur, end}; enumerator in enum:ios::seek_dir 330 // The end of the main get area: 335 // The end of the backup area:
|
/haiku/headers/libs/agg/ |
H A D | agg_array.h | 1065 unsigned end = arr.size() - 1; local 1068 if(less(arr[end], val)) return end + 1; 1070 while(end - beg > 1) 1072 unsigned mid = (end + beg) >> 1; 1073 if(less(val, arr[mid])) end = mid; 1078 //if(end >= arr.size() - 1 && less(arr[end], val)) ++end; 1080 return end; [all...] |
H A D | agg_gamma_functions.h | 80 void end(double e) { m_end = e; } function in class:agg::gamma_linear 82 double end() const { return m_end; } function in class:agg::gamma_linear
|
H A D | agg_image_filters.h | 64 unsigned end = (diameter() << image_subpixel_shift) - 1; local 65 m_weight_array[0] = m_weight_array[end];
|
H A D | agg_path_storage.h | 800 unsigned perceive_polygon_orientation(unsigned start, unsigned end); 801 void invert_polygon(unsigned start, unsigned end); 1177 unsigned end) 1181 unsigned np = end - start; 1197 void path_base<VC>::invert_polygon(unsigned start, unsigned end) argument 1202 --end; // Make "end" inclusive 1205 for(i = start; i < end; i++) 1211 m_vertices.modify_command(end, tmp_cmd); 1214 while(end > star 1176 perceive_polygon_orientation(unsigned start, unsigned end) argument 1234 unsigned end = start + 1; local 1258 unsigned end = start + 1; local [all...] |