headers/libs/print/libprint/JobSetupDlg.h

39

const char* Key() const;

headers/libs/print/libprint/PrinterCap.h

32

const char* Key() const;

headers/os/support/ObjectList.h

189

template<typename Key>

headers/os/support/ObjectList.h

190

T* BinarySearchByKey(const Key& key,

headers/os/support/ObjectList.h

191

int (*compare)(const Key*, const T*)) const;

headers/os/support/ObjectList.h

193

template<typename Key>

headers/os/support/ObjectList.h

194

T* BinarySearchByKey(const Key& key,

headers/os/support/ObjectList.h

195

int (*compare)(const Key*, const T*, void*),

headers/os/support/ObjectList.h

204

template<typename Key>

headers/os/support/ObjectList.h

205

int32 BinarySearchIndexByKey(const Key& key,

headers/os/support/ObjectList.h

206

int (*compare)(const Key*, const T*)) const;

headers/os/support/ObjectList.h

721

template<typename Key>

headers/os/support/ObjectList.h

723

BObjectList<T, O>::BinarySearchByKey(const Key& key,

headers/os/support/ObjectList.h

724

int (*compare)(const Key*, const T*)) const

headers/os/support/ObjectList.h

732

template<typename Key>

headers/os/support/ObjectList.h

734

BObjectList<T, O>::BinarySearchByKey(const Key &key,

headers/os/support/ObjectList.h

735

int (*compare)(const Key*, const T*, void*), void* state) const

headers/os/support/ObjectList.h

762

template<typename Key>

headers/os/support/ObjectList.h

764

BObjectList<T, O>::BinarySearchIndexByKey(const Key& key,

headers/os/support/ObjectList.h

765

int (*compare)(const Key*, const T*)) const

headers/private/debugger/model/ExpressionValues.h

50

struct Key;

headers/private/debugger/model/StackFrameValueInfos.h

46

struct Key;

headers/private/debugger/model/StackFrameValues.h

42

struct Key;

headers/private/debugger/util/Worker.h

181

return HashKey(value->Key());

headers/private/debugger/util/Worker.h

186

return value->Key() == key;

headers/private/debugger/util/Worker.h

89

virtual const JobKey& Key() const = 0;

headers/private/kernel/util/AVLTree.h

29

typedef typename Definition::Key Key;

headers/private/kernel/util/AVLTree.h

335

AVLTree<Definition>::Find(const Key& key) const

headers/private/kernel/util/AVLTree.h

345

AVLTree<Definition>::FindClosest(const Key& key, bool less) const

headers/private/kernel/util/AVLTree.h

371

AVLTree<Definition>::Remove(const Key& key)

headers/private/kernel/util/AVLTree.h

391

return _Compare(*(const Key*)key, _GetValue(node));

headers/private/kernel/util/AVLTree.h

422

AVLTree<Definition>::_Compare(const Key& a, const Value* b)

headers/private/kernel/util/AVLTree.h

61

Value* Find(const Key& key) const;

headers/private/kernel/util/AVLTree.h

62

Value* FindClosest(const Key& key, bool less) const;

headers/private/kernel/util/AVLTree.h

65

Value* Remove(const Key& key);

headers/private/kernel/util/AVLTree.h

80

inline int _Compare(const Key& a, const Value* b);

headers/private/kernel/util/AVLTreeMap.h

101

inline Key _GetKey(Node* node) const;

headers/private/kernel/util/AVLTreeMap.h

105

inline int _CompareKeyNode(const Key& a, const Node* b);

headers/private/kernel/util/AVLTreeMap.h

173

inline Key CurrentKey()

headers/private/kernel/util/AVLTreeMap.h

177

return Key();

headers/private/kernel/util/AVLTreeMap.h

20

template <typename Key, typename Value,

headers/private/kernel/util/AVLTreeMap.h

21

typename KeyOrder = Ascending<Key>,

headers/private/kernel/util/AVLTreeMap.h

352

_AVL_TREE_MAP_CLASS_NAME::Find(const Key& key)

headers/private/kernel/util/AVLTreeMap.h

363

_AVL_TREE_MAP_CLASS_NAME::FindClose(const Key& key, bool less)

headers/private/kernel/util/AVLTreeMap.h

374

_AVL_TREE_MAP_CLASS_NAME::Insert(const Key& key, const Value& value,

headers/private/kernel/util/AVLTreeMap.h

40

#define _AVL_TREE_MAP_TEMPLATE_LIST template<typename Key, typename Value, \

headers/private/kernel/util/AVLTreeMap.h

400

_AVL_TREE_MAP_CLASS_NAME::Insert(const Key& key, const Value& value,

headers/private/kernel/util/AVLTreeMap.h

42

#define _AVL_TREE_MAP_CLASS_NAME AVLTreeMap<Key, Value, NodeStrategy>

headers/private/kernel/util/AVLTreeMap.h

426

_AVL_TREE_MAP_CLASS_NAME::Remove(const Key& key)

headers/private/kernel/util/AVLTreeMap.h

456

return _CompareKeyNode(*(const Key*)key, _GetNode(node));

headers/private/kernel/util/AVLTreeMap.h

46

template<typename Key, typename Value,

headers/private/kernel/util/AVLTreeMap.h

47

typename NodeStrategy = AVLTreeMapStrategy::Auto<Key, Value> >

headers/private/kernel/util/AVLTreeMap.h

473

_AVL_TREE_MAP_CLASS_NAME::_Allocate(const Key& key, const Value& value)

headers/private/kernel/util/AVLTreeMap.h

490

inline Key

headers/private/kernel/util/AVLTreeMap.h

527

_AVL_TREE_MAP_CLASS_NAME::_CompareKeyNode(const Key& a, const Node* b)

headers/private/kernel/util/AVLTreeMap.h

596

template <typename Key, typename Value, typename KeyOrder,

headers/private/kernel/util/AVLTreeMap.h

601

Node(const Key &key, const Value &value)

headers/private/kernel/util/AVLTreeMap.h

608

Key key;

headers/private/kernel/util/AVLTreeMap.h

612

inline Node* Allocate(const Key& key, const Value& value)

headers/private/kernel/util/AVLTreeMap.h

626

inline const Key& GetKey(const Node* node) const

headers/private/kernel/util/AVLTreeMap.h

646

inline int CompareKeyNode(const Key& a, const Node* b) const

headers/private/kernel/util/AVLTreeMap.h

77

Iterator Find(const Key& key);

headers/private/kernel/util/AVLTreeMap.h

78

Iterator FindClose(const Key& key, bool less);

headers/private/kernel/util/AVLTreeMap.h

80

status_t Insert(const Key& key, const Value& value,

headers/private/kernel/util/AVLTreeMap.h

82

status_t Insert(const Key& key, const Value& value,

headers/private/kernel/util/AVLTreeMap.h

84

status_t Remove(const Key& key);

headers/private/kernel/util/AVLTreeMap.h

99

inline Node* _Allocate(const Key& key, const Value& value);

headers/private/kernel/util/Heap.h

106

template<typename Element, typename Key>

headers/private/kernel/util/Heap.h

107

HeapLink<Element, Key>::HeapLink()

headers/private/kernel/util/Heap.h

113

template<typename Element, typename Key>

headers/private/kernel/util/Heap.h

114

HeapLink<Element, Key>::HeapLink()

headers/private/kernel/util/Heap.h

120

template<typename Element, typename Key>

headers/private/kernel/util/Heap.h

121

HeapLink<Element, Key>*

headers/private/kernel/util/Heap.h

122

HeapLinkImpl<Element, Key>::GetHeapLink()

headers/private/kernel/util/Heap.h

128

template<typename Element, typename Key>

headers/private/kernel/util/Heap.h

129

HeapLink<Element, Key>*

headers/private/kernel/util/Heap.h

130

HeapStandardGetLink<Element, Key>::operator()(Element* element) const

headers/private/kernel/util/Heap.h

136

template<typename Element, typename Key,

headers/private/kernel/util/Heap.h

137

HeapLink<Element, Key> Element::*LinkMember>

headers/private/kernel/util/Heap.h

138

HeapLink<Element, Key>*

headers/private/kernel/util/Heap.h

139

HeapMemberGetLink<Element, Key, LinkMember>::operator()(Element* element) const

headers/private/kernel/util/Heap.h

145

template<typename Key>

headers/private/kernel/util/Heap.h

147

HeapLesserCompare<Key>::operator()(Key a, Key b)

headers/private/kernel/util/Heap.h

153

template<typename Key>

headers/private/kernel/util/Heap.h

155

HeapGreaterCompare<Key>::operator()(Key a, Key b)

headers/private/kernel/util/Heap.h

17

template<typename Element, typename Key>

headers/private/kernel/util/Heap.h

200

const Key&

headers/private/kernel/util/Heap.h

209

HEAP_CLASS_NAME::ModifyKey(Element* element, Key newKey)

headers/private/kernel/util/Heap.h

211

HeapLink<Element, Key>* link = sGetLink(element);

headers/private/kernel/util/Heap.h

214

Key oldKey = link->fKey;

headers/private/kernel/util/Heap.h

22

Key fKey;

headers/private/kernel/util/Heap.h

232

HeapLink<Element, Key>* link = sGetLink(element);

headers/private/kernel/util/Heap.h

249

HEAP_CLASS_NAME::Insert(Element* element, Key key)

headers/private/kernel/util/Heap.h

25

template<typename Element, typename Key>

headers/private/kernel/util/Heap.h

259

HeapLink<Element, Key>* link = sGetLink(element);

headers/private/kernel/util/Heap.h

28

typedef HeapLink<Element, Key> Link;

headers/private/kernel/util/Heap.h

293

HEAP_CLASS_NAME::_MoveUp(HeapLink<Element, Key>* link)

headers/private/kernel/util/Heap.h

315

HEAP_CLASS_NAME::_MoveDown(HeapLink<Element, Key>* link)

headers/private/kernel/util/Heap.h

37

template<typename Element, typename Key>

headers/private/kernel/util/Heap.h

40

typedef HeapLink<Element, Key> Link;

headers/private/kernel/util/Heap.h

46

template<typename Element, typename Key,

headers/private/kernel/util/Heap.h

47

HeapLink<Element, Key> Element::*LinkMember>

headers/private/kernel/util/Heap.h

50

typedef HeapLink<Element, Key> Link;

headers/private/kernel/util/Heap.h

56

template<typename Key>

headers/private/kernel/util/Heap.h

59

inline bool operator()(Key a, Key b);

headers/private/kernel/util/Heap.h

62

template<typename Key>

headers/private/kernel/util/Heap.h

65

inline bool operator()(Key a, Key b);

headers/private/kernel/util/Heap.h

69

template<typename Element, typename Key, typename Compare, typename GetLink>

headers/private/kernel/util/Heap.h

70

#define HEAP_CLASS_NAME Heap<Element, Key, Compare, GetLink>

headers/private/kernel/util/Heap.h

72

template<typename Element, typename Key,

headers/private/kernel/util/Heap.h

73

typename Compare = HeapLesserCompare<Key>,

headers/private/kernel/util/Heap.h

74

typename GetLink = HeapStandardGetLink<Element, Key> >

headers/private/kernel/util/Heap.h

83

static const Key& GetKey(Element* element);

headers/private/kernel/util/Heap.h

85

inline void ModifyKey(Element* element, Key newKey);

headers/private/kernel/util/Heap.h

88

inline status_t Insert(Element* element, Key key);

headers/private/kernel/util/Heap.h

93

void _MoveUp(HeapLink<Element, Key>* link);

headers/private/kernel/util/Heap.h

94

void _MoveDown(HeapLink<Element, Key>* link);

headers/private/kernel/util/MinMaxHeap.h

111

template<typename Element, typename Key>

headers/private/kernel/util/MinMaxHeap.h

112

MinMaxHeapLink<Element, Key>::MinMaxHeapLink()

headers/private/kernel/util/MinMaxHeap.h

118

template<typename Element, typename Key>

headers/private/kernel/util/MinMaxHeap.h

119

MinMaxHeapLink<Element, Key>::MinMaxHeapLink()

headers/private/kernel/util/MinMaxHeap.h

125

template<typename Element, typename Key>

headers/private/kernel/util/MinMaxHeap.h

126

MinMaxHeapLink<Element, Key>*

headers/private/kernel/util/MinMaxHeap.h

127

MinMaxHeapLinkImpl<Element, Key>::GetMinMaxHeapLink()

headers/private/kernel/util/MinMaxHeap.h

133

template<typename Element, typename Key>

headers/private/kernel/util/MinMaxHeap.h

134

MinMaxHeapLink<Element, Key>*

headers/private/kernel/util/MinMaxHeap.h

135

MinMaxHeapStandardGetLink<Element, Key>::operator()(Element* element) const

headers/private/kernel/util/MinMaxHeap.h

141

template<typename Element, typename Key,

headers/private/kernel/util/MinMaxHeap.h

142

MinMaxHeapLink<Element, Key> Element::*LinkMember>

headers/private/kernel/util/MinMaxHeap.h

143

MinMaxHeapLink<Element, Key>*

headers/private/kernel/util/MinMaxHeap.h

144

MinMaxHeapMemberGetLink<Element, Key, LinkMember>::operator()(

headers/private/kernel/util/MinMaxHeap.h

151

template<typename Key>

headers/private/kernel/util/MinMaxHeap.h

153

MinMaxHeapCompare<Key>::operator()(Key a, Key b)

headers/private/kernel/util/MinMaxHeap.h

17

template<typename Element, typename Key>

headers/private/kernel/util/MinMaxHeap.h

220

const Key&

headers/private/kernel/util/MinMaxHeap.h

229

MIN_MAX_HEAP_CLASS_NAME::ModifyKey(Element* element, Key newKey)

headers/private/kernel/util/MinMaxHeap.h

23

Key fKey;

headers/private/kernel/util/MinMaxHeap.h

231

MinMaxHeapLink<Element, Key>* link = sGetLink(element);

headers/private/kernel/util/MinMaxHeap.h

233

Key oldKey = link->fKey;

headers/private/kernel/util/MinMaxHeap.h

258

MinMaxHeapLink<Element, Key>* link = sGetLink(element);

headers/private/kernel/util/MinMaxHeap.h

26

template<typename Element, typename Key>

headers/private/kernel/util/MinMaxHeap.h

279

MinMaxHeapLink<Element, Key>* link = sGetLink(element);

headers/private/kernel/util/MinMaxHeap.h

29

typedef MinMaxHeapLink<Element, Key> Link;

headers/private/kernel/util/MinMaxHeap.h

290

MIN_MAX_HEAP_CLASS_NAME::Insert(Element* element, Key key)

headers/private/kernel/util/MinMaxHeap.h

301

MinMaxHeapLink<Element, Key>* link = sGetLink(element);

headers/private/kernel/util/MinMaxHeap.h

347

MIN_MAX_HEAP_CLASS_NAME::_MoveUp(MinMaxHeapLink<Element, Key>* link)

headers/private/kernel/util/MinMaxHeap.h

373

MIN_MAX_HEAP_CLASS_NAME::_MoveDown(MinMaxHeapLink<Element, Key>* link)

headers/private/kernel/util/MinMaxHeap.h

38

template<typename Element, typename Key>

headers/private/kernel/util/MinMaxHeap.h

41

typedef MinMaxHeapLink<Element, Key> Link;

headers/private/kernel/util/MinMaxHeap.h

417

MIN_MAX_HEAP_CLASS_NAME::_ChangeTree(MinMaxHeapLink<Element, Key>* link)

headers/private/kernel/util/MinMaxHeap.h

442

MinMaxHeapLink<Element, Key>* predecessorLink = sGetLink(predecessor);

headers/private/kernel/util/MinMaxHeap.h

47

template<typename Element, typename Key,

headers/private/kernel/util/MinMaxHeap.h

48

MinMaxHeapLink<Element, Key> Element::*LinkMember>

headers/private/kernel/util/MinMaxHeap.h

486

MinMaxHeapLink<Element, Key>* link = sGetLink(element);

headers/private/kernel/util/MinMaxHeap.h

51

typedef MinMaxHeapLink<Element, Key> Link;

headers/private/kernel/util/MinMaxHeap.h

57

template<typename Key>

headers/private/kernel/util/MinMaxHeap.h

60

inline bool operator()(Key a, Key b);

headers/private/kernel/util/MinMaxHeap.h

64

template<typename Element, typename Key, typename Compare, typename GetLink>

headers/private/kernel/util/MinMaxHeap.h

65

#define MIN_MAX_HEAP_CLASS_NAME MinMaxHeap<Element, Key, Compare, GetLink>

headers/private/kernel/util/MinMaxHeap.h

67

template<typename Element, typename Key,

headers/private/kernel/util/MinMaxHeap.h

68

typename Compare = MinMaxHeapCompare<Key>,

headers/private/kernel/util/MinMaxHeap.h

69

typename GetLink = MinMaxHeapStandardGetLink<Element, Key> >

headers/private/kernel/util/MinMaxHeap.h

79

static const Key& GetKey(Element* element);

headers/private/kernel/util/MinMaxHeap.h

81

inline void ModifyKey(Element* element, Key newKey);

headers/private/kernel/util/MinMaxHeap.h

86

inline status_t Insert(Element* element, Key key);

headers/private/kernel/util/MinMaxHeap.h

91

void _MoveUp(MinMaxHeapLink<Element, Key>* link);

headers/private/kernel/util/MinMaxHeap.h

92

void _MoveDown(MinMaxHeapLink<Element, Key>* link);

headers/private/kernel/util/MinMaxHeap.h

93

bool _ChangeTree(MinMaxHeapLink<Element, Key>* link);

headers/private/kernel/util/VectorMap.h

100

Iterator FindClose(const Key &key, bool less);

headers/private/kernel/util/VectorMap.h

101

ConstIterator FindClose(const Key &key, bool less) const;

headers/private/kernel/util/VectorMap.h

104

int32 _FindInsertionIndex(const Key &key, bool &exists) const;

headers/private/kernel/util/VectorMap.h

129

inline KeyReference Key() const

headers/private/kernel/util/VectorMap.h

19

template<typename Key, typename Value,

headers/private/kernel/util/VectorMap.h

20

typename KeyOrder = KernelUtilsOrder::Ascending<Key> > class Pair;

headers/private/kernel/util/VectorMap.h

22

template<typename Key, typename Value, typename GetKey,

headers/private/kernel/util/VectorMap.h

23

typename KeyOrder = KernelUtilsOrder::Ascending<Key> >

headers/private/kernel/util/VectorMap.h

299

_VECTOR_MAP_CLASS_NAME::Insert(const Key &key, const Value &value)

headers/private/kernel/util/VectorMap.h

318

_VECTOR_MAP_CLASS_NAME::Put(const Key &key, const Value &value)

headers/private/kernel/util/VectorMap.h

33

#define _VECTOR_MAP_TEMPLATE_LIST template<typename Key, typename Value, \

headers/private/kernel/util/VectorMap.h

334

_VECTOR_MAP_CLASS_NAME::Get(const Key &key)

headers/private/kernel/util/VectorMap.h

35

#define _VECTOR_MAP_CLASS_NAME VectorMap<Key, Value, EntryStrategy>

headers/private/kernel/util/VectorMap.h

354

_VECTOR_MAP_CLASS_NAME::Get(const Key &key) const

headers/private/kernel/util/VectorMap.h

36

#define _VECTOR_MAP_CLASS_TYPE typename VectorMap<Key, Value, EntryStrategy>

headers/private/kernel/util/VectorMap.h

371

_VECTOR_MAP_CLASS_NAME::Remove(const Key &key)

headers/private/kernel/util/VectorMap.h

51

template<typename Key, typename Value,

headers/private/kernel/util/VectorMap.h

52

typename EntryStrategy = VectorMapEntryStrategy::Pair<Key, Value> >

headers/private/kernel/util/VectorMap.h

535

_VECTOR_MAP_CLASS_NAME::Find(const Key &key)

headers/private/kernel/util/VectorMap.h

553

_VECTOR_MAP_CLASS_NAME::Find(const Key &key) const

headers/private/kernel/util/VectorMap.h

587

_VECTOR_MAP_CLASS_NAME::FindClose(const Key &key, bool less)

headers/private/kernel/util/VectorMap.h

628

_VECTOR_MAP_CLASS_NAME::FindClose(const Key &key, bool less) const

headers/private/kernel/util/VectorMap.h

655

_VECTOR_MAP_CLASS_NAME::_FindInsertionIndex(const Key &key,

headers/private/kernel/util/VectorMap.h

681

template<typename Key, typename Value, typename KeyOrder>

headers/private/kernel/util/VectorMap.h

684

typedef const Key &KeyReference;

headers/private/kernel/util/VectorMap.h

688

Entry(const Key &key, const Value &value)

headers/private/kernel/util/VectorMap.h

691

Key key;

headers/private/kernel/util/VectorMap.h

710

inline Entry MakeEntry(const Key &key, const Value &value) const

headers/private/kernel/util/VectorMap.h

715

inline bool AreCompatible(const Key &, const Value &) const

headers/private/kernel/util/VectorMap.h

720

inline int Compare(const Key &a, const Key &b) const

headers/private/kernel/util/VectorMap.h

730

template<typename Key, typename Value, typename _GetKey, typename KeyOrder>

headers/private/kernel/util/VectorMap.h

733

typedef Key KeyReference;

headers/private/kernel/util/VectorMap.h

751

inline Entry MakeEntry(const Key &, const Value &value) const

headers/private/kernel/util/VectorMap.h

756

inline bool AreCompatible(const Key &key, const Value &value) const

headers/private/kernel/util/VectorMap.h

761

inline int Compare(const Key &a, const Key &b) const

headers/private/kernel/util/VectorMap.h

79

status_t Insert(const Key &key, const Value &value);

headers/private/kernel/util/VectorMap.h

80

status_t Put(const Key &key, const Value &value);

headers/private/kernel/util/VectorMap.h

81

Value &Get(const Key &key);

headers/private/kernel/util/VectorMap.h

82

const Value &Get(const Key &key) const;

headers/private/kernel/util/VectorMap.h

84

int32 Remove(const Key &key);

headers/private/kernel/util/VectorMap.h

98

Iterator Find(const Key &key);

headers/private/kernel/util/VectorMap.h

99

ConstIterator Find(const Key &key) const;

headers/private/shared/HashMap.h

112

Iterator(const HashMap<Key, Value>* map)

headers/private/shared/HashMap.h

121

friend class HashMap<Key, Value>;

headers/private/shared/HashMap.h

125

const HashMap<Key, Value>* fMap;

headers/private/shared/HashMap.h

135

status_t Put(const Key& key, const Value& value);

headers/private/shared/HashMap.h

136

Value Remove(const Key& key);

headers/private/shared/HashMap.h

139

Value Get(const Key& key) const;

headers/private/shared/HashMap.h

140

bool Get(const Key& key, Value*& _value) const;

headers/private/shared/HashMap.h

142

bool ContainsKey(const Key& key) const;

headers/private/shared/HashMap.h

159

template<typename Key, typename Value, typename Locker = BLocker>

headers/private/shared/HashMap.h

173

status_t Put(const Key& key, const Value& value)

headers/private/shared/HashMap.h

181

Value Remove(const Key& key)

headers/private/shared/HashMap.h

19

template<typename Key, typename Value>

headers/private/shared/HashMap.h

203

Value Get(const Key& key) const

headers/private/shared/HashMap.h

212

bool ContainsKey(const Key& key) const

headers/private/shared/HashMap.h

234

const HashMap<Key, Value>& GetUnsynchronizedMap() const { return fMap; }

headers/private/shared/HashMap.h

235

HashMap<Key, Value>& GetUnsynchronizedMap() { return fMap; }

headers/private/shared/HashMap.h

240

HashMap<Key, Value> fMap;

headers/private/shared/HashMap.h

33

HashMapElement(const Key& key, const Value& value)

headers/private/shared/HashMap.h

347

template<typename Key, typename Value>

headers/private/shared/HashMap.h

348

HashMap<Key, Value>::HashMap()

headers/private/shared/HashMap.h

357

template<typename Key, typename Value>

headers/private/shared/HashMap.h

358

HashMap<Key, Value>::~HashMap()

headers/private/shared/HashMap.h

365

template<typename Key, typename Value>

headers/private/shared/HashMap.h

367

HashMap<Key, Value>::InitCheck() const

headers/private/shared/HashMap.h

374

template<typename Key, typename Value>

headers/private/shared/HashMap.h

376

HashMap<Key, Value>::Put(const Key& key, const Value& value)

headers/private/shared/HashMap.h

399

template<typename Key, typename Value>

headers/private/shared/HashMap.h

401

HashMap<Key, Value>::Remove(const Key& key)

headers/private/shared/HashMap.h

41

Key fKey;

headers/private/shared/HashMap.h

416

template<typename Key, typename Value>

headers/private/shared/HashMap.h

418

HashMap<Key, Value>::Remove(Iterator& it)

headers/private/shared/HashMap.h

435

template<typename Key, typename Value>

headers/private/shared/HashMap.h

437

HashMap<Key, Value>::Clear()

headers/private/shared/HashMap.h

450

template<typename Key, typename Value>

headers/private/shared/HashMap.h

452

HashMap<Key, Value>::Get(const Key& key) const

headers/private/shared/HashMap.h

461

template<typename Key, typename Value>

headers/private/shared/HashMap.h

463

HashMap<Key, Value>::Get(const Key& key, Value*& _value) const

headers/private/shared/HashMap.h

474

template<typename Key, typename Value>

headers/private/shared/HashMap.h

476

HashMap<Key, Value>::ContainsKey(const Key& key) const

headers/private/shared/HashMap.h

48

template<typename Key, typename Value>

headers/private/shared/HashMap.h

483

template<typename Key, typename Value>

headers/private/shared/HashMap.h

485

HashMap<Key, Value>::Size() const

headers/private/shared/HashMap.h

492

template<typename Key, typename Value>

headers/private/shared/HashMap.h

493

typename HashMap<Key, Value>::Iterator

headers/private/shared/HashMap.h

494

HashMap<Key, Value>::GetIterator() const

headers/private/shared/HashMap.h

50

typedef Key KeyType;

headers/private/shared/HashMap.h

65

template<typename Key, typename Value>

headers/private/shared/HashMap.h

71

Entry(const Key& key, Value value) : key(key), value(value) {}

headers/private/shared/HashMap.h

73

Key key;

headers/private/shared/HashSet.h

100

Iterator(const HashSet<Key>* set)

headers/private/shared/HashSet.h

109

typedef BOpenHashTable<HashSetTableDefinition<Key> > ElementTable;

headers/private/shared/HashSet.h

111

const HashSet<Key>* fSet;

headers/private/shared/HashSet.h

116

friend class HashSet<Key>;

headers/private/shared/HashSet.h

124

status_t Add(const Key& key);

headers/private/shared/HashSet.h

125

bool Remove(const Key& key);

headers/private/shared/HashSet.h

128

bool Contains(const Key& key) const;

headers/private/shared/HashSet.h

135

typedef BOpenHashTable<HashSetTableDefinition<Key> > ElementTable;

headers/private/shared/HashSet.h

136

typedef HashSetElement<Key> Element;

headers/private/shared/HashSet.h

145

template<typename Key, typename Locker = BLocker>

headers/private/shared/HashSet.h

148

typedef typename HashSet<Key>::Iterator Iterator;

headers/private/shared/HashSet.h

158

status_t Add(const Key& key)

headers/private/shared/HashSet.h

166

bool Remove(const Key& key)

headers/private/shared/HashSet.h

180

bool Contains(const Key& key) const

headers/private/shared/HashSet.h

19

template<typename Key>

headers/private/shared/HashSet.h

202

const HashSet<Key>& GetUnsynchronizedSet() const { return fSet; }

headers/private/shared/HashSet.h

203

HashSet<Key>& GetUnsynchronizedSet() { return fSet; }

headers/private/shared/HashSet.h

208

HashSet<Key> fSet;

headers/private/shared/HashSet.h

215

template<typename Key>

headers/private/shared/HashSet.h

216

HashSet<Key>::HashSet()

headers/private/shared/HashSet.h

22

typedef HashSetElement<Key> Element;

headers/private/shared/HashSet.h

225

template<typename Key>

headers/private/shared/HashSet.h

226

HashSet<Key>::~HashSet()

headers/private/shared/HashSet.h

233

template<typename Key>

headers/private/shared/HashSet.h

235

HashSet<Key>::InitCheck() const

headers/private/shared/HashSet.h

242

template<typename Key>

headers/private/shared/HashSet.h

244

HashSet<Key>::Add(const Key& key)

headers/private/shared/HashSet.h

266

template<typename Key>

headers/private/shared/HashSet.h

268

HashSet<Key>::Remove(const Key& key)

headers/private/shared/HashSet.h

282

template<typename Key>

headers/private/shared/HashSet.h

284

HashSet<Key>::Remove(Iterator& it)

headers/private/shared/HashSet.h

299

template<typename Key>

headers/private/shared/HashSet.h

301

HashSet<Key>::Clear()

headers/private/shared/HashSet.h

314

template<typename Key>

headers/private/shared/HashSet.h

316

HashSet<Key>::Contains(const Key& key) const

headers/private/shared/HashSet.h

32

HashSetElement(const Key& key)

headers/private/shared/HashSet.h

323

template<typename Key>

headers/private/shared/HashSet.h

325

HashSet<Key>::Size() const

headers/private/shared/HashSet.h

332

template<typename Key>

headers/private/shared/HashSet.h

333

typename HashSet<Key>::Iterator

headers/private/shared/HashSet.h

334

HashSet<Key>::GetIterator() const

headers/private/shared/HashSet.h

39

Key fKey;

headers/private/shared/HashSet.h

45

template<typename Key>

headers/private/shared/HashSet.h

47

typedef Key KeyType;

headers/private/shared/HashSet.h

48

typedef HashSetElement<Key> ValueType;

headers/private/shared/HashSet.h

62

template<typename Key>

headers/private/shared/HashSet.h

67

typedef HashSetElement<Key> Element;

headers/private/shared/HashSet.h

82

Key Next()

headers/private/shared/HashSet.h

86

return Key();

headers/private/shared/LRUCache.h

102

Value Remove(const Key& key)

headers/private/shared/LRUCache.h

125

Value Get(const Key& key)

headers/private/shared/LRUCache.h

135

bool ContainsKey(const Key& key) const

headers/private/shared/LRUCache.h

15

template<typename Key, typename Value>

headers/private/shared/LRUCache.h

197

HashMap<Key, LRUNode*> fMap;

headers/private/shared/LRUCache.h

30

LRUOrderingNode(const Key& key, const Value& value)

headers/private/shared/LRUCache.h

39

Key fKey;

headers/private/shared/LRUCache.h

52

template<typename Key, typename Value>

headers/private/shared/LRUCache.h

77

status_t Put(const Key& key, const Value& value)

headers/private/util/AtomicsHashTable.h

43

KeyType key = HashTable::fDefinition.Key(value);

headers/private/util/SplayTree.h

128

Key key = Definition::GetKey(node);

headers/private/util/SplayTree.h

187

Node* Lookup(const Key& key)

headers/private/util/SplayTree.h

211

Node* PreviousDontSplay(const Key& key) const

headers/private/util/SplayTree.h

226

Node* FindClosest(const Key& key, bool greater, bool orEqual)

headers/private/util/SplayTree.h

279

void _Splay(const Key& key) {

headers/private/util/SplayTree.h

514

Node* Remove(const Key& key)

headers/private/util/SplayTree.h

547

Node* Lookup(const Key& key)

headers/private/util/SplayTree.h

566

Node* PreviousDontSplay(const Key& key)

headers/private/util/SplayTree.h

571

Node* FindClosest(const Key& key, bool greater, bool orEqual)

headers/private/util/SplayTree.h

596

Iterator GetIterator(const Key& key, bool greater, bool orEqual)

headers/private/util/SplayTree.h

601

ConstIterator GetIterator(const Key& key, bool greater, bool orEqual) const

headers/private/util/SplayTree.h

74

Key key = Definition::GetKey(node);

headers/private/util/SplayTree.h

97

Node* Remove(const Key& key)

src/add-ons/kernel/bus_managers/pci/pci.cpp

594

*virtualBus = it->Key();

src/add-ons/kernel/drivers/network/ether/usb_davicom/DavicomDevice.h

71

inline uint32 Key() { return fIds[0] << 16 | fIds[1]; }

src/add-ons/kernel/drivers/network/ether/usb_davicom/Driver.cpp

70

((gSupportedDevices[i].Key() < id) ? left : right) = i;

src/add-ons/kernel/drivers/network/ether/usb_davicom/Driver.cpp

73

if (gSupportedDevices[right].Key() == id)

src/add-ons/kernel/drivers/network/wlan/marvell88w8363/dev/mwl/mwlhal.c

1196

memcpy(&pCmd->KeyParam.Key, &kv->key, kv->keyLen);

src/add-ons/kernel/drivers/network/wlan/marvell88w8363/dev/mwl/mwlhal.c

1203

pCmd->KeyParam.Key.TkipKey.TkipRsc.low =

src/add-ons/kernel/drivers/network/wlan/marvell88w8363/dev/mwl/mwlhal.c

1205

pCmd->KeyParam.Key.TkipKey.TkipRsc.high =

src/add-ons/kernel/drivers/network/wlan/marvell88w8363/dev/mwl/mwlhal.c

1207

pCmd->KeyParam.Key.TkipKey.TkipTsc.low =

src/add-ons/kernel/drivers/network/wlan/marvell88w8363/dev/mwl/mwlhal.c

1209

pCmd->KeyParam.Key.TkipKey.TkipTsc.high =

src/add-ons/kernel/drivers/network/wlan/marvell88w8363/dev/mwl/mwlreg.h

1111

}__packed Key;

src/add-ons/kernel/file_systems/btrfs/BTree.h

297

btrfs_key Key() const { return fKey; }

src/add-ons/kernel/file_systems/btrfs/ExtentAllocator.cpp

456

key = iterator.Key();

src/add-ons/kernel/file_systems/btrfs/ExtentAllocator.h

67

int Compare(const Key& a, const Value* b) const

src/add-ons/kernel/file_systems/ntfs/libntfs/win32_io.c

233

PULONG Key

src/add-ons/kernel/file_systems/ntfs/libntfs/win32_io.c

245

PULONG Key

src/add-ons/kernel/file_systems/packagefs/indices/AttributeIndex.cpp

90

int Compare(const Key& a, const Value* b) const

src/add-ons/kernel/file_systems/packagefs/util/TwoKeyAVLTree.h

123

template<typename Value, typename Key>

src/add-ons/kernel/file_systems/packagefs/util/TwoKeyAVLTree.h

126

inline const Key& operator()(const Value& a) const

src/add-ons/kernel/file_systems/packagefs/util/TwoKeyAVLTree.h

131

inline Key& operator()(Value& a) const

src/add-ons/kernel/file_systems/packagefs/util/TwoKeyAVLTree.h

194

inline Node* Allocate(const Key& key, const Value& value) const

src/add-ons/kernel/file_systems/packagefs/util/TwoKeyAVLTree.h

205

inline Key GetValueKey(const Value& value) const

src/add-ons/kernel/file_systems/packagefs/util/TwoKeyAVLTree.h

207

return Key(fGetPrimaryKey(value), fGetSecondaryKey(value));

src/add-ons/kernel/file_systems/packagefs/util/TwoKeyAVLTree.h

210

inline Key GetKey(Node* node) const

src/add-ons/kernel/file_systems/packagefs/util/TwoKeyAVLTree.h

230

inline int CompareKeyNode(const Key& a, const Node* b) const

src/add-ons/kernel/file_systems/packagefs/util/TwoKeyAVLTree.h

242

inline int _CompareKeys(const Key& a, const Key& b) const

src/add-ons/kernel/file_systems/packagefs/util/TwoKeyAVLTree.h

549

TreeMapIterator it = fTreeMap.Find(Key(primaryKey, secondaryKey));

src/add-ons/kernel/file_systems/packagefs/util/TwoKeyAVLTree.h

60

inline int operator()(const Key& a, const Key& b) const

src/add-ons/kernel/file_systems/packagefs/util/TwoKeyAVLTree.h

608

return fTreeMap.Remove(Key(primaryKey, secondaryKey));

src/add-ons/kernel/file_systems/packagefs/util/TwoKeyAVLTree.h

92

inline Key operator()(const Value& a) const

src/add-ons/kernel/file_systems/packagefs/util/TwoKeyAVLTree.h

94

return Key(fGetPrimaryKey(a), fGetSecondaryKey(a));

src/add-ons/kernel/file_systems/ramfs/AttributeIndexImpl.cpp

24

template<typename Key>

src/add-ons/kernel/file_systems/ramfs/AttributeIndexImpl.cpp

27

compare_integral(const Key &a, const Key &b)

src/add-ons/kernel/file_systems/ramfs/DirectoryEntryTable.h

138

Entry* child = fTable.Lookup(DirectoryEntryHash::Key(id, name));

src/add-ons/kernel/file_systems/ramfs/DirectoryEntryTable.h

148

Entry *child = fTable.Lookup(DirectoryEntryHash::Key(id, name));

src/add-ons/kernel/file_systems/ramfs/DirectoryEntryTable.h

21

Key(ino_t i, const char* n) : id(i), name(n) {}

src/add-ons/kernel/file_systems/ramfs/DirectoryEntryTable.h

23

typedef Key KeyType;

src/add-ons/kernel/file_systems/ramfs/DirectoryEntryTable.h

33

return HashKey(Key(value->GetParent()->GetID(), value->GetName()));

src/add-ons/kernel/file_systems/ramfs/TwoKeyAVLTree.h

104

template<typename Value, typename Key>

src/add-ons/kernel/file_systems/ramfs/TwoKeyAVLTree.h

108

inline const Key &operator()(const Value &a) const

src/add-ons/kernel/file_systems/ramfs/TwoKeyAVLTree.h

113

inline Key &operator()(Value &a) const

src/add-ons/kernel/file_systems/ramfs/TwoKeyAVLTree.h

150

inline Node* Allocate(const Key& key, const Value& value) const

src/add-ons/kernel/file_systems/ramfs/TwoKeyAVLTree.h

161

inline Key GetValueKey(const Value& value) const

src/add-ons/kernel/file_systems/ramfs/TwoKeyAVLTree.h

163

return Key(fGetPrimaryKey(value), fGetSecondaryKey(value));

src/add-ons/kernel/file_systems/ramfs/TwoKeyAVLTree.h

166

inline Key GetKey(Node* node) const

src/add-ons/kernel/file_systems/ramfs/TwoKeyAVLTree.h

186

inline int CompareKeyNode(const Key& a, const Node* b) const

src/add-ons/kernel/file_systems/ramfs/TwoKeyAVLTree.h

198

inline int _CompareKeys(const Key& a, const Key& b) const

src/add-ons/kernel/file_systems/ramfs/TwoKeyAVLTree.h

441

TreeMapIterator it = fTreeMap.Find(Key(primaryKey, secondaryKey));

src/add-ons/kernel/file_systems/ramfs/TwoKeyAVLTree.h

47

inline int operator()(const Key &a, const Key &b) const

src/add-ons/kernel/file_systems/ramfs/TwoKeyAVLTree.h

481

return fTreeMap.Remove(Key(primaryKey, secondaryKey));

src/add-ons/kernel/file_systems/ramfs/TwoKeyAVLTree.h

76

inline Key operator()(const Value &a) const

src/add-ons/kernel/file_systems/ramfs/TwoKeyAVLTree.h

78

return Key(fGetPrimaryKey(a), fGetSecondaryKey(a));

src/add-ons/kernel/file_systems/reiserfs/Block.cpp

312

const Key *

src/add-ons/kernel/file_systems/reiserfs/Block.cpp

315

return (const Key*)((uint8*)fData + sizeof(block_head));

src/add-ons/kernel/file_systems/reiserfs/Block.cpp

319

const Key *

src/add-ons/kernel/file_systems/reiserfs/Block.cpp

322

const Key *k = NULL;

src/add-ons/kernel/file_systems/reiserfs/Block.h

118

const Key *GetKeys() const;

src/add-ons/kernel/file_systems/reiserfs/Block.h

119

const Key *KeyAt(int32 index) const;

src/add-ons/kernel/file_systems/reiserfs/Block.h

35

class Key;

src/add-ons/kernel/file_systems/reiserfs/Item.cpp

179

const Key *

src/add-ons/kernel/file_systems/reiserfs/Item.h

39

const Key *GetKey() const { return Key::CastFrom(&ih_key); }

src/add-ons/kernel/file_systems/reiserfs/Item.h

81

const Key *GetKey() const;

src/add-ons/kernel/file_systems/reiserfs/Key.h

118

Key &operator=(const Key &k)

src/add-ons/kernel/file_systems/reiserfs/Key.h

173

VKey(const Key *k, uint32 version)

src/add-ons/kernel/file_systems/reiserfs/Key.h

174

: fKey(const_cast<Key*>(k)), fVersion(version) {}

src/add-ons/kernel/file_systems/reiserfs/Key.h

175

VKey(const Key *k) : fKey(NULL), fVersion(KEY_FORMAT_3_5) { SetTo(k); }

src/add-ons/kernel/file_systems/reiserfs/Key.h

183

: fKey(new(nothrow) Key(*k.fKey)), fVersion(k.fVersion | ALLOCATED) {}

src/add-ons/kernel/file_systems/reiserfs/Key.h

186

void SetTo(const Key *k, uint32 version)

src/add-ons/kernel/file_systems/reiserfs/Key.h

189

fKey = const_cast<Key*>(k);

src/add-ons/kernel/file_systems/reiserfs/Key.h

192

void SetTo(const Key *k)

src/add-ons/kernel/file_systems/reiserfs/Key.h

195

fKey = const_cast<Key*>(k);

src/add-ons/kernel/file_systems/reiserfs/Key.h

202

fKey = new(nothrow) Key;

src/add-ons/kernel/file_systems/reiserfs/Key.h

255

fKey = new(nothrow) Key;

src/add-ons/kernel/file_systems/reiserfs/Key.h

274

Key *fKey;

src/add-ons/kernel/file_systems/reiserfs/Key.h

46

class Key : private key {

src/add-ons/kernel/file_systems/reiserfs/Key.h

48

Key() {}

src/add-ons/kernel/file_systems/reiserfs/Key.h

49

Key(const Key &k) : key(k) {}

src/add-ons/kernel/file_systems/reiserfs/Key.h

50

~Key() {}

src/add-ons/kernel/file_systems/reiserfs/Key.h

52

static Key* CastFrom(key* k)

src/add-ons/kernel/file_systems/reiserfs/Key.h

53

{ return static_cast<Key*>(k); }

src/add-ons/kernel/file_systems/reiserfs/Key.h

54

static const Key* CastFrom(const key* k)

src/add-ons/kernel/file_systems/reiserfs/Key.h

55

{ return static_cast<const Key*>(k); }

src/add-ons/kernel/file_systems/shared/QueryParserUtils.cpp

24

template<typename Key>

src/add-ons/kernel/file_systems/shared/QueryParserUtils.cpp

26

compare_integral(const Key& a, const Key& b)

src/add-ons/kernel/network/protocols/ipv4/ipv4.cpp

112

return HashKey(value->Key());

src/add-ons/kernel/network/protocols/ipv4/ipv4.cpp

117

const ipv4_packet_key& packetKey = value->Key();

src/add-ons/kernel/network/protocols/ipv6/ipv6.cpp

130

return HashKey(value->Key());

src/add-ons/kernel/network/protocols/ipv6/ipv6.cpp

135

const ipv6_packet_key& packetKey = value->Key();

src/add-ons/kernel/network/protocols/l2cap/L2capEndpointManager.h

43

int Compare(const Key& a, const Value* b) const

src/add-ons/kernel/network/protocols/l2cap/L2capEndpointManager.h

54

int Compare(const Key& a, const Value* b) const

src/add-ons/print/drivers/gutenprint/GPDriver.cpp

91

parameter = capability->Key();

src/apps/debugger/user_interface/gui/model/VariablesViewState.cpp

112

Key(ObjectID* variable, TypeComponentPath* path)

src/apps/debugger/user_interface/gui/model/VariablesViewState.cpp

124

bool operator==(const Key& other) const

src/apps/debugger/user_interface/gui/model/VariablesViewState.cpp

134

struct VariablesViewState::InfoEntry : Key, VariablesViewNodeInfo {

src/apps/debugger/user_interface/gui/model/VariablesViewState.cpp

139

Key(variable, path)

src/apps/debugger/user_interface/gui/model/VariablesViewState.cpp

159

typedef Key KeyType;

src/apps/debugger/user_interface/gui/model/VariablesViewState.cpp

162

size_t HashKey(const Key& key) const

src/apps/debugger/user_interface/gui/model/VariablesViewState.cpp

172

bool Compare(const Key& key, const InfoEntry* value) const

src/apps/debugger/user_interface/gui/model/VariablesViewState.cpp

245

return fNodeInfos->Lookup(Key(variable, (TypeComponentPath*)path));

src/apps/debugger/user_interface/gui/model/VariablesViewState.cpp

253

InfoEntry* entry = fNodeInfos->Lookup(Key(variable, path));

src/apps/debugger/user_interface/gui/model/VariablesViewState.h

85

struct Key;

src/apps/debugger/user_interface/gui/model/VariablesViewStateHistory.cpp

145

StateEntry* stateEntry = fStates->Lookup(Key(threadID, functionID));

src/apps/debugger/user_interface/gui/model/VariablesViewStateHistory.cpp

151

StateEntry* stateEntry = fStates->Lookup(Key(-1, functionID));

src/apps/debugger/user_interface/gui/model/VariablesViewStateHistory.cpp

159

StateEntry* stateEntry = fStates->Lookup(Key(-1, functionID));

src/apps/debugger/user_interface/gui/model/VariablesViewStateHistory.cpp

169

StateEntry* defaultEntry = fStates->Lookup(Key(-1, functionID));

src/apps/debugger/user_interface/gui/model/VariablesViewStateHistory.cpp

184

threadEntry = fStates->Lookup(Key(threadID, functionID));

src/apps/debugger/user_interface/gui/model/VariablesViewStateHistory.cpp

22

Key(thread_id threadID, FunctionID* functionID)

src/apps/debugger/user_interface/gui/model/VariablesViewStateHistory.cpp

34

bool operator==(const Key& other) const

src/apps/debugger/user_interface/gui/model/VariablesViewStateHistory.cpp

44

struct VariablesViewStateHistory::StateEntry : Key, VariablesViewNodeInfo {

src/apps/debugger/user_interface/gui/model/VariablesViewStateHistory.cpp

50

Key(threadID, functionID),

src/apps/debugger/user_interface/gui/model/VariablesViewStateHistory.cpp

80

typedef Key KeyType;

src/apps/debugger/user_interface/gui/model/VariablesViewStateHistory.cpp

83

size_t HashKey(const Key& key) const

src/apps/debugger/user_interface/gui/model/VariablesViewStateHistory.cpp

93

bool Compare(const Key& key, const StateEntry* value) const

src/apps/debugger/user_interface/gui/model/VariablesViewStateHistory.h

32

struct Key;

src/apps/haikudepot/model/ScreenshotCoordinate.cpp

97

return BString() << Key() << ".png";

src/apps/haikudepot/model/ScreenshotCoordinate.h

32

const BString Key() const;

src/kits/debugger/debug_managers/TeamMemoryBlockManager.cpp

31

bool operator==(const Key& other) const

src/kits/debugger/debug_managers/TeamMemoryBlockManager.cpp

38

struct TeamMemoryBlockManager::MemoryBlockEntry : Key {

src/kits/debugger/debug_managers/TeamMemoryBlockManager.cpp

44

Key(block->BaseAddress()),

src/kits/debugger/debug_managers/TeamMemoryBlockManager.cpp

56

typedef Key KeyType;

src/kits/debugger/debug_managers/TeamMemoryBlockManager.cpp

59

size_t HashKey(const Key& key) const

src/kits/debugger/debug_managers/TeamMemoryBlockManager.cpp

69

bool Compare(const Key& key, const MemoryBlockEntry* value) const

src/kits/debugger/debug_managers/TeamMemoryBlockManager.h

32

struct Key;

src/kits/debugger/jobs/Jobs.h

106

virtual const JobKey& Key() const;

src/kits/debugger/jobs/Jobs.h

129

virtual const JobKey& Key() const;

src/kits/debugger/jobs/Jobs.h

165

virtual const JobKey& Key() const;

src/kits/debugger/jobs/Jobs.h

189

virtual const JobKey& Key() const;

src/kits/debugger/jobs/Jobs.h

222

virtual const JobKey& Key() const;

src/kits/debugger/jobs/Jobs.h

244

virtual const JobKey& Key() const;

src/kits/debugger/jobs/Jobs.h

263

virtual const JobKey& Key() const;

src/kits/debugger/jobs/Jobs.h

286

virtual const JobKey& Key() const;

src/kits/debugger/jobs/Jobs.h

316

virtual const JobKey& Key() const;

src/kits/debugger/jobs/Jobs.h

70

virtual const JobKey& Key() const;

src/kits/debugger/jobs/Jobs.h

87

virtual const JobKey& Key() const;

src/kits/debugger/model/ExpressionValues.cpp

143

ValueEntry* entry = fValues->Lookup(Key(function, thread, *expression));

src/kits/debugger/model/ExpressionValues.cpp

156

return fValues->Lookup(Key(function, thread, *expression)) != NULL;

src/kits/debugger/model/ExpressionValues.cpp

164

ValueEntry* entry = fValues->Lookup(Key(function, thread, expression));

src/kits/debugger/model/ExpressionValues.cpp

21

Key(FunctionID* function, ::Thread* thread, const BString& expression)

src/kits/debugger/model/ExpressionValues.cpp

35

bool operator==(const Key& other) const

src/kits/debugger/model/ExpressionValues.cpp

44

struct ExpressionValues::ValueEntry : Key {

src/kits/debugger/model/ExpressionValues.cpp

51

Key(function, thread, expression)

src/kits/debugger/model/ExpressionValues.cpp

66

typedef Key KeyType;

src/kits/debugger/model/ExpressionValues.cpp

69

size_t HashKey(const Key& key) const

src/kits/debugger/model/ExpressionValues.cpp

79

bool Compare(const Key& key, const ValueEntry* value) const

src/kits/debugger/model/StackFrameValueInfos.cpp

137

Key(variable, (TypeComponentPath*)path));

src/kits/debugger/model/StackFrameValueInfos.cpp

159

return fValues->Lookup(Key(variable, (TypeComponentPath*)path)) != NULL;

src/kits/debugger/model/StackFrameValueInfos.cpp

167

InfoEntry* entry = fValues->Lookup(Key(variable, path));

src/kits/debugger/model/StackFrameValueInfos.cpp

21

Key(ObjectID* variable, TypeComponentPath* path)

src/kits/debugger/model/StackFrameValueInfos.cpp

33

bool operator==(const Key& other) const

src/kits/debugger/model/StackFrameValueInfos.cpp

40

struct StackFrameValueInfos::InfoEntry : Key {

src/kits/debugger/model/StackFrameValueInfos.cpp

47

Key(variable, path),

src/kits/debugger/model/StackFrameValueInfos.cpp

82

typedef Key KeyType;

src/kits/debugger/model/StackFrameValueInfos.cpp

85

size_t HashKey(const Key& key) const

src/kits/debugger/model/StackFrameValueInfos.cpp

95

bool Compare(const Key& key, const InfoEntry* value) const

src/kits/debugger/model/StackFrameValues.cpp

135

Key(variable, (TypeComponentPath*)path));

src/kits/debugger/model/StackFrameValues.cpp

148

return fValues->Lookup(Key(variable, (TypeComponentPath*)path)) != NULL;

src/kits/debugger/model/StackFrameValues.cpp

156

ValueEntry* entry = fValues->Lookup(Key(variable, path));

src/kits/debugger/model/StackFrameValues.cpp

19

Key(ObjectID* variable, TypeComponentPath* path)

src/kits/debugger/model/StackFrameValues.cpp

31

bool operator==(const Key& other) const

src/kits/debugger/model/StackFrameValues.cpp

38

struct StackFrameValues::ValueEntry : Key {

src/kits/debugger/model/StackFrameValues.cpp

44

Key(variable, path)

src/kits/debugger/model/StackFrameValues.cpp

59

typedef Key KeyType;

src/kits/debugger/model/StackFrameValues.cpp

62

size_t HashKey(const Key& key) const

src/kits/debugger/model/StackFrameValues.cpp

72

bool Compare(const Key& key, const ValueEntry* value) const

src/kits/interface/Window.cpp

1706

RemoveShortcut(shortcut->Key(), shortcut->Modifiers());

src/kits/interface/Window.cpp

1709

*_key = shortcut->Key();

src/kits/interface/Window.cpp

1734

RemoveShortcut(shortcut->Key(), shortcut->Modifiers());

src/libs/print/libprint/JobSetupDlg.cpp

1004

fJobData->Settings().SetDouble(range.Key(), range.Value());

src/libs/print/libprint/JobSetupDlg.cpp

557

string value = GetDriverSpecificValue(category, capability->Key());

src/libs/print/libprint/JobSetupDlg.cpp

592

const char* key = capability->Key();

src/libs/print/libprint/JobSetupDlg.cpp

607

fDriverSpecificCheckBoxes[capability->Key()] = checkBox;

src/libs/print/libprint/JobSetupDlg.cpp

625

const char* key = capability->Key();

src/libs/print/libprint/JobSetupDlg.cpp

665

const char* key = capability->Key();

src/libs/print/libprint/JobSetupDlg.cpp

971

PrinterCap::kDriverSpecificCapabilities, (int)category)->Key();

src/libs/print/libprint/JobSetupDlg.cpp

974

FindCap(category, label))->Key();

src/libs/print/libprint/JobSetupDlg.cpp

995

fJobData->Settings().SetInt(range.Key(), range.Value());

src/preferences/keymap/KeyboardLayout.cpp

344

KeyboardLayout::_AddAlternateKeyCode(Key* key, int32 modifier, int32 code)

src/preferences/keymap/KeyboardLayout.cpp

354

KeyboardLayout::_AddKey(const Key& key)

src/preferences/keymap/KeyboardLayout.cpp

360

Key* newKeys = (Key*)realloc((void*)fKeys, newCapacity * sizeof(Key));

src/preferences/keymap/KeyboardLayout.cpp

460

Key& key, const char* data, int32& lastCount)

src/preferences/keymap/KeyboardLayout.cpp

559

Key* key = KeyAt(i);

src/preferences/keymap/KeyboardLayout.cpp

607

KeyboardLayout::_GetShape(const parse_state& state, const char* data, Key& key)

src/preferences/keymap/KeyboardLayout.cpp

61

Key*

src/preferences/keymap/KeyboardLayout.cpp

772

Key key;

src/preferences/keymap/KeyboardLayout.cpp

845

memset((void*)&key, 0, sizeof(Key));

src/preferences/keymap/KeyboardLayout.h

109

Key* fKeys;

src/preferences/keymap/KeyboardLayout.h

50

Key* KeyAt(int32 index);

src/preferences/keymap/KeyboardLayout.h

81

void _AddAlternateKeyCode(Key* key, int32 modifier,

src/preferences/keymap/KeyboardLayout.h

83

bool _AddKey(const Key& key);

src/preferences/keymap/KeyboardLayout.h

91

BPoint& rowLeftTop, Key& key, const char* data,

src/preferences/keymap/KeyboardLayout.h

96

const char* data, Key& key);

src/preferences/keymap/KeyboardLayoutView.cpp

1024

KeyboardLayoutView::_GetKeyLabel(const Key* key, char* text, size_t textSize,

src/preferences/keymap/KeyboardLayoutView.cpp

1102

Key*

src/preferences/keymap/KeyboardLayoutView.cpp

1108

Key* key = fLayout->KeyAt(i);

src/preferences/keymap/KeyboardLayoutView.cpp

1125

KeyboardLayoutView::_InvalidateKey(const Key* key)

src/preferences/keymap/KeyboardLayoutView.cpp

1200

Key*

src/preferences/keymap/KeyboardLayoutView.cpp

1211

Key* key = fLayout->KeyAt(i);

src/preferences/keymap/KeyboardLayoutView.cpp

1240

KeyboardLayoutView::_FrameFor(const Key* key)

src/preferences/keymap/KeyboardLayoutView.cpp

1296

KeyboardLayoutView::_SendKeyDown(const Key* key)

src/preferences/keymap/KeyboardLayoutView.cpp

204

Key* key = _KeyAt(point);

src/preferences/keymap/KeyboardLayoutView.cpp

370

Key* key = _KeyAt(fClickPoint);

src/preferences/keymap/KeyboardLayoutView.cpp

453

Key* key = _KeyAt(fClickPoint);

src/preferences/keymap/KeyboardLayoutView.cpp

512

Key* key = fLayout->KeyAt(i);

src/preferences/keymap/KeyboardLayoutView.cpp

580

Key* key = _KeyForCode(keyCode);

src/preferences/keymap/KeyboardLayoutView.cpp

615

Key* key = _KeyForCode(keyCode);

src/preferences/keymap/KeyboardLayoutView.cpp

708

KeyboardLayoutView::_DrawKey(BView* view, BRect updateRect, const Key* key,

src/preferences/keymap/KeyboardLayoutView.cpp

995

const Key* key, char* text, size_t textSize)

src/preferences/keymap/KeyboardLayoutView.h

100

void _SendKeyDown(const Key* key);

src/preferences/keymap/KeyboardLayoutView.h

118

Key* fDragKey;

src/preferences/keymap/KeyboardLayoutView.h

120

Key* fDropTarget;

src/preferences/keymap/KeyboardLayoutView.h

70

const Key* key, BRect frame, bool pressed);

src/preferences/keymap/KeyboardLayoutView.h

83

BRect rect, const Key* key, char* text,

src/preferences/keymap/KeyboardLayoutView.h

85

void _GetKeyLabel(const Key* key, char* text,

src/preferences/keymap/KeyboardLayoutView.h

90

Key* _KeyForCode(uint32 code);

src/preferences/keymap/KeyboardLayoutView.h

92

void _InvalidateKey(const Key* key);

src/preferences/keymap/KeyboardLayoutView.h

95

Key* _KeyAt(BPoint point);

src/preferences/keymap/KeyboardLayoutView.h

97

BRect _FrameFor(const Key* key);

src/system/kernel/events/event_queue.cpp

527

EventQueueTreeDefinition::Key key = { object, type };

src/system/kernel/events/event_queue.cpp

72

int Compare(Key a, const Value* b) const

src/system/kernel/fs/EntryCache.h

80

EntryCacheKey Key(const EntryCacheEntry* value) const

src/system/kernel/posix/xsi_message_queue.cpp

322

return (size_t)HashKey(variable->Key());

src/system/kernel/posix/xsi_message_queue.cpp

327

return (key_t)key == (key_t)variable->Key();

src/system/kernel/posix/xsi_semaphore.cpp

563

return (size_t)HashKey(variable->Key());

src/system/kernel/posix/xsi_semaphore.cpp

568

return (key_t)key == (key_t)variable->Key();

src/tests/kits/opengl/glsl/brick.c

193

glutKeyboardFunc(Key);

src/tests/system/kernel/util/VectorMapTest.cpp

162

CPPUNIT_ASSERT(myResult->Key() == refResult->first);

src/tests/system/kernel/util/VectorMapTest.cpp

177

CPPUNIT_ASSERT(myResult->Key() == refResult->first);

src/tests/system/kernel/util/VectorMapTest.cpp

187

CPPUNIT_ASSERT(myResult->Key() == refResult->first);

src/tests/system/kernel/util/VectorMapTest.cpp

198

CPPUNIT_ASSERT(myResult->Key() == refResult->first);

src/tests/system/kernel/util/VectorMapTest.cpp

229

CPPUNIT_ASSERT(entry.Key() == fReferenceIterator->first);

src/tests/system/kernel/util/VectorMapTest.cpp

237

CPPUNIT_ASSERT(entry.Key() == fReferenceIterator->first);

src/tests/system/kernel/util/VectorMapTest.cpp

256

template<typename Key, typename Value, typename MyMap, typename ReferenceMap, typename Compare>

src/tests/system/kernel/util/VectorMapTest.cpp

259

typedef TestMap<Key, Value, MyMap, ReferenceMap, Compare> Class;

src/tests/system/kernel/util/VectorMapTest.cpp

279

void Insert(const Key& key, const Value& value)

src/tests/system/kernel/util/VectorMapTest.cpp

286

void Put(const Key& key, const Value& value)

src/tests/system/kernel/util/VectorMapTest.cpp

293

Value& Get(const Key& key)

src/tests/system/kernel/util/VectorMapTest.cpp

300

const Value& Get(const Key& key) const

src/tests/system/kernel/util/VectorMapTest.cpp

307

void Remove(const Key& key)

src/tests/system/kernel/util/VectorMapTest.cpp

326

Key nextKey;

src/tests/system/kernel/util/VectorMapTest.cpp

341

CPPUNIT_ASSERT(myIt->Key() == refIt->first);

src/tests/system/kernel/util/VectorMapTest.cpp

417

Iterator Find(const Key& key)

src/tests/system/kernel/util/VectorMapTest.cpp

424

CPPUNIT_ASSERT(myIt->Key() == refIt->first);

src/tests/system/kernel/util/VectorMapTest.cpp

430

ConstIterator Find(const Key& key) const

src/tests/system/kernel/util/VectorMapTest.cpp

437

CPPUNIT_ASSERT(myIt->Key() == refIt->first);

src/tests/system/kernel/util/VectorMapTest.cpp

443

Iterator FindClose(const Key& key, bool less)

src/tests/system/kernel/util/VectorMapTest.cpp

449

CPPUNIT_ASSERT(fCompare(fMyMap.Begin()->Key(), key) > 0);

src/tests/system/kernel/util/VectorMapTest.cpp

451

CPPUNIT_ASSERT(fCompare((--MyIterator(myIt))->Key(), key) < 0);

src/tests/system/kernel/util/VectorMapTest.cpp

456

CPPUNIT_ASSERT(fCompare(myIt->Key(), key) <= 0);

src/tests/system/kernel/util/VectorMapTest.cpp

460

CPPUNIT_ASSERT(fCompare(nextMyIt->Key(), key) > 0);

src/tests/system/kernel/util/VectorMapTest.cpp

462

CPPUNIT_ASSERT(fCompare(myIt->Key(), key) >= 0);

src/tests/system/kernel/util/VectorMapTest.cpp

466

CPPUNIT_ASSERT(fCompare(prevMyIt->Key(), key) < 0);

src/tests/system/kernel/util/VectorMapTest.cpp

469

return Iterator(this, myIt, fReferenceMap.find(myIt->Key()));

src/tests/system/kernel/util/VectorMapTest.cpp

472

ConstIterator FindClose(const Key& key, bool less) const

src/tests/system/kernel/util/VectorMapTest.cpp

478

CPPUNIT_ASSERT(fCompare(fMyMap.Begin()->Key(), key) > 0);

src/tests/system/kernel/util/VectorMapTest.cpp

480

CPPUNIT_ASSERT(fCompare((--MyConstIterator(myIt))->Key(), key) < 0);

src/tests/system/kernel/util/VectorMapTest.cpp

485

CPPUNIT_ASSERT(fCompare(myIt->Key(), key) <= 0);

src/tests/system/kernel/util/VectorMapTest.cpp

489

CPPUNIT_ASSERT(fCompare(nextMyIt->Key(), key) > 0);

src/tests/system/kernel/util/VectorMapTest.cpp

491

CPPUNIT_ASSERT(fCompare(myIt->Key(), key) >= 0);

src/tests/system/kernel/util/VectorMapTest.cpp

495

CPPUNIT_ASSERT(fCompare(prevMyIt->Key(), key) < 0);

src/tests/system/kernel/util/VectorMapTest.cpp

498

return ConstIterator(this, myIt, fReferenceMap.find(myIt->Key()));

src/tests/system/kernel/util/VectorMapTest.cpp

512

CPPUNIT_ASSERT(myIt->Key() == refIt->first);

src/tests/system/kernel/util/VectorMapTest.cpp

514

CPPUNIT_ASSERT((*myIt).Key() == refIt->first);

src/tests/system/kernel/util/VectorMapTest.cpp

540

typedef typename CompareStrategyWrapper::template Strategy<Key> Compare;

src/tests/system/kernel/util/VectorMapTest.cpp

541

typedef CompareWrapper<Key, Compare> BoolCompare;

src/tests/system/kernel/util/VectorMapTest.cpp

543

typedef std::map<Key, Value, BoolCompare> ReferenceMap;

src/tests/system/kernel/util/VectorMapTest.cpp

544

typedef TestMap<Key, Value, MyMap, ReferenceMap, Compare> TestClass;

src/tests/system/kernel/util/VectorMapTest.cpp

573

typedef typename TestStrategy::Key Key;

src/tests/system/kernel/util/VectorMapTest.cpp

585

Key key;

src/tests/system/kernel/util/VectorMapTest.cpp

597

Key key;

src/tests/system/kernel/util/VectorMapTest.cpp

613

Key key = it->Key();

src/tests/system/kernel/util/VectorMapTest.cpp

622

typedef typename EntryStrategy::Key Key;

src/tests/system/kernel/util/VectorMapTest.cpp

626

Key key;

src/tests/system/kernel/util/VectorMapTest.cpp

64

inline Key GenerateKey() { return fKeyStrategy.Generate(); }

src/tests/system/kernel/util/VectorMapTest.cpp

642

Key key = v.IteratorForIndex(index)->Key();

src/tests/system/kernel/util/VectorMapTest.cpp

677

Key key = v.IteratorForIndex(i)->Key();

src/tests/system/kernel/util/VectorMapTest.cpp

68

inline void Generate(Key& key, Value& value)

src/tests/system/kernel/util/VectorMapTest.cpp

680

CPPUNIT_ASSERT(it->Key() == key);

src/tests/system/kernel/util/VectorMapTest.cpp

681

CPPUNIT_ASSERT(it->Key() == cit->Key());

src/tests/system/kernel/util/VectorMapTest.cpp

682

CPPUNIT_ASSERT((*it).Key() == (*it).Key());

src/tests/system/kernel/util/VectorMapTest.cpp

688

Key key = v.IteratorForIndex(i)->Key();

src/tests/system/kernel/util/VectorMapTest.cpp

692

CPPUNIT_ASSERT(it->Key() == key);

src/tests/system/kernel/util/VectorMapTest.cpp

693

CPPUNIT_ASSERT(it->Key() == cit->Key());

src/tests/system/kernel/util/VectorMapTest.cpp

694

CPPUNIT_ASSERT((*it).Key() == (*it).Key());

src/tests/system/kernel/util/VectorMapTest.cpp

709

Key key = v.IteratorForIndex(i)->Key();

src/tests/system/kernel/util/VectorMapTest.cpp

713

CPPUNIT_ASSERT(it->Key() == key);

src/tests/system/kernel/util/VectorMapTest.cpp

714

CPPUNIT_ASSERT(it->Key() == cit->Key());

src/tests/system/kernel/util/VectorMapTest.cpp

715

CPPUNIT_ASSERT((*it).Key() == (*it).Key());

src/tests/system/kernel/util/VectorMapTest.cpp

721

CPPUNIT_ASSERT(it->Key() == key);

src/tests/system/kernel/util/VectorMapTest.cpp

722

CPPUNIT_ASSERT(it->Key() == cit->Key());

src/tests/system/kernel/util/VectorMapTest.cpp

723

CPPUNIT_ASSERT((*it).Key() == (*it).Key());

src/tests/system/kernel/util/VectorMapTest.cpp

729

Key key = entryStrategy.GenerateKey();

src/tests/system/kernel/util/VectorMapTest.cpp

734

CPPUNIT_ASSERT(it->Key() == cit->Key());

src/tests/system/kernel/util/VectorMapTest.cpp

735

CPPUNIT_ASSERT((*it).Key() == (*it).Key());

src/tests/system/kernel/util/VectorMapTest.cpp

743

CPPUNIT_ASSERT(it->Key() == cit->Key());

src/tests/system/kernel/util/VectorMapTest.cpp

744

CPPUNIT_ASSERT((*it).Key() == (*it).Key());

src/tests/system/kernel/util/VectorMapTest.cpp

760

CPPUNIT_ASSERT(it->Key() == cit->Key());

src/tests/system/kernel/util/VectorMapTest.cpp

762

CPPUNIT_ASSERT(it->Key() == (*it).Key());

src/tests/system/kernel/util/VectorMapTest.cpp

763

CPPUNIT_ASSERT(cit->Key() == (*cit).Key());

src/tests/system/kernel/util/VectorMapTest.cpp

766

CPPUNIT_ASSERT(it->Key() == it.operator->().Key());

src/tests/system/kernel/util/VectorMapTest.cpp

768

CPPUNIT_ASSERT(cit->Key() == cit.operator->().Key());

src/tests/system/kernel/util/VectorMapTest.cpp

777

CPPUNIT_ASSERT(it->Key() == cit->Key());

src/tests/system/kernel/util/VectorMapTest.cpp

779

CPPUNIT_ASSERT(it->Key() == (*it).Key());

src/tests/system/kernel/util/VectorMapTest.cpp

780

CPPUNIT_ASSERT(cit->Key() == (*cit).Key());

src/tests/system/kernel/util/VectorMapTest.cpp

783

CPPUNIT_ASSERT(it->Key() == it.operator->().Key());

src/tests/system/kernel/util/VectorMapTest.cpp

785

CPPUNIT_ASSERT(cit->Key() == cit.operator->().Key());

src/tests/system/kernel/util/VectorMapTest.cpp

848

template<typename Key, typename Value>

src/tests/system/kernel/util/VectorMapTest.cpp

850

typedef SimpleValueStrategy<Key> KeyStrategy;

src/tests/system/kernel/util/VectorMapTest.cpp

856

: public VectorMap<Key, Value, VectorMapEntryStrategy::Pair<Key, Value, CompareStrategy> > {

src/tests/system/kernel/util/VectorMapTest.cpp

861

#define DECLARE_TEST_STRATEGY(Key, Value, Map, Strategy) \

src/tests/system/kernel/util/VectorMapTest.cpp

862

template<typename CS> struct Map : PairTestBase<Key, Value>::MyMap<CS> {}; \

src/tests/system/kernel/util/VectorMapTest.cpp

864

struct Strategy : public TestStrategy<Map, PairTestBase<Key, Value>::EntryStrategy, CS> {};

src/tests/system/kernel/util/VectorMapTest.cpp

88

inline Key GenerateKey() { return fKeyStrategy.Generate(); }

src/tests/system/kernel/util/VectorMapTest.cpp

90

inline void Generate(Key& key, Value& value)