AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |
Back to Blog
Basic data structures in java3/21/2023 ![]() ![]() The Hashtable class provides a means of organizing data based on some user-defined key structure.įor example, in an address list hash table you could store and sort data based on a key such as ZIP code rather than on a person's name. Since the Dictionary class is abstract, it provides only the framework for a key-mapped data structure rather than a specific implementation.įor more details about this class, check The Dictionary. This is useful in cases where you want to be able to access data via a particular key rather than an integer index. The Dictionary class is an abstract class that defines a data structure for mapping keys to values. In other words, the last element you added to the stack is the first one to come back off.įor more details about this class, check The Stack. When you pull an element off the stack, it comes off the top. You can think of a stack literally as a vertical stack of objects when you add a new element, it gets stacked on top of the others. The Stack class implements a last-in-first-out (LIFO) stack of elements. The nice thing about using the Vector class is that you don't have to worry about setting it to a specific size upon creation it shrinks and grows automatically when necessary.įor more details about this class, check The Vector. Like an array, elements of a Vector object can be accessed via an index into the vector. ![]() The Vector class is similar to a traditional Java array, except that it can grow as necessary to accommodate new elements. This class is very useful in cases where you need to keep up with a set of Boolean values you just assign a bit to each value and set or clear it as appropriate.įor more details about this class, check The BitSet. The BitSet class implements a group of bits or flags that can be set and cleared individually. To have more detail about this interface, check The Enumeration. The Enumeration interface defines a means to retrieve successive elements from a data structure.įor example, Enumeration defines a method called nextElement that is used to get the next element in a data structure that contains multiple elements. The Enumeration interface isn't itself a data structure, but it is very important within the context of other data structures. These data structures consist of the following interface and classes −Īll these classes are now legacy and Java-2 has introduced a new framework called Collections Framework, which is discussed in the next chapter. The data structures provided by the Java utility package are very powerful and perform a wide range of functions. ![]()
0 Comments
Read More
Leave a Reply. |