Initial IEnumerable

Author: jburnett

AMT.LinqExtensions/LinqExtensions.cs

@@ -24,6 +24,11 @@ public static T Random<T> (this ICollection<T> elements)
 			return elements.ElementAt(_randomizer.Next(0, elements.Count - 1));
 		}
 
+		public static T Random<T> (this IEnumerable<T> elements)
+		{
+			return elements.ElementAt(_randomizer.Next(0, elements.Count() - 1));
+		}
+
 		#endregion Public LINQ methods
 	}
 

netcore-extensions

@@ -0,0 +1 @@
+Subproject commit 1ad4abd22374234c6e60c1a7e548a75ea84e8df9

restify-sample

@@ -0,0 +1 @@
+Subproject commit b8bda74535cc756f57160939c19b79947da677ed

test/LinqExtensionsTests.cs

@@ -33,6 +33,21 @@ public void random_element_from_int_list()
 		}
 
 
+		[Fact]
+		public void random_element_from_int_list_by_IEnumerable()
+		{
+			List<int> list = new List<int>();
+			for (int i = 0; i < 250; ++i) { list.Add(i); }
+
+			IEnumerable<int> enumr = list;
+			foreach (var itr in enumr)
+			{
+				int curr = enumr.Random();
+				curr.Should().BeGreaterThan(-1);
+			}
+		}
+
+
 		[Fact]
 		public void random_element_from_single_item_list()
 		{
@@ -48,6 +63,25 @@ public void random_element_from_single_item_list()
 			}
 		}
 
+
+		[Fact]
+		public void random_element_from_()
+		{
+			
+			SortedList<int, string> list = new SortedList<int, string>();
+			for (int i = 0; i < 250; ++i) { list.Add(i, i.ToString()); }
+
+			// Get random elements from ~1/10 of the list.  The probability of sequential duplicates
+			//	increases when covering more of the available elements.
+			KeyValuePair<int, string> prev = new KeyValuePair<int, string>();
+			for (int i = 0; i < list.Count/10; ++i)
+			{
+				var curr = list.Random();
+				curr.Should().NotBe(prev);
+				prev = curr;
+			}
+		}
+
 		#endregion Positive tests