Collection Framework in Java (original) (raw)

2023, Sourasish Mondal

A collection Framework is a collection of interfaces and classes. A Collection Framework is considered as architecture for representing and manipulating collections. It is a library, a toolbox of interfaces and classes. This toolbox holds various collection interfaces and also classes that serves as a powerful, object-oriented alternative to arrays. Interfaces allow collection to be manipulated independently of the details of their representation. The Java Collection Framework (JCF) is a set of classes and interfaces that provide a unified way to store and manipulate collections of objects. The JCF is designed to be flexible and extensible, and it provides a wide variety of collection types to meet the needs of different applications. This paper provides an overview of the JCF, including its major components, such as lists, sets, maps, and queues. The paper also discusses the benefits of using the JCF, such as its performance, scalability, and ease of use.

JAVA COLLECTION FRAMEWORK

Introduction: A collection Framework is a collection of interfaces and classes. A Collection Framework is considered as architecture for representing and manipulating collections. It is a library, a toolbox of interfaces and classes. This toolbox holds various collection interfaces and also classes that serves as a powerful, object oriented alternative to arrays. Interfaces allow collection to be manipulated independently of the details of their representation. History: Collection Implementations in pre JDK1.2 version of the java platform structure classes but was not contain any collections framework. The array, the vector and hash table classes are the standard methods for grouping the java objects and unfortunately which were not easy to extend and did not implement a standard member interface. Several new and independent frameworks are developed to address the need for reusable collection data structures. Amongst all, the most used being Doug Lea's collection package and object space generic collection library (JGL), whose goal was consistence with STL. The Collection framework was designed and developed by Josph Bloch and was introduced in JDK1.2. It reused many ideas and classes from Doung Lea's collection package. Doung Lea later developed a concurrency package, with new collection related classes. These updated version utilities was introduced in JDK 5.0 as of JSR 166. Benefits of JCF: JCF reduces programming efforts. It reduces efforts by providing useful data structures and algorithm. It make user free to program instead of putting efforts on low-level pluming to make it work. JCF increases program speed and quality. Collection Framework provides high performance with high implementations of useful data structures and algorithms. The implementations of every interface are interchangeable because these programs can be easily works or functions by switching collection implementations. As user is free from the drudgery of writing own data structures, user finds more time to work on improving quality and performance of program. Missing Data Structure in JCF: Java Collection framework includes number of data structures; still there are some data structures that are missing such as Trie, Extensible Hashing, and Polyphase Merge. Trie : It is also known as digital tree and sometimes radix tree or prefix tree. It is basically an ordered tree data structure that is used to store associative array where most of the times keys are strings. Just like a binary search tree, in tree no node stores the key associated with that node other than this its position in tree explains the key with which it is associated. Extensible Hashing: It was described by Ronald Fagin in 1979. It is a type of hash system which treats a hash as a bit string and for bucket lookup it uses a trie. Just because of hierarchical nature of system, rehashing is an incremental operation. Cascade Merge: Cascade merge sort is almost similar to the polyphase merge sort but it uses a simpler distribution. Along with this the merge is slower in cascade merge as compare to polyphase merge if the number of files are less than six but it works faster when there are more than six files.

Architecture for Encapsulation of " Collection Framework Classes " in JAVA for Reducing the Complexity

—A Collection Framework classes introduced in the Java core library after the release of JDK version-1.2. Collection framework classes were built up by Joshua Bloch. Although, Collection framework Classes are widely practiced in today's environment to develop Java application. Java application programs suffer from a major problem of complexity and un-scalability. In this paper, the author proposed a design of the framework which encapsulates Java collection framework classes of complex hierarchy into a single class that is based on some certain parameters (e.g. data structure used, uniqueness, synchronization). The proposed framework can greatly lessen the efforts required to learn and use of complex hierarchy of Collection Framework. Further, the proposed framework (Architecture) uses the identical method signature as the original Collection Framework, which makes it easy to understand for those who earlier use Collection Framework for data storage. Thus, the users can easily shift to the new framework.

Implementation, Use, and Sharing of Data Structures in Java Programs

ABSTRACT Programs manipulate data. For many classes of programs, this data is organized into data structures. Java's standard libraries include robust, general-purpose data structure implementations; however, standard implementations may not meet developers' needs, forcing them to implement ad-hoc data structures. The well-organized use of standard data structure implementations contributes to good modularity.

Loading...

Loading Preview

Sorry, preview is currently unavailable. You can download the paper by clicking the button above.