SortedMap a Map that maintains its mappings in ascending key order.Sorted sets are used for naturally ordered sets, such as word lists and membership rolls. Several additional operations are provided to take advantage of the ordering. SortedSet a Set that maintains its elements in ascending order.The last two core collection interfaces are merely sorted versions of Set and Map: If you've used Hashtable, you're already familiar with the basics of Map. A Map cannot contain duplicate keys each key can map to at most one value. Map an object that maps keys to values.In a deque all new elements can be inserted, retrieved and removed at both ends. Besides basic Collection operations, a Deque provides additional insertion, extraction, and inspection operations.ĭeques can be used both as FIFO (first-in, first-out) and LIFO (last-in, first-out). Deque a collection used to hold multiple elements prior to processing.Every Queue implementation must specify its ordering properties. Other kinds of queues may use different placement rules. In a FIFO queue, all new elements are inserted at the tail of the queue. Whatever the ordering used, the head of the queue is the element that would be removed by a call to remove or poll. Among the exceptions are priority queues, which order elements according to a supplied comparator or the elements' natural ordering. Queues typically, but do not necessarily, order elements in a FIFO (first-in, first-out) manner. Besides basic Collection operations, a Queue provides additional insertion, extraction, and inspection operations. Queue a collection used to hold multiple elements prior to processing. If you've used Vector, you're familiar with the general flavor of List. The user of a List generally has precise control over where in the list each element is inserted and can access elements by their integer index (position).
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |