interlace /source/library/Interlace/Collections/Set.cs

Language C# Lines 376
MD5 Hash 28914fd4a65a5cea19da91003f942c09 Estimated Cost $6,567 (why?)
Repository https://bitbucket.org/VahidN/interlace.git View Raw File View Project SPDX
  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
#region Using Directives and Copyright Notice

// Copyright (c) 2007-2010, Computer Consultancy Pty Ltd
// 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 the Computer Consultancy Pty Ltd 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 COMPUTER CONSULTANCY PTY LTD 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.

using System;
using System.Collections.Generic;
using System.Text;

#endregion

namespace Interlace.Collections
{
    [Serializable]
    public class Set<T> : IEnumerable<T>
    {
        Dictionary<T, int> _members;

        public Set()
        {
            _members = new Dictionary<T, int>();
        }

        public Set(params T[] members)
            : this(members as IEnumerable<T>)
        { }

        public Set(IEnumerable<T> members)
            : this()
        {
            foreach(T item in members)
            {
                _members[item] = 1;
            }
        }

        /// <summary>
        /// Deprecated.  Use the IEnumerable Constructor instead.
        /// </summary>
        /// <param name="members">An enumerable collection of items to put in the set.</param>
        /// <returns>A set initialized with the members.</returns>
        public static Set<T> FromEnumerable(IEnumerable<T> members)
        {
            return new Set<T>(members);
        }

        public int Count
        {
            get { return _members.Count; }
        }

        public Set<T> Copy()
        {
            return Set<T>.FromEnumerable(this);
        }

        public override bool Equals(object obj)
        {
            Set<T> rhs = obj as Set<T>;

            if (rhs == null) return false;

            if (Count != rhs.Count) return false;

            // If the lhs is a subset of the rhs:
            foreach (T item in _members.Keys)
            {
                if (!rhs._members.ContainsKey(item)) return false;
            }

            // And if the rhs is a subset of the lhs:
            foreach (T item in rhs._members.Keys)
            {
                if (!_members.ContainsKey(item)) return false;
            }

            // Then by definition, the sets are equal:
            return true;
        }

        public override int GetHashCode()
        {
            int hashCode = _members.Count;

            foreach (T item in _members.Keys)
            {
                hashCode ^= item.GetHashCode();
            }

            return hashCode;
        }

        public override string ToString()
        {
            if (Count == 0) return "{}";

            StringBuilder stringList = new StringBuilder();

            foreach (T item in _members.Keys)
            {
                if (stringList.Length != 0) stringList.Append(", ");

                stringList.Append(item.ToString());
            }

            stringList.Insert(0, "{ ");
            stringList.Append(" }");

            return stringList.ToString();
        }

        public T[] ToArray()
        {
            T[] array = new T[_members.Keys.Count];

            int i = 0;

            foreach (T item in _members.Keys)
            {
                array[i] = item;
                i++;
            }

            return array;
        }

        public bool Contains(T item)
        {
            return _members.ContainsKey(item);
        }

        public bool IsSubsetOf(Set<T> rhs)
        {
            foreach (T item in _members.Keys)
            {
                if (!rhs._members.ContainsKey(item)) return false;
            }

            return true;
        }

        public static Set<T> Union(Set<T> lhs, Set<T> rhs)
        {
            Set<T> newSet = new Set<T>();

            foreach (T item in lhs._members.Keys)
            {
                newSet._members[item] = 1;
            }

            foreach (T item in rhs._members.Keys)
            {
                newSet._members[item] = 1;
            }

            return newSet;
        }

        public static Set<T> Intersection(Set<T> lhs, Set<T> rhs)
        {
            Set<T> newSet = new Set<T>();

            foreach (T item in lhs._members.Keys)
            {
                if (rhs._members.ContainsKey(item))
                {
                    newSet._members[item] = 1;
                }
            }

            return newSet;
        }

        public static Set<T> Difference(Set<T> lhs, Set<T> rhs)
        {
            Set<T> newSet = new Set<T>();

            foreach (T item in lhs._members.Keys)
            {
                if (!rhs._members.ContainsKey(item))
                {
                    newSet._members[item] = 1;
                }
            }

            return newSet;
        }

        public void Clear()
        {
            _members.Clear();
        }

        public void UnionUpdate(T item)
        {
            _members[item] = 1;
        }

        public void UnionUpdate(Set<T> rhs)
        {
            foreach (T item in rhs._members.Keys)
            {
                _members[item] = 1;
            }
        }

        public void UnionUpdate(IEnumerable<T> rhs)
        {
            foreach (T item in rhs)
            {
                _members[item] = 1;
            }
        }

        public void DifferenceUpdate(T rhs)
        {
            _members.Remove(rhs);
        }

        public void DifferenceUpdate(Set<T> rhs)
        {
            foreach (T item in rhs._members.Keys)
            {
                _members.Remove(item);
            }
        }

        public void DifferenceUpdate(IEnumerable<T> rhs)
        {
            foreach (T item in rhs)
            {
                _members.Remove(item);
            }
        }

        public void IntersectionUpdate(Set<T> rhs)
        {
            List<T> itemsToRemove = new List<T>();

            foreach (T item in _members.Keys)
            {
                if (!rhs._members.ContainsKey(item)) itemsToRemove.Add(item);
            }

            foreach (T itemToRemove in itemsToRemove)
            {
                _members.Remove(itemToRemove);
            }
        }

        public static Set<T> operator +(Set<T> lhs, Set<T> rhs)
        {
            return Set<T>.Union(lhs, rhs);
        }

        public static Set<T> operator *(Set<T> lhs, Set<T> rhs)
        {
            return Set<T>.Intersection(lhs, rhs);
        }

        public static Set<T> operator -(Set<T> lhs, Set<T> rhs)
        {
            return Set<T>.Difference(lhs, rhs);
        }

        public static bool operator ==(Set<T> lhs, Set<T> rhs)
        {
            return Set<T>.Equals(lhs, rhs);
        }

        public static bool operator !=(Set<T> lhs, Set<T> rhs)
        {
            return !Set<T>.Equals(lhs, rhs);
        }

        public IEnumerator<T> GetEnumerator()
        {
            return _members.Keys.GetEnumerator();
        }

        System.Collections.IEnumerator System.Collections.IEnumerable.GetEnumerator()
        {
            return _members.Keys.GetEnumerator();
        }

        public T AnyItem
        {
            get
            {
                // Grab a random item:
                foreach (T item in _members.Keys)
                {
                    return item;
                }

                // Or if there wasn't one, throw an exception:
                throw new InvalidOperationException(
                    "There must be at least one item in the set for this operation.");
            }
        }

        /// <summary>
        /// Maps the set through a function.
        /// </summary>
        /// <typeparam name="TOutput">The type of elements in the resulting set.</typeparam>
        /// <param name="converter">The function to map the set through.</param>
        /// <returns>The resulting set.</returns>
        /// <remarks>If the function is not one to one, the cadinality of the resulting 
        /// set may differ from this set; this is why the function is not called "ConvertAll", despite
        /// being similar to the same method on lists.</remarks>
        public Set<TOutput> Map<TOutput>(Converter<T, TOutput> converter)
        {
            Set<TOutput> resultSet = new Set<TOutput>();

            foreach (T element in _members.Keys)
            {
                resultSet.UnionUpdate(converter(element));
            }

            return resultSet;
        }

        public TOutput Fold<TOutput>(Folder<T, TOutput> folder, TOutput initial)
        {
            TOutput accumulator = initial;

            foreach (T element in _members.Keys)
            {
                accumulator = folder(element, accumulator);
            }

            return accumulator;
        }

        public Set<T> Filter(Predicate<T> predicate)
        {
            Set<T> resultSet = new Set<T>();

            foreach (T element in _members.Keys)
            {
                if (predicate(element))
                {
                    resultSet.UnionUpdate(element);
                }
            }

            return resultSet;
        }
    }

    public delegate TAccumulated Folder<TInput, TAccumulated>(TInput input, TAccumulated accumulated);
}
Back to Top