本文整理汇总了C#中HashedSet.Count方法的典型用法代码示例。如果您正苦于以下问题：C# HashedSet.Count方法的具体用法？C# HashedSet.Count怎么用？C# HashedSet.Count使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类HashedSet的用法示例。
在下文中一共展示了HashedSet.Count方法的6个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C#代码示例。
示例1: AddToHashSetMustWork
public void AddToHashSetMustWork()
{
var hashedSet = new HashedSet<int>();
var key = 5;
hashedSet.Add(key);
Assert.AreEqual(hashedSet.Count(), 1);
}示例2: RemoveFromHashSetMustWork
public void RemoveFromHashSetMustWork()
{
var hashedSet = new HashedSet<int>();
var key = 10;
hashedSet.Add(key);
hashedSet.Remove(key);
Assert.AreEqual(hashedSet.Count(), 0);
}示例3: Main
/* Task 5:
* Implement the data structure "set" in a class HashedSet<T> using your class HashTable<K,T>
* to hold the elements. Implement all standard set operations like Add(T), Find(T), Remove(T),
* Count, Clear(), union and intersect.
*/
static void Main(string[] args)
{
var setOne = new HashedSet<int>();
for (int i = 0; i < 50; i++)
{
setOne.Add(i);
}
Console.WriteLine(setOne.Count());
for (int i = 25; i < 50; i++)
{
setOne.Remove(i);
}
Console.WriteLine(setOne.Count());
var setTwo = new HashedSet<int>();
setTwo.Add(100);
setTwo.Add(101);
setTwo.Add(102);
setTwo.Add(103);
setTwo.Add(104);
setTwo.Add(105);
//Saving all results from Union
setOne = setOne.Union(setTwo);
Console.WriteLine(setOne.Count());
setTwo.Clear();
for (int i = 10; i < 25; i++)
{
setTwo.Add(i);
}
//Saving only the intersect Results
setOne = setOne.Intersect(setTwo);
Console.WriteLine(setOne.Count());
}示例4: Main
public static void Main()
{
// Input array that contains three duplicate strings.
string[] arrayWithDuplicatedValues = { "cat", "dog", "cat", "leopard", "tiger", "cat" };
// Display the array.
Console.WriteLine("---------- Array with duplicated items ----------");
Console.WriteLine(string.Join(",", arrayWithDuplicatedValues));
// Use HashSet constructor to ensure unique strings.
var hashedSet = new HashedSet<string>();
for (int i = 0; i < arrayWithDuplicatedValues.Length; i++)
{
hashedSet.Add(arrayWithDuplicatedValues[i]);
}
// Display the resulting array.
Console.WriteLine("\n---------- HashedSet without duplicated items ----------");
foreach (var item in hashedSet)
{
Console.WriteLine(item);
}
Console.WriteLine("\n---------- Test Find(cat) ----------");
Console.WriteLine(hashedSet.Find("cat"));
Console.WriteLine("\n---------- Test Remove(cat) and print all elements again ----------");
hashedSet.Remove("cat");
foreach (var item in hashedSet)
{
Console.WriteLine(item);
}
Console.WriteLine("\n---------- Test Count() ----------");
Console.WriteLine(hashedSet.Count());
Console.WriteLine("\n---------- Test Clear() and print count ----------");
hashedSet.Clear();
Console.WriteLine(hashedSet.Count());
}示例5: HashSetCountWorksCorectWithAddOfElements
public void HashSetCountWorksCorectWithAddOfElements()
{
var hashSet = new HashedSet<int>();
var expectedCount = 50;
for (int i = 0; i < expectedCount; i++)
{
hashSet.Add(i);
}
Assert.AreEqual(expectedCount, hashSet.Count());
}示例6: HashSetCountWorksCorectWithAddAndRemoveOfElements
public void HashSetCountWorksCorectWithAddAndRemoveOfElements()
{
var hashedSet = new HashedSet<int>();
var removedElementsCount = 10;
var expectedCount = 50 - removedElementsCount;
for (int i = 0; i < 50; i++)
{
hashedSet.Add(i);
}
for (int i = 5; i < removedElementsCount + 5; i++)
{
hashedSet.Remove(i);
}
Assert.AreEqual(expectedCount, hashedSet.Count());
}