// Copyright (c) 2002,2003,2004, R?diger Klaehn
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
//
// * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
// * Neither the name of lambda computing nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
#region Using directives
using System;
using System.Collections;
using System.Collections.Generic;
#endregion
namespace Lambda.Collections.Generic
{
[Serializable]
public class Set : ICollection, IEnumerable,
ICollection, IEnumerable
{
[Serializable]
private struct Dummy
{
}
private static Dummy dummy = new Dummy();
private Dictionary data;
public Set()
{
data = new Dictionary();
}
public Set(int capacity)
{
data = new Dictionary(capacity);
}
public Set(Set original)
{
data = new Dictionary(original.data);
}
public Set(IEnumerable original)
{
data = new Dictionary();
AddRange(original);
}
public int Count
{
get { return data.Count; }
}
public void Add(T a)
{
data[a] = dummy;
}
public void AddRange(IEnumerable range)
{
foreach (T a in range)
Add(a);
}
public Set ConvertAll(Converter converter)
{
Set result = new Set(this.Count);
foreach (T element in this)
result.Add(converter(element));
return result;
}
public bool TrueForAll(Predicate predicate)
{
foreach (T element in this)
if (!predicate(element))
return false;
return true;
}
public Set FindAll(Predicate predicate)
{
Set result = new Set();
foreach (T element in this)
if (predicate(element))
result.Add(element);
return result;
}
public void ForEach(Action action)
{
foreach (T element in this)
action(element);
}
public void Clear()
{
data.Clear();
}
public bool Contains(T a)
{
return data.ContainsKey(a);
}
public void CopyTo(T[] array, int index)
{
data.Keys.CopyTo(array, index);
}
public bool Remove(T a)
{
return data.Remove(a);
}
public IEnumerator GetEnumerator()
{
return data.Keys.GetEnumerator();
}
public bool IsReadOnly
{
get { return false; }
}
public static Set operator |(Set a, Set b)
{
Set result = new Set(a);
result.AddRange(b);
return result;
}
public Set Union(IEnumerable b)
{
return this | new Set(b);
}
public static Set operator &(Set a, Set b)
{
Set result = new Set();
foreach (T element in a)
if (b.Contains(element))
result.Add(element);
return result;
}
public Set Intersection(IEnumerable b)
{
return this & new Set(b);
}
public static Set operator -(Set a, Set b)
{
Set result = new Set();
foreach (T element in a)
if (!b.Contains(element))
result.Add(element);
return result;
}
public Set Difference(IEnumerable b)
{
return this - new Set(b);
}
public static Set operator ^(Set a, Set b)
{
Set result = new Set();
foreach (T element in a)
if (!b.Contains(element))
result.Add(element);
foreach (T element in b)
if (!a.Contains(element))
result.Add(element);
return result;
}
public Set SymmetricDifference(IEnumerable b)
{
return this ^ new Set(b);
}
public static Set Empty
{
get { return new Set(0); }
}
public static bool operator <=(Set a, Set b)
{
foreach (T element in a)
if (!b.Contains(element))
return false;
return true;
}
public static bool operator <(Set a, Set b)
{
return (a.Count < b.Count) && (a <= b);
}
public static bool operator >(Set a, Set b)
{
return b < a;
}
public static bool operator >=(Set a, Set b)
{
return (b <= a);
}
public override bool Equals(object obj)
{
Set a = this;
Set b = obj as Set;
if (b == null)
return false;
return a == b;
}
public override int GetHashCode()
{
int hashcode = 0;
foreach (T element in this)
hashcode ^= element.GetHashCode();
return hashcode;
}
void ICollection.CopyTo(Array array, int index)
{
((ICollection) data.Keys).CopyTo(array, index);
}
object ICollection.SyncRoot
{
get { return ((ICollection) data.Keys).SyncRoot; }
}
bool ICollection.IsSynchronized
{
get { return ((ICollection) data.Keys).IsSynchronized; }
}
IEnumerator IEnumerable.GetEnumerator()
{
return ((IEnumerable) data.Keys).GetEnumerator();
}
}
}