代码搜索：HashSet
找到约 4,767 项符合「HashSet」的源代码
代码结果 4,767
www.eeworm.com/read/181347/9257592
java exercise18_1.java
import java.util.*;
public class Exercise18_1{
public static void main(String[]args){
Set set1=new HashSet();
Set set2=new HashSet();
Setset3=new
www.eeworm.com/read/377362/9279054
java test.java
import GlobalVariable.*;
import InputDemo.*;
import java.io.*;
import java.util.HashSet;
import java.util.Arrays;
public class Test
{
static String[] a=new String[1000];
static String[] b=
www.eeworm.com/read/377362/9279059
bak test.java.bak
import GlobalVariable.*;
import InputDemo.*;
import java.io.*;
import java.util.HashSet;
import java.util.Arrays;
public class Test
{
static String[] a=new String[1000];
static String[] b=
www.eeworm.com/read/373369/9460766
java sets.java
//: net/mindview/util/Sets.java
package net.mindview.util;
import java.util.*;
public class Sets {
public static Set union(Set a, Set b) {
Set result = new HashSet(a);
www.eeworm.com/read/373369/9460976
java setofinteger.java
//: holding/SetOfInteger.java
import java.util.*;
public class SetOfInteger {
public static void main(String[] args) {
Random rand = new Random(47);
Set intset = new HashSet
www.eeworm.com/read/373369/9461196
java byteset.java
//: generics/ByteSet.java
import java.util.*;
public class ByteSet {
Byte[] possibles = { 1,2,3,4,5,6,7,8,9 };
Set mySet =
new HashSet(Arrays.asList(possibles));
// But y
www.eeworm.com/read/169058/9883455
java sets.java
//: net/mindview/util/Sets.java
package net.mindview.util;
import java.util.*;
public class Sets {
public static Set union(Set a, Set b) {
Set result = new HashSet(a);
www.eeworm.com/read/169058/9883705
java setofinteger.java
//: holding/SetOfInteger.java
import java.util.*;
public class SetOfInteger {
public static void main(String[] args) {
Random rand = new Random(47);
Set intset = new HashSet
www.eeworm.com/read/169058/9883929
java byteset.java
//: generics/ByteSet.java
import java.util.*;
public class ByteSet {
Byte[] possibles = { 1,2,3,4,5,6,7,8,9 };
Set mySet =
new HashSet(Arrays.asList(possibles));
// But y
www.eeworm.com/read/356247/10234138
txt day06.txt
集合：保存多个其他对象的对象，不能保存简单类型
List：有序(存放元素的顺序)，可重复的集合
ArrayList：实质就是一个会自动增长的数组
查询效率比较高，增删的效率比较低，适用于查询比较频繁，增删动作较少的元素管理的集合。
加载大批量的数据时，先进行手动扩容(就是调用ensureCapacity(int minCapacity)方法)，这样可以提高效率。
...