Putting your own type in a Set : 设置 « 集合数据结构 « Java

En
Java
1. 图形用户界面
2. 三维图形动画
3. 高级图形
4. 蚂蚁编译
5. Apache类库
6. 统计图
7. 
8. 集合数据结构
9. 数据类型
10. 数据库JDBC
11. 设计模式
12. 开发相关类
13. EJB3
14. 电子邮件
15. 事件
16. 文件输入输出
17. 游戏
18. 泛型
19. GWT
20. Hibernate
21. 本地化
22. J2EE平台
23. 基于J2ME
24. JDK-6
25. JNDI的LDAP
26. JPA
27. JSP技术
28. JSTL
29. 语言基础知识
30. 网络协议
31. PDF格式RTF格式
32. 映射
33. 常规表达式
34. 脚本
35. 安全
36. Servlets
37. Spring
38. Swing组件
39. 图形用户界面
40. SWT-JFace-Eclipse
41. 线程
42. 应用程序
43. Velocity
44. Web服务SOA
45. 可扩展标记语言
Java 教程
Java » 集合数据结构 » 设置屏幕截图 
Putting your own type in a Set
Putting your own type in a Set
  

// : c11:Set2.java
// Putting your own type in a Set.
// From 'Thinking in Java, 3rd ed.' (c) Bruce Eckel 2002
// www.BruceEckel.com. See copyright notice in CopyRight.txt.

import java.util.HashSet;
import java.util.LinkedHashSet;
import java.util.Set;
import java.util.TreeSet;

public class Set2 {

  public static Set fill(Set a, int size) {
    for (int i = 0; i < size; i++)
      a.add(new Integer(i));
    return a;
  }

  public static void test(Set a) {
    fill(a, 10);
    fill(a, 10)// Try to add duplicates
    fill(a, 10);
    a.addAll(fill(new TreeSet()10));
    System.out.println(a);
  }

  public static void main(String[] args) {
    test(new HashSet());
    test(new TreeSet());
    test(new LinkedHashSet());
  }
///:~


           
         
    
  
Related examples in the same category
1. 集, HashSet和TreeSet
2. Things you can do with SetsThings you can do with Sets
3. Set operations: union, intersection, difference, symmetric difference, is subset, is superset
4. 使用SET使用SET
5. Another Set demo
6. 集减法集减法
7. Working with HashSet and TreeSetWorking with HashSet and TreeSet
8. TreeSet演示TreeSet演示
9. Show the union and intersection of two sets
10. Demonstrate the Set interface
11. TreeSet Test
12. Array Set extends AbstractSetArray Set extends AbstractSet
13. Sync Test
14. Set Copy
15. 集和TreeSet
16. Tail
17. What you can do with a TreeSetWhat you can do with a TreeSet
18. Remove all elements from a set
19. Copy all the elements from set2 to set1 (set1 += set2), set1 becomes the union of set1 and set2
20. Remove all the elements in set1 from set2 (set1 -= set2), set1 becomes the asymmetric difference of set1 and set2
21. Get the intersection of set1 and set2, set1 becomes the intersection of set1 and set2
www.java2java.com | Contact Us
Copyright 2010 - 2030 Java Source and Support. All rights reserved.
All other trademarks are property of their respective owners.