diff options
Diffstat (limited to 'mcs/class/Mono.C5/UserGuideExamples/Sets.cs')
| -rw-r--r-- | mcs/class/Mono.C5/UserGuideExamples/Sets.cs | 175 |
1 files changed, 0 insertions, 175 deletions
diff --git a/mcs/class/Mono.C5/UserGuideExamples/Sets.cs b/mcs/class/Mono.C5/UserGuideExamples/Sets.cs deleted file mode 100644 index 0ddbeef7a06..00000000000 --- a/mcs/class/Mono.C5/UserGuideExamples/Sets.cs +++ /dev/null @@ -1,175 +0,0 @@ -/*
- Copyright (c) 2003-2006 Niels Kokholm and Peter Sestoft
- Permission is hereby granted, free of charge, to any person obtaining a copy
- of this software and associated documentation files (the "Software"), to deal
- in the Software without restriction, including without limitation the rights
- to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
- copies of the Software, and to permit persons to whom the Software is
- furnished to do so, subject to the following conditions:
-
- The above copyright notice and this permission notice shall be included in
- all copies or substantial portions of the Software.
-
- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
- OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- SOFTWARE.
-*/
-
-// C5 example: functional sets 2004-12-21
-
-// Compile with
-// csc /r:C5.dll Sets.cs
-
-using System;
-using System.Text;
-using C5;
-using SCG = System.Collections.Generic;
-
-namespace Sets {
- // The class of sets with item type T, implemented as a subclass of
- // HashSet<T> but with functional infix operators * + - that compute
- // intersection, union and difference functionally. That is, they
- // create a new set object instead of modifying an existing one.
- // The hasher is automatically created so that it is appropriate for
- // T. In particular, this is true when T has the form Set<W> for
- // some W, since Set<W> implements ICollectionValue<W>.
-
- public class Set<T> : HashSet<T> {
- public Set(SCG.IEnumerable<T> enm) : base() {
- AddAll(enm);
- }
-
- public Set(params T[] elems) : this((SCG.IEnumerable<T>)elems) { }
-
- // Set union (+), difference (-), and intersection (*):
-
- public static Set<T> operator +(Set<T> s1, Set<T> s2) {
- if (s1 == null || s2 == null)
- throw new ArgumentNullException("Set+Set");
- else {
- Set<T> res = new Set<T>(s1);
- res.AddAll(s2);
- return res;
- }
- }
-
- public static Set<T> operator -(Set<T> s1, Set<T> s2) {
- if (s1 == null || s2 == null)
- throw new ArgumentNullException("Set-Set");
- else {
- Set<T> res = new Set<T>(s1);
- res.RemoveAll(s2);
- return res;
- }
- }
-
- public static Set<T> operator *(Set<T> s1, Set<T> s2) {
- if (s1 == null || s2 == null)
- throw new ArgumentNullException("Set*Set");
- else {
- Set<T> res = new Set<T>(s1);
- res.RetainAll(s2);
- return res;
- }
- }
-
- // Equality of sets; take care to avoid infinite loops
-
- public static bool operator ==(Set<T> s1, Set<T> s2) {
- return EqualityComparer<Set<T>>.Default.Equals(s1, s2);
- }
-
- public static bool operator !=(Set<T> s1, Set<T> s2) {
- return !(s1 == s2);
- }
-
- public override bool Equals(Object that) {
- return this == (that as Set<T>);
- }
-
- public override int GetHashCode() {
- return EqualityComparer<Set<T>>.Default.GetHashCode(this);
- }
-
- // Subset (<=) and superset (>=) relation:
-
- public static bool operator <=(Set<T> s1, Set<T> s2) {
- if (s1 == null || s2 == null)
- throw new ArgumentNullException("Set<=Set");
- else
- return s1.ContainsAll(s2);
- }
-
- public static bool operator >=(Set<T> s1, Set<T> s2) {
- if (s1 == null || s2 == null)
- throw new ArgumentNullException("Set>=Set");
- else
- return s2.ContainsAll(s1);
- }
-
- public override String ToString() {
- StringBuilder sb = new StringBuilder();
- sb.Append("{");
- bool first = true;
- foreach (T x in this) {
- if (!first)
- sb.Append(",");
- sb.Append(x);
- first = false;
- }
- sb.Append("}");
- return sb.ToString();
- }
- }
-
- class MyTest {
- public static void Main(String[] args) {
- Set<int> s1 = new Set<int>(2, 3, 5, 7, 11);
- Set<int> s2 = new Set<int>(2, 4, 6, 8, 10);
- Console.WriteLine("s1 + s2 = {0}", s1 + s2);
- Console.WriteLine("s1 * s2 = {0}", s1 * s2);
- Console.WriteLine("s1 - s2 = {0}", s1 - s2);
- Console.WriteLine("s1 - s1 = {0}", s1 - s1);
- Console.WriteLine("s1 + s1 == s1 is {0}", s1 + s1 == s1);
- Console.WriteLine("s1 * s1 == s1 is {0}", s1 * s1 == s1);
- Set<Set<int>> ss1 = new Set<Set<int>>(s1, s2, s1 + s2);
- Console.WriteLine("ss1 = {0}", ss1);
- Console.WriteLine("IntersectionClose(ss1) = {0}", IntersectionClose(ss1));
- Set<Set<int>> ss2 =
- new Set<Set<int>>(new Set<int>(2, 3), new Set<int>(1, 3), new Set<int>(1, 2));
- Console.WriteLine("ss2 = {0}", ss2);
- Console.WriteLine("IntersectionClose(ss2) = {0}", IntersectionClose(ss2));
- }
-
- // Given a set SS of sets of Integers, compute its intersection
- // closure, that is, the least set TT such that SS is a subset of TT
- // and such that for any two sets t1 and t2 in TT, their
- // intersection is also in TT.
-
- // For instance, if SS is {{2,3}, {1,3}, {1,2}},
- // then TT is {{2,3}, {1,3}, {1,2}, {3}, {2}, {1}, {}}.
-
- // Both the argument and the result is a Set<Set<int>>
-
- static Set<Set<T>> IntersectionClose<T>(Set<Set<T>> ss) {
- IQueue<Set<T>> worklist = new CircularQueue<Set<T>>();
- foreach (Set<T> s in ss)
- worklist.Enqueue(s);
- HashSet<Set<T>> tt = new HashSet<Set<T>>();
- while (worklist.Count != 0) {
- Set<T> s = worklist.Dequeue();
- foreach (Set<T> t in tt) {
- Set<T> ts = t * s;
- if (!tt.Contains(ts))
- worklist.Enqueue(ts);
- }
- tt.Add(s);
- }
- return new Set<Set<T>>((SCG.IEnumerable<Set<T>>)tt);
- }
- }
-}
|