/haiku/docs/develop/kits/storage/resources/ |
H A D | ResourcesFormat.tex | 498 \code{ri\_name} is empty, i.e. has size 0.
|
/haiku/headers/cpp/ |
H A D | bitset | 921 if (__tmp.empty())
|
H A D | stl_bvector.h | 515 bool empty() const { return begin() == end(); } function in class:vector
|
H A D | stl_deque.h | 44 * that an empty deque must have one node, and that a deque 53 * [map, map + map_size) is a valid, non-empty range. 563 bool empty() const { return _M_finish == _M_start; } function in class:_Deque_iterator::deque
|
H A D | stl_hash_map.h | 149 bool empty() const { return _M_ht.empty(); } function in class:hash_map 332 bool empty() const { return _M_ht.empty(); } function in class:hash_multimap
|
H A D | stl_hash_set.h | 147 bool empty() const { return _M_ht.empty(); } function in class:hash_set 326 bool empty() const { return _M_ht.empty(); } function in class:hash_multiset
|
H A D | stl_hashtable.h | 305 bool empty() const { return size() == 0; } function in class:hashtable
|
H A D | stl_list.h | 328 bool empty() const { return _M_node->_M_next == _M_node; } function in class:list 485 if (!__x.empty()) 734 while (!empty()) { 737 while(__i < __fill && !__counter[__i].empty()) { 810 while (!empty()) { 813 while(__i < __fill && !__counter[__i].empty()) {
|
H A D | stl_map.h | 147 bool empty() const { return _M_t.empty(); } function in class:map
|
H A D | stl_multimap.h | 144 bool empty() const { return _M_t.empty(); } function in class:multimap
|
H A D | stl_multiset.h | 132 bool empty() const { return _M_t.empty(); } function in class:multiset
|
H A D | stl_queue.h | 57 bool empty() const { return c.empty(); } function in class:queue 175 bool empty() const { return c.empty(); } function in class:priority_queue
|
H A D | stl_rope.h | 287 // for an otherwise empty base class. 1575 // Assumes the result is not empty. 1605 bool empty() const { return 0 == _M_tree_ptr; } function in class:rope
|
H A D | stl_set.h | 126 bool empty() const { return _M_t.empty(); } function in class:set
|
H A D | stl_slist.h | 425 bool empty() const { return _M_head._M_next == 0; } function in class:slist 840 while (!empty()) { 843 while (__i < __fill && !__counter[__i].empty()) { 913 while (!empty()) { 916 while (__i < __fill && !__counter[__i].empty()) {
|
H A D | stl_stack.h | 57 bool empty() const { return _M_c.empty(); } function in class:stack
|
H A D | stl_tree.h | 433 // having an empty base class, we arbitrarily move one of rb_tree's 698 bool empty() const { return _M_node_count == 0; } function in class:_Rb_tree
|
H A D | stl_vector.h | 217 bool empty() const function in class:vector
|
/haiku/headers/private/kernel/slab/ |
H A D | ObjectDepot.h | 20 DepotMagazine* empty; member in struct:object_depot
|
/haiku/src/add-ons/kernel/drivers/network/wlan/atheroswifi/dev/ath/ath_hal/ |
H A D | ah_eeprom_v14.h | 254 uint8_t empty[2][5]; /* future use */ member in struct:calDataPerFreqOpLoop
|
/haiku/src/add-ons/kernel/file_systems/btrfs/ |
H A D | CachedBlock.h | 34 bool empty); 113 CachedBlock::SetToWritable(off_t block, int32 transactionId, bool empty) argument 118 if (empty) {
|
/haiku/src/add-ons/kernel/file_systems/ext2/ |
H A D | CachedBlock.h | 27 off_t block, bool empty = false); 29 bool empty = false); 40 bool empty); 107 CachedBlock::SetToWritable(Transaction& transaction, off_t block, bool empty) argument 109 return _SetToWritableEtc(transaction.ID(), block, empty); 114 CachedBlock::SetToWritableWithoutTransaction(off_t block, bool empty) argument 116 return _SetToWritableEtc((int32)-1, block, empty); 120 CachedBlock::_SetToWritableEtc(int32 transaction, off_t block, bool empty) argument 125 if (empty) {
|
/haiku/src/add-ons/print/transports/ipp/ |
H A D | IppContent.cpp | 814 if (!file_path.empty()) { 927 if (!file_path.empty()) {
|
/haiku/src/apps/debuganalyzer/gui/table/ |
H A D | TreeTable.cpp | 74 if (fComponents.empty())
|
/haiku/src/apps/icon-o-matic/generic/command/ |
H A D | CommandStack.cpp | 67 if (!fUndoHistory.empty()) { 91 if (!fRedoHistory.empty()) { 113 if (!fUndoHistory.empty()) { 129 if (!fRedoHistory.empty()) { 144 while (!fUndoHistory.empty()) { 148 while (!fRedoHistory.empty()) { 163 if (!fUndoHistory.empty()) 177 saved = fUndoHistory.empty(); 196 if (!fUndoHistory.empty()) { 238 // the redo stack needs to be empty [all...] |