From 2f674e79d42e7d36225fa9ac7ecefbc5bc62d325 Mon Sep 17 00:00:00 2001
From: vnugent <public@vaughnnugent.com>
Date: Thu, 13 Jul 2023 13:20:25 -0400
Subject: Checkpoint, kind of working clustering

---
 .../src/Clustering/NodeDiscoveryCollection.cs      | 156 +++++++++++++++++++++
 1 file changed, 156 insertions(+)
 create mode 100644 lib/VNLib.Data.Caching.Extensions/src/Clustering/NodeDiscoveryCollection.cs

(limited to 'lib/VNLib.Data.Caching.Extensions/src/Clustering/NodeDiscoveryCollection.cs')

diff --git a/lib/VNLib.Data.Caching.Extensions/src/Clustering/NodeDiscoveryCollection.cs b/lib/VNLib.Data.Caching.Extensions/src/Clustering/NodeDiscoveryCollection.cs
new file mode 100644
index 0000000..b0e53e1
--- /dev/null
+++ b/lib/VNLib.Data.Caching.Extensions/src/Clustering/NodeDiscoveryCollection.cs
@@ -0,0 +1,156 @@
+/*
+* Copyright (c) 2023 Vaughn Nugent
+* 
+* Library: VNLib
+* Package: VNLib.Data.Caching.Extensions
+* File: NodeDiscoveryCollection.cs 
+*
+* NodeDiscoveryCollection.cs is part of VNLib.Data.Caching.Extensions which is part of the larger 
+* VNLib collection of libraries and utilities.
+*
+* VNLib.Data.Caching.Extensions is free software: you can redistribute it and/or modify 
+* it under the terms of the GNU Affero General Public License as 
+* published by the Free Software Foundation, either version 3 of the
+* License, or (at your option) any later version.
+*
+* VNLib.Data.Caching.Extensions is distributed in the hope that it will be useful,
+* but WITHOUT ANY WARRANTY; without even the implied warranty of
+* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+* GNU Affero General Public License for more details.
+*
+* You should have received a copy of the GNU Affero General Public License
+* along with this program.  If not, see https://www.gnu.org/licenses/.
+*/
+
+using System;
+using System.Linq;
+using System.Collections;
+using System.Collections.Generic;
+
+namespace VNLib.Data.Caching.Extensions.Clustering
+{
+    /// <summary>
+    /// Represents a collection of available cache nodes from a discovery process
+    /// </summary>
+    public sealed class NodeDiscoveryCollection : INodeDiscoveryCollection
+    {
+        private string? _selfId;
+        private LinkedList<CacheNodeAdvertisment> _peers;
+
+        /// <summary>
+        /// Initializes a new empty <see cref="NodeDiscoveryCollection"/>
+        /// </summary>
+        public NodeDiscoveryCollection()
+        {
+            _peers = new();
+        }
+
+        /// <summary>
+        /// Manually adds nodes to the collection that were not discovered through the discovery process
+        /// </summary>
+        /// <param name="nodes">The nodes to add</param>
+        public void AddManualNodes(IEnumerable<CacheNodeAdvertisment> nodes)
+        {
+            //Get only the nodes that are not already in the collection
+            IEnumerable<CacheNodeAdvertisment> newPeers = nodes.Except(_peers);
+
+            //Add them to the end of the collection
+            foreach (CacheNodeAdvertisment peer in newPeers)
+            {
+                _peers.AddLast(peer);
+            }
+        }
+
+        /// <summary>
+        /// Sets the id of the current node, so it can be excluded from discovery
+        /// </summary>
+        /// <param name="selfId">The id of the current node to exclude</param>
+        public void SetSelfId(string? selfId) => _selfId = selfId;
+
+        ///<inheritdoc/>
+        public INodeDiscoveryEnumerator BeginDiscovery()
+        {
+            return new NodeEnumerator(new(), _selfId);
+        }
+
+        ///<inheritdoc/>
+        public INodeDiscoveryEnumerator BeginDiscovery(IEnumerable<CacheNodeAdvertisment> initialPeers)
+        {
+            //Init new enumerator with the initial peers
+            return new NodeEnumerator(new(initialPeers), _selfId);
+        }
+
+        ///<inheritdoc/>
+        public void CompleteDiscovery(INodeDiscoveryEnumerator enumerator)
+        {
+            _ = enumerator ?? throw new ArgumentNullException(nameof(enumerator));
+
+            //Capture all nodes from the enumerator and store them as our current peers
+            _peers = (enumerator as NodeEnumerator)!.Peers;
+        }
+
+        ///<inheritdoc/>
+        public CacheNodeAdvertisment[] GetAllNodes()
+        {
+            //Capture all current peers
+            return _peers.ToArray();
+        }
+
+        private sealed record class NodeEnumerator(LinkedList<CacheNodeAdvertisment> Peers, string? SelfNodeId) : INodeDiscoveryEnumerator
+        {
+            private bool isInit;
+
+            //Keep track of the current node in the collection so we can move down the list
+            private LinkedListNode<CacheNodeAdvertisment>? _currentNode;
+
+            public CacheNodeAdvertisment Current => _currentNode?.Value;
+            object IEnumerator.Current => _currentNode?.Value;
+
+
+            ///<inheritdoc/>
+            public bool MoveNext()
+            {
+                if (!isInit)
+                {
+                    _currentNode = Peers.First;
+                    isInit = true;
+                }
+                else
+                {
+                    //Move to the next peer in the collection
+                    _currentNode = _currentNode?.Next;
+                }
+
+                return _currentNode?.Value != null;
+            }
+
+            ///<inheritdoc/>
+            public void OnPeerDiscoveryComplete(IEnumerable<CacheNodeAdvertisment> discoveredPeers)
+            {
+                //Get only the peers from the discovery that are not already in the collection, or ourselves
+                IEnumerable<CacheNodeAdvertisment> newPeers = discoveredPeers.Except(Peers);
+
+                if (!string.IsNullOrWhiteSpace(SelfNodeId))
+                {
+                    //remove ourselves from the list
+                    newPeers = newPeers.Where(p => !SelfNodeId.Equals(p.NodeId, StringComparison.OrdinalIgnoreCase));
+                }
+
+                //Add them to the end of the collection 
+                foreach (CacheNodeAdvertisment ad in newPeers)
+                {
+                    Peers.AddLast(ad);
+                }
+            }
+
+            public void Reset()
+            {
+                //Go to the first node
+                _currentNode = Peers.First;
+            }
+
+            public void Dispose()
+            { }
+        }
+    }
+}
-- 
cgit