Java程序设计Java程序设计 (16).pdf
-
资源ID:63191337
资源大小:927.98KB
全文页数:28页
- 资源格式: PDF
下载积分:8金币
快捷下载

会员登录下载
微信登录下载
三方登录下载:
微信扫一扫登录
友情提示
2、PDF文件下载后,可能会被浏览器默认打开,此种情况可以点击浏览器菜单,保存网页到桌面,就可以正常下载了。
3、本站不支持迅雷下载,请使用电脑自带的IE浏览器,或者360浏览器、谷歌浏览器下载即可。
4、本站资源下载后的文档和图纸-无水印,预览文档经过压缩,下载后原文更清晰。
5、试题试卷类文档,如果标题没有明确说明有答案则都视为没有答案,请知晓。
|
Java程序设计Java程序设计 (16).pdf
61.JavaCollection2.ListArrayListLinkedListIterator3.SetHashSet4.MapHashMap5.6.1.Java(Java Collection Framework)1.-Javajava.utilListArrayList,LinkedListJava1.-JDKCollectionListSetMapArrayListLinkedListHashSetTreeSetHashMapTreeMap2.List2.1 Collection2.2 List2.3 ArrayList2.4 LinkedList2.5 IteratorCollectionListSetMapArrayListLinkedListHashSetTreeSetHashMapTreeMap2.Listboolean add(Object o)oboolean addAll(Collection c)cvoid clear()boolean remove(Object o)oboolean removeAll(Collection c)cboolean isEmpty()boolean contains(Object o)oboolean containsAll(Collection c)cIterator iterator()Iteratorint size()Collection2.ListListListListListvoid add(int index,Object o)oListindexboolean addAll(int index,Collection c)cListindexObject get(int index)indexObject remove(int index)indexObject set(int index,Object o)indexoint indexOf(Object o)oListint lastIndexOf(Object o)oListList subList(int from,int to)from()to()2.ListArrayListArrayListadd()get()ArrayListjava.utilArrayListArrayList2.ListLinkedListListLinkedListLinkedListLinkedList121233122.ListLinkedListLinkedListLinkedListvoid add(int index,Object o)indexovoid addFirst(Object o)ovoid addLast(Object o)oObject getFirst()Object getLast()Object removeFirst()Object removeLast()ArrayListLinkedListArrayListLinkedList()JDKIteratorCollectionIteratorIteratorArrayListObject2.ListIterator12调用next()的返回值调用next()之前第1次调用next()第2次调用next()hasNext()返回false迭代器终止.3.Set3.1 HashSet3.2 TreeSetCollectionListSetMapArrayListLinkedListHashSetTreeSetHashMapTreeMap3.SetSetSetHashSetTreeSetHashSetTreeSet3.SetHashSetHashSet(HashSetDemo01.java)HashSetadd()HashSethashCode()hashhash该位置是否有对象存在equal()判断是否相等是是否否HashSetObjecthashCode()equals()StudentHashSet(HashSetDemo02.java)3.SetTreeSetTreeSetSortedSetSortedSetComparator comparator()Object first()Object last()SortedSet headSet(Object o)o()SortedSet subSet(Object from,Object to)from()to()SortedSet tailSet(Object o)o()TreeSet(TreeSetDemo01.java)4.Map4.1 Map4.2 HashMap4.3 TreeMapCollectionListSetMapArrayListLinkedListHashSetTreeSetHashMapTreeMap4.MapMapMap staff=new HashMap();staff.put(20150001,new Employee();staff.put(20150002,new Employee();Employee e=staff.get(20150001);e=staff.remove(20150001);system.out.println(staff.size();4.MapMapvoid put(Object key,Object value)Object get(Object key)nullboolean containsKey(Object key)keytrueboolean containsValue(Object value)valuetrueSet keySet()SetCollection values()CollectionSetMap.Entry entrySet()Set4.MapHashMapHashMapput()get()HashMapDemo01.javaMap(HashMapDemo02.java)(HashMapDemo03.java)4.Map-TreeMapTreeMapSortedMapTreeMapkey(TreeMapDemo01.java)5.Object5.ObjectGenericDemo01.java5.GenericDemo01.javaArrayListStringEclipseArrayList list=new ArrayList();6.()JavaEEStudentSchoolTestDemo.java6.StudentCourseTestDemo.javaCollection MapListSetMap