Lines Matching full:linkedhashmap

3 #import "LinkedHashMap.h"
64 - (void) recordAccess:(LinkedHashMap *)m
66     LinkedHashMap *lhm = (LinkedHashMap *)m;
74 - (void) recordRemoval:(LinkedHashMap *)m
87 + (LinkedHashIterator *) newIterator:(LinkedHashMap *)aLHM
92 - (id) init:(LinkedHashMap *)aLHM
150 + (LHMKeyIterator *)newIterator:(LinkedHashMap *)aLHM
155 - (id) init:(LinkedHashMap *)aLHM
171 + (LHMValueIterator *)newIterator:(LinkedHashMap *)aLHM
176 - (id) init:(LinkedHashMap *)aLHM
192 + (LHMEntryIterator *)newIterator:(LinkedHashMap *)aLHM
197 - (id) init:(LinkedHashMap *)aLHM
214 @implementation LinkedHashMap  implementation
220  * Constructs an empty insertion-ordered <tt>LinkedHashMap</tt> instance
232     return [[LinkedHashMap alloc] init:anInitialCapacity
239     return [[LinkedHashMap alloc] init:anInitialCapacity loadFactor:loadFactor];
244     return [[LinkedHashMap alloc] init:anInitialCapacity loadFactor:DEFAULT_LOAD_FACTOR];
248  * Constructs an empty <tt>LinkedHashMap</tt> instance with the
281  * Constructs an empty insertion-ordered <tt>LinkedHashMap</tt> instance
299  * Constructs an insertion-ordered <tt>LinkedHashMap</tt> instance with
300  * the same mappings as the specified map.  The <tt>LinkedHashMap</tt>
307 - (id) initWithM:(LinkedHashMap *)m
319  * Constructs an empty insertion-ordered <tt>LinkedHashMap</tt> instance