Update to version numbers for release of faster cached randoms

cetusfinance · May 23, 2024 · a272c31 · a272c31
1 parent 9eb0b03
commit a272c31
Show file tree

Hide file tree

Showing 3 changed files with 5 additions and 3 deletions.
diff --git a/test/Qwack.Math.Tests/Random/ConstantRandomFacts.cs b/test/Qwack.Math.Tests/Random/ConstantRandomFacts.cs
@@ -19,7 +19,7 @@ public class ConstantRandomFacts
         [Fact]
         public void TestBlockGeneration()
         {
-            var block = new PathBlock(64, 1, 10, 0);
+            var block = new PathBlock(64, 1, 10, 0, 0);
             var retVal = 0.5;
             var gen = new Constant(retVal);
             var fetCollection = new FeatureCollection();

diff --git a/test/Qwack.Math.Tests/Random/SobolFacts.cs b/test/Qwack.Math.Tests/Random/SobolFacts.cs
@@ -48,7 +48,7 @@ public void SmallDimsWorks()
         [Fact]
         public void TestBlockGeneration()
         {
-            var block = new PathBlock(512, 1, 50, 0);
+            var block = new PathBlock(512, 1, 50, 0, 0);
             var gen = new SobolPathGenerator(new SobolDirectionNumbers(s_directionNumbers), 0);
             var fetCollection = new FeatureCollection();
             var engine = new FakeEngine();
@@ -99,6 +99,8 @@ public class FakeEngine : IEngineFeature, ITimeStepsFeature, IPathMappingFeature
 
             public int RoundedNumberOfPaths => throw new NotImplementedException();
 
+            public bool CompactMemoryMode => throw new NotImplementedException();
+
             public void AddDate(DateTime date) => throw new NotImplementedException();
 
             public void AddDates(IEnumerable<DateTime> dates) => throw new NotImplementedException();

diff --git a/test/Qwack.MonteCarlo.Test/Payoffs/Helpers.cs b/test/Qwack.MonteCarlo.Test/Payoffs/Helpers.cs
@@ -32,7 +32,7 @@ public static Mock<IFeatureCollection> GetFeatureCollection()
 
         public static IPathBlock GetBlock(int nSteps)
         {
-            var b = new PathBlock(_nPaths, 2, nSteps, 0);
+            var b = new PathBlock(_nPaths, 2, nSteps, 0, 0);
 
             for (var i = 0; i < _nPaths; i += Vector<double>.Count)
             {