/haiku/headers/libs/print/libprint/ |
H A D | JobSetupDlg.h | 39 const char* Key() const; 76 Range<T, R>::Key() const function in class:Range
|
H A D | PrinterCap.h | 32 const char* Key() const;
|
/haiku/headers/os/app/ |
H A D | KeyStore.h | 9 #include <Key.h>
|
/haiku/headers/os/support/ |
H A D | ObjectList.h | 190 template<typename Key> 191 T* BinarySearchByKey(const Key& key, 192 int (*compare)(const Key*, const T*)) const; 194 template<typename Key> 195 T* BinarySearchByKey(const Key& key, 196 int (*compare)(const Key*, const T*, void*), 205 template<typename Key> 206 int32 BinarySearchIndexByKey(const Key& key, 207 int (*compare)(const Key*, const T*)) const; 729 template<typename Key> 731 BinarySearchByKey(const Key& key, int (*compare)(const Key*, const T*)) const argument 742 BinarySearchByKey(const Key &key, int (*compare)(const Key*, const T*, void*), void* state) const argument 772 BinarySearchIndexByKey(const Key& key, int (*compare)(const Key*, const T*)) const argument [all...] |
/haiku/headers/private/debugger/model/ |
H A D | ExpressionValues.h | 50 struct Key;
|
H A D | StackFrameValueInfos.h | 46 struct Key;
|
H A D | StackFrameValues.h | 42 struct Key;
|
/haiku/headers/private/debugger/util/ |
H A D | Worker.h | 89 virtual const JobKey& Key() const = 0; 181 return HashKey(value->Key()); 186 return value->Key() == key;
|
/haiku/headers/private/kernel/util/ |
H A D | AVLTreeMap.h | 20 template <typename Key, typename Value, 21 typename KeyOrder = Ascending<Key>, 27 inline Node* Allocate(const Key& key, const Value& value) 29 inline const Key GetKey(const Node* node) const 33 inline int CompareKeyNode(const Key& a, const Node* b) 40 #define _AVL_TREE_MAP_TEMPLATE_LIST template<typename Key, typename Value, \ 42 #define _AVL_TREE_MAP_CLASS_NAME AVLTreeMap<Key, Value, NodeStrategy> 46 template<typename Key, typename Value, 47 typename NodeStrategy = AVLTreeMapStrategy::Auto<Key, Value> > 77 Iterator Find(const Key [all...] |
H A D | Heap.h | 17 template<typename Element, typename Key> 22 Key fKey; 25 template<typename Element, typename Key> 28 typedef HeapLink<Element, Key> Link; 37 template<typename Element, typename Key> 40 typedef HeapLink<Element, Key> Link; 46 template<typename Element, typename Key, 47 HeapLink<Element, Key> Element::*LinkMember> 50 typedef HeapLink<Element, Key> Link; 56 template<typename Key> [all...] |
H A D | MinMaxHeap.h | 17 template<typename Element, typename Key> 23 Key fKey; 26 template<typename Element, typename Key> 29 typedef MinMaxHeapLink<Element, Key> Link; 38 template<typename Element, typename Key> 41 typedef MinMaxHeapLink<Element, Key> Link; 47 template<typename Element, typename Key, 48 MinMaxHeapLink<Element, Key> Element::*LinkMember> 51 typedef MinMaxHeapLink<Element, Key> Link; 57 template<typename Key> [all...] |
H A D | SplayTree.h | 48 typedef typename Definition::KeyType Key; typedef in class:SplayTree 74 Key key = Definition::GetKey(node); 97 Node* Remove(const Key& key) 128 Key key = Definition::GetKey(node); 187 Node* Lookup(const Key& key) 211 Node* PreviousDontSplay(const Key& key) const 226 Node* FindClosest(const Key& key, bool greater, bool orEqual) 279 void _Splay(const Key& key) { 355 typedef typename Definition::KeyType Key; typedef in class:IteratableSplayTree 514 Node* Remove(const Key [all...] |
/haiku/headers/private/shared/ |
H A D | HashMap.h | 19 template<typename Key, typename Value> 22 typedef HashMapElement<Key, Value> Element; 33 HashMapElement(const Key& key, const Value& value) 41 Key fKey; 48 template<typename Key, typename Value> 50 typedef Key KeyType; 51 typedef HashMapElement<Key, Value> ValueType; 65 template<typename Key, typename Value> 71 Entry(const Key& key, Value value) : key(key), value(value) {} 73 Key ke [all...] |
H A D | HashSet.h | 19 template<typename Key> 22 typedef HashSetElement<Key> Element; 32 HashSetElement(const Key& key) 39 Key fKey; 45 template<typename Key> 47 typedef Key KeyType; 48 typedef HashSetElement<Key> ValueType; 62 template<typename Key> 67 typedef HashSetElement<Key> Element; 82 Key Nex [all...] |
/haiku/src/add-ons/kernel/drivers/network/wlan/marvell88w8363/dev/mwl/ |
H A D | mwlhal.c | 1200 memcpy(&pCmd->KeyParam.Key, &kv->key, kv->keyLen); 1207 pCmd->KeyParam.Key.TkipKey.TkipRsc.low = 1209 pCmd->KeyParam.Key.TkipKey.TkipRsc.high = 1211 pCmd->KeyParam.Key.TkipKey.TkipTsc.low = 1213 pCmd->KeyParam.Key.TkipKey.TkipTsc.high =
|
/haiku/src/add-ons/kernel/file_systems/packagefs/indices/ |
H A D | AttributeIndex.cpp | 71 typedef TreeKey Key; typedef in struct:AttributeIndex::TreeDefinition 90 int Compare(const Key& a, const Value* b) const
|
/haiku/src/add-ons/kernel/file_systems/ramfs/ |
H A D | TwoKeyAVLTree.h | 40 typedef TwoKeyAVLTreeKey<PrimaryKey, SecondaryKey> Key; typedef in class:TwoKeyAVLTreeKeyCompare 47 inline int operator()(const Key &a, const Key &b) const 66 typedef TwoKeyAVLTreeKey<PrimaryKey, SecondaryKey> Key; typedef in class:TwoKeyAVLTreeGetKey 76 inline Key operator()(const Value &a) const 78 return Key(fGetPrimaryKey(a), fGetSecondaryKey(a)); 104 template<typename Value, typename Key> 108 inline const Key &operator()(const Value &a) const 113 inline Key &operator()(Value &a) const 126 typedef TwoKeyAVLTreeKey<PrimaryKey, SecondaryKey> Key; typedef in class:TwoKeyAVLTreeNodeStrategy 233 typedef TwoKeyAVLTreeKey<PrimaryKey, SecondaryKey> Key; typedef in class:TwoKeyAVLTree [all...] |
/haiku/src/add-ons/kernel/file_systems/reiserfs/ |
H A D | Block.cpp | 30 #include "Key.h" 312 const Key * 315 return (const Key*)((uint8*)fData + sizeof(block_head)); 319 const Key * 322 const Key *k = NULL;
|
H A D | Block.h | 35 class Key; 118 const Key *GetKeys() const; 119 const Key *KeyAt(int32 index) const;
|
H A D | Item.cpp | 179 const Key *
|
H A D | Item.h | 27 #include "Key.h" 39 const Key *GetKey() const { return Key::CastFrom(&ih_key); } 81 const Key *GetKey() const;
|
H A D | Key.h | 0 // Key.h 36 // Key 38 \class Key 46 class Key : private key { class in inherits:key 48 Key() {} function in class:Key 49 Key(const Key &k) : key(k) {} function in class:Key 50 ~Key() {} 52 static Key* CastFrom(key* k) 53 { return static_cast<Key*>( [all...] |
/haiku/src/add-ons/kernel/file_systems/shared/ |
H A D | QueryParserUtils.cpp | 24 template<typename Key> 26 compare_integral(const Key& a, const Key& b)
|
/haiku/src/add-ons/print/drivers/gutenprint/ |
H A D | GPDriver.cpp | 91 parameter = capability->Key();
|
/haiku/src/apps/debugger/user_interface/gui/model/ |
H A D | VariablesViewState.cpp | 105 // #pragma mark - Key 108 struct VariablesViewState::Key { struct in class:VariablesViewState 112 Key(ObjectID* variable, TypeComponentPath* path) function in struct:VariablesViewState::Key 124 bool operator==(const Key& other) const 134 struct VariablesViewState::InfoEntry : Key, VariablesViewNodeInfo { 139 Key(variable, path) 159 typedef Key KeyType; 162 size_t HashKey(const Key& key) const 172 bool Compare(const Key& key, const InfoEntry* value) const 245 return fNodeInfos->Lookup(Key(variabl [all...] |