博客没有写作?br />国家大事件几多?/div>
]]>
The collections framework is a unified architecture for representing and manipulating collections, allowing them to be manipulated independently of the details of their representation. It reduces programming effort while increasing performance. It allows for interoperability among unrelated APIs, reduces effort in designing and learning new APIs, and fosters software reuse. The framework is based on fourteen collection interfaces. It includes implementations of these interfaces, and algorithms to manipulate them.Overview
- Overview - An overview of the Collections framework.
- API Reference - An annotated outline of the classes and interfaces comprising the collections framework, with links into the JavaDoc.
- Tutorial - A tutorial introduction to the collections framework with plenty of programming examples.
- API Enhancements in Java SE 6 - An annotated list of API changes between the 5.0 and 6 releases.
- API Enhancements in J2SE 5.0 - An annotated list of API changes between the 1.4 and 5.0 releases.
- API Enhancements in J2SDK 1.4 - An annotated list of API changes between the 1.3 and 1.4 releases.
- Design FAQ- Answers to frequently asked questions concerning the design of the collections framework.
From: http://docs.oracle.com/javase/6/docs/technotes/guides/collections/index.html
]]>
- API Enhancements in Java SE 6 - An annotated list of API changes between the 5.0 and 6 releases.
- API Enhancements in J2SE 5.0 - An annotated list of API changes between the 1.4 and 5.0 releases.
- API Enhancements in J2SDK 1.4 - An annotated list of API changes between the 1.3 and 1.4 releases.
]]>
它实C(jin)Set接口。存入Set的每个元素必L唯一的，因ؓ(f)Set不保存重复元素。但是Set接口不保证维护元素的ơ序Q那里面的元素每ơ顺序如何确定？TODOQ。Set与Collection有完全一L(fng)接口IterableQ同时Setl承?jin)Collection?br />
LinkedHashSethHashSet的查询速度Q且内部使用链表l护元素的顺序（插入的顺序）(j)Q于是在使用q代器便利SetӞl果?x)按元素插入的次序显C?br />
需求如Q?含多个（有重复）(j)元素ArrayListQ去除重复?br />
1Q?可以使用如下略显冗余的代码：(x)
1 public static List removeDuplicateWithOrder(List list) {
2 Set set = new HashSet();
3 List newList = new ArrayList();
4 for (Iterator iter = list.iterator(); iter.hasNext();) {
5 Object element = iter.next();
6 if (set.add(element))
7 newList.add(element);
8 }
9 return newList;
10 }
此方法有滥用set之嫌?br />2 Set set = new HashSet();
3 List newList = new ArrayList();
4 for (Iterator iter = list.iterator(); iter.hasNext();) {
5 Object element = iter.next();
6 if (set.add(element))
7 newList.add(element);
8 }
9 return newList;
10 }
2Q?我们也可以用本文章中提?qing)的LinkedHashSetQ?br />
return new ArrayList<T>(new LinkedHashSet<T>(list));
此方法，既利用set去除?jin)重复，又用linked保持住了(jin)原顺序?br />3Q?貌似apache commons lang中有专门去重复的集合工具?br />
q儿的链表操作是帔RU的Q这也是LinkedHashSet/LinkedHashMap比TreeSet/TreeMap性能更高的原因。当?dng)LinkedHashSet不是thread-safe的，在多U程环境下，需要进行同步包装：(x)
Collections.synchronizedCollection(Collection);
or:
Collections.synchronizedSet(Set);
在用LinkedHashSet的iterator()Ҏ(gu)遍历元素Ӟ如果其他U程有读取操作，也要q行同步Q否则，׃(x)抛出同其它fail-fast一L(fng)׃删除或增加操作而引L(fng)CurrentModificationException?br />or:
Collections.synchronizedSet(Set);
如上两种Ҏ(gu)的效率比较，设ؓ(f)TODOQ?br />1Q?利用set.add(element)Ҏ(gu)Q本质是利用其contains()Ҏ(gu)判断Q而contains()的本质就是遍历?br />JDK doc中写道：(x)
More formally, adds the specified element e to this set if the set contains no element e2 such that (e==null ? e2==null : e.equals(e2)). If this set already contains the element, the call leaves the set unchanged and returns false. In combination with the restriction on constructors, this ensures that sets never contain duplicate elements.
2Q?试数据Q可以用数据量Q?WQ?WQ?0WQ?00W?br />]]>
]]>
]]>
http://www.slideshare.net/thepresentationdesigner/15-kickass-bruce-lee-quotes
]]>
http://developer.51cto.com/col/461/
http://www.google.com/search?q=runtimeexception&ie=utf-8&oe=utf-8&aq=t&rls=org.mozilla:zh-CN:official&client=firefox-a#sclient=psy&hl=en&client=firefox-a&rls=org.mozilla:zh-CN%3Aofficial&source=hp&q=spring3+%E5%BC%82%E5%B8%B8%E5%A4%84%E7%90%86&pbx=1&oq=spring3+%E5%BC%82%E5%B8%B8%E5%A4%84%E7%90%86&aq=f&aqi=&aql=&gs_sm=e&gs_upl=316376l316376l4l316608l1l1l0l0l0l0l0l0ll0l0&fp=1&biw=1280&bih=769&bav=on.2,or.r_gc.r_pw.,cf.osb&cad=b
http://www.infoq.com/cn/news/2011/01/git-adventures-1
http://www.kernel.org/pub/software/scm/git/docs/gittutorial.html
http://www.linuxeden.com/forum/thread-191912-1-1.html
http://books.slashdot.org/story/04/11/12/2042249/How-Tomcat-Works
http://static.springsource.org/spring/docs/3.1.0.M2/spring-framework-reference/html/orm.html#orm-hibernate
http://stackoverflow.com/questions/tagged/spring?sort=faq&pagesize=15
http://xiaolinjava.iteye.com/blog/684292
http://www.donews.com/original/201112/1011333.shtm
http://www.readwriteweb.com/archives/top_10_social_web_products_of_2011.php
http://www.readwriteweb.com/archives/the_10_biggest_web_news_stories_of_2011.php
http://blog.csdn.net/buoll/article/details/1851149
http://www.aygfsteel.com/masen/articles/118701.html
http://www.baidu.com/s?bs=org.springframework.jdbc.datasource.DriverManagerDataSource&f=8&rsv_bp=1&wd=tomcat+jndi&inputT=2640
http://home.51.com/xiaohei267/diary/item/10048051.html
http://blog.csdn.net/wzl002/article/details/5969635
http://www.baidu.com/s?bs=spring+controller+%D7%AA%B7%A2&f=8&rsv_bp=1&wd=spring+3.0+%B4%EE%BD%A8&inputT=7004
http://book.ifeng.com/lianzai/detail_2010_08/25/2309143_11.shtml
http://www.learnamericanenglishonline.com/
http://bulo.hjenglish.com/app/menu/558/
http://bulo.hjenglish.com/menu/zzk?langs=en
]]>
]]>