sql-server-samples/samples/features/sql-clr/TransitiveClosure/TransitiveClosureAggregate.cs

using System;
using System.IO;
using System.Data.SqlTypes;
using System.Text;
using Microsoft.SqlServer.Server;
using System.Collections.Generic;
using System.Collections;

namespace TransitiveClosure
{
    /// <summary>
    /// Class that represents a group of numbers in the same cluster.
    /// </summary>
    public class Group: IEnumerable<int>
    {
        private int? _groupRoot = null;
                
        private Dictionary<int, bool> _group = new Dictionary<int, bool>();
        public Dictionary<int, bool>.KeyCollection Elements => _group.Keys;
        public int Count => _group.Keys.Count;

        public bool ContainsElement(int element)
        {
            return _group.ContainsKey(element);
        }

        /// <summary>
        /// Adds a pair of numbers to a group.
        /// </summary>
        /// <param name="from"></param>
        /// <param name="to"></param>
        public void AddUnique(int from, int to)
        {
            if (_groupRoot == null) _groupRoot = from; 
            this.AddIfNotExists(from);
            this.AddIfNotExists(to);
        }
        /// <summary>
        /// Adds the element into the current group. 
        /// </summary>
        /// <param name="element">The number that should be added.</param>
        public void Add(int element)
        {
            if (_groupRoot == null) _groupRoot = element;
            _group.Add(element, true);
        }

        /// <summary>
        /// Adds the element to a group if it is not already there. 
        /// </summary>
        /// <param name="element"></param>
        public void AddIfNotExists(int element)
        {
            if (!_group.ContainsKey(element))
            {
                _group.Add(element, true);
            }
        }

        public void MergeWith(Group source)
        {
            foreach (var e in source.Elements)
            {
                this.AddIfNotExists(e);
            }
        }

        public IEnumerator<int> GetEnumerator()
        {
            foreach(var e in _group.Keys)
            {
                yield return e;
            }
        }

        IEnumerator IEnumerable.GetEnumerator()
        {
            return (IEnumerator)GetEnumerator();
        }

        public override string ToString()
        {
            return string.Format($"[{_groupRoot.Value}]");
        }
    }

    public class GroupSet: IEnumerable<Group>
    {
        private List<Group> _groupSet = new List<Group>();
        // This keeps about the distinct numbers and in which group they are
        private Dictionary<int, Group> _numbers = new Dictionary<int, Group>();
        private int _merges = 0;

        public int Groups => _groupSet.Count;
        public int Numbers => _numbers.Count;
        public int Merges => _merges;

        public void Add(Group group)
        {
            _groupSet.Add(group);

            foreach(int e in group)
            {
                if (!_numbers.ContainsKey(e))
                    _numbers.Add(e, group);
                else
                    throw new ApplicationException("Element is already assigned to a group");
            }
        }

        public List<Group> FindInGroups(int from, int to)
        {
            var result = new List<Group>();
            
            if (_numbers.ContainsKey(from)) result.Add(_numbers[from]);
            if (_numbers.ContainsKey(to)) result.Add(_numbers[to]);

            return result;                        
        }

        public void AddPair(int from, int to)
        {
            //Find if the inputValue is already in a group
            var foundInGroups = FindInGroups(from, to);

            // no item matches: create a new group and add both the values to it            
            if (foundInGroups.Count == 0)
            {
                var ng = new Group();
                ng.AddIfNotExists(from);
                ng.AddIfNotExists(to);

                _groupSet.Add(ng);

                if (!_numbers.ContainsKey(from)) _numbers.Add(from, ng);
                if (!_numbers.ContainsKey(to)) _numbers.Add(to, ng);
            }

            // one item match, add the related item to the same group
            if (foundInGroups.Count == 1)
            {
                var g = foundInGroups[0];
                g.AddUnique(from, to);

                if (!_numbers.ContainsKey(from)) _numbers.Add(from, g); else _numbers[from] = g;
                if (!_numbers.ContainsKey(to)) _numbers.Add(to, g); else _numbers[to] = g;
            }

            // if there is a match for both items but in two different groups
            // merge them into just one group and delete the other
            if (foundInGroups.Count == 2)
            {
                var g1 = foundInGroups[0];
                var g2 = foundInGroups[1];

                if (g1 == g2) return;

                // Always move the smaller group
                if (g2.Count > g1.Count)
                {
                    var t = g1;
                    g1 = g2;
                    g2 = t;
                }

                if (!_numbers.ContainsKey(from)) _numbers.Add(from, g1); else _numbers[from] = g1;
                if (!_numbers.ContainsKey(to)) _numbers.Add(to, g1); else _numbers[to] = g1;

                g1.MergeWith(g2);              

                foreach(var e in g2)
                {
                    if (!_numbers.ContainsKey(e)) _numbers.Add(e, g1); else _numbers[e] = g1;
                }

                _merges += 1;

                _groupSet.Remove(g2);
            }
        }

        public IEnumerator<Group> GetEnumerator()
        {
            foreach(var g in _groupSet)
            {
                yield return g;
            }
        }

        IEnumerator IEnumerable.GetEnumerator()
        {
            return (IEnumerator)GetEnumerator();
        }
    }

    /// <summary>
    /// Aggregate that takes a pair of numbers that represents an edge in some graph/relation.
    /// As an output, returns groups of reachable edges, for example:
    /// {
    ///     "0":[1,2,3,4],
    ///     "1":[5,6,7],
    ///     "2":[8,9]
    /// }
    /// </summary>
    [Serializable]
    [SqlUserDefinedAggregateAttribute(Format.UserDefined, MaxByteSize = -1)]
    public class Aggregate : IBinarySerialize
    {
        private GroupSet _groupSet;

        public int Groups => _groupSet.Groups;
        public int Numbers => _groupSet.Numbers;
        public int Merges => _groupSet.Merges;

        public void Init()
        {
            _groupSet = new GroupSet();
        }

        public void Accumulate(int inputValue1, int inputValue2)
        {
            _groupSet.AddPair(inputValue1, inputValue2);                       
        }

        public void Merge(Aggregate value)
        {
            foreach (var g in value._groupSet)
            {
                int? pe = null;
                foreach (var ce in g)
                {
                    if (pe.HasValue)
                    {
                        this.Accumulate(pe.Value, ce);
                    }
                    pe = ce;
                }
            }
        }     

        public SqlString Terminate()
        {
            return this.ToString();
        }

        public override string ToString()
        {
            int c = 0;
            StringBuilder sb = new StringBuilder();
            sb.Append("{");
            foreach (var g in this._groupSet)
            {
                sb.Append("\"" + c + "\":[");

                var ea = new int[g.Elements.Count];
                g.Elements.CopyTo(ea, 0);

                sb.Append(string.Join(",", ea));
                
                sb.Append("],");

                c += 1;
            }
            if (sb.Length > 1) sb.Remove(sb.Length - 1, 1);
            sb.Append("}");
            return sb.ToString();
        }

        public void Read(BinaryReader r)
        {
            if (r == null) throw new ArgumentNullException("r");
            _groupSet = new GroupSet();

            // Group Count
            int g = r.ReadInt32();

            // For Each Group
            for (int j = 0; j < g; j++)
            {
                var l = new Group();               

                // List Size (or Values Count)
                int s = r.ReadInt32();

                // Read values and put them in the list
                for (int i = 0; i < s; i++)
                {
                    l.Add(r.ReadInt32());
                }

                // Add list to dictionary
                _groupSet.Add(l);
            }
        }

        public void Write(BinaryWriter w)
        {
            if (w == null) throw new ArgumentNullException("w IS NULL");

            // Group count
            w.Write(_groupSet.Groups);

            foreach (var g in _groupSet)
            {
                // Values Count
                w.Write(g.Count);

                // Values
                foreach (var e in g)
                {
                    w.Write(e);
                }
            }
        }
    }
}