/haiku/src/libs/bsd/ |
H A D | arc4random_uniform.c | 23 * Calculate a uniformly distributed random number less than upper_bound 27 * returned is outside the range [0, 2**32 % upper_bound). This 29 * [2**32 % upper_bound, 2**32) which maps back to [0, upper_bound) 30 * after reduction modulo upper_bound. 33 arc4random_uniform(uint32_t upper_bound) argument 37 if (upper_bound < 2) 41 min = -upper_bound % upper_bound; 55 return r % upper_bound; [all...] |
/haiku/headers/compatibility/bsd/ |
H A D | stdlib.h | 26 uint32_t arc4random_uniform(uint32_t upper_bound);
|
/haiku/headers/cpp/ |
H A D | stl_map.h | 194 iterator upper_bound(const key_type& __x) {return _M_t.upper_bound(__x); } function in class:map 195 const_iterator upper_bound(const key_type& __x) const { function in class:map 196 return _M_t.upper_bound(__x);
|
H A D | stl_multimap.h | 183 iterator upper_bound(const key_type& __x) {return _M_t.upper_bound(__x); } function in class:multimap 184 const_iterator upper_bound(const key_type& __x) const { function in class:multimap 185 return _M_t.upper_bound(__x);
|
H A D | algo.h | 75 using __STD::upper_bound;
|
H A D | stl_multiset.h | 179 iterator upper_bound(const key_type& __x) const { function in class:multiset 180 return _M_t.upper_bound(__x);
|
H A D | stl_set.h | 173 iterator upper_bound(const key_type& __x) const { function in class:set 174 return _M_t.upper_bound(__x);
|
H A D | stl_tree.h | 749 iterator upper_bound(const key_type& __x); 750 const_iterator upper_bound(const key_type& __x) const; 1202 ::upper_bound(const _Key& __k) function in class:_Rb_tree 1220 ::upper_bound(const _Key& __k) const function in class:_Rb_tree 1242 return pair<iterator, iterator>(lower_bound(__k), upper_bound(__k)); 1253 upper_bound(__k));
|
H A D | stl_algo.h | 1720 // Binary search (lower_bound, upper_bound, equal_range, binary_search). 1809 inline _ForwardIter upper_bound(_ForwardIter __first, _ForwardIter __last, function 1840 inline _ForwardIter upper_bound(_ForwardIter __first, _ForwardIter __last, function 1870 __right = upper_bound(++__middle, __first, __val); 1908 __right = upper_bound(++__middle, __first, __val, __comp); 2004 __first_cut = upper_bound(__first, __middle, *__second_cut); 2041 __first_cut = upper_bound(__first, __middle, *__second_cut, __comp); 2162 __first_cut = upper_bound(__first, __middle, *__second_cut); 2206 __first_cut = upper_bound(__first, __middle, *__second_cut, __comp);
|
/haiku/src/build/libgnuregex/ |
H A D | regex.c | 1751 int lower_bound = -1, upper_bound = -1; 1767 GET_UNSIGNED_NUMBER (upper_bound); 1768 if (upper_bound < 0) upper_bound = RE_DUP_MAX; 1772 upper_bound = lower_bound; 1774 if (lower_bound < 0 || upper_bound > RE_DUP_MAX 1775 || lower_bound > upper_bound) 1814 if (upper_bound == 0) 1829 `upper_bound' is 1, though.) */ 1833 unsigned nbytes = 10 + (upper_bound > 1742 int lower_bound = -1, upper_bound = -1; local [all...] |
/haiku/src/apps/cortex/NodeManager/ |
H A D | NodeManager.cpp | 505 con_map::const_iterator itEnd = m_conSourceMap.upper_bound(node); 528 con_map::const_iterator itEnd = m_conDestinationMap.upper_bound(node); 555 con_map::const_iterator itEnd = m_conSourceMap.upper_bound(sourceNode); 1337 con_map::iterator itEnd = m_conSourceMap.upper_bound(connection.sourceNode()); 1765 it != m_conSourceMap.upper_bound(connection->sourceNode()); ++it) { 1769 it != m_conDestinationMap.upper_bound(connection->destinationNode()); ++it) { 1806 itSource != m_conSourceMap.upper_bound(connection.sourceNode()); 1815 itDestination != m_conDestinationMap.upper_bound(connection.destinationNode());
|
H A D | NodeRef.cpp | 375 itEnd = m_manager->m_conDestinationMap.upper_bound(m_info.node.node); 396 itEnd = m_manager->m_conSourceMap.upper_bound(m_info.node.node); 420 itEnd = m_manager->m_conDestinationMap.upper_bound(m_info.node.node); 446 itEnd = m_manager->m_conSourceMap.upper_bound(m_info.node.node);
|
/haiku/src/kits/debugger/dwarf/ |
H A D | DebugInfoEntry.h | 113 DECLARE_DEBUG_INFO_ENTRY_ATTR_SETTER(upper_bound)
|
H A D | DebugInfoEntry.cpp | 256 DEFINE_DEBUG_INFO_ENTRY_ATTR_SETTER(upper_bound)
|
H A D | AttributeClasses.cpp | 77 { ENTRY(upper_bound), AC_BLOCK | AC_CONSTANT | AC_REFERENCE },
|
/haiku/src/apps/cortex/TipManager/ |
H A D | TipManagerImpl.cpp | 196 tip_entry_set::iterator itEnd = viewEntry->m_tips.upper_bound(&matchEntry);
|
/haiku/src/apps/icon-o-matic/shape/ |
H A D | PathManipulator.cpp | 150 insert(std::upper_bound(begin(), end(), value), value);
|