本文整理匯總了Java中com.gs.collections.impl.set.mutable.primitive.IntHashSet.clear方法的典型用法代碼示例。如果您正苦於以下問題：Java IntHashSet.clear方法的具體用法？Java IntHashSet.clear怎麽用？Java IntHashSet.clear使用的例子？那麽, 這裏精選的方法代碼示例或許可以為您提供幫助。您也可以進一步了解該方法所在類com.gs.collections.impl.set.mutable.primitive.IntHashSet的用法示例。
在下文中一共展示了IntHashSet.clear方法的3個代碼示例，這些例子默認根據受歡迎程度排序。您可以為喜歡或者感覺有用的代碼點讚，您的評價將有助於係統推薦出更棒的Java代碼示例。
示例1: xtestHashCombineUniqueness
import com.gs.collections.impl.set.mutable.primitive.IntHashSet; //導入方法依賴的package包/類
public void xtestHashCombineUniqueness()
{
final int MAX_COUNT = 2000;
int[] first = new int[MAX_COUNT];
int[] second = new int[MAX_COUNT];
IntHashSet unique = new IntHashSet(MAX_COUNT);
Random rand = new Random(167776191048573L);
for(int i=0;i<MAX_COUNT;i++)
{
// first[i] = rand.nextInt();
first[i] = i;
}
for(int i=0;i<MAX_COUNT;i++)
{
// second[i] = rand.nextInt();
second[i] = i+MAX_COUNT;
}
for(int i=0;i<MAX_COUNT;i++)
{
for(int j=0;j<MAX_COUNT;j++)
{
unique.add((HashUtil.combineHashes(first[i], second[j])& 0x7fffffff) % 4591721);
}
}
System.out.println("combineHash uniqueness "+unique.size());
unique.clear();
for(int i=0;i<MAX_COUNT;i++)
{
for(int j=0;j<MAX_COUNT;j++)
{
unique.add((HashUtil.combineHashesOld(first[i], second[j])& 0x7fffffff) % 4591721);
}
}
System.out.println("combineHashOld uniqueness "+unique.size());
unique.clear();
for(int i=0;i<MAX_COUNT;i++)
{
for(int j=0;j<MAX_COUNT;j++)
{
unique.add((HashUtil.combineHashesHsieh(first[i], second[j])& 0x7fffffff) % 4591721);
}
}
System.out.println("combineHashesHsieh uniqueness "+unique.size());
unique.clear();
for(int i=0;i<MAX_COUNT;i++)
{
for(int j=0;j<MAX_COUNT;j++)
{
unique.add((HashUtil.combineHashesMurmur(first[i], second[j])& 0x7fffffff) % 4591721);
}
}
System.out.println("combineHashesMurmur uniqueness "+unique.size());
unique.clear();
for(int i=0;i<MAX_COUNT;i++)
{
for(int j=0;j<MAX_COUNT;j++)
{
unique.add((HashUtil.combineHashesBad(first[i], second[j])& 0x7fffffff) % 4591721);
}
}
System.out.println("combineHashBad uniqueness "+unique.size());
unique.clear();
}
示例2: xtestHashCombineUniqueness3
import com.gs.collections.impl.set.mutable.primitive.IntHashSet; //導入方法依賴的package包/類
public void xtestHashCombineUniqueness3()
{
final int MAX_COUNT = 2000;
int[] first = new int[MAX_COUNT];
int[] second = new int[MAX_COUNT];
IntHashSet unique = new IntHashSet(MAX_COUNT);
Random rand = new Random(167776191048573L);
for(int i=0;i<MAX_COUNT;i++)
{
// first[i] = rand.nextInt();
first[i] = i;
}
for(int i=0;i<MAX_COUNT;i++)
{
// second[i] = rand.nextInt();
second[i] = i+MAX_COUNT;
}
for(int i=0;i<MAX_COUNT;i++)
{
for(int j=0;j<MAX_COUNT;j++)
{
unique.add(HashUtil.combineHashes(first[i], second[j]) & ((1 << 16) - 1));
}
}
System.out.println("combineHash uniqueness "+unique.size());
unique.clear();
for(int i=0;i<MAX_COUNT;i++)
{
for(int j=0;j<MAX_COUNT;j++)
{
unique.add(HashUtil.combineHashesOld(first[i], second[j]) & ((1 << 16) - 1));
}
}
System.out.println("combineHashOld uniqueness "+unique.size());
unique.clear();
for(int i=0;i<MAX_COUNT;i++)
{
for(int j=0;j<MAX_COUNT;j++)
{
unique.add(HashUtil.combineHashesHsieh(first[i], second[j]) & ((1 << 16) - 1));
}
}
System.out.println("combineHashesHsieh uniqueness "+unique.size());
unique.clear();
for(int i=0;i<MAX_COUNT;i++)
{
for(int j=0;j<MAX_COUNT;j++)
{
unique.add(HashUtil.combineHashesMurmur(first[i], second[j]) & ((1 << 16) - 1));
}
}
System.out.println("combineHashesMurmur uniqueness "+unique.size());
unique.clear();
for(int i=0;i<MAX_COUNT;i++)
{
for(int j=0;j<MAX_COUNT;j++)
{
unique.add(HashUtil.combineHashesBad(first[i], second[j]) & ((1 << 16) - 1));
}
}
System.out.println("combineHashBad uniqueness "+unique.size());
unique.clear();
}
示例3: xtestHashCombineUniqueness2
import com.gs.collections.impl.set.mutable.primitive.IntHashSet; //導入方法依賴的package包/類
public void xtestHashCombineUniqueness2()
{
final int MAX_COUNT = 10000;
IntHashSet unique = new IntHashSet(MAX_COUNT);
for(int j=0;j<MAX_COUNT;j++)
{
unique.add((HashUtil.combineHashes(j, 0) & ((1 << 16) - 1)));
}
System.out.println("combineHash uniqueness "+unique.size());
unique.clear();
for(int j=0;j<MAX_COUNT;j++)
{
unique.add((HashUtil.combineHashesOld(j, 0) & ((1 << 16) - 1)));
}
System.out.println("combineHashOld uniqueness "+unique.size());
unique.clear();
for(int j=0;j<MAX_COUNT;j++)
{
unique.add((HashUtil.combineHashesHsieh(j, 0) & ((1 << 16) - 1)));
}
System.out.println("combineHashesHsieh uniqueness "+unique.size());
unique.clear();
for(int j=0;j<MAX_COUNT;j++)
{
unique.add((HashUtil.combineHashesBad(j, 0) & ((1 << 16) - 1)));
}
System.out.println("combineHashBad uniqueness "+unique.size());
unique.clear();
for(int j=0;j<MAX_COUNT;j++)
{
unique.add((HashUtil.combineHashesMurmur(j, 1) & ((1 << 16) - 1)));
}
System.out.println("combineHashesMurmur uniqueness "+unique.size());
unique.clear();
}