public class NoticeQueue extends DuplicateTreeMap<Long,NotificationTask>
AbstractMap.SimpleEntry<K,V>, AbstractMap.SimpleImmutableEntry<K,V>
Constructor and Description |
---|
NoticeQueue() |
Modifier and Type | Method and Description |
---|---|
NotificationTask |
putItem(Long key,
NotificationTask value)
putItem
|
toString
ceilingEntry, ceilingKey, clear, clone, comparator, containsKey, containsValue, descendingKeySet, descendingMap, entrySet, firstEntry, firstKey, floorEntry, floorKey, forEach, get, headMap, headMap, higherEntry, higherKey, keySet, lastEntry, lastKey, lowerEntry, lowerKey, navigableKeySet, pollFirstEntry, pollLastEntry, put, putAll, remove, replace, replace, replaceAll, size, subMap, subMap, tailMap, tailMap, values
equals, hashCode, isEmpty
finalize, getClass, notify, notifyAll, wait, wait, wait
compute, computeIfAbsent, computeIfPresent, equals, getOrDefault, hashCode, isEmpty, merge, putIfAbsent, remove
public NotificationTask putItem(Long key, NotificationTask value)
putItem
putItem
in class DuplicateTreeMap<Long,NotificationTask>
key
- a K object.value
- a V object.Copyright © 2021. All rights reserved.