/haiku/docs/interface_guidelines/docbook-css/ |
H A D | core.css | 44 qandaset, question, refentry, refentrytitle, reference, refnamediv, refsect1,
|
/haiku/headers/cpp/ |
H A D | bitset | 35 // returns a reference to a bit, again without doing any range checking. 571 // bit reference: 572 class reference; 573 friend class reference; 574 class reference { 581 reference(); 583 reference( bitset& __b, size_t __pos ) { 589 ~reference() {} 592 reference& operator=(bool __x) { 602 reference [all...] |
H A D | defalloc.h | 68 typedef T& reference; typedef in class:allocator 76 pointer address(reference x) { return (pointer)&x; }
|
H A D | pthread_alloc | 375 typedef _Tp& reference; 389 pointer address(reference __x) const { return &__x; }
|
H A D | stl_alloc.h | 311 // This may have undesirable effects on reference locality. 740 typedef _Tp& reference; typedef in class:allocator 753 pointer address(reference __x) const { return &__x; } 815 typedef _Tp& reference; typedef in struct:__allocator 831 pointer address(reference __x) const { return &__x; }
|
H A D | stl_bvector.h | 76 typedef _Bit_reference reference; typedef in struct:_Bit_iterator 98 reference operator*() const { return reference(_M_p, 1U << _M_offset); } 143 reference operator[](difference_type __i) { return *(*this + __i); } 158 typedef bool reference; typedef in struct:_Bit_const_iterator 383 typedef _Bit_reference reference; typedef in class:vector 397 typedef reverse_iterator<iterator, value_type, reference, difference_type> 516 reference operator[](size_type __n) { 673 reference front() { return *begin(); } 675 reference bac [all...] |
H A D | stl_deque.h | 116 typedef _Ref reference; typedef in struct:_Deque_iterator::_Deque_iterator 136 reference operator*() const { return *_M_cur; } 203 reference operator[](difference_type __n) const { return *(*this + __n); } 486 typedef value_type& reference; typedef in class:_Deque_iterator::deque 505 typedef reverse_iterator<iterator, value_type, reference, difference_type> 543 reference operator[](size_type __n) 548 reference front() { return *_M_start; } 549 reference back() {
|
H A D | stl_hash_map.h | 69 typedef typename _Ht::reference reference; typedef in class:hash_map 252 typedef typename _Ht::reference reference; typedef in class:hash_multimap
|
H A D | stl_hash_set.h | 66 typedef typename _Ht::const_reference reference; typedef in class:hash_set 245 typedef typename _Ht::const_reference reference; typedef in class:hash_multiset
|
H A D | stl_hashtable.h | 85 typedef _Val& reference; typedef in struct:_Hashtable_iterator 94 reference operator*() const { return _M_cur->_M_val; } 124 typedef const _Val& reference; typedef in struct:_Hashtable_const_iterator 135 reference operator*() const { return _M_cur->_M_val; } 198 typedef value_type& reference; typedef in class:hashtable 456 reference find_or_insert(const value_type& __obj); 741 typename hashtable<_Val,_Key,_HF,_Ex,_Eq,_All>::reference
|
H A D | stl_iterator.h | 52 typedef _Tp& reference; typedef in struct:input_iterator 60 typedef void reference; typedef in struct:output_iterator 68 typedef _Tp& reference; typedef in struct:forward_iterator 77 typedef _Tp& reference; typedef in struct:bidirectional_iterator 85 typedef _Tp& reference; typedef in struct:random_access_iterator 96 typedef _Reference reference; typedef in struct:iterator 108 typedef typename _Iterator::reference reference; typedef in struct:iterator_traits 117 typedef _Tp& reference; typedef in struct:iterator_traits 126 typedef const _Tp& reference; typedef in struct:iterator_traits 356 typedef void reference; typedef in class:back_insert_iterator 395 typedef void reference; typedef in class:front_insert_iterator 435 typedef void reference; typedef in class:insert_iterator 486 typedef _Reference reference; typedef in class:reverse_bidirectional_iterator 584 reference; typedef in class:reverse_iterator 693 typedef _Reference reference; typedef in class:reverse_iterator 828 typedef const _Tp& reference; typedef in class:istream_iterator 884 typedef void reference; typedef in class:ostream_iterator [all...] |
H A D | stl_list.h | 58 typedef _Ref reference; typedef in struct:_List_iterator 71 reference operator*() const { return (*_M_node)._M_data; } 256 typedef value_type& reference; typedef in class:list 276 typedef reverse_bidirectional_iterator<iterator,value_type,reference, 336 reference front() { return *begin(); } 338 reference back() { return *(--end()); }
|
H A D | stl_map.h | 78 typedef typename _Rep_type::reference reference; typedef in class:map
|
H A D | stl_multimap.h | 77 typedef typename _Rep_type::reference reference; typedef in class:multimap
|
H A D | stl_multiset.h | 63 typedef typename _Rep_type::const_reference reference; typedef in class:multiset
|
H A D | stl_queue.h | 49 typedef typename _Sequence::reference reference; typedef in class:queue 59 reference front() { return c.front(); } 61 reference back() { return c.back(); } 125 typedef typename _Sequence::reference reference; typedef in class:priority_queue
|
H A D | stl_raw_storage_iter.h | 45 typedef void reference; typedef in class:raw_storage_iterator
|
H A D | stl_rope.h | 62 // Do not reference _S_eos if it isn't. 267 // assignment may result in a zero reference count and thus require 414 // in the reference count. The callee should increment 722 // adjust reference counts when these pointers are initialized 724 // the number of potentially expensive reference count 747 // that behaves almost like a reference. It's not possible to 748 // return an actual reference since assignment requires extra 772 // Don't preserve cache if the reference can outlive the 774 // a copy constructor or generating reference to a proxy 775 // reference 939 typedef _CharT reference; // Really a value. Returning a reference typedef in class:_Rope_const_iterator 1050 typedef _Rope_char_ref_proxy<_CharT,_Alloc> reference; typedef in class:_Rope_iterator 1272 typedef _Rope_char_ref_proxy<_CharT,_Alloc> reference; typedef in class:rope [all...] |
H A D | stl_set.h | 63 typedef typename _Rep_type::const_reference reference; typedef in class:set
|
H A D | stl_slist.h | 131 typedef _Ref reference; typedef in struct:_Slist_iterator 138 reference operator*() const { return ((_Node*) _M_node)->_M_data; } 308 typedef value_type& reference; typedef in class:slist 435 reference front() { return ((_Node*) _M_head._M_next)->_M_data; }
|
H A D | stl_stack.h | 49 typedef typename _Sequence::reference reference; typedef in class:stack 59 reference top() { return _M_c.back(); }
|
H A D | stl_tree.h | 153 typedef _Ref reference; typedef in struct:_Rb_tree_iterator 167 reference operator*() const { return _Link_type(_M_node)->_M_value_field; } 534 typedef value_type& reference; typedef in class:_Rb_tree 594 static reference _S_value(_Link_type __x) 607 static reference _S_value(_Base_ptr __x) 621 typedef _Rb_tree_iterator<value_type, reference, pointer> iterator; 629 typedef reverse_bidirectional_iterator<iterator, value_type, reference,
|
H A D | stl_vector.h | 165 typedef value_type& reference; typedef in class:vector 179 typedef reverse_iterator<iterator, value_type, reference, difference_type> 220 reference operator[](size_type __n) { return *(begin() + __n); } 223 reference at(size_type __n) { 328 reference front() { return *begin(); } 330 reference back() { return *(end() - 1); }
|
/haiku/src/add-ons/kernel/drivers/network/wlan/atheroswifi/contrib/ath_hal/ar9300/ |
H A D | ar9300_eeprom.c | 3865 ar9300_compression_header_unpack(u_int8_t *best, int *code, int *reference, argument 3875 *reference = (value[0] & 0x001f) | ((value[1] >> 2) & 0x0020); 3923 int reference, length, major, minor; local 3938 word, &code, &reference, &length, &major, &minor); 3942 __func__, cptr, code, reference, length, major, minor); 3979 if (reference == reference_current) { 3983 reference); 3986 "%s: Can't find reference eeprom struct %d\n", 3987 __func__, reference); 4004 "reference [all...] |
/haiku/src/apps/cortex/NodeManager/ |
H A D | NodeManager.h | 371 // use this method to reference nodes created within your 375 status_t reference(
|