
This is the Title of the Book, eMatter Edition
Copyright © 2007 O’Reilly & Associates, Inc. All rights reserved.
664
|
Chapter 11: Data Structures and Algorithms
The methods defined in Table 11-9 are of particular interest to using a Set<T> object.
if (!this.Contains(set.internalSet[index]))
{
return (false);
}
}
return (true);
}
public string DisplaySet( )
{
if (this.Count == 0)
{
return ("{}");
}
else
{
StringBuilder displayStr = new StringBuilder("{ ");
for (int index = 0; index < (this.Count - 1); index++)
{
displayStr.Append(internalSet[index]);
displayStr.Append(", ");
}
displayStr.Append(internalSet[internalSet.Count - 1]);
displayStr.Append(" }");
return (displayStr.ToString( ));
}
}
public IEnumerator GetEnumerator( )
{
for (int cntr = 0; cntr < internalSet.Count; cntr++)
{
yield return (internalSet[cntr]);
}
}
IEnumerator<T> IEnumerable<T>.GetEnumerator( )
{
for (int cntr = 0; cntr < internalSet.Count; cntr++)
{
yield return (internalSet[cntr]);
}
}
}
Example 11-17. Set class (continued)