Lines Matching +full:fail +full:- +full:fast

5  * <tt>HashMap</tt> in that it maintains a doubly-linked list running through
8  * (<i>insertion-order</i>).  Note that insertion order is not affected
9  * if a key is <i>re-inserted</i> into the map.  (A key <tt>k</tt> is
32  * in which its entries were last accessed, from least-recently accessed to
33  * most-recently (<i>access-order</i>).  This kind of map is well-suited to
37  * access for each mapping in the specified map, in the order that key-value
40  * collection-views do <i>not</i> affect the order of iteration of the backing
48  * permits null elements.  Like <tt>HashMap</tt>, it provides constant-time
53  * linked list, with one exception: Iteration over the collection-views
79  * mappings or, in the case of access-ordered linked hash maps, affects
80  * iteration order.  In insertion-ordered linked hash maps, merely changing
82  * a structural modification.  <strong>In access-ordered linked hash maps,
88  * <em>fail-fast</em>: if the map is structurally modified at any time after
93  * arbitrary, non-deterministic behavior at an undetermined time in the future.
95  * <p>Note that the fail-fast behavior of an iterator cannot be guaranteed
97  * presence of unsynchronized concurrent modification.  Fail-fast iterators
98  * throw <tt>ConcurrentModificationException</tt> on a best-effort basis.
100  * exception for its correctness:   <i>the fail-fast behavior of iterators
136 - (id) newEntry:(NSInteger)aHash key:(NSString *)aKey value:(id)aValue next:(LHMEntry *)aNext;
138 - (id) init:(NSInteger)hash key:(NSString *)key value:(id)value next:(LHMEntry *)next;
139 - (void) recordAccess:(LinkedHashMap *)m;
140 - (void) recordRemoval:(LinkedHashMap *)m;
161 - (id) init:(LinkedHashMap *)aLHM;
162 - (BOOL) hasNext;
163 - (void) remove;
164 - (LHMEntry *) nextEntry;
173 - (id) init:(LinkedHashMap *)aHM;
174 - (LHMEntry *) next;
183 - (id) init:(LinkedHashMap *)aHM;
184 - (NSString *) next;
193 - (id) init:(LinkedHashMap *)aHM;
194 - (id) next;
207      * for access-order, <tt>false</tt> for insertion-order.
225 - (id) init:(NSInteger)initialCapacity loadFactor:(float)loadFactor accessOrder:(BOOL)accessOrder;
226 - (id) init:(NSInteger)initialCapacity loadFactor:(float)loadFactor;
227 - (id) init:(NSInteger)initialCapacity;
228 - (id) init;
229 - (id) initWithM:(AMutableDictionary *)m;
230 - (void) transfer:(NSArray *)newTable;
231 - (BOOL) containsValue:(NSObject *)value;
232 - (id) get:(NSString *)key;
233 - (void) clear;
234 - (LHMEntryIterator *) newEntryIterator;
235 - (LHMKeyIterator *) newKeyIterator;
236 - (LHMValueIterator *) newValueIterator;
237 - (void) addEntry:(NSInteger)hash key:(NSString *)key value:(id)value bucketIndex:(NSInteger)bucket…
238 - (void) createEntry:(NSInteger)hash key:(NSString *)key value:(id)value bucketIndex:(NSInteger)buc…
239 - (BOOL) removeEldestEntry:(LHMEntry *)eldest;