zoukankan      html  css  js  c++  java
  • Java Collections Framework知识结构目录

     The core collection interfaces are the foundation of the Java Collections Framework.

    The Java Collections Framework hierarchy consists of two distinct interface trees:

    • The first tree starts with the Collection interface, which provides for the basic functionality used by all collections, such as add and remove methods. Its subinterfaces — SetList, and Queue — provide for more specialized collections.
    • The Set interface does not allow duplicate elements. This can be useful for storing collections such as a deck of cards or student records. The Set interface has a subinterface, SortedSet, that provides for ordering of elements in the set.

    • The List interface provides for an ordered collection, for situations in which you need precise control over where each element is inserted. You can retrieve elements from a List by their exact position.

    • The Queue interface enables additional insertion, extraction, and inspection operations. Elements in a Queue are typically ordered in on a FIFO basis.

    • The Deque interface enables insertion, deletion, and inspection operations at both the ends. Elements in a Deque can be used in both LIFO and FIFO.

    • The second tree starts with the Map interface, which maps keys and values similar to a Hashtable.

    • Map's subinterface, SortedMap, maintains its key-value pairs in ascending order or in an order specified by a Comparator.

    These interfaces allow collections to be manipulated independently of the details of their representation.

    Java集合框架结构图

    由于从网上看到的那些Java集合框架结构图,

    不能正确的体现出JDK中Java Collection Framework的继承结构,

    反复抄袭,没有验证其正确性,故自己参考JDK1.8源码,将层次继承结构画出

    Java集合框架结构图如下:

    1、Iterable接口定义的方法

    2、Collection接口定义的方法

    3、…… 

    **************************************************************************************************************************************************

    【版权所有,转载请注明原文链接。】 文中有不妥或者错误的地方还望指出。如果你有更好的建议,可以给我留言讨论,共同进步! 感谢您耐心的读完本篇文章。 

     **************************************************************************************************************************************************

  • 相关阅读:
    UVA 11354
    HDU 4081 Qin Shi Huang's National Road System 最小/次小生成树的性质
    UVA 10269 Adventure of Super Mario floyd dp
    UVA 11280 Flying to Fredericton 最短路DP
    【专题】树状数组
    【专题】Subsequence
    共享python代码模块
    完全背包
    POJ 3253 Fence Repair
    POJ 3069 Saruman's Army
  • 原文地址:https://www.cnblogs.com/vimx86/p/6689394.html
Copyright © 2011-2022 走看看