Searched refs:begin (Results 1 - 25 of 256) sorted by relevance

1234567891011

/haiku/src/apps/haiku3d/
H A DMathUtils.h15 static float EaseInOutCubic(float time, float begin, float distance,
17 static float EaseInOutQuart(float time, float begin, float distance,
19 static float EaseInOutQuint(float time, float begin, float distance,
21 static float EaseInOutSine(float time, float begin, float distance,
/haiku/src/apps/cortex/support/
H A Dset_tools.h50 void ptr_set_delete(iter begin, iter end) { argument
51 while(begin != end) {
52 if(*begin)
53 delete *begin;
54 ++begin;
60 void ptr_map_delete(iter begin, iter end) { argument
61 while(begin != end) {
62 if((*begin).second)
63 delete (*begin).second;
64 ++begin;
101 map_value_copy(input_iter begin, input_iter end, output_iter to) argument
[all...]
/haiku/src/system/libroot/posix/glibc/stdlib/
H A Dgrouping.h33 correctly_grouped_prefix (const STRING_TYPE *begin, const STRING_TYPE *end, argument
53 while (end > begin)
59 while (cp >= begin)
79 if (cp < begin)
88 if (cp < begin)
117 while (cp >= begin)
132 if (cp < begin)
141 while (cp >= begin)
156 if (cp < begin && group_end - cp <= (int) *gp)
160 if (cp < begin || group_en
[all...]
/haiku/src/kits/debugger/source_language/c_family/
H A DCLanguageTokenizer.cpp119 const char* begin = fCurrentChar; local
141 int32 length = fCurrentChar - begin;
144 fCurrentChar = begin;
159 fCurrentToken = Token(begin, length, _CurrentPos() - length,
166 const char* begin = fCurrentChar; local
171 int32 length = fCurrentChar - begin;
172 fCurrentToken = Token(begin, length, _CurrentPos() - length,
176 const char* begin = fCurrentChar++; local
181 } else if (*(fCurrentChar++) == *begin) {
188 tokenType = *begin
441 const char* begin = fCurrentChar; local
[all...]
/haiku/src/kits/media/
H A DPortPool.cpp34 PortSet::iterator iterator = fPool.begin();
49 port_id port = *fPool.begin();
/haiku/src/tools/cppunit/cppunit/
H A DTestResult.cpp62 for ( TestListeners::iterator it = m_listeners.begin();
74 for ( TestListeners::iterator it = m_listeners.begin();
86 for ( TestListeners::iterator it = m_listeners.begin();
123 m_listeners.erase( remove( m_listeners.begin(),
H A DTestSuite.cpp24 for ( vector<Test *>::iterator it = m_tests.begin();
36 for ( vector<Test *>::iterator it = m_tests.begin();
55 for ( vector<Test *>::const_iterator it = m_tests.begin();
/haiku/src/servers/power/
H A Dlid_monitor.cpp29 for (std::set<int>::iterator it = fFDs.begin(); it != fFDs.end(); ++it)
/haiku/src/tools/cppunit/
H A DBTestSuite.cpp26 for ( map<string, CppUnit::Test*>::iterator it = fTests.begin();
38 for ( map<string, CppUnit::Test*>::iterator it = fTests.begin();
57 for ( map<string, CppUnit::Test *>::const_iterator it = fTests.begin();
/haiku/src/kits/storage/sniffer/
H A DRPatternList.cpp26 for (i = fList.begin(); i != fList.end(); i++)
51 for (i = fList.begin(); i != fList.end(); i++) {
71 for (i = fList.begin(); i != fList.end(); i++) {
H A DPatternList.cpp27 for (i = fList.begin(); i != fList.end(); i++)
51 for (i = fList.begin(); i != fList.end(); i++) {
72 for (i = fList.begin(); i != fList.end(); i++) {
/haiku/src/kits/storage/
H A DAddOnMonitorHandler.cpp44 DirectoryList::iterator it = fDirectories.begin();
46 EntryList::iterator eiter = it->entries.begin();
77 DirectoryList::iterator it = fDirectories.begin();
222 EntryList::iterator eiter = fPendingEntries.begin();
231 DirectoryList::iterator diter = fDirectories.begin();
237 eiter = diter->entries.begin();
251 DirectoryList::iterator diter2 = fDirectories.begin();
267 eiter = diter->entries.begin();
285 DirectoryList::iterator fromIter = fDirectories.begin();
289 DirectoryList::iterator toIter = fDirectories.begin();
[all...]
/haiku/src/apps/diskusage/
H A DPieView.h68 : begin(0.0), end(0.0), info(NULL) { }
70 : begin(b), end(e), info(i) { }
72 : begin(s.begin), end(s.end), info(s.info) { }
75 float begin; member in struct:PieView::Segment
H A DSnapshot.cpp42 FileInfo* child = *children.begin();
44 children.erase(children.begin());
65 vector<FileInfo*>::const_iterator i = children.begin();
/haiku/src/apps/cortex/RouteApp/
H A DNodeSetIOContext.cpp65 for(node_set::const_iterator it = m_nodes.begin();
96 for(node_set::iterator it = m_nodes.begin();
112 m_nodes.erase(m_nodes.begin() + index);
145 for(node_set::const_iterator it = m_nodes.begin();
164 for(node_set::const_iterator it = m_nodes.begin();
/haiku/src/apps/patchbay/
H A DPatchView.cpp94 endpoint_itor begin, end; local
99 begin = fConsumers.begin();
109 begin = fProducers.begin();
120 for (itor = begin; itor != end; itor++, index--)
152 for (list<EndpointInfo>::const_iterator i = fProducers.begin();
160 for (list<EndpointInfo>::const_iterator i = fConsumers.begin();
366 for (list<EndpointInfo>::const_iterator i = fConsumers.begin();
383 for (row_itor i = fPatchRows.begin();
[all...]
/haiku/src/apps/cortex/TipManager/
H A DTipManagerImpl.cpp70 for(list<_ViewEntry*>::iterator it = m_childViews.begin();
74 for(tip_entry_set::iterator it = m_tips.begin();
108 for(list<BView*>::iterator itView = parentOrder.begin();
114 viewEntry->m_childViews.begin(),
128 !(*viewEntry->m_tips.begin())->rect.IsValid()) {
174 for(list<BView*>::iterator itView = parentOrder.begin();
180 viewEntry->m_childViews.begin(),
211 tip_entry_set::iterator it = viewEntry->m_tips.begin();
222 list<_ViewEntry*>::iterator itChild = viewEntry->m_childViews.begin();
240 viewEntry->m_parent->m_childViews.begin(),
[all...]
/haiku/headers/cpp/
H A Dstl_list.h312 iterator begin() { return (_Node*)(_M_node->_M_next); } function in class:list
313 const_iterator begin() const { return (_Node*)(_M_node->_M_next); } function in class:list
324 { return reverse_iterator(begin()); }
326 { return const_reverse_iterator(begin()); }
331 distance(begin(), end(), __result);
336 reference front() { return *begin(); }
337 const_reference front() const { return *begin(); }
379 void push_front(const _Tp& __x) { insert(begin(), __x); }
380 void push_front() {insert(begin());}
399 void pop_front() { erase(begin()); }
[all...]
H A Dstl_queue.h135 { 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); }
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); }
171 make_heap(c.begin(), c.end(), comp);
181 push_heap(c.begin(), c.end(), comp);
187 pop_heap(c.begin(), c.end(), comp);
H A Dstl_vector.h197 iterator begin() { return _M_start; } function in class:vector
198 const_iterator begin() const { return _M_start; } function in class:vector
207 { return reverse_iterator(begin()); }
209 { return const_reverse_iterator(begin()); }
212 { return size_type(end() - begin()); }
216 { return size_type(_M_end_of_storage - begin()); }
218 { return begin() == end(); }
220 reference operator[](size_type __n) { return *(begin() + __n); }
221 const_reference operator[](size_type __n) const { return *(begin() + __n); }
226 return *(begin()
[all...]
/haiku/src/kits/app/
H A DLooperList.cpp64 = find_if(fData.begin(), fData.end(), EmptySlotPred);
82 return find_if(fData.begin(), fData.end(),
93 LooperDataIterator i = find_if(fData.begin(), fData.end(),
148 = find_if(fData.begin(), fData.end(), FindThreadPred(thread));
164 = find_if(fData.begin(), fData.end(), FindNamePred(name));
180 = find_if(fData.begin(), fData.end(), FindPortPred(port));
/haiku/headers/libs/agg/
H A Dagg_span_subdiv_adaptor.h59 begin(x, y, len);
87 void begin(double x, double y, unsigned len) function in class:agg::span_subdiv_adaptor
94 m_interpolator->begin(x, y, len);
/haiku/src/bin/rc/
H A Drdef.cpp45 for (ptr_iter_t i = list.begin(); i != list.end(); ++i) {
91 for (ptr_iter_t i = include_dirs.begin(); i != include_dirs.end(); ++i) {
164 for (ptr_iter_t i = include_dirs.begin(); i != include_dirs.end(); ++i) {
/haiku/src/apps/terminal/
H A DTerminalCharClassifier.cpp46 if (std::find(fAdditionalWordChars.begin(), fAdditionalWordChars.end(),
/haiku/src/servers/registrar/mime/
H A DRegistrarThreadManager.cpp105 for (i = fThreads.begin(); i != fThreads.end();) {
131 for (i = fThreads.begin(); i != fThreads.end(); ) {
161 for (i = fThreads.begin(); i != fThreads.end(); ) {
200 for (i = fThreads.begin(); i != fThreads.end(); ) {

Completed in 216 milliseconds

1234567891011