public class HashedSimpleLockIStoredList<T> extends SimpleLockStoredList<T>
lockm_AllOccupiedPos, m_BasicOccupied, m_Head, m_LastChunk, m_LastPos, m_Size, m_Support_Random_Scans, m_Tail, MINIMAL_NUMBER_TO_HANDLE_POSITIONS, NUMBER_OF_OCCUPIED_POS_QUOTA, SCAN_LIMIT| Constructor and Description | 
|---|
HashedSimpleLockIStoredList(boolean Support_Random_Scans)  | 
| Modifier and Type | Method and Description | 
|---|---|
IObjectInfo<T> | 
add(T subject)
store an element 
 | 
boolean | 
contains(T obj)
is this object contained in the SL ? 
 | 
void | 
remove(IObjectInfo<T> oi)
remove an element described by ObjectInfo 
 | 
boolean | 
removeByObject(T obj)
given an object scan the list, find it and remove it, returns true if found 
 | 
addUnlocked, getHashCode, getHead, getKey, getObjectFromHead, getValue, invalidate, isEmpty, isInvalid, isNativeHashEntry, iterate, nextPos, optimizeScanForSingleObject, removeUnlocked, sizecontains_impl, dump, establishListScan, freeSLHolder, isIterator, isMultiObjectCollection, iterator, iterator, next, remove_impl, removeByObject_impl, store_impl, storeBeforeCeiling_implclone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitforEach, spliteratorpublic HashedSimpleLockIStoredList(boolean Support_Random_Scans)
public IObjectInfo<T> add(T subject)
add in interface ICollection<T>add in class SimpleLockStoredList<T>subject - element to store.null if
 StoredList has been invalidated.public void remove(IObjectInfo<T> oi)
remove in interface IStoredList<T>remove in class SimpleLockStoredList<T>oi - an existing element between Tail and Headpublic boolean removeByObject(T obj)
removeByObject in interface ICollection<T>removeByObject in class SimpleLockStoredList<T>obj - element to removetrue if object was removed; false otherwise (if element
 wasn't found)public boolean contains(T obj)
contains in interface ICollection<T>contains in class SimpleLockStoredList<T>obj - the element to search fortrue if element exists in the StoredList; false otherwise.Copyright © GigaSpaces.