fix dh (by plagiarism), refactor pcapparser

Novaria.Common/Mono/Mono.Math.Prime.Generator/NextPrimeFinder.cs

@@ -0,0 +1,55 @@
+//
+// Mono.Math.Prime.Generator.NextPrimeFinder.cs - Prime Generator
+//
+// Authors:
+//	Ben Maurer
+//
+// Copyright (c) 2003 Ben Maurer. All rights reserved
+//
+
+//
+// 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.
+//
+
+using System;
+
+namespace Mono.Math.Prime.Generator {
+
+	/// <summary>
+	/// Finds the next prime after a given number.
+	/// </summary>
+#if INSIDE_CORLIB
+	internal
+#else
+	public
+#endif
+	class NextPrimeFinder : SequentialSearchPrimeGeneratorBase {
+		
+		protected override BigInteger GenerateSearchBase (int bits, object Context) 
+		{
+			if (Context == null) 
+				throw new ArgumentNullException ("Context");
+
+			BigInteger ret = new BigInteger ((BigInteger)Context);
+			ret.SetBit (0);
+			return ret;
+		}
+	}
+}