18 	typedef LRUOrderingNode<Key, Value> LRUNode;  typedef
41 	LRUNode*				fOlder;
42 	LRUNode*				fNewer;
55 	typedef LRUOrderingNode<Key, Value> LRUNode;  typedef
79 		LRUNode* node = fMap.Get(key);  in Put()
87 			node = new(std::nothrow) LRUNode(key, value);  in Put()
104 		LRUNode* node = fMap.Get(key);  in Remove()
127 		LRUNode* node = fMap.Get(key);  in Get()
147 	void _DisconnectNodeAndMakeNewest(LRUNode* node) {  in _DisconnectNodeAndMakeNewest()
156 	void _DisconnectNode(LRUNode* node)  in _DisconnectNode()
158 		LRUNode *older = node->fOlder;  in _DisconnectNode()
159 		LRUNode *newer = node->fNewer;  in _DisconnectNode()
170 	void _SetNewestNode(LRUNode* node)  in _SetNewestNode()
197 	HashMap<Key, LRUNode*>	fMap;
198 	LRUNode*				fNewestNode;
199 	LRUNode*				fOldestNode;