diff --git a/.gitignore b/.gitignore index cc094fee..6f1243d3 100644 --- a/.gitignore +++ b/.gitignore @@ -17,6 +17,7 @@ x64/ build/ [Bb]in/ [Oo]bj/ +.vs/ # Enable "build/" folder in the NuGet Packages folder since NuGet packages use it for MSBuild targets !packages/*/build/ diff --git a/.paket/Paket.Restore.targets b/.paket/Paket.Restore.targets index e7c1bc0c..55292f31 100644 --- a/.paket/Paket.Restore.targets +++ b/.paket/Paket.Restore.targets @@ -43,23 +43,26 @@ true - $(NoWarn);NU1603 + $(NoWarn);NU1603;NU1604;NU1605;NU1608 - /usr/bin/shasum $(PaketRestoreCacheFile) | /usr/bin/awk '{ print $1 }' - /usr/bin/shasum $(PaketLockFilePath) | /usr/bin/awk '{ print $1 }' + /usr/bin/shasum "$(PaketRestoreCacheFile)" | /usr/bin/awk '{ print $1 }' + /usr/bin/shasum "$(PaketLockFilePath)" | /usr/bin/awk '{ print $1 }' - + - + + + + $([System.IO.File]::ReadAllText('$(PaketRestoreCacheFile)')) @@ -69,11 +72,19 @@ true + + + + + + + + $(MSBuildProjectDirectory)\obj\$(MSBuildProjectFile).paket.references.cached @@ -82,7 +93,9 @@ $(MSBuildProjectDirectory)\$(MSBuildProjectName).paket.references $(MSBuildProjectDirectory)\paket.references - $(MSBuildProjectDirectory)\obj\$(MSBuildProjectFile).$(TargetFramework).paket.resolved + + false + true true references-file-or-cache-not-found @@ -101,24 +114,29 @@ - + true - target-framework '$(TargetFramework)' + target-framework '$(TargetFramework)' or '$(TargetFrameworks)' files @(PaketResolvedFilePaths) - + + - + + false + true + + - + - + $([System.String]::Copy('%(PaketReferencesFileLines.Identity)').Split(',')[0]) $([System.String]::Copy('%(PaketReferencesFileLines.Identity)').Split(',')[1]) @@ -126,7 +144,9 @@ %(PaketReferencesFileLinesInfo.PackageVersion) - All + All + runtime + true @@ -183,8 +203,8 @@ - - + + // Build library & test project Target "Build" (fun _ -> - !! solutionFile - |> MSBuildRelease "" "Rebuild" - |> ignore + DotNetCli.Build id ) // -------------------------------------------------------------------------------------- @@ -138,44 +132,9 @@ Target "Build" (fun _ -> Target "RunTests" (fun _ -> !! testAssemblies - |> NUnit (fun p -> - { p with - DisableShadowCopy = true - TimeOut = TimeSpan.FromMinutes 20. - OutputFile = "TestResults.xml" }) + |> Expecto id ) -#if MONO -#else -// -------------------------------------------------------------------------------------- -// SourceLink allows Source Indexing on the PDB generated by the compiler, this allows -// the ability to step through the source code of external libraries https://github.com/ctaggart/SourceLink - -Target "SourceLink" (fun _ -> - let baseUrl = sprintf "%s/%s/{0}/%%var2%%" gitRaw (project.ToLower()) - use repo = new GitRepo(__SOURCE_DIRECTORY__) - - let addAssemblyInfo (projFileName:String) = - match projFileName with - | Fsproj -> (projFileName, "**/AssemblyInfo.fs") - | Csproj -> (projFileName, "**/AssemblyInfo.cs") - | Vbproj -> (projFileName, "**/AssemblyInfo.vb") - - !! "src/**/*.??proj" - |> Seq.map addAssemblyInfo - |> Seq.iter (fun (projFile, assemblyInfo) -> - let proj = VsProj.LoadRelease projFile - logfn "source linking %s" proj.OutputFilePdb - let files = proj.Compiles -- assemblyInfo - // TODO: repo.VerifyChecksums files - // TODO: proj.VerifyPdbChecksums files - proj.CreateSrcSrv baseUrl repo.Commit (repo.Paths files) - Pdbstr.exec proj.OutputFilePdb proj.OutputFilePdbSrcSrv - ) -) - -#endif - // -------------------------------------------------------------------------------------- // Build a NuGet package @@ -350,10 +309,6 @@ Target "All" DoNothing =?> ("ReleaseDocs",isLocalBuild) "All" -#if MONO -#else - =?> ("SourceLink", Pdbstr.tryFind().IsSome ) -#endif ==> "NuGet" ==> "BuildPackage" diff --git a/build.sh b/build.sh index 8e04801c..c3e25da2 100755 --- a/build.sh +++ b/build.sh @@ -6,5 +6,5 @@ if [ $exit_code -ne 0 ]; then exit $exit_code fi -export VisualStudioVersion=14.0 +export VisualStudioVersion=15.0 mono packages/FAKE/tools/FAKE.exe $@ --fsiargs -d:MONO build.fsx \ No newline at end of file diff --git a/docs/content/PersistentHashMap.fsx b/docs/content/PersistentHashMap.fsx index 9c75ec8a..dcf1d364 100644 --- a/docs/content/PersistentHashMap.fsx +++ b/docs/content/PersistentHashMap.fsx @@ -1,5 +1,5 @@ (*** hide ***) -#r "../build/FSharpx.Collections.dll" +#r "../../bin/FSharpx.Collections/net461/FSharpx.Collections.dll" open System diff --git a/docs/content/PersistentHashMapPerformance.fsx b/docs/content/PersistentHashMapPerformance.fsx index 4cb2c5b3..e225e2e2 100644 --- a/docs/content/PersistentHashMapPerformance.fsx +++ b/docs/content/PersistentHashMapPerformance.fsx @@ -1,7 +1,7 @@ (*** hide ***) -#r "../build/FSharpx.Collections.dll" -#r "../lib/System.Runtime.dll" -#r "../packages/Microsoft.Bcl.Immutable.1.0.30/lib/portable-net45+win8+wp8/System.Collections.Immutable.dll" +#r "../../bin/FSharpx.Collections/net461/FSharpx.Collections.dll" +//#r "../lib/System.Runtime.dll" +#r "../../packages/System.Collections.Immutable/lib/portable-net45+win8+wp8+wpa81/System.Collections.Immutable.dll" open System diff --git a/docs/content/PersistentVector.fsx b/docs/content/PersistentVector.fsx index fff73ba4..9a3e5010 100644 --- a/docs/content/PersistentVector.fsx +++ b/docs/content/PersistentVector.fsx @@ -1,5 +1,5 @@ (*** hide ***) -#r "../build/FSharpx.Collections.dll" +#r "../../bin/FSharpx.Collections/net461/FSharpx.Collections.dll" open System diff --git a/docs/content/PersistentVectorPerformance.fsx b/docs/content/PersistentVectorPerformance.fsx index d7b0f105..78186553 100644 --- a/docs/content/PersistentVectorPerformance.fsx +++ b/docs/content/PersistentVectorPerformance.fsx @@ -1,5 +1,5 @@ (*** hide ***) -#r "../build/FSharpx.Collections.dll" +#r "../../bin/FSharpx.Collections/net461/FSharpx.Collections.dll" open System diff --git a/docs/content/csharp/App.config b/docs/content/csharp/App.config index 3e629843..90920ace 100644 --- a/docs/content/csharp/App.config +++ b/docs/content/csharp/App.config @@ -1,54 +1,54 @@ - + - + - - + + - - + + - - + + - - + + - - + + - - + + - - + + - - + + - - + + - - + + - - + + diff --git a/docs/content/csharp/csharp.csproj b/docs/content/csharp/csharp.csproj index 899bb950..c0c218c7 100644 --- a/docs/content/csharp/csharp.csproj +++ b/docs/content/csharp/csharp.csproj @@ -1,5 +1,5 @@  - + Debug @@ -9,7 +9,7 @@ Properties csharp csharp - v4.5 + v4.7.1 512 ..\..\..\ diff --git a/docs/tools/generate.fsx b/docs/tools/generate.fsx index b20eacfb..6312313a 100644 --- a/docs/tools/generate.fsx +++ b/docs/tools/generate.fsx @@ -2,9 +2,13 @@ // Builds the documentation from `.fsx` and `.md` files in the 'docs/content' directory // (the generated documentation is stored in the 'docs/output' directory) // -------------------------------------------------------------------------------------- - +let referenceBinaries = [] // Web site location for the generated documentation +#if TESTING +let website = __SOURCE_DIRECTORY__ + "../output" +#else let website = "/FSharpx.Collections" +#endif let githubLink = "http://github.com/fsprojects/FSharpx.Collections" @@ -29,6 +33,7 @@ open System.IO open Fake.FileHelper open FSharp.Literate open FSharp.MetadataFormat +open FSharp.Formatting.Razor // When called from 'build.fsx', use the public project URL as // otherwise, use the current 'output' directory. @@ -60,6 +65,8 @@ subDirectories (directoryInfo templates) formatting @@ "templates" formatting @@ "templates/reference" ])) +let fsiEvaluator = lazy (Some (FsiEvaluator() :> IFsiEvaluator)) + // Copy static files and CSS + JS from F# Formatting let copyFiles () = CopyRecursive files output true |> Log "Copying file: " @@ -85,33 +92,50 @@ let references = else None let binaries = - directoryInfo bin - |> subDirectories - |> Array.map (fun d -> d.FullName @@ (sprintf "%s.dll" d.Name)) - |> List.ofArray + let manuallyAdded = + referenceBinaries + |> List.map (fun b -> bin @@ b) + + let conventionBased = + directoryInfo bin + |> subDirectories + |> Array.map (fun d -> d.Name, (subDirectories d |> Array.filter(fun x -> x.FullName.ToLower().Contains("net461")) ).[0] ) + |> Array.map (fun (name, d) -> + d.GetFiles() + |> Array.filter (fun x -> + x.Name.ToLower() = (sprintf "%s.dll" name).ToLower()) + |> Array.map (fun x -> x.FullName) + ) + |> Array.concat + |> List.ofArray + + conventionBased @ manuallyAdded let libDirs = - directoryInfo bin - |> subDirectories - |> Array.map (fun d -> d.FullName) - |> List.ofArray + let conventionBasedbinDirs = + directoryInfo bin + |> subDirectories + |> Array.map (fun d -> d.FullName) + |> List.ofArray + + conventionBasedbinDirs @ [bin] // Build API reference from XML comments let buildReference () = CleanDir (output @@ "reference") - MetadataFormat.Generate + RazorMetadataFormat.Generate ( binaries, output @@ "reference", layoutRootsAll.["en"], parameters = ("root", root)::info, sourceRepo = githubLink @@ "tree/master", sourceFolder = __SOURCE_DIRECTORY__ @@ ".." @@ "..", - ?assemblyReferences = references, publicOnly = true,libDirs = libDirs ) // Build documentation from `fsx` and `md` files in `docs/content` let buildDocumentation () = - let subdirs = Directory.EnumerateDirectories(content, "*", SearchOption.AllDirectories) - for dir in Seq.append [content] subdirs do - let sub = if dir.Length > content.Length then dir.Substring(content.Length + 1) else "." + let subdirs = + [ content, docTemplate; ] + for dir, template in subdirs do + let sub = "." // Everything goes into the same output directory here let langSpecificPath(lang, path:string) = path.Split([|'/'; '\\'|], System.StringSplitOptions.RemoveEmptyEntries) |> Array.exists(fun i -> i = lang) @@ -120,11 +144,13 @@ let buildDocumentation () = match key with | Some lang -> layoutRootsAll.[lang] | None -> layoutRootsAll.["en"] // "en" is the default language - Literate.ProcessDirectory - ( dir, docTemplate, output @@ sub, replacements = ("root", root)::info, + RazorLiterate.ProcessDirectory + ( dir, template, output @@ sub, replacements = ("root", root)::info, layoutRoots = layoutRoots, - ?assemblyReferences = references, - generateAnchors = true ) + generateAnchors = true, + processRecursive = false, + includeSource = true, // Only needed for 'side-by-side' pages, but does not hurt others + ?fsiEvaluator = fsiEvaluator.Value ) // Currently we don't need it but it's a good stress test to have it here. // Generate copyFiles() diff --git a/paket.dependencies b/paket.dependencies index 7dbe1b7b..e8c7d1a1 100644 --- a/paket.dependencies +++ b/paket.dependencies @@ -1,14 +1,12 @@ source http://nuget.org/api/v2 -framework: >= net4 +source https://ci.appveyor.com/nuget/fsharp-formatting +nuget Expecto +nuget Expecto.FsCheck nuget FAKE -nuget NUnit.Runners -nuget FSharp.Formatting -nuget FsCheck 0.9.2 -nuget FsUnit -nuget NUnit ~> 2 -nuget NUnit.Runners.Net4 -nuget FSharp.Core redirects: force -nuget SourceLink.Fake +nuget FSharp.Formatting prerelease +nuget FsCheck +nuget FSharp.Core -github fsharp/FAKE modules/Octokit/Octokit.fsx \ No newline at end of file +github fsharp/FAKE modules/Octokit/Octokit.fsx +nuget Expecto.VisualStudio.TestAdapter version_in_path: true \ No newline at end of file diff --git a/paket.lock b/paket.lock index b5da9c24..267b02c4 100644 --- a/paket.lock +++ b/paket.lock @@ -1,43 +1,697 @@ -RESTRICTION: >= net40 NUGET remote: http://www.nuget.org/api/v2 - FAKE (4.61.3) - FsCheck (0.9.2) - FSharp.Compiler.Service (2.0.0.6) - FSharp.Core (4.2.1) - redirects: force - FSharp.Formatting (2.14.4) - FSharp.Compiler.Service (2.0.0.6) - FSharpVSPowerTools.Core (>= 2.3 < 2.4) - FSharpVSPowerTools.Core (2.3) - FSharp.Compiler.Service (>= 2.0.0.3) - FsUnit (1.4.1) - FSharp.Core (>= 3.1.2.5) - NUnit (2.6.4) - Microsoft.Bcl (1.1.10) - restriction: && (>= net40) (< net45) (< portable-win81+wpa81) - Microsoft.Bcl.Build (>= 1.0.14) - Microsoft.Bcl.Build (1.0.21) - import_targets: false, restriction: && (>= net40) (< net45) (< portable-win81+wpa81) - Microsoft.Net.Http (2.2.29) - restriction: && (>= net40) (< net45) (< portable-win81+wpa81) - Microsoft.Bcl (>= 1.1.10) - Microsoft.Bcl.Build (>= 1.0.14) - NUnit (2.6.4) - NUnit.ConsoleRunner (3.6.1) - NUnit.Extension.NUnitProjectLoader (3.5) - NUnit.Extension.NUnitV2Driver (3.6) - NUnit.Extension.NUnitV2ResultWriter (3.5) - NUnit.Extension.TeamCityEventListener (1.0.2) - NUnit.Extension.VSProjectLoader (3.5) - NUnit.Runners (3.6.1) - NUnit.ConsoleRunner (>= 3.6.1) - NUnit.Extension.NUnitProjectLoader (>= 3.5) - NUnit.Extension.NUnitV2Driver (>= 3.6) - NUnit.Extension.NUnitV2ResultWriter (>= 3.5) - NUnit.Extension.TeamCityEventListener (>= 1.0.2) - NUnit.Extension.VSProjectLoader (>= 3.5) - NUnit.Runners.Net4 (2.6.4) - Octokit (0.24) - Microsoft.Net.Http - restriction: && (>= net40) (< net45) (< portable-win81+wpa81) - SourceLink.Fake (1.1) + Argu (5.1) - restriction: || (>= net461) (>= netstandard2.0) + FSharp.Core (>= 4.0.0.1) - restriction: >= net45 + FSharp.Core (>= 4.3.2) - restriction: && (< net45) (>= netstandard2.0) + System.Configuration.ConfigurationManager (>= 4.4) - restriction: && (< net45) (>= netstandard2.0) + Expecto (8.0) + Argu (>= 5.1) - restriction: || (>= net461) (>= netstandard2.0) + Mono.Cecil (>= 0.10) - restriction: || (>= net461) (>= netstandard2.0) + System.Diagnostics.FileVersionInfo (>= 4.3) - restriction: && (< net461) (>= netstandard2.0) + Expecto.FsCheck (8.0) + Expecto (>= 8.0) - restriction: || (>= net461) (>= netstandard2.0) + FsCheck (>= 2.10.4) - restriction: || (>= net461) (>= netstandard2.0) + Expecto.VisualStudio.TestAdapter (9.0.0) - version_in_path: true + Expecto (>= 8.0 < 9.0) - restriction: >= net461 + FSharp.Core (>= 4.0 < 5.0) - restriction: >= net461 + Microsoft.TestPlatform.ObjectModel (>= 15.0 < 16.0) - restriction: >= net461 + Mono.Cecil (>= 0.10 < 0.11) - restriction: >= net461 + Newtonsoft.Json (>= 10.0 < 11.0) - restriction: >= net461 + FAKE (4.64.13) + FsCheck (2.10.10) + FSharp.Core (>= 4.0.0.1) - restriction: || (>= net452) (&& (< netstandard1.6) (>= portable-net45+win8)) (&& (< portable-net45+win8) (>= portable-net45+win8+wp8)) (&& (< portable-net45+win8+wp8) (>= portable-net45+win8+wp8+wpa81)) + FSharp.Core (>= 4.3.4) - restriction: && (< net452) (>= netstandard1.6) + NETStandard.Library (>= 1.6.1) - restriction: && (< net452) (>= netstandard1.6) + System.ValueTuple (>= 4.4) - restriction: && (< net452) (>= netstandard1.6) + FSharp.Compiler.Service (22.0.3) + FSharp.Core (>= 4.1.18) - restriction: || (>= net45) (>= netstandard2.0) + Microsoft.DiaSymReader (>= 1.1) - restriction: || (>= net45) (>= netstandard2.0) + Microsoft.DiaSymReader.PortablePdb (>= 1.2) - restriction: || (>= net45) (>= netstandard2.0) + System.Collections.Immutable (>= 1.3.1) - restriction: || (>= net45) (>= netstandard2.0) + System.Diagnostics.Process (>= 4.1) - restriction: && (< net45) (>= netstandard2.0) + System.Diagnostics.TraceSource (>= 4.0) - restriction: && (< net45) (>= netstandard2.0) + System.Reflection.Emit (>= 4.3) - restriction: && (< net45) (>= netstandard2.0) + System.Reflection.Metadata (>= 1.4.2) - restriction: || (>= net45) (>= netstandard2.0) + System.Reflection.TypeExtensions (>= 4.3) - restriction: && (< net45) (>= netstandard2.0) + System.Runtime.Loader (>= 4.0) - restriction: && (< net45) (>= netstandard2.0) + System.Security.Cryptography.Algorithms (>= 4.3) - restriction: && (< net45) (>= netstandard2.0) + System.ValueTuple (>= 4.4) - restriction: >= net45 + FSharp.Core (4.3.4) + System.Collections (>= 4.0.11) - restriction: && (< net45) (>= netstandard1.6) (< netstandard2.0) + System.Console (>= 4.0) - restriction: && (< net45) (>= netstandard1.6) (< netstandard2.0) + System.Diagnostics.Debug (>= 4.0.11) - restriction: && (< net45) (>= netstandard1.6) (< netstandard2.0) + System.Diagnostics.Tools (>= 4.0.1) - restriction: && (< net45) (>= netstandard1.6) (< netstandard2.0) + System.Globalization (>= 4.0.11) - restriction: && (< net45) (>= netstandard1.6) (< netstandard2.0) + System.IO (>= 4.1) - restriction: && (< net45) (>= netstandard1.6) (< netstandard2.0) + System.Linq (>= 4.1) - restriction: && (< net45) (>= netstandard1.6) (< netstandard2.0) + System.Linq.Expressions (>= 4.1) - restriction: && (< net45) (>= netstandard1.6) (< netstandard2.0) + System.Linq.Queryable (>= 4.0.1) - restriction: && (< net45) (>= netstandard1.6) (< netstandard2.0) + System.Net.Requests (>= 4.0.11) - restriction: && (< net45) (>= netstandard1.6) (< netstandard2.0) + System.Reflection (>= 4.1) - restriction: && (< net45) (>= netstandard1.6) (< netstandard2.0) + System.Reflection.Extensions (>= 4.0.1) - restriction: && (< net45) (>= netstandard1.6) (< netstandard2.0) + System.Resources.ResourceManager (>= 4.0.1) - restriction: && (< net45) (>= netstandard1.6) (< netstandard2.0) + System.Runtime (>= 4.1) - restriction: && (< net45) (>= netstandard1.6) (< netstandard2.0) + System.Runtime.Extensions (>= 4.1) - restriction: && (< net45) (>= netstandard1.6) (< netstandard2.0) + System.Runtime.Numerics (>= 4.0.1) - restriction: && (< net45) (>= netstandard1.6) (< netstandard2.0) + System.Text.RegularExpressions (>= 4.1) - restriction: && (< net45) (>= netstandard1.6) (< netstandard2.0) + System.Threading (>= 4.0.11) - restriction: && (< net45) (>= netstandard1.6) (< netstandard2.0) + System.Threading.Tasks (>= 4.0.11) - restriction: && (< net45) (>= netstandard1.6) (< netstandard2.0) + System.Threading.Tasks.Parallel (>= 4.0.1) - restriction: && (< net45) (>= netstandard1.6) (< netstandard2.0) + System.Threading.Thread (>= 4.0) - restriction: && (< net45) (>= netstandard1.6) (< netstandard2.0) + System.Threading.ThreadPool (>= 4.0.10) - restriction: && (< net45) (>= netstandard1.6) (< netstandard2.0) + System.Threading.Timer (>= 4.0.1) - restriction: && (< net45) (>= netstandard1.6) (< netstandard2.0) + Microsoft.AspNet.Razor (3.2.6) + Microsoft.DiaSymReader (1.2) - restriction: || (>= net45) (>= netstandard2.0) + Microsoft.Net.Compilers (>= 2.3) - restriction: || (>= net20) (>= netstandard1.1) + NETStandard.Library (>= 1.6.1) - restriction: && (< net20) (>= netstandard1.1) + Microsoft.DiaSymReader.PortablePdb (1.4) - restriction: || (>= net45) (>= netstandard2.0) + Microsoft.DiaSymReader (>= 1.2) - restriction: >= portable-net45+win8 + System.Collections (>= 4.3) - restriction: >= netstandard1.1 + System.Collections.Immutable (>= 1.3.1) - restriction: >= portable-net45+win8 + System.Diagnostics.Debug (>= 4.3) - restriction: >= netstandard1.1 + System.Globalization (>= 4.3) - restriction: >= netstandard1.1 + System.IO (>= 4.3) - restriction: >= netstandard1.1 + System.Linq (>= 4.3) - restriction: >= netstandard1.1 + System.Reflection (>= 4.3) - restriction: >= netstandard1.1 + System.Reflection.Metadata (>= 1.4.2) - restriction: >= portable-net45+win8 + System.Reflection.Primitives (>= 4.3) - restriction: >= netstandard1.1 + System.Runtime (>= 4.3) - restriction: >= netstandard1.1 + System.Runtime.Extensions (>= 4.3) - restriction: >= netstandard1.1 + System.Runtime.InteropServices (>= 4.3) - restriction: >= netstandard1.1 + System.Text.Encoding (>= 4.3) - restriction: >= netstandard1.1 + System.Threading (>= 4.3) - restriction: >= netstandard1.1 + Microsoft.Net.Compilers (2.8.2) - restriction: || (>= net45) (>= netstandard2.0) + Microsoft.NETCore.Platforms (2.0.2) - restriction: || (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.3) (< win8)) (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.4) (< win8)) (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.5) (< win8)) (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.6) (< win8)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.4) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.5) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.4) (>= netstandard1.5) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.4) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.5) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= net46) (< netstandard1.3)) (&& (< net45) (>= net46) (< netstandard1.4)) (&& (< net45) (>= net461)) (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (< net45) (>= netstandard2.0)) (&& (>= net46) (< portable-net45+win8+wpa81)) (&& (< net46) (>= netstandard2.0)) (>= netcoreapp2.0) (&& (< netstandard1.0) (>= netstandard1.1) (< portable-net45+win8)) (&& (< netstandard1.0) (>= netstandard1.1) (>= win8)) (&& (< netstandard1.0) (>= netstandard1.1) (< win8)) (&& (>= netstandard1.1) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.1) (>= wp8)) (&& (>= netstandard1.2) (< portable-net45+win8+wpa81)) (&& (< netstandard1.2) (>= uap10.0) (< win8)) (&& (>= netstandard1.3) (< portable-net45+win8+wpa81)) (&& (< netstandard1.3) (>= netstandard2.0)) (&& (< netstandard1.3) (>= uap10.0)) (&& (< netstandard1.3) (< win8) (>= wpa81)) (&& (>= netstandard1.4) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.5) (< portable-net45+win8+wpa81)) (&& (< netstandard1.5) (>= uap10.0)) (&& (>= netstandard1.6) (< portable-net45+win8+wp8+wpa81)) (&& (>= netstandard1.6) (< portable-net45+win8+wpa81)) (&& (< portable-net45+win8+wpa81) (>= uap10.0)) (>= uap10.1) + Microsoft.NETCore.Targets (2.0) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< netstandard2.0) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< monoandroid) (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.3) (< win8)) (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.4) (< win8)) (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.5) (< win8)) (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.6) (< win8)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.4) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.5) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.4) (>= netstandard1.5) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.4) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.5) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= net46) (< netstandard1.4)) (&& (>= net46) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.1) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.2) (< portable-net45+win8+wpa81)) (&& (< netstandard1.2) (>= uap10.0) (< win8)) (&& (>= netstandard1.3) (< portable-net45+win8+wpa81)) (&& (< netstandard1.3) (>= uap10.0) (< win8) (< wpa81)) (&& (>= netstandard1.4) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.5) (< portable-net45+win8+wpa81)) (&& (< netstandard1.5) (>= netstandard1.6) (>= uap10.0)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) (&& (< netstandard1.5) (>= uap10.0) (< win8) (< wpa81)) (&& (>= netstandard1.6) (< portable-net45+win8+wpa81)) (&& (< portable-net45+win8+wpa81) (>= uap10.0)) + Microsoft.TestPlatform.ObjectModel (15.7.2) - version_in_path: true, restriction: >= net461 + System.Reflection.Metadata (>= 1.3) - restriction: || (>= net451) (>= netstandard1.5) + System.Runtime.InteropServices.RuntimeInformation (>= 4.3) - restriction: >= net451 + Microsoft.Win32.Primitives (4.3) - restriction: || (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.3) (< win8)) (&& (< net45) (>= net46) (< netstandard1.4)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (< net45) (>= netstandard2.0)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) (&& (< netstandard1.5) (>= uap10.0) (< win8) (< wpa81)) + Microsoft.NETCore.Platforms (>= 1.1) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + Microsoft.NETCore.Targets (>= 1.1) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Runtime (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + Microsoft.Win32.Registry (4.4) - restriction: && (< net45) (>= netstandard2.0) + Microsoft.NETCore.Platforms (>= 2.0) - restriction: >= netcoreapp2.0 + System.Security.AccessControl (>= 4.4) - restriction: || (>= monoandroid) (>= monotouch) (&& (< net46) (>= netstandard2.0)) (>= net461) (>= netcoreapp2.0) (>= xamarinios) (>= xamarinmac) (>= xamarintvos) (>= xamarinwatchos) + System.Security.Principal.Windows (>= 4.4) - restriction: || (>= monoandroid) (>= monotouch) (&& (< net46) (>= netstandard2.0)) (>= net461) (>= netcoreapp2.0) (>= xamarinios) (>= xamarinmac) (>= xamarintvos) (>= xamarinwatchos) + Mono.Cecil (0.10.0) - version_in_path: true, restriction: || (>= net461) (>= netstandard2.0) + NETStandard.Library (2.0.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net461) (>= netstandard1.0) (< netstandard2.0) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< net20) (>= net45)) (&& (< net20) (>= netstandard2.0)) (&& (>= net45) (< netstandard2.0)) (&& (< net45) (>= netstandard1.1)) (&& (< net452) (>= netstandard1.6)) + Microsoft.NETCore.Platforms (>= 1.1) - restriction: || (&& (>= net45) (< netstandard1.3)) (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (< net45) (>= netstandard2.0)) (&& (>= net46) (< netstandard1.4)) (>= net461) (>= netcoreapp2.0) (&& (>= netstandard1.0) (< portable-net45+win8+wpa81)) (&& (< netstandard1.0) (>= portable-net45+win8) (< win8)) (&& (< netstandard1.0) (< portable-net45+win8) (>= portable-net45+win8+wpa81)) (&& (< netstandard1.0) (>= portable-net45+win8+wp8+wpa81) (< portable-net45+win8+wpa81)) (&& (< netstandard1.0) (>= win8)) (&& (< netstandard1.3) (< win8) (>= wpa81)) (&& (< netstandard1.5) (>= uap10.0)) (>= uap10.1) (>= wp8) + Microsoft.Win32.Primitives (>= 4.3) - restriction: || (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= net46) (< netstandard1.4)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.AppContext (>= 4.3) - restriction: || (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= net46) (< netstandard1.4)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.Collections (>= 4.3) - restriction: || (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= netstandard1.0) (< portable-net45+win8+wpa81) (< wp8)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.Collections.Concurrent (>= 4.3) - restriction: || (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.Console (>= 4.3) - restriction: || (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= net46) (< netstandard1.4)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.Diagnostics.Debug (>= 4.3) - restriction: || (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= netstandard1.0) (< portable-net45+win8+wpa81) (< wp8)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.Diagnostics.Tools (>= 4.3) - restriction: || (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= netstandard1.0) (< portable-net45+win8+wpa81) (< wp8)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.Diagnostics.Tracing (>= 4.3) - restriction: || (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.Globalization (>= 4.3) - restriction: || (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= netstandard1.0) (< portable-net45+win8+wpa81) (< wp8)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.Globalization.Calendars (>= 4.3) - restriction: || (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= net46) (< netstandard1.4)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.IO (>= 4.3) - restriction: || (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= netstandard1.0) (< portable-net45+win8+wpa81) (< wp8)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.IO.Compression (>= 4.3) - restriction: || (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= net46) (< netstandard1.4)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.IO.Compression.ZipFile (>= 4.3) - restriction: || (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= net46) (< netstandard1.4)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.IO.FileSystem (>= 4.3) - restriction: || (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= net46) (< netstandard1.4)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.IO.FileSystem.Primitives (>= 4.3) - restriction: || (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= net46) (< netstandard1.4)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.Linq (>= 4.3) - restriction: || (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= netstandard1.0) (< portable-net45+win8+wpa81) (< wp8)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.Linq.Expressions (>= 4.3) - restriction: || (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= netstandard1.0) (< portable-net45+win8+wpa81) (< wp8)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.Net.Http (>= 4.3.2) - restriction: || (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= net46) (< netstandard1.4)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.Net.Primitives (>= 4.3) - restriction: || (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= netstandard1.0) (< portable-net45+win8+wpa81) (< wp8)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.Net.Sockets (>= 4.3) - restriction: || (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= net46) (< netstandard1.4)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.ObjectModel (>= 4.3) - restriction: || (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= netstandard1.0) (< portable-net45+win8+wpa81) (< wp8)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.Reflection (>= 4.3) - restriction: || (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= netstandard1.0) (< portable-net45+win8+wpa81) (< wp8)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.Reflection.Extensions (>= 4.3) - restriction: || (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= netstandard1.0) (< portable-net45+win8+wpa81) (< wp8)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.Reflection.Primitives (>= 4.3) - restriction: || (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= netstandard1.0) (< portable-net45+win8+wpa81) (< wp8)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.Resources.ResourceManager (>= 4.3) - restriction: || (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= netstandard1.0) (< portable-net45+win8+wpa81) (< wp8)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.Runtime (>= 4.3) - restriction: || (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= netstandard1.0) (< portable-net45+win8+wpa81) (< wp8)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.Runtime.Extensions (>= 4.3) - restriction: || (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= netstandard1.0) (< portable-net45+win8+wpa81) (< wp8)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.Runtime.Handles (>= 4.3) - restriction: || (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.Runtime.InteropServices (>= 4.3) - restriction: || (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.Runtime.InteropServices.RuntimeInformation (>= 4.3) - restriction: || (&& (>= net45) (< netstandard1.3)) (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= net46) (< netstandard1.4)) (&& (< netstandard1.0) (>= portable-net45+win8) (< win8)) (&& (< netstandard1.0) (< portable-net45+win8) (>= portable-net45+win8+wpa81)) (&& (< netstandard1.0) (>= win8)) (&& (< netstandard1.3) (< win8) (>= wpa81)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.Runtime.Numerics (>= 4.3) - restriction: || (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.Security.Cryptography.Algorithms (>= 4.3) - restriction: || (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= net46) (< netstandard1.4)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.Security.Cryptography.Encoding (>= 4.3) - restriction: || (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= net46) (< netstandard1.4)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.Security.Cryptography.Primitives (>= 4.3) - restriction: || (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= net46) (< netstandard1.4)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.Security.Cryptography.X509Certificates (>= 4.3) - restriction: || (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= net46) (< netstandard1.4)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.Text.Encoding (>= 4.3) - restriction: || (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= netstandard1.0) (< portable-net45+win8+wpa81) (< wp8)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.Text.Encoding.Extensions (>= 4.3) - restriction: || (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= netstandard1.0) (< portable-net45+win8+wpa81) (< wp8)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.Text.RegularExpressions (>= 4.3) - restriction: || (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= netstandard1.0) (< portable-net45+win8+wpa81) (< wp8)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.Threading (>= 4.3) - restriction: || (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= netstandard1.0) (< portable-net45+win8+wpa81) (< wp8)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.Threading.Tasks (>= 4.3) - restriction: || (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= netstandard1.0) (< portable-net45+win8+wpa81) (< wp8)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.Threading.Timer (>= 4.3) - restriction: || (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.Xml.ReaderWriter (>= 4.3) - restriction: || (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= net46) (< netstandard1.4)) (&& (>= netstandard1.0) (< portable-net45+win8+wpa81) (< wp8)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.Xml.XDocument (>= 4.3) - restriction: || (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= netstandard1.0) (< portable-net45+win8+wpa81) (< wp8)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + Newtonsoft.Json (10.0.3) - version_in_path: true, restriction: >= net461 + Octokit (0.29) + NETStandard.Library (>= 1.6) - restriction: && (< net45) (>= netstandard1.1) + runtime.debian.8-x64.runtime.native.System.Security.Cryptography.OpenSsl (4.3.2) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.6) (< win8)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.4) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.5) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= net46) (< netstandard1.4) (>= netstandard1.6)) (&& (< netstandard1.5) (>= netstandard1.6) (>= uap10.0)) + runtime.fedora.23-x64.runtime.native.System.Security.Cryptography.OpenSsl (4.3.2) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.6) (< win8)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.4) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.5) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= net46) (< netstandard1.4) (>= netstandard1.6)) (&& (< netstandard1.5) (>= netstandard1.6) (>= uap10.0)) + runtime.fedora.24-x64.runtime.native.System.Security.Cryptography.OpenSsl (4.3.2) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.6) (< win8)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.4) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.5) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= net46) (< netstandard1.4) (>= netstandard1.6)) (&& (< netstandard1.5) (>= netstandard1.6) (>= uap10.0)) + runtime.native.System (4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< monoandroid) (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.3) (< win8)) (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.6) (< win8)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.4) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.5) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< netstandard1.0) (>= netstandard1.1) (< win8)) (&& (< net45) (>= net46) (< netstandard1.4)) (&& (< net45) (>= netstandard2.0)) (&& (< netstandard1.0) (>= netstandard1.1) (< portable-net45+win8)) (&& (< netstandard1.5) (>= netstandard1.6) (>= uap10.0)) (&& (< netstandard1.5) (>= uap10.0) (< win8) (< wpa81)) + Microsoft.NETCore.Platforms (>= 1.1) + Microsoft.NETCore.Targets (>= 1.1) + runtime.native.System.IO.Compression (4.3.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.3) (< win8)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= net46) (< netstandard1.4)) (&& (>= net46) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.1) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.2) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.3) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.4) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.5) (< portable-net45+win8+wpa81)) (&& (< netstandard1.5) (>= uap10.0) (< win8) (< wpa81)) (&& (>= netstandard1.6) (< portable-net45+win8+wpa81)) (&& (< portable-net45+win8+wpa81) (>= uap10.0)) + Microsoft.NETCore.Platforms (>= 1.1) + Microsoft.NETCore.Targets (>= 1.1.1) + runtime.native.System.Net.Http (4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.6) (< win8)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.4) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.5) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= net46) (< netstandard1.4) (>= netstandard1.6)) (&& (< netstandard1.5) (>= netstandard1.6) (>= uap10.0)) + Microsoft.NETCore.Platforms (>= 1.1) + Microsoft.NETCore.Targets (>= 1.1) + runtime.native.System.Security.Cryptography.Apple (4.3.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (< netstandard1.4) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.5) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= net46) (< netstandard1.4) (>= netstandard1.6)) (&& (< netstandard1.5) (>= netstandard1.6) (>= uap10.0)) + runtime.osx.10.10-x64.runtime.native.System.Security.Cryptography.Apple (>= 4.3.1) + runtime.native.System.Security.Cryptography.OpenSsl (4.3.2) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.6) (< win8)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.4) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.5) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= net46) (< netstandard1.4)) (&& (< netstandard1.5) (>= netstandard1.6) (>= uap10.0)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + runtime.debian.8-x64.runtime.native.System.Security.Cryptography.OpenSsl (>= 4.3.2) + runtime.fedora.23-x64.runtime.native.System.Security.Cryptography.OpenSsl (>= 4.3.2) + runtime.fedora.24-x64.runtime.native.System.Security.Cryptography.OpenSsl (>= 4.3.2) + runtime.opensuse.13.2-x64.runtime.native.System.Security.Cryptography.OpenSsl (>= 4.3.2) + runtime.opensuse.42.1-x64.runtime.native.System.Security.Cryptography.OpenSsl (>= 4.3.2) + runtime.osx.10.10-x64.runtime.native.System.Security.Cryptography.OpenSsl (>= 4.3.2) + runtime.rhel.7-x64.runtime.native.System.Security.Cryptography.OpenSsl (>= 4.3.2) + runtime.ubuntu.14.04-x64.runtime.native.System.Security.Cryptography.OpenSsl (>= 4.3.2) + runtime.ubuntu.16.04-x64.runtime.native.System.Security.Cryptography.OpenSsl (>= 4.3.2) + runtime.ubuntu.16.10-x64.runtime.native.System.Security.Cryptography.OpenSsl (>= 4.3.2) + runtime.opensuse.13.2-x64.runtime.native.System.Security.Cryptography.OpenSsl (4.3.2) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.6) (< win8)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.4) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.5) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= net46) (< netstandard1.4) (>= netstandard1.6)) (&& (< netstandard1.5) (>= netstandard1.6) (>= uap10.0)) + runtime.opensuse.42.1-x64.runtime.native.System.Security.Cryptography.OpenSsl (4.3.2) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.6) (< win8)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.4) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.5) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= net46) (< netstandard1.4) (>= netstandard1.6)) (&& (< netstandard1.5) (>= netstandard1.6) (>= uap10.0)) + runtime.osx.10.10-x64.runtime.native.System.Security.Cryptography.Apple (4.3.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (< netstandard1.4) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.5) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= net46) (< netstandard1.4) (>= netstandard1.6)) (&& (< netstandard1.5) (>= netstandard1.6) (>= uap10.0)) + runtime.osx.10.10-x64.runtime.native.System.Security.Cryptography.OpenSsl (4.3.2) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.6) (< win8)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.4) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.5) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= net46) (< netstandard1.4) (>= netstandard1.6)) (&& (< netstandard1.5) (>= netstandard1.6) (>= uap10.0)) + runtime.rhel.7-x64.runtime.native.System.Security.Cryptography.OpenSsl (4.3.2) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.6) (< win8)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.4) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.5) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= net46) (< netstandard1.4) (>= netstandard1.6)) (&& (< netstandard1.5) (>= netstandard1.6) (>= uap10.0)) + runtime.ubuntu.14.04-x64.runtime.native.System.Security.Cryptography.OpenSsl (4.3.2) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.6) (< win8)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.4) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.5) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= net46) (< netstandard1.4) (>= netstandard1.6)) (&& (< netstandard1.5) (>= netstandard1.6) (>= uap10.0)) + runtime.ubuntu.16.04-x64.runtime.native.System.Security.Cryptography.OpenSsl (4.3.2) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.6) (< win8)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.4) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.5) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= net46) (< netstandard1.4) (>= netstandard1.6)) (&& (< netstandard1.5) (>= netstandard1.6) (>= uap10.0)) + runtime.ubuntu.16.10-x64.runtime.native.System.Security.Cryptography.OpenSsl (4.3.2) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.6) (< win8)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.4) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.5) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= net46) (< netstandard1.4) (>= netstandard1.6)) (&& (< netstandard1.5) (>= netstandard1.6) (>= uap10.0)) + System.AppContext (4.3) - restriction: || (&& (< net45) (>= net46) (< netstandard1.4)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.Runtime (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net46) (>= netstandard1.3) (< netstandard1.6)) (&& (< monoandroid) (< netstandard1.3)) + System.Buffers (4.4) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.3) (< win8)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= net46) (< netstandard1.4)) (&& (>= net46) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.1) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.2) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.3) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.4) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.5) (< portable-net45+win8+wpa81)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) (&& (< netstandard1.5) (>= uap10.0) (< win8) (< wpa81)) (&& (>= netstandard1.6) (< portable-net45+win8+wpa81)) (&& (< portable-net45+win8+wpa81) (>= uap10.0)) + System.Diagnostics.Debug (>= 4.3) - restriction: && (>= netstandard1.1) (< netstandard2.0) (< xamarinmac) + System.Diagnostics.Tracing (>= 4.3) - restriction: && (>= netstandard1.1) (< netstandard2.0) (< xamarinmac) + System.Resources.ResourceManager (>= 4.3) - restriction: && (>= netstandard1.1) (< netstandard2.0) (< xamarinmac) + System.Runtime (>= 4.3) - restriction: && (>= netstandard1.1) (< netstandard2.0) (< xamarinmac) + System.Threading (>= 4.3) - restriction: && (>= netstandard1.1) (< netstandard2.0) (< xamarinmac) + System.Collections (4.3) - restriction: || (&& (< monoandroid) (< netstandard1.2) (>= netstandard1.3) (< win8)) (>= net45) (&& (>= net46) (< netstandard1.4)) (&& (>= net46) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (>= netstandard1.1) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (>= netstandard1.2) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (>= netstandard1.3) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (>= netstandard1.4) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.5) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.5) (< win8) (< wpa81)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) (&& (< netstandard1.5) (>= uap10.0) (< win8) (< wpa81)) (>= netstandard1.6) (&& (< portable-net45+win8+wpa81) (>= uap10.0)) + Microsoft.NETCore.Platforms (>= 1.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + Microsoft.NETCore.Targets (>= 1.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + System.Runtime (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + System.Collections.Concurrent (4.3) - restriction: || (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= net46) (< netstandard1.4)) (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) (&& (>= netstandard1.6) (< portable-net45+win8+wpa81)) + System.Collections (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wpa81) + System.Diagnostics.Debug (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wpa81) + System.Diagnostics.Tracing (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wpa81) + System.Globalization (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wpa81) + System.Reflection (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Resources.ResourceManager (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wpa81) + System.Runtime (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.1) (< netstandard1.3) (< win8) (< wpa81)) (< portable-net45+win8+wpa81) + System.Runtime.Extensions (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wpa81) + System.Threading (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wpa81) + System.Threading.Tasks (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.1) (< netstandard1.3) (< win8) (< wpa81)) (< portable-net45+win8+wpa81) + System.Collections.Immutable (1.4) - restriction: || (>= net45) (>= netstandard2.0) + NETStandard.Library (>= 1.6.1) - restriction: && (>= netstandard1.0) (< netstandard2.0) (< xamarinmac) + System.Configuration.ConfigurationManager (4.4.1) - restriction: && (< net45) (>= netstandard2.0) + System.Security.Cryptography.ProtectedData (>= 4.4) - restriction: || (&& (< net461) (>= netstandard2.0)) (>= netcoreapp2.0) + System.Console (4.3.1) - restriction: || (&& (< net45) (>= net46) (< netstandard1.4)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + Microsoft.NETCore.Platforms (>= 1.1) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + Microsoft.NETCore.Targets (>= 1.1.2) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.IO (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Runtime (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Text.Encoding (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Diagnostics.Debug (4.3) - restriction: || (&& (< monoandroid) (< netstandard1.2) (>= netstandard1.3) (< win8)) (>= net45) (&& (>= net46) (< netstandard1.4)) (&& (>= net46) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (>= netstandard1.1) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (>= netstandard1.2) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (>= netstandard1.3) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (>= netstandard1.4) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.5) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.5) (< win8) (< wpa81)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) (&& (< netstandard1.5) (>= uap10.0) (< win8) (< wpa81)) (>= netstandard1.6) (&& (< portable-net45+win8+wpa81) (>= uap10.0)) + Microsoft.NETCore.Platforms (>= 1.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + Microsoft.NETCore.Targets (>= 1.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + System.Runtime (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + System.Diagnostics.DiagnosticSource (4.4.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.3) (< win8)) (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.6) (< win8)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.4) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.5) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= net46) (< netstandard1.4)) (&& (>= net46) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.1) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.2) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.3) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.4) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.5) (< portable-net45+win8+wpa81)) (&& (< netstandard1.5) (>= netstandard1.6) (>= uap10.0)) (&& (< netstandard1.5) (>= uap10.0) (< win8) (< wpa81)) (&& (>= netstandard1.6) (< portable-net45+win8+wpa81)) (&& (< portable-net45+win8+wpa81) (>= uap10.0)) + System.Collections (>= 4.3) - restriction: || (&& (< net45) (< netcoreapp2.0) (>= netstandard1.3) (< xamarinmac)) (&& (< net45) (>= netstandard1.1) (< netstandard1.3)) + System.Diagnostics.Debug (>= 4.3) - restriction: && (< net45) (< netcoreapp2.0) (>= netstandard1.3) (< xamarinmac) + System.Diagnostics.Tracing (>= 4.3) - restriction: || (&& (< net45) (< netcoreapp2.0) (>= netstandard1.3) (< xamarinmac)) (&& (< net45) (>= netstandard1.1) (< netstandard1.3)) + System.Reflection (>= 4.3) - restriction: || (&& (< net45) (< netcoreapp2.0) (>= netstandard1.3) (< xamarinmac)) (&& (< net45) (>= netstandard1.1) (< netstandard1.3)) + System.Runtime (>= 4.3) - restriction: || (&& (< net45) (< netcoreapp2.0) (>= netstandard1.3) (< xamarinmac)) (&& (< net45) (>= netstandard1.1) (< netstandard1.3)) + System.Runtime.Extensions (>= 4.3) - restriction: && (< net45) (< netcoreapp2.0) (>= netstandard1.3) (< xamarinmac) + System.Threading (>= 4.3) - restriction: || (&& (< net45) (< netcoreapp2.0) (>= netstandard1.3) (< xamarinmac)) (&& (< net45) (>= netstandard1.1) (< netstandard1.3)) + System.Diagnostics.FileVersionInfo (4.3) - restriction: && (< net461) (>= netstandard2.0) + Microsoft.NETCore.Platforms (>= 1.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< netstandard1.3)) + System.Globalization (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.IO (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< netstandard1.3)) + System.IO.FileSystem (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< netstandard1.3)) + System.IO.FileSystem.Primitives (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< netstandard1.3)) + System.Reflection.Metadata (>= 1.4.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< netstandard1.3)) + System.Runtime (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< netstandard1.3)) + System.Runtime.Extensions (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< netstandard1.3)) + System.Runtime.InteropServices (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Diagnostics.Process (4.3) - restriction: && (< net45) (>= netstandard2.0) + Microsoft.NETCore.Platforms (>= 1.1) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.4) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + Microsoft.Win32.Primitives (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.4) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + Microsoft.Win32.Registry (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.4) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + runtime.native.System (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.4) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Collections (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.4) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Diagnostics.Debug (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.4) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Globalization (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.4) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.IO (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.4) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net46) (>= netstandard1.3) (< netstandard1.4)) + System.IO.FileSystem (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.4) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.IO.FileSystem.Primitives (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.4) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Resources.ResourceManager (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.4) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Runtime (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.4) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net46) (>= netstandard1.3) (< netstandard1.4)) + System.Runtime.Extensions (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.4) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Runtime.Handles (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.4) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net46) (>= netstandard1.3) (< netstandard1.4)) + System.Runtime.InteropServices (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.4) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Text.Encoding (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.4) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net46) (>= netstandard1.3) (< netstandard1.4)) + System.Text.Encoding.Extensions (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.4) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Threading (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.4) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Threading.Tasks (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.4) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Threading.Thread (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.4) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Threading.ThreadPool (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.4) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Diagnostics.Tools (4.3) - restriction: || (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.3) (< win8)) (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0)) (&& (>= netstandard1.1) (< portable-net45+win8+wp8+wpa81)) (&& (>= netstandard1.1) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.2) (< portable-net45+win8+wp8+wpa81)) (&& (>= netstandard1.3) (< portable-net45+win8+wp8+wpa81)) (&& (>= netstandard1.3) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.4) (< portable-net45+win8+wp8+wpa81)) (&& (>= netstandard1.5) (< portable-net45+win8+wp8+wpa81)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) (&& (< netstandard1.5) (>= uap10.0) (< win8) (< wpa81)) (&& (>= netstandard1.6) (< portable-net45+win8+wp8+wpa81)) (&& (< portable-net45+win8+wp8+wpa81) (>= uap10.0)) + Microsoft.NETCore.Platforms (>= 1.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.0) (< win8) (< wp8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + Microsoft.NETCore.Targets (>= 1.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.0) (< win8) (< wp8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Runtime (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.0) (< win8) (< wp8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Diagnostics.TraceSource (4.3) - restriction: && (< net45) (>= netstandard2.0) + Microsoft.NETCore.Platforms (>= 1.1) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + runtime.native.System (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Collections (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Diagnostics.Debug (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Globalization (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Resources.ResourceManager (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Runtime (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Runtime.Extensions (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Threading (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Diagnostics.Tracing (4.3) - restriction: || (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.3) (< win8)) (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.6) (< win8)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.4) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.5) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= net46) (< netstandard1.4)) (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= net46) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.1) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.2) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.3) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.4) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.5) (< portable-net45+win8+wpa81)) (&& (< netstandard1.5) (>= netstandard1.6) (>= uap10.0)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) (&& (< netstandard1.5) (>= uap10.0) (< win8) (< wpa81)) (&& (>= netstandard1.6) (< portable-net45+win8+wp8+wpa81)) (&& (>= netstandard1.6) (< portable-net45+win8+wpa81)) (&& (< portable-net45+win8+wpa81) (>= uap10.0)) + Microsoft.NETCore.Platforms (>= 1.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.5) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< monoandroid) (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.5) (< win8) (< wpa81)) (< portable-net45+win8+wpa81) + Microsoft.NETCore.Targets (>= 1.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.5) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< monoandroid) (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.5) (< win8) (< wpa81)) (< portable-net45+win8+wpa81) + System.Runtime (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.5) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< monoandroid) (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.5) (< win8) (< wpa81)) (< portable-net45+win8+wpa81) + System.Globalization (4.3) - restriction: || (&& (< monoandroid) (< netstandard1.2) (>= netstandard1.3) (< win8)) (&& (< monoandroid) (< netstandard1.3) (>= netstandard1.4) (< win8) (< wpa81)) (>= net45) (&& (>= net46) (< netstandard1.3)) (&& (>= net46) (< netstandard1.4)) (&& (>= net46) (< portable-net45+win8+wpa81)) (&& (< net46) (>= netstandard2.0)) (&& (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (>= netstandard1.1) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (>= netstandard1.2) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (>= netstandard1.3) (< portable-net45+win8+wpa81)) (&& (< netstandard1.3) (>= uap10.0)) (&& (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (>= netstandard1.4) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.5) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.5) (< win8) (< wpa81)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) (&& (< netstandard1.5) (>= uap10.0) (< win8) (< wpa81)) (>= netstandard1.6) (&& (< portable-net45+win8+wpa81) (>= uap10.0)) + Microsoft.NETCore.Platforms (>= 1.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + Microsoft.NETCore.Targets (>= 1.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + System.Runtime (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + System.Globalization.Calendars (4.3) - restriction: || (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.4) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.5) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.4) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.5) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= net46) (< netstandard1.3)) (&& (< net45) (>= net46) (< netstandard1.4)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (< netstandard1.3) (>= uap10.0)) (&& (< netstandard1.5) (>= netstandard1.6) (>= uap10.0)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + Microsoft.NETCore.Platforms (>= 1.1) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + Microsoft.NETCore.Targets (>= 1.1) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Globalization (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Runtime (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Globalization.Extensions (4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.6) (< win8)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.4) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.5) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= net46) (< netstandard1.4) (>= netstandard1.6)) (&& (< netstandard1.5) (>= netstandard1.6) (>= uap10.0)) + Microsoft.NETCore.Platforms (>= 1.1) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Globalization (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Resources.ResourceManager (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Runtime (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Runtime.Extensions (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Runtime.InteropServices (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.IO (4.3) - restriction: || (&& (< monoandroid) (< netstandard1.2) (>= netstandard1.3) (< win8)) (&& (< monoandroid) (< netstandard1.3) (>= netstandard1.4) (< win8) (< wpa81)) (>= net45) (&& (>= net46) (< netstandard1.3)) (&& (>= net46) (< netstandard1.4)) (&& (>= net46) (< portable-net45+win8+wpa81)) (&& (< net46) (>= netstandard2.0)) (&& (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (>= netstandard1.1) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (>= netstandard1.2) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (>= netstandard1.3) (< portable-net45+win8+wpa81)) (&& (< netstandard1.3) (>= netstandard2.0)) (&& (< netstandard1.3) (>= uap10.0)) (&& (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (>= netstandard1.4) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.5) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.5) (< win8) (< wpa81)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) (&& (< netstandard1.5) (>= uap10.0) (< win8) (< wpa81)) (>= netstandard1.6) (&& (< portable-net45+win8+wpa81) (>= uap10.0)) + Microsoft.NETCore.Platforms (>= 1.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.5) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.5) (< win8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + Microsoft.NETCore.Targets (>= 1.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.5) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.5) (< win8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + System.Runtime (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.5) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.5) (< win8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + System.Text.Encoding (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.5) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.5) (< win8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + System.Threading.Tasks (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.5) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.5) (< win8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + System.IO.Compression (4.3) - restriction: || (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.3) (< win8)) (&& (< net45) (>= net46) (< netstandard1.4)) (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) (&& (< netstandard1.5) (>= uap10.0) (< win8) (< wpa81)) + Microsoft.NETCore.Platforms (>= 1.1) - restriction: && (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + runtime.native.System (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + runtime.native.System.IO.Compression (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wpa81) + System.Buffers (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wpa81) + System.Collections (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wpa81) + System.Diagnostics.Debug (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wpa81) + System.IO (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.1) (< netstandard1.3) (< win8) (< wpa81)) (< portable-net45+win8+wpa81) + System.Resources.ResourceManager (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wpa81) + System.Runtime (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.1) (< netstandard1.3) (< win8) (< wpa81)) (< portable-net45+win8+wpa81) + System.Runtime.Extensions (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wpa81) + System.Runtime.Handles (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wpa81) + System.Runtime.InteropServices (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wpa81) + System.Text.Encoding (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.1) (< netstandard1.3) (< win8) (< wpa81)) (< portable-net45+win8+wpa81) + System.Threading (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wpa81) + System.Threading.Tasks (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wpa81) + System.IO.Compression.ZipFile (4.3) - restriction: || (&& (< net45) (>= net46) (< netstandard1.4)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.Buffers (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.IO (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.IO.Compression (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.IO.FileSystem (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.IO.FileSystem.Primitives (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Resources.ResourceManager (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Runtime (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Runtime.Extensions (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Text.Encoding (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.IO.FileSystem (4.3) - restriction: || (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.3) (< win8)) (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.6) (< win8)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.4) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.5) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= net46) (< netstandard1.4)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= net46) (< portable-net45+win8+wp8+wpa81)) (&& (< net46) (>= netstandard2.0)) (&& (>= netstandard1.1) (< portable-net45+win8+wp8+wpa81)) (&& (>= netstandard1.2) (< portable-net45+win8+wp8+wpa81)) (&& (>= netstandard1.3) (< portable-net45+win8+wp8+wpa81)) (&& (>= netstandard1.3) (< portable-net45+win8+wpa81)) (&& (< netstandard1.3) (>= netstandard2.0)) (&& (>= netstandard1.4) (< portable-net45+win8+wp8+wpa81)) (&& (>= netstandard1.5) (< portable-net45+win8+wp8+wpa81)) (&& (< netstandard1.5) (>= netstandard1.6) (>= uap10.0)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) (&& (< netstandard1.5) (>= uap10.0) (< win8) (< wpa81)) (&& (>= netstandard1.6) (< portable-net45+win8+wp8+wpa81)) (&& (< portable-net45+win8+wp8+wpa81) (>= uap10.0)) + Microsoft.NETCore.Platforms (>= 1.1) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + Microsoft.NETCore.Targets (>= 1.1) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.IO (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.IO.FileSystem.Primitives (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (>= net46) + System.Runtime (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Runtime.Handles (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Text.Encoding (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Threading.Tasks (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.IO.FileSystem.Primitives (4.3) - restriction: || (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.3) (< win8)) (&& (< monoandroid) (< net45) (< netstandard1.4) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.5) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= net46) (< netstandard1.4)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= net46) (< portable-net45+win8+wp8+wpa81)) (&& (< net46) (>= netstandard2.0)) (&& (>= netstandard1.1) (< portable-net45+win8+wp8+wpa81)) (&& (>= netstandard1.2) (< portable-net45+win8+wp8+wpa81)) (&& (>= netstandard1.3) (< portable-net45+win8+wp8+wpa81)) (&& (>= netstandard1.3) (< portable-net45+win8+wpa81)) (&& (< netstandard1.3) (>= netstandard2.0)) (&& (>= netstandard1.4) (< portable-net45+win8+wp8+wpa81)) (&& (>= netstandard1.5) (< portable-net45+win8+wp8+wpa81)) (&& (< netstandard1.5) (>= netstandard1.6) (>= uap10.0)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) (&& (< netstandard1.5) (>= uap10.0) (< win8) (< wpa81)) (&& (>= netstandard1.6) (< portable-net45+win8+wp8+wpa81)) (&& (< portable-net45+win8+wp8+wpa81) (>= uap10.0)) + System.Runtime (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Linq (4.3) - restriction: || (>= net45) (&& (>= net46) (< netstandard1.4)) (&& (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (>= netstandard1.1) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (>= netstandard1.5) (< win8) (< wpa81)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) (>= netstandard1.6) + System.Collections (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.6) (< win8) (< wp8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + System.Diagnostics.Debug (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Resources.ResourceManager (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Runtime (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.6) (< win8) (< wp8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + System.Runtime.Extensions (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Linq.Expressions (4.3) - restriction: || (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0)) (&& (>= netstandard1.1) (< portable-net45+win8+wpa81)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) (&& (>= netstandard1.6) (< portable-net45+win8+wp8+wpa81)) + System.Collections (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Diagnostics.Debug (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Globalization (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.IO (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Linq (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.ObjectModel (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Reflection (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.6) (< win8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + System.Reflection.Emit (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Reflection.Emit.ILGeneration (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Reflection.Emit.Lightweight (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Reflection.Extensions (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Reflection.Primitives (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Reflection.TypeExtensions (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Resources.ResourceManager (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Runtime (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.6) (< win8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + System.Runtime.Extensions (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Threading (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Linq.Queryable (4.3) - restriction: && (< net45) (>= netstandard1.6) (< netstandard2.0) + System.Collections (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Diagnostics.Debug (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Linq (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + System.Linq.Expressions (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + System.Reflection (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Reflection.Extensions (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Resources.ResourceManager (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Runtime (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + System.Net.Http (4.3.3) - restriction: || (&& (< net45) (>= net46) (< netstandard1.4)) (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) (&& (>= netstandard1.6) (< portable-net45+win8+wp8+wpa81)) + Microsoft.NETCore.Platforms (>= 1.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.6) (< win8) (< wpa81)) (< portable-net45+win8+wpa81) + Microsoft.Win32.Primitives (>= 4.3) - restriction: && (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.6) (< win8) (< wpa81) + runtime.native.System (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + runtime.native.System.Net.Http (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + runtime.native.System.Security.Cryptography.OpenSsl (>= 4.3.2) - restriction: && (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Collections (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.6) (< win8) (< wpa81)) (< portable-net45+win8+wpa81) + System.Diagnostics.Debug (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.6) (< win8) (< wpa81)) (< portable-net45+win8+wpa81) + System.Diagnostics.DiagnosticSource (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.6) (< win8) (< wpa81)) (< portable-net45+win8+wpa81) + System.Diagnostics.Tracing (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.6) (< win8) (< wpa81)) (< portable-net45+win8+wpa81) + System.Globalization (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.6) (< win8) (< wpa81)) (< portable-net45+win8+wpa81) + System.Globalization.Extensions (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.IO (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.1) (< netstandard1.3) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.6) (< win8) (< wpa81)) (< portable-net45+win8+wpa81) + System.IO.Compression (>= 4.3) - restriction: && (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.6) (< win8) (< wpa81) + System.IO.FileSystem (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Net.Primitives (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.1) (< netstandard1.3) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.6) (< win8) (< wpa81)) (< portable-net45+win8+wpa81) + System.Resources.ResourceManager (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.6) (< win8) (< wpa81)) (< portable-net45+win8+wpa81) + System.Runtime (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.1) (< netstandard1.3) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.6) (< win8) (< wpa81)) (< portable-net45+win8+wpa81) + System.Runtime.Extensions (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.6) (< win8) (< wpa81)) (< portable-net45+win8+wpa81) + System.Runtime.Handles (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.6) (< win8) (< wpa81)) + System.Runtime.InteropServices (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.6) (< win8) (< wpa81)) (< portable-net45+win8+wpa81) + System.Security.Cryptography.Algorithms (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Security.Cryptography.Encoding (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.6) (< win8) (< wpa81)) + System.Security.Cryptography.OpenSsl (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Security.Cryptography.Primitives (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Security.Cryptography.X509Certificates (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.6) (< win8) (< wpa81)) (>= net46) (< portable-net45+win8+wpa81) + System.Text.Encoding (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.1) (< netstandard1.3) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.6) (< win8) (< wpa81)) (< portable-net45+win8+wpa81) + System.Threading (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.6) (< win8) (< wpa81)) (< portable-net45+win8+wpa81) + System.Threading.Tasks (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.1) (< netstandard1.3) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.6) (< win8) (< wpa81)) (< portable-net45+win8+wpa81) + System.Net.Primitives (4.3) - restriction: || (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.3) (< win8)) (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.6) (< win8)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.4) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.5) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.4) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.5) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< netstandard1.1) (>= netstandard1.6) (< win8)) (&& (< net45) (>= net46) (< netstandard1.3)) (&& (< net45) (>= net46) (< netstandard1.4)) (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= net46) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.1) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.2) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.3) (< portable-net45+win8+wpa81)) (&& (< netstandard1.3) (>= uap10.0) (< win8) (< wpa81)) (&& (>= netstandard1.4) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.5) (< portable-net45+win8+wpa81)) (&& (< netstandard1.5) (>= netstandard1.6) (>= uap10.0)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) (&& (< netstandard1.5) (>= uap10.0) (< win8) (< wpa81)) (&& (>= netstandard1.6) (< portable-net45+win8+wp8+wpa81)) (&& (>= netstandard1.6) (< portable-net45+win8+wpa81)) (&& (< portable-net45+win8+wpa81) (>= uap10.0)) + Microsoft.NETCore.Platforms (>= 1.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.1) (< netstandard1.3) (< win8) (< wpa81)) (&& (< monoandroid) (>= netstandard1.0) (< netstandard1.1) (< win8) (< wp8)) (< portable-net45+win8+wp8+wpa81) + Microsoft.NETCore.Targets (>= 1.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.1) (< netstandard1.3) (< win8) (< wpa81)) (&& (< monoandroid) (>= netstandard1.0) (< netstandard1.1) (< win8) (< wp8)) (< portable-net45+win8+wp8+wpa81) + System.Runtime (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.1) (< netstandard1.3) (< win8) (< wpa81)) (&& (< monoandroid) (>= netstandard1.0) (< netstandard1.1) (< win8) (< wp8)) (< portable-net45+win8+wp8+wpa81) + System.Runtime.Handles (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Net.Requests (4.3) - restriction: && (< net45) (>= netstandard1.6) (< netstandard2.0) + Microsoft.NETCore.Platforms (>= 1.1) - restriction: && (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Collections (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Diagnostics.Debug (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Diagnostics.Tracing (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Globalization (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.IO (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.1) (< netstandard1.3) (< win8) (< wpa81)) (&& (< monoandroid) (>= netstandard1.0) (< netstandard1.1) (< win8) (< wp8)) (< portable-net45+win8+wp8+wpa81) + System.Net.Http (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Net.Primitives (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.1) (< netstandard1.3) (< win8) (< wpa81)) (&& (< monoandroid) (>= netstandard1.0) (< netstandard1.1) (< win8) (< wp8)) (< portable-net45+win8+wp8+wpa81) + System.Net.WebHeaderCollection (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Resources.ResourceManager (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Runtime (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.1) (< netstandard1.3) (< win8) (< wpa81)) (&& (< monoandroid) (>= netstandard1.0) (< netstandard1.1) (< win8) (< wp8)) (< portable-net45+win8+wp8+wpa81) + System.Threading (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Threading.Tasks (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.1) (< netstandard1.3) (< win8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + System.Net.Sockets (4.3) - restriction: || (&& (< net45) (>= net46) (< netstandard1.4)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + Microsoft.NETCore.Platforms (>= 1.1) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + Microsoft.NETCore.Targets (>= 1.1) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.IO (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Net.Primitives (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Runtime (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Threading.Tasks (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Net.WebHeaderCollection (4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (>= netstandard1.6) (< portable-net45+win8+wp8+wpa81)) + System.Collections (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Resources.ResourceManager (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Runtime (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Runtime.Extensions (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.ObjectModel (4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< netstandard2.0) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= netstandard1.1) (< portable-net45+win8+wpa81)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.Collections (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Diagnostics.Debug (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Resources.ResourceManager (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Runtime (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + System.Threading (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Reflection (4.3) - restriction: || (&& (< monoandroid) (< netstandard1.2) (>= netstandard1.3) (< win8)) (&& (< monoandroid) (< netstandard1.2) (>= netstandard1.4) (< win8)) (&& (< monoandroid) (< netstandard1.2) (>= netstandard1.5) (< win8)) (&& (< monoandroid) (< netstandard1.3) (>= netstandard1.4) (< win8) (< wpa81)) (>= net45) (&& (>= netcoreapp1.1) (< netstandard1.2)) (&& (>= netcoreapp1.1) (< netstandard1.3)) (&& (>= netcoreapp1.1) (< netstandard1.4)) (&& (>= netcoreapp1.1) (< netstandard1.5)) (&& (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (>= netstandard1.1) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (>= netstandard1.2) (< portable-net45+win8+wpa81)) (&& (< netstandard1.2) (>= uap10.0) (< win8)) (&& (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (>= netstandard1.3) (< portable-net45+win8+wpa81)) (&& (< netstandard1.3) (>= uap10.0) (< win8) (< wpa81)) (&& (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (>= netstandard1.4) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.5) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.5) (< win8) (< wpa81)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) (&& (< netstandard1.5) (>= uap10.0) (< win8) (< wpa81)) (>= netstandard1.6) (&& (< portable-net45+win8+wpa81) (>= uap10.0)) + Microsoft.NETCore.Platforms (>= 1.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.5) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.5) (< win8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + Microsoft.NETCore.Targets (>= 1.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.5) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.5) (< win8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + System.IO (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.5) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.5) (< win8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + System.Reflection.Primitives (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.5) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.5) (< win8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + System.Runtime (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.5) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.5) (< win8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + System.Reflection.Emit (4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< netstandard2.0) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< net45) (>= netstandard2.0)) + System.IO (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net45) (>= netstandard1.1) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Reflection (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net45) (>= netstandard1.1) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Reflection.Emit.ILGeneration (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net45) (>= netstandard1.1) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Reflection.Primitives (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net45) (>= netstandard1.1) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Runtime (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net45) (>= netstandard1.1) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Reflection.Emit.ILGeneration (4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< netstandard2.0) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< net45) (>= netstandard2.0)) (&& (>= netstandard1.6) (< portable-net45+win8+wp8+wpa81)) + System.Reflection (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net45) (>= netstandard1.0) (< wp8) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Reflection.Primitives (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net45) (>= netstandard1.0) (< wp8) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Runtime (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net45) (>= netstandard1.0) (< wp8) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Reflection.Emit.Lightweight (4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< netstandard2.0) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (>= netstandard1.6) (< portable-net45+win8+wp8+wpa81)) + System.Reflection (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net45) (>= netstandard1.0) (< wp8) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Reflection.Emit.ILGeneration (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net45) (>= netstandard1.0) (< wp8) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Reflection.Primitives (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net45) (>= netstandard1.0) (< wp8) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Runtime (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net45) (>= netstandard1.0) (< wp8) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Reflection.Extensions (4.3) - restriction: || (&& (< monoandroid) (< netstandard1.0) (>= netstandard1.1) (< win8)) (&& (< monoandroid) (< netstandard1.1) (>= netstandard1.2) (< win8)) (&& (< monoandroid) (< netstandard1.1) (>= netstandard1.3) (< win8)) (&& (< monoandroid) (< netstandard1.1) (>= netstandard1.4) (< win8)) (&& (< monoandroid) (< netstandard1.1) (>= netstandard1.5) (< win8)) (&& (< monoandroid) (< netstandard1.1) (>= netstandard1.6) (< win8)) (&& (< net45) (>= net46) (< netstandard1.4)) (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0)) (&& (>= net46) (< netstandard1.1)) (&& (< netstandard1.0) (>= netstandard1.1) (< portable-net45+win8)) (&& (>= netstandard1.1) (< portable-net45+win8+wpa81)) (&& (< netstandard1.1) (>= uap10.0) (< win8)) (&& (< netstandard1.1) (< win8) (>= wpa81)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) (&& (< netstandard1.5) (>= uap10.0) (< win8) (< wpa81)) (&& (>= netstandard1.6) (< portable-net45+win8+wp8+wpa81)) + Microsoft.NETCore.Platforms (>= 1.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.0) (< win8) (< wp8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + Microsoft.NETCore.Targets (>= 1.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.0) (< win8) (< wp8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Reflection (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.0) (< win8) (< wp8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Runtime (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.0) (< win8) (< wp8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Reflection.Metadata (1.5) - restriction: || (>= net45) (>= netstandard2.0) + NETStandard.Library (>= 1.6.1) - restriction: && (< monoandroid) (< monotouch) (>= netstandard1.1) (< netstandard2.0) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Collections.Immutable (>= 1.4) - restriction: || (>= monoandroid) (>= monotouch) (&& (< netcoreapp2.0) (>= netstandard2.0)) (&& (>= netstandard1.1) (< netstandard2.0)) (&& (< netstandard1.1) (>= portable-net45+win8)) (&& (< portable-net45+win8) (>= portable-net45+win8+wpa81)) (>= xamarinios) (>= xamarinmac) (>= xamarintvos) (>= xamarinwatchos) + System.Reflection.Primitives (4.3) - restriction: || (&& (< monoandroid) (< monotouch) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< netstandard1.2) (>= netstandard1.3) (< win8)) (&& (< monoandroid) (< netstandard1.2) (>= netstandard1.4) (< win8)) (&& (< monoandroid) (< netstandard1.2) (>= netstandard1.5) (< win8)) (&& (< monoandroid) (< netstandard1.2) (>= netstandard1.6) (< win8)) (&& (< monoandroid) (< netstandard1.3) (>= netstandard1.4) (< win8) (< wpa81)) (&& (< monoandroid) (< netstandard1.3) (>= netstandard1.5) (< win8) (< wpa81)) (&& (< monoandroid) (< netstandard1.4) (>= netstandard1.5) (< win8) (< wpa81)) (>= net45) (>= netcoreapp1.1) (&& (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (>= netstandard1.1) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (>= netstandard1.2) (< portable-net45+win8+wpa81)) (&& (< netstandard1.2) (>= uap10.0) (< win8)) (&& (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (>= netstandard1.3) (< portable-net45+win8+wpa81)) (&& (< netstandard1.3) (>= uap10.0) (< win8) (< wpa81)) (&& (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (>= netstandard1.4) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (>= netstandard1.5) (< portable-net45+win8+wpa81)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) (&& (< netstandard1.5) (>= uap10.0) (< win8) (< wpa81)) (&& (>= netstandard1.6) (< portable-net45+win8+wp8+wpa81)) (&& (>= netstandard1.6) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.6) (< win8) (< wpa81)) (>= netstandard2.0) (&& (< portable-net45+win8+wpa81) (>= uap10.0)) + Microsoft.NETCore.Platforms (>= 1.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.0) (< win8) (< wp8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + Microsoft.NETCore.Targets (>= 1.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.0) (< win8) (< wp8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Runtime (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.0) (< win8) (< wp8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Reflection.TypeExtensions (4.4) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< netstandard2.0) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< net45) (>= netstandard2.0)) (&& (>= netstandard1.6) (< portable-net45+win8+wp8+wpa81)) + System.Resources.ResourceManager (4.3) - restriction: || (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.3) (< win8)) (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.6) (< win8)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.4) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.5) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.4) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.5) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< netstandard1.0) (>= netstandard1.1) (< win8)) (&& (< monoandroid) (< netstandard1.1) (>= netstandard1.2) (< win8)) (&& (< monoandroid) (< netstandard1.1) (>= netstandard1.3) (< win8)) (&& (< monoandroid) (< netstandard1.1) (>= netstandard1.4) (< win8)) (&& (< monoandroid) (< netstandard1.1) (>= netstandard1.5) (< win8)) (&& (< monoandroid) (< netstandard1.1) (>= netstandard1.6) (< win8)) (&& (< net45) (>= net46) (< netstandard1.3)) (&& (< net45) (>= net46) (< netstandard1.4)) (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0)) (&& (< net45) (>= netstandard2.0)) (&& (>= net46) (< netstandard1.1)) (&& (>= net46) (< portable-net45+win8+wpa81)) (&& (< netstandard1.0) (>= netstandard1.1) (< portable-net45+win8)) (&& (>= netstandard1.1) (< portable-net45+win8+wpa81)) (&& (< netstandard1.1) (>= uap10.0) (< win8)) (&& (< netstandard1.1) (< win8) (>= wpa81)) (&& (>= netstandard1.2) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.3) (< portable-net45+win8+wpa81)) (&& (< netstandard1.3) (>= uap10.0)) (&& (>= netstandard1.4) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.5) (< portable-net45+win8+wpa81)) (&& (< netstandard1.5) (>= netstandard1.6) (>= uap10.0)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) (&& (< netstandard1.5) (>= uap10.0) (< win8) (< wpa81)) (&& (>= netstandard1.6) (< portable-net45+win8+wp8+wpa81)) (&& (>= netstandard1.6) (< portable-net45+win8+wpa81)) (&& (< portable-net45+win8+wpa81) (>= uap10.0)) + Microsoft.NETCore.Platforms (>= 1.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.0) (< win8) (< wp8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + Microsoft.NETCore.Targets (>= 1.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.0) (< win8) (< wp8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Globalization (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.0) (< win8) (< wp8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Reflection (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.0) (< win8) (< wp8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Runtime (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.0) (< win8) (< wp8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Runtime (4.3) - restriction: || (&& (< monoandroid) (< netstandard1.2) (>= netstandard1.3) (< win8)) (&& (< monoandroid) (< netstandard1.3) (>= netstandard1.4) (< win8) (< wpa81)) (>= net45) (&& (>= net46) (< netstandard1.3)) (&& (>= net46) (< netstandard1.4)) (&& (>= net46) (< portable-net45+win8+wpa81)) (&& (< net46) (>= netstandard2.0)) (&& (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (>= netstandard1.1) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (>= netstandard1.2) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (>= netstandard1.3) (< portable-net45+win8+wpa81)) (&& (< netstandard1.3) (>= netstandard2.0)) (&& (< netstandard1.3) (>= uap10.0) (< win8) (< wpa81)) (&& (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (>= netstandard1.4) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.5) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.5) (< win8) (< wpa81)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) (&& (< netstandard1.5) (>= uap10.0) (< win8) (< wpa81)) (>= netstandard1.6) (&& (< portable-net45+win8+wpa81) (>= uap10.0)) + Microsoft.NETCore.Platforms (>= 1.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.5) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.2) (< win8) (< wp8)) (&& (< monoandroid) (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.5) (< win8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + Microsoft.NETCore.Targets (>= 1.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.5) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.2) (< win8) (< wp8)) (&& (< monoandroid) (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.5) (< win8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + System.Runtime.Extensions (4.3) - restriction: || (&& (< monoandroid) (< netstandard1.2) (>= netstandard1.3) (< win8)) (&& (< monoandroid) (< netstandard1.3) (>= netstandard1.4) (< win8) (< wpa81)) (>= net45) (&& (>= net46) (< netstandard1.3)) (&& (>= net46) (< netstandard1.4)) (&& (>= net46) (< portable-net45+win8+wpa81)) (&& (< net46) (>= netstandard2.0)) (&& (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (>= netstandard1.1) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (>= netstandard1.2) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (>= netstandard1.3) (< portable-net45+win8+wpa81)) (&& (< netstandard1.3) (>= netstandard2.0)) (&& (< netstandard1.3) (>= uap10.0)) (&& (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (>= netstandard1.4) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.5) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.5) (< win8) (< wpa81)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) (&& (< netstandard1.5) (>= uap10.0) (< win8) (< wpa81)) (>= netstandard1.6) (&& (< portable-net45+win8+wpa81) (>= uap10.0)) + Microsoft.NETCore.Platforms (>= 1.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.5) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.5) (< win8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + Microsoft.NETCore.Targets (>= 1.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.5) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.5) (< win8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + System.Runtime (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.5) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.5) (< win8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + System.Runtime.Handles (4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< netstandard2.0) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.3) (< win8)) (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.6) (< win8)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.4) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.5) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.4) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.5) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= net46) (< netstandard1.3)) (&& (< net45) (>= net46) (< netstandard1.4)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (< net45) (>= netstandard2.0)) (&& (< netstandard1.3) (>= uap10.0)) (&& (< netstandard1.5) (>= netstandard1.6) (>= uap10.0)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) (&& (< netstandard1.5) (>= uap10.0) (< win8) (< wpa81)) + Microsoft.NETCore.Platforms (>= 1.1) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + Microsoft.NETCore.Targets (>= 1.1) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Runtime (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Runtime.InteropServices (4.3) - restriction: || (&& (< monoandroid) (< netstandard1.0) (>= netstandard1.1) (< win8)) (&& (< monoandroid) (< netstandard1.2) (>= netstandard1.3) (< win8)) (&& (< monoandroid) (< netstandard1.2) (>= netstandard1.6) (< win8)) (&& (< monoandroid) (< netstandard1.3) (>= netstandard1.4) (< win8) (< wpa81)) (&& (< monoandroid) (< netstandard1.3) (>= netstandard1.5) (< win8) (< wpa81)) (>= net45) (&& (>= net46) (< netstandard1.3)) (&& (>= net46) (< netstandard1.4)) (&& (>= net46) (< portable-net45+win8+wpa81)) (&& (< netstandard1.0) (>= netstandard1.1) (< portable-net45+win8)) (&& (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (>= netstandard1.1) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (>= netstandard1.2) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (>= netstandard1.3) (< portable-net45+win8+wpa81)) (&& (< netstandard1.3) (>= uap10.0)) (&& (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (>= netstandard1.4) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (>= netstandard1.5) (< portable-net45+win8+wpa81)) (&& (< netstandard1.5) (>= netstandard1.6) (>= uap10.0)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) (&& (< netstandard1.5) (>= uap10.0) (< win8) (< wpa81)) (&& (>= netstandard1.6) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.6) (< win8) (< wpa81)) (>= netstandard2.0) (&& (< portable-net45+win8+wpa81) (>= uap10.0)) + Microsoft.NETCore.Platforms (>= 1.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.5) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< monoandroid) (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.5) (< win8) (< wpa81)) (>= netcoreapp1.1) (< portable-net45+win8+wpa81) + Microsoft.NETCore.Targets (>= 1.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.5) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< monoandroid) (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.5) (< win8) (< wpa81)) (>= netcoreapp1.1) (< portable-net45+win8+wpa81) + System.Reflection (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.5) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< monoandroid) (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.5) (< win8) (< wpa81)) (>= netcoreapp1.1) (< portable-net45+win8+wpa81) + System.Reflection.Primitives (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.5) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< monoandroid) (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.5) (< win8) (< wpa81)) (>= netcoreapp1.1) (< portable-net45+win8+wpa81) + System.Runtime (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.5) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< monoandroid) (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.5) (< win8) (< wpa81)) (>= net462) (>= netcoreapp1.1) (< portable-net45+win8+wpa81) + System.Runtime.Handles (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.5) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.5) (< win8) (< wpa81)) (>= netcoreapp1.1) (< portable-net45+win8+wpa81) + System.Runtime.InteropServices.RuntimeInformation (4.3) - restriction: || (&& (< net45) (>= net46) (< netstandard1.4)) (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (>= net461) (&& (< netstandard1.0) (>= netstandard1.1) (< portable-net45+win8)) (&& (< netstandard1.0) (>= netstandard1.1) (>= win8)) (&& (< netstandard1.0) (>= netstandard1.1) (< win8)) (&& (< netstandard1.3) (< win8) (>= wpa81)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + runtime.native.System (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net45) (>= netstandard1.1) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Reflection (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.1) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< netstandard1.1) (< win8)) + System.Reflection.Extensions (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.1) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< netstandard1.1) (< win8)) + System.Resources.ResourceManager (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.1) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< netstandard1.1) (< win8)) + System.Runtime (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.1) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< netstandard1.1) (< win8)) + System.Runtime.InteropServices (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net45) (>= netstandard1.1) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Threading (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.1) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< netstandard1.1) (< win8)) + System.Runtime.Loader (4.3) - restriction: && (< net45) (>= netstandard2.0) + System.IO (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net462) (>= netstandard1.5) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Reflection (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net462) (>= netstandard1.5) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Runtime (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net462) (>= netstandard1.5) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Runtime.Numerics (4.3) - restriction: || (&& (< monoandroid) (< net45) (< netstandard1.4) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.5) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= net46) (< netstandard1.4) (>= netstandard1.6)) (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0)) (&& (< netstandard1.5) (>= netstandard1.6) (>= uap10.0)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.Globalization (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wpa81) + System.Resources.ResourceManager (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wpa81) + System.Runtime (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.1) (< netstandard1.3) (< win8) (< wpa81)) (< portable-net45+win8+wpa81) + System.Runtime.Extensions (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wpa81) + System.Security.AccessControl (4.4.1) - restriction: || (&& (>= monoandroid) (>= netstandard2.0)) (&& (>= monotouch) (>= netstandard2.0)) (&& (< net45) (>= netstandard2.0)) (>= netcoreapp2.0) (&& (>= netstandard2.0) (>= xamarinios)) (&& (>= netstandard2.0) (>= xamarinmac)) (&& (>= netstandard2.0) (>= xamarintvos)) (&& (>= netstandard2.0) (>= xamarinwatchos)) + Microsoft.NETCore.Platforms (>= 2.0) - restriction: >= netcoreapp2.0 + System.Security.Principal.Windows (>= 4.4) - restriction: || (>= monoandroid) (>= monotouch) (&& (>= net46) (< netstandard2.0)) (&& (< net46) (>= netstandard1.3) (< netstandard2.0)) (&& (< net46) (>= netstandard2.0)) (>= net461) (>= netcoreapp2.0) (>= xamarinios) (>= xamarinmac) (>= xamarintvos) (>= xamarinwatchos) + System.Security.Cryptography.Algorithms (4.3.1) - restriction: || (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.6) (< win8)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.4) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.5) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.4) (>= netstandard1.5) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.4) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.5) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= net46) (< netstandard1.3)) (&& (< net45) (>= net46) (< netstandard1.4)) (&& (< net45) (>= net461) (< netstandard1.4)) (&& (< net45) (>= net461) (>= netstandard1.5) (< netstandard1.6)) (&& (< net45) (>= net461) (< netstandard1.5)) (&& (< net45) (>= net461) (>= netstandard1.6) (< netstandard2.0)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (< net45) (>= netstandard2.0)) (&& (>= net461) (< netstandard1.5) (>= uap10.0)) (&& (< netstandard1.3) (>= uap10.0)) (&& (< netstandard1.4) (>= uap10.0)) (&& (< netstandard1.5) (>= netstandard1.6) (>= uap10.0)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + Microsoft.NETCore.Platforms (>= 1.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< netstandard1.3)) + runtime.native.System.Security.Cryptography.Apple (>= 4.3.1) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + runtime.native.System.Security.Cryptography.OpenSsl (>= 4.3.2) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Collections (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.IO (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net46) (>= netstandard1.3) (< netstandard1.4)) (&& (< monoandroid) (< net46) (>= netstandard1.4) (< netstandard1.6)) (&& (< monoandroid) (< netstandard1.3)) (>= net463) + System.Resources.ResourceManager (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< netstandard1.3)) + System.Runtime (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net46) (>= netstandard1.3) (< netstandard1.4)) (&& (< monoandroid) (< net46) (>= netstandard1.4) (< netstandard1.6)) (&& (< monoandroid) (< netstandard1.3)) (>= net463) + System.Runtime.Extensions (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< netstandard1.3)) + System.Runtime.Handles (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< netstandard1.3)) + System.Runtime.InteropServices (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< netstandard1.3)) + System.Runtime.Numerics (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Security.Cryptography.Encoding (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< netstandard1.3)) (>= net463) + System.Security.Cryptography.Primitives (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net46) (>= netstandard1.3) (< netstandard1.4)) (&& (< monoandroid) (< net46) (>= netstandard1.4) (< netstandard1.6)) (&& (< monoandroid) (< netstandard1.3)) (&& (>= net46) (< netstandard1.4)) (&& (>= net461) (< netstandard1.6)) (>= net463) + System.Text.Encoding (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< netstandard1.3)) + System.Security.Cryptography.Cng (4.4) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.4) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.5) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.4) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.5) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= net46) (< netstandard1.3)) (&& (< net45) (>= net46) (< netstandard1.4) (>= netstandard1.6)) (&& (< netstandard1.3) (>= uap10.0)) (&& (< netstandard1.5) (>= netstandard1.6) (>= uap10.0)) + System.IO (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< netstandard2.0) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net46) (>= netstandard1.3) (< netstandard1.4)) (&& (< monoandroid) (< net46) (>= netstandard1.4) (< netstandard1.6)) + System.Resources.ResourceManager (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< netstandard2.0) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net46) (>= netstandard1.3) (< netstandard1.4)) (&& (< monoandroid) (< net46) (>= netstandard1.4) (< netstandard1.6)) + System.Runtime (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< netstandard2.0) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net46) (>= netstandard1.3) (< netstandard1.4)) (&& (< monoandroid) (< net46) (>= netstandard1.4) (< netstandard1.6)) + System.Runtime.Extensions (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< netstandard2.0) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net46) (>= netstandard1.4) (< netstandard1.6)) + System.Runtime.Handles (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< netstandard2.0) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net46) (>= netstandard1.3) (< netstandard1.4)) (&& (< monoandroid) (< net46) (>= netstandard1.4) (< netstandard1.6)) + System.Runtime.InteropServices (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< netstandard2.0) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net46) (>= netstandard1.3) (< netstandard1.4)) (&& (< monoandroid) (< net46) (>= netstandard1.4) (< netstandard1.6)) + System.Security.Cryptography.Algorithms (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< netstandard2.0) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net46) (>= netstandard1.3) (< netstandard1.4)) (&& (< monoandroid) (< net46) (>= netstandard1.4) (< netstandard1.6)) (&& (>= net46) (< netstandard1.4)) + System.Security.Cryptography.Encoding (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< netstandard2.0) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net46) (>= netstandard1.4) (< netstandard1.6)) + System.Security.Cryptography.Primitives (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< netstandard2.0) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net46) (>= netstandard1.3) (< netstandard1.4)) (&& (< monoandroid) (< net46) (>= netstandard1.4) (< netstandard1.6)) (&& (>= net46) (< netstandard1.4)) + System.Text.Encoding (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< netstandard2.0) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net46) (>= netstandard1.4) (< netstandard1.6)) + System.Security.Cryptography.Csp (4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (< netstandard1.4) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.5) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= net46) (< netstandard1.4) (>= netstandard1.6)) (&& (< netstandard1.5) (>= netstandard1.6) (>= uap10.0)) + Microsoft.NETCore.Platforms (>= 1.1) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.IO (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Reflection (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Resources.ResourceManager (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Runtime (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Runtime.Extensions (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Runtime.Handles (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Runtime.InteropServices (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Security.Cryptography.Algorithms (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (>= net46) + System.Security.Cryptography.Encoding (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Security.Cryptography.Primitives (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (>= net46) + System.Text.Encoding (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Threading (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Security.Cryptography.Encoding (4.3) - restriction: || (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.3) (< win8)) (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.6) (< win8)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.4) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.5) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.4) (>= netstandard1.5) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.4) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.5) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= net46) (< netstandard1.3)) (&& (< net45) (>= net46) (< netstandard1.4)) (&& (< net45) (>= net461) (< netstandard1.4)) (&& (< net45) (>= net461) (>= netstandard1.5) (< netstandard1.6)) (&& (< net45) (>= net461) (< netstandard1.5)) (&& (< net45) (>= net461) (>= netstandard1.6) (< netstandard2.0)) (&& (< net45) (>= net463) (< netstandard1.4)) (&& (< net45) (>= net463) (< netstandard1.5)) (&& (< net45) (>= net463) (>= netstandard1.6) (< netstandard2.0)) (&& (< net45) (>= net463) (< netstandard1.6)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= net461) (< netstandard1.5) (>= uap10.0)) (&& (>= net463) (< netstandard1.5) (>= uap10.0)) (&& (< netstandard1.3) (>= uap10.0)) (&& (< netstandard1.4) (>= uap10.0)) (&& (< netstandard1.5) (>= netstandard1.6) (>= uap10.0)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) (&& (< netstandard1.5) (>= uap10.0) (< win8) (< wpa81)) + Microsoft.NETCore.Platforms (>= 1.1) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + runtime.native.System.Security.Cryptography.OpenSsl (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Collections (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Collections.Concurrent (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Linq (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Resources.ResourceManager (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Runtime (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Runtime.Extensions (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Runtime.Handles (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Runtime.InteropServices (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Security.Cryptography.Primitives (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Text.Encoding (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Security.Cryptography.OpenSsl (4.4) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.6) (< win8)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.4) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.5) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= net46) (< netstandard1.4) (>= netstandard1.6)) (&& (< netstandard1.5) (>= netstandard1.6) (>= uap10.0)) + System.Collections (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net461) (>= netstandard1.6) (< netstandard2.0) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.IO (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net461) (>= netstandard1.6) (< netstandard2.0) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Resources.ResourceManager (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net461) (>= netstandard1.6) (< netstandard2.0) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Runtime (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net461) (>= netstandard1.6) (< netstandard2.0) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Runtime.Extensions (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net461) (>= netstandard1.6) (< netstandard2.0) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Runtime.Handles (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net461) (>= netstandard1.6) (< netstandard2.0) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Runtime.InteropServices (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net461) (>= netstandard1.6) (< netstandard2.0) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Runtime.Numerics (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net461) (>= netstandard1.6) (< netstandard2.0) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Security.Cryptography.Algorithms (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net461) (>= netstandard1.6) (< netstandard2.0) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Security.Cryptography.Encoding (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net461) (>= netstandard1.6) (< netstandard2.0) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Security.Cryptography.Primitives (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net461) (>= netstandard1.6) (< netstandard2.0) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Text.Encoding (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net461) (>= netstandard1.6) (< netstandard2.0) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Security.Cryptography.Primitives (4.3) - restriction: || (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.6) (< win8)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.4) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.5) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.4) (>= netstandard1.5) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.4) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.5) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= net46) (< netstandard1.3)) (&& (< net45) (>= net46) (< netstandard1.4)) (&& (< net45) (>= net461) (< netstandard1.4)) (&& (< net45) (>= net461) (>= netstandard1.5) (< netstandard1.6)) (&& (< net45) (>= net461) (< netstandard1.5)) (&& (< net45) (>= net463) (< netstandard1.4)) (&& (< net45) (>= net463) (< netstandard1.5)) (&& (< net45) (>= net463) (>= netstandard1.6) (< netstandard2.0)) (&& (< net45) (>= net463) (< netstandard1.6)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= net461) (< netstandard1.5) (>= uap10.0)) (&& (>= net463) (< netstandard1.5) (>= uap10.0)) (&& (< netstandard1.3) (>= uap10.0)) (&& (< netstandard1.4) (>= uap10.0)) (&& (< netstandard1.5) (>= netstandard1.6) (>= uap10.0)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.Diagnostics.Debug (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Globalization (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.IO (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Resources.ResourceManager (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Runtime (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Threading (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Threading.Tasks (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Security.Cryptography.ProtectedData (4.4) - restriction: || (&& (< net45) (>= netstandard2.0)) (>= netcoreapp2.0) + System.Security.Cryptography.X509Certificates (4.3.2) - restriction: || (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.3) (< win8)) (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.6) (< win8)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.4) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.5) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= net46) (< netstandard1.2)) (&& (< net45) (>= net46) (< netstandard1.3)) (&& (< net45) (>= net46) (>= netstandard1.4) (< netstandard1.5)) (&& (< net45) (>= net46) (< netstandard1.4)) (&& (< net45) (>= net46) (>= netstandard1.5) (< netstandard1.6)) (&& (< net45) (>= net46) (>= netstandard1.6) (< netstandard2.0)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= net46) (< netstandard1.5) (>= uap10.0)) (&& (>= net46) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.1) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.2) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.3) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.4) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.5) (< portable-net45+win8+wpa81)) (&& (< netstandard1.5) (>= netstandard1.6) (>= uap10.0)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) (&& (< netstandard1.5) (>= uap10.0) (< win8) (< wpa81)) (&& (>= netstandard1.6) (< portable-net45+win8+wpa81)) (&& (< portable-net45+win8+wpa81) (>= uap10.0)) + Microsoft.NETCore.Platforms (>= 1.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< netstandard1.3)) + runtime.native.System (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + runtime.native.System.Net.Http (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + runtime.native.System.Security.Cryptography.OpenSsl (>= 4.3.2) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Collections (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< netstandard1.3)) + System.Diagnostics.Debug (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Globalization (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< netstandard1.3)) + System.Globalization.Calendars (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< netstandard1.3)) + System.IO (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< netstandard1.3)) + System.IO.FileSystem (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< netstandard1.3)) + System.IO.FileSystem.Primitives (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Resources.ResourceManager (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< netstandard1.3)) + System.Runtime (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net46) (>= netstandard1.3) (< netstandard1.4)) (&& (< monoandroid) (< net46) (>= netstandard1.4) (< netstandard1.6)) (&& (< monoandroid) (< netstandard1.3)) + System.Runtime.Extensions (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< netstandard1.3)) + System.Runtime.Handles (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net46) (>= netstandard1.3) (< netstandard1.4)) (&& (< monoandroid) (< net46) (>= netstandard1.4) (< netstandard1.6)) (&& (< monoandroid) (< netstandard1.3)) + System.Runtime.InteropServices (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< netstandard1.3)) + System.Runtime.Numerics (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< netstandard1.3)) + System.Security.Cryptography.Algorithms (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net46) (>= netstandard1.3) (< netstandard1.4)) (&& (< monoandroid) (< net46) (>= netstandard1.4) (< netstandard1.6)) (&& (< monoandroid) (< netstandard1.3)) (&& (>= net46) (< netstandard1.4)) (>= net461) + System.Security.Cryptography.Cng (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< netstandard1.3)) + System.Security.Cryptography.Csp (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Security.Cryptography.Encoding (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net46) (>= netstandard1.3) (< netstandard1.4)) (&& (< monoandroid) (< net46) (>= netstandard1.4) (< netstandard1.6)) (&& (< monoandroid) (< netstandard1.3)) (&& (>= net46) (< netstandard1.4)) (>= net461) + System.Security.Cryptography.OpenSsl (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Security.Cryptography.Primitives (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< netstandard1.3)) + System.Text.Encoding (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< netstandard1.3)) + System.Threading (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net46) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< netstandard1.3)) + System.Security.Principal.Windows (4.4.1) - restriction: || (&& (>= monoandroid) (>= netstandard2.0)) (&& (>= monotouch) (>= netstandard2.0)) (&& (< net45) (>= netstandard2.0)) (>= netcoreapp2.0) (&& (>= netstandard2.0) (>= xamarinios)) (&& (>= netstandard2.0) (>= xamarinmac)) (&& (>= netstandard2.0) (>= xamarintvos)) (&& (>= netstandard2.0) (>= xamarinwatchos)) + Microsoft.NETCore.Platforms (>= 2.0) - restriction: >= netcoreapp2.0 + System.Text.Encoding (4.3) - restriction: || (&& (< monoandroid) (< netstandard1.2) (>= netstandard1.3) (< win8)) (&& (< monoandroid) (< netstandard1.2) (>= netstandard1.6) (< win8)) (&& (< monoandroid) (< netstandard1.3) (>= netstandard1.4) (< win8) (< wpa81)) (&& (< monoandroid) (< netstandard1.3) (>= netstandard1.5) (< win8) (< wpa81)) (>= net45) (&& (>= net46) (< netstandard1.3)) (&& (>= net46) (< netstandard1.4)) (&& (>= net46) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (>= netstandard1.1) (< portable-net45+win8+wp8+wpa81)) (&& (>= netstandard1.1) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (>= netstandard1.2) (< portable-net45+win8+wp8+wpa81)) (&& (>= netstandard1.2) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (>= netstandard1.3) (< portable-net45+win8+wp8+wpa81)) (&& (>= netstandard1.3) (< portable-net45+win8+wpa81)) (&& (< netstandard1.3) (>= uap10.0)) (&& (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (>= netstandard1.4) (< portable-net45+win8+wp8+wpa81)) (&& (>= netstandard1.4) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (>= netstandard1.5) (< portable-net45+win8+wp8+wpa81)) (&& (>= netstandard1.5) (< portable-net45+win8+wpa81)) (&& (< netstandard1.5) (>= netstandard1.6) (>= uap10.0)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) (&& (< netstandard1.5) (>= uap10.0) (< win8) (< wpa81)) (&& (>= netstandard1.6) (< portable-net45+win8+wp8+wpa81)) (&& (>= netstandard1.6) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.6) (< win8) (< wpa81)) (>= netstandard2.0) (&& (< portable-net45+win8+wp8+wpa81) (>= uap10.0)) (&& (< portable-net45+win8+wpa81) (>= uap10.0)) + Microsoft.NETCore.Platforms (>= 1.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + Microsoft.NETCore.Targets (>= 1.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + System.Runtime (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + System.Text.Encoding.Extensions (4.3) - restriction: || (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.3) (< win8)) (&& (< net45) (>= net46) (< netstandard1.4)) (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (< net45) (>= netstandard2.0)) (&& (>= net46) (< portable-net45+win8+wp8+wpa81)) (&& (>= netstandard1.1) (< portable-net45+win8+wp8+wpa81)) (&& (>= netstandard1.1) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.2) (< portable-net45+win8+wp8+wpa81)) (&& (>= netstandard1.3) (< portable-net45+win8+wp8+wpa81)) (&& (>= netstandard1.3) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.4) (< portable-net45+win8+wp8+wpa81)) (&& (>= netstandard1.5) (< portable-net45+win8+wp8+wpa81)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) (&& (< netstandard1.5) (>= uap10.0) (< win8) (< wpa81)) (&& (>= netstandard1.6) (< portable-net45+win8+wp8+wpa81)) (&& (< portable-net45+win8+wp8+wpa81) (>= uap10.0)) + Microsoft.NETCore.Platforms (>= 1.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + Microsoft.NETCore.Targets (>= 1.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + System.Runtime (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + System.Text.Encoding (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + System.Text.RegularExpressions (4.3) - restriction: || (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.3) (< win8)) (&& (< net45) (>= net46) (< netstandard1.4)) (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0)) (&& (>= net46) (< portable-net45+win8+wp8+wpa81)) (&& (>= netstandard1.1) (< portable-net45+win8+wp8+wpa81)) (&& (>= netstandard1.1) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.2) (< portable-net45+win8+wp8+wpa81)) (&& (>= netstandard1.3) (< portable-net45+win8+wp8+wpa81)) (&& (>= netstandard1.3) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.4) (< portable-net45+win8+wp8+wpa81)) (&& (>= netstandard1.5) (< portable-net45+win8+wp8+wpa81)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) (&& (< netstandard1.5) (>= uap10.0) (< win8) (< wpa81)) (&& (>= netstandard1.6) (< portable-net45+win8+wp8+wpa81)) (&& (< portable-net45+win8+wp8+wpa81) (>= uap10.0)) + System.Collections (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (< netcoreapp1.1) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Globalization (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (< netcoreapp1.1) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Resources.ResourceManager (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (< netcoreapp1.1) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Runtime (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.6) (< win8) (< wpa81)) (>= netcoreapp1.1) (< portable-net45+win8+wp8+wpa81) + System.Runtime.Extensions (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (< netcoreapp1.1) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Threading (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (< netcoreapp1.1) (>= netstandard1.6) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Threading (4.3) - restriction: || (&& (< monoandroid) (< netstandard1.0) (>= netstandard1.1) (< win8)) (&& (< monoandroid) (< netstandard1.1) (>= netstandard1.2) (< win8)) (&& (< monoandroid) (< netstandard1.1) (>= netstandard1.3) (< win8)) (&& (< monoandroid) (< netstandard1.1) (>= netstandard1.4) (< win8)) (&& (< monoandroid) (< netstandard1.1) (>= netstandard1.5) (< win8)) (&& (< monoandroid) (< netstandard1.2) (>= netstandard1.3) (< win8)) (&& (< monoandroid) (< netstandard1.3) (>= netstandard1.4) (< win8) (< wpa81)) (>= net45) (&& (>= net46) (< netstandard1.1)) (&& (>= net46) (< netstandard1.3)) (&& (>= net46) (< netstandard1.4)) (&& (>= net46) (< portable-net45+win8+wpa81)) (&& (< netstandard1.0) (>= netstandard1.1) (< portable-net45+win8)) (&& (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (>= netstandard1.1) (< portable-net45+win8+wpa81)) (&& (< netstandard1.1) (>= uap10.0) (< win8)) (&& (< netstandard1.1) (< win8) (>= wpa81)) (&& (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (>= netstandard1.2) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (>= netstandard1.3) (< portable-net45+win8+wpa81)) (&& (< netstandard1.3) (>= uap10.0)) (&& (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (>= netstandard1.4) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.5) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.5) (< win8) (< wpa81)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) (&& (< netstandard1.5) (>= uap10.0) (< win8) (< wpa81)) (>= netstandard1.6) (&& (< portable-net45+win8+wpa81) (>= uap10.0)) + System.Runtime (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + System.Threading.Tasks (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + System.Threading.Tasks (4.3) - restriction: || (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.3) (< win8)) (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.6) (< win8)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.4) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.5) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.4) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.5) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= net46) (< netstandard1.3)) (&& (< net45) (>= net46) (< netstandard1.4)) (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0)) (&& (< net45) (>= netstandard2.0)) (&& (>= net46) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.1) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.2) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.3) (< portable-net45+win8+wpa81)) (&& (< netstandard1.3) (>= uap10.0) (< win8) (< wpa81)) (&& (>= netstandard1.4) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.5) (< portable-net45+win8+wpa81)) (&& (< netstandard1.5) (>= netstandard1.6) (>= uap10.0)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) (&& (< netstandard1.5) (>= uap10.0) (< win8) (< wpa81)) (&& (>= netstandard1.6) (< portable-net45+win8+wp8+wpa81)) (&& (>= netstandard1.6) (< portable-net45+win8+wpa81)) (&& (< portable-net45+win8+wpa81) (>= uap10.0)) + Microsoft.NETCore.Platforms (>= 1.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + Microsoft.NETCore.Targets (>= 1.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + System.Runtime (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + System.Threading.Tasks.Extensions (4.4) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.3) (< win8)) (&& (< monoandroid) (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= net46) (< netstandard1.4)) (&& (>= net46) (< portable-net45+win8+wp8+wpa81)) (&& (>= netstandard1.1) (< portable-net45+win8+wp8+wpa81)) (&& (>= netstandard1.2) (< portable-net45+win8+wp8+wpa81)) (&& (>= netstandard1.3) (< portable-net45+win8+wp8+wpa81)) (&& (>= netstandard1.3) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.4) (< portable-net45+win8+wp8+wpa81)) (&& (>= netstandard1.5) (< portable-net45+win8+wp8+wpa81)) (&& (< netstandard1.5) (>= uap10.0) (< win8) (< wpa81)) (&& (>= netstandard1.6) (< portable-net45+win8+wp8+wpa81)) (&& (< portable-net45+win8+wp8+wpa81) (>= uap10.0)) + System.Collections (>= 4.3) - restriction: && (>= netstandard1.0) (< netstandard2.0) (< xamarinmac) + System.Runtime (>= 4.3) - restriction: && (>= netstandard1.0) (< netstandard2.0) (< xamarinmac) + System.Threading.Tasks (>= 4.3) - restriction: && (>= netstandard1.0) (< netstandard2.0) (< xamarinmac) + System.Threading.Tasks.Parallel (4.3) - restriction: && (< net45) (>= netstandard1.6) (< netstandard2.0) + System.Collections.Concurrent (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.1) (< netstandard1.3) (< win8) (< wpa81)) (< portable-net45+win8+wpa81) + System.Diagnostics.Debug (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wpa81) + System.Diagnostics.Tracing (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wpa81) + System.Resources.ResourceManager (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wpa81) + System.Runtime (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.1) (< netstandard1.3) (< win8) (< wpa81)) (< portable-net45+win8+wpa81) + System.Runtime.Extensions (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wpa81) + System.Threading (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wpa81) + System.Threading.Tasks (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.1) (< netstandard1.3) (< win8) (< wpa81)) (< portable-net45+win8+wpa81) + System.Threading.Thread (4.3) - restriction: || (&& (< net45) (>= netstandard1.6) (< netstandard2.0)) (&& (< net45) (>= netstandard2.0)) + System.Runtime (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Threading.ThreadPool (4.3) - restriction: || (&& (< net45) (>= netstandard1.6) (< netstandard2.0)) (&& (< net45) (>= netstandard2.0)) + System.Runtime (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Runtime.Handles (>= 4.3) - restriction: && (< monoandroid) (< monotouch) (< net46) (>= netstandard1.3) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Threading.Timer (4.3) - restriction: || (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + Microsoft.NETCore.Platforms (>= 1.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net451) (>= netstandard1.2) (< win81) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net451+win81+wpa81) + Microsoft.NETCore.Targets (>= 1.1) - restriction: || (&& (< monoandroid) (< monotouch) (< net451) (>= netstandard1.2) (< win81) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net451+win81+wpa81) + System.Runtime (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net451) (>= netstandard1.2) (< win81) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net451+win81+wpa81) + System.ValueTuple (4.4) + NETStandard.Library (>= 1.6.1) - restriction: && (< monoandroid) (< monotouch) (< net461) (>= netstandard1.0) (< netstandard2.0) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos) + System.Xml.ReaderWriter (4.3.1) - restriction: || (&& (< monoandroid) (< net45) (< netstandard1.2) (>= netstandard1.3) (< win8)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.4) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.5) (< win8) (< wpa81)) (&& (< monoandroid) (< net45) (< netstandard1.3) (>= netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= net46) (< netstandard1.4)) (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= netstandard1.1) (< portable-net45+win8+wp8+wpa81)) (&& (>= netstandard1.1) (< portable-net45+win8+wpa81)) (&& (>= netstandard1.2) (< portable-net45+win8+wp8+wpa81)) (&& (>= netstandard1.3) (< portable-net45+win8+wp8+wpa81)) (&& (>= netstandard1.3) (< portable-net45+win8+wpa81)) (&& (< netstandard1.3) (>= uap10.0) (< win8) (< wpa81)) (&& (>= netstandard1.4) (< portable-net45+win8+wp8+wpa81)) (&& (>= netstandard1.5) (< portable-net45+win8+wp8+wpa81)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) (&& (< netstandard1.5) (>= uap10.0) (< win8) (< wpa81)) (&& (>= netstandard1.6) (< portable-net45+win8+wp8+wpa81)) (&& (< portable-net45+win8+wp8+wpa81) (>= uap10.0)) + System.Collections (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Diagnostics.Debug (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Globalization (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.IO (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + System.IO.FileSystem (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.IO.FileSystem.Primitives (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Resources.ResourceManager (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Runtime (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + System.Runtime.Extensions (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Runtime.InteropServices (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Text.Encoding (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + System.Text.Encoding.Extensions (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Text.RegularExpressions (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Threading.Tasks (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + System.Threading.Tasks.Extensions (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Xml.XDocument (4.3) - restriction: || (&& (< net45) (>= netstandard1.1) (< netstandard1.2) (< win8)) (&& (< net45) (>= netstandard1.2) (< netstandard1.3) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.3) (< netstandard1.4) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.4) (< netstandard1.5) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.5) (< netstandard1.6) (< win8) (< wpa81)) (&& (< net45) (>= netstandard1.6) (< netstandard2.0) (< win8) (< wpa81)) (&& (>= netstandard1.1) (< portable-net45+win8+wpa81)) (&& (< netstandard1.5) (>= uap10.0) (< uap10.1)) + System.Collections (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Diagnostics.Debug (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Diagnostics.Tools (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Globalization (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.IO (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + System.Reflection (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Resources.ResourceManager (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Runtime (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + System.Runtime.Extensions (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Text.Encoding (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Threading (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (< portable-net45+win8+wp8+wpa81) + System.Xml.ReaderWriter (>= 4.3) - restriction: || (&& (< monoandroid) (< monotouch) (< net45) (>= netstandard1.3) (< win8) (< wpa81) (< xamarinios) (< xamarinmac) (< xamarintvos) (< xamarinwatchos)) (&& (< monoandroid) (< net45) (>= netstandard1.0) (< netstandard1.3) (< win8) (< wp8) (< wpa81)) (< portable-net45+win8+wp8+wpa81) + remote: https://ci.appveyor.com/nuget/fsharp-formatting + FSharp.Formatting (3.0.0-beta11) + FSharp.Compiler.Service (>= 22.0.3 < 23.0) + Microsoft.AspNet.Razor (>= 3.2.4 < 4.0) + System.ValueTuple (>= 4.4 < 5.0) GITHUB remote: fsharp/FAKE - modules/Octokit/Octokit.fsx (15e1b741f4ae9fbaad640a65231dfcec28ce6ddd) + modules/Octokit/Octokit.fsx (896e227b6da98b21001a1e5940df01d442bc7a25) Octokit (>= 0.20) \ No newline at end of file diff --git a/src/FSharpx.Collections.Experimental/AltBinaryRandomAccessList.fs b/src/FSharpx.Collections.Experimental/AltBinaryRandomAccessList.fs index 6727a9c0..799e655d 100644 --- a/src/FSharpx.Collections.Experimental/AltBinaryRandomAccessList.fs +++ b/src/FSharpx.Collections.Experimental/AltBinaryRandomAccessList.fs @@ -310,9 +310,8 @@ and AltBinRndAccList<'T> with | None -> None | Some(x) -> Some(x) - -[] - module AltBinaryRandomAccessList = +[] +module AltBinaryRandomAccessList = //pattern discriminator let (|Cons|Nil|) (l: AltBinRndAccList<'T>) = match l.TryUncons with Some(a,b) -> Cons(a,b) | None -> Nil diff --git a/src/FSharpx.Collections.Experimental/AssemblyInfo.fs b/src/FSharpx.Collections.Experimental/AssemblyInfo.fs index 9d958af4..f7851efa 100644 --- a/src/FSharpx.Collections.Experimental/AssemblyInfo.fs +++ b/src/FSharpx.Collections.Experimental/AssemblyInfo.fs @@ -8,8 +8,8 @@ open System.Runtime.CompilerServices [] [] [] -[] -[] +[] +[] do () module internal AssemblyVersionInformation = @@ -18,5 +18,5 @@ module internal AssemblyVersionInformation = let [] AssemblyDescription = "FSharpx.Collections is a collection of datastructures for use with F# and C#." let [] InternalsVisibleTo = "FSharpx.Collections.Tests" let [] InternalsVisibleTo_1 = "FSharpx.Collections.Experimental.Tests" - let [] AssemblyVersion = "1.17.0" - let [] AssemblyFileVersion = "1.17.0" + let [] AssemblyVersion = "2.0.0" + let [] AssemblyFileVersion = "2.0.0" diff --git a/src/FSharpx.Collections.Experimental/BKTree.fs b/src/FSharpx.Collections.Experimental/BKTree.fs index a9070b3a..8b9240eb 100644 --- a/src/FSharpx.Collections.Experimental/BKTree.fs +++ b/src/FSharpx.Collections.Experimental/BKTree.fs @@ -26,6 +26,7 @@ type BKTree<'T> = member x.GetEnumerator() = (x :> _ seq).GetEnumerator() :> IEnumerator +[] module BKTree = let isEmpty = function diff --git a/src/FSharpx.Collections.Experimental/BankersDeque.fs b/src/FSharpx.Collections.Experimental/BankersDeque.fs index 68dd7071..cf752390 100644 --- a/src/FSharpx.Collections.Experimental/BankersDeque.fs +++ b/src/FSharpx.Collections.Experimental/BankersDeque.fs @@ -391,7 +391,7 @@ type BankersDeque<'T> (c : int, frontLength : int, front : LazyList<'T>, rBackL member this.GetEnumerator() = (this :> _ seq).GetEnumerator() :> IEnumerator -[] +[] module BankersDeque = //pattern discriminators diff --git a/src/FSharpx.Collections.Experimental/BankersQueue.fs b/src/FSharpx.Collections.Experimental/BankersQueue.fs index 6d355529..c6c3449f 100644 --- a/src/FSharpx.Collections.Experimental/BankersQueue.fs +++ b/src/FSharpx.Collections.Experimental/BankersQueue.fs @@ -121,7 +121,7 @@ type BankersQueue<'T> (frontLength : int, front : LazyList<'T>, backLength : int member this.GetEnumerator() = (this :> _ seq).GetEnumerator() :> IEnumerator -[] +[] module BankersQueue = //pattern discriminators let (|Cons|Nil|) (q : BankersQueue<'T>) = match q.TryUncons with Some(a,b) -> Cons(a,b) | None -> Nil diff --git a/src/FSharpx.Collections.Experimental/BatchedDeque.fs b/src/FSharpx.Collections.Experimental/BatchedDeque.fs index 02907839..97a0f3dc 100644 --- a/src/FSharpx.Collections.Experimental/BatchedDeque.fs +++ b/src/FSharpx.Collections.Experimental/BatchedDeque.fs @@ -351,7 +351,7 @@ type BatchedDeque<'T> (front, rBack) = member this.GetEnumerator() = (this :> _ seq).GetEnumerator() :> IEnumerator -[] +[] module BatchedDeque = //pattern discriminator diff --git a/src/FSharpx.Collections.Experimental/BatchedQueue.fs b/src/FSharpx.Collections.Experimental/BatchedQueue.fs index 4318ab1f..563a01b3 100644 --- a/src/FSharpx.Collections.Experimental/BatchedQueue.fs +++ b/src/FSharpx.Collections.Experimental/BatchedQueue.fs @@ -132,7 +132,7 @@ type BatchedQueue<'T> (front : list<'T>, rBack : list<'T>) = member this.GetEnumerator() = (this :> _ seq).GetEnumerator() :> IEnumerator -[] +[] module BatchedQueue = //pattern discriminators let (|Cons|Nil|) (q : BatchedQueue<'T>) = match q.TryUncons with Some(a,b) -> Cons(a,b) | None -> Nil diff --git a/src/FSharpx.Collections.Experimental/BinaryRandomAccessList.fs b/src/FSharpx.Collections.Experimental/BinaryRandomAccessList.fs index 1e671816..dcd19387 100644 --- a/src/FSharpx.Collections.Experimental/BinaryRandomAccessList.fs +++ b/src/FSharpx.Collections.Experimental/BinaryRandomAccessList.fs @@ -6,13 +6,12 @@ namespace FSharpx.Collections.Experimental open System.Collections open FSharpx.Collections -open System.Collections.Generic type TreeBRAL<'T> = | Leaf of 'T | Node of int * TreeBRAL<'T> * TreeBRAL<'T> -type Digit<'T> = +type TreeBRALDigit<'T> = | Zero | One of TreeBRAL<'T> @@ -24,7 +23,7 @@ type BinaryRandomAccessList<'T> (randomAccessList) = | Leaf _ -> 1 | Node (w, _, _) -> w - static member private length : int * int * list> -> int = function + static member private length : int * int * list> -> int = function | len, acc, [] -> len | len, acc, One(_)::ts -> BinaryRandomAccessList.length ((len + acc), (2 * acc), ts) | len, acc, Zero::ts -> BinaryRandomAccessList.length (len, (2 * acc), ts) @@ -43,26 +42,26 @@ type BinaryRandomAccessList<'T> (randomAccessList) = | i, Node(w, t1, t2) -> if i < w / 2 then BinaryRandomAccessList.tryLookupTree (i, t1) else BinaryRandomAccessList.tryLookupTree (i - w/2, t2) - static member private lookup : int * list> -> 'T = function + static member private lookup : int * list> -> 'T = function | _, [] -> raise Exceptions.OutOfBounds | i, Zero::ts -> BinaryRandomAccessList.lookup (i, ts) | i, One t::ts -> let size = BinaryRandomAccessList.size t if i < size then BinaryRandomAccessList.lookupTree (i, t) else BinaryRandomAccessList.lookup ((i - size), ts) - static member private tryLookup : int * list> -> 'T option = function + static member private tryLookup : int * list> -> 'T option = function | _, [] -> None | i, Zero::ts -> BinaryRandomAccessList.tryLookup (i, ts) | i, One t::ts -> let size = BinaryRandomAccessList.size t if i < size then BinaryRandomAccessList.tryLookupTree (i, t) else BinaryRandomAccessList.tryLookup ((i - size), ts) - static member private consTree : TreeBRAL<'T> * list> -> list> = function + static member private consTree : TreeBRAL<'T> * list> -> list> = function | t, [] -> [One t] | t, Zero::ts -> One t :: ts | t1, One t2 :: ts -> Zero :: BinaryRandomAccessList.consTree ((BinaryRandomAccessList.link t1 t2), ts) - static member private unconsTree : list> -> TreeBRAL<'T> * list> = function + static member private unconsTree : list> -> TreeBRAL<'T> * list> = function | [] -> raise Exceptions.Empty | [One t] -> t, [] | One t :: ts -> t, Zero::ts @@ -71,7 +70,7 @@ type BinaryRandomAccessList<'T> (randomAccessList) = | Node(_, t1, t2), ts' -> t1, One t2::ts' | _ -> failwith "should never get there" - static member private tryUnconsTree : list> -> (TreeBRAL<'T> * list>) option = function + static member private tryUnconsTree : list> -> (TreeBRAL<'T> * list>) option = function | [] -> None | [One t] -> Some(t, []) | One t :: ts -> Some(t, Zero::ts) @@ -98,7 +97,7 @@ type BinaryRandomAccessList<'T> (randomAccessList) = else Some(Node(w, t1, BinaryRandomAccessList.updateTree (i - w/2, y, t2))) - static member update i y : list> -> list> = function + static member update i y : list> -> list> = function | [] -> raise Exceptions.OutOfBounds | Zero::ts -> Zero :: BinaryRandomAccessList.update i y ts | One t::ts -> @@ -109,7 +108,7 @@ type BinaryRandomAccessList<'T> (randomAccessList) = else (One t) :: BinaryRandomAccessList.update (i - size) y ts - static member tryUpdate i y : list> -> list> option = function + static member tryUpdate i y : list> -> list> option = function | [] -> None | Zero::ts -> Some(Zero :: BinaryRandomAccessList.update i y ts) | One t::ts -> @@ -124,7 +123,7 @@ type BinaryRandomAccessList<'T> (randomAccessList) = if Seq.isEmpty s then BinaryRandomAccessList([]) else let a = Array.ofSeq s - let rec loop (acc: list>) dec (a': array<'T>) = + let rec loop (acc: list>) dec (a': array<'T>) = if dec < 0 then BinaryRandomAccessList(acc) else loop (BinaryRandomAccessList.consTree ((Leaf a'.[dec]), acc)) (dec - 1) a' @@ -163,7 +162,7 @@ type BinaryRandomAccessList<'T> (randomAccessList) = ///O(n). Returns random access list reversed. member this.Rev() = - let rec loop : list> * list> -> BinaryRandomAccessList<'T> = function + let rec loop : list> * list> -> BinaryRandomAccessList<'T> = function | acc, [] -> BinaryRandomAccessList(acc) | acc, ral -> let x, ts = BinaryRandomAccessList.unconsTree ral @@ -257,7 +256,7 @@ type BinaryRandomAccessList<'T> (randomAccessList) = member this.GetEnumerator() = (this :> _ seq).GetEnumerator() :> IEnumerator -[] +[] module BinaryRandomAccessList = //pattern discriminator diff --git a/src/FSharpx.Collections.Experimental/BinaryRoseTree.fs b/src/FSharpx.Collections.Experimental/BinaryRoseTree.fs index dcae70f2..a40cca5e 100644 --- a/src/FSharpx.Collections.Experimental/BinaryRoseTree.fs +++ b/src/FSharpx.Collections.Experimental/BinaryRoseTree.fs @@ -48,7 +48,7 @@ type BinaryRoseTree<'T> = //{ Root: 'T; Children: 'T BinaryRoseTree Vector } member x.GetEnumerator() = (x :> seq<'T>).GetEnumerator() :> IEnumerator -[] +[] module BinaryRoseTree = let inline createTree root (children : BinaryRoseTree<'T>) = Node(root, children, Nil) diff --git a/src/FSharpx.Collections.Experimental/BinaryTreeZipper.fs b/src/FSharpx.Collections.Experimental/BinaryTreeZipper.fs index a5d895cb..10dc07f3 100644 --- a/src/FSharpx.Collections.Experimental/BinaryTreeZipper.fs +++ b/src/FSharpx.Collections.Experimental/BinaryTreeZipper.fs @@ -1,16 +1,10 @@ -/// TreeZipper -/// original implementation taken from http://blog.xquant.net/?p=156 -module FSharpx.Collections.Experimental.BinaryTreeZipper +namespace FSharpx.Collections.Experimental /// A simple binary tree type BinaryTree<'T> = | Leaf | Branch of 'T * BinaryTree<'T> * BinaryTree<'T> - -/// Creates a new branch with the label x and two leafs as subbranches -let branch x = Branch(x,Leaf,Leaf) - type TreeDirection = Left | Right /// The zipper datastructure for binary trees @@ -18,49 +12,55 @@ type BinaryTreeZipper<'T> = { Focus:BinaryTree<'T> Path: (TreeDirection * 'T * BinaryTree<'T>) list } -open FSharpx +/// TreeZipper +/// original implementation taken from http://blog.xquant.net/?p=156 +[] +module BinaryTreeZipper = + + /// Creates a new branch with the label x and two leafs as subbranches + let branch x = Branch(x,Leaf,Leaf) -/// Moves the zipper one level up -let up z = - match z.Path with - | (Left,v,other)::ep -> { Focus = Branch(v,z.Focus,other); Path = ep } - | (Right,v,other)::ep -> { Focus = Branch(v,other,z.Focus); Path = ep } - | [] -> failwith "can't go up" // because ep only goes down and is empty + /// Moves the zipper one level up + let up z = + match z.Path with + | (Left,v,other)::ep -> { Focus = Branch(v,z.Focus,other); Path = ep } + | (Right,v,other)::ep -> { Focus = Branch(v,other,z.Focus); Path = ep } + | [] -> failwith "can't go up" // because ep only goes down and is empty -/// Moves the zipper to the top -let rec top z = - match z.Path with - | [] -> z - | _ -> top (up z) + /// Moves the zipper to the top + let rec top z = + match z.Path with + | [] -> z + | _ -> top (up z) -/// Moves the zipper to the left -let left z = - match z.Focus with - | (Branch(v, explored, other)) -> { Focus = explored; Path = (Left, v, other) :: z.Path } - | Leaf -> failwith "can't go down on leaf" + /// Moves the zipper to the left + let left z = + match z.Focus with + | (Branch(v, explored, other)) -> { Focus = explored; Path = (Left, v, other) :: z.Path } + | Leaf -> failwith "can't go down on leaf" -/// Moves the zipper to the right -let right z = - match z.Focus with - | (Branch(v, other, explored)) -> { Focus = explored; Path = (Right, v, other) :: z.Path } - | Leaf -> failwith "can't go down on leaf" + /// Moves the zipper to the right + let right z = + match z.Focus with + | (Branch(v, other, explored)) -> { Focus = explored; Path = (Right, v, other) :: z.Path } + | Leaf -> failwith "can't go down on leaf" -/// Modifies the current focus inside the zipper -let setFocus newFocus zipper = { zipper with Focus = newFocus } + /// Modifies the current focus inside the zipper + let setFocus newFocus zipper = { zipper with Focus = newFocus } -/// Creates a zipper from a tree -let zipper t = { Focus = t; Path = [] } + /// Creates a zipper from a tree + let zipper t = { Focus = t; Path = [] } -type TreeZipperDirection = Up | Left | Right + type TreeZipperDirection = Up | Left | Right -let inline getMove direction = - match direction with - | Up -> up - | Left -> left - | Right -> right + let inline getMove direction = + match direction with + | Up -> up + | Left -> left + | Right -> right -/// Moves the zipper in the directions of the given list -let rec move directions (z:BinaryTreeZipper<'T>) = - directions - |> Seq.map getMove - |> Seq.fold (|>) z \ No newline at end of file + /// Moves the zipper in the directions of the given list + let rec move directions (z:BinaryTreeZipper<'T>) = + directions + |> Seq.map getMove + |> Seq.fold (|>) z \ No newline at end of file diff --git a/src/FSharpx.Collections.Experimental/BinomialHeap.fs b/src/FSharpx.Collections.Experimental/BinomialHeap.fs index 38855c5b..9d8b778a 100644 --- a/src/FSharpx.Collections.Experimental/BinomialHeap.fs +++ b/src/FSharpx.Collections.Experimental/BinomialHeap.fs @@ -232,6 +232,7 @@ type BinomialHeap<'T when 'T : comparison> (isDescending : bool, heap : list IPriorityQueue<'T>) +[] module BinomialHeap = //pattern discriminator let (|Cons|Nil|) (h: BinomialHeap<'T>) = match h.TryUncons() with Some(a,b) -> Cons(a,b) | None -> Nil diff --git a/src/FSharpx.Collections.Experimental/BlockResizeArray.fs b/src/FSharpx.Collections.Experimental/BlockResizeArray.fs index 36c1a710..8a4fc836 100644 --- a/src/FSharpx.Collections.Experimental/BlockResizeArray.fs +++ b/src/FSharpx.Collections.Experimental/BlockResizeArray.fs @@ -219,6 +219,7 @@ type BlockResizeArray<'T> () = for i in 0..top do f a.[i] +[] module BlockResizeArray = ///Applies the given function to each element of the block resize array. diff --git a/src/FSharpx.Collections.Experimental/BootstrappedQueue.fs b/src/FSharpx.Collections.Experimental/BootstrappedQueue.fs index 56ae1837..e86f50bb 100644 --- a/src/FSharpx.Collections.Experimental/BootstrappedQueue.fs +++ b/src/FSharpx.Collections.Experimental/BootstrappedQueue.fs @@ -1,6 +1,4 @@ -// bootstrapped queue from Chris Okasaki’s “Purely functional data structures” -// original implementation taken from http://lepensemoi.free.fr/index.php/2010/02/18/bootstrapped-queue -module FSharpx.Collections.Experimental.BootstrappedQueue +namespace FSharpx.Collections.Experimental open FSharpx.Collections @@ -82,29 +80,34 @@ and BootstrappedQueue<'T> = let b0 = BootstrappedQueue.Empty NonEmptyBootstrappedQueue<'T>.create (l.Length) l b0 0 [] |> NonEmpty -///O(1). Returns queue of no elements. -let empty = Empty +/// bootstrapped queue from Chris Okasaki’s “Purely functional data structures” +/// original implementation taken from http://lepensemoi.free.fr/index.php/2010/02/18/bootstrapped-queue +[] +module BootstrappedQueue = -///O(1). Returns true if the queue has no elements -let isEmpty = function Empty -> true | _ -> false + ///O(1). Returns queue of no elements. + let empty = Empty -///O(log* n). Returns a new queue with the element added to the end. -let inline snoc x queue = BootstrappedQueue.snoc x queue + ///O(1). Returns true if the queue has no elements + let isEmpty = function Empty -> true | _ -> false -///O(1), worst case. Returns the first element. -let inline head queue = BootstrappedQueue<'T>.head queue + ///O(log* n). Returns a new queue with the element added to the end. + let inline snoc x queue = BootstrappedQueue.snoc x queue -///O(1), worst case. Returns option first element. -let inline tryGetHead queue = BootstrappedQueue<'T>.tryGetHead queue + ///O(1), worst case. Returns the first element. + let inline head queue = BootstrappedQueue<'T>.head queue -///O(log* n), worst case. Returns a new queue of the elements trailing the first element. -let inline tail queue = BootstrappedQueue<'T>.tail queue + ///O(1), worst case. Returns option first element. + let inline tryGetHead queue = BootstrappedQueue<'T>.tryGetHead queue -///O(log* n), worst case. Returns option queue of the elements trailing the first element. -let inline tryGetTail queue = BootstrappedQueue<'T>.tryGetTail queue + ///O(log* n), worst case. Returns a new queue of the elements trailing the first element. + let inline tail queue = BootstrappedQueue<'T>.tail queue -///O(1). Returns the count of elememts. -let inline length queue = BootstrappedQueue<'T>.length queue + ///O(log* n), worst case. Returns option queue of the elements trailing the first element. + let inline tryGetTail queue = BootstrappedQueue<'T>.tryGetTail queue -///O(1). Returns a queue of the list. -let inline ofList list = BootstrappedQueue<'T>.ofList list \ No newline at end of file + ///O(1). Returns the count of elememts. + let inline length queue = BootstrappedQueue<'T>.length queue + + ///O(1). Returns a queue of the list. + let inline ofList list = BootstrappedQueue<'T>.ofList list \ No newline at end of file diff --git a/src/FSharpx.Collections.Experimental/BottomUpMergeSort.fs b/src/FSharpx.Collections.Experimental/BottomUpMergeSort.fs index 139b0bdc..466ddab8 100644 --- a/src/FSharpx.Collections.Experimental/BottomUpMergeSort.fs +++ b/src/FSharpx.Collections.Experimental/BottomUpMergeSort.fs @@ -1,40 +1,42 @@ // BottomUp merge sort from Chris Okasaki’s “Purely functional data structures” // original implementation taken from http://lepensemoi.free.fr/index.php/2010/01/07/bottom-up-merge-sort -module FSharpx.Collections.Experimental.BottomUpMergeSort -open FSharpx +namespace FSharpx.Collections.Experimental -type Sortable<'T> = { - Size: int - Segments: Lazy>> } +[] +module BottomUpMergeSort = -let rec merge xs ys = - match xs, ys with - | [], ys -> ys - | xs, [] -> xs - | x::tlx, y::tly -> - if x <= y then - x :: merge tlx ys - else - y :: merge xs tly + type Sortable<'T> = { + Size: int + Segments: Lazy>> } + + let rec merge xs ys = + match xs, ys with + | [], ys -> ys + | xs, [] -> xs + | x::tlx, y::tly -> + if x <= y then + x :: merge tlx ys + else + y :: merge xs tly -let empty<'T> : Sortable<'T> = { Size = 0; Segments = lazy [] } + let empty<'T> : Sortable<'T> = { Size = 0; Segments = lazy [] } -let isEmpty x = x.Size = 0 + let isEmpty x = x.Size = 0 -let singleton x = { Size = 1; Segments = lazy [[x]] } + let singleton x = { Size = 1; Segments = lazy [[x]] } -let rec addSeg seg segs size = - if size % 2 = 0 then - seg::segs - else - addSeg (merge seg (List.head segs)) (List.tail segs) (size / 2) + let rec addSeg seg segs size = + if size % 2 = 0 then + seg::segs + else + addSeg (merge seg (List.head segs)) (List.tail segs) (size / 2) -let add x y = { Size = y.Size + 1; Segments = lazy addSeg [x] (y.Segments.Force()) y.Size } + let add x y = { Size = y.Size + 1; Segments = lazy addSeg [x] (y.Segments.Force()) y.Size } -let rec mergeAll xs ys = - match xs, ys with - | xs, [] -> xs - | xs, seg::segs -> mergeAll (merge xs seg) segs + let rec mergeAll xs ys = + match xs, ys with + | xs, [] -> xs + | xs, seg::segs -> mergeAll (merge xs seg) segs -let sort x = mergeAll [] (x.Segments.Force()) \ No newline at end of file + let sort x = mergeAll [] (x.Segments.Force()) \ No newline at end of file diff --git a/src/FSharpx.Collections.Experimental/DList.fs b/src/FSharpx.Collections.Experimental/DList.fs index 6c9bbfaa..df97e421 100644 --- a/src/FSharpx.Collections.Experimental/DList.fs +++ b/src/FSharpx.Collections.Experimental/DList.fs @@ -89,7 +89,7 @@ type DList<'T> = yield! y :> seq<'T> } enumerable.GetEnumerator() :> IEnumerator -[] +[] module DList = ///O(1). Returns DList of no elements. let empty<'T> : DList<'T> = Nil diff --git a/src/FSharpx.Collections.Experimental/Deque.fs b/src/FSharpx.Collections.Experimental/Deque.fs index 9425a508..3bc629f7 100644 --- a/src/FSharpx.Collections.Experimental/Deque.fs +++ b/src/FSharpx.Collections.Experimental/Deque.fs @@ -366,7 +366,7 @@ type Deque<'T> (front, rBack) = member this.GetEnumerator() = (this :> _ seq).GetEnumerator() :> IEnumerator -[] +[] module Deque = //pattern discriminators diff --git a/src/FSharpx.Collections.Experimental/EagerRoseTree.fs b/src/FSharpx.Collections.Experimental/EagerRoseTree.fs index fd74c9b7..360e96a5 100644 --- a/src/FSharpx.Collections.Experimental/EagerRoseTree.fs +++ b/src/FSharpx.Collections.Experimental/EagerRoseTree.fs @@ -29,8 +29,8 @@ type EagerRoseTree<'T> = and EagerRoseForest<'T> = EagerRoseTree<'T> list -[] [] +[] module EagerRoseTree = open FSharpx diff --git a/src/FSharpx.Collections.Experimental/FSharpx.Collections.Experimental.fsproj b/src/FSharpx.Collections.Experimental/FSharpx.Collections.Experimental.fsproj index ea97096c..f8d5f618 100644 --- a/src/FSharpx.Collections.Experimental/FSharpx.Collections.Experimental.fsproj +++ b/src/FSharpx.Collections.Experimental/FSharpx.Collections.Experimental.fsproj @@ -1,78 +1,23 @@  - + - Debug - AnyCPU - 8.0.30703 - 2.0 ad3c8e86-f4cf-426f-a31d-015056227777 Library FSharpx.Collections.Experimental FSharpx.Collections.Experimental FSharpx.Collections.Experimental - 2.3.0.0 - v4.5 - $(MSBuildProjectDirectory)\..\..\ - + net461;netstandard2.0 + true + + true + + true + + $(AllowedOutputExtensionsInPackageBuildOutputFolder);.pdb - - true - full - false - bin\Debug - TRACE;DEBUG - 3 - - - - - pdbonly - true - bin\Release - TRACE - 3 - bin\Release\FSharpx.Collections.Experimental.XML - - - 11 - - - - - - $(MSBuildExtensionsPath32)\..\Microsoft SDKs\F#\3.0\Framework\v4.0\Microsoft.FSharp.Targets - - - - - $(MSBuildExtensionsPath32)\Microsoft\VisualStudio\v$(VisualStudioVersion)\FSharp\Microsoft.FSharp.Targets - - - - - - - @@ -96,8 +41,8 @@ - + @@ -112,26 +57,11 @@ - - - - - FSharpx.Collections {1e95a279-c2a9-498b-bc72-6e7a0d6854ce} False - - - - - ..\..\packages\FSharp.Core\lib\net45\FSharp.Core.dll - True - True - - - - + \ No newline at end of file diff --git a/src/FSharpx.Collections.Experimental/FlatList.fs b/src/FSharpx.Collections.Experimental/FlatList.fs index 7047b6d8..3928b0ff 100644 --- a/src/FSharpx.Collections.Experimental/FlatList.fs +++ b/src/FSharpx.Collections.Experimental/FlatList.fs @@ -44,8 +44,7 @@ type FlatList<'T> = | null -> (Seq.empty :> IEnumerable).GetEnumerator() | arr -> (arr :> IEnumerable).GetEnumerator() - -[] +[] module FlatList = let append(l1 : FlatList<'T>) (l2 : FlatList<'T>) = diff --git a/src/FSharpx.Collections.Experimental/FlatList.fsi b/src/FSharpx.Collections.Experimental/FlatList.fsi index 831d32b4..9d50fa3b 100644 --- a/src/FSharpx.Collections.Experimental/FlatList.fsi +++ b/src/FSharpx.Collections.Experimental/FlatList.fsi @@ -16,7 +16,7 @@ type FlatList<'T> = /// O(1). Returns true if the flatlist has no elements. member IsEmpty : bool -[] +[] module FlatList = /// O(n). Creates a flatlist that contains the elements of one flatlist followed by the elements of another flatlist. diff --git a/src/FSharpx.Collections.Experimental/HeapPriorityQueue.fs b/src/FSharpx.Collections.Experimental/HeapPriorityQueue.fs index 628d0af6..7d90fa40 100644 --- a/src/FSharpx.Collections.Experimental/HeapPriorityQueue.fs +++ b/src/FSharpx.Collections.Experimental/HeapPriorityQueue.fs @@ -1,8 +1,8 @@ namespace FSharpx.Collections.Experimental -open FSharpx.Collections.Experimental.PairingHeap open FSharpx.Collections +[] module HeapPriorityQueue = let empty<'T when 'T : comparison> maxQueue = PairingHeap.empty maxQueue :> IPriorityQueue<'T> diff --git a/src/FSharpx.Collections.Experimental/HoodMelvilleQueue.fs b/src/FSharpx.Collections.Experimental/HoodMelvilleQueue.fs index 8da56afa..671b8f29 100644 --- a/src/FSharpx.Collections.Experimental/HoodMelvilleQueue.fs +++ b/src/FSharpx.Collections.Experimental/HoodMelvilleQueue.fs @@ -176,7 +176,7 @@ type HoodMelvilleQueue<'T> (frontLength : int, front : list<'T>, state : Rotatio member this.GetEnumerator() = (this :> _ seq).GetEnumerator() :> IEnumerator -[] +[] module HoodMelvilleQueue = //pattern discriminators let (|Cons|Nil|) (q : HoodMelvilleQueue<'T>) = match q.TryUncons with Some(a,b) -> Cons(a,b) | None -> Nil diff --git a/src/FSharpx.Collections.Experimental/ImplicitQueue.fs b/src/FSharpx.Collections.Experimental/ImplicitQueue.fs index ba2b0dc2..e5b9b88a 100644 --- a/src/FSharpx.Collections.Experimental/ImplicitQueue.fs +++ b/src/FSharpx.Collections.Experimental/ImplicitQueue.fs @@ -1,6 +1,4 @@ -// implicit queue from Chris Okasaki’s “Purely functional data structures” -// original implementation taken from http://lepensemoi.free.fr/index.php/2010/02/18/implicit-queue -module FSharpx.Collections.Experimental.ImplicitQueue +namespace FSharpx.Collections.Experimental open FSharpx.Collections @@ -13,18 +11,12 @@ type ImplicitQueue<'T> = | Shallow of Digit<'T> | Deep of Digit<'T> * Lazy> * Digit<'T> -///O(1). Returns queue of no elements. -let empty = Shallow Zero - -///O(1). Returns true if the queue has no elements -let isEmpty = function Shallow Zero -> true | _ -> false - type ImplicitQueue<'T> with //polymorphic recursion cannot be achieved through let-bound functions //hence we use static member methods static member snoc (x:'T) : ImplicitQueue<'T> -> ImplicitQueue<'T> = function | Shallow Zero -> Shallow (One x) - | Shallow (One y) -> Deep (Two (y, x), lazy empty, Zero) + | Shallow (One y) -> Deep (Two (y, x), lazy Shallow Zero, Zero) | Deep(f, m, Zero) -> Deep(f, m, One x) | Deep(f, m, One y) -> Deep(f, lazy ImplicitQueue.snoc (y, x) (m.Force()), Zero) | _ -> failwith "should not get there" @@ -45,9 +37,10 @@ type ImplicitQueue<'T> with static member tail : ImplicitQueue<'T> -> ImplicitQueue<'T> = function | Shallow Zero -> raise Exceptions.Empty - | Shallow (One x) -> empty + | Shallow (One x) -> Shallow Zero | Deep(Two(x, y), m, r) -> Deep(One y, m, r) | Deep(One x, q, r) -> + let isEmpty = function Shallow Zero -> true | _ -> false let q' = q.Force() if isEmpty q' then Shallow r else let y, z = ImplicitQueue.head q' @@ -56,26 +49,38 @@ type ImplicitQueue<'T> with static member tryGetTail : ImplicitQueue<'T> -> ImplicitQueue<'T> option = function | Shallow Zero -> None - | Shallow (One x) -> Some empty + | Shallow (One x) -> Some <| Shallow Zero | Deep(Two(x, y), m, r) -> Some(Deep(One y, m, r)) | Deep(One x, q, r) -> + let isEmpty = function Shallow Zero -> true | _ -> false let q' = q.Force() if isEmpty q' then Some(Shallow r) else let y, z = ImplicitQueue.head q' Some(Deep(Two(y, z), lazy ImplicitQueue.tail q', r)) | _ -> failwith "should not get there" -///O(1), amortized. Returns a new queue with the element added to the end. -let inline snoc x queue = ImplicitQueue.snoc x queue +/// implicit queue from Chris Okasaki’s “Purely functional data structures” +/// original implementation taken from http://lepensemoi.free.fr/index.php/2010/02/18/implicit-queue +[] +module ImplicitQueue = + + ///O(1). Returns queue of no elements. + let empty = Shallow Zero + + ///O(1). Returns true if the queue has no elements + let isEmpty = function Shallow Zero -> true | _ -> false + + ///O(1), amortized. Returns a new queue with the element added to the end. + let inline snoc x queue = ImplicitQueue.snoc x queue -///O(1), amortized. Returns the first element. -let inline head queue = ImplicitQueue<'T>.head queue + ///O(1), amortized. Returns the first element. + let inline head queue = ImplicitQueue<'T>.head queue -///O(1), amortized. Returns option first element. -let inline tryGetHead queue = ImplicitQueue<'T>.tryGetHead queue + ///O(1), amortized. Returns option first element. + let inline tryGetHead queue = ImplicitQueue<'T>.tryGetHead queue -///O(1), amortized. Returns a new queue of the elements trailing the first element. -let inline tail queue = ImplicitQueue<'T>.tail queue + ///O(1), amortized. Returns a new queue of the elements trailing the first element. + let inline tail queue = ImplicitQueue<'T>.tail queue -///O(1), amortized. Returns option queue of the elements trailing the first element. -let inline tryGetTail queue = ImplicitQueue<'T>.tryGetTail queue \ No newline at end of file + ///O(1), amortized. Returns option queue of the elements trailing the first element. + let inline tryGetTail queue = ImplicitQueue<'T>.tryGetTail queue \ No newline at end of file diff --git a/src/FSharpx.Collections.Experimental/IndexedRoseTree.fs b/src/FSharpx.Collections.Experimental/IndexedRoseTree.fs index 9a375d69..a77b9a4a 100644 --- a/src/FSharpx.Collections.Experimental/IndexedRoseTree.fs +++ b/src/FSharpx.Collections.Experimental/IndexedRoseTree.fs @@ -30,7 +30,7 @@ type IndexedRoseTree<'T> = { Root: 'T; Children: PersistentVector _ seq).SequenceEqual y.Children -[] +[] module IndexedRoseTree = let inline create root children = { Root = root; Children = children } diff --git a/src/FSharpx.Collections.Experimental/IntMap.fs b/src/FSharpx.Collections.Experimental/IntMap.fs index 74534fe2..5c5509b0 100644 --- a/src/FSharpx.Collections.Experimental/IntMap.fs +++ b/src/FSharpx.Collections.Experimental/IntMap.fs @@ -35,6 +35,7 @@ type IntMap<'T> = member x.GetEnumerator() = (x :> _ seq).GetEnumerator() :> IEnumerator +[] module IntMap = let inline private maskW i m = int (i &&& (~~~ (m - 1ul) ^^^ m)) diff --git a/src/FSharpx.Collections.Experimental/LeftistHeap.fs b/src/FSharpx.Collections.Experimental/LeftistHeap.fs index 0769f2c8..331e63d5 100644 --- a/src/FSharpx.Collections.Experimental/LeftistHeap.fs +++ b/src/FSharpx.Collections.Experimental/LeftistHeap.fs @@ -203,7 +203,7 @@ type LeftistHeap<'T when 'T : comparison> = member this.GetEnumerator() = (this :> _ seq).GetEnumerator() :> IEnumerator -[] +[] module LeftistHeap = //pattern discriminator diff --git a/src/FSharpx.Collections.Experimental/ListZipper.fs b/src/FSharpx.Collections.Experimental/ListZipper.fs index f74c54a0..5e982b55 100644 --- a/src/FSharpx.Collections.Experimental/ListZipper.fs +++ b/src/FSharpx.Collections.Experimental/ListZipper.fs @@ -1,39 +1,42 @@ /// ListZipper /// original implementation taken from http://learnyouahaskell.com/zippers -module FSharpx.Collections.Experimental.ListZipper +namespace FSharpx.Collections.Experimental #nowarn "25" /// A zipper for lists type ListZipper<'T> = { Focus : 'T list; Path : 'T list } -/// Returns the head element from the list under focus -let focus zipper = - match zipper.Focus with - | x::_ -> x - -/// Changes the element under the focus -let modify newElement zipper = - match zipper.Focus with - | x::xs -> { zipper with Focus = newElement::xs } - -/// Moves the zipper forward -let forward zipper = - match zipper.Focus with - | x::xs -> { Focus = xs; Path = x::zipper.Path } - -/// Moves the zipper backwards -let back zipper = - match zipper.Path with - | b::bs -> { Focus = b::zipper.Focus; Path = bs } - -/// Moves the zipper to the front -let rec front zipper = - match zipper.Path with - | [] -> zipper - | _ -> back zipper |> front - -/// Creates a list zipper -let zipper list = { Focus = list; Path = [] } - -/// Returns the whole list from the zipper -let getList zipper = (front zipper).Focus \ No newline at end of file +[] +module ListZipper = + + /// Returns the head element from the list under focus + let focus zipper = + match zipper.Focus with + | x::_ -> x + + /// Changes the element under the focus + let modify newElement zipper = + match zipper.Focus with + | x::xs -> { zipper with Focus = newElement::xs } + + /// Moves the zipper forward + let forward zipper = + match zipper.Focus with + | x::xs -> { Focus = xs; Path = x::zipper.Path } + + /// Moves the zipper backwards + let back zipper = + match zipper.Path with + | b::bs -> { Focus = b::zipper.Focus; Path = bs } + + /// Moves the zipper to the front + let rec front zipper = + match zipper.Path with + | [] -> zipper + | _ -> back zipper |> front + + /// Creates a list zipper + let zipper list = { Focus = list; Path = [] } + + /// Returns the whole list from the zipper + let getList zipper = (front zipper).Focus \ No newline at end of file diff --git a/src/FSharpx.Collections.Experimental/PairingHeap.fs b/src/FSharpx.Collections.Experimental/PairingHeap.fs index ba137b36..af5e894f 100644 --- a/src/FSharpx.Collections.Experimental/PairingHeap.fs +++ b/src/FSharpx.Collections.Experimental/PairingHeap.fs @@ -221,7 +221,7 @@ type PairingHeap<'T when 'T : comparison> = let element,newHeap = this.Uncons() element,(newHeap :> IPriorityQueue<'T>) -[] +[] module PairingHeap = //pattern discriminator diff --git a/src/FSharpx.Collections.Experimental/PhysicistQueue.fs b/src/FSharpx.Collections.Experimental/PhysicistQueue.fs index a152a9c7..b3ab4c69 100644 --- a/src/FSharpx.Collections.Experimental/PhysicistQueue.fs +++ b/src/FSharpx.Collections.Experimental/PhysicistQueue.fs @@ -154,7 +154,7 @@ type PhysicistQueue<'T> (prefix : list<'T>, frontLength : int, front : Lazy _ seq).GetEnumerator() :> IEnumerator -[] +[] module PhysicistQueue = //pattern discriminators diff --git a/src/FSharpx.Collections.Experimental/RealTimeDeque.fs b/src/FSharpx.Collections.Experimental/RealTimeDeque.fs index 80785643..f92df154 100644 --- a/src/FSharpx.Collections.Experimental/RealTimeDeque.fs +++ b/src/FSharpx.Collections.Experimental/RealTimeDeque.fs @@ -439,6 +439,7 @@ type RealTimeDeque<'T>(c : int, frontLength : int, front : LazyList<'T>, stream member this.GetEnumerator() = (this :> _ seq).GetEnumerator() :> IEnumerator +[] module RealTimeDeque = //pattern discriminators diff --git a/src/FSharpx.Collections.Experimental/RealTimeQueue.fs b/src/FSharpx.Collections.Experimental/RealTimeQueue.fs index 673b9d91..3c3c6d28 100644 --- a/src/FSharpx.Collections.Experimental/RealTimeQueue.fs +++ b/src/FSharpx.Collections.Experimental/RealTimeQueue.fs @@ -1,6 +1,4 @@ -// RealTime queue from Chris Okasaki’s "Purely functional data structures" -// original implementation taken from http://lepensemoi.free.fr/index.php/2010/01/07/real-time-queue -module FSharpx.Collections.Experimental.RealTimeQueue +namespace FSharpx.Collections.Experimental open FSharpx.Collections @@ -9,52 +7,57 @@ type RealTimeQueue<'T> = { R: list<'T> S: LazyList<'T> } -///O(1). Returns queue of no elements. -let empty<'T> : RealTimeQueue<'T> = { F = LazyList.empty; R = []; S = LazyList.empty } - -///O(1). Returns true if the queue has no elements -let isEmpty queue = LazyList.isEmpty queue.F - -let rec rotate queue = - match queue.F with - | LazyList.Nil -> LazyList.cons (queue.R |> List.head) queue.S - | LazyList.Cons (hd, tl) -> - let x = queue.R - let y = List.head x - let ys = List.tail x - let right = LazyList.cons y queue.S - LazyList.cons hd (rotate { F = tl; R = ys; S = right }) - -let rec exec queue = - match queue.S with - | LazyList.Nil -> - let f' = rotate {queue with S = LazyList.empty} - { F = f'; R = []; S = f' } - | LazyList.Cons (hd, tl) -> {queue with S = tl} - -///O(1), worst case. Returns a new queue with the element added to the end. -let snoc x queue = exec {queue with R = (x::queue.R) } - -///O(1), worst case. Returns the first element. -let head queue = - match queue.F with - | LazyList.Nil -> raise Exceptions.Empty - | LazyList.Cons (hd, tl) -> hd - -///O(1), worst case. Returns option first element. -let tryGetHead queue = - match queue.F with - | LazyList.Nil -> None - | LazyList.Cons (hd, tl) -> Some hd - -///O(1), worst case. Returns a new queue of the elements trailing the first element. -let tail queue = - match queue.F with - | LazyList.Nil -> raise Exceptions.Empty - | LazyList.Cons (hd, tl) -> exec {queue with F = tl } - -///O(1), worst case. Returns option queue of the elements trailing the first element. -let tryGetTail queue = - match queue.F with - | LazyList.Nil -> None - | LazyList.Cons (hd, tl) -> Some(exec {queue with F = tl }) +/// RealTime queue from Chris Okasaki’s "Purely functional data structures" +/// original implementation taken from http://lepensemoi.free.fr/index.php/2010/01/07/real-time-queue +[] +module RealTimeQueue = + + ///O(1). Returns queue of no elements. + let empty<'T> : RealTimeQueue<'T> = { F = LazyList.empty; R = []; S = LazyList.empty } + + ///O(1). Returns true if the queue has no elements + let isEmpty queue = LazyList.isEmpty queue.F + + let rec rotate queue = + match queue.F with + | LazyList.Nil -> LazyList.cons (queue.R |> List.head) queue.S + | LazyList.Cons (hd, tl) -> + let x = queue.R + let y = List.head x + let ys = List.tail x + let right = LazyList.cons y queue.S + LazyList.cons hd (rotate { F = tl; R = ys; S = right }) + + let rec exec queue = + match queue.S with + | LazyList.Nil -> + let f' = rotate {queue with S = LazyList.empty} + { F = f'; R = []; S = f' } + | LazyList.Cons (hd, tl) -> {queue with S = tl} + + ///O(1), worst case. Returns a new queue with the element added to the end. + let snoc x queue = exec {queue with R = (x::queue.R) } + + ///O(1), worst case. Returns the first element. + let head queue = + match queue.F with + | LazyList.Nil -> raise Exceptions.Empty + | LazyList.Cons (hd, tl) -> hd + + ///O(1), worst case. Returns option first element. + let tryGetHead queue = + match queue.F with + | LazyList.Nil -> None + | LazyList.Cons (hd, tl) -> Some hd + + ///O(1), worst case. Returns a new queue of the elements trailing the first element. + let tail queue = + match queue.F with + | LazyList.Nil -> raise Exceptions.Empty + | LazyList.Cons (hd, tl) -> exec {queue with F = tl } + + ///O(1), worst case. Returns option queue of the elements trailing the first element. + let tryGetTail queue = + match queue.F with + | LazyList.Nil -> None + | LazyList.Cons (hd, tl) -> Some(exec {queue with F = tl }) diff --git a/src/FSharpx.Collections.Experimental/RingBuffer.fs b/src/FSharpx.Collections.Experimental/RingBuffer.fs index eaa393b7..5e08316e 100644 --- a/src/FSharpx.Collections.Experimental/RingBuffer.fs +++ b/src/FSharpx.Collections.Experimental/RingBuffer.fs @@ -62,5 +62,6 @@ type RingBuffer<'T>(position:int, values:seq<'T>) = member x.Clone() = RingBuffer<'T>(x.Position, x.ToArray()) +[] module RingBuffer = let create (seq: 'T seq) = new RingBuffer<'T>(seq) \ No newline at end of file diff --git a/src/FSharpx.Collections.Experimental/RoseTree.fs b/src/FSharpx.Collections.Experimental/RoseTree.fs index db22c07b..5a26e422 100644 --- a/src/FSharpx.Collections.Experimental/RoseTree.fs +++ b/src/FSharpx.Collections.Experimental/RoseTree.fs @@ -32,6 +32,7 @@ module L = LazyList [] [] +[] module RoseTree = open FSharpx diff --git a/src/FSharpx.Collections.Experimental/SkewBinaryRandomAccessList.fs b/src/FSharpx.Collections.Experimental/SkewBinaryRandomAccessList.fs index f38b8581..3162d2d0 100644 --- a/src/FSharpx.Collections.Experimental/SkewBinaryRandomAccessList.fs +++ b/src/FSharpx.Collections.Experimental/SkewBinaryRandomAccessList.fs @@ -251,7 +251,7 @@ type SkewBinaryRandomAccessList<'T> (randomAccessList) = member this.GetEnumerator() = (this :> _ seq).GetEnumerator() :> IEnumerator -[] +[] module SkewBinaryRandomAccessList = //pattern discriminator diff --git a/src/FSharpx.Collections.Experimental/SkewBinomialHeap.fs b/src/FSharpx.Collections.Experimental/SkewBinomialHeap.fs index f09604de..91c902f5 100644 --- a/src/FSharpx.Collections.Experimental/SkewBinomialHeap.fs +++ b/src/FSharpx.Collections.Experimental/SkewBinomialHeap.fs @@ -246,7 +246,8 @@ type 'T SkewBinomialHeap when 'T: comparison private (count, descending, roots: member this.TryPeek() = this.TryHead () member this.TryPop() = this.TryUncons () |> Option.map (fun (h, t) -> h, upcast t) - + +[] module SkewBinomialHeap = let inline (|Cons|Nil|) (heap: 'T SkewBinomialHeap) = match heap.TryUncons () with | Some (h, t) -> Cons(h, t) | None -> Nil diff --git a/src/FSharpx.Collections.Experimental/app.config b/src/FSharpx.Collections.Experimental/app.config deleted file mode 100644 index 4ee227ad..00000000 --- a/src/FSharpx.Collections.Experimental/app.config +++ /dev/null @@ -1,44 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - diff --git a/src/FSharpx.Collections.Experimental/paket.template b/src/FSharpx.Collections.Experimental/paket.template index 4d222ad3..e351487e 100644 --- a/src/FSharpx.Collections.Experimental/paket.template +++ b/src/FSharpx.Collections.Experimental/paket.template @@ -1,8 +1,9 @@ -type project +type file +id FSharpx.Collections.Experimental owners - Steffen Forkmann, Daniel Mohl, Tomas Petricek, Ryan Riley,Mauricio Scheffer, Phil Trelford + Steffen Forkmann, Mauricio Scheffer, Jack Fox authors - Steffen Forkmann, Daniel Mohl, Tomas Petricek, Ryan Riley,Mauricio Scheffer, Phil Trelford + Steffen Forkmann, Daniel Mohl, Tomas Petricek, Ryan Riley,Mauricio Scheffer, Phil Trelford, Jack Fox projectUrl https://github.com/fsprojects/FSharpx.Collections iconUrl @@ -11,11 +12,15 @@ licenseUrl http://github.com/fsprojects/FSharpx.Collections/blob/master/LICENSE.txt requireLicenseAcceptance false + language + F# copyright - Copyright 2015 + Copyright 2018 tags F# fsharp fsharpx collections datastructures summary FSharpx.Collections is a collection of datastructures for use with F# and C#. description - FSharpx.Collections is a collection of datastructures for use with F# and C#. \ No newline at end of file + FSharpx.Collections is a collection of datastructures for use with F# and C#. +files + ../../bin/FSharpx.Collections.Experimental ==> lib \ No newline at end of file diff --git a/src/FSharpx.Collections/AssemblyInfo.fs b/src/FSharpx.Collections/AssemblyInfo.fs index a29461e2..5c39ea8f 100644 --- a/src/FSharpx.Collections/AssemblyInfo.fs +++ b/src/FSharpx.Collections/AssemblyInfo.fs @@ -8,8 +8,8 @@ open System.Runtime.CompilerServices [] [] [] -[] -[] +[] +[] do () module internal AssemblyVersionInformation = @@ -18,5 +18,5 @@ module internal AssemblyVersionInformation = let [] AssemblyDescription = "FSharpx.Collections is a collection of datastructures for use with F# and C#." let [] InternalsVisibleTo = "FSharpx.Collections.Tests" let [] InternalsVisibleTo_1 = "FSharpx.Collections.Experimental.Tests" - let [] AssemblyVersion = "1.17.0" - let [] AssemblyFileVersion = "1.17.0" + let [] AssemblyVersion = "2.0.0" + let [] AssemblyFileVersion = "2.0.0" diff --git a/src/FSharpx.Collections/ByteString.fs b/src/FSharpx.Collections/ByteString.fs index 57122b68..0cabc142 100644 --- a/src/FSharpx.Collections/ByteString.fs +++ b/src/FSharpx.Collections/ByteString.fs @@ -92,17 +92,21 @@ type ByteString(array: byte[], offset: int, count: int) = /// Gets an enumerator for the bytes stored in the byte string. member x.GetEnumerator() = x.GetEnumerator() :> IEnumerator -[] +[] module ByteString = /// An active pattern for conveniently retrieving the properties of a ByteString. let (|BS|) (x:ByteString) = x.Array, x.Offset, x.Count + /// needs .fsi file let empty = ByteString() + /// needs .fsi file let singleton c = ByteString(Array.create 1 c, 0, 1) + /// needs .fsi file let create arr = ByteString(arr, 0, arr.Length) + /// needs .fsi file let findIndex pred (bs:ByteString) = #if FX_PORTABLE let rec loop i = @@ -114,41 +118,54 @@ module ByteString = Array.FindIndex(bs.Array, bs.Offset, bs.Count, Predicate<_>(pred)) #endif + /// needs .fsi file let ofArraySegment (segment:ArraySegment) = ByteString(segment.Array, segment.Offset, segment.Count) + /// needs .fsi file let ofSeq s = let arr = Array.ofSeq s in ByteString(arr, 0, arr.Length) + /// needs .fsi file let ofList l = ByteString(Array.ofList l, 0, l.Length) + /// needs .fsi file let ofString (s:string) = s.ToCharArray() |> Array.map byte |> create + /// needs .fsi file let toArray (bs:ByteString) = if bs.Count = 0 then Array.empty<_> else bs.Array.[bs.Offset..(bs.Offset + bs.Count - 1)] + /// needs .fsi file let toSeq (bs:ByteString) = bs :> seq + /// needs .fsi file let toList (bs:ByteString) = List.ofSeq bs #if FX_PORTABLE #else + /// needs .fsi file let toString (bs:ByteString) = System.Text.Encoding.ASCII.GetString(bs.Array, bs.Offset, bs.Count) #endif + /// needs .fsi file let isEmpty (bs:ByteString) = bs.Count <= 0 + /// needs .fsi file let length (bs:ByteString) = bs.Count + /// needs .fsi file let index (bs:ByteString) pos = bs.Array.[bs.Offset + pos] + /// needs .fsi file let head (bs:ByteString) = if bs.Count <= 0 then failwith "Cannot take the head of an empty byte string." else bs.Array.[bs.Offset] + /// needs .fsi file let tail (bs:ByteString) = if bs.Count = 1 then empty else ByteString(bs.Array, bs.Offset+1, bs.Count-1) @@ -177,6 +194,7 @@ module ByteString = Buffer.BlockCopy(x',o',buffer,l,l') ByteString(buffer,0,l+l') + /// needs .fsi file let fold f seed bs = let rec loop bs acc = if isEmpty bs then acc @@ -184,6 +202,7 @@ module ByteString = loop tl (f acc hd) loop bs seed + /// needs .fsi file let split pred (bs:ByteString) = if isEmpty bs then empty, empty else let index = findIndex pred bs @@ -192,22 +211,30 @@ module ByteString = ByteString(bs.Array, bs.Offset, count), ByteString(bs.Array, index, bs.Count - count) + /// needs .fsi file let span pred bs = split (not << pred) bs + /// needs .fsi file let splitAt n (bs:ByteString) = if isEmpty bs then empty, empty elif n = 0 then empty, bs elif n >= bs.Count then bs, empty else let x,o,l = bs.Array, bs.Offset, bs.Count in ByteString(x,o,n), ByteString(x,o+n,l-n) + /// needs .fsi file let skip n bs = splitAt n bs |> snd + /// needs .fsi file let skipWhile pred bs = span pred bs |> snd + /// needs .fsi file let skipUntil pred bs = split pred bs |> snd + /// needs .fsi file let take n bs = splitAt n bs |> fst + /// needs .fsi file let takeWhile pred bs = span pred bs |> fst + /// needs .fsi file let takeUntil pred bs = split pred bs |> fst \ No newline at end of file diff --git a/src/FSharpx.Collections/CircularBuffer.fsi b/src/FSharpx.Collections/CircularBuffer.fsi new file mode 100644 index 00000000..1f06cac9 --- /dev/null +++ b/src/FSharpx.Collections/CircularBuffer.fsi @@ -0,0 +1,28 @@ +namespace FSharpx.Collections.Mutable + +open System +open System.Collections.Generic + +/// needs doc +type CircularBuffer<'T> = + class + interface IEnumerable<'T> + /// needs doc + new : bufferSize:int -> CircularBuffer<'T> + /// needs doc + member Dequeue : count:int -> 'T [] + /// needs doc + member Enqueue : value:'T [] -> unit + /// needs doc + member Enqueue : value:ArraySegment<'T> -> unit + /// needs doc + member Enqueue : value:'T -> unit + /// needs doc + member Enqueue : value:'T [] * offset:int -> unit + /// needs doc + member Enqueue : value:'T [] * offset:int * count:int -> unit + /// needs doc + member GetEnumerator : unit -> IEnumerator<'T> + /// needs doc + member Count : int + end \ No newline at end of file diff --git a/src/FSharpx.Collections/Collections.fs b/src/FSharpx.Collections/Collections.fs index 0cce679e..031c4e71 100644 --- a/src/FSharpx.Collections/Collections.fs +++ b/src/FSharpx.Collections/Collections.fs @@ -7,6 +7,7 @@ open System.Collections.Generic open System.Runtime.CompilerServices /// Extensions for F#'s Seq module. +[] module Seq = /// Prepends `x` to the seq `xs` @@ -258,13 +259,16 @@ module Seq = /// Compares two sequences for equality using the given comparison function, element by element. let inline equalsWith eq xs ys = Seq.compareWith (fun x y -> if eq x y then 0 else 1) xs ys = 0 - -[] /// Extensions for F#'s Array module. +[] module Array = + /// nth item of array let inline nth i arr = Array.get arr i + + /// set the ith item of array let inline setAt i v arr = Array.set arr i v; arr + /// copy items from one array to another let copyTo sourceStartIndx startIndx source target = let targetLength = (Array.length target) if startIndx < 0 || startIndx > targetLength - 1 then @@ -282,6 +286,7 @@ module Array = let ofTuple (source : obj) : obj array = Microsoft.FSharp.Reflection.FSharpValue.GetTupleFields source + /// needs doc let toTuple (source : 'T array) : 't = let elements = source |> Array.map (fun x -> x :> obj) Microsoft.FSharp.Reflection.FSharpValue.MakeTuple(elements, typeof<'t>) :?> 't @@ -345,6 +350,7 @@ module Array = /// Extensions for F#'s List module. +[] module List = /// Curried cons let inline cons hd tl = hd::tl @@ -472,9 +478,8 @@ module List = /// Compares two lists for equality using the given comparison function, element by element. let inline equalsWith eq xs ys = List.compareWith (fun x y -> if eq x y then 0 else 1) xs ys = 0 - -[] /// Extensions for System.Collections.Generic.Dictionary. +[] module Dictionary = let tryFind key (d: IDictionary<_,_>) = match d.TryGetValue key with @@ -482,6 +487,7 @@ module Dictionary = | _ -> None /// Extensions for F#'s Map module. +[] module Map = let spanWithKey pred map = map @@ -570,9 +576,9 @@ module Map = #if FX_PORTABLE #else -[] [] /// Extensions for NameValueCollections. +[] module NameValueCollection = open System.Collections.Specialized open System.Linq diff --git a/src/FSharpx.Collections/DList.fs b/src/FSharpx.Collections/DList.fs index 252c42a2..96977536 100644 --- a/src/FSharpx.Collections/DList.fs +++ b/src/FSharpx.Collections/DList.fs @@ -156,7 +156,7 @@ and | Unit of 'T | Join of DListData<'T> * DListData<'T> -[] +[] module DList = //pattern discriminators (active pattern) diff --git a/src/FSharpx.Collections/DList.fsi b/src/FSharpx.Collections/DList.fsi index d82f7d65..10b76ec3 100644 --- a/src/FSharpx.Collections/DList.fsi +++ b/src/FSharpx.Collections/DList.fsi @@ -40,7 +40,7 @@ type DList<'T> = ///O(log n). Returns option first element and tail. member TryUncons : ('T * DList<'T>) option -[] +[] module DList = //pattern discriminators (active pattern) val (|Cons|Nil|) : DList<'T> -> Choice<('T * DList<'T>),unit> diff --git a/src/FSharpx.Collections/Deque.fs b/src/FSharpx.Collections/Deque.fs index c2c38d33..047f444e 100644 --- a/src/FSharpx.Collections/Deque.fs +++ b/src/FSharpx.Collections/Deque.fs @@ -156,7 +156,7 @@ type Deque<'T> (front, rBack) = member this.GetEnumerator() = (this :> _ seq).GetEnumerator() :> IEnumerator -[] +[] module Deque = let (|Cons|Nil|) (q : Deque<'T>) = match q.TryUncons with Some(a,b) -> Cons(a,b) | None -> Nil diff --git a/src/FSharpx.Collections/Deque.fsi b/src/FSharpx.Collections/Deque.fsi index f7367ba1..7e12b1e3 100644 --- a/src/FSharpx.Collections/Deque.fsi +++ b/src/FSharpx.Collections/Deque.fsi @@ -61,7 +61,7 @@ type Deque<'T> = ///O(1) amortized, O(n), worst case. Returns option first element and tail. member TryUncons : ('T * Deque<'T>) option -[] +[] module Deque = //pattern discriminators diff --git a/src/FSharpx.Collections/FSharpx.Collections.fsproj b/src/FSharpx.Collections/FSharpx.Collections.fsproj index d6c91c55..3ef03f36 100644 --- a/src/FSharpx.Collections/FSharpx.Collections.fsproj +++ b/src/FSharpx.Collections/FSharpx.Collections.fsproj @@ -1,76 +1,24 @@  - + - Debug - AnyCPU 8.0.30703 - 2.0 {1e95a279-c2a9-498b-bc72-6e7a0d6854ce} Library FSharpx.Collections FSharpx.Collections FSharpx.Collections - v4.5 - 2.3.0.0 - $(MSBuildProjectDirectory)\..\..\ - + net461;netstandard2.0 + true + + true + + true + + $(AllowedOutputExtensionsInPackageBuildOutputFolder);.pdb - - true - full - false - bin\Debug - 3 - - - - - pdbonly - true - bin\Release - 3 - bin\Release\FSharpx.Collections.XML - - - 11 - - - - - - $(MSBuildExtensionsPath32)\..\Microsoft SDKs\F#\3.0\Framework\v4.0\Microsoft.FSharp.Targets - - - - - $(MSBuildExtensionsPath32)\Microsoft\VisualStudio\v$(VisualStudioVersion)\FSharp\Microsoft.FSharp.Targets - - - - - - - @@ -85,6 +33,7 @@ + @@ -98,20 +47,5 @@ - - - - - - - - - - ..\..\packages\FSharp.Core\lib\net45\FSharp.Core.dll - True - True - - - - + \ No newline at end of file diff --git a/src/FSharpx.Collections/Infrastructure.fs b/src/FSharpx.Collections/Infrastructure.fs index 70fbe2d9..5d58a39e 100644 --- a/src/FSharpx.Collections/Infrastructure.fs +++ b/src/FSharpx.Collections/Infrastructure.fs @@ -1,4 +1,4 @@ -module FSharpx.Collections.TimeMeasurement +module internal FSharpx.Collections.TimeMeasurement #if FX_PORTABLE #else diff --git a/src/FSharpx.Collections/LazyList.fs b/src/FSharpx.Collections/LazyList.fs index 51c6daf5..1fa8cf27 100644 --- a/src/FSharpx.Collections/LazyList.fs +++ b/src/FSharpx.Collections/LazyList.fs @@ -8,7 +8,6 @@ namespace FSharpx.Collections open System open System.Collections.Generic -#nowarn "21" // recursive initialization #nowarn "40" // recursive initialization exception UndefinedException @@ -104,7 +103,7 @@ and | CellCons of 'T * LazyList<'T> | CellEmpty -[] +[] module LazyList = let lzy f = { status = Delayed f } diff --git a/src/FSharpx.Collections/LazyList.fsi b/src/FSharpx.Collections/LazyList.fsi index 323dc2eb..61ed85be 100644 --- a/src/FSharpx.Collections/LazyList.fsi +++ b/src/FSharpx.Collections/LazyList.fsi @@ -56,7 +56,7 @@ type LazyList<'T> = ///O(1). Returns option tuple of head element and tail of the list. member TryUncons : ('T * LazyList<'T>) option -[] +[] module LazyList = ///O(1). Test if a list is empty. Forces the evaluation of diff --git a/src/FSharpx.Collections/NonEmptyList.fs b/src/FSharpx.Collections/NonEmptyList.fs index 2816de50..ae1df811 100644 --- a/src/FSharpx.Collections/NonEmptyList.fs +++ b/src/FSharpx.Collections/NonEmptyList.fs @@ -19,6 +19,7 @@ type NonEmptyList<'T> = member x.GetEnumerator() = (x :> _ seq).GetEnumerator() :> IEnumerator [] +[] module NonEmptyList = [] let create head tail = { List = head :: tail } diff --git a/src/FSharpx.Collections/PersistentHashMap.fs b/src/FSharpx.Collections/PersistentHashMap.fs index b82b06a8..a8f2ca62 100644 --- a/src/FSharpx.Collections/PersistentHashMap.fs +++ b/src/FSharpx.Collections/PersistentHashMap.fs @@ -685,8 +685,8 @@ and PersistentHashMap<[]'T, 'S when 'T : equality and 'S (this.Iterator().GetEnumerator()) :> System.Collections.IEnumerator -[] /// Defines functions which allow to access and manipulate PersistentHashMaps. +[] module PersistentHashMap = ///O(1), returns an empty PersistentHashMap let empty<'T,'S when 'T : equality and 'S : equality> = PersistentHashMap.Empty() :> PersistentHashMap<'T, 'S> diff --git a/src/FSharpx.Collections/PersistentVector.fs b/src/FSharpx.Collections/PersistentVector.fs index d80cee38..a89b427e 100644 --- a/src/FSharpx.Collections/PersistentVector.fs +++ b/src/FSharpx.Collections/PersistentVector.fs @@ -357,7 +357,7 @@ and PersistentVector<'T> (count,shift:int,root:Node,tail:obj[]) = (this.rangedIterator(0,count).GetEnumerator()) :> System.Collections.IEnumerator -[] +[] module PersistentVector = //pattern discriminators (active pattern) let (|Conj|Nil|) (v : PersistentVector<'T>) = match v.TryUnconj with Some(a,b) -> Conj(a,b) | None -> Nil diff --git a/src/FSharpx.Collections/PersistentVector.fsi b/src/FSharpx.Collections/PersistentVector.fsi index daed3b16..9fd9cfb3 100644 --- a/src/FSharpx.Collections/PersistentVector.fsi +++ b/src/FSharpx.Collections/PersistentVector.fsi @@ -55,8 +55,8 @@ type PersistentVector<'T> = /// O(1) for all practical purposes; really O(log32n). Returns option vector that contains the given value at the index. member TryUpdate : int * 'T -> PersistentVector<'T> option -[] /// Defines functions which allow to access and manipulate PersistentVectors. +[] module PersistentVector = //pattern discriminators (active pattern) val (|Conj|Nil|) : PersistentVector<'T> -> Choice<(PersistentVector<'T> * 'T),unit> diff --git a/src/FSharpx.Collections/PriorityQueue.fs b/src/FSharpx.Collections/PriorityQueue.fs index 541f5d39..1119d8ff 100644 --- a/src/FSharpx.Collections/PriorityQueue.fs +++ b/src/FSharpx.Collections/PriorityQueue.fs @@ -4,7 +4,6 @@ namespace FSharpx.Collections - open System.Collections open System.Collections.Generic @@ -230,7 +229,7 @@ and HeapData<'T when 'T : comparison> = | E | T of 'T * list> -[] +[] module Heap = //pattern discriminator @@ -284,6 +283,7 @@ module Heap = ///O(log n) amortized time. Returns option head element and tail. let inline tryUncons (xs: Heap<'T>) = xs.TryUncons() +[] module PriorityQueue = ///O(1). Returns a empty queue, with indicated ordering. let empty<'T when 'T : comparison> isDescending = Heap.empty isDescending :> IPriorityQueue<'T> diff --git a/src/FSharpx.Collections/Queue.fs b/src/FSharpx.Collections/Queue.fs index 9434029b..d5d4d8e8 100644 --- a/src/FSharpx.Collections/Queue.fs +++ b/src/FSharpx.Collections/Queue.fs @@ -92,7 +92,7 @@ type Queue<'T> (front : list<'T>, rBack : list<'T>) = member this.GetEnumerator() = (this :> _ seq).GetEnumerator() :> System.Collections.IEnumerator -[] +[] module Queue = //pattern discriminators (active pattern) let (|Cons|Nil|) (q : Queue<'T>) = match q.TryUncons with Some(a,b) -> Cons(a,b) | None -> Nil diff --git a/src/FSharpx.Collections/Queue.fsi b/src/FSharpx.Collections/Queue.fsi index fcacdc80..da92d621 100644 --- a/src/FSharpx.Collections/Queue.fsi +++ b/src/FSharpx.Collections/Queue.fsi @@ -42,7 +42,7 @@ type Queue<'T> = ///O(1) amortized, O(n) worst-case. Returns option first element and tail. member TryUncons : ('T * Queue<'T>) option -[] +[] module Queue = //pattern discriminators (active pattern) val (|Cons|Nil|) : Queue<'T> -> Choice<('T * Queue<'T>),unit> diff --git a/src/FSharpx.Collections/RandomAccessList.fs b/src/FSharpx.Collections/RandomAccessList.fs index 25969890..7fb5542d 100644 --- a/src/FSharpx.Collections/RandomAccessList.fs +++ b/src/FSharpx.Collections/RandomAccessList.fs @@ -332,7 +332,7 @@ and RandomAccessList<'T> (count,shift:int,root:NodeR,tail:obj[]) = (this.rangedIterator(0,count).GetEnumerator()) :> System.Collections.IEnumerator -[] +[] module RandomAccessList = //pattern discriminators (active pattern) let (|Cons|Nil|) (v : RandomAccessList<'T>) = match v.TryUncons with Some(a,b) -> Cons(a,b) | None -> Nil diff --git a/src/FSharpx.Collections/RandomAccessList.fsi b/src/FSharpx.Collections/RandomAccessList.fsi index 5fe95dba..b34a19a3 100644 --- a/src/FSharpx.Collections/RandomAccessList.fsi +++ b/src/FSharpx.Collections/RandomAccessList.fsi @@ -53,9 +53,9 @@ type RandomAccessList<'T> = /// O(1) for all practical purposes; really O(log32n). Returns option random access list that contains the given value at the index. member TryUpdate : int * 'T -> RandomAccessList<'T> option - -[] + /// Defines functions which allow to access and manipulate RandomAccessLists. +[] module RandomAccessList = //pattern discriminators (active pattern) val (|Cons|Nil|) : RandomAccessList<'T> -> Choice<('T * RandomAccessList<'T> ),unit> diff --git a/src/FSharpx.Collections/ResizeArray.fs b/src/FSharpx.Collections/ResizeArray.fs index b44b29d3..d6ee49d3 100644 --- a/src/FSharpx.Collections/ResizeArray.fs +++ b/src/FSharpx.Collections/ResizeArray.fs @@ -7,7 +7,7 @@ namespace Microsoft.FSharp.Collections open Microsoft.FSharp.Core.OptimizedClosures -[] +[] module ResizeArray = let length (arr: ResizeArray<'T>) = arr.Count diff --git a/src/FSharpx.Collections/ResizeArray.fsi b/src/FSharpx.Collections/ResizeArray.fsi index 44b2e61e..1aac401c 100644 --- a/src/FSharpx.Collections/ResizeArray.fsi +++ b/src/FSharpx.Collections/ResizeArray.fsi @@ -9,12 +9,11 @@ namespace Microsoft.FSharp.Collections - open System open System.Collections.Generic -[] /// Generic operations on the type System.Collections.Generic.List, which is called ResizeArray in the F# libraries. +[] module ResizeArray = /// Return the length of the collection. You can also use property arr.Length. diff --git a/src/FSharpx.Collections/TaggedCollections.fs b/src/FSharpx.Collections/TaggedCollections.fs index 02abf89e..75bf8f0a 100644 --- a/src/FSharpx.Collections/TaggedCollections.fs +++ b/src/FSharpx.Collections/TaggedCollections.fs @@ -24,7 +24,7 @@ // CONSIDER: SetTree<'T> = SetEmpty | SetNode of 'T * SetTree<'T> * SetTree<'T> * int // with SetOne = SetNode of (x,null,null,1) - [] + [] module SetTree = let empty = SetEmpty @@ -712,8 +712,7 @@ // move to a n-way tree. | MapNode of 'Key * 'T * MapTree<'Key,'T> * MapTree<'Key,'T> * int - - [] + [] module MapTree = let empty = MapEmpty diff --git a/src/FSharpx.Collections/app.config b/src/FSharpx.Collections/app.config deleted file mode 100644 index 4ee227ad..00000000 --- a/src/FSharpx.Collections/app.config +++ /dev/null @@ -1,44 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - diff --git a/src/FSharpx.Collections/paket.template b/src/FSharpx.Collections/paket.template index 92c611f9..39e3c8b3 100644 --- a/src/FSharpx.Collections/paket.template +++ b/src/FSharpx.Collections/paket.template @@ -1,8 +1,9 @@ -type project +type file +id FSharpx.Collections owners - Steffen Forkmann, Daniel Mohl, Tomas Petricek, Ryan Riley,Mauricio Scheffer, Phil Trelford + Steffen Forkmann, Mauricio Scheffer, Jack Fox authors - Steffen Forkmann, Daniel Mohl, Tomas Petricek, Ryan Riley,Mauricio Scheffer, Phil Trelford + Steffen Forkmann, Daniel Mohl, Tomas Petricek, Ryan Riley,Mauricio Scheffer, Phil Trelford, Jack Fox projectUrl https://github.com/fsprojects/FSharpx.Collections iconUrl @@ -11,11 +12,15 @@ licenseUrl http://github.com/fsprojects/FSharpx.Collections/blob/master/LICENSE.txt requireLicenseAcceptance false +language + F# copyright - Copyright 2015 + Copyright 2018 tags F# fsharp fsharpx collections datastructures summary FSharpx.Collections is a collection of datastructures for use with F# and C#. description FSharpx.Collections is a collection of datastructures for use with F# and C#. +files + ../../bin/FSharpx.Collections ==> lib diff --git a/tests/FSharpx.Collections.Experimental.Tests/AltBinaryRandomAccessListTest.fs b/tests/FSharpx.Collections.Experimental.Tests/AltBinaryRandomAccessListTest.fs index fa8b9da1..7a197388 100644 --- a/tests/FSharpx.Collections.Experimental.Tests/AltBinaryRandomAccessListTest.fs +++ b/tests/FSharpx.Collections.Experimental.Tests/AltBinaryRandomAccessListTest.fs @@ -1,1107 +1,1024 @@ -module FSharpx.Collections.Experimental.Tests.AltBinaryRandomAccessListTest +namespace FSharpx.Collections.Experimental.Tests -open System open FSharpx.Collections open FSharpx.Collections.Experimental -open FSharpx.Collections.Experimental.AltBinaryRandomAccessList -open NUnit.Framework -open FsUnit - +open Expecto +open Expecto.Flip //only going up to len5 is probably sufficient to test all edge cases //but better too many unit tests than too few -let len1 = empty |> cons "a" -let len2 = empty |> cons "a" |> cons "b" -let len3 = empty |> cons "a" |> cons "b" |> cons "c" -let len4 = empty |> cons "a" |> cons "b" |> cons "c" |> cons "d" -let len5 = empty |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" -let len6 = empty |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" -let len7 = empty |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" -let len8 = empty |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" -let len9 = empty |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" |> cons "i" -let lena = empty |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" |> cons "i" |> cons "j" - -[] -let ``empty list should be empty``() = - isEmpty empty |> should equal true - -[] -let ``cons works``() = - empty |> cons 1 |> cons 2 |> isEmpty |> should equal false - -[] -let ``uncons 1 element``() = - let x, _ = empty |> cons 1 |> uncons - (x = 1) |> should equal true - -[] -let ``uncons 2 elements``() = - let x, _ = empty |> cons 1 |> cons 2 |> uncons - (x = 2) |> should equal true - -[] -let ``uncons 3 elements``() = - let x, _ = empty |> cons 1 |> cons 2 |> cons 3 |> uncons - (x = 3) |> should equal true - -[] -let ``tryUncons 1 element``() = - let x = empty |> cons 1 |> tryUncons - (fst(x.Value) = 1) |> should equal true - -[] -let ``tryUncons 2 elements``() = - let x = empty |> cons 1 |> cons 2 |> tryUncons - (fst(x.Value) = 2) |> should equal true - -[] -let ``tryUncons 3 elements``() = - let x = empty |> cons 1 |> cons 2 |> cons 3 |> tryUncons - (fst(x.Value) = 3) |> should equal true - -[] -let ``tryUncons empty``() = - empty |> tryUncons |> should equal None +module AltBinaryRandomAccessListTest = + + let len1 = AltBinaryRandomAccessList.empty |> AltBinaryRandomAccessList.cons "a" + let len2 = AltBinaryRandomAccessList.empty |> AltBinaryRandomAccessList.cons "a" |> AltBinaryRandomAccessList.cons "b" + let len3 = AltBinaryRandomAccessList.empty |> AltBinaryRandomAccessList.cons "a" |> AltBinaryRandomAccessList.cons "b" |> AltBinaryRandomAccessList.cons "c" + let len4 = AltBinaryRandomAccessList.empty |> AltBinaryRandomAccessList.cons "a" |> AltBinaryRandomAccessList.cons "b" |> AltBinaryRandomAccessList.cons "c" |> AltBinaryRandomAccessList.cons "d" + let len5 = AltBinaryRandomAccessList.empty |> AltBinaryRandomAccessList.cons "a" |> AltBinaryRandomAccessList.cons "b" |> AltBinaryRandomAccessList.cons "c" |> AltBinaryRandomAccessList.cons "d" |> AltBinaryRandomAccessList.cons "e" + let len6 = AltBinaryRandomAccessList.empty |> AltBinaryRandomAccessList.cons "a" |> AltBinaryRandomAccessList.cons "b" |> AltBinaryRandomAccessList.cons "c" |> AltBinaryRandomAccessList.cons "d" |> AltBinaryRandomAccessList.cons "e" |> AltBinaryRandomAccessList.cons "f" + let len7 = AltBinaryRandomAccessList.empty |> AltBinaryRandomAccessList.cons "a" |> AltBinaryRandomAccessList.cons "b" |> AltBinaryRandomAccessList.cons "c" |> AltBinaryRandomAccessList.cons "d" |> AltBinaryRandomAccessList.cons "e" |> AltBinaryRandomAccessList.cons "f" |> AltBinaryRandomAccessList.cons "g" + let len8 = AltBinaryRandomAccessList.empty |> AltBinaryRandomAccessList.cons "a" |> AltBinaryRandomAccessList.cons "b" |> AltBinaryRandomAccessList.cons "c" |> AltBinaryRandomAccessList.cons "d" |> AltBinaryRandomAccessList.cons "e" |> AltBinaryRandomAccessList.cons "f" |> AltBinaryRandomAccessList.cons "g" |> AltBinaryRandomAccessList.cons "h" + let len9 = AltBinaryRandomAccessList.empty |> AltBinaryRandomAccessList.cons "a" |> AltBinaryRandomAccessList.cons "b" |> AltBinaryRandomAccessList.cons "c" |> AltBinaryRandomAccessList.cons "d" |> AltBinaryRandomAccessList.cons "e" |> AltBinaryRandomAccessList.cons "f" |> AltBinaryRandomAccessList.cons "g" |> AltBinaryRandomAccessList.cons "h" |> AltBinaryRandomAccessList.cons "i" + let lena = AltBinaryRandomAccessList.empty |> AltBinaryRandomAccessList.cons "a" |> AltBinaryRandomAccessList.cons "b" |> AltBinaryRandomAccessList.cons "c" |> AltBinaryRandomAccessList.cons "d" |> AltBinaryRandomAccessList.cons "e" |> AltBinaryRandomAccessList.cons "f" |> AltBinaryRandomAccessList.cons "g" |> AltBinaryRandomAccessList.cons "h" |> AltBinaryRandomAccessList.cons "i" |> AltBinaryRandomAccessList.cons "j" + + [] + let testAltBinaryRandomAccessList = + + testList "Experimental AltBinaryRandomAccessList" [ + test "AltBinaryRandomAccessList.empty list should be AltBinaryRandomAccessList.empty" { + AltBinaryRandomAccessList.isEmpty AltBinaryRandomAccessList.empty |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.cons works" { + AltBinaryRandomAccessList.empty |> AltBinaryRandomAccessList.cons 1 |> AltBinaryRandomAccessList.cons 2 |> AltBinaryRandomAccessList.isEmpty |> Expect.isFalse "" } + + test "AltBinaryRandomAccessList.uncons 1 element" { + let x, _ = AltBinaryRandomAccessList.empty |> AltBinaryRandomAccessList.cons 1 |> AltBinaryRandomAccessList.uncons + (x = 1) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.uncons 2 elements" { + let x, _ = AltBinaryRandomAccessList.empty |> AltBinaryRandomAccessList.cons 1 |> AltBinaryRandomAccessList.cons 2 |> AltBinaryRandomAccessList.uncons + (x = 2) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.uncons 3 elements" { + let x, _ = AltBinaryRandomAccessList.empty |> AltBinaryRandomAccessList.cons 1 |> AltBinaryRandomAccessList.cons 2 |> AltBinaryRandomAccessList.cons 3 |> AltBinaryRandomAccessList.uncons + (x = 3) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.tryUncons 1 element" { + let x = AltBinaryRandomAccessList.empty |> AltBinaryRandomAccessList.cons 1 |> AltBinaryRandomAccessList.tryUncons + (fst(x.Value) = 1) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.tryUncons 2 elements" { + let x = AltBinaryRandomAccessList.empty |> AltBinaryRandomAccessList.cons 1 |> AltBinaryRandomAccessList.cons 2 |> AltBinaryRandomAccessList.tryUncons + (fst(x.Value) = 2) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.tryUncons 3 elements" { + let x = AltBinaryRandomAccessList.empty |> AltBinaryRandomAccessList.cons 1 |> AltBinaryRandomAccessList.cons 2 |> AltBinaryRandomAccessList.cons 3 |> AltBinaryRandomAccessList.tryUncons + (fst(x.Value) = 3) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.tryUncons AltBinaryRandomAccessList.empty" { + AltBinaryRandomAccessList.empty |> AltBinaryRandomAccessList.tryUncons |> Expect.isNone "" } -[] -let ``head should return``() = - empty |> cons 1 |> cons 2 |> head |> should equal 2 - -[] -let ``tryGetHead should return``() = - let x = empty |> cons 1 |> cons 2 |> tryGetHead - x.Value |> should equal 2 - -[] -let ``tryGetHead on empty should return None``() = - empty |> tryGetHead |> should equal None - -[] -let ``tryGetTail on empty should return None``() = - empty |> tryGetTail |> should equal None - -[] -let ``tryGetTail on len 1 should return Some empty``() = - let x = (empty |> cons 1 |> tryGetTail).Value - x |> isEmpty |> should equal true - -[] -let ``tail on len 2 should return``() = - empty |> cons 1 |> cons 2 |> tail |> head |> should equal 1 - -[] -let ``tryGetTail on len 2 should return``() = - let a = empty |> cons 1 |> cons 2 |> tryGetTail - ((head a.Value) = 1) |> should equal true - -[] -let ``lookup length 1``() = - len1 |> lookup 0 |> should equal "a" - -[] -let ``rev empty``() = - isEmpty (empty |> rev) |> should equal true + test "AltBinaryRandomAccessList.head should return" { + AltBinaryRandomAccessList.empty |> AltBinaryRandomAccessList.cons 1 |> AltBinaryRandomAccessList.cons 2 |> AltBinaryRandomAccessList.head |> Expect.equal "" 2 } + + test "AltBinaryRandomAccessList.tryGetHead should return" { + let x = AltBinaryRandomAccessList.empty |> AltBinaryRandomAccessList.cons 1 |> AltBinaryRandomAccessList.cons 2 |> AltBinaryRandomAccessList.tryGetHead + x.Value |> Expect.equal "" 2 } + + test "AltBinaryRandomAccessList.tryGetHead on AltBinaryRandomAccessList.empty should return None" { + AltBinaryRandomAccessList.empty |> AltBinaryRandomAccessList.tryGetHead |> Expect.isNone "" } + + test "AltBinaryRandomAccessList.tryGetTail on AltBinaryRandomAccessList.empty should return None" { + AltBinaryRandomAccessList.empty |> AltBinaryRandomAccessList.tryGetTail |> Expect.isNone "" } + + test "AltBinaryRandomAccessList.tryGetTail on len 1 should return Some AltBinaryRandomAccessList.empty" { + let x = (AltBinaryRandomAccessList.empty |> AltBinaryRandomAccessList.cons 1 |> AltBinaryRandomAccessList.tryGetTail).Value + x |> AltBinaryRandomAccessList.isEmpty |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.tail on len 2 should return" { + AltBinaryRandomAccessList.empty |> AltBinaryRandomAccessList.cons 1 |> AltBinaryRandomAccessList.cons 2 |> AltBinaryRandomAccessList.tail |> AltBinaryRandomAccessList.head |> Expect.equal "" 1 } + + test "AltBinaryRandomAccessList.tryGetTail on len 2 should return" { + let a = AltBinaryRandomAccessList.empty |> AltBinaryRandomAccessList.cons 1 |> AltBinaryRandomAccessList.cons 2 |> AltBinaryRandomAccessList.tryGetTail + ((AltBinaryRandomAccessList.head a.Value) = 1) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.lookup length 1" { + len1 |> AltBinaryRandomAccessList.lookup 0 |> Expect.equal "" "a" } + + test "AltBinaryRandomAccessList.rev AltBinaryRandomAccessList.empty" { + AltBinaryRandomAccessList.isEmpty (AltBinaryRandomAccessList.empty |> AltBinaryRandomAccessList.rev) |> Expect.isTrue "" } -[] -let ``rev elements length 5``() = - let a = - match (len5 |> rev) with - | One("a",Zero(One((("b","c"),("d","e")),Nil))) -> true - | _ -> false - - a |> should equal true - -[] -let ``append 2 empty lists``() = - isEmpty (append empty empty) |> should equal true - -[] -let ``append left empty right 5``() = - let a = - match (append empty len5) with - | One("e",Zero(One((("d","c"),("b","a")),Nil))) -> true - | _ -> false - - a |> should equal true - -[] -let ``append left 6 right empty``() = - let a = - match (append len6 empty) with - | Zero(One(("f","e"),One((("d","c"),("b","a")),Nil))) -> true - | _ -> false - - a |> should equal true - -[] -let ``append left 6 right3``() = - let a = - match (append len6 (empty |> cons "3" |> cons "2" |> cons "1")) with - | One("f",Zero(Zero(One(((("e","d"),("c","b")),(("a","1"),("2","3"))),Nil)))) -> true - | _ -> false - - a |> should equal true - -[] -let ``lookup length 2``() = - (((len2 |> lookup 0) = "b") && ((len2 |> lookup 1) = "a")) |> should equal true - -[] -let ``lookup length 3``() = - (((len3 |> lookup 0) = "c") && ((len3 |> lookup 1) = "b") && ((len3 |> lookup 2) = "a")) |> should equal true - -[] -let ``lookup length 4``() = - (((len4 |> lookup 0) = "d") && ((len4 |> lookup 1) = "c") && ((len4 |> lookup 2) = "b") && ((len4 |> lookup 3) = "a")) - |> should equal true - -[] -let ``lookup length 5``() = - (((len5 |> lookup 0) = "e") && ((len5 |> lookup 1) = "d") && ((len5 |> lookup 2) = "c") && ((len5 |> lookup 3) = "b") - && ((len5 |> lookup 4) = "a")) |> should equal true - -[] -let ``lookup length 6``() = - (((len6 |> lookup 0) = "f") && ((len6 |> lookup 1) = "e") && ((len6 |> lookup 2) = "d") && ((len6 |> lookup 3) = "c") - && ((len6 |> lookup 4) = "b") && ((len6 |> lookup 5) = "a")) |> should equal true - -[] -let ``lookup length 7``() = - (((len7 |> lookup 0) = "g") && ((len7 |> lookup 1) = "f") && ((len7 |> lookup 2) = "e") && ((len7 |> lookup 3) = "d") - && ((len7 |> lookup 4) = "c") && ((len7 |> lookup 5) = "b") && ((len7 |> lookup 6) = "a")) |> should equal true - -[] -let ``lookup length 8``() = - (((len8 |> lookup 0) = "h") && ((len8 |> lookup 1) = "g") && ((len8 |> lookup 2) = "f") && ((len8 |> lookup 3) = "e") - && ((len8 |> lookup 4) = "d") && ((len8 |> lookup 5) = "c") && ((len8 |> lookup 6) = "b") && ((len8 |> lookup 7) = "a")) - |> should equal true - -[] -let ``lookup length 9``() = - (((len9 |> lookup 0) = "i") && ((len9 |> lookup 1) = "h") && ((len9 |> lookup 2) = "g") && ((len9 |> lookup 3) = "f") - && ((len9 |> lookup 4) = "e") && ((len9 |> lookup 5) = "d") && ((len9 |> lookup 6) = "c") && ((len9 |> lookup 7) = "b") - && ((len9 |> lookup 8) = "a")) |> should equal true - -[] -let ``lookup length 10``() = - (((lena |> lookup 0) = "j") && ((lena |> lookup 1) = "i") && ((lena |> lookup 2) = "h") && ((lena |> lookup 3) = "g") - && ((lena |> lookup 4) = "f") && ((lena |> lookup 5) = "e") && ((lena |> lookup 6) = "d") && ((lena |> lookup 7) = "c") - && ((lena |> lookup 8) = "b") && ((lena |> lookup 9) = "a")) |> should equal true - -[] -let ``tryLookup length 1``() = - let a = len1 |> tryLookup 0 - (a.Value = "a") |> should equal true - -[] -let ``tryLookup length 2``() = - let b = len2 |> tryLookup 0 - let a = len2 |> tryLookup 1 - ((b.Value = "b") && (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 3``() = - let c = len3 |> tryLookup 0 - let b = len3 |> tryLookup 1 - let a = len3 |> tryLookup 2 - ((c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 4``() = - let d = len4 |> tryLookup 0 - let c = len4 |> tryLookup 1 - let b = len4 |> tryLookup 2 - let a = len4 |> tryLookup 3 - ((d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 5``() = - let e = len5 |> tryLookup 0 - let d = len5 |> tryLookup 1 - let c = len5 |> tryLookup 2 - let b = len5 |> tryLookup 3 - let a = len5 |> tryLookup 4 - ((e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 6``() = - let f = len6 |> tryLookup 0 - let e = len6 |> tryLookup 1 - let d = len6 |> tryLookup 2 - let c = len6 |> tryLookup 3 - let b = len6 |> tryLookup 4 - let a = len6 |> tryLookup 5 - ((f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) - |> should equal true - -[] -let ``tryLookup length 7``() = - let g = len7 |> tryLookup 0 - let f = len7 |> tryLookup 1 - let e = len7 |> tryLookup 2 - let d = len7 |> tryLookup 3 - let c = len7 |> tryLookup 4 - let b = len7 |> tryLookup 5 - let a = len7 |> tryLookup 6 - ((g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") - && (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 8``() = - let h = len8 |> tryLookup 0 - let g = len8 |> tryLookup 1 - let f = len8 |> tryLookup 2 - let e = len8 |> tryLookup 3 - let d = len8 |> tryLookup 4 - let c = len8 |> tryLookup 5 - let b = len8 |> tryLookup 6 - let a = len8 |> tryLookup 7 - ((h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") - && (b.Value = "b")&& (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 9``() = - let i = len9 |> tryLookup 0 - let h = len9 |> tryLookup 1 - let g = len9 |> tryLookup 2 - let f = len9 |> tryLookup 3 - let e = len9 |> tryLookup 4 - let d = len9 |> tryLookup 5 - let c = len9 |> tryLookup 6 - let b = len9 |> tryLookup 7 - let a = len9 |> tryLookup 8 - ((i.Value = "i") && (h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") - && (c.Value = "c") && (b.Value = "b")&& (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 10``() = - let j = lena |> tryLookup 0 - let i = lena |> tryLookup 1 - let h = lena |> tryLookup 2 - let g = lena |> tryLookup 3 - let f = lena |> tryLookup 4 - let e = lena |> tryLookup 5 - let d = lena |> tryLookup 6 - let c = lena |> tryLookup 7 - let b = lena |> tryLookup 8 - let a = lena |> tryLookup 9 - ((j.Value = "j") && (i.Value = "i") && (h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") - && (d.Value = "d") && (c.Value = "c") && (b.Value = "b")&& (a.Value = "a")) |> should equal true - -[] -let ``tryLookup not found``() = - lena |> tryLookup 10 |> should equal None - -[] -let ``update length 1``() = - len1 |> update 0 "aa"|> lookup 0 |> should equal "aa" - -[] -let ``update length 2``() = - (((len2 |> update 0 "bb"|> lookup 0) = "bb") && ((len2 |> update 1 "aa"|> lookup 1) = "aa")) |> should equal true - -[] -let ``update length 3``() = - (((len3 |> update 0 "cc"|> lookup 0) = "cc") && ((len3 |> update 1 "bb"|> lookup 1) = "bb") - && ((len3 |> update 2 "aa"|> lookup 2) = "aa")) |> should equal true - -[] -let ``update length 4``() = - (((len4 |> update 0 "dd"|> lookup 0) = "dd") && ((len4 |> update 1 "cc"|> lookup 1) = "cc") - && ((len4 |> update 2 "bb"|> lookup 2) = "bb") && ((len4 |> update 3 "aa"|> lookup 3) = "aa")) - |> should equal true - -[] -let ``update length 5``() = - (((len5 |> update 0 "ee"|> lookup 0) = "ee") && ((len5 |> update 1 "dd"|> lookup 1) = "dd") - && ((len5 |> update 2 "cc"|> lookup 2) = "cc") && ((len5 |> update 3 "bb"|> lookup 3) = "bb") - && ((len5 |> update 4 "aa"|> lookup 4) = "aa")) |> should equal true - -[] -let ``update length 6``() = - (((len6 |> update 0 "ff"|> lookup 0) = "ff") && ((len6 |> update 1 "ee"|> lookup 1) = "ee") - && ((len6 |> update 2 "dd"|> lookup 2) = "dd") && ((len6 |> update 3 "cc"|> lookup 3) = "cc") - && ((len6 |> update 4 "bb"|> lookup 4) = "bb") && ((len6 |> update 5 "aa"|> lookup 5) = "aa")) |> should equal true - -[] -let ``update length 7``() = - (((len7 |> update 0 "gg"|> lookup 0) = "gg") && ((len7 |> update 1 "ff"|> lookup 1) = "ff") - && ((len7 |> update 2 "ee"|> lookup 2) = "ee") && ((len7 |> update 3 "dd"|> lookup 3) = "dd") - && ((len7 |> update 4 "cc"|> lookup 4) = "cc") && ((len7 |> update 5 "bb"|> lookup 5) = "bb") - && ((len7 |> update 6 "aa"|> lookup 6) = "aa")) |> should equal true - -[] -let ``update length 8``() = - (((len8 |> update 0 "hh"|> lookup 0) = "hh") && ((len8 |> update 1 "gg"|> lookup 1) = "gg") - && ((len8 |> update 2 "ff"|> lookup 2) = "ff") && ((len8 |> update 3 "ee"|> lookup 3) = "ee") - && ((len8 |> update 4 "dd"|> lookup 4) = "dd") && ((len8 |> update 5 "cc"|> lookup 5) = "cc") - && ((len8 |> update 6 "bb"|> lookup 6) = "bb") && ((len8 |> update 7 "aa"|> lookup 7) = "aa")) - |> should equal true - -[] -let ``update length 9``() = - (((len9 |> update 0 "ii"|> lookup 0) = "ii") && ((len9 |> update 1 "hh"|> lookup 1) = "hh") - && ((len9 |> update 2 "gg"|> lookup 2) = "gg") && ((len9 |> update 3 "ff"|> lookup 3) = "ff") - && ((len9 |> update 4 "ee"|> lookup 4) = "ee") && ((len9 |> update 5 "dd"|> lookup 5) = "dd") - && ((len9 |> update 6 "cc"|> lookup 6) = "cc") && ((len9 |> update 7 "bb"|> lookup 7) = "bb") - && ((len9 |> update 8 "aa"|> lookup 8) = "aa")) |> should equal true - -[] -let ``update length 10``() = - (((lena |> update 0 "jj"|> lookup 0) = "jj") && ((lena |> update 1 "ii"|> lookup 1) = "ii") - && ((lena |> update 2 "hh"|> lookup 2) = "hh") && ((lena |> update 3 "gg"|> lookup 3) = "gg") - && ((lena |> update 4 "ff"|> lookup 4) = "ff") && ((lena |> update 5 "ee"|> lookup 5) = "ee") - && ((lena |> update 6 "dd"|> lookup 6) = "dd") && ((lena |> update 7 "cc"|> lookup 7) = "cc") - && ((lena |> update 8 "bb"|> lookup 8) = "bb") && ((lena |> update 9 "aa"|> lookup 9) = "aa")) |> should equal true - -[] -let ``tryUpdate length 1``() = - let a = len1 |> tryUpdate 0 "aa" - ((a.Value |> lookup 0) = "aa") |> should equal true - -[] -let ``tryUpdate length 2``() = - let b = len2 |> tryUpdate 0 "bb" - let a = len2 |> tryUpdate 1 "aa" - (((b.Value |> lookup 0) = "bb") && ((a.Value |> lookup 1) = "aa")) |> should equal true - -[] -let ``tryUpdate length 3``() = - let c = len3 |> tryUpdate 0 "cc" - let b = len3 |> tryUpdate 1 "bb" - let a = len3 |> tryUpdate 2 "aa" - (((c.Value |> lookup 0) = "cc") && ((b.Value |> lookup 1) = "bb") && ((a.Value |> lookup 2) = "aa")) |> should equal true - -[] -let ``tryUpdate length 4``() = - let d = len4 |> tryUpdate 0 "dd" - let c = len4 |> tryUpdate 1 "cc" - let b = len4 |> tryUpdate 2 "bb" - let a = len4 |> tryUpdate 3 "aa" - (((d.Value |> lookup 0) = "dd") && ((c.Value |> lookup 1) = "cc") && ((b.Value |> lookup 2) = "bb") - && ((a.Value |> lookup 3) = "aa")) |> should equal true - -[] -let ``tryUpdate length 5``() = - let e = len5 |> tryUpdate 0 "ee" - let d = len5 |> tryUpdate 1 "dd" - let c = len5 |> tryUpdate 2 "cc" - let b = len5 |> tryUpdate 3 "bb" - let a = len5 |> tryUpdate 4 "aa" - (((e.Value |> lookup 0) = "ee") && ((d.Value |> lookup 1) = "dd") && ((c.Value |> lookup 2) = "cc") - && ((b.Value |> lookup 3) = "bb") && ((a.Value |> lookup 4) = "aa")) |> should equal true - -[] -let ``tryUpdate length 6``() = - let f = len6 |> tryUpdate 0 "ff" - let e = len6 |> tryUpdate 1 "ee" - let d = len6 |> tryUpdate 2 "dd" - let c = len6 |> tryUpdate 3 "cc" - let b = len6 |> tryUpdate 4 "bb" - let a = len6 |> tryUpdate 5 "aa" - (((f.Value |> lookup 0) = "ff") && ((e.Value |> lookup 1) = "ee") && ((d.Value |> lookup 2) = "dd") - && ((c.Value |> lookup 3) = "cc") && ((b.Value |> lookup 4) = "bb") && ((a.Value |> lookup 5) = "aa")) - |> should equal true - -[] -let ``tryUpdate length 7``() = - let g = len7 |> tryUpdate 0 "gg" - let f = len7 |> tryUpdate 1 "ff" - let e = len7 |> tryUpdate 2 "ee" - let d = len7 |> tryUpdate 3 "dd" - let c = len7 |> tryUpdate 4 "cc" - let b = len7 |> tryUpdate 5 "bb" - let a = len7 |> tryUpdate 6 "aa" - (((g.Value |> lookup 0) = "gg") && ((f.Value |> lookup 1) = "ff") && ((e.Value |> lookup 2) = "ee") - && ((d.Value |> lookup 3) = "dd") && ((c.Value |> lookup 4) = "cc") && ((b.Value |> lookup 5) = "bb") - && ((a.Value |> lookup 6) = "aa")) |> should equal true - -[] -let ``tryUpdate length 8``() = - let h = len8 |> tryUpdate 0 "hh" - let g = len8 |> tryUpdate 1 "gg" - let f = len8 |> tryUpdate 2 "ff" - let e = len8 |> tryUpdate 3 "ee" - let d = len8 |> tryUpdate 4 "dd" - let c = len8 |> tryUpdate 5 "cc" - let b = len8 |> tryUpdate 6 "bb" - let a = len8 |> tryUpdate 7 "aa" - (((h.Value |> lookup 0) = "hh") && ((g.Value |> lookup 1) = "gg") && ((f.Value |> lookup 2) = "ff") - && ((e.Value |> lookup 3) = "ee") && ((d.Value |> lookup 4) = "dd") && ((c.Value |> lookup 5) = "cc") - && ((b.Value |> lookup 6) = "bb")&& ((a.Value |> lookup 7) = "aa")) |> should equal true - -[] -let ``tryUpdate length 9``() = - let i = len9 |> tryUpdate 0 "ii" - let h = len9 |> tryUpdate 1 "hh" - let g = len9 |> tryUpdate 2 "gg" - let f = len9 |> tryUpdate 3 "ff" - let e = len9 |> tryUpdate 4 "ee" - let d = len9 |> tryUpdate 5 "dd" - let c = len9 |> tryUpdate 6 "cc" - let b = len9 |> tryUpdate 7 "bb" - let a = len9 |> tryUpdate 8 "aa" - (((i.Value |> lookup 0) = "ii") && ((h.Value |> lookup 1) = "hh") && ((g.Value |> lookup 2) = "gg") - && ((f.Value |> lookup 3) = "ff") && ((e.Value |> lookup 4) = "ee") && ((d.Value |> lookup 5) = "dd") - && ((c.Value |> lookup 6) = "cc") && ((b.Value |> lookup 7) = "bb")&& ((a.Value |> lookup 8) = "aa")) |> should equal true - -[] -let ``tryUpdate length 10``() = - let j = lena |> tryUpdate 0 "jj" - let i = lena |> tryUpdate 1 "ii" - let h = lena |> tryUpdate 2 "hh" - let g = lena |> tryUpdate 3 "gg" - let f = lena |> tryUpdate 4 "ff" - let e = lena |> tryUpdate 5 "ee" - let d = lena |> tryUpdate 6 "dd" - let c = lena |> tryUpdate 7 "cc" - let b = lena |> tryUpdate 8 "bb" - let a = lena |> tryUpdate 9 "aa" - (((j.Value |> lookup 0) = "jj") && ((i.Value |> lookup 1) = "ii") && ((h.Value |> lookup 2) = "hh") - && ((g.Value |> lookup 3) = "gg") && ((f.Value |> lookup 4) = "ff") && ((e.Value |> lookup 5) = "ee") - && ((d.Value |> lookup 6) = "dd") && ((c.Value |> lookup 7) = "cc") && ((b.Value |> lookup 8) = "bb") - && ((a.Value |> lookup 9) = "aa")) |> should equal true - -[] -let ``remove elements length 1``() = - isEmpty (len1 |> remove 0) |> should equal true - -[] -let ``remove elements length 2``() = - let a = - match (len2 |> remove 0) with - | One(("a"),Nil) -> true - | _ -> false - - let b = - match (len2 |> remove 1) with - | One(("b"),Nil) -> true - | _ -> false - - (a && b) |> should equal true - -[] -let ``remove elements length 3``() = - let a = - match (len3 |> remove 0) with - | Zero(One(("b","a"),Nil)) -> true - | _ -> false - - let b = - match (len3 |> remove 1) with - | Zero (One(("c","a"),Nil)) -> true - | _ -> false - - let c = - match (len3 |> remove 2) with - | Zero (One(("c","b"),Nil)) -> true - | _ -> false - - (a && b && c) |> should equal true - -[] -let ``remove elements length 4``() = - let a = - match (len4 |> remove 0) with - | One ("c",One(("b","a"),Nil)) -> true - | _ -> false - - let b = - match (len4 |> remove 1) with - | One ("d",One(("b","a"),Nil)) -> true - | _ -> false - - let c = - match (len4 |> remove 2) with - | One ("d",One(("c","a"),Nil)) -> true - | _ -> false - - let d = - match (len4 |> remove 3) with - | One ("d",One(("c","b"),Nil)) -> true - | _ -> false - - (a && b && c && d) |> should equal true - -[] -let ``remove elements length 5``() = - let a = - match (len5 |> remove 0) with - | Zero(Zero(One((("d","c"),("b","a")),Nil))) -> true - | _ -> false - - let b = - match (len5 |> remove 1) with - | Zero(Zero(One((("e","c"),("b","a")),Nil))) -> true - | _ -> false - - let c = - match (len5 |> remove 2) with - | Zero(Zero(One((("e","d"),("b","a")),Nil))) -> true - | _ -> false - - let d = - match (len5 |> remove 3) with - | Zero(Zero(One((("e","d"),("c","a")),Nil))) -> true - | _ -> false - - let e = - match (len5 |> remove 4) with - | Zero(Zero(One((("e","d"),("c","b")),Nil))) -> true - | _ -> false - - (a && b && c && d && e) |> should equal true - -[] -let ``remove elements length 6``() = - let a = - match (len6 |> remove 0) with - | One("e",Zero(One((("d","c"),("b","a")),Nil))) -> true - | _ -> false - - let b = - match (len6 |> remove 1) with - | One("f",Zero(One((("d","c"),("b","a")),Nil))) -> true - | _ -> false - - let c = - match (len6 |> remove 2) with - | One("f",Zero(One((("e","c"),("b","a")),Nil))) -> true - | _ -> false - - let d = - match (len6 |> remove 3) with - | One("f",Zero(One((("e","d"),("b","a")),Nil))) -> true - | _ -> false - - let e = - match (len6 |> remove 4) with - | One("f",Zero(One((("e","d"),("c","a")),Nil))) -> true - | _ -> false - - let f = - match (len6 |> remove 5) with - | One("f",Zero(One((("e","d"),("c","b")),Nil))) -> true - | _ -> false - - (a && b && c && d && e && f) |> should equal true - -[] -let ``remove elements length 7``() = - let a = - match (len7 |> remove 0) with - | Zero(One(("f","e"),One((("d","c"),("b","a")),Nil))) -> true - | _ -> false - - let b = - match (len7 |> remove 1) with - | Zero(One(("g","e"),One((("d","c"),("b","a")),Nil))) -> true - | _ -> false - - let c = - match (len7 |> remove 2) with - | Zero(One(("g","f"),One((("d","c"),("b","a")),Nil))) -> true - | _ -> false - - let d = - match (len7 |> remove 3) with - | Zero(One(("g","f"),One((("e","c"),("b","a")),Nil))) -> true - | _ -> false - - let e = - match (len7 |> remove 4) with - | Zero(One(("g","f"),One((("e","d"),("b","a")),Nil))) -> true - | _ -> false - - let f = - match (len7 |> remove 5) with - | Zero(One(("g","f"),One((("e","d"),("c","a")),Nil))) -> true - | _ -> false - - let g = - match (len7 |> remove 6) with - | Zero(One(("g","f"),One((("e","d"),("c","b")),Nil))) -> true - | _ -> false - - (a && b && c && d && e && f && g) |> should equal true - -[] -let ``remove elements length 8``() = - let a = - match (len8 |> remove 0) with - | One("g",One(("f","e"),One((("d","c"),("b","a")),Nil))) -> true - | _ -> false - - let b = - match (len8 |> remove 1) with - | One("h",One(("f","e"),One((("d","c"),("b","a")),Nil))) -> true - | _ -> false - - let c = - match (len8 |> remove 2) with - | One("h",One(("g","e"),One((("d","c"),("b","a")),Nil))) -> true - | _ -> false - - let d = - match (len8 |> remove 3) with - | One("h",One(("g","f"),One((("d","c"),("b","a")),Nil))) -> true - | _ -> false - - let e = - match (len8 |> remove 4) with - | One("h",One(("g","f"),One((("e","c"),("b","a")),Nil))) -> true - | _ -> false - - let f = - match (len8 |> remove 5) with - | One("h",One(("g","f"),One((("e","d"),("b","a")),Nil))) -> true - | _ -> false - - let g = - match (len8 |> remove 6) with - | One("h",One(("g","f"),One((("e","d"),("c","a")),Nil))) -> true - | _ -> false - - let h = - match (len8 |> remove 7) with - | One("h",One(("g","f"),One((("e","d"),("c","b")),Nil))) -> true - | _ -> false - - (a && b && c && d && e && f && g && h) |> should equal true - -[] -let ``remove elements length 9``() = - let a = - match (len9 |> remove 0) with - | Zero(Zero(Zero(One(((("h","g"),("f","e")),(("d","c"),("b","a"))),Nil)))) -> true - | _ -> false - - let b = - match (len9 |> remove 1) with - | Zero(Zero(Zero(One(((("i","g"),("f","e")),(("d","c"),("b","a"))),Nil)))) -> true - | _ -> false - - let c = - match (len9 |> remove 2) with - | Zero(Zero(Zero(One(((("i","h"),("f","e")),(("d","c"),("b","a"))),Nil)))) -> true - | _ -> false - - let d = - match (len9 |> remove 3) with - | Zero(Zero(Zero(One(((("i","h"),("g","e")),(("d","c"),("b","a"))),Nil)))) -> true - | _ -> false - - let e = - match (len9 |> remove 4) with - | Zero(Zero(Zero(One(((("i","h"),("g","f")),(("d","c"),("b","a"))),Nil)))) -> true - | _ -> false - - let f = - match (len9 |> remove 5) with - | Zero(Zero(Zero(One(((("i","h"),("g","f")),(("e","c"),("b","a"))),Nil)))) -> true - | _ -> false - - let g = - match (len9 |> remove 6) with - | Zero(Zero(Zero(One(((("i","h"),("g","f")),(("e","d"),("b","a"))),Nil)))) -> true - | _ -> false - - let h = - match (len9 |> remove 7) with - | Zero(Zero(Zero(One(((("i","h"),("g","f")),(("e","d"),("c","a"))),Nil)))) -> true - | _ -> false - - let i = - match (len9 |> remove 8) with - | Zero(Zero(Zero(One(((("i","h"),("g","f")),(("e","d"),("c","b"))),Nil)))) -> true - | _ -> false - - (a && b && c && d && e && f && g && h && i) |> should equal true - -[] -let ``remove elements length 10``() = - let a = - match (lena |> remove 0) with - | One("i",Zero(Zero(One(((("h","g"),("f","e")),(("d","c"),("b","a"))),Nil)))) -> true - | _ -> false - - let b = - match (lena |> remove 1) with - | One("j",Zero(Zero(One(((("h","g"),("f","e")),(("d","c"),("b","a"))),Nil)))) -> true - | _ -> false - - let c = - match (lena |> remove 2) with - | One("j",Zero(Zero(One(((("i","g"),("f","e")),(("d","c"),("b","a"))),Nil)))) -> true - | _ -> false - - let d = - match (lena |> remove 3) with - | One("j",Zero(Zero(One(((("i","h"),("f","e")),(("d","c"),("b","a"))),Nil)))) -> true - | _ -> false - - let e = - match (lena |> remove 4) with - | One("j",Zero(Zero(One(((("i","h"),("g","e")),(("d","c"),("b","a"))),Nil)))) -> true - | _ -> false - - let f = - match (lena |> remove 5) with - | One("j",Zero(Zero(One(((("i","h"),("g","f")),(("d","c"),("b","a"))),Nil)))) -> true - | _ -> false - - let g = - match (lena |> remove 6) with - | One("j",Zero(Zero(One(((("i","h"),("g","f")),(("e","c"),("b","a"))),Nil)))) -> true - | _ -> false - - let h = - match (lena |> remove 7) with - | One("j",Zero(Zero(One(((("i","h"),("g","f")),(("e","d"),("b","a"))),Nil)))) -> true - | _ -> false - - let i = - match (lena |> remove 8) with - | One("j",Zero(Zero(One(((("i","h"),("g","f")),(("e","d"),("c","a"))),Nil)))) -> true - | _ -> false - - let j = - match (lena |> remove 9) with - | One("j",Zero(Zero(One(((("i","h"),("g","f")),(("e","d"),("c","b"))),Nil)))) -> true - | _ -> false - - (a && b && c && d && e && f && g && h && i && j) |> should equal true - -[] -let ``tryRemove elements length 1``() = - let a = tryRemove 0 len1 - (isEmpty a.Value) |> should equal true - -[] -let ``tryRemove elements length 2``() = - let a = - match (len2 |> tryRemove 0) with - | Some(One(("a"),Nil)) -> true - | _ -> false - - let b = - match (len2 |> tryRemove 1) with - | Some(One(("b"),Nil)) -> true - | _ -> false - - (a && b) |> should equal true - -[] -let ``tryRemove elements length 3``() = - let a = - match (len3 |> tryRemove 0) with - | Some(Zero(One(("b","a"),Nil))) -> true - | _ -> false - - let b = - match (len3 |> tryRemove 1) with - | Some(Zero (One(("c","a"),Nil))) -> true - | _ -> false - - let c = - match (len3 |> tryRemove 2) with - | Some(Zero (One(("c","b"),Nil))) -> true - | _ -> false - - (a && b && c) |> should equal true - -[] -let ``tryRemove elements length 4``() = - let a = - match (len4 |> tryRemove 0) with - | Some(One ("c",One(("b","a"),Nil))) -> true - | _ -> false - - let b = - match (len4 |> tryRemove 1) with - | Some(One ("d",One(("b","a"),Nil))) -> true - | _ -> false - - let c = - match (len4 |> tryRemove 2) with - | Some(One ("d",One(("c","a"),Nil))) -> true - | _ -> false - - let d = - match (len4 |> tryRemove 3) with - | Some(One ("d",One(("c","b"),Nil))) -> true - | _ -> false - - (a && b && c && d) |> should equal true - -[] -let ``tryRemove elements length 5``() = - let a = - match (len5 |> tryRemove 0) with - | Some(Zero(Zero(One((("d","c"),("b","a")),Nil)))) -> true - | _ -> false - - let b = - match (len5 |> tryRemove 1) with - | Some(Zero(Zero(One((("e","c"),("b","a")),Nil)))) -> true - | _ -> false - - let c = - match (len5 |> tryRemove 2) with - | Some(Zero(Zero(One((("e","d"),("b","a")),Nil)))) -> true - | _ -> false - - let d = - match (len5 |> tryRemove 3) with - | Some(Zero(Zero(One((("e","d"),("c","a")),Nil)))) -> true - | _ -> false - - let e = - match (len5 |> tryRemove 4) with - | Some(Zero(Zero(One((("e","d"),("c","b")),Nil)))) -> true - | _ -> false - - (a && b && c && d && e) |> should equal true - -[] -let ``tryRemove elements length 6``() = - let a = - match (len6 |> tryRemove 0) with - | Some(One("e",Zero(One((("d","c"),("b","a")),Nil)))) -> true - | _ -> false - - let b = - match (len6 |> tryRemove 1) with - | Some(One("f",Zero(One((("d","c"),("b","a")),Nil)))) -> true - | _ -> false - - let c = - match (len6 |> tryRemove 2) with - | Some(One("f",Zero(One((("e","c"),("b","a")),Nil)))) -> true - | _ -> false - - let d = - match (len6 |> tryRemove 3) with - | Some(One("f",Zero(One((("e","d"),("b","a")),Nil)))) -> true - | _ -> false - - let e = - match (len6 |> tryRemove 4) with - | Some(One("f",Zero(One((("e","d"),("c","a")),Nil)))) -> true - | _ -> false - - let f = - match (len6 |> tryRemove 5) with - | Some(One("f",Zero(One((("e","d"),("c","b")),Nil)))) -> true - | _ -> false - - (a && b && c && d && e && f) |> should equal true - -[] -let ``tryRemove elements length 7``() = - let a = - match (len7 |> tryRemove 0) with - | Some(Zero(One(("f","e"),One((("d","c"),("b","a")),Nil)))) -> true - | _ -> false - - let b = - match (len7 |> tryRemove 1) with - | Some(Zero(One(("g","e"),One((("d","c"),("b","a")),Nil)))) -> true - | _ -> false - - let c = - match (len7 |> tryRemove 2) with - | Some(Zero(One(("g","f"),One((("d","c"),("b","a")),Nil)))) -> true - | _ -> false - - let d = - match (len7 |> tryRemove 3) with - | Some(Zero(One(("g","f"),One((("e","c"),("b","a")),Nil)))) -> true - | _ -> false - - let e = - match (len7 |> tryRemove 4) with - | Some(Zero(One(("g","f"),One((("e","d"),("b","a")),Nil)))) -> true - | _ -> false - - let f = - match (len7 |> tryRemove 5) with - | Some(Zero(One(("g","f"),One((("e","d"),("c","a")),Nil)))) -> true - | _ -> false - - let g = - match (len7 |> tryRemove 6) with - | Some(Zero(One(("g","f"),One((("e","d"),("c","b")),Nil)))) -> true - | _ -> false - - (a && b && c && d && e && f && g) |> should equal true - -[] -let ``tryRemove elements length 8``() = - let a = - match (len8 |> tryRemove 0) with - | Some(One("g",One(("f","e"),One((("d","c"),("b","a")),Nil)))) -> true - | _ -> false - - let b = - match (len8 |> tryRemove 1) with - | Some(One("h",One(("f","e"),One((("d","c"),("b","a")),Nil)))) -> true - | _ -> false - - let c = - match (len8 |> tryRemove 2) with - | Some(One("h",One(("g","e"),One((("d","c"),("b","a")),Nil)))) -> true - | _ -> false - - let d = - match (len8 |> tryRemove 3) with - | Some(One("h",One(("g","f"),One((("d","c"),("b","a")),Nil)))) -> true - | _ -> false - - let e = - match (len8 |> tryRemove 4) with - | Some(One("h",One(("g","f"),One((("e","c"),("b","a")),Nil)))) -> true - | _ -> false - - let f = - match (len8 |> tryRemove 5) with - | Some(One("h",One(("g","f"),One((("e","d"),("b","a")),Nil)))) -> true - | _ -> false - - let g = - match (len8 |> tryRemove 6) with - | Some(One("h",One(("g","f"),One((("e","d"),("c","a")),Nil)))) -> true - | _ -> false - - let h = - match (len8 |> tryRemove 7) with - | Some(One("h",One(("g","f"),One((("e","d"),("c","b")),Nil)))) -> true - | _ -> false - - (a && b && c && d && e && f && g && h) |> should equal true - -[] -let ``tryRemove elements length 9``() = - let a = - match (len9 |> tryRemove 0) with - | Some(Zero(Zero(Zero(One(((("h","g"),("f","e")),(("d","c"),("b","a"))),Nil))))) -> true - | _ -> false - - let b = - match (len9 |> tryRemove 1) with - | Some(Zero(Zero(Zero(One(((("i","g"),("f","e")),(("d","c"),("b","a"))),Nil))))) -> true - | _ -> false - - let c = - match (len9 |> tryRemove 2) with - | Some(Zero(Zero(Zero(One(((("i","h"),("f","e")),(("d","c"),("b","a"))),Nil))))) -> true - | _ -> false - - let d = - match (len9 |> tryRemove 3) with - | Some(Zero(Zero(Zero(One(((("i","h"),("g","e")),(("d","c"),("b","a"))),Nil))))) -> true - | _ -> false - - let e = - match (len9 |> tryRemove 4) with - | Some(Zero(Zero(Zero(One(((("i","h"),("g","f")),(("d","c"),("b","a"))),Nil))))) -> true - | _ -> false - - let f = - match (len9 |> tryRemove 5) with - | Some(Zero(Zero(Zero(One(((("i","h"),("g","f")),(("e","c"),("b","a"))),Nil))))) -> true - | _ -> false - - let g = - match (len9 |> tryRemove 6) with - | Some(Zero(Zero(Zero(One(((("i","h"),("g","f")),(("e","d"),("b","a"))),Nil))))) -> true - | _ -> false - - let h = - match (len9 |> tryRemove 7) with - | Some(Zero(Zero(Zero(One(((("i","h"),("g","f")),(("e","d"),("c","a"))),Nil))))) -> true - | _ -> false - - let i = - match (len9 |> tryRemove 8) with - | Some(Zero(Zero(Zero(One(((("i","h"),("g","f")),(("e","d"),("c","b"))),Nil))))) -> true - | _ -> false - - (a && b && c && d && e && f && g && h && i) |> should equal true - -[] -let ``tryRemove elements length 10``() = - let a = - match (lena |> tryRemove 0) with - | Some(One("i",Zero(Zero(One(((("h","g"),("f","e")),(("d","c"),("b","a"))),Nil))))) -> true - | _ -> false - - let b = - match (lena |> tryRemove 1) with - | Some(One("j",Zero(Zero(One(((("h","g"),("f","e")),(("d","c"),("b","a"))),Nil))))) -> true - | _ -> false - - let c = - match (lena |> tryRemove 2) with - | Some(One("j",Zero(Zero(One(((("i","g"),("f","e")),(("d","c"),("b","a"))),Nil))))) -> true - | _ -> false - - let d = - match (lena |> tryRemove 3) with - | Some(One("j",Zero(Zero(One(((("i","h"),("f","e")),(("d","c"),("b","a"))),Nil))))) -> true - | _ -> false - - let e = - match (lena |> tryRemove 4) with - | Some(One("j",Zero(Zero(One(((("i","h"),("g","e")),(("d","c"),("b","a"))),Nil))))) -> true - | _ -> false - - let f = - match (lena |> tryRemove 5) with - | Some(One("j",Zero(Zero(One(((("i","h"),("g","f")),(("d","c"),("b","a"))),Nil))))) -> true - | _ -> false - - let g = - match (lena |> tryRemove 6) with - | Some(One("j",Zero(Zero(One(((("i","h"),("g","f")),(("e","c"),("b","a"))),Nil))))) -> true - | _ -> false - - let h = - match (lena |> tryRemove 7) with - | Some(One("j",Zero(Zero(One(((("i","h"),("g","f")),(("e","d"),("b","a"))),Nil))))) -> true - | _ -> false - - let i = - match (lena |> tryRemove 8) with - | Some(One("j",Zero(Zero(One(((("i","h"),("g","f")),(("e","d"),("c","a"))),Nil))))) -> true - | _ -> false - - let j = - match (lena |> tryRemove 9) with - | Some(One("j",Zero(Zero(One(((("i","h"),("g","f")),(("e","d"),("c","b"))),Nil))))) -> true - | _ -> false - - (a && b && c && d && e && f && g && h && i && j) |> should equal true - -[] -let ``length of empty is 0``() = - ((length empty) = 0) |> should equal true - -[] -let ``length of 1 - 10 good``() = - (((length len1) = 1) && ((length len2) = 2) && ((length len3) = 3) && ((length len4) = 4) - && ((length len5) = 5) && ((length len6) = 6) && ((length len7) = 7) && ((length len8) = 8) - && ((length len9) = 9) && ((length lena) = 10)) |> should equal true - -[] -let ``ofSeq``() = - let x = ofSeq ["a";"b";"c";"d";"e";"f";"g";"h";"i";"j"] - - (((x |> lookup 0) = "a") && ((x |> lookup 1) = "b") && ((x |> lookup 2) = "c") && ((x |> lookup 3) = "d") - && ((x |> lookup 4) = "e") && ((x |> lookup 5) = "f") && ((x |> lookup 6) = "g") && ((x |> lookup 7) = "h") - && ((x |> lookup 8) = "i") && ((x |> lookup 9) = "j")) |> should equal true - -[] -let ``IRandomAccessList cons works``() = - ((lena :> IRandomAccessList).Cons "zz").Head |> should equal "zz" \ No newline at end of file + test "AltBinaryRandomAccessList.rev elements length 5" { + let a = + match (len5 |> AltBinaryRandomAccessList.rev) with + | One("a",Zero(One((("b","c"),("d","e")),Nil))) -> true + | _ -> false + + a |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.append 2 AltBinaryRandomAccessList.empty lists" { + AltBinaryRandomAccessList.isEmpty (AltBinaryRandomAccessList.append AltBinaryRandomAccessList.empty AltBinaryRandomAccessList.empty) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.append left AltBinaryRandomAccessList.empty right 5" { + let a = + match (AltBinaryRandomAccessList.append AltBinaryRandomAccessList.empty len5) with + | One("e",Zero(One((("d","c"),("b","a")),Nil))) -> true + | _ -> false + + a |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.append left 6 right AltBinaryRandomAccessList.empty" { + let a = + match (AltBinaryRandomAccessList.append len6 AltBinaryRandomAccessList.empty) with + | Zero(One(("f","e"),One((("d","c"),("b","a")),Nil))) -> true + | _ -> false + + a |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.append left 6 right3" { + let a = + match (AltBinaryRandomAccessList.append len6 (AltBinaryRandomAccessList.empty |> AltBinaryRandomAccessList.cons "3" |> AltBinaryRandomAccessList.cons "2" |> AltBinaryRandomAccessList.cons "1")) with + | One("f",Zero(Zero(One(((("e","d"),("c","b")),(("a","1"),("2","3"))),Nil)))) -> true + | _ -> false + + a |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.lookup length 2" { + (((len2 |> AltBinaryRandomAccessList.lookup 0) = "b") && ((len2 |> AltBinaryRandomAccessList.lookup 1) = "a")) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.lookup length 3" { + (((len3 |> AltBinaryRandomAccessList.lookup 0) = "c") && ((len3 |> AltBinaryRandomAccessList.lookup 1) = "b") && ((len3 |> AltBinaryRandomAccessList.lookup 2) = "a")) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.lookup length 4" { + (((len4 |> AltBinaryRandomAccessList.lookup 0) = "d") && ((len4 |> AltBinaryRandomAccessList.lookup 1) = "c") && ((len4 |> AltBinaryRandomAccessList.lookup 2) = "b") && ((len4 |> AltBinaryRandomAccessList.lookup 3) = "a")) + |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.lookup length 5" { + (((len5 |> AltBinaryRandomAccessList.lookup 0) = "e") && ((len5 |> AltBinaryRandomAccessList.lookup 1) = "d") && ((len5 |> AltBinaryRandomAccessList.lookup 2) = "c") && ((len5 |> AltBinaryRandomAccessList.lookup 3) = "b") + && ((len5 |> AltBinaryRandomAccessList.lookup 4) = "a")) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.lookup length 6" { + (((len6 |> AltBinaryRandomAccessList.lookup 0) = "f") && ((len6 |> AltBinaryRandomAccessList.lookup 1) = "e") && ((len6 |> AltBinaryRandomAccessList.lookup 2) = "d") && ((len6 |> AltBinaryRandomAccessList.lookup 3) = "c") + && ((len6 |> AltBinaryRandomAccessList.lookup 4) = "b") && ((len6 |> AltBinaryRandomAccessList.lookup 5) = "a")) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.lookup length 7" { + (((len7 |> AltBinaryRandomAccessList.lookup 0) = "g") && ((len7 |> AltBinaryRandomAccessList.lookup 1) = "f") && ((len7 |> AltBinaryRandomAccessList.lookup 2) = "e") && ((len7 |> AltBinaryRandomAccessList.lookup 3) = "d") + && ((len7 |> AltBinaryRandomAccessList.lookup 4) = "c") && ((len7 |> AltBinaryRandomAccessList.lookup 5) = "b") && ((len7 |> AltBinaryRandomAccessList.lookup 6) = "a")) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.lookup length 8" { + (((len8 |> AltBinaryRandomAccessList.lookup 0) = "h") && ((len8 |> AltBinaryRandomAccessList.lookup 1) = "g") && ((len8 |> AltBinaryRandomAccessList.lookup 2) = "f") && ((len8 |> AltBinaryRandomAccessList.lookup 3) = "e") + && ((len8 |> AltBinaryRandomAccessList.lookup 4) = "d") && ((len8 |> AltBinaryRandomAccessList.lookup 5) = "c") && ((len8 |> AltBinaryRandomAccessList.lookup 6) = "b") && ((len8 |> AltBinaryRandomAccessList.lookup 7) = "a")) + |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.lookup length 9" { + (((len9 |> AltBinaryRandomAccessList.lookup 0) = "i") && ((len9 |> AltBinaryRandomAccessList.lookup 1) = "h") && ((len9 |> AltBinaryRandomAccessList.lookup 2) = "g") && ((len9 |> AltBinaryRandomAccessList.lookup 3) = "f") + && ((len9 |> AltBinaryRandomAccessList.lookup 4) = "e") && ((len9 |> AltBinaryRandomAccessList.lookup 5) = "d") && ((len9 |> AltBinaryRandomAccessList.lookup 6) = "c") && ((len9 |> AltBinaryRandomAccessList.lookup 7) = "b") + && ((len9 |> AltBinaryRandomAccessList.lookup 8) = "a")) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.lookup length 10" { + (((lena |> AltBinaryRandomAccessList.lookup 0) = "j") && ((lena |> AltBinaryRandomAccessList.lookup 1) = "i") && ((lena |> AltBinaryRandomAccessList.lookup 2) = "h") && ((lena |> AltBinaryRandomAccessList.lookup 3) = "g") + && ((lena |> AltBinaryRandomAccessList.lookup 4) = "f") && ((lena |> AltBinaryRandomAccessList.lookup 5) = "e") && ((lena |> AltBinaryRandomAccessList.lookup 6) = "d") && ((lena |> AltBinaryRandomAccessList.lookup 7) = "c") + && ((lena |> AltBinaryRandomAccessList.lookup 8) = "b") && ((lena |> AltBinaryRandomAccessList.lookup 9) = "a")) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.tryLookup length 1" { + let a = len1 |> AltBinaryRandomAccessList.tryLookup 0 + (a.Value = "a") |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.tryLookup length 2" { + let b = len2 |> AltBinaryRandomAccessList.tryLookup 0 + let a = len2 |> AltBinaryRandomAccessList.tryLookup 1 + ((b.Value = "b") && (a.Value = "a")) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.tryLookup length 3" { + let c = len3 |> AltBinaryRandomAccessList.tryLookup 0 + let b = len3 |> AltBinaryRandomAccessList.tryLookup 1 + let a = len3 |> AltBinaryRandomAccessList.tryLookup 2 + ((c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.tryLookup length 4" { + let d = len4 |> AltBinaryRandomAccessList.tryLookup 0 + let c = len4 |> AltBinaryRandomAccessList.tryLookup 1 + let b = len4 |> AltBinaryRandomAccessList.tryLookup 2 + let a = len4 |> AltBinaryRandomAccessList.tryLookup 3 + ((d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.tryLookup length 5" { + let e = len5 |> AltBinaryRandomAccessList.tryLookup 0 + let d = len5 |> AltBinaryRandomAccessList.tryLookup 1 + let c = len5 |> AltBinaryRandomAccessList.tryLookup 2 + let b = len5 |> AltBinaryRandomAccessList.tryLookup 3 + let a = len5 |> AltBinaryRandomAccessList.tryLookup 4 + ((e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.tryLookup length 6" { + let f = len6 |> AltBinaryRandomAccessList.tryLookup 0 + let e = len6 |> AltBinaryRandomAccessList.tryLookup 1 + let d = len6 |> AltBinaryRandomAccessList.tryLookup 2 + let c = len6 |> AltBinaryRandomAccessList.tryLookup 3 + let b = len6 |> AltBinaryRandomAccessList.tryLookup 4 + let a = len6 |> AltBinaryRandomAccessList.tryLookup 5 + ((f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) + |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.tryLookup length 7" { + let g = len7 |> AltBinaryRandomAccessList.tryLookup 0 + let f = len7 |> AltBinaryRandomAccessList.tryLookup 1 + let e = len7 |> AltBinaryRandomAccessList.tryLookup 2 + let d = len7 |> AltBinaryRandomAccessList.tryLookup 3 + let c = len7 |> AltBinaryRandomAccessList.tryLookup 4 + let b = len7 |> AltBinaryRandomAccessList.tryLookup 5 + let a = len7 |> AltBinaryRandomAccessList.tryLookup 6 + ((g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") + && (a.Value = "a")) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.tryLookup length 8" { + let h = len8 |> AltBinaryRandomAccessList.tryLookup 0 + let g = len8 |> AltBinaryRandomAccessList.tryLookup 1 + let f = len8 |> AltBinaryRandomAccessList.tryLookup 2 + let e = len8 |> AltBinaryRandomAccessList.tryLookup 3 + let d = len8 |> AltBinaryRandomAccessList.tryLookup 4 + let c = len8 |> AltBinaryRandomAccessList.tryLookup 5 + let b = len8 |> AltBinaryRandomAccessList.tryLookup 6 + let a = len8 |> AltBinaryRandomAccessList.tryLookup 7 + ((h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") + && (b.Value = "b")&& (a.Value = "a")) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.tryLookup length 9" { + let i = len9 |> AltBinaryRandomAccessList.tryLookup 0 + let h = len9 |> AltBinaryRandomAccessList.tryLookup 1 + let g = len9 |> AltBinaryRandomAccessList.tryLookup 2 + let f = len9 |> AltBinaryRandomAccessList.tryLookup 3 + let e = len9 |> AltBinaryRandomAccessList.tryLookup 4 + let d = len9 |> AltBinaryRandomAccessList.tryLookup 5 + let c = len9 |> AltBinaryRandomAccessList.tryLookup 6 + let b = len9 |> AltBinaryRandomAccessList.tryLookup 7 + let a = len9 |> AltBinaryRandomAccessList.tryLookup 8 + ((i.Value = "i") && (h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") + && (c.Value = "c") && (b.Value = "b")&& (a.Value = "a")) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.tryLookup length 10" { + let j = lena |> AltBinaryRandomAccessList.tryLookup 0 + let i = lena |> AltBinaryRandomAccessList.tryLookup 1 + let h = lena |> AltBinaryRandomAccessList.tryLookup 2 + let g = lena |> AltBinaryRandomAccessList.tryLookup 3 + let f = lena |> AltBinaryRandomAccessList.tryLookup 4 + let e = lena |> AltBinaryRandomAccessList.tryLookup 5 + let d = lena |> AltBinaryRandomAccessList.tryLookup 6 + let c = lena |> AltBinaryRandomAccessList.tryLookup 7 + let b = lena |> AltBinaryRandomAccessList.tryLookup 8 + let a = lena |> AltBinaryRandomAccessList.tryLookup 9 + ((j.Value = "j") && (i.Value = "i") && (h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") + && (d.Value = "d") && (c.Value = "c") && (b.Value = "b")&& (a.Value = "a")) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.tryLookup not found" { + lena |> AltBinaryRandomAccessList.tryLookup 10 |> Expect.isNone "" } + + test "AltBinaryRandomAccessList.update length 1" { + len1 |> AltBinaryRandomAccessList.update 0 "aa"|> AltBinaryRandomAccessList.lookup 0 |> Expect.equal "" "aa" } + + test "AltBinaryRandomAccessList.update length 2" { + (((len2 |> AltBinaryRandomAccessList.update 0 "bb"|> AltBinaryRandomAccessList.lookup 0) = "bb") && ((len2 |> AltBinaryRandomAccessList.update 1 "aa"|> AltBinaryRandomAccessList.lookup 1) = "aa")) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.update length 3" { + (((len3 |> AltBinaryRandomAccessList.update 0 "cc"|> AltBinaryRandomAccessList.lookup 0) = "cc") && ((len3 |> AltBinaryRandomAccessList.update 1 "bb"|> AltBinaryRandomAccessList.lookup 1) = "bb") + && ((len3 |> AltBinaryRandomAccessList.update 2 "aa"|> AltBinaryRandomAccessList.lookup 2) = "aa")) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.update length 4" { + (((len4 |> AltBinaryRandomAccessList.update 0 "dd"|> AltBinaryRandomAccessList.lookup 0) = "dd") && ((len4 |> AltBinaryRandomAccessList.update 1 "cc"|> AltBinaryRandomAccessList.lookup 1) = "cc") + && ((len4 |> AltBinaryRandomAccessList.update 2 "bb"|> AltBinaryRandomAccessList.lookup 2) = "bb") && ((len4 |> AltBinaryRandomAccessList.update 3 "aa"|> AltBinaryRandomAccessList.lookup 3) = "aa")) + |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.update length 5" { + (((len5 |> AltBinaryRandomAccessList.update 0 "ee"|> AltBinaryRandomAccessList.lookup 0) = "ee") && ((len5 |> AltBinaryRandomAccessList.update 1 "dd"|> AltBinaryRandomAccessList.lookup 1) = "dd") + && ((len5 |> AltBinaryRandomAccessList.update 2 "cc"|> AltBinaryRandomAccessList.lookup 2) = "cc") && ((len5 |> AltBinaryRandomAccessList.update 3 "bb"|> AltBinaryRandomAccessList.lookup 3) = "bb") + && ((len5 |> AltBinaryRandomAccessList.update 4 "aa"|> AltBinaryRandomAccessList.lookup 4) = "aa")) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.update length 6" { + (((len6 |> AltBinaryRandomAccessList.update 0 "ff"|> AltBinaryRandomAccessList.lookup 0) = "ff") && ((len6 |> AltBinaryRandomAccessList.update 1 "ee"|> AltBinaryRandomAccessList.lookup 1) = "ee") + && ((len6 |> AltBinaryRandomAccessList.update 2 "dd"|> AltBinaryRandomAccessList.lookup 2) = "dd") && ((len6 |> AltBinaryRandomAccessList.update 3 "cc"|> AltBinaryRandomAccessList.lookup 3) = "cc") + && ((len6 |> AltBinaryRandomAccessList.update 4 "bb"|> AltBinaryRandomAccessList.lookup 4) = "bb") && ((len6 |> AltBinaryRandomAccessList.update 5 "aa"|> AltBinaryRandomAccessList.lookup 5) = "aa")) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.update length 7" { + (((len7 |> AltBinaryRandomAccessList.update 0 "gg"|> AltBinaryRandomAccessList.lookup 0) = "gg") && ((len7 |> AltBinaryRandomAccessList.update 1 "ff"|> AltBinaryRandomAccessList.lookup 1) = "ff") + && ((len7 |> AltBinaryRandomAccessList.update 2 "ee"|> AltBinaryRandomAccessList.lookup 2) = "ee") && ((len7 |> AltBinaryRandomAccessList.update 3 "dd"|> AltBinaryRandomAccessList.lookup 3) = "dd") + && ((len7 |> AltBinaryRandomAccessList.update 4 "cc"|> AltBinaryRandomAccessList.lookup 4) = "cc") && ((len7 |> AltBinaryRandomAccessList.update 5 "bb"|> AltBinaryRandomAccessList.lookup 5) = "bb") + && ((len7 |> AltBinaryRandomAccessList.update 6 "aa"|> AltBinaryRandomAccessList.lookup 6) = "aa")) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.update length 8" { + (((len8 |> AltBinaryRandomAccessList.update 0 "hh"|> AltBinaryRandomAccessList.lookup 0) = "hh") && ((len8 |> AltBinaryRandomAccessList.update 1 "gg"|> AltBinaryRandomAccessList.lookup 1) = "gg") + && ((len8 |> AltBinaryRandomAccessList.update 2 "ff"|> AltBinaryRandomAccessList.lookup 2) = "ff") && ((len8 |> AltBinaryRandomAccessList.update 3 "ee"|> AltBinaryRandomAccessList.lookup 3) = "ee") + && ((len8 |> AltBinaryRandomAccessList.update 4 "dd"|> AltBinaryRandomAccessList.lookup 4) = "dd") && ((len8 |> AltBinaryRandomAccessList.update 5 "cc"|> AltBinaryRandomAccessList.lookup 5) = "cc") + && ((len8 |> AltBinaryRandomAccessList.update 6 "bb"|> AltBinaryRandomAccessList.lookup 6) = "bb") && ((len8 |> AltBinaryRandomAccessList.update 7 "aa"|> AltBinaryRandomAccessList.lookup 7) = "aa")) + |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.update length 9" { + (((len9 |> AltBinaryRandomAccessList.update 0 "ii"|> AltBinaryRandomAccessList.lookup 0) = "ii") && ((len9 |> AltBinaryRandomAccessList.update 1 "hh"|> AltBinaryRandomAccessList.lookup 1) = "hh") + && ((len9 |> AltBinaryRandomAccessList.update 2 "gg"|> AltBinaryRandomAccessList.lookup 2) = "gg") && ((len9 |> AltBinaryRandomAccessList.update 3 "ff"|> AltBinaryRandomAccessList.lookup 3) = "ff") + && ((len9 |> AltBinaryRandomAccessList.update 4 "ee"|> AltBinaryRandomAccessList.lookup 4) = "ee") && ((len9 |> AltBinaryRandomAccessList.update 5 "dd"|> AltBinaryRandomAccessList.lookup 5) = "dd") + && ((len9 |> AltBinaryRandomAccessList.update 6 "cc"|> AltBinaryRandomAccessList.lookup 6) = "cc") && ((len9 |> AltBinaryRandomAccessList.update 7 "bb"|> AltBinaryRandomAccessList.lookup 7) = "bb") + && ((len9 |> AltBinaryRandomAccessList.update 8 "aa"|> AltBinaryRandomAccessList.lookup 8) = "aa")) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.update length 10" { + (((lena |> AltBinaryRandomAccessList.update 0 "jj"|> AltBinaryRandomAccessList.lookup 0) = "jj") && ((lena |> AltBinaryRandomAccessList.update 1 "ii"|> AltBinaryRandomAccessList.lookup 1) = "ii") + && ((lena |> AltBinaryRandomAccessList.update 2 "hh"|> AltBinaryRandomAccessList.lookup 2) = "hh") && ((lena |> AltBinaryRandomAccessList.update 3 "gg"|> AltBinaryRandomAccessList.lookup 3) = "gg") + && ((lena |> AltBinaryRandomAccessList.update 4 "ff"|> AltBinaryRandomAccessList.lookup 4) = "ff") && ((lena |> AltBinaryRandomAccessList.update 5 "ee"|> AltBinaryRandomAccessList.lookup 5) = "ee") + && ((lena |> AltBinaryRandomAccessList.update 6 "dd"|> AltBinaryRandomAccessList.lookup 6) = "dd") && ((lena |> AltBinaryRandomAccessList.update 7 "cc"|> AltBinaryRandomAccessList.lookup 7) = "cc") + && ((lena |> AltBinaryRandomAccessList.update 8 "bb"|> AltBinaryRandomAccessList.lookup 8) = "bb") && ((lena |> AltBinaryRandomAccessList.update 9 "aa"|> AltBinaryRandomAccessList.lookup 9) = "aa")) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.tryUpdate length 1" { + let a = len1 |> AltBinaryRandomAccessList.tryUpdate 0 "aa" + ((a.Value |> AltBinaryRandomAccessList.lookup 0) = "aa") |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.tryUpdate length 2" { + let b = len2 |> AltBinaryRandomAccessList.tryUpdate 0 "bb" + let a = len2 |> AltBinaryRandomAccessList.tryUpdate 1 "aa" + (((b.Value |> AltBinaryRandomAccessList.lookup 0) = "bb") && ((a.Value |> AltBinaryRandomAccessList.lookup 1) = "aa")) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.tryUpdate length 3" { + let c = len3 |> AltBinaryRandomAccessList.tryUpdate 0 "cc" + let b = len3 |> AltBinaryRandomAccessList.tryUpdate 1 "bb" + let a = len3 |> AltBinaryRandomAccessList.tryUpdate 2 "aa" + (((c.Value |> AltBinaryRandomAccessList.lookup 0) = "cc") && ((b.Value |> AltBinaryRandomAccessList.lookup 1) = "bb") && ((a.Value |> AltBinaryRandomAccessList.lookup 2) = "aa")) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.tryUpdate length 4" { + let d = len4 |> AltBinaryRandomAccessList.tryUpdate 0 "dd" + let c = len4 |> AltBinaryRandomAccessList.tryUpdate 1 "cc" + let b = len4 |> AltBinaryRandomAccessList.tryUpdate 2 "bb" + let a = len4 |> AltBinaryRandomAccessList.tryUpdate 3 "aa" + (((d.Value |> AltBinaryRandomAccessList.lookup 0) = "dd") && ((c.Value |> AltBinaryRandomAccessList.lookup 1) = "cc") && ((b.Value |> AltBinaryRandomAccessList.lookup 2) = "bb") + && ((a.Value |> AltBinaryRandomAccessList.lookup 3) = "aa")) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.tryUpdate length 5" { + let e = len5 |> AltBinaryRandomAccessList.tryUpdate 0 "ee" + let d = len5 |> AltBinaryRandomAccessList.tryUpdate 1 "dd" + let c = len5 |> AltBinaryRandomAccessList.tryUpdate 2 "cc" + let b = len5 |> AltBinaryRandomAccessList.tryUpdate 3 "bb" + let a = len5 |> AltBinaryRandomAccessList.tryUpdate 4 "aa" + (((e.Value |> AltBinaryRandomAccessList.lookup 0) = "ee") && ((d.Value |> AltBinaryRandomAccessList.lookup 1) = "dd") && ((c.Value |> AltBinaryRandomAccessList.lookup 2) = "cc") + && ((b.Value |> AltBinaryRandomAccessList.lookup 3) = "bb") && ((a.Value |> AltBinaryRandomAccessList.lookup 4) = "aa")) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.tryUpdate length 6" { + let f = len6 |> AltBinaryRandomAccessList.tryUpdate 0 "ff" + let e = len6 |> AltBinaryRandomAccessList.tryUpdate 1 "ee" + let d = len6 |> AltBinaryRandomAccessList.tryUpdate 2 "dd" + let c = len6 |> AltBinaryRandomAccessList.tryUpdate 3 "cc" + let b = len6 |> AltBinaryRandomAccessList.tryUpdate 4 "bb" + let a = len6 |> AltBinaryRandomAccessList.tryUpdate 5 "aa" + (((f.Value |> AltBinaryRandomAccessList.lookup 0) = "ff") && ((e.Value |> AltBinaryRandomAccessList.lookup 1) = "ee") && ((d.Value |> AltBinaryRandomAccessList.lookup 2) = "dd") + && ((c.Value |> AltBinaryRandomAccessList.lookup 3) = "cc") && ((b.Value |> AltBinaryRandomAccessList.lookup 4) = "bb") && ((a.Value |> AltBinaryRandomAccessList.lookup 5) = "aa")) + |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.tryUpdate length 7" { + let g = len7 |> AltBinaryRandomAccessList.tryUpdate 0 "gg" + let f = len7 |> AltBinaryRandomAccessList.tryUpdate 1 "ff" + let e = len7 |> AltBinaryRandomAccessList.tryUpdate 2 "ee" + let d = len7 |> AltBinaryRandomAccessList.tryUpdate 3 "dd" + let c = len7 |> AltBinaryRandomAccessList.tryUpdate 4 "cc" + let b = len7 |> AltBinaryRandomAccessList.tryUpdate 5 "bb" + let a = len7 |> AltBinaryRandomAccessList.tryUpdate 6 "aa" + (((g.Value |> AltBinaryRandomAccessList.lookup 0) = "gg") && ((f.Value |> AltBinaryRandomAccessList.lookup 1) = "ff") && ((e.Value |> AltBinaryRandomAccessList.lookup 2) = "ee") + && ((d.Value |> AltBinaryRandomAccessList.lookup 3) = "dd") && ((c.Value |> AltBinaryRandomAccessList.lookup 4) = "cc") && ((b.Value |> AltBinaryRandomAccessList.lookup 5) = "bb") + && ((a.Value |> AltBinaryRandomAccessList.lookup 6) = "aa")) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.tryUpdate length 8" { + let h = len8 |> AltBinaryRandomAccessList.tryUpdate 0 "hh" + let g = len8 |> AltBinaryRandomAccessList.tryUpdate 1 "gg" + let f = len8 |> AltBinaryRandomAccessList.tryUpdate 2 "ff" + let e = len8 |> AltBinaryRandomAccessList.tryUpdate 3 "ee" + let d = len8 |> AltBinaryRandomAccessList.tryUpdate 4 "dd" + let c = len8 |> AltBinaryRandomAccessList.tryUpdate 5 "cc" + let b = len8 |> AltBinaryRandomAccessList.tryUpdate 6 "bb" + let a = len8 |> AltBinaryRandomAccessList.tryUpdate 7 "aa" + (((h.Value |> AltBinaryRandomAccessList.lookup 0) = "hh") && ((g.Value |> AltBinaryRandomAccessList.lookup 1) = "gg") && ((f.Value |> AltBinaryRandomAccessList.lookup 2) = "ff") + && ((e.Value |> AltBinaryRandomAccessList.lookup 3) = "ee") && ((d.Value |> AltBinaryRandomAccessList.lookup 4) = "dd") && ((c.Value |> AltBinaryRandomAccessList.lookup 5) = "cc") + && ((b.Value |> AltBinaryRandomAccessList.lookup 6) = "bb")&& ((a.Value |> AltBinaryRandomAccessList.lookup 7) = "aa")) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.tryUpdate length 9" { + let i = len9 |> AltBinaryRandomAccessList.tryUpdate 0 "ii" + let h = len9 |> AltBinaryRandomAccessList.tryUpdate 1 "hh" + let g = len9 |> AltBinaryRandomAccessList.tryUpdate 2 "gg" + let f = len9 |> AltBinaryRandomAccessList.tryUpdate 3 "ff" + let e = len9 |> AltBinaryRandomAccessList.tryUpdate 4 "ee" + let d = len9 |> AltBinaryRandomAccessList.tryUpdate 5 "dd" + let c = len9 |> AltBinaryRandomAccessList.tryUpdate 6 "cc" + let b = len9 |> AltBinaryRandomAccessList.tryUpdate 7 "bb" + let a = len9 |> AltBinaryRandomAccessList.tryUpdate 8 "aa" + (((i.Value |> AltBinaryRandomAccessList.lookup 0) = "ii") && ((h.Value |> AltBinaryRandomAccessList.lookup 1) = "hh") && ((g.Value |> AltBinaryRandomAccessList.lookup 2) = "gg") + && ((f.Value |> AltBinaryRandomAccessList.lookup 3) = "ff") && ((e.Value |> AltBinaryRandomAccessList.lookup 4) = "ee") && ((d.Value |> AltBinaryRandomAccessList.lookup 5) = "dd") + && ((c.Value |> AltBinaryRandomAccessList.lookup 6) = "cc") && ((b.Value |> AltBinaryRandomAccessList.lookup 7) = "bb")&& ((a.Value |> AltBinaryRandomAccessList.lookup 8) = "aa")) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.tryUpdate length 10" { + let j = lena |> AltBinaryRandomAccessList.tryUpdate 0 "jj" + let i = lena |> AltBinaryRandomAccessList.tryUpdate 1 "ii" + let h = lena |> AltBinaryRandomAccessList.tryUpdate 2 "hh" + let g = lena |> AltBinaryRandomAccessList.tryUpdate 3 "gg" + let f = lena |> AltBinaryRandomAccessList.tryUpdate 4 "ff" + let e = lena |> AltBinaryRandomAccessList.tryUpdate 5 "ee" + let d = lena |> AltBinaryRandomAccessList.tryUpdate 6 "dd" + let c = lena |> AltBinaryRandomAccessList.tryUpdate 7 "cc" + let b = lena |> AltBinaryRandomAccessList.tryUpdate 8 "bb" + let a = lena |> AltBinaryRandomAccessList.tryUpdate 9 "aa" + (((j.Value |> AltBinaryRandomAccessList.lookup 0) = "jj") && ((i.Value |> AltBinaryRandomAccessList.lookup 1) = "ii") && ((h.Value |> AltBinaryRandomAccessList.lookup 2) = "hh") + && ((g.Value |> AltBinaryRandomAccessList.lookup 3) = "gg") && ((f.Value |> AltBinaryRandomAccessList.lookup 4) = "ff") && ((e.Value |> AltBinaryRandomAccessList.lookup 5) = "ee") + && ((d.Value |> AltBinaryRandomAccessList.lookup 6) = "dd") && ((c.Value |> AltBinaryRandomAccessList.lookup 7) = "cc") && ((b.Value |> AltBinaryRandomAccessList.lookup 8) = "bb") + && ((a.Value |> AltBinaryRandomAccessList.lookup 9) = "aa")) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.remove elements length 1" { + AltBinaryRandomAccessList.isEmpty (len1 |> AltBinaryRandomAccessList.remove 0) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.remove elements length 2" { + let a = + match (len2 |> AltBinaryRandomAccessList.remove 0) with + | One(("a"),Nil) -> true + | _ -> false + + let b = + match (len2 |> AltBinaryRandomAccessList.remove 1) with + | One(("b"),Nil) -> true + | _ -> false + + (a && b) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.remove elements length 3" { + let a = + match (len3 |> AltBinaryRandomAccessList.remove 0) with + | Zero(One(("b","a"),Nil)) -> true + | _ -> false + + let b = + match (len3 |> AltBinaryRandomAccessList.remove 1) with + | Zero (One(("c","a"),Nil)) -> true + | _ -> false + + let c = + match (len3 |> AltBinaryRandomAccessList.remove 2) with + | Zero (One(("c","b"),Nil)) -> true + | _ -> false + + (a && b && c) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.remove elements length 4" { + let a = + match (len4 |> AltBinaryRandomAccessList.remove 0) with + | One ("c",One(("b","a"),Nil)) -> true + | _ -> false + + let b = + match (len4 |> AltBinaryRandomAccessList.remove 1) with + | One ("d",One(("b","a"),Nil)) -> true + | _ -> false + + let c = + match (len4 |> AltBinaryRandomAccessList.remove 2) with + | One ("d",One(("c","a"),Nil)) -> true + | _ -> false + + let d = + match (len4 |> AltBinaryRandomAccessList.remove 3) with + | One ("d",One(("c","b"),Nil)) -> true + | _ -> false + + (a && b && c && d) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.remove elements length 5" { + let a = + match (len5 |> AltBinaryRandomAccessList.remove 0) with + | Zero(Zero(One((("d","c"),("b","a")),Nil))) -> true + | _ -> false + + let b = + match (len5 |> AltBinaryRandomAccessList.remove 1) with + | Zero(Zero(One((("e","c"),("b","a")),Nil))) -> true + | _ -> false + + let c = + match (len5 |> AltBinaryRandomAccessList.remove 2) with + | Zero(Zero(One((("e","d"),("b","a")),Nil))) -> true + | _ -> false + + let d = + match (len5 |> AltBinaryRandomAccessList.remove 3) with + | Zero(Zero(One((("e","d"),("c","a")),Nil))) -> true + | _ -> false + + let e = + match (len5 |> AltBinaryRandomAccessList.remove 4) with + | Zero(Zero(One((("e","d"),("c","b")),Nil))) -> true + | _ -> false + + (a && b && c && d && e) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.remove elements length 6" { + let a = + match (len6 |> AltBinaryRandomAccessList.remove 0) with + | One("e",Zero(One((("d","c"),("b","a")),Nil))) -> true + | _ -> false + + let b = + match (len6 |> AltBinaryRandomAccessList.remove 1) with + | One("f",Zero(One((("d","c"),("b","a")),Nil))) -> true + | _ -> false + + let c = + match (len6 |> AltBinaryRandomAccessList.remove 2) with + | One("f",Zero(One((("e","c"),("b","a")),Nil))) -> true + | _ -> false + + let d = + match (len6 |> AltBinaryRandomAccessList.remove 3) with + | One("f",Zero(One((("e","d"),("b","a")),Nil))) -> true + | _ -> false + + let e = + match (len6 |> AltBinaryRandomAccessList.remove 4) with + | One("f",Zero(One((("e","d"),("c","a")),Nil))) -> true + | _ -> false + + let f = + match (len6 |> AltBinaryRandomAccessList.remove 5) with + | One("f",Zero(One((("e","d"),("c","b")),Nil))) -> true + | _ -> false + + (a && b && c && d && e && f) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.remove elements length 7" { + let a = + match (len7 |> AltBinaryRandomAccessList.remove 0) with + | Zero(One(("f","e"),One((("d","c"),("b","a")),Nil))) -> true + | _ -> false + + let b = + match (len7 |> AltBinaryRandomAccessList.remove 1) with + | Zero(One(("g","e"),One((("d","c"),("b","a")),Nil))) -> true + | _ -> false + + let c = + match (len7 |> AltBinaryRandomAccessList.remove 2) with + | Zero(One(("g","f"),One((("d","c"),("b","a")),Nil))) -> true + | _ -> false + + let d = + match (len7 |> AltBinaryRandomAccessList.remove 3) with + | Zero(One(("g","f"),One((("e","c"),("b","a")),Nil))) -> true + | _ -> false + + let e = + match (len7 |> AltBinaryRandomAccessList.remove 4) with + | Zero(One(("g","f"),One((("e","d"),("b","a")),Nil))) -> true + | _ -> false + + let f = + match (len7 |> AltBinaryRandomAccessList.remove 5) with + | Zero(One(("g","f"),One((("e","d"),("c","a")),Nil))) -> true + | _ -> false + + let g = + match (len7 |> AltBinaryRandomAccessList.remove 6) with + | Zero(One(("g","f"),One((("e","d"),("c","b")),Nil))) -> true + | _ -> false + + (a && b && c && d && e && f && g) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.remove elements length 8" { + let a = + match (len8 |> AltBinaryRandomAccessList.remove 0) with + | One("g",One(("f","e"),One((("d","c"),("b","a")),Nil))) -> true + | _ -> false + + let b = + match (len8 |> AltBinaryRandomAccessList.remove 1) with + | One("h",One(("f","e"),One((("d","c"),("b","a")),Nil))) -> true + | _ -> false + + let c = + match (len8 |> AltBinaryRandomAccessList.remove 2) with + | One("h",One(("g","e"),One((("d","c"),("b","a")),Nil))) -> true + | _ -> false + + let d = + match (len8 |> AltBinaryRandomAccessList.remove 3) with + | One("h",One(("g","f"),One((("d","c"),("b","a")),Nil))) -> true + | _ -> false + + let e = + match (len8 |> AltBinaryRandomAccessList.remove 4) with + | One("h",One(("g","f"),One((("e","c"),("b","a")),Nil))) -> true + | _ -> false + + let f = + match (len8 |> AltBinaryRandomAccessList.remove 5) with + | One("h",One(("g","f"),One((("e","d"),("b","a")),Nil))) -> true + | _ -> false + + let g = + match (len8 |> AltBinaryRandomAccessList.remove 6) with + | One("h",One(("g","f"),One((("e","d"),("c","a")),Nil))) -> true + | _ -> false + + let h = + match (len8 |> AltBinaryRandomAccessList.remove 7) with + | One("h",One(("g","f"),One((("e","d"),("c","b")),Nil))) -> true + | _ -> false + + (a && b && c && d && e && f && g && h) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.remove elements length 9" { + let a = + match (len9 |> AltBinaryRandomAccessList.remove 0) with + | Zero(Zero(Zero(One(((("h","g"),("f","e")),(("d","c"),("b","a"))),Nil)))) -> true + | _ -> false + + let b = + match (len9 |> AltBinaryRandomAccessList.remove 1) with + | Zero(Zero(Zero(One(((("i","g"),("f","e")),(("d","c"),("b","a"))),Nil)))) -> true + | _ -> false + + let c = + match (len9 |> AltBinaryRandomAccessList.remove 2) with + | Zero(Zero(Zero(One(((("i","h"),("f","e")),(("d","c"),("b","a"))),Nil)))) -> true + | _ -> false + + let d = + match (len9 |> AltBinaryRandomAccessList.remove 3) with + | Zero(Zero(Zero(One(((("i","h"),("g","e")),(("d","c"),("b","a"))),Nil)))) -> true + | _ -> false + + let e = + match (len9 |> AltBinaryRandomAccessList.remove 4) with + | Zero(Zero(Zero(One(((("i","h"),("g","f")),(("d","c"),("b","a"))),Nil)))) -> true + | _ -> false + + let f = + match (len9 |> AltBinaryRandomAccessList.remove 5) with + | Zero(Zero(Zero(One(((("i","h"),("g","f")),(("e","c"),("b","a"))),Nil)))) -> true + | _ -> false + + let g = + match (len9 |> AltBinaryRandomAccessList.remove 6) with + | Zero(Zero(Zero(One(((("i","h"),("g","f")),(("e","d"),("b","a"))),Nil)))) -> true + | _ -> false + + let h = + match (len9 |> AltBinaryRandomAccessList.remove 7) with + | Zero(Zero(Zero(One(((("i","h"),("g","f")),(("e","d"),("c","a"))),Nil)))) -> true + | _ -> false + + let i = + match (len9 |> AltBinaryRandomAccessList.remove 8) with + | Zero(Zero(Zero(One(((("i","h"),("g","f")),(("e","d"),("c","b"))),Nil)))) -> true + | _ -> false + + (a && b && c && d && e && f && g && h && i) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.remove elements length 10" { + let a = + match (lena |> AltBinaryRandomAccessList.remove 0) with + | One("i",Zero(Zero(One(((("h","g"),("f","e")),(("d","c"),("b","a"))),Nil)))) -> true + | _ -> false + + let b = + match (lena |> AltBinaryRandomAccessList.remove 1) with + | One("j",Zero(Zero(One(((("h","g"),("f","e")),(("d","c"),("b","a"))),Nil)))) -> true + | _ -> false + + let c = + match (lena |> AltBinaryRandomAccessList.remove 2) with + | One("j",Zero(Zero(One(((("i","g"),("f","e")),(("d","c"),("b","a"))),Nil)))) -> true + | _ -> false + + let d = + match (lena |> AltBinaryRandomAccessList.remove 3) with + | One("j",Zero(Zero(One(((("i","h"),("f","e")),(("d","c"),("b","a"))),Nil)))) -> true + | _ -> false + + let e = + match (lena |> AltBinaryRandomAccessList.remove 4) with + | One("j",Zero(Zero(One(((("i","h"),("g","e")),(("d","c"),("b","a"))),Nil)))) -> true + | _ -> false + + let f = + match (lena |> AltBinaryRandomAccessList.remove 5) with + | One("j",Zero(Zero(One(((("i","h"),("g","f")),(("d","c"),("b","a"))),Nil)))) -> true + | _ -> false + + let g = + match (lena |> AltBinaryRandomAccessList.remove 6) with + | One("j",Zero(Zero(One(((("i","h"),("g","f")),(("e","c"),("b","a"))),Nil)))) -> true + | _ -> false + + let h = + match (lena |> AltBinaryRandomAccessList.remove 7) with + | One("j",Zero(Zero(One(((("i","h"),("g","f")),(("e","d"),("b","a"))),Nil)))) -> true + | _ -> false + + let i = + match (lena |> AltBinaryRandomAccessList.remove 8) with + | One("j",Zero(Zero(One(((("i","h"),("g","f")),(("e","d"),("c","a"))),Nil)))) -> true + | _ -> false + + let j = + match (lena |> AltBinaryRandomAccessList.remove 9) with + | One("j",Zero(Zero(One(((("i","h"),("g","f")),(("e","d"),("c","b"))),Nil)))) -> true + | _ -> false + + (a && b && c && d && e && f && g && h && i && j) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.tryRemove elements length 1" { + let a = AltBinaryRandomAccessList.tryRemove 0 len1 + (AltBinaryRandomAccessList.isEmpty a.Value) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.tryRemove elements length 2" { + let a = + match (len2 |> AltBinaryRandomAccessList.tryRemove 0) with + | Some(One(("a"),Nil)) -> true + | _ -> false + + let b = + match (len2 |> AltBinaryRandomAccessList.tryRemove 1) with + | Some(One(("b"),Nil)) -> true + | _ -> false + + (a && b) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.tryRemove elements length 3" { + let a = + match (len3 |> AltBinaryRandomAccessList.tryRemove 0) with + | Some(Zero(One(("b","a"),Nil))) -> true + | _ -> false + + let b = + match (len3 |> AltBinaryRandomAccessList.tryRemove 1) with + | Some(Zero (One(("c","a"),Nil))) -> true + | _ -> false + + let c = + match (len3 |> AltBinaryRandomAccessList.tryRemove 2) with + | Some(Zero (One(("c","b"),Nil))) -> true + | _ -> false + + (a && b && c) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.tryRemove elements length 4" { + let a = + match (len4 |> AltBinaryRandomAccessList.tryRemove 0) with + | Some(One ("c",One(("b","a"),Nil))) -> true + | _ -> false + + let b = + match (len4 |> AltBinaryRandomAccessList.tryRemove 1) with + | Some(One ("d",One(("b","a"),Nil))) -> true + | _ -> false + + let c = + match (len4 |> AltBinaryRandomAccessList.tryRemove 2) with + | Some(One ("d",One(("c","a"),Nil))) -> true + | _ -> false + + let d = + match (len4 |> AltBinaryRandomAccessList.tryRemove 3) with + | Some(One ("d",One(("c","b"),Nil))) -> true + | _ -> false + + (a && b && c && d) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.tryRemove elements length 5" { + let a = + match (len5 |> AltBinaryRandomAccessList.tryRemove 0) with + | Some(Zero(Zero(One((("d","c"),("b","a")),Nil)))) -> true + | _ -> false + + let b = + match (len5 |> AltBinaryRandomAccessList.tryRemove 1) with + | Some(Zero(Zero(One((("e","c"),("b","a")),Nil)))) -> true + | _ -> false + + let c = + match (len5 |> AltBinaryRandomAccessList.tryRemove 2) with + | Some(Zero(Zero(One((("e","d"),("b","a")),Nil)))) -> true + | _ -> false + + let d = + match (len5 |> AltBinaryRandomAccessList.tryRemove 3) with + | Some(Zero(Zero(One((("e","d"),("c","a")),Nil)))) -> true + | _ -> false + + let e = + match (len5 |> AltBinaryRandomAccessList.tryRemove 4) with + | Some(Zero(Zero(One((("e","d"),("c","b")),Nil)))) -> true + | _ -> false + + (a && b && c && d && e) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.tryRemove elements length 6" { + let a = + match (len6 |> AltBinaryRandomAccessList.tryRemove 0) with + | Some(One("e",Zero(One((("d","c"),("b","a")),Nil)))) -> true + | _ -> false + + let b = + match (len6 |> AltBinaryRandomAccessList.tryRemove 1) with + | Some(One("f",Zero(One((("d","c"),("b","a")),Nil)))) -> true + | _ -> false + + let c = + match (len6 |> AltBinaryRandomAccessList.tryRemove 2) with + | Some(One("f",Zero(One((("e","c"),("b","a")),Nil)))) -> true + | _ -> false + + let d = + match (len6 |> AltBinaryRandomAccessList.tryRemove 3) with + | Some(One("f",Zero(One((("e","d"),("b","a")),Nil)))) -> true + | _ -> false + + let e = + match (len6 |> AltBinaryRandomAccessList.tryRemove 4) with + | Some(One("f",Zero(One((("e","d"),("c","a")),Nil)))) -> true + | _ -> false + + let f = + match (len6 |> AltBinaryRandomAccessList.tryRemove 5) with + | Some(One("f",Zero(One((("e","d"),("c","b")),Nil)))) -> true + | _ -> false + + (a && b && c && d && e && f) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.tryRemove elements length 7" { + let a = + match (len7 |> AltBinaryRandomAccessList.tryRemove 0) with + | Some(Zero(One(("f","e"),One((("d","c"),("b","a")),Nil)))) -> true + | _ -> false + + let b = + match (len7 |> AltBinaryRandomAccessList.tryRemove 1) with + | Some(Zero(One(("g","e"),One((("d","c"),("b","a")),Nil)))) -> true + | _ -> false + + let c = + match (len7 |> AltBinaryRandomAccessList.tryRemove 2) with + | Some(Zero(One(("g","f"),One((("d","c"),("b","a")),Nil)))) -> true + | _ -> false + + let d = + match (len7 |> AltBinaryRandomAccessList.tryRemove 3) with + | Some(Zero(One(("g","f"),One((("e","c"),("b","a")),Nil)))) -> true + | _ -> false + + let e = + match (len7 |> AltBinaryRandomAccessList.tryRemove 4) with + | Some(Zero(One(("g","f"),One((("e","d"),("b","a")),Nil)))) -> true + | _ -> false + + let f = + match (len7 |> AltBinaryRandomAccessList.tryRemove 5) with + | Some(Zero(One(("g","f"),One((("e","d"),("c","a")),Nil)))) -> true + | _ -> false + + let g = + match (len7 |> AltBinaryRandomAccessList.tryRemove 6) with + | Some(Zero(One(("g","f"),One((("e","d"),("c","b")),Nil)))) -> true + | _ -> false + + (a && b && c && d && e && f && g) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.tryRemove elements length 8" { + let a = + match (len8 |> AltBinaryRandomAccessList.tryRemove 0) with + | Some(One("g",One(("f","e"),One((("d","c"),("b","a")),Nil)))) -> true + | _ -> false + + let b = + match (len8 |> AltBinaryRandomAccessList.tryRemove 1) with + | Some(One("h",One(("f","e"),One((("d","c"),("b","a")),Nil)))) -> true + | _ -> false + + let c = + match (len8 |> AltBinaryRandomAccessList.tryRemove 2) with + | Some(One("h",One(("g","e"),One((("d","c"),("b","a")),Nil)))) -> true + | _ -> false + + let d = + match (len8 |> AltBinaryRandomAccessList.tryRemove 3) with + | Some(One("h",One(("g","f"),One((("d","c"),("b","a")),Nil)))) -> true + | _ -> false + + let e = + match (len8 |> AltBinaryRandomAccessList.tryRemove 4) with + | Some(One("h",One(("g","f"),One((("e","c"),("b","a")),Nil)))) -> true + | _ -> false + + let f = + match (len8 |> AltBinaryRandomAccessList.tryRemove 5) with + | Some(One("h",One(("g","f"),One((("e","d"),("b","a")),Nil)))) -> true + | _ -> false + + let g = + match (len8 |> AltBinaryRandomAccessList.tryRemove 6) with + | Some(One("h",One(("g","f"),One((("e","d"),("c","a")),Nil)))) -> true + | _ -> false + + let h = + match (len8 |> AltBinaryRandomAccessList.tryRemove 7) with + | Some(One("h",One(("g","f"),One((("e","d"),("c","b")),Nil)))) -> true + | _ -> false + + (a && b && c && d && e && f && g && h) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.tryRemove elements length 9" { + let a = + match (len9 |> AltBinaryRandomAccessList.tryRemove 0) with + | Some(Zero(Zero(Zero(One(((("h","g"),("f","e")),(("d","c"),("b","a"))),Nil))))) -> true + | _ -> false + + let b = + match (len9 |> AltBinaryRandomAccessList.tryRemove 1) with + | Some(Zero(Zero(Zero(One(((("i","g"),("f","e")),(("d","c"),("b","a"))),Nil))))) -> true + | _ -> false + + let c = + match (len9 |> AltBinaryRandomAccessList.tryRemove 2) with + | Some(Zero(Zero(Zero(One(((("i","h"),("f","e")),(("d","c"),("b","a"))),Nil))))) -> true + | _ -> false + + let d = + match (len9 |> AltBinaryRandomAccessList.tryRemove 3) with + | Some(Zero(Zero(Zero(One(((("i","h"),("g","e")),(("d","c"),("b","a"))),Nil))))) -> true + | _ -> false + + let e = + match (len9 |> AltBinaryRandomAccessList.tryRemove 4) with + | Some(Zero(Zero(Zero(One(((("i","h"),("g","f")),(("d","c"),("b","a"))),Nil))))) -> true + | _ -> false + + let f = + match (len9 |> AltBinaryRandomAccessList.tryRemove 5) with + | Some(Zero(Zero(Zero(One(((("i","h"),("g","f")),(("e","c"),("b","a"))),Nil))))) -> true + | _ -> false + + let g = + match (len9 |> AltBinaryRandomAccessList.tryRemove 6) with + | Some(Zero(Zero(Zero(One(((("i","h"),("g","f")),(("e","d"),("b","a"))),Nil))))) -> true + | _ -> false + + let h = + match (len9 |> AltBinaryRandomAccessList.tryRemove 7) with + | Some(Zero(Zero(Zero(One(((("i","h"),("g","f")),(("e","d"),("c","a"))),Nil))))) -> true + | _ -> false + + let i = + match (len9 |> AltBinaryRandomAccessList.tryRemove 8) with + | Some(Zero(Zero(Zero(One(((("i","h"),("g","f")),(("e","d"),("c","b"))),Nil))))) -> true + | _ -> false + + (a && b && c && d && e && f && g && h && i) |> Expect.isTrue "" } + + test "AltBinaryRandomAccessList.tryRemove elements length 10" { + let a = + match (lena |> AltBinaryRandomAccessList.tryRemove 0) with + | Some(One("i",Zero(Zero(One(((("h","g"),("f","e")),(("d","c"),("b","a"))),Nil))))) -> true + | _ -> false + + let b = + match (lena |> AltBinaryRandomAccessList.tryRemove 1) with + | Some(One("j",Zero(Zero(One(((("h","g"),("f","e")),(("d","c"),("b","a"))),Nil))))) -> true + | _ -> false + + let c = + match (lena |> AltBinaryRandomAccessList.tryRemove 2) with + | Some(One("j",Zero(Zero(One(((("i","g"),("f","e")),(("d","c"),("b","a"))),Nil))))) -> true + | _ -> false + + let d = + match (lena |> AltBinaryRandomAccessList.tryRemove 3) with + | Some(One("j",Zero(Zero(One(((("i","h"),("f","e")),(("d","c"),("b","a"))),Nil))))) -> true + | _ -> false + + let e = + match (lena |> AltBinaryRandomAccessList.tryRemove 4) with + | Some(One("j",Zero(Zero(One(((("i","h"),("g","e")),(("d","c"),("b","a"))),Nil))))) -> true + | _ -> false + + let f = + match (lena |> AltBinaryRandomAccessList.tryRemove 5) with + | Some(One("j",Zero(Zero(One(((("i","h"),("g","f")),(("d","c"),("b","a"))),Nil))))) -> true + | _ -> false + + let g = + match (lena |> AltBinaryRandomAccessList.tryRemove 6) with + | Some(One("j",Zero(Zero(One(((("i","h"),("g","f")),(("e","c"),("b","a"))),Nil))))) -> true + | _ -> false + + let h = + match (lena |> AltBinaryRandomAccessList.tryRemove 7) with + | Some(One("j",Zero(Zero(One(((("i","h"),("g","f")),(("e","d"),("b","a"))),Nil))))) -> true + | _ -> false + + let i = + match (lena |> AltBinaryRandomAccessList.tryRemove 8) with + | Some(One("j",Zero(Zero(One(((("i","h"),("g","f")),(("e","d"),("c","a"))),Nil))))) -> true + | _ -> false + + let j = + match (lena |> AltBinaryRandomAccessList.tryRemove 9) with + | Some(One("j",Zero(Zero(One(((("i","h"),("g","f")),(("e","d"),("c","b"))),Nil))))) -> true + | _ -> false + + (a && b && c && d && e && f && g && h && i && j) |> Expect.isTrue "" } + + test "length of AltBinaryRandomAccessList.empty is 0" { + ((AltBinaryRandomAccessList.length AltBinaryRandomAccessList.empty) = 0) |> Expect.isTrue "" } + + test "length of 1 - 10 good" { + (((AltBinaryRandomAccessList.length len1) = 1) && ((AltBinaryRandomAccessList.length len2) = 2) && ((AltBinaryRandomAccessList.length len3) = 3) && ((AltBinaryRandomAccessList.length len4) = 4) + && ((AltBinaryRandomAccessList.length len5) = 5) && ((AltBinaryRandomAccessList.length len6) = 6) && ((AltBinaryRandomAccessList.length len7) = 7) && ((AltBinaryRandomAccessList.length len8) = 8) + && ((AltBinaryRandomAccessList.length len9) = 9) && ((AltBinaryRandomAccessList.length lena) = 10)) |> Expect.isTrue "" } + + test "ofSeq" { + let x = AltBinaryRandomAccessList.ofSeq ["a";"b";"c";"d";"e";"f";"g";"h";"i";"j"] + + (((x |> AltBinaryRandomAccessList.lookup 0) = "a") && ((x |> AltBinaryRandomAccessList.lookup 1) = "b") && ((x |> AltBinaryRandomAccessList.lookup 2) = "c") && ((x |> AltBinaryRandomAccessList.lookup 3) = "d") + && ((x |> AltBinaryRandomAccessList.lookup 4) = "e") && ((x |> AltBinaryRandomAccessList.lookup 5) = "f") && ((x |> AltBinaryRandomAccessList.lookup 6) = "g") && ((x |> AltBinaryRandomAccessList.lookup 7) = "h") + && ((x |> AltBinaryRandomAccessList.lookup 8) = "i") && ((x |> AltBinaryRandomAccessList.lookup 9) = "j")) |> Expect.isTrue "" } + + test "IRandomAccessList AltBinaryRandomAccessList.cons works" { + ((lena :> IRandomAccessList).Cons "zz").Head |> Expect.equal "" "zz" } + ] \ No newline at end of file diff --git a/tests/FSharpx.Collections.Experimental.Tests/BKTreeTest.fs b/tests/FSharpx.Collections.Experimental.Tests/BKTreeTest.fs index d8837e20..9bc45bd4 100644 --- a/tests/FSharpx.Collections.Experimental.Tests/BKTreeTest.fs +++ b/tests/FSharpx.Collections.Experimental.Tests/BKTreeTest.fs @@ -1,175 +1,153 @@ -module FSharpx.Collections.Experimental.Tests.BKTreeTest +namespace FSharpx.Collections.Experimental.Tests open FSharpx open FSharpx.Collections.Experimental -open NUnit.Framework -open FsUnit +open FSharpx.Collections.Experimental.Tests.Properties open FsCheck -open FsCheck.NUnit +open Expecto +open Expecto.Flip -let fsCheck t = fsCheck "" t +module BKTreeTest = -let sem tree = tree |> BKTree.toList |> List.sort + let sem tree = tree |> BKTree.toList |> List.sort -let trans f xs = xs |> BKTree.Int.ofList |> f |> sem + let trans f xs = xs |> BKTree.Int.ofList |> f |> sem -let rec inv m = function - | Empty -> true - | BKTree.Node(a, _, map) -> - List.forall (fun (d,b) -> BKTree.Int.distance a b = d) m && - List.forall (fun (d,t) -> inv ((d,a)::m) t) (IntMap.toList map) + let rec inv m = function + | Empty -> true + | BKTree.Node(a, _, map) -> + List.forall (fun (d,b) -> BKTree.Int.distance a b = d) m && + List.forall (fun (d,t) -> inv ((d,a)::m) t) (IntMap.toList map) -let invariant t = inv [] t + let invariant t = inv [] t -[] -let ``native empty``() = - fsCheck <| fun (xs :int list) -> - BKTree.List.distance [] xs = List.length xs && BKTree.List.distance xs [] = List.length xs + let rec removeFirst n = function + | [] -> [] + | x::xs when x = n -> xs + | x::xs -> x :: removeFirst n xs -[] -let ``native cons``() = - fsCheck <| fun (x:int) xs ys -> - BKTree.List.distance (x::xs) (x::ys) = BKTree.List.distance xs ys + [] + let testBKTree = -[] -let ``native diff``() = - fsCheck <| fun (x:int) y xs ys -> - x <> y ==> - (BKTree.List.distance (x::xs) (y::ys) = - 1 + List.min [BKTree.List.distance (x::xs) ys; BKTree.List.distance (x::xs) (x::ys); BKTree.List.distance xs (y::ys)]) + -[] -let empty() = - fsCheck (fun n -> not <| BKTree.Int.exists n BKTree.empty) + testList "Experimental BKTree" [ + testPropertyWithConfig config10k "native empty" <| + fun (xs :int list) -> + BKTree.List.distance [] xs = List.length xs && BKTree.List.distance xs [] = List.length xs -[] -let isEmpty() = - fsCheck (fun xs -> BKTree.isEmpty (BKTree.Int.ofList xs) = List.isEmpty xs) + testPropertyWithConfig config10k "native cons" <| + fun (x:int) xs ys -> + BKTree.List.distance (x::xs) (x::ys) = BKTree.List.distance xs ys -[] -let singleton() = - fsCheck (fun n -> BKTree.toList (BKTree.Int.ofList [n]) = [n]) + testPropertyWithConfig config10k "native diff" <| + fun (x:int) y xs ys -> + x <> y ==> + (BKTree.List.distance (x::xs) (y::ys) = + 1 + List.min [BKTree.List.distance (x::xs) ys; BKTree.List.distance (x::xs) (x::ys); BKTree.List.distance xs (y::ys)]) -[] -let ofList() = - fsCheck (fun xs -> sem (BKTree.Int.ofList xs) = List.sort xs) + testPropertyWithConfig config10k "empty" <| + fun n -> not <| BKTree.Int.exists n BKTree.empty -[] -let ``ofList inv``() = - fsCheck (fun xs -> invariant (BKTree.Int.ofList xs)) + testPropertyWithConfig config10k "isEmpty" <| + fun xs -> BKTree.isEmpty (BKTree.Int.ofList xs) = List.isEmpty xs -[] -let add() = - fsCheck (fun n xs -> trans (BKTree.Int.add n) xs = List.sort (n::xs)) + testPropertyWithConfig config10k "singleton" <| + fun n -> BKTree.toList (BKTree.Int.ofList [n]) = [n] -[] -let ``add inv``() = - fsCheck (fun n xs -> invariant (BKTree.Int.add n (BKTree.Int.ofList xs))) + testPropertyWithConfig config10k "ofList" <| + fun xs -> sem (BKTree.Int.ofList xs) = List.sort xs -[] -let exists() = - fsCheck (fun n xs -> BKTree.Int.exists n (BKTree.Int.ofList xs) = List.exists ((=) n) xs) + testPropertyWithConfig config10k "ofList inv" <| + fun xs -> invariant (BKTree.Int.ofList xs) -[] -let existsDistance() = - fsCheck <| fun dist n xs -> - let d = dist % 5 - let reference = List.exists (fun e -> BKTree.Int.distance n e <= d) xs - Prop.collect reference - (BKTree.Int.existsDistance d n (BKTree.Int.ofList xs) = List.exists (fun e -> BKTree.Int.distance n e <= d) xs) + testPropertyWithConfig config10k "add" <| + fun n xs -> trans (BKTree.Int.add n) xs = List.sort (n::xs) -[] -let delete() = - let rec removeFirst n = function - | [] -> [] - | x::xs when x = n -> xs - | x::xs -> x :: removeFirst n xs - fsCheck (fun n xs -> trans (BKTree.Int.delete n) xs = List.sort (removeFirst n xs)) + testPropertyWithConfig config10k "add inv" <| + fun n xs -> invariant (BKTree.Int.add n (BKTree.Int.ofList xs)) + + testPropertyWithConfig config10k "exists" <| + fun n xs -> BKTree.Int.exists n (BKTree.Int.ofList xs) = List.exists ((=) n) xs + + testPropertyWithConfig config10k "existsDistance" <| + fun dist n xs -> + let d = dist % 5 + let reference = List.exists (fun e -> BKTree.Int.distance n e <= d) xs + Prop.collect reference + (BKTree.Int.existsDistance d n (BKTree.Int.ofList xs) = List.exists (fun e -> BKTree.Int.distance n e <= d) xs) + + testPropertyWithConfig config10k "delete" <| + fun n xs -> trans (BKTree.Int.delete n) xs = List.sort (removeFirst n xs) -[] -let ``delete inv``() = - fsCheck (fun n xs -> invariant (BKTree.Int.delete n (BKTree.Int.ofList xs))) - -[] -let toList() = - fsCheck (fun xs -> List.sort (BKTree.toList (BKTree.Int.ofList xs)) = List.sort xs) - -[] -let toListDistance() = - fsCheck <| fun dist n xs -> - let d = dist % 5 - List.sort (BKTree.Int.toListDistance d n (BKTree.Int.ofList xs)) = - List.sort (List.filter (fun e -> BKTree.Int.distance n e <= d) xs) - -[] -let concat() = - fsCheck (fun xss -> sem (BKTree.Int.concat (List.map BKTree.Int.ofList xss)) = List.sort (List.concat xss)) - -[] -let ``concat inv``() = - fsCheck (fun xss -> invariant (BKTree.Int.concat (List.map BKTree.Int.ofList xss))) - -[] -let append() = - fsCheck <| fun xs ys -> - sem (BKTree.Int.append (BKTree.Int.ofList xs) (BKTree.Int.ofList ys)) = List.sort (List.append xs ys) - -[] -let ``append inv``() = - fsCheck (fun xs ys -> invariant (BKTree.Int.append (BKTree.Int.ofList xs) (BKTree.Int.ofList ys))) - -[] -let ``delete . add = id``() = - fsCheck (fun n xs -> trans ((BKTree.Int.delete n) << (BKTree.Int.add n)) xs = List.sort xs) - -[] -let ``The size of an empty BKTree is 0``() = - fsCheck (fun _ -> BKTree.size BKTree.empty = 0) - -[] -let ``ofList and size``() = - fsCheck (fun xs -> BKTree.size (BKTree.Int.ofList xs) = List.length xs) - -[] -let ``add . size = size + 1``() = - fsCheck <| fun n xs -> - let tree = BKTree.Int.ofList xs - BKTree.size (BKTree.Int.add n tree) = BKTree.size tree + 1 - -[] -let ``delete . size = size - 1``() = - fsCheck <| fun n xs -> - let tree = BKTree.Int.ofList xs - BKTree.size (BKTree.Int.delete n tree) = BKTree.size tree - if BKTree.Int.exists n tree then 1 else 0 - -[] -let ``append and size``() = - fsCheck <| fun xs ys -> - let treeXs = BKTree.Int.ofList xs - let treeYs = BKTree.Int.ofList ys - BKTree.size (BKTree.Int.append treeXs treeYs) = BKTree.size treeXs + BKTree.size treeYs - -[] -let ``concat and size``() = - fsCheck <| fun xss -> - let trees = List.map BKTree.Int.ofList xss - BKTree.size (BKTree.Int.concat trees) = List.sum (List.map BKTree.size trees) - -[] -let ``concat and exists``() = - fsCheck <| fun xss -> - let tree = BKTree.Int.concat (List.map BKTree.Int.ofList xss) - List.forall (fun x -> BKTree.Int.exists x tree) (List.concat xss) - -[] -let ``ofList and exists``() = - fsCheck <| fun xs -> - let tree = BKTree.Int.ofList xs - List.forall (fun x -> BKTree.Int.exists x tree) xs - -[] -let ``implements IEnumerable``() = - fsCheck <| fun values -> - let tree = BKTree.Int.ofList values - let a = tree :> _ seq |> Seq.toList - set values = set a && a.Length = values.Length + testPropertyWithConfig config10k "delete inv" <| + fun n xs -> invariant (BKTree.Int.delete n (BKTree.Int.ofList xs)) + + testPropertyWithConfig config10k "toList" <| + fun xs -> List.sort (BKTree.toList (BKTree.Int.ofList xs)) = List.sort xs + + testPropertyWithConfig config10k "toListDistance" <| + fun dist n xs -> + let d = dist % 5 + List.sort (BKTree.Int.toListDistance d n (BKTree.Int.ofList xs)) = + List.sort (List.filter (fun e -> BKTree.Int.distance n e <= d) xs) + + testPropertyWithConfig config10k "concat" <| + fun xss -> sem (BKTree.Int.concat (List.map BKTree.Int.ofList xss)) = List.sort (List.concat xss) + + testPropertyWithConfig config10k "concat inv" <| + fun xss -> invariant (BKTree.Int.concat (List.map BKTree.Int.ofList xss)) + + testPropertyWithConfig config10k "append" <| + fun xs ys -> + sem (BKTree.Int.append (BKTree.Int.ofList xs) (BKTree.Int.ofList ys)) = List.sort (List.append xs ys) + + testPropertyWithConfig config10k "append inv" <| + fun xs ys -> invariant (BKTree.Int.append (BKTree.Int.ofList xs) (BKTree.Int.ofList ys)) + + testPropertyWithConfig config10k "delete . add = id" <| + fun n xs -> trans ((BKTree.Int.delete n) << (BKTree.Int.add n)) xs = List.sort xs + + testPropertyWithConfig config10k "The size of an empty BKTree is 0" <| + fun _ -> BKTree.size BKTree.empty = 0 + + testPropertyWithConfig config10k "ofList and size" <| + fun xs -> BKTree.size (BKTree.Int.ofList xs) = List.length xs + + testPropertyWithConfig config10k "add . size = size + 1" <| + fun n xs -> + let tree = BKTree.Int.ofList xs + BKTree.size (BKTree.Int.add n tree) = BKTree.size tree + 1 + + testPropertyWithConfig config10k "delete . size = size - 1" <| + fun n xs -> + let tree = BKTree.Int.ofList xs + BKTree.size (BKTree.Int.delete n tree) = BKTree.size tree - if BKTree.Int.exists n tree then 1 else 0 + + testPropertyWithConfig config10k "append and size" <| + fun xs ys -> + let treeXs = BKTree.Int.ofList xs + let treeYs = BKTree.Int.ofList ys + BKTree.size (BKTree.Int.append treeXs treeYs) = BKTree.size treeXs + BKTree.size treeYs + + testPropertyWithConfig config10k "concat and size" <| + fun xss -> + let trees = List.map BKTree.Int.ofList xss + BKTree.size (BKTree.Int.concat trees) = List.sum (List.map BKTree.size trees) + + testPropertyWithConfig config10k "concat and exists" <| + fun xss -> + let tree = BKTree.Int.concat (List.map BKTree.Int.ofList xss) + List.forall (fun x -> BKTree.Int.exists x tree) (List.concat xss) + + testPropertyWithConfig config10k "ofList and exists" <| + fun xs -> + let tree = BKTree.Int.ofList xs + List.forall (fun x -> BKTree.Int.exists x tree) xs + + testPropertyWithConfig config10k "implements IEnumerable" <| + fun values -> + let tree = BKTree.Int.ofList values + let a = tree :> _ seq |> Seq.toList + set values = set a && a.Length = values.Length + ] diff --git a/tests/FSharpx.Collections.Experimental.Tests/BankersDequeTest.fs b/tests/FSharpx.Collections.Experimental.Tests/BankersDequeTest.fs index 868dd544..84c3f591 100644 --- a/tests/FSharpx.Collections.Experimental.Tests/BankersDequeTest.fs +++ b/tests/FSharpx.Collections.Experimental.Tests/BankersDequeTest.fs @@ -1,2477 +1,2362 @@ -module FSharpx.Collections.Experimental.Tests.BankersDequeTest +namespace FSharpx.Collections.Experimental.Tests open System open FSharpx.Collections open FSharpx.Collections.Experimental -open FSharpx.Collections.Experimental.BankersDeque -open NUnit.Framework -open FsUnit - +open Expecto +open Expecto.Flip //quite a lot going on and difficult to reason about edge cases -//testing up to length of 6 is the likely minimum to satisfy any arbitrary test case (less for some cases) +//testing up to BankersDeque.length of 6 is the likely minimum to satisfy any arbitrary test case (less for some cases) //6 makes front and back lists 3 long when C = 2 -let len1 = singleton "a" -let len2 = singleton "a" |> cons "b" -let len3 = singleton "a" |> cons "b" |> cons "c" -let len4 = singleton "a" |> cons "b" |> cons "c" |> cons "d" -let len5 = singleton "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" -let len6 = singleton "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" -let len7 = singleton "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" -let len8 = singleton "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" -let len9 = singleton "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" |> cons "i" -let lena = singleton "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" |> cons "i" |> cons "j" - -let len1snoc = singleton "a" -let len2snoc = singleton "b" |> snoc "a" -let len3snoc = singleton "c" |> snoc "b" |> snoc "a" -let len4snoc = singleton "d" |> snoc "c" |> snoc "b" |> snoc "a" -let len5snoc = singleton "e" |> snoc "d" |> snoc "c" |> snoc "b" |> snoc "a" -let len6snoc = singleton "f" |> snoc "e" |> snoc "d" |> snoc "c" |> snoc "b" |> snoc "a" -let len7snoc = singleton "g" |> snoc "f" |> snoc "e" |> snoc "d" |> snoc "c" |> snoc "b" |> snoc "a" -let len8snoc = singleton "h" |> snoc "g" |> snoc "f" |> snoc "e" |> snoc "d" |> snoc "c" |> snoc "b" |> snoc "a" -let len9snoc = singleton "i" |> snoc "h" |> snoc "g" |> snoc "f" |> snoc "e" |> snoc "d" |> snoc "c" |> snoc "b" |> snoc "a" -let lenasnoc = singleton "j" |> snoc "i" |> snoc "h" |> snoc "g" |> snoc "f" |> snoc "e" |> snoc "d" |> snoc "c" |> snoc "b" |> snoc "a" - -let len1C3 = empty 3 |> cons "a" -let len2C3 = empty 3 |> cons "a" |> cons "b" -let len3C3 = empty 3 |> cons "a" |> cons "b" |> cons "c" -let len4C3 = empty 3 |> cons "a" |> cons "b" |> cons "c" |> cons "d" -let len5C3 = empty 3 |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" -let len6C3 = empty 3 |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" -let len7C3 = empty 3 |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" -let len8C3 = empty 3 |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" -let len9C3 = empty 3 |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" |> cons "i" -let lenaC3 = empty 3 |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" |> cons "i" |> cons "j" - -let len1C3snoc = empty 3 |> snoc "a" -let len2C3snoc = empty 3 |> snoc "b" |> snoc "a" -let len3C3snoc = empty 3 |> snoc "c" |> snoc "b" |> snoc "a" -let len4C3snoc = empty 3 |> snoc "d" |> snoc "c" |> snoc "b" |> snoc "a" -let len5C3snoc = empty 3 |> snoc "e" |> snoc "d" |> snoc "c" |> snoc "b" |> snoc "a" -let len6C3snoc = empty 3 |> snoc "f" |> snoc "e" |> snoc "d" |> snoc "c" |> snoc "b" |> snoc "a" -let len7C3snoc = empty 3 |> snoc "g" |> snoc "f" |> snoc "e" |> snoc "d" |> snoc "c" |> snoc "b" |> snoc "a" -let len8C3snoc = empty 3 |> snoc "h" |> snoc "g" |> snoc "f" |> snoc "e" |> snoc "d" |> snoc "c" |> snoc "b" |> snoc "a" -let len9C3snoc = empty 3 |> snoc "i" |> snoc "h" |> snoc "g" |> snoc "f" |> snoc "e" |> snoc "d" |> snoc "c" |> snoc "b" |> snoc "a" -let lenaC3snoc = empty 3 |> snoc "j" |> snoc "i" |> snoc "h" |> snoc "g" |> snoc "f" |> snoc "e" |> snoc "d" |> snoc "c" |> snoc "b" |> snoc "a" - -[] -let ``empty dqueue should be empty``() = - - isEmpty (empty 2) |> should equal true - -[] -let ``cons works``() = - ((len2 |> isEmpty) && (len2C3 |> isEmpty)) |> should equal false - -[] -let ``snoc works``() = - ((len2snoc |> isEmpty) && (len2C3snoc |> isEmpty)) |> should equal false - -[] -let ``singleton head works``() = - (((head len1) = "a") && ((len1C3 |> isEmpty)) = false) |> should equal true - -[] -let ``singleton last works``() = - len1 |> last |> should equal "a" - -[] -let ``tail of singleton empty``() = - len1 |> tail |> isEmpty |> should equal true - -[] -let ``tail of tail of 2 empty``() = - ( len2 |> tail |> tail |> isEmpty) |> should equal true - -[] -let ``init of singleton empty``() = - ((init len1) |> isEmpty) |> should equal true - -[] -let ``head, tail, and length work test 1``() = - let t1 = tail len2 - let t1C = tail len2C3 - let t1s = tail len2snoc - let t1Cs = tail len2C3snoc - (((length t1) = 1) && ((length t1C) = 1) && ((length t1s) = 1) && ((length t1Cs) = 1) - && ((head t1) = "a") && ((head t1C) = "a") && ((head t1s) = "a") && ((head t1Cs) = "a")) |> should equal true - -[] -let ``head, tail, and length work test 2``() = - let t1 = tail len3 - let t1C = tail len3C3 - let t1s = tail len3snoc - let t1Cs = tail len3C3snoc - - let t1_1 = tail t1 - let t1C_1 = tail t1C - let t1_1s = tail t1s - let t1C_1s = tail t1Cs - - (((length t1) = 2) && ((length t1C) = 2) && ((length t1s) = 2) && ((length t1Cs) = 2) - && ((head t1) = "b") && ((head t1C) = "b") && ((head t1s) = "b") && ((head t1Cs) = "b") - && ((length t1_1) = 1) && ((length t1C_1) = 1) && ((length t1_1s) = 1) && ((length t1C_1s) = 1) - && ((head t1_1) = "a") && ((head t1C_1) = "a") && ((head t1_1s) = "a") && ((head t1C_1s) = "a")) |> should equal true - -[] -let ``head, tail, and length work test 3``() = - let t1 = tail len4 - let t1C = tail len4C3 - let t1s = tail len4snoc - let t1Cs = tail len4C3snoc - - let t1_2 = tail t1 - let t1C_2 = tail t1C - let t1_2s = tail t1s - let t1C_2s = tail t1Cs - - let t1_1 = tail t1_2 - let t1C_1 = tail t1C_2 - let t1_1s = tail t1_2s - let t1C_1s = tail t1C_2s - - (((length t1) = 3) && ((length t1C) = 3) && ((length t1s) = 3) && ((length t1Cs) = 3) - && ((head t1) = "c") && ((head t1C) = "c") && ((head t1s) = "c") && ((head t1Cs) = "c") - && ((length t1_2) = 2) && ((length t1C_2) = 2) && ((length t1_2s) = 2) && ((length t1C_2s) = 2) - && ((head t1_2) = "b") && ((head t1C_2) = "b") && ((head t1_2s) = "b") && ((head t1C_2s) = "b") - && ((length t1_1) = 1) && ((length t1C_1) = 1) && ((length t1_1s) = 1) && ((length t1C_1s) = 1) - && ((head t1_1) = "a") && ((head t1C_1) = "a") && ((head t1_1s) = "a") && ((head t1C_1s) = "a")) |> should equal true - -[] -let ``head, tail, and length work test 4``() = - let t1 = tail len5 - let t1C = tail len5C3 - let t1s = tail len5snoc - let t1Cs = tail len5C3snoc - - let t1_3 = tail t1 - let t1C_3 = tail t1C - let t1_3s = tail t1s - let t1C_3s = tail t1Cs - - let t1_2 = tail t1_3 - let t1C_2 = tail t1C_3 - let t1_2s = tail t1_3s - let t1C_2s = tail t1C_3s - - let t1_1 = tail t1_2 - let t1C_1 = tail t1C_2 - let t1_1s = tail t1_2s - let t1C_1s = tail t1C_2s - - (((length t1) = 4) && ((length t1C) = 4) && ((length t1s) = 4) && ((length t1Cs) = 4) - && ((head t1) = "d") && ((head t1C) = "d") && ((head t1s) = "d") && ((head t1Cs) = "d") - && ((length t1_3) = 3) && ((length t1C_3) = 3) && ((length t1_3s) = 3) && ((length t1C_3s) = 3) - && ((head t1_3) = "c") && ((head t1C_3) = "c") && ((head t1_3s) = "c") && ((head t1C_3s) = "c") - && ((length t1_2) = 2) && ((length t1C_2) = 2) && ((length t1_2s) = 2) && ((length t1C_2s) = 2) - && ((head t1_2) = "b") && ((head t1C_2) = "b") && ((head t1_2s) = "b") && ((head t1C_2s) = "b") - && ((length t1_1) = 1) && ((length t1C_1) = 1) && ((length t1_1s) = 1) && ((length t1C_1s) = 1) - && ((head t1_1) = "a") && ((head t1C_1) = "a") && ((head t1_1s) = "a") && ((head t1C_1s) = "a")) |> should equal true - -[] -let ``head, tail, and length work test 5``() = - let t1 = tail len6 - let t1C = tail len6C3 - let t1s = tail len6snoc - let t1Cs = tail len6C3snoc - - let t1_4 = tail t1 - let t1C_4 = tail t1C - let t1_4s = tail t1s - let t1C_4s = tail t1Cs - - let t1_3 = tail t1_4 - let t1C_3 = tail t1C_4 - let t1_3s = tail t1_4s - let t1C_3s = tail t1C_4s - - let t1_2 = tail t1_3 - let t1C_2 = tail t1C_3 - let t1_2s = tail t1_3s - let t1C_2s = tail t1C_3s - - let t1_1 = tail t1_2 - let t1C_1 = tail t1C_2 - let t1_1s = tail t1_2s - let t1C_1s = tail t1C_2s - - (((length t1) = 5) && ((length t1C) = 5) && ((length t1s) = 5) && ((length t1Cs) = 5) - && ((head t1) = "e") && ((head t1C) = "e") && ((head t1s) = "e") && ((head t1Cs) = "e") - && ((length t1_4) = 4) && ((length t1C_4) = 4) && ((length t1_4s) = 4) && ((length t1C_4s) = 4) - && ((head t1_4) = "d") && ((head t1C_4) = "d") && ((head t1_4s) = "d") && ((head t1C_4s) = "d") - && ((length t1_3) = 3) && ((length t1C_3) = 3) && ((length t1_3s) = 3) && ((length t1C_3s) = 3) - && ((head t1_3) = "c") && ((head t1C_3) = "c") && ((head t1_3s) = "c") && ((head t1C_3s) = "c") - && ((length t1_2) = 2) && ((length t1C_2) = 2) && ((length t1_2s) = 2) && ((length t1C_2s) = 2) - && ((head t1_2) = "b") && ((head t1C_2) = "b") && ((head t1_2s) = "b") && ((head t1C_2s) = "b") - && ((length t1_1) = 1) && ((length t1C_1) = 1) && ((length t1_1s) = 1) && ((length t1C_1s) = 1) - && ((head t1_1) = "a") && ((head t1C_1) = "a") && ((head t1_1s) = "a") && ((head t1C_1s) = "a")) |> should equal true - -[] -let ``head, tail, and length work test 6``() = - let t1 = tail len7 - let t1C = tail len7C3 - let t1s = tail len7snoc - let t1Cs = tail len7C3snoc - - let t1_5 = tail t1 - let t1C_5 = tail t1C - let t1_5s = tail t1s - let t1C_5s = tail t1Cs - - let t1_4 = tail t1_5 - let t1C_4 = tail t1C_5 - let t1_4s = tail t1_5s - let t1C_4s = tail t1C_5s - - let t1_3 = tail t1_4 - let t1C_3 = tail t1C_4 - let t1_3s = tail t1_4s - let t1C_3s = tail t1C_4s - - let t1_2 = tail t1_3 - let t1C_2 = tail t1C_3 - let t1_2s = tail t1_3s - let t1C_2s = tail t1C_3s - - let t1_1 = tail t1_2 - let t1C_1 = tail t1C_2 - let t1_1s = tail t1_2s - let t1C_1s = tail t1C_2s - - (((length t1) = 6) && ((length t1C) = 6) && ((length t1s) = 6) && ((length t1Cs) = 6) - && ((head t1) = "f") && ((head t1C) = "f") && ((head t1s) = "f") && ((head t1Cs) = "f") - && ((length t1_5) = 5) && ((length t1C_5) = 5) && ((length t1_5s) = 5) && ((length t1C_5s) = 5) - && ((head t1_5) = "e") && ((head t1C_5) = "e") && ((head t1_5s) = "e") && ((head t1C_5s) = "e") - && ((length t1_4) = 4) && ((length t1C_4) = 4) && ((length t1_4s) = 4) && ((length t1C_4s) = 4) - && ((head t1_4) = "d") && ((head t1C_4) = "d") && ((head t1_4s) = "d") && ((head t1C_4s) = "d") - && ((length t1_3) = 3) && ((length t1C_3) = 3) && ((length t1_3s) = 3) && ((length t1C_3s) = 3) - && ((head t1_3) = "c") && ((head t1C_3) = "c") && ((head t1_3s) = "c") && ((head t1C_3s) = "c") - && ((length t1_2) = 2) && ((length t1C_2) = 2) && ((length t1_2s) = 2) && ((length t1C_2s) = 2) - && ((head t1_2) = "b") && ((head t1C_2) = "b") && ((head t1_2s) = "b") && ((head t1C_2s) = "b") - && ((length t1_1) = 1) && ((length t1C_1) = 1) && ((length t1_1s) = 1) && ((length t1C_1s) = 1) - && ((head t1_1) = "a") && ((head t1C_1) = "a") && ((head t1_1s) = "a") && ((head t1C_1s) = "a")) |> should equal true - -[] -let ``head, tail, and length work test 7``() = - let t1 = tail len8 - let t1C = tail len8C3 - let t1s = tail len8snoc - let t1Cs = tail len8C3snoc - - let t1_6 = tail t1 - let t1C_6 = tail t1C - let t1_6s = tail t1s - let t1C_6s = tail t1Cs - - let t1_5 = tail t1_6 - let t1C_5 = tail t1C_6 - let t1_5s = tail t1_6s - let t1C_5s = tail t1C_6s - - let t1_4 = tail t1_5 - let t1C_4 = tail t1C_5 - let t1_4s = tail t1_5s - let t1C_4s = tail t1C_5s - - let t1_3 = tail t1_4 - let t1C_3 = tail t1C_4 - let t1_3s = tail t1_4s - let t1C_3s = tail t1C_4s - - let t1_2 = tail t1_3 - let t1C_2 = tail t1C_3 - let t1_2s = tail t1_3s - let t1C_2s = tail t1C_3s - - let t1_1 = tail t1_2 - let t1C_1 = tail t1C_2 - let t1_1s = tail t1_2s - let t1C_1s = tail t1C_2s - - (((length t1) = 7) && ((length t1C) = 7) && ((length t1s) = 7) && ((length t1Cs) = 7) - && ((head t1) = "g") && ((head t1C) = "g") && ((head t1s) = "g") && ((head t1Cs) = "g") - && ((length t1_6) = 6) && ((length t1C_6) = 6) && ((length t1_6s) = 6) && ((length t1C_6s) = 6) - && ((head t1_6) = "f") && ((head t1C_6) = "f") && ((head t1_6s) = "f") && ((head t1C_6s) = "f") - && ((length t1_5) = 5) && ((length t1C_5) = 5) && ((length t1_5s) = 5) && ((length t1C_5s) = 5) - && ((head t1_5) = "e") && ((head t1C_5) = "e") && ((head t1_5s) = "e") && ((head t1C_5s) = "e") - && ((length t1_4) = 4) && ((length t1C_4) = 4) && ((length t1_4s) = 4) && ((length t1C_4s) = 4) - && ((head t1_4) = "d") && ((head t1C_4) = "d") && ((head t1_4s) = "d") && ((head t1C_4s) = "d") - && ((length t1_3) = 3) && ((length t1C_3) = 3) && ((length t1_3s) = 3) && ((length t1C_3s) = 3) - && ((head t1_3) = "c") && ((head t1C_3) = "c") && ((head t1_3s) = "c") && ((head t1C_3s) = "c") - && ((length t1_2) = 2) && ((length t1C_2) = 2) && ((length t1_2s) = 2) && ((length t1C_2s) = 2) - && ((head t1_2) = "b") && ((head t1C_2) = "b") && ((head t1_2s) = "b") && ((head t1C_2s) = "b") - && ((length t1_1) = 1) && ((length t1C_1) = 1) && ((length t1_1s) = 1) && ((length t1C_1s) = 1) - && ((head t1_1) = "a") && ((head t1C_1) = "a") && ((head t1_1s) = "a") && ((head t1C_1s) = "a")) |> should equal true - -[] -let ``head, tail, and length work test 8``() = - let t1 = tail len9 - let t1C = tail len9C3 - let t1s = tail len9snoc - let t1Cs = tail len9C3snoc - - let t1_7 = tail t1 - let t1C_7 = tail t1C - let t1_7s = tail t1s - let t1C_7s = tail t1Cs - - let t1_6 = tail t1_7 - let t1C_6 = tail t1C_7 - let t1_6s = tail t1_7s - let t1C_6s = tail t1C_7s - - let t1_5 = tail t1_6 - let t1C_5 = tail t1C_6 - let t1_5s = tail t1_6s - let t1C_5s = tail t1C_6s - - let t1_4 = tail t1_5 - let t1C_4 = tail t1C_5 - let t1_4s = tail t1_5s - let t1C_4s = tail t1C_5s - - let t1_3 = tail t1_4 - let t1C_3 = tail t1C_4 - let t1_3s = tail t1_4s - let t1C_3s = tail t1C_4s - - let t1_2 = tail t1_3 - let t1C_2 = tail t1C_3 - let t1_2s = tail t1_3s - let t1C_2s = tail t1C_3s - - let t1_1 = tail t1_2 - let t1C_1 = tail t1C_2 - let t1_1s = tail t1_2s - let t1C_1s = tail t1C_2s - - (((length t1) = 8) && ((length t1C) = 8) && ((length t1s) = 8) && ((length t1Cs) = 8) - && ((head t1) = "h") && ((head t1C) = "h") && ((head t1s) = "h") && ((head t1Cs) = "h") - && ((length t1_7) = 7) && ((length t1C_7) = 7) && ((length t1_7s) = 7) && ((length t1C_7s) = 7) - && ((head t1_7) = "g") && ((head t1C_7) = "g") && ((head t1_7s) = "g") && ((head t1C_7s) = "g") - && ((length t1_6) = 6) && ((length t1C_6) = 6) && ((length t1_6s) = 6) && ((length t1C_6s) = 6) - && ((head t1_6) = "f") && ((head t1C_6) = "f") && ((head t1_6s) = "f") && ((head t1C_6s) = "f") - && ((length t1_5) = 5) && ((length t1C_5) = 5) && ((length t1_5s) = 5) && ((length t1C_5s) = 5) - && ((head t1_5) = "e") && ((head t1C_5) = "e") && ((head t1_5s) = "e") && ((head t1C_5s) = "e") - && ((length t1_4) = 4) && ((length t1C_4) = 4) && ((length t1_4s) = 4) && ((length t1C_4s) = 4) - && ((head t1_4) = "d") && ((head t1C_4) = "d") && ((head t1_4s) = "d") && ((head t1C_4s) = "d") - && ((length t1_3) = 3) && ((length t1C_3) = 3) && ((length t1_3s) = 3) && ((length t1C_3s) = 3) - && ((head t1_3) = "c") && ((head t1C_3) = "c") && ((head t1_3s) = "c") && ((head t1C_3s) = "c") - && ((length t1_2) = 2) && ((length t1C_2) = 2) && ((length t1_2s) = 2) && ((length t1C_2s) = 2) - && ((head t1_2) = "b") && ((head t1C_2) = "b") && ((head t1_2s) = "b") && ((head t1C_2s) = "b") - && ((length t1_1) = 1) && ((length t1C_1) = 1) && ((length t1_1s) = 1) && ((length t1C_1s) = 1) - && ((head t1_1) = "a") && ((head t1C_1) = "a") && ((head t1_1s) = "a") && ((head t1C_1s) = "a")) |> should equal true - -[] -let ``head, tail, and length work test 9``() = - let t1 = tail lena - let t1C = tail lenaC3 - let t1s = tail lenasnoc - let t1Cs = tail lenaC3snoc - - let t1_8 = tail t1 - let t1C_8 = tail t1C - let t1_8s = tail t1s - let t1C_8s = tail t1Cs - - let t1_7 = tail t1_8 - let t1C_7 = tail t1C_8 - let t1_7s = tail t1_8s - let t1C_7s = tail t1C_8s - - let t1_6 = tail t1_7 - let t1C_6 = tail t1C_7 - let t1_6s = tail t1_7s - let t1C_6s = tail t1C_7s - - let t1_5 = tail t1_6 - let t1C_5 = tail t1C_6 - let t1_5s = tail t1_6s - let t1C_5s = tail t1C_6s - - let t1_4 = tail t1_5 - let t1C_4 = tail t1C_5 - let t1_4s = tail t1_5s - let t1C_4s = tail t1C_5s - - let t1_3 = tail t1_4 - let t1C_3 = tail t1C_4 - let t1_3s = tail t1_4s - let t1C_3s = tail t1C_4s - - let t1_2 = tail t1_3 - let t1C_2 = tail t1C_3 - let t1_2s = tail t1_3s - let t1C_2s = tail t1C_3s - - let t1_1 = tail t1_2 - let t1C_1 = tail t1C_2 - let t1_1s = tail t1_2s - let t1C_1s = tail t1C_2s - - (((length t1) = 9) && ((length t1C) = 9) && ((length t1s) = 9) && ((length t1Cs) = 9) - && ((head t1) = "i") && ((head t1C) = "i") && ((head t1s) = "i") && ((head t1Cs) = "i") - && ((length t1_8) = 8) && ((length t1C_8) = 8) && ((length t1_8s) = 8) && ((length t1C_8s) = 8) - && ((head t1_8) = "h") && ((head t1C_8) = "h") && ((head t1_8s) = "h") && ((head t1C_8s) = "h") - && ((length t1_7) = 7) && ((length t1C_7) = 7) && ((length t1_7s) = 7) && ((length t1C_7s) = 7) - && ((head t1_7) = "g") && ((head t1C_7) = "g") && ((head t1_7s) = "g") && ((head t1C_7s) = "g") - && ((length t1_6) = 6) && ((length t1C_6) = 6) && ((length t1_6s) = 6) && ((length t1C_6s) = 6) - && ((head t1_6) = "f") && ((head t1C_6) = "f") && ((head t1_6s) = "f") && ((head t1C_6s) = "f") - && ((length t1_5) = 5) && ((length t1C_5) = 5) && ((length t1_5s) = 5) && ((length t1C_5s) = 5) - && ((head t1_5) = "e") && ((head t1C_5) = "e") && ((head t1_5s) = "e") && ((head t1C_5s) = "e") - && ((length t1_4) = 4) && ((length t1C_4) = 4) && ((length t1_4s) = 4) && ((length t1C_4s) = 4) - && ((head t1_4) = "d") && ((head t1C_4) = "d") && ((head t1_4s) = "d") && ((head t1C_4s) = "d") - && ((length t1_3) = 3) && ((length t1C_3) = 3) && ((length t1_3s) = 3) && ((length t1C_3s) = 3) - && ((head t1_3) = "c") && ((head t1C_3) = "c") && ((head t1_3s) = "c") && ((head t1C_3s) = "c") - && ((length t1_2) = 2) && ((length t1C_2) = 2) && ((length t1_2s) = 2) && ((length t1C_2s) = 2) - && ((head t1_2) = "b") && ((head t1C_2) = "b") && ((head t1_2s) = "b") && ((head t1C_2s) = "b") - && ((length t1_1) = 1) && ((length t1C_1) = 1) && ((length t1_1s) = 1) && ((length t1C_1s) = 1) - && ((head t1_1) = "a") && ((head t1C_1) = "a") && ((head t1_1s) = "a") && ((head t1C_1s) = "a")) |> should equal true - -[] -//the previous series thoroughly tested construction by snoc, so we'll leave those out -let ``last, init, and length work test 1``() = - let t1 = init len2 - let t1C = init len2C3 +module BankersDequeTest = + + let len1 = BankersDeque.singleton "a" + let len2 = BankersDeque.singleton "a" |> BankersDeque.cons "b" + let len3 = BankersDeque.singleton "a" |> BankersDeque.cons "b" |> BankersDeque.cons "c" + let len4 = BankersDeque.singleton "a" |> BankersDeque.cons "b" |> BankersDeque.cons "c" |> BankersDeque.cons "d" + let len5 = BankersDeque.singleton "a" |> BankersDeque.cons "b" |> BankersDeque.cons "c" |> BankersDeque.cons "d" |> BankersDeque.cons "e" + let len6 = BankersDeque.singleton "a" |> BankersDeque.cons "b" |> BankersDeque.cons "c" |> BankersDeque.cons "d" |> BankersDeque.cons "e" |> BankersDeque.cons "f" + let len7 = BankersDeque.singleton "a" |> BankersDeque.cons "b" |> BankersDeque.cons "c" |> BankersDeque.cons "d" |> BankersDeque.cons "e" |> BankersDeque.cons "f" |> BankersDeque.cons "g" + let len8 = BankersDeque.singleton "a" |> BankersDeque.cons "b" |> BankersDeque.cons "c" |> BankersDeque.cons "d" |> BankersDeque.cons "e" |> BankersDeque.cons "f" |> BankersDeque.cons "g" |> BankersDeque.cons "h" + let len9 = BankersDeque.singleton "a" |> BankersDeque.cons "b" |> BankersDeque.cons "c" |> BankersDeque.cons "d" |> BankersDeque.cons "e" |> BankersDeque.cons "f" |> BankersDeque.cons "g" |> BankersDeque.cons "h" |> BankersDeque.cons "i" + let lena = BankersDeque.singleton "a" |> BankersDeque.cons "b" |> BankersDeque.cons "c" |> BankersDeque.cons "d" |> BankersDeque.cons "e" |> BankersDeque.cons "f" |> BankersDeque.cons "g" |> BankersDeque.cons "h" |> BankersDeque.cons "i" |> BankersDeque.cons "j" + + let len1snoc = BankersDeque.singleton "a" + let len2snoc = BankersDeque.singleton "b" |> BankersDeque.snoc "a" + let len3snoc = BankersDeque.singleton "c" |> BankersDeque.snoc "b" |> BankersDeque.snoc "a" + let len4snoc = BankersDeque.singleton "d" |> BankersDeque.snoc "c" |> BankersDeque.snoc "b" |> BankersDeque.snoc "a" + let len5snoc = BankersDeque.singleton "e" |> BankersDeque.snoc "d" |> BankersDeque.snoc "c" |> BankersDeque.snoc "b" |> BankersDeque.snoc "a" + let len6snoc = BankersDeque.singleton "f" |> BankersDeque.snoc "e" |> BankersDeque.snoc "d" |> BankersDeque.snoc "c" |> BankersDeque.snoc "b" |> BankersDeque.snoc "a" + let len7snoc = BankersDeque.singleton "g" |> BankersDeque.snoc "f" |> BankersDeque.snoc "e" |> BankersDeque.snoc "d" |> BankersDeque.snoc "c" |> BankersDeque.snoc "b" |> BankersDeque.snoc "a" + let len8snoc = BankersDeque.singleton "h" |> BankersDeque.snoc "g" |> BankersDeque.snoc "f" |> BankersDeque.snoc "e" |> BankersDeque.snoc "d" |> BankersDeque.snoc "c" |> BankersDeque.snoc "b" |> BankersDeque.snoc "a" + let len9snoc = BankersDeque.singleton "i" |> BankersDeque.snoc "h" |> BankersDeque.snoc "g" |> BankersDeque.snoc "f" |> BankersDeque.snoc "e" |> BankersDeque.snoc "d" |> BankersDeque.snoc "c" |> BankersDeque.snoc "b" |> BankersDeque.snoc "a" + let lenasnoc = BankersDeque.singleton "j" |> BankersDeque.snoc "i" |> BankersDeque.snoc "h" |> BankersDeque.snoc "g" |> BankersDeque.snoc "f" |> BankersDeque.snoc "e" |> BankersDeque.snoc "d" |> BankersDeque.snoc "c" |> BankersDeque.snoc "b" |> BankersDeque.snoc "a" + + let len1C3 = BankersDeque.empty 3 |> BankersDeque.cons "a" + let len2C3 = BankersDeque.empty 3 |> BankersDeque.cons "a" |> BankersDeque.cons "b" + let len3C3 = BankersDeque.empty 3 |> BankersDeque.cons "a" |> BankersDeque.cons "b" |> BankersDeque.cons "c" + let len4C3 = BankersDeque.empty 3 |> BankersDeque.cons "a" |> BankersDeque.cons "b" |> BankersDeque.cons "c" |> BankersDeque.cons "d" + let len5C3 = BankersDeque.empty 3 |> BankersDeque.cons "a" |> BankersDeque.cons "b" |> BankersDeque.cons "c" |> BankersDeque.cons "d" |> BankersDeque.cons "e" + let len6C3 = BankersDeque.empty 3 |> BankersDeque.cons "a" |> BankersDeque.cons "b" |> BankersDeque.cons "c" |> BankersDeque.cons "d" |> BankersDeque.cons "e" |> BankersDeque.cons "f" + let len7C3 = BankersDeque.empty 3 |> BankersDeque.cons "a" |> BankersDeque.cons "b" |> BankersDeque.cons "c" |> BankersDeque.cons "d" |> BankersDeque.cons "e" |> BankersDeque.cons "f" |> BankersDeque.cons "g" + let len8C3 = BankersDeque.empty 3 |> BankersDeque.cons "a" |> BankersDeque.cons "b" |> BankersDeque.cons "c" |> BankersDeque.cons "d" |> BankersDeque.cons "e" |> BankersDeque.cons "f" |> BankersDeque.cons "g" |> BankersDeque.cons "h" + let len9C3 = BankersDeque.empty 3 |> BankersDeque.cons "a" |> BankersDeque.cons "b" |> BankersDeque.cons "c" |> BankersDeque.cons "d" |> BankersDeque.cons "e" |> BankersDeque.cons "f" |> BankersDeque.cons "g" |> BankersDeque.cons "h" |> BankersDeque.cons "i" + let lenaC3 = BankersDeque.empty 3 |> BankersDeque.cons "a" |> BankersDeque.cons "b" |> BankersDeque.cons "c" |> BankersDeque.cons "d" |> BankersDeque.cons "e" |> BankersDeque.cons "f" |> BankersDeque.cons "g" |> BankersDeque.cons "h" |> BankersDeque.cons "i" |> BankersDeque.cons "j" + + let len1C3snoc = BankersDeque.empty 3 |> BankersDeque.snoc "a" + let len2C3snoc = BankersDeque.empty 3 |> BankersDeque.snoc "b" |> BankersDeque.snoc "a" + let len3C3snoc = BankersDeque.empty 3 |> BankersDeque.snoc "c" |> BankersDeque.snoc "b" |> BankersDeque.snoc "a" + let len4C3snoc = BankersDeque.empty 3 |> BankersDeque.snoc "d" |> BankersDeque.snoc "c" |> BankersDeque.snoc "b" |> BankersDeque.snoc "a" + let len5C3snoc = BankersDeque.empty 3 |> BankersDeque.snoc "e" |> BankersDeque.snoc "d" |> BankersDeque.snoc "c" |> BankersDeque.snoc "b" |> BankersDeque.snoc "a" + let len6C3snoc = BankersDeque.empty 3 |> BankersDeque.snoc "f" |> BankersDeque.snoc "e" |> BankersDeque.snoc "d" |> BankersDeque.snoc "c" |> BankersDeque.snoc "b" |> BankersDeque.snoc "a" + let len7C3snoc = BankersDeque.empty 3 |> BankersDeque.snoc "g" |> BankersDeque.snoc "f" |> BankersDeque.snoc "e" |> BankersDeque.snoc "d" |> BankersDeque.snoc "c" |> BankersDeque.snoc "b" |> BankersDeque.snoc "a" + let len8C3snoc = BankersDeque.empty 3 |> BankersDeque.snoc "h" |> BankersDeque.snoc "g" |> BankersDeque.snoc "f" |> BankersDeque.snoc "e" |> BankersDeque.snoc "d" |> BankersDeque.snoc "c" |> BankersDeque.snoc "b" |> BankersDeque.snoc "a" + let len9C3snoc = BankersDeque.empty 3 |> BankersDeque.snoc "i" |> BankersDeque.snoc "h" |> BankersDeque.snoc "g" |> BankersDeque.snoc "f" |> BankersDeque.snoc "e" |> BankersDeque.snoc "d" |> BankersDeque.snoc "c" |> BankersDeque.snoc "b" |> BankersDeque.snoc "a" + let lenaC3snoc = BankersDeque.empty 3 |> BankersDeque.snoc "j" |> BankersDeque.snoc "i" |> BankersDeque.snoc "h" |> BankersDeque.snoc "g" |> BankersDeque.snoc "f" |> BankersDeque.snoc "e" |> BankersDeque.snoc "d" |> BankersDeque.snoc "c" |> BankersDeque.snoc "b" |> BankersDeque.snoc "a" + + [] + let testBankersDeque = + + testList "Experimental BankersDeque" [ + test "BankersDeque.empty dqueue should be BankersDeque.empty" { + + BankersDeque.isEmpty (BankersDeque.empty 2) |> Expect.isTrue "" } + + test "BankersDeque.cons works" { + ((len2 |> BankersDeque.isEmpty) && (len2C3 |> BankersDeque.isEmpty)) |> Expect.isFalse "" } + + test "BankersDeque.snoc works" { + ((len2snoc |> BankersDeque.isEmpty) && (len2C3snoc |> BankersDeque.isEmpty)) |> Expect.isFalse "" } + + test "BankersDeque.singleton BankersDeque.head works" { + (((BankersDeque.head len1) = "a") && ((len1C3 |> BankersDeque.isEmpty)) = false) |> Expect.isTrue "" } + + test "BankersDeque.singleton BankersDeque.last works" { + len1 |> BankersDeque.last |> Expect.equal "" "a" } + + test "BankersDeque.tail of BankersDeque.singleton BankersDeque.empty" { + len1 |> BankersDeque.tail |> BankersDeque.isEmpty |> Expect.isTrue "" } + + test "BankersDeque.tail of BankersDeque.tail of 2 BankersDeque.empty" { + ( len2 |> BankersDeque.tail |> BankersDeque.tail |> BankersDeque.isEmpty) |> Expect.isTrue "" } + + test "BankersDeque.init of BankersDeque.singleton BankersDeque.empty" { + ((BankersDeque.init len1) |> BankersDeque.isEmpty) |> Expect.isTrue "" } + + test "BankersDeque.head, BankersDeque.tail, and BankersDeque.length work test 1" { + let t1 = BankersDeque.tail len2 + let t1C = BankersDeque.tail len2C3 + let t1s = BankersDeque.tail len2snoc + let t1Cs = BankersDeque.tail len2C3snoc + (((BankersDeque.length t1) = 1) && ((BankersDeque.length t1C) = 1) && ((BankersDeque.length t1s) = 1) && ((BankersDeque.length t1Cs) = 1) + && ((BankersDeque.head t1) = "a") && ((BankersDeque.head t1C) = "a") && ((BankersDeque.head t1s) = "a") && ((BankersDeque.head t1Cs) = "a")) |> Expect.isTrue "" } + + test "BankersDeque.head, BankersDeque.tail, and BankersDeque.length work test 2" { + let t1 = BankersDeque.tail len3 + let t1C = BankersDeque.tail len3C3 + let t1s = BankersDeque.tail len3snoc + let t1Cs = BankersDeque.tail len3C3snoc + + let t1_1 = BankersDeque.tail t1 + let t1C_1 = BankersDeque.tail t1C + let t1_1s = BankersDeque.tail t1s + let t1C_1s = BankersDeque.tail t1Cs + + (((BankersDeque.length t1) = 2) && ((BankersDeque.length t1C) = 2) && ((BankersDeque.length t1s) = 2) && ((BankersDeque.length t1Cs) = 2) + && ((BankersDeque.head t1) = "b") && ((BankersDeque.head t1C) = "b") && ((BankersDeque.head t1s) = "b") && ((BankersDeque.head t1Cs) = "b") + && ((BankersDeque.length t1_1) = 1) && ((BankersDeque.length t1C_1) = 1) && ((BankersDeque.length t1_1s) = 1) && ((BankersDeque.length t1C_1s) = 1) + && ((BankersDeque.head t1_1) = "a") && ((BankersDeque.head t1C_1) = "a") && ((BankersDeque.head t1_1s) = "a") && ((BankersDeque.head t1C_1s) = "a")) |> Expect.isTrue "" } + + test "BankersDeque.head, BankersDeque.tail, and BankersDeque.length work test 3" { + let t1 = BankersDeque.tail len4 + let t1C = BankersDeque.tail len4C3 + let t1s = BankersDeque.tail len4snoc + let t1Cs = BankersDeque.tail len4C3snoc + + let t1_2 = BankersDeque.tail t1 + let t1C_2 = BankersDeque.tail t1C + let t1_2s = BankersDeque.tail t1s + let t1C_2s = BankersDeque.tail t1Cs + + let t1_1 = BankersDeque.tail t1_2 + let t1C_1 = BankersDeque.tail t1C_2 + let t1_1s = BankersDeque.tail t1_2s + let t1C_1s = BankersDeque.tail t1C_2s + + (((BankersDeque.length t1) = 3) && ((BankersDeque.length t1C) = 3) && ((BankersDeque.length t1s) = 3) && ((BankersDeque.length t1Cs) = 3) + && ((BankersDeque.head t1) = "c") && ((BankersDeque.head t1C) = "c") && ((BankersDeque.head t1s) = "c") && ((BankersDeque.head t1Cs) = "c") + && ((BankersDeque.length t1_2) = 2) && ((BankersDeque.length t1C_2) = 2) && ((BankersDeque.length t1_2s) = 2) && ((BankersDeque.length t1C_2s) = 2) + && ((BankersDeque.head t1_2) = "b") && ((BankersDeque.head t1C_2) = "b") && ((BankersDeque.head t1_2s) = "b") && ((BankersDeque.head t1C_2s) = "b") + && ((BankersDeque.length t1_1) = 1) && ((BankersDeque.length t1C_1) = 1) && ((BankersDeque.length t1_1s) = 1) && ((BankersDeque.length t1C_1s) = 1) + && ((BankersDeque.head t1_1) = "a") && ((BankersDeque.head t1C_1) = "a") && ((BankersDeque.head t1_1s) = "a") && ((BankersDeque.head t1C_1s) = "a")) |> Expect.isTrue "" } + + test "BankersDeque.head, BankersDeque.tail, and BankersDeque.length work test 4" { + let t1 = BankersDeque.tail len5 + let t1C = BankersDeque.tail len5C3 + let t1s = BankersDeque.tail len5snoc + let t1Cs = BankersDeque.tail len5C3snoc + + let t1_3 = BankersDeque.tail t1 + let t1C_3 = BankersDeque.tail t1C + let t1_3s = BankersDeque.tail t1s + let t1C_3s = BankersDeque.tail t1Cs + + let t1_2 = BankersDeque.tail t1_3 + let t1C_2 = BankersDeque.tail t1C_3 + let t1_2s = BankersDeque.tail t1_3s + let t1C_2s = BankersDeque.tail t1C_3s + + let t1_1 = BankersDeque.tail t1_2 + let t1C_1 = BankersDeque.tail t1C_2 + let t1_1s = BankersDeque.tail t1_2s + let t1C_1s = BankersDeque.tail t1C_2s + + (((BankersDeque.length t1) = 4) && ((BankersDeque.length t1C) = 4) && ((BankersDeque.length t1s) = 4) && ((BankersDeque.length t1Cs) = 4) + && ((BankersDeque.head t1) = "d") && ((BankersDeque.head t1C) = "d") && ((BankersDeque.head t1s) = "d") && ((BankersDeque.head t1Cs) = "d") + && ((BankersDeque.length t1_3) = 3) && ((BankersDeque.length t1C_3) = 3) && ((BankersDeque.length t1_3s) = 3) && ((BankersDeque.length t1C_3s) = 3) + && ((BankersDeque.head t1_3) = "c") && ((BankersDeque.head t1C_3) = "c") && ((BankersDeque.head t1_3s) = "c") && ((BankersDeque.head t1C_3s) = "c") + && ((BankersDeque.length t1_2) = 2) && ((BankersDeque.length t1C_2) = 2) && ((BankersDeque.length t1_2s) = 2) && ((BankersDeque.length t1C_2s) = 2) + && ((BankersDeque.head t1_2) = "b") && ((BankersDeque.head t1C_2) = "b") && ((BankersDeque.head t1_2s) = "b") && ((BankersDeque.head t1C_2s) = "b") + && ((BankersDeque.length t1_1) = 1) && ((BankersDeque.length t1C_1) = 1) && ((BankersDeque.length t1_1s) = 1) && ((BankersDeque.length t1C_1s) = 1) + && ((BankersDeque.head t1_1) = "a") && ((BankersDeque.head t1C_1) = "a") && ((BankersDeque.head t1_1s) = "a") && ((BankersDeque.head t1C_1s) = "a")) |> Expect.isTrue "" } + + test "BankersDeque.head, BankersDeque.tail, and BankersDeque.length work test 5" { + let t1 = BankersDeque.tail len6 + let t1C = BankersDeque.tail len6C3 + let t1s = BankersDeque.tail len6snoc + let t1Cs = BankersDeque.tail len6C3snoc + + let t1_4 = BankersDeque.tail t1 + let t1C_4 = BankersDeque.tail t1C + let t1_4s = BankersDeque.tail t1s + let t1C_4s = BankersDeque.tail t1Cs + + let t1_3 = BankersDeque.tail t1_4 + let t1C_3 = BankersDeque.tail t1C_4 + let t1_3s = BankersDeque.tail t1_4s + let t1C_3s = BankersDeque.tail t1C_4s + + let t1_2 = BankersDeque.tail t1_3 + let t1C_2 = BankersDeque.tail t1C_3 + let t1_2s = BankersDeque.tail t1_3s + let t1C_2s = BankersDeque.tail t1C_3s + + let t1_1 = BankersDeque.tail t1_2 + let t1C_1 = BankersDeque.tail t1C_2 + let t1_1s = BankersDeque.tail t1_2s + let t1C_1s = BankersDeque.tail t1C_2s + + (((BankersDeque.length t1) = 5) && ((BankersDeque.length t1C) = 5) && ((BankersDeque.length t1s) = 5) && ((BankersDeque.length t1Cs) = 5) + && ((BankersDeque.head t1) = "e") && ((BankersDeque.head t1C) = "e") && ((BankersDeque.head t1s) = "e") && ((BankersDeque.head t1Cs) = "e") + && ((BankersDeque.length t1_4) = 4) && ((BankersDeque.length t1C_4) = 4) && ((BankersDeque.length t1_4s) = 4) && ((BankersDeque.length t1C_4s) = 4) + && ((BankersDeque.head t1_4) = "d") && ((BankersDeque.head t1C_4) = "d") && ((BankersDeque.head t1_4s) = "d") && ((BankersDeque.head t1C_4s) = "d") + && ((BankersDeque.length t1_3) = 3) && ((BankersDeque.length t1C_3) = 3) && ((BankersDeque.length t1_3s) = 3) && ((BankersDeque.length t1C_3s) = 3) + && ((BankersDeque.head t1_3) = "c") && ((BankersDeque.head t1C_3) = "c") && ((BankersDeque.head t1_3s) = "c") && ((BankersDeque.head t1C_3s) = "c") + && ((BankersDeque.length t1_2) = 2) && ((BankersDeque.length t1C_2) = 2) && ((BankersDeque.length t1_2s) = 2) && ((BankersDeque.length t1C_2s) = 2) + && ((BankersDeque.head t1_2) = "b") && ((BankersDeque.head t1C_2) = "b") && ((BankersDeque.head t1_2s) = "b") && ((BankersDeque.head t1C_2s) = "b") + && ((BankersDeque.length t1_1) = 1) && ((BankersDeque.length t1C_1) = 1) && ((BankersDeque.length t1_1s) = 1) && ((BankersDeque.length t1C_1s) = 1) + && ((BankersDeque.head t1_1) = "a") && ((BankersDeque.head t1C_1) = "a") && ((BankersDeque.head t1_1s) = "a") && ((BankersDeque.head t1C_1s) = "a")) |> Expect.isTrue "" } + + test "BankersDeque.head, BankersDeque.tail, and BankersDeque.length work test 6" { + let t1 = BankersDeque.tail len7 + let t1C = BankersDeque.tail len7C3 + let t1s = BankersDeque.tail len7snoc + let t1Cs = BankersDeque.tail len7C3snoc + + let t1_5 = BankersDeque.tail t1 + let t1C_5 = BankersDeque.tail t1C + let t1_5s = BankersDeque.tail t1s + let t1C_5s = BankersDeque.tail t1Cs + + let t1_4 = BankersDeque.tail t1_5 + let t1C_4 = BankersDeque.tail t1C_5 + let t1_4s = BankersDeque.tail t1_5s + let t1C_4s = BankersDeque.tail t1C_5s + + let t1_3 = BankersDeque.tail t1_4 + let t1C_3 = BankersDeque.tail t1C_4 + let t1_3s = BankersDeque.tail t1_4s + let t1C_3s = BankersDeque.tail t1C_4s + + let t1_2 = BankersDeque.tail t1_3 + let t1C_2 = BankersDeque.tail t1C_3 + let t1_2s = BankersDeque.tail t1_3s + let t1C_2s = BankersDeque.tail t1C_3s + + let t1_1 = BankersDeque.tail t1_2 + let t1C_1 = BankersDeque.tail t1C_2 + let t1_1s = BankersDeque.tail t1_2s + let t1C_1s = BankersDeque.tail t1C_2s + + (((BankersDeque.length t1) = 6) && ((BankersDeque.length t1C) = 6) && ((BankersDeque.length t1s) = 6) && ((BankersDeque.length t1Cs) = 6) + && ((BankersDeque.head t1) = "f") && ((BankersDeque.head t1C) = "f") && ((BankersDeque.head t1s) = "f") && ((BankersDeque.head t1Cs) = "f") + && ((BankersDeque.length t1_5) = 5) && ((BankersDeque.length t1C_5) = 5) && ((BankersDeque.length t1_5s) = 5) && ((BankersDeque.length t1C_5s) = 5) + && ((BankersDeque.head t1_5) = "e") && ((BankersDeque.head t1C_5) = "e") && ((BankersDeque.head t1_5s) = "e") && ((BankersDeque.head t1C_5s) = "e") + && ((BankersDeque.length t1_4) = 4) && ((BankersDeque.length t1C_4) = 4) && ((BankersDeque.length t1_4s) = 4) && ((BankersDeque.length t1C_4s) = 4) + && ((BankersDeque.head t1_4) = "d") && ((BankersDeque.head t1C_4) = "d") && ((BankersDeque.head t1_4s) = "d") && ((BankersDeque.head t1C_4s) = "d") + && ((BankersDeque.length t1_3) = 3) && ((BankersDeque.length t1C_3) = 3) && ((BankersDeque.length t1_3s) = 3) && ((BankersDeque.length t1C_3s) = 3) + && ((BankersDeque.head t1_3) = "c") && ((BankersDeque.head t1C_3) = "c") && ((BankersDeque.head t1_3s) = "c") && ((BankersDeque.head t1C_3s) = "c") + && ((BankersDeque.length t1_2) = 2) && ((BankersDeque.length t1C_2) = 2) && ((BankersDeque.length t1_2s) = 2) && ((BankersDeque.length t1C_2s) = 2) + && ((BankersDeque.head t1_2) = "b") && ((BankersDeque.head t1C_2) = "b") && ((BankersDeque.head t1_2s) = "b") && ((BankersDeque.head t1C_2s) = "b") + && ((BankersDeque.length t1_1) = 1) && ((BankersDeque.length t1C_1) = 1) && ((BankersDeque.length t1_1s) = 1) && ((BankersDeque.length t1C_1s) = 1) + && ((BankersDeque.head t1_1) = "a") && ((BankersDeque.head t1C_1) = "a") && ((BankersDeque.head t1_1s) = "a") && ((BankersDeque.head t1C_1s) = "a")) |> Expect.isTrue "" } + + test "BankersDeque.head, BankersDeque.tail, and BankersDeque.length work test 7" { + let t1 = BankersDeque.tail len8 + let t1C = BankersDeque.tail len8C3 + let t1s = BankersDeque.tail len8snoc + let t1Cs = BankersDeque.tail len8C3snoc + + let t1_6 = BankersDeque.tail t1 + let t1C_6 = BankersDeque.tail t1C + let t1_6s = BankersDeque.tail t1s + let t1C_6s = BankersDeque.tail t1Cs + + let t1_5 = BankersDeque.tail t1_6 + let t1C_5 = BankersDeque.tail t1C_6 + let t1_5s = BankersDeque.tail t1_6s + let t1C_5s = BankersDeque.tail t1C_6s + + let t1_4 = BankersDeque.tail t1_5 + let t1C_4 = BankersDeque.tail t1C_5 + let t1_4s = BankersDeque.tail t1_5s + let t1C_4s = BankersDeque.tail t1C_5s + + let t1_3 = BankersDeque.tail t1_4 + let t1C_3 = BankersDeque.tail t1C_4 + let t1_3s = BankersDeque.tail t1_4s + let t1C_3s = BankersDeque.tail t1C_4s + + let t1_2 = BankersDeque.tail t1_3 + let t1C_2 = BankersDeque.tail t1C_3 + let t1_2s = BankersDeque.tail t1_3s + let t1C_2s = BankersDeque.tail t1C_3s + + let t1_1 = BankersDeque.tail t1_2 + let t1C_1 = BankersDeque.tail t1C_2 + let t1_1s = BankersDeque.tail t1_2s + let t1C_1s = BankersDeque.tail t1C_2s + + (((BankersDeque.length t1) = 7) && ((BankersDeque.length t1C) = 7) && ((BankersDeque.length t1s) = 7) && ((BankersDeque.length t1Cs) = 7) + && ((BankersDeque.head t1) = "g") && ((BankersDeque.head t1C) = "g") && ((BankersDeque.head t1s) = "g") && ((BankersDeque.head t1Cs) = "g") + && ((BankersDeque.length t1_6) = 6) && ((BankersDeque.length t1C_6) = 6) && ((BankersDeque.length t1_6s) = 6) && ((BankersDeque.length t1C_6s) = 6) + && ((BankersDeque.head t1_6) = "f") && ((BankersDeque.head t1C_6) = "f") && ((BankersDeque.head t1_6s) = "f") && ((BankersDeque.head t1C_6s) = "f") + && ((BankersDeque.length t1_5) = 5) && ((BankersDeque.length t1C_5) = 5) && ((BankersDeque.length t1_5s) = 5) && ((BankersDeque.length t1C_5s) = 5) + && ((BankersDeque.head t1_5) = "e") && ((BankersDeque.head t1C_5) = "e") && ((BankersDeque.head t1_5s) = "e") && ((BankersDeque.head t1C_5s) = "e") + && ((BankersDeque.length t1_4) = 4) && ((BankersDeque.length t1C_4) = 4) && ((BankersDeque.length t1_4s) = 4) && ((BankersDeque.length t1C_4s) = 4) + && ((BankersDeque.head t1_4) = "d") && ((BankersDeque.head t1C_4) = "d") && ((BankersDeque.head t1_4s) = "d") && ((BankersDeque.head t1C_4s) = "d") + && ((BankersDeque.length t1_3) = 3) && ((BankersDeque.length t1C_3) = 3) && ((BankersDeque.length t1_3s) = 3) && ((BankersDeque.length t1C_3s) = 3) + && ((BankersDeque.head t1_3) = "c") && ((BankersDeque.head t1C_3) = "c") && ((BankersDeque.head t1_3s) = "c") && ((BankersDeque.head t1C_3s) = "c") + && ((BankersDeque.length t1_2) = 2) && ((BankersDeque.length t1C_2) = 2) && ((BankersDeque.length t1_2s) = 2) && ((BankersDeque.length t1C_2s) = 2) + && ((BankersDeque.head t1_2) = "b") && ((BankersDeque.head t1C_2) = "b") && ((BankersDeque.head t1_2s) = "b") && ((BankersDeque.head t1C_2s) = "b") + && ((BankersDeque.length t1_1) = 1) && ((BankersDeque.length t1C_1) = 1) && ((BankersDeque.length t1_1s) = 1) && ((BankersDeque.length t1C_1s) = 1) + && ((BankersDeque.head t1_1) = "a") && ((BankersDeque.head t1C_1) = "a") && ((BankersDeque.head t1_1s) = "a") && ((BankersDeque.head t1C_1s) = "a")) |> Expect.isTrue "" } + + test "BankersDeque.head, BankersDeque.tail, and BankersDeque.length work test 8" { + let t1 = BankersDeque.tail len9 + let t1C = BankersDeque.tail len9C3 + let t1s = BankersDeque.tail len9snoc + let t1Cs = BankersDeque.tail len9C3snoc + + let t1_7 = BankersDeque.tail t1 + let t1C_7 = BankersDeque.tail t1C + let t1_7s = BankersDeque.tail t1s + let t1C_7s = BankersDeque.tail t1Cs + + let t1_6 = BankersDeque.tail t1_7 + let t1C_6 = BankersDeque.tail t1C_7 + let t1_6s = BankersDeque.tail t1_7s + let t1C_6s = BankersDeque.tail t1C_7s + + let t1_5 = BankersDeque.tail t1_6 + let t1C_5 = BankersDeque.tail t1C_6 + let t1_5s = BankersDeque.tail t1_6s + let t1C_5s = BankersDeque.tail t1C_6s + + let t1_4 = BankersDeque.tail t1_5 + let t1C_4 = BankersDeque.tail t1C_5 + let t1_4s = BankersDeque.tail t1_5s + let t1C_4s = BankersDeque.tail t1C_5s + + let t1_3 = BankersDeque.tail t1_4 + let t1C_3 = BankersDeque.tail t1C_4 + let t1_3s = BankersDeque.tail t1_4s + let t1C_3s = BankersDeque.tail t1C_4s + + let t1_2 = BankersDeque.tail t1_3 + let t1C_2 = BankersDeque.tail t1C_3 + let t1_2s = BankersDeque.tail t1_3s + let t1C_2s = BankersDeque.tail t1C_3s + + let t1_1 = BankersDeque.tail t1_2 + let t1C_1 = BankersDeque.tail t1C_2 + let t1_1s = BankersDeque.tail t1_2s + let t1C_1s = BankersDeque.tail t1C_2s + + (((BankersDeque.length t1) = 8) && ((BankersDeque.length t1C) = 8) && ((BankersDeque.length t1s) = 8) && ((BankersDeque.length t1Cs) = 8) + && ((BankersDeque.head t1) = "h") && ((BankersDeque.head t1C) = "h") && ((BankersDeque.head t1s) = "h") && ((BankersDeque.head t1Cs) = "h") + && ((BankersDeque.length t1_7) = 7) && ((BankersDeque.length t1C_7) = 7) && ((BankersDeque.length t1_7s) = 7) && ((BankersDeque.length t1C_7s) = 7) + && ((BankersDeque.head t1_7) = "g") && ((BankersDeque.head t1C_7) = "g") && ((BankersDeque.head t1_7s) = "g") && ((BankersDeque.head t1C_7s) = "g") + && ((BankersDeque.length t1_6) = 6) && ((BankersDeque.length t1C_6) = 6) && ((BankersDeque.length t1_6s) = 6) && ((BankersDeque.length t1C_6s) = 6) + && ((BankersDeque.head t1_6) = "f") && ((BankersDeque.head t1C_6) = "f") && ((BankersDeque.head t1_6s) = "f") && ((BankersDeque.head t1C_6s) = "f") + && ((BankersDeque.length t1_5) = 5) && ((BankersDeque.length t1C_5) = 5) && ((BankersDeque.length t1_5s) = 5) && ((BankersDeque.length t1C_5s) = 5) + && ((BankersDeque.head t1_5) = "e") && ((BankersDeque.head t1C_5) = "e") && ((BankersDeque.head t1_5s) = "e") && ((BankersDeque.head t1C_5s) = "e") + && ((BankersDeque.length t1_4) = 4) && ((BankersDeque.length t1C_4) = 4) && ((BankersDeque.length t1_4s) = 4) && ((BankersDeque.length t1C_4s) = 4) + && ((BankersDeque.head t1_4) = "d") && ((BankersDeque.head t1C_4) = "d") && ((BankersDeque.head t1_4s) = "d") && ((BankersDeque.head t1C_4s) = "d") + && ((BankersDeque.length t1_3) = 3) && ((BankersDeque.length t1C_3) = 3) && ((BankersDeque.length t1_3s) = 3) && ((BankersDeque.length t1C_3s) = 3) + && ((BankersDeque.head t1_3) = "c") && ((BankersDeque.head t1C_3) = "c") && ((BankersDeque.head t1_3s) = "c") && ((BankersDeque.head t1C_3s) = "c") + && ((BankersDeque.length t1_2) = 2) && ((BankersDeque.length t1C_2) = 2) && ((BankersDeque.length t1_2s) = 2) && ((BankersDeque.length t1C_2s) = 2) + && ((BankersDeque.head t1_2) = "b") && ((BankersDeque.head t1C_2) = "b") && ((BankersDeque.head t1_2s) = "b") && ((BankersDeque.head t1C_2s) = "b") + && ((BankersDeque.length t1_1) = 1) && ((BankersDeque.length t1C_1) = 1) && ((BankersDeque.length t1_1s) = 1) && ((BankersDeque.length t1C_1s) = 1) + && ((BankersDeque.head t1_1) = "a") && ((BankersDeque.head t1C_1) = "a") && ((BankersDeque.head t1_1s) = "a") && ((BankersDeque.head t1C_1s) = "a")) |> Expect.isTrue "" } + + test "BankersDeque.head, BankersDeque.tail, and BankersDeque.length work test 9" { + let t1 = BankersDeque.tail lena + let t1C = BankersDeque.tail lenaC3 + let t1s = BankersDeque.tail lenasnoc + let t1Cs = BankersDeque.tail lenaC3snoc + + let t1_8 = BankersDeque.tail t1 + let t1C_8 = BankersDeque.tail t1C + let t1_8s = BankersDeque.tail t1s + let t1C_8s = BankersDeque.tail t1Cs + + let t1_7 = BankersDeque.tail t1_8 + let t1C_7 = BankersDeque.tail t1C_8 + let t1_7s = BankersDeque.tail t1_8s + let t1C_7s = BankersDeque.tail t1C_8s + + let t1_6 = BankersDeque.tail t1_7 + let t1C_6 = BankersDeque.tail t1C_7 + let t1_6s = BankersDeque.tail t1_7s + let t1C_6s = BankersDeque.tail t1C_7s + + let t1_5 = BankersDeque.tail t1_6 + let t1C_5 = BankersDeque.tail t1C_6 + let t1_5s = BankersDeque.tail t1_6s + let t1C_5s = BankersDeque.tail t1C_6s + + let t1_4 = BankersDeque.tail t1_5 + let t1C_4 = BankersDeque.tail t1C_5 + let t1_4s = BankersDeque.tail t1_5s + let t1C_4s = BankersDeque.tail t1C_5s + + let t1_3 = BankersDeque.tail t1_4 + let t1C_3 = BankersDeque.tail t1C_4 + let t1_3s = BankersDeque.tail t1_4s + let t1C_3s = BankersDeque.tail t1C_4s + + let t1_2 = BankersDeque.tail t1_3 + let t1C_2 = BankersDeque.tail t1C_3 + let t1_2s = BankersDeque.tail t1_3s + let t1C_2s = BankersDeque.tail t1C_3s + + let t1_1 = BankersDeque.tail t1_2 + let t1C_1 = BankersDeque.tail t1C_2 + let t1_1s = BankersDeque.tail t1_2s + let t1C_1s = BankersDeque.tail t1C_2s + + (((BankersDeque.length t1) = 9) && ((BankersDeque.length t1C) = 9) && ((BankersDeque.length t1s) = 9) && ((BankersDeque.length t1Cs) = 9) + && ((BankersDeque.head t1) = "i") && ((BankersDeque.head t1C) = "i") && ((BankersDeque.head t1s) = "i") && ((BankersDeque.head t1Cs) = "i") + && ((BankersDeque.length t1_8) = 8) && ((BankersDeque.length t1C_8) = 8) && ((BankersDeque.length t1_8s) = 8) && ((BankersDeque.length t1C_8s) = 8) + && ((BankersDeque.head t1_8) = "h") && ((BankersDeque.head t1C_8) = "h") && ((BankersDeque.head t1_8s) = "h") && ((BankersDeque.head t1C_8s) = "h") + && ((BankersDeque.length t1_7) = 7) && ((BankersDeque.length t1C_7) = 7) && ((BankersDeque.length t1_7s) = 7) && ((BankersDeque.length t1C_7s) = 7) + && ((BankersDeque.head t1_7) = "g") && ((BankersDeque.head t1C_7) = "g") && ((BankersDeque.head t1_7s) = "g") && ((BankersDeque.head t1C_7s) = "g") + && ((BankersDeque.length t1_6) = 6) && ((BankersDeque.length t1C_6) = 6) && ((BankersDeque.length t1_6s) = 6) && ((BankersDeque.length t1C_6s) = 6) + && ((BankersDeque.head t1_6) = "f") && ((BankersDeque.head t1C_6) = "f") && ((BankersDeque.head t1_6s) = "f") && ((BankersDeque.head t1C_6s) = "f") + && ((BankersDeque.length t1_5) = 5) && ((BankersDeque.length t1C_5) = 5) && ((BankersDeque.length t1_5s) = 5) && ((BankersDeque.length t1C_5s) = 5) + && ((BankersDeque.head t1_5) = "e") && ((BankersDeque.head t1C_5) = "e") && ((BankersDeque.head t1_5s) = "e") && ((BankersDeque.head t1C_5s) = "e") + && ((BankersDeque.length t1_4) = 4) && ((BankersDeque.length t1C_4) = 4) && ((BankersDeque.length t1_4s) = 4) && ((BankersDeque.length t1C_4s) = 4) + && ((BankersDeque.head t1_4) = "d") && ((BankersDeque.head t1C_4) = "d") && ((BankersDeque.head t1_4s) = "d") && ((BankersDeque.head t1C_4s) = "d") + && ((BankersDeque.length t1_3) = 3) && ((BankersDeque.length t1C_3) = 3) && ((BankersDeque.length t1_3s) = 3) && ((BankersDeque.length t1C_3s) = 3) + && ((BankersDeque.head t1_3) = "c") && ((BankersDeque.head t1C_3) = "c") && ((BankersDeque.head t1_3s) = "c") && ((BankersDeque.head t1C_3s) = "c") + && ((BankersDeque.length t1_2) = 2) && ((BankersDeque.length t1C_2) = 2) && ((BankersDeque.length t1_2s) = 2) && ((BankersDeque.length t1C_2s) = 2) + && ((BankersDeque.head t1_2) = "b") && ((BankersDeque.head t1C_2) = "b") && ((BankersDeque.head t1_2s) = "b") && ((BankersDeque.head t1C_2s) = "b") + && ((BankersDeque.length t1_1) = 1) && ((BankersDeque.length t1C_1) = 1) && ((BankersDeque.length t1_1s) = 1) && ((BankersDeque.length t1C_1s) = 1) + && ((BankersDeque.head t1_1) = "a") && ((BankersDeque.head t1C_1) = "a") && ((BankersDeque.head t1_1s) = "a") && ((BankersDeque.head t1C_1s) = "a")) |> Expect.isTrue "" } + + //the previous series thoroughly tested construction by BankersDeque.snoc, so we'll leave those out + test "BankersDeque.last, BankersDeque.init, and BankersDeque.length work test 1" { + let t1 = BankersDeque.init len2 + let t1C = BankersDeque.init len2C3 - (((length t1) = 1) && ((length t1C) = 1) && ((last t1) = "b") && ((last t1C) = "b")) |> should equal true + (((BankersDeque.length t1) = 1) && ((BankersDeque.length t1C) = 1) && ((BankersDeque.last t1) = "b") && ((BankersDeque.last t1C) = "b")) |> Expect.isTrue "" } -[] -let ``last, init, and length work test 2``() = - let t1 = init len3 - let t1C = init len3C3 + test "BankersDeque.last, BankersDeque.init, and BankersDeque.length work test 2" { + let t1 = BankersDeque.init len3 + let t1C = BankersDeque.init len3C3 - let t1_1 = init t1 - let t1C_1 = init t1C + let t1_1 = BankersDeque.init t1 + let t1C_1 = BankersDeque.init t1C - (((length t1) = 2) && ((length t1C) = 2) && ((last t1) = "b") && ((last t1C) = "b") - && ((length t1_1) = 1) && ((length t1C_1) = 1) && ((last t1_1) = "c") && ((last t1C_1) = "c")) |> should equal true - -[] -let ``last, init, and length work test 3``() = - let t1 = init len4 - let t1C = init len4C3 - let t1_1 = init t1 - let t1C_1 = init t1C - let t1_2 = init t1_1 - let t1C_2 = init t1C_1 + (((BankersDeque.length t1) = 2) && ((BankersDeque.length t1C) = 2) && ((BankersDeque.last t1) = "b") && ((BankersDeque.last t1C) = "b") + && ((BankersDeque.length t1_1) = 1) && ((BankersDeque.length t1C_1) = 1) && ((BankersDeque.last t1_1) = "c") && ((BankersDeque.last t1C_1) = "c")) |> Expect.isTrue "" } + + test "BankersDeque.last, BankersDeque.init, and BankersDeque.length work test 3" { + let t1 = BankersDeque.init len4 + let t1C = BankersDeque.init len4C3 + let t1_1 = BankersDeque.init t1 + let t1C_1 = BankersDeque.init t1C + let t1_2 = BankersDeque.init t1_1 + let t1C_2 = BankersDeque.init t1C_1 - (((length t1) = 3) && ((length t1C) = 3) && ((last t1) = "b") && ((last t1C) = "b") - && ((length t1_1) = 2) && ((length t1C_1) = 2) && ((last t1_1) = "c") && ((last t1C_1) = "c") - && ((length t1_2) = 1) && ((length t1C_2) = 1) && ((last t1_2) = "d") && ((last t1C_2) = "d")) |> should equal true - -[] -let ``last, init, and length work test 4``() = - let t1 = init len5 - let t1C = init len5C3 - let t1_1 = init t1 - let t1C_1 = init t1C - let t1_2 = init t1_1 - let t1C_2 = init t1C_1 - let t1_3 = init t1_2 - let t1C_3 = init t1C_2 + (((BankersDeque.length t1) = 3) && ((BankersDeque.length t1C) = 3) && ((BankersDeque.last t1) = "b") && ((BankersDeque.last t1C) = "b") + && ((BankersDeque.length t1_1) = 2) && ((BankersDeque.length t1C_1) = 2) && ((BankersDeque.last t1_1) = "c") && ((BankersDeque.last t1C_1) = "c") + && ((BankersDeque.length t1_2) = 1) && ((BankersDeque.length t1C_2) = 1) && ((BankersDeque.last t1_2) = "d") && ((BankersDeque.last t1C_2) = "d")) |> Expect.isTrue "" } + + test "BankersDeque.last, BankersDeque.init, and BankersDeque.length work test 4" { + let t1 = BankersDeque.init len5 + let t1C = BankersDeque.init len5C3 + let t1_1 = BankersDeque.init t1 + let t1C_1 = BankersDeque.init t1C + let t1_2 = BankersDeque.init t1_1 + let t1C_2 = BankersDeque.init t1C_1 + let t1_3 = BankersDeque.init t1_2 + let t1C_3 = BankersDeque.init t1C_2 - (((length t1) = 4) && ((length t1C) = 4) && ((last t1) = "b") && ((last t1C) = "b") - && ((length t1_1) = 3) && ((length t1C_1) = 3) && ((last t1_1) = "c") && ((last t1C_1) = "c") - && ((length t1_2) = 2) && ((length t1C_2) = 2) && ((last t1_2) = "d") && ((last t1C_2) = "d") - && ((length t1_3) = 1) && ((length t1C_3) = 1) && ((last t1_3) = "e") && ((last t1C_3) = "e")) |> should equal true - -[] -let ``last, init, and length work test 5``() = - let t1 = init len6 - let t1C = init len6C3 - let t1_1 = init t1 - let t1C_1 = init t1C - let t1_2 = init t1_1 - let t1C_2 = init t1C_1 - let t1_3 = init t1_2 - let t1C_3 = init t1C_2 - let t1_4 = init t1_3 - let t1C_4 = init t1C_3 + (((BankersDeque.length t1) = 4) && ((BankersDeque.length t1C) = 4) && ((BankersDeque.last t1) = "b") && ((BankersDeque.last t1C) = "b") + && ((BankersDeque.length t1_1) = 3) && ((BankersDeque.length t1C_1) = 3) && ((BankersDeque.last t1_1) = "c") && ((BankersDeque.last t1C_1) = "c") + && ((BankersDeque.length t1_2) = 2) && ((BankersDeque.length t1C_2) = 2) && ((BankersDeque.last t1_2) = "d") && ((BankersDeque.last t1C_2) = "d") + && ((BankersDeque.length t1_3) = 1) && ((BankersDeque.length t1C_3) = 1) && ((BankersDeque.last t1_3) = "e") && ((BankersDeque.last t1C_3) = "e")) |> Expect.isTrue "" } + + test "BankersDeque.last, BankersDeque.init, and BankersDeque.length work test 5" { + let t1 = BankersDeque.init len6 + let t1C = BankersDeque.init len6C3 + let t1_1 = BankersDeque.init t1 + let t1C_1 = BankersDeque.init t1C + let t1_2 = BankersDeque.init t1_1 + let t1C_2 = BankersDeque.init t1C_1 + let t1_3 = BankersDeque.init t1_2 + let t1C_3 = BankersDeque.init t1C_2 + let t1_4 = BankersDeque.init t1_3 + let t1C_4 = BankersDeque.init t1C_3 - (((length t1) = 5) && ((length t1C) = 5) && ((last t1) = "b") && ((last t1C) = "b") - && ((length t1_1) = 4) && ((length t1C_1) = 4) && ((last t1_1) = "c") && ((last t1C_1) = "c") - && ((length t1_2) = 3) && ((length t1C_2) = 3) && ((last t1_2) = "d") && ((last t1C_2) = "d") - && ((length t1_3) = 2) && ((length t1C_3) = 2) && ((last t1_3) = "e") && ((last t1C_3) = "e") - && ((length t1_4) = 1) && ((length t1C_4) = 1) && ((last t1_4) = "f") && ((last t1C_4) = "f")) |> should equal true - -[] -let ``last, init, and length work test 6``() = - let t1 = init len7 - let t1C = init len7C3 - let t1_1 = init t1 - let t1C_1 = init t1C - let t1_2 = init t1_1 - let t1C_2 = init t1C_1 - let t1_3 = init t1_2 - let t1C_3 = init t1C_2 - let t1_4 = init t1_3 - let t1C_4 = init t1C_3 - let t1_5 = init t1_4 - let t1C_5 = init t1C_4 + (((BankersDeque.length t1) = 5) && ((BankersDeque.length t1C) = 5) && ((BankersDeque.last t1) = "b") && ((BankersDeque.last t1C) = "b") + && ((BankersDeque.length t1_1) = 4) && ((BankersDeque.length t1C_1) = 4) && ((BankersDeque.last t1_1) = "c") && ((BankersDeque.last t1C_1) = "c") + && ((BankersDeque.length t1_2) = 3) && ((BankersDeque.length t1C_2) = 3) && ((BankersDeque.last t1_2) = "d") && ((BankersDeque.last t1C_2) = "d") + && ((BankersDeque.length t1_3) = 2) && ((BankersDeque.length t1C_3) = 2) && ((BankersDeque.last t1_3) = "e") && ((BankersDeque.last t1C_3) = "e") + && ((BankersDeque.length t1_4) = 1) && ((BankersDeque.length t1C_4) = 1) && ((BankersDeque.last t1_4) = "f") && ((BankersDeque.last t1C_4) = "f")) |> Expect.isTrue "" } + + test "BankersDeque.last, BankersDeque.init, and BankersDeque.length work test 6" { + let t1 = BankersDeque.init len7 + let t1C = BankersDeque.init len7C3 + let t1_1 = BankersDeque.init t1 + let t1C_1 = BankersDeque.init t1C + let t1_2 = BankersDeque.init t1_1 + let t1C_2 = BankersDeque.init t1C_1 + let t1_3 = BankersDeque.init t1_2 + let t1C_3 = BankersDeque.init t1C_2 + let t1_4 = BankersDeque.init t1_3 + let t1C_4 = BankersDeque.init t1C_3 + let t1_5 = BankersDeque.init t1_4 + let t1C_5 = BankersDeque.init t1C_4 - (((length t1) = 6) && ((length t1C) = 6) && ((last t1) = "b") && ((last t1C) = "b") - && ((length t1_1) = 5) && ((length t1C_1) = 5) && ((last t1_1) = "c") && ((last t1C_1) = "c") - && ((length t1_2) = 4) && ((length t1C_2) = 4) && ((last t1_2) = "d") && ((last t1C_2) = "d") - && ((length t1_3) = 3) && ((length t1C_3) = 3) && ((last t1_3) = "e") && ((last t1C_3) = "e") - && ((length t1_4) = 2) && ((length t1C_4) = 2) && ((last t1_4) = "f") && ((last t1C_4) = "f") - && ((length t1_5) = 1) && ((length t1C_5) = 1) && ((last t1_5) = "g") && ((last t1C_5) = "g")) |> should equal true - -[] -let ``last, init, and length work test 7``() = - let t1 = init len8 - let t1C = init len8C3 - let t1_1 = init t1 - let t1C_1 = init t1C - let t1_2 = init t1_1 - let t1C_2 = init t1C_1 - let t1_3 = init t1_2 - let t1C_3 = init t1C_2 - let t1_4 = init t1_3 - let t1C_4 = init t1C_3 - let t1_5 = init t1_4 - let t1C_5 = init t1C_4 - let t1_6 = init t1_5 - let t1C_6 = init t1C_5 + (((BankersDeque.length t1) = 6) && ((BankersDeque.length t1C) = 6) && ((BankersDeque.last t1) = "b") && ((BankersDeque.last t1C) = "b") + && ((BankersDeque.length t1_1) = 5) && ((BankersDeque.length t1C_1) = 5) && ((BankersDeque.last t1_1) = "c") && ((BankersDeque.last t1C_1) = "c") + && ((BankersDeque.length t1_2) = 4) && ((BankersDeque.length t1C_2) = 4) && ((BankersDeque.last t1_2) = "d") && ((BankersDeque.last t1C_2) = "d") + && ((BankersDeque.length t1_3) = 3) && ((BankersDeque.length t1C_3) = 3) && ((BankersDeque.last t1_3) = "e") && ((BankersDeque.last t1C_3) = "e") + && ((BankersDeque.length t1_4) = 2) && ((BankersDeque.length t1C_4) = 2) && ((BankersDeque.last t1_4) = "f") && ((BankersDeque.last t1C_4) = "f") + && ((BankersDeque.length t1_5) = 1) && ((BankersDeque.length t1C_5) = 1) && ((BankersDeque.last t1_5) = "g") && ((BankersDeque.last t1C_5) = "g")) |> Expect.isTrue "" } + + test "BankersDeque.last, BankersDeque.init, and BankersDeque.length work test 7" { + let t1 = BankersDeque.init len8 + let t1C = BankersDeque.init len8C3 + let t1_1 = BankersDeque.init t1 + let t1C_1 = BankersDeque.init t1C + let t1_2 = BankersDeque.init t1_1 + let t1C_2 = BankersDeque.init t1C_1 + let t1_3 = BankersDeque.init t1_2 + let t1C_3 = BankersDeque.init t1C_2 + let t1_4 = BankersDeque.init t1_3 + let t1C_4 = BankersDeque.init t1C_3 + let t1_5 = BankersDeque.init t1_4 + let t1C_5 = BankersDeque.init t1C_4 + let t1_6 = BankersDeque.init t1_5 + let t1C_6 = BankersDeque.init t1C_5 - (((length t1) = 7) && ((length t1C) = 7) && ((last t1) = "b") && ((last t1C) = "b") - && ((length t1_1) = 6) && ((length t1C_1) = 6) && ((last t1_1) = "c") && ((last t1C_1) = "c") - && ((length t1_2) = 5) && ((length t1C_2) = 5) && ((last t1_2) = "d") && ((last t1C_2) = "d") - && ((length t1_3) = 4) && ((length t1C_3) = 4) && ((last t1_3) = "e") && ((last t1C_3) = "e") - && ((length t1_4) = 3) && ((length t1C_4) = 3) && ((last t1_4) = "f") && ((last t1C_4) = "f") - && ((length t1_5) = 2) && ((length t1C_5) = 2) && ((last t1_5) = "g") && ((last t1C_5) = "g") - && ((length t1_6) = 1) && ((length t1C_6) = 1) && ((last t1_6) = "h") && ((last t1C_6) = "h")) |> should equal true - -[] -let ``last, init, and length work test 8``() = - let t1 = init len9 - let t1C = init len9C3 - let t1_1 = init t1 - let t1C_1 = init t1C - let t1_2 = init t1_1 - let t1C_2 = init t1C_1 - let t1_3 = init t1_2 - let t1C_3 = init t1C_2 - let t1_4 = init t1_3 - let t1C_4 = init t1C_3 - let t1_5 = init t1_4 - let t1C_5 = init t1C_4 - let t1_6 = init t1_5 - let t1C_6 = init t1C_5 - let t1_7 = init t1_6 - let t1C_7 = init t1C_6 + (((BankersDeque.length t1) = 7) && ((BankersDeque.length t1C) = 7) && ((BankersDeque.last t1) = "b") && ((BankersDeque.last t1C) = "b") + && ((BankersDeque.length t1_1) = 6) && ((BankersDeque.length t1C_1) = 6) && ((BankersDeque.last t1_1) = "c") && ((BankersDeque.last t1C_1) = "c") + && ((BankersDeque.length t1_2) = 5) && ((BankersDeque.length t1C_2) = 5) && ((BankersDeque.last t1_2) = "d") && ((BankersDeque.last t1C_2) = "d") + && ((BankersDeque.length t1_3) = 4) && ((BankersDeque.length t1C_3) = 4) && ((BankersDeque.last t1_3) = "e") && ((BankersDeque.last t1C_3) = "e") + && ((BankersDeque.length t1_4) = 3) && ((BankersDeque.length t1C_4) = 3) && ((BankersDeque.last t1_4) = "f") && ((BankersDeque.last t1C_4) = "f") + && ((BankersDeque.length t1_5) = 2) && ((BankersDeque.length t1C_5) = 2) && ((BankersDeque.last t1_5) = "g") && ((BankersDeque.last t1C_5) = "g") + && ((BankersDeque.length t1_6) = 1) && ((BankersDeque.length t1C_6) = 1) && ((BankersDeque.last t1_6) = "h") && ((BankersDeque.last t1C_6) = "h")) |> Expect.isTrue "" } + + test "BankersDeque.last, BankersDeque.init, and BankersDeque.length work test 8" { + let t1 = BankersDeque.init len9 + let t1C = BankersDeque.init len9C3 + let t1_1 = BankersDeque.init t1 + let t1C_1 = BankersDeque.init t1C + let t1_2 = BankersDeque.init t1_1 + let t1C_2 = BankersDeque.init t1C_1 + let t1_3 = BankersDeque.init t1_2 + let t1C_3 = BankersDeque.init t1C_2 + let t1_4 = BankersDeque.init t1_3 + let t1C_4 = BankersDeque.init t1C_3 + let t1_5 = BankersDeque.init t1_4 + let t1C_5 = BankersDeque.init t1C_4 + let t1_6 = BankersDeque.init t1_5 + let t1C_6 = BankersDeque.init t1C_5 + let t1_7 = BankersDeque.init t1_6 + let t1C_7 = BankersDeque.init t1C_6 - (((length t1) = 8) && ((length t1C) = 8) && ((last t1) = "b") && ((last t1C) = "b") - && ((length t1_1) = 7) && ((length t1C_1) = 7) && ((last t1_1) = "c") && ((last t1C_1) = "c") - && ((length t1_2) = 6) && ((length t1C_2) = 6) && ((last t1_2) = "d") && ((last t1C_2) = "d") - && ((length t1_3) = 5) && ((length t1C_3) = 5) && ((last t1_3) = "e") && ((last t1C_3) = "e") - && ((length t1_4) = 4) && ((length t1C_4) = 4) && ((last t1_4) = "f") && ((last t1C_4) = "f") - && ((length t1_5) = 3) && ((length t1C_5) = 3) && ((last t1_5) = "g") && ((last t1C_5) = "g") - && ((length t1_6) = 2) && ((length t1C_6) = 2) && ((last t1_6) = "h") && ((last t1C_6) = "h") - && ((length t1_7) = 1) && ((length t1C_7) = 1) && ((last t1_7) = "i") && ((last t1C_7) = "i")) |> should equal true - -[] -let ``last, init, and length work test 9``() = - let t1 = init lena - let t1C = init lenaC3 - let t1_1 = init t1 - let t1C_1 = init t1C - let t1_2 = init t1_1 - let t1C_2 = init t1C_1 - let t1_3 = init t1_2 - let t1C_3 = init t1C_2 - let t1_4 = init t1_3 - let t1C_4 = init t1C_3 - let t1_5 = init t1_4 - let t1C_5 = init t1C_4 - let t1_6 = init t1_5 - let t1C_6 = init t1C_5 - let t1_7 = init t1_6 - let t1C_7 = init t1C_6 - let t1_8 = init t1_7 - let t1C_8 = init t1C_7 + (((BankersDeque.length t1) = 8) && ((BankersDeque.length t1C) = 8) && ((BankersDeque.last t1) = "b") && ((BankersDeque.last t1C) = "b") + && ((BankersDeque.length t1_1) = 7) && ((BankersDeque.length t1C_1) = 7) && ((BankersDeque.last t1_1) = "c") && ((BankersDeque.last t1C_1) = "c") + && ((BankersDeque.length t1_2) = 6) && ((BankersDeque.length t1C_2) = 6) && ((BankersDeque.last t1_2) = "d") && ((BankersDeque.last t1C_2) = "d") + && ((BankersDeque.length t1_3) = 5) && ((BankersDeque.length t1C_3) = 5) && ((BankersDeque.last t1_3) = "e") && ((BankersDeque.last t1C_3) = "e") + && ((BankersDeque.length t1_4) = 4) && ((BankersDeque.length t1C_4) = 4) && ((BankersDeque.last t1_4) = "f") && ((BankersDeque.last t1C_4) = "f") + && ((BankersDeque.length t1_5) = 3) && ((BankersDeque.length t1C_5) = 3) && ((BankersDeque.last t1_5) = "g") && ((BankersDeque.last t1C_5) = "g") + && ((BankersDeque.length t1_6) = 2) && ((BankersDeque.length t1C_6) = 2) && ((BankersDeque.last t1_6) = "h") && ((BankersDeque.last t1C_6) = "h") + && ((BankersDeque.length t1_7) = 1) && ((BankersDeque.length t1C_7) = 1) && ((BankersDeque.last t1_7) = "i") && ((BankersDeque.last t1C_7) = "i")) |> Expect.isTrue "" } + + test "BankersDeque.last, BankersDeque.init, and BankersDeque.length work test 9" { + let t1 = BankersDeque.init lena + let t1C = BankersDeque.init lenaC3 + let t1_1 = BankersDeque.init t1 + let t1C_1 = BankersDeque.init t1C + let t1_2 = BankersDeque.init t1_1 + let t1C_2 = BankersDeque.init t1C_1 + let t1_3 = BankersDeque.init t1_2 + let t1C_3 = BankersDeque.init t1C_2 + let t1_4 = BankersDeque.init t1_3 + let t1C_4 = BankersDeque.init t1C_3 + let t1_5 = BankersDeque.init t1_4 + let t1C_5 = BankersDeque.init t1C_4 + let t1_6 = BankersDeque.init t1_5 + let t1C_6 = BankersDeque.init t1C_5 + let t1_7 = BankersDeque.init t1_6 + let t1C_7 = BankersDeque.init t1C_6 + let t1_8 = BankersDeque.init t1_7 + let t1C_8 = BankersDeque.init t1C_7 - (((length t1) = 9) && ((length t1C) = 9) && ((last t1) = "b") && ((last t1C) = "b") - && ((length t1_1) = 8) && ((length t1C_1) = 8) && ((last t1_1) = "c") && ((last t1C_1) = "c") - && ((length t1_2) = 7) && ((length t1C_2) = 7) && ((last t1_2) = "d") && ((last t1C_2) = "d") - && ((length t1_3) = 6) && ((length t1C_3) = 6) && ((last t1_3) = "e") && ((last t1C_3) = "e") - && ((length t1_4) = 5) && ((length t1C_4) = 5) && ((last t1_4) = "f") && ((last t1C_4) = "f") - && ((length t1_5) = 4) && ((length t1C_5) = 4) && ((last t1_5) = "g") && ((last t1C_5) = "g") - && ((length t1_6) = 3) && ((length t1C_6) = 3) && ((last t1_6) = "h") && ((last t1C_6) = "h") - && ((length t1_7) = 2) && ((length t1C_7) = 2) && ((last t1_7) = "i") && ((last t1C_7) = "i") - && ((length t1_8) = 1) && ((length t1C_8) = 1) && ((last t1_8) = "j") && ((last t1C_8) = "j")) |> should equal true - -[] -let ``IEnumerable Seq``() = - (lena |> Seq.toArray).[5] |> should equal "e" - -[] -let ``IEnumerable Seq length``() = - lena |> Seq.length |> should equal 10 - -[] -let ``type cons works``() = - lena.Cons "zz" |> head |> should equal "zz" - -[] -let ``IDeque cons works``() = - ((lena :> IDeque).Cons "zz").Head |> should equal "zz" - -[] -let ``ofCatLists and uncons``() = - let d = ofCatLists ["a";"b";"c"] ["d";"e";"f"] - let h1, t1 = uncons d - let h2, t2 = uncons t1 - let h3, t3 = uncons t2 - let h4, t4 = uncons t3 - let h5, t5 = uncons t4 - let h6, t6 = uncons t5 - - ((h1 = "a") && (h2 = "b") && (h3 = "c") && (h4 = "d") && (h5 = "e") && (h6 = "f") && (isEmpty t6)) |> should equal true - -[] -let ``ofCatSeqs and uncons``() = - let d = ofCatSeqs (seq {'a'..'c'}) (seq {'d'..'f'}) - let h1, t1 = uncons d - let h2, t2 = uncons t1 - let h3, t3 = uncons t2 - let h4, t4 = uncons t3 - let h5, t5 = uncons t4 - let h6, t6 = uncons t5 - - ((h1 = 'a') && (h2 = 'b') && (h3 = 'c') && (h4 = 'd') && (h5 = 'e') && (h6 = 'f') && (isEmpty t6)) |> should equal true - -[] -let ``unsnoc works``() = - let d = ofCatLists ["f";"e";"d"] ["c";"b";"a"] - let i1, l1 = unsnoc d - let i2, l2 = unsnoc i1 - let i3, l3 = unsnoc i2 - let i4, l4 = unsnoc i3 - let i5, l5 = unsnoc i4 - let i6, l6 = unsnoc i5 - - ((l1 = "a") && (l2 = "b") && (l3 = "c") && (l4 = "d") && (l5 = "e") && (l6 = "f") && (isEmpty i6)) |> should equal true - -[] -let ``snoc pattern discriminator``() = - let d = (ofCatLists ["f";"e";"d"] ["c";"b";"a"]) - let i1, l1 = unsnoc d - - let i2, l2 = - match i1 with - | Snoc(i, l) -> i, l - | _ -> i1, "x" - - ((l2 = "b") && ((length i2) = 4)) |> should equal true - -[] -let ``cons pattern discriminator``() = - let d = (ofCatLists ["f";"e";"d"] ["c";"b";"a"]) - let h1, t1 = uncons d - - let h2, t2 = - match t1 with - | Cons(h, t) -> h, t - | _ -> "x", t1 - - ((h2 = "e") && ((length t2) = 4)) |> should equal true - -[] -let ``cons and snoc pattern discriminator``() = - let d = (ofCatLists ["f";"e";"d"] ["c";"b";"a"]) + (((BankersDeque.length t1) = 9) && ((BankersDeque.length t1C) = 9) && ((BankersDeque.last t1) = "b") && ((BankersDeque.last t1C) = "b") + && ((BankersDeque.length t1_1) = 8) && ((BankersDeque.length t1C_1) = 8) && ((BankersDeque.last t1_1) = "c") && ((BankersDeque.last t1C_1) = "c") + && ((BankersDeque.length t1_2) = 7) && ((BankersDeque.length t1C_2) = 7) && ((BankersDeque.last t1_2) = "d") && ((BankersDeque.last t1C_2) = "d") + && ((BankersDeque.length t1_3) = 6) && ((BankersDeque.length t1C_3) = 6) && ((BankersDeque.last t1_3) = "e") && ((BankersDeque.last t1C_3) = "e") + && ((BankersDeque.length t1_4) = 5) && ((BankersDeque.length t1C_4) = 5) && ((BankersDeque.last t1_4) = "f") && ((BankersDeque.last t1C_4) = "f") + && ((BankersDeque.length t1_5) = 4) && ((BankersDeque.length t1C_5) = 4) && ((BankersDeque.last t1_5) = "g") && ((BankersDeque.last t1C_5) = "g") + && ((BankersDeque.length t1_6) = 3) && ((BankersDeque.length t1C_6) = 3) && ((BankersDeque.last t1_6) = "h") && ((BankersDeque.last t1C_6) = "h") + && ((BankersDeque.length t1_7) = 2) && ((BankersDeque.length t1C_7) = 2) && ((BankersDeque.last t1_7) = "i") && ((BankersDeque.last t1C_7) = "i") + && ((BankersDeque.length t1_8) = 1) && ((BankersDeque.length t1C_8) = 1) && ((BankersDeque.last t1_8) = "j") && ((BankersDeque.last t1C_8) = "j")) |> Expect.isTrue "" } + + test "IEnumerable Seq" { + (lena |> Seq.toArray).[5] |> Expect.equal "" "e" } + + test "IEnumerable Seq BankersDeque.length" { + lena |> Seq.length |> Expect.equal "" 10 } + + test "type BankersDeque.cons works" { + lena.Cons "zz" |> BankersDeque.head |> Expect.equal "" "zz" } + + test "IDeque BankersDeque.cons works" { + ((lena :> IDeque).Cons "zz").Head |> Expect.equal "" "zz" } + + test "BankersDeque.ofCatLists and BankersDeque.uncons" { + let d = BankersDeque.ofCatLists ["a";"b";"c"] ["d";"e";"f"] + let h1, t1 = BankersDeque.uncons d + let h2, t2 = BankersDeque.uncons t1 + let h3, t3 = BankersDeque.uncons t2 + let h4, t4 = BankersDeque.uncons t3 + let h5, t5 = BankersDeque.uncons t4 + let h6, t6 = BankersDeque.uncons t5 + + ((h1 = "a") && (h2 = "b") && (h3 = "c") && (h4 = "d") && (h5 = "e") && (h6 = "f") && (BankersDeque.isEmpty t6)) |> Expect.isTrue "" } + + test "BankersDeque.ofCatSeqs and BankersDeque.uncons" { + let d = BankersDeque.ofCatSeqs (seq {'a'..'c'}) (seq {'d'..'f'}) + let h1, t1 = BankersDeque.uncons d + let h2, t2 = BankersDeque.uncons t1 + let h3, t3 = BankersDeque.uncons t2 + let h4, t4 = BankersDeque.uncons t3 + let h5, t5 = BankersDeque.uncons t4 + let h6, t6 = BankersDeque.uncons t5 + + ((h1 = 'a') && (h2 = 'b') && (h3 = 'c') && (h4 = 'd') && (h5 = 'e') && (h6 = 'f') && (BankersDeque.isEmpty t6)) |> Expect.isTrue "" } + + test "BankersDeque.unsnoc works" { + let d = BankersDeque.ofCatLists ["f";"e";"d"] ["c";"b";"a"] + let i1, l1 = BankersDeque.unsnoc d + let i2, l2 = BankersDeque.unsnoc i1 + let i3, l3 = BankersDeque.unsnoc i2 + let i4, l4 = BankersDeque.unsnoc i3 + let i5, l5 = BankersDeque.unsnoc i4 + let i6, l6 = BankersDeque.unsnoc i5 + + ((l1 = "a") && (l2 = "b") && (l3 = "c") && (l4 = "d") && (l5 = "e") && (l6 = "f") && (BankersDeque.isEmpty i6)) |> Expect.isTrue "" } + + test "BankersDeque.snoc pattern discriminator" { + let d = (BankersDeque.ofCatLists ["f";"e";"d"] ["c";"b";"a"]) + let i1, l1 = BankersDeque.unsnoc d + + let i2, l2 = + match i1 with + | BankersDeque.Snoc(i, l) -> i, l + | _ -> i1, "x" + + ((l2 = "b") && ((BankersDeque.length i2) = 4)) |> Expect.isTrue "" } + + test "BankersDeque.cons pattern discriminator" { + let d = (BankersDeque.ofCatLists ["f";"e";"d"] ["c";"b";"a"]) + let h1, t1 = BankersDeque.uncons d + + let h2, t2 = + match t1 with + | BankersDeque.Cons(h, t) -> h, t + | _ -> "x", t1 + + ((h2 = "e") && ((BankersDeque.length t2) = 4)) |> Expect.isTrue "" } + + test "BankersDeque.cons and BankersDeque.snoc pattern discriminator" { + let d = (BankersDeque.ofCatLists ["f";"e";"d"] ["c";"b";"a"]) - let mid1 = - match d with - | Cons(h, Snoc(i, l)) -> i - | _ -> d - - let head, last = - match mid1 with - | Cons(h, Snoc(i, l)) -> h, l - | _ -> "x", "x" - - ((head = "e") && (last = "b")) |> should equal true - -[] -let ``rev empty dqueue should be empty``() = - isEmpty (rev (empty 2)) |> should equal true - -[] -let ``rev dqueue length 1``() = - ((head (rev len1) = "a") && (head (rev len1C3) = "a")) |> should equal true - -[] -let ``rev dqueue length 2``() = - let r1 = rev len2 - let r1c = rev len2C3 - let h1 = head r1 - let h1c = head r1c - let t2 = tail r1 - let t2c = tail r1c - let h2 = head t2 - let h2c = head t2c - - ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b")) |> should equal true - -[] -let ``rev dqueue length 3``() = - let r1 = rev len3 - let r1c = rev len3C3 - let h1 = head r1 - let h1c = head r1c - let t2 = tail r1 - let t2c = tail r1c - let h2 = head t2 - let h2c = head t2c - let t3 = tail t2 - let t3c = tail t2c - let h3 = head t3 - let h3c = head t3c - - ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c")) |> should equal true - -[] -let ``rev dqueue length 4``() = - let r1 = rev len4 - let r1c = rev len4C3 - let h1 = head r1 - let h1c = head r1c - let t2 = tail r1 - let t2c = tail r1c - let h2 = head t2 - let h2c = head t2c - let t3 = tail t2 - let t3c = tail t2c - let h3 = head t3 - let h3c = head t3c - let t4 = tail t3 - let t4c = tail t3c - let h4 = head t4 - let h4c = head t4c - - ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d")) |> should equal true - -[] -let ``rev dqueue length 5``() = - let r1 = rev len5 - let r1c = rev len5C3 - let h1 = head r1 - let h1c = head r1c - let t2 = tail r1 - let t2c = tail r1c - let h2 = head t2 - let h2c = head t2c - let t3 = tail t2 - let t3c = tail t2c - let h3 = head t3 - let h3c = head t3c - let t4 = tail t3 - let t4c = tail t3c - let h4 = head t4 - let h4c = head t4c - let t5 = tail t4 - let t5c = tail t4c - let h5 = head t5 - let h5c = head t5c - - ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") - && (h5 = "e") && (h5c = "e")) |> should equal true - -[] -//length 6 more than sufficient to test rev -let ``rev dqueue length 6``() = - let r1 = rev len6 - let r1c = rev len6C3 - let h1 = head r1 - let h1c = head r1c - let t2 = tail r1 - let t2c = tail r1c - let h2 = head t2 - let h2c = head t2c - let t3 = tail t2 - let t3c = tail t2c - let h3 = head t3 - let h3c = head t3c - let t4 = tail t3 - let t4c = tail t3c - let h4 = head t4 - let h4c = head t4c - let t5 = tail t4 - let t5c = tail t4c - let h5 = head t5 - let h5c = head t5c - let t6 = tail t5 - let t6c = tail t5c - let h6 = head t6 - let h6c = head t6c - - ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") - && (h5 = "e") && (h5c = "e") && (h6 = "f") && (h6c = "f")) |> should equal true - -[] -let ``ofSeq and ofSeqC empty``() = - ((isEmpty (ofSeq [])) && (isEmpty (ofSeqC 3 []))) |> should equal true - -[] -let ``ofSeq and ofSeqC length 1``() = - ((head (ofSeq ["a"]) = "a") && (head (ofSeqC 3 ["a"]) = "a")) |> should equal true - -[] -let ``ofSeq and ofSeqC length 2``() = - let r1 = ofSeq ["a";"b"] - let r1c = ofSeqC 3 ["a";"b"] - let h1 = head r1 - let h1c = head r1c - let t2 = tail r1 - let t2c = tail r1c - let h2 = head t2 - let h2c = head t2c - - ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b")) |> should equal true - -[] -let ``ofSeq and ofSeqC length 3``() = - let r1 = ofSeq ["a";"b";"c"] - let r1c = ofSeqC 3 ["a";"b";"c"] - let h1 = head r1 - let h1c = head r1c - let t2 = tail r1 - let t2c = tail r1c - let h2 = head t2 - let h2c = head t2c - let t3 = tail t2 - let t3c = tail t2c - let h3 = head t3 - let h3c = head t3c - - ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c")) |> should equal true - -[] -let ``ofSeq and ofSeqC length 4``() = - let r1 = ofSeq ["a";"b";"c";"d"] - let r1c = ofSeqC 3 ["a";"b";"c";"d"] - let h1 = head r1 - let h1c = head r1c - let t2 = tail r1 - let t2c = tail r1c - let h2 = head t2 - let h2c = head t2c - let t3 = tail t2 - let t3c = tail t2c - let h3 = head t3 - let h3c = head t3c - let t4 = tail t3 - let t4c = tail t3c - let h4 = head t4 - let h4c = head t4c - - ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d")) |> should equal true - -[] -//length 5 more than sufficient to test ofSeq and ofSeqC -let ``ofSeq and ofSeqC length 5``() = - let r1 = ofSeq ["a";"b";"c";"d";"e"] - let r1c = ofSeqC 3 ["a";"b";"c";"d";"e"] - let h1 = head r1 - let h1c = head r1c - let t2 = tail r1 - let t2c = tail r1c - let h2 = head t2 - let h2c = head t2c - let t3 = tail t2 - let t3c = tail t2c - let h3 = head t3 - let h3c = head t3c - let t4 = tail t3 - let t4c = tail t3c - let h4 = head t4 - let h4c = head t4c - let t5 = tail t4 - let t5c = tail t4c - let h5 = head t5 - let h5c = head t5c - - ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") - && (h5 = "e") && (h5c = "e")) |> should equal true - -[] -//length 5 more than sufficient to test ofSeq and ofSeqC -let ``ofSeq and ofSeqC length 6``() = - let r1 = ofSeq ["a";"b";"c";"d";"e";"f"] - let r1c = ofSeqC 3 ["a";"b";"c";"d";"e";"f"] - let h1 = head r1 - let h1c = head r1c - let t2 = tail r1 - let t2c = tail r1c - let h2 = head t2 - let h2c = head t2c - let t3 = tail t2 - let t3c = tail t2c - let h3 = head t3 - let h3c = head t3c - let t4 = tail t3 - let t4c = tail t3c - let h4 = head t4 - let h4c = head t4c - let t5 = tail t4 - let t5c = tail t4c - let h5 = head t5 - let h5c = head t5c - let t6 = tail t5 - let t6c = tail t5c - let h6 = head t6 - let h6c = head t6c - - ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") - && (h5 = "e") && (h5c = "e") && (h6 = "f") && (h6c = "f")) |> should equal true - -[] -let ``appending empty dqueus``() = - ((isEmpty (append (ofSeq []) (ofSeq []) )) && (isEmpty (append (empty 3) (empty 3))) - ) |> should equal true - -[] -let ``appending empty and length 1``() = - ((head (append (ofSeq []) len1) = "a") && (head (append len1 (empty 3)) = "a")) |> should equal true - -[] -let ``appending empty and length 2``() = - let r1 = append (ofSeq []) (ofSeq ["a";"b"]) - let r1c = append (empty 3) (ofSeqC 3 ["a";"b"]) - let h1 = head r1 - let h1c = head r1c - let t2 = tail r1 - let t2c = tail r1c - let h2 = head t2 - let h2c = head t2c - - let r1r = append (ofSeq ["a";"b"]) (ofSeq []) - let r1cr = append (ofSeqC 3 ["a";"b"]) (empty 3) - let h1r = head r1r - let h1cr = head r1cr - let t2r = tail r1r - let t2cr = tail r1cr - let h2r = head t2r - let h2cr = head t2cr - - ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") - && (h1r = "a") && (h1cr = "a") && (h2r = "b") && (h2cr = "b")) |> should equal true - -[] -let ``appending length 1 and length 2``() = - let r1 = append (ofSeq ["a"]) (ofSeq ["b";"c"]) - let r1c = append (ofSeqC 3 ["a"]) (ofSeqC 3 ["b";"c"]) - let h1 = head r1 - let h1c = head r1c - let t2 = tail r1 - let t2c = tail r1c - let h2 = head t2 - let h2c = head t2c - let t3 = tail t2 - let t3c = tail t2c - let h3 = head t3 - let h3c = head t3c - - let r1r = append (ofSeq ["a";"b"]) (ofSeq ["c"]) - let r1cr = append (ofSeqC 3 ["a";"b"]) (ofSeqC 3 ["c"]) - let h1r = head r1r - let h1cr = head r1cr - let t2r = tail r1r - let t2cr = tail r1cr - let h2r = head t2r - let h2cr = head t2cr - let t3r = tail t2r - let t3cr = tail t2cr - let h3r = head t3r - let h3cr = head t3cr - - ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") - && (h1r = "a") && (h1cr = "a") && (h2r = "b") && (h2cr = "b") && (h3r = "c") && (h3cr = "c")) |> should equal true - -[] -let ``appending length 1 and length 3``() = - let r1 = append (ofSeq ["a"]) (ofSeq ["b";"c";"d"]) - let r1c = append (ofSeqC 3 ["a"]) (ofSeqC 3 ["b";"c";"d"]) - let h1 = head r1 - let h1c = head r1c - let t2 = tail r1 - let t2c = tail r1c - let h2 = head t2 - let h2c = head t2c - let t3 = tail t2 - let t3c = tail t2c - let h3 = head t3 - let h3c = head t3c - let t4 = tail t3 - let t4c = tail t3c - let h4 = head t4 - let h4c = head t4c - - let r1r = append (ofSeq ["a";"b";"c"]) (ofSeq ["d"]) - let r1cr = append (ofSeqC 3 ["a";"b";"c"]) (ofSeqC 3 ["d"]) - let h1r = head r1r - let h1cr = head r1cr - let t2r = tail r1r - let t2cr = tail r1cr - let h2r = head t2r - let h2cr = head t2cr - let t3r = tail t2r - let t3cr = tail t2cr - let h3r = head t3r - let h3cr = head t3cr - let t4r = tail t3r - let t4cr = tail t3cr - let h4r = head t4r - let h4cr = head t4cr - - ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") - && (h1r = "a") && (h1cr = "a") && (h2r = "b") && (h2cr = "b") && (h3r = "c") && (h3cr = "c") && (h4r = "d") && (h4cr = "d")) |> should equal true - -[] -let ``appending length 1 and length 4``() = - let r1 = append (ofSeq ["a"]) (ofSeq ["b";"c";"d";"e"]) - let r1c = append (ofSeqC 3 ["a"]) (ofSeqC 3 ["b";"c";"d";"e"]) - let h1 = head r1 - let h1c = head r1c - let t2 = tail r1 - let t2c = tail r1c - let h2 = head t2 - let h2c = head t2c - let t3 = tail t2 - let t3c = tail t2c - let h3 = head t3 - let h3c = head t3c - let t4 = tail t3 - let t4c = tail t3c - let h4 = head t4 - let h4c = head t4c - - let t5 = tail t4 - let t5c = tail t4c - let h5 = head t5 - let h5c = head t5c - - let r1r = append (ofSeq ["a";"b";"c";"d"]) (ofSeq ["e"]) - let r1cr = append (ofSeqC 3 ["a";"b";"c";"d"]) (ofSeqC 3 ["e"]) - let h1r = head r1r - let h1cr = head r1cr - let t2r = tail r1r - let t2cr = tail r1cr - let h2r = head t2r - let h2cr = head t2cr - let t3r = tail t2r - let t3cr = tail t2cr - let h3r = head t3r - let h3cr = head t3cr - let t4r = tail t3r - let t4cr = tail t3cr - let h4r = head t4r - let h4cr = head t4cr - - let t5r = tail t4r - let t5cr = tail t4cr - let h5r = head t5r - let h5cr = head t5cr - - ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") - && (h5 = "e") && (h5c = "e") - && (h1r = "a") && (h1cr = "a") && (h2r = "b") && (h2cr = "b") && (h3r = "c") && (h3cr = "c") && (h4r = "d") && (h4cr = "d") - && (h5r = "e") && (h5cr = "e")) |> should equal true - -[] -let ``appending length 1 and length 5``() = - let r1 = append (ofSeq ["a"]) (ofSeq ["b";"c";"d";"e";"f"]) - let r1c = append (ofSeqC 3 ["a"]) (ofSeqC 3 ["b";"c";"d";"e";"f"]) - let h1 = head r1 - let h1c = head r1c - let t2 = tail r1 - let t2c = tail r1c - let h2 = head t2 - let h2c = head t2c - let t3 = tail t2 - let t3c = tail t2c - let h3 = head t3 - let h3c = head t3c - let t4 = tail t3 - let t4c = tail t3c - let h4 = head t4 - let h4c = head t4c - let t5 = tail t4 - let t5c = tail t4c - let h5 = head t5 - let h5c = head t5c - let t6 = tail t5 - let t6c = tail t5c - let h6 = head t6 - let h6c = head t6c - - let r1r = append (ofSeq ["a";"b";"c";"d";"e"]) (ofSeq ["f"]) - let r1cr = append (ofSeqC 3 ["a";"b";"c";"d";"e"]) (ofSeqC 3 ["f"]) - let h1r = head r1r - let h1cr = head r1cr - let t2r = tail r1r - let t2cr = tail r1cr - let h2r = head t2r - let h2cr = head t2cr - let t3r = tail t2r - let t3cr = tail t2cr - let h3r = head t3r - let h3cr = head t3cr - let t4r = tail t3r - let t4cr = tail t3cr - let h4r = head t4r - let h4cr = head t4cr - let t5r = tail t4r - let t5cr = tail t4cr - let h5r = head t5r - let h5cr = head t5cr - let t6r = tail t5r - let t6cr = tail t5cr - let h6r = head t6r - let h6cr = head t6cr - - ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") - && (h5 = "e") && (h5c = "e") && (h6 = "f") && (h6c = "f") - && (h1r = "a") && (h1cr = "a") && (h2r = "b") && (h2cr = "b") && (h3r = "c") && (h3cr = "c") && (h4r = "d") && (h4cr = "d") - && (h5r = "e") && (h5cr = "e") && (h6r = "f") && (h6cr = "f")) |> should equal true - -[] -let ``appending length 6 and length 7``() = - let r1 = append (ofSeq ["a";"b";"c";"d";"e";"f"]) (ofSeq ["g";"h";"i";"j";"k";"l";"m"]) - let r1c = append (ofSeqC 3 ["a";"b";"c";"d";"e";"f"]) (ofSeqC 3 ["g";"h";"i";"j";"k";"l";"m"]) - let h1 = head r1 - let h1c = head r1c - let t2 = tail r1 - let t2c = tail r1c - let h2 = head t2 - let h2c = head t2c - let t3 = tail t2 - let t3c = tail t2c - let h3 = head t3 - let h3c = head t3c - let t4 = tail t3 - let t4c = tail t3c - let h4 = head t4 - let h4c = head t4c - let t5 = tail t4 - let t5c = tail t4c - let h5 = head t5 - let h5c = head t5c - let t6 = tail t5 - let t6c = tail t5c - let h6 = head t6 - let h6c = head t6c - let h6 = head t6 - let h6c = head t6c - let t7 = tail t6 - let t7c = tail t6c - let h7 = head t7 - let h7c = head t7c - let h7 = head t7 - let h7c = head t7c - let t8 = tail t7 - let t8c = tail t7c - let h8 = head t8 - let h8c = head t8c - let h8 = head t8 - let h8c = head t8c - let t9 = tail t8 - let t9c = tail t8c - let h9 = head t9 - let h9c = head t9c - let h9 = head t9 - let h9c = head t9c - let t10 = tail t9 - let t10c = tail t9c - let h10 = head t10 - let h10c = head t10c - let h10 = head t10 - let h10c = head t10c - let t11 = tail t10 - let t11c = tail t10c - let h11 = head t11 - let h11c = head t11c - let h11 = head t11 - let h11c = head t11c - let t12 = tail t11 - let t12c = tail t11c - let h12 = head t12 - let h12c = head t12c - let h12 = head t12 - let h12c = head t12c - let t13 = tail t12 - let t13c = tail t12c - let h13 = head t13 - let h13c = head t13c - let h13 = head t13 - let h13c = head t13c - - let r1r = append (ofSeq ["a";"b";"c";"d";"e";"f";"g"]) (ofSeq ["h";"i";"j";"k";"l";"m"]) - let r1cr = append (ofSeqC 3 ["a";"b";"c";"d";"e";"f";"g"]) (ofSeqC 3 ["h";"i";"j";"k";"l";"m"]) - let h1r = head r1r - let h1cr = head r1cr - let t2r = tail r1r - let t2cr = tail r1cr - let h2r = head t2r - let h2cr = head t2cr - let t3r = tail t2r - let t3cr = tail t2cr - let h3r = head t3r - let h3cr = head t3cr - let t4r = tail t3r - let t4cr = tail t3cr - let h4r = head t4r - let h4cr = head t4cr - let t5r = tail t4r - let t5cr = tail t4cr - let h5r = head t5r - let h5cr = head t5cr - let t6r = tail t5r - let t6cr = tail t5cr - let h6r = head t6r - let h6cr = head t6cr - let t7r = tail t6r - let t7cr = tail t6cr - let h7r = head t7r - let h7cr = head t7cr - let h7r = head t7r - let h7cr = head t7cr - let t8r = tail t7r - let t8cr = tail t7cr - let h8r = head t8r - let h8cr = head t8cr - let h8r = head t8r - let h8cr = head t8cr - let t9r = tail t8r - let t9cr = tail t8cr - let h9r = head t9r - let h9cr = head t9cr - let h9r = head t9r - let h9cr = head t9cr - let t10r = tail t9r - let t10cr = tail t9cr - let h10r = head t10r - let h10cr = head t10cr - let h10r = head t10r - let h10cr = head t10cr - let t11r = tail t10r - let t11cr = tail t10cr - let h11r = head t11r - let h11cr = head t11cr - let h11r = head t11r - let h11cr = head t11cr - let t12r = tail t11r - let t12cr = tail t11cr - let h12r = head t12r - let h12cr = head t12cr - let h12r = head t12r - let h12cr = head t12cr - let t13r = tail t12r - let t13cr = tail t12cr - let h13r = head t13r - let h13cr = head t13cr - let h13r = head t13r - let h13cr = head t13cr - - ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") - && (h5 = "e") && (h5c = "e") && (h6 = "f") && (h6c = "f") && (h7 = "g") && (h7c = "g") && (h8 = "h") && (h8c = "h") - && (h9 = "i") && (h9c = "i") && (h10 = "j") && (h10c = "j") && (h11 = "k") && (h11c = "k") && (h12 = "l") && (h12c = "l") - && (h13 = "m") && (h13c = "m") && (h1r = "a") && (h1cr = "a") && (h2r = "b") && (h2cr = "b") && (h3r = "c") && (h3cr = "c") - && (h4r = "d") && (h4cr = "d") && (h5r = "e") && (h5cr = "e") && (h6r = "f") && (h6cr = "f") && (h7r = "g") && (h7cr = "g") - && (h8r = "h") && (h8cr = "h") && (h9r = "i") && (h9cr = "i") && (h10r = "j") && (h10cr = "j") - && (h11r = "k") && (h11cr = "k") && (h12r = "l") && (h12cr = "l") && (h13r = "m") && (h13cr = "m")) |> should equal true - -[] -let ``appending length 2 and length 2``() = - let r1 = append (ofSeq ["a";"b"]) (ofSeq ["c";"d"]) - let r1c = append (ofSeqC 3 ["a";"b"]) (ofSeqC 3 ["c";"d"]) - let h1 = head r1 - let h1c = head r1c - let t2 = tail r1 - let t2c = tail r1c - let h2 = head t2 - let h2c = head t2c - let t3 = tail t2 - let t3c = tail t2c - let h3 = head t3 - let h3c = head t3c - let t4 = tail t3 - let t4c = tail t3c - let h4 = head t4 - let h4c = head t4c - - ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d")) |> should equal true - -[] -let ``appending length 2 and length 3``() = - let r1 = append (ofSeq ["a";"b"]) (ofSeq ["c";"d";"e"]) - let r1c = append (ofSeqC 3 ["a";"b"]) (ofSeqC 3 ["c";"d";"e"]) - let h1 = head r1 - let h1c = head r1c - let t2 = tail r1 - let t2c = tail r1c - let h2 = head t2 - let h2c = head t2c - let t3 = tail t2 - let t3c = tail t2c - let h3 = head t3 - let h3c = head t3c - let t4 = tail t3 - let t4c = tail t3c - let h4 = head t4 - let h4c = head t4c - - let t5 = tail t4 - let t5c = tail t4c - let h5 = head t5 - let h5c = head t5c - - let r1r = append (ofSeq ["a";"b";"c"]) (ofSeq ["d";"e"]) - let r1cr = append (ofSeqC 3 ["a";"b";"c"]) (ofSeqC 3 ["d";"e"]) - let h1r = head r1r - let h1cr = head r1cr - let t2r = tail r1r - let t2cr = tail r1cr - let h2r = head t2r - let h2cr = head t2cr - let t3r = tail t2r - let t3cr = tail t2cr - let h3r = head t3r - let h3cr = head t3cr - let t4r = tail t3r - let t4cr = tail t3cr - let h4r = head t4r - let h4cr = head t4cr - - let t5r = tail t4r - let t5cr = tail t4cr - let h5r = head t5r - let h5cr = head t5cr - - ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") - && (h5 = "e") && (h5c = "e") - && (h1r = "a") && (h1cr = "a") && (h2r = "b") && (h2cr = "b") && (h3r = "c") && (h3cr = "c") && (h4r = "d") && (h4cr = "d") - && (h5r = "e") && (h5cr = "e")) |> should equal true - -[] -let ``appending length 2 and length 4``() = - let r1 = append (ofSeq ["a";"b"]) (ofSeq ["c";"d";"e";"f"]) - let r1c = append (ofSeqC 3 ["a";"b"]) (ofSeqC 3 ["c";"d";"e";"f"]) - let h1 = head r1 - let h1c = head r1c - let t2 = tail r1 - let t2c = tail r1c - let h2 = head t2 - let h2c = head t2c - let t3 = tail t2 - let t3c = tail t2c - let h3 = head t3 - let h3c = head t3c - let t4 = tail t3 - let t4c = tail t3c - let h4 = head t4 - let h4c = head t4c - let t5 = tail t4 - let t5c = tail t4c - let h5 = head t5 - let h5c = head t5c - let t6 = tail t5 - let t6c = tail t5c - let h6 = head t6 - let h6c = head t6c - - let r1r = append (ofSeq ["a";"b";"c";"d"]) (ofSeq ["e";"f"]) - let r1cr = append (ofSeqC 3 ["a";"b";"c";"d"]) (ofSeqC 3 ["e";"f"]) - let h1r = head r1r - let h1cr = head r1cr - let t2r = tail r1r - let t2cr = tail r1cr - let h2r = head t2r - let h2cr = head t2cr - let t3r = tail t2r - let t3cr = tail t2cr - let h3r = head t3r - let h3cr = head t3cr - let t4r = tail t3r - let t4cr = tail t3cr - let h4r = head t4r - let h4cr = head t4cr - let t5r = tail t4r - let t5cr = tail t4cr - let h5r = head t5r - let h5cr = head t5cr - let t6r = tail t5r - let t6cr = tail t5cr - let h6r = head t6r - let h6cr = head t6cr - - ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") - && (h5 = "e") && (h5c = "e") && (h6 = "f") && (h6c = "f") - && (h1r = "a") && (h1cr = "a") && (h2r = "b") && (h2cr = "b") && (h3r = "c") && (h3cr = "c") && (h4r = "d") && (h4cr = "d") - && (h5r = "e") && (h5cr = "e") && (h6r = "f") && (h6cr = "f")) |> should equal true - -[] -let ``appending length 2 and length 5``() = - let r1 = append (ofSeq ["a";"b"]) (ofSeq ["c";"d";"e";"f";"g"]) - let r1c = append (ofSeqC 3 ["a";"b"]) (ofSeqC 3 ["c";"d";"e";"f";"g"]) - let h1 = head r1 - let h1c = head r1c - let t2 = tail r1 - let t2c = tail r1c - let h2 = head t2 - let h2c = head t2c - let t3 = tail t2 - let t3c = tail t2c - let h3 = head t3 - let h3c = head t3c - let t4 = tail t3 - let t4c = tail t3c - let h4 = head t4 - let h4c = head t4c - let t5 = tail t4 - let t5c = tail t4c - let h5 = head t5 - let h5c = head t5c - let t6 = tail t5 - let t6c = tail t5c - let h6 = head t6 - let h6c = head t6c - let t7 = tail t6 - let t7c = tail t6c - let h7 = head t7 - let h7c = head t7c - - let r1r = append (ofSeq ["a";"b";"c";"d";"e"]) (ofSeq ["f";"g"]) - let r1cr = append (ofSeqC 3 ["a";"b";"c";"d";"e"]) (ofSeqC 3 ["f";"g"]) - let h1r = head r1r - let h1cr = head r1cr - let t2r = tail r1r - let t2cr = tail r1cr - let h2r = head t2r - let h2cr = head t2cr - let t3r = tail t2r - let t3cr = tail t2cr - let h3r = head t3r - let h3cr = head t3cr - let t4r = tail t3r - let t4cr = tail t3cr - let h4r = head t4r - let h4cr = head t4cr - let t5r = tail t4r - let t5cr = tail t4cr - let h5r = head t5r - let h5cr = head t5cr - let t6r = tail t5r - let t6cr = tail t5cr - let h6r = head t6r - let h6cr = head t6cr - let t7r = tail t6r - let t7cr = tail t6cr - let h7r = head t7r - let h7cr = head t7cr - - ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") - && (h5 = "e") && (h5c = "e") && (h6 = "f") && (h6c = "f") && (h7 = "g") && (h7c = "g") - && (h1r = "a") && (h1cr = "a") && (h2r = "b") && (h2cr = "b") && (h3r = "c") && (h3cr = "c") && (h4r = "d") && (h4cr = "d") - && (h5r = "e") && (h5cr = "e") && (h6r = "f") && (h6cr = "f") && (h7r = "g") && (h7cr = "g")) |> should equal true - -[] -let ``appending length 3 and length 3``() = - let r1 = append (ofSeq ["a";"b";"c"]) (ofSeq ["d";"e";"f"]) - let r1c = append (ofSeqC 3 ["a";"b";"c"]) (ofSeqC 3 ["d";"e";"f"]) - let h1 = head r1 - let h1c = head r1c - let t2 = tail r1 - let t2c = tail r1c - let h2 = head t2 - let h2c = head t2c - let t3 = tail t2 - let t3c = tail t2c - let h3 = head t3 - let h3c = head t3c - let t4 = tail t3 - let t4c = tail t3c - let h4 = head t4 - let h4c = head t4c - let t5 = tail t4 - let t5c = tail t4c - let h5 = head t5 - let h5c = head t5c - let t6 = tail t5 - let t6c = tail t5c - let h6 = head t6 - let h6c = head t6c - - ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") - && (h5 = "e") && (h5c = "e") && (h6 = "f") && (h6c = "f")) |> should equal true - - -[] -let ``lookup length 1``() = - len1 |> lookup 0 |> should equal "a" - -[] -let ``lookup length 2``() = - (((len2 |> lookup 0) = "b") && ((len2 |> lookup 1) = "a")) |> should equal true - -[] -let ``lookup length 3``() = - (((len3 |> lookup 0) = "c") && ((len3 |> lookup 1) = "b") && ((len3 |> lookup 2) = "a")) |> should equal true - -[] -let ``lookup length 4``() = - (((len4 |> lookup 0) = "d") && ((len4 |> lookup 1) = "c") && ((len4 |> lookup 2) = "b") && ((len4 |> lookup 3) = "a")) - |> should equal true - -[] -let ``lookup length 5``() = - (((len5 |> lookup 0) = "e") && ((len5 |> lookup 1) = "d") && ((len5 |> lookup 2) = "c") && ((len5 |> lookup 3) = "b") - && ((len5 |> lookup 4) = "a")) |> should equal true - -[] -let ``lookup length 6``() = - (((len6 |> lookup 0) = "f") && ((len6 |> lookup 1) = "e") && ((len6 |> lookup 2) = "d") && ((len6 |> lookup 3) = "c") - && ((len6 |> lookup 4) = "b") && ((len6 |> lookup 5) = "a")) |> should equal true - -[] -let ``lookup length 7``() = - (((len7 |> lookup 0) = "g") && ((len7 |> lookup 1) = "f") && ((len7 |> lookup 2) = "e") && ((len7 |> lookup 3) = "d") - && ((len7 |> lookup 4) = "c") && ((len7 |> lookup 5) = "b") && ((len7 |> lookup 6) = "a")) |> should equal true - -[] -let ``lookup length 8``() = - (((len8 |> lookup 0) = "h") && ((len8 |> lookup 1) = "g") && ((len8 |> lookup 2) = "f") && ((len8 |> lookup 3) = "e") - && ((len8 |> lookup 4) = "d") && ((len8 |> lookup 5) = "c") && ((len8 |> lookup 6) = "b") && ((len8 |> lookup 7) = "a")) - |> should equal true - -[] -let ``lookup length 9``() = - (((len9 |> lookup 0) = "i") && ((len9 |> lookup 1) = "h") && ((len9 |> lookup 2) = "g") && ((len9 |> lookup 3) = "f") - && ((len9 |> lookup 4) = "e") && ((len9 |> lookup 5) = "d") && ((len9 |> lookup 6) = "c") && ((len9 |> lookup 7) = "b") - && ((len9 |> lookup 8) = "a")) |> should equal true - -[] -let ``lookup length 10``() = - (((lena |> lookup 0) = "j") && ((lena |> lookup 1) = "i") && ((lena |> lookup 2) = "h") && ((lena |> lookup 3) = "g") - && ((lena |> lookup 4) = "f") && ((lena |> lookup 5) = "e") && ((lena |> lookup 6) = "d") && ((lena |> lookup 7) = "c") - && ((lena |> lookup 8) = "b") && ((lena |> lookup 9) = "a")) |> should equal true - -[] -let ``tryLookup length 1``() = - let a = len1 |> tryLookup 0 - (a.Value = "a") |> should equal true - -[] -let ``tryLookup length 2``() = - let b = len2 |> tryLookup 0 - let a = len2 |> tryLookup 1 - ((b.Value = "b") && (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 3``() = - let c = len3 |> tryLookup 0 - let b = len3 |> tryLookup 1 - let a = len3 |> tryLookup 2 - ((c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 4``() = - let d = len4 |> tryLookup 0 - let c = len4 |> tryLookup 1 - let b = len4 |> tryLookup 2 - let a = len4 |> tryLookup 3 - ((d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 5``() = - let e = len5 |> tryLookup 0 - let d = len5 |> tryLookup 1 - let c = len5 |> tryLookup 2 - let b = len5 |> tryLookup 3 - let a = len5 |> tryLookup 4 - ((e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 6``() = - let f = len6 |> tryLookup 0 - let e = len6 |> tryLookup 1 - let d = len6 |> tryLookup 2 - let c = len6 |> tryLookup 3 - let b = len6 |> tryLookup 4 - let a = len6 |> tryLookup 5 - ((f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) - |> should equal true - -[] -let ``tryLookup length 7``() = - let g = len7 |> tryLookup 0 - let f = len7 |> tryLookup 1 - let e = len7 |> tryLookup 2 - let d = len7 |> tryLookup 3 - let c = len7 |> tryLookup 4 - let b = len7 |> tryLookup 5 - let a = len7 |> tryLookup 6 - ((g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") - && (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 8``() = - let h = len8 |> tryLookup 0 - let g = len8 |> tryLookup 1 - let f = len8 |> tryLookup 2 - let e = len8 |> tryLookup 3 - let d = len8 |> tryLookup 4 - let c = len8 |> tryLookup 5 - let b = len8 |> tryLookup 6 - let a = len8 |> tryLookup 7 - ((h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") - && (b.Value = "b")&& (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 9``() = - let i = len9 |> tryLookup 0 - let h = len9 |> tryLookup 1 - let g = len9 |> tryLookup 2 - let f = len9 |> tryLookup 3 - let e = len9 |> tryLookup 4 - let d = len9 |> tryLookup 5 - let c = len9 |> tryLookup 6 - let b = len9 |> tryLookup 7 - let a = len9 |> tryLookup 8 - ((i.Value = "i") && (h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") - && (c.Value = "c") && (b.Value = "b")&& (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 10``() = - let j = lena |> tryLookup 0 - let i = lena |> tryLookup 1 - let h = lena |> tryLookup 2 - let g = lena |> tryLookup 3 - let f = lena |> tryLookup 4 - let e = lena |> tryLookup 5 - let d = lena |> tryLookup 6 - let c = lena |> tryLookup 7 - let b = lena |> tryLookup 8 - let a = lena |> tryLookup 9 - ((j.Value = "j") && (i.Value = "i") && (h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") - && (d.Value = "d") && (c.Value = "c") && (b.Value = "b")&& (a.Value = "a")) |> should equal true - -[] -let ``tryLookup not found``() = - lena |> tryLookup 10 |> should equal None - -[] -let ``remove elements length 1``() = - len1 |> remove 0 |> isEmpty |> should equal true - -[] -let ``remove elements length 2``() = - let a = len2 |> remove 0 |> head - let b = len2 |> remove 1 |> head - ((a = "a") && (b = "b")) |> should equal true - -[] -let ``remove elements length 3``() = - let r0 = (ofSeq ["a";"b";"c"]) |> remove 0 - let b0 = head r0 - let t0 = tail r0 - let c0 = head t0 - - let r1 = (ofSeq ["a";"b";"c"]) |> remove 1 - let a1 = head r1 - let t1 = tail r1 - let c1 = head t1 - - let r2 = (ofSeq ["a";"b";"c"]) |> remove 2 - let a2 = head r2 - let t2 = tail r2 - let b2 = head t2 - - ((b0 = "b") && (c0 = "c") && (a1 = "a") && (c1 = "c") && (a2 = "a") && (b2 = "b")) |> should equal true - -[] -let ``remove elements length 4``() = - let r0 = (ofSeq ["a";"b";"c";"d"]) |> remove 0 - let b0 = head r0 - let t0 = tail r0 - let c0 = head t0 - let t01 = tail t0 - let d0 = head t01 - - let r1 = (ofSeq ["a";"b";"c";"d"]) |> remove 1 - let a1 = head r1 - let t11 = tail r1 - let c1 = head t11 - let t12 = tail t11 - let d1 = head t12 - - let r2 = (ofSeq ["a";"b";"c";"d"]) |> remove 2 - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 - - let r3 = (ofSeq ["a";"b";"c";"d"]) |> remove 3 - let a3 = head r3 - let t31 = tail r3 - let b3 = head t31 - let t32 = tail t31 - let c3 = head t32 - - ((b0 = "b") && (c0 = "c") && (d0 = "d") - && (a1 = "a") && (c1 = "c") && (d1 = "d") - && (a2 = "a") && (b2 = "b") && (c2 = "d") - && (a3 = "a") && (b3 = "b") && (c3 = "c")) |> should equal true - -[] -let ``remove elements length 5``() = - let r0 = (ofSeq ["a";"b";"c";"d";"e"]) |> remove 0 - let b0 = head r0 - let t01 = tail r0 - let c0 = head t01 - let t02= tail t01 - let d0 = head t02 - let t03 = tail t02 - let e0 = head t03 - - let r1 = (ofSeq ["a";"b";"c";"d";"e"]) |> remove 1 - let a1 = head r1 - let t11 = tail r1 - let c1 = head t11 - let t12 = tail t11 - let d1 = head t12 - let t13 = tail t12 - let e1 = head t13 - - let r2 = (ofSeq ["a";"b";"c";"d";"e"]) |> remove 2 - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 - let t23 = tail t22 - let e2 = head t23 - - let r3 = (ofSeq ["a";"b";"c";"d";"e"]) |> remove 3 - let a3 = head r3 - let t31 = tail r3 - let b3 = head t31 - let t32 = tail t31 - let c3 = head t32 - let t33 = tail t32 - let e3 = head t33 - - let r4 = (ofSeq ["a";"b";"c";"d";"e"]) |> remove 4 - let a4 = head r4 - let t41 = tail r4 - let b4 = head t41 - let t42 = tail t41 - let c4 = head t42 - let t43 = tail t42 - let d4 = head t43 - - ((b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") - && (a1 = "a") && (c1 = "c") && (d1 = "d") && (e1 = "e") - && (a2 = "a") && (b2 = "b") && (c2 = "d") && (e2 = "e") - && (a3 = "a") && (b3 = "b") && (c3 = "c") && (e3 = "e") - && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d")) |> should equal true - -[] -let ``remove elements length 6``() = - let r0 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> remove 0 - let b0 = head r0 - let t01 = tail r0 - let c0 = head t01 - let t02= tail t01 - let d0 = head t02 - let t03 = tail t02 - let e0 = head t03 - let t04 = tail t03 - let f0 = head t04 - - let r1 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> remove 1 - let a1 = head r1 - let t11 = tail r1 - let c1 = head t11 - let t12 = tail t11 - let d1 = head t12 - let t13 = tail t12 - let e1 = head t13 - let t14 = tail t13 - let f1 = head t14 - - let r2 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> remove 2 - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 - let t23 = tail t22 - let e2 = head t23 - let t24 = tail t23 - let f2 = head t24 - - let r3 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> remove 3 - let a3 = head r3 - let t31 = tail r3 - let b3 = head t31 - let t32 = tail t31 - let c3 = head t32 - let t33 = tail t32 - let e3 = head t33 - let t34 = tail t33 - let f3 = head t34 - - let r4 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> remove 4 - let a4 = head r4 - let t41 = tail r4 - let b4 = head t41 - let t42 = tail t41 - let c4 = head t42 - let t43 = tail t42 - let d4 = head t43 - let t44 = tail t43 - let f4 = head t44 - - let r5 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> remove 5 - let a5 = head r5 - let t51 = tail r5 - let b5 = head t51 - let t52 = tail t51 - let c5 = head t52 - let t53 = tail t52 - let d5 = head t53 - let t54 = tail t53 - let e5 = head t54 - - ((b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") && (f0 = "f") - && (a1 = "a") && (c1 = "c") && (d1 = "d") && (e1 = "e") && (f1 = "f") - && (a2 = "a") && (b2 = "b") && (c2 = "d") && (e2 = "e") && (f2 = "f") - && (a3 = "a") && (b3 = "b") && (c3 = "c") && (e3 = "e") && (f3 = "f") - && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d") && (f4 = "f") - && (a5 = "a") && (b5 = "b") && (c5 = "c") && (d5 = "d") && (e5 = "e")) |> should equal true - -[] -let ``tryRemoveempty``() = - (empty 3) |> tryRemove 0 |> should equal None - -[] -let ``tryRemove elements length 1``() = - let a = len1 |> tryRemove 0 - a.Value |> isEmpty |> should equal true - -[] -let ``tryRemove elements length 2``() = - let a = len2 |> tryRemove 0 - let a1 = head a.Value - let b = len2 |> tryRemove 1 - let b1 = head b.Value - ((a1 = "a") && (b1 = "b")) |> should equal true - -[] -let ``tryRemove elements length 3``() = - let x0 = (ofSeq ["a";"b";"c"]) |> tryRemove 0 - let r0 = x0.Value - let b0 = head r0 - let t0 = tail r0 - let c0 = head t0 - - let x1 = (ofSeq ["a";"b";"c"]) |> tryRemove 1 - let r1 = x1.Value - let a1 = head r1 - let t1 = tail r1 - let c1 = head t1 - - let x2 = (ofSeq ["a";"b";"c"]) |> tryRemove 2 - let r2 = x2.Value - let a2 = head r2 - let t2 = tail r2 - let b2 = head t2 - - ((b0 = "b") && (c0 = "c") && (a1 = "a") && (c1 = "c") && (a2 = "a") && (b2 = "b")) |> should equal true - -[] -let ``tryRemove elements length 4``() = - let x0 = (ofSeq ["a";"b";"c";"d"]) |> tryRemove 0 - let r0 = x0.Value - let b0 = head r0 - let t0 = tail r0 - let c0 = head t0 - let t01 = tail t0 - let d0 = head t01 - - let x1 = (ofSeq ["a";"b";"c";"d"]) |> tryRemove 1 - let r1 = x1.Value - let a1 = head r1 - let t11 = tail r1 - let c1 = head t11 - let t12 = tail t11 - let d1 = head t12 + let mid1 = + match d with + | BankersDeque.Cons(h, BankersDeque.Snoc(i, l)) -> i + | _ -> d + + let head, last = + match mid1 with + | BankersDeque.Cons(h, BankersDeque.Snoc(i, l)) -> h, l + | _ -> "x", "x" + + ((head = "e") && (last = "b")) |> Expect.isTrue "" } + + test "BankersDeque.rev BankersDeque.empty dqueue should be BankersDeque.empty" { + BankersDeque.isEmpty (BankersDeque.rev (BankersDeque.empty 2)) |> Expect.isTrue "" } + + test "BankersDeque.rev dqueue BankersDeque.length 1" { + ((BankersDeque.head (BankersDeque.rev len1) = "a") && (BankersDeque.head (BankersDeque.rev len1C3) = "a")) |> Expect.isTrue "" } + + test "BankersDeque.rev dqueue BankersDeque.length 2" { + let r1 = BankersDeque.rev len2 + let r1c = BankersDeque.rev len2C3 + let h1 = BankersDeque.head r1 + let h1c = BankersDeque.head r1c + let t2 = BankersDeque.tail r1 + let t2c = BankersDeque.tail r1c + let h2 = BankersDeque.head t2 + let h2c = BankersDeque.head t2c + + ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b")) |> Expect.isTrue "" } + + test "BankersDeque.rev dqueue BankersDeque.length 3" { + let r1 = BankersDeque.rev len3 + let r1c = BankersDeque.rev len3C3 + let h1 = BankersDeque.head r1 + let h1c = BankersDeque.head r1c + let t2 = BankersDeque.tail r1 + let t2c = BankersDeque.tail r1c + let h2 = BankersDeque.head t2 + let h2c = BankersDeque.head t2c + let t3 = BankersDeque.tail t2 + let t3c = BankersDeque.tail t2c + let h3 = BankersDeque.head t3 + let h3c = BankersDeque.head t3c + + ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c")) |> Expect.isTrue "" } + + test "BankersDeque.rev dqueue BankersDeque.length 4" { + let r1 = BankersDeque.rev len4 + let r1c = BankersDeque.rev len4C3 + let h1 = BankersDeque.head r1 + let h1c = BankersDeque.head r1c + let t2 = BankersDeque.tail r1 + let t2c = BankersDeque.tail r1c + let h2 = BankersDeque.head t2 + let h2c = BankersDeque.head t2c + let t3 = BankersDeque.tail t2 + let t3c = BankersDeque.tail t2c + let h3 = BankersDeque.head t3 + let h3c = BankersDeque.head t3c + let t4 = BankersDeque.tail t3 + let t4c = BankersDeque.tail t3c + let h4 = BankersDeque.head t4 + let h4c = BankersDeque.head t4c + + ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d")) |> Expect.isTrue "" } + + test "BankersDeque.rev dqueue BankersDeque.length 5" { + let r1 = BankersDeque.rev len5 + let r1c = BankersDeque.rev len5C3 + let h1 = BankersDeque.head r1 + let h1c = BankersDeque.head r1c + let t2 = BankersDeque.tail r1 + let t2c = BankersDeque.tail r1c + let h2 = BankersDeque.head t2 + let h2c = BankersDeque.head t2c + let t3 = BankersDeque.tail t2 + let t3c = BankersDeque.tail t2c + let h3 = BankersDeque.head t3 + let h3c = BankersDeque.head t3c + let t4 = BankersDeque.tail t3 + let t4c = BankersDeque.tail t3c + let h4 = BankersDeque.head t4 + let h4c = BankersDeque.head t4c + let t5 = BankersDeque.tail t4 + let t5c = BankersDeque.tail t4c + let h5 = BankersDeque.head t5 + let h5c = BankersDeque.head t5c + + ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") + && (h5 = "e") && (h5c = "e")) |> Expect.isTrue "" } + + //BankersDeque.length 6 more than sufficient to test BankersDeque.rev + test "BankersDeque.rev dqueue BankersDeque.length 6" { + let r1 = BankersDeque.rev len6 + let r1c = BankersDeque.rev len6C3 + let h1 = BankersDeque.head r1 + let h1c = BankersDeque.head r1c + let t2 = BankersDeque.tail r1 + let t2c = BankersDeque.tail r1c + let h2 = BankersDeque.head t2 + let h2c = BankersDeque.head t2c + let t3 = BankersDeque.tail t2 + let t3c = BankersDeque.tail t2c + let h3 = BankersDeque.head t3 + let h3c = BankersDeque.head t3c + let t4 = BankersDeque.tail t3 + let t4c = BankersDeque.tail t3c + let h4 = BankersDeque.head t4 + let h4c = BankersDeque.head t4c + let t5 = BankersDeque.tail t4 + let t5c = BankersDeque.tail t4c + let h5 = BankersDeque.head t5 + let h5c = BankersDeque.head t5c + let t6 = BankersDeque.tail t5 + let t6c = BankersDeque.tail t5c + let h6 = BankersDeque.head t6 + let h6c = BankersDeque.head t6c + + ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") + && (h5 = "e") && (h5c = "e") && (h6 = "f") && (h6c = "f")) |> Expect.isTrue "" } + + test "BankersDeque.ofSeq and BankersDeque.ofSeqC BankersDeque.empty" { + ((BankersDeque.isEmpty (BankersDeque.ofSeq [])) && (BankersDeque.isEmpty (BankersDeque.ofSeqC 3 []))) |> Expect.isTrue "" } + + test "BankersDeque.ofSeq and BankersDeque.ofSeqC BankersDeque.length 1" { + ((BankersDeque.head (BankersDeque.ofSeq ["a"]) = "a") && (BankersDeque.head (BankersDeque.ofSeqC 3 ["a"]) = "a")) |> Expect.isTrue "" } + + test "BankersDeque.ofSeq and BankersDeque.ofSeqC BankersDeque.length 2" { + let r1 = BankersDeque.ofSeq ["a";"b"] + let r1c = BankersDeque.ofSeqC 3 ["a";"b"] + let h1 = BankersDeque.head r1 + let h1c = BankersDeque.head r1c + let t2 = BankersDeque.tail r1 + let t2c = BankersDeque.tail r1c + let h2 = BankersDeque.head t2 + let h2c = BankersDeque.head t2c + + ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b")) |> Expect.isTrue "" } + + test "BankersDeque.ofSeq and BankersDeque.ofSeqC BankersDeque.length 3" { + let r1 = BankersDeque.ofSeq ["a";"b";"c"] + let r1c = BankersDeque.ofSeqC 3 ["a";"b";"c"] + let h1 = BankersDeque.head r1 + let h1c = BankersDeque.head r1c + let t2 = BankersDeque.tail r1 + let t2c = BankersDeque.tail r1c + let h2 = BankersDeque.head t2 + let h2c = BankersDeque.head t2c + let t3 = BankersDeque.tail t2 + let t3c = BankersDeque.tail t2c + let h3 = BankersDeque.head t3 + let h3c = BankersDeque.head t3c + + ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c")) |> Expect.isTrue "" } + + test "BankersDeque.ofSeq and BankersDeque.ofSeqC BankersDeque.length 4" { + let r1 = BankersDeque.ofSeq ["a";"b";"c";"d"] + let r1c = BankersDeque.ofSeqC 3 ["a";"b";"c";"d"] + let h1 = BankersDeque.head r1 + let h1c = BankersDeque.head r1c + let t2 = BankersDeque.tail r1 + let t2c = BankersDeque.tail r1c + let h2 = BankersDeque.head t2 + let h2c = BankersDeque.head t2c + let t3 = BankersDeque.tail t2 + let t3c = BankersDeque.tail t2c + let h3 = BankersDeque.head t3 + let h3c = BankersDeque.head t3c + let t4 = BankersDeque.tail t3 + let t4c = BankersDeque.tail t3c + let h4 = BankersDeque.head t4 + let h4c = BankersDeque.head t4c + + ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d")) |> Expect.isTrue "" } + + //BankersDeque.length 5 more than sufficient to test BankersDeque.ofSeq and BankersDeque.ofSeqC + test "BankersDeque.ofSeq and BankersDeque.ofSeqC BankersDeque.length 5" { + let r1 = BankersDeque.ofSeq ["a";"b";"c";"d";"e"] + let r1c = BankersDeque.ofSeqC 3 ["a";"b";"c";"d";"e"] + let h1 = BankersDeque.head r1 + let h1c = BankersDeque.head r1c + let t2 = BankersDeque.tail r1 + let t2c = BankersDeque.tail r1c + let h2 = BankersDeque.head t2 + let h2c = BankersDeque.head t2c + let t3 = BankersDeque.tail t2 + let t3c = BankersDeque.tail t2c + let h3 = BankersDeque.head t3 + let h3c = BankersDeque.head t3c + let t4 = BankersDeque.tail t3 + let t4c = BankersDeque.tail t3c + let h4 = BankersDeque.head t4 + let h4c = BankersDeque.head t4c + let t5 = BankersDeque.tail t4 + let t5c = BankersDeque.tail t4c + let h5 = BankersDeque.head t5 + let h5c = BankersDeque.head t5c + + ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") + && (h5 = "e") && (h5c = "e")) |> Expect.isTrue "" } + + //BankersDeque.length 5 more than sufficient to test BankersDeque.ofSeq and BankersDeque.ofSeqC + test "BankersDeque.ofSeq and BankersDeque.ofSeqC BankersDeque.length 6" { + let r1 = BankersDeque.ofSeq ["a";"b";"c";"d";"e";"f"] + let r1c = BankersDeque.ofSeqC 3 ["a";"b";"c";"d";"e";"f"] + let h1 = BankersDeque.head r1 + let h1c = BankersDeque.head r1c + let t2 = BankersDeque.tail r1 + let t2c = BankersDeque.tail r1c + let h2 = BankersDeque.head t2 + let h2c = BankersDeque.head t2c + let t3 = BankersDeque.tail t2 + let t3c = BankersDeque.tail t2c + let h3 = BankersDeque.head t3 + let h3c = BankersDeque.head t3c + let t4 = BankersDeque.tail t3 + let t4c = BankersDeque.tail t3c + let h4 = BankersDeque.head t4 + let h4c = BankersDeque.head t4c + let t5 = BankersDeque.tail t4 + let t5c = BankersDeque.tail t4c + let h5 = BankersDeque.head t5 + let h5c = BankersDeque.head t5c + let t6 = BankersDeque.tail t5 + let t6c = BankersDeque.tail t5c + let h6 = BankersDeque.head t6 + let h6c = BankersDeque.head t6c + + ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") + && (h5 = "e") && (h5c = "e") && (h6 = "f") && (h6c = "f")) |> Expect.isTrue "" } + + test "appending BankersDeque.empty dqueus" { + ((BankersDeque.isEmpty (BankersDeque.append (BankersDeque.ofSeq []) (BankersDeque.ofSeq []) )) && (BankersDeque.isEmpty (BankersDeque.append (BankersDeque.empty 3) (BankersDeque.empty 3))) + ) |> Expect.isTrue "" } + + test "appending BankersDeque.empty and BankersDeque.length 1" { + ((BankersDeque.head (BankersDeque.append (BankersDeque.ofSeq []) len1) = "a") && (BankersDeque.head (BankersDeque.append len1 (BankersDeque.empty 3)) = "a")) |> Expect.isTrue "" } + + test "appending BankersDeque.empty and BankersDeque.length 2" { + let r1 = BankersDeque.append (BankersDeque.ofSeq []) (BankersDeque.ofSeq ["a";"b"]) + let r1c = BankersDeque.append (BankersDeque.empty 3) (BankersDeque.ofSeqC 3 ["a";"b"]) + let h1 = BankersDeque.head r1 + let h1c = BankersDeque.head r1c + let t2 = BankersDeque.tail r1 + let t2c = BankersDeque.tail r1c + let h2 = BankersDeque.head t2 + let h2c = BankersDeque.head t2c + + let r1r = BankersDeque.append (BankersDeque.ofSeq ["a";"b"]) (BankersDeque.ofSeq []) + let r1cr = BankersDeque.append (BankersDeque.ofSeqC 3 ["a";"b"]) (BankersDeque.empty 3) + let h1r = BankersDeque.head r1r + let h1cr = BankersDeque.head r1cr + let t2r = BankersDeque.tail r1r + let t2cr = BankersDeque.tail r1cr + let h2r = BankersDeque.head t2r + let h2cr = BankersDeque.head t2cr + + ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") + && (h1r = "a") && (h1cr = "a") && (h2r = "b") && (h2cr = "b")) |> Expect.isTrue "" } + + test "appending BankersDeque.length 1 and BankersDeque.length 2" { + let r1 = BankersDeque.append (BankersDeque.ofSeq ["a"]) (BankersDeque.ofSeq ["b";"c"]) + let r1c = BankersDeque.append (BankersDeque.ofSeqC 3 ["a"]) (BankersDeque.ofSeqC 3 ["b";"c"]) + let h1 = BankersDeque.head r1 + let h1c = BankersDeque.head r1c + let t2 = BankersDeque.tail r1 + let t2c = BankersDeque.tail r1c + let h2 = BankersDeque.head t2 + let h2c = BankersDeque.head t2c + let t3 = BankersDeque.tail t2 + let t3c = BankersDeque.tail t2c + let h3 = BankersDeque.head t3 + let h3c = BankersDeque.head t3c + + let r1r = BankersDeque.append (BankersDeque.ofSeq ["a";"b"]) (BankersDeque.ofSeq ["c"]) + let r1cr = BankersDeque.append (BankersDeque.ofSeqC 3 ["a";"b"]) (BankersDeque.ofSeqC 3 ["c"]) + let h1r = BankersDeque.head r1r + let h1cr = BankersDeque.head r1cr + let t2r = BankersDeque.tail r1r + let t2cr = BankersDeque.tail r1cr + let h2r = BankersDeque.head t2r + let h2cr = BankersDeque.head t2cr + let t3r = BankersDeque.tail t2r + let t3cr = BankersDeque.tail t2cr + let h3r = BankersDeque.head t3r + let h3cr = BankersDeque.head t3cr + + ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") + && (h1r = "a") && (h1cr = "a") && (h2r = "b") && (h2cr = "b") && (h3r = "c") && (h3cr = "c")) |> Expect.isTrue "" } + + test "appending BankersDeque.length 1 and BankersDeque.length 3" { + let r1 = BankersDeque.append (BankersDeque.ofSeq ["a"]) (BankersDeque.ofSeq ["b";"c";"d"]) + let r1c = BankersDeque.append (BankersDeque.ofSeqC 3 ["a"]) (BankersDeque.ofSeqC 3 ["b";"c";"d"]) + let h1 = BankersDeque.head r1 + let h1c = BankersDeque.head r1c + let t2 = BankersDeque.tail r1 + let t2c = BankersDeque.tail r1c + let h2 = BankersDeque.head t2 + let h2c = BankersDeque.head t2c + let t3 = BankersDeque.tail t2 + let t3c = BankersDeque.tail t2c + let h3 = BankersDeque.head t3 + let h3c = BankersDeque.head t3c + let t4 = BankersDeque.tail t3 + let t4c = BankersDeque.tail t3c + let h4 = BankersDeque.head t4 + let h4c = BankersDeque.head t4c + + let r1r = BankersDeque.append (BankersDeque.ofSeq ["a";"b";"c"]) (BankersDeque.ofSeq ["d"]) + let r1cr = BankersDeque.append (BankersDeque.ofSeqC 3 ["a";"b";"c"]) (BankersDeque.ofSeqC 3 ["d"]) + let h1r = BankersDeque.head r1r + let h1cr = BankersDeque.head r1cr + let t2r = BankersDeque.tail r1r + let t2cr = BankersDeque.tail r1cr + let h2r = BankersDeque.head t2r + let h2cr = BankersDeque.head t2cr + let t3r = BankersDeque.tail t2r + let t3cr = BankersDeque.tail t2cr + let h3r = BankersDeque.head t3r + let h3cr = BankersDeque.head t3cr + let t4r = BankersDeque.tail t3r + let t4cr = BankersDeque.tail t3cr + let h4r = BankersDeque.head t4r + let h4cr = BankersDeque.head t4cr + + ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") + && (h1r = "a") && (h1cr = "a") && (h2r = "b") && (h2cr = "b") && (h3r = "c") && (h3cr = "c") && (h4r = "d") && (h4cr = "d")) |> Expect.isTrue "" } + + test "appending BankersDeque.length 1 and BankersDeque.length 4" { + let r1 = BankersDeque.append (BankersDeque.ofSeq ["a"]) (BankersDeque.ofSeq ["b";"c";"d";"e"]) + let r1c = BankersDeque.append (BankersDeque.ofSeqC 3 ["a"]) (BankersDeque.ofSeqC 3 ["b";"c";"d";"e"]) + let h1 = BankersDeque.head r1 + let h1c = BankersDeque.head r1c + let t2 = BankersDeque.tail r1 + let t2c = BankersDeque.tail r1c + let h2 = BankersDeque.head t2 + let h2c = BankersDeque.head t2c + let t3 = BankersDeque.tail t2 + let t3c = BankersDeque.tail t2c + let h3 = BankersDeque.head t3 + let h3c = BankersDeque.head t3c + let t4 = BankersDeque.tail t3 + let t4c = BankersDeque.tail t3c + let h4 = BankersDeque.head t4 + let h4c = BankersDeque.head t4c + + let t5 = BankersDeque.tail t4 + let t5c = BankersDeque.tail t4c + let h5 = BankersDeque.head t5 + let h5c = BankersDeque.head t5c + + let r1r = BankersDeque.append (BankersDeque.ofSeq ["a";"b";"c";"d"]) (BankersDeque.ofSeq ["e"]) + let r1cr = BankersDeque.append (BankersDeque.ofSeqC 3 ["a";"b";"c";"d"]) (BankersDeque.ofSeqC 3 ["e"]) + let h1r = BankersDeque.head r1r + let h1cr = BankersDeque.head r1cr + let t2r = BankersDeque.tail r1r + let t2cr = BankersDeque.tail r1cr + let h2r = BankersDeque.head t2r + let h2cr = BankersDeque.head t2cr + let t3r = BankersDeque.tail t2r + let t3cr = BankersDeque.tail t2cr + let h3r = BankersDeque.head t3r + let h3cr = BankersDeque.head t3cr + let t4r = BankersDeque.tail t3r + let t4cr = BankersDeque.tail t3cr + let h4r = BankersDeque.head t4r + let h4cr = BankersDeque.head t4cr + + let t5r = BankersDeque.tail t4r + let t5cr = BankersDeque.tail t4cr + let h5r = BankersDeque.head t5r + let h5cr = BankersDeque.head t5cr + + ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") + && (h5 = "e") && (h5c = "e") + && (h1r = "a") && (h1cr = "a") && (h2r = "b") && (h2cr = "b") && (h3r = "c") && (h3cr = "c") && (h4r = "d") && (h4cr = "d") + && (h5r = "e") && (h5cr = "e")) |> Expect.isTrue "" } + + test "appending BankersDeque.length 1 and BankersDeque.length 5" { + let r1 = BankersDeque.append (BankersDeque.ofSeq ["a"]) (BankersDeque.ofSeq ["b";"c";"d";"e";"f"]) + let r1c = BankersDeque.append (BankersDeque.ofSeqC 3 ["a"]) (BankersDeque.ofSeqC 3 ["b";"c";"d";"e";"f"]) + let h1 = BankersDeque.head r1 + let h1c = BankersDeque.head r1c + let t2 = BankersDeque.tail r1 + let t2c = BankersDeque.tail r1c + let h2 = BankersDeque.head t2 + let h2c = BankersDeque.head t2c + let t3 = BankersDeque.tail t2 + let t3c = BankersDeque.tail t2c + let h3 = BankersDeque.head t3 + let h3c = BankersDeque.head t3c + let t4 = BankersDeque.tail t3 + let t4c = BankersDeque.tail t3c + let h4 = BankersDeque.head t4 + let h4c = BankersDeque.head t4c + let t5 = BankersDeque.tail t4 + let t5c = BankersDeque.tail t4c + let h5 = BankersDeque.head t5 + let h5c = BankersDeque.head t5c + let t6 = BankersDeque.tail t5 + let t6c = BankersDeque.tail t5c + let h6 = BankersDeque.head t6 + let h6c = BankersDeque.head t6c + + let r1r = BankersDeque.append (BankersDeque.ofSeq ["a";"b";"c";"d";"e"]) (BankersDeque.ofSeq ["f"]) + let r1cr = BankersDeque.append (BankersDeque.ofSeqC 3 ["a";"b";"c";"d";"e"]) (BankersDeque.ofSeqC 3 ["f"]) + let h1r = BankersDeque.head r1r + let h1cr = BankersDeque.head r1cr + let t2r = BankersDeque.tail r1r + let t2cr = BankersDeque.tail r1cr + let h2r = BankersDeque.head t2r + let h2cr = BankersDeque.head t2cr + let t3r = BankersDeque.tail t2r + let t3cr = BankersDeque.tail t2cr + let h3r = BankersDeque.head t3r + let h3cr = BankersDeque.head t3cr + let t4r = BankersDeque.tail t3r + let t4cr = BankersDeque.tail t3cr + let h4r = BankersDeque.head t4r + let h4cr = BankersDeque.head t4cr + let t5r = BankersDeque.tail t4r + let t5cr = BankersDeque.tail t4cr + let h5r = BankersDeque.head t5r + let h5cr = BankersDeque.head t5cr + let t6r = BankersDeque.tail t5r + let t6cr = BankersDeque.tail t5cr + let h6r = BankersDeque.head t6r + let h6cr = BankersDeque.head t6cr + + ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") + && (h5 = "e") && (h5c = "e") && (h6 = "f") && (h6c = "f") + && (h1r = "a") && (h1cr = "a") && (h2r = "b") && (h2cr = "b") && (h3r = "c") && (h3cr = "c") && (h4r = "d") && (h4cr = "d") + && (h5r = "e") && (h5cr = "e") && (h6r = "f") && (h6cr = "f")) |> Expect.isTrue "" } + + test "appending BankersDeque.length 6 and BankersDeque.length 7" { + let r1 = BankersDeque.append (BankersDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) (BankersDeque.ofSeq ["g";"h";"i";"j";"k";"l";"m"]) + let r1c = BankersDeque.append (BankersDeque.ofSeqC 3 ["a";"b";"c";"d";"e";"f"]) (BankersDeque.ofSeqC 3 ["g";"h";"i";"j";"k";"l";"m"]) + let h1 = BankersDeque.head r1 + let h1c = BankersDeque.head r1c + let t2 = BankersDeque.tail r1 + let t2c = BankersDeque.tail r1c + let h2 = BankersDeque.head t2 + let h2c = BankersDeque.head t2c + let t3 = BankersDeque.tail t2 + let t3c = BankersDeque.tail t2c + let h3 = BankersDeque.head t3 + let h3c = BankersDeque.head t3c + let t4 = BankersDeque.tail t3 + let t4c = BankersDeque.tail t3c + let h4 = BankersDeque.head t4 + let h4c = BankersDeque.head t4c + let t5 = BankersDeque.tail t4 + let t5c = BankersDeque.tail t4c + let h5 = BankersDeque.head t5 + let h5c = BankersDeque.head t5c + let t6 = BankersDeque.tail t5 + let t6c = BankersDeque.tail t5c + let h6 = BankersDeque.head t6 + let h6c = BankersDeque.head t6c + let h6 = BankersDeque.head t6 + let h6c = BankersDeque.head t6c + let t7 = BankersDeque.tail t6 + let t7c = BankersDeque.tail t6c + let h7 = BankersDeque.head t7 + let h7c = BankersDeque.head t7c + let h7 = BankersDeque.head t7 + let h7c = BankersDeque.head t7c + let t8 = BankersDeque.tail t7 + let t8c = BankersDeque.tail t7c + let h8 = BankersDeque.head t8 + let h8c = BankersDeque.head t8c + let h8 = BankersDeque.head t8 + let h8c = BankersDeque.head t8c + let t9 = BankersDeque.tail t8 + let t9c = BankersDeque.tail t8c + let h9 = BankersDeque.head t9 + let h9c = BankersDeque.head t9c + let h9 = BankersDeque.head t9 + let h9c = BankersDeque.head t9c + let t10 = BankersDeque.tail t9 + let t10c = BankersDeque.tail t9c + let h10 = BankersDeque.head t10 + let h10c = BankersDeque.head t10c + let h10 = BankersDeque.head t10 + let h10c = BankersDeque.head t10c + let t11 = BankersDeque.tail t10 + let t11c = BankersDeque.tail t10c + let h11 = BankersDeque.head t11 + let h11c = BankersDeque.head t11c + let h11 = BankersDeque.head t11 + let h11c = BankersDeque.head t11c + let t12 = BankersDeque.tail t11 + let t12c = BankersDeque.tail t11c + let h12 = BankersDeque.head t12 + let h12c = BankersDeque.head t12c + let h12 = BankersDeque.head t12 + let h12c = BankersDeque.head t12c + let t13 = BankersDeque.tail t12 + let t13c = BankersDeque.tail t12c + let h13 = BankersDeque.head t13 + let h13c = BankersDeque.head t13c + let h13 = BankersDeque.head t13 + let h13c = BankersDeque.head t13c + + let r1r = BankersDeque.append (BankersDeque.ofSeq ["a";"b";"c";"d";"e";"f";"g"]) (BankersDeque.ofSeq ["h";"i";"j";"k";"l";"m"]) + let r1cr = BankersDeque.append (BankersDeque.ofSeqC 3 ["a";"b";"c";"d";"e";"f";"g"]) (BankersDeque.ofSeqC 3 ["h";"i";"j";"k";"l";"m"]) + let h1r = BankersDeque.head r1r + let h1cr = BankersDeque.head r1cr + let t2r = BankersDeque.tail r1r + let t2cr = BankersDeque.tail r1cr + let h2r = BankersDeque.head t2r + let h2cr = BankersDeque.head t2cr + let t3r = BankersDeque.tail t2r + let t3cr = BankersDeque.tail t2cr + let h3r = BankersDeque.head t3r + let h3cr = BankersDeque.head t3cr + let t4r = BankersDeque.tail t3r + let t4cr = BankersDeque.tail t3cr + let h4r = BankersDeque.head t4r + let h4cr = BankersDeque.head t4cr + let t5r = BankersDeque.tail t4r + let t5cr = BankersDeque.tail t4cr + let h5r = BankersDeque.head t5r + let h5cr = BankersDeque.head t5cr + let t6r = BankersDeque.tail t5r + let t6cr = BankersDeque.tail t5cr + let h6r = BankersDeque.head t6r + let h6cr = BankersDeque.head t6cr + let t7r = BankersDeque.tail t6r + let t7cr = BankersDeque.tail t6cr + let h7r = BankersDeque.head t7r + let h7cr = BankersDeque.head t7cr + let h7r = BankersDeque.head t7r + let h7cr = BankersDeque.head t7cr + let t8r = BankersDeque.tail t7r + let t8cr = BankersDeque.tail t7cr + let h8r = BankersDeque.head t8r + let h8cr = BankersDeque.head t8cr + let h8r = BankersDeque.head t8r + let h8cr = BankersDeque.head t8cr + let t9r = BankersDeque.tail t8r + let t9cr = BankersDeque.tail t8cr + let h9r = BankersDeque.head t9r + let h9cr = BankersDeque.head t9cr + let h9r = BankersDeque.head t9r + let h9cr = BankersDeque.head t9cr + let t10r = BankersDeque.tail t9r + let t10cr = BankersDeque.tail t9cr + let h10r = BankersDeque.head t10r + let h10cr = BankersDeque.head t10cr + let h10r = BankersDeque.head t10r + let h10cr = BankersDeque.head t10cr + let t11r = BankersDeque.tail t10r + let t11cr = BankersDeque.tail t10cr + let h11r = BankersDeque.head t11r + let h11cr = BankersDeque.head t11cr + let h11r = BankersDeque.head t11r + let h11cr = BankersDeque.head t11cr + let t12r = BankersDeque.tail t11r + let t12cr = BankersDeque.tail t11cr + let h12r = BankersDeque.head t12r + let h12cr = BankersDeque.head t12cr + let h12r = BankersDeque.head t12r + let h12cr = BankersDeque.head t12cr + let t13r = BankersDeque.tail t12r + let t13cr = BankersDeque.tail t12cr + let h13r = BankersDeque.head t13r + let h13cr = BankersDeque.head t13cr + let h13r = BankersDeque.head t13r + let h13cr = BankersDeque.head t13cr + + ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") + && (h5 = "e") && (h5c = "e") && (h6 = "f") && (h6c = "f") && (h7 = "g") && (h7c = "g") && (h8 = "h") && (h8c = "h") + && (h9 = "i") && (h9c = "i") && (h10 = "j") && (h10c = "j") && (h11 = "k") && (h11c = "k") && (h12 = "l") && (h12c = "l") + && (h13 = "m") && (h13c = "m") && (h1r = "a") && (h1cr = "a") && (h2r = "b") && (h2cr = "b") && (h3r = "c") && (h3cr = "c") + && (h4r = "d") && (h4cr = "d") && (h5r = "e") && (h5cr = "e") && (h6r = "f") && (h6cr = "f") && (h7r = "g") && (h7cr = "g") + && (h8r = "h") && (h8cr = "h") && (h9r = "i") && (h9cr = "i") && (h10r = "j") && (h10cr = "j") + && (h11r = "k") && (h11cr = "k") && (h12r = "l") && (h12cr = "l") && (h13r = "m") && (h13cr = "m")) |> Expect.isTrue "" } + + test "appending BankersDeque.length 2 and BankersDeque.length 2" { + let r1 = BankersDeque.append (BankersDeque.ofSeq ["a";"b"]) (BankersDeque.ofSeq ["c";"d"]) + let r1c = BankersDeque.append (BankersDeque.ofSeqC 3 ["a";"b"]) (BankersDeque.ofSeqC 3 ["c";"d"]) + let h1 = BankersDeque.head r1 + let h1c = BankersDeque.head r1c + let t2 = BankersDeque.tail r1 + let t2c = BankersDeque.tail r1c + let h2 = BankersDeque.head t2 + let h2c = BankersDeque.head t2c + let t3 = BankersDeque.tail t2 + let t3c = BankersDeque.tail t2c + let h3 = BankersDeque.head t3 + let h3c = BankersDeque.head t3c + let t4 = BankersDeque.tail t3 + let t4c = BankersDeque.tail t3c + let h4 = BankersDeque.head t4 + let h4c = BankersDeque.head t4c + + ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d")) |> Expect.isTrue "" } + + test "appending BankersDeque.length 2 and BankersDeque.length 3" { + let r1 = BankersDeque.append (BankersDeque.ofSeq ["a";"b"]) (BankersDeque.ofSeq ["c";"d";"e"]) + let r1c = BankersDeque.append (BankersDeque.ofSeqC 3 ["a";"b"]) (BankersDeque.ofSeqC 3 ["c";"d";"e"]) + let h1 = BankersDeque.head r1 + let h1c = BankersDeque.head r1c + let t2 = BankersDeque.tail r1 + let t2c = BankersDeque.tail r1c + let h2 = BankersDeque.head t2 + let h2c = BankersDeque.head t2c + let t3 = BankersDeque.tail t2 + let t3c = BankersDeque.tail t2c + let h3 = BankersDeque.head t3 + let h3c = BankersDeque.head t3c + let t4 = BankersDeque.tail t3 + let t4c = BankersDeque.tail t3c + let h4 = BankersDeque.head t4 + let h4c = BankersDeque.head t4c + + let t5 = BankersDeque.tail t4 + let t5c = BankersDeque.tail t4c + let h5 = BankersDeque.head t5 + let h5c = BankersDeque.head t5c + + let r1r = BankersDeque.append (BankersDeque.ofSeq ["a";"b";"c"]) (BankersDeque.ofSeq ["d";"e"]) + let r1cr = BankersDeque.append (BankersDeque.ofSeqC 3 ["a";"b";"c"]) (BankersDeque.ofSeqC 3 ["d";"e"]) + let h1r = BankersDeque.head r1r + let h1cr = BankersDeque.head r1cr + let t2r = BankersDeque.tail r1r + let t2cr = BankersDeque.tail r1cr + let h2r = BankersDeque.head t2r + let h2cr = BankersDeque.head t2cr + let t3r = BankersDeque.tail t2r + let t3cr = BankersDeque.tail t2cr + let h3r = BankersDeque.head t3r + let h3cr = BankersDeque.head t3cr + let t4r = BankersDeque.tail t3r + let t4cr = BankersDeque.tail t3cr + let h4r = BankersDeque.head t4r + let h4cr = BankersDeque.head t4cr + + let t5r = BankersDeque.tail t4r + let t5cr = BankersDeque.tail t4cr + let h5r = BankersDeque.head t5r + let h5cr = BankersDeque.head t5cr + + ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") + && (h5 = "e") && (h5c = "e") + && (h1r = "a") && (h1cr = "a") && (h2r = "b") && (h2cr = "b") && (h3r = "c") && (h3cr = "c") && (h4r = "d") && (h4cr = "d") + && (h5r = "e") && (h5cr = "e")) |> Expect.isTrue "" } + + test "appending BankersDeque.length 2 and BankersDeque.length 4" { + let r1 = BankersDeque.append (BankersDeque.ofSeq ["a";"b"]) (BankersDeque.ofSeq ["c";"d";"e";"f"]) + let r1c = BankersDeque.append (BankersDeque.ofSeqC 3 ["a";"b"]) (BankersDeque.ofSeqC 3 ["c";"d";"e";"f"]) + let h1 = BankersDeque.head r1 + let h1c = BankersDeque.head r1c + let t2 = BankersDeque.tail r1 + let t2c = BankersDeque.tail r1c + let h2 = BankersDeque.head t2 + let h2c = BankersDeque.head t2c + let t3 = BankersDeque.tail t2 + let t3c = BankersDeque.tail t2c + let h3 = BankersDeque.head t3 + let h3c = BankersDeque.head t3c + let t4 = BankersDeque.tail t3 + let t4c = BankersDeque.tail t3c + let h4 = BankersDeque.head t4 + let h4c = BankersDeque.head t4c + let t5 = BankersDeque.tail t4 + let t5c = BankersDeque.tail t4c + let h5 = BankersDeque.head t5 + let h5c = BankersDeque.head t5c + let t6 = BankersDeque.tail t5 + let t6c = BankersDeque.tail t5c + let h6 = BankersDeque.head t6 + let h6c = BankersDeque.head t6c + + let r1r = BankersDeque.append (BankersDeque.ofSeq ["a";"b";"c";"d"]) (BankersDeque.ofSeq ["e";"f"]) + let r1cr = BankersDeque.append (BankersDeque.ofSeqC 3 ["a";"b";"c";"d"]) (BankersDeque.ofSeqC 3 ["e";"f"]) + let h1r = BankersDeque.head r1r + let h1cr = BankersDeque.head r1cr + let t2r = BankersDeque.tail r1r + let t2cr = BankersDeque.tail r1cr + let h2r = BankersDeque.head t2r + let h2cr = BankersDeque.head t2cr + let t3r = BankersDeque.tail t2r + let t3cr = BankersDeque.tail t2cr + let h3r = BankersDeque.head t3r + let h3cr = BankersDeque.head t3cr + let t4r = BankersDeque.tail t3r + let t4cr = BankersDeque.tail t3cr + let h4r = BankersDeque.head t4r + let h4cr = BankersDeque.head t4cr + let t5r = BankersDeque.tail t4r + let t5cr = BankersDeque.tail t4cr + let h5r = BankersDeque.head t5r + let h5cr = BankersDeque.head t5cr + let t6r = BankersDeque.tail t5r + let t6cr = BankersDeque.tail t5cr + let h6r = BankersDeque.head t6r + let h6cr = BankersDeque.head t6cr + + ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") + && (h5 = "e") && (h5c = "e") && (h6 = "f") && (h6c = "f") + && (h1r = "a") && (h1cr = "a") && (h2r = "b") && (h2cr = "b") && (h3r = "c") && (h3cr = "c") && (h4r = "d") && (h4cr = "d") + && (h5r = "e") && (h5cr = "e") && (h6r = "f") && (h6cr = "f")) |> Expect.isTrue "" } + + test "appending BankersDeque.length 2 and BankersDeque.length 5" { + let r1 = BankersDeque.append (BankersDeque.ofSeq ["a";"b"]) (BankersDeque.ofSeq ["c";"d";"e";"f";"g"]) + let r1c = BankersDeque.append (BankersDeque.ofSeqC 3 ["a";"b"]) (BankersDeque.ofSeqC 3 ["c";"d";"e";"f";"g"]) + let h1 = BankersDeque.head r1 + let h1c = BankersDeque.head r1c + let t2 = BankersDeque.tail r1 + let t2c = BankersDeque.tail r1c + let h2 = BankersDeque.head t2 + let h2c = BankersDeque.head t2c + let t3 = BankersDeque.tail t2 + let t3c = BankersDeque.tail t2c + let h3 = BankersDeque.head t3 + let h3c = BankersDeque.head t3c + let t4 = BankersDeque.tail t3 + let t4c = BankersDeque.tail t3c + let h4 = BankersDeque.head t4 + let h4c = BankersDeque.head t4c + let t5 = BankersDeque.tail t4 + let t5c = BankersDeque.tail t4c + let h5 = BankersDeque.head t5 + let h5c = BankersDeque.head t5c + let t6 = BankersDeque.tail t5 + let t6c = BankersDeque.tail t5c + let h6 = BankersDeque.head t6 + let h6c = BankersDeque.head t6c + let t7 = BankersDeque.tail t6 + let t7c = BankersDeque.tail t6c + let h7 = BankersDeque.head t7 + let h7c = BankersDeque.head t7c + + let r1r = BankersDeque.append (BankersDeque.ofSeq ["a";"b";"c";"d";"e"]) (BankersDeque.ofSeq ["f";"g"]) + let r1cr = BankersDeque.append (BankersDeque.ofSeqC 3 ["a";"b";"c";"d";"e"]) (BankersDeque.ofSeqC 3 ["f";"g"]) + let h1r = BankersDeque.head r1r + let h1cr = BankersDeque.head r1cr + let t2r = BankersDeque.tail r1r + let t2cr = BankersDeque.tail r1cr + let h2r = BankersDeque.head t2r + let h2cr = BankersDeque.head t2cr + let t3r = BankersDeque.tail t2r + let t3cr = BankersDeque.tail t2cr + let h3r = BankersDeque.head t3r + let h3cr = BankersDeque.head t3cr + let t4r = BankersDeque.tail t3r + let t4cr = BankersDeque.tail t3cr + let h4r = BankersDeque.head t4r + let h4cr = BankersDeque.head t4cr + let t5r = BankersDeque.tail t4r + let t5cr = BankersDeque.tail t4cr + let h5r = BankersDeque.head t5r + let h5cr = BankersDeque.head t5cr + let t6r = BankersDeque.tail t5r + let t6cr = BankersDeque.tail t5cr + let h6r = BankersDeque.head t6r + let h6cr = BankersDeque.head t6cr + let t7r = BankersDeque.tail t6r + let t7cr = BankersDeque.tail t6cr + let h7r = BankersDeque.head t7r + let h7cr = BankersDeque.head t7cr + + ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") + && (h5 = "e") && (h5c = "e") && (h6 = "f") && (h6c = "f") && (h7 = "g") && (h7c = "g") + && (h1r = "a") && (h1cr = "a") && (h2r = "b") && (h2cr = "b") && (h3r = "c") && (h3cr = "c") && (h4r = "d") && (h4cr = "d") + && (h5r = "e") && (h5cr = "e") && (h6r = "f") && (h6cr = "f") && (h7r = "g") && (h7cr = "g")) |> Expect.isTrue "" } + + test "appending BankersDeque.length 3 and BankersDeque.length 3" { + let r1 = BankersDeque.append (BankersDeque.ofSeq ["a";"b";"c"]) (BankersDeque.ofSeq ["d";"e";"f"]) + let r1c = BankersDeque.append (BankersDeque.ofSeqC 3 ["a";"b";"c"]) (BankersDeque.ofSeqC 3 ["d";"e";"f"]) + let h1 = BankersDeque.head r1 + let h1c = BankersDeque.head r1c + let t2 = BankersDeque.tail r1 + let t2c = BankersDeque.tail r1c + let h2 = BankersDeque.head t2 + let h2c = BankersDeque.head t2c + let t3 = BankersDeque.tail t2 + let t3c = BankersDeque.tail t2c + let h3 = BankersDeque.head t3 + let h3c = BankersDeque.head t3c + let t4 = BankersDeque.tail t3 + let t4c = BankersDeque.tail t3c + let h4 = BankersDeque.head t4 + let h4c = BankersDeque.head t4c + let t5 = BankersDeque.tail t4 + let t5c = BankersDeque.tail t4c + let h5 = BankersDeque.head t5 + let h5c = BankersDeque.head t5c + let t6 = BankersDeque.tail t5 + let t6c = BankersDeque.tail t5c + let h6 = BankersDeque.head t6 + let h6c = BankersDeque.head t6c + + ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") + && (h5 = "e") && (h5c = "e") && (h6 = "f") && (h6c = "f")) |> Expect.isTrue "" } + + + test "BankersDeque.lookup BankersDeque.length 1" { + len1 |> BankersDeque.lookup 0 |> Expect.equal "" "a" } + + test "BankersDeque.lookup BankersDeque.length 2" { + (((len2 |> BankersDeque.lookup 0) = "b") && ((len2 |> BankersDeque.lookup 1) = "a")) |> Expect.isTrue "" } + + test "BankersDeque.lookup BankersDeque.length 3" { + (((len3 |> BankersDeque.lookup 0) = "c") && ((len3 |> BankersDeque.lookup 1) = "b") && ((len3 |> BankersDeque.lookup 2) = "a")) |> Expect.isTrue "" } + + test "BankersDeque.lookup BankersDeque.length 4" { + (((len4 |> BankersDeque.lookup 0) = "d") && ((len4 |> BankersDeque.lookup 1) = "c") && ((len4 |> BankersDeque.lookup 2) = "b") && ((len4 |> BankersDeque.lookup 3) = "a")) + |> Expect.isTrue "" } + + test "BankersDeque.lookup BankersDeque.length 5" { + (((len5 |> BankersDeque.lookup 0) = "e") && ((len5 |> BankersDeque.lookup 1) = "d") && ((len5 |> BankersDeque.lookup 2) = "c") && ((len5 |> BankersDeque.lookup 3) = "b") + && ((len5 |> BankersDeque.lookup 4) = "a")) |> Expect.isTrue "" } + + test "BankersDeque.lookup BankersDeque.length 6" { + (((len6 |> BankersDeque.lookup 0) = "f") && ((len6 |> BankersDeque.lookup 1) = "e") && ((len6 |> BankersDeque.lookup 2) = "d") && ((len6 |> BankersDeque.lookup 3) = "c") + && ((len6 |> BankersDeque.lookup 4) = "b") && ((len6 |> BankersDeque.lookup 5) = "a")) |> Expect.isTrue "" } + + test "BankersDeque.lookup BankersDeque.length 7" { + (((len7 |> BankersDeque.lookup 0) = "g") && ((len7 |> BankersDeque.lookup 1) = "f") && ((len7 |> BankersDeque.lookup 2) = "e") && ((len7 |> BankersDeque.lookup 3) = "d") + && ((len7 |> BankersDeque.lookup 4) = "c") && ((len7 |> BankersDeque.lookup 5) = "b") && ((len7 |> BankersDeque.lookup 6) = "a")) |> Expect.isTrue "" } + + test "BankersDeque.lookup BankersDeque.length 8" { + (((len8 |> BankersDeque.lookup 0) = "h") && ((len8 |> BankersDeque.lookup 1) = "g") && ((len8 |> BankersDeque.lookup 2) = "f") && ((len8 |> BankersDeque.lookup 3) = "e") + && ((len8 |> BankersDeque.lookup 4) = "d") && ((len8 |> BankersDeque.lookup 5) = "c") && ((len8 |> BankersDeque.lookup 6) = "b") && ((len8 |> BankersDeque.lookup 7) = "a")) + |> Expect.isTrue "" } + + test "BankersDeque.lookup BankersDeque.length 9" { + (((len9 |> BankersDeque.lookup 0) = "i") && ((len9 |> BankersDeque.lookup 1) = "h") && ((len9 |> BankersDeque.lookup 2) = "g") && ((len9 |> BankersDeque.lookup 3) = "f") + && ((len9 |> BankersDeque.lookup 4) = "e") && ((len9 |> BankersDeque.lookup 5) = "d") && ((len9 |> BankersDeque.lookup 6) = "c") && ((len9 |> BankersDeque.lookup 7) = "b") + && ((len9 |> BankersDeque.lookup 8) = "a")) |> Expect.isTrue "" } + + test "BankersDeque.lookup BankersDeque.length 10" { + (((lena |> BankersDeque.lookup 0) = "j") && ((lena |> BankersDeque.lookup 1) = "i") && ((lena |> BankersDeque.lookup 2) = "h") && ((lena |> BankersDeque.lookup 3) = "g") + && ((lena |> BankersDeque.lookup 4) = "f") && ((lena |> BankersDeque.lookup 5) = "e") && ((lena |> BankersDeque.lookup 6) = "d") && ((lena |> BankersDeque.lookup 7) = "c") + && ((lena |> BankersDeque.lookup 8) = "b") && ((lena |> BankersDeque.lookup 9) = "a")) |> Expect.isTrue "" } + + test "BankersDeque.tryLookup BankersDeque.length 1" { + let a = len1 |> BankersDeque.tryLookup 0 + (a.Value = "a") |> Expect.isTrue "" } + + test "BankersDeque.tryLookup BankersDeque.length 2" { + let b = len2 |> BankersDeque.tryLookup 0 + let a = len2 |> BankersDeque.tryLookup 1 + ((b.Value = "b") && (a.Value = "a")) |> Expect.isTrue "" } + + test "BankersDeque.tryLookup BankersDeque.length 3" { + let c = len3 |> BankersDeque.tryLookup 0 + let b = len3 |> BankersDeque.tryLookup 1 + let a = len3 |> BankersDeque.tryLookup 2 + ((c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> Expect.isTrue "" } + + test "BankersDeque.tryLookup BankersDeque.length 4" { + let d = len4 |> BankersDeque.tryLookup 0 + let c = len4 |> BankersDeque.tryLookup 1 + let b = len4 |> BankersDeque.tryLookup 2 + let a = len4 |> BankersDeque.tryLookup 3 + ((d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> Expect.isTrue "" } + + test "BankersDeque.tryLookup BankersDeque.length 5" { + let e = len5 |> BankersDeque.tryLookup 0 + let d = len5 |> BankersDeque.tryLookup 1 + let c = len5 |> BankersDeque.tryLookup 2 + let b = len5 |> BankersDeque.tryLookup 3 + let a = len5 |> BankersDeque.tryLookup 4 + ((e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> Expect.isTrue "" } + + test "BankersDeque.tryLookup BankersDeque.length 6" { + let f = len6 |> BankersDeque.tryLookup 0 + let e = len6 |> BankersDeque.tryLookup 1 + let d = len6 |> BankersDeque.tryLookup 2 + let c = len6 |> BankersDeque.tryLookup 3 + let b = len6 |> BankersDeque.tryLookup 4 + let a = len6 |> BankersDeque.tryLookup 5 + ((f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) + |> Expect.isTrue "" } + + test "BankersDeque.tryLookup BankersDeque.length 7" { + let g = len7 |> BankersDeque.tryLookup 0 + let f = len7 |> BankersDeque.tryLookup 1 + let e = len7 |> BankersDeque.tryLookup 2 + let d = len7 |> BankersDeque.tryLookup 3 + let c = len7 |> BankersDeque.tryLookup 4 + let b = len7 |> BankersDeque.tryLookup 5 + let a = len7 |> BankersDeque.tryLookup 6 + ((g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") + && (a.Value = "a")) |> Expect.isTrue "" } + + test "BankersDeque.tryLookup BankersDeque.length 8" { + let h = len8 |> BankersDeque.tryLookup 0 + let g = len8 |> BankersDeque.tryLookup 1 + let f = len8 |> BankersDeque.tryLookup 2 + let e = len8 |> BankersDeque.tryLookup 3 + let d = len8 |> BankersDeque.tryLookup 4 + let c = len8 |> BankersDeque.tryLookup 5 + let b = len8 |> BankersDeque.tryLookup 6 + let a = len8 |> BankersDeque.tryLookup 7 + ((h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") + && (b.Value = "b")&& (a.Value = "a")) |> Expect.isTrue "" } + + test "BankersDeque.tryLookup BankersDeque.length 9" { + let i = len9 |> BankersDeque.tryLookup 0 + let h = len9 |> BankersDeque.tryLookup 1 + let g = len9 |> BankersDeque.tryLookup 2 + let f = len9 |> BankersDeque.tryLookup 3 + let e = len9 |> BankersDeque.tryLookup 4 + let d = len9 |> BankersDeque.tryLookup 5 + let c = len9 |> BankersDeque.tryLookup 6 + let b = len9 |> BankersDeque.tryLookup 7 + let a = len9 |> BankersDeque.tryLookup 8 + ((i.Value = "i") && (h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") + && (c.Value = "c") && (b.Value = "b")&& (a.Value = "a")) |> Expect.isTrue "" } + + test "BankersDeque.tryLookup BankersDeque.length 10" { + let j = lena |> BankersDeque.tryLookup 0 + let i = lena |> BankersDeque.tryLookup 1 + let h = lena |> BankersDeque.tryLookup 2 + let g = lena |> BankersDeque.tryLookup 3 + let f = lena |> BankersDeque.tryLookup 4 + let e = lena |> BankersDeque.tryLookup 5 + let d = lena |> BankersDeque.tryLookup 6 + let c = lena |> BankersDeque.tryLookup 7 + let b = lena |> BankersDeque.tryLookup 8 + let a = lena |> BankersDeque.tryLookup 9 + ((j.Value = "j") && (i.Value = "i") && (h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") + && (d.Value = "d") && (c.Value = "c") && (b.Value = "b")&& (a.Value = "a")) |> Expect.isTrue "" } + + test "BankersDeque.tryLookup not found" { + lena |> BankersDeque.tryLookup 10 |> Expect.isNone "" } + + test "BankersDeque.remove elements BankersDeque.length 1" { + len1 |> BankersDeque.remove 0 |> BankersDeque.isEmpty |> Expect.isTrue "" } + + test "BankersDeque.remove elements BankersDeque.length 2" { + let a = len2 |> BankersDeque.remove 0 |> BankersDeque.head + let b = len2 |> BankersDeque.remove 1 |> BankersDeque.head + ((a = "a") && (b = "b")) |> Expect.isTrue "" } + + test "BankersDeque.remove elements BankersDeque.length 3" { + let r0 = (BankersDeque.ofSeq ["a";"b";"c"]) |> BankersDeque.remove 0 + let b0 = BankersDeque.head r0 + let t0 = BankersDeque.tail r0 + let c0 = BankersDeque.head t0 + + let r1 = (BankersDeque.ofSeq ["a";"b";"c"]) |> BankersDeque.remove 1 + let a1 = BankersDeque.head r1 + let t1 = BankersDeque.tail r1 + let c1 = BankersDeque.head t1 + + let r2 = (BankersDeque.ofSeq ["a";"b";"c"]) |> BankersDeque.remove 2 + let a2 = BankersDeque.head r2 + let t2 = BankersDeque.tail r2 + let b2 = BankersDeque.head t2 + + ((b0 = "b") && (c0 = "c") && (a1 = "a") && (c1 = "c") && (a2 = "a") && (b2 = "b")) |> Expect.isTrue "" } + + test "BankersDeque.remove elements BankersDeque.length 4" { + let r0 = (BankersDeque.ofSeq ["a";"b";"c";"d"]) |> BankersDeque.remove 0 + let b0 = BankersDeque.head r0 + let t0 = BankersDeque.tail r0 + let c0 = BankersDeque.head t0 + let t01 = BankersDeque.tail t0 + let d0 = BankersDeque.head t01 + + let r1 = (BankersDeque.ofSeq ["a";"b";"c";"d"]) |> BankersDeque.remove 1 + let a1 = BankersDeque.head r1 + let t11 = BankersDeque.tail r1 + let c1 = BankersDeque.head t11 + let t12 = BankersDeque.tail t11 + let d1 = BankersDeque.head t12 + + let r2 = (BankersDeque.ofSeq ["a";"b";"c";"d"]) |> BankersDeque.remove 2 + let a2 = BankersDeque.head r2 + let t21 = BankersDeque.tail r2 + let b2 = BankersDeque.head t21 + let t22 = BankersDeque.tail t21 + let c2 = BankersDeque.head t22 + + let r3 = (BankersDeque.ofSeq ["a";"b";"c";"d"]) |> BankersDeque.remove 3 + let a3 = BankersDeque.head r3 + let t31 = BankersDeque.tail r3 + let b3 = BankersDeque.head t31 + let t32 = BankersDeque.tail t31 + let c3 = BankersDeque.head t32 + + ((b0 = "b") && (c0 = "c") && (d0 = "d") + && (a1 = "a") && (c1 = "c") && (d1 = "d") + && (a2 = "a") && (b2 = "b") && (c2 = "d") + && (a3 = "a") && (b3 = "b") && (c3 = "c")) |> Expect.isTrue "" } + + test "BankersDeque.remove elements BankersDeque.length 5" { + let r0 = (BankersDeque.ofSeq ["a";"b";"c";"d";"e"]) |> BankersDeque.remove 0 + let b0 = BankersDeque.head r0 + let t01 = BankersDeque.tail r0 + let c0 = BankersDeque.head t01 + let t02= BankersDeque.tail t01 + let d0 = BankersDeque.head t02 + let t03 = BankersDeque.tail t02 + let e0 = BankersDeque.head t03 + + let r1 = (BankersDeque.ofSeq ["a";"b";"c";"d";"e"]) |> BankersDeque.remove 1 + let a1 = BankersDeque.head r1 + let t11 = BankersDeque.tail r1 + let c1 = BankersDeque.head t11 + let t12 = BankersDeque.tail t11 + let d1 = BankersDeque.head t12 + let t13 = BankersDeque.tail t12 + let e1 = BankersDeque.head t13 + + let r2 = (BankersDeque.ofSeq ["a";"b";"c";"d";"e"]) |> BankersDeque.remove 2 + let a2 = BankersDeque.head r2 + let t21 = BankersDeque.tail r2 + let b2 = BankersDeque.head t21 + let t22 = BankersDeque.tail t21 + let c2 = BankersDeque.head t22 + let t23 = BankersDeque.tail t22 + let e2 = BankersDeque.head t23 + + let r3 = (BankersDeque.ofSeq ["a";"b";"c";"d";"e"]) |> BankersDeque.remove 3 + let a3 = BankersDeque.head r3 + let t31 = BankersDeque.tail r3 + let b3 = BankersDeque.head t31 + let t32 = BankersDeque.tail t31 + let c3 = BankersDeque.head t32 + let t33 = BankersDeque.tail t32 + let e3 = BankersDeque.head t33 + + let r4 = (BankersDeque.ofSeq ["a";"b";"c";"d";"e"]) |> BankersDeque.remove 4 + let a4 = BankersDeque.head r4 + let t41 = BankersDeque.tail r4 + let b4 = BankersDeque.head t41 + let t42 = BankersDeque.tail t41 + let c4 = BankersDeque.head t42 + let t43 = BankersDeque.tail t42 + let d4 = BankersDeque.head t43 + + ((b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") + && (a1 = "a") && (c1 = "c") && (d1 = "d") && (e1 = "e") + && (a2 = "a") && (b2 = "b") && (c2 = "d") && (e2 = "e") + && (a3 = "a") && (b3 = "b") && (c3 = "c") && (e3 = "e") + && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d")) |> Expect.isTrue "" } + + test "BankersDeque.remove elements BankersDeque.length 6" { + let r0 = (BankersDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> BankersDeque.remove 0 + let b0 = BankersDeque.head r0 + let t01 = BankersDeque.tail r0 + let c0 = BankersDeque.head t01 + let t02= BankersDeque.tail t01 + let d0 = BankersDeque.head t02 + let t03 = BankersDeque.tail t02 + let e0 = BankersDeque.head t03 + let t04 = BankersDeque.tail t03 + let f0 = BankersDeque.head t04 + + let r1 = (BankersDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> BankersDeque.remove 1 + let a1 = BankersDeque.head r1 + let t11 = BankersDeque.tail r1 + let c1 = BankersDeque.head t11 + let t12 = BankersDeque.tail t11 + let d1 = BankersDeque.head t12 + let t13 = BankersDeque.tail t12 + let e1 = BankersDeque.head t13 + let t14 = BankersDeque.tail t13 + let f1 = BankersDeque.head t14 + + let r2 = (BankersDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> BankersDeque.remove 2 + let a2 = BankersDeque.head r2 + let t21 = BankersDeque.tail r2 + let b2 = BankersDeque.head t21 + let t22 = BankersDeque.tail t21 + let c2 = BankersDeque.head t22 + let t23 = BankersDeque.tail t22 + let e2 = BankersDeque.head t23 + let t24 = BankersDeque.tail t23 + let f2 = BankersDeque.head t24 + + let r3 = (BankersDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> BankersDeque.remove 3 + let a3 = BankersDeque.head r3 + let t31 = BankersDeque.tail r3 + let b3 = BankersDeque.head t31 + let t32 = BankersDeque.tail t31 + let c3 = BankersDeque.head t32 + let t33 = BankersDeque.tail t32 + let e3 = BankersDeque.head t33 + let t34 = BankersDeque.tail t33 + let f3 = BankersDeque.head t34 + + let r4 = (BankersDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> BankersDeque.remove 4 + let a4 = BankersDeque.head r4 + let t41 = BankersDeque.tail r4 + let b4 = BankersDeque.head t41 + let t42 = BankersDeque.tail t41 + let c4 = BankersDeque.head t42 + let t43 = BankersDeque.tail t42 + let d4 = BankersDeque.head t43 + let t44 = BankersDeque.tail t43 + let f4 = BankersDeque.head t44 + + let r5 = (BankersDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> BankersDeque.remove 5 + let a5 = BankersDeque.head r5 + let t51 = BankersDeque.tail r5 + let b5 = BankersDeque.head t51 + let t52 = BankersDeque.tail t51 + let c5 = BankersDeque.head t52 + let t53 = BankersDeque.tail t52 + let d5 = BankersDeque.head t53 + let t54 = BankersDeque.tail t53 + let e5 = BankersDeque.head t54 + + ((b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") && (f0 = "f") + && (a1 = "a") && (c1 = "c") && (d1 = "d") && (e1 = "e") && (f1 = "f") + && (a2 = "a") && (b2 = "b") && (c2 = "d") && (e2 = "e") && (f2 = "f") + && (a3 = "a") && (b3 = "b") && (c3 = "c") && (e3 = "e") && (f3 = "f") + && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d") && (f4 = "f") + && (a5 = "a") && (b5 = "b") && (c5 = "c") && (d5 = "d") && (e5 = "e")) |> Expect.isTrue "" } + + test "tryRemoveempty" { + (BankersDeque.empty 3) |> BankersDeque.tryRemove 0 |> Expect.isNone "" } + + test "BankersDeque.tryRemove elements BankersDeque.length 1" { + let a = len1 |> BankersDeque.tryRemove 0 + a.Value |> BankersDeque.isEmpty |> Expect.isTrue "" } + + test "BankersDeque.tryRemove elements BankersDeque.length 2" { + let a = len2 |> BankersDeque.tryRemove 0 + let a1 = BankersDeque.head a.Value + let b = len2 |> BankersDeque.tryRemove 1 + let b1 = BankersDeque.head b.Value + ((a1 = "a") && (b1 = "b")) |> Expect.isTrue "" } + + test "BankersDeque.tryRemove elements BankersDeque.length 3" { + let x0 = (BankersDeque.ofSeq ["a";"b";"c"]) |> BankersDeque.tryRemove 0 + let r0 = x0.Value + let b0 = BankersDeque.head r0 + let t0 = BankersDeque.tail r0 + let c0 = BankersDeque.head t0 + + let x1 = (BankersDeque.ofSeq ["a";"b";"c"]) |> BankersDeque.tryRemove 1 + let r1 = x1.Value + let a1 = BankersDeque.head r1 + let t1 = BankersDeque.tail r1 + let c1 = BankersDeque.head t1 + + let x2 = (BankersDeque.ofSeq ["a";"b";"c"]) |> BankersDeque.tryRemove 2 + let r2 = x2.Value + let a2 = BankersDeque.head r2 + let t2 = BankersDeque.tail r2 + let b2 = BankersDeque.head t2 + + ((b0 = "b") && (c0 = "c") && (a1 = "a") && (c1 = "c") && (a2 = "a") && (b2 = "b")) |> Expect.isTrue "" } + + test "BankersDeque.tryRemove elements BankersDeque.length 4" { + let x0 = (BankersDeque.ofSeq ["a";"b";"c";"d"]) |> BankersDeque.tryRemove 0 + let r0 = x0.Value + let b0 = BankersDeque.head r0 + let t0 = BankersDeque.tail r0 + let c0 = BankersDeque.head t0 + let t01 = BankersDeque.tail t0 + let d0 = BankersDeque.head t01 + + let x1 = (BankersDeque.ofSeq ["a";"b";"c";"d"]) |> BankersDeque.tryRemove 1 + let r1 = x1.Value + let a1 = BankersDeque.head r1 + let t11 = BankersDeque.tail r1 + let c1 = BankersDeque.head t11 + let t12 = BankersDeque.tail t11 + let d1 = BankersDeque.head t12 - let x2 = (ofSeq ["a";"b";"c";"d"]) |> tryRemove 2 - let r2 = x2.Value - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 + let x2 = (BankersDeque.ofSeq ["a";"b";"c";"d"]) |> BankersDeque.tryRemove 2 + let r2 = x2.Value + let a2 = BankersDeque.head r2 + let t21 = BankersDeque.tail r2 + let b2 = BankersDeque.head t21 + let t22 = BankersDeque.tail t21 + let c2 = BankersDeque.head t22 - let x3 = (ofSeq ["a";"b";"c";"d"]) |> tryRemove 3 - let r3 = x3.Value - let a3 = head r3 - let t31 = tail r3 - let b3 = head t31 - let t32 = tail t31 - let c3 = head t32 - - ((b0 = "b") && (c0 = "c") && (d0 = "d") - && (a1 = "a") && (c1 = "c") && (d1 = "d") - && (a2 = "a") && (b2 = "b") && (c2 = "d") - && (a3 = "a") && (b3 = "b") && (c3 = "c")) |> should equal true - -[] -let ``tryRemove elements length 5``() = - let x0 = (ofSeq ["a";"b";"c";"d";"e"]) |> tryRemove 0 - let r0 = x0.Value - let b0 = head r0 - let t01 = tail r0 - let c0 = head t01 - let t02= tail t01 - let d0 = head t02 - let t03 = tail t02 - let e0 = head t03 - - let x1 = (ofSeq ["a";"b";"c";"d";"e"]) |> tryRemove 1 - let r1 = x1.Value - let a1 = head r1 - let t11 = tail r1 - let c1 = head t11 - let t12 = tail t11 - let d1 = head t12 - let t13 = tail t12 - let e1 = head t13 - - let x2 = (ofSeq ["a";"b";"c";"d";"e"]) |> tryRemove 2 - let r2 = x2.Value - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 - let t23 = tail t22 - let e2 = head t23 - - let x3 = (ofSeq ["a";"b";"c";"d";"e"]) |> tryRemove 3 - let r3 = x3.Value - let a3 = head r3 - let t31 = tail r3 - let b3 = head t31 - let t32 = tail t31 - let c3 = head t32 - let t33 = tail t32 - let e3 = head t33 - - let x4 = (ofSeq ["a";"b";"c";"d";"e"]) |> tryRemove 4 - let r4 = x4.Value - let a4 = head r4 - let t41 = tail r4 - let b4 = head t41 - let t42 = tail t41 - let c4 = head t42 - let t43 = tail t42 - let d4 = head t43 - - ((b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") - && (a1 = "a") && (c1 = "c") && (d1 = "d") && (e1 = "e") - && (a2 = "a") && (b2 = "b") && (c2 = "d") && (e2 = "e") - && (a3 = "a") && (b3 = "b") && (c3 = "c") && (e3 = "e") - && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d")) |> should equal true - -[] -let ``tryRemove elements length 6``() = - let x0 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> tryRemove 0 - let r0 = x0.Value - let b0 = head r0 - let t01 = tail r0 - let c0 = head t01 - let t02= tail t01 - let d0 = head t02 - let t03 = tail t02 - let e0 = head t03 - let t04 = tail t03 - let f0 = head t04 - - let x1 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> tryRemove 1 - let r1 =x1.Value - let a1 = head r1 - let t11 = tail r1 - let c1 = head t11 - let t12 = tail t11 - let d1 = head t12 - let t13 = tail t12 - let e1 = head t13 - let t14 = tail t13 - let f1 = head t14 - - let x2 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> tryRemove 2 - let r2 = x2.Value - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 - let t23 = tail t22 - let e2 = head t23 - let t24 = tail t23 - let f2 = head t24 - - let x3 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> tryRemove 3 - let r3 = x3.Value - let a3 = head r3 - let t31 = tail r3 - let b3 = head t31 - let t32 = tail t31 - let c3 = head t32 - let t33 = tail t32 - let e3 = head t33 - let t34 = tail t33 - let f3 = head t34 - - let x4 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> tryRemove 4 - let r4 = x4.Value - let a4 = head r4 - let t41 = tail r4 - let b4 = head t41 - let t42 = tail t41 - let c4 = head t42 - let t43 = tail t42 - let d4 = head t43 - let t44 = tail t43 - let f4 = head t44 - - let x5 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> tryRemove 5 - let r5 = x5.Value - let a5 = head r5 - let t51 = tail r5 - let b5 = head t51 - let t52 = tail t51 - let c5 = head t52 - let t53 = tail t52 - let d5 = head t53 - let t54 = tail t53 - let e5 = head t54 - - ((b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") && (f0 = "f") - && (a1 = "a") && (c1 = "c") && (d1 = "d") && (e1 = "e") && (f1 = "f") - && (a2 = "a") && (b2 = "b") && (c2 = "d") && (e2 = "e") && (f2 = "f") - && (a3 = "a") && (b3 = "b") && (c3 = "c") && (e3 = "e") && (f3 = "f") - && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d") && (f4 = "f") - && (a5 = "a") && (b5 = "b") && (c5 = "c") && (d5 = "d") && (e5 = "e")) |> should equal true - -[] -let ``update elements length 1``() = - len1 |> update 0 "aa" |> head |> should equal "aa" - -[] -let ``update elements length 2``() = - let r0 = (ofSeq ["a";"b"]) |> update 0 "zz" - let a0 = head r0 - let t01 = tail r0 - let b0 = head t01 - - let r1 = (ofSeq ["a";"b"]) |> update 1 "zz" - let a1 = head r1 - let t11 = tail r1 - let b1 = head t11 - - ((a0 = "zz") && (b0 = "b") - && (a1 = "a") && (b1 = "zz")) |> should equal true - -[] -let ``update elements length 3``() = - let r0 = (ofSeq ["a";"b";"c"]) |> update 0 "zz" - let a0 = head r0 - let t01 = tail r0 - let b0 = head t01 - let t02 = tail t01 - let c0 = head t02 - - let r1 = (ofSeq ["a";"b";"c"]) |> update 1 "zz" - let a1 = head r1 - let t11 = tail r1 - let b1 = head t11 - let t12 = tail t11 - let c1 = head t12 - - let r2 = (ofSeq ["a";"b";"c"]) |> update 2 "zz" - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 - - ((a0 = "zz") && (b0 = "b") && (c0 = "c") - && (a1 = "a") && (b1 = "zz") && (c1 = "c") - && (a2 = "a") && (b2 = "b") && (c2 = "zz")) |> should equal true - -[] -let ``update elements length 4``() = - let r0 = (ofSeq ["a";"b";"c";"d"]) |> update 0 "zz" - let a0 = head r0 - let t01 = tail r0 - let b0 = head t01 - let t02 = tail t01 - let c0 = head t02 - let t03 = tail t02 - let d0 = head t03 - - let r1 = (ofSeq ["a";"b";"c";"d"]) |> update 1 "zz" - let a1 = head r1 - let t11 = tail r1 - let b1 = head t11 - let t12 = tail t11 - let c1 = head t12 - let t13 = tail t12 - let d1 = head t13 - - let r2 = (ofSeq ["a";"b";"c";"d"]) |> update 2 "zz" - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 - let t23 = tail t22 - let d2 = head t23 - - let r3 = (ofSeq ["a";"b";"c";"d"]) |> update 3 "zz" - let a3 = head r3 - let t31 = tail r3 - let b3 = head t31 - let t32 = tail t31 - let c3 = head t32 - let t33 = tail t32 - let d3 = head t33 - - ((a0 = "zz") && (b0 = "b") && (c0 = "c") && (d0 = "d") - && (a1 = "a") && (b1 = "zz") && (c1 = "c") && (d1 = "d") - && (a2 = "a") && (b2 = "b") && (c2 = "zz") && (d2 = "d") - && (a3 = "a") && (b3 = "b") && (c3 = "c") && (d3 = "zz")) |> should equal true - -[] -let ``update elements length 5``() = - let r0 = (ofSeq ["a";"b";"c";"d";"e"]) |> update 0 "zz" - let a0 = head r0 - let t01 = tail r0 - let b0 = head t01 - let t02 = tail t01 - let c0 = head t02 - let t03 = tail t02 - let d0 = head t03 - let t04 = tail t03 - let e0 = head t04 - - let r1 = (ofSeq ["a";"b";"c";"d";"e"]) |> update 1 "zz" - let a1 = head r1 - let t11 = tail r1 - let b1 = head t11 - let t12 = tail t11 - let c1 = head t12 - let t13 = tail t12 - let d1 = head t13 - let t14 = tail t13 - let e1 = head t14 - - let r2 = (ofSeq ["a";"b";"c";"d";"e"]) |> update 2 "zz" - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 - let t23 = tail t22 - let d2 = head t23 - let t24 = tail t23 - let e2 = head t24 - - let r3 = (ofSeq ["a";"b";"c";"d";"e"]) |> update 3 "zz" - let a3 = head r3 - let t31 = tail r3 - let b3 = head t31 - let t32 = tail t31 - let c3 = head t32 - let t33 = tail t32 - let d3 = head t33 - let t34 = tail t33 - let e3 = head t34 - - let r4 = (ofSeq ["a";"b";"c";"d";"e"]) |> update 4 "zz" - let a4 = head r4 - let t41 = tail r4 - let b4 = head t41 - let t42 = tail t41 - let c4 = head t42 - let t43 = tail t42 - let d4 = head t43 - let t44 = tail t43 - let e4 = head t44 - - ((a0 = "zz") && (b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") - && (a1 = "a") && (b1 = "zz") && (c1 = "c") && (d1 = "d") && (e1 = "e") - && (a2 = "a") && (b2 = "b") && (c2 = "zz") && (d2 = "d") && (e2 = "e") - && (a3 = "a") && (b3 = "b") && (c3 = "c") && (d3 = "zz") && (e3 = "e") - && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d") && (e4 = "zz")) |> should equal true - -[] -let ``update elements length 6``() = - let r0 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> update 0 "zz" - let a0 = head r0 - let t01 = tail r0 - let b0 = head t01 - let t02 = tail t01 - let c0 = head t02 - let t03 = tail t02 - let d0 = head t03 - let t04 = tail t03 - let e0 = head t04 - let t05 = tail t04 - let f0 = head t05 - - let r1 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> update 1 "zz" - let a1 = head r1 - let t11 = tail r1 - let b1 = head t11 - let t12 = tail t11 - let c1 = head t12 - let t13 = tail t12 - let d1 = head t13 - let t14 = tail t13 - let e1 = head t14 - let t15 = tail t14 - let f1 = head t15 - - let r2 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> update 2 "zz" - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 - let t23 = tail t22 - let d2 = head t23 - let t24 = tail t23 - let e2 = head t24 - let t25 = tail t24 - let f2 = head t25 - - let r3 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> update 3 "zz" - let a3 = head r3 - let t31 = tail r3 - let b3 = head t31 - let t32 = tail t31 - let c3 = head t32 - let t33 = tail t32 - let d3 = head t33 - let t34 = tail t33 - let e3 = head t34 - let t35 = tail t34 - let f3 = head t35 - - let r4 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> update 4 "zz" - let a4 = head r4 - let t41 = tail r4 - let b4 = head t41 - let t42 = tail t41 - let c4 = head t42 - let t43 = tail t42 - let d4 = head t43 - let t44 = tail t43 - let e4 = head t44 - let t45 = tail t44 - let f4 = head t45 - - let r5 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> update 5 "zz" - let a5 = head r5 - let t51 = tail r5 - let b5 = head t51 - let t52 = tail t51 - let c5 = head t52 - let t53 = tail t52 - let d5 = head t53 - let t54 = tail t53 - let e5 = head t54 - let t55 = tail t54 - let f5 = head t55 - - ((a0 = "zz") && (b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") && (f0 = "f") - && (a1 = "a") && (b1 = "zz") && (c1 = "c") && (d1 = "d") && (e1 = "e") && (f1 = "f") - && (a2 = "a") && (b2 = "b") && (c2 = "zz") && (d2 = "d") && (e2 = "e") && (f2 = "f") - && (a3 = "a") && (b3 = "b") && (c3 = "c") && (d3 = "zz") && (e3 = "e") && (f3 = "f") - && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d") && (e4 = "zz") && (f4 = "f") - && (a5 = "a") && (b5 = "b") && (c5 = "c") && (d5 = "d") && (e5 = "e") && (f5 = "zz")) |> should equal true - -[] -let ``tryUpdate elements length 1``() = - let a = len1 |> tryUpdate 0 "aa" - a.Value |> head |> should equal "aa" - -[] -let ``tryUpdate elements length 2``() = - let x0 = (ofSeq ["a";"b"]) |> tryUpdate 0 "zz" - let r0 = x0.Value - let a0 = head r0 - let t01 = tail r0 - let b0 = head t01 - - let x1 = (ofSeq ["a";"b"]) |> tryUpdate 1 "zz" - let r1 = x1.Value - let a1 = head r1 - let t11 = tail r1 - let b1 = head t11 - - ((a0 = "zz") && (b0 = "b") - && (a1 = "a") && (b1 = "zz")) |> should equal true - -[] -let ``tryUpdate elements length 3``() = - let x0 = (ofSeq ["a";"b";"c"]) |> tryUpdate 0 "zz" - let r0 = x0.Value - let a0 = head r0 - let t01 = tail r0 - let b0 = head t01 - let t02 = tail t01 - let c0 = head t02 - - let x1 = (ofSeq ["a";"b";"c"]) |> tryUpdate 1 "zz" - let r1 = x1.Value - let a1 = head r1 - let t11 = tail r1 - let b1 = head t11 - let t12 = tail t11 - let c1 = head t12 - - let x2 = (ofSeq ["a";"b";"c"]) |> tryUpdate 2 "zz" - let r2 = x2.Value - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 - - ((a0 = "zz") && (b0 = "b") && (c0 = "c") - && (a1 = "a") && (b1 = "zz") && (c1 = "c") - && (a2 = "a") && (b2 = "b") && (c2 = "zz")) |> should equal true - -[] -let ``tryUpdate elements length 4``() = - let x0 = (ofSeq ["a";"b";"c";"d"]) |> tryUpdate 0 "zz" - let r0 = x0.Value - let a0 = head r0 - let t01 = tail r0 - let b0 = head t01 - let t02 = tail t01 - let c0 = head t02 - let t03 = tail t02 - let d0 = head t03 - - let x1 = (ofSeq ["a";"b";"c";"d"]) |> tryUpdate 1 "zz" - let r1 = x1.Value - let a1 = head r1 - let t11 = tail r1 - let b1 = head t11 - let t12 = tail t11 - let c1 = head t12 - let t13 = tail t12 - let d1 = head t13 - - let x2 = (ofSeq ["a";"b";"c";"d"]) |> tryUpdate 2 "zz" - let r2 = x2.Value - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 - let t23 = tail t22 - let d2 = head t23 - - let x3 = (ofSeq ["a";"b";"c";"d"]) |> tryUpdate 3 "zz" - let r3 = x3.Value - let a3 = head r3 - let t31 = tail r3 - let b3 = head t31 - let t32 = tail t31 - let c3 = head t32 - let t33 = tail t32 - let d3 = head t33 - - ((a0 = "zz") && (b0 = "b") && (c0 = "c") && (d0 = "d") - && (a1 = "a") && (b1 = "zz") && (c1 = "c") && (d1 = "d") - && (a2 = "a") && (b2 = "b") && (c2 = "zz") && (d2 = "d") - && (a3 = "a") && (b3 = "b") && (c3 = "c") && (d3 = "zz")) |> should equal true - -[] -let ``tryUncons on empty``() = - let q = empty 2 - (tryUncons q = None) |> should equal true - -[] -let ``tryUncons on q``() = - let q = ofSeq ["a";"b";"c";"d"] - let x, xs = (tryUncons q).Value - x |> should equal "a" - -[] -let ``tryUnsnoc on empty``() = - let q = empty 2 - (tryUnsnoc q = None) |> should equal true - -[] -let ``tryUnsnoc on q``() = - let q = ofSeq ["a";"b";"c";"d"] - let xs, x = (tryUnsnoc q).Value - x |> should equal "d" - -[] -let ``tryGetHead on empty``() = - let q = empty 2 - (tryGetHead q = None) |> should equal true - -[] -let ``tryGetHead on q``() = - let q = ofSeq ["a";"b";"c";"d"] - (tryGetHead q).Value |> should equal "a" - -[] -let ``tryGetInit on empty``() = - let q = empty 2 - (tryGetInit q = None) |> should equal true - -[] -let ``tryGetInit on q``() = - let q = ofSeq ["a";"b";"c";"d"] -// (tryGetInit q).Value |> last |> should equal "c" - let x = (tryGetInit q).Value - let x2 = x|> last - x2 |> should equal "c" - -[] -let ``tryGetLast on empty``() = - let q = empty 2 - (tryGetLast q = None) |> should equal true - -[] -let ``tryGetLast on q``() = - let q = ofSeq ["a";"b";"c";"d"] - (tryGetLast q).Value |> should equal "d" - - -[] -let ``tryGetTail on empty``() = - let q = empty 2 - (tryGetTail q = None) |> should equal true - -[] -let ``tryGetTail on q``() = - let q = ofSeq ["a";"b";"c";"d"] - (tryGetTail q).Value |> head |> should equal "b" \ No newline at end of file + let x3 = (BankersDeque.ofSeq ["a";"b";"c";"d"]) |> BankersDeque.tryRemove 3 + let r3 = x3.Value + let a3 = BankersDeque.head r3 + let t31 = BankersDeque.tail r3 + let b3 = BankersDeque.head t31 + let t32 = BankersDeque.tail t31 + let c3 = BankersDeque.head t32 + + ((b0 = "b") && (c0 = "c") && (d0 = "d") + && (a1 = "a") && (c1 = "c") && (d1 = "d") + && (a2 = "a") && (b2 = "b") && (c2 = "d") + && (a3 = "a") && (b3 = "b") && (c3 = "c")) |> Expect.isTrue "" } + + test "BankersDeque.tryRemove elements BankersDeque.length 5" { + let x0 = (BankersDeque.ofSeq ["a";"b";"c";"d";"e"]) |> BankersDeque.tryRemove 0 + let r0 = x0.Value + let b0 = BankersDeque.head r0 + let t01 = BankersDeque.tail r0 + let c0 = BankersDeque.head t01 + let t02= BankersDeque.tail t01 + let d0 = BankersDeque.head t02 + let t03 = BankersDeque.tail t02 + let e0 = BankersDeque.head t03 + + let x1 = (BankersDeque.ofSeq ["a";"b";"c";"d";"e"]) |> BankersDeque.tryRemove 1 + let r1 = x1.Value + let a1 = BankersDeque.head r1 + let t11 = BankersDeque.tail r1 + let c1 = BankersDeque.head t11 + let t12 = BankersDeque.tail t11 + let d1 = BankersDeque.head t12 + let t13 = BankersDeque.tail t12 + let e1 = BankersDeque.head t13 + + let x2 = (BankersDeque.ofSeq ["a";"b";"c";"d";"e"]) |> BankersDeque.tryRemove 2 + let r2 = x2.Value + let a2 = BankersDeque.head r2 + let t21 = BankersDeque.tail r2 + let b2 = BankersDeque.head t21 + let t22 = BankersDeque.tail t21 + let c2 = BankersDeque.head t22 + let t23 = BankersDeque.tail t22 + let e2 = BankersDeque.head t23 + + let x3 = (BankersDeque.ofSeq ["a";"b";"c";"d";"e"]) |> BankersDeque.tryRemove 3 + let r3 = x3.Value + let a3 = BankersDeque.head r3 + let t31 = BankersDeque.tail r3 + let b3 = BankersDeque.head t31 + let t32 = BankersDeque.tail t31 + let c3 = BankersDeque.head t32 + let t33 = BankersDeque.tail t32 + let e3 = BankersDeque.head t33 + + let x4 = (BankersDeque.ofSeq ["a";"b";"c";"d";"e"]) |> BankersDeque.tryRemove 4 + let r4 = x4.Value + let a4 = BankersDeque.head r4 + let t41 = BankersDeque.tail r4 + let b4 = BankersDeque.head t41 + let t42 = BankersDeque.tail t41 + let c4 = BankersDeque.head t42 + let t43 = BankersDeque.tail t42 + let d4 = BankersDeque.head t43 + + ((b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") + && (a1 = "a") && (c1 = "c") && (d1 = "d") && (e1 = "e") + && (a2 = "a") && (b2 = "b") && (c2 = "d") && (e2 = "e") + && (a3 = "a") && (b3 = "b") && (c3 = "c") && (e3 = "e") + && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d")) |> Expect.isTrue "" } + + test "BankersDeque.tryRemove elements BankersDeque.length 6" { + let x0 = (BankersDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> BankersDeque.tryRemove 0 + let r0 = x0.Value + let b0 = BankersDeque.head r0 + let t01 = BankersDeque.tail r0 + let c0 = BankersDeque.head t01 + let t02= BankersDeque.tail t01 + let d0 = BankersDeque.head t02 + let t03 = BankersDeque.tail t02 + let e0 = BankersDeque.head t03 + let t04 = BankersDeque.tail t03 + let f0 = BankersDeque.head t04 + + let x1 = (BankersDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> BankersDeque.tryRemove 1 + let r1 =x1.Value + let a1 = BankersDeque.head r1 + let t11 = BankersDeque.tail r1 + let c1 = BankersDeque.head t11 + let t12 = BankersDeque.tail t11 + let d1 = BankersDeque.head t12 + let t13 = BankersDeque.tail t12 + let e1 = BankersDeque.head t13 + let t14 = BankersDeque.tail t13 + let f1 = BankersDeque.head t14 + + let x2 = (BankersDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> BankersDeque.tryRemove 2 + let r2 = x2.Value + let a2 = BankersDeque.head r2 + let t21 = BankersDeque.tail r2 + let b2 = BankersDeque.head t21 + let t22 = BankersDeque.tail t21 + let c2 = BankersDeque.head t22 + let t23 = BankersDeque.tail t22 + let e2 = BankersDeque.head t23 + let t24 = BankersDeque.tail t23 + let f2 = BankersDeque.head t24 + + let x3 = (BankersDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> BankersDeque.tryRemove 3 + let r3 = x3.Value + let a3 = BankersDeque.head r3 + let t31 = BankersDeque.tail r3 + let b3 = BankersDeque.head t31 + let t32 = BankersDeque.tail t31 + let c3 = BankersDeque.head t32 + let t33 = BankersDeque.tail t32 + let e3 = BankersDeque.head t33 + let t34 = BankersDeque.tail t33 + let f3 = BankersDeque.head t34 + + let x4 = (BankersDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> BankersDeque.tryRemove 4 + let r4 = x4.Value + let a4 = BankersDeque.head r4 + let t41 = BankersDeque.tail r4 + let b4 = BankersDeque.head t41 + let t42 = BankersDeque.tail t41 + let c4 = BankersDeque.head t42 + let t43 = BankersDeque.tail t42 + let d4 = BankersDeque.head t43 + let t44 = BankersDeque.tail t43 + let f4 = BankersDeque.head t44 + + let x5 = (BankersDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> BankersDeque.tryRemove 5 + let r5 = x5.Value + let a5 = BankersDeque.head r5 + let t51 = BankersDeque.tail r5 + let b5 = BankersDeque.head t51 + let t52 = BankersDeque.tail t51 + let c5 = BankersDeque.head t52 + let t53 = BankersDeque.tail t52 + let d5 = BankersDeque.head t53 + let t54 = BankersDeque.tail t53 + let e5 = BankersDeque.head t54 + + ((b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") && (f0 = "f") + && (a1 = "a") && (c1 = "c") && (d1 = "d") && (e1 = "e") && (f1 = "f") + && (a2 = "a") && (b2 = "b") && (c2 = "d") && (e2 = "e") && (f2 = "f") + && (a3 = "a") && (b3 = "b") && (c3 = "c") && (e3 = "e") && (f3 = "f") + && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d") && (f4 = "f") + && (a5 = "a") && (b5 = "b") && (c5 = "c") && (d5 = "d") && (e5 = "e")) |> Expect.isTrue "" } + + test "BankersDeque.update elements BankersDeque.length 1" { + len1 |> BankersDeque.update 0 "aa" |> BankersDeque.head |> Expect.equal "" "aa" } + + test "BankersDeque.update elements BankersDeque.length 2" { + let r0 = (BankersDeque.ofSeq ["a";"b"]) |> BankersDeque.update 0 "zz" + let a0 = BankersDeque.head r0 + let t01 = BankersDeque.tail r0 + let b0 = BankersDeque.head t01 + + let r1 = (BankersDeque.ofSeq ["a";"b"]) |> BankersDeque.update 1 "zz" + let a1 = BankersDeque.head r1 + let t11 = BankersDeque.tail r1 + let b1 = BankersDeque.head t11 + + ((a0 = "zz") && (b0 = "b") + && (a1 = "a") && (b1 = "zz")) |> Expect.isTrue "" } + + test "BankersDeque.update elements BankersDeque.length 3" { + let r0 = (BankersDeque.ofSeq ["a";"b";"c"]) |> BankersDeque.update 0 "zz" + let a0 = BankersDeque.head r0 + let t01 = BankersDeque.tail r0 + let b0 = BankersDeque.head t01 + let t02 = BankersDeque.tail t01 + let c0 = BankersDeque.head t02 + + let r1 = (BankersDeque.ofSeq ["a";"b";"c"]) |> BankersDeque.update 1 "zz" + let a1 = BankersDeque.head r1 + let t11 = BankersDeque.tail r1 + let b1 = BankersDeque.head t11 + let t12 = BankersDeque.tail t11 + let c1 = BankersDeque.head t12 + + let r2 = (BankersDeque.ofSeq ["a";"b";"c"]) |> BankersDeque.update 2 "zz" + let a2 = BankersDeque.head r2 + let t21 = BankersDeque.tail r2 + let b2 = BankersDeque.head t21 + let t22 = BankersDeque.tail t21 + let c2 = BankersDeque.head t22 + + ((a0 = "zz") && (b0 = "b") && (c0 = "c") + && (a1 = "a") && (b1 = "zz") && (c1 = "c") + && (a2 = "a") && (b2 = "b") && (c2 = "zz")) |> Expect.isTrue "" } + + test "BankersDeque.update elements BankersDeque.length 4" { + let r0 = (BankersDeque.ofSeq ["a";"b";"c";"d"]) |> BankersDeque.update 0 "zz" + let a0 = BankersDeque.head r0 + let t01 = BankersDeque.tail r0 + let b0 = BankersDeque.head t01 + let t02 = BankersDeque.tail t01 + let c0 = BankersDeque.head t02 + let t03 = BankersDeque.tail t02 + let d0 = BankersDeque.head t03 + + let r1 = (BankersDeque.ofSeq ["a";"b";"c";"d"]) |> BankersDeque.update 1 "zz" + let a1 = BankersDeque.head r1 + let t11 = BankersDeque.tail r1 + let b1 = BankersDeque.head t11 + let t12 = BankersDeque.tail t11 + let c1 = BankersDeque.head t12 + let t13 = BankersDeque.tail t12 + let d1 = BankersDeque.head t13 + + let r2 = (BankersDeque.ofSeq ["a";"b";"c";"d"]) |> BankersDeque.update 2 "zz" + let a2 = BankersDeque.head r2 + let t21 = BankersDeque.tail r2 + let b2 = BankersDeque.head t21 + let t22 = BankersDeque.tail t21 + let c2 = BankersDeque.head t22 + let t23 = BankersDeque.tail t22 + let d2 = BankersDeque.head t23 + + let r3 = (BankersDeque.ofSeq ["a";"b";"c";"d"]) |> BankersDeque.update 3 "zz" + let a3 = BankersDeque.head r3 + let t31 = BankersDeque.tail r3 + let b3 = BankersDeque.head t31 + let t32 = BankersDeque.tail t31 + let c3 = BankersDeque.head t32 + let t33 = BankersDeque.tail t32 + let d3 = BankersDeque.head t33 + + ((a0 = "zz") && (b0 = "b") && (c0 = "c") && (d0 = "d") + && (a1 = "a") && (b1 = "zz") && (c1 = "c") && (d1 = "d") + && (a2 = "a") && (b2 = "b") && (c2 = "zz") && (d2 = "d") + && (a3 = "a") && (b3 = "b") && (c3 = "c") && (d3 = "zz")) |> Expect.isTrue "" } + + test "BankersDeque.update elements BankersDeque.length 5" { + let r0 = (BankersDeque.ofSeq ["a";"b";"c";"d";"e"]) |> BankersDeque.update 0 "zz" + let a0 = BankersDeque.head r0 + let t01 = BankersDeque.tail r0 + let b0 = BankersDeque.head t01 + let t02 = BankersDeque.tail t01 + let c0 = BankersDeque.head t02 + let t03 = BankersDeque.tail t02 + let d0 = BankersDeque.head t03 + let t04 = BankersDeque.tail t03 + let e0 = BankersDeque.head t04 + + let r1 = (BankersDeque.ofSeq ["a";"b";"c";"d";"e"]) |> BankersDeque.update 1 "zz" + let a1 = BankersDeque.head r1 + let t11 = BankersDeque.tail r1 + let b1 = BankersDeque.head t11 + let t12 = BankersDeque.tail t11 + let c1 = BankersDeque.head t12 + let t13 = BankersDeque.tail t12 + let d1 = BankersDeque.head t13 + let t14 = BankersDeque.tail t13 + let e1 = BankersDeque.head t14 + + let r2 = (BankersDeque.ofSeq ["a";"b";"c";"d";"e"]) |> BankersDeque.update 2 "zz" + let a2 = BankersDeque.head r2 + let t21 = BankersDeque.tail r2 + let b2 = BankersDeque.head t21 + let t22 = BankersDeque.tail t21 + let c2 = BankersDeque.head t22 + let t23 = BankersDeque.tail t22 + let d2 = BankersDeque.head t23 + let t24 = BankersDeque.tail t23 + let e2 = BankersDeque.head t24 + + let r3 = (BankersDeque.ofSeq ["a";"b";"c";"d";"e"]) |> BankersDeque.update 3 "zz" + let a3 = BankersDeque.head r3 + let t31 = BankersDeque.tail r3 + let b3 = BankersDeque.head t31 + let t32 = BankersDeque.tail t31 + let c3 = BankersDeque.head t32 + let t33 = BankersDeque.tail t32 + let d3 = BankersDeque.head t33 + let t34 = BankersDeque.tail t33 + let e3 = BankersDeque.head t34 + + let r4 = (BankersDeque.ofSeq ["a";"b";"c";"d";"e"]) |> BankersDeque.update 4 "zz" + let a4 = BankersDeque.head r4 + let t41 = BankersDeque.tail r4 + let b4 = BankersDeque.head t41 + let t42 = BankersDeque.tail t41 + let c4 = BankersDeque.head t42 + let t43 = BankersDeque.tail t42 + let d4 = BankersDeque.head t43 + let t44 = BankersDeque.tail t43 + let e4 = BankersDeque.head t44 + + ((a0 = "zz") && (b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") + && (a1 = "a") && (b1 = "zz") && (c1 = "c") && (d1 = "d") && (e1 = "e") + && (a2 = "a") && (b2 = "b") && (c2 = "zz") && (d2 = "d") && (e2 = "e") + && (a3 = "a") && (b3 = "b") && (c3 = "c") && (d3 = "zz") && (e3 = "e") + && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d") && (e4 = "zz")) |> Expect.isTrue "" } + + test "BankersDeque.update elements BankersDeque.length 6" { + let r0 = (BankersDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> BankersDeque.update 0 "zz" + let a0 = BankersDeque.head r0 + let t01 = BankersDeque.tail r0 + let b0 = BankersDeque.head t01 + let t02 = BankersDeque.tail t01 + let c0 = BankersDeque.head t02 + let t03 = BankersDeque.tail t02 + let d0 = BankersDeque.head t03 + let t04 = BankersDeque.tail t03 + let e0 = BankersDeque.head t04 + let t05 = BankersDeque.tail t04 + let f0 = BankersDeque.head t05 + + let r1 = (BankersDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> BankersDeque.update 1 "zz" + let a1 = BankersDeque.head r1 + let t11 = BankersDeque.tail r1 + let b1 = BankersDeque.head t11 + let t12 = BankersDeque.tail t11 + let c1 = BankersDeque.head t12 + let t13 = BankersDeque.tail t12 + let d1 = BankersDeque.head t13 + let t14 = BankersDeque.tail t13 + let e1 = BankersDeque.head t14 + let t15 = BankersDeque.tail t14 + let f1 = BankersDeque.head t15 + + let r2 = (BankersDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> BankersDeque.update 2 "zz" + let a2 = BankersDeque.head r2 + let t21 = BankersDeque.tail r2 + let b2 = BankersDeque.head t21 + let t22 = BankersDeque.tail t21 + let c2 = BankersDeque.head t22 + let t23 = BankersDeque.tail t22 + let d2 = BankersDeque.head t23 + let t24 = BankersDeque.tail t23 + let e2 = BankersDeque.head t24 + let t25 = BankersDeque.tail t24 + let f2 = BankersDeque.head t25 + + let r3 = (BankersDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> BankersDeque.update 3 "zz" + let a3 = BankersDeque.head r3 + let t31 = BankersDeque.tail r3 + let b3 = BankersDeque.head t31 + let t32 = BankersDeque.tail t31 + let c3 = BankersDeque.head t32 + let t33 = BankersDeque.tail t32 + let d3 = BankersDeque.head t33 + let t34 = BankersDeque.tail t33 + let e3 = BankersDeque.head t34 + let t35 = BankersDeque.tail t34 + let f3 = BankersDeque.head t35 + + let r4 = (BankersDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> BankersDeque.update 4 "zz" + let a4 = BankersDeque.head r4 + let t41 = BankersDeque.tail r4 + let b4 = BankersDeque.head t41 + let t42 = BankersDeque.tail t41 + let c4 = BankersDeque.head t42 + let t43 = BankersDeque.tail t42 + let d4 = BankersDeque.head t43 + let t44 = BankersDeque.tail t43 + let e4 = BankersDeque.head t44 + let t45 = BankersDeque.tail t44 + let f4 = BankersDeque.head t45 + + let r5 = (BankersDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> BankersDeque.update 5 "zz" + let a5 = BankersDeque.head r5 + let t51 = BankersDeque.tail r5 + let b5 = BankersDeque.head t51 + let t52 = BankersDeque.tail t51 + let c5 = BankersDeque.head t52 + let t53 = BankersDeque.tail t52 + let d5 = BankersDeque.head t53 + let t54 = BankersDeque.tail t53 + let e5 = BankersDeque.head t54 + let t55 = BankersDeque.tail t54 + let f5 = BankersDeque.head t55 + + ((a0 = "zz") && (b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") && (f0 = "f") + && (a1 = "a") && (b1 = "zz") && (c1 = "c") && (d1 = "d") && (e1 = "e") && (f1 = "f") + && (a2 = "a") && (b2 = "b") && (c2 = "zz") && (d2 = "d") && (e2 = "e") && (f2 = "f") + && (a3 = "a") && (b3 = "b") && (c3 = "c") && (d3 = "zz") && (e3 = "e") && (f3 = "f") + && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d") && (e4 = "zz") && (f4 = "f") + && (a5 = "a") && (b5 = "b") && (c5 = "c") && (d5 = "d") && (e5 = "e") && (f5 = "zz")) |> Expect.isTrue "" } + + test "BankersDeque.tryUpdate elements BankersDeque.length 1" { + let a = len1 |> BankersDeque.tryUpdate 0 "aa" + a.Value |> BankersDeque.head |> Expect.equal "" "aa" } + + test "BankersDeque.tryUpdate elements BankersDeque.length 2" { + let x0 = (BankersDeque.ofSeq ["a";"b"]) |> BankersDeque.tryUpdate 0 "zz" + let r0 = x0.Value + let a0 = BankersDeque.head r0 + let t01 = BankersDeque.tail r0 + let b0 = BankersDeque.head t01 + + let x1 = (BankersDeque.ofSeq ["a";"b"]) |> BankersDeque.tryUpdate 1 "zz" + let r1 = x1.Value + let a1 = BankersDeque.head r1 + let t11 = BankersDeque.tail r1 + let b1 = BankersDeque.head t11 + + ((a0 = "zz") && (b0 = "b") + && (a1 = "a") && (b1 = "zz")) |> Expect.isTrue "" } + + test "BankersDeque.tryUpdate elements BankersDeque.length 3" { + let x0 = (BankersDeque.ofSeq ["a";"b";"c"]) |> BankersDeque.tryUpdate 0 "zz" + let r0 = x0.Value + let a0 = BankersDeque.head r0 + let t01 = BankersDeque.tail r0 + let b0 = BankersDeque.head t01 + let t02 = BankersDeque.tail t01 + let c0 = BankersDeque.head t02 + + let x1 = (BankersDeque.ofSeq ["a";"b";"c"]) |> BankersDeque.tryUpdate 1 "zz" + let r1 = x1.Value + let a1 = BankersDeque.head r1 + let t11 = BankersDeque.tail r1 + let b1 = BankersDeque.head t11 + let t12 = BankersDeque.tail t11 + let c1 = BankersDeque.head t12 + + let x2 = (BankersDeque.ofSeq ["a";"b";"c"]) |> BankersDeque.tryUpdate 2 "zz" + let r2 = x2.Value + let a2 = BankersDeque.head r2 + let t21 = BankersDeque.tail r2 + let b2 = BankersDeque.head t21 + let t22 = BankersDeque.tail t21 + let c2 = BankersDeque.head t22 + + ((a0 = "zz") && (b0 = "b") && (c0 = "c") + && (a1 = "a") && (b1 = "zz") && (c1 = "c") + && (a2 = "a") && (b2 = "b") && (c2 = "zz")) |> Expect.isTrue "" } + + test "BankersDeque.tryUpdate elements BankersDeque.length 4" { + let x0 = (BankersDeque.ofSeq ["a";"b";"c";"d"]) |> BankersDeque.tryUpdate 0 "zz" + let r0 = x0.Value + let a0 = BankersDeque.head r0 + let t01 = BankersDeque.tail r0 + let b0 = BankersDeque.head t01 + let t02 = BankersDeque.tail t01 + let c0 = BankersDeque.head t02 + let t03 = BankersDeque.tail t02 + let d0 = BankersDeque.head t03 + + let x1 = (BankersDeque.ofSeq ["a";"b";"c";"d"]) |> BankersDeque.tryUpdate 1 "zz" + let r1 = x1.Value + let a1 = BankersDeque.head r1 + let t11 = BankersDeque.tail r1 + let b1 = BankersDeque.head t11 + let t12 = BankersDeque.tail t11 + let c1 = BankersDeque.head t12 + let t13 = BankersDeque.tail t12 + let d1 = BankersDeque.head t13 + + let x2 = (BankersDeque.ofSeq ["a";"b";"c";"d"]) |> BankersDeque.tryUpdate 2 "zz" + let r2 = x2.Value + let a2 = BankersDeque.head r2 + let t21 = BankersDeque.tail r2 + let b2 = BankersDeque.head t21 + let t22 = BankersDeque.tail t21 + let c2 = BankersDeque.head t22 + let t23 = BankersDeque.tail t22 + let d2 = BankersDeque.head t23 + + let x3 = (BankersDeque.ofSeq ["a";"b";"c";"d"]) |> BankersDeque.tryUpdate 3 "zz" + let r3 = x3.Value + let a3 = BankersDeque.head r3 + let t31 = BankersDeque.tail r3 + let b3 = BankersDeque.head t31 + let t32 = BankersDeque.tail t31 + let c3 = BankersDeque.head t32 + let t33 = BankersDeque.tail t32 + let d3 = BankersDeque.head t33 + + ((a0 = "zz") && (b0 = "b") && (c0 = "c") && (d0 = "d") + && (a1 = "a") && (b1 = "zz") && (c1 = "c") && (d1 = "d") + && (a2 = "a") && (b2 = "b") && (c2 = "zz") && (d2 = "d") + && (a3 = "a") && (b3 = "b") && (c3 = "c") && (d3 = "zz")) |> Expect.isTrue "" } + + test "BankersDeque.tryUncons on BankersDeque.empty" { + let q = BankersDeque.empty 2 + (BankersDeque.tryUncons q = None) |> Expect.isTrue "" } + + test "BankersDeque.tryUncons on q" { + let q = BankersDeque.ofSeq ["a";"b";"c";"d"] + let x, xs = (BankersDeque.tryUncons q).Value + x |> Expect.equal "" "a" } + + test "BankersDeque.tryUnsnoc on BankersDeque.empty" { + let q = BankersDeque.empty 2 + (BankersDeque.tryUnsnoc q = None) |> Expect.isTrue "" } + + test "BankersDeque.tryUnsnoc on q" { + let q = BankersDeque.ofSeq ["a";"b";"c";"d"] + let xs, x = (BankersDeque.tryUnsnoc q).Value + x |> Expect.equal "" "d" } + + test "BankersDeque.tryGetHead on BankersDeque.empty" { + let q = BankersDeque.empty 2 + (BankersDeque.tryGetHead q = None) |> Expect.isTrue "" } + + test "BankersDeque.tryGetHead on q" { + let q = BankersDeque.ofSeq ["a";"b";"c";"d"] + (BankersDeque.tryGetHead q).Value |> Expect.equal "" "a" } + + test "BankersDeque.tryGetInit on BankersDeque.empty" { + let q = BankersDeque.empty 2 + (BankersDeque.tryGetInit q = None) |> Expect.isTrue "" } + + test "BankersDeque.tryGetInit on q" { + let q = BankersDeque.ofSeq ["a";"b";"c";"d"] + let x = (BankersDeque.tryGetInit q).Value + let x2 = x|> BankersDeque.last + x2 |> Expect.equal "" "c"} + + test "BankersDeque.tryGetLast on BankersDeque.empty" { + let q = BankersDeque.empty 2 + (BankersDeque.tryGetLast q = None) |> Expect.isTrue "" } + + test "BankersDeque.tryGetLast on q" { + let q = BankersDeque.ofSeq ["a";"b";"c";"d"] + (BankersDeque.tryGetLast q).Value |> Expect.equal "" "d" } + + + test "BankersDeque.tryGetTail on BankersDeque.empty" { + let q = BankersDeque.empty 2 + (BankersDeque.tryGetTail q = None) |> Expect.isTrue "" } + + test "BankersDeque.tryGetTail on q" { + let q = BankersDeque.ofSeq ["a";"b";"c";"d"] + (BankersDeque.tryGetTail q).Value |> BankersDeque.head |> Expect.equal "" "b" } + ] \ No newline at end of file diff --git a/tests/FSharpx.Collections.Experimental.Tests/BatchedDequeTest.fs b/tests/FSharpx.Collections.Experimental.Tests/BatchedDequeTest.fs index 74fae192..cc75d699 100644 --- a/tests/FSharpx.Collections.Experimental.Tests/BatchedDequeTest.fs +++ b/tests/FSharpx.Collections.Experimental.Tests/BatchedDequeTest.fs @@ -1,1512 +1,1420 @@ -module FSharpx.Collections.Experimental.Tests.BatchDeque +namespace FSharpx.Collections.Experimental.Tests open System open FSharpx.Collections open FSharpx.Collections.Experimental -open FSharpx.Collections.Experimental.BatchedDeque -open NUnit.Framework -open FsUnit - +open Expecto +open Expecto.Flip //quite a lot going on and difficult to reason about edge cases -//testing up to length of 6 is the likely minimum to satisfy any arbitrary test case (less for some cases) - -let len1 = singleton "a" -let len2 = singleton "a" |> cons "b" -let len3 = singleton "a" |> cons "b" |> cons "c" -let len4 = singleton "a" |> cons "b" |> cons "c" |> cons "d" -let len5 = singleton "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" -let len6 = singleton "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" -let len7 = singleton "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" -let len8 = singleton "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" -let len9 = singleton "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" |> cons "i" -let lena = singleton "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" |> cons "i" |> cons "j" - -let len2snoc = singleton "b" |> snoc "a" -let len3snoc = singleton "c" |> snoc "b" |> snoc "a" -let len4snoc = singleton "d" |> snoc "c" |> snoc "b" |> snoc "a" -let len5snoc = singleton "e" |> snoc "d" |> snoc "c" |> snoc "b" |> snoc "a" -let len6snoc = singleton "f" |> snoc "e" |> snoc "d" |> snoc "c" |> snoc "b" |> snoc "a" -let len7snoc = singleton "g" |> snoc "f" |> snoc "e" |> snoc "d" |> snoc "c" |> snoc "b" |> snoc "a" -let len8snoc = singleton "h" |> snoc "g" |> snoc "f" |> snoc "e" |> snoc "d" |> snoc "c" |> snoc "b" |> snoc "a" -let len9snoc = singleton "i" |> snoc "h" |> snoc "g" |> snoc "f" |> snoc "e" |> snoc "d" |> snoc "c" |> snoc "b" |> snoc "a" -let lenasnoc = singleton "j" |> snoc "i" |> snoc "h" |> snoc "g" |> snoc "f" |> snoc "e" |> snoc "d" |> snoc "c" |> snoc "b" |> snoc "a" - -[] -let ``empty dqueue should be empty``() = - empty() |> isEmpty |> should equal true - -[] -let ``cons works``() = - len2 |> isEmpty |> should equal false - -[] -let ``snoc works``() = - len2snoc |> isEmpty |> should equal false - -[] -let ``singleton head works``() = - len1 |> head |> should equal "a" - -[] -let ``singleton last works``() = - len1 |> last |> should equal "a" - -[] -let ``tail of singleton empty``() = - len1 |> tail |> isEmpty |> should equal true +//testing up to BatchedDeque.length of 6 is the likely minimum to satisfy any arbitrary test case (less for some cases) + +module BatchDequeTest = + + let len1 = BatchedDeque.singleton "a" + let len2 = BatchedDeque.singleton "a" |> BatchedDeque.cons "b" + let len3 = BatchedDeque.singleton "a" |> BatchedDeque.cons "b" |> BatchedDeque.cons "c" + let len4 = BatchedDeque.singleton "a" |> BatchedDeque.cons "b" |> BatchedDeque.cons "c" |> BatchedDeque.cons "d" + let len5 = BatchedDeque.singleton "a" |> BatchedDeque.cons "b" |> BatchedDeque.cons "c" |> BatchedDeque.cons "d" |> BatchedDeque.cons "e" + let len6 = BatchedDeque.singleton "a" |> BatchedDeque.cons "b" |> BatchedDeque.cons "c" |> BatchedDeque.cons "d" |> BatchedDeque.cons "e" |> BatchedDeque.cons "f" + let len7 = BatchedDeque.singleton "a" |> BatchedDeque.cons "b" |> BatchedDeque.cons "c" |> BatchedDeque.cons "d" |> BatchedDeque.cons "e" |> BatchedDeque.cons "f" |> BatchedDeque.cons "g" + let len8 = BatchedDeque.singleton "a" |> BatchedDeque.cons "b" |> BatchedDeque.cons "c" |> BatchedDeque.cons "d" |> BatchedDeque.cons "e" |> BatchedDeque.cons "f" |> BatchedDeque.cons "g" |> BatchedDeque.cons "h" + let len9 = BatchedDeque.singleton "a" |> BatchedDeque.cons "b" |> BatchedDeque.cons "c" |> BatchedDeque.cons "d" |> BatchedDeque.cons "e" |> BatchedDeque.cons "f" |> BatchedDeque.cons "g" |> BatchedDeque.cons "h" |> BatchedDeque.cons "i" + let lena = BatchedDeque.singleton "a" |> BatchedDeque.cons "b" |> BatchedDeque.cons "c" |> BatchedDeque.cons "d" |> BatchedDeque.cons "e" |> BatchedDeque.cons "f" |> BatchedDeque.cons "g" |> BatchedDeque.cons "h" |> BatchedDeque.cons "i" |> BatchedDeque.cons "j" + + let len2snoc = BatchedDeque.singleton "b" |> BatchedDeque.snoc "a" + let len3snoc = BatchedDeque.singleton "c" |> BatchedDeque.snoc "b" |> BatchedDeque.snoc "a" + let len4snoc = BatchedDeque.singleton "d" |> BatchedDeque.snoc "c" |> BatchedDeque.snoc "b" |> BatchedDeque.snoc "a" + let len5snoc = BatchedDeque.singleton "e" |> BatchedDeque.snoc "d" |> BatchedDeque.snoc "c" |> BatchedDeque.snoc "b" |> BatchedDeque.snoc "a" + let len6snoc = BatchedDeque.singleton "f" |> BatchedDeque.snoc "e" |> BatchedDeque.snoc "d" |> BatchedDeque.snoc "c" |> BatchedDeque.snoc "b" |> BatchedDeque.snoc "a" + let len7snoc = BatchedDeque.singleton "g" |> BatchedDeque.snoc "f" |> BatchedDeque.snoc "e" |> BatchedDeque.snoc "d" |> BatchedDeque.snoc "c" |> BatchedDeque.snoc "b" |> BatchedDeque.snoc "a" + let len8snoc = BatchedDeque.singleton "h" |> BatchedDeque.snoc "g" |> BatchedDeque.snoc "f" |> BatchedDeque.snoc "e" |> BatchedDeque.snoc "d" |> BatchedDeque.snoc "c" |> BatchedDeque.snoc "b" |> BatchedDeque.snoc "a" + let len9snoc = BatchedDeque.singleton "i" |> BatchedDeque.snoc "h" |> BatchedDeque.snoc "g" |> BatchedDeque.snoc "f" |> BatchedDeque.snoc "e" |> BatchedDeque.snoc "d" |> BatchedDeque.snoc "c" |> BatchedDeque.snoc "b" |> BatchedDeque.snoc "a" + let lenasnoc = BatchedDeque.singleton "j" |> BatchedDeque.snoc "i" |> BatchedDeque.snoc "h" |> BatchedDeque.snoc "g" |> BatchedDeque.snoc "f" |> BatchedDeque.snoc "e" |> BatchedDeque.snoc "d" |> BatchedDeque.snoc "c" |> BatchedDeque.snoc "b" |> BatchedDeque.snoc "a" + + [] + let testBatchDeque = + + testList "Experimental BatchDeque" [ + + test "empty dqueue should be empty" { + BatchedDeque.empty() |> BatchedDeque.isEmpty |> Expect.isTrue "" } + + test "BatchedDeque.cons works" { + len2 |> BatchedDeque.isEmpty |> Expect.isFalse "" } + + test "BatchedDeque.snoc works" { + len2snoc |> BatchedDeque.isEmpty |> Expect.isFalse "" } + + test "BatchedDeque.singleton BatchedDeque.head works" { + len1 |> BatchedDeque.head |> Expect.equal "" "a" } + + test "BatchedDeque.singleton BatchedDeque.last works" { + len1 |> BatchedDeque.last |> Expect.equal "" "a" } + + test "BatchedDeque.tail of BatchedDeque.singleton empty" { + len1 |> BatchedDeque.tail |> BatchedDeque.isEmpty |> Expect.isTrue "" } + + test "BatchedDeque.tail of BatchedDeque.tail of 2 empty" { + ( len2 |> BatchedDeque.tail |> BatchedDeque.tail |> BatchedDeque.isEmpty) |> Expect.isTrue "" } + + test "BatchedDeque.init of BatchedDeque.singleton empty" { + len1 |> BatchedDeque.init |> BatchedDeque.isEmpty |> Expect.isTrue "" } + + test "BatchedDeque.head, BatchedDeque.tail, and BatchedDeque.length work test 1" { + let t1 = BatchedDeque.tail len2 + let t1s = BatchedDeque.tail len2snoc + (((BatchedDeque.length t1) = 1) && ((BatchedDeque.length t1s) = 1) && ((BatchedDeque.head t1) = "a") && ((BatchedDeque.head t1s) = "a")) |> Expect.isTrue "" } + + test "BatchedDeque.head, BatchedDeque.tail, and BatchedDeque.length work test 2" { + let t1 = BatchedDeque.tail len3 + let t1s = BatchedDeque.tail len3snoc -[] -let ``tail of tail of 2 empty``() = - ( len2 |> tail |> tail |> isEmpty) |> should equal true - -[] -let ``init of singleton empty``() = - len1 |> init |> isEmpty |> should equal true - -[] -let ``head, tail, and length work test 1``() = - let t1 = tail len2 - let t1s = tail len2snoc - (((length t1) = 1) && ((length t1s) = 1) && ((head t1) = "a") && ((head t1s) = "a")) |> should equal true - -[] -let ``head, tail, and length work test 2``() = - let t1 = tail len3 - let t1s = tail len3snoc - - let t1_1 = tail t1 - let t1_1s = tail t1s - - (((length t1) = 2) && ((length t1s) = 2) && ((head t1) = "b") && ((head t1s) = "b") && ((length t1_1) = 1) && ((length t1_1s) = 1) - && ((head t1_1) = "a") && ((head t1_1s) = "a")) |> should equal true - -[] -let ``head, tail, and length work test 3``() = - let t1 = tail len4 - let t1s = tail len4snoc - - let t1_2 = tail t1 - let t1_2s = tail t1s - - let t1_1 = tail t1_2 - let t1_1s = tail t1_2s - - (((length t1) = 3) && ((length t1s) = 3) && ((head t1) = "c")&& ((head t1s) = "c") && ((length t1_2) = 2) && ((length t1_2s) = 2) - && ((head t1_2) = "b") && ((head t1_2s) = "b") && ((length t1_1) = 1) && ((length t1_1s) = 1) && ((head t1_1) = "a") - && ((head t1_1s) = "a")) |> should equal true - -[] -let ``head, tail, and length work test 4``() = - let t1 = tail len5 - let t1s = tail len5snoc - - let t1_3 = tail t1 - let t1_3s = tail t1s - - let t1_2 = tail t1_3 - let t1_2s = tail t1_3s - - let t1_1 = tail t1_2 - let t1_1s = tail t1_2s - - (((length t1) = 4) && ((length t1s) = 4) && ((head t1) = "d") && ((head t1s) = "d") && ((length t1_3) = 3) && ((length t1_3s) = 3) - && ((head t1_3) = "c") && ((head t1_3s) = "c") && ((length t1_2) = 2) && ((length t1_2s) = 2) && ((head t1_2) = "b") && ((head t1_2s) = "b") - && ((length t1_1) = 1) && ((length t1_1s) = 1) && ((head t1_1) = "a") && ((head t1_1s) = "a")) |> should equal true - -[] -let ``head, tail, and length work test 5``() = - let t1 = tail len6 - let t1s = tail len6snoc - - let t1_4 = tail t1 - let t1_4s = tail t1s - - let t1_3 = tail t1_4 - let t1_3s = tail t1_4s - - let t1_2 = tail t1_3 - let t1_2s = tail t1_3s - - let t1_1 = tail t1_2 - let t1_1s = tail t1_2s - - (((length t1) = 5) && ((length t1s) = 5) && ((head t1) = "e") && ((head t1s) = "e") && ((length t1_4) = 4) && ((length t1_4s) = 4) - && ((head t1_4) = "d") && ((head t1_4s) = "d") && ((length t1_3) = 3) && ((length t1_3s) = 3) && ((head t1_3) = "c") && ((head t1_3s) = "c") - && ((length t1_2) = 2) && ((length t1_2s) = 2) && ((head t1_2) = "b") && ((head t1_2s) = "b") && ((length t1_1) = 1) && ((length t1_1s) = 1) - && ((head t1_1) = "a") && ((head t1_1s) = "a")) |> should equal true - -[] -let ``head, tail, and length work test 6``() = - let t1 = tail len7 - let t1s = tail len7snoc - - let t1_5 = tail t1 - let t1_5s = tail t1s - - let t1_4 = tail t1_5 - let t1_4s = tail t1_5s - - let t1_3 = tail t1_4 - let t1_3s = tail t1_4s - - let t1_2 = tail t1_3 - let t1_2s = tail t1_3s - - let t1_1 = tail t1_2 - let t1_1s = tail t1_2s - - (((length t1) = 6) && ((length t1s) = 6) - && ((head t1) = "f") && ((head t1s) = "f") - && ((length t1_5) = 5) && ((length t1_5s) = 5) - && ((head t1_5) = "e") && ((head t1_5s) = "e") - && ((length t1_4) = 4) && ((length t1_4s) = 4) - && ((head t1_4) = "d") && ((head t1_4s) = "d") - && ((length t1_3) = 3) && ((length t1_3s) = 3) - && ((head t1_3) = "c") && ((head t1_3s) = "c") - && ((length t1_2) = 2) && ((length t1_2s) = 2) - && ((head t1_2) = "b") && ((head t1_2s) = "b") - && ((length t1_1) = 1) && ((length t1_1s) = 1) - && ((head t1_1) = "a") && ((head t1_1s) = "a") ) |> should equal true - -[] -let ``head, tail, and length work test 7``() = - let t1 = tail len8 - let t1s = tail len8snoc - let t1_6 = tail t1 - let t1_6s = tail t1s - let t1_5 = tail t1_6 - let t1_5s = tail t1_6s - let t1_4 = tail t1_5 - let t1_4s = tail t1_5s - let t1_3 = tail t1_4 - let t1_3s = tail t1_4s - let t1_2 = tail t1_3 - let t1_2s = tail t1_3s - let t1_1 = tail t1_2 - let t1_1s = tail t1_2s - - (((length t1) = 7) && ((length t1s) = 7) - && ((head t1) = "g") && ((head t1s) = "g") - && ((length t1_6) = 6) && ((length t1_6s) = 6) - && ((head t1_6) = "f") && ((head t1_6s) = "f") - && ((length t1_5) = 5) && ((length t1_5s) = 5) - && ((head t1_5) = "e") && ((head t1_5s) = "e") - && ((length t1_4) = 4) && ((length t1_4s) = 4) - && ((head t1_4) = "d") && ((head t1_4s) = "d") - && ((length t1_3) = 3) && ((length t1_3s) = 3) - && ((head t1_3) = "c") && ((head t1_3s) = "c") - && ((length t1_2) = 2) && ((length t1_2s) = 2) - && ((head t1_2) = "b") && ((head t1_2s) = "b") - && ((length t1_1) = 1) && ((length t1_1s) = 1) - && ((head t1_1) = "a") && ((head t1_1s) = "a") ) |> should equal true - -[] -let ``head, tail, and length work test 8``() = - let t1 = tail len9 - let t1s = tail len9snoc - let t1_7 = tail t1 - let t1_7s = tail t1s - let t1_6 = tail t1_7 - let t1_6s = tail t1_7s - let t1_5 = tail t1_6 - let t1_5s = tail t1_6s - let t1_4 = tail t1_5 - let t1_4s = tail t1_5s - let t1_3 = tail t1_4 - let t1_3s = tail t1_4s - let t1_2 = tail t1_3 - let t1_2s = tail t1_3s - let t1_1 = tail t1_2 - let t1_1s = tail t1_2s - - (((length t1) = 8) && ((length t1s) = 8) - && ((head t1) = "h") && ((head t1s) = "h") - && ((length t1_7) = 7) && ((length t1_7s) = 7) - && ((head t1_7) = "g") && ((head t1_7s) = "g") - && ((length t1_6) = 6) && ((length t1_6s) = 6) - && ((head t1_6) = "f") && ((head t1_6s) = "f") - && ((length t1_5) = 5) && ((length t1_5s) = 5) - && ((head t1_5) = "e") && ((head t1_5s) = "e") - && ((length t1_4) = 4) && ((length t1_4s) = 4) - && ((head t1_4) = "d") && ((head t1_4s) = "d") - && ((length t1_3) = 3) && ((length t1_3s) = 3) - && ((head t1_3) = "c") && ((head t1_3s) = "c") - && ((length t1_2) = 2) && ((length t1_2s) = 2) - && ((head t1_2) = "b") && ((head t1_2s) = "b") - && ((length t1_1) = 1) && ((length t1_1s) = 1) - && ((head t1_1) = "a") && ((head t1_1s) = "a") ) |> should equal true - -[] -let ``head, tail, and length work test 9``() = - let t1 = tail lena - let t1s = tail lenasnoc - let t1_8 = tail t1 - let t1_8s = tail t1s - let t1_7 = tail t1_8 - let t1_7s = tail t1_8s - let t1_6 = tail t1_7 - let t1_6s = tail t1_7s - let t1_5 = tail t1_6 - let t1_5s = tail t1_6s - let t1_4 = tail t1_5 - let t1_4s = tail t1_5s - let t1_3 = tail t1_4 - let t1_3s = tail t1_4s - let t1_2 = tail t1_3 - let t1_2s = tail t1_3s - let t1_1 = tail t1_2 - let t1_1s = tail t1_2s + let t1_1 = BatchedDeque.tail t1 + let t1_1s = BatchedDeque.tail t1s + + (((BatchedDeque.length t1) = 2) && ((BatchedDeque.length t1s) = 2) && ((BatchedDeque.head t1) = "b") && ((BatchedDeque.head t1s) = "b") && ((BatchedDeque.length t1_1) = 1) && ((BatchedDeque.length t1_1s) = 1) + && ((BatchedDeque.head t1_1) = "a") && ((BatchedDeque.head t1_1s) = "a")) |> Expect.isTrue "" } + + test "BatchedDeque.head, BatchedDeque.tail, and BatchedDeque.length work test 3" { + let t1 = BatchedDeque.tail len4 + let t1s = BatchedDeque.tail len4snoc + + let t1_2 = BatchedDeque.tail t1 + let t1_2s = BatchedDeque.tail t1s + + let t1_1 = BatchedDeque.tail t1_2 + let t1_1s = BatchedDeque.tail t1_2s + + (((BatchedDeque.length t1) = 3) && ((BatchedDeque.length t1s) = 3) && ((BatchedDeque.head t1) = "c")&& ((BatchedDeque.head t1s) = "c") && ((BatchedDeque.length t1_2) = 2) && ((BatchedDeque.length t1_2s) = 2) + && ((BatchedDeque.head t1_2) = "b") && ((BatchedDeque.head t1_2s) = "b") && ((BatchedDeque.length t1_1) = 1) && ((BatchedDeque.length t1_1s) = 1) && ((BatchedDeque.head t1_1) = "a") + && ((BatchedDeque.head t1_1s) = "a")) |> Expect.isTrue "" } + + test "BatchedDeque.head, BatchedDeque.tail, and BatchedDeque.length work test 4" { + let t1 = BatchedDeque.tail len5 + let t1s = BatchedDeque.tail len5snoc + + let t1_3 = BatchedDeque.tail t1 + let t1_3s = BatchedDeque.tail t1s + + let t1_2 = BatchedDeque.tail t1_3 + let t1_2s = BatchedDeque.tail t1_3s + + let t1_1 = BatchedDeque.tail t1_2 + let t1_1s = BatchedDeque.tail t1_2s + + (((BatchedDeque.length t1) = 4) && ((BatchedDeque.length t1s) = 4) && ((BatchedDeque.head t1) = "d") && ((BatchedDeque.head t1s) = "d") && ((BatchedDeque.length t1_3) = 3) && ((BatchedDeque.length t1_3s) = 3) + && ((BatchedDeque.head t1_3) = "c") && ((BatchedDeque.head t1_3s) = "c") && ((BatchedDeque.length t1_2) = 2) && ((BatchedDeque.length t1_2s) = 2) && ((BatchedDeque.head t1_2) = "b") && ((BatchedDeque.head t1_2s) = "b") + && ((BatchedDeque.length t1_1) = 1) && ((BatchedDeque.length t1_1s) = 1) && ((BatchedDeque.head t1_1) = "a") && ((BatchedDeque.head t1_1s) = "a")) |> Expect.isTrue "" } + + test "BatchedDeque.head, BatchedDeque.tail, and BatchedDeque.length work test 5" { + let t1 = BatchedDeque.tail len6 + let t1s = BatchedDeque.tail len6snoc + + let t1_4 = BatchedDeque.tail t1 + let t1_4s = BatchedDeque.tail t1s + + let t1_3 = BatchedDeque.tail t1_4 + let t1_3s = BatchedDeque.tail t1_4s + + let t1_2 = BatchedDeque.tail t1_3 + let t1_2s = BatchedDeque.tail t1_3s + + let t1_1 = BatchedDeque.tail t1_2 + let t1_1s = BatchedDeque.tail t1_2s + + (((BatchedDeque.length t1) = 5) && ((BatchedDeque.length t1s) = 5) && ((BatchedDeque.head t1) = "e") && ((BatchedDeque.head t1s) = "e") && ((BatchedDeque.length t1_4) = 4) && ((BatchedDeque.length t1_4s) = 4) + && ((BatchedDeque.head t1_4) = "d") && ((BatchedDeque.head t1_4s) = "d") && ((BatchedDeque.length t1_3) = 3) && ((BatchedDeque.length t1_3s) = 3) && ((BatchedDeque.head t1_3) = "c") && ((BatchedDeque.head t1_3s) = "c") + && ((BatchedDeque.length t1_2) = 2) && ((BatchedDeque.length t1_2s) = 2) && ((BatchedDeque.head t1_2) = "b") && ((BatchedDeque.head t1_2s) = "b") && ((BatchedDeque.length t1_1) = 1) && ((BatchedDeque.length t1_1s) = 1) + && ((BatchedDeque.head t1_1) = "a") && ((BatchedDeque.head t1_1s) = "a")) |> Expect.isTrue "" } + + test "BatchedDeque.head, BatchedDeque.tail, and BatchedDeque.length work test 6" { + let t1 = BatchedDeque.tail len7 + let t1s = BatchedDeque.tail len7snoc + + let t1_5 = BatchedDeque.tail t1 + let t1_5s = BatchedDeque.tail t1s + + let t1_4 = BatchedDeque.tail t1_5 + let t1_4s = BatchedDeque.tail t1_5s + + let t1_3 = BatchedDeque.tail t1_4 + let t1_3s = BatchedDeque.tail t1_4s + + let t1_2 = BatchedDeque.tail t1_3 + let t1_2s = BatchedDeque.tail t1_3s + + let t1_1 = BatchedDeque.tail t1_2 + let t1_1s = BatchedDeque.tail t1_2s + + (((BatchedDeque.length t1) = 6) && ((BatchedDeque.length t1s) = 6) + && ((BatchedDeque.head t1) = "f") && ((BatchedDeque.head t1s) = "f") + && ((BatchedDeque.length t1_5) = 5) && ((BatchedDeque.length t1_5s) = 5) + && ((BatchedDeque.head t1_5) = "e") && ((BatchedDeque.head t1_5s) = "e") + && ((BatchedDeque.length t1_4) = 4) && ((BatchedDeque.length t1_4s) = 4) + && ((BatchedDeque.head t1_4) = "d") && ((BatchedDeque.head t1_4s) = "d") + && ((BatchedDeque.length t1_3) = 3) && ((BatchedDeque.length t1_3s) = 3) + && ((BatchedDeque.head t1_3) = "c") && ((BatchedDeque.head t1_3s) = "c") + && ((BatchedDeque.length t1_2) = 2) && ((BatchedDeque.length t1_2s) = 2) + && ((BatchedDeque.head t1_2) = "b") && ((BatchedDeque.head t1_2s) = "b") + && ((BatchedDeque.length t1_1) = 1) && ((BatchedDeque.length t1_1s) = 1) + && ((BatchedDeque.head t1_1) = "a") && ((BatchedDeque.head t1_1s) = "a") ) |> Expect.isTrue "" } + + test "BatchedDeque.head, BatchedDeque.tail, and BatchedDeque.length work test 7" { + let t1 = BatchedDeque.tail len8 + let t1s = BatchedDeque.tail len8snoc + let t1_6 = BatchedDeque.tail t1 + let t1_6s = BatchedDeque.tail t1s + let t1_5 = BatchedDeque.tail t1_6 + let t1_5s = BatchedDeque.tail t1_6s + let t1_4 = BatchedDeque.tail t1_5 + let t1_4s = BatchedDeque.tail t1_5s + let t1_3 = BatchedDeque.tail t1_4 + let t1_3s = BatchedDeque.tail t1_4s + let t1_2 = BatchedDeque.tail t1_3 + let t1_2s = BatchedDeque.tail t1_3s + let t1_1 = BatchedDeque.tail t1_2 + let t1_1s = BatchedDeque.tail t1_2s + + (((BatchedDeque.length t1) = 7) && ((BatchedDeque.length t1s) = 7) + && ((BatchedDeque.head t1) = "g") && ((BatchedDeque.head t1s) = "g") + && ((BatchedDeque.length t1_6) = 6) && ((BatchedDeque.length t1_6s) = 6) + && ((BatchedDeque.head t1_6) = "f") && ((BatchedDeque.head t1_6s) = "f") + && ((BatchedDeque.length t1_5) = 5) && ((BatchedDeque.length t1_5s) = 5) + && ((BatchedDeque.head t1_5) = "e") && ((BatchedDeque.head t1_5s) = "e") + && ((BatchedDeque.length t1_4) = 4) && ((BatchedDeque.length t1_4s) = 4) + && ((BatchedDeque.head t1_4) = "d") && ((BatchedDeque.head t1_4s) = "d") + && ((BatchedDeque.length t1_3) = 3) && ((BatchedDeque.length t1_3s) = 3) + && ((BatchedDeque.head t1_3) = "c") && ((BatchedDeque.head t1_3s) = "c") + && ((BatchedDeque.length t1_2) = 2) && ((BatchedDeque.length t1_2s) = 2) + && ((BatchedDeque.head t1_2) = "b") && ((BatchedDeque.head t1_2s) = "b") + && ((BatchedDeque.length t1_1) = 1) && ((BatchedDeque.length t1_1s) = 1) + && ((BatchedDeque.head t1_1) = "a") && ((BatchedDeque.head t1_1s) = "a") ) |> Expect.isTrue "" } + + test "BatchedDeque.head, BatchedDeque.tail, and BatchedDeque.length work test 8" { + let t1 = BatchedDeque.tail len9 + let t1s = BatchedDeque.tail len9snoc + let t1_7 = BatchedDeque.tail t1 + let t1_7s = BatchedDeque.tail t1s + let t1_6 = BatchedDeque.tail t1_7 + let t1_6s = BatchedDeque.tail t1_7s + let t1_5 = BatchedDeque.tail t1_6 + let t1_5s = BatchedDeque.tail t1_6s + let t1_4 = BatchedDeque.tail t1_5 + let t1_4s = BatchedDeque.tail t1_5s + let t1_3 = BatchedDeque.tail t1_4 + let t1_3s = BatchedDeque.tail t1_4s + let t1_2 = BatchedDeque.tail t1_3 + let t1_2s = BatchedDeque.tail t1_3s + let t1_1 = BatchedDeque.tail t1_2 + let t1_1s = BatchedDeque.tail t1_2s + + (((BatchedDeque.length t1) = 8) && ((BatchedDeque.length t1s) = 8) + && ((BatchedDeque.head t1) = "h") && ((BatchedDeque.head t1s) = "h") + && ((BatchedDeque.length t1_7) = 7) && ((BatchedDeque.length t1_7s) = 7) + && ((BatchedDeque.head t1_7) = "g") && ((BatchedDeque.head t1_7s) = "g") + && ((BatchedDeque.length t1_6) = 6) && ((BatchedDeque.length t1_6s) = 6) + && ((BatchedDeque.head t1_6) = "f") && ((BatchedDeque.head t1_6s) = "f") + && ((BatchedDeque.length t1_5) = 5) && ((BatchedDeque.length t1_5s) = 5) + && ((BatchedDeque.head t1_5) = "e") && ((BatchedDeque.head t1_5s) = "e") + && ((BatchedDeque.length t1_4) = 4) && ((BatchedDeque.length t1_4s) = 4) + && ((BatchedDeque.head t1_4) = "d") && ((BatchedDeque.head t1_4s) = "d") + && ((BatchedDeque.length t1_3) = 3) && ((BatchedDeque.length t1_3s) = 3) + && ((BatchedDeque.head t1_3) = "c") && ((BatchedDeque.head t1_3s) = "c") + && ((BatchedDeque.length t1_2) = 2) && ((BatchedDeque.length t1_2s) = 2) + && ((BatchedDeque.head t1_2) = "b") && ((BatchedDeque.head t1_2s) = "b") + && ((BatchedDeque.length t1_1) = 1) && ((BatchedDeque.length t1_1s) = 1) + && ((BatchedDeque.head t1_1) = "a") && ((BatchedDeque.head t1_1s) = "a") ) |> Expect.isTrue "" } + + test "BatchedDeque.head, BatchedDeque.tail, and BatchedDeque.length work test 9" { + let t1 = BatchedDeque.tail lena + let t1s = BatchedDeque.tail lenasnoc + let t1_8 = BatchedDeque.tail t1 + let t1_8s = BatchedDeque.tail t1s + let t1_7 = BatchedDeque.tail t1_8 + let t1_7s = BatchedDeque.tail t1_8s + let t1_6 = BatchedDeque.tail t1_7 + let t1_6s = BatchedDeque.tail t1_7s + let t1_5 = BatchedDeque.tail t1_6 + let t1_5s = BatchedDeque.tail t1_6s + let t1_4 = BatchedDeque.tail t1_5 + let t1_4s = BatchedDeque.tail t1_5s + let t1_3 = BatchedDeque.tail t1_4 + let t1_3s = BatchedDeque.tail t1_4s + let t1_2 = BatchedDeque.tail t1_3 + let t1_2s = BatchedDeque.tail t1_3s + let t1_1 = BatchedDeque.tail t1_2 + let t1_1s = BatchedDeque.tail t1_2s - (((length t1) = 9) && ((length t1s) = 9) && ((head t1) = "i") && ((head t1s) = "i") - && ((length t1_8) = 8) && ((length t1_8s) = 8) && ((head t1_8) = "h") && ((head t1_8s) = "h") - && ((length t1_7) = 7) && ((length t1_7s) = 7) && ((head t1_7) = "g") && ((head t1_7s) = "g") - && ((length t1_6) = 6) && ((length t1_6s) = 6) && ((head t1_6) = "f") && ((head t1_6s) = "f") - && ((length t1_5) = 5) && ((length t1_5s) = 5) && ((head t1_5) = "e") && ((head t1_5s) = "e") - && ((length t1_4) = 4) && ((length t1_4s) = 4) && ((head t1_4) = "d") && ((head t1_4s) = "d") - && ((length t1_3) = 3) && ((length t1_3s) = 3) && ((head t1_3) = "c") && ((head t1_3s) = "c") - && ((length t1_2) = 2) && ((length t1_2s) = 2) && ((head t1_2) = "b") && ((head t1_2s) = "b") - && ((length t1_1) = 1) && ((length t1_1s) = 1) && ((head t1_1) = "a") && ((head t1_1s) = "a")) |> should equal true - -[] -//the previous series thoroughly tested construction by snoc, so we'll leave those out -let ``last, init, and length work test 1``() = - let t1 = init len2 + (((BatchedDeque.length t1) = 9) && ((BatchedDeque.length t1s) = 9) && ((BatchedDeque.head t1) = "i") && ((BatchedDeque.head t1s) = "i") + && ((BatchedDeque.length t1_8) = 8) && ((BatchedDeque.length t1_8s) = 8) && ((BatchedDeque.head t1_8) = "h") && ((BatchedDeque.head t1_8s) = "h") + && ((BatchedDeque.length t1_7) = 7) && ((BatchedDeque.length t1_7s) = 7) && ((BatchedDeque.head t1_7) = "g") && ((BatchedDeque.head t1_7s) = "g") + && ((BatchedDeque.length t1_6) = 6) && ((BatchedDeque.length t1_6s) = 6) && ((BatchedDeque.head t1_6) = "f") && ((BatchedDeque.head t1_6s) = "f") + && ((BatchedDeque.length t1_5) = 5) && ((BatchedDeque.length t1_5s) = 5) && ((BatchedDeque.head t1_5) = "e") && ((BatchedDeque.head t1_5s) = "e") + && ((BatchedDeque.length t1_4) = 4) && ((BatchedDeque.length t1_4s) = 4) && ((BatchedDeque.head t1_4) = "d") && ((BatchedDeque.head t1_4s) = "d") + && ((BatchedDeque.length t1_3) = 3) && ((BatchedDeque.length t1_3s) = 3) && ((BatchedDeque.head t1_3) = "c") && ((BatchedDeque.head t1_3s) = "c") + && ((BatchedDeque.length t1_2) = 2) && ((BatchedDeque.length t1_2s) = 2) && ((BatchedDeque.head t1_2) = "b") && ((BatchedDeque.head t1_2s) = "b") + && ((BatchedDeque.length t1_1) = 1) && ((BatchedDeque.length t1_1s) = 1) && ((BatchedDeque.head t1_1) = "a") && ((BatchedDeque.head t1_1s) = "a")) |> Expect.isTrue "" } + + //the previous series thoroughly tested construction by BatchedDeque.snoc, so we'll leave those out + test "BatchedDeque.last, BatchedDeque.init, and BatchedDeque.length work test 1" { + let t1 = BatchedDeque.init len2 - (((length t1) = 1) && ((last t1) = "b")) |> should equal true + (((BatchedDeque.length t1) = 1) && ((BatchedDeque.last t1) = "b")) |> Expect.isTrue "" } -[] -let ``last, init, and length work test 2``() = - let t1 = init len3 - let t1_1 = init t1 + test "BatchedDeque.last, BatchedDeque.init, and BatchedDeque.length work test 2" { + let t1 = BatchedDeque.init len3 + let t1_1 = BatchedDeque.init t1 - (((length t1) = 2) && ((last t1) = "b") && ((length t1_1) = 1) && ((last t1_1) = "c") ) |> should equal true + (((BatchedDeque.length t1) = 2) && ((BatchedDeque.last t1) = "b") && ((BatchedDeque.length t1_1) = 1) && ((BatchedDeque.last t1_1) = "c") ) |> Expect.isTrue "" } -[] -let ``last, init, and length work test 3``() = - let t1 = init len4 - let t1_1 = init t1 - let t1_2 = init t1_1 + test "BatchedDeque.last, BatchedDeque.init, and BatchedDeque.length work test 3" { + let t1 = BatchedDeque.init len4 + let t1_1 = BatchedDeque.init t1 + let t1_2 = BatchedDeque.init t1_1 - (((length t1) = 3) && ((last t1) = "b") - && ((length t1_1) = 2) && ((last t1_1) = "c") - && ((length t1_2) = 1) && ((last t1_2) = "d") ) |> should equal true - -[] -let ``last, init, and length work test 4``() = - let t1 = init len5 - let t1_1 = init t1 - let t1_2 = init t1_1 - let t1_3 = init t1_2 + (((BatchedDeque.length t1) = 3) && ((BatchedDeque.last t1) = "b") + && ((BatchedDeque.length t1_1) = 2) && ((BatchedDeque.last t1_1) = "c") + && ((BatchedDeque.length t1_2) = 1) && ((BatchedDeque.last t1_2) = "d") ) |> Expect.isTrue "" } + + test "BatchedDeque.last, BatchedDeque.init, and BatchedDeque.length work test 4" { + let t1 = BatchedDeque.init len5 + let t1_1 = BatchedDeque.init t1 + let t1_2 = BatchedDeque.init t1_1 + let t1_3 = BatchedDeque.init t1_2 - (((length t1) = 4) && ((last t1) = "b") - && ((length t1_1) = 3) && ((last t1_1) = "c") - && ((length t1_2) = 2) && ((last t1_2) = "d") - && ((length t1_3) = 1) && ((last t1_3) = "e") ) |> should equal true - -[] -let ``last, init, and length work test 5``() = - let t1 = init len6 - let t1_1 = init t1 - let t1_2 = init t1_1 - let t1_3 = init t1_2 - let t1_4 = init t1_3 + (((BatchedDeque.length t1) = 4) && ((BatchedDeque.last t1) = "b") + && ((BatchedDeque.length t1_1) = 3) && ((BatchedDeque.last t1_1) = "c") + && ((BatchedDeque.length t1_2) = 2) && ((BatchedDeque.last t1_2) = "d") + && ((BatchedDeque.length t1_3) = 1) && ((BatchedDeque.last t1_3) = "e") ) |> Expect.isTrue "" } + + test "BatchedDeque.last, BatchedDeque.init, and BatchedDeque.length work test 5" { + let t1 = BatchedDeque.init len6 + let t1_1 = BatchedDeque.init t1 + let t1_2 = BatchedDeque.init t1_1 + let t1_3 = BatchedDeque.init t1_2 + let t1_4 = BatchedDeque.init t1_3 - (((length t1) = 5) && ((last t1) = "b") - && ((length t1_1) = 4) && ((last t1_1) = "c") - && ((length t1_2) = 3) && ((last t1_2) = "d") - && ((length t1_3) = 2) && ((last t1_3) = "e") - && ((length t1_4) = 1) && ((last t1_4) = "f") ) |> should equal true - -[] -let ``last, init, and length work test 6``() = - let t1 = init len7 - let t1_1 = init t1 - let t1_2 = init t1_1 - let t1_3 = init t1_2 - let t1_4 = init t1_3 - let t1_5 = init t1_4 + (((BatchedDeque.length t1) = 5) && ((BatchedDeque.last t1) = "b") + && ((BatchedDeque.length t1_1) = 4) && ((BatchedDeque.last t1_1) = "c") + && ((BatchedDeque.length t1_2) = 3) && ((BatchedDeque.last t1_2) = "d") + && ((BatchedDeque.length t1_3) = 2) && ((BatchedDeque.last t1_3) = "e") + && ((BatchedDeque.length t1_4) = 1) && ((BatchedDeque.last t1_4) = "f") ) |> Expect.isTrue "" } + + test "BatchedDeque.last, BatchedDeque.init, and BatchedDeque.length work test 6" { + let t1 = BatchedDeque.init len7 + let t1_1 = BatchedDeque.init t1 + let t1_2 = BatchedDeque.init t1_1 + let t1_3 = BatchedDeque.init t1_2 + let t1_4 = BatchedDeque.init t1_3 + let t1_5 = BatchedDeque.init t1_4 - (((length t1) = 6) && ((last t1) = "b") - && ((length t1_1) = 5) && ((last t1_1) = "c") - && ((length t1_2) = 4) && ((last t1_2) = "d") - && ((length t1_3) = 3) && ((last t1_3) = "e") - && ((length t1_4) = 2) && ((last t1_4) = "f") - && ((length t1_5) = 1) && ((last t1_5) = "g") ) |> should equal true - -[] -let ``last, init, and length work test 7``() = - let t1 = init len8 - let t1_1 = init t1 - let t1_2 = init t1_1 - let t1_3 = init t1_2 - let t1_4 = init t1_3 - let t1_5 = init t1_4 - let t1_6 = init t1_5 + (((BatchedDeque.length t1) = 6) && ((BatchedDeque.last t1) = "b") + && ((BatchedDeque.length t1_1) = 5) && ((BatchedDeque.last t1_1) = "c") + && ((BatchedDeque.length t1_2) = 4) && ((BatchedDeque.last t1_2) = "d") + && ((BatchedDeque.length t1_3) = 3) && ((BatchedDeque.last t1_3) = "e") + && ((BatchedDeque.length t1_4) = 2) && ((BatchedDeque.last t1_4) = "f") + && ((BatchedDeque.length t1_5) = 1) && ((BatchedDeque.last t1_5) = "g") ) |> Expect.isTrue "" } + + test "BatchedDeque.last, BatchedDeque.init, and BatchedDeque.length work test 7" { + let t1 = BatchedDeque.init len8 + let t1_1 = BatchedDeque.init t1 + let t1_2 = BatchedDeque.init t1_1 + let t1_3 = BatchedDeque.init t1_2 + let t1_4 = BatchedDeque.init t1_3 + let t1_5 = BatchedDeque.init t1_4 + let t1_6 = BatchedDeque.init t1_5 - (((length t1) = 7) && ((last t1) = "b") - && ((length t1_1) = 6) && ((last t1_1) = "c") - && ((length t1_2) = 5) && ((last t1_2) = "d") - && ((length t1_3) = 4) && ((last t1_3) = "e") - && ((length t1_4) = 3) && ((last t1_4) = "f") - && ((length t1_5) = 2) && ((last t1_5) = "g") - && ((length t1_6) = 1) && ((last t1_6) = "h") ) |> should equal true - -[] -let ``last, init, and length work test 8``() = - let t1 = init len9 - let t1_1 = init t1 - let t1_2 = init t1_1 - let t1_3 = init t1_2 - let t1_4 = init t1_3 - let t1_5 = init t1_4 - let t1_6 = init t1_5 - let t1_7 = init t1_6 + (((BatchedDeque.length t1) = 7) && ((BatchedDeque.last t1) = "b") + && ((BatchedDeque.length t1_1) = 6) && ((BatchedDeque.last t1_1) = "c") + && ((BatchedDeque.length t1_2) = 5) && ((BatchedDeque.last t1_2) = "d") + && ((BatchedDeque.length t1_3) = 4) && ((BatchedDeque.last t1_3) = "e") + && ((BatchedDeque.length t1_4) = 3) && ((BatchedDeque.last t1_4) = "f") + && ((BatchedDeque.length t1_5) = 2) && ((BatchedDeque.last t1_5) = "g") + && ((BatchedDeque.length t1_6) = 1) && ((BatchedDeque.last t1_6) = "h") ) |> Expect.isTrue "" } + + test "BatchedDeque.last, BatchedDeque.init, and BatchedDeque.length work test 8" { + let t1 = BatchedDeque.init len9 + let t1_1 = BatchedDeque.init t1 + let t1_2 = BatchedDeque.init t1_1 + let t1_3 = BatchedDeque.init t1_2 + let t1_4 = BatchedDeque.init t1_3 + let t1_5 = BatchedDeque.init t1_4 + let t1_6 = BatchedDeque.init t1_5 + let t1_7 = BatchedDeque.init t1_6 - (((length t1) = 8) && ((last t1) = "b") - && ((length t1_1) = 7) && ((last t1_1) = "c") - && ((length t1_2) = 6) && ((last t1_2) = "d") - && ((length t1_3) = 5) && ((last t1_3) = "e") - && ((length t1_4) = 4) && ((last t1_4) = "f") - && ((length t1_5) = 3) && ((last t1_5) = "g") - && ((length t1_6) = 2) && ((last t1_6) = "h") - && ((length t1_7) = 1) && ((last t1_7) = "i") ) |> should equal true - -[] -let ``last, init, and length work test 9``() = - let t1 = init lena - let t1_1 = init t1 - let t1_2 = init t1_1 - let t1_3 = init t1_2 - let t1_4 = init t1_3 - let t1_5 = init t1_4 - let t1_6 = init t1_5 - let t1_7 = init t1_6 - let t1_8 = init t1_7 + (((BatchedDeque.length t1) = 8) && ((BatchedDeque.last t1) = "b") + && ((BatchedDeque.length t1_1) = 7) && ((BatchedDeque.last t1_1) = "c") + && ((BatchedDeque.length t1_2) = 6) && ((BatchedDeque.last t1_2) = "d") + && ((BatchedDeque.length t1_3) = 5) && ((BatchedDeque.last t1_3) = "e") + && ((BatchedDeque.length t1_4) = 4) && ((BatchedDeque.last t1_4) = "f") + && ((BatchedDeque.length t1_5) = 3) && ((BatchedDeque.last t1_5) = "g") + && ((BatchedDeque.length t1_6) = 2) && ((BatchedDeque.last t1_6) = "h") + && ((BatchedDeque.length t1_7) = 1) && ((BatchedDeque.last t1_7) = "i") ) |> Expect.isTrue "" } + + test "BatchedDeque.last, BatchedDeque.init, and BatchedDeque.length work test 9" { + let t1 = BatchedDeque.init lena + let t1_1 = BatchedDeque.init t1 + let t1_2 = BatchedDeque.init t1_1 + let t1_3 = BatchedDeque.init t1_2 + let t1_4 = BatchedDeque.init t1_3 + let t1_5 = BatchedDeque.init t1_4 + let t1_6 = BatchedDeque.init t1_5 + let t1_7 = BatchedDeque.init t1_6 + let t1_8 = BatchedDeque.init t1_7 - (((length t1) = 9) && ((last t1) = "b") - && ((length t1_1) = 8) && ((last t1_1) = "c") - && ((length t1_2) = 7) && ((last t1_2) = "d") - && ((length t1_3) = 6) && ((last t1_3) = "e") - && ((length t1_4) = 5) && ((last t1_4) = "f") - && ((length t1_5) = 4) && ((last t1_5) = "g") - && ((length t1_6) = 3) && ((last t1_6) = "h") - && ((length t1_7) = 2) && ((last t1_7) = "i") - && ((length t1_8) = 1) && ((last t1_8) = "j") ) |> should equal true - -[] -let ``IEnumerable Seq``() = - (lena |> Seq.toArray).[5] |> should equal "e" - -[] -let ``IEnumerable Seq length``() = - lena |> Seq.length |> should equal 10 - -[] -let ``type cons works``() = - lena.Cons "zz" |> head |> should equal "zz" - -[] -let ``IDeque cons works``() = - ((lena :> IDeque).Cons "zz").Head |> should equal "zz" - -[] -let ``ofCatLists and uncons``() = - let d = ofCatLists ["a";"b";"c"] ["d";"e";"f"] - let h1, t1 = uncons d - let h2, t2 = uncons t1 - let h3, t3 = uncons t2 - let h4, t4 = uncons t3 - let h5, t5 = uncons t4 - let h6, t6 = uncons t5 - - ((h1 = "a") && (h2 = "b") && (h3 = "c") && (h4 = "d") && (h5 = "e") && (h6 = "f") && (isEmpty t6)) |> should equal true - -[] -let ``unsnoc works``() = - let d = ofCatLists ["f";"e";"d"] ["c";"b";"a"] - let i1, l1 = unsnoc d - let i2, l2 = unsnoc i1 - let i3, l3 = unsnoc i2 - let i4, l4 = unsnoc i3 - let i5, l5 = unsnoc i4 - let i6, l6 = unsnoc i5 - - ((l1 = "a") && (l2 = "b") && (l3 = "c") && (l4 = "d") && (l5 = "e") && (l6 = "f") && (isEmpty i6)) |> should equal true - -[] -let ``snoc pattern discriminator``() = - let d = (ofCatLists ["f";"e";"d"] ["c";"b";"a"]) - let i1, l1 = unsnoc d - - let i2, l2 = - match i1 with - | Snoc(i, l) -> i, l - | _ -> i1, "x" - - ((l2 = "b") && ((length i2) = 4)) |> should equal true - -[] -let ``cons pattern discriminator``() = - let d = (ofCatLists ["f";"e";"d"] ["c";"b";"a"]) - let h1, t1 = uncons d - - let h2, t2 = - match t1 with - | Cons(h, t) -> h, t - | _ -> "x", t1 - - ((h2 = "e") && ((length t2) = 4)) |> should equal true - -[] -let ``cons and snoc pattern discriminator``() = - let d = (ofCatLists ["f";"e";"d"] ["c";"b";"a"]) + (((BatchedDeque.length t1) = 9) && ((BatchedDeque.last t1) = "b") + && ((BatchedDeque.length t1_1) = 8) && ((BatchedDeque.last t1_1) = "c") + && ((BatchedDeque.length t1_2) = 7) && ((BatchedDeque.last t1_2) = "d") + && ((BatchedDeque.length t1_3) = 6) && ((BatchedDeque.last t1_3) = "e") + && ((BatchedDeque.length t1_4) = 5) && ((BatchedDeque.last t1_4) = "f") + && ((BatchedDeque.length t1_5) = 4) && ((BatchedDeque.last t1_5) = "g") + && ((BatchedDeque.length t1_6) = 3) && ((BatchedDeque.last t1_6) = "h") + && ((BatchedDeque.length t1_7) = 2) && ((BatchedDeque.last t1_7) = "i") + && ((BatchedDeque.length t1_8) = 1) && ((BatchedDeque.last t1_8) = "j") ) |> Expect.isTrue "" } + + test "IEnumerable Seq" { + (lena |> Seq.toArray).[5] |> Expect.equal "" "e" } + + test "IEnumerable Seq BatchedDeque.length" { + lena |> Seq.length |> Expect.equal "" 10 } + + test "type BatchedDeque.cons works" { + lena.Cons "zz" |> BatchedDeque.head |> Expect.equal "" "zz" } + + test "IDeque BatchedDeque.cons works" { + ((lena :> IDeque).Cons "zz").Head |> Expect.equal "" "zz" } + + test "BatchedDeque.ofCatLists and BatchedDeque.uncons" { + let d = BatchedDeque.ofCatLists ["a";"b";"c"] ["d";"e";"f"] + let h1, t1 = BatchedDeque.uncons d + let h2, t2 = BatchedDeque.uncons t1 + let h3, t3 = BatchedDeque.uncons t2 + let h4, t4 = BatchedDeque.uncons t3 + let h5, t5 = BatchedDeque.uncons t4 + let h6, t6 = BatchedDeque.uncons t5 + + ((h1 = "a") && (h2 = "b") && (h3 = "c") && (h4 = "d") && (h5 = "e") && (h6 = "f") && (BatchedDeque.isEmpty t6)) |> Expect.isTrue "" } + + test "BatchedDeque.unsnoc works" { + let d = BatchedDeque.ofCatLists ["f";"e";"d"] ["c";"b";"a"] + let i1, l1 = BatchedDeque.unsnoc d + let i2, l2 = BatchedDeque.unsnoc i1 + let i3, l3 = BatchedDeque.unsnoc i2 + let i4, l4 = BatchedDeque.unsnoc i3 + let i5, l5 = BatchedDeque.unsnoc i4 + let i6, l6 = BatchedDeque.unsnoc i5 + + ((l1 = "a") && (l2 = "b") && (l3 = "c") && (l4 = "d") && (l5 = "e") && (l6 = "f") && (BatchedDeque.isEmpty i6)) |> Expect.isTrue "" } + + test "BatchedDeque.snoc pattern discriminator" { + let d = (BatchedDeque.ofCatLists ["f";"e";"d"] ["c";"b";"a"]) + let i1, l1 = BatchedDeque.unsnoc d + + let i2, l2 = + match i1 with + | BatchedDeque.Snoc(i, l) -> i, l + | _ -> i1, "x" + + ((l2 = "b") && ((BatchedDeque.length i2) = 4)) |> Expect.isTrue "" } + + test "BatchedDeque.cons pattern discriminator" { + let d = (BatchedDeque.ofCatLists ["f";"e";"d"] ["c";"b";"a"]) + let h1, t1 = BatchedDeque.uncons d + + let h2, t2 = + match t1 with + | BatchedDeque.Cons(h, t) -> h, t + | _ -> "x", t1 + + ((h2 = "e") && ((BatchedDeque.length t2) = 4)) |> Expect.isTrue "" } + + test "BatchedDeque.cons and BatchedDeque.snoc pattern discriminator" { + let d = (BatchedDeque.ofCatLists ["f";"e";"d"] ["c";"b";"a"]) - let mid1 = - match d with - | Cons(h, Snoc(i, l)) -> i - | _ -> d - - let head, last = - match mid1 with - | Cons(h, Snoc(i, l)) -> h, l - | _ -> "x", "x" - - ((head = "e") && (last = "b")) |> should equal true - -[] -let ``rev dqueue length 1``() = - rev len1 |> head |> should equal "a" - -[] -let ``rev dqueue length 2``() = - let r1 = rev len2 - let h1 = head r1 - let t2 = tail r1 - let h2 = head t2 - - ((h1 = "a") && (h2 = "b")) |> should equal true - -[] -let ``rev dqueue length 3``() = - let r1 = rev len3 - let h1 = head r1 - let t2 = tail r1 - let h2 = head t2 - let t3 = tail t2 - let h3 = head t3 - - ((h1 = "a") && (h2 = "b") && (h3 = "c")) |> should equal true - -[] -let ``rev dqueue length 4``() = - let r1 = rev len4 - let h1 = head r1 - let t2 = tail r1 - let h2 = head t2 - let t3 = tail t2 - let h3 = head t3 - let t4 = tail t3 - let h4 = head t4 - - ((h1 = "a") && (h2 = "b") && (h3 = "c") && (h4 = "d")) |> should equal true - -[] -let ``rev dqueue length 5``() = - let r1 = rev len5 - let h1 = head r1 - let t2 = tail r1 - let h2 = head t2 - let t3 = tail t2 - let h3 = head t3 - let t4 = tail t3 - let h4 = head t4 - let t5 = tail t4 - let h5 = head t5 - - ((h1 = "a") && (h2 = "b") && (h3 = "c") && (h4 = "d") && (h5 = "e")) |> should equal true - -[] -//length 6 more than sufficient to test rev -let ``rev dqueue length 6``() = - let r1 = rev len6 - let h1 = head r1 - let t2 = tail r1 - let h2 = head t2 - let t3 = tail t2 - let h3 = head t3 - let t4 = tail t3 - let h4 = head t4 - let t5 = tail t4 - let h5 = head t5 - let t6 = tail t5 - let h6 = head t6 - - ((h1 = "a") && (h2 = "b") && (h3 = "c") && (h4 = "d") && (h5 = "e") && (h6 = "f")) |> should equal true - -[] -let ``lookup length 1``() = - len1 |> lookup 0 |> should equal "a" - -[] -let ``lookup length 2``() = - (((len2 |> lookup 0) = "b") && ((len2 |> lookup 1) = "a")) |> should equal true - -[] -let ``lookup length 3``() = - (((len3 |> lookup 0) = "c") && ((len3 |> lookup 1) = "b") && ((len3 |> lookup 2) = "a")) |> should equal true - -[] -let ``lookup length 4``() = - (((len4 |> lookup 0) = "d") && ((len4 |> lookup 1) = "c") && ((len4 |> lookup 2) = "b") && ((len4 |> lookup 3) = "a")) - |> should equal true - -[] -let ``lookup length 5``() = - (((len5 |> lookup 0) = "e") && ((len5 |> lookup 1) = "d") && ((len5 |> lookup 2) = "c") && ((len5 |> lookup 3) = "b") - && ((len5 |> lookup 4) = "a")) |> should equal true - -[] -let ``lookup length 6``() = - (((len6 |> lookup 0) = "f") && ((len6 |> lookup 1) = "e") && ((len6 |> lookup 2) = "d") && ((len6 |> lookup 3) = "c") - && ((len6 |> lookup 4) = "b") && ((len6 |> lookup 5) = "a")) |> should equal true - -[] -let ``lookup length 7``() = - (((len7 |> lookup 0) = "g") && ((len7 |> lookup 1) = "f") && ((len7 |> lookup 2) = "e") && ((len7 |> lookup 3) = "d") - && ((len7 |> lookup 4) = "c") && ((len7 |> lookup 5) = "b") && ((len7 |> lookup 6) = "a")) |> should equal true - -[] -let ``lookup length 8``() = - (((len8 |> lookup 0) = "h") && ((len8 |> lookup 1) = "g") && ((len8 |> lookup 2) = "f") && ((len8 |> lookup 3) = "e") - && ((len8 |> lookup 4) = "d") && ((len8 |> lookup 5) = "c") && ((len8 |> lookup 6) = "b") && ((len8 |> lookup 7) = "a")) - |> should equal true - -[] -let ``lookup length 9``() = - (((len9 |> lookup 0) = "i") && ((len9 |> lookup 1) = "h") && ((len9 |> lookup 2) = "g") && ((len9 |> lookup 3) = "f") - && ((len9 |> lookup 4) = "e") && ((len9 |> lookup 5) = "d") && ((len9 |> lookup 6) = "c") && ((len9 |> lookup 7) = "b") - && ((len9 |> lookup 8) = "a")) |> should equal true - -[] -let ``lookup length 10``() = - (((lena |> lookup 0) = "j") && ((lena |> lookup 1) = "i") && ((lena |> lookup 2) = "h") && ((lena |> lookup 3) = "g") - && ((lena |> lookup 4) = "f") && ((lena |> lookup 5) = "e") && ((lena |> lookup 6) = "d") && ((lena |> lookup 7) = "c") - && ((lena |> lookup 8) = "b") && ((lena |> lookup 9) = "a")) |> should equal true - -[] -let ``tryLookup length 1``() = - let a = len1 |> tryLookup 0 - (a.Value = "a") |> should equal true - -[] -let ``tryLookup length 2``() = - let b = len2 |> tryLookup 0 - let a = len2 |> tryLookup 1 - ((b.Value = "b") && (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 3``() = - let c = len3 |> tryLookup 0 - let b = len3 |> tryLookup 1 - let a = len3 |> tryLookup 2 - ((c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 4``() = - let d = len4 |> tryLookup 0 - let c = len4 |> tryLookup 1 - let b = len4 |> tryLookup 2 - let a = len4 |> tryLookup 3 - ((d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 5``() = - let e = len5 |> tryLookup 0 - let d = len5 |> tryLookup 1 - let c = len5 |> tryLookup 2 - let b = len5 |> tryLookup 3 - let a = len5 |> tryLookup 4 - ((e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 6``() = - let f = len6 |> tryLookup 0 - let e = len6 |> tryLookup 1 - let d = len6 |> tryLookup 2 - let c = len6 |> tryLookup 3 - let b = len6 |> tryLookup 4 - let a = len6 |> tryLookup 5 - ((f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) - |> should equal true - -[] -let ``tryLookup length 7``() = - let g = len7 |> tryLookup 0 - let f = len7 |> tryLookup 1 - let e = len7 |> tryLookup 2 - let d = len7 |> tryLookup 3 - let c = len7 |> tryLookup 4 - let b = len7 |> tryLookup 5 - let a = len7 |> tryLookup 6 - ((g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") - && (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 8``() = - let h = len8 |> tryLookup 0 - let g = len8 |> tryLookup 1 - let f = len8 |> tryLookup 2 - let e = len8 |> tryLookup 3 - let d = len8 |> tryLookup 4 - let c = len8 |> tryLookup 5 - let b = len8 |> tryLookup 6 - let a = len8 |> tryLookup 7 - ((h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") - && (b.Value = "b")&& (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 9``() = - let i = len9 |> tryLookup 0 - let h = len9 |> tryLookup 1 - let g = len9 |> tryLookup 2 - let f = len9 |> tryLookup 3 - let e = len9 |> tryLookup 4 - let d = len9 |> tryLookup 5 - let c = len9 |> tryLookup 6 - let b = len9 |> tryLookup 7 - let a = len9 |> tryLookup 8 - ((i.Value = "i") && (h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") - && (c.Value = "c") && (b.Value = "b")&& (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 10``() = - let j = lena |> tryLookup 0 - let i = lena |> tryLookup 1 - let h = lena |> tryLookup 2 - let g = lena |> tryLookup 3 - let f = lena |> tryLookup 4 - let e = lena |> tryLookup 5 - let d = lena |> tryLookup 6 - let c = lena |> tryLookup 7 - let b = lena |> tryLookup 8 - let a = lena |> tryLookup 9 - ((j.Value = "j") && (i.Value = "i") && (h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") - && (d.Value = "d") && (c.Value = "c") && (b.Value = "b")&& (a.Value = "a")) |> should equal true - -[] -let ``tryLookup not found``() = - lena |> tryLookup 10 |> should equal None - -[] -let ``remove elements length 1``() = - len1 |> remove 0 |> isEmpty |> should equal true - -[] -let ``remove elements length 2``() = - let a = len2 |> remove 0 |> head - let b = len2 |> remove 1 |> head - ((a = "a") && (b = "b")) |> should equal true - -[] -let ``remove elements length 3``() = - let r0 = (ofSeq ["a";"b";"c"]) |> remove 0 - let b0 = head r0 - let t0 = tail r0 - let c0 = head t0 - - let r1 = (ofSeq ["a";"b";"c"]) |> remove 1 - let a1 = head r1 - let t1 = tail r1 - let c1 = head t1 - - let r2 = (ofSeq ["a";"b";"c"]) |> remove 2 - let a2 = head r2 - let t2 = tail r2 - let b2 = head t2 - - ((b0 = "b") && (c0 = "c") && (a1 = "a") && (c1 = "c") && (a2 = "a") && (b2 = "b")) |> should equal true - -[] -let ``remove elements length 4``() = - let r0 = (ofSeq ["a";"b";"c";"d"]) |> remove 0 - let b0 = head r0 - let t0 = tail r0 - let c0 = head t0 - let t01 = tail t0 - let d0 = head t01 - - let r1 = (ofSeq ["a";"b";"c";"d"]) |> remove 1 - let a1 = head r1 - let t11 = tail r1 - let c1 = head t11 - let t12 = tail t11 - let d1 = head t12 - - let r2 = (ofSeq ["a";"b";"c";"d"]) |> remove 2 - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 - - let r3 = (ofSeq ["a";"b";"c";"d"]) |> remove 3 - let a3 = head r3 - let t31 = tail r3 - let b3 = head t31 - let t32 = tail t31 - let c3 = head t32 - - ((b0 = "b") && (c0 = "c") && (d0 = "d") - && (a1 = "a") && (c1 = "c") && (d1 = "d") - && (a2 = "a") && (b2 = "b") && (c2 = "d") - && (a3 = "a") && (b3 = "b") && (c3 = "c")) |> should equal true - -[] -let ``remove elements length 5``() = - let r0 = (ofSeq ["a";"b";"c";"d";"e"]) |> remove 0 - let b0 = head r0 - let t01 = tail r0 - let c0 = head t01 - let t02= tail t01 - let d0 = head t02 - let t03 = tail t02 - let e0 = head t03 - - let r1 = (ofSeq ["a";"b";"c";"d";"e"]) |> remove 1 - let a1 = head r1 - let t11 = tail r1 - let c1 = head t11 - let t12 = tail t11 - let d1 = head t12 - let t13 = tail t12 - let e1 = head t13 - - let r2 = (ofSeq ["a";"b";"c";"d";"e"]) |> remove 2 - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 - let t23 = tail t22 - let e2 = head t23 - - let r3 = (ofSeq ["a";"b";"c";"d";"e"]) |> remove 3 - let a3 = head r3 - let t31 = tail r3 - let b3 = head t31 - let t32 = tail t31 - let c3 = head t32 - let t33 = tail t32 - let e3 = head t33 - - let r4 = (ofSeq ["a";"b";"c";"d";"e"]) |> remove 4 - let a4 = head r4 - let t41 = tail r4 - let b4 = head t41 - let t42 = tail t41 - let c4 = head t42 - let t43 = tail t42 - let d4 = head t43 - - ((b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") - && (a1 = "a") && (c1 = "c") && (d1 = "d") && (e1 = "e") - && (a2 = "a") && (b2 = "b") && (c2 = "d") && (e2 = "e") - && (a3 = "a") && (b3 = "b") && (c3 = "c") && (e3 = "e") - && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d")) |> should equal true - -[] -let ``remove elements length 6``() = - let r0 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> remove 0 - let b0 = head r0 - let t01 = tail r0 - let c0 = head t01 - let t02= tail t01 - let d0 = head t02 - let t03 = tail t02 - let e0 = head t03 - let t04 = tail t03 - let f0 = head t04 - - let r1 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> remove 1 - let a1 = head r1 - let t11 = tail r1 - let c1 = head t11 - let t12 = tail t11 - let d1 = head t12 - let t13 = tail t12 - let e1 = head t13 - let t14 = tail t13 - let f1 = head t14 - - let r2 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> remove 2 - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 - let t23 = tail t22 - let e2 = head t23 - let t24 = tail t23 - let f2 = head t24 - - let r3 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> remove 3 - let a3 = head r3 - let t31 = tail r3 - let b3 = head t31 - let t32 = tail t31 - let c3 = head t32 - let t33 = tail t32 - let e3 = head t33 - let t34 = tail t33 - let f3 = head t34 - - let r4 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> remove 4 - let a4 = head r4 - let t41 = tail r4 - let b4 = head t41 - let t42 = tail t41 - let c4 = head t42 - let t43 = tail t42 - let d4 = head t43 - let t44 = tail t43 - let f4 = head t44 - - let r5 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> remove 5 - let a5 = head r5 - let t51 = tail r5 - let b5 = head t51 - let t52 = tail t51 - let c5 = head t52 - let t53 = tail t52 - let d5 = head t53 - let t54 = tail t53 - let e5 = head t54 - - ((b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") && (f0 = "f") - && (a1 = "a") && (c1 = "c") && (d1 = "d") && (e1 = "e") && (f1 = "f") - && (a2 = "a") && (b2 = "b") && (c2 = "d") && (e2 = "e") && (f2 = "f") - && (a3 = "a") && (b3 = "b") && (c3 = "c") && (e3 = "e") && (f3 = "f") - && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d") && (f4 = "f") - && (a5 = "a") && (b5 = "b") && (c5 = "c") && (d5 = "d") && (e5 = "e")) |> should equal true - -[] -let ``tryRemoveempty``() = - empty() |>tryRemove 0 |> should equal None - -[] -let ``tryRemove elements length 1``() = - let a = len1 |> tryRemove 0 - a.Value |> isEmpty |> should equal true - -[] -let ``tryRemove elements length 2``() = - let a = len2 |> tryRemove 0 - let a1 = head a.Value - let b = len2 |> tryRemove 1 - let b1 = head b.Value - ((a1 = "a") && (b1 = "b")) |> should equal true - -[] -let ``tryRemove elements length 3``() = - let x0 = (ofSeq ["a";"b";"c"]) |> tryRemove 0 - let r0 = x0.Value - let b0 = head r0 - let t0 = tail r0 - let c0 = head t0 - - let x1 = (ofSeq ["a";"b";"c"]) |> tryRemove 1 - let r1 = x1.Value - let a1 = head r1 - let t1 = tail r1 - let c1 = head t1 - - let x2 = (ofSeq ["a";"b";"c"]) |> tryRemove 2 - let r2 = x2.Value - let a2 = head r2 - let t2 = tail r2 - let b2 = head t2 - - ((b0 = "b") && (c0 = "c") && (a1 = "a") && (c1 = "c") && (a2 = "a") && (b2 = "b")) |> should equal true - -[] -let ``tryRemove elements length 4``() = - let x0 = (ofSeq ["a";"b";"c";"d"]) |> tryRemove 0 - let r0 = x0.Value - let b0 = head r0 - let t0 = tail r0 - let c0 = head t0 - let t01 = tail t0 - let d0 = head t01 - - let x1 = (ofSeq ["a";"b";"c";"d"]) |> tryRemove 1 - let r1 = x1.Value - let a1 = head r1 - let t11 = tail r1 - let c1 = head t11 - let t12 = tail t11 - let d1 = head t12 + let mid1 = + match d with + | BatchedDeque.Cons(h, BatchedDeque.Snoc(i, l)) -> i + | _ -> d + + let head, last = + match mid1 with + | BatchedDeque.Cons(h, BatchedDeque.Snoc(i, l)) -> h, l + | _ -> "x", "x" + + ((head = "e") && (last = "b")) |> Expect.isTrue "" } + + test "BatchedDeque.rev dqueue BatchedDeque.length 1" { + BatchedDeque.rev len1 |> BatchedDeque.head |> Expect.equal "" "a" } + + test "BatchedDeque.rev dqueue BatchedDeque.length 2" { + let r1 = BatchedDeque.rev len2 + let h1 = BatchedDeque.head r1 + let t2 = BatchedDeque.tail r1 + let h2 = BatchedDeque.head t2 + + ((h1 = "a") && (h2 = "b")) |> Expect.isTrue "" } + + test "BatchedDeque.rev dqueue BatchedDeque.length 3" { + let r1 = BatchedDeque.rev len3 + let h1 = BatchedDeque.head r1 + let t2 = BatchedDeque.tail r1 + let h2 = BatchedDeque.head t2 + let t3 = BatchedDeque.tail t2 + let h3 = BatchedDeque.head t3 + + ((h1 = "a") && (h2 = "b") && (h3 = "c")) |> Expect.isTrue "" } + + test "BatchedDeque.rev dqueue BatchedDeque.length 4" { + let r1 = BatchedDeque.rev len4 + let h1 = BatchedDeque.head r1 + let t2 = BatchedDeque.tail r1 + let h2 = BatchedDeque.head t2 + let t3 = BatchedDeque.tail t2 + let h3 = BatchedDeque.head t3 + let t4 = BatchedDeque.tail t3 + let h4 = BatchedDeque.head t4 + + ((h1 = "a") && (h2 = "b") && (h3 = "c") && (h4 = "d")) |> Expect.isTrue "" } + + test "BatchedDeque.rev dqueue BatchedDeque.length 5" { + let r1 = BatchedDeque.rev len5 + let h1 = BatchedDeque.head r1 + let t2 = BatchedDeque.tail r1 + let h2 = BatchedDeque.head t2 + let t3 = BatchedDeque.tail t2 + let h3 = BatchedDeque.head t3 + let t4 = BatchedDeque.tail t3 + let h4 = BatchedDeque.head t4 + let t5 = BatchedDeque.tail t4 + let h5 = BatchedDeque.head t5 + + ((h1 = "a") && (h2 = "b") && (h3 = "c") && (h4 = "d") && (h5 = "e")) |> Expect.isTrue "" } + + //BatchedDeque.length 6 more than sufficient to test BatchedDeque.rev + test "BatchedDeque.rev dqueue BatchedDeque.length 6" { + let r1 = BatchedDeque.rev len6 + let h1 = BatchedDeque.head r1 + let t2 = BatchedDeque.tail r1 + let h2 = BatchedDeque.head t2 + let t3 = BatchedDeque.tail t2 + let h3 = BatchedDeque.head t3 + let t4 = BatchedDeque.tail t3 + let h4 = BatchedDeque.head t4 + let t5 = BatchedDeque.tail t4 + let h5 = BatchedDeque.head t5 + let t6 = BatchedDeque.tail t5 + let h6 = BatchedDeque.head t6 + + ((h1 = "a") && (h2 = "b") && (h3 = "c") && (h4 = "d") && (h5 = "e") && (h6 = "f")) |> Expect.isTrue "" } + + test "BatchedDeque.lookup BatchedDeque.length 1" { + len1 |> BatchedDeque.lookup 0 |> Expect.equal "" "a" } + + test "BatchedDeque.lookup BatchedDeque.length 2" { + (((len2 |> BatchedDeque.lookup 0) = "b") && ((len2 |> BatchedDeque.lookup 1) = "a")) |> Expect.isTrue "" } + + test "BatchedDeque.lookup BatchedDeque.length 3" { + (((len3 |> BatchedDeque.lookup 0) = "c") && ((len3 |> BatchedDeque.lookup 1) = "b") && ((len3 |> BatchedDeque.lookup 2) = "a")) |> Expect.isTrue "" } + + test "BatchedDeque.lookup BatchedDeque.length 4" { + (((len4 |> BatchedDeque.lookup 0) = "d") && ((len4 |> BatchedDeque.lookup 1) = "c") && ((len4 |> BatchedDeque.lookup 2) = "b") && ((len4 |> BatchedDeque.lookup 3) = "a")) + |> Expect.isTrue "" } + + test "BatchedDeque.lookup BatchedDeque.length 5" { + (((len5 |> BatchedDeque.lookup 0) = "e") && ((len5 |> BatchedDeque.lookup 1) = "d") && ((len5 |> BatchedDeque.lookup 2) = "c") && ((len5 |> BatchedDeque.lookup 3) = "b") + && ((len5 |> BatchedDeque.lookup 4) = "a")) |> Expect.isTrue "" } + + test "BatchedDeque.lookup BatchedDeque.length 6" { + (((len6 |> BatchedDeque.lookup 0) = "f") && ((len6 |> BatchedDeque.lookup 1) = "e") && ((len6 |> BatchedDeque.lookup 2) = "d") && ((len6 |> BatchedDeque.lookup 3) = "c") + && ((len6 |> BatchedDeque.lookup 4) = "b") && ((len6 |> BatchedDeque.lookup 5) = "a")) |> Expect.isTrue "" } + + test "BatchedDeque.lookup BatchedDeque.length 7" { + (((len7 |> BatchedDeque.lookup 0) = "g") && ((len7 |> BatchedDeque.lookup 1) = "f") && ((len7 |> BatchedDeque.lookup 2) = "e") && ((len7 |> BatchedDeque.lookup 3) = "d") + && ((len7 |> BatchedDeque.lookup 4) = "c") && ((len7 |> BatchedDeque.lookup 5) = "b") && ((len7 |> BatchedDeque.lookup 6) = "a")) |> Expect.isTrue "" } + + test "BatchedDeque.lookup BatchedDeque.length 8" { + (((len8 |> BatchedDeque.lookup 0) = "h") && ((len8 |> BatchedDeque.lookup 1) = "g") && ((len8 |> BatchedDeque.lookup 2) = "f") && ((len8 |> BatchedDeque.lookup 3) = "e") + && ((len8 |> BatchedDeque.lookup 4) = "d") && ((len8 |> BatchedDeque.lookup 5) = "c") && ((len8 |> BatchedDeque.lookup 6) = "b") && ((len8 |> BatchedDeque.lookup 7) = "a")) + |> Expect.isTrue "" } + + test "BatchedDeque.lookup BatchedDeque.length 9" { + (((len9 |> BatchedDeque.lookup 0) = "i") && ((len9 |> BatchedDeque.lookup 1) = "h") && ((len9 |> BatchedDeque.lookup 2) = "g") && ((len9 |> BatchedDeque.lookup 3) = "f") + && ((len9 |> BatchedDeque.lookup 4) = "e") && ((len9 |> BatchedDeque.lookup 5) = "d") && ((len9 |> BatchedDeque.lookup 6) = "c") && ((len9 |> BatchedDeque.lookup 7) = "b") + && ((len9 |> BatchedDeque.lookup 8) = "a")) |> Expect.isTrue "" } + + test "BatchedDeque.lookup BatchedDeque.length 10" { + (((lena |> BatchedDeque.lookup 0) = "j") && ((lena |> BatchedDeque.lookup 1) = "i") && ((lena |> BatchedDeque.lookup 2) = "h") && ((lena |> BatchedDeque.lookup 3) = "g") + && ((lena |> BatchedDeque.lookup 4) = "f") && ((lena |> BatchedDeque.lookup 5) = "e") && ((lena |> BatchedDeque.lookup 6) = "d") && ((lena |> BatchedDeque.lookup 7) = "c") + && ((lena |> BatchedDeque.lookup 8) = "b") && ((lena |> BatchedDeque.lookup 9) = "a")) |> Expect.isTrue "" } + + test "BatchedDeque.tryLookup BatchedDeque.length 1" { + let a = len1 |> BatchedDeque.tryLookup 0 + (a.Value = "a") |> Expect.isTrue "" } + + test "BatchedDeque.tryLookup BatchedDeque.length 2" { + let b = len2 |> BatchedDeque.tryLookup 0 + let a = len2 |> BatchedDeque.tryLookup 1 + ((b.Value = "b") && (a.Value = "a")) |> Expect.isTrue "" } + + test "BatchedDeque.tryLookup BatchedDeque.length 3" { + let c = len3 |> BatchedDeque.tryLookup 0 + let b = len3 |> BatchedDeque.tryLookup 1 + let a = len3 |> BatchedDeque.tryLookup 2 + ((c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> Expect.isTrue "" } + + test "BatchedDeque.tryLookup BatchedDeque.length 4" { + let d = len4 |> BatchedDeque.tryLookup 0 + let c = len4 |> BatchedDeque.tryLookup 1 + let b = len4 |> BatchedDeque.tryLookup 2 + let a = len4 |> BatchedDeque.tryLookup 3 + ((d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> Expect.isTrue "" } + + test "BatchedDeque.tryLookup BatchedDeque.length 5" { + let e = len5 |> BatchedDeque.tryLookup 0 + let d = len5 |> BatchedDeque.tryLookup 1 + let c = len5 |> BatchedDeque.tryLookup 2 + let b = len5 |> BatchedDeque.tryLookup 3 + let a = len5 |> BatchedDeque.tryLookup 4 + ((e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> Expect.isTrue "" } + + test "BatchedDeque.tryLookup BatchedDeque.length 6" { + let f = len6 |> BatchedDeque.tryLookup 0 + let e = len6 |> BatchedDeque.tryLookup 1 + let d = len6 |> BatchedDeque.tryLookup 2 + let c = len6 |> BatchedDeque.tryLookup 3 + let b = len6 |> BatchedDeque.tryLookup 4 + let a = len6 |> BatchedDeque.tryLookup 5 + ((f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) + |> Expect.isTrue "" } + + test "BatchedDeque.tryLookup BatchedDeque.length 7" { + let g = len7 |> BatchedDeque.tryLookup 0 + let f = len7 |> BatchedDeque.tryLookup 1 + let e = len7 |> BatchedDeque.tryLookup 2 + let d = len7 |> BatchedDeque.tryLookup 3 + let c = len7 |> BatchedDeque.tryLookup 4 + let b = len7 |> BatchedDeque.tryLookup 5 + let a = len7 |> BatchedDeque.tryLookup 6 + ((g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") + && (a.Value = "a")) |> Expect.isTrue "" } + + test "BatchedDeque.tryLookup BatchedDeque.length 8" { + let h = len8 |> BatchedDeque.tryLookup 0 + let g = len8 |> BatchedDeque.tryLookup 1 + let f = len8 |> BatchedDeque.tryLookup 2 + let e = len8 |> BatchedDeque.tryLookup 3 + let d = len8 |> BatchedDeque.tryLookup 4 + let c = len8 |> BatchedDeque.tryLookup 5 + let b = len8 |> BatchedDeque.tryLookup 6 + let a = len8 |> BatchedDeque.tryLookup 7 + ((h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") + && (b.Value = "b")&& (a.Value = "a")) |> Expect.isTrue "" } + + test "BatchedDeque.tryLookup BatchedDeque.length 9" { + let i = len9 |> BatchedDeque.tryLookup 0 + let h = len9 |> BatchedDeque.tryLookup 1 + let g = len9 |> BatchedDeque.tryLookup 2 + let f = len9 |> BatchedDeque.tryLookup 3 + let e = len9 |> BatchedDeque.tryLookup 4 + let d = len9 |> BatchedDeque.tryLookup 5 + let c = len9 |> BatchedDeque.tryLookup 6 + let b = len9 |> BatchedDeque.tryLookup 7 + let a = len9 |> BatchedDeque.tryLookup 8 + ((i.Value = "i") && (h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") + && (c.Value = "c") && (b.Value = "b")&& (a.Value = "a")) |> Expect.isTrue "" } + + test "BatchedDeque.tryLookup BatchedDeque.length 10" { + let j = lena |> BatchedDeque.tryLookup 0 + let i = lena |> BatchedDeque.tryLookup 1 + let h = lena |> BatchedDeque.tryLookup 2 + let g = lena |> BatchedDeque.tryLookup 3 + let f = lena |> BatchedDeque.tryLookup 4 + let e = lena |> BatchedDeque.tryLookup 5 + let d = lena |> BatchedDeque.tryLookup 6 + let c = lena |> BatchedDeque.tryLookup 7 + let b = lena |> BatchedDeque.tryLookup 8 + let a = lena |> BatchedDeque.tryLookup 9 + ((j.Value = "j") && (i.Value = "i") && (h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") + && (d.Value = "d") && (c.Value = "c") && (b.Value = "b")&& (a.Value = "a")) |> Expect.isTrue "" } + + test "BatchedDeque.tryLookup not found" { + lena |> BatchedDeque.tryLookup 10 |> Expect.isNone "" } + + test "BatchedDeque.remove elements BatchedDeque.length 1" { + len1 |> BatchedDeque.remove 0 |> BatchedDeque.isEmpty |> Expect.isTrue "" } + + test "BatchedDeque.remove elements BatchedDeque.length 2" { + let a = len2 |> BatchedDeque.remove 0 |> BatchedDeque.head + let b = len2 |> BatchedDeque.remove 1 |> BatchedDeque.head + ((a = "a") && (b = "b")) |> Expect.isTrue "" } + + test "BatchedDeque.remove elements BatchedDeque.length 3" { + let r0 = (BatchedDeque.ofSeq ["a";"b";"c"]) |> BatchedDeque.remove 0 + let b0 = BatchedDeque.head r0 + let t0 = BatchedDeque.tail r0 + let c0 = BatchedDeque.head t0 + + let r1 = (BatchedDeque.ofSeq ["a";"b";"c"]) |> BatchedDeque.remove 1 + let a1 = BatchedDeque.head r1 + let t1 = BatchedDeque.tail r1 + let c1 = BatchedDeque.head t1 + + let r2 = (BatchedDeque.ofSeq ["a";"b";"c"]) |> BatchedDeque.remove 2 + let a2 = BatchedDeque.head r2 + let t2 = BatchedDeque.tail r2 + let b2 = BatchedDeque.head t2 + + ((b0 = "b") && (c0 = "c") && (a1 = "a") && (c1 = "c") && (a2 = "a") && (b2 = "b")) |> Expect.isTrue "" } + + test "BatchedDeque.remove elements BatchedDeque.length 4" { + let r0 = (BatchedDeque.ofSeq ["a";"b";"c";"d"]) |> BatchedDeque.remove 0 + let b0 = BatchedDeque.head r0 + let t0 = BatchedDeque.tail r0 + let c0 = BatchedDeque.head t0 + let t01 = BatchedDeque.tail t0 + let d0 = BatchedDeque.head t01 + + let r1 = (BatchedDeque.ofSeq ["a";"b";"c";"d"]) |> BatchedDeque.remove 1 + let a1 = BatchedDeque.head r1 + let t11 = BatchedDeque.tail r1 + let c1 = BatchedDeque.head t11 + let t12 = BatchedDeque.tail t11 + let d1 = BatchedDeque.head t12 + + let r2 = (BatchedDeque.ofSeq ["a";"b";"c";"d"]) |> BatchedDeque.remove 2 + let a2 = BatchedDeque.head r2 + let t21 = BatchedDeque.tail r2 + let b2 = BatchedDeque.head t21 + let t22 = BatchedDeque.tail t21 + let c2 = BatchedDeque.head t22 + + let r3 = (BatchedDeque.ofSeq ["a";"b";"c";"d"]) |> BatchedDeque.remove 3 + let a3 = BatchedDeque.head r3 + let t31 = BatchedDeque.tail r3 + let b3 = BatchedDeque.head t31 + let t32 = BatchedDeque.tail t31 + let c3 = BatchedDeque.head t32 + + ((b0 = "b") && (c0 = "c") && (d0 = "d") + && (a1 = "a") && (c1 = "c") && (d1 = "d") + && (a2 = "a") && (b2 = "b") && (c2 = "d") + && (a3 = "a") && (b3 = "b") && (c3 = "c")) |> Expect.isTrue "" } + + test "BatchedDeque.remove elements BatchedDeque.length 5" { + let r0 = (BatchedDeque.ofSeq ["a";"b";"c";"d";"e"]) |> BatchedDeque.remove 0 + let b0 = BatchedDeque.head r0 + let t01 = BatchedDeque.tail r0 + let c0 = BatchedDeque.head t01 + let t02= BatchedDeque.tail t01 + let d0 = BatchedDeque.head t02 + let t03 = BatchedDeque.tail t02 + let e0 = BatchedDeque.head t03 + + let r1 = (BatchedDeque.ofSeq ["a";"b";"c";"d";"e"]) |> BatchedDeque.remove 1 + let a1 = BatchedDeque.head r1 + let t11 = BatchedDeque.tail r1 + let c1 = BatchedDeque.head t11 + let t12 = BatchedDeque.tail t11 + let d1 = BatchedDeque.head t12 + let t13 = BatchedDeque.tail t12 + let e1 = BatchedDeque.head t13 + + let r2 = (BatchedDeque.ofSeq ["a";"b";"c";"d";"e"]) |> BatchedDeque.remove 2 + let a2 = BatchedDeque.head r2 + let t21 = BatchedDeque.tail r2 + let b2 = BatchedDeque.head t21 + let t22 = BatchedDeque.tail t21 + let c2 = BatchedDeque.head t22 + let t23 = BatchedDeque.tail t22 + let e2 = BatchedDeque.head t23 + + let r3 = (BatchedDeque.ofSeq ["a";"b";"c";"d";"e"]) |> BatchedDeque.remove 3 + let a3 = BatchedDeque.head r3 + let t31 = BatchedDeque.tail r3 + let b3 = BatchedDeque.head t31 + let t32 = BatchedDeque.tail t31 + let c3 = BatchedDeque.head t32 + let t33 = BatchedDeque.tail t32 + let e3 = BatchedDeque.head t33 + + let r4 = (BatchedDeque.ofSeq ["a";"b";"c";"d";"e"]) |> BatchedDeque.remove 4 + let a4 = BatchedDeque.head r4 + let t41 = BatchedDeque.tail r4 + let b4 = BatchedDeque.head t41 + let t42 = BatchedDeque.tail t41 + let c4 = BatchedDeque.head t42 + let t43 = BatchedDeque.tail t42 + let d4 = BatchedDeque.head t43 + + ((b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") + && (a1 = "a") && (c1 = "c") && (d1 = "d") && (e1 = "e") + && (a2 = "a") && (b2 = "b") && (c2 = "d") && (e2 = "e") + && (a3 = "a") && (b3 = "b") && (c3 = "c") && (e3 = "e") + && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d")) |> Expect.isTrue "" } + + test "BatchedDeque.remove elements BatchedDeque.length 6" { + let r0 = (BatchedDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> BatchedDeque.remove 0 + let b0 = BatchedDeque.head r0 + let t01 = BatchedDeque.tail r0 + let c0 = BatchedDeque.head t01 + let t02= BatchedDeque.tail t01 + let d0 = BatchedDeque.head t02 + let t03 = BatchedDeque.tail t02 + let e0 = BatchedDeque.head t03 + let t04 = BatchedDeque.tail t03 + let f0 = BatchedDeque.head t04 + + let r1 = (BatchedDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> BatchedDeque.remove 1 + let a1 = BatchedDeque.head r1 + let t11 = BatchedDeque.tail r1 + let c1 = BatchedDeque.head t11 + let t12 = BatchedDeque.tail t11 + let d1 = BatchedDeque.head t12 + let t13 = BatchedDeque.tail t12 + let e1 = BatchedDeque.head t13 + let t14 = BatchedDeque.tail t13 + let f1 = BatchedDeque.head t14 + + let r2 = (BatchedDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> BatchedDeque.remove 2 + let a2 = BatchedDeque.head r2 + let t21 = BatchedDeque.tail r2 + let b2 = BatchedDeque.head t21 + let t22 = BatchedDeque.tail t21 + let c2 = BatchedDeque.head t22 + let t23 = BatchedDeque.tail t22 + let e2 = BatchedDeque.head t23 + let t24 = BatchedDeque.tail t23 + let f2 = BatchedDeque.head t24 + + let r3 = (BatchedDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> BatchedDeque.remove 3 + let a3 = BatchedDeque.head r3 + let t31 = BatchedDeque.tail r3 + let b3 = BatchedDeque.head t31 + let t32 = BatchedDeque.tail t31 + let c3 = BatchedDeque.head t32 + let t33 = BatchedDeque.tail t32 + let e3 = BatchedDeque.head t33 + let t34 = BatchedDeque.tail t33 + let f3 = BatchedDeque.head t34 + + let r4 = (BatchedDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> BatchedDeque.remove 4 + let a4 = BatchedDeque.head r4 + let t41 = BatchedDeque.tail r4 + let b4 = BatchedDeque.head t41 + let t42 = BatchedDeque.tail t41 + let c4 = BatchedDeque.head t42 + let t43 = BatchedDeque.tail t42 + let d4 = BatchedDeque.head t43 + let t44 = BatchedDeque.tail t43 + let f4 = BatchedDeque.head t44 + + let r5 = (BatchedDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> BatchedDeque.remove 5 + let a5 = BatchedDeque.head r5 + let t51 = BatchedDeque.tail r5 + let b5 = BatchedDeque.head t51 + let t52 = BatchedDeque.tail t51 + let c5 = BatchedDeque.head t52 + let t53 = BatchedDeque.tail t52 + let d5 = BatchedDeque.head t53 + let t54 = BatchedDeque.tail t53 + let e5 = BatchedDeque.head t54 + + ((b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") && (f0 = "f") + && (a1 = "a") && (c1 = "c") && (d1 = "d") && (e1 = "e") && (f1 = "f") + && (a2 = "a") && (b2 = "b") && (c2 = "d") && (e2 = "e") && (f2 = "f") + && (a3 = "a") && (b3 = "b") && (c3 = "c") && (e3 = "e") && (f3 = "f") + && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d") && (f4 = "f") + && (a5 = "a") && (b5 = "b") && (c5 = "c") && (d5 = "d") && (e5 = "e")) |> Expect.isTrue "" } + + test "tryRemoveempty" { + BatchedDeque.empty() |>BatchedDeque.tryRemove 0 |> Expect.isNone "" } + + test "BatchedDeque.tryRemove elements BatchedDeque.length 1" { + let a = len1 |> BatchedDeque.tryRemove 0 + a.Value |> BatchedDeque.isEmpty |> Expect.isTrue "" } + + test "BatchedDeque.tryRemove elements BatchedDeque.length 2" { + let a = len2 |> BatchedDeque.tryRemove 0 + let a1 = BatchedDeque.head a.Value + let b = len2 |> BatchedDeque.tryRemove 1 + let b1 = BatchedDeque.head b.Value + ((a1 = "a") && (b1 = "b")) |> Expect.isTrue "" } + + test "BatchedDeque.tryRemove elements BatchedDeque.length 3" { + let x0 = (BatchedDeque.ofSeq ["a";"b";"c"]) |> BatchedDeque.tryRemove 0 + let r0 = x0.Value + let b0 = BatchedDeque.head r0 + let t0 = BatchedDeque.tail r0 + let c0 = BatchedDeque.head t0 + + let x1 = (BatchedDeque.ofSeq ["a";"b";"c"]) |> BatchedDeque.tryRemove 1 + let r1 = x1.Value + let a1 = BatchedDeque.head r1 + let t1 = BatchedDeque.tail r1 + let c1 = BatchedDeque.head t1 + + let x2 = (BatchedDeque.ofSeq ["a";"b";"c"]) |> BatchedDeque.tryRemove 2 + let r2 = x2.Value + let a2 = BatchedDeque.head r2 + let t2 = BatchedDeque.tail r2 + let b2 = BatchedDeque.head t2 + + ((b0 = "b") && (c0 = "c") && (a1 = "a") && (c1 = "c") && (a2 = "a") && (b2 = "b")) |> Expect.isTrue "" } + + test "BatchedDeque.tryRemove elements BatchedDeque.length 4" { + let x0 = (BatchedDeque.ofSeq ["a";"b";"c";"d"]) |> BatchedDeque.tryRemove 0 + let r0 = x0.Value + let b0 = BatchedDeque.head r0 + let t0 = BatchedDeque.tail r0 + let c0 = BatchedDeque.head t0 + let t01 = BatchedDeque.tail t0 + let d0 = BatchedDeque.head t01 + + let x1 = (BatchedDeque.ofSeq ["a";"b";"c";"d"]) |> BatchedDeque.tryRemove 1 + let r1 = x1.Value + let a1 = BatchedDeque.head r1 + let t11 = BatchedDeque.tail r1 + let c1 = BatchedDeque.head t11 + let t12 = BatchedDeque.tail t11 + let d1 = BatchedDeque.head t12 - let x2 = (ofSeq ["a";"b";"c";"d"]) |> tryRemove 2 - let r2 = x2.Value - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 + let x2 = (BatchedDeque.ofSeq ["a";"b";"c";"d"]) |> BatchedDeque.tryRemove 2 + let r2 = x2.Value + let a2 = BatchedDeque.head r2 + let t21 = BatchedDeque.tail r2 + let b2 = BatchedDeque.head t21 + let t22 = BatchedDeque.tail t21 + let c2 = BatchedDeque.head t22 - let x3 = (ofSeq ["a";"b";"c";"d"]) |> tryRemove 3 - let r3 = x3.Value - let a3 = head r3 - let t31 = tail r3 - let b3 = head t31 - let t32 = tail t31 - let c3 = head t32 - - ((b0 = "b") && (c0 = "c") && (d0 = "d") - && (a1 = "a") && (c1 = "c") && (d1 = "d") - && (a2 = "a") && (b2 = "b") && (c2 = "d") - && (a3 = "a") && (b3 = "b") && (c3 = "c")) |> should equal true - -[] -let ``tryRemove elements length 5``() = - let x0 = (ofSeq ["a";"b";"c";"d";"e"]) |> tryRemove 0 - let r0 = x0.Value - let b0 = head r0 - let t01 = tail r0 - let c0 = head t01 - let t02= tail t01 - let d0 = head t02 - let t03 = tail t02 - let e0 = head t03 - - let x1 = (ofSeq ["a";"b";"c";"d";"e"]) |> tryRemove 1 - let r1 = x1.Value - let a1 = head r1 - let t11 = tail r1 - let c1 = head t11 - let t12 = tail t11 - let d1 = head t12 - let t13 = tail t12 - let e1 = head t13 - - let x2 = (ofSeq ["a";"b";"c";"d";"e"]) |> tryRemove 2 - let r2 = x2.Value - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 - let t23 = tail t22 - let e2 = head t23 - - let x3 = (ofSeq ["a";"b";"c";"d";"e"]) |> tryRemove 3 - let r3 = x3.Value - let a3 = head r3 - let t31 = tail r3 - let b3 = head t31 - let t32 = tail t31 - let c3 = head t32 - let t33 = tail t32 - let e3 = head t33 - - let x4 = (ofSeq ["a";"b";"c";"d";"e"]) |> tryRemove 4 - let r4 = x4.Value - let a4 = head r4 - let t41 = tail r4 - let b4 = head t41 - let t42 = tail t41 - let c4 = head t42 - let t43 = tail t42 - let d4 = head t43 - - ((b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") - && (a1 = "a") && (c1 = "c") && (d1 = "d") && (e1 = "e") - && (a2 = "a") && (b2 = "b") && (c2 = "d") && (e2 = "e") - && (a3 = "a") && (b3 = "b") && (c3 = "c") && (e3 = "e") - && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d")) |> should equal true - -[] -let ``tryRemove elements length 6``() = - let x0 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> tryRemove 0 - let r0 = x0.Value - let b0 = head r0 - let t01 = tail r0 - let c0 = head t01 - let t02= tail t01 - let d0 = head t02 - let t03 = tail t02 - let e0 = head t03 - let t04 = tail t03 - let f0 = head t04 - - let x1 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> tryRemove 1 - let r1 =x1.Value - let a1 = head r1 - let t11 = tail r1 - let c1 = head t11 - let t12 = tail t11 - let d1 = head t12 - let t13 = tail t12 - let e1 = head t13 - let t14 = tail t13 - let f1 = head t14 - - let x2 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> tryRemove 2 - let r2 = x2.Value - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 - let t23 = tail t22 - let e2 = head t23 - let t24 = tail t23 - let f2 = head t24 - - let x3 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> tryRemove 3 - let r3 = x3.Value - let a3 = head r3 - let t31 = tail r3 - let b3 = head t31 - let t32 = tail t31 - let c3 = head t32 - let t33 = tail t32 - let e3 = head t33 - let t34 = tail t33 - let f3 = head t34 - - let x4 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> tryRemove 4 - let r4 = x4.Value - let a4 = head r4 - let t41 = tail r4 - let b4 = head t41 - let t42 = tail t41 - let c4 = head t42 - let t43 = tail t42 - let d4 = head t43 - let t44 = tail t43 - let f4 = head t44 - - let x5 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> tryRemove 5 - let r5 = x5.Value - let a5 = head r5 - let t51 = tail r5 - let b5 = head t51 - let t52 = tail t51 - let c5 = head t52 - let t53 = tail t52 - let d5 = head t53 - let t54 = tail t53 - let e5 = head t54 - - ((b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") && (f0 = "f") - && (a1 = "a") && (c1 = "c") && (d1 = "d") && (e1 = "e") && (f1 = "f") - && (a2 = "a") && (b2 = "b") && (c2 = "d") && (e2 = "e") && (f2 = "f") - && (a3 = "a") && (b3 = "b") && (c3 = "c") && (e3 = "e") && (f3 = "f") - && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d") && (f4 = "f") - && (a5 = "a") && (b5 = "b") && (c5 = "c") && (d5 = "d") && (e5 = "e")) |> should equal true - -[] -let ``update elements length 1``() = - len1 |> update 0 "aa" |> head |> should equal "aa" - -[] -let ``update elements length 2``() = - let r0 = (ofSeq ["a";"b"]) |> update 0 "zz" - let a0 = head r0 - let t01 = tail r0 - let b0 = head t01 - - let r1 = (ofSeq ["a";"b"]) |> update 1 "zz" - let a1 = head r1 - let t11 = tail r1 - let b1 = head t11 - - ((a0 = "zz") && (b0 = "b") - && (a1 = "a") && (b1 = "zz")) |> should equal true - -[] -let ``update elements length 3``() = - let r0 = (ofSeq ["a";"b";"c"]) |> update 0 "zz" - let a0 = head r0 - let t01 = tail r0 - let b0 = head t01 - let t02 = tail t01 - let c0 = head t02 - - let r1 = (ofSeq ["a";"b";"c"]) |> update 1 "zz" - let a1 = head r1 - let t11 = tail r1 - let b1 = head t11 - let t12 = tail t11 - let c1 = head t12 - - let r2 = (ofSeq ["a";"b";"c"]) |> update 2 "zz" - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 - - ((a0 = "zz") && (b0 = "b") && (c0 = "c") - && (a1 = "a") && (b1 = "zz") && (c1 = "c") - && (a2 = "a") && (b2 = "b") && (c2 = "zz")) |> should equal true - -[] -let ``update elements length 4``() = - let r0 = (ofSeq ["a";"b";"c";"d"]) |> update 0 "zz" - let a0 = head r0 - let t01 = tail r0 - let b0 = head t01 - let t02 = tail t01 - let c0 = head t02 - let t03 = tail t02 - let d0 = head t03 - - let r1 = (ofSeq ["a";"b";"c";"d"]) |> update 1 "zz" - let a1 = head r1 - let t11 = tail r1 - let b1 = head t11 - let t12 = tail t11 - let c1 = head t12 - let t13 = tail t12 - let d1 = head t13 - - let r2 = (ofSeq ["a";"b";"c";"d"]) |> update 2 "zz" - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 - let t23 = tail t22 - let d2 = head t23 - - let r3 = (ofSeq ["a";"b";"c";"d"]) |> update 3 "zz" - let a3 = head r3 - let t31 = tail r3 - let b3 = head t31 - let t32 = tail t31 - let c3 = head t32 - let t33 = tail t32 - let d3 = head t33 - - ((a0 = "zz") && (b0 = "b") && (c0 = "c") && (d0 = "d") - && (a1 = "a") && (b1 = "zz") && (c1 = "c") && (d1 = "d") - && (a2 = "a") && (b2 = "b") && (c2 = "zz") && (d2 = "d") - && (a3 = "a") && (b3 = "b") && (c3 = "c") && (d3 = "zz")) |> should equal true - -[] -let ``update elements length 5``() = - let r0 = (ofSeq ["a";"b";"c";"d";"e"]) |> update 0 "zz" - let a0 = head r0 - let t01 = tail r0 - let b0 = head t01 - let t02 = tail t01 - let c0 = head t02 - let t03 = tail t02 - let d0 = head t03 - let t04 = tail t03 - let e0 = head t04 - - let r1 = (ofSeq ["a";"b";"c";"d";"e"]) |> update 1 "zz" - let a1 = head r1 - let t11 = tail r1 - let b1 = head t11 - let t12 = tail t11 - let c1 = head t12 - let t13 = tail t12 - let d1 = head t13 - let t14 = tail t13 - let e1 = head t14 - - let r2 = (ofSeq ["a";"b";"c";"d";"e"]) |> update 2 "zz" - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 - let t23 = tail t22 - let d2 = head t23 - let t24 = tail t23 - let e2 = head t24 - - let r3 = (ofSeq ["a";"b";"c";"d";"e"]) |> update 3 "zz" - let a3 = head r3 - let t31 = tail r3 - let b3 = head t31 - let t32 = tail t31 - let c3 = head t32 - let t33 = tail t32 - let d3 = head t33 - let t34 = tail t33 - let e3 = head t34 - - let r4 = (ofSeq ["a";"b";"c";"d";"e"]) |> update 4 "zz" - let a4 = head r4 - let t41 = tail r4 - let b4 = head t41 - let t42 = tail t41 - let c4 = head t42 - let t43 = tail t42 - let d4 = head t43 - let t44 = tail t43 - let e4 = head t44 - - ((a0 = "zz") && (b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") - && (a1 = "a") && (b1 = "zz") && (c1 = "c") && (d1 = "d") && (e1 = "e") - && (a2 = "a") && (b2 = "b") && (c2 = "zz") && (d2 = "d") && (e2 = "e") - && (a3 = "a") && (b3 = "b") && (c3 = "c") && (d3 = "zz") && (e3 = "e") - && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d") && (e4 = "zz")) |> should equal true - -[] -let ``update elements length 6``() = - let r0 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> update 0 "zz" - let a0 = head r0 - let t01 = tail r0 - let b0 = head t01 - let t02 = tail t01 - let c0 = head t02 - let t03 = tail t02 - let d0 = head t03 - let t04 = tail t03 - let e0 = head t04 - let t05 = tail t04 - let f0 = head t05 - - let r1 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> update 1 "zz" - let a1 = head r1 - let t11 = tail r1 - let b1 = head t11 - let t12 = tail t11 - let c1 = head t12 - let t13 = tail t12 - let d1 = head t13 - let t14 = tail t13 - let e1 = head t14 - let t15 = tail t14 - let f1 = head t15 - - let r2 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> update 2 "zz" - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 - let t23 = tail t22 - let d2 = head t23 - let t24 = tail t23 - let e2 = head t24 - let t25 = tail t24 - let f2 = head t25 - - let r3 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> update 3 "zz" - let a3 = head r3 - let t31 = tail r3 - let b3 = head t31 - let t32 = tail t31 - let c3 = head t32 - let t33 = tail t32 - let d3 = head t33 - let t34 = tail t33 - let e3 = head t34 - let t35 = tail t34 - let f3 = head t35 - - let r4 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> update 4 "zz" - let a4 = head r4 - let t41 = tail r4 - let b4 = head t41 - let t42 = tail t41 - let c4 = head t42 - let t43 = tail t42 - let d4 = head t43 - let t44 = tail t43 - let e4 = head t44 - let t45 = tail t44 - let f4 = head t45 - - let r5 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> update 5 "zz" - let a5 = head r5 - let t51 = tail r5 - let b5 = head t51 - let t52 = tail t51 - let c5 = head t52 - let t53 = tail t52 - let d5 = head t53 - let t54 = tail t53 - let e5 = head t54 - let t55 = tail t54 - let f5 = head t55 - - ((a0 = "zz") && (b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") && (f0 = "f") - && (a1 = "a") && (b1 = "zz") && (c1 = "c") && (d1 = "d") && (e1 = "e") && (f1 = "f") - && (a2 = "a") && (b2 = "b") && (c2 = "zz") && (d2 = "d") && (e2 = "e") && (f2 = "f") - && (a3 = "a") && (b3 = "b") && (c3 = "c") && (d3 = "zz") && (e3 = "e") && (f3 = "f") - && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d") && (e4 = "zz") && (f4 = "f") - && (a5 = "a") && (b5 = "b") && (c5 = "c") && (d5 = "d") && (e5 = "e") && (f5 = "zz")) |> should equal true - -[] -let ``tryUpdate elements length 1``() = - let a = len1 |> tryUpdate 0 "aa" - a.Value |> head |> should equal "aa" - -[] -let ``tryUpdate elements length 2``() = - let x0 = (ofSeq ["a";"b"]) |> tryUpdate 0 "zz" - let r0 = x0.Value - let a0 = head r0 - let t01 = tail r0 - let b0 = head t01 - - let x1 = (ofSeq ["a";"b"]) |> tryUpdate 1 "zz" - let r1 = x1.Value - let a1 = head r1 - let t11 = tail r1 - let b1 = head t11 - - ((a0 = "zz") && (b0 = "b") - && (a1 = "a") && (b1 = "zz")) |> should equal true - -[] -let ``tryUpdate elements length 3``() = - let x0 = (ofSeq ["a";"b";"c"]) |> tryUpdate 0 "zz" - let r0 = x0.Value - let a0 = head r0 - let t01 = tail r0 - let b0 = head t01 - let t02 = tail t01 - let c0 = head t02 - - let x1 = (ofSeq ["a";"b";"c"]) |> tryUpdate 1 "zz" - let r1 = x1.Value - let a1 = head r1 - let t11 = tail r1 - let b1 = head t11 - let t12 = tail t11 - let c1 = head t12 - - let x2 = (ofSeq ["a";"b";"c"]) |> tryUpdate 2 "zz" - let r2 = x2.Value - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 - - ((a0 = "zz") && (b0 = "b") && (c0 = "c") - && (a1 = "a") && (b1 = "zz") && (c1 = "c") - && (a2 = "a") && (b2 = "b") && (c2 = "zz")) |> should equal true - -[] -let ``tryUpdate elements length 4``() = - let x0 = (ofSeq ["a";"b";"c";"d"]) |> tryUpdate 0 "zz" - let r0 = x0.Value - let a0 = head r0 - let t01 = tail r0 - let b0 = head t01 - let t02 = tail t01 - let c0 = head t02 - let t03 = tail t02 - let d0 = head t03 - - let x1 = (ofSeq ["a";"b";"c";"d"]) |> tryUpdate 1 "zz" - let r1 = x1.Value - let a1 = head r1 - let t11 = tail r1 - let b1 = head t11 - let t12 = tail t11 - let c1 = head t12 - let t13 = tail t12 - let d1 = head t13 - - let x2 = (ofSeq ["a";"b";"c";"d"]) |> tryUpdate 2 "zz" - let r2 = x2.Value - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 - let t23 = tail t22 - let d2 = head t23 - - let x3 = (ofSeq ["a";"b";"c";"d"]) |> tryUpdate 3 "zz" - let r3 = x3.Value - let a3 = head r3 - let t31 = tail r3 - let b3 = head t31 - let t32 = tail t31 - let c3 = head t32 - let t33 = tail t32 - let d3 = head t33 - - ((a0 = "zz") && (b0 = "b") && (c0 = "c") && (d0 = "d") - && (a1 = "a") && (b1 = "zz") && (c1 = "c") && (d1 = "d") - && (a2 = "a") && (b2 = "b") && (c2 = "zz") && (d2 = "d") - && (a3 = "a") && (b3 = "b") && (c3 = "c") && (d3 = "zz")) |> should equal true - -[] -let ``tryUncons on empty``() = - let q = empty() - (tryUncons q = None) |> should equal true - -[] -let ``tryUncons on q``() = - let q = ofSeq ["a";"b";"c";"d"] - let x, xs = (tryUncons q).Value - x |> should equal "a" - -[] -let ``tryUnsnoc on empty``() = - let q = empty() - (tryUnsnoc q = None) |> should equal true - -[] -let ``tryUnsnoc on q``() = - let q = ofSeq ["a";"b";"c";"d"] - let xs, x = (tryUnsnoc q).Value - x |> should equal "d" - -[] -let ``tryGetHead on empty``() = - let q = empty() - (tryGetHead q = None) |> should equal true - -[] -let ``tryGetHead on q``() = - let q = ofSeq ["a";"b";"c";"d"] - (tryGetHead q).Value |> should equal "a" - -[] -let ``tryGetInit on empty``() = - let q = empty() - (tryGetInit q = None) |> should equal true - -[] -let ``tryGetInit on q``() = - let q = ofSeq ["a";"b";"c";"d"] -// (tryGetInit q).Value |> last |> should equal "c" - let x = (tryGetInit q).Value - let x2 = x|> last - x2 |> should equal "c" - -[] -let ``tryGetLast on empty``() = - let q = empty() - (tryGetLast q = None) |> should equal true - -[] -let ``tryGetLast on q``() = - let q = ofSeq ["a";"b";"c";"d"] - (tryGetLast q).Value |> should equal "d" - - -[] -let ``tryGetTail on empty``() = - let q = empty() - (tryGetTail q = None) |> should equal true - -[] -let ``tryGetTail on q``() = - let q = ofSeq ["a";"b";"c";"d"] - (tryGetTail q).Value |> head |> should equal "b" \ No newline at end of file + let x3 = (BatchedDeque.ofSeq ["a";"b";"c";"d"]) |> BatchedDeque.tryRemove 3 + let r3 = x3.Value + let a3 = BatchedDeque.head r3 + let t31 = BatchedDeque.tail r3 + let b3 = BatchedDeque.head t31 + let t32 = BatchedDeque.tail t31 + let c3 = BatchedDeque.head t32 + + ((b0 = "b") && (c0 = "c") && (d0 = "d") + && (a1 = "a") && (c1 = "c") && (d1 = "d") + && (a2 = "a") && (b2 = "b") && (c2 = "d") + && (a3 = "a") && (b3 = "b") && (c3 = "c")) |> Expect.isTrue "" } + + test "BatchedDeque.tryRemove elements BatchedDeque.length 5" { + let x0 = (BatchedDeque.ofSeq ["a";"b";"c";"d";"e"]) |> BatchedDeque.tryRemove 0 + let r0 = x0.Value + let b0 = BatchedDeque.head r0 + let t01 = BatchedDeque.tail r0 + let c0 = BatchedDeque.head t01 + let t02= BatchedDeque.tail t01 + let d0 = BatchedDeque.head t02 + let t03 = BatchedDeque.tail t02 + let e0 = BatchedDeque.head t03 + + let x1 = (BatchedDeque.ofSeq ["a";"b";"c";"d";"e"]) |> BatchedDeque.tryRemove 1 + let r1 = x1.Value + let a1 = BatchedDeque.head r1 + let t11 = BatchedDeque.tail r1 + let c1 = BatchedDeque.head t11 + let t12 = BatchedDeque.tail t11 + let d1 = BatchedDeque.head t12 + let t13 = BatchedDeque.tail t12 + let e1 = BatchedDeque.head t13 + + let x2 = (BatchedDeque.ofSeq ["a";"b";"c";"d";"e"]) |> BatchedDeque.tryRemove 2 + let r2 = x2.Value + let a2 = BatchedDeque.head r2 + let t21 = BatchedDeque.tail r2 + let b2 = BatchedDeque.head t21 + let t22 = BatchedDeque.tail t21 + let c2 = BatchedDeque.head t22 + let t23 = BatchedDeque.tail t22 + let e2 = BatchedDeque.head t23 + + let x3 = (BatchedDeque.ofSeq ["a";"b";"c";"d";"e"]) |> BatchedDeque.tryRemove 3 + let r3 = x3.Value + let a3 = BatchedDeque.head r3 + let t31 = BatchedDeque.tail r3 + let b3 = BatchedDeque.head t31 + let t32 = BatchedDeque.tail t31 + let c3 = BatchedDeque.head t32 + let t33 = BatchedDeque.tail t32 + let e3 = BatchedDeque.head t33 + + let x4 = (BatchedDeque.ofSeq ["a";"b";"c";"d";"e"]) |> BatchedDeque.tryRemove 4 + let r4 = x4.Value + let a4 = BatchedDeque.head r4 + let t41 = BatchedDeque.tail r4 + let b4 = BatchedDeque.head t41 + let t42 = BatchedDeque.tail t41 + let c4 = BatchedDeque.head t42 + let t43 = BatchedDeque.tail t42 + let d4 = BatchedDeque.head t43 + + ((b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") + && (a1 = "a") && (c1 = "c") && (d1 = "d") && (e1 = "e") + && (a2 = "a") && (b2 = "b") && (c2 = "d") && (e2 = "e") + && (a3 = "a") && (b3 = "b") && (c3 = "c") && (e3 = "e") + && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d")) |> Expect.isTrue "" } + + test "BatchedDeque.tryRemove elements BatchedDeque.length 6" { + let x0 = (BatchedDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> BatchedDeque.tryRemove 0 + let r0 = x0.Value + let b0 = BatchedDeque.head r0 + let t01 = BatchedDeque.tail r0 + let c0 = BatchedDeque.head t01 + let t02= BatchedDeque.tail t01 + let d0 = BatchedDeque.head t02 + let t03 = BatchedDeque.tail t02 + let e0 = BatchedDeque.head t03 + let t04 = BatchedDeque.tail t03 + let f0 = BatchedDeque.head t04 + + let x1 = (BatchedDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> BatchedDeque.tryRemove 1 + let r1 =x1.Value + let a1 = BatchedDeque.head r1 + let t11 = BatchedDeque.tail r1 + let c1 = BatchedDeque.head t11 + let t12 = BatchedDeque.tail t11 + let d1 = BatchedDeque.head t12 + let t13 = BatchedDeque.tail t12 + let e1 = BatchedDeque.head t13 + let t14 = BatchedDeque.tail t13 + let f1 = BatchedDeque.head t14 + + let x2 = (BatchedDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> BatchedDeque.tryRemove 2 + let r2 = x2.Value + let a2 = BatchedDeque.head r2 + let t21 = BatchedDeque.tail r2 + let b2 = BatchedDeque.head t21 + let t22 = BatchedDeque.tail t21 + let c2 = BatchedDeque.head t22 + let t23 = BatchedDeque.tail t22 + let e2 = BatchedDeque.head t23 + let t24 = BatchedDeque.tail t23 + let f2 = BatchedDeque.head t24 + + let x3 = (BatchedDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> BatchedDeque.tryRemove 3 + let r3 = x3.Value + let a3 = BatchedDeque.head r3 + let t31 = BatchedDeque.tail r3 + let b3 = BatchedDeque.head t31 + let t32 = BatchedDeque.tail t31 + let c3 = BatchedDeque.head t32 + let t33 = BatchedDeque.tail t32 + let e3 = BatchedDeque.head t33 + let t34 = BatchedDeque.tail t33 + let f3 = BatchedDeque.head t34 + + let x4 = (BatchedDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> BatchedDeque.tryRemove 4 + let r4 = x4.Value + let a4 = BatchedDeque.head r4 + let t41 = BatchedDeque.tail r4 + let b4 = BatchedDeque.head t41 + let t42 = BatchedDeque.tail t41 + let c4 = BatchedDeque.head t42 + let t43 = BatchedDeque.tail t42 + let d4 = BatchedDeque.head t43 + let t44 = BatchedDeque.tail t43 + let f4 = BatchedDeque.head t44 + + let x5 = (BatchedDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> BatchedDeque.tryRemove 5 + let r5 = x5.Value + let a5 = BatchedDeque.head r5 + let t51 = BatchedDeque.tail r5 + let b5 = BatchedDeque.head t51 + let t52 = BatchedDeque.tail t51 + let c5 = BatchedDeque.head t52 + let t53 = BatchedDeque.tail t52 + let d5 = BatchedDeque.head t53 + let t54 = BatchedDeque.tail t53 + let e5 = BatchedDeque.head t54 + + ((b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") && (f0 = "f") + && (a1 = "a") && (c1 = "c") && (d1 = "d") && (e1 = "e") && (f1 = "f") + && (a2 = "a") && (b2 = "b") && (c2 = "d") && (e2 = "e") && (f2 = "f") + && (a3 = "a") && (b3 = "b") && (c3 = "c") && (e3 = "e") && (f3 = "f") + && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d") && (f4 = "f") + && (a5 = "a") && (b5 = "b") && (c5 = "c") && (d5 = "d") && (e5 = "e")) |> Expect.isTrue "" } + + test "BatchedDeque.update elements BatchedDeque.length 1" { + len1 |> BatchedDeque.update 0 "aa" |> BatchedDeque.head |> Expect.equal "" "aa" } + + test "BatchedDeque.update elements BatchedDeque.length 2" { + let r0 = (BatchedDeque.ofSeq ["a";"b"]) |> BatchedDeque.update 0 "zz" + let a0 = BatchedDeque.head r0 + let t01 = BatchedDeque.tail r0 + let b0 = BatchedDeque.head t01 + + let r1 = (BatchedDeque.ofSeq ["a";"b"]) |> BatchedDeque.update 1 "zz" + let a1 = BatchedDeque.head r1 + let t11 = BatchedDeque.tail r1 + let b1 = BatchedDeque.head t11 + + ((a0 = "zz") && (b0 = "b") + && (a1 = "a") && (b1 = "zz")) |> Expect.isTrue "" } + + test "BatchedDeque.update elements BatchedDeque.length 3" { + let r0 = (BatchedDeque.ofSeq ["a";"b";"c"]) |> BatchedDeque.update 0 "zz" + let a0 = BatchedDeque.head r0 + let t01 = BatchedDeque.tail r0 + let b0 = BatchedDeque.head t01 + let t02 = BatchedDeque.tail t01 + let c0 = BatchedDeque.head t02 + + let r1 = (BatchedDeque.ofSeq ["a";"b";"c"]) |> BatchedDeque.update 1 "zz" + let a1 = BatchedDeque.head r1 + let t11 = BatchedDeque.tail r1 + let b1 = BatchedDeque.head t11 + let t12 = BatchedDeque.tail t11 + let c1 = BatchedDeque.head t12 + + let r2 = (BatchedDeque.ofSeq ["a";"b";"c"]) |> BatchedDeque.update 2 "zz" + let a2 = BatchedDeque.head r2 + let t21 = BatchedDeque.tail r2 + let b2 = BatchedDeque.head t21 + let t22 = BatchedDeque.tail t21 + let c2 = BatchedDeque.head t22 + + ((a0 = "zz") && (b0 = "b") && (c0 = "c") + && (a1 = "a") && (b1 = "zz") && (c1 = "c") + && (a2 = "a") && (b2 = "b") && (c2 = "zz")) |> Expect.isTrue "" } + + test "BatchedDeque.update elements BatchedDeque.length 4" { + let r0 = (BatchedDeque.ofSeq ["a";"b";"c";"d"]) |> BatchedDeque.update 0 "zz" + let a0 = BatchedDeque.head r0 + let t01 = BatchedDeque.tail r0 + let b0 = BatchedDeque.head t01 + let t02 = BatchedDeque.tail t01 + let c0 = BatchedDeque.head t02 + let t03 = BatchedDeque.tail t02 + let d0 = BatchedDeque.head t03 + + let r1 = (BatchedDeque.ofSeq ["a";"b";"c";"d"]) |> BatchedDeque.update 1 "zz" + let a1 = BatchedDeque.head r1 + let t11 = BatchedDeque.tail r1 + let b1 = BatchedDeque.head t11 + let t12 = BatchedDeque.tail t11 + let c1 = BatchedDeque.head t12 + let t13 = BatchedDeque.tail t12 + let d1 = BatchedDeque.head t13 + + let r2 = (BatchedDeque.ofSeq ["a";"b";"c";"d"]) |> BatchedDeque.update 2 "zz" + let a2 = BatchedDeque.head r2 + let t21 = BatchedDeque.tail r2 + let b2 = BatchedDeque.head t21 + let t22 = BatchedDeque.tail t21 + let c2 = BatchedDeque.head t22 + let t23 = BatchedDeque.tail t22 + let d2 = BatchedDeque.head t23 + + let r3 = (BatchedDeque.ofSeq ["a";"b";"c";"d"]) |> BatchedDeque.update 3 "zz" + let a3 = BatchedDeque.head r3 + let t31 = BatchedDeque.tail r3 + let b3 = BatchedDeque.head t31 + let t32 = BatchedDeque.tail t31 + let c3 = BatchedDeque.head t32 + let t33 = BatchedDeque.tail t32 + let d3 = BatchedDeque.head t33 + + ((a0 = "zz") && (b0 = "b") && (c0 = "c") && (d0 = "d") + && (a1 = "a") && (b1 = "zz") && (c1 = "c") && (d1 = "d") + && (a2 = "a") && (b2 = "b") && (c2 = "zz") && (d2 = "d") + && (a3 = "a") && (b3 = "b") && (c3 = "c") && (d3 = "zz")) |> Expect.isTrue "" } + + test "BatchedDeque.update elements BatchedDeque.length 5" { + let r0 = (BatchedDeque.ofSeq ["a";"b";"c";"d";"e"]) |> BatchedDeque.update 0 "zz" + let a0 = BatchedDeque.head r0 + let t01 = BatchedDeque.tail r0 + let b0 = BatchedDeque.head t01 + let t02 = BatchedDeque.tail t01 + let c0 = BatchedDeque.head t02 + let t03 = BatchedDeque.tail t02 + let d0 = BatchedDeque.head t03 + let t04 = BatchedDeque.tail t03 + let e0 = BatchedDeque.head t04 + + let r1 = (BatchedDeque.ofSeq ["a";"b";"c";"d";"e"]) |> BatchedDeque.update 1 "zz" + let a1 = BatchedDeque.head r1 + let t11 = BatchedDeque.tail r1 + let b1 = BatchedDeque.head t11 + let t12 = BatchedDeque.tail t11 + let c1 = BatchedDeque.head t12 + let t13 = BatchedDeque.tail t12 + let d1 = BatchedDeque.head t13 + let t14 = BatchedDeque.tail t13 + let e1 = BatchedDeque.head t14 + + let r2 = (BatchedDeque.ofSeq ["a";"b";"c";"d";"e"]) |> BatchedDeque.update 2 "zz" + let a2 = BatchedDeque.head r2 + let t21 = BatchedDeque.tail r2 + let b2 = BatchedDeque.head t21 + let t22 = BatchedDeque.tail t21 + let c2 = BatchedDeque.head t22 + let t23 = BatchedDeque.tail t22 + let d2 = BatchedDeque.head t23 + let t24 = BatchedDeque.tail t23 + let e2 = BatchedDeque.head t24 + + let r3 = (BatchedDeque.ofSeq ["a";"b";"c";"d";"e"]) |> BatchedDeque.update 3 "zz" + let a3 = BatchedDeque.head r3 + let t31 = BatchedDeque.tail r3 + let b3 = BatchedDeque.head t31 + let t32 = BatchedDeque.tail t31 + let c3 = BatchedDeque.head t32 + let t33 = BatchedDeque.tail t32 + let d3 = BatchedDeque.head t33 + let t34 = BatchedDeque.tail t33 + let e3 = BatchedDeque.head t34 + + let r4 = (BatchedDeque.ofSeq ["a";"b";"c";"d";"e"]) |> BatchedDeque.update 4 "zz" + let a4 = BatchedDeque.head r4 + let t41 = BatchedDeque.tail r4 + let b4 = BatchedDeque.head t41 + let t42 = BatchedDeque.tail t41 + let c4 = BatchedDeque.head t42 + let t43 = BatchedDeque.tail t42 + let d4 = BatchedDeque.head t43 + let t44 = BatchedDeque.tail t43 + let e4 = BatchedDeque.head t44 + + ((a0 = "zz") && (b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") + && (a1 = "a") && (b1 = "zz") && (c1 = "c") && (d1 = "d") && (e1 = "e") + && (a2 = "a") && (b2 = "b") && (c2 = "zz") && (d2 = "d") && (e2 = "e") + && (a3 = "a") && (b3 = "b") && (c3 = "c") && (d3 = "zz") && (e3 = "e") + && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d") && (e4 = "zz")) |> Expect.isTrue "" } + + test "BatchedDeque.update elements BatchedDeque.length 6" { + let r0 = (BatchedDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> BatchedDeque.update 0 "zz" + let a0 = BatchedDeque.head r0 + let t01 = BatchedDeque.tail r0 + let b0 = BatchedDeque.head t01 + let t02 = BatchedDeque.tail t01 + let c0 = BatchedDeque.head t02 + let t03 = BatchedDeque.tail t02 + let d0 = BatchedDeque.head t03 + let t04 = BatchedDeque.tail t03 + let e0 = BatchedDeque.head t04 + let t05 = BatchedDeque.tail t04 + let f0 = BatchedDeque.head t05 + + let r1 = (BatchedDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> BatchedDeque.update 1 "zz" + let a1 = BatchedDeque.head r1 + let t11 = BatchedDeque.tail r1 + let b1 = BatchedDeque.head t11 + let t12 = BatchedDeque.tail t11 + let c1 = BatchedDeque.head t12 + let t13 = BatchedDeque.tail t12 + let d1 = BatchedDeque.head t13 + let t14 = BatchedDeque.tail t13 + let e1 = BatchedDeque.head t14 + let t15 = BatchedDeque.tail t14 + let f1 = BatchedDeque.head t15 + + let r2 = (BatchedDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> BatchedDeque.update 2 "zz" + let a2 = BatchedDeque.head r2 + let t21 = BatchedDeque.tail r2 + let b2 = BatchedDeque.head t21 + let t22 = BatchedDeque.tail t21 + let c2 = BatchedDeque.head t22 + let t23 = BatchedDeque.tail t22 + let d2 = BatchedDeque.head t23 + let t24 = BatchedDeque.tail t23 + let e2 = BatchedDeque.head t24 + let t25 = BatchedDeque.tail t24 + let f2 = BatchedDeque.head t25 + + let r3 = (BatchedDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> BatchedDeque.update 3 "zz" + let a3 = BatchedDeque.head r3 + let t31 = BatchedDeque.tail r3 + let b3 = BatchedDeque.head t31 + let t32 = BatchedDeque.tail t31 + let c3 = BatchedDeque.head t32 + let t33 = BatchedDeque.tail t32 + let d3 = BatchedDeque.head t33 + let t34 = BatchedDeque.tail t33 + let e3 = BatchedDeque.head t34 + let t35 = BatchedDeque.tail t34 + let f3 = BatchedDeque.head t35 + + let r4 = (BatchedDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> BatchedDeque.update 4 "zz" + let a4 = BatchedDeque.head r4 + let t41 = BatchedDeque.tail r4 + let b4 = BatchedDeque.head t41 + let t42 = BatchedDeque.tail t41 + let c4 = BatchedDeque.head t42 + let t43 = BatchedDeque.tail t42 + let d4 = BatchedDeque.head t43 + let t44 = BatchedDeque.tail t43 + let e4 = BatchedDeque.head t44 + let t45 = BatchedDeque.tail t44 + let f4 = BatchedDeque.head t45 + + let r5 = (BatchedDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> BatchedDeque.update 5 "zz" + let a5 = BatchedDeque.head r5 + let t51 = BatchedDeque.tail r5 + let b5 = BatchedDeque.head t51 + let t52 = BatchedDeque.tail t51 + let c5 = BatchedDeque.head t52 + let t53 = BatchedDeque.tail t52 + let d5 = BatchedDeque.head t53 + let t54 = BatchedDeque.tail t53 + let e5 = BatchedDeque.head t54 + let t55 = BatchedDeque.tail t54 + let f5 = BatchedDeque.head t55 + + ((a0 = "zz") && (b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") && (f0 = "f") + && (a1 = "a") && (b1 = "zz") && (c1 = "c") && (d1 = "d") && (e1 = "e") && (f1 = "f") + && (a2 = "a") && (b2 = "b") && (c2 = "zz") && (d2 = "d") && (e2 = "e") && (f2 = "f") + && (a3 = "a") && (b3 = "b") && (c3 = "c") && (d3 = "zz") && (e3 = "e") && (f3 = "f") + && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d") && (e4 = "zz") && (f4 = "f") + && (a5 = "a") && (b5 = "b") && (c5 = "c") && (d5 = "d") && (e5 = "e") && (f5 = "zz")) |> Expect.isTrue "" } + + test "BatchedDeque.tryUpdate elements BatchedDeque.length 1" { + let a = len1 |> BatchedDeque.tryUpdate 0 "aa" + a.Value |> BatchedDeque.head |> Expect.equal "" "aa" } + + test "BatchedDeque.tryUpdate elements BatchedDeque.length 2" { + let x0 = (BatchedDeque.ofSeq ["a";"b"]) |> BatchedDeque.tryUpdate 0 "zz" + let r0 = x0.Value + let a0 = BatchedDeque.head r0 + let t01 = BatchedDeque.tail r0 + let b0 = BatchedDeque.head t01 + + let x1 = (BatchedDeque.ofSeq ["a";"b"]) |> BatchedDeque.tryUpdate 1 "zz" + let r1 = x1.Value + let a1 = BatchedDeque.head r1 + let t11 = BatchedDeque.tail r1 + let b1 = BatchedDeque.head t11 + + ((a0 = "zz") && (b0 = "b") + && (a1 = "a") && (b1 = "zz")) |> Expect.isTrue "" } + + test "BatchedDeque.tryUpdate elements BatchedDeque.length 3" { + let x0 = (BatchedDeque.ofSeq ["a";"b";"c"]) |> BatchedDeque.tryUpdate 0 "zz" + let r0 = x0.Value + let a0 = BatchedDeque.head r0 + let t01 = BatchedDeque.tail r0 + let b0 = BatchedDeque.head t01 + let t02 = BatchedDeque.tail t01 + let c0 = BatchedDeque.head t02 + + let x1 = (BatchedDeque.ofSeq ["a";"b";"c"]) |> BatchedDeque.tryUpdate 1 "zz" + let r1 = x1.Value + let a1 = BatchedDeque.head r1 + let t11 = BatchedDeque.tail r1 + let b1 = BatchedDeque.head t11 + let t12 = BatchedDeque.tail t11 + let c1 = BatchedDeque.head t12 + + let x2 = (BatchedDeque.ofSeq ["a";"b";"c"]) |> BatchedDeque.tryUpdate 2 "zz" + let r2 = x2.Value + let a2 = BatchedDeque.head r2 + let t21 = BatchedDeque.tail r2 + let b2 = BatchedDeque.head t21 + let t22 = BatchedDeque.tail t21 + let c2 = BatchedDeque.head t22 + + ((a0 = "zz") && (b0 = "b") && (c0 = "c") + && (a1 = "a") && (b1 = "zz") && (c1 = "c") + && (a2 = "a") && (b2 = "b") && (c2 = "zz")) |> Expect.isTrue "" } + + test "BatchedDeque.tryUpdate elements BatchedDeque.length 4" { + let x0 = (BatchedDeque.ofSeq ["a";"b";"c";"d"]) |> BatchedDeque.tryUpdate 0 "zz" + let r0 = x0.Value + let a0 = BatchedDeque.head r0 + let t01 = BatchedDeque.tail r0 + let b0 = BatchedDeque.head t01 + let t02 = BatchedDeque.tail t01 + let c0 = BatchedDeque.head t02 + let t03 = BatchedDeque.tail t02 + let d0 = BatchedDeque.head t03 + + let x1 = (BatchedDeque.ofSeq ["a";"b";"c";"d"]) |> BatchedDeque.tryUpdate 1 "zz" + let r1 = x1.Value + let a1 = BatchedDeque.head r1 + let t11 = BatchedDeque.tail r1 + let b1 = BatchedDeque.head t11 + let t12 = BatchedDeque.tail t11 + let c1 = BatchedDeque.head t12 + let t13 = BatchedDeque.tail t12 + let d1 = BatchedDeque.head t13 + + let x2 = (BatchedDeque.ofSeq ["a";"b";"c";"d"]) |> BatchedDeque.tryUpdate 2 "zz" + let r2 = x2.Value + let a2 = BatchedDeque.head r2 + let t21 = BatchedDeque.tail r2 + let b2 = BatchedDeque.head t21 + let t22 = BatchedDeque.tail t21 + let c2 = BatchedDeque.head t22 + let t23 = BatchedDeque.tail t22 + let d2 = BatchedDeque.head t23 + + let x3 = (BatchedDeque.ofSeq ["a";"b";"c";"d"]) |> BatchedDeque.tryUpdate 3 "zz" + let r3 = x3.Value + let a3 = BatchedDeque.head r3 + let t31 = BatchedDeque.tail r3 + let b3 = BatchedDeque.head t31 + let t32 = BatchedDeque.tail t31 + let c3 = BatchedDeque.head t32 + let t33 = BatchedDeque.tail t32 + let d3 = BatchedDeque.head t33 + + ((a0 = "zz") && (b0 = "b") && (c0 = "c") && (d0 = "d") + && (a1 = "a") && (b1 = "zz") && (c1 = "c") && (d1 = "d") + && (a2 = "a") && (b2 = "b") && (c2 = "zz") && (d2 = "d") + && (a3 = "a") && (b3 = "b") && (c3 = "c") && (d3 = "zz")) |> Expect.isTrue "" } + + test "BatchedDeque.tryUncons on empty" { + let q = BatchedDeque.empty() + (BatchedDeque.tryUncons q = None) |> Expect.isTrue "" } + + test "BatchedDeque.tryUncons on q" { + let q = BatchedDeque.ofSeq ["a";"b";"c";"d"] + let x, xs = (BatchedDeque.tryUncons q).Value + x |> Expect.equal "" "a" } + + test "BatchedDeque.tryUnsnoc on empty" { + let q = BatchedDeque.empty() + (BatchedDeque.tryUnsnoc q = None) |> Expect.isTrue "" } + + test "BatchedDeque.tryUnsnoc on q" { + let q = BatchedDeque.ofSeq ["a";"b";"c";"d"] + let xs, x = (BatchedDeque.tryUnsnoc q).Value + x |> Expect.equal "" "d" } + + test "BatchedDeque.tryGetHead on empty" { + let q = BatchedDeque.empty() + (BatchedDeque.tryGetHead q = None) |> Expect.isTrue "" } + + test "BatchedDeque.tryGetHead on q" { + let q = BatchedDeque.ofSeq ["a";"b";"c";"d"] + (BatchedDeque.tryGetHead q).Value |> Expect.equal "" "a" } + + test "BatchedDeque.tryGetInit on empty" { + let q = BatchedDeque.empty() + (BatchedDeque.tryGetInit q = None) |> Expect.isTrue "" } + + test "BatchedDeque.tryGetInit on q" { + let q = BatchedDeque.ofSeq ["a";"b";"c";"d"] + let x = (BatchedDeque.tryGetInit q).Value + let x2 = x|> BatchedDeque.last + x2 |> Expect.equal "" "c" } + + test "BatchedDeque.tryGetLast on empty" { + let q = BatchedDeque.empty() + (BatchedDeque.tryGetLast q = None) |> Expect.isTrue "" } + + test "BatchedDeque.tryGetLast on q" { + let q = BatchedDeque.ofSeq ["a";"b";"c";"d"] + (BatchedDeque.tryGetLast q).Value |> Expect.equal "" "d" } + + + test "BatchedDeque.tryGetTail on empty" { + let q = BatchedDeque.empty() + (BatchedDeque.tryGetTail q = None) |> Expect.isTrue "" } + + test "BatchedDeque.tryGetTail on q" { + let q = BatchedDeque.ofSeq ["a";"b";"c";"d"] + (BatchedDeque.tryGetTail q).Value |> BatchedDeque.head |> Expect.equal "" "b" } + ] \ No newline at end of file diff --git a/tests/FSharpx.Collections.Experimental.Tests/BinaryRandomAccessListTest.fs b/tests/FSharpx.Collections.Experimental.Tests/BinaryRandomAccessListTest.fs index d9e4b1a1..fe118243 100644 --- a/tests/FSharpx.Collections.Experimental.Tests/BinaryRandomAccessListTest.fs +++ b/tests/FSharpx.Collections.Experimental.Tests/BinaryRandomAccessListTest.fs @@ -1,458 +1,399 @@ -module FSharpx.Collections.Experimental.Tests.BinaryRandomAccessListTest +namespace FSharpx.Collections.Experimental.Tests -open System open FSharpx.Collections open FSharpx.Collections.Experimental -open FSharpx.Collections.Experimental.BinaryRandomAccessList -open NUnit.Framework -open FsUnit - +open Expecto +open Expecto.Flip //only going up to len5 is probably sufficient to test all edge cases //but better too many unit tests than too few -let len1 = empty() |> cons "a" -let len2 = empty() |> cons "a" |> cons "b" -let len3 = empty() |> cons "a" |> cons "b" |> cons "c" -let len4 = empty() |> cons "a" |> cons "b" |> cons "c" |> cons "d" -let len5 = empty() |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" -let len6 = empty() |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" -let len7 = empty() |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" -let len8 = empty() |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" -let len9 = empty() |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" |> cons "i" -let lena = empty() |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" |> cons "i" |> cons "j" - -[] -let ``empty list should be empty``() = - empty() |> isEmpty |> should equal true - -[] -let ``cons works``() = - empty()|> cons 1 |> cons 2 |> isEmpty |> should equal false - -[] -let ``uncons 1 element``() = - let x, _ = empty() |> cons 1 |> uncons - (x = 1) |> should equal true - -[] -let ``uncons 2 elements``() = - let x, _ = empty() |> cons 1 |> cons 2 |> uncons - (x = 2) |> should equal true - -[] -let ``uncons 3 elements``() = - let x, _ = empty() |> cons 1 |> cons 2 |> cons 3 |> uncons - (x = 3) |> should equal true - -[] -let ``tryUncons 1 element``() = - let x = empty() |> cons 1 |> tryUncons - (fst(x.Value) = 1) |> should equal true - -[] -let ``tryUncons 2 elements``() = - let x = empty() |> cons 1 |> cons 2 |> tryUncons - (fst(x.Value) = 2) |> should equal true - -[] -let ``tryUncons 3 elements``() = - let x = empty() |> cons 1 |> cons 2 |> cons 3 |> tryUncons - (fst(x.Value) = 3) |> should equal true - -[] -let ``tryUncons empty``() = - empty() |> tryUncons |> should equal None +module BinaryRandomAccessListTest = + + let len1 = BinaryRandomAccessList.empty() |> BinaryRandomAccessList.cons "a" + let len2 = BinaryRandomAccessList.empty() |> BinaryRandomAccessList.cons "a" |> BinaryRandomAccessList.cons "b" + let len3 = BinaryRandomAccessList.empty() |> BinaryRandomAccessList.cons "a" |> BinaryRandomAccessList.cons "b" |> BinaryRandomAccessList.cons "c" + let len4 = BinaryRandomAccessList.empty() |> BinaryRandomAccessList.cons "a" |> BinaryRandomAccessList.cons "b" |> BinaryRandomAccessList.cons "c" |> BinaryRandomAccessList.cons "d" + let len5 = BinaryRandomAccessList.empty() |> BinaryRandomAccessList.cons "a" |> BinaryRandomAccessList.cons "b" |> BinaryRandomAccessList.cons "c" |> BinaryRandomAccessList.cons "d" |> BinaryRandomAccessList.cons "e" + let len6 = BinaryRandomAccessList.empty() |> BinaryRandomAccessList.cons "a" |> BinaryRandomAccessList.cons "b" |> BinaryRandomAccessList.cons "c" |> BinaryRandomAccessList.cons "d" |> BinaryRandomAccessList.cons "e" |> BinaryRandomAccessList.cons "f" + let len7 = BinaryRandomAccessList.empty() |> BinaryRandomAccessList.cons "a" |> BinaryRandomAccessList.cons "b" |> BinaryRandomAccessList.cons "c" |> BinaryRandomAccessList.cons "d" |> BinaryRandomAccessList.cons "e" |> BinaryRandomAccessList.cons "f" |> BinaryRandomAccessList.cons "g" + let len8 = BinaryRandomAccessList.empty() |> BinaryRandomAccessList.cons "a" |> BinaryRandomAccessList.cons "b" |> BinaryRandomAccessList.cons "c" |> BinaryRandomAccessList.cons "d" |> BinaryRandomAccessList.cons "e" |> BinaryRandomAccessList.cons "f" |> BinaryRandomAccessList.cons "g" |> BinaryRandomAccessList.cons "h" + let len9 = BinaryRandomAccessList.empty() |> BinaryRandomAccessList.cons "a" |> BinaryRandomAccessList.cons "b" |> BinaryRandomAccessList.cons "c" |> BinaryRandomAccessList.cons "d" |> BinaryRandomAccessList.cons "e" |> BinaryRandomAccessList.cons "f" |> BinaryRandomAccessList.cons "g" |> BinaryRandomAccessList.cons "h" |> BinaryRandomAccessList.cons "i" + let lena = BinaryRandomAccessList.empty() |> BinaryRandomAccessList.cons "a" |> BinaryRandomAccessList.cons "b" |> BinaryRandomAccessList.cons "c" |> BinaryRandomAccessList.cons "d" |> BinaryRandomAccessList.cons "e" |> BinaryRandomAccessList.cons "f" |> BinaryRandomAccessList.cons "g" |> BinaryRandomAccessList.cons "h" |> BinaryRandomAccessList.cons "i" |> BinaryRandomAccessList.cons "j" + + [] + let testBinaryRandomAccessList = + + testList "Experimental BinaryRandomAccessList" [ + test "empty list should be empty" { + BinaryRandomAccessList.empty() |> BinaryRandomAccessList.isEmpty |> Expect.isTrue "" } + + test "BinaryRandomAccessList.cons works" { + BinaryRandomAccessList.empty()|> BinaryRandomAccessList.cons 1 |> BinaryRandomAccessList.cons 2 |> BinaryRandomAccessList.isEmpty |> Expect.isFalse "" } + + test "BinaryRandomAccessList.uncons 1 element" { + let x, _ = BinaryRandomAccessList.empty() |> BinaryRandomAccessList.cons 1 |> BinaryRandomAccessList.uncons + (x = 1) |> Expect.isTrue "" } + + test "BinaryRandomAccessList.uncons 2 elements" { + let x, _ = BinaryRandomAccessList.empty() |> BinaryRandomAccessList.cons 1 |> BinaryRandomAccessList.cons 2 |> BinaryRandomAccessList.uncons + (x = 2) |> Expect.isTrue "" } + + test "BinaryRandomAccessList.uncons 3 elements" { + let x, _ = BinaryRandomAccessList.empty() |> BinaryRandomAccessList.cons 1 |> BinaryRandomAccessList.cons 2 |> BinaryRandomAccessList.cons 3 |> BinaryRandomAccessList.uncons + (x = 3) |> Expect.isTrue "" } + + test "BinaryRandomAccessList.tryUncons 1 element" { + let x = BinaryRandomAccessList.empty() |> BinaryRandomAccessList.cons 1 |> BinaryRandomAccessList.tryUncons + (fst(x.Value) = 1) |> Expect.isTrue "" } + + test "BinaryRandomAccessList.tryUncons 2 elements" { + let x = BinaryRandomAccessList.empty() |> BinaryRandomAccessList.cons 1 |> BinaryRandomAccessList.cons 2 |> BinaryRandomAccessList.tryUncons + (fst(x.Value) = 2) |> Expect.isTrue "" } + + test "BinaryRandomAccessList.tryUncons 3 elements" { + let x = BinaryRandomAccessList.empty() |> BinaryRandomAccessList.cons 1 |> BinaryRandomAccessList.cons 2 |> BinaryRandomAccessList.cons 3 |> BinaryRandomAccessList.tryUncons + (fst(x.Value) = 3) |> Expect.isTrue "" } + + test "BinaryRandomAccessList.tryUncons empty" { + BinaryRandomAccessList.empty() |> BinaryRandomAccessList.tryUncons |> Expect.isNone "" } -[] -let ``head should return``() = - let x = empty() |> cons 1 |> cons 2 |> head - x |> should equal 2 - -[] -let ``tryGetHead should return``() = - let x = empty() |> cons 1 |> cons 2 |> tryGetHead - x.Value |> should equal 2 - -[] -let ``tryGetHead on empty should return None``() = - empty() |> tryGetHead |> should equal None - -[] -let ``tryGetTail on empty should return None``() = - empty() |> tryGetTail |> should equal None - -[] -let ``tryGetTail on len 1 should return Some empty``() = - let x = (empty() |> cons 1 |> tryGetTail).Value - x |> isEmpty |> should equal true - -[] -let ``tail on len 2 should return``() = - empty() |> cons 1 |> cons 2 |> tail |> head |> should equal 1 - -[] -let ``tryGetTail on len 2 should return``() = - let a = empty() |> cons 1 |> cons 2 |> tryGetTail - ((head a.Value) = 1) |> should equal true - -[] -let ``lookup length 1``() = - len1 |> lookup 0 |> should equal "a" - -[] -let ``rev empty``() = - isEmpty (empty() |> rev) |> should equal true + test "BinaryRandomAccessList.head should return" { + let x = BinaryRandomAccessList.empty() |> BinaryRandomAccessList.cons 1 |> BinaryRandomAccessList.cons 2 |> BinaryRandomAccessList.head + x |> Expect.equal "" 2 } + + test "BinaryRandomAccessList.tryGetHead should return" { + let x = BinaryRandomAccessList.empty() |> BinaryRandomAccessList.cons 1 |> BinaryRandomAccessList.cons 2 |> BinaryRandomAccessList.tryGetHead + x.Value |> Expect.equal "" 2 } + + test "BinaryRandomAccessList.tryGetHead on empty should return None" { + BinaryRandomAccessList.empty() |> BinaryRandomAccessList.tryGetHead |> Expect.isNone "" } + + test "BinaryRandomAccessList.tryGetTail on empty should return None" { + BinaryRandomAccessList.empty() |> BinaryRandomAccessList.tryGetTail |> Expect.isNone "" } + + test "BinaryRandomAccessList.tryGetTail on len 1 should return Some empty" { + let x = (BinaryRandomAccessList.empty() |> BinaryRandomAccessList.cons 1 |> BinaryRandomAccessList.tryGetTail).Value + x |> BinaryRandomAccessList.isEmpty |> Expect.isTrue "" } + + test "BinaryRandomAccessList.tail on len 2 should return" { + BinaryRandomAccessList.empty() |> BinaryRandomAccessList.cons 1 |> BinaryRandomAccessList.cons 2 |> BinaryRandomAccessList.tail |> BinaryRandomAccessList.head |> Expect.equal "" 1} + + test "BinaryRandomAccessList.tryGetTail on len 2 should return" { + let a = BinaryRandomAccessList.empty() |> BinaryRandomAccessList.cons 1 |> BinaryRandomAccessList.cons 2 |> BinaryRandomAccessList.tryGetTail + ((BinaryRandomAccessList.head a.Value) = 1) |> Expect.isTrue "" } + + test "BinaryRandomAccessList.lookup BinaryRandomAccessList.length 1" { + len1 |> BinaryRandomAccessList.lookup 0 |> Expect.equal "" "a"} + + test "BinaryRandomAccessList.rev empty" { + BinaryRandomAccessList.isEmpty (BinaryRandomAccessList.empty() |> BinaryRandomAccessList.rev) |> Expect.isTrue "" } -[] -let ``rev elements length 5``() = - let a = ofSeq ["a";"b";"c";"d";"e"] - - let b = rev a - - let c = List.ofSeq b - - c.Head |> should equal "e" - -[] -let ``lookup length 2``() = - (((len2 |> lookup 0) = "b") && ((len2 |> lookup 1) = "a")) |> should equal true - -[] -let ``lookup length 3``() = - (((len3 |> lookup 0) = "c") && ((len3 |> lookup 1) = "b") && ((len3 |> lookup 2) = "a")) |> should equal true - -[] -let ``lookup length 4``() = - (((len4 |> lookup 0) = "d") && ((len4 |> lookup 1) = "c") && ((len4 |> lookup 2) = "b") && ((len4 |> lookup 3) = "a")) - |> should equal true - -[] -let ``lookup length 5``() = - (((len5 |> lookup 0) = "e") && ((len5 |> lookup 1) = "d") && ((len5 |> lookup 2) = "c") && ((len5 |> lookup 3) = "b") - && ((len5 |> lookup 4) = "a")) |> should equal true - -[] -let ``lookup length 6``() = - (((len6 |> lookup 0) = "f") && ((len6 |> lookup 1) = "e") && ((len6 |> lookup 2) = "d") && ((len6 |> lookup 3) = "c") - && ((len6 |> lookup 4) = "b") && ((len6 |> lookup 5) = "a")) |> should equal true - -[] -let ``lookup length 7``() = - (((len7 |> lookup 0) = "g") && ((len7 |> lookup 1) = "f") && ((len7 |> lookup 2) = "e") && ((len7 |> lookup 3) = "d") - && ((len7 |> lookup 4) = "c") && ((len7 |> lookup 5) = "b") && ((len7 |> lookup 6) = "a")) |> should equal true - -[] -let ``lookup length 8``() = - (((len8 |> lookup 0) = "h") && ((len8 |> lookup 1) = "g") && ((len8 |> lookup 2) = "f") && ((len8 |> lookup 3) = "e") - && ((len8 |> lookup 4) = "d") && ((len8 |> lookup 5) = "c") && ((len8 |> lookup 6) = "b") && ((len8 |> lookup 7) = "a")) - |> should equal true - -[] -let ``lookup length 9``() = - (((len9 |> lookup 0) = "i") && ((len9 |> lookup 1) = "h") && ((len9 |> lookup 2) = "g") && ((len9 |> lookup 3) = "f") - && ((len9 |> lookup 4) = "e") && ((len9 |> lookup 5) = "d") && ((len9 |> lookup 6) = "c") && ((len9 |> lookup 7) = "b") - && ((len9 |> lookup 8) = "a")) |> should equal true - -[] -let ``lookup length 10``() = - (((lena |> lookup 0) = "j") && ((lena |> lookup 1) = "i") && ((lena |> lookup 2) = "h") && ((lena |> lookup 3) = "g") - && ((lena |> lookup 4) = "f") && ((lena |> lookup 5) = "e") && ((lena |> lookup 6) = "d") && ((lena |> lookup 7) = "c") - && ((lena |> lookup 8) = "b") && ((lena |> lookup 9) = "a")) |> should equal true - -[] -let ``tryLookup length 1``() = - let a = len1 |> tryLookup 0 - (a.Value = "a") |> should equal true - -[] -let ``tryLookup length 2``() = - let b = len2 |> tryLookup 0 - let a = len2 |> tryLookup 1 - ((b.Value = "b") && (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 3``() = - let c = len3 |> tryLookup 0 - let b = len3 |> tryLookup 1 - let a = len3 |> tryLookup 2 - ((c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 4``() = - let d = len4 |> tryLookup 0 - let c = len4 |> tryLookup 1 - let b = len4 |> tryLookup 2 - let a = len4 |> tryLookup 3 - ((d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 5``() = - let e = len5 |> tryLookup 0 - let d = len5 |> tryLookup 1 - let c = len5 |> tryLookup 2 - let b = len5 |> tryLookup 3 - let a = len5 |> tryLookup 4 - ((e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 6``() = - let f = len6 |> tryLookup 0 - let e = len6 |> tryLookup 1 - let d = len6 |> tryLookup 2 - let c = len6 |> tryLookup 3 - let b = len6 |> tryLookup 4 - let a = len6 |> tryLookup 5 - ((f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) - |> should equal true - -[] -let ``tryLookup length 7``() = - let g = len7 |> tryLookup 0 - let f = len7 |> tryLookup 1 - let e = len7 |> tryLookup 2 - let d = len7 |> tryLookup 3 - let c = len7 |> tryLookup 4 - let b = len7 |> tryLookup 5 - let a = len7 |> tryLookup 6 - ((g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") - && (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 8``() = - let h = len8 |> tryLookup 0 - let g = len8 |> tryLookup 1 - let f = len8 |> tryLookup 2 - let e = len8 |> tryLookup 3 - let d = len8 |> tryLookup 4 - let c = len8 |> tryLookup 5 - let b = len8 |> tryLookup 6 - let a = len8 |> tryLookup 7 - ((h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") - && (b.Value = "b")&& (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 9``() = - let i = len9 |> tryLookup 0 - let h = len9 |> tryLookup 1 - let g = len9 |> tryLookup 2 - let f = len9 |> tryLookup 3 - let e = len9 |> tryLookup 4 - let d = len9 |> tryLookup 5 - let c = len9 |> tryLookup 6 - let b = len9 |> tryLookup 7 - let a = len9 |> tryLookup 8 - ((i.Value = "i") && (h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") - && (c.Value = "c") && (b.Value = "b")&& (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 10``() = - let j = lena |> tryLookup 0 - let i = lena |> tryLookup 1 - let h = lena |> tryLookup 2 - let g = lena |> tryLookup 3 - let f = lena |> tryLookup 4 - let e = lena |> tryLookup 5 - let d = lena |> tryLookup 6 - let c = lena |> tryLookup 7 - let b = lena |> tryLookup 8 - let a = lena |> tryLookup 9 - ((j.Value = "j") && (i.Value = "i") && (h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") - && (d.Value = "d") && (c.Value = "c") && (b.Value = "b")&& (a.Value = "a")) |> should equal true - -[] -let ``tryLookup not found``() = - lena |> tryLookup 10 |> should equal None - -[] -let ``update length 1``() = - len1 |> update 0 "aa"|> lookup 0 |> should equal "aa" - -[] -let ``update length 2``() = - (((len2 |> update 0 "bb"|> lookup 0) = "bb") && ((len2 |> update 1 "aa"|> lookup 1) = "aa")) |> should equal true - -[] -let ``update length 3``() = - (((len3 |> update 0 "cc"|> lookup 0) = "cc") && ((len3 |> update 1 "bb"|> lookup 1) = "bb") - && ((len3 |> update 2 "aa"|> lookup 2) = "aa")) |> should equal true - -[] -let ``update length 4``() = - (((len4 |> update 0 "dd"|> lookup 0) = "dd") && ((len4 |> update 1 "cc"|> lookup 1) = "cc") - && ((len4 |> update 2 "bb"|> lookup 2) = "bb") && ((len4 |> update 3 "aa"|> lookup 3) = "aa")) - |> should equal true - -[] -let ``update length 5``() = - (((len5 |> update 0 "ee"|> lookup 0) = "ee") && ((len5 |> update 1 "dd"|> lookup 1) = "dd") - && ((len5 |> update 2 "cc"|> lookup 2) = "cc") && ((len5 |> update 3 "bb"|> lookup 3) = "bb") - && ((len5 |> update 4 "aa"|> lookup 4) = "aa")) |> should equal true - -[] -let ``update length 6``() = - (((len6 |> update 0 "ff"|> lookup 0) = "ff") && ((len6 |> update 1 "ee"|> lookup 1) = "ee") - && ((len6 |> update 2 "dd"|> lookup 2) = "dd") && ((len6 |> update 3 "cc"|> lookup 3) = "cc") - && ((len6 |> update 4 "bb"|> lookup 4) = "bb") && ((len6 |> update 5 "aa"|> lookup 5) = "aa")) |> should equal true - -[] -let ``update length 7``() = - (((len7 |> update 0 "gg"|> lookup 0) = "gg") && ((len7 |> update 1 "ff"|> lookup 1) = "ff") - && ((len7 |> update 2 "ee"|> lookup 2) = "ee") && ((len7 |> update 3 "dd"|> lookup 3) = "dd") - && ((len7 |> update 4 "cc"|> lookup 4) = "cc") && ((len7 |> update 5 "bb"|> lookup 5) = "bb") - && ((len7 |> update 6 "aa"|> lookup 6) = "aa")) |> should equal true - -[] -let ``update length 8``() = - (((len8 |> update 0 "hh"|> lookup 0) = "hh") && ((len8 |> update 1 "gg"|> lookup 1) = "gg") - && ((len8 |> update 2 "ff"|> lookup 2) = "ff") && ((len8 |> update 3 "ee"|> lookup 3) = "ee") - && ((len8 |> update 4 "dd"|> lookup 4) = "dd") && ((len8 |> update 5 "cc"|> lookup 5) = "cc") - && ((len8 |> update 6 "bb"|> lookup 6) = "bb") && ((len8 |> update 7 "aa"|> lookup 7) = "aa")) - |> should equal true - -[] -let ``update length 9``() = - (((len9 |> update 0 "ii"|> lookup 0) = "ii") && ((len9 |> update 1 "hh"|> lookup 1) = "hh") - && ((len9 |> update 2 "gg"|> lookup 2) = "gg") && ((len9 |> update 3 "ff"|> lookup 3) = "ff") - && ((len9 |> update 4 "ee"|> lookup 4) = "ee") && ((len9 |> update 5 "dd"|> lookup 5) = "dd") - && ((len9 |> update 6 "cc"|> lookup 6) = "cc") && ((len9 |> update 7 "bb"|> lookup 7) = "bb") - && ((len9 |> update 8 "aa"|> lookup 8) = "aa")) |> should equal true - -[] -let ``update length 10``() = - (((lena |> update 0 "jj"|> lookup 0) = "jj") && ((lena |> update 1 "ii"|> lookup 1) = "ii") - && ((lena |> update 2 "hh"|> lookup 2) = "hh") && ((lena |> update 3 "gg"|> lookup 3) = "gg") - && ((lena |> update 4 "ff"|> lookup 4) = "ff") && ((lena |> update 5 "ee"|> lookup 5) = "ee") - && ((lena |> update 6 "dd"|> lookup 6) = "dd") && ((lena |> update 7 "cc"|> lookup 7) = "cc") - && ((lena |> update 8 "bb"|> lookup 8) = "bb") && ((lena |> update 9 "aa"|> lookup 9) = "aa")) |> should equal true - -[] -let ``tryUpdate length 1``() = - let a = len1 |> tryUpdate 0 "aa" - ((a.Value |> lookup 0) = "aa") |> should equal true - -[] -let ``tryUpdate length 2``() = - let b = len2 |> tryUpdate 0 "bb" - let a = len2 |> tryUpdate 1 "aa" - (((b.Value |> lookup 0) = "bb") && ((a.Value |> lookup 1) = "aa")) |> should equal true - -[] -let ``tryUpdate length 3``() = - let c = len3 |> tryUpdate 0 "cc" - let b = len3 |> tryUpdate 1 "bb" - let a = len3 |> tryUpdate 2 "aa" - (((c.Value |> lookup 0) = "cc") && ((b.Value |> lookup 1) = "bb") && ((a.Value |> lookup 2) = "aa")) |> should equal true - -[] -let ``tryUpdate length 4``() = - let d = len4 |> tryUpdate 0 "dd" - let c = len4 |> tryUpdate 1 "cc" - let b = len4 |> tryUpdate 2 "bb" - let a = len4 |> tryUpdate 3 "aa" - (((d.Value |> lookup 0) = "dd") && ((c.Value |> lookup 1) = "cc") && ((b.Value |> lookup 2) = "bb") - && ((a.Value |> lookup 3) = "aa")) |> should equal true - -[] -let ``tryUpdate length 5``() = - let e = len5 |> tryUpdate 0 "ee" - let d = len5 |> tryUpdate 1 "dd" - let c = len5 |> tryUpdate 2 "cc" - let b = len5 |> tryUpdate 3 "bb" - let a = len5 |> tryUpdate 4 "aa" - (((e.Value |> lookup 0) = "ee") && ((d.Value |> lookup 1) = "dd") && ((c.Value |> lookup 2) = "cc") - && ((b.Value |> lookup 3) = "bb") && ((a.Value |> lookup 4) = "aa")) |> should equal true - -[] -let ``tryUpdate length 6``() = - let f = len6 |> tryUpdate 0 "ff" - let e = len6 |> tryUpdate 1 "ee" - let d = len6 |> tryUpdate 2 "dd" - let c = len6 |> tryUpdate 3 "cc" - let b = len6 |> tryUpdate 4 "bb" - let a = len6 |> tryUpdate 5 "aa" - (((f.Value |> lookup 0) = "ff") && ((e.Value |> lookup 1) = "ee") && ((d.Value |> lookup 2) = "dd") - && ((c.Value |> lookup 3) = "cc") && ((b.Value |> lookup 4) = "bb") && ((a.Value |> lookup 5) = "aa")) - |> should equal true - -[] -let ``tryUpdate length 7``() = - let g = len7 |> tryUpdate 0 "gg" - let f = len7 |> tryUpdate 1 "ff" - let e = len7 |> tryUpdate 2 "ee" - let d = len7 |> tryUpdate 3 "dd" - let c = len7 |> tryUpdate 4 "cc" - let b = len7 |> tryUpdate 5 "bb" - let a = len7 |> tryUpdate 6 "aa" - (((g.Value |> lookup 0) = "gg") && ((f.Value |> lookup 1) = "ff") && ((e.Value |> lookup 2) = "ee") - && ((d.Value |> lookup 3) = "dd") && ((c.Value |> lookup 4) = "cc") && ((b.Value |> lookup 5) = "bb") - && ((a.Value |> lookup 6) = "aa")) |> should equal true - -[] -let ``tryUpdate length 8``() = - let h = len8 |> tryUpdate 0 "hh" - let g = len8 |> tryUpdate 1 "gg" - let f = len8 |> tryUpdate 2 "ff" - let e = len8 |> tryUpdate 3 "ee" - let d = len8 |> tryUpdate 4 "dd" - let c = len8 |> tryUpdate 5 "cc" - let b = len8 |> tryUpdate 6 "bb" - let a = len8 |> tryUpdate 7 "aa" - (((h.Value |> lookup 0) = "hh") && ((g.Value |> lookup 1) = "gg") && ((f.Value |> lookup 2) = "ff") - && ((e.Value |> lookup 3) = "ee") && ((d.Value |> lookup 4) = "dd") && ((c.Value |> lookup 5) = "cc") - && ((b.Value |> lookup 6) = "bb")&& ((a.Value |> lookup 7) = "aa")) |> should equal true - -[] -let ``tryUpdate length 9``() = - let i = len9 |> tryUpdate 0 "ii" - let h = len9 |> tryUpdate 1 "hh" - let g = len9 |> tryUpdate 2 "gg" - let f = len9 |> tryUpdate 3 "ff" - let e = len9 |> tryUpdate 4 "ee" - let d = len9 |> tryUpdate 5 "dd" - let c = len9 |> tryUpdate 6 "cc" - let b = len9 |> tryUpdate 7 "bb" - let a = len9 |> tryUpdate 8 "aa" - (((i.Value |> lookup 0) = "ii") && ((h.Value |> lookup 1) = "hh") && ((g.Value |> lookup 2) = "gg") - && ((f.Value |> lookup 3) = "ff") && ((e.Value |> lookup 4) = "ee") && ((d.Value |> lookup 5) = "dd") - && ((c.Value |> lookup 6) = "cc") && ((b.Value |> lookup 7) = "bb")&& ((a.Value |> lookup 8) = "aa")) |> should equal true - -[] -let ``tryUpdate length 10``() = - let j = lena |> tryUpdate 0 "jj" - let i = lena |> tryUpdate 1 "ii" - let h = lena |> tryUpdate 2 "hh" - let g = lena |> tryUpdate 3 "gg" - let f = lena |> tryUpdate 4 "ff" - let e = lena |> tryUpdate 5 "ee" - let d = lena |> tryUpdate 6 "dd" - let c = lena |> tryUpdate 7 "cc" - let b = lena |> tryUpdate 8 "bb" - let a = lena |> tryUpdate 9 "aa" - (((j.Value |> lookup 0) = "jj") && ((i.Value |> lookup 1) = "ii") && ((h.Value |> lookup 2) = "hh") - && ((g.Value |> lookup 3) = "gg") && ((f.Value |> lookup 4) = "ff") && ((e.Value |> lookup 5) = "ee") - && ((d.Value |> lookup 6) = "dd") && ((c.Value |> lookup 7) = "cc") && ((b.Value |> lookup 8) = "bb") - && ((a.Value |> lookup 9) = "aa")) |> should equal true - -[] -let ``length of empty is 0``() = - empty() |> length |> should equal 0 - -[] -let ``length of 1 - 10 good``() = - - (((length len1) = 1) && ((length len2) = 2) && ((length len3) = 3) && ((length len4) = 4) - && ((length len5) = 5) && ((length len6) = 6) && ((length len7) = 7) && ((length len8) = 8) - && ((length len9) = 9) && ((length lena) = 10)) |> should equal true - -[] -let ``ofSeq``() = - let x = ofSeq ["a";"b";"c";"d";"e";"f";"g";"h";"i";"j"] - - (((x |> lookup 0) = "a") && ((x |> lookup 1) = "b") && ((x |> lookup 2) = "c") && ((x |> lookup 3) = "d") - && ((x |> lookup 4) = "e") && ((x |> lookup 5) = "f") && ((x |> lookup 6) = "g") && ((x |> lookup 7) = "h") - && ((x |> lookup 8) = "i") && ((x |> lookup 9) = "j")) |> should equal true - -[] -let ``IRandomAccessList cons works``() = - ((lena :> IRandomAccessList).Cons "zz").Head |> should equal "zz" \ No newline at end of file + test "BinaryRandomAccessList.rev elements BinaryRandomAccessList.length 5" { + let a = BinaryRandomAccessList.ofSeq ["a";"b";"c";"d";"e"] + + let b = BinaryRandomAccessList.rev a + + let c = List.ofSeq b + + c.Head |> Expect.equal "" "e"} + + test "BinaryRandomAccessList.lookup BinaryRandomAccessList.length 2" { + (((len2 |> BinaryRandomAccessList.lookup 0) = "b") && ((len2 |> BinaryRandomAccessList.lookup 1) = "a")) |> Expect.isTrue "" } + + test "BinaryRandomAccessList.lookup BinaryRandomAccessList.length 3" { + (((len3 |> BinaryRandomAccessList.lookup 0) = "c") && ((len3 |> BinaryRandomAccessList.lookup 1) = "b") && ((len3 |> BinaryRandomAccessList.lookup 2) = "a")) |> Expect.isTrue "" } + + test "BinaryRandomAccessList.lookup BinaryRandomAccessList.length 4" { + (((len4 |> BinaryRandomAccessList.lookup 0) = "d") && ((len4 |> BinaryRandomAccessList.lookup 1) = "c") && ((len4 |> BinaryRandomAccessList.lookup 2) = "b") && ((len4 |> BinaryRandomAccessList.lookup 3) = "a")) + |> Expect.isTrue "" } + + test "BinaryRandomAccessList.lookup BinaryRandomAccessList.length 5" { + (((len5 |> BinaryRandomAccessList.lookup 0) = "e") && ((len5 |> BinaryRandomAccessList.lookup 1) = "d") && ((len5 |> BinaryRandomAccessList.lookup 2) = "c") && ((len5 |> BinaryRandomAccessList.lookup 3) = "b") + && ((len5 |> BinaryRandomAccessList.lookup 4) = "a")) |> Expect.isTrue "" } + + test "BinaryRandomAccessList.lookup BinaryRandomAccessList.length 6" { + (((len6 |> BinaryRandomAccessList.lookup 0) = "f") && ((len6 |> BinaryRandomAccessList.lookup 1) = "e") && ((len6 |> BinaryRandomAccessList.lookup 2) = "d") && ((len6 |> BinaryRandomAccessList.lookup 3) = "c") + && ((len6 |> BinaryRandomAccessList.lookup 4) = "b") && ((len6 |> BinaryRandomAccessList.lookup 5) = "a")) |> Expect.isTrue "" } + + test "BinaryRandomAccessList.lookup BinaryRandomAccessList.length 7" { + (((len7 |> BinaryRandomAccessList.lookup 0) = "g") && ((len7 |> BinaryRandomAccessList.lookup 1) = "f") && ((len7 |> BinaryRandomAccessList.lookup 2) = "e") && ((len7 |> BinaryRandomAccessList.lookup 3) = "d") + && ((len7 |> BinaryRandomAccessList.lookup 4) = "c") && ((len7 |> BinaryRandomAccessList.lookup 5) = "b") && ((len7 |> BinaryRandomAccessList.lookup 6) = "a")) |> Expect.isTrue "" } + + test "BinaryRandomAccessList.lookup BinaryRandomAccessList.length 8" { + (((len8 |> BinaryRandomAccessList.lookup 0) = "h") && ((len8 |> BinaryRandomAccessList.lookup 1) = "g") && ((len8 |> BinaryRandomAccessList.lookup 2) = "f") && ((len8 |> BinaryRandomAccessList.lookup 3) = "e") + && ((len8 |> BinaryRandomAccessList.lookup 4) = "d") && ((len8 |> BinaryRandomAccessList.lookup 5) = "c") && ((len8 |> BinaryRandomAccessList.lookup 6) = "b") && ((len8 |> BinaryRandomAccessList.lookup 7) = "a")) + |> Expect.isTrue "" } + + test "BinaryRandomAccessList.lookup BinaryRandomAccessList.length 9" { + (((len9 |> BinaryRandomAccessList.lookup 0) = "i") && ((len9 |> BinaryRandomAccessList.lookup 1) = "h") && ((len9 |> BinaryRandomAccessList.lookup 2) = "g") && ((len9 |> BinaryRandomAccessList.lookup 3) = "f") + && ((len9 |> BinaryRandomAccessList.lookup 4) = "e") && ((len9 |> BinaryRandomAccessList.lookup 5) = "d") && ((len9 |> BinaryRandomAccessList.lookup 6) = "c") && ((len9 |> BinaryRandomAccessList.lookup 7) = "b") + && ((len9 |> BinaryRandomAccessList.lookup 8) = "a")) |> Expect.isTrue "" } + + test "BinaryRandomAccessList.lookup BinaryRandomAccessList.length 10" { + (((lena |> BinaryRandomAccessList.lookup 0) = "j") && ((lena |> BinaryRandomAccessList.lookup 1) = "i") && ((lena |> BinaryRandomAccessList.lookup 2) = "h") && ((lena |> BinaryRandomAccessList.lookup 3) = "g") + && ((lena |> BinaryRandomAccessList.lookup 4) = "f") && ((lena |> BinaryRandomAccessList.lookup 5) = "e") && ((lena |> BinaryRandomAccessList.lookup 6) = "d") && ((lena |> BinaryRandomAccessList.lookup 7) = "c") + && ((lena |> BinaryRandomAccessList.lookup 8) = "b") && ((lena |> BinaryRandomAccessList.lookup 9) = "a")) |> Expect.isTrue "" } + + test "BinaryRandomAccessList.tryLookup BinaryRandomAccessList.length 1" { + let a = len1 |> BinaryRandomAccessList.tryLookup 0 + (a.Value = "a") |> Expect.isTrue "" } + + test "BinaryRandomAccessList.tryLookup BinaryRandomAccessList.length 2" { + let b = len2 |> BinaryRandomAccessList.tryLookup 0 + let a = len2 |> BinaryRandomAccessList.tryLookup 1 + ((b.Value = "b") && (a.Value = "a")) |> Expect.isTrue "" } + + test "BinaryRandomAccessList.tryLookup BinaryRandomAccessList.length 3" { + let c = len3 |> BinaryRandomAccessList.tryLookup 0 + let b = len3 |> BinaryRandomAccessList.tryLookup 1 + let a = len3 |> BinaryRandomAccessList.tryLookup 2 + ((c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> Expect.isTrue "" } + + test "BinaryRandomAccessList.tryLookup BinaryRandomAccessList.length 4" { + let d = len4 |> BinaryRandomAccessList.tryLookup 0 + let c = len4 |> BinaryRandomAccessList.tryLookup 1 + let b = len4 |> BinaryRandomAccessList.tryLookup 2 + let a = len4 |> BinaryRandomAccessList.tryLookup 3 + ((d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> Expect.isTrue "" } + + test "BinaryRandomAccessList.tryLookup BinaryRandomAccessList.length 5" { + let e = len5 |> BinaryRandomAccessList.tryLookup 0 + let d = len5 |> BinaryRandomAccessList.tryLookup 1 + let c = len5 |> BinaryRandomAccessList.tryLookup 2 + let b = len5 |> BinaryRandomAccessList.tryLookup 3 + let a = len5 |> BinaryRandomAccessList.tryLookup 4 + ((e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> Expect.isTrue "" } + + test "BinaryRandomAccessList.tryLookup BinaryRandomAccessList.length 6" { + let f = len6 |> BinaryRandomAccessList.tryLookup 0 + let e = len6 |> BinaryRandomAccessList.tryLookup 1 + let d = len6 |> BinaryRandomAccessList.tryLookup 2 + let c = len6 |> BinaryRandomAccessList.tryLookup 3 + let b = len6 |> BinaryRandomAccessList.tryLookup 4 + let a = len6 |> BinaryRandomAccessList.tryLookup 5 + ((f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) + |> Expect.isTrue "" } + + test "BinaryRandomAccessList.tryLookup BinaryRandomAccessList.length 7" { + let g = len7 |> BinaryRandomAccessList.tryLookup 0 + let f = len7 |> BinaryRandomAccessList.tryLookup 1 + let e = len7 |> BinaryRandomAccessList.tryLookup 2 + let d = len7 |> BinaryRandomAccessList.tryLookup 3 + let c = len7 |> BinaryRandomAccessList.tryLookup 4 + let b = len7 |> BinaryRandomAccessList.tryLookup 5 + let a = len7 |> BinaryRandomAccessList.tryLookup 6 + ((g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") + && (a.Value = "a")) |> Expect.isTrue "" } + + test "BinaryRandomAccessList.tryLookup BinaryRandomAccessList.length 8" { + let h = len8 |> BinaryRandomAccessList.tryLookup 0 + let g = len8 |> BinaryRandomAccessList.tryLookup 1 + let f = len8 |> BinaryRandomAccessList.tryLookup 2 + let e = len8 |> BinaryRandomAccessList.tryLookup 3 + let d = len8 |> BinaryRandomAccessList.tryLookup 4 + let c = len8 |> BinaryRandomAccessList.tryLookup 5 + let b = len8 |> BinaryRandomAccessList.tryLookup 6 + let a = len8 |> BinaryRandomAccessList.tryLookup 7 + ((h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") + && (b.Value = "b")&& (a.Value = "a")) |> Expect.isTrue "" } + + test "BinaryRandomAccessList.tryLookup BinaryRandomAccessList.length 9" { + let i = len9 |> BinaryRandomAccessList.tryLookup 0 + let h = len9 |> BinaryRandomAccessList.tryLookup 1 + let g = len9 |> BinaryRandomAccessList.tryLookup 2 + let f = len9 |> BinaryRandomAccessList.tryLookup 3 + let e = len9 |> BinaryRandomAccessList.tryLookup 4 + let d = len9 |> BinaryRandomAccessList.tryLookup 5 + let c = len9 |> BinaryRandomAccessList.tryLookup 6 + let b = len9 |> BinaryRandomAccessList.tryLookup 7 + let a = len9 |> BinaryRandomAccessList.tryLookup 8 + ((i.Value = "i") && (h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") + && (c.Value = "c") && (b.Value = "b")&& (a.Value = "a")) |> Expect.isTrue "" } + + test "BinaryRandomAccessList.tryLookup BinaryRandomAccessList.length 10" { + let j = lena |> BinaryRandomAccessList.tryLookup 0 + let i = lena |> BinaryRandomAccessList.tryLookup 1 + let h = lena |> BinaryRandomAccessList.tryLookup 2 + let g = lena |> BinaryRandomAccessList.tryLookup 3 + let f = lena |> BinaryRandomAccessList.tryLookup 4 + let e = lena |> BinaryRandomAccessList.tryLookup 5 + let d = lena |> BinaryRandomAccessList.tryLookup 6 + let c = lena |> BinaryRandomAccessList.tryLookup 7 + let b = lena |> BinaryRandomAccessList.tryLookup 8 + let a = lena |> BinaryRandomAccessList.tryLookup 9 + ((j.Value = "j") && (i.Value = "i") && (h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") + && (d.Value = "d") && (c.Value = "c") && (b.Value = "b")&& (a.Value = "a")) |> Expect.isTrue "" } + + test "BinaryRandomAccessList.tryLookup not found" { + lena |> BinaryRandomAccessList.tryLookup 10 |> Expect.isNone "" } + + test "BinaryRandomAccessList.update BinaryRandomAccessList.length 1" { + len1 |> BinaryRandomAccessList.update 0 "aa"|> BinaryRandomAccessList.lookup 0 |> Expect.equal "" "aa"} + + test "BinaryRandomAccessList.update BinaryRandomAccessList.length 2" { + (((len2 |> BinaryRandomAccessList.update 0 "bb"|> BinaryRandomAccessList.lookup 0) = "bb") && ((len2 |> BinaryRandomAccessList.update 1 "aa"|> BinaryRandomAccessList.lookup 1) = "aa")) |> Expect.isTrue "" } + + test "BinaryRandomAccessList.update BinaryRandomAccessList.length 3" { + (((len3 |> BinaryRandomAccessList.update 0 "cc"|> BinaryRandomAccessList.lookup 0) = "cc") && ((len3 |> BinaryRandomAccessList.update 1 "bb"|> BinaryRandomAccessList.lookup 1) = "bb") + && ((len3 |> BinaryRandomAccessList.update 2 "aa"|> BinaryRandomAccessList.lookup 2) = "aa")) |> Expect.isTrue "" } + + test "BinaryRandomAccessList.update BinaryRandomAccessList.length 4" { + (((len4 |> BinaryRandomAccessList.update 0 "dd"|> BinaryRandomAccessList.lookup 0) = "dd") && ((len4 |> BinaryRandomAccessList.update 1 "cc"|> BinaryRandomAccessList.lookup 1) = "cc") + && ((len4 |> BinaryRandomAccessList.update 2 "bb"|> BinaryRandomAccessList.lookup 2) = "bb") && ((len4 |> BinaryRandomAccessList.update 3 "aa"|> BinaryRandomAccessList.lookup 3) = "aa")) + |> Expect.isTrue "" } + + test "BinaryRandomAccessList.update BinaryRandomAccessList.length 5" { + (((len5 |> BinaryRandomAccessList.update 0 "ee"|> BinaryRandomAccessList.lookup 0) = "ee") && ((len5 |> BinaryRandomAccessList.update 1 "dd"|> BinaryRandomAccessList.lookup 1) = "dd") + && ((len5 |> BinaryRandomAccessList.update 2 "cc"|> BinaryRandomAccessList.lookup 2) = "cc") && ((len5 |> BinaryRandomAccessList.update 3 "bb"|> BinaryRandomAccessList.lookup 3) = "bb") + && ((len5 |> BinaryRandomAccessList.update 4 "aa"|> BinaryRandomAccessList.lookup 4) = "aa")) |> Expect.isTrue "" } + + test "BinaryRandomAccessList.update BinaryRandomAccessList.length 6" { + (((len6 |> BinaryRandomAccessList.update 0 "ff"|> BinaryRandomAccessList.lookup 0) = "ff") && ((len6 |> BinaryRandomAccessList.update 1 "ee"|> BinaryRandomAccessList.lookup 1) = "ee") + && ((len6 |> BinaryRandomAccessList.update 2 "dd"|> BinaryRandomAccessList.lookup 2) = "dd") && ((len6 |> BinaryRandomAccessList.update 3 "cc"|> BinaryRandomAccessList.lookup 3) = "cc") + && ((len6 |> BinaryRandomAccessList.update 4 "bb"|> BinaryRandomAccessList.lookup 4) = "bb") && ((len6 |> BinaryRandomAccessList.update 5 "aa"|> BinaryRandomAccessList.lookup 5) = "aa")) |> Expect.isTrue "" } + + test "BinaryRandomAccessList.update BinaryRandomAccessList.length 7" { + (((len7 |> BinaryRandomAccessList.update 0 "gg"|> BinaryRandomAccessList.lookup 0) = "gg") && ((len7 |> BinaryRandomAccessList.update 1 "ff"|> BinaryRandomAccessList.lookup 1) = "ff") + && ((len7 |> BinaryRandomAccessList.update 2 "ee"|> BinaryRandomAccessList.lookup 2) = "ee") && ((len7 |> BinaryRandomAccessList.update 3 "dd"|> BinaryRandomAccessList.lookup 3) = "dd") + && ((len7 |> BinaryRandomAccessList.update 4 "cc"|> BinaryRandomAccessList.lookup 4) = "cc") && ((len7 |> BinaryRandomAccessList.update 5 "bb"|> BinaryRandomAccessList.lookup 5) = "bb") + && ((len7 |> BinaryRandomAccessList.update 6 "aa"|> BinaryRandomAccessList.lookup 6) = "aa")) |> Expect.isTrue "" } + + test "BinaryRandomAccessList.update BinaryRandomAccessList.length 8" { + (((len8 |> BinaryRandomAccessList.update 0 "hh"|> BinaryRandomAccessList.lookup 0) = "hh") && ((len8 |> BinaryRandomAccessList.update 1 "gg"|> BinaryRandomAccessList.lookup 1) = "gg") + && ((len8 |> BinaryRandomAccessList.update 2 "ff"|> BinaryRandomAccessList.lookup 2) = "ff") && ((len8 |> BinaryRandomAccessList.update 3 "ee"|> BinaryRandomAccessList.lookup 3) = "ee") + && ((len8 |> BinaryRandomAccessList.update 4 "dd"|> BinaryRandomAccessList.lookup 4) = "dd") && ((len8 |> BinaryRandomAccessList.update 5 "cc"|> BinaryRandomAccessList.lookup 5) = "cc") + && ((len8 |> BinaryRandomAccessList.update 6 "bb"|> BinaryRandomAccessList.lookup 6) = "bb") && ((len8 |> BinaryRandomAccessList.update 7 "aa"|> BinaryRandomAccessList.lookup 7) = "aa")) + |> Expect.isTrue "" } + + test "BinaryRandomAccessList.update BinaryRandomAccessList.length 9" { + (((len9 |> BinaryRandomAccessList.update 0 "ii"|> BinaryRandomAccessList.lookup 0) = "ii") && ((len9 |> BinaryRandomAccessList.update 1 "hh"|> BinaryRandomAccessList.lookup 1) = "hh") + && ((len9 |> BinaryRandomAccessList.update 2 "gg"|> BinaryRandomAccessList.lookup 2) = "gg") && ((len9 |> BinaryRandomAccessList.update 3 "ff"|> BinaryRandomAccessList.lookup 3) = "ff") + && ((len9 |> BinaryRandomAccessList.update 4 "ee"|> BinaryRandomAccessList.lookup 4) = "ee") && ((len9 |> BinaryRandomAccessList.update 5 "dd"|> BinaryRandomAccessList.lookup 5) = "dd") + && ((len9 |> BinaryRandomAccessList.update 6 "cc"|> BinaryRandomAccessList.lookup 6) = "cc") && ((len9 |> BinaryRandomAccessList.update 7 "bb"|> BinaryRandomAccessList.lookup 7) = "bb") + && ((len9 |> BinaryRandomAccessList.update 8 "aa"|> BinaryRandomAccessList.lookup 8) = "aa")) |> Expect.isTrue "" } + + test "BinaryRandomAccessList.update BinaryRandomAccessList.length 10" { + (((lena |> BinaryRandomAccessList.update 0 "jj"|> BinaryRandomAccessList.lookup 0) = "jj") && ((lena |> BinaryRandomAccessList.update 1 "ii"|> BinaryRandomAccessList.lookup 1) = "ii") + && ((lena |> BinaryRandomAccessList.update 2 "hh"|> BinaryRandomAccessList.lookup 2) = "hh") && ((lena |> BinaryRandomAccessList.update 3 "gg"|> BinaryRandomAccessList.lookup 3) = "gg") + && ((lena |> BinaryRandomAccessList.update 4 "ff"|> BinaryRandomAccessList.lookup 4) = "ff") && ((lena |> BinaryRandomAccessList.update 5 "ee"|> BinaryRandomAccessList.lookup 5) = "ee") + && ((lena |> BinaryRandomAccessList.update 6 "dd"|> BinaryRandomAccessList.lookup 6) = "dd") && ((lena |> BinaryRandomAccessList.update 7 "cc"|> BinaryRandomAccessList.lookup 7) = "cc") + && ((lena |> BinaryRandomAccessList.update 8 "bb"|> BinaryRandomAccessList.lookup 8) = "bb") && ((lena |> BinaryRandomAccessList.update 9 "aa"|> BinaryRandomAccessList.lookup 9) = "aa")) |> Expect.isTrue "" } + + test "BinaryRandomAccessList.tryUpdate BinaryRandomAccessList.length 1" { + let a = len1 |> BinaryRandomAccessList.tryUpdate 0 "aa" + ((a.Value |> BinaryRandomAccessList.lookup 0) = "aa") |> Expect.isTrue "" } + + test "BinaryRandomAccessList.tryUpdate BinaryRandomAccessList.length 2" { + let b = len2 |> BinaryRandomAccessList.tryUpdate 0 "bb" + let a = len2 |> BinaryRandomAccessList.tryUpdate 1 "aa" + (((b.Value |> BinaryRandomAccessList.lookup 0) = "bb") && ((a.Value |> BinaryRandomAccessList.lookup 1) = "aa")) |> Expect.isTrue "" } + + test "BinaryRandomAccessList.tryUpdate BinaryRandomAccessList.length 3" { + let c = len3 |> BinaryRandomAccessList.tryUpdate 0 "cc" + let b = len3 |> BinaryRandomAccessList.tryUpdate 1 "bb" + let a = len3 |> BinaryRandomAccessList.tryUpdate 2 "aa" + (((c.Value |> BinaryRandomAccessList.lookup 0) = "cc") && ((b.Value |> BinaryRandomAccessList.lookup 1) = "bb") && ((a.Value |> BinaryRandomAccessList.lookup 2) = "aa")) |> Expect.isTrue "" } + + test "BinaryRandomAccessList.tryUpdate BinaryRandomAccessList.length 4" { + let d = len4 |> BinaryRandomAccessList.tryUpdate 0 "dd" + let c = len4 |> BinaryRandomAccessList.tryUpdate 1 "cc" + let b = len4 |> BinaryRandomAccessList.tryUpdate 2 "bb" + let a = len4 |> BinaryRandomAccessList.tryUpdate 3 "aa" + (((d.Value |> BinaryRandomAccessList.lookup 0) = "dd") && ((c.Value |> BinaryRandomAccessList.lookup 1) = "cc") && ((b.Value |> BinaryRandomAccessList.lookup 2) = "bb") + && ((a.Value |> BinaryRandomAccessList.lookup 3) = "aa")) |> Expect.isTrue "" } + + test "BinaryRandomAccessList.tryUpdate BinaryRandomAccessList.length 5" { + let e = len5 |> BinaryRandomAccessList.tryUpdate 0 "ee" + let d = len5 |> BinaryRandomAccessList.tryUpdate 1 "dd" + let c = len5 |> BinaryRandomAccessList.tryUpdate 2 "cc" + let b = len5 |> BinaryRandomAccessList.tryUpdate 3 "bb" + let a = len5 |> BinaryRandomAccessList.tryUpdate 4 "aa" + (((e.Value |> BinaryRandomAccessList.lookup 0) = "ee") && ((d.Value |> BinaryRandomAccessList.lookup 1) = "dd") && ((c.Value |> BinaryRandomAccessList.lookup 2) = "cc") + && ((b.Value |> BinaryRandomAccessList.lookup 3) = "bb") && ((a.Value |> BinaryRandomAccessList.lookup 4) = "aa")) |> Expect.isTrue "" } + + test "BinaryRandomAccessList.tryUpdate BinaryRandomAccessList.length 6" { + let f = len6 |> BinaryRandomAccessList.tryUpdate 0 "ff" + let e = len6 |> BinaryRandomAccessList.tryUpdate 1 "ee" + let d = len6 |> BinaryRandomAccessList.tryUpdate 2 "dd" + let c = len6 |> BinaryRandomAccessList.tryUpdate 3 "cc" + let b = len6 |> BinaryRandomAccessList.tryUpdate 4 "bb" + let a = len6 |> BinaryRandomAccessList.tryUpdate 5 "aa" + (((f.Value |> BinaryRandomAccessList.lookup 0) = "ff") && ((e.Value |> BinaryRandomAccessList.lookup 1) = "ee") && ((d.Value |> BinaryRandomAccessList.lookup 2) = "dd") + && ((c.Value |> BinaryRandomAccessList.lookup 3) = "cc") && ((b.Value |> BinaryRandomAccessList.lookup 4) = "bb") && ((a.Value |> BinaryRandomAccessList.lookup 5) = "aa")) + |> Expect.isTrue "" } + + test "BinaryRandomAccessList.tryUpdate BinaryRandomAccessList.length 7" { + let g = len7 |> BinaryRandomAccessList.tryUpdate 0 "gg" + let f = len7 |> BinaryRandomAccessList.tryUpdate 1 "ff" + let e = len7 |> BinaryRandomAccessList.tryUpdate 2 "ee" + let d = len7 |> BinaryRandomAccessList.tryUpdate 3 "dd" + let c = len7 |> BinaryRandomAccessList.tryUpdate 4 "cc" + let b = len7 |> BinaryRandomAccessList.tryUpdate 5 "bb" + let a = len7 |> BinaryRandomAccessList.tryUpdate 6 "aa" + (((g.Value |> BinaryRandomAccessList.lookup 0) = "gg") && ((f.Value |> BinaryRandomAccessList.lookup 1) = "ff") && ((e.Value |> BinaryRandomAccessList.lookup 2) = "ee") + && ((d.Value |> BinaryRandomAccessList.lookup 3) = "dd") && ((c.Value |> BinaryRandomAccessList.lookup 4) = "cc") && ((b.Value |> BinaryRandomAccessList.lookup 5) = "bb") + && ((a.Value |> BinaryRandomAccessList.lookup 6) = "aa")) |> Expect.isTrue "" } + + test "BinaryRandomAccessList.tryUpdate BinaryRandomAccessList.length 8" { + let h = len8 |> BinaryRandomAccessList.tryUpdate 0 "hh" + let g = len8 |> BinaryRandomAccessList.tryUpdate 1 "gg" + let f = len8 |> BinaryRandomAccessList.tryUpdate 2 "ff" + let e = len8 |> BinaryRandomAccessList.tryUpdate 3 "ee" + let d = len8 |> BinaryRandomAccessList.tryUpdate 4 "dd" + let c = len8 |> BinaryRandomAccessList.tryUpdate 5 "cc" + let b = len8 |> BinaryRandomAccessList.tryUpdate 6 "bb" + let a = len8 |> BinaryRandomAccessList.tryUpdate 7 "aa" + (((h.Value |> BinaryRandomAccessList.lookup 0) = "hh") && ((g.Value |> BinaryRandomAccessList.lookup 1) = "gg") && ((f.Value |> BinaryRandomAccessList.lookup 2) = "ff") + && ((e.Value |> BinaryRandomAccessList.lookup 3) = "ee") && ((d.Value |> BinaryRandomAccessList.lookup 4) = "dd") && ((c.Value |> BinaryRandomAccessList.lookup 5) = "cc") + && ((b.Value |> BinaryRandomAccessList.lookup 6) = "bb")&& ((a.Value |> BinaryRandomAccessList.lookup 7) = "aa")) |> Expect.isTrue "" } + + test "BinaryRandomAccessList.tryUpdate BinaryRandomAccessList.length 9" { + let i = len9 |> BinaryRandomAccessList.tryUpdate 0 "ii" + let h = len9 |> BinaryRandomAccessList.tryUpdate 1 "hh" + let g = len9 |> BinaryRandomAccessList.tryUpdate 2 "gg" + let f = len9 |> BinaryRandomAccessList.tryUpdate 3 "ff" + let e = len9 |> BinaryRandomAccessList.tryUpdate 4 "ee" + let d = len9 |> BinaryRandomAccessList.tryUpdate 5 "dd" + let c = len9 |> BinaryRandomAccessList.tryUpdate 6 "cc" + let b = len9 |> BinaryRandomAccessList.tryUpdate 7 "bb" + let a = len9 |> BinaryRandomAccessList.tryUpdate 8 "aa" + (((i.Value |> BinaryRandomAccessList.lookup 0) = "ii") && ((h.Value |> BinaryRandomAccessList.lookup 1) = "hh") && ((g.Value |> BinaryRandomAccessList.lookup 2) = "gg") + && ((f.Value |> BinaryRandomAccessList.lookup 3) = "ff") && ((e.Value |> BinaryRandomAccessList.lookup 4) = "ee") && ((d.Value |> BinaryRandomAccessList.lookup 5) = "dd") + && ((c.Value |> BinaryRandomAccessList.lookup 6) = "cc") && ((b.Value |> BinaryRandomAccessList.lookup 7) = "bb")&& ((a.Value |> BinaryRandomAccessList.lookup 8) = "aa")) |> Expect.isTrue "" } + + test "BinaryRandomAccessList.tryUpdate BinaryRandomAccessList.length 10" { + let j = lena |> BinaryRandomAccessList.tryUpdate 0 "jj" + let i = lena |> BinaryRandomAccessList.tryUpdate 1 "ii" + let h = lena |> BinaryRandomAccessList.tryUpdate 2 "hh" + let g = lena |> BinaryRandomAccessList.tryUpdate 3 "gg" + let f = lena |> BinaryRandomAccessList.tryUpdate 4 "ff" + let e = lena |> BinaryRandomAccessList.tryUpdate 5 "ee" + let d = lena |> BinaryRandomAccessList.tryUpdate 6 "dd" + let c = lena |> BinaryRandomAccessList.tryUpdate 7 "cc" + let b = lena |> BinaryRandomAccessList.tryUpdate 8 "bb" + let a = lena |> BinaryRandomAccessList.tryUpdate 9 "aa" + (((j.Value |> BinaryRandomAccessList.lookup 0) = "jj") && ((i.Value |> BinaryRandomAccessList.lookup 1) = "ii") && ((h.Value |> BinaryRandomAccessList.lookup 2) = "hh") + && ((g.Value |> BinaryRandomAccessList.lookup 3) = "gg") && ((f.Value |> BinaryRandomAccessList.lookup 4) = "ff") && ((e.Value |> BinaryRandomAccessList.lookup 5) = "ee") + && ((d.Value |> BinaryRandomAccessList.lookup 6) = "dd") && ((c.Value |> BinaryRandomAccessList.lookup 7) = "cc") && ((b.Value |> BinaryRandomAccessList.lookup 8) = "bb") + && ((a.Value |> BinaryRandomAccessList.lookup 9) = "aa")) |> Expect.isTrue "" } + + test "BinaryRandomAccessList.length of empty is 0" { + BinaryRandomAccessList.empty() |> BinaryRandomAccessList.length |> Expect.equal "" 0} + + test "BinaryRandomAccessList.length of 1 - 10 good" { + + (((BinaryRandomAccessList.length len1) = 1) && ((BinaryRandomAccessList.length len2) = 2) && ((BinaryRandomAccessList.length len3) = 3) && ((BinaryRandomAccessList.length len4) = 4) + && ((BinaryRandomAccessList.length len5) = 5) && ((BinaryRandomAccessList.length len6) = 6) && ((BinaryRandomAccessList.length len7) = 7) && ((BinaryRandomAccessList.length len8) = 8) + && ((BinaryRandomAccessList.length len9) = 9) && ((BinaryRandomAccessList.length lena) = 10)) |> Expect.isTrue "" } + + test "BinaryRandomAccessList.ofSeq" { + let x = BinaryRandomAccessList.ofSeq ["a";"b";"c";"d";"e";"f";"g";"h";"i";"j"] + + (((x |> BinaryRandomAccessList.lookup 0) = "a") && ((x |> BinaryRandomAccessList.lookup 1) = "b") && ((x |> BinaryRandomAccessList.lookup 2) = "c") && ((x |> BinaryRandomAccessList.lookup 3) = "d") + && ((x |> BinaryRandomAccessList.lookup 4) = "e") && ((x |> BinaryRandomAccessList.lookup 5) = "f") && ((x |> BinaryRandomAccessList.lookup 6) = "g") && ((x |> BinaryRandomAccessList.lookup 7) = "h") + && ((x |> BinaryRandomAccessList.lookup 8) = "i") && ((x |> BinaryRandomAccessList.lookup 9) = "j")) |> Expect.isTrue "" } + + test "IRandomAccessList BinaryRandomAccessList.cons works" { + ((lena :> IRandomAccessList).Cons "zz").Head |> Expect.equal "" "zz"} + ] \ No newline at end of file diff --git a/tests/FSharpx.Collections.Experimental.Tests/BinaryRoseTreeTest.fs b/tests/FSharpx.Collections.Experimental.Tests/BinaryRoseTreeTest.fs index bdea30de..94469acb 100644 --- a/tests/FSharpx.Collections.Experimental.Tests/BinaryRoseTreeTest.fs +++ b/tests/FSharpx.Collections.Experimental.Tests/BinaryRoseTreeTest.fs @@ -1,96 +1,95 @@ -module FSharpx.Collections.Experimental.Tests.BinaryRoseTreeTest +namespace FSharpx.Collections.Experimental.Tests open FSharpx open FSharpx.Collections.Experimental open FSharpx.Collections -open NUnit.Framework -open FsCheck -open FsCheck.NUnit -open FSharpx.Collections.Tests.Properties -open FsUnit +open Expecto +open Expecto.Flip -let atree = - BinaryRoseTree.createTree 1 - (BinaryRoseTree.createTree 2 - (BinaryRoseTree.createForest 3 - BinaryRoseTree.empty - (BinaryRoseTree.createTree 4 - (BinaryRoseTree.createTree 5 - (BinaryRoseTree.singleton 6) +module BinaryRoseTreeTest = + + let atree = + BinaryRoseTree.createTree 1 + (BinaryRoseTree.createTree 2 + (BinaryRoseTree.createForest 3 + BinaryRoseTree.empty + (BinaryRoseTree.createTree 4 + (BinaryRoseTree.createTree 5 + (BinaryRoseTree.singleton 6) + ) ) ) ) - ) -let expected = - BinaryRoseTree.createTree 2 - (BinaryRoseTree.createTree 3 - (BinaryRoseTree.createForest 4 - BinaryRoseTree.empty - (BinaryRoseTree.createTree 5 - (BinaryRoseTree.createTree 6 - (BinaryRoseTree.singleton 7) + let expected = + BinaryRoseTree.createTree 2 + (BinaryRoseTree.createTree 3 + (BinaryRoseTree.createForest 4 + BinaryRoseTree.empty + (BinaryRoseTree.createTree 5 + (BinaryRoseTree.createTree 6 + (BinaryRoseTree.singleton 7) + ) ) ) ) - ) -let ctree = - BinaryRoseTree.createTree "f" - ( - BinaryRoseTree.createForest "b" - (BinaryRoseTree.createForest "a" - BinaryRoseTree.empty - (BinaryRoseTree.createTree "d" - (BinaryRoseTree.createForest "c" - BinaryRoseTree.empty - (BinaryRoseTree.singleton "e") + let ctree = + BinaryRoseTree.createTree "f" + ( + BinaryRoseTree.createForest "b" + (BinaryRoseTree.createForest "a" + BinaryRoseTree.empty + (BinaryRoseTree.createTree "d" + (BinaryRoseTree.createForest "c" + BinaryRoseTree.empty + (BinaryRoseTree.singleton "e") + ) ) ) - ) - (BinaryRoseTree.createTree "g" - (BinaryRoseTree.createTree "i" - (BinaryRoseTree.singleton "h") + (BinaryRoseTree.createTree "g" + (BinaryRoseTree.createTree "i" + (BinaryRoseTree.singleton "h") + ) ) - ) - ) + ) + + [] + let testBinaryRoseTree= -[] -let ``preOrder works``() = - let actual = BinaryRoseTree.preOrder ctree |> Seq.toList - Assert.AreEqual(["f";"b";"a";"d";"c";"e";"g";"i";"h"], actual) + testList "Experimental BinaryRoseTree" [ + test "preOrder works" { + let actual = BinaryRoseTree.preOrder ctree |> Seq.toList + Expect.equal "" ["f";"b";"a";"d";"c";"e";"g";"i";"h"] actual } -[] -let ``postOrder works``() = - let actual = BinaryRoseTree.postOrder ctree |> Seq.toList - Assert.AreEqual(["a";"c";"e";"d";"b";"h";"i";"g";"f"], actual) + test "postOrder works" { + let actual = BinaryRoseTree.postOrder ctree |> Seq.toList + Expect.equal "" ["a";"c";"e";"d";"b";"h";"i";"g";"f"] actual } -[] -let map() = - let actual = BinaryRoseTree.map ((+) 1) atree - Assert.AreEqual(expected, actual) + test "map" { + let actual = BinaryRoseTree.map ((+) 1) atree + Expect.equal "" expected actual } -[] -let ``fold via preOrder``() = - let actual = BinaryRoseTree.preOrder atree |> Seq.fold (*) 1 - Assert.AreEqual(720, actual) + test "fold via preOrder" { + let actual = BinaryRoseTree.preOrder atree |> Seq.fold (*) 1 + Expect.equal "" 720 actual } -let iRT = BinaryRoseTree.createTree 1 (BinaryRoseTree.createForest 2 atree expected) -let singleRT = BinaryRoseTree.singleton 1 + test "functor laws" { + let iRT = BinaryRoseTree.createTree 1 (BinaryRoseTree.createForest 2 atree expected) + let singleRT = BinaryRoseTree.singleton 1 -[] -let ``functor laws``() = - //fsCheck version of functor and monad laws stackoverflows - let map = BinaryRoseTree.map + //fsCheck version of functor and monad laws stackoverflows + let map = BinaryRoseTree.map - //preserves identity - ((map id iRT) = iRT) |> should equal true - ((map id singleRT) = singleRT) |> should equal true + //preserves identity + ((map id iRT) = iRT) |> Expect.isTrue "" + ((map id singleRT) = singleRT) |> Expect.isTrue "" - let f = (fun x -> x + 5) - let g = (fun x -> x - 2) + let f = (fun x -> x + 5) + let g = (fun x -> x - 2) - //preserves composition - map (f << g) iRT = (map f << map g) iRT |> should equal true - map (f << g) singleRT = (map f << map g) singleRT |> should equal true \ No newline at end of file + //preserves composition + map (f << g) iRT = (map f << map g) iRT |> Expect.isTrue "" + map (f << g) singleRT = (map f << map g) singleRT |> Expect.isTrue "" } + ] \ No newline at end of file diff --git a/tests/FSharpx.Collections.Experimental.Tests/BinaryTreeZipperTest.fs b/tests/FSharpx.Collections.Experimental.Tests/BinaryTreeZipperTest.fs index 601dda68..7a14ff56 100644 --- a/tests/FSharpx.Collections.Experimental.Tests/BinaryTreeZipperTest.fs +++ b/tests/FSharpx.Collections.Experimental.Tests/BinaryTreeZipperTest.fs @@ -1,44 +1,43 @@ -module FSharpx.DataStructures.Tests.BinaryTreeZipperTest - -open System -open FSharpx.DataStructures -open FSharpx.DataStructures.BinaryTreeZipper -open NUnit.Framework - -let tree = Branch("a", Branch("b", Leaf, Branch("c", Leaf, Leaf)), Branch("d", Leaf, Leaf)) - -[] -let ``Can create zipper from tree``() = - let z1 = tree |> zipper - Assert.AreEqual(z1.Focus,tree) - -[] -let ``Can move down to the left inside the zipper``() = - let z1 = tree |> zipper |> left - Assert.AreEqual(z1.Focus,Branch("b", Leaf, Branch("c", Leaf, Leaf))) - -[] -let ``Can move down to the right inside the zipper``() = - let z1 = tree |> zipper |> right - Assert.AreEqual(z1.Focus,Branch("d", Leaf, Leaf)) - -[] -let ``Can move down to the left and the right inside the zipper``() = - let z1 = tree |> zipper |> move [Left;Right] - Assert.AreEqual(z1.Focus,Branch("c", Leaf, Leaf)) - -[] -let ``Can move up inside the zipper``() = - let z1 = tree |> zipper |> move [Left;Right;Right;Up;Up;Up] - Assert.AreEqual(z1.Focus,tree) - -[] -let ``Can move to the top from inside the zipper``() = - let z1 = tree |> zipper |> move [Left;Right;Right] |> top - Assert.AreEqual(z1.Focus,tree) - -[] -let ``Can modify inside the zipper``() = - let z1 = tree |> zipper |> right |> setFocus (branch "e") |> top - - Assert.AreEqual(z1.Focus,Branch("a", Branch("b", Leaf, Branch("c", Leaf, Leaf)), Branch("e", Leaf, Leaf))) \ No newline at end of file +namespace FSharpx.Collections.Experimental.Tests + +open FSharpx.Collections.Experimental +open Expecto +open Expecto.Flip + +module BinaryTreeZipperTest = + let tree = Branch("a", Branch("b", BinaryTree.Leaf, Branch("c", BinaryTree.Leaf, BinaryTree.Leaf)), Branch("d", BinaryTree.Leaf, BinaryTree.Leaf)) + + [] + let testBinaryTreeZipper = + + testList "Experimental BinaryTreeZipper" [ + + test "Can create BinaryTreeZipper.zipper from tree" { + let z1 = tree |> BinaryTreeZipper.zipper + Expect.equal "" tree z1.Focus } + + test "Can BinaryTreeZipper.move down to the BinaryTreeZipper.left inside the BinaryTreeZipper.zipper" { + let z1 = tree |> BinaryTreeZipper.zipper |> BinaryTreeZipper.left + Expect.equal "" (Branch("b", BinaryTree.Leaf, Branch("c", BinaryTree.Leaf, BinaryTree.Leaf))) z1.Focus } + + test "Can BinaryTreeZipper.move down to the BinaryTreeZipper.right inside the BinaryTreeZipper.zipper" { + let z1 = tree |> BinaryTreeZipper.zipper |> BinaryTreeZipper.right + Expect.equal "" (Branch("d", BinaryTree.Leaf, BinaryTree.Leaf)) z1.Focus } + + test "Can BinaryTreeZipper.move down to the BinaryTreeZipper.left and the BinaryTreeZipper.right inside the BinaryTreeZipper.zipper" { + let z1 = tree |> BinaryTreeZipper.zipper |> BinaryTreeZipper.move [BinaryTreeZipper.TreeZipperDirection.Left;BinaryTreeZipper.TreeZipperDirection.Right] + Expect.equal "" (Branch("c", BinaryTree.Leaf, BinaryTree.Leaf)) z1.Focus } + + test "Can BinaryTreeZipper.move up inside the BinaryTreeZipper.zipper" { + let z1 = tree |> BinaryTreeZipper.zipper |> BinaryTreeZipper.move [BinaryTreeZipper.TreeZipperDirection.Left;BinaryTreeZipper.TreeZipperDirection.Right;BinaryTreeZipper.TreeZipperDirection.Right;BinaryTreeZipper.Up;BinaryTreeZipper.Up;BinaryTreeZipper.Up] + Expect.equal "" tree z1.Focus } + + test "Can BinaryTreeZipper.move to the top from inside the BinaryTreeZipper.zipper" { + let z1 = tree |> BinaryTreeZipper.zipper |> BinaryTreeZipper.move [BinaryTreeZipper.TreeZipperDirection.Left;BinaryTreeZipper.TreeZipperDirection.Right;BinaryTreeZipper.TreeZipperDirection.Right] |> BinaryTreeZipper.top + Expect.equal "" tree z1.Focus } + + test "Can modify inside the BinaryTreeZipper.zipper" { + let z1 = tree |> BinaryTreeZipper.zipper |> BinaryTreeZipper.right |> BinaryTreeZipper.setFocus (BinaryTreeZipper.branch "e") |> BinaryTreeZipper.top + + Expect.equal "" (Branch("a", Branch("b", BinaryTree.Leaf, Branch("c", BinaryTree.Leaf, BinaryTree.Leaf)), Branch("e", BinaryTree.Leaf, BinaryTree.Leaf))) z1.Focus } + ] \ No newline at end of file diff --git a/tests/FSharpx.Collections.Experimental.Tests/BinomialHeapTest.fs b/tests/FSharpx.Collections.Experimental.Tests/BinomialHeapTest.fs index 229f6140..60e58de8 100644 --- a/tests/FSharpx.Collections.Experimental.Tests/BinomialHeapTest.fs +++ b/tests/FSharpx.Collections.Experimental.Tests/BinomialHeapTest.fs @@ -1,169 +1,269 @@ -module FSharpx.Collections.Experimental.Tests.BinomialHeapTest +namespace FSharpx.Collections.Experimental.Tests -open FSharpx open FSharpx.Collections.Experimental -open FSharpx.Collections.Experimental.BinomialHeap -open FSharpx.Collections.Tests.Properties -open NUnit.Framework +open Properties open FsCheck -open FsCheck.NUnit -open FsUnit +open Expecto +open Expecto.Flip open HeapGen //only going up to 5 elements is probably sufficient to test all edge cases -(* -Could not get IHeap<'c, 'a when 'c :> IHeap<'c, 'a> and 'a : comparison> interface working smoothly between shared code, -NUnit TestCaseSource(), FsCheck, and trying to pass around the tuple of heap generator and list. So need individual test -file for each heap type, unlike IQueue. - -Even restricting only to this type, never got generic element type 'a to work. Need separate tests for int and string. -*) - -// NUnit TestCaseSource does not understand array of tuples at runtime -let intGens start = - let v = Array.create 6 (box (maxBinomialHeapIntGen, "max BinomialHeap int")) - v.[1] <- box ((maxBinomialHeapIntOfSeqGen |> Gen.suchThat (fun (q, l) -> l.Length >= start)), "max BinomialHeap OfSeq") - v.[2] <- box ((maxBinomialHeapIntInsertGen |> Gen.suchThat (fun (q, l) -> l.Length >= start)), "max BinomialHeap from Insert") - v.[3] <- box (minBinomialHeapIntGen , "min BinomialHeap int") - v.[4] <- box ((minBinomialHeapIntOfSeqGen |> Gen.suchThat (fun (q, l) -> l.Length >= start)), "min BinomialHeap OfSeq") - v.[5] <- box ((minBinomialHeapIntInsertGen |> Gen.suchThat (fun (q, l) -> l.Length >= start)), "min BinomialHeap from Insert") - v - -let stringGens = - let v = Array.create 2 (box (maxBinomialHeapStringGen, "max BinomialHeap string")) - v.[1] <- box (minBinomialHeapStringGen, "min BinomialHeap string") - v - -let intGensStart1 = - intGens 1 //this will accept all - -let intGensStart2 = - intGens 2 // this will accept 11 out of 12 - -[] -let ``cons pattern discriminator``() = - let h = ofSeq true ["f";"e";"d";"c";"b";"a"] - let h1, t1 = uncons h - - let h2, t2 = - match t1 with - | Cons(h, t) -> h, t - | _ -> "x", t1 - - ((h2 = "e") && ((length t2) = 4)) |> should equal true - -[] -let ``cons pattern discriminator 2``() = - let h = ofSeq true ["f";"e";"d";"c";"b";"a"] - - let t2 = - match h with - | Cons("f", Cons(_, t)) -> t - | _ -> h - - let h1, t3 = uncons t2 - - ((h1 = "d") && ((length t2) = 4)) |> should equal true - -[] -let ``empty list should be empty``() = - (BinomialHeap.empty true).IsEmpty |> should equal true - -[] -[] -let ``head should return``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun ((h : BinomialHeap), (l : int list)) -> - (h.Head() = l.Head) - |> classifyCollect h (h.Length()))) -[] -let ``insert works``() = - (((BinomialHeap.empty true).Insert 1).Insert 2).IsEmpty |> should equal false - -[] -let ``seq enumerate matches build list``() = - - fsCheck "maxBinomialHeap" (Prop.forAll (Arb.fromGen maxBinomialHeapIntGen) - (fun (h, l) -> h |> List.ofSeq = l |> classifyCollect h (h.Length()))) - - fsCheck "minBinomialHeap" (Prop.forAll (Arb.fromGen minBinomialHeapIntGen) - (fun (h, l) -> h |> List.ofSeq = l |> classifyCollect h (h.Length()))) - -[] -let ``length of empty is 0``() = - (BinomialHeap.empty true).Length() |> should equal 0 - -[] -[] -let ``seq enumerate matches build list int``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun (h : BinomialHeap, l) -> h |> Seq.toList = l |> classifyCollect h (h.Length()))) - -[] -[] -let ``seq enumerate matches build list string``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun (h : BinomialHeap, l) -> h |> Seq.toList = l |> classifyCollect h (h.Length()))) - -[] -[] -let ``tail should return``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun ((h : BinomialHeap), (l : int list)) -> - let tl = h.Tail() - let tlHead = - if (tl.Length() > 0) then (tl.Head() = l.Item(1)) - else true - (tlHead && (tl.Length() = (l.Length - 1))) - |> classifyCollect h (h.Length()))) - -[] -let ``tryGetHead on empty should return None``() = - (BinomialHeap.empty true).TryGetHead() |> should equal None - -[] -[] -let ``tryGetHead should return``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun ((h : BinomialHeap), (l : int list)) -> - (h.TryGetHead().Value = l.Head) - |> classifyCollect h (h.Length()))) - -[] -let ``tryGetTail on empty should return None``() = - (BinomialHeap.empty true).TryGetTail() |> should equal None - -[] -let ``tryGetTail on len 1 should return Some empty``() = - let h = BinomialHeap.empty true |> insert 1 |> tryGetTail - h.Value |> isEmpty |> should equal true - -[] -let ``tryMerge max and mis should be None``() = - let h1 = ofSeq true ["f";"e";"d";"c";"b";"a"] - let h2 = ofSeq false ["t";"u";"v";"w";"x";"y";"z"] - - tryMerge h1 h2 |> should equal None - -[] -[] -let ``tryUncons 1 element``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun ((h : BinomialHeap), (l : int list)) -> - let x, tl = h.TryUncons().Value - ((x = l.Head) && (tl.Length() = (l.Length - 1))) - |> classifyCollect h (h.Length()))) - -[] -let ``tryUncons empty``() = - (BinomialHeap.empty true).TryUncons() |> should equal None - -[] -[] -let ``uncons 1 element``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun ((h : BinomialHeap), (l : int list)) -> - let x, tl = h.Uncons() - ((x = l.Head) && (tl.Length() = (l.Length - 1))) - |> classifyCollect h (h.Length()))) \ No newline at end of file +module BinomialHeapTest = + + [] + let testBinomialHeap = + + testList "Experimental BinomialHeap" [ + + test "cons pattern discriminator" { + let h = BinomialHeap.ofSeq true ["f";"e";"d";"c";"b";"a"] + let h1, t1 = BinomialHeap.uncons h + + let h2, t2 = + match t1 with + | BinomialHeap.Cons(h, t) -> h, t + | _ -> "x", t1 + + ((h2 = "e") && ((BinomialHeap.length t2) = 4)) |> Expect.isTrue "" } + + test "cons pattern discriminator 2" { + let h = BinomialHeap.ofSeq true ["f";"e";"d";"c";"b";"a"] + + let t2 = + match h with + | BinomialHeap.Cons("f", BinomialHeap.Cons(_, t)) -> t + | _ -> h + + let h1, t3 = BinomialHeap.uncons t2 + + ((h1 = "d") && ((BinomialHeap.length t2) = 4)) |> Expect.isTrue "" } + + test "empty list should be empty" { + (BinomialHeap.empty true).IsEmpty |> Expect.isTrue "" } + + test "BinomialHeap.length of empty is 0" { + (BinomialHeap.empty true).Length() |> Expect.equal "" 0 } + + test "tryGetHead on empty should return None" { + (BinomialHeap.empty true).TryGetHead() |> Expect.isNone "" } + + test "BinomialHeap.tryGetTail on empty should return None" { + (BinomialHeap.empty true).TryGetTail() |> Expect.isNone "" } + + test "BinomialHeap.tryGetTail on len 1 should return Some empty" { + let h = BinomialHeap.empty true |> BinomialHeap.insert 1 |> BinomialHeap.tryGetTail + h.Value |> BinomialHeap.isEmpty |> Expect.isTrue "" } + + test "BinomialHeap.tryMerge max and mis should be None" { + let h1 = BinomialHeap.ofSeq true ["f";"e";"d";"c";"b";"a"] + let h2 = BinomialHeap.ofSeq false ["t";"u";"v";"w";"x";"y";"z"] + + BinomialHeap.tryMerge h1 h2 |> Expect.isNone "" } + + test "BinomialHeap.insert works" { + (((BinomialHeap.empty true).Insert 1).Insert 2).IsEmpty |> Expect.isFalse "" } + + test "tryUncons empty" { + (BinomialHeap.empty true).TryUncons() |> Expect.isNone "" } + ] + + [] + let propertyBinomialHeap = + + let intGens start = + let v = Array.create 6 maxBinomialHeapIntGen + v.[1] <- maxBinomialHeapIntOfSeqGen |> Gen.filter (fun (q, l) -> l.Length >= start) + v.[2] <- maxBinomialHeapIntInsertGen |> Gen.filter (fun (q, l) -> l.Length >= start) + v.[3] <- minBinomialHeapIntGen + v.[4] <- minBinomialHeapIntOfSeqGen |> Gen.filter (fun (q, l) -> l.Length >= start) + v.[5] <- minBinomialHeapIntInsertGen |> Gen.filter (fun (q, l) -> l.Length >= start) + v + + let stringGens = + let v = Array.create 2 maxBinomialHeapStringGen + v.[1] <- minBinomialHeapStringGen + v + + let intGensStart1 = + intGens 1 //this will accept all + + let intGensStart2 = + intGens 2 // this will accept 11 out of 12 + + testList "Experimental BinomialHeap property tests" [ + + testPropertyWithConfig config10k "head should return 0" (Prop.forAll (Arb.fromGen intGensStart2.[0]) <| + fun (h, l) -> (h.Head() = l.Head) |> classifyCollect h (h.Length())) + + testPropertyWithConfig config10k "head should return 1" (Prop.forAll (Arb.fromGen intGensStart2.[1]) <| + fun (h, l) -> (h.Head() = l.Head) |> classifyCollect h (h.Length())) + + testPropertyWithConfig config10k "head should return 2" (Prop.forAll (Arb.fromGen intGensStart2.[2]) <| + fun (h, l) -> (h.Head() = l.Head) |> classifyCollect h (h.Length())) + + testPropertyWithConfig config10k "head should return 3" (Prop.forAll (Arb.fromGen intGensStart2.[3]) <| + fun (h, l) -> (h.Head() = l.Head) |> classifyCollect h (h.Length())) + + testPropertyWithConfig config10k "head should return 4" (Prop.forAll (Arb.fromGen intGensStart2.[4]) <| + fun (h, l) -> (h.Head() = l.Head) |> classifyCollect h (h.Length())) + + testPropertyWithConfig config10k "head should return 5" (Prop.forAll (Arb.fromGen intGensStart2.[5]) <| + fun (h, l) -> (h.Head() = l.Head) |> classifyCollect h (h.Length())) + + testPropertyWithConfig config10k "seq enumerate matches build list max" (Prop.forAll (Arb.fromGen maxBinomialHeapIntGen) <| + fun (h, l) -> h |> List.ofSeq = l |> classifyCollect h (h.Length())) + + testPropertyWithConfig config10k "seq enumerate matches build list min" (Prop.forAll (Arb.fromGen minBinomialHeapIntGen) <| + fun (h, l) -> h |> List.ofSeq = l |> classifyCollect h (h.Length())) + + testPropertyWithConfig config10k "seq enumerate matches build list int 0" (Prop.forAll (Arb.fromGen intGensStart1.[0]) <| + fun (h, l) -> h |> Seq.toList = l |> classifyCollect h (h.Length())) + + testPropertyWithConfig config10k "seq enumerate matches build list int 1" (Prop.forAll (Arb.fromGen intGensStart1.[1]) <| + fun (h, l) -> h |> Seq.toList = l |> classifyCollect h (h.Length())) + + testPropertyWithConfig config10k "seq enumerate matches build list int 2" (Prop.forAll (Arb.fromGen intGensStart1.[2]) <| + fun (h, l) -> h |> Seq.toList = l |> classifyCollect h (h.Length())) + + testPropertyWithConfig config10k "seq enumerate matches build list int 3" (Prop.forAll (Arb.fromGen intGensStart1.[3]) <| + fun (h, l) -> h |> Seq.toList = l |> classifyCollect h (h.Length())) + + testPropertyWithConfig config10k "seq enumerate matches build list int 4" (Prop.forAll (Arb.fromGen intGensStart1.[4]) <| + fun (h, l) -> h |> Seq.toList = l |> classifyCollect h (h.Length())) + + testPropertyWithConfig config10k "seq enumerate matches build list int 5" (Prop.forAll (Arb.fromGen intGensStart1.[5]) <| + fun (h, l) -> h |> Seq.toList = l |> classifyCollect h (h.Length())) + + testPropertyWithConfig config10k "seq enumerate matches build list string 0" (Prop.forAll (Arb.fromGen stringGens.[0]) <| + fun (h, l) -> h |> Seq.toList = l |> classifyCollect h (h.Length()) ) + + testPropertyWithConfig config10k "seq enumerate matches build list string 1" (Prop.forAll (Arb.fromGen stringGens.[1]) <| + fun (h, l) -> h |> Seq.toList = l |> classifyCollect h (h.Length()) ) + + testPropertyWithConfig config10k "tail should return 0" (Prop.forAll (Arb.fromGen intGensStart2.[0]) <| + fun (h, l) -> let tl = h.Tail() + let tlHead = + if (tl.Length() > 0) then (tl.Head() = l.Item(1)) + else true + (tlHead && (tl.Length() = (l.Length - 1))) + |> classifyCollect h (h.Length()) ) + + testPropertyWithConfig config10k "tail should return 1" (Prop.forAll (Arb.fromGen intGensStart2.[1]) <| + fun (h, l) -> let tl = h.Tail() + let tlHead = + if (tl.Length() > 0) then (tl.Head() = l.Item(1)) + else true + (tlHead && (tl.Length() = (l.Length - 1))) + |> classifyCollect h (h.Length()) ) + + testPropertyWithConfig config10k "tail should return 2" (Prop.forAll (Arb.fromGen intGensStart2.[2]) <| + fun (h, l) -> let tl = h.Tail() + let tlHead = + if (tl.Length() > 0) then (tl.Head() = l.Item(1)) + else true + (tlHead && (tl.Length() = (l.Length - 1))) + |> classifyCollect h (h.Length()) ) + + testPropertyWithConfig config10k "tail should return 3" (Prop.forAll (Arb.fromGen intGensStart2.[3]) <| + fun (h, l) -> let tl = h.Tail() + let tlHead = + if (tl.Length() > 0) then (tl.Head() = l.Item(1)) + else true + (tlHead && (tl.Length() = (l.Length - 1))) + |> classifyCollect h (h.Length()) ) + + testPropertyWithConfig config10k "tail should return 4" (Prop.forAll (Arb.fromGen intGensStart2.[4]) <| + fun (h, l) -> let tl = h.Tail() + let tlHead = + if (tl.Length() > 0) then (tl.Head() = l.Item(1)) + else true + (tlHead && (tl.Length() = (l.Length - 1))) + |> classifyCollect h (h.Length()) ) + + testPropertyWithConfig config10k "tail should return 5" (Prop.forAll (Arb.fromGen intGensStart2.[5]) <| + fun (h, l) -> let tl = h.Tail() + let tlHead = + if (tl.Length() > 0) then (tl.Head() = l.Item(1)) + else true + (tlHead && (tl.Length() = (l.Length - 1))) + |> classifyCollect h (h.Length()) ) + + testPropertyWithConfig config10k "tryGetHead should return 0" (Prop.forAll (Arb.fromGen intGensStart2.[0]) <| + fun (h, l) -> (h.TryGetHead().Value = l.Head) |> classifyCollect h (h.Length())) + + testPropertyWithConfig config10k "tryGetHead should return 1" (Prop.forAll (Arb.fromGen intGensStart2.[1]) <| + fun (h, l) -> (h.TryGetHead().Value = l.Head) |> classifyCollect h (h.Length())) + + testPropertyWithConfig config10k "tryGetHead should return 2" (Prop.forAll (Arb.fromGen intGensStart2.[2]) <| + fun (h, l) -> (h.TryGetHead().Value = l.Head) |> classifyCollect h (h.Length())) + + testPropertyWithConfig config10k "tryGetHead should return 3" (Prop.forAll (Arb.fromGen intGensStart2.[3]) <| + fun (h, l) -> (h.TryGetHead().Value = l.Head) |> classifyCollect h (h.Length())) + + testPropertyWithConfig config10k "tryGetHead should return 4" (Prop.forAll (Arb.fromGen intGensStart2.[4]) <| + fun (h, l) -> (h.TryGetHead().Value = l.Head) |> classifyCollect h (h.Length())) + + testPropertyWithConfig config10k "tryGetHead should return 5" (Prop.forAll (Arb.fromGen intGensStart2.[5]) <| + fun (h, l) -> (h.TryGetHead().Value = l.Head) |> classifyCollect h (h.Length())) + + testPropertyWithConfig config10k "tryUncons 1 element 0" (Prop.forAll (Arb.fromGen intGensStart2.[0]) <| + fun (h, l) -> let x, tl = h.TryUncons().Value + ((x = l.Head) && (tl.Length() = (l.Length - 1))) + |> classifyCollect h (h.Length())) + + testPropertyWithConfig config10k "tryUncons 1 element 1" (Prop.forAll (Arb.fromGen intGensStart2.[1]) <| + fun (h, l) -> let x, tl = h.TryUncons().Value + ((x = l.Head) && (tl.Length() = (l.Length - 1))) + |> classifyCollect h (h.Length())) + + testPropertyWithConfig config10k "tryUncons 1 element 2" (Prop.forAll (Arb.fromGen intGensStart2.[2]) <| + fun (h, l) -> let x, tl = h.TryUncons().Value + ((x = l.Head) && (tl.Length() = (l.Length - 1))) + |> classifyCollect h (h.Length())) + + testPropertyWithConfig config10k "tryUncons 1 element 3" (Prop.forAll (Arb.fromGen intGensStart2.[3]) <| + fun (h, l) -> let x, tl = h.TryUncons().Value + ((x = l.Head) && (tl.Length() = (l.Length - 1))) + |> classifyCollect h (h.Length())) + + testPropertyWithConfig config10k "tryUncons 1 element 4" (Prop.forAll (Arb.fromGen intGensStart2.[4]) <| + fun (h, l) -> let x, tl = h.TryUncons().Value + ((x = l.Head) && (tl.Length() = (l.Length - 1))) + |> classifyCollect h (h.Length())) + + testPropertyWithConfig config10k "tryUncons 1 element 5" (Prop.forAll (Arb.fromGen intGensStart2.[5]) <| + fun (h, l) -> let x, tl = h.TryUncons().Value + ((x = l.Head) && (tl.Length() = (l.Length - 1))) + |> classifyCollect h (h.Length())) + + testPropertyWithConfig config10k "BinomialHeap.uncons 1 element 0" (Prop.forAll (Arb.fromGen intGensStart2.[0]) <| + fun (h, l) -> let x, tl = h.Uncons() + ((x = l.Head) && (tl.Length() = (l.Length - 1))) + |> classifyCollect h (h.Length())) + + testPropertyWithConfig config10k "BinomialHeap.uncons 1 element 1" (Prop.forAll (Arb.fromGen intGensStart2.[1]) <| + fun (h, l) -> let x, tl = h.Uncons() + ((x = l.Head) && (tl.Length() = (l.Length - 1))) + |> classifyCollect h (h.Length())) + + testPropertyWithConfig config10k "BinomialHeap.uncons 1 element 2" (Prop.forAll (Arb.fromGen intGensStart2.[2]) <| + fun (h, l) -> let x, tl = h.Uncons() + ((x = l.Head) && (tl.Length() = (l.Length - 1))) + |> classifyCollect h (h.Length())) + + testPropertyWithConfig config10k "BinomialHeap.uncons 1 element 3" (Prop.forAll (Arb.fromGen intGensStart2.[3]) <| + fun (h, l) -> let x, tl = h.Uncons() + ((x = l.Head) && (tl.Length() = (l.Length - 1))) + |> classifyCollect h (h.Length())) + + testPropertyWithConfig config10k "BinomialHeap.uncons 1 element 4" (Prop.forAll (Arb.fromGen intGensStart2.[4]) <| + fun (h, l) -> let x, tl = h.Uncons() + ((x = l.Head) && (tl.Length() = (l.Length - 1))) + |> classifyCollect h (h.Length())) + + testPropertyWithConfig config10k "BinomialHeap.uncons 1 element 5" (Prop.forAll (Arb.fromGen intGensStart2.[5]) <| + fun (h, l) -> let x, tl = h.Uncons() + ((x = l.Head) && (tl.Length() = (l.Length - 1))) + |> classifyCollect h (h.Length())) + ] \ No newline at end of file diff --git a/tests/FSharpx.Collections.Experimental.Tests/BlockResizeArrayTest.fs b/tests/FSharpx.Collections.Experimental.Tests/BlockResizeArrayTest.fs index e0e7f1b7..bf6c91a6 100644 --- a/tests/FSharpx.Collections.Experimental.Tests/BlockResizeArrayTest.fs +++ b/tests/FSharpx.Collections.Experimental.Tests/BlockResizeArrayTest.fs @@ -1,252 +1,229 @@ -module FSharpx.Collections.Experimental.Tests.BlockResizeArrayTest +namespace FSharpx.Collections.Experimental.Tests open FSharpx.Collections.Experimental -open NUnit.Framework open FsCheck -open FsCheck.NUnit +open Expecto +open Expecto.Flip open FSharpx.Collections.TimeMeasurement -let arraySize = 2048*2048*10 -let testIters = 10 -let x = 1000UL -let testLen = 1000000 -let rand = System.Random() - -let compareByElems (bra : BlockResizeArray<'T>) (arr : 'T []) = - let mutable res = true - Assert.AreEqual(arr.Length, bra.Length, "Length of bra is not equal of array length") - let diff = new ResizeArray<_>() - for i = 0 to bra.Length - 1 do - if arr.[i] <> bra.[i] then diff.Add (i,arr.[i],bra.[i]) - res <- res && arr.[i] = bra.[i] - printfn "Content of arrays are not equals in position %A. Length of arr = %A " diff bra.Length - Assert.IsTrue(res, "") - -let compareByElems2 (bra : BlockResizeArray<'T>) (arr : 'T []) = - let mutable res = true - let diff = new ResizeArray<_>() - for i = 0 to bra.Length - 1 do - if arr.[i] <> bra.[i] then diff.Add (i,arr.[i],bra.[i]) - res <- res && arr.[i] = bra.[i] - res - -[] -let ``allocation performance`` () = - - averageTime testIters "ResizeArrayAlloc" (fun () -> - let a = new ResizeArray() - for i in 0..arraySize do a.Add x ) - averageTime testIters "BlockResizeArrayAlloc" (fun () -> - let a = new BlockResizeArray() - for i in 0..arraySize do a.Add x ) - -[] -let ``random access performance`` () = - let rand = System.Random() - let access = [|for i in 0..arraySize-1 -> rand.Next(0, arraySize - 1)|] - let a = Array.init arraySize (fun _ -> x) - let ra = new ResizeArray() - for i in 0..arraySize do ra.Add x - let bra = new BlockResizeArray() - for i in 0..arraySize do bra.Add x - let b = ref 0UL - averageTime testIters "ResizeArray random access" (fun () -> for i in access do ra.[i] <- 0UL) - averageTime testIters "Array random access" (fun () -> for i in access do a.[i] <- 0UL) - averageTime testIters "BlockResizeArray random access" (fun () -> for i in access do bra.[i] <- 0UL) - -[] -let ``sequential access performance`` () = +module BlockResizeArrayTest = + + let arraySize = 2048*2048*10 + let testIters = 10 + let x = 1000UL + let testLen = 1000000 let rand = System.Random() - let access = [|0..arraySize-1|] - let a = Array.init arraySize (fun _ -> x) - let ra = new ResizeArray() - for i in 0..arraySize do ra.Add x - let bra = new BlockResizeArray() - for i in 0..arraySize do bra.Add x - let b = ref 0UL - averageTime testIters "ResizeArray sequential access" (fun () -> for i in access do ra.[i] <- 0UL) - averageTime testIters "Array sequential access" (fun () -> for i in access do a.[i] <- 0UL) - averageTime testIters "BlockResize sequential access" (fun () -> for i in access do bra.[i] <- 0UL) - -[] -let ``map performance`` () = - let a = Array.init arraySize (fun _ -> x) - let ra = new ResizeArray() - for i in 0..arraySize do ra.Add x - let bra = BlockResizeArray.Init arraySize (fun _ -> x) - averageTime testIters "ResizeArray map" (fun () -> (Microsoft.FSharp.Collections.ResizeArray.map (fun x -> x*2UL) ra)) - averageTime testIters "Array map" (fun () -> (Array.map (fun x -> x*2UL) a)) - averageTime testIters "BlockResizeArray map" (fun () -> bra.Map (fun x -> x*2UL)) - -[] -let ``iter performance`` () = - let a = Array.init arraySize (fun _ -> x) - let ra = new ResizeArray() - for i in 0..arraySize do ra.Add x - let bra = BlockResizeArray.Init arraySize (fun _ -> x) - averageTime testIters "ResizeArray iter" (fun () -> (Microsoft.FSharp.Collections.ResizeArray.iter (fun i -> ()) ra)) - averageTime testIters "Array iter" (fun () -> (Array.iter (fun i -> ()))) - averageTime testIters "BlockResizeArray iter" (fun () -> bra.Iter (fun i -> ())) - -[] -let ``fold performance`` () = - let a = Array.init arraySize (fun _ -> x) - let ra = new ResizeArray() - for i in 0..arraySize do ra.Add x - let bra = BlockResizeArray.Init arraySize (fun _ -> x) - averageTime testIters "ResizeArray fold" (fun () -> (Microsoft.FSharp.Collections.ResizeArray.fold (fun x acc -> acc + x*2UL) 0UL ra)) - averageTime testIters "Array fold" (fun () -> (Array.fold (fun x acc -> acc + x*2UL) 0UL a)) - averageTime testIters "BlockResizeArray fold" (fun () -> (FSharpx.Collections.Experimental.BlockResizeArray.fold (fun x acc -> acc + x*2UL) 0UL bra)) - -[] -let ``find performance`` () = - let x = 1000 - let a = Array.init arraySize (fun i -> x + i) - let ra = new ResizeArray() - let s = 1010000 - for i in 0..arraySize do ra.Add (x + i) - let bra = BlockResizeArray.Init arraySize (fun i -> x + i) - averageTime testIters "ResizeArray find" (fun () -> Microsoft.FSharp.Collections.ResizeArray.find (fun e -> e <> 0 && e % s = 0) ra) - averageTime testIters "Array find" (fun () -> (Array.find (fun e -> e <> 0 && e % s = 0) a)) - averageTime testIters "BlockResizeArray find" (fun () -> (FSharpx.Collections.Experimental.BlockResizeArray.find (fun e -> e <> 0 && e % s = 0) bra)) - -[] -let ``map function test`` () = - let bra = BlockResizeArray.Init testLen (fun i -> i) - let a = Array.init testLen (fun i -> i * 2) - let bra = bra.Map (fun i -> i * 2) - compareByElems bra a - -[] -let ``iter function test`` () = - let bra = BlockResizeArray.Init testLen (fun i -> i) - let a = Array.init testLen (fun i -> i) - Array.iter (fun i -> a.[i] <- i * 2) a - bra.Iter (fun i -> bra.[i] <- i * 2) - compareByElems bra a - -[] -let ``init function test`` () = - let bra = BlockResizeArray.Init testLen (fun i -> i) - let a = Array.init testLen (fun i -> i) - compareByElems bra a - Assert.AreEqual(bra.Length, testLen) - -[] -let ``zeroCreate function test`` () = - let bra = BlockResizeArray<_>.ZeroCreate testLen - Assert.AreEqual(bra.Length, testLen) - -[] -let ``find function test`` () = - let c = 500000 - let bra = BlockResizeArray.Init testLen (fun i -> i) - let res = bra.Find (fun i -> i <> 0 && i % c = 0) - Assert.AreEqual(res, c) - -[] -let ``tryFind function test`` () = - let c = 500000 - let bra = BlockResizeArray.Init testLen (fun i -> i) - let res = bra.TryFind (fun i -> i <> 0 && i % c = 0) - Assert.AreEqual(res.IsSome, true) - Assert.AreEqual(res.Value, c) - -[] -let ``filter function test`` () = - let c = 10000 - let a = Array.init testLen (fun i -> i) - let a = Array.filter (fun i -> i % c = 0) a - let bra = BlockResizeArray.Init testLen (fun i -> i) - let bra = bra.Filter (fun e -> e % c = 0) - compareByElems bra a + + let compareByElems (bra : BlockResizeArray<'T>) (arr : 'T []) = + let mutable res = true + Expect.equal "Length of bra is not equal of array length" arr.Length bra.Length + let diff = new ResizeArray<_>() + for i = 0 to bra.Length - 1 do + if arr.[i] <> bra.[i] then diff.Add (i,arr.[i],bra.[i]) + res <- res && arr.[i] = bra.[i] + printfn "Content of arrays are not equals in position %A. Length of arr = %A " diff bra.Length + Expect.isTrue "" res + + [] + let testBlockResizeArray = + + testList "Experimental BlockResizeArray" [ +#if MONO +#else + test "allocation performance" { + + averageTime testIters "ResizeArrayAlloc" (fun () -> + let a = new ResizeArray() + for i in 0..arraySize do a.Add x ) + averageTime testIters "BlockResizeArrayAlloc" (fun () -> + let a = new BlockResizeArray() + for i in 0..arraySize do a.Add x ) } + + test "random access performance" { + let rand = System.Random() + let access = [|for i in 0..arraySize-1 -> rand.Next(0, arraySize - 1)|] + let a = Array.init arraySize (fun _ -> x) + let ra = new ResizeArray() + for i in 0..arraySize do ra.Add x + let bra = new BlockResizeArray() + for i in 0..arraySize do bra.Add x + let b = ref 0UL + averageTime testIters "ResizeArray random access" (fun () -> for i in access do ra.[i] <- 0UL) + averageTime testIters "Array random access" (fun () -> for i in access do a.[i] <- 0UL) + averageTime testIters "BlockResizeArray random access" (fun () -> for i in access do bra.[i] <- 0UL) } + + test "sequential access performance" { + let rand = System.Random() + let access = [|0..arraySize-1|] + let a = Array.init arraySize (fun _ -> x) + let ra = new ResizeArray() + for i in 0..arraySize do ra.Add x + let bra = new BlockResizeArray() + for i in 0..arraySize do bra.Add x + let b = ref 0UL + averageTime testIters "ResizeArray sequential access" (fun () -> for i in access do ra.[i] <- 0UL) + averageTime testIters "Array sequential access" (fun () -> for i in access do a.[i] <- 0UL) + averageTime testIters "BlockResize sequential access" (fun () -> for i in access do bra.[i] <- 0UL) } + + test "map performance" { + let a = Array.init arraySize (fun _ -> x) + let ra = new ResizeArray() + for i in 0..arraySize do ra.Add x + let bra = BlockResizeArray.Init arraySize (fun _ -> x) + averageTime testIters "ResizeArray map" (fun () -> (Microsoft.FSharp.Collections.ResizeArray.map (fun x -> x*2UL) ra)) + averageTime testIters "Array map" (fun () -> (Array.map (fun x -> x*2UL) a)) + averageTime testIters "BlockResizeArray map" (fun () -> bra.Map (fun x -> x*2UL)) } + + test "iter performance" { + let a = Array.init arraySize (fun _ -> x) + let ra = new ResizeArray() + for i in 0..arraySize do ra.Add x + let bra = BlockResizeArray.Init arraySize (fun _ -> x) + averageTime testIters "ResizeArray iter" (fun () -> (Microsoft.FSharp.Collections.ResizeArray.iter (fun i -> ()) ra)) + averageTime testIters "Array iter" (fun () -> (Array.iter (fun i -> ()))) + averageTime testIters "BlockResizeArray iter" (fun () -> bra.Iter (fun i -> ())) } + + test "fold performance" { + let a = Array.init arraySize (fun _ -> x) + let ra = new ResizeArray() + for i in 0..arraySize do ra.Add x + let bra = BlockResizeArray.Init arraySize (fun _ -> x) + averageTime testIters "ResizeArray fold" (fun () -> (Microsoft.FSharp.Collections.ResizeArray.fold (fun x acc -> acc + x*2UL) 0UL ra)) + averageTime testIters "Array fold" (fun () -> (Array.fold (fun x acc -> acc + x*2UL) 0UL a)) + averageTime testIters "BlockResizeArray fold" (fun () -> (FSharpx.Collections.Experimental.BlockResizeArray.fold (fun x acc -> acc + x*2UL) 0UL bra)) } + + test "find performance" { + let x = 1000 + let a = Array.init arraySize (fun i -> x + i) + let ra = new ResizeArray() + let s = 1010000 + for i in 0..arraySize do ra.Add (x + i) + let bra = BlockResizeArray.Init arraySize (fun i -> x + i) + averageTime testIters "ResizeArray find" (fun () -> Microsoft.FSharp.Collections.ResizeArray.find (fun e -> e <> 0 && e % s = 0) ra) + averageTime testIters "Array find" (fun () -> (Array.find (fun e -> e <> 0 && e % s = 0) a)) + averageTime testIters "BlockResizeArray find" (fun () -> (FSharpx.Collections.Experimental.BlockResizeArray.find (fun e -> e <> 0 && e % s = 0) bra)) } +#endif + test "map function test" { + let bra = BlockResizeArray.Init testLen (fun i -> i) + let a = Array.init testLen (fun i -> i * 2) + let bra = bra.Map (fun i -> i * 2) + compareByElems bra a } + + test "iter function test" { + let bra = BlockResizeArray.Init testLen (fun i -> i) + let a = Array.init testLen (fun i -> i) + Array.iter (fun i -> a.[i] <- i * 2) a + bra.Iter (fun i -> bra.[i] <- i * 2) + compareByElems bra a } + + test "init function test" { + let bra = BlockResizeArray.Init testLen (fun i -> i) + let a = Array.init testLen (fun i -> i) + compareByElems bra a + Expect.equal "" bra.Length testLen } + + test "zeroCreate function test" { + let bra = BlockResizeArray<_>.ZeroCreate testLen + Expect.equal "" bra.Length testLen } + + test "find function test" { + let c = 500000 + let bra = BlockResizeArray.Init testLen (fun i -> i) + let res = bra.Find (fun i -> i <> 0 && i % c = 0) + Expect.equal "" c res } + + test "tryFind function test" { + let c = 500000 + let bra = BlockResizeArray.Init testLen (fun i -> i) + let res = bra.TryFind (fun i -> i <> 0 && i % c = 0) + Expect.isTrue "" res.IsSome + Expect.equal "" c res.Value } + + test "filter function test" { + let c = 10000 + let a = Array.init testLen (fun i -> i) + let a = Array.filter (fun i -> i % c = 0) a + let bra = BlockResizeArray.Init testLen (fun i -> i) + let bra = bra.Filter (fun e -> e % c = 0) + compareByElems bra a } -[] -let ``fold function test`` () = - let a = Array.init testLen (fun i -> i) - let aRes = Array.fold (fun acc elem -> acc + elem) 0 a - let bra = BlockResizeArray.Init testLen (fun i -> i) - let braRes = bra.Fold (fun acc elem -> acc + elem) 0 - Assert.AreEqual(braRes, aRes) - -type ArbitraryModifiers = - static member BlockResizeArray() = - Arb.generate - |> Gen.suchThat (fun i -> i >= 0) - |> Gen.map (fun i -> BlockResizeArray.Init (i * 10000) (fun i -> rand.Next())) - |> Arb.fromGen - -[] -let f () = Arb.register() |> ignore - -[] -let ``Random map``() = - let testFun f (bra:BlockResizeArray) = - let arr = bra.ToArray() - let b = bra.Map f - let a = Array.map f arr - compareByElems b a - Check.VerboseThrowOnFailure <| testFun (fun e -> e * 2) + test "fold function test" { + let a = Array.init testLen (fun i -> i) + let aRes = Array.fold (fun acc elem -> acc + elem) 0 a + let bra = BlockResizeArray.Init testLen (fun i -> i) + let braRes = bra.Fold (fun acc elem -> acc + elem) 0 + Expect.equal "" braRes aRes } + + // destabilizing test function + //test "Random map" { + // let testFun f (bra:BlockResizeArray) = + // let arr = bra.ToArray() + // let b = bra.Map f + // let a = Array.map f arr + // compareByElems b a + // Check.VerboseThrowOnFailure <| testFun (fun e -> e * 2) } -[] -let ``Random filter``() = - let testFun f (bra:BlockResizeArray) = - let arr = bra.ToArray() - let b = bra.Filter f - let a = Array.filter f arr - compareByElems b a - Check.VerboseThrowOnFailure <| testFun (fun e -> e % 3 = 2) + // destabilizing test function + //test "Random filter" { + // let testFun f (bra:BlockResizeArray) = + // let arr = bra.ToArray() + // let b = bra.Filter f + // let a = Array.filter f arr + // compareByElems b a + // Check.VerboseThrowOnFailure <| testFun (fun e -> e % 3 = 2) } -[] -let ``Random TryFind``() = - let testFun f (bra:BlockResizeArray) = - let arr = bra.ToArray() - let b = bra.TryFind f - let a = Array.tryFind f arr - Assert.IsTrue((b = a)) - Check.VerboseThrowOnFailure <| testFun (fun e -> e % 3 = 2) - -[] -let ``Random Find``() = - let testFun f (bra:BlockResizeArray) = - let arr = bra.ToArray() - let b = - try - bra.Find f |> Some - with - | :? System.Collections.Generic.KeyNotFoundException -> None - let a = - try - Array.find f arr |> Some - with - | :? System.Collections.Generic.KeyNotFoundException -> None - - Assert.IsTrue((b = a)) - Check.VerboseThrowOnFailure <| testFun (fun e -> e % 3 = 2) - -[] -let ``Random ToArray``() = - let testFun (bra:BlockResizeArray) = - let arr = bra.ToArray() - compareByElems bra arr - Check.VerboseThrowOnFailure <| testFun - -[] -let ``Random iter``() = - let testFun f (bra:BlockResizeArray) = - let arr = bra.ToArray() - let acc1 = ref 0 - let acc2 = ref 0 - bra.Iter (f acc1) - Array.iter (f acc2) arr - Assert.AreEqual(!acc1, !acc2) - Check.VerboseThrowOnFailure <| testFun (fun acc -> (fun e -> acc := !acc + e)) - -[] -let ``Random fold``() = - let testFun f (bra:BlockResizeArray) = - let arr = bra.ToArray() - let r1 = bra.Fold f 0 - let r2 = Array.fold f 0 arr - Assert.AreEqual(r2, r1) - Check.VerboseThrowOnFailure <| testFun (fun s e -> s + e) + // destabilizing test function + //test "Random TryFind" { + // let testFun f (bra:BlockResizeArray) = + // let arr = bra.ToArray() + // let b = bra.TryFind f + // let a = Array.tryFind f arr + // Expect.isTrue "" (b = a) + // Check.VerboseThrowOnFailure <| testFun (fun e -> e % 3 = 2) } + + // destabilizing test function + //test "Random Find" { + // let testFun f (bra:BlockResizeArray) = + // let arr = bra.ToArray() + + // let b = + // try + // bra.Find f |> Some + // with + // | :? System.Collections.Generic.KeyNotFoundException -> None + // let a = + // try + // Array.find f arr |> Some + // with + // | :? System.Collections.Generic.KeyNotFoundException -> None + + // Expect.isTrue "" (b = a) + // Check.VerboseThrowOnFailure <| testFun (fun e -> e % 3 = 2) } + + // destabilizing test function + //test "Random ToArray" { + // let testFun (bra:BlockResizeArray) = + // let arr = bra.ToArray() + // compareByElems bra arr + // Check.VerboseThrowOnFailure <| testFun } + + // destabilizing test function + //test "Random iter" { + // let testFun f (bra:BlockResizeArray) = + // let arr = bra.ToArray() + // let acc1 = ref 0 + // let acc2 = ref 0 + // bra.Iter (f acc1) + // Array.iter (f acc2) arr + // Expect.equal "" !acc1 !acc2 + // Check.VerboseThrowOnFailure <| testFun (fun acc -> (fun e -> acc := !acc + e)) } + + // destabilizing test function + //test "Random fold" { + // let testFun f (bra:BlockResizeArray) = + // let arr = bra.ToArray() + // let r1 = bra.Fold f 0 + // let r2 = Array.fold f 0 arr + // Expect.equal "" r2 r1 + // Check.VerboseThrowOnFailure <| testFun (fun s e -> s + e) } + ] diff --git a/tests/FSharpx.Collections.Experimental.Tests/BootstrappedQueueTest.fs b/tests/FSharpx.Collections.Experimental.Tests/BootstrappedQueueTest.fs index 376386ee..2241277b 100644 --- a/tests/FSharpx.Collections.Experimental.Tests/BootstrappedQueueTest.fs +++ b/tests/FSharpx.Collections.Experimental.Tests/BootstrappedQueueTest.fs @@ -1,65 +1,59 @@ -module FSharpx.Collections.Experimental.Tests.BootstrappedQueueTest +namespace FSharpx.Collections.Experimental.Tests open System open FSharpx.Collections open FSharpx.Collections.Experimental -open FSharpx.Collections.Experimental.BootstrappedQueue -open NUnit.Framework -open FsUnit +open Expecto +open Expecto.Flip -[] -let ``empty queue should be empty``() = - isEmpty empty |> should equal true +module BootstrappedQueueTest = -[] -let ``it should allow to enqueue``() = - empty |> snoc 1 |> snoc 2 |> isEmpty |> should equal false + [] + let testBootstrappedQueue = -[] -let ``it should allow to dequeue``() = - empty |> snoc 1 |> tail |> isEmpty |> should equal true + testList "Experimental BootstrappedQueue" [ + test "BootstrappedQueue.empty queue should be BootstrappedQueue.empty" { + BootstrappedQueue.isEmpty BootstrappedQueue.empty |> Expect.isTrue "" } -[] -let ``it should fail if there is no head in the queue``() = - let ok = ref false - try - empty |> head |> ignore - with x when x = Exceptions.Empty -> ok := true - !ok |> should equal true + test "it should allow to enqueue" { + BootstrappedQueue.empty |> BootstrappedQueue.snoc 1 |> BootstrappedQueue.snoc 2 |> BootstrappedQueue.isEmpty |> Expect.isFalse "" } -[] -let ``it should give None if there is no head in the queue``() = - empty |> tryGetHead |> should equal None + test "it should allow to dequeue" { + BootstrappedQueue.empty |> BootstrappedQueue.snoc 1 |> BootstrappedQueue.tail |> BootstrappedQueue.isEmpty |> Expect.isTrue "" } -[] -let ``it should fail if there is no tail the queue``() = - let ok = ref false - try - empty |> tail |> ignore - with x when x = Exceptions.Empty -> ok := true - !ok |> should equal true + test "it should fail if there is no BootstrappedQueue.head in the queue" { + let ok = ref false + try + BootstrappedQueue.empty |> BootstrappedQueue.head |> ignore + with x when x = Exceptions.Empty -> ok := true + !ok |> Expect.isTrue "" } -[] -let ``it should give None if there is no tail in the queue``() = - empty |> tryGetTail |> should equal None + test "it should give None if there is no BootstrappedQueue.head in the queue" { + BootstrappedQueue.empty |> BootstrappedQueue.tryGetHead |> Expect.isNone "" } -[] -let ``it should allow to get the head from a queue``() = - empty |> snoc 1 |> snoc 2 |> head |> should equal 1 + test "it should fail if there is no BootstrappedQueue.tail the queue" { + let ok = ref false + try + BootstrappedQueue.empty |> BootstrappedQueue.tail |> ignore + with x when x = Exceptions.Empty -> ok := true + !ok |> Expect.isTrue "" } -[] -let ``it should allow to get the head from a queue safely``() = - empty |> snoc 1 |> snoc 2 |> tryGetHead |> should equal (Some 1) + test "it should give None if there is no BootstrappedQueue.tail in the queue" { + BootstrappedQueue.empty |> BootstrappedQueue.tryGetTail |> Expect.isNone "" } -[] -let ``it should allow to get the tail from the queue``() = - empty |> snoc "a" |> snoc "b" |> snoc "c" |> tail |> head |> should equal "b" + test "it should allow to get the BootstrappedQueue.head from a queue" { + BootstrappedQueue.empty |> BootstrappedQueue.snoc 1 |> BootstrappedQueue.snoc 2 |> BootstrappedQueue.head |> Expect.equal "" 1 } -[] -let ``it should allow to get the tail from a queue safely``() = - let value = empty |> snoc 1 |> snoc 2 |> tryGetTail - value.Value |> head |> should equal 2 + test "it should allow to get the BootstrappedQueue.head from a queue safely" { + BootstrappedQueue.empty |> BootstrappedQueue.snoc 1 |> BootstrappedQueue.snoc 2 |> BootstrappedQueue.tryGetHead |> Expect.equal "" (Some 1) } -[] -let ``it should initialize from a list``() = - ofList [1..10] |> snoc 11 |> snoc 12 |> tail |> length |> should equal 11 \ No newline at end of file + test "it should allow to get the BootstrappedQueue.tail from the queue" { + BootstrappedQueue.empty |> BootstrappedQueue.snoc "a" |> BootstrappedQueue.snoc "b" |> BootstrappedQueue.snoc "c" |> BootstrappedQueue.tail |> BootstrappedQueue.head |> Expect.equal "" "b" } + + test "it should allow to get the BootstrappedQueue.tail from a queue safely" { + let value = BootstrappedQueue.empty |> BootstrappedQueue.snoc 1 |> BootstrappedQueue.snoc 2 |> BootstrappedQueue.tryGetTail + value.Value |> BootstrappedQueue.head |> Expect.equal "" 2 } + + test "it should initialize from a list" { + BootstrappedQueue.ofList [1..10] |> BootstrappedQueue.snoc 11 |> BootstrappedQueue.snoc 12 |> BootstrappedQueue.tail |> BootstrappedQueue.length |> Expect.equal "" 11 } + ] \ No newline at end of file diff --git a/tests/FSharpx.Collections.Experimental.Tests/BottomUpMergeSortTest.fs b/tests/FSharpx.Collections.Experimental.Tests/BottomUpMergeSortTest.fs index 35476ac1..1aea2639 100644 --- a/tests/FSharpx.Collections.Experimental.Tests/BottomUpMergeSortTest.fs +++ b/tests/FSharpx.Collections.Experimental.Tests/BottomUpMergeSortTest.fs @@ -1,31 +1,30 @@ -module FSharpx.Collections.Experimental.Tests.BottomUpMergeSortTest +namespace FSharpx.Collections.Experimental.Tests -open System open FSharpx.Collections.Experimental -open FSharpx.Collections.Experimental.BottomUpMergeSort -open NUnit.Framework -open FsUnit +open Expecto +open Expecto.Flip -[] -let ``empty list should be empty``() = - empty |> isEmpty |> should equal true +module BottomUpMergeSortTest = -[] -let ``empty list should be empty after sort``() = - sort empty |> should equal [] + [] + let testBottomUpMergeSort = -[] -let ``singleton list should be the same after sort``() = - sort (singleton 1) |> should equal [1] + testList "Experimental BottomUpMergeSort" [ + test "empty list should be empty" { + BottomUpMergeSort.empty |> BottomUpMergeSort.isEmpty |> Expect.isTrue "" } -[] -let ``adding a element to an empty list``() = - empty |> add 1 |> sort |> should equal [1] + test "empty list should be empty after sort" { + BottomUpMergeSort.sort BottomUpMergeSort.empty |> Expect.equal "" [] } -[] -let ``adding multiple elements to an empty list``() = - empty |> add 100 |> add 1 |> add 3 |> add 42 |> sort |> should equal [1; 3; 42; 100] + test "singleton list should be the same after sort" { + BottomUpMergeSort.sort (BottomUpMergeSort.singleton 1) |> Expect.equal "" [1] } -[] -let ``adding multiple strings to an empty list``() = - empty |> add "100" |> add "1" |> add "3" |> add "42" |> sort |> should equal ["1"; "100"; "3"; "42"] \ No newline at end of file + test "adding a element to an empty list" { + BottomUpMergeSort.empty |> BottomUpMergeSort.add 1 |> BottomUpMergeSort.sort |> Expect.equal "" [1] } + + test "adding multiple elements to an empty list" { + BottomUpMergeSort.empty |> BottomUpMergeSort.add 100 |> BottomUpMergeSort.add 1 |> BottomUpMergeSort.add 3 |> BottomUpMergeSort.add 42 |> BottomUpMergeSort.sort |> Expect.equal "" [1; 3; 42; 100] } + + test "adding multiple strings to an empty list" { + BottomUpMergeSort.empty |> BottomUpMergeSort.add "100" |> BottomUpMergeSort.add "1" |> BottomUpMergeSort.add "3" |> BottomUpMergeSort.add "42" |> BottomUpMergeSort.sort |> Expect.equal "" ["1"; "100"; "3"; "42"] } + ] \ No newline at end of file diff --git a/tests/FSharpx.Collections.Experimental.Tests/DListTest.fs b/tests/FSharpx.Collections.Experimental.Tests/DListTest.fs index 8f5e5fec..0778d475 100644 --- a/tests/FSharpx.Collections.Experimental.Tests/DListTest.fs +++ b/tests/FSharpx.Collections.Experimental.Tests/DListTest.fs @@ -1,72 +1,63 @@ -module FSharpx.Collections.Experimental.Tests.DListTest +namespace FSharpx.Collections.Experimental.Tests -open System open FSharpx.Collections.Experimental -open FSharpx.Collections.Experimental.DList -open NUnit.Framework -open FsUnit - -[] -let ``test should verify empty is Nil``() = - empty<_> |> should equal Nil - -let expected = Join(Unit 0, Join(Unit 1, Join(Unit 2, Join(Unit 3, Unit 4, 2), 3), 4), 5) -let expected2 = Join(Unit 1, Join(Unit 2, Join(Unit 3, Unit 4, 2), 3), 4) - -[] -let ``test length should return 5``() = - length expected |> should equal 5 - -[] -let ``test ofSeq should create a DList from a seq``() = - let test = seq { for i in 0..4 -> i } - DList.ofSeq test |> should equal expected - -[] -let ``test ofSeq should create a DList from a list``() = - let test = [ for i in 0..4 -> i ] - DList.ofSeq test |> should equal expected - -[] -let ``test ofSeq should create a DList from an array``() = - let test = [| for i in 0..4 -> i |] - DList.ofSeq test |> should equal expected - -[] -let ``test cons should prepend 10 to the front of the original list``() = - cons 10 expected |> should equal (Join(Unit 10, expected, 6)) - -[] -let ``test singleton should return a Unit containing the solo value``() = - singleton 1 |> should equal (Unit 1) - -[] -let ``test cons should return a Unit when the tail is Nil``() = - cons 1 DList.empty |> should equal (Unit 1) - -[] -let ``test subsequent cons should create a DList just as the constructor functions``() = - cons 0 (cons 1 (cons 2 (cons 3 (cons 4 empty)))) |> should equal expected - -[] -let ``test append should join two DLists together``() = - append expected expected2 |> should equal (Join(expected, expected2, 9)) - -[] -let ``test snoc should join DList and one element together``() = - snoc expected 5 |> should equal (Join(expected, Unit 5, 6)) - -[] -let ``test head should return the first item in the DList``() = - head (append expected expected) |> should equal 0 - -[] -let ``test tail should return all items except the head``() = - tail (append expected expected) |> should equal (Join(cons 1 (cons 2 (cons 3 (cons 4 empty))), expected, 9)) - -[] -let ``test DList should respond to Seq functions such as map``() = - let testmap x = x*x - let actual = Seq.map testmap (append expected expected) - let expected = seq { yield 0; yield 1; yield 2; yield 3; yield 4; yield 0; yield 1; yield 2; yield 3; yield 4 } |> Seq.map testmap - Assert.That(actual, Is.EquivalentTo expected) \ No newline at end of file +open Expecto +open Expecto.Flip + +module DListTest = + + [] + let testDList = + + let expected = Join(Unit 0, Join(Unit 1, Join(Unit 2, Join(Unit 3, Unit 4, 2), 3), 4), 5) + let expected2 = Join(Unit 1, Join(Unit 2, Join(Unit 3, Unit 4, 2), 3), 4) + + testList "Experimental DList" [ + test "test should verify DList.empty is Nil" { + DList.empty<_> |> Expect.equal "" DList.Nil } + + test "test DList.length should return 5" { + DList.length expected |> Expect.equal "" 5 } + + test "test ofSeq should create a DList from a seq" { + let test = seq { for i in 0..4 -> i } + DList.ofSeq test |> Expect.equal "" expected } + + test "test ofSeq should create a DList from a list" { + let test = [ for i in 0..4 -> i ] + DList.ofSeq test |> Expect.equal "" expected } + + test "test ofSeq should create a DList from an array" { + let test = [| for i in 0..4 -> i |] + DList.ofSeq test |> Expect.equal "" expected } + + test "test DList.cons should prepend 10 to the front of the original list" { + DList.cons 10 expected |> Expect.equal "" (Join(Unit 10, expected, 6)) } + + test "test DList.singleton should return a Unit containing the solo value" { + DList.singleton 1 |> Expect.equal "" (Unit 1) } + + test "test DList.cons should return a Unit when the tail is Nil" { + DList.cons 1 DList.empty |> Expect.equal "" (Unit 1) } + + test "test subsequent DList.cons should create a DList just as the constructor functions" { + DList.cons 0 (DList.cons 1 (DList.cons 2 (DList.cons 3 (DList.cons 4 DList.empty)))) |> Expect.equal "" expected } + + test "test DList.append should join two DLists together" { + DList.append expected expected2 |> Expect.equal "" (Join(expected, expected2, 9)) } + + test "test DList.snoc should join DList and one element together" { + DList.snoc expected 5 |> Expect.equal "" (Join(expected, Unit 5, 6)) } + + test "test head should return the first item in the DList" { + DList.head (DList.append expected expected) |> Expect.equal "" 0 } + + test "test tail should return all items except the head" { + DList.tail (DList.append expected expected) |> Expect.equal "" (Join(DList.cons 1 (DList.cons 2 (DList.cons 3 (DList.cons 4 DList.empty))), expected, 9)) } + + test "test DList should respond to Seq functions such as map" { + let testmap x = x*x + let actual = Seq.map testmap (DList.append expected expected) + let expected = seq { yield 0; yield 1; yield 2; yield 3; yield 4; yield 0; yield 1; yield 2; yield 3; yield 4 } |> Seq.map testmap + Expect.sequenceEqual "" expected actual } + ] \ No newline at end of file diff --git a/tests/FSharpx.Collections.Experimental.Tests/DequeTest.fs b/tests/FSharpx.Collections.Experimental.Tests/DequeTest.fs index 3343d36c..0ed9ec04 100644 --- a/tests/FSharpx.Collections.Experimental.Tests/DequeTest.fs +++ b/tests/FSharpx.Collections.Experimental.Tests/DequeTest.fs @@ -1,1522 +1,1427 @@ -module FSharpx.Collections.Experimental.Tests.Deque +namespace FSharpx.Collections.Experimental.Tests open System open FSharpx.Collections open FSharpx.Collections.Experimental -open FSharpx.Collections.Experimental.Deque -open NUnit.Framework -open FsUnit - +open Expecto +open Expecto.Flip //quite a lot going on and difficult to reason about edge cases -//testing up to length of 6 is the likely minimum to satisfy any arbitrary test case (less for some cases) - -let len1 = singleton "a" -let len2 = singleton "a" |> cons "b" -let len3 = singleton "a" |> cons "b" |> cons "c" -let len4 = singleton "a" |> cons "b" |> cons "c" |> cons "d" -let len5 = singleton "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" -let len6 = singleton "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" -let len7 = singleton "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" -let len8 = singleton "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" -let len9 = singleton "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" |> cons "i" -let lena = singleton "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" |> cons "i" |> cons "j" - -let len2snoc = singleton "b" |> snoc "a" -let len3snoc = singleton "c" |> snoc "b" |> snoc "a" -let len4snoc = singleton "d" |> snoc "c" |> snoc "b" |> snoc "a" -let len5snoc = singleton "e" |> snoc "d" |> snoc "c" |> snoc "b" |> snoc "a" -let len6snoc = singleton "f" |> snoc "e" |> snoc "d" |> snoc "c" |> snoc "b" |> snoc "a" -let len7snoc = singleton "g" |> snoc "f" |> snoc "e" |> snoc "d" |> snoc "c" |> snoc "b" |> snoc "a" -let len8snoc = singleton "h" |> snoc "g" |> snoc "f" |> snoc "e" |> snoc "d" |> snoc "c" |> snoc "b" |> snoc "a" -let len9snoc = singleton "i" |> snoc "h" |> snoc "g" |> snoc "f" |> snoc "e" |> snoc "d" |> snoc "c" |> snoc "b" |> snoc "a" -let lenasnoc = singleton "j" |> snoc "i" |> snoc "h" |> snoc "g" |> snoc "f" |> snoc "e" |> snoc "d" |> snoc "c" |> snoc "b" |> snoc "a" - -[] -let ``empty dqueue should be empty``() = - empty() |> isEmpty |> should equal true - -[] -let ``cons works``() = - len2 |> isEmpty |> should equal false - -[] -let ``snoc works``() = - len2snoc |> isEmpty |> should equal false - -[] -let ``singleton head works``() = - len1 |> head |> should equal "a" - -[] -let ``singleton last works``() = - len1 |> last |> should equal "a" - -[] -let ``tail of singleton empty``() = - len1 |> tail |> isEmpty |> should equal true +//testing up to Deque.length of 6 is the likely minimum to satisfy any arbitrary test case (less for some cases) -[] -let ``tail of tail of 2 empty``() = - ( len2 |> tail |> tail |> isEmpty) |> should equal true - -[] -let ``init of singleton empty``() = - len1 |> init |> isEmpty |> should equal true - -[] -let ``head, tail, and length work test 1``() = - let t1 = tail len2 - let t1s = tail len2snoc - (((length t1) = 1) && ((length t1s) = 1) && ((head t1) = "a") && ((head t1s) = "a")) |> should equal true - -[] -let ``head, tail, and length work test 2``() = - let t1 = tail len3 - let t1s = tail len3snoc - - let t1_1 = tail t1 - let t1_1s = tail t1s - - (((length t1) = 2) && ((length t1s) = 2) && ((head t1) = "b") && ((head t1s) = "b") && ((length t1_1) = 1) && ((length t1_1s) = 1) - && ((head t1_1) = "a") && ((head t1_1s) = "a")) |> should equal true - -[] -let ``head, tail, and length work test 3``() = - let t1 = tail len4 - let t1s = tail len4snoc - - let t1_2 = tail t1 - let t1_2s = tail t1s - - let t1_1 = tail t1_2 - let t1_1s = tail t1_2s - - (((length t1) = 3) && ((length t1s) = 3) && ((head t1) = "c")&& ((head t1s) = "c") && ((length t1_2) = 2) && ((length t1_2s) = 2) - && ((head t1_2) = "b") && ((head t1_2s) = "b") && ((length t1_1) = 1) && ((length t1_1s) = 1) && ((head t1_1) = "a") - && ((head t1_1s) = "a")) |> should equal true - -[] -let ``head, tail, and length work test 4``() = - let t1 = tail len5 - let t1s = tail len5snoc - - let t1_3 = tail t1 - let t1_3s = tail t1s - - let t1_2 = tail t1_3 - let t1_2s = tail t1_3s - - let t1_1 = tail t1_2 - let t1_1s = tail t1_2s - - (((length t1) = 4) && ((length t1s) = 4) && ((head t1) = "d") && ((head t1s) = "d") && ((length t1_3) = 3) && ((length t1_3s) = 3) - && ((head t1_3) = "c") && ((head t1_3s) = "c") && ((length t1_2) = 2) && ((length t1_2s) = 2) && ((head t1_2) = "b") && ((head t1_2s) = "b") - && ((length t1_1) = 1) && ((length t1_1s) = 1) && ((head t1_1) = "a") && ((head t1_1s) = "a")) |> should equal true - -[] -let ``head, tail, and length work test 5``() = - let t1 = tail len6 - let t1s = tail len6snoc - - let t1_4 = tail t1 - let t1_4s = tail t1s - - let t1_3 = tail t1_4 - let t1_3s = tail t1_4s - - let t1_2 = tail t1_3 - let t1_2s = tail t1_3s - - let t1_1 = tail t1_2 - let t1_1s = tail t1_2s - - (((length t1) = 5) && ((length t1s) = 5) && ((head t1) = "e") && ((head t1s) = "e") && ((length t1_4) = 4) && ((length t1_4s) = 4) - && ((head t1_4) = "d") && ((head t1_4s) = "d") && ((length t1_3) = 3) && ((length t1_3s) = 3) && ((head t1_3) = "c") && ((head t1_3s) = "c") - && ((length t1_2) = 2) && ((length t1_2s) = 2) && ((head t1_2) = "b") && ((head t1_2s) = "b") && ((length t1_1) = 1) && ((length t1_1s) = 1) - && ((head t1_1) = "a") && ((head t1_1s) = "a")) |> should equal true - -[] -let ``head, tail, and length work test 6``() = - let t1 = tail len7 - let t1s = tail len7snoc - - let t1_5 = tail t1 - let t1_5s = tail t1s - - let t1_4 = tail t1_5 - let t1_4s = tail t1_5s - - let t1_3 = tail t1_4 - let t1_3s = tail t1_4s - - let t1_2 = tail t1_3 - let t1_2s = tail t1_3s - - let t1_1 = tail t1_2 - let t1_1s = tail t1_2s - - (((length t1) = 6) && ((length t1s) = 6) - && ((head t1) = "f") && ((head t1s) = "f") - && ((length t1_5) = 5) && ((length t1_5s) = 5) - && ((head t1_5) = "e") && ((head t1_5s) = "e") - && ((length t1_4) = 4) && ((length t1_4s) = 4) - && ((head t1_4) = "d") && ((head t1_4s) = "d") - && ((length t1_3) = 3) && ((length t1_3s) = 3) - && ((head t1_3) = "c") && ((head t1_3s) = "c") - && ((length t1_2) = 2) && ((length t1_2s) = 2) - && ((head t1_2) = "b") && ((head t1_2s) = "b") - && ((length t1_1) = 1) && ((length t1_1s) = 1) - && ((head t1_1) = "a") && ((head t1_1s) = "a") ) |> should equal true - -[] -let ``head, tail, and length work test 7``() = - let t1 = tail len8 - let t1s = tail len8snoc - let t1_6 = tail t1 - let t1_6s = tail t1s - let t1_5 = tail t1_6 - let t1_5s = tail t1_6s - let t1_4 = tail t1_5 - let t1_4s = tail t1_5s - let t1_3 = tail t1_4 - let t1_3s = tail t1_4s - let t1_2 = tail t1_3 - let t1_2s = tail t1_3s - let t1_1 = tail t1_2 - let t1_1s = tail t1_2s - - (((length t1) = 7) && ((length t1s) = 7) - && ((head t1) = "g") && ((head t1s) = "g") - && ((length t1_6) = 6) && ((length t1_6s) = 6) - && ((head t1_6) = "f") && ((head t1_6s) = "f") - && ((length t1_5) = 5) && ((length t1_5s) = 5) - && ((head t1_5) = "e") && ((head t1_5s) = "e") - && ((length t1_4) = 4) && ((length t1_4s) = 4) - && ((head t1_4) = "d") && ((head t1_4s) = "d") - && ((length t1_3) = 3) && ((length t1_3s) = 3) - && ((head t1_3) = "c") && ((head t1_3s) = "c") - && ((length t1_2) = 2) && ((length t1_2s) = 2) - && ((head t1_2) = "b") && ((head t1_2s) = "b") - && ((length t1_1) = 1) && ((length t1_1s) = 1) - && ((head t1_1) = "a") && ((head t1_1s) = "a") ) |> should equal true - -[] -let ``head, tail, and length work test 8``() = - let t1 = tail len9 - let t1s = tail len9snoc - let t1_7 = tail t1 - let t1_7s = tail t1s - let t1_6 = tail t1_7 - let t1_6s = tail t1_7s - let t1_5 = tail t1_6 - let t1_5s = tail t1_6s - let t1_4 = tail t1_5 - let t1_4s = tail t1_5s - let t1_3 = tail t1_4 - let t1_3s = tail t1_4s - let t1_2 = tail t1_3 - let t1_2s = tail t1_3s - let t1_1 = tail t1_2 - let t1_1s = tail t1_2s - - (((length t1) = 8) && ((length t1s) = 8) - && ((head t1) = "h") && ((head t1s) = "h") - && ((length t1_7) = 7) && ((length t1_7s) = 7) - && ((head t1_7) = "g") && ((head t1_7s) = "g") - && ((length t1_6) = 6) && ((length t1_6s) = 6) - && ((head t1_6) = "f") && ((head t1_6s) = "f") - && ((length t1_5) = 5) && ((length t1_5s) = 5) - && ((head t1_5) = "e") && ((head t1_5s) = "e") - && ((length t1_4) = 4) && ((length t1_4s) = 4) - && ((head t1_4) = "d") && ((head t1_4s) = "d") - && ((length t1_3) = 3) && ((length t1_3s) = 3) - && ((head t1_3) = "c") && ((head t1_3s) = "c") - && ((length t1_2) = 2) && ((length t1_2s) = 2) - && ((head t1_2) = "b") && ((head t1_2s) = "b") - && ((length t1_1) = 1) && ((length t1_1s) = 1) - && ((head t1_1) = "a") && ((head t1_1s) = "a") ) |> should equal true - -[] -let ``head, tail, and length work test 9``() = - let t1 = tail lena - let t1s = tail lenasnoc - let t1_8 = tail t1 - let t1_8s = tail t1s - let t1_7 = tail t1_8 - let t1_7s = tail t1_8s - let t1_6 = tail t1_7 - let t1_6s = tail t1_7s - let t1_5 = tail t1_6 - let t1_5s = tail t1_6s - let t1_4 = tail t1_5 - let t1_4s = tail t1_5s - let t1_3 = tail t1_4 - let t1_3s = tail t1_4s - let t1_2 = tail t1_3 - let t1_2s = tail t1_3s - let t1_1 = tail t1_2 - let t1_1s = tail t1_2s - - (((length t1) = 9) && ((length t1s) = 9) && ((head t1) = "i") && ((head t1s) = "i") - && ((length t1_8) = 8) && ((length t1_8s) = 8) && ((head t1_8) = "h") && ((head t1_8s) = "h") - && ((length t1_7) = 7) && ((length t1_7s) = 7) && ((head t1_7) = "g") && ((head t1_7s) = "g") - && ((length t1_6) = 6) && ((length t1_6s) = 6) && ((head t1_6) = "f") && ((head t1_6s) = "f") - && ((length t1_5) = 5) && ((length t1_5s) = 5) && ((head t1_5) = "e") && ((head t1_5s) = "e") - && ((length t1_4) = 4) && ((length t1_4s) = 4) && ((head t1_4) = "d") && ((head t1_4s) = "d") - && ((length t1_3) = 3) && ((length t1_3s) = 3) && ((head t1_3) = "c") && ((head t1_3s) = "c") - && ((length t1_2) = 2) && ((length t1_2s) = 2) && ((head t1_2) = "b") && ((head t1_2s) = "b") - && ((length t1_1) = 1) && ((length t1_1s) = 1) && ((head t1_1) = "a") && ((head t1_1s) = "a")) |> should equal true - -[] -//the previous series thoroughly tested construction by snoc, so we'll leave those out -let ``last, init, and length work test 1``() = - let t1 = init len2 - - (((length t1) = 1) && ((last t1) = "b")) |> should equal true +module DequeTest = + + let len1 = Deque.singleton "a" + let len2 = Deque.singleton "a" |> Deque.cons "b" + let len3 = Deque.singleton "a" |> Deque.cons "b" |> Deque.cons "c" + let len4 = Deque.singleton "a" |> Deque.cons "b" |> Deque.cons "c" |> Deque.cons "d" + let len5 = Deque.singleton "a" |> Deque.cons "b" |> Deque.cons "c" |> Deque.cons "d" |> Deque.cons "e" + let len6 = Deque.singleton "a" |> Deque.cons "b" |> Deque.cons "c" |> Deque.cons "d" |> Deque.cons "e" |> Deque.cons "f" + let len7 = Deque.singleton "a" |> Deque.cons "b" |> Deque.cons "c" |> Deque.cons "d" |> Deque.cons "e" |> Deque.cons "f" |> Deque.cons "g" + let len8 = Deque.singleton "a" |> Deque.cons "b" |> Deque.cons "c" |> Deque.cons "d" |> Deque.cons "e" |> Deque.cons "f" |> Deque.cons "g" |> Deque.cons "h" + let len9 = Deque.singleton "a" |> Deque.cons "b" |> Deque.cons "c" |> Deque.cons "d" |> Deque.cons "e" |> Deque.cons "f" |> Deque.cons "g" |> Deque.cons "h" |> Deque.cons "i" + let lena = Deque.singleton "a" |> Deque.cons "b" |> Deque.cons "c" |> Deque.cons "d" |> Deque.cons "e" |> Deque.cons "f" |> Deque.cons "g" |> Deque.cons "h" |> Deque.cons "i" |> Deque.cons "j" + + let len2snoc = Deque.singleton "b" |> Deque.snoc "a" + let len3snoc = Deque.singleton "c" |> Deque.snoc "b" |> Deque.snoc "a" + let len4snoc = Deque.singleton "d" |> Deque.snoc "c" |> Deque.snoc "b" |> Deque.snoc "a" + let len5snoc = Deque.singleton "e" |> Deque.snoc "d" |> Deque.snoc "c" |> Deque.snoc "b" |> Deque.snoc "a" + let len6snoc = Deque.singleton "f" |> Deque.snoc "e" |> Deque.snoc "d" |> Deque.snoc "c" |> Deque.snoc "b" |> Deque.snoc "a" + let len7snoc = Deque.singleton "g" |> Deque.snoc "f" |> Deque.snoc "e" |> Deque.snoc "d" |> Deque.snoc "c" |> Deque.snoc "b" |> Deque.snoc "a" + let len8snoc = Deque.singleton "h" |> Deque.snoc "g" |> Deque.snoc "f" |> Deque.snoc "e" |> Deque.snoc "d" |> Deque.snoc "c" |> Deque.snoc "b" |> Deque.snoc "a" + let len9snoc = Deque.singleton "i" |> Deque.snoc "h" |> Deque.snoc "g" |> Deque.snoc "f" |> Deque.snoc "e" |> Deque.snoc "d" |> Deque.snoc "c" |> Deque.snoc "b" |> Deque.snoc "a" + let lenasnoc = Deque.singleton "j" |> Deque.snoc "i" |> Deque.snoc "h" |> Deque.snoc "g" |> Deque.snoc "f" |> Deque.snoc "e" |> Deque.snoc "d" |> Deque.snoc "c" |> Deque.snoc "b" |> Deque.snoc "a" + + [] + let testDeque = + + testList "Experimental Deque" [ + test "empty dqueue should be empty" { + Expect.isTrue "empty is empty" (Deque.empty() |> Deque.isEmpty) } + + test "Deque.cons works" { + Expect.isFalse "not empty" (len2 |> Deque.isEmpty) } -[] -let ``last, init, and length work test 2``() = - let t1 = init len3 - let t1_1 = init t1 + test "Deque.snoc works" { + Expect.isFalse "" (len2snoc |> Deque.isEmpty) } + + test "Deque.singleton Deque.head works" { + Expect.equal "Deque.singleton" "a" (len1 |> Deque.head) } + + test "Deque.singleton Deque.last works" { + Expect.equal "" "a" (len1 |> Deque.last) } + + test "Deque.tail of Deque.singleton empty" { + Expect.isTrue "Deque.isEmpty" (len1 |> Deque.tail |> Deque.isEmpty) } + + test "Deque.tail of Deque.tail of 2 empty" { + Expect.isTrue "Deque.isEmpty" (len2 |> Deque.tail |> Deque.tail |> Deque.isEmpty) + Expect.isTrue "Deque.isEmpty" (len2snoc |> Deque.tail |> Deque.tail |> Deque.isEmpty) } + + test "initial of Deque.singleton empty" { + Expect.isTrue "Deque.isEmpty" (len1 |> Deque.init |> Deque.isEmpty) } + + test "Deque.head, Deque.tail, and Deque.length work test 1" { + let t1 = Deque.tail len2 + let t1s = Deque.tail len2snoc + Expect.isTrue "Deque.head, Deque.tail, and Deque.length" (((Deque.length t1) = 1) && ((Deque.length t1s) = 1) && ((Deque.head t1) = "a") && ((Deque.head t1s) = "a")) } + + test "Deque.head, Deque.tail, and Deque.length work test 2" { + let t1 = Deque.tail len3 + let t1s = Deque.tail len3snoc + + let t1_1 = Deque.tail t1 + let t1_1s = Deque.tail t1s + + (((Deque.length t1) = 2) && ((Deque.length t1s) = 2) && ((Deque.head t1) = "b") && ((Deque.head t1s) = "b") && ((Deque.length t1_1) = 1) && ((Deque.length t1_1s) = 1) + && ((Deque.head t1_1) = "a") && ((Deque.head t1_1s) = "a")) |> Expect.isTrue "Deque.head, Deque.tail, and Deque.length" } + + test "Deque.head, Deque.tail, and Deque.length work test 3" { + let t1 = Deque.tail len4 + let t1s = Deque.tail len4snoc + + let t1_2 = Deque.tail t1 + let t1_2s = Deque.tail t1s + + let t1_1 = Deque.tail t1_2 + let t1_1s = Deque.tail t1_2s + + (((Deque.length t1) = 3) && ((Deque.length t1s) = 3) && ((Deque.head t1) = "c")&& ((Deque.head t1s) = "c") && ((Deque.length t1_2) = 2) && ((Deque.length t1_2s) = 2) + && ((Deque.head t1_2) = "b") && ((Deque.head t1_2s) = "b") && ((Deque.length t1_1) = 1) && ((Deque.length t1_1s) = 1) && ((Deque.head t1_1) = "a") + && ((Deque.head t1_1s) = "a")) |> Expect.isTrue "Deque.head, Deque.tail, and Deque.length" } + + test "Deque.head, Deque.tail, and Deque.length work test 4" { + let t1 = Deque.tail len5 + let t1s = Deque.tail len5snoc + + let t1_3 = Deque.tail t1 + let t1_3s = Deque.tail t1s + + let t1_2 = Deque.tail t1_3 + let t1_2s = Deque.tail t1_3s + + let t1_1 = Deque.tail t1_2 + let t1_1s = Deque.tail t1_2s + + (((Deque.length t1) = 4) && ((Deque.length t1s) = 4) && ((Deque.head t1) = "d") && ((Deque.head t1s) = "d") && ((Deque.length t1_3) = 3) && ((Deque.length t1_3s) = 3) + && ((Deque.head t1_3) = "c") && ((Deque.head t1_3s) = "c") && ((Deque.length t1_2) = 2) && ((Deque.length t1_2s) = 2) && ((Deque.head t1_2) = "b") && ((Deque.head t1_2s) = "b") + && ((Deque.length t1_1) = 1) && ((Deque.length t1_1s) = 1) && ((Deque.head t1_1) = "a") && ((Deque.head t1_1s) = "a")) |> Expect.isTrue "Deque.head, Deque.tail, and Deque.length" } + + test "Deque.head, Deque.tail, and Deque.length work test 5" { + let t1 = Deque.tail len6 + let t1s = Deque.tail len6snoc + + let t1_4 = Deque.tail t1 + let t1_4s = Deque.tail t1s + + let t1_3 = Deque.tail t1_4 + let t1_3s = Deque.tail t1_4s + + let t1_2 = Deque.tail t1_3 + let t1_2s = Deque.tail t1_3s + + let t1_1 = Deque.tail t1_2 + let t1_1s = Deque.tail t1_2s + + (((Deque.length t1) = 5) && ((Deque.length t1s) = 5) && ((Deque.head t1) = "e") && ((Deque.head t1s) = "e") && ((Deque.length t1_4) = 4) && ((Deque.length t1_4s) = 4) + && ((Deque.head t1_4) = "d") && ((Deque.head t1_4s) = "d") && ((Deque.length t1_3) = 3) && ((Deque.length t1_3s) = 3) && ((Deque.head t1_3) = "c") && ((Deque.head t1_3s) = "c") + && ((Deque.length t1_2) = 2) && ((Deque.length t1_2s) = 2) && ((Deque.head t1_2) = "b") && ((Deque.head t1_2s) = "b") && ((Deque.length t1_1) = 1) && ((Deque.length t1_1s) = 1) + && ((Deque.head t1_1) = "a") && ((Deque.head t1_1s) = "a")) |> Expect.isTrue "Deque.head, Deque.tail, and Deque.length" } + + test "Deque.head, Deque.tail, and Deque.length work test 6" { + let t1 = Deque.tail len7 + let t1s = Deque.tail len7snoc + + let t1_5 = Deque.tail t1 + let t1_5s = Deque.tail t1s + + let t1_4 = Deque.tail t1_5 + let t1_4s = Deque.tail t1_5s + + let t1_3 = Deque.tail t1_4 + let t1_3s = Deque.tail t1_4s + + let t1_2 = Deque.tail t1_3 + let t1_2s = Deque.tail t1_3s + + let t1_1 = Deque.tail t1_2 + let t1_1s = Deque.tail t1_2s + + (((Deque.length t1) = 6) && ((Deque.length t1s) = 6) + && ((Deque.head t1) = "f") && ((Deque.head t1s) = "f") + && ((Deque.length t1_5) = 5) && ((Deque.length t1_5s) = 5) + && ((Deque.head t1_5) = "e") && ((Deque.head t1_5s) = "e") + && ((Deque.length t1_4) = 4) && ((Deque.length t1_4s) = 4) + && ((Deque.head t1_4) = "d") && ((Deque.head t1_4s) = "d") + && ((Deque.length t1_3) = 3) && ((Deque.length t1_3s) = 3) + && ((Deque.head t1_3) = "c") && ((Deque.head t1_3s) = "c") + && ((Deque.length t1_2) = 2) && ((Deque.length t1_2s) = 2) + && ((Deque.head t1_2) = "b") && ((Deque.head t1_2s) = "b") + && ((Deque.length t1_1) = 1) && ((Deque.length t1_1s) = 1) + && ((Deque.head t1_1) = "a") && ((Deque.head t1_1s) = "a") ) |> Expect.isTrue "Deque.head, Deque.tail, and Deque.length" } + + test "Deque.head, Deque.tail, and Deque.length work test 7" { + let t1 = Deque.tail len8 + let t1s = Deque.tail len8snoc + let t1_6 = Deque.tail t1 + let t1_6s = Deque.tail t1s + let t1_5 = Deque.tail t1_6 + let t1_5s = Deque.tail t1_6s + let t1_4 = Deque.tail t1_5 + let t1_4s = Deque.tail t1_5s + let t1_3 = Deque.tail t1_4 + let t1_3s = Deque.tail t1_4s + let t1_2 = Deque.tail t1_3 + let t1_2s = Deque.tail t1_3s + let t1_1 = Deque.tail t1_2 + let t1_1s = Deque.tail t1_2s + + (((Deque.length t1) = 7) && ((Deque.length t1s) = 7) + && ((Deque.head t1) = "g") && ((Deque.head t1s) = "g") + && ((Deque.length t1_6) = 6) && ((Deque.length t1_6s) = 6) + && ((Deque.head t1_6) = "f") && ((Deque.head t1_6s) = "f") + && ((Deque.length t1_5) = 5) && ((Deque.length t1_5s) = 5) + && ((Deque.head t1_5) = "e") && ((Deque.head t1_5s) = "e") + && ((Deque.length t1_4) = 4) && ((Deque.length t1_4s) = 4) + && ((Deque.head t1_4) = "d") && ((Deque.head t1_4s) = "d") + && ((Deque.length t1_3) = 3) && ((Deque.length t1_3s) = 3) + && ((Deque.head t1_3) = "c") && ((Deque.head t1_3s) = "c") + && ((Deque.length t1_2) = 2) && ((Deque.length t1_2s) = 2) + && ((Deque.head t1_2) = "b") && ((Deque.head t1_2s) = "b") + && ((Deque.length t1_1) = 1) && ((Deque.length t1_1s) = 1) + && ((Deque.head t1_1) = "a") && ((Deque.head t1_1s) = "a") ) |> Expect.isTrue "Deque.head, Deque.tail, and Deque.length" } + + test "Deque.head, Deque.tail, and Deque.length work test 8" { + let t1 = Deque.tail len9 + let t1s = Deque.tail len9snoc + let t1_7 = Deque.tail t1 + let t1_7s = Deque.tail t1s + let t1_6 = Deque.tail t1_7 + let t1_6s = Deque.tail t1_7s + let t1_5 = Deque.tail t1_6 + let t1_5s = Deque.tail t1_6s + let t1_4 = Deque.tail t1_5 + let t1_4s = Deque.tail t1_5s + let t1_3 = Deque.tail t1_4 + let t1_3s = Deque.tail t1_4s + let t1_2 = Deque.tail t1_3 + let t1_2s = Deque.tail t1_3s + let t1_1 = Deque.tail t1_2 + let t1_1s = Deque.tail t1_2s + + (((Deque.length t1) = 8) && ((Deque.length t1s) = 8) + && ((Deque.head t1) = "h") && ((Deque.head t1s) = "h") + && ((Deque.length t1_7) = 7) && ((Deque.length t1_7s) = 7) + && ((Deque.head t1_7) = "g") && ((Deque.head t1_7s) = "g") + && ((Deque.length t1_6) = 6) && ((Deque.length t1_6s) = 6) + && ((Deque.head t1_6) = "f") && ((Deque.head t1_6s) = "f") + && ((Deque.length t1_5) = 5) && ((Deque.length t1_5s) = 5) + && ((Deque.head t1_5) = "e") && ((Deque.head t1_5s) = "e") + && ((Deque.length t1_4) = 4) && ((Deque.length t1_4s) = 4) + && ((Deque.head t1_4) = "d") && ((Deque.head t1_4s) = "d") + && ((Deque.length t1_3) = 3) && ((Deque.length t1_3s) = 3) + && ((Deque.head t1_3) = "c") && ((Deque.head t1_3s) = "c") + && ((Deque.length t1_2) = 2) && ((Deque.length t1_2s) = 2) + && ((Deque.head t1_2) = "b") && ((Deque.head t1_2s) = "b") + && ((Deque.length t1_1) = 1) && ((Deque.length t1_1s) = 1) + && ((Deque.head t1_1) = "a") && ((Deque.head t1_1s) = "a") ) |> Expect.isTrue "Deque.head, Deque.tail, and Deque.length" } + + test "Deque.head, Deque.tail, and Deque.length work test 9" { + let t1 = Deque.tail lena + let t1s = Deque.tail lenasnoc + let t1_8 = Deque.tail t1 + let t1_8s = Deque.tail t1s + let t1_7 = Deque.tail t1_8 + let t1_7s = Deque.tail t1_8s + let t1_6 = Deque.tail t1_7 + let t1_6s = Deque.tail t1_7s + let t1_5 = Deque.tail t1_6 + let t1_5s = Deque.tail t1_6s + let t1_4 = Deque.tail t1_5 + let t1_4s = Deque.tail t1_5s + let t1_3 = Deque.tail t1_4 + let t1_3s = Deque.tail t1_4s + let t1_2 = Deque.tail t1_3 + let t1_2s = Deque.tail t1_3s + let t1_1 = Deque.tail t1_2 + let t1_1s = Deque.tail t1_2s + + (((Deque.length t1) = 9) && ((Deque.length t1s) = 9) && ((Deque.head t1) = "i") && ((Deque.head t1s) = "i") + && ((Deque.length t1_8) = 8) && ((Deque.length t1_8s) = 8) && ((Deque.head t1_8) = "h") && ((Deque.head t1_8s) = "h") + && ((Deque.length t1_7) = 7) && ((Deque.length t1_7s) = 7) && ((Deque.head t1_7) = "g") && ((Deque.head t1_7s) = "g") + && ((Deque.length t1_6) = 6) && ((Deque.length t1_6s) = 6) && ((Deque.head t1_6) = "f") && ((Deque.head t1_6s) = "f") + && ((Deque.length t1_5) = 5) && ((Deque.length t1_5s) = 5) && ((Deque.head t1_5) = "e") && ((Deque.head t1_5s) = "e") + && ((Deque.length t1_4) = 4) && ((Deque.length t1_4s) = 4) && ((Deque.head t1_4) = "d") && ((Deque.head t1_4s) = "d") + && ((Deque.length t1_3) = 3) && ((Deque.length t1_3s) = 3) && ((Deque.head t1_3) = "c") && ((Deque.head t1_3s) = "c") + && ((Deque.length t1_2) = 2) && ((Deque.length t1_2s) = 2) && ((Deque.head t1_2) = "b") && ((Deque.head t1_2s) = "b") + && ((Deque.length t1_1) = 1) && ((Deque.length t1_1s) = 1) && ((Deque.head t1_1) = "a") && ((Deque.head t1_1s) = "a")) |> Expect.isTrue "Deque.head, Deque.tail, and Deque.length" } + + ////the previous series thoroughly tested construction by Deque.snoc, so we'll leave those out + + test "Deque.last, Deque.init, and Deque.length work test 1" { + let t1 = Deque.init len2 + Expect.isTrue "Deque.last, Deque.init, and Deque.length" (((Deque.length t1) = 1) && ((Deque.last t1) = "b")) } + + test "Deque.last, Deque.init, and Deque.length work test 2" { + let t1 = Deque.init len3 + let t1_1 = Deque.init t1 - (((length t1) = 2) && ((last t1) = "b") && ((length t1_1) = 1) && ((last t1_1) = "c") ) |> should equal true + Expect.isTrue "Deque.last, Deque.init, and Deque.length" (((Deque.length t1) = 2) && ((Deque.last t1) = "b") && ((Deque.length t1_1) = 1) && ((Deque.last t1_1) = "c") ) } -[] -let ``last, init, and length work test 3``() = - let t1 = init len4 - let t1_1 = init t1 - let t1_2 = init t1_1 + test "Deque.last, Deque.init, and Deque.length work test 3" { + let t1 = Deque.init len4 + let t1_1 = Deque.init t1 + let t1_2 = Deque.init t1_1 - (((length t1) = 3) && ((last t1) = "b") - && ((length t1_1) = 2) && ((last t1_1) = "c") - && ((length t1_2) = 1) && ((last t1_2) = "d") ) |> should equal true - -[] -let ``last, init, and length work test 4``() = - let t1 = init len5 - let t1_1 = init t1 - let t1_2 = init t1_1 - let t1_3 = init t1_2 + (((Deque.length t1) = 3) && ((Deque.last t1) = "b") + && ((Deque.length t1_1) = 2) && ((Deque.last t1_1) = "c") + && ((Deque.length t1_2) = 1) && ((Deque.last t1_2) = "d") ) |> Expect.isTrue "Deque.last, Deque.init, and Deque.length" } + + test "Deque.last, Deque.init, and Deque.length work test 4" { + let t1 = Deque.init len5 + let t1_1 = Deque.init t1 + let t1_2 = Deque.init t1_1 + let t1_3 = Deque.init t1_2 - (((length t1) = 4) && ((last t1) = "b") - && ((length t1_1) = 3) && ((last t1_1) = "c") - && ((length t1_2) = 2) && ((last t1_2) = "d") - && ((length t1_3) = 1) && ((last t1_3) = "e") ) |> should equal true - -[] -let ``last, init, and length work test 5``() = - let t1 = init len6 - let t1_1 = init t1 - let t1_2 = init t1_1 - let t1_3 = init t1_2 - let t1_4 = init t1_3 + (((Deque.length t1) = 4) && ((Deque.last t1) = "b") + && ((Deque.length t1_1) = 3) && ((Deque.last t1_1) = "c") + && ((Deque.length t1_2) = 2) && ((Deque.last t1_2) = "d") + && ((Deque.length t1_3) = 1) && ((Deque.last t1_3) = "e") ) |> Expect.isTrue "Deque.last, Deque.init, and Deque.length" } + + test "Deque.last, Deque.init, and Deque.length work test 5" { + let t1 = Deque.init len6 + let t1_1 = Deque.init t1 + let t1_2 = Deque.init t1_1 + let t1_3 = Deque.init t1_2 + let t1_4 = Deque.init t1_3 - (((length t1) = 5) && ((last t1) = "b") - && ((length t1_1) = 4) && ((last t1_1) = "c") - && ((length t1_2) = 3) && ((last t1_2) = "d") - && ((length t1_3) = 2) && ((last t1_3) = "e") - && ((length t1_4) = 1) && ((last t1_4) = "f") ) |> should equal true - -[] -let ``last, init, and length work test 6``() = - let t1 = init len7 - let t1_1 = init t1 - let t1_2 = init t1_1 - let t1_3 = init t1_2 - let t1_4 = init t1_3 - let t1_5 = init t1_4 + (((Deque.length t1) = 5) && ((Deque.last t1) = "b") + && ((Deque.length t1_1) = 4) && ((Deque.last t1_1) = "c") + && ((Deque.length t1_2) = 3) && ((Deque.last t1_2) = "d") + && ((Deque.length t1_3) = 2) && ((Deque.last t1_3) = "e") + && ((Deque.length t1_4) = 1) && ((Deque.last t1_4) = "f") ) |> Expect.isTrue "Deque.last, Deque.init, and Deque.length" } + + test "Deque.last, Deque.init, and Deque.length work test 6" { + let t1 = Deque.init len7 + let t1_1 = Deque.init t1 + let t1_2 = Deque.init t1_1 + let t1_3 = Deque.init t1_2 + let t1_4 = Deque.init t1_3 + let t1_5 = Deque.init t1_4 - (((length t1) = 6) && ((last t1) = "b") - && ((length t1_1) = 5) && ((last t1_1) = "c") - && ((length t1_2) = 4) && ((last t1_2) = "d") - && ((length t1_3) = 3) && ((last t1_3) = "e") - && ((length t1_4) = 2) && ((last t1_4) = "f") - && ((length t1_5) = 1) && ((last t1_5) = "g") ) |> should equal true - -[] -let ``last, init, and length work test 7``() = - let t1 = init len8 - let t1_1 = init t1 - let t1_2 = init t1_1 - let t1_3 = init t1_2 - let t1_4 = init t1_3 - let t1_5 = init t1_4 - let t1_6 = init t1_5 + (((Deque.length t1) = 6) && ((Deque.last t1) = "b") + && ((Deque.length t1_1) = 5) && ((Deque.last t1_1) = "c") + && ((Deque.length t1_2) = 4) && ((Deque.last t1_2) = "d") + && ((Deque.length t1_3) = 3) && ((Deque.last t1_3) = "e") + && ((Deque.length t1_4) = 2) && ((Deque.last t1_4) = "f") + && ((Deque.length t1_5) = 1) && ((Deque.last t1_5) = "g") ) |> Expect.isTrue "Deque.last, Deque.init, and Deque.length" } + + test "Deque.last, Deque.init, and Deque.length work test 7" { + let t1 = Deque.init len8 + let t1_1 = Deque.init t1 + let t1_2 = Deque.init t1_1 + let t1_3 = Deque.init t1_2 + let t1_4 = Deque.init t1_3 + let t1_5 = Deque.init t1_4 + let t1_6 = Deque.init t1_5 - (((length t1) = 7) && ((last t1) = "b") - && ((length t1_1) = 6) && ((last t1_1) = "c") - && ((length t1_2) = 5) && ((last t1_2) = "d") - && ((length t1_3) = 4) && ((last t1_3) = "e") - && ((length t1_4) = 3) && ((last t1_4) = "f") - && ((length t1_5) = 2) && ((last t1_5) = "g") - && ((length t1_6) = 1) && ((last t1_6) = "h") ) |> should equal true - -[] -let ``last, init, and length work test 8``() = - let t1 = init len9 - let t1_1 = init t1 - let t1_2 = init t1_1 - let t1_3 = init t1_2 - let t1_4 = init t1_3 - let t1_5 = init t1_4 - let t1_6 = init t1_5 - let t1_7 = init t1_6 + (((Deque.length t1) = 7) && ((Deque.last t1) = "b") + && ((Deque.length t1_1) = 6) && ((Deque.last t1_1) = "c") + && ((Deque.length t1_2) = 5) && ((Deque.last t1_2) = "d") + && ((Deque.length t1_3) = 4) && ((Deque.last t1_3) = "e") + && ((Deque.length t1_4) = 3) && ((Deque.last t1_4) = "f") + && ((Deque.length t1_5) = 2) && ((Deque.last t1_5) = "g") + && ((Deque.length t1_6) = 1) && ((Deque.last t1_6) = "h") ) |> Expect.isTrue "Deque.last, Deque.init, and Deque.length" } + + test "Deque.last, Deque.init, and Deque.length work test 8" { + let t1 = Deque.init len9 + let t1_1 = Deque.init t1 + let t1_2 = Deque.init t1_1 + let t1_3 = Deque.init t1_2 + let t1_4 = Deque.init t1_3 + let t1_5 = Deque.init t1_4 + let t1_6 = Deque.init t1_5 + let t1_7 = Deque.init t1_6 - (((length t1) = 8) && ((last t1) = "b") - && ((length t1_1) = 7) && ((last t1_1) = "c") - && ((length t1_2) = 6) && ((last t1_2) = "d") - && ((length t1_3) = 5) && ((last t1_3) = "e") - && ((length t1_4) = 4) && ((last t1_4) = "f") - && ((length t1_5) = 3) && ((last t1_5) = "g") - && ((length t1_6) = 2) && ((last t1_6) = "h") - && ((length t1_7) = 1) && ((last t1_7) = "i") ) |> should equal true - -[] -let ``last, init, and length work test 9``() = - let t1 = init lena - let t1_1 = init t1 - let t1_2 = init t1_1 - let t1_3 = init t1_2 - let t1_4 = init t1_3 - let t1_5 = init t1_4 - let t1_6 = init t1_5 - let t1_7 = init t1_6 - let t1_8 = init t1_7 + (((Deque.length t1) = 8) && ((Deque.last t1) = "b") + && ((Deque.length t1_1) = 7) && ((Deque.last t1_1) = "c") + && ((Deque.length t1_2) = 6) && ((Deque.last t1_2) = "d") + && ((Deque.length t1_3) = 5) && ((Deque.last t1_3) = "e") + && ((Deque.length t1_4) = 4) && ((Deque.last t1_4) = "f") + && ((Deque.length t1_5) = 3) && ((Deque.last t1_5) = "g") + && ((Deque.length t1_6) = 2) && ((Deque.last t1_6) = "h") + && ((Deque.length t1_7) = 1) && ((Deque.last t1_7) = "i") ) |> Expect.isTrue "Deque.last, Deque.init, and Deque.length" } + + test "Deque.last, Deque.init, and Deque.length work test 9" { + let t1 = Deque.init lena + let t1_1 = Deque.init t1 + let t1_2 = Deque.init t1_1 + let t1_3 = Deque.init t1_2 + let t1_4 = Deque.init t1_3 + let t1_5 = Deque.init t1_4 + let t1_6 = Deque.init t1_5 + let t1_7 = Deque.init t1_6 + let t1_8 = Deque.init t1_7 - (((length t1) = 9) && ((last t1) = "b") - && ((length t1_1) = 8) && ((last t1_1) = "c") - && ((length t1_2) = 7) && ((last t1_2) = "d") - && ((length t1_3) = 6) && ((last t1_3) = "e") - && ((length t1_4) = 5) && ((last t1_4) = "f") - && ((length t1_5) = 4) && ((last t1_5) = "g") - && ((length t1_6) = 3) && ((last t1_6) = "h") - && ((length t1_7) = 2) && ((last t1_7) = "i") - && ((length t1_8) = 1) && ((last t1_8) = "j") ) |> should equal true - -[] -let ``IEnumerable Seq``() = - (lena |> Seq.toArray).[5] |> should equal "e" - -[] -let ``IEnumerable Seq length``() = - lena |> Seq.length |> should equal 10 - -[] -let ``type cons works``() = - lena.Cons "zz" |> head |> should equal "zz" - -[] -let ``IDeque cons works``() = - ((lena :> IDeque).Cons "zz").Head |> should equal "zz" - -[] -let ``ofCatLists and uncons``() = - let d = ofCatLists ["a";"b";"c"] ["d";"e";"f"] - let h1, t1 = uncons d - let h2, t2 = uncons t1 - let h3, t3 = uncons t2 - let h4, t4 = uncons t3 - let h5, t5 = uncons t4 - let h6, t6 = uncons t5 - - ((h1 = "a") && (h2 = "b") && (h3 = "c") && (h4 = "d") && (h5 = "e") && (h6 = "f") && (isEmpty t6)) |> should equal true - -[] -let ``unsnoc works``() = - let d = ofCatLists ["f";"e";"d"] ["c";"b";"a"] - let i1, l1 = unsnoc d - let i2, l2 = unsnoc i1 - let i3, l3 = unsnoc i2 - let i4, l4 = unsnoc i3 - let i5, l5 = unsnoc i4 - let i6, l6 = unsnoc i5 - - ((l1 = "a") && (l2 = "b") && (l3 = "c") && (l4 = "d") && (l5 = "e") && (l6 = "f") && (isEmpty i6)) |> should equal true - -[] -let ``snoc pattern discriminator``() = - let d = (ofCatLists ["f";"e";"d"] ["c";"b";"a"]) - let i1, l1 = unsnoc d - - let i2, l2 = - match i1 with - | Snoc(i, l) -> i, l - | _ -> i1, "x" - - ((l2 = "b") && ((length i2) = 4)) |> should equal true - -[] -let ``cons pattern discriminator``() = - let d = (ofCatLists ["f";"e";"d"] ["c";"b";"a"]) - let h1, t1 = uncons d - - let h2, t2 = - match t1 with - | Cons(h, t) -> h, t - | _ -> "x", t1 - - ((h2 = "e") && ((length t2) = 4)) |> should equal true - -[] -let ``cons and snoc pattern discriminator``() = - let d = (ofCatLists ["f";"e";"d"] ["c";"b";"a"]) + (((Deque.length t1) = 9) && ((Deque.last t1) = "b") + && ((Deque.length t1_1) = 8) && ((Deque.last t1_1) = "c") + && ((Deque.length t1_2) = 7) && ((Deque.last t1_2) = "d") + && ((Deque.length t1_3) = 6) && ((Deque.last t1_3) = "e") + && ((Deque.length t1_4) = 5) && ((Deque.last t1_4) = "f") + && ((Deque.length t1_5) = 4) && ((Deque.last t1_5) = "g") + && ((Deque.length t1_6) = 3) && ((Deque.last t1_6) = "h") + && ((Deque.length t1_7) = 2) && ((Deque.last t1_7) = "i") + && ((Deque.length t1_8) = 1) && ((Deque.last t1_8) = "j") ) |> Expect.isTrue "Deque.last, Deque.init, and Deque.length" } + + test "IEnumerable Seq nth" { + Expect.equal "IEnumerable nth" "e" (lena |> Seq.item 5) } + + test "IEnumerable Seq Deque.length" { + Expect.equal "IEnumerable Deque.length" 10 (lena |> Seq.length) } + + test "type Deque.cons works" { + Expect.equal "Deque.cons" "zz" (lena.Cons "zz" |> Deque.head) } + + test "IDeque Deque.cons works" { + ((lena :> IDeque).Cons "zz").Head |> Expect.equal "zz" } + + test "Deque.ofCatLists and Deque.uncons" { + let d = Deque.ofCatLists ["a";"b";"c"] ["d";"e";"f"] + let h1, t1 = Deque.uncons d + let h2, t2 = Deque.uncons t1 + let h3, t3 = Deque.uncons t2 + let h4, t4 = Deque.uncons t3 + let h5, t5 = Deque.uncons t4 + let h6, t6 = Deque.uncons t5 + + Expect.isTrue "Deque.ofCatLists and Deque.uncons" ((h1 = "a") && (h2 = "b") && (h3 = "c") && (h4 = "d") && (h5 = "e") && (h6 = "f") && (Deque.isEmpty t6)) } + + test "Deque.unsnoc works" { + let d = Deque.ofCatLists ["f";"e";"d"] ["c";"b";"a"] + let i1, l1 = Deque.unsnoc d + let i2, l2 = Deque.unsnoc i1 + let i3, l3 = Deque.unsnoc i2 + let i4, l4 = Deque.unsnoc i3 + let i5, l5 = Deque.unsnoc i4 + let i6, l6 = Deque.unsnoc i5 + + Expect.isTrue "Deque.unsnoc" ((l1 = "a") && (l2 = "b") && (l3 = "c") && (l4 = "d") && (l5 = "e") && (l6 = "f") && (Deque.isEmpty i6)) } + + test "Deque.snoc pattern discriminator" { + let d = (Deque.ofCatLists ["f";"e";"d"] ["c";"b";"a"]) + let i1, l1 = Deque.unsnoc d + + let i2, l2 = + match i1 with + | Deque.Snoc(i, l) -> i, l + | _ -> i1, "x" + + Expect.isTrue "Deque.snoc" ((l2 = "b") && ((Deque.length i2) = 4)) } + + test "Deque.cons pattern discriminator" { + let d = (Deque.ofCatLists ["f";"e";"d"] ["c";"b";"a"]) + let h1, t1 = Deque.uncons d + + let h2, t2 = + match t1 with + | Deque.Cons(h, t) -> h, t + | _ -> "x", t1 + + Expect.isTrue "Deque.cons" ((h2 = "e") && ((Deque.length t2) = 4)) } + + test "Deque.cons and Deque.snoc pattern discriminator" { + let d = (Deque.ofCatLists ["f";"e";"d"] ["c";"b";"a"]) - let mid1 = - match d with - | Cons(h, Snoc(i, l)) -> i - | _ -> d - - let head, last = - match mid1 with - | Cons(h, Snoc(i, l)) -> h, l - | _ -> "x", "x" - - ((head = "e") && (last = "b")) |> should equal true - -[] -let ``rev empty dqueue should be empty``() = - empty() |> rev |> isEmpty |> should equal true - -[] -let ``rev dqueue length 1``() = - rev len1 |> head |> should equal "a" - -[] -let ``rev dqueue length 2``() = - let r1 = rev len2 - let h1 = head r1 - let t2 = tail r1 - let h2 = head t2 - - ((h1 = "a") && (h2 = "b")) |> should equal true - -[] -let ``rev dqueue length 3``() = - let r1 = rev len3 - let h1 = head r1 - let t2 = tail r1 - let h2 = head t2 - let t3 = tail t2 - let h3 = head t3 - - ((h1 = "a") && (h2 = "b") && (h3 = "c")) |> should equal true - -[] -let ``rev dqueue length 4``() = - let r1 = rev len4 - let h1 = head r1 - let t2 = tail r1 - let h2 = head t2 - let t3 = tail t2 - let h3 = head t3 - let t4 = tail t3 - let h4 = head t4 - - ((h1 = "a") && (h2 = "b") && (h3 = "c") && (h4 = "d")) |> should equal true - -[] -let ``rev dqueue length 5``() = - let r1 = rev len5 - let h1 = head r1 - let t2 = tail r1 - let h2 = head t2 - let t3 = tail t2 - let h3 = head t3 - let t4 = tail t3 - let h4 = head t4 - let t5 = tail t4 - let h5 = head t5 - - ((h1 = "a") && (h2 = "b") && (h3 = "c") && (h4 = "d") && (h5 = "e")) |> should equal true - -[] -//length 6 more than sufficient to test rev -let ``rev dqueue length 6``() = - let r1 = rev len6 - let h1 = head r1 - let t2 = tail r1 - let h2 = head t2 - let t3 = tail t2 - let h3 = head t3 - let t4 = tail t3 - let h4 = head t4 - let t5 = tail t4 - let h5 = head t5 - let t6 = tail t5 - let h6 = head t6 - - ((h1 = "a") && (h2 = "b") && (h3 = "c") && (h4 = "d") && (h5 = "e") && (h6 = "f")) |> should equal true - -[] -let ``lookup length 1``() = - len1 |> lookup 0 |> should equal "a" - -[] -let ``lookup length 2``() = - (((len2 |> lookup 0) = "b") && ((len2 |> lookup 1) = "a")) |> should equal true - -[] -let ``lookup length 3``() = - (((len3 |> lookup 0) = "c") && ((len3 |> lookup 1) = "b") && ((len3 |> lookup 2) = "a")) |> should equal true - -[] -let ``lookup length 4``() = - (((len4 |> lookup 0) = "d") && ((len4 |> lookup 1) = "c") && ((len4 |> lookup 2) = "b") && ((len4 |> lookup 3) = "a")) - |> should equal true - -[] -let ``lookup length 5``() = - (((len5 |> lookup 0) = "e") && ((len5 |> lookup 1) = "d") && ((len5 |> lookup 2) = "c") && ((len5 |> lookup 3) = "b") - && ((len5 |> lookup 4) = "a")) |> should equal true - -[] -let ``lookup length 6``() = - (((len6 |> lookup 0) = "f") && ((len6 |> lookup 1) = "e") && ((len6 |> lookup 2) = "d") && ((len6 |> lookup 3) = "c") - && ((len6 |> lookup 4) = "b") && ((len6 |> lookup 5) = "a")) |> should equal true - -[] -let ``lookup length 7``() = - (((len7 |> lookup 0) = "g") && ((len7 |> lookup 1) = "f") && ((len7 |> lookup 2) = "e") && ((len7 |> lookup 3) = "d") - && ((len7 |> lookup 4) = "c") && ((len7 |> lookup 5) = "b") && ((len7 |> lookup 6) = "a")) |> should equal true - -[] -let ``lookup length 8``() = - (((len8 |> lookup 0) = "h") && ((len8 |> lookup 1) = "g") && ((len8 |> lookup 2) = "f") && ((len8 |> lookup 3) = "e") - && ((len8 |> lookup 4) = "d") && ((len8 |> lookup 5) = "c") && ((len8 |> lookup 6) = "b") && ((len8 |> lookup 7) = "a")) - |> should equal true - -[] -let ``lookup length 9``() = - (((len9 |> lookup 0) = "i") && ((len9 |> lookup 1) = "h") && ((len9 |> lookup 2) = "g") && ((len9 |> lookup 3) = "f") - && ((len9 |> lookup 4) = "e") && ((len9 |> lookup 5) = "d") && ((len9 |> lookup 6) = "c") && ((len9 |> lookup 7) = "b") - && ((len9 |> lookup 8) = "a")) |> should equal true - -[] -let ``lookup length 10``() = - (((lena |> lookup 0) = "j") && ((lena |> lookup 1) = "i") && ((lena |> lookup 2) = "h") && ((lena |> lookup 3) = "g") - && ((lena |> lookup 4) = "f") && ((lena |> lookup 5) = "e") && ((lena |> lookup 6) = "d") && ((lena |> lookup 7) = "c") - && ((lena |> lookup 8) = "b") && ((lena |> lookup 9) = "a")) |> should equal true - -[] -let ``tryLookup length 1``() = - let a = len1 |> tryLookup 0 - (a.Value = "a") |> should equal true - -[] -let ``tryLookup length 2``() = - let b = len2 |> tryLookup 0 - let a = len2 |> tryLookup 1 - ((b.Value = "b") && (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 3``() = - let c = len3 |> tryLookup 0 - let b = len3 |> tryLookup 1 - let a = len3 |> tryLookup 2 - ((c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 4``() = - let d = len4 |> tryLookup 0 - let c = len4 |> tryLookup 1 - let b = len4 |> tryLookup 2 - let a = len4 |> tryLookup 3 - ((d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 5``() = - let e = len5 |> tryLookup 0 - let d = len5 |> tryLookup 1 - let c = len5 |> tryLookup 2 - let b = len5 |> tryLookup 3 - let a = len5 |> tryLookup 4 - ((e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 6``() = - let f = len6 |> tryLookup 0 - let e = len6 |> tryLookup 1 - let d = len6 |> tryLookup 2 - let c = len6 |> tryLookup 3 - let b = len6 |> tryLookup 4 - let a = len6 |> tryLookup 5 - ((f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) - |> should equal true - -[] -let ``tryLookup length 7``() = - let g = len7 |> tryLookup 0 - let f = len7 |> tryLookup 1 - let e = len7 |> tryLookup 2 - let d = len7 |> tryLookup 3 - let c = len7 |> tryLookup 4 - let b = len7 |> tryLookup 5 - let a = len7 |> tryLookup 6 - ((g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") - && (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 8``() = - let h = len8 |> tryLookup 0 - let g = len8 |> tryLookup 1 - let f = len8 |> tryLookup 2 - let e = len8 |> tryLookup 3 - let d = len8 |> tryLookup 4 - let c = len8 |> tryLookup 5 - let b = len8 |> tryLookup 6 - let a = len8 |> tryLookup 7 - ((h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") - && (b.Value = "b")&& (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 9``() = - let i = len9 |> tryLookup 0 - let h = len9 |> tryLookup 1 - let g = len9 |> tryLookup 2 - let f = len9 |> tryLookup 3 - let e = len9 |> tryLookup 4 - let d = len9 |> tryLookup 5 - let c = len9 |> tryLookup 6 - let b = len9 |> tryLookup 7 - let a = len9 |> tryLookup 8 - ((i.Value = "i") && (h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") - && (c.Value = "c") && (b.Value = "b")&& (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 10``() = - let j = lena |> tryLookup 0 - let i = lena |> tryLookup 1 - let h = lena |> tryLookup 2 - let g = lena |> tryLookup 3 - let f = lena |> tryLookup 4 - let e = lena |> tryLookup 5 - let d = lena |> tryLookup 6 - let c = lena |> tryLookup 7 - let b = lena |> tryLookup 8 - let a = lena |> tryLookup 9 - ((j.Value = "j") && (i.Value = "i") && (h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") - && (d.Value = "d") && (c.Value = "c") && (b.Value = "b")&& (a.Value = "a")) |> should equal true - -[] -let ``tryLookup not found``() = - lena |> tryLookup 10 |> should equal None - -[] -let ``remove elements length 1``() = - len1 |> remove 0 |> isEmpty |> should equal true - -[] -let ``remove elements length 2``() = - let a = len2 |> remove 0 |> head - let b = len2 |> remove 1 |> head - ((a = "a") && (b = "b")) |> should equal true - -[] -let ``remove elements length 3``() = - let r0 = (ofSeq ["a";"b";"c"]) |> remove 0 - let b0 = head r0 - let t0 = tail r0 - let c0 = head t0 - - let r1 = (ofSeq ["a";"b";"c"]) |> remove 1 - let a1 = head r1 - let t1 = tail r1 - let c1 = head t1 - - let r2 = (ofSeq ["a";"b";"c"]) |> remove 2 - let a2 = head r2 - let t2 = tail r2 - let b2 = head t2 - - ((b0 = "b") && (c0 = "c") && (a1 = "a") && (c1 = "c") && (a2 = "a") && (b2 = "b")) |> should equal true - -[] -let ``remove elements length 4``() = - let r0 = (ofSeq ["a";"b";"c";"d"]) |> remove 0 - let b0 = head r0 - let t0 = tail r0 - let c0 = head t0 - let t01 = tail t0 - let d0 = head t01 - - let r1 = (ofSeq ["a";"b";"c";"d"]) |> remove 1 - let a1 = head r1 - let t11 = tail r1 - let c1 = head t11 - let t12 = tail t11 - let d1 = head t12 - - let r2 = (ofSeq ["a";"b";"c";"d"]) |> remove 2 - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 - - let r3 = (ofSeq ["a";"b";"c";"d"]) |> remove 3 - let a3 = head r3 - let t31 = tail r3 - let b3 = head t31 - let t32 = tail t31 - let c3 = head t32 - - ((b0 = "b") && (c0 = "c") && (d0 = "d") - && (a1 = "a") && (c1 = "c") && (d1 = "d") - && (a2 = "a") && (b2 = "b") && (c2 = "d") - && (a3 = "a") && (b3 = "b") && (c3 = "c")) |> should equal true - -[] -let ``remove elements length 5``() = - let r0 = (ofSeq ["a";"b";"c";"d";"e"]) |> remove 0 - let b0 = head r0 - let t01 = tail r0 - let c0 = head t01 - let t02= tail t01 - let d0 = head t02 - let t03 = tail t02 - let e0 = head t03 - - let r1 = (ofSeq ["a";"b";"c";"d";"e"]) |> remove 1 - let a1 = head r1 - let t11 = tail r1 - let c1 = head t11 - let t12 = tail t11 - let d1 = head t12 - let t13 = tail t12 - let e1 = head t13 - - let r2 = (ofSeq ["a";"b";"c";"d";"e"]) |> remove 2 - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 - let t23 = tail t22 - let e2 = head t23 - - let r3 = (ofSeq ["a";"b";"c";"d";"e"]) |> remove 3 - let a3 = head r3 - let t31 = tail r3 - let b3 = head t31 - let t32 = tail t31 - let c3 = head t32 - let t33 = tail t32 - let e3 = head t33 - - let r4 = (ofSeq ["a";"b";"c";"d";"e"]) |> remove 4 - let a4 = head r4 - let t41 = tail r4 - let b4 = head t41 - let t42 = tail t41 - let c4 = head t42 - let t43 = tail t42 - let d4 = head t43 - - ((b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") - && (a1 = "a") && (c1 = "c") && (d1 = "d") && (e1 = "e") - && (a2 = "a") && (b2 = "b") && (c2 = "d") && (e2 = "e") - && (a3 = "a") && (b3 = "b") && (c3 = "c") && (e3 = "e") - && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d")) |> should equal true - -[] -let ``remove elements length 6``() = - let r0 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> remove 0 - let b0 = head r0 - let t01 = tail r0 - let c0 = head t01 - let t02= tail t01 - let d0 = head t02 - let t03 = tail t02 - let e0 = head t03 - let t04 = tail t03 - let f0 = head t04 - - let r1 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> remove 1 - let a1 = head r1 - let t11 = tail r1 - let c1 = head t11 - let t12 = tail t11 - let d1 = head t12 - let t13 = tail t12 - let e1 = head t13 - let t14 = tail t13 - let f1 = head t14 - - let r2 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> remove 2 - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 - let t23 = tail t22 - let e2 = head t23 - let t24 = tail t23 - let f2 = head t24 - - let r3 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> remove 3 - let a3 = head r3 - let t31 = tail r3 - let b3 = head t31 - let t32 = tail t31 - let c3 = head t32 - let t33 = tail t32 - let e3 = head t33 - let t34 = tail t33 - let f3 = head t34 - - let r4 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> remove 4 - let a4 = head r4 - let t41 = tail r4 - let b4 = head t41 - let t42 = tail t41 - let c4 = head t42 - let t43 = tail t42 - let d4 = head t43 - let t44 = tail t43 - let f4 = head t44 - - let r5 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> remove 5 - let a5 = head r5 - let t51 = tail r5 - let b5 = head t51 - let t52 = tail t51 - let c5 = head t52 - let t53 = tail t52 - let d5 = head t53 - let t54 = tail t53 - let e5 = head t54 - - ((b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") && (f0 = "f") - && (a1 = "a") && (c1 = "c") && (d1 = "d") && (e1 = "e") && (f1 = "f") - && (a2 = "a") && (b2 = "b") && (c2 = "d") && (e2 = "e") && (f2 = "f") - && (a3 = "a") && (b3 = "b") && (c3 = "c") && (e3 = "e") && (f3 = "f") - && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d") && (f4 = "f") - && (a5 = "a") && (b5 = "b") && (c5 = "c") && (d5 = "d") && (e5 = "e")) |> should equal true - -[] -let ``tryRemoveempty``() = - empty() |> tryRemove 0 |> should equal None - -[] -let ``tryRemove elements length 1``() = - let a = len1 |> tryRemove 0 - a.Value |> isEmpty |> should equal true - -[] -let ``tryRemove elements length 2``() = - let a = len2 |> tryRemove 0 - let a1 = head a.Value - let b = len2 |> tryRemove 1 - let b1 = head b.Value - ((a1 = "a") && (b1 = "b")) |> should equal true - -[] -let ``tryRemove elements length 3``() = - let x0 = (ofSeq ["a";"b";"c"]) |> tryRemove 0 - let r0 = x0.Value - let b0 = head r0 - let t0 = tail r0 - let c0 = head t0 - - let x1 = (ofSeq ["a";"b";"c"]) |> tryRemove 1 - let r1 = x1.Value - let a1 = head r1 - let t1 = tail r1 - let c1 = head t1 - - let x2 = (ofSeq ["a";"b";"c"]) |> tryRemove 2 - let r2 = x2.Value - let a2 = head r2 - let t2 = tail r2 - let b2 = head t2 - - ((b0 = "b") && (c0 = "c") && (a1 = "a") && (c1 = "c") && (a2 = "a") && (b2 = "b")) |> should equal true - -[] -let ``tryRemove elements length 4``() = - let x0 = (ofSeq ["a";"b";"c";"d"]) |> tryRemove 0 - let r0 = x0.Value - let b0 = head r0 - let t0 = tail r0 - let c0 = head t0 - let t01 = tail t0 - let d0 = head t01 - - let x1 = (ofSeq ["a";"b";"c";"d"]) |> tryRemove 1 - let r1 = x1.Value - let a1 = head r1 - let t11 = tail r1 - let c1 = head t11 - let t12 = tail t11 - let d1 = head t12 + let mid1 = + match d with + | Deque.Cons(h, Deque.Snoc(i, l)) -> i + | _ -> d + + let head, last = + match mid1 with + | Deque.Cons(h, Deque.Snoc(i, l)) -> h, l + | _ -> "x", "x" + + Expect.isTrue "Deque.cons and Deque.snoc" ((head = "e") && (last = "b")) } + + test "Deque.rev empty dqueue should be empty" { + Deque.empty() |> Deque.rev |> Deque.isEmpty |> Expect.isTrue "" } + + test "Deque.rev deque Deque.length 1" { + Expect.equal "Deque.length" "a" (Deque.rev len1 |> Deque.head) } + + test "Deque.rev deque Deque.length 2" { + let r1 = Deque.rev len2 + let h1 = Deque.head r1 + let t2 = Deque.tail r1 + let h2 = Deque.head t2 + + Expect.isTrue "Deque.length" ((h1 = "a") && (h2 = "b")) } + + test "Deque.rev deque Deque.length 3" { + let r1 = Deque.rev len3 + let h1 = Deque.head r1 + let t2 = Deque.tail r1 + let h2 = Deque.head t2 + let t3 = Deque.tail t2 + let h3 = Deque.head t3 + + Expect.isTrue "Deque.length" ((h1 = "a") && (h2 = "b") && (h3 = "c")) } + + test "Deque.rev deque Deque.length 4" { + let r1 = Deque.rev len4 + let h1 = Deque.head r1 + let t2 = Deque.tail r1 + let h2 = Deque.head t2 + let t3 = Deque.tail t2 + let h3 = Deque.head t3 + let t4 = Deque.tail t3 + let h4 = Deque.head t4 + + Expect.isTrue "Deque.length" ((h1 = "a") && (h2 = "b") && (h3 = "c") && (h4 = "d")) } + + test "Deque.rev deque Deque.length 5" { + let r1 = Deque.rev len5 + let h1 = Deque.head r1 + let t2 = Deque.tail r1 + let h2 = Deque.head t2 + let t3 = Deque.tail t2 + let h3 = Deque.head t3 + let t4 = Deque.tail t3 + let h4 = Deque.head t4 + let t5 = Deque.tail t4 + let h5 = Deque.head t5 + + Expect.isTrue "Deque.length" ((h1 = "a") && (h2 = "b") && (h3 = "c") && (h4 = "d") && (h5 = "e")) } + + test "Deque.rev deque Deque.length 6" { + let r1 = Deque.rev len6 + let h1 = Deque.head r1 + let t2 = Deque.tail r1 + let h2 = Deque.head t2 + let t3 = Deque.tail t2 + let h3 = Deque.head t3 + let t4 = Deque.tail t3 + let h4 = Deque.head t4 + let t5 = Deque.tail t4 + let h5 = Deque.head t5 + let t6 = Deque.tail t5 + let h6 = Deque.head t6 + + Expect.isTrue "Deque.rev Deque.length" ((h1 = "a") && (h2 = "b") && (h3 = "c") && (h4 = "d") && (h5 = "e") && (h6 = "f")) } + + test "Deque.lookup Deque.length 1" { + Expect.equal "" "a" (len1 |> Deque.lookup 0) } + + test "Deque.lookup Deque.length 2" { + (((len2 |> Deque.lookup 0) = "b") && ((len2 |> Deque.lookup 1) = "a")) |> Expect.isTrue "" } + + test "Deque.lookup Deque.length 3" { + (((len3 |> Deque.lookup 0) = "c") && ((len3 |> Deque.lookup 1) = "b") && ((len3 |> Deque.lookup 2) = "a")) |> Expect.isTrue "" } + + test "Deque.lookup Deque.length 4" { + (((len4 |> Deque.lookup 0) = "d") && ((len4 |> Deque.lookup 1) = "c") && ((len4 |> Deque.lookup 2) = "b") && ((len4 |> Deque.lookup 3) = "a")) + |> Expect.isTrue "" } + + test "Deque.lookup Deque.length 5" { + (((len5 |> Deque.lookup 0) = "e") && ((len5 |> Deque.lookup 1) = "d") && ((len5 |> Deque.lookup 2) = "c") && ((len5 |> Deque.lookup 3) = "b") + && ((len5 |> Deque.lookup 4) = "a")) |> Expect.isTrue "" } + + test "Deque.lookup Deque.length 6" { + (((len6 |> Deque.lookup 0) = "f") && ((len6 |> Deque.lookup 1) = "e") && ((len6 |> Deque.lookup 2) = "d") && ((len6 |> Deque.lookup 3) = "c") + && ((len6 |> Deque.lookup 4) = "b") && ((len6 |> Deque.lookup 5) = "a")) |> Expect.isTrue "" } + + test "Deque.lookup Deque.length 7" { + (((len7 |> Deque.lookup 0) = "g") && ((len7 |> Deque.lookup 1) = "f") && ((len7 |> Deque.lookup 2) = "e") && ((len7 |> Deque.lookup 3) = "d") + && ((len7 |> Deque.lookup 4) = "c") && ((len7 |> Deque.lookup 5) = "b") && ((len7 |> Deque.lookup 6) = "a")) |> Expect.isTrue "" } + + test "Deque.lookup Deque.length 8" { + (((len8 |> Deque.lookup 0) = "h") && ((len8 |> Deque.lookup 1) = "g") && ((len8 |> Deque.lookup 2) = "f") && ((len8 |> Deque.lookup 3) = "e") + && ((len8 |> Deque.lookup 4) = "d") && ((len8 |> Deque.lookup 5) = "c") && ((len8 |> Deque.lookup 6) = "b") && ((len8 |> Deque.lookup 7) = "a")) + |> Expect.isTrue "" } + + test "Deque.lookup Deque.length 9" { + (((len9 |> Deque.lookup 0) = "i") && ((len9 |> Deque.lookup 1) = "h") && ((len9 |> Deque.lookup 2) = "g") && ((len9 |> Deque.lookup 3) = "f") + && ((len9 |> Deque.lookup 4) = "e") && ((len9 |> Deque.lookup 5) = "d") && ((len9 |> Deque.lookup 6) = "c") && ((len9 |> Deque.lookup 7) = "b") + && ((len9 |> Deque.lookup 8) = "a")) |> Expect.isTrue "" } + + test "Deque.lookup Deque.length 10" { + (((lena |> Deque.lookup 0) = "j") && ((lena |> Deque.lookup 1) = "i") && ((lena |> Deque.lookup 2) = "h") && ((lena |> Deque.lookup 3) = "g") + && ((lena |> Deque.lookup 4) = "f") && ((lena |> Deque.lookup 5) = "e") && ((lena |> Deque.lookup 6) = "d") && ((lena |> Deque.lookup 7) = "c") + && ((lena |> Deque.lookup 8) = "b") && ((lena |> Deque.lookup 9) = "a")) |> Expect.isTrue "" } + + test "Deque.tryLookup Deque.length 1" { + let a = len1 |> Deque.tryLookup 0 + (a.Value = "a") |> Expect.isTrue "" } + + test "Deque.tryLookup Deque.length 2" { + let b = len2 |> Deque.tryLookup 0 + let a = len2 |> Deque.tryLookup 1 + ((b.Value = "b") && (a.Value = "a")) |> Expect.isTrue "" } + + test "Deque.tryLookup Deque.length 3" { + let c = len3 |> Deque.tryLookup 0 + let b = len3 |> Deque.tryLookup 1 + let a = len3 |> Deque.tryLookup 2 + ((c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> Expect.isTrue "" } + + test "Deque.tryLookup Deque.length 4" { + let d = len4 |> Deque.tryLookup 0 + let c = len4 |> Deque.tryLookup 1 + let b = len4 |> Deque.tryLookup 2 + let a = len4 |> Deque.tryLookup 3 + ((d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> Expect.isTrue "" } + + test "Deque.tryLookup Deque.length 5" { + let e = len5 |> Deque.tryLookup 0 + let d = len5 |> Deque.tryLookup 1 + let c = len5 |> Deque.tryLookup 2 + let b = len5 |> Deque.tryLookup 3 + let a = len5 |> Deque.tryLookup 4 + ((e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> Expect.isTrue "" } + + test "Deque.tryLookup Deque.length 6" { + let f = len6 |> Deque.tryLookup 0 + let e = len6 |> Deque.tryLookup 1 + let d = len6 |> Deque.tryLookup 2 + let c = len6 |> Deque.tryLookup 3 + let b = len6 |> Deque.tryLookup 4 + let a = len6 |> Deque.tryLookup 5 + ((f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) + |> Expect.isTrue "" } + + test "Deque.tryLookup Deque.length 7" { + let g = len7 |> Deque.tryLookup 0 + let f = len7 |> Deque.tryLookup 1 + let e = len7 |> Deque.tryLookup 2 + let d = len7 |> Deque.tryLookup 3 + let c = len7 |> Deque.tryLookup 4 + let b = len7 |> Deque.tryLookup 5 + let a = len7 |> Deque.tryLookup 6 + ((g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") + && (a.Value = "a")) |> Expect.isTrue "" } + + test "Deque.tryLookup Deque.length 8" { + let h = len8 |> Deque.tryLookup 0 + let g = len8 |> Deque.tryLookup 1 + let f = len8 |> Deque.tryLookup 2 + let e = len8 |> Deque.tryLookup 3 + let d = len8 |> Deque.tryLookup 4 + let c = len8 |> Deque.tryLookup 5 + let b = len8 |> Deque.tryLookup 6 + let a = len8 |> Deque.tryLookup 7 + ((h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") + && (b.Value = "b")&& (a.Value = "a")) |> Expect.isTrue "" } + + test "Deque.tryLookup Deque.length 9" { + let i = len9 |> Deque.tryLookup 0 + let h = len9 |> Deque.tryLookup 1 + let g = len9 |> Deque.tryLookup 2 + let f = len9 |> Deque.tryLookup 3 + let e = len9 |> Deque.tryLookup 4 + let d = len9 |> Deque.tryLookup 5 + let c = len9 |> Deque.tryLookup 6 + let b = len9 |> Deque.tryLookup 7 + let a = len9 |> Deque.tryLookup 8 + ((i.Value = "i") && (h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") + && (c.Value = "c") && (b.Value = "b")&& (a.Value = "a")) |> Expect.isTrue "" } + + test "Deque.tryLookup Deque.length 10" { + let j = lena |> Deque.tryLookup 0 + let i = lena |> Deque.tryLookup 1 + let h = lena |> Deque.tryLookup 2 + let g = lena |> Deque.tryLookup 3 + let f = lena |> Deque.tryLookup 4 + let e = lena |> Deque.tryLookup 5 + let d = lena |> Deque.tryLookup 6 + let c = lena |> Deque.tryLookup 7 + let b = lena |> Deque.tryLookup 8 + let a = lena |> Deque.tryLookup 9 + ((j.Value = "j") && (i.Value = "i") && (h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") + && (d.Value = "d") && (c.Value = "c") && (b.Value = "b")&& (a.Value = "a")) |> Expect.isTrue "" } + + test "Deque.tryLookup not found" { + lena |> Deque.tryLookup 10 |> Expect.isNone "" } + + test "Deque.remove elements Deque.length 1" { + len1 |> Deque.remove 0 |> Deque.isEmpty |> Expect.isTrue "" } + + test "Deque.remove elements Deque.length 2" { + let a = len2 |> Deque.remove 0 |> Deque.head + let b = len2 |> Deque.remove 1 |> Deque.head + ((a = "a") && (b = "b")) |> Expect.isTrue "" } + + test "Deque.remove elements Deque.length 3" { + let r0 = (Deque.ofSeq ["a";"b";"c"]) |> Deque.remove 0 + let b0 = Deque.head r0 + let t0 = Deque.tail r0 + let c0 = Deque.head t0 + + let r1 = (Deque.ofSeq ["a";"b";"c"]) |> Deque.remove 1 + let a1 = Deque.head r1 + let t1 = Deque.tail r1 + let c1 = Deque.head t1 + + let r2 = (Deque.ofSeq ["a";"b";"c"]) |> Deque.remove 2 + let a2 = Deque.head r2 + let t2 = Deque.tail r2 + let b2 = Deque.head t2 + + ((b0 = "b") && (c0 = "c") && (a1 = "a") && (c1 = "c") && (a2 = "a") && (b2 = "b")) |> Expect.isTrue "" } + + test "Deque.remove elements Deque.length 4" { + let r0 = (Deque.ofSeq ["a";"b";"c";"d"]) |> Deque.remove 0 + let b0 = Deque.head r0 + let t0 = Deque.tail r0 + let c0 = Deque.head t0 + let t01 = Deque.tail t0 + let d0 = Deque.head t01 + + let r1 = (Deque.ofSeq ["a";"b";"c";"d"]) |> Deque.remove 1 + let a1 = Deque.head r1 + let t11 = Deque.tail r1 + let c1 = Deque.head t11 + let t12 = Deque.tail t11 + let d1 = Deque.head t12 + + let r2 = (Deque.ofSeq ["a";"b";"c";"d"]) |> Deque.remove 2 + let a2 = Deque.head r2 + let t21 = Deque.tail r2 + let b2 = Deque.head t21 + let t22 = Deque.tail t21 + let c2 = Deque.head t22 + + let r3 = (Deque.ofSeq ["a";"b";"c";"d"]) |> Deque.remove 3 + let a3 = Deque.head r3 + let t31 = Deque.tail r3 + let b3 = Deque.head t31 + let t32 = Deque.tail t31 + let c3 = Deque.head t32 + + ((b0 = "b") && (c0 = "c") && (d0 = "d") + && (a1 = "a") && (c1 = "c") && (d1 = "d") + && (a2 = "a") && (b2 = "b") && (c2 = "d") + && (a3 = "a") && (b3 = "b") && (c3 = "c")) |> Expect.isTrue "" } + + test "Deque.remove elements Deque.length 5" { + let r0 = (Deque.ofSeq ["a";"b";"c";"d";"e"]) |> Deque.remove 0 + let b0 = Deque.head r0 + let t01 = Deque.tail r0 + let c0 = Deque.head t01 + let t02= Deque.tail t01 + let d0 = Deque.head t02 + let t03 = Deque.tail t02 + let e0 = Deque.head t03 + + let r1 = (Deque.ofSeq ["a";"b";"c";"d";"e"]) |> Deque.remove 1 + let a1 = Deque.head r1 + let t11 = Deque.tail r1 + let c1 = Deque.head t11 + let t12 = Deque.tail t11 + let d1 = Deque.head t12 + let t13 = Deque.tail t12 + let e1 = Deque.head t13 + + let r2 = (Deque.ofSeq ["a";"b";"c";"d";"e"]) |> Deque.remove 2 + let a2 = Deque.head r2 + let t21 = Deque.tail r2 + let b2 = Deque.head t21 + let t22 = Deque.tail t21 + let c2 = Deque.head t22 + let t23 = Deque.tail t22 + let e2 = Deque.head t23 + + let r3 = (Deque.ofSeq ["a";"b";"c";"d";"e"]) |> Deque.remove 3 + let a3 = Deque.head r3 + let t31 = Deque.tail r3 + let b3 = Deque.head t31 + let t32 = Deque.tail t31 + let c3 = Deque.head t32 + let t33 = Deque.tail t32 + let e3 = Deque.head t33 + + let r4 = (Deque.ofSeq ["a";"b";"c";"d";"e"]) |> Deque.remove 4 + let a4 = Deque.head r4 + let t41 = Deque.tail r4 + let b4 = Deque.head t41 + let t42 = Deque.tail t41 + let c4 = Deque.head t42 + let t43 = Deque.tail t42 + let d4 = Deque.head t43 + + ((b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") + && (a1 = "a") && (c1 = "c") && (d1 = "d") && (e1 = "e") + && (a2 = "a") && (b2 = "b") && (c2 = "d") && (e2 = "e") + && (a3 = "a") && (b3 = "b") && (c3 = "c") && (e3 = "e") + && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d")) |> Expect.isTrue "" } + + test "Deque.remove elements Deque.length 6" { + let r0 = (Deque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> Deque.remove 0 + let b0 = Deque.head r0 + let t01 = Deque.tail r0 + let c0 = Deque.head t01 + let t02= Deque.tail t01 + let d0 = Deque.head t02 + let t03 = Deque.tail t02 + let e0 = Deque.head t03 + let t04 = Deque.tail t03 + let f0 = Deque.head t04 + + let r1 = (Deque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> Deque.remove 1 + let a1 = Deque.head r1 + let t11 = Deque.tail r1 + let c1 = Deque.head t11 + let t12 = Deque.tail t11 + let d1 = Deque.head t12 + let t13 = Deque.tail t12 + let e1 = Deque.head t13 + let t14 = Deque.tail t13 + let f1 = Deque.head t14 + + let r2 = (Deque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> Deque.remove 2 + let a2 = Deque.head r2 + let t21 = Deque.tail r2 + let b2 = Deque.head t21 + let t22 = Deque.tail t21 + let c2 = Deque.head t22 + let t23 = Deque.tail t22 + let e2 = Deque.head t23 + let t24 = Deque.tail t23 + let f2 = Deque.head t24 + + let r3 = (Deque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> Deque.remove 3 + let a3 = Deque.head r3 + let t31 = Deque.tail r3 + let b3 = Deque.head t31 + let t32 = Deque.tail t31 + let c3 = Deque.head t32 + let t33 = Deque.tail t32 + let e3 = Deque.head t33 + let t34 = Deque.tail t33 + let f3 = Deque.head t34 + + let r4 = (Deque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> Deque.remove 4 + let a4 = Deque.head r4 + let t41 = Deque.tail r4 + let b4 = Deque.head t41 + let t42 = Deque.tail t41 + let c4 = Deque.head t42 + let t43 = Deque.tail t42 + let d4 = Deque.head t43 + let t44 = Deque.tail t43 + let f4 = Deque.head t44 + + let r5 = (Deque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> Deque.remove 5 + let a5 = Deque.head r5 + let t51 = Deque.tail r5 + let b5 = Deque.head t51 + let t52 = Deque.tail t51 + let c5 = Deque.head t52 + let t53 = Deque.tail t52 + let d5 = Deque.head t53 + let t54 = Deque.tail t53 + let e5 = Deque.head t54 + + ((b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") && (f0 = "f") + && (a1 = "a") && (c1 = "c") && (d1 = "d") && (e1 = "e") && (f1 = "f") + && (a2 = "a") && (b2 = "b") && (c2 = "d") && (e2 = "e") && (f2 = "f") + && (a3 = "a") && (b3 = "b") && (c3 = "c") && (e3 = "e") && (f3 = "f") + && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d") && (f4 = "f") + && (a5 = "a") && (b5 = "b") && (c5 = "c") && (d5 = "d") && (e5 = "e")) |> Expect.isTrue "" } + + test "tryRemoveempty" { + Deque.empty() |> Deque.tryRemove 0 |> Expect.isNone "" } + + test "Deque.tryRemove elements Deque.length 1" { + let a = len1 |> Deque.tryRemove 0 + a.Value |> Deque.isEmpty |> Expect.isTrue "" } + + test "Deque.tryRemove elements Deque.length 2" { + let a = len2 |> Deque.tryRemove 0 + let a1 = Deque.head a.Value + let b = len2 |> Deque.tryRemove 1 + let b1 = Deque.head b.Value + ((a1 = "a") && (b1 = "b")) |> Expect.isTrue "" } + + test "Deque.tryRemove elements Deque.length 3" { + let x0 = (Deque.ofSeq ["a";"b";"c"]) |> Deque.tryRemove 0 + let r0 = x0.Value + let b0 = Deque.head r0 + let t0 = Deque.tail r0 + let c0 = Deque.head t0 + + let x1 = (Deque.ofSeq ["a";"b";"c"]) |> Deque.tryRemove 1 + let r1 = x1.Value + let a1 = Deque.head r1 + let t1 = Deque.tail r1 + let c1 = Deque.head t1 + + let x2 = (Deque.ofSeq ["a";"b";"c"]) |> Deque.tryRemove 2 + let r2 = x2.Value + let a2 = Deque.head r2 + let t2 = Deque.tail r2 + let b2 = Deque.head t2 + + ((b0 = "b") && (c0 = "c") && (a1 = "a") && (c1 = "c") && (a2 = "a") && (b2 = "b")) |> Expect.isTrue "" } + + test "Deque.tryRemove elements Deque.length 4" { + let x0 = (Deque.ofSeq ["a";"b";"c";"d"]) |> Deque.tryRemove 0 + let r0 = x0.Value + let b0 = Deque.head r0 + let t0 = Deque.tail r0 + let c0 = Deque.head t0 + let t01 = Deque.tail t0 + let d0 = Deque.head t01 + + let x1 = (Deque.ofSeq ["a";"b";"c";"d"]) |> Deque.tryRemove 1 + let r1 = x1.Value + let a1 = Deque.head r1 + let t11 = Deque.tail r1 + let c1 = Deque.head t11 + let t12 = Deque.tail t11 + let d1 = Deque.head t12 - let x2 = (ofSeq ["a";"b";"c";"d"]) |> tryRemove 2 - let r2 = x2.Value - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 + let x2 = (Deque.ofSeq ["a";"b";"c";"d"]) |> Deque.tryRemove 2 + let r2 = x2.Value + let a2 = Deque.head r2 + let t21 = Deque.tail r2 + let b2 = Deque.head t21 + let t22 = Deque.tail t21 + let c2 = Deque.head t22 - let x3 = (ofSeq ["a";"b";"c";"d"]) |> tryRemove 3 - let r3 = x3.Value - let a3 = head r3 - let t31 = tail r3 - let b3 = head t31 - let t32 = tail t31 - let c3 = head t32 - - ((b0 = "b") && (c0 = "c") && (d0 = "d") - && (a1 = "a") && (c1 = "c") && (d1 = "d") - && (a2 = "a") && (b2 = "b") && (c2 = "d") - && (a3 = "a") && (b3 = "b") && (c3 = "c")) |> should equal true - -[] -let ``tryRemove elements length 5``() = - let x0 = (ofSeq ["a";"b";"c";"d";"e"]) |> tryRemove 0 - let r0 = x0.Value - let b0 = head r0 - let t01 = tail r0 - let c0 = head t01 - let t02= tail t01 - let d0 = head t02 - let t03 = tail t02 - let e0 = head t03 - - let x1 = (ofSeq ["a";"b";"c";"d";"e"]) |> tryRemove 1 - let r1 = x1.Value - let a1 = head r1 - let t11 = tail r1 - let c1 = head t11 - let t12 = tail t11 - let d1 = head t12 - let t13 = tail t12 - let e1 = head t13 - - let x2 = (ofSeq ["a";"b";"c";"d";"e"]) |> tryRemove 2 - let r2 = x2.Value - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 - let t23 = tail t22 - let e2 = head t23 - - let x3 = (ofSeq ["a";"b";"c";"d";"e"]) |> tryRemove 3 - let r3 = x3.Value - let a3 = head r3 - let t31 = tail r3 - let b3 = head t31 - let t32 = tail t31 - let c3 = head t32 - let t33 = tail t32 - let e3 = head t33 - - let x4 = (ofSeq ["a";"b";"c";"d";"e"]) |> tryRemove 4 - let r4 = x4.Value - let a4 = head r4 - let t41 = tail r4 - let b4 = head t41 - let t42 = tail t41 - let c4 = head t42 - let t43 = tail t42 - let d4 = head t43 - - ((b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") - && (a1 = "a") && (c1 = "c") && (d1 = "d") && (e1 = "e") - && (a2 = "a") && (b2 = "b") && (c2 = "d") && (e2 = "e") - && (a3 = "a") && (b3 = "b") && (c3 = "c") && (e3 = "e") - && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d")) |> should equal true - -[] -let ``tryRemove elements length 6``() = - let x0 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> tryRemove 0 - let r0 = x0.Value - let b0 = head r0 - let t01 = tail r0 - let c0 = head t01 - let t02= tail t01 - let d0 = head t02 - let t03 = tail t02 - let e0 = head t03 - let t04 = tail t03 - let f0 = head t04 - - let x1 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> tryRemove 1 - let r1 =x1.Value - let a1 = head r1 - let t11 = tail r1 - let c1 = head t11 - let t12 = tail t11 - let d1 = head t12 - let t13 = tail t12 - let e1 = head t13 - let t14 = tail t13 - let f1 = head t14 - - let x2 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> tryRemove 2 - let r2 = x2.Value - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 - let t23 = tail t22 - let e2 = head t23 - let t24 = tail t23 - let f2 = head t24 - - let x3 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> tryRemove 3 - let r3 = x3.Value - let a3 = head r3 - let t31 = tail r3 - let b3 = head t31 - let t32 = tail t31 - let c3 = head t32 - let t33 = tail t32 - let e3 = head t33 - let t34 = tail t33 - let f3 = head t34 - - let x4 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> tryRemove 4 - let r4 = x4.Value - let a4 = head r4 - let t41 = tail r4 - let b4 = head t41 - let t42 = tail t41 - let c4 = head t42 - let t43 = tail t42 - let d4 = head t43 - let t44 = tail t43 - let f4 = head t44 - - let x5 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> tryRemove 5 - let r5 = x5.Value - let a5 = head r5 - let t51 = tail r5 - let b5 = head t51 - let t52 = tail t51 - let c5 = head t52 - let t53 = tail t52 - let d5 = head t53 - let t54 = tail t53 - let e5 = head t54 - - ((b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") && (f0 = "f") - && (a1 = "a") && (c1 = "c") && (d1 = "d") && (e1 = "e") && (f1 = "f") - && (a2 = "a") && (b2 = "b") && (c2 = "d") && (e2 = "e") && (f2 = "f") - && (a3 = "a") && (b3 = "b") && (c3 = "c") && (e3 = "e") && (f3 = "f") - && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d") && (f4 = "f") - && (a5 = "a") && (b5 = "b") && (c5 = "c") && (d5 = "d") && (e5 = "e")) |> should equal true - -[] -let ``update elements length 1``() = - len1 |> update 0 "aa" |> head |> should equal "aa" - -[] -let ``update elements length 2``() = - let r0 = (ofSeq ["a";"b"]) |> update 0 "zz" - let a0 = head r0 - let t01 = tail r0 - let b0 = head t01 - - let r1 = (ofSeq ["a";"b"]) |> update 1 "zz" - let a1 = head r1 - let t11 = tail r1 - let b1 = head t11 - - ((a0 = "zz") && (b0 = "b") - && (a1 = "a") && (b1 = "zz")) |> should equal true - -[] -let ``update elements length 3``() = - let r0 = (ofSeq ["a";"b";"c"]) |> update 0 "zz" - let a0 = head r0 - let t01 = tail r0 - let b0 = head t01 - let t02 = tail t01 - let c0 = head t02 - - let r1 = (ofSeq ["a";"b";"c"]) |> update 1 "zz" - let a1 = head r1 - let t11 = tail r1 - let b1 = head t11 - let t12 = tail t11 - let c1 = head t12 - - let r2 = (ofSeq ["a";"b";"c"]) |> update 2 "zz" - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 - - ((a0 = "zz") && (b0 = "b") && (c0 = "c") - && (a1 = "a") && (b1 = "zz") && (c1 = "c") - && (a2 = "a") && (b2 = "b") && (c2 = "zz")) |> should equal true - -[] -let ``update elements length 4``() = - let r0 = (ofSeq ["a";"b";"c";"d"]) |> update 0 "zz" - let a0 = head r0 - let t01 = tail r0 - let b0 = head t01 - let t02 = tail t01 - let c0 = head t02 - let t03 = tail t02 - let d0 = head t03 - - let r1 = (ofSeq ["a";"b";"c";"d"]) |> update 1 "zz" - let a1 = head r1 - let t11 = tail r1 - let b1 = head t11 - let t12 = tail t11 - let c1 = head t12 - let t13 = tail t12 - let d1 = head t13 - - let r2 = (ofSeq ["a";"b";"c";"d"]) |> update 2 "zz" - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 - let t23 = tail t22 - let d2 = head t23 - - let r3 = (ofSeq ["a";"b";"c";"d"]) |> update 3 "zz" - let a3 = head r3 - let t31 = tail r3 - let b3 = head t31 - let t32 = tail t31 - let c3 = head t32 - let t33 = tail t32 - let d3 = head t33 - - ((a0 = "zz") && (b0 = "b") && (c0 = "c") && (d0 = "d") - && (a1 = "a") && (b1 = "zz") && (c1 = "c") && (d1 = "d") - && (a2 = "a") && (b2 = "b") && (c2 = "zz") && (d2 = "d") - && (a3 = "a") && (b3 = "b") && (c3 = "c") && (d3 = "zz")) |> should equal true - -[] -let ``update elements length 5``() = - let r0 = (ofSeq ["a";"b";"c";"d";"e"]) |> update 0 "zz" - let a0 = head r0 - let t01 = tail r0 - let b0 = head t01 - let t02 = tail t01 - let c0 = head t02 - let t03 = tail t02 - let d0 = head t03 - let t04 = tail t03 - let e0 = head t04 - - let r1 = (ofSeq ["a";"b";"c";"d";"e"]) |> update 1 "zz" - let a1 = head r1 - let t11 = tail r1 - let b1 = head t11 - let t12 = tail t11 - let c1 = head t12 - let t13 = tail t12 - let d1 = head t13 - let t14 = tail t13 - let e1 = head t14 - - let r2 = (ofSeq ["a";"b";"c";"d";"e"]) |> update 2 "zz" - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 - let t23 = tail t22 - let d2 = head t23 - let t24 = tail t23 - let e2 = head t24 - - let r3 = (ofSeq ["a";"b";"c";"d";"e"]) |> update 3 "zz" - let a3 = head r3 - let t31 = tail r3 - let b3 = head t31 - let t32 = tail t31 - let c3 = head t32 - let t33 = tail t32 - let d3 = head t33 - let t34 = tail t33 - let e3 = head t34 - - let r4 = (ofSeq ["a";"b";"c";"d";"e"]) |> update 4 "zz" - let a4 = head r4 - let t41 = tail r4 - let b4 = head t41 - let t42 = tail t41 - let c4 = head t42 - let t43 = tail t42 - let d4 = head t43 - let t44 = tail t43 - let e4 = head t44 - - ((a0 = "zz") && (b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") - && (a1 = "a") && (b1 = "zz") && (c1 = "c") && (d1 = "d") && (e1 = "e") - && (a2 = "a") && (b2 = "b") && (c2 = "zz") && (d2 = "d") && (e2 = "e") - && (a3 = "a") && (b3 = "b") && (c3 = "c") && (d3 = "zz") && (e3 = "e") - && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d") && (e4 = "zz")) |> should equal true - -[] -let ``update elements length 6``() = - let r0 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> update 0 "zz" - let a0 = head r0 - let t01 = tail r0 - let b0 = head t01 - let t02 = tail t01 - let c0 = head t02 - let t03 = tail t02 - let d0 = head t03 - let t04 = tail t03 - let e0 = head t04 - let t05 = tail t04 - let f0 = head t05 - - let r1 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> update 1 "zz" - let a1 = head r1 - let t11 = tail r1 - let b1 = head t11 - let t12 = tail t11 - let c1 = head t12 - let t13 = tail t12 - let d1 = head t13 - let t14 = tail t13 - let e1 = head t14 - let t15 = tail t14 - let f1 = head t15 - - let r2 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> update 2 "zz" - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 - let t23 = tail t22 - let d2 = head t23 - let t24 = tail t23 - let e2 = head t24 - let t25 = tail t24 - let f2 = head t25 - - let r3 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> update 3 "zz" - let a3 = head r3 - let t31 = tail r3 - let b3 = head t31 - let t32 = tail t31 - let c3 = head t32 - let t33 = tail t32 - let d3 = head t33 - let t34 = tail t33 - let e3 = head t34 - let t35 = tail t34 - let f3 = head t35 - - let r4 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> update 4 "zz" - let a4 = head r4 - let t41 = tail r4 - let b4 = head t41 - let t42 = tail t41 - let c4 = head t42 - let t43 = tail t42 - let d4 = head t43 - let t44 = tail t43 - let e4 = head t44 - let t45 = tail t44 - let f4 = head t45 - - let r5 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> update 5 "zz" - let a5 = head r5 - let t51 = tail r5 - let b5 = head t51 - let t52 = tail t51 - let c5 = head t52 - let t53 = tail t52 - let d5 = head t53 - let t54 = tail t53 - let e5 = head t54 - let t55 = tail t54 - let f5 = head t55 - - ((a0 = "zz") && (b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") && (f0 = "f") - && (a1 = "a") && (b1 = "zz") && (c1 = "c") && (d1 = "d") && (e1 = "e") && (f1 = "f") - && (a2 = "a") && (b2 = "b") && (c2 = "zz") && (d2 = "d") && (e2 = "e") && (f2 = "f") - && (a3 = "a") && (b3 = "b") && (c3 = "c") && (d3 = "zz") && (e3 = "e") && (f3 = "f") - && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d") && (e4 = "zz") && (f4 = "f") - && (a5 = "a") && (b5 = "b") && (c5 = "c") && (d5 = "d") && (e5 = "e") && (f5 = "zz")) |> should equal true - -[] -let ``tryUpdate elements length 1``() = - let a = len1 |> tryUpdate 0 "aa" - a.Value |> head |> should equal "aa" - -[] -let ``tryUpdate elements length 2``() = - let x0 = (ofSeq ["a";"b"]) |> tryUpdate 0 "zz" - let r0 = x0.Value - let a0 = head r0 - let t01 = tail r0 - let b0 = head t01 - - let x1 = (ofSeq ["a";"b"]) |> tryUpdate 1 "zz" - let r1 = x1.Value - let a1 = head r1 - let t11 = tail r1 - let b1 = head t11 - - ((a0 = "zz") && (b0 = "b") - && (a1 = "a") && (b1 = "zz")) |> should equal true - -[] -let ``tryUpdate elements length 3``() = - let x0 = (ofSeq ["a";"b";"c"]) |> tryUpdate 0 "zz" - let r0 = x0.Value - let a0 = head r0 - let t01 = tail r0 - let b0 = head t01 - let t02 = tail t01 - let c0 = head t02 - - let x1 = (ofSeq ["a";"b";"c"]) |> tryUpdate 1 "zz" - let r1 = x1.Value - let a1 = head r1 - let t11 = tail r1 - let b1 = head t11 - let t12 = tail t11 - let c1 = head t12 - - let x2 = (ofSeq ["a";"b";"c"]) |> tryUpdate 2 "zz" - let r2 = x2.Value - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 - - ((a0 = "zz") && (b0 = "b") && (c0 = "c") - && (a1 = "a") && (b1 = "zz") && (c1 = "c") - && (a2 = "a") && (b2 = "b") && (c2 = "zz")) |> should equal true - -[] -let ``tryUpdate elements length 4``() = - let x0 = (ofSeq ["a";"b";"c";"d"]) |> tryUpdate 0 "zz" - let r0 = x0.Value - let a0 = head r0 - let t01 = tail r0 - let b0 = head t01 - let t02 = tail t01 - let c0 = head t02 - let t03 = tail t02 - let d0 = head t03 - - let x1 = (ofSeq ["a";"b";"c";"d"]) |> tryUpdate 1 "zz" - let r1 = x1.Value - let a1 = head r1 - let t11 = tail r1 - let b1 = head t11 - let t12 = tail t11 - let c1 = head t12 - let t13 = tail t12 - let d1 = head t13 - - let x2 = (ofSeq ["a";"b";"c";"d"]) |> tryUpdate 2 "zz" - let r2 = x2.Value - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 - let t23 = tail t22 - let d2 = head t23 - - let x3 = (ofSeq ["a";"b";"c";"d"]) |> tryUpdate 3 "zz" - let r3 = x3.Value - let a3 = head r3 - let t31 = tail r3 - let b3 = head t31 - let t32 = tail t31 - let c3 = head t32 - let t33 = tail t32 - let d3 = head t33 - - ((a0 = "zz") && (b0 = "b") && (c0 = "c") && (d0 = "d") - && (a1 = "a") && (b1 = "zz") && (c1 = "c") && (d1 = "d") - && (a2 = "a") && (b2 = "b") && (c2 = "zz") && (d2 = "d") - && (a3 = "a") && (b3 = "b") && (c3 = "c") && (d3 = "zz")) |> should equal true - -[] -let ``tryUncons on empty``() = - let q = empty() - (tryUncons q = None) |> should equal true - -[] -let ``tryUncons on q``() = - let q = ofSeq ["a";"b";"c";"d"] - let x, xs = (tryUncons q).Value - x |> should equal "a" - -[] -let ``tryUnsnoc on empty``() = - let q = empty() - (tryUnsnoc q = None) |> should equal true - -[] -let ``tryUnsnoc on q``() = - let q = ofSeq ["a";"b";"c";"d"] - let xs, x = (tryUnsnoc q).Value - x |> should equal "d" - -[] -let ``tryGetHead on empty``() = - let q = empty() - (tryGetHead q = None) |> should equal true - -[] -let ``tryGetHead on q``() = - let q = ofSeq ["a";"b";"c";"d"] - (tryGetHead q).Value |> should equal "a" - -[] -let ``tryGetInit on empty``() = - let q = empty() - (tryGetInit q = None) |> should equal true - -[] -let ``tryGetInit on q``() = - let q = ofSeq ["a";"b";"c";"d"] -// (tryGetInit q).Value |> last |> should equal "c" - let x = (tryGetInit q).Value - let x2 = x|> last - x2 |> should equal "c" - -[] -let ``tryGetLast on empty``() = - let q = empty() - (tryGetLast q = None) |> should equal true - -[] -let ``tryGetLast on q``() = - let q = ofSeq ["a";"b";"c";"d"] - (tryGetLast q).Value |> should equal "d" - - -[] -let ``tryGetTail on empty``() = - let q = empty() - (tryGetTail q = None) |> should equal true - -[] -let ``tryGetTail on q``() = - let q = ofSeq ["a";"b";"c";"d"] - (tryGetTail q).Value |> head |> should equal "b" - -[] -let ``deprecated structure still works``() = - let q = empty() - - (tryGetTail q = None) |> should equal true \ No newline at end of file + let x3 = (Deque.ofSeq ["a";"b";"c";"d"]) |> Deque.tryRemove 3 + let r3 = x3.Value + let a3 = Deque.head r3 + let t31 = Deque.tail r3 + let b3 = Deque.head t31 + let t32 = Deque.tail t31 + let c3 = Deque.head t32 + + ((b0 = "b") && (c0 = "c") && (d0 = "d") + && (a1 = "a") && (c1 = "c") && (d1 = "d") + && (a2 = "a") && (b2 = "b") && (c2 = "d") + && (a3 = "a") && (b3 = "b") && (c3 = "c")) |> Expect.isTrue "" } + + test "Deque.tryRemove elements Deque.length 5" { + let x0 = (Deque.ofSeq ["a";"b";"c";"d";"e"]) |> Deque.tryRemove 0 + let r0 = x0.Value + let b0 = Deque.head r0 + let t01 = Deque.tail r0 + let c0 = Deque.head t01 + let t02= Deque.tail t01 + let d0 = Deque.head t02 + let t03 = Deque.tail t02 + let e0 = Deque.head t03 + + let x1 = (Deque.ofSeq ["a";"b";"c";"d";"e"]) |> Deque.tryRemove 1 + let r1 = x1.Value + let a1 = Deque.head r1 + let t11 = Deque.tail r1 + let c1 = Deque.head t11 + let t12 = Deque.tail t11 + let d1 = Deque.head t12 + let t13 = Deque.tail t12 + let e1 = Deque.head t13 + + let x2 = (Deque.ofSeq ["a";"b";"c";"d";"e"]) |> Deque.tryRemove 2 + let r2 = x2.Value + let a2 = Deque.head r2 + let t21 = Deque.tail r2 + let b2 = Deque.head t21 + let t22 = Deque.tail t21 + let c2 = Deque.head t22 + let t23 = Deque.tail t22 + let e2 = Deque.head t23 + + let x3 = (Deque.ofSeq ["a";"b";"c";"d";"e"]) |> Deque.tryRemove 3 + let r3 = x3.Value + let a3 = Deque.head r3 + let t31 = Deque.tail r3 + let b3 = Deque.head t31 + let t32 = Deque.tail t31 + let c3 = Deque.head t32 + let t33 = Deque.tail t32 + let e3 = Deque.head t33 + + let x4 = (Deque.ofSeq ["a";"b";"c";"d";"e"]) |> Deque.tryRemove 4 + let r4 = x4.Value + let a4 = Deque.head r4 + let t41 = Deque.tail r4 + let b4 = Deque.head t41 + let t42 = Deque.tail t41 + let c4 = Deque.head t42 + let t43 = Deque.tail t42 + let d4 = Deque.head t43 + + ((b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") + && (a1 = "a") && (c1 = "c") && (d1 = "d") && (e1 = "e") + && (a2 = "a") && (b2 = "b") && (c2 = "d") && (e2 = "e") + && (a3 = "a") && (b3 = "b") && (c3 = "c") && (e3 = "e") + && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d")) |> Expect.isTrue "" } + + test "Deque.tryRemove elements Deque.length 6" { + let x0 = (Deque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> Deque.tryRemove 0 + let r0 = x0.Value + let b0 = Deque.head r0 + let t01 = Deque.tail r0 + let c0 = Deque.head t01 + let t02= Deque.tail t01 + let d0 = Deque.head t02 + let t03 = Deque.tail t02 + let e0 = Deque.head t03 + let t04 = Deque.tail t03 + let f0 = Deque.head t04 + + let x1 = (Deque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> Deque.tryRemove 1 + let r1 =x1.Value + let a1 = Deque.head r1 + let t11 = Deque.tail r1 + let c1 = Deque.head t11 + let t12 = Deque.tail t11 + let d1 = Deque.head t12 + let t13 = Deque.tail t12 + let e1 = Deque.head t13 + let t14 = Deque.tail t13 + let f1 = Deque.head t14 + + let x2 = (Deque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> Deque.tryRemove 2 + let r2 = x2.Value + let a2 = Deque.head r2 + let t21 = Deque.tail r2 + let b2 = Deque.head t21 + let t22 = Deque.tail t21 + let c2 = Deque.head t22 + let t23 = Deque.tail t22 + let e2 = Deque.head t23 + let t24 = Deque.tail t23 + let f2 = Deque.head t24 + + let x3 = (Deque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> Deque.tryRemove 3 + let r3 = x3.Value + let a3 = Deque.head r3 + let t31 = Deque.tail r3 + let b3 = Deque.head t31 + let t32 = Deque.tail t31 + let c3 = Deque.head t32 + let t33 = Deque.tail t32 + let e3 = Deque.head t33 + let t34 = Deque.tail t33 + let f3 = Deque.head t34 + + let x4 = (Deque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> Deque.tryRemove 4 + let r4 = x4.Value + let a4 = Deque.head r4 + let t41 = Deque.tail r4 + let b4 = Deque.head t41 + let t42 = Deque.tail t41 + let c4 = Deque.head t42 + let t43 = Deque.tail t42 + let d4 = Deque.head t43 + let t44 = Deque.tail t43 + let f4 = Deque.head t44 + + let x5 = (Deque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> Deque.tryRemove 5 + let r5 = x5.Value + let a5 = Deque.head r5 + let t51 = Deque.tail r5 + let b5 = Deque.head t51 + let t52 = Deque.tail t51 + let c5 = Deque.head t52 + let t53 = Deque.tail t52 + let d5 = Deque.head t53 + let t54 = Deque.tail t53 + let e5 = Deque.head t54 + + ((b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") && (f0 = "f") + && (a1 = "a") && (c1 = "c") && (d1 = "d") && (e1 = "e") && (f1 = "f") + && (a2 = "a") && (b2 = "b") && (c2 = "d") && (e2 = "e") && (f2 = "f") + && (a3 = "a") && (b3 = "b") && (c3 = "c") && (e3 = "e") && (f3 = "f") + && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d") && (f4 = "f") + && (a5 = "a") && (b5 = "b") && (c5 = "c") && (d5 = "d") && (e5 = "e")) |> Expect.isTrue "" } + + test "Deque.update elements Deque.length 1" { + len1 |> Deque.update 0 "aa" |> Deque.head |> Expect.equal "" "aa" } + + test "Deque.update elements Deque.length 2" { + let r0 = (Deque.ofSeq ["a";"b"]) |> Deque.update 0 "zz" + let a0 = Deque.head r0 + let t01 = Deque.tail r0 + let b0 = Deque.head t01 + + let r1 = (Deque.ofSeq ["a";"b"]) |> Deque.update 1 "zz" + let a1 = Deque.head r1 + let t11 = Deque.tail r1 + let b1 = Deque.head t11 + + ((a0 = "zz") && (b0 = "b") + && (a1 = "a") && (b1 = "zz")) |> Expect.isTrue "" } + + test "Deque.update elements Deque.length 3" { + let r0 = (Deque.ofSeq ["a";"b";"c"]) |> Deque.update 0 "zz" + let a0 = Deque.head r0 + let t01 = Deque.tail r0 + let b0 = Deque.head t01 + let t02 = Deque.tail t01 + let c0 = Deque.head t02 + + let r1 = (Deque.ofSeq ["a";"b";"c"]) |> Deque.update 1 "zz" + let a1 = Deque.head r1 + let t11 = Deque.tail r1 + let b1 = Deque.head t11 + let t12 = Deque.tail t11 + let c1 = Deque.head t12 + + let r2 = (Deque.ofSeq ["a";"b";"c"]) |> Deque.update 2 "zz" + let a2 = Deque.head r2 + let t21 = Deque.tail r2 + let b2 = Deque.head t21 + let t22 = Deque.tail t21 + let c2 = Deque.head t22 + + ((a0 = "zz") && (b0 = "b") && (c0 = "c") + && (a1 = "a") && (b1 = "zz") && (c1 = "c") + && (a2 = "a") && (b2 = "b") && (c2 = "zz")) |> Expect.isTrue "" } + + test "Deque.update elements Deque.length 4" { + let r0 = (Deque.ofSeq ["a";"b";"c";"d"]) |> Deque.update 0 "zz" + let a0 = Deque.head r0 + let t01 = Deque.tail r0 + let b0 = Deque.head t01 + let t02 = Deque.tail t01 + let c0 = Deque.head t02 + let t03 = Deque.tail t02 + let d0 = Deque.head t03 + + let r1 = (Deque.ofSeq ["a";"b";"c";"d"]) |> Deque.update 1 "zz" + let a1 = Deque.head r1 + let t11 = Deque.tail r1 + let b1 = Deque.head t11 + let t12 = Deque.tail t11 + let c1 = Deque.head t12 + let t13 = Deque.tail t12 + let d1 = Deque.head t13 + + let r2 = (Deque.ofSeq ["a";"b";"c";"d"]) |> Deque.update 2 "zz" + let a2 = Deque.head r2 + let t21 = Deque.tail r2 + let b2 = Deque.head t21 + let t22 = Deque.tail t21 + let c2 = Deque.head t22 + let t23 = Deque.tail t22 + let d2 = Deque.head t23 + + let r3 = (Deque.ofSeq ["a";"b";"c";"d"]) |> Deque.update 3 "zz" + let a3 = Deque.head r3 + let t31 = Deque.tail r3 + let b3 = Deque.head t31 + let t32 = Deque.tail t31 + let c3 = Deque.head t32 + let t33 = Deque.tail t32 + let d3 = Deque.head t33 + + ((a0 = "zz") && (b0 = "b") && (c0 = "c") && (d0 = "d") + && (a1 = "a") && (b1 = "zz") && (c1 = "c") && (d1 = "d") + && (a2 = "a") && (b2 = "b") && (c2 = "zz") && (d2 = "d") + && (a3 = "a") && (b3 = "b") && (c3 = "c") && (d3 = "zz")) |> Expect.isTrue "" } + + test "Deque.update elements Deque.length 5" { + let r0 = (Deque.ofSeq ["a";"b";"c";"d";"e"]) |> Deque.update 0 "zz" + let a0 = Deque.head r0 + let t01 = Deque.tail r0 + let b0 = Deque.head t01 + let t02 = Deque.tail t01 + let c0 = Deque.head t02 + let t03 = Deque.tail t02 + let d0 = Deque.head t03 + let t04 = Deque.tail t03 + let e0 = Deque.head t04 + + let r1 = (Deque.ofSeq ["a";"b";"c";"d";"e"]) |> Deque.update 1 "zz" + let a1 = Deque.head r1 + let t11 = Deque.tail r1 + let b1 = Deque.head t11 + let t12 = Deque.tail t11 + let c1 = Deque.head t12 + let t13 = Deque.tail t12 + let d1 = Deque.head t13 + let t14 = Deque.tail t13 + let e1 = Deque.head t14 + + let r2 = (Deque.ofSeq ["a";"b";"c";"d";"e"]) |> Deque.update 2 "zz" + let a2 = Deque.head r2 + let t21 = Deque.tail r2 + let b2 = Deque.head t21 + let t22 = Deque.tail t21 + let c2 = Deque.head t22 + let t23 = Deque.tail t22 + let d2 = Deque.head t23 + let t24 = Deque.tail t23 + let e2 = Deque.head t24 + + let r3 = (Deque.ofSeq ["a";"b";"c";"d";"e"]) |> Deque.update 3 "zz" + let a3 = Deque.head r3 + let t31 = Deque.tail r3 + let b3 = Deque.head t31 + let t32 = Deque.tail t31 + let c3 = Deque.head t32 + let t33 = Deque.tail t32 + let d3 = Deque.head t33 + let t34 = Deque.tail t33 + let e3 = Deque.head t34 + + let r4 = (Deque.ofSeq ["a";"b";"c";"d";"e"]) |> Deque.update 4 "zz" + let a4 = Deque.head r4 + let t41 = Deque.tail r4 + let b4 = Deque.head t41 + let t42 = Deque.tail t41 + let c4 = Deque.head t42 + let t43 = Deque.tail t42 + let d4 = Deque.head t43 + let t44 = Deque.tail t43 + let e4 = Deque.head t44 + + ((a0 = "zz") && (b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") + && (a1 = "a") && (b1 = "zz") && (c1 = "c") && (d1 = "d") && (e1 = "e") + && (a2 = "a") && (b2 = "b") && (c2 = "zz") && (d2 = "d") && (e2 = "e") + && (a3 = "a") && (b3 = "b") && (c3 = "c") && (d3 = "zz") && (e3 = "e") + && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d") && (e4 = "zz")) |> Expect.isTrue "" } + + test "Deque.update elements Deque.length 6" { + let r0 = (Deque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> Deque.update 0 "zz" + let a0 = Deque.head r0 + let t01 = Deque.tail r0 + let b0 = Deque.head t01 + let t02 = Deque.tail t01 + let c0 = Deque.head t02 + let t03 = Deque.tail t02 + let d0 = Deque.head t03 + let t04 = Deque.tail t03 + let e0 = Deque.head t04 + let t05 = Deque.tail t04 + let f0 = Deque.head t05 + + let r1 = (Deque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> Deque.update 1 "zz" + let a1 = Deque.head r1 + let t11 = Deque.tail r1 + let b1 = Deque.head t11 + let t12 = Deque.tail t11 + let c1 = Deque.head t12 + let t13 = Deque.tail t12 + let d1 = Deque.head t13 + let t14 = Deque.tail t13 + let e1 = Deque.head t14 + let t15 = Deque.tail t14 + let f1 = Deque.head t15 + + let r2 = (Deque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> Deque.update 2 "zz" + let a2 = Deque.head r2 + let t21 = Deque.tail r2 + let b2 = Deque.head t21 + let t22 = Deque.tail t21 + let c2 = Deque.head t22 + let t23 = Deque.tail t22 + let d2 = Deque.head t23 + let t24 = Deque.tail t23 + let e2 = Deque.head t24 + let t25 = Deque.tail t24 + let f2 = Deque.head t25 + + let r3 = (Deque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> Deque.update 3 "zz" + let a3 = Deque.head r3 + let t31 = Deque.tail r3 + let b3 = Deque.head t31 + let t32 = Deque.tail t31 + let c3 = Deque.head t32 + let t33 = Deque.tail t32 + let d3 = Deque.head t33 + let t34 = Deque.tail t33 + let e3 = Deque.head t34 + let t35 = Deque.tail t34 + let f3 = Deque.head t35 + + let r4 = (Deque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> Deque.update 4 "zz" + let a4 = Deque.head r4 + let t41 = Deque.tail r4 + let b4 = Deque.head t41 + let t42 = Deque.tail t41 + let c4 = Deque.head t42 + let t43 = Deque.tail t42 + let d4 = Deque.head t43 + let t44 = Deque.tail t43 + let e4 = Deque.head t44 + let t45 = Deque.tail t44 + let f4 = Deque.head t45 + + let r5 = (Deque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> Deque.update 5 "zz" + let a5 = Deque.head r5 + let t51 = Deque.tail r5 + let b5 = Deque.head t51 + let t52 = Deque.tail t51 + let c5 = Deque.head t52 + let t53 = Deque.tail t52 + let d5 = Deque.head t53 + let t54 = Deque.tail t53 + let e5 = Deque.head t54 + let t55 = Deque.tail t54 + let f5 = Deque.head t55 + + ((a0 = "zz") && (b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") && (f0 = "f") + && (a1 = "a") && (b1 = "zz") && (c1 = "c") && (d1 = "d") && (e1 = "e") && (f1 = "f") + && (a2 = "a") && (b2 = "b") && (c2 = "zz") && (d2 = "d") && (e2 = "e") && (f2 = "f") + && (a3 = "a") && (b3 = "b") && (c3 = "c") && (d3 = "zz") && (e3 = "e") && (f3 = "f") + && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d") && (e4 = "zz") && (f4 = "f") + && (a5 = "a") && (b5 = "b") && (c5 = "c") && (d5 = "d") && (e5 = "e") && (f5 = "zz")) |> Expect.isTrue "" } + + test "Deque.tryUpdate elements Deque.length 1" { + let a = len1 |> Deque.tryUpdate 0 "aa" + a.Value |> Deque.head |> Expect.equal "" "aa" } + + test "Deque.tryUpdate elements Deque.length 2" { + let x0 = (Deque.ofSeq ["a";"b"]) |> Deque.tryUpdate 0 "zz" + let r0 = x0.Value + let a0 = Deque.head r0 + let t01 = Deque.tail r0 + let b0 = Deque.head t01 + + let x1 = (Deque.ofSeq ["a";"b"]) |> Deque.tryUpdate 1 "zz" + let r1 = x1.Value + let a1 = Deque.head r1 + let t11 = Deque.tail r1 + let b1 = Deque.head t11 + + ((a0 = "zz") && (b0 = "b") + && (a1 = "a") && (b1 = "zz")) |> Expect.isTrue "" } + + test "Deque.tryUpdate elements Deque.length 3" { + let x0 = (Deque.ofSeq ["a";"b";"c"]) |> Deque.tryUpdate 0 "zz" + let r0 = x0.Value + let a0 = Deque.head r0 + let t01 = Deque.tail r0 + let b0 = Deque.head t01 + let t02 = Deque.tail t01 + let c0 = Deque.head t02 + + let x1 = (Deque.ofSeq ["a";"b";"c"]) |> Deque.tryUpdate 1 "zz" + let r1 = x1.Value + let a1 = Deque.head r1 + let t11 = Deque.tail r1 + let b1 = Deque.head t11 + let t12 = Deque.tail t11 + let c1 = Deque.head t12 + + let x2 = (Deque.ofSeq ["a";"b";"c"]) |> Deque.tryUpdate 2 "zz" + let r2 = x2.Value + let a2 = Deque.head r2 + let t21 = Deque.tail r2 + let b2 = Deque.head t21 + let t22 = Deque.tail t21 + let c2 = Deque.head t22 + + ((a0 = "zz") && (b0 = "b") && (c0 = "c") + && (a1 = "a") && (b1 = "zz") && (c1 = "c") + && (a2 = "a") && (b2 = "b") && (c2 = "zz")) |> Expect.isTrue "" } + + test "Deque.tryUpdate elements Deque.length 4" { + let x0 = (Deque.ofSeq ["a";"b";"c";"d"]) |> Deque.tryUpdate 0 "zz" + let r0 = x0.Value + let a0 = Deque.head r0 + let t01 = Deque.tail r0 + let b0 = Deque.head t01 + let t02 = Deque.tail t01 + let c0 = Deque.head t02 + let t03 = Deque.tail t02 + let d0 = Deque.head t03 + + let x1 = (Deque.ofSeq ["a";"b";"c";"d"]) |> Deque.tryUpdate 1 "zz" + let r1 = x1.Value + let a1 = Deque.head r1 + let t11 = Deque.tail r1 + let b1 = Deque.head t11 + let t12 = Deque.tail t11 + let c1 = Deque.head t12 + let t13 = Deque.tail t12 + let d1 = Deque.head t13 + + let x2 = (Deque.ofSeq ["a";"b";"c";"d"]) |> Deque.tryUpdate 2 "zz" + let r2 = x2.Value + let a2 = Deque.head r2 + let t21 = Deque.tail r2 + let b2 = Deque.head t21 + let t22 = Deque.tail t21 + let c2 = Deque.head t22 + let t23 = Deque.tail t22 + let d2 = Deque.head t23 + + let x3 = (Deque.ofSeq ["a";"b";"c";"d"]) |> Deque.tryUpdate 3 "zz" + let r3 = x3.Value + let a3 = Deque.head r3 + let t31 = Deque.tail r3 + let b3 = Deque.head t31 + let t32 = Deque.tail t31 + let c3 = Deque.head t32 + let t33 = Deque.tail t32 + let d3 = Deque.head t33 + + ((a0 = "zz") && (b0 = "b") && (c0 = "c") && (d0 = "d") + && (a1 = "a") && (b1 = "zz") && (c1 = "c") && (d1 = "d") + && (a2 = "a") && (b2 = "b") && (c2 = "zz") && (d2 = "d") + && (a3 = "a") && (b3 = "b") && (c3 = "c") && (d3 = "zz")) |> Expect.isTrue "" } + + test "Deque.tryUncons on empty" { + let q = Deque.empty() + Expect.isNone "Deque.tryUncons" <| Deque.tryUncons q } + + test "Deque.tryUncons on q" { + let q = Deque.ofSeq ["a";"b";"c";"d"] + let x, _ = (Deque.tryUncons q).Value + Expect.equal "Deque.tryUncons" "a" x } + + test "Deque.tryUnsnoc on empty" { + let q = Deque.empty() + Expect.isNone "Deque.tryUnsnoc" <| Deque.tryUnsnoc q } + + test "Deque.tryUnsnoc on q" { + let q = Deque.ofSeq ["a";"b";"c";"d"] + let _, x = (Deque.tryUnsnoc q).Value + Expect.equal "Deque.tryUnsnoc" "d" x } + + test "Deque.tryGetHead on empty" { + let q = Deque.empty() + Expect.isNone "tryHead" <| Deque.tryGetHead q } + + test "Deque.tryGetHead on q" { + let q = Deque.ofSeq ["a";"b";"c";"d"] + Expect.equal "tryHead" "a" (Deque.tryGetHead q).Value } + + test "Deque.tryGetInit on empty" { + let q = Deque.empty() + Expect.isNone "tryInitial" <| Deque.tryGetInit q } + + test "Deque.tryGetInit on q" { + let q = Deque.ofSeq ["a";"b";"c";"d"] + let x = (Deque.tryGetInit q).Value + let x2 = x|> Deque.last + Expect.equal "tryinitial" "c" x2 } + + test "Deque.tryGetLast on empty" { + let q = Deque.empty() + Expect.isNone "tryLast" <| Deque.tryGetLast q } + + test "Deque.tryGetLast on deque" { + let q = Deque.ofSeq ["a";"b";"c";"d"] + Expect.equal "tryLast" "d" (Deque.tryGetLast q).Value + Expect.equal "tryLast" "a" (len2 |> Deque.tryGetLast).Value + Expect.equal "tryLast" "a" (len2snoc |> Deque.tryGetLast).Value } + + test "Deque.tryGetTail on empty" { + let q = Deque.empty() + Expect.isNone "tryTail" <| Deque.tryGetTail q } + + test "Deque.tryGetTail on q" { + let q = Deque.ofSeq ["a";"b";"c";"d"] + Expect.equal "tryTail" "b" ((Deque.tryGetTail q).Value |> Deque.head) } + + test "deprecated structure still works" { + let q = Deque.empty() + (Deque.tryGetTail q = None) |> Expect.isTrue "" } + ] \ No newline at end of file diff --git a/tests/FSharpx.Collections.Experimental.Tests/EagerRoseTreeTest.fs b/tests/FSharpx.Collections.Experimental.Tests/EagerRoseTreeTest.fs index c10a212d..42ec36e5 100644 --- a/tests/FSharpx.Collections.Experimental.Tests/EagerRoseTreeTest.fs +++ b/tests/FSharpx.Collections.Experimental.Tests/EagerRoseTreeTest.fs @@ -1,185 +1,184 @@ -module FSharpx.Collections.Experimental.Tests.EagerRoseTreeTest +namespace FSharpx.Collections.Experimental.Tests open FSharpx open FSharpx.Collections open FSharpx.Collections.Experimental -open NUnit.Framework open FsCheck -open FsCheck.NUnit -open FSharpx.Collections.Tests.Properties -open FsUnit +open FSharpx.Collections.Experimental.Tests.Properties +open Expecto +open Expecto.Flip +module EagerRoseTreeTest = -let tree a b = EagerRoseTree.create a b + let tree a b = EagerRoseTree.create a b -let atree = tree 1 [tree 2 [tree 3 []]; tree 4 [tree 5 [tree 6 []]]] -let ctree = tree "f" [tree "b" [tree "a" []; tree "d" [tree "c" []; tree "e" []]]; tree "g" [tree "i" [tree "h" []]]] + let atree = tree 1 [tree 2 [tree 3 []]; tree 4 [tree 5 [tree 6 []]]] + let ctree = tree "f" [tree "b" [tree "a" []; tree "d" [tree "c" []; tree "e" []]]; tree "g" [tree "i" [tree "h" []]]] -// dfs examples borrowed from http://en.wikipedia.org/wiki/Tree_traversal#Example + type HtmlElement = { TagName: string; Attributes: (string * string) list } -[] -let ``dfs pre``() = - let actual = EagerRoseTree.dfsPre ctree |> Seq.toList - Assert.AreEqual(["f";"b";"a";"d";"c";"e";"g";"i";"h"], actual) + type HtmlNode = + | Element of HtmlElement + | Text of string -[] -let ``dfs post``() = - let actual = EagerRoseTree.dfsPost ctree |> Seq.toList - Assert.AreEqual(["a";"c";"e";"d";"b";"h";"i";"g";"f"], actual) + let elemA tag attr = HtmlNode.Element { TagName = tag; Attributes = attr } + let elem tag = elemA tag [] + let text t = tree (HtmlNode.Text t) [] + type Html = HtmlNode EagerRoseTree + + let htmldoc = + tree (elem "body") [tree (elem "div") [text "hello world"]] + + // dfs examples borrowed from http://en.wikipedia.org/wiki/Tree_traversal#Example + + [] + let testEagerRoseTree = + + testList "Experimental EagerRoseTree" [ + test "dfs pre" { + let actual = EagerRoseTree.dfsPre ctree |> Seq.toList + Expect.equal "" ["f";"b";"a";"d";"c";"e";"g";"i";"h"] actual } + + test "dfs post" { + let actual = EagerRoseTree.dfsPost ctree |> Seq.toList + Expect.equal "" ["a";"c";"e";"d";"b";"h";"i";"g";"f"] actual } -[] -let map() = - let actual = EagerRoseTree.map ((+) 1) atree - let expected = tree 2 [tree 3 [tree 4 []]; tree 5 [tree 6 [tree 7 []]]] - Assert.AreEqual(expected, actual) - -[] -let ``fold via dfs``() = - let actual = EagerRoseTree.dfsPre atree |> Seq.fold (*) 1 - Assert.AreEqual(720, actual) - - -[] -let unfold() = - let a = EagerRoseTree.unfold (fun i -> i, List.ofSeq {i+1..3}) 0 - let expected = tree 0 [tree 1 [tree 2 [tree 3 []]; tree 3 []]; tree 2 [tree 3 []]; tree 3 []] - Assert.AreEqual(expected, a) - -// not the best example, as text nodes cannot have children - -type HtmlElement = { TagName: string; Attributes: (string * string) list } - -type HtmlNode = -| Element of HtmlElement -| Text of string - -let elemA tag attr = HtmlNode.Element { TagName = tag; Attributes = attr } -let elem tag = elemA tag [] -let text t = tree (HtmlNode.Text t) [] -type Html = HtmlNode EagerRoseTree - -let htmldoc = - tree (elem "body") [tree (elem "div") [text "hello world"]] - -[] -let mapAccum() = - let e, taggedHtmlDoc = - EagerRoseTree.mapAccum - (fun i -> function - | Element x -> i+1, Element { x with Attributes = ("data-i",i.ToString())::x.Attributes } - | x -> i,x) 0 htmldoc - let expected = - tree (elemA "body" ["data-i","0"]) - [tree (elemA "div" ["data-i","1"]) [text "hello world"]] - Assert.AreEqual(expected, taggedHtmlDoc) - Assert.AreEqual(2, e) - -[] -let bind() = - let wrapText = - function - | Text t -> tree (elem "span") [text t] - | x -> EagerRoseTree.singleton x - let newDoc = htmldoc |> EagerRoseTree.bind wrapText - let expected = tree (elem "body") [tree (elem "div") [tree (elem "span") [text "hello world"]]] - Assert.AreEqual(expected, newDoc) - -let finiteEagerRoseTreeForest() = - gen { - let! n = Gen.length1thru 5 - let! l = Gen.listOfLength n Arb.generate - return List.fold (fun (s : list>) (t : int) -> (EagerRoseTree.singleton t)::s) [] l - } - -type EagerRoseTreeGen = - static member EagerRoseTree() = - let rec EagerRoseTreeGen() = - gen { - let! root = Arb.generate - // need to set these frequencies to avoid blowing the stack - let! children = Gen.frequency [70, gen.Return List.empty; 1, finiteEagerRoseTreeForest()] - return EagerRoseTree.create root children - } - Arb.fromGen (EagerRoseTreeGen()) - -let registerGen = lazy (Arb.register() |> ignore) - -[] -let equality() = - registerGen.Force() - checkEquality "EagerRoseTree" - -let eRTF l = List.fold (fun (s : list>) (t : int) -> (EagerRoseTree.singleton t)::s) [] l -let eRTF2 = [ for i = 1 to 5 do - yield (EagerRoseTree.create 1 (eRTF [1..5])) - ] -let eRT = EagerRoseTree.create 1 eRTF2 -let singleRT = EagerRoseTree.singleton 1 - -//[] -//let ``functor laws``() = -// registerGen.Force() -// let map = EagerRoseTree.map -// let n = sprintf "EagerRoseTree : functor %s" -// fsCheck (n "preserves identity") <| -// fun value -> map id value = value -// fsCheck (n "preserves composition") <| -// fun f g value -> map (f << g) value = (map f << map g) value -// -[] -let ``functor laws``() = - //fsCheck version of functor and monad laws stackoverflows - let map = EagerRoseTree.map + test "map" { + let actual = EagerRoseTree.map ((+) 1) atree + let expected = tree 2 [tree 3 [tree 4 []]; tree 5 [tree 6 [tree 7 []]]] + Expect.equal "" expected actual } + + test "fold via dfs" { + let actual = EagerRoseTree.dfsPre atree |> Seq.fold (*) 1 + Expect.equal "" 720 actual } + + test "unfold" { + let a = EagerRoseTree.unfold (fun i -> i, List.ofSeq {i+1..3}) 0 + let expected = tree 0 [tree 1 [tree 2 [tree 3 []]; tree 3 []]; tree 2 [tree 3 []]; tree 3 []] + Expect.equal "" expected a } + + // not the best example, as text nodes cannot have children + + test "mapAccum" { + let e, taggedHtmlDoc = + EagerRoseTree.mapAccum + (fun i -> function + | Element x -> i+1, Element { x with Attributes = ("data-i",i.ToString())::x.Attributes } + | x -> i,x) 0 htmldoc + let expected = + tree (elemA "body" ["data-i","0"]) + [tree (elemA "div" ["data-i","1"]) [text "hello world"]] + Expect.equal "" expected taggedHtmlDoc + Expect.equal "" 2 e } + + test "bind" { + let wrapText = + function + | Text t -> tree (elem "span") [text t] + | x -> EagerRoseTree.singleton x + let newDoc = htmldoc |> EagerRoseTree.bind wrapText + let expected = tree (elem "body") [tree (elem "div") [tree (elem "span") [text "hello world"]]] + Expect.equal "" expected newDoc } + ] + + let finiteEagerRoseTreeForest() = + gen { + let! n = Gen.length1thru 5 + let! l = Gen.listOfLength n Arb.generate + return List.fold (fun (s : list>) (t : int) -> (EagerRoseTree.singleton t)::s) [] l + } + + type EagerRoseTreeGen = + static member EagerRoseTree() = + let rec EagerRoseTreeGen() = + gen { + let! root = Arb.generate + // need to set these frequencies to avoid blowing the stack + let! children = Gen.frequency [70, gen.Return List.empty; 1, finiteEagerRoseTreeForest()] + return EagerRoseTree.create root children + } + Arb.fromGen (EagerRoseTreeGen()) + + [] + let testEagerRoseTreePropeerties = + + let registerGen = lazy (Arb.register() |> ignore) + + let equality() = + registerGen.Force() + checkEquality "EagerRoseTree" + + let eRTF l = List.fold (fun (s : list>) (t : int) -> (EagerRoseTree.singleton t)::s) [] l + let eRTF2 = [ for i = 1 to 5 do + yield (EagerRoseTree.create 1 (eRTF [1..5])) + ] + let eRT = EagerRoseTree.create 1 eRTF2 + let singleRT = EagerRoseTree.singleton 1 + + testList "Experimental EagerRoseTree properties" [ + + //test "functor laws" { + // registerGen.Force() + // let map = EagerRoseTree.map + // let n = sprintf "EagerRoseTree : functor %s" + // fsCheck (n "preserves identity") <| + // fun value -> map id value = value + // fsCheck (n "preserves composition") <| + // fun f g value -> map (f << g) value = (map f << map g) value } + + test "functor laws" { + //fsCheck version of functor and monad laws stackoverflows + let map = EagerRoseTree.map - //preserves identity - ((map id eRT) = eRT) |> should equal true - ((map id singleRT) = singleRT) |> should equal true + //preserves identity + ((map id eRT) = eRT) |> Expect.isTrue "" + ((map id singleRT) = singleRT) |> Expect.isTrue "" - let f = (fun x -> x + 5) - let g = (fun x -> x - 2) - - //preserves composition - map (f << g) eRT = (map f << map g) eRT |> should equal true - map (f << g) singleRT = (map f << map g) singleRT |> should equal true - -//[] -//let ``monad laws``() = -// registerGen.Force() -// let n = sprintf "EagerRoseTree : monad %s" -// let inline (>>=) m f = EagerRoseTree.bind f m -// let ret = EagerRoseTree.singleton -// fsCheck "left identity" <| -// fun f a -> ret a >>= f = f a -// fsCheck "right identity" <| -// fun x -> x >>= ret = x -// fsCheck "associativity" <| -// fun f g v -> -// let a = (v >>= f) >>= g -// let b = v >>= (fun x -> f x >>= g) -// a = b -[] -let ``monad laws``() = - //fsCheck version of functor and monad laws stackoverflows - let inline (>>=) m f = EagerRoseTree.bind f m - let ret = EagerRoseTree.singleton - - let myF x = EagerRoseTree.create x [(EagerRoseTree.singleton x); (EagerRoseTree.singleton x)] - let a = 1 - - //left identity - ret a >>= myF = myF a |> should equal true - - //right identity - eRT >>= ret = eRT |> should equal true - singleRT >>= ret = singleRT |> should equal true - - //associativity - let myG x = EagerRoseTree.create (x=x) [(EagerRoseTree.singleton (x=x)); (EagerRoseTree.singleton (x=x))] - - let a' = (eRT >>= myF) >>= myG - let b' = eRT >>= (fun x -> myF x >>= myG) - a' = b' |> should equal true - - let a'' = (singleRT >>= myF) >>= myG - let b'' = singleRT >>= (fun x -> myF x >>= myG) - a'' = b'' |> should equal true + let f = (fun x -> x + 5) + let g = (fun x -> x - 2) + + //preserves composition + map (f << g) eRT = (map f << map g) eRT |> Expect.isTrue "" + map (f << g) singleRT = (map f << map g) singleRT |> Expect.isTrue "" } + + //test "monad laws" { + // registerGen.Force() + // let n = sprintf "EagerRoseTree : monad %s" + // let inline (>>=) m f = EagerRoseTree.bind f m + // let ret = EagerRoseTree.singleton + // fsCheck "left identity" <| + // fun f a -> ret a >>= f = f a + // fsCheck "right identity" <| + // fun x -> x >>= ret = x + // fsCheck "associativity" <| + // fun f g v -> + // let a = (v >>= f) >>= g + // let b = v >>= (fun x -> f x >>= g) + // a = b + test "monad laws" { + //fsCheck version of functor and monad laws stackoverflows + let inline (>>=) m f = EagerRoseTree.bind f m + let ret = EagerRoseTree.singleton + + let myF x = EagerRoseTree.create x [(EagerRoseTree.singleton x); (EagerRoseTree.singleton x)] + let a = 1 + + //left identity + ret a >>= myF = myF a |> Expect.isTrue "" + + //right identity + eRT >>= ret = eRT |> Expect.isTrue "" + singleRT >>= ret = singleRT |> Expect.isTrue "" + + //associativity + let myG x = EagerRoseTree.create (x=x) [(EagerRoseTree.singleton (x=x)); (EagerRoseTree.singleton (x=x))] + + let a' = (eRT >>= myF) >>= myG + let b' = eRT >>= (fun x -> myF x >>= myG) + a' = b' |> Expect.isTrue "" + + let a'' = (singleRT >>= myF) >>= myG + let b'' = singleRT >>= (fun x -> myF x >>= myG) + a'' = b'' |> Expect.isTrue "" } + + ] \ No newline at end of file diff --git a/tests/FSharpx.Collections.Experimental.Tests/EditDistanceTest.fs b/tests/FSharpx.Collections.Experimental.Tests/EditDistanceTest.fs index a7322c98..c15989d0 100644 --- a/tests/FSharpx.Collections.Experimental.Tests/EditDistanceTest.fs +++ b/tests/FSharpx.Collections.Experimental.Tests/EditDistanceTest.fs @@ -1,30 +1,31 @@ -module FSharpx.Collections.Experimental.Tests.EditDistanceTest +namespace FSharpx.Collections.Experimental.Tests open FSharpx.Collections open FSharpx.Collections.Experimental -open NUnit.Framework -open FsUnit +open Expecto +open Expecto.Flip -type BS = ByteString +module EditDistanceTest = -[] -let ``distance example``() = - BKTree.ByteString.distance (BS "kitten"B) (BS "sitting"B) - |> should equal 3 + type BS = ByteString -[] -let ``toListDistance example``() = - [BS "kitten"B; BS "setting"B; BS "getting"B] - |> BKTree.ByteString.ofList - |> BKTree.ByteString.toListDistance 2 (BS "sitting"B) - |> should equal [BS "setting"B; BS "getting"B] + [] + let testEditDistance = + testList "Experimental EditDistance" [ + test "distance example" { + BKTree.ByteString.distance (BS "kitten"B) (BS "sitting"B) + |> Expect.equal "" 3 } -let inline toBS(text:string) = ByteString(System.Text.Encoding.ASCII.GetBytes text) + test "toListDistance example" { + [BS "kitten"B; BS "setting"B; BS "getting"B] + |> BKTree.ByteString.ofList + |> BKTree.ByteString.toListDistance 2 (BS "sitting"B) + |> Expect.equal "" [BS "setting"B; BS "getting"B] } -let calcEditDistance text1 text2 = BKTree.ByteString.distance (toBS text1) (toBS text2) - -[] -let ``String distance example``() = - calcEditDistance "meilenstein" "levenshtein" - |> should equal 4 \ No newline at end of file + test "String distance example" { + let inline toBS(text:string) = ByteString(System.Text.Encoding.ASCII.GetBytes text) + let calcEditDistance text1 text2 = BKTree.ByteString.distance (toBS text1) (toBS text2) + calcEditDistance "meilenstein" "levenshtein" + |> Expect.equal "" 4 } + ] \ No newline at end of file diff --git a/tests/FSharpx.Collections.Experimental.Tests/FSharpx.Collections.Experimental.Tests.fsproj b/tests/FSharpx.Collections.Experimental.Tests/FSharpx.Collections.Experimental.Tests.fsproj index 70ea1110..19e7ba45 100644 --- a/tests/FSharpx.Collections.Experimental.Tests/FSharpx.Collections.Experimental.Tests.fsproj +++ b/tests/FSharpx.Collections.Experimental.Tests/FSharpx.Collections.Experimental.Tests.fsproj @@ -1,87 +1,17 @@  - + - Debug - AnyCPU - 2.0 4b763738-cf1a-4dec-a888-7d3d15054231 - Library + Exe FSharpx.Collections.Experimental.Tests FSharpx.Collections.Experimental.Tests FSharpx.Collections.Experimental.Tests - 4.3.0.0 - v4.5 - - $(MSBuildProjectDirectory)\..\..\ + net47 + true - - true - full - false - bin\Debug - TRACE;DEBUG - prompt - 3 - - - - - - pdbonly - true - bin\Release\ - TRACE - 3 - - - 11 - - - - - - $(MSBuildExtensionsPath32)\..\Microsoft SDKs\F#\3.0\Framework\v4.0\Microsoft.FSharp.Targets - - - - - $(MSBuildExtensionsPath32)\Microsoft\VisualStudio\v$(VisualStudioVersion)\FSharp\Microsoft.FSharp.Targets - - - - - - - - - - - - - FsUnit.fs - - - FsCheckRunner.fs - - - FsCheckProperties.fs - - - Utilities.fs - + @@ -89,15 +19,18 @@ + + - + + @@ -107,14 +40,14 @@ - - + - - + + + @@ -122,65 +55,6 @@ {ad3c8e86-f4cf-426f-a31d-015056227777} True - - FSharpx.Collections - {1e95a279-c2a9-498b-bc72-6e7a0d6854ce} - True - - - - - - - - - - - - ..\..\packages\FsCheck\lib\net40-Client\FsCheck.dll - True - True - - - - - - - - - ..\..\packages\FSharp.Core\lib\net45\FSharp.Core.dll - True - True - - - - - - - - - ..\..\packages\FsUnit\lib\net45\FsUnit.NUnit.dll - True - True - - - ..\..\packages\FsUnit\lib\net45\NHamcrest.dll - True - True - - - - - - - - - ..\..\packages\NUnit\lib\nunit.framework.dll - True - True - - - - + \ No newline at end of file diff --git a/tests/FSharpx.Collections.Experimental.Tests/FileSystemZipperTest.fs b/tests/FSharpx.Collections.Experimental.Tests/FileSystemZipperTest.fs index a404dfb1..8e456d74 100644 --- a/tests/FSharpx.Collections.Experimental.Tests/FileSystemZipperTest.fs +++ b/tests/FSharpx.Collections.Experimental.Tests/FileSystemZipperTest.fs @@ -1,123 +1,124 @@ -// originally from http://learnyouahaskell.com/zippers -module FSharpx.DataStructures.Tests.FileSystemZipperTest +namespace FSharpx.Collections.Experimental.Tests + +// originally from http://learnyouahaskell.com/zippers open System open FSharpx -open FSharpx.DataStructures -open NUnit.Framework -open FsUnit +open FSharpx.Collections.Experimental +open FSharpx.Collections +open Expecto +open Expecto.Flip + +module FileSystemZipperTest = -type FileName = string + type FileName = string -type Folder = { Name: FileName; Items: FSItem list } -and FSItem = - | File of FileName - | Folder of Folder + type Folder = { Name: FileName; Items: FSItem list } + and FSItem = + | File of FileName + | Folder of Folder -let folder(name,items) = Folder { Name = name ; Items = items } + let folder(name,items) = Folder { Name = name ; Items = items } -type Path = FileName * FSItem list * FSItem list + type Path = FileName * FSItem list * FSItem list -type FSZipper = { Focus : FSItem; Path : Path option } + type FSZipper = { Focus : FSItem; Path : Path option } -/// Moves the zipper one directory up -let up (zipper:FSZipper) : FSZipper = + /// Moves the zipper one directory up + let up (zipper:FSZipper) : FSZipper = - match zipper.Path with - | Some (name,ls,rs) -> { zipper with Focus = Folder { Name = name; Items = ls @ [zipper.Focus] @ rs} } + match zipper.Path with + | Some (name,ls,rs) -> { zipper with Focus = Folder { Name = name; Items = ls @ [zipper.Focus] @ rs} } -let getName = function - | File fileName -> fileName - | Folder folder -> folder.Name + let getName = function + | File fileName -> fileName + | Folder folder -> folder.Name -let nameIs name item = getName item = name + let nameIs name item = getName item = name -/// Moves down to the folder with the given name -let moveTo name (zipper:FSZipper) : FSZipper = - match zipper.Focus with - | Folder folder -> - let (ls, item::rs) = List.split (nameIs name) folder.Items - { Focus = item; Path = Some(folder.Name,ls,rs) } + /// Moves down to the folder with the given name + let moveTo name (zipper:FSZipper) : FSZipper = + match zipper.Focus with + | Folder folder -> + let (ls, item::rs) = List.split (nameIs name) folder.Items + { Focus = item; Path = Some(folder.Name,ls,rs) } -/// Renames the given focus -let rename newName zipper = - match zipper.Focus with - | File name -> { zipper with Focus = File newName } - | Folder folder -> { zipper with Focus = Folder { folder with Name = newName } } - -/// Creates a new file in the current directory -let newFile name zipper = - match zipper.Focus with - | Folder folder -> { zipper with Focus = Folder { folder with Items = File name :: folder.Items } } - -/// Creates a new folder in the current directory -let newFolder name zipper = - match zipper.Focus with - | Folder folder -> { zipper with Focus = Folder { folder with Items = Folder {Name = name; Items = [] } :: folder.Items } } - -let zipper fileSystem : FSZipper = { Focus = fileSystem; Path = None } - -let disk = - folder("root", - [File "goat_yelling_like_man.wmv" - File "pope_time.avi" - folder("pics", - [File "ape_throwing_up.jpg" - File "watermelon_smash.gif" - File "skull_man(scary).bmp"]) - File "dijon_poupon.doc" - folder("programs", - [File "fartwizard.exe" - File "owl_bandit.dmg" - File "not_a_virus.exe" - folder("source code", - [File "best_hs_prog.hs" - File "random.hs"]) - ]) - ]) |> zipper - -[] -let ``Can move to subdir``() = - let z = disk |> moveTo "pics" |> moveTo "skull_man(scary).bmp" - Assert.AreEqual(z.Focus,File "skull_man(scary).bmp") - -[] -let ``Can move to subdir and up again``() = - let z = disk |> moveTo "pics" |> moveTo "skull_man(scary).bmp" |> up - Assert.AreEqual(getName z.Focus,"pics") - -[] -let ``Can rename a folder``() = - let z = disk |> moveTo "pics" |> rename "photo" |> up |> moveTo "photo" - Assert.AreEqual(getName z.Focus,"photo") - -[] -let ``Can rename a file``() = - let z = disk |> moveTo "pics" |> moveTo "skull_man(scary).bmp" |> rename "scary.bmp" |> up |> moveTo "scary.bmp" - Assert.AreEqual(getName z.Focus,"scary.bmp") - -[] -let ``Can't access a renamed file with the old name``() = - let ok = ref false - let z1 = disk |> moveTo "pics" |> moveTo "skull_man(scary).bmp" |> rename "scary.bmp" |> up - try - z1 |> moveTo "skull_man(scary).bmp" - () - with - | exn -> ok := true - Assert.IsTrue !ok - -[] -let ``Can create a new file``() = - let z = disk |> moveTo "pics" |> newFile "scary.bmp" |> moveTo "scary.bmp" - Assert.AreEqual(getName z.Focus,"scary.bmp") - -[] -let ``Can still access old files if a new one is created``() = - let z = disk |> moveTo "pics" |> newFile "scary.bmp" |> moveTo "skull_man(scary).bmp" - Assert.AreEqual(getName z.Focus,"skull_man(scary).bmp") - -[] -let ``Can create a new folder``() = - let z = disk |> moveTo "pics" |> newFolder "wedding" |> moveTo "wedding" - Assert.AreEqual(z.Focus,Folder { Name = "wedding"; Items = []}) \ No newline at end of file + /// Renames the given focus + let rename newName zipper = + match zipper.Focus with + | File name -> { zipper with Focus = File newName } + | Folder folder -> { zipper with Focus = Folder { folder with Name = newName } } + + /// Creates a new file in the current directory + let newFile name zipper = + match zipper.Focus with + | Folder folder -> { zipper with Focus = Folder { folder with Items = File name :: folder.Items } } + + /// Creates a new folder in the current directory + let newFolder name zipper = + match zipper.Focus with + | Folder folder -> { zipper with Focus = Folder { folder with Items = Folder {Name = name; Items = [] } :: folder.Items } } + + let zipper fileSystem : FSZipper = { Focus = fileSystem; Path = None } + + let disk = + folder("root", + [File "goat_yelling_like_man.wmv" + File "pope_time.avi" + folder("pics", + [File "ape_throwing_up.jpg" + File "watermelon_smash.gif" + File "skull_man(scary).bmp"]) + File "dijon_poupon.doc" + folder("programs", + [File "fartwizard.exe" + File "owl_bandit.dmg" + File "not_a_virus.exe" + folder("source code", + [File "best_hs_prog.hs" + File "random.hs"]) + ]) + ]) |> zipper + + [] + let testFileSystemZipper = + + testList "Experimental FileSystemZipper" [ + test "Can move to subdir" { + let z = disk |> moveTo "pics" |> moveTo "skull_man(scary).bmp" + Expect.equal "" (File "skull_man(scary).bmp") z.Focus } + + test "Can move to subdir and up again" { + let z = disk |> moveTo "pics" |> moveTo "skull_man(scary).bmp" |> up + Expect.equal "" "pics" <| getName z.Focus } + + test "Can rename a folder" { + let z = disk |> moveTo "pics" |> rename "photo" |> up |> moveTo "photo" + Expect.equal "" "photo" <| getName z.Focus } + + test "Can rename a file" { + let z = disk |> moveTo "pics" |> moveTo "skull_man(scary).bmp" |> rename "scary.bmp" |> up |> moveTo "scary.bmp" + Expect.equal "" "scary.bmp" <| getName z.Focus } + + test "Can't access a renamed file with the old name" { + let ok = ref false + let z1 = disk |> moveTo "pics" |> moveTo "skull_man(scary).bmp" |> rename "scary.bmp" |> up + try + z1 |> moveTo "skull_man(scary).bmp" + () + with + | exn -> ok := true + Expect.isTrue "" !ok } + + test "Can create a new file" { + let z = disk |> moveTo "pics" |> newFile "scary.bmp" |> moveTo "scary.bmp" + Expect.equal "" "scary.bmp" <| getName z.Focus } + + test "Can still access old files if a new one is created" { + let z = disk |> moveTo "pics" |> newFile "scary.bmp" |> moveTo "skull_man(scary).bmp" + Expect.equal "" "skull_man(scary).bmp" <| getName z.Focus } + + test "Can create a new folder" { + let z = disk |> moveTo "pics" |> newFolder "wedding" |> moveTo "wedding" + Expect.equal "" (Folder { Name = "wedding"; Items = []}) z.Focus } + ] \ No newline at end of file diff --git a/tests/FSharpx.Collections.Experimental.Tests/FlatListTest.fs b/tests/FSharpx.Collections.Experimental.Tests/FlatListTest.fs index 7ced911d..1df24d64 100644 --- a/tests/FSharpx.Collections.Experimental.Tests/FlatListTest.fs +++ b/tests/FSharpx.Collections.Experimental.Tests/FlatListTest.fs @@ -1,406 +1,350 @@ -module FSharpx.Collections.Experimental.Tests.FlatListTest +namespace FSharpx.Collections.Experimental.Tests -open System open FSharpx.Collections.Experimental -open FSharpx.Collections.Experimental.FlatList -open FSharpx.Collections.Tests.Properties -open NUnit.Framework +open Properties open FsCheck -open FsCheck.NUnit -open FsUnit +open Expecto +open Expecto.Flip (* -FlatList generators from random ofSeq and/or conj elements from random list +FlatList generators from random FlatList.ofSeq and/or conj elements from random list *) -let flatlistIntGen = - gen { let! n = Gen.length1thru100 - let! x = Gen.listInt n - return ( (FlatList.ofSeq x), x) } +module FlatListTest = -let flatlistObjGen = - gen { let! n = Gen.length2thru100 - let! x = Gen.listObj n - return ( (FlatList.ofSeq x), x) } + let flatlistIntGen = + gen { let! n = Gen.length1thru100 + let! x = Gen.listInt n + return ( (FlatList.ofSeq x), x) } -let flatlistStringGen = - gen { let! n = Gen.length1thru100 - let! x = Gen.listString n - return ( (FlatList.ofSeq x), x) } + let flatlistObjGen = + gen { let! n = Gen.length2thru100 + let! x = Gen.listObj n + return ( (FlatList.ofSeq x), x) } -// NUnit TestCaseSource does not understand array of tuples at runtime -let intGens start = - let v = Array.create 2 (box (flatlistIntGen, "FlatList")) - v.[1] <- box ((flatlistIntGen |> Gen.suchThat (fun (v, l) -> l.Length >= start)), "FlatList OfSeq") - v + let flatlistStringGen = + gen { let! n = Gen.length1thru100 + let! x = Gen.listString n + return ( (FlatList.ofSeq x), x) } -let intGensStart1 = - intGens 1 //this will accept all + // NUnit TestCaseSource does not understand array of tuples at runtime + let intGens start = + let v = Array.create 2 (box (flatlistIntGen, "FlatList")) + v.[1] <- box ((flatlistIntGen |> Gen.filter (fun (v, l) -> l.Length >= start)), "FlatList OfSeq") + v -let intGensStart2 = - intGens 2 // this will accept 11 out of 12 + let intGensStart1 = + intGens 1 //this will accept all -[] -let ``append: multiple appends to an empty flatlist should increase the length``() = - empty |> append (singleton 1) |> append (singleton 4) |> append (singleton 25) |> length |> should equal 3 + let intGensStart2 = + intGens 2 // this will accept 11 out of 12 -[] -let ``append: multiple append to an empty flatlist should create a flatlist``() = - let x = (empty |> append (singleton 1) |> append (singleton 4) |> append (singleton 25)) - x.[0] |> should equal 25 - x.[1] |> should equal 4 - x.[2] |> should equal 1 + [] + let testFlatList = -[] -let ``append: to an empty flatlist should create a singleton flatlist``() = - (empty |> append (singleton 1)).[0] |> should equal 1 + testList "Experimental FlatList" [ -[] -let ``collect: expected result``() = + test "FlatList.append: multiple appends to an FlatList.empty flatlist should increase the FlatList.length" { + FlatList.empty |> FlatList.append (FlatList.singleton 1) |> FlatList.append (FlatList.singleton 4) |> FlatList.append (FlatList.singleton 25) |> FlatList.length |> Expect.equal "" 3 } - fsCheck "FlatList int" (Prop.forAll (Arb.fromGen flatlistIntGen) - (fun ((v :FlatList), (l : int list)) -> v |> collect (fun elem -> ofList [ 0 .. elem ]) - |> toList - = (l |> Array.ofList - |> Array.collect (fun elem -> [| 0 .. elem |]) - |> Array.toList) )) + test "FlatList.append: multiple FlatList.append to an FlatList.empty flatlist should create a flatlist" { + let x = (FlatList.empty |> FlatList.append (FlatList.singleton 1) |> FlatList.append (FlatList.singleton 4) |> FlatList.append (FlatList.singleton 25)) + x.[0] |> Expect.equal "" 25 + x.[1] |> Expect.equal "" 4 + x.[2] |> Expect.equal "" 1 } + test "FlatList.append: to an FlatList.empty flatlist should create a FlatList.singleton flatlist" { + (FlatList.empty |> FlatList.append (FlatList.singleton 1)).[0] |> Expect.equal "" 1 } -[] -let ``concat: expected result``() = + test "FlatList.concat: expected result" { - let aTable max = seq { for i in 1 .. max -> [| for j in 1 .. max -> (i, j, i*j) |] } - let a = Array.concat (aTable 3) + let aTable max = seq { for i in 1 .. max -> [| for j in 1 .. max -> (i, j, i*j) |] } + let a = Array.concat (aTable 3) - let fTable max = - seq { for i in 1 .. max -> [| for j in 1 .. max -> (i, j, i*j) |]} - |> ofSeq - let f = concat (fTable 3) + let fTable max = + seq { for i in 1 .. max -> [| for j in 1 .. max -> (i, j, i*j) |]} + |> FlatList.ofSeq + let f = FlatList.concat (fTable 3) - Array.toList a |> should equal (toList f) + Array.toList a |> Expect.equal "" (FlatList.toList f) } -[] -let ``Equality: flatlist with 3 elements can be compared``() = - let flatlist1 = ref empty - for i in 1..3 do - flatlist1 := append (!flatlist1) (singleton i) + test "Equality: flatlist with 3 elements can be compared" { + let flatlist1 = ref FlatList.empty + for i in 1..3 do + flatlist1 := FlatList.append (!flatlist1) (FlatList.singleton i) - let flatlist2 = ref empty - for i in 1..3 do - flatlist2 := append (!flatlist2) (singleton i) + let flatlist2 = ref FlatList.empty + for i in 1..3 do + flatlist2 := FlatList.append (!flatlist2) (FlatList.singleton i) - let flatlist3 = ref empty - for i in 1..3 do - flatlist3 := append (!flatlist3) (singleton (2*i)) + let flatlist3 = ref FlatList.empty + for i in 1..3 do + flatlist3 := FlatList.append (!flatlist3) (FlatList.singleton (2*i)) - flatlist1 = flatlist1 |> should equal true - flatlist1 = flatlist2 |> should equal true - flatlist1 = flatlist3 |> should equal false + flatlist1 = flatlist1 |> Expect.isTrue "" + flatlist1 = flatlist2 |> Expect.isTrue "" + flatlist1 = flatlist3 |> Expect.isFalse "" } -[] -let ``Equality: structural equality``() = + test "Equality: structural equality" { - let l1 = ofSeq [1..100] - let l2 = ofSeq [1..100] + let l1 = FlatList.ofSeq [1..100] + let l2 = FlatList.ofSeq [1..100] - l1 = l2 |> should equal true + l1 = l2 |> Expect.isTrue "" - let l3 = append (ofSeq [1..99]) (singleton 99) + let l3 = FlatList.append (FlatList.ofSeq [1..99]) (FlatList.singleton 99) - l1 = l3 |> should equal false + l1 = l3 |> Expect.isFalse "" } -[] -let ``empty: flatlist should be empty``() = - let x = empty - x |> length |> should equal 0 + test "FlatList.empty: flatlist should be FlatList.empty" { + let x = FlatList.empty + x |> FlatList.length |> Expect.equal "" 0} -[] -let ``exists: expected result``() = + test "GetHashCode: flatlist with 3 elements can compute hashcodes" { + let flatlist1 = ref FlatList.empty + for i in 1..3 do + flatlist1 := FlatList.append (!flatlist1) (FlatList.singleton i) - fsCheck "FlatList int" (Prop.forAll (Arb.fromGen flatlistIntGen) - (fun ((v :FlatList), (l : int list)) -> v |> exists (fun elem -> elem = 6) - = (l |> Array.ofList - |> Array.exists (fun elem -> elem = 6)) - )) + let flatlist2 = ref FlatList.empty + for i in 1..3 do + flatlist2 := FlatList.append (!flatlist2) (FlatList.singleton i) -[] -let ``filter: expected result``() = + let flatlist3 = ref FlatList.empty + for i in 1..3 do + flatlist3 := FlatList.append (!flatlist3) (FlatList.singleton (2*i)) - fsCheck "FlatList int" (Prop.forAll (Arb.fromGen flatlistIntGen) - (fun ((v :FlatList), (l : int list)) -> v |> filter (fun elem -> elem % 2 = 0) - |> toList - = (l |> Array.ofList - |> Array.filter (fun elem -> elem % 2 = 0) - |> Array.toList) )) + flatlist1.GetHashCode() |> Expect.equal "" (flatlist2.GetHashCode()) + ((flatlist1.GetHashCode()) = (flatlist3.GetHashCode())) |> Expect.isFalse "" } -[] -let ``fold: matches build list rev``() = + test "FlatList.init: flatlist should allow FlatList.init" { + let flatlist = FlatList.init 5 (fun x -> x * 2) + let s = Seq.init 5 (fun x -> x * 2) - fsCheck "FlatList int" (Prop.forAll (Arb.fromGen flatlistIntGen) - (fun ((v :FlatList), (l : int list)) -> v |> fold (fun (l' : int list) (elem : int) -> elem::l') [] = (List.rev l) )) - - fsCheck "FlatList obj" (Prop.forAll (Arb.fromGen flatlistObjGen) - (fun ((v :FlatList), (l : obj list)) -> v |> fold (fun (l' : obj list) (elem : obj) -> elem::l') [] = (List.rev l) )) - - fsCheck "FlatList string" (Prop.forAll (Arb.fromGen flatlistStringGen) - (fun ((v :FlatList), (l : string list)) -> v |> fold (fun (l' : string list) (elem : string) -> elem::l') [] = (List.rev l) )) - -[] -let ``fold2: matches build list fold``() = - - let listFun = fun (l' : (int * int) list) (elem1 : int) (elem2 : int) -> (elem1, elem2)::l' - fsCheck "FlatList int" (Prop.forAll (Arb.fromGen flatlistIntGen) - (fun ((v :FlatList), (l : int list)) -> (v,v) ||> fold2 listFun [] = List.fold2 listFun [] l l )) - - let objFun = fun (l' : (obj * obj) list) (elem1 : obj) (elem2 : obj) -> (elem1, elem2)::l' - fsCheck "FlatList obj" (Prop.forAll (Arb.fromGen flatlistObjGen) - (fun ((v :FlatList), (l : obj list)) -> (v,v) ||> fold2 objFun [] = List.fold2 objFun [] l l )) + s |> Seq.toList |> Expect.equal "" [0;2;4;6;8] + flatlist |> Seq.toList |> Expect.equal "" [0;2;4;6;8] } - let stringFun = fun (l' : (string * string) list) (elem1 : string) (elem2 : string) -> (elem1, elem2)::l' - fsCheck "FlatList string" (Prop.forAll (Arb.fromGen flatlistStringGen) - (fun ((v :FlatList), (l : string list)) -> (v,v) ||> fold2 stringFun [] = List.fold2 stringFun [] l l )) + test "IEnumarable: flatlist with 300 elements should be convertable to a seq" { + let flatlist = ref FlatList.empty + for i in 1..300 do + flatlist := FlatList.append (!flatlist) (FlatList.singleton i) -[] -let ``foldback: matches build list``() = + !flatlist |> Seq.toList |> Expect.equal "" [1..300] } - fsCheck "FlatList" (Prop.forAll (Arb.fromGen flatlistIntGen) - (fun ((v : FlatList), (l : int list)) -> foldBack (fun (elem : int) (l' : int list) -> elem::l') v [] = l )) - - fsCheck "FlatList obj" (Prop.forAll (Arb.fromGen flatlistObjGen) - (fun ((v : FlatList), (l : obj list)) -> foldBack (fun (elem : obj) (l' : obj list) -> elem::l') v [] = l )) - - fsCheck "FlatList string" (Prop.forAll (Arb.fromGen flatlistStringGen) - (fun ((v : FlatList), (l : string list)) -> foldBack (fun (elem : string) (l' : string list) -> elem::l') v [] = l )) - -[] -let ``foldback2: matches build list``() = - - let listFun = fun (elem1 : int) (elem2 : int) (l' : (int * int) list) -> (elem1, elem2)::l' - fsCheck "FlatList" (Prop.forAll (Arb.fromGen flatlistIntGen) - (fun ((v : FlatList), (l : int list)) -> foldBack2 listFun v v [] = List.foldBack2 listFun l l [] )) - - let objFun = fun (elem1 : obj) (elem2 : obj) (l' : (obj * obj) list) -> (elem1, elem2)::l' - fsCheck "FlatList obj" (Prop.forAll (Arb.fromGen flatlistObjGen) - (fun ((v : FlatList), (l : obj list)) -> foldBack2 objFun v v [] = List.foldBack2 objFun l l [] )) - - let stringFun = fun (elem1 : string) (elem2 : string) (l' : (string * string) list) -> (elem1, elem2)::l' - fsCheck "FlatList string" (Prop.forAll (Arb.fromGen flatlistStringGen) - (fun ((v : FlatList), (l : string list)) -> foldBack2 stringFun v v [] = List.foldBack2 stringFun l l [] )) - -[] -let ``forall: works``() = - - fsCheck "FlatList" (Prop.forAll (Arb.fromGen flatlistIntGen) - (fun ((v : FlatList), (l : int list)) -> forall (fun (elem : int) -> elem < 1000) v = true )) - -[] -let ``forall2: works``() = - - fsCheck "FlatList" (Prop.forAll (Arb.fromGen flatlistIntGen) - (fun ((v : FlatList), (l : int list)) -> forall2 (fun (elem1 : int) (elem2 : int) -> (elem1 < 1000 && elem2 < 1000)) v v = true )) + test "FlatList.iter: flatlist should allow FlatList.iter" { + let l' = ref [] + + let l2 = [1;2;3;4] + let v = FlatList.ofSeq l2 -[] -let ``GetHashCode: flatlist with 3 elements can compute hashcodes``() = - let flatlist1 = ref empty - for i in 1..3 do - flatlist1 := append (!flatlist1) (singleton i) + FlatList.iter (fun (elem : int) -> l' := elem::!l') v + + !l' |> Expect.equal "" (List.rev l2) } - let flatlist2 = ref empty - for i in 1..3 do - flatlist2 := append (!flatlist2) (singleton i) + test "FlatList.iter2: flatlist should allow FlatList.iter2" { + let l' = ref [] + + let l2 = [1;2;3;4] + let v = FlatList.ofSeq l2 - let flatlist3 = ref empty - for i in 1..3 do - flatlist3 := append (!flatlist3) (singleton (2*i)) + FlatList.iter2 (fun (elem1 : int) (elem2 : int) -> l' := elem1::elem2::!l') v v + + !l' |> Expect.equal "" (List.rev [1;1;2;2;3;3;4;4]) } - flatlist1.GetHashCode() |> should equal (flatlist2.GetHashCode()) - ((flatlist1.GetHashCode()) = (flatlist3.GetHashCode())) |> should equal false + test "FlatList.iteri: flatlist should allow FlatList.iteri" { + let l' = ref [] + + let l2 = [1;2;3;4] + let v = FlatList.ofSeq l2 -[] -let ``init: flatlist should allow init``() = - let flatlist = init 5 (fun x -> x * 2) - let s = Seq.init 5 (fun x -> x * 2) + FlatList.iteri (fun i (elem : int) -> l' := (i * elem)::!l') v + + !l' |> Expect.equal "" (List.rev [0;2;6;12]) } - s |> Seq.toList |> should equal [0;2;4;6;8] - flatlist |> Seq.toList |> should equal [0;2;4;6;8] + test "FlatList.ofList: flatlist can be created" { + let xs = [7;88;1;4;25;30] + FlatList.ofList xs |> Seq.toList |> Expect.equal "" xs } -[] -let ``IEnumarable: flatlist with 300 elements should be convertable to a seq``() = - let flatlist = ref empty - for i in 1..300 do - flatlist := append (!flatlist) (singleton i) + test "FlatList.ofSeq: flatlist can be created" { + let xs = [7;88;1;4;25;30] + FlatList.ofSeq xs |> Seq.toList |> Expect.equal "" xs } - !flatlist |> Seq.toList |> should equal [1..300] + test "physicalEquality: works" { + let l1 = FlatList.ofSeq [1..100] + let l2 = l1 + let l3 = FlatList.ofSeq [1..100] -let rec nth l i = - match i with - | 0 -> List.head l - | _ -> nth (List.tail l) (i-1) + FlatList.physicalEquality l1 l2 |> Expect.isTrue "" -[] -[] -let ``Item: get last from flatlist``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun (v : FlatList, l : list) -> v.[l.Length - 1] = (nth l (l.Length - 1)) )) + FlatList.physicalEquality l1 l3 |> Expect.isFalse "" } -[] -let ``iter: flatlist should allow iter``() = + test "FlatList.rev: FlatList.empty" { + FlatList.isEmpty (FlatList.empty |> FlatList.rev) |> Expect.isTrue "" } - let l' = ref [] - - let l2 = [1;2;3;4] - let v = ofSeq l2 + test "FlatList.toMap: works" { + let l2 = [(1,"a");(2,"b");(3,"c");(4,"d")] + let v = FlatList.ofList l2 - iter (fun (elem : int) -> l' := elem::!l') v + let m = FlatList.toMap v - !l' |> should equal (List.rev l2) - -[] -let ``iter2: flatlist should allow iter2``() = - - let l' = ref [] - - let l2 = [1;2;3;4] - let v = ofSeq l2 - - iter2 (fun (elem1 : int) (elem2 : int) -> l' := elem1::elem2::!l') v v + m.[1] |> Expect.equal "" "a" + m.[2] |> Expect.equal "" "b" + m.[3] |> Expect.equal "" "c" + m.[4] |> Expect.equal "" "d" + m.ContainsKey 5 |> Expect.isFalse "" } + + test "FlatList.unzip: works" { + let l2 = [(1,"a");(2,"b");(3,"c");(4,"d")] + let v = FlatList.ofList l2 + let x, y = FlatList.unzip v + + FlatList.toList x |> Expect.equal "" [1;2;3;4] + FlatList.toList y |> Expect.equal "" ["a";"b";"c";"d"] } + + test "FlatList.zip: works" { + let l1 = [1;2;3;4] + let l2 = ["a";"b";"c";"d"] + let v1 = FlatList.ofList l1 + let v2 = FlatList.ofList l2 + let v = FlatList.zip v1 v2 - !l' |> should equal (List.rev [1;1;2;2;3;3;4;4]) + FlatList.toList v |> Expect.equal "" [(1,"a");(2,"b");(3,"c");(4,"d")] } + ] + + [] + let testFlatListProperties = + + let listFun = fun (l' : (int * int) list) (elem1 : int) (elem2 : int) -> (elem1, elem2)::l' + let objFun = fun (l' : (obj * obj) list) (elem1 : obj) (elem2 : obj) -> (elem1, elem2)::l' + let stringFun = fun (l' : (string * string) list) (elem1 : string) (elem2 : string) -> (elem1, elem2)::l' + + testList "Experimental FlatList Properties" [ + testPropertyWithConfig config10k "FlatList.collect: expected result" (Prop.forAll (Arb.fromGen flatlistIntGen) <| + fun (v, l) -> v |> FlatList.collect (fun elem -> FlatList.ofList [ 0 .. elem ]) |> FlatList.toList + = (l |> Array.ofList + |> Array.collect (fun elem -> [| 0 .. elem |]) + |> Array.toList) ) + + testPropertyWithConfig config10k "FlatList.exists: expected result" (Prop.forAll (Arb.fromGen flatlistIntGen) <| + fun (v, l) -> v |> FlatList.exists (fun elem -> elem = 6) + = (l |> Array.ofList + |> Array.exists (fun elem -> elem = 6)) ) + + testPropertyWithConfig config10k "filter: expected result" (Prop.forAll (Arb.fromGen flatlistIntGen) <| + fun (v, l) -> v |> FlatList.filter (fun elem -> elem % 2 = 0) |> FlatList.toList + = (l |> Array.ofList + |> Array.filter (fun elem -> elem % 2 = 0) + |> Array.toList) ) + + testPropertyWithConfig config10k "fold: matches build list FlatList.rev int" (Prop.forAll (Arb.fromGen flatlistIntGen) <| + fun (v, l) -> v |> FlatList.fold (fun (l' : int list) (elem : int) -> elem::l') [] = (List.rev l) ) + + testPropertyWithConfig config10k "fold: matches build list FlatList.rev obj" <| + fun (v, l) -> v |> FlatList.fold (fun (l' : obj list) (elem : obj) -> elem::l') [] = (List.rev l) -[] -let ``iteri: flatlist should allow iteri``() = + testPropertyWithConfig config10k "fold: matches build list FlatList.rev string" <| + fun (v, l) -> v |> FlatList.fold (fun (l' : string list) (elem : string) -> elem::l') [] = (List.rev l) - let l' = ref [] - - let l2 = [1;2;3;4] - let v = ofSeq l2 + testPropertyWithConfig config10k "fold2: matches build list fold int" (Prop.forAll (Arb.fromGen flatlistIntGen) <| + fun (v, l) -> (v,v) ||> FlatList.fold2 listFun [] = List.fold2 listFun [] l l ) + + testPropertyWithConfig config10k "fold2: matches build list fold obj" (Prop.forAll (Arb.fromGen flatlistObjGen) <| + fun (v, l) -> (v,v) ||> FlatList.fold2 objFun [] = List.fold2 objFun [] l l ) - iteri (fun i (elem : int) -> l' := (i * elem)::!l') v - - !l' |> should equal (List.rev [0;2;6;12]) + testPropertyWithConfig config10k "fold2: matches build list fold string" (Prop.forAll (Arb.fromGen flatlistStringGen) <| + fun (v, l) -> (v,v) ||> FlatList.fold2 stringFun [] = List.fold2 stringFun [] l l ) + testPropertyWithConfig config10k "foldback: matches build list int" (Prop.forAll (Arb.fromGen flatlistIntGen) <| + fun (v, l) -> FlatList.foldBack (fun (elem : int) (l' : int list) -> elem::l') v [] = l ) + + testPropertyWithConfig config10k "foldback: matches build list obj" (Prop.forAll (Arb.fromGen flatlistObjGen) <| + fun (v, l) -> FlatList.foldBack (fun (elem : obj) (l' : obj list) -> elem::l') v [] = l ) -[] -let ``map: flatlist should allow map``() = + testPropertyWithConfig config10k "foldback: matches build list string" (Prop.forAll (Arb.fromGen flatlistStringGen) <| + fun (v, l) -> FlatList.foldBack (fun (elem : string) (l' : string list) -> elem::l') v [] = l ) - let funMap = (fun x -> x * 2) - fsCheck "FlatList" (Prop.forAll (Arb.fromGen flatlistIntGen) - (fun ((v : FlatList), (l : int list)) -> map funMap v |> toList = List.map funMap l )) + //testPropertyWithConfig config10k "foldback2: matches build list" <| + + // let listFun = fun (elem1 : int) (elem2 : int) (l' : (int * int) list) -> (elem1, elem2)::l' + // fsCheck "FlatList" (Prop.forAll (Arb.fromGen flatlistIntGen) + // (fun (v, l) -> foldBack2 listFun v v [] = List.foldBack2 listFun l l [] )) + + // let objFun = fun (elem1 : obj) (elem2 : obj) (l' : (obj * obj) list) -> (elem1, elem2)::l' + // fsCheck "FlatList obj" (Prop.forAll (Arb.fromGen flatlistObjGen) + // (fun (v, l) -> foldBack2 objFun v v [] = List.foldBack2 objFun l l [] )) -[] -let ``map2: flatlist should allow map2``() = + // let stringFun = fun (elem1 : string) (elem2 : string) (l' : (string * string) list) -> (elem1, elem2)::l' + // fsCheck "FlatList string" (Prop.forAll (Arb.fromGen flatlistStringGen) + // (fun (v, l) -> foldBack2 stringFun v v [] = List.foldBack2 stringFun l l [] )) - let funMap2 = (fun x y -> ((x * 2), (y * 2))) - fsCheck "FlatList" (Prop.forAll (Arb.fromGen flatlistIntGen) - (fun ((v : FlatList), (l : int list)) -> map2 funMap2 v v |> toList = List.map2 funMap2 l l )) + testPropertyWithConfig config10k "forall: works" (Prop.forAll (Arb.fromGen flatlistIntGen) <| + fun (v, l) -> FlatList.forall (fun (elem : int) -> elem < 1000) v = true ) -[] -let ``mapi: flatlist should allow mapi``() = + testPropertyWithConfig config10k "forall2: works" (Prop.forAll (Arb.fromGen flatlistIntGen) <| + fun (v, l) -> FlatList.forall2 (fun (elem1 : int) (elem2 : int) -> (elem1 < 1000 && elem2 < 1000)) v v = true ) - let funMapi = (fun i x -> i * x) - fsCheck "FlatList" (Prop.forAll (Arb.fromGen flatlistIntGen) - (fun ((v : FlatList), (l : int list)) -> mapi funMapi v |> toList = List.mapi funMapi l )) + //let rec nth l i = + // match i with + // | 0 -> List.head l + // | _ -> nth (List.tail l) (i-1) -[] -let ``ofList: flatlist can be created``() = - let xs = [7;88;1;4;25;30] - ofList xs |> Seq.toList |> should equal xs + //[] + //testPropertyWithConfig config10k "Item: get last from flatlist``(x : obj) = + // let genAndName = unbox x + // fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun (v : FlatList, l : list) -> v.[l.Length - 1] = (nth l (l.Length - 1)) )) -[] -let ``ofSeq: flatlist can be created``() = - let xs = [7;88;1;4;25;30] - ofSeq xs |> Seq.toList |> should equal xs + //testPropertyWithConfig config10k "map: flatlist should allow map" <| -[] -let ``partition: works``() = + // let funMap = (fun x -> x * 2) + // fsCheck "FlatList" (Prop.forAll (Arb.fromGen flatlistIntGen) + // (fun (v, l) -> map funMap v |> FlatList.toList = List.map funMap l )) - let funMapi = (fun x -> x % 2 = 0) - fsCheck "FlatList" (Prop.forAll (Arb.fromGen flatlistIntGen) - (fun ((v : FlatList), (l : int list)) -> let x, y = partition funMapi v - ((toList x),(toList y)) = List.partition funMapi l )) + //testPropertyWithConfig config10k "map2: flatlist should allow map2" <| -[] -let ``physicalEquality: works``() = + // let funMap2 = (fun x y -> ((x * 2), (y * 2))) + // fsCheck "FlatList" (Prop.forAll (Arb.fromGen flatlistIntGen) + // (fun (v, l) -> map2 funMap2 v v |> FlatList.toList = List.map2 funMap2 l l )) - let l1 = ofSeq [1..100] - let l2 = l1 - let l3 = ofSeq [1..100] + //testPropertyWithConfig config10k "mapi: flatlist should allow mapi" <| - physicalEquality l1 l2 |> should equal true + // let funMapi = (fun i x -> i * x) + // fsCheck "FlatList" (Prop.forAll (Arb.fromGen flatlistIntGen) + // (fun (v, l) -> mapi funMapi v |> FlatList.toList = List.mapi funMapi l )) - physicalEquality l1 l3 |> should equal false + //testPropertyWithConfig config10k "partition: works" <| -[] -let ``rev: empty``() = - isEmpty (empty |> rev) |> should equal true + // let funMapi = (fun x -> x % 2 = 0) + // fsCheck "FlatList" (Prop.forAll (Arb.fromGen flatlistIntGen) + // (fun (v, l) -> let x, y = partition funMapi v + // ((FlatList.toList x),(FlatList.toList y)) = List.partition funMapi l )) -[] -let ``rev: matches build list rev``() = + //testPropertyWithConfig config10k "FlatList.rev: matches build list FlatList.rev" <| - fsCheck "FlatList" (Prop.forAll (Arb.fromGen flatlistIntGen) - (fun ((q :FlatList), (l : int list)) -> q |> rev |> List.ofSeq = (List.rev l) )) + // fsCheck "FlatList" (Prop.forAll (Arb.fromGen flatlistIntGen) + // (fun ((q :FlatList), (l : int list)) -> q |> FlatList.rev |> List.FlatList.ofSeq = (List.FlatList.rev l) )) - fsCheck "FlatList obj" (Prop.forAll (Arb.fromGen flatlistObjGen) - (fun ((q :FlatList), (l : obj list)) -> q |> rev |> List.ofSeq = (List.rev l) )) + // fsCheck "FlatList obj" (Prop.forAll (Arb.fromGen flatlistObjGen) + // (fun ((q :FlatList), (l : obj list)) -> q |> FlatList.rev |> List.FlatList.ofSeq = (List.FlatList.rev l) )) - fsCheck "FlatList string" (Prop.forAll (Arb.fromGen flatlistStringGen) - (fun ((q :FlatList), (l : string list)) -> q |> rev |> List.ofSeq = (List.rev l) )) + // fsCheck "FlatList string" (Prop.forAll (Arb.fromGen flatlistStringGen) + // (fun ((q :FlatList), (l : string list)) -> q |> FlatList.rev |> List.FlatList.ofSeq = (List.FlatList.rev l) )) -[] -let ``sum: works``() = + //testPropertyWithConfig config10k "sum: works" <| - fsCheck "FlatList" (Prop.forAll (Arb.fromGen flatlistIntGen) - (fun ((v : FlatList), (l : int list)) -> sum v = List.sum l )) + // fsCheck "FlatList" (Prop.forAll (Arb.fromGen flatlistIntGen) + // (fun (v, l) -> sum v = List.sum l )) -[] -let ``sumBy: works``() = + //testPropertyWithConfig config10k "sumBy: works" <| + // let funSumBy = (fun x -> x * 2) + // fsCheck "FlatList" (Prop.forAll (Arb.fromGen flatlistIntGen) + // (fun (v, l) -> sumBy funSumBy v = List.sumBy funSumBy l )) - let funSumBy = (fun x -> x * 2) - fsCheck "FlatList" (Prop.forAll (Arb.fromGen flatlistIntGen) - (fun ((v : FlatList), (l : int list)) -> sumBy funSumBy v = List.sumBy funSumBy l )) + //testPropertyWithConfig config10k "tryFind: works" <| + // let funTryFind = (fun x -> x % 2 = 0) + // fsCheck "FlatList" (Prop.forAll (Arb.fromGen flatlistIntGen) + // (fun (v, l) -> + // match tryFind funTryFind v with + // | None -> None = List.tryFind funTryFind l + // | Some x -> x = (List.tryFind funTryFind l).Value )) -[] -let ``toMap: works``() = - - let l2 = [(1,"a");(2,"b");(3,"c");(4,"d")] - let v = ofList l2 - - let m = toMap v - - m.[1] |> should equal "a" - m.[2] |> should equal "b" - m.[3] |> should equal "c" - m.[4] |> should equal "d" - m.ContainsKey 5 |> should equal false - -[] -let ``tryFind: works``() = - - let funTryFind = (fun x -> x % 2 = 0) - fsCheck "FlatList" (Prop.forAll (Arb.fromGen flatlistIntGen) - (fun ((v : FlatList), (l : int list)) -> - match tryFind funTryFind v with - | None -> None = List.tryFind funTryFind l - | Some x -> x = (List.tryFind funTryFind l).Value )) - -[] -let ``unzip: works``() = - - let l2 = [(1,"a");(2,"b");(3,"c");(4,"d")] - let v = ofList l2 - let x, y = unzip v - - toList x |> should equal [1;2;3;4] - toList y |> should equal ["a";"b";"c";"d"] - -[] -let ``zip: works``() = - - let l1 = [1;2;3;4] - let l2 = ["a";"b";"c";"d"] - let v1 = ofList l1 - let v2 = ofList l2 - let v = zip v1 v2 - - toList v |> should equal [(1,"a");(2,"b");(3,"c");(4,"d")] \ No newline at end of file + ] \ No newline at end of file diff --git a/tests/FSharpx.Collections.Experimental.Tests/FsCheckProperties.fs b/tests/FSharpx.Collections.Experimental.Tests/FsCheckProperties.fs new file mode 100644 index 00000000..7632a4ec --- /dev/null +++ b/tests/FSharpx.Collections.Experimental.Tests/FsCheckProperties.fs @@ -0,0 +1,70 @@ +module FSharpx.Collections.Experimental.Tests.Properties + +open Expecto +open FSharpx.Collections +open FsCheck + +let configReplay = { FsCheckConfig.defaultConfig with maxTest = 10000 ; replay = Some <| (1940624926, 296296394) } +let config10k = { FsCheckConfig.defaultConfig with maxTest = 10000 } + +let fsCheck name testable = + FsCheck.Check.One (name, FsCheck.Config.Default, testable) + +let checkEquality<'a when 'a : equality> name = + let n = sprintf "%s : equality %s" name + fsCheck (n "identity") <| + fun (x: 'a) -> x = x + fsCheck (n "predicate") <| + // depends a lot on the quality of the generated predicates, i.e. a constant predicate isn't useful. + fun (f: 'a -> bool) x y -> f x = f y + fsCheck (n "transitive") <| + // not very useful, it's not likely that relevant values will be generated + fun (x: 'a) (y: 'a) (z: 'a) -> + if x = y && y = z then x = z else true + +let classifyCollect xs (count : int) (y : bool) = + y |> Prop.collect count + |> Prop.classify (xs.GetType().FullName.Contains("System.Int32")) "int" + |> Prop.classify (xs.GetType().FullName.Contains("System.String")) "string" + |> Prop.classify (xs.GetType().FullName.Contains("System.Boolean")) "bool" + |> Prop.classify (xs.GetType().FullName.Contains("System.Object")) "object" + +module Gen = + let rec infiniteSeq() = + gen { + let! x = Arb.generate + let! xs = infiniteSeq() + return Seq.append (Seq.singleton x) xs + } + + let infiniteLazyList() = + Gen.map LazyList.ofSeq (infiniteSeq()) + + let finiteLazyList() = + Gen.map LazyList.ofList Arb.generate + +(* +Recommend a range of size 1 - 12 for lists used to build test data structures: + +Several data structures, especially those where the internal data representation is either binary or skew binary, have "distinct failure modes +across the low range of sizes". What I mean by this is "it is possible to have bugs specific to certain small sizes in these data structures". So it is +important that every structure size up to a certain value (let us say "8" for arguments sake) needs to be tested every time. By default FsCheck generates +100 (pseudo-random) lists. The larger the size range you allow for generation, the higher the chance these crucial small sizes will be skipped. +*) + let listBool n = Gen.listOfLength n Arb.generate + + let listInt n = Gen.listOfLength n Arb.generate + + let listObj n = Gen.listOfLength n Arb.generate + + let listString n = Gen.listOfLength n Arb.generate + + let length1thru n = Gen.choose (1, n) + + let length1thru12 = Gen.choose (1, 12) + + let length2thru12 = Gen.choose (2, 12) + + let length1thru100 = Gen.choose (1, 100) + + let length2thru100 = Gen.choose (2, 100) \ No newline at end of file diff --git a/tests/FSharpx.Collections.Experimental.Tests/HeapGen.fs b/tests/FSharpx.Collections.Experimental.Tests/HeapGen.fs index 96bee8b5..5ba3f851 100644 --- a/tests/FSharpx.Collections.Experimental.Tests/HeapGen.fs +++ b/tests/FSharpx.Collections.Experimental.Tests/HeapGen.fs @@ -2,11 +2,8 @@ open FSharpx.Collections open FSharpx.Collections.Experimental -open FSharpx.Collections.Tests.Properties -open NUnit.Framework +open FSharpx.Collections.Experimental.Tests.Properties open FsCheck -open FsCheck.NUnit -open FsUnit module HeapGen = diff --git a/tests/FSharpx.Collections.Experimental.Tests/HeapPriorityQueueTest.fs b/tests/FSharpx.Collections.Experimental.Tests/HeapPriorityQueueTest.fs index a429846f..2481b9f0 100644 --- a/tests/FSharpx.Collections.Experimental.Tests/HeapPriorityQueueTest.fs +++ b/tests/FSharpx.Collections.Experimental.Tests/HeapPriorityQueueTest.fs @@ -1,88 +1,85 @@ -module FSharpx.Collections.Experimental.Tests.HeapPriorityQueueTest +namespace FSharpx.Collections.Experimental.Tests -open FSharpx -open FSharpx.Collections.Experimental.HeapPriorityQueue -open NUnit.Framework -open FsUnit +open FSharpx.Collections.Experimental +open Expecto +open Expecto.Flip -[] -let ``empty queue should be empty``() = - let pq = empty false +module HeapPriorityQueueTest = - isEmpty pq |> should equal true - tryPeek pq |> should equal None - tryPop pq |> should equal None + [] + let testHeapPriorityQueue = -[] -let ``After adding an element to the PQ it shouldn't be empty``() = - let pq = empty false |> insert 1 + testList "Experimental HeapPriorityQueue" [ + test "HeapPriorityQueue.empty queue should be HeapPriorityQueue.empty" { + let pq = HeapPriorityQueue.empty false - isEmpty pq |> should equal false - + HeapPriorityQueue.isEmpty pq |> Expect.isTrue "" + HeapPriorityQueue.tryPeek pq |> Expect.isNone "" + HeapPriorityQueue.tryPop pq |> Expect.isNone "" } + + test "After adding an element to the PQ it shouldn't be HeapPriorityQueue.empty" { + let pq = HeapPriorityQueue.empty false |> HeapPriorityQueue.insert 1 -[] -let ``After adding an element to the PQ the element should be the smallest``() = - let pq = empty false |> insert 1 + HeapPriorityQueue.isEmpty pq |> Expect.isFalse "" } + - tryPeek pq |> should equal (Some 1) - peek pq |> should equal 1 + test "After adding an element to the PQ the element should be the smallest" { + let pq = HeapPriorityQueue.empty false |> HeapPriorityQueue.insert 1 -[] -let ``After adding an element to the PQ and popping it the PQ should be empty``() = - let pq = empty false |> insert 1 + HeapPriorityQueue.tryPeek pq |> Expect.equal "" (Some 1) + HeapPriorityQueue.peek pq |> Expect.equal "" 1 } - let element,newPQ = pop pq - element |> should equal 1 - isEmpty newPQ |> should equal true + test "After adding an element to the PQ and popping it the PQ should be HeapPriorityQueue.empty" { + let pq = HeapPriorityQueue.empty false |> HeapPriorityQueue.insert 1 - let element,newPQ = (tryPop pq).Value - element |> should equal 1 - isEmpty newPQ |> should equal true + let element,newPQ = HeapPriorityQueue.pop pq + element |> Expect.equal "" 1 + HeapPriorityQueue.isEmpty newPQ |> Expect.isTrue "" -[] -let ``Adding multiple elements to the PQ should allow to pop the smallest``() = - let pq = empty false |> insert 1 |> insert 3 |> insert 0 |> insert 4 |> insert -3 + let element,newPQ = (HeapPriorityQueue.tryPop pq).Value + element |> Expect.equal "" 1 + HeapPriorityQueue.isEmpty newPQ |> Expect.isTrue "" } - let element,newPQ = pop pq - element |> should equal -3 + test "Adding multiple elements to the PQ should allow to HeapPriorityQueue.pop the smallest" { + let pq = HeapPriorityQueue.empty false |> HeapPriorityQueue.insert 1 |> HeapPriorityQueue.insert 3 |> HeapPriorityQueue.insert 0 |> HeapPriorityQueue.insert 4 |> HeapPriorityQueue.insert -3 - let element,newPQ = pop newPQ - element |> should equal 0 + let element,newPQ = HeapPriorityQueue.pop pq + element |> Expect.equal "" -3 - let element,newPQ = pop newPQ - element |> should equal 1 + let element,newPQ = HeapPriorityQueue.pop newPQ + element |> Expect.equal "" 0 - let element,newPQ = pop newPQ - element |> should equal 3 + let element,newPQ = HeapPriorityQueue.pop newPQ + element |> Expect.equal "" 1 - let element,newPQ = pop newPQ - element |> should equal 4 + let element,newPQ = HeapPriorityQueue.pop newPQ + element |> Expect.equal "" 3 - isEmpty newPQ |> should equal true + let element,newPQ = HeapPriorityQueue.pop newPQ + element |> Expect.equal "" 4 -[] -let ``Adding multiple elements to a MaxPriorityQueue should allow to pop the smallest``() = - let pq = empty true |> insert 1 |> insert 3 |> insert 0 |> insert 4 |> insert -3 + HeapPriorityQueue.isEmpty newPQ |> Expect.isTrue "" } - let element,newPQ = pop pq - element |> should equal 4 + test "Adding multiple elements to a MaxPriorityQueue should allow to HeapPriorityQueue.pop the smallest" { + let pq = HeapPriorityQueue.empty true |> HeapPriorityQueue.insert 1 |> HeapPriorityQueue.insert 3 |> HeapPriorityQueue.insert 0 |> HeapPriorityQueue.insert 4 |> HeapPriorityQueue.insert -3 - let element,newPQ = pop newPQ - element |> should equal 3 + let element,newPQ = HeapPriorityQueue.pop pq + element |> Expect.equal "" 4 - let element,newPQ = pop newPQ - element |> should equal 1 + let element,newPQ = HeapPriorityQueue.pop newPQ + element |> Expect.equal "" 3 - let element,newPQ = pop newPQ - element |> should equal 0 + let element,newPQ = HeapPriorityQueue.pop newPQ + element |> Expect.equal "" 1 - let element,newPQ = pop newPQ - element |> should equal -3 + let element,newPQ = HeapPriorityQueue.pop newPQ + element |> Expect.equal "" 0 - isEmpty newPQ |> should equal true + let element,newPQ = HeapPriorityQueue.pop newPQ + element |> Expect.equal "" -3 } -[] -let ``Can use a PQ as a seq``() = - let pq = empty false |> insert 15 |> insert 3 |> insert 0 |> insert 4 |> insert -3 + test "Can use a PQ as a seq" { + let pq = HeapPriorityQueue.empty false |> HeapPriorityQueue.insert 15 |> HeapPriorityQueue.insert 3 |> HeapPriorityQueue.insert 0 |> HeapPriorityQueue.insert 4 |> HeapPriorityQueue.insert -3 - pq |> Seq.toList |> should equal [-3;0;3;4;15] \ No newline at end of file + pq |> Seq.toList |> Expect.equal "" [-3;0;3;4;15] } + ] \ No newline at end of file diff --git a/tests/FSharpx.Collections.Experimental.Tests/IQueueTest.fs b/tests/FSharpx.Collections.Experimental.Tests/IQueueTest.fs index 8d6f92c6..f72a6f7e 100644 --- a/tests/FSharpx.Collections.Experimental.Tests/IQueueTest.fs +++ b/tests/FSharpx.Collections.Experimental.Tests/IQueueTest.fs @@ -1,335 +1,318 @@ -module FSharpx.Collections.Experimental.Tests.IQueueTest +namespace FSharpx.Collections.Experimental.Tests open FSharpx.Collections open FSharpx.Collections.Experimental -open FSharpx.Collections.Tests.Properties -open NUnit.Framework +open FSharpx.Collections.Experimental.Tests.Properties open FsCheck -open FsCheck.NUnit -open FsUnit - -let emptyIQueues = - let v = Array.create 4 (BankersQueue.empty() :> IQueue) - v.[1] <- (BatchedQueue.empty() :> IQueue) - v.[2] <- (PhysicistQueue.empty() :> IQueue) - v.[3] <- (HoodMelvilleQueue.empty() :> IQueue) - v - -// NUnit TestCaseSource does not understand array of tuples at runtime -let intGens start = - let v = Array.create 12 (box (QueueGen.bankersQueueIntGen, "BankersQueue")) - v.[1] <- box ((QueueGen.bankersQueueIntOfSeqGen |> Gen.suchThat (fun (q, l) -> l.Length >= start)), "BankersQueue OfSeq") - v.[2] <- box ((QueueGen.bankersQueueIntSnocGen |> Gen.suchThat (fun (q, l) -> l.Length >= start)), "BankersQueue Snoc") - v.[3] <- box (QueueGen.batchedQueueIntGen, "BatchedQueue") - v.[4] <- box ((QueueGen.batchedQueueIntOfSeqGen |> Gen.suchThat (fun (q, l) -> l.Length >= start)), "BatchedQueue OfSeq") - v.[5] <- box ((QueueGen.batchedQueueIntSnocGen |> Gen.suchThat (fun (q, l) -> l.Length >= start)), "BatchedQueue Snoc") - v.[6] <- box (QueueGen.hoodMelvilleQueueIntGen, "HoodMelvilleQueue") - v.[7] <- box ((QueueGen.hoodMelvilleQueueIntOfSeqGen |> Gen.suchThat (fun (q, l) -> l.Length >= start)), "HoodMelvilleQueue OfSeq") - v.[8] <- box ((QueueGen.hoodMelvilleQueueIntSnocGen |> Gen.suchThat (fun (q, l) -> l.Length >= start)), "HoodMelvilleQueue Snoc") - v.[9] <- box (QueueGen.physicistQueueIntGen, "PhysicistQueue") - v.[10] <- box ((QueueGen.physicistQueueIntOfSeqGen |> Gen.suchThat (fun (q, l) -> l.Length >= start)), "PhysicistQueue OfSeq") - v.[11] <- box ((QueueGen.physicistQueueIntSnocGen |> Gen.suchThat (fun (q, l) -> l.Length >= start)), "PhysicistQueue Snoc") - v - -let objGens = - let v = Array.create 4 (box (QueueGen.bankersQueueObjGen, "BankersQueue")) - v.[1] <- box (QueueGen.batchedQueueObjGen, "BatchedQueue") - v.[2] <- box (QueueGen.hoodMelvilleQueueObjGen, "HoodMelvilleQueue") - v.[3] <- box (QueueGen.physicistQueueObjGen, "PhysicistQueue") - v - -let stringGens = - let v = Array.create 4 (box (QueueGen.bankersQueueStringGen, "BankersQueue")) - v.[1] <- box (QueueGen.batchedQueueStringGen, "BatchedQueue") - v.[2] <- box (QueueGen.hoodMelvilleQueueStringGen, "HoodMelvilleQueue") - v.[3] <- box (QueueGen.physicistQueueStringGen, "PhysicistQueue") - v - -let intGensStart1 = - intGens 1 //this will accept all - -let intGensStart2 = - intGens 2 // this will accept 11 out of 12 - -[] -[] -[] -[] -let ``allow to dequeue``(eIQ : IQueue) = - ((eIQ.Snoc 1).Tail).IsEmpty |> should equal true - -[] -[] -[] -[] -let ``allow to enqueue``(eIQ : IQueue) = - ((eIQ.Snoc 1).Snoc 2).IsEmpty |> should equal false - -[] -[] -[] -let ``cons pattern discriminator - BankersQueue``() = - let q = BankersQueue.ofSeq ["f";"e";"d";"c";"b";"a"] +open Expecto +open Expecto.Flip + +module IQueueTest = + + let emptyIQueues = + let v = Array.create 4 (BankersQueue.empty() :> IQueue) + v.[1] <- (BatchedQueue.empty() :> IQueue) + v.[2] <- (PhysicistQueue.empty() :> IQueue) + v.[3] <- (HoodMelvilleQueue.empty() :> IQueue) + v + + // NUnit TestCaseSource does not understand array of tuples at runtime + let intGens start = + let v = Array.create 12 QueueGen.bankersQueueIntGen + v.[1] <- QueueGen.bankersQueueIntOfSeqGen |> Gen.filter (fun (q, l) -> l.Length >= start) + v.[2] <- QueueGen.bankersQueueIntSnocGen |> Gen.filter (fun (q, l) -> l.Length >= start) + v.[3] <- QueueGen.batchedQueueIntGen + v.[4] <- QueueGen.batchedQueueIntOfSeqGen |> Gen.filter (fun (q, l) -> l.Length >= start) + v.[5] <- QueueGen.batchedQueueIntSnocGen |> Gen.filter (fun (q, l) -> l.Length >= start) + v.[6] <- QueueGen.hoodMelvilleQueueIntGen + v.[7] <- QueueGen.hoodMelvilleQueueIntOfSeqGen |> Gen.filter (fun (q, l) -> l.Length >= start) + v.[8] <- QueueGen.hoodMelvilleQueueIntSnocGen |> Gen.filter (fun (q, l) -> l.Length >= start) + v.[9] <- QueueGen.physicistQueueIntGen + v.[10] <- QueueGen.physicistQueueIntOfSeqGen |> Gen.filter (fun (q, l) -> l.Length >= start) + v.[11] <- QueueGen.physicistQueueIntSnocGen |> Gen.filter (fun (q, l) -> l.Length >= start) + v + + let objGens = + let v = Array.create 4 QueueGen.bankersQueueObjGen + v.[1] <- QueueGen.batchedQueueObjGen + v.[2] <- QueueGen.hoodMelvilleQueueObjGen + v.[3] <- QueueGen.physicistQueueObjGen + v + + let stringGens = + let v = Array.create 4 QueueGen.bankersQueueStringGen + v.[1] <- QueueGen.batchedQueueStringGen + v.[2] <- QueueGen.hoodMelvilleQueueStringGen + v.[3] <- QueueGen.physicistQueueStringGen + v + + let intGensStart1 = + intGens 1 //this will accept all + + let intGensStart2 = + intGens 2 // this will accept 11 out of 12 + + [] + let testIQueue = + + testList "Experimental IQueue" [ + //[] + //[] + //[] + //test "allow to dequeue``(eIQ : IQueue) = + // ((eIQ.Snoc 1).Tail).IsEmpty |> Expect.isTrue "" } + + //[] + //[] + //[] + //test "allow to enqueue``(eIQ : IQueue) = + // ((eIQ.Snoc 1).Snoc 2).IsEmpty |> Expect.isFalse "" } + + //[] + //[] + //test "cons pattern discriminator - BankersQueue" { + // let q = BankersQueue.ofSeq ["f";"e";"d";"c";"b";"a"] - let h1, t1 = - match q with - | BankersQueue.Cons(h, t) -> h, t - | _ -> "x", q - - ((h1 = "f") && (t1.Length = 5)) |> should equal true - -[] -[] -[] -let ``cons pattern discriminator - BatchedQueue``() = - let q = BatchedQueue.ofSeq ["f";"e";"d";"c";"b";"a"] + // let h1, t1 = + // match q with + // | BankersQueue.Cons(h, t) -> h, t + // | _ -> "x", q + + // ((h1 = "f") && (t1.Length = 5)) |> Expect.isTrue "" } + + //[] + //[] + //test "cons pattern discriminator - BatchedQueue" { + // let q = BatchedQueue.ofSeq ["f";"e";"d";"c";"b";"a"] - let h1, t1 = - match q with - | BatchedQueue.Cons(h, t) -> h, t - | _ -> "x", q - - ((h1 = "f") && (t1.Length = 5)) |> should equal true - -[] -[] -[] -let ``cons pattern discriminator - HoodMelvilleQueue``() = - let q = HoodMelvilleQueue.ofSeq ["f";"e";"d";"c";"b";"a"] + // let h1, t1 = + // match q with + // | BatchedQueue.Cons(h, t) -> h, t + // | _ -> "x", q + + // ((h1 = "f") && (t1.Length = 5)) |> Expect.isTrue "" } + + //[] + //[] + //test "cons pattern discriminator - HoodMelvilleQueue" { + // let q = HoodMelvilleQueue.ofSeq ["f";"e";"d";"c";"b";"a"] - let h1, t1 = - match q with - | HoodMelvilleQueue.Cons(h, t) -> h, t - | _ -> "x", q - - ((h1 = "f") && (t1.Length = 5)) |> should equal true - -[] -[] -[] -let ``cons pattern discriminator - PhysicistQueue``() = - let q = PhysicistQueue.ofSeq ["f";"e";"d";"c";"b";"a"] + // let h1, t1 = + // match q with + // | HoodMelvilleQueue.Cons(h, t) -> h, t + // | _ -> "x", q + + // ((h1 = "f") && (t1.Length = 5)) |> Expect.isTrue "" } + + //[] + //[] + //test "cons pattern discriminator - PhysicistQueue" { + // let q = PhysicistQueue.ofSeq ["f";"e";"d";"c";"b";"a"] - let h1, t1 = - match q with - | PhysicistQueue.Cons(h, t) -> h, t - | _ -> "x", q - - ((h1 = "f") && (t1.Length = 5)) |> should equal true - -[] -[] -[] -[] -let ``empty queue should be empty``(eIQ : IQueue) = - eIQ.IsEmpty |> should equal true - -[] -[] -[] -[] -let ``fail if there is no head in the queue``(eIQ : IQueue) = - let ok = ref false - try - eIQ.Head |> ignore - with x when x = Exceptions.Empty -> ok := true - !ok |> should equal true - -[] -[] -[] -[] -let ``fail if there is no tail in the queue``(eIQ : IQueue) = - let ok = ref false - try - eIQ.Tail |> ignore - with x when x = Exceptions.Empty -> ok := true - !ok |> should equal true - -[] -[] -[] -let ``fold matches build list rev``() = - - fsCheck "BatchedQueue" (Prop.forAll (Arb.fromGen QueueGen.batchedQueueIntGen) - (fun ((q :IQueue), (l : int list)) -> q :?> BatchedQueue |> BatchedQueue.fold (fun (l' : int list) (elem : int) -> elem::l') [] = (List.rev l) |> classifyCollect q (q.Length()))) + // let h1, t1 = + // match q with + // | PhysicistQueue.Cons(h, t) -> h, t + // | _ -> "x", q + + // ((h1 = "f") && (t1.Length = 5)) |> Expect.isTrue "" } + + //[] + //[] + //[] + //test "empty queue should be empty``(eIQ : IQueue) = + // eIQ.IsEmpty |> Expect.isTrue "" } + + //[] + //[] + //[] + //test "fail if there is no head in the queue``(eIQ : IQueue) = + // let ok = ref false + // try + // eIQ.Head |> ignore + // with x when x = Exceptions.Empty -> ok := true + // !ok |> Expect.isTrue "" } + + //[] + //[] + //[] + //test "fail if there is no tail in the queue``(eIQ : IQueue) = + // let ok = ref false + // try + // eIQ.Tail |> ignore + // with x when x = Exceptions.Empty -> ok := true + // !ok |> Expect.isTrue "" } + + //[] + //[] + //test "fold matches build list rev" { + + // fsCheck "BatchedQueue" (Prop.forAll (Arb.fromGen QueueGen.batchedQueueIntGen) + // (fun ((q :IQueue), (l : int list)) -> q :?> BatchedQueue |> BatchedQueue.fold (fun (l' : int list) (elem : int) -> elem::l') [] = (List.rev l) |> classifyCollect q (q.Length()))) - fsCheck "BatchedQueue OfSeq" (Prop.forAll (Arb.fromGen QueueGen.batchedQueueIntOfSeqGen) - (fun ((q :IQueue), (l : int list)) -> q :?> BatchedQueue |> BatchedQueue.fold (fun (l' : int list) (elem : int) -> elem::l') [] = (List.rev l) |> classifyCollect q (q.Length()))) + // fsCheck "BatchedQueue OfSeq" (Prop.forAll (Arb.fromGen QueueGen.batchedQueueIntOfSeqGen) + // (fun ((q :IQueue), (l : int list)) -> q :?> BatchedQueue |> BatchedQueue.fold (fun (l' : int list) (elem : int) -> elem::l') [] = (List.rev l) |> classifyCollect q (q.Length()))) - fsCheck "BatchedQueue Snoc" (Prop.forAll (Arb.fromGen QueueGen.batchedQueueIntSnocGen) - (fun ((q :IQueue), (l : int list)) -> q :?> BatchedQueue |> BatchedQueue.fold (fun (l' : int list) (elem : int) -> elem::l') [] = (List.rev l) |> classifyCollect q (q.Length()))) + // fsCheck "BatchedQueue Snoc" (Prop.forAll (Arb.fromGen QueueGen.batchedQueueIntSnocGen) + // (fun ((q :IQueue), (l : int list)) -> q :?> BatchedQueue |> BatchedQueue.fold (fun (l' : int list) (elem : int) -> elem::l') [] = (List.rev l) |> classifyCollect q (q.Length()))) - fsCheck "HoodMelvilleQueue" (Prop.forAll (Arb.fromGen QueueGen.hoodMelvilleQueueIntGen) - (fun ((q :IQueue), (l : int list)) -> q :?> HoodMelvilleQueue |> HoodMelvilleQueue.fold (fun (l' : int list) (elem : int) -> elem::l') [] = (List.rev l) |> classifyCollect q (q.Length()))) + // fsCheck "HoodMelvilleQueue" (Prop.forAll (Arb.fromGen QueueGen.hoodMelvilleQueueIntGen) + // (fun ((q :IQueue), (l : int list)) -> q :?> HoodMelvilleQueue |> HoodMelvilleQueue.fold (fun (l' : int list) (elem : int) -> elem::l') [] = (List.rev l) |> classifyCollect q (q.Length()))) - fsCheck "HoodMelvilleQueue OfSeq" (Prop.forAll (Arb.fromGen QueueGen.hoodMelvilleQueueIntOfSeqGen) - (fun ((q :IQueue), (l : int list)) -> q :?> HoodMelvilleQueue |> HoodMelvilleQueue.fold (fun (l' : int list) (elem : int) -> elem::l') [] = (List.rev l) |> classifyCollect q (q.Length()))) + // fsCheck "HoodMelvilleQueue OfSeq" (Prop.forAll (Arb.fromGen QueueGen.hoodMelvilleQueueIntOfSeqGen) + // (fun ((q :IQueue), (l : int list)) -> q :?> HoodMelvilleQueue |> HoodMelvilleQueue.fold (fun (l' : int list) (elem : int) -> elem::l') [] = (List.rev l) |> classifyCollect q (q.Length()))) - fsCheck "HoodMelvilleQueue Snoc" (Prop.forAll (Arb.fromGen QueueGen.hoodMelvilleQueueIntSnocGen) - (fun ((q :IQueue), (l : int list)) -> q :?> HoodMelvilleQueue |> HoodMelvilleQueue.fold (fun (l' : int list) (elem : int) -> elem::l') [] = (List.rev l) |> classifyCollect q (q.Length()))) + // fsCheck "HoodMelvilleQueue Snoc" (Prop.forAll (Arb.fromGen QueueGen.hoodMelvilleQueueIntSnocGen) + // (fun ((q :IQueue), (l : int list)) -> q :?> HoodMelvilleQueue |> HoodMelvilleQueue.fold (fun (l' : int list) (elem : int) -> elem::l') [] = (List.rev l) |> classifyCollect q (q.Length()))) - fsCheck "PhysicistQueue" (Prop.forAll (Arb.fromGen QueueGen.physicistQueueIntGen) - (fun ((q :IQueue), (l : int list)) -> q :?> PhysicistQueue |> PhysicistQueue.fold (fun (l' : int list) (elem : int) -> elem::l') [] = (List.rev l) |> classifyCollect q (q.Length()))) + // fsCheck "PhysicistQueue" (Prop.forAll (Arb.fromGen QueueGen.physicistQueueIntGen) + // (fun ((q :IQueue), (l : int list)) -> q :?> PhysicistQueue |> PhysicistQueue.fold (fun (l' : int list) (elem : int) -> elem::l') [] = (List.rev l) |> classifyCollect q (q.Length()))) - fsCheck "PhysicistQueue OfSeq" (Prop.forAll (Arb.fromGen (QueueGen.physicistQueueIntOfSeqGen)) - (fun ((q :IQueue), (l : int list)) -> q :?> PhysicistQueue |> PhysicistQueue.fold (fun (l' : int list) (elem : int) -> elem::l') [] = (List.rev l) |> classifyCollect q (q.Length()))) + // fsCheck "PhysicistQueue OfSeq" (Prop.forAll (Arb.fromGen (QueueGen.physicistQueueIntOfSeqGen)) + // (fun ((q :IQueue), (l : int list)) -> q :?> PhysicistQueue |> PhysicistQueue.fold (fun (l' : int list) (elem : int) -> elem::l') [] = (List.rev l) |> classifyCollect q (q.Length()))) - fsCheck "PhysicistQueue Snoc" (Prop.forAll (Arb.fromGen (QueueGen.physicistQueueIntSnocGen)) - (fun ((q :IQueue), (l : int list)) -> q :?> PhysicistQueue |> PhysicistQueue.fold (fun (l' : int list) (elem : int) -> elem::l') [] = (List.rev l) |> classifyCollect q (q.Length()))) + // fsCheck "PhysicistQueue Snoc" (Prop.forAll (Arb.fromGen (QueueGen.physicistQueueIntSnocGen)) + // (fun ((q :IQueue), (l : int list)) -> q :?> PhysicistQueue |> PhysicistQueue.fold (fun (l' : int list) (elem : int) -> elem::l') [] = (List.rev l) |> classifyCollect q (q.Length()))) -[] -[] -[] -let ``foldback matches build list``() = + //[] + //[] + //test "foldback matches build list" { - fsCheck "BatchedQueue" (Prop.forAll (Arb.fromGen QueueGen.batchedQueueIntGen) - (fun ((q : IQueue), (l : int list)) -> BatchedQueue.foldBack (fun (elem : int) (l' : int list) -> elem::l') (q :?> BatchedQueue) [] = l |> classifyCollect q (q.Length()))) + // fsCheck "BatchedQueue" (Prop.forAll (Arb.fromGen QueueGen.batchedQueueIntGen) + // (fun ((q : IQueue), (l : int list)) -> BatchedQueue.foldBack (fun (elem : int) (l' : int list) -> elem::l') (q :?> BatchedQueue) [] = l |> classifyCollect q (q.Length()))) - fsCheck "BatchedQueue OfSeq" (Prop.forAll (Arb.fromGen QueueGen.batchedQueueIntOfSeqGen) - (fun ((q : IQueue), (l : int list)) -> BatchedQueue.foldBack (fun (elem : int) (l' : int list) -> elem::l') (q :?> BatchedQueue) [] = l |> classifyCollect q (q.Length()))) + // fsCheck "BatchedQueue OfSeq" (Prop.forAll (Arb.fromGen QueueGen.batchedQueueIntOfSeqGen) + // (fun ((q : IQueue), (l : int list)) -> BatchedQueue.foldBack (fun (elem : int) (l' : int list) -> elem::l') (q :?> BatchedQueue) [] = l |> classifyCollect q (q.Length()))) - fsCheck "BatchedQueue Snoc" (Prop.forAll (Arb.fromGen QueueGen.batchedQueueIntSnocGen) - (fun ((q : IQueue), (l : int list)) -> BatchedQueue.foldBack (fun (elem : int) (l' : int list) -> elem::l') (q :?> BatchedQueue) [] = l |> classifyCollect q (q.Length()))) + // fsCheck "BatchedQueue Snoc" (Prop.forAll (Arb.fromGen QueueGen.batchedQueueIntSnocGen) + // (fun ((q : IQueue), (l : int list)) -> BatchedQueue.foldBack (fun (elem : int) (l' : int list) -> elem::l') (q :?> BatchedQueue) [] = l |> classifyCollect q (q.Length()))) - fsCheck "HoodMelvilleQueue" (Prop.forAll (Arb.fromGen QueueGen.hoodMelvilleQueueIntGen) - (fun ((q : IQueue), (l : int list)) -> HoodMelvilleQueue.foldBack (fun (elem : int) (l' : int list) -> elem::l') (q :?> HoodMelvilleQueue) [] = l |> classifyCollect q (q.Length()))) + // fsCheck "HoodMelvilleQueue" (Prop.forAll (Arb.fromGen QueueGen.hoodMelvilleQueueIntGen) + // (fun ((q : IQueue), (l : int list)) -> HoodMelvilleQueue.foldBack (fun (elem : int) (l' : int list) -> elem::l') (q :?> HoodMelvilleQueue) [] = l |> classifyCollect q (q.Length()))) - fsCheck "HoodMelvilleQueue OfSeq" (Prop.forAll (Arb.fromGen QueueGen.hoodMelvilleQueueIntOfSeqGen) - (fun ((q : IQueue), (l : int list)) -> HoodMelvilleQueue.foldBack (fun (elem : int) (l' : int list) -> elem::l') (q :?> HoodMelvilleQueue) [] = l |> classifyCollect q (q.Length()))) + // fsCheck "HoodMelvilleQueue OfSeq" (Prop.forAll (Arb.fromGen QueueGen.hoodMelvilleQueueIntOfSeqGen) + // (fun ((q : IQueue), (l : int list)) -> HoodMelvilleQueue.foldBack (fun (elem : int) (l' : int list) -> elem::l') (q :?> HoodMelvilleQueue) [] = l |> classifyCollect q (q.Length()))) - fsCheck "HoodMelvilleQueue Snoc" (Prop.forAll (Arb.fromGen QueueGen.hoodMelvilleQueueIntSnocGen) - (fun ((q : IQueue), (l : int list)) -> HoodMelvilleQueue.foldBack (fun (elem : int) (l' : int list) -> elem::l') (q :?> HoodMelvilleQueue) [] = l |> classifyCollect q (q.Length()))) + // fsCheck "HoodMelvilleQueue Snoc" (Prop.forAll (Arb.fromGen QueueGen.hoodMelvilleQueueIntSnocGen) + // (fun ((q : IQueue), (l : int list)) -> HoodMelvilleQueue.foldBack (fun (elem : int) (l' : int list) -> elem::l') (q :?> HoodMelvilleQueue) [] = l |> classifyCollect q (q.Length()))) - fsCheck "PhysicistQueue" (Prop.forAll (Arb.fromGen QueueGen.physicistQueueIntGen) - (fun ((q : IQueue), (l : int list)) -> PhysicistQueue.foldBack (fun (elem : int) (l' : int list) -> elem::l') (q :?> PhysicistQueue) [] = l |> classifyCollect q (q.Length()))) + // fsCheck "PhysicistQueue" (Prop.forAll (Arb.fromGen QueueGen.physicistQueueIntGen) + // (fun ((q : IQueue), (l : int list)) -> PhysicistQueue.foldBack (fun (elem : int) (l' : int list) -> elem::l') (q :?> PhysicistQueue) [] = l |> classifyCollect q (q.Length()))) - fsCheck "PhysicistQueue OfSeq" (Prop.forAll (Arb.fromGen QueueGen.physicistQueueIntOfSeqGen) - (fun ((q : IQueue), (l : int list)) -> PhysicistQueue.foldBack (fun (elem : int) (l' : int list) -> elem::l') (q :?> PhysicistQueue) [] = l |> classifyCollect q (q.Length()))) - - fsCheck "PhysicistQueue Snoc" (Prop.forAll (Arb.fromGen QueueGen.physicistQueueIntSnocGen) - (fun ((q : IQueue), (l : int list)) -> PhysicistQueue.foldBack (fun (elem : int) (l' : int list) -> elem::l') (q :?> PhysicistQueue) [] = l |> classifyCollect q (q.Length()))) - -let rec nth l i = - match i with - | 0 -> List.head l - | _ -> nth (List.tail l) (i-1) - -[] -[] -[] -[] -let ``get head from queue``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun (q :IQueue, l) -> q.Head = (nth l 0) |> classifyCollect q (q.Length()))) - -[] -[] -[] -[] -let ``get head from queue safely``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun (q :IQueue, l) -> q.TryGetHead.Value = (nth l 0) |> classifyCollect q (q.Length()))) - -[] -[] -[] -[] -let ``get tail from queue``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun ((q : IQueue), l) -> q.Tail.Head = (nth l 1) |> classifyCollect q (q.Length()))) - -[] -[] -[] -[] -let ``get tail from queue safely``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun (q : IQueue, l) -> q.TryGetTail.Value.Head = (nth l 1) |> classifyCollect q (q.Length()))) - -[] -[] -[] -[] -let ``give None if there is no head in the queue``(eIQ : IQueue) = - eIQ.TryGetHead |> should equal None - -[] -[] -[] -[] -let ``give None if there is no tail in the queue``(eIQ : IQueue) = - eIQ.TryGetTail |> should equal None - -[] -[] -[] -[] -let ``int queue builds and serializes``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun (q :IQueue, l) -> q |> Seq.toList = l |> classifyCollect q (q.Length()))) - -[] -[] -[] -[] -let ``obj queue builds and serializes``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun (q :IQueue, l) -> q |> Seq.toList = l |> classifyCollect q (q.Length()))) - -[] -[] -[] -[] -let ``string queue builds and serializes``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun (q :IQueue, l) -> q |> Seq.toList = l |> classifyCollect q (q.Length()))) - -[] -[] -[] -let ``reverse . reverse = id``() = - - fsCheck "BankersQueue" (Prop.forAll (Arb.fromGen QueueGen.bankersQueueObjGen) - (fun (q, l) -> q :?> BankersQueue |> BankersQueue.rev |> BankersQueue.rev |> Seq.toList = (q |> Seq.toList) |> classifyCollect q (q.Length()))) + // fsCheck "PhysicistQueue OfSeq" (Prop.forAll (Arb.fromGen QueueGen.physicistQueueIntOfSeqGen) + // (fun ((q : IQueue), (l : int list)) -> PhysicistQueue.foldBack (fun (elem : int) (l' : int list) -> elem::l') (q :?> PhysicistQueue) [] = l |> classifyCollect q (q.Length()))) + + // fsCheck "PhysicistQueue Snoc" (Prop.forAll (Arb.fromGen QueueGen.physicistQueueIntSnocGen) + // (fun ((q : IQueue), (l : int list)) -> PhysicistQueue.foldBack (fun (elem : int) (l' : int list) -> elem::l') (q :?> PhysicistQueue) [] = l |> classifyCollect q (q.Length()))) + + //let rec nth l i = + // match i with + // | 0 -> List.head l + // | _ -> nth (List.tail l) (i-1) + + //[] + //[] + //[] + //test "get head from queue``(x : obj) = + // let genAndName = unbox x + // fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun (q :IQueue, l) -> q.Head = (nth l 0) |> classifyCollect q (q.Length()))) + + //[] + //[] + //[] + //test "get head from queue safely``(x : obj) = + // let genAndName = unbox x + // fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun (q :IQueue, l) -> q.TryGetHead.Value = (nth l 0) |> classifyCollect q (q.Length()))) + + //[] + //[] + //[] + //test "get tail from queue``(x : obj) = + // let genAndName = unbox x + // fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun ((q : IQueue), l) -> q.Tail.Head = (nth l 1) |> classifyCollect q (q.Length()))) + + //[] + //[] + //[] + //test "get tail from queue safely``(x : obj) = + // let genAndName = unbox x + // fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun (q : IQueue, l) -> q.TryGetTail.Value.Head = (nth l 1) |> classifyCollect q (q.Length()))) + + //[] + //[] + //[] + //test "give None if there is no head in the queue``(eIQ : IQueue) = + // eIQ.TryGetHead |> Expect.isNone "" } + + //[] + //[] + //[] + //test "give None if there is no tail in the queue``(eIQ : IQueue) = + // eIQ.TryGetTail |> Expect.isNone "" } + + //[] + //[] + //[] + //test "int queue builds and serializes``(x : obj) = + // let genAndName = unbox x + // fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun (q :IQueue, l) -> q |> Seq.toList = l |> classifyCollect q (q.Length()))) + + //[] + //[] + //[] + //test "obj queue builds and serializes``(x : obj) = + // let genAndName = unbox x + // fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun (q :IQueue, l) -> q |> Seq.toList = l |> classifyCollect q (q.Length()))) + + //[] + //[] + //[] + //test "string queue builds and serializes``(x : obj) = + // let genAndName = unbox x + // fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun (q :IQueue, l) -> q |> Seq.toList = l |> classifyCollect q (q.Length()))) + + //[] + //[] + //test "reverse . reverse = id" { + + // fsCheck "BankersQueue" (Prop.forAll (Arb.fromGen QueueGen.bankersQueueObjGen) + // (fun (q, l) -> q :?> BankersQueue |> BankersQueue.rev |> BankersQueue.rev |> Seq.toList = (q |> Seq.toList) |> classifyCollect q (q.Length()))) - fsCheck "BatchedQueue" (Prop.forAll (Arb.fromGen QueueGen.batchedQueueObjGen) - (fun (q, l) -> q :?> BatchedQueue |> BatchedQueue.rev |> BatchedQueue.rev |> Seq.toList = (q |> Seq.toList) |> classifyCollect q (q.Length()))) + // fsCheck "BatchedQueue" (Prop.forAll (Arb.fromGen QueueGen.batchedQueueObjGen) + // (fun (q, l) -> q :?> BatchedQueue |> BatchedQueue.rev |> BatchedQueue.rev |> Seq.toList = (q |> Seq.toList) |> classifyCollect q (q.Length()))) - fsCheck "PhysicistQueue" (Prop.forAll (Arb.fromGen QueueGen.physicistQueueIntGen) - (fun (q, l) -> q :?> PhysicistQueue |> PhysicistQueue.rev |> PhysicistQueue.rev |> Seq.toList = (q |> Seq.toList) |> classifyCollect q (q.Length()))) - -[] -[] -[] -let ``ofList build and serialize``() = - - fsCheck "BatchedQueue" (Prop.forAll (Arb.fromGen QueueGen.batchedQueueOfListGen) - (fun ((q : BatchedQueue), (l : int list)) -> q |> Seq.toList = l |> classifyCollect q q.Length)) - - fsCheck "HoodMelvilleQueue" (Prop.forAll (Arb.fromGen QueueGen.hoodMelvilleQueueOfListGen) - (fun ((q : HoodMelvilleQueue), (l : int list)) -> q |> Seq.toList = l |> classifyCollect q q.Length)) - - fsCheck "PhysicistQueue" (Prop.forAll (Arb.fromGen QueueGen.physicistQueueOfListqGen) - (fun ((q : PhysicistQueue), (l : int list)) -> q |> Seq.toList = l |> classifyCollect q q.Length)) - -[] -[] -[] -let ``TryUncons wind-down to None``() = - let qBn = BankersQueue.ofSeq ["f";"e";"d";"c";"b";"a"] :> IQueue - let qBt = BatchedQueue.ofSeq ["f";"e";"d";"c";"b";"a"] :> IQueue - let qH = HoodMelvilleQueue.ofSeq ["f";"e";"d";"c";"b";"a"] :> IQueue - let qP = PhysicistQueue.ofSeq ["f";"e";"d";"c";"b";"a"] :> IQueue - - let rec loop (iq : IQueue) = - match (iq.TryUncons) with - | Some(hd, tl) -> loop tl - | None -> () - - loop qBn - loop qBt - loop qH - loop qP - - true |> should equal true \ No newline at end of file + // fsCheck "PhysicistQueue" (Prop.forAll (Arb.fromGen QueueGen.physicistQueueIntGen) + // (fun (q, l) -> q :?> PhysicistQueue |> PhysicistQueue.rev |> PhysicistQueue.rev |> Seq.toList = (q |> Seq.toList) |> classifyCollect q (q.Length()))) + + //[] + //[] + //test "ofList build and serialize" { + + // fsCheck "BatchedQueue" (Prop.forAll (Arb.fromGen QueueGen.batchedQueueOfListGen) + // (fun ((q : BatchedQueue), (l : int list)) -> q |> Seq.toList = l |> classifyCollect q q.Length)) + + // fsCheck "HoodMelvilleQueue" (Prop.forAll (Arb.fromGen QueueGen.hoodMelvilleQueueOfListGen) + // (fun ((q : HoodMelvilleQueue), (l : int list)) -> q |> Seq.toList = l |> classifyCollect q q.Length)) + + // fsCheck "PhysicistQueue" (Prop.forAll (Arb.fromGen QueueGen.physicistQueueOfListqGen) + // (fun ((q : PhysicistQueue), (l : int list)) -> q |> Seq.toList = l |> classifyCollect q q.Length)) + + //[] + //[] + //test "TryUncons wind-down to None" { + // let qBn = BankersQueue.ofSeq ["f";"e";"d";"c";"b";"a"] :> IQueue + // let qBt = BatchedQueue.ofSeq ["f";"e";"d";"c";"b";"a"] :> IQueue + // let qH = HoodMelvilleQueue.ofSeq ["f";"e";"d";"c";"b";"a"] :> IQueue + // let qP = PhysicistQueue.ofSeq ["f";"e";"d";"c";"b";"a"] :> IQueue + + // let rec loop (iq : IQueue) = + // match (iq.TryUncons) with + // | Some(hd, tl) -> loop tl + // | None -> () + + // loop qBn + // loop qBt + // loop qH + // loop qP + + // true |> Expect.isTrue "" } + ] \ No newline at end of file diff --git a/tests/FSharpx.Collections.Experimental.Tests/ImplicitQueueTest.fs b/tests/FSharpx.Collections.Experimental.Tests/ImplicitQueueTest.fs index 86751758..ec43ac1a 100644 --- a/tests/FSharpx.Collections.Experimental.Tests/ImplicitQueueTest.fs +++ b/tests/FSharpx.Collections.Experimental.Tests/ImplicitQueueTest.fs @@ -1,61 +1,55 @@ -module FSharpx.Collections.Experimental.Tests.ImplicitQueueTest +namespace FSharpx.Collections.Experimental.Tests -open System open FSharpx.Collections open FSharpx.Collections.Experimental -open FSharpx.Collections.Experimental.ImplicitQueue -open NUnit.Framework -open FsUnit - -[] -let ``empty queue should be empty``() = - isEmpty empty |> should equal true - -[] -let ``it should allow to enqueue``() = - empty |> snoc 1 |> snoc 2 |> isEmpty |> should equal false - -[] -let ``it should allow to dequeue``() = - empty |> snoc 1 |> tail |> isEmpty |> should equal true - -[] -let ``it should fail if there is no head in the queue``() = - let ok = ref false - try - empty |> head |> ignore - with x when x = Exceptions.Empty -> ok := true - !ok |> should equal true - -[] -let ``it should give None if there is no head in the queue``() = - empty |> tryGetHead |> should equal None - -[] -let ``it should fail if there is no tail the queue``() = - let ok = ref false - try - empty |> tail |> ignore - with x when x = Exceptions.Empty -> ok := true - !ok |> should equal true - -[] -let ``it should give None if there is no tail in the queue``() = - empty |> tryGetTail |> should equal None - -[] -let ``it should allow to get the head from a queue``() = - empty |> snoc 1 |> snoc 2 |> head |> should equal 1 - -[] -let ``it should allow to get the head from a queue safely``() = - empty |> snoc 1 |> snoc 2 |> tryGetHead |> should equal (Some 1) - -[] -let ``it should allow to get the tail from the queue``() = - empty |> snoc "a" |> snoc "b" |> snoc "c" |> tail |> head |> should equal "b" - -[] -let ``it should allow to get the tail from a queue safely``() = - let value = empty |> snoc 1 |> snoc 2 |> tryGetTail - value.Value |> head |> should equal 2 \ No newline at end of file +open Expecto +open Expecto.Flip + +module ImplicitQueueTest = + + [] + let testImplicitQueue = + + testList "Experimental ImplicitQueue" [ + test "ImplicitQueue.empty queue should be ImplicitQueue.empty" { + ImplicitQueue.isEmpty ImplicitQueue.empty |> Expect.isTrue "" } + + test "it should allow to enqueue" { + ImplicitQueue.empty |> ImplicitQueue.snoc 1 |> ImplicitQueue.snoc 2 |> ImplicitQueue.isEmpty |> Expect.isFalse "" } + + test "it should allow to dequeue" { + ImplicitQueue.empty |> ImplicitQueue.snoc 1 |> ImplicitQueue.tail |> ImplicitQueue.isEmpty |> Expect.isTrue "" } + + test "it should fail if there is no ImplicitQueue.head in the queue" { + let ok = ref false + try + ImplicitQueue.empty |> ImplicitQueue.head |> ignore + with x when x = Exceptions.Empty -> ok := true + !ok |> Expect.isTrue "" } + + test "it should give None if there is no ImplicitQueue.head in the queue" { + ImplicitQueue.empty |> ImplicitQueue.tryGetHead |> Expect.isNone "" } + + test "it should fail if there is no ImplicitQueue.tail the queue" { + let ok = ref false + try + ImplicitQueue.empty |> ImplicitQueue.tail |> ignore + with x when x = Exceptions.Empty -> ok := true + !ok |> Expect.isTrue "" } + + test "it should give None if there is no ImplicitQueue.tail in the queue" { + ImplicitQueue.empty |> ImplicitQueue.tryGetTail |> Expect.isNone "" } + + test "it should allow to get the ImplicitQueue.head from a queue" { + ImplicitQueue.empty |> ImplicitQueue.snoc 1 |> ImplicitQueue.snoc 2 |> ImplicitQueue.head |> Expect.equal "" 1 } + + test "it should allow to get the ImplicitQueue.head from a queue safely" { + ImplicitQueue.empty |> ImplicitQueue.snoc 1 |> ImplicitQueue.snoc 2 |> ImplicitQueue.tryGetHead |> Expect.equal "" (Some 1) } + + test "it should allow to get the ImplicitQueue.tail from the queue" { + ImplicitQueue.empty |> ImplicitQueue.snoc "a" |> ImplicitQueue.snoc "b" |> ImplicitQueue.snoc "c" |> ImplicitQueue.tail |> ImplicitQueue.head |> Expect.equal "" "b" } + + test "it should allow to get the ImplicitQueue.tail from a queue safely" { + let value = ImplicitQueue.empty |> ImplicitQueue.snoc 1 |> ImplicitQueue.snoc 2 |> ImplicitQueue.tryGetTail + value.Value |> ImplicitQueue.head |> Expect.equal "" 2 } + ] \ No newline at end of file diff --git a/tests/FSharpx.Collections.Experimental.Tests/IndexedRoseTreeTest.fs b/tests/FSharpx.Collections.Experimental.Tests/IndexedRoseTreeTest.fs index 4affede4..51bedf4c 100644 --- a/tests/FSharpx.Collections.Experimental.Tests/IndexedRoseTreeTest.fs +++ b/tests/FSharpx.Collections.Experimental.Tests/IndexedRoseTreeTest.fs @@ -1,148 +1,120 @@ -module FSharpx.Collections.Experimental.Tests.IndexedRoseTreeTest +namespace FSharpx.Collections.Experimental.Tests -open FSharpx open FSharpx.Collections.Experimental open FSharpx.Collections -open NUnit.Framework -open FsCheck -open FsCheck.NUnit -open FSharpx.Collections.Tests.Properties -open FsUnit - -let tree a b = IndexedRoseTree.create a (PersistentVector.ofSeq b) - -let atree = tree 1 [tree 2 [tree 3 []]; tree 4 [tree 5 [tree 6 []]]] -let ctree = tree "f" [tree "b" [tree "a" []; tree "d" [tree "c" []; tree "e" []]]; tree "g" [tree "i" [tree "h" []]]] - -[] -let ``preOrder works``() = - let actual = IndexedRoseTree.preOrder ctree |> Seq.toList - Assert.AreEqual(["f";"b";"a";"d";"c";"e";"g";"i";"h"], actual) - -[] -let ``postOrder works``() = - let actual = IndexedRoseTree.postOrder ctree |> Seq.toList - Assert.AreEqual(["a";"c";"e";"d";"b";"h";"i";"g";"f"], actual) - -[] -let map() = - let actual = IndexedRoseTree.map ((+) 1) atree - let expected = tree 2 [tree 3 [tree 4 []]; tree 5 [tree 6 [tree 7 []]]] - Assert.AreEqual(expected, actual) - -[] -let ``fold via preOrder``() = - let actual = IndexedRoseTree.preOrder atree |> Seq.fold (*) 1 - Assert.AreEqual(720, actual) - -[] -let unfold() = - let a = IndexedRoseTree.unfold (fun i -> i, PersistentVector.ofSeq {i+1..3}) 0 - let expected = tree 0 [tree 1 [tree 2 [tree 3 []]; tree 3 []]; tree 2 [tree 3 []]; tree 3 []] - Assert.AreEqual(expected, a) - -// not the best example, as text nodes cannot have children - -type HtmlElement = { TagName: string; Attributes: (string * string) list } - -type HtmlNode = -| Element of HtmlElement -| Text of string - -let elemA tag attr = HtmlNode.Element { TagName = tag; Attributes = attr } -let elem tag = elemA tag [] -let text t = tree (HtmlNode.Text t) [] -type Html = HtmlNode IndexedRoseTree - -let htmldoc = - tree (elem "body") [tree (elem "div") [text "hello world"]] - -[] -let bind() = - let wrapText = - function - | Text t -> tree (elem "span") [text t] - | x -> IndexedRoseTree.singleton x - let newDoc = htmldoc |> IndexedRoseTree.bind wrapText - let expected = tree (elem "body") [tree (elem "div") [tree (elem "span") [text "hello world"]]] - Assert.AreEqual(expected, newDoc) +open Expecto +open Expecto.Flip + +module IndexedRoseTreeTest = + + let tree a b = IndexedRoseTree.create a (PersistentVector.ofSeq b) + + let atree = tree 1 [tree 2 [tree 3 []]; tree 4 [tree 5 [tree 6 []]]] + let ctree = tree "f" [tree "b" [tree "a" []; tree "d" [tree "c" []; tree "e" []]]; tree "g" [tree "i" [tree "h" []]]] + + type HtmlElement = { TagName: string; Attributes: (string * string) list } + + type HtmlNode = + | Element of HtmlElement + | Text of string + + type Html = HtmlNode IndexedRoseTree + + let iRTF l = List.fold (fun (s : list>) (t : int) -> (IndexedRoseTree.singleton t)::s) [] l |> PersistentVector.ofSeq + + let iRTF2 = + let rec loop (v : PersistentVector>) dec = + match dec with + | 0 -> v + | _ -> loop (v.Conj (IndexedRoseTree.create 1 (iRTF [1..5]))) (dec - 1) + loop PersistentVector.empty 5 + + let iRT = IndexedRoseTree.create 1 iRTF2 + let singleRT = IndexedRoseTree.singleton 1 + + [] + let testIndexedRoseTree = + // not the best example, as text nodes cannot have children + + let elemA tag attr = HtmlNode.Element { TagName = tag; Attributes = attr } + let elem tag = elemA tag [] + let text t = tree (HtmlNode.Text t) [] + + + let htmldoc = + tree (elem "body") [tree (elem "div") [text "hello world"]] + + testList "Experimental IndexedRoseTree" [ + test "preOrder works" { + let actual = IndexedRoseTree.preOrder ctree |> Seq.toList + Expect.equal "" ["f";"b";"a";"d";"c";"e";"g";"i";"h"] actual } + + test "postOrder works" { + let actual = IndexedRoseTree.postOrder ctree |> Seq.toList + Expect.equal "" ["a";"c";"e";"d";"b";"h";"i";"g";"f"] actual } -let finiteIndexedRoseTreeForest() = - gen { - let! n = Gen.length1thru 5 - let! l = Gen.listOfLength n Arb.generate - return Seq.fold (fun (s : list>) (t : int) -> (IndexedRoseTree.singleton t)::s) [] l |> PersistentVector.ofSeq - } - -type IndexedRoseTreeGen = - static member IndexedRoseTree() = - let rec IndexedRoseTreeGen() = - gen { - let! root = Arb.generate - // need to set these frequencies to avoid blowing the stack - let! children = Gen.frequency [70, gen.Return PersistentVector.empty; 1, finiteIndexedRoseTreeForest()] - return IndexedRoseTree.create root children - } - Arb.fromGen (IndexedRoseTreeGen()) - -let registerGen = lazy (Arb.register() |> ignore) - -[] -let equality() = - registerGen.Force() - checkEquality "IndexedRoseTree" - -let iRTF l = List.fold (fun (s : list>) (t : int) -> (IndexedRoseTree.singleton t)::s) [] l |> PersistentVector.ofSeq -let iRTF2 = - let rec loop (v : PersistentVector>) dec = - match dec with - | 0 -> v - | _ -> loop (v.Conj (IndexedRoseTree.create 1 (iRTF [1..5]))) (dec - 1) - loop PersistentVector.empty 5 - - -let iRT = IndexedRoseTree.create 1 iRTF2 -let singleRT = IndexedRoseTree.singleton 1 - -[] -let ``functor laws``() = - //fsCheck version of functor and monad laws stackoverflows - let map = IndexedRoseTree.map + test "map" { + let actual = IndexedRoseTree.map ((+) 1) atree + let expected = tree 2 [tree 3 [tree 4 []]; tree 5 [tree 6 [tree 7 []]]] + Expect.equal "" expected actual } + + test "fold via preOrder" { + let actual = IndexedRoseTree.preOrder atree |> Seq.fold (*) 1 + Expect.equal "" 720 actual } + + test "bind" { + let wrapText = + function + | Text t -> tree (elem "span") [text t] + | x -> IndexedRoseTree.singleton x + let newDoc = htmldoc |> IndexedRoseTree.bind wrapText + let expected = tree (elem "body") [tree (elem "div") [tree (elem "span") [text "hello world"]]] + Expect.equal "" expected newDoc } + + test "unfold" { + let a = IndexedRoseTree.unfold (fun i -> i, PersistentVector.ofSeq {i+1..3}) 0 + let expected = tree 0 [tree 1 [tree 2 [tree 3 []]; tree 3 []]; tree 2 [tree 3 []]; tree 3 []] + Expect.equal "" expected a } + + test "functor laws" { + //fsCheck version of functor and monad laws stackoverflows + let map = IndexedRoseTree.map - //preserves identity - ((map id iRT) = iRT) |> should equal true - ((map id singleRT) = singleRT) |> should equal true + //preserves identity + ((map id iRT) = iRT) |> Expect.isTrue "" + ((map id singleRT) = singleRT) |> Expect.isTrue "" - let f = (fun x -> x + 5) - let g = (fun x -> x - 2) + let f = (fun x -> x + 5) + let g = (fun x -> x - 2) + + //preserves composition + map (f << g) iRT = (map f << map g) iRT |> Expect.isTrue "" - //preserves composition - map (f << g) iRT = (map f << map g) iRT |> should equal true - map (f << g) singleRT = (map f << map g) singleRT |> should equal true + map (f << g) singleRT = (map f << map g) singleRT |> Expect.isTrue "" } -[] -let ``monad laws``() = - //fsCheck version of functor and monad laws stackoverflows - let inline (>>=) m f = IndexedRoseTree.bind f m - let ret = IndexedRoseTree.singleton + test "monad laws" { + //fsCheck version of functor and monad laws stackoverflows + let inline (>>=) m f = IndexedRoseTree.bind f m + let ret = IndexedRoseTree.singleton - let myF x = IndexedRoseTree.create x (PersistentVector.empty |> PersistentVector.conj (IndexedRoseTree.singleton x) |> PersistentVector.conj (IndexedRoseTree.singleton x)) - let a = 1 + let myF x = IndexedRoseTree.create x (PersistentVector.empty |> PersistentVector.conj (IndexedRoseTree.singleton x) |> PersistentVector.conj (IndexedRoseTree.singleton x)) + let a = 1 - //left identity - ret a >>= myF = myF a |> should equal true + //left identity + ret a >>= myF = myF a |> Expect.isTrue "" - //right identity - iRT >>= ret = iRT |> should equal true - singleRT >>= ret = singleRT |> should equal true + //right identity + iRT >>= ret = iRT |> Expect.isTrue "" + singleRT >>= ret = singleRT |> Expect.isTrue "" - //associativity - let myG x = IndexedRoseTree.create (x=x) (PersistentVector.empty |> PersistentVector.conj (IndexedRoseTree.singleton (x=x)) |> PersistentVector.conj (IndexedRoseTree.singleton (x=x))) + //associativity + let myG x = IndexedRoseTree.create (x=x) (PersistentVector.empty |> PersistentVector.conj (IndexedRoseTree.singleton (x=x)) |> PersistentVector.conj (IndexedRoseTree.singleton (x=x))) - let a' = (iRT >>= myF) >>= myG - let b' = iRT >>= (fun x -> myF x >>= myG) - a' = b' |> should equal true + let a' = (iRT >>= myF) >>= myG + let b' = iRT >>= (fun x -> myF x >>= myG) + a' = b' |> Expect.isTrue "" - let a'' = (singleRT >>= myF) >>= myG - let b'' = singleRT >>= (fun x -> myF x >>= myG) - a'' = b'' |> should equal true \ No newline at end of file + let a'' = (singleRT >>= myF) >>= myG + let b'' = singleRT >>= (fun x -> myF x >>= myG) + a'' = b'' |> Expect.isTrue "" } + ] \ No newline at end of file diff --git a/tests/FSharpx.Collections.Experimental.Tests/IntMapTest.fs b/tests/FSharpx.Collections.Experimental.Tests/IntMapTest.fs index 4db96e90..ddd6870b 100644 --- a/tests/FSharpx.Collections.Experimental.Tests/IntMapTest.fs +++ b/tests/FSharpx.Collections.Experimental.Tests/IntMapTest.fs @@ -1,687 +1,599 @@ -module FSharpx.Collections.Experimental.Tests.IntMapTest +namespace FSharpx.Collections.Experimental.Tests -open FSharpx open FSharpx.Collections.Experimental -open NUnit.Framework -open FsUnit - -[] -let ``test isEmpty``() = - IntMap.isEmpty IntMap.empty |> should be True - (1, 'a') ||> IntMap.singleton |> IntMap.isEmpty |> should be False - -[] -let ``test size``() = - IntMap.size IntMap.empty |> should equal 0 - IntMap.singleton 1 'a' |> IntMap.size |> should equal 1 - IntMap.ofList [(1,'a'); (2,'b'); (3,'c')] |> IntMap.size |> should equal 3 - -[] -let ``test member``() = - IntMap.exists 5 (IntMap.ofList [(5,'a'); (3,'b')]) |> should be True - IntMap.exists 1 (IntMap.ofList [(5,'a'); (3,'b')]) |> should be False - -[] -let ``test notMember``() = - IntMap.notExists 5 (IntMap.ofList [(5,'a'); (3,'b')]) |> should be False - IntMap.notExists 1 (IntMap.ofList [(5,'a'); (3,'b')]) |> should be True - -[] -let ``test tryFind``() = - let employeeDept = IntMap.ofList([(1,2); (3,1)]) - let deptCountry = IntMap.ofList([(1,1); (2,2)]) - let countryCurrency = IntMap.ofList([(1, 2); (2, 1)]) - let employeeCurrency name = - match IntMap.tryFind name employeeDept with - | Some dept -> - match IntMap.tryFind dept deptCountry with - | Some country -> IntMap.tryFind country countryCurrency - | None -> None - | None -> None - - employeeCurrency 1 |> should equal (Some 1) - employeeCurrency 2 |> should equal None - -[] -let ``test find``() = - let employeeDept = IntMap.ofList([(1,1); (2,2)]) - let x = IntMap.find 2 employeeDept - - x |> should equal 2 - - -[] -let ``test findWithDefault``() = - IntMap.findWithDefault 'x' 1 (IntMap.ofList [(5,'a'); (3,'b')]) |> should equal 'x' - IntMap.findWithDefault 'x' 5 (IntMap.ofList [(5,'a'); (3,'b')]) |> should equal 'a' - -[] -let ``test tryFindLT``() = - IntMap.tryFindLT 3 (IntMap.ofList [(3,'a'); (5,'b')]) |> should equal None - IntMap.tryFindLT 4 (IntMap.ofList [(3,'a'); (5,'b')]) |> should equal (Some(3, 'a')) - -[] -let ``test tryFindGT``() = - IntMap.tryFindGT 4 (IntMap.ofList [(3,'a'); (5,'b')]) |> should equal (Some(5,'b')) - IntMap.tryFindGT 5 (IntMap.ofList [(3,'a'); (5,'b')]) |> should equal None - -[] -let ``test tryFindLE``() = - IntMap.tryFindLE 2 (IntMap.ofList [(3,'a'); (5,'b')]) |> should equal None - IntMap.tryFindLE 4 (IntMap.ofList [(3,'a'); (5,'b')]) |> should equal (Some(3,'a')) - IntMap.tryFindLE 5 (IntMap.ofList [(3,'a'); (5,'b')]) |> should equal (Some(5,'b')) - -[] -let ``test tryFindGE``() = - IntMap.tryFindGE 3 (IntMap.ofList [(3,'a'); (5,'b')]) |> should equal (Some(3,'a')) - IntMap.tryFindGE 4 (IntMap.ofList [(3,'a'); (5,'b')]) |> should equal (Some(5,'b')) - IntMap.tryFindGE 6 (IntMap.ofList [(3,'a'); (5,'b')]) |> should equal None - -// Construction - -[] -let ``test empty``() = - IntMap.empty |> should equal (IntMap.ofList []) - IntMap.size IntMap.empty |> should equal 0 - -[] -let ``test singleton``() = - IntMap.singleton 1 'a' |> should equal (IntMap.ofList [(1, 'a')]) - IntMap.size (IntMap.singleton 1 'a') |> should equal 1 - -[] -let ``test insert``() = - IntMap.insert 5 'x' (IntMap.ofList [(5,'a'); (3,'b')]) |> should equal (IntMap.ofList [(3, 'b'); (5, 'x')]) - IntMap.insert 7 'x' (IntMap.ofList [(5,'a'); (3,'b')]) |> should equal (IntMap.ofList [(3, 'b'); (5, 'a'); (7, 'x')]) - IntMap.insert 5 'x' IntMap.empty |> should equal (IntMap.singleton 5 'x') - -[] -let ``test insertWith``() = - IntMap.insertWith (+) 5 "xxx" (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal (IntMap.ofList [(3, "b"); (5, "xxxa")]) - IntMap.insertWith (+) 7 "xxx" (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal (IntMap.ofList [(3, "b"); (5, "a"); (7, "xxx")]) - IntMap.insertWith (+) 5 "xxx" IntMap.empty |> should equal (IntMap.singleton 5 "xxx") - -[] -let ``test insertWithKey``() = - let f key new_value old_value = string key + ":" + new_value + "|" + old_value - IntMap.insertWithKey f 5 "xxx" (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal (IntMap.ofList [(3, "b"); (5, "5:xxx|a")]) - IntMap.insertWithKey f 7 "xxx" (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal (IntMap.ofList [(3, "b"); (5, "a"); (7, "xxx")]) - IntMap.insertWithKey f 5 "xxx" IntMap.empty |> should equal (IntMap.singleton 5 "xxx") - -[] -let ``test insertTryFindWithKey``() = - let f key new_value old_value = string key + ":" + new_value + "|" + old_value - IntMap.insertTryFindWithKey f 5 "xxx" (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal (Some "a", IntMap.ofList [(3, "b"); (5, "5:xxx|a")]) - let fnd, map = IntMap.insertTryFindWithKey f 2 "xxx" (IntMap.ofList [(5,"a"); (3,"b")]) - fnd |> should equal None - map |> should equal (IntMap.ofList [(2,"xxx");(3,"b");(5,"a")]) - let fnd, map = IntMap.insertTryFindWithKey f 7 "xxx" (IntMap.ofList [(5,"a"); (3,"b")]) - fnd |> should equal None - map |> should equal (IntMap.ofList [(3, "b"); (5, "a"); (7, "xxx")]) - let fnd, map = IntMap.insertTryFindWithKey f 5 "xxx" IntMap.empty - fnd |> should equal None - map |> should equal (IntMap.singleton 5 "xxx") - -// Delete/Update - -[] -let ``test delete``() = - IntMap.delete 5 (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal (IntMap.singleton 3 "b") - IntMap.delete 7 (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal (IntMap.ofList [(3, "b"); (5, "a")]) - IntMap.delete 5 IntMap.empty |> should equal IntMap.empty - -[] -let ``test adjust``() = - IntMap.adjust ((+) "new ") 5 (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal (IntMap.ofList [(3, "b"); (5, "new a")]) - IntMap.adjust ((+) "new ") 7 (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal (IntMap.ofList [(3, "b"); (5, "a")]) - IntMap.adjust ((+) "new ") 7 IntMap.empty |> should equal IntMap.empty - -[] -let ``test adjustWithKey``() = - let f key x = (string key) + ":new " + x - IntMap.adjustWithKey f 5 (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal (IntMap.ofList [(3, "b"); (5, "5:new a")]) - IntMap.adjustWithKey f 7 (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal (IntMap.ofList [(3, "b"); (5, "a")]) - IntMap.adjustWithKey f 7 IntMap.empty |> should equal IntMap.empty - -[] -let ``test update``() = - let f x = if x = "a" then Some "new a" else None - IntMap.update f 5 (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal (IntMap.ofList [(3, "b"); (5, "new a")]) - IntMap.update f 7 (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal (IntMap.ofList [(3, "b"); (5, "a")]) - IntMap.update f 3 (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal (IntMap.singleton 5 "a") - -[] -let ``test updateWithKey``() = - let f k x = if x = "a" then Some ((string k) + ":new a") else None - IntMap.updateWithKey f 5 (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal (IntMap.ofList [(3, "b"); (5, "5:new a")]) - IntMap.updateWithKey f 7 (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal (IntMap.ofList [(3, "b"); (5, "a")]) - IntMap.updateWithKey f 3 (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal (IntMap.singleton 5 "a") - -[] -let ``test updateTryFindWithKey``() = - let f k x = if x = "a" then Some ((string k) + ":new a") else None - IntMap.updateTryFindWithKey f 5 (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal (Some "a", IntMap.ofList [(3, "b"); (5, "5:new a")]) - let fnd, map = IntMap.updateTryFindWithKey f 7 (IntMap.ofList [(5,"a"); (3,"b")]) - fnd |> should equal None - map |> should equal (IntMap.ofList [(3, "b"); (5, "a")]) - IntMap.updateTryFindWithKey f 3 (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal (Some "b", IntMap.singleton 5 "a") - -[] -let ``test alter``() = - let f _ = None - let g _ = Some "c" - IntMap.alter f 7 (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal (IntMap.ofList [(3, "b"); (5, "a")]) - IntMap.alter f 5 (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal (IntMap.singleton 3 "b") - IntMap.alter g 7 (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal (IntMap.ofList [(3, "b"); (5, "a"); (7, "c")]) - IntMap.alter g 5 (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal (IntMap.ofList [(3, "b"); (5, "c")]) - -// Combine - -[] -let ``test append``() = - IntMap.append (IntMap.ofList [(5, "a"); (3, "b")]) (IntMap.ofList [(5, "A"); (7, "C")]) - |> should equal (IntMap.ofList [(3, "b"); (5, "a"); (7, "C")]) - -[] -let ``test appendWith``() = - IntMap.appendWith (+) (IntMap.ofList [(5, "a"); (3, "b")]) (IntMap.ofList [(5, "A"); (7, "C")]) - |> should equal (IntMap.ofList [(3, "b"); (5, "aA"); (7, "C")]) - -[] -let ``test appendWithKey``() = - let f key left_value right_value = (string key) + ":" + left_value + "|" + right_value - IntMap.appendWithKey f (IntMap.ofList [(5, "a"); (3, "b")]) (IntMap.ofList [(5, "A"); (7, "C")]) - |> should equal (IntMap.ofList [(3, "b"); (5, "5:a|A"); (7, "C")]) - -[] -let ``test concat``() = - IntMap.concat [IntMap.ofList [(5, "a"); (3, "b")]; IntMap.ofList [(5, "A"); (7, "C")]; IntMap.ofList [(5, "A3"); (3, "B3")]] - |> should equal (IntMap.ofList [(3, "b"); (5, "a"); (7, "C")]) - IntMap.concat [IntMap.ofList [(5, "A3"); (3, "B3")]; IntMap.ofList [(5, "A"); (7, "C")]; IntMap.ofList [(5, "a"); (3, "b")]] - |> should equal (IntMap.ofList [(3, "B3"); (5, "A3"); (7, "C")]) - -[] -let ``test concatWith``() = - IntMap.concatWith (+) [IntMap.ofList [(5, "a"); (3, "b")]; IntMap.ofList [(5, "A"); (7, "C")]; IntMap.ofList [(5, "A3"); (3, "B3")]] - |> should equal (IntMap.ofList [(3, "bB3"); (5, "aAA3"); (7, "C")]) - -[] -let ``test difference``() = - IntMap.difference (IntMap.ofList [(5, "a"); (3, "b")]) (IntMap.ofList [(5, "A"); (7, "C")]) - |> should equal (IntMap.singleton 3 "b") - -[] -let ``test differenceWith``() = - let f al ar = if al = "b" then Some (al + ":" + ar) else None - IntMap.differenceWith f (IntMap.ofList [(5, "a"); (3, "b")]) (IntMap.ofList [(5, "A"); (3, "B"); (7, "C")]) - |> should equal (IntMap.singleton 3 "b:B") - -[] -let ``test differenceWithKey``() = - let f k al ar = if al = "b" then Some ((string k) + ":" + al + "|" + ar) else None - IntMap.differenceWithKey f (IntMap.ofList [(5, "a"); (3, "b")]) (IntMap.ofList [(5, "A"); (3, "B"); (10, "C")]) - |> should equal (IntMap.singleton 3 "3:b|B") - -[] -let ``test intersection``() = - IntMap.intersection (IntMap.ofList [(5, "a"); (3, "b")]) (IntMap.ofList [(5, "A"); (7, "C")]) - |> should equal (IntMap.singleton 5 "a") - -[] -let ``test intersectionWith``() = - IntMap.intersectionWith (+) (IntMap.ofList [(5, "a"); (3, "b")]) (IntMap.ofList [(5, "A"); (7, "C")]) - |> should equal (IntMap.singleton 5 "aA") - -[] -let ``test intersectionWithKey``() = - let f k al ar = (string k) + ":" + al + "|" + ar - IntMap.intersectionWithKey f (IntMap.ofList [(5, "a"); (3, "b")]) (IntMap.ofList [(5, "A"); (7, "C")]) - |> should equal (IntMap.singleton 5 "5:a|A") - -// Traversal - -[] -let ``test map``() = - IntMap.map ((fun f a b -> f b a) (+) "x") (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal (IntMap.ofList [(3, "bx"); (5, "ax")]) - -[] -let ``test mapWithKey``() = - let f key x = (string key) + ":" + x - IntMap.mapWithKey f (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal (IntMap.ofList [(3, "3:b"); (5, "5:a")]) - -[] -let ``test mapAccum``() = - let f a b = (a + b, b + "X") - IntMap.mapAccum f "Everything: " (IntMap.ofList [(5,"a"); (3,"b")]) - |> should equal ("Everything: ba", IntMap.ofList [(3, "bX"); (5, "aX")]) - -[] -let ``test mapAccumWithKey``() = - let f a k b = (a + " " + (string k) + "-" + b, b + "X") - IntMap.mapAccumWithKey f "Everything:" (IntMap.ofList [(5,"a"); (3,"b")]) - |> should equal ("Everything: 3-b 5-a", IntMap.ofList [(3, "bX"); (5, "aX")]) - -[] -let ``test mapKeys``() = - IntMap.mapKeys ((fun f a b -> f b a) (+) 1) (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal (IntMap.ofList [(4, "b"); (6, "a")]) - IntMap.mapKeys (fun _ -> 1) (IntMap.ofList [(1,"b"); (2,"a"); (3,"d"); (4,"c")]) |> should equal (IntMap.singleton 1 "c") - IntMap.mapKeys (fun _ -> 3) (IntMap.ofList [(1,"b"); (2,"a"); (3,"d"); (4,"c")]) |> should equal (IntMap.singleton 3 "c") - -[] -let ``test mapKeysWith``() = - IntMap.mapKeysWith (+) (fun _ -> 1) (IntMap.ofList [(1,"b"); (2,"a"); (3,"d"); (4,"c")]) |> should equal (IntMap.singleton 1 "cdab") - IntMap.mapKeysWith (+) (fun _ -> 3) (IntMap.ofList [(1,"b"); (2,"a"); (3,"d"); (4,"c")]) |> should equal (IntMap.singleton 3 "cdab") - -// Conversion - -[] -let ``test values``() = - IntMap.values (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal ["b";"a"] - IntMap.values IntMap.empty |> should equal [] - -[] -let ``test keys``() = - IntMap.keys (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal [3;5] - IntMap.keys IntMap.empty |> should equal IntMap.empty - -// Lists - -[] -let ``test toList``() = - IntMap.toList (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal [(3,"b"); (5,"a")] - IntMap.toList IntMap.empty |> should equal [] - -[] -let ``test ofList``() = - IntMap.ofList [] |> should equal IntMap.empty - IntMap.ofList [(5,"a"); (3,"b"); (5, "c")] |> should equal (IntMap.ofList [(5,"c"); (3,"b")]) - IntMap.ofList [(5,"c"); (3,"b"); (5, "a")] |> should equal (IntMap.ofList [(5,"a"); (3,"b")]) - -[] -let ``test ofListWith``() = - IntMap.ofListWith (+) [(5,"a"); (5,"b"); (3,"b"); (3,"a"); (5,"a")] |> should equal (IntMap.ofList [(3, "ab"); (5, "aba")]) - IntMap.ofListWith (+) [] |> should equal IntMap.empty - -[] -let ``test ofListWithKey``() = - let f k a1 a2 = (string k) + a1 + a2 - IntMap.ofListWithKey f [(5,"a"); (5,"b"); (3,"b"); (3,"a"); (5,"a")] |> should equal (IntMap.ofList [(3, "3ab"); (5, "5a5ba")]) - IntMap.ofListWithKey f [] |> should equal IntMap.empty - -// Filter - -[] -let ``test filter``() = - IntMap.filter ((fun f a b -> f b a) (>) "a") (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal (IntMap.singleton 3 "b") - IntMap.filter ((fun f a b -> f b a) (>) "x") (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal IntMap.empty - IntMap.filter ((fun f a b -> f b a) (<) "a") (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal IntMap.empty - -[] -let ``test filteWithKey``() = - IntMap.filterWithKey (fun k _ -> k > 4) (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal (IntMap.singleton 5 "a") - -[] -let ``test partition``() = - let left, right = IntMap.partition ((fun f a b -> f b a) (>) "a") (IntMap.ofList [(5,"a"); (3,"b")]) - left |> should equal (IntMap.singleton 3 "b") - right |> should equal (IntMap.singleton 5 "a") - let left, right = IntMap.partition ((fun f a b -> f b a) (<) "x") (IntMap.ofList [(5,"a"); (3,"b")]) - left |> should equal (IntMap.ofList [(3, "b"); (5, "a")]) - right |> should equal IntMap.empty - let left, right = IntMap.partition ((fun f a b -> f b a) (>) "x") (IntMap.ofList [(5,"a"); (3,"b")]) - left |> should equal IntMap.empty - right |> should equal (IntMap.ofList [(3, "b"); (5, "a")]) - -[] -let ``test partitionWithKey``() = - let left, right = IntMap.partitionWithKey (fun k _ -> k > 3) (IntMap.ofList [(5,"a"); (3,"b")]) - left |> should equal (IntMap.singleton 5 "a") - right |> should equal (IntMap.singleton 3 "b") - let left, right = IntMap.partitionWithKey (fun k _ -> k < 7) (IntMap.ofList [(5,"a"); (3,"b")]) - left |> should equal (IntMap.ofList [(3, "b"); (5, "a")]) - right |> should equal IntMap.empty - let left, right = IntMap.partitionWithKey (fun k _ -> k > 7) (IntMap.ofList [(5,"a"); (3,"b")]) - left |> should equal IntMap.empty - right |> should equal (IntMap.ofList [(3, "b"); (5, "a")]) - -[] -let ``test mapOption``() = - let f x = if x = "a" then Some "new a" else None - IntMap.mapOption f (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal (IntMap.singleton 5 "new a") - -[] -let ``test mapOptionWithKey``() = - let f k _ = if k < 5 then Some ("key : " + (string k)) else None - IntMap.mapOptionWithKey f (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal (IntMap.singleton 3 "key : 3") - -[] -let ``test mapChoice``() = - let f a = if a < "c" then Choice1Of2 a else Choice2Of2 a - IntMap.mapChoice f (IntMap.ofList [(5,"a"); (3,"b"); (1,"x"); (7,"z")]) - |> should equal (IntMap.ofList [(3,"b"); (5,"a")], IntMap.ofList [(1,"x"); (7,"z")]) - IntMap.mapChoice (fun a -> Choice2Of2 a) (IntMap.ofList [(5,"a"); (3,"b"); (1,"x"); (7,"z")]) - |> should equal (IntMap.empty, IntMap.ofList [(5,"a"); (3,"b"); (1,"x"); (7,"z")]) - -[] -let ``test mapChoiceWithKey``() = - let f k a = if k < 5 then Choice1Of2 (k * 2) else Choice2Of2 (a + a) - IntMap.mapChoiceWithKey f (IntMap.ofList [(5,"a"); (3,"b"); (1,"x"); (7,"z")]) - |> should equal (IntMap.ofList [(1,2); (3,6)], IntMap.ofList [(5,"aa"); (7,"zz")]) - IntMap.mapChoiceWithKey (fun _ a -> Choice2Of2 a) (IntMap.ofList [(5,"a"); (3,"b"); (1,"x"); (7,"z")]) - |> should equal (IntMap.empty, IntMap.ofList [(1,"x"); (3,"b"); (5,"a"); (7,"z")]) - -[] -let ``test split``() = - let left, right = IntMap.split 2 (IntMap.ofList [(5,"a"); (3,"b")]) - left |> should equal IntMap.empty - right |> should equal (IntMap.ofList [(3,"b"); (5,"a")]) - let left, right = IntMap.split 3 (IntMap.ofList [(5,"a"); (3,"b")]) - left |> should equal IntMap.empty - right |> should equal (IntMap.singleton 5 "a") - let left, right = IntMap.split 4 (IntMap.ofList [(5,"a"); (3,"b")]) - left |> should equal (IntMap.singleton 3 "b") - right |> should equal (IntMap.singleton 5 "a") - let left, right = IntMap.split 5 (IntMap.ofList [(5,"a"); (3,"b")]) - left |> should equal (IntMap.singleton 3 "b") - right |> should equal IntMap.empty - let left, right = IntMap.split 6 (IntMap.ofList [(5,"a"); (3,"b")]) - left |> should equal (IntMap.ofList [(3,"b"); (5,"a")]) - right |> should equal IntMap.empty - -[] -let ``test splitTryFind``() = - let left, center, right = IntMap.splitTryFind 2 (IntMap.ofList [(5,"a"); (3,"b")]) - left |> should equal IntMap.empty - center |> should equal None - right |> should equal (IntMap.ofList [(3,"b"); (5,"a")]) - let left, center, right = IntMap.splitTryFind 3 (IntMap.ofList [(5,"a"); (3,"b")]) - left |> should equal IntMap.empty - center |> should equal (Some "b") - right |> should equal (IntMap.singleton 5 "a") - let left, center, right = IntMap.splitTryFind 4 (IntMap.ofList [(5,"a"); (3,"b")]) - left |> should equal (IntMap.singleton 3 "b") - center |> should equal None - right |> should equal (IntMap.singleton 5 "a") - let left, center, right = IntMap.splitTryFind 5 (IntMap.ofList [(5,"a"); (3,"b")]) - left |> should equal (IntMap.singleton 3 "b") - center |> should equal (Some "a") - right |> should equal IntMap.empty - let left, center, right = IntMap.splitTryFind 6 (IntMap.ofList [(5,"a"); (3,"b")]) - left |> should equal (IntMap.ofList [(3,"b"); (5,"a")]) - center |> should equal None - right |> should equal IntMap.empty - -// Submap - -[] -let ``test isSubmapOfBy``() = - IntMap.isSubmapOfBy (=) (IntMap.ofList [(int 'a',1)]) (IntMap.ofList [(int 'a',1);(int 'b',2)]) |> should be True - IntMap.isSubmapOfBy (<=) (IntMap.ofList [(int 'a',1)]) (IntMap.ofList [(int 'a',1);(int 'b',2)]) |> should be True - IntMap.isSubmapOfBy (=) (IntMap.ofList [(int 'a',1);(int 'b',2)]) (IntMap.ofList [(int 'a',1);(int 'b',2)]) |> should be True - IntMap.isSubmapOfBy (=) (IntMap.ofList [(int 'a',2)]) (IntMap.ofList [(int 'a',1);(int 'b',2)]) |> should be False - IntMap.isSubmapOfBy (<) (IntMap.ofList [(int 'a',1)]) (IntMap.ofList [(int 'a',1);(int 'b',2)]) |> should be False - IntMap.isSubmapOfBy (=) (IntMap.ofList [(int 'a',1);(int 'b',2)]) (IntMap.ofList [(int 'a',1)]) |> should be False - -[] -let ``test isSubmapOf``() = - IntMap.isSubmapOf (IntMap.ofList [(int 'a',1)]) (IntMap.ofList [(int 'a',1);(int 'b',2)]) |> should be True - IntMap.isSubmapOf (IntMap.ofList [(int 'a',1);(int 'b',2)]) (IntMap.ofList [(int 'a',1);(int 'b',2)]) |> should be True - IntMap.isSubmapOf (IntMap.ofList [(int 'a',2)]) (IntMap.ofList [(int 'a',1);(int 'b',2)]) |> should be False - IntMap.isSubmapOf (IntMap.ofList [(int 'a',1);(int 'b',2)]) (IntMap.ofList [(int 'a',1)]) |> should be False - -[] -let ``test isProperSubmapOfBy``() = - IntMap.isProperSubmapOfBy (=) (IntMap.ofList [(1,1)]) (IntMap.ofList [(1,1);(2,2)]) |> should be True - IntMap.isProperSubmapOfBy (<=) (IntMap.ofList [(1,1)]) (IntMap.ofList [(1,1);(2,2)]) |> should be True - IntMap.isProperSubmapOfBy (=) (IntMap.ofList [(1,1);(2,2)]) (IntMap.ofList [(1,1);(2,2)]) |> should be False - IntMap.isProperSubmapOfBy (=) (IntMap.ofList [(1,1);(2,2)]) (IntMap.ofList [(1,1)]) |> should be False - IntMap.isProperSubmapOfBy (<) (IntMap.ofList [(1,1)]) (IntMap.ofList [(1,1);(2,2)]) |> should be False - -[] -let ``test isProperSubmapOf``() = - IntMap.isProperSubmapOf (IntMap.ofList [(1,1)]) (IntMap.ofList [(1,1);(2,2)]) |> should be True - IntMap.isProperSubmapOf (IntMap.ofList [(1,1);(2,2)]) (IntMap.ofList [(1,1);(2,2)]) |> should be False - IntMap.isProperSubmapOf (IntMap.ofList [(1,1);(2,2)]) (IntMap.ofList [(1,1)]) |> should be False - -// Min/Max - -[] -let ``test findMin``() = - IntMap.findMin (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal (3,"b") - -[] -let ``test findMax``() = - IntMap.findMax (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal (5,"a") - -[] -let ``test deleteMin``() = - IntMap.deleteMin (IntMap.ofList [(5,"a"); (3,"b"); (7,"c")]) |> should equal (IntMap.ofList [(5,"a"); (7,"c")]) - IntMap.deleteMin IntMap.empty |> should equal IntMap.empty - -[] -let ``test deleteMax``() = - IntMap.deleteMax (IntMap.ofList [(5,"a"); (3,"b"); (7,"c")]) |> should equal (IntMap.ofList [(3,"b"); (5,"a")]) - IntMap.deleteMax IntMap.empty |> should equal IntMap.empty - -[] -let ``test deleteFindMin``() = - IntMap.deleteFindMin (IntMap.ofList [(5,"a"); (3,"b"); (10,"c")]) |> should equal ((3,"b"), IntMap.ofList [(5,"a"); (10,"c")]) - -[] -let ``test deleteFindMax``() = - IntMap.deleteFindMax (IntMap.ofList [(5,"a"); (3,"b"); (10,"c")]) |> should equal ((10,"c"), IntMap.ofList [(3,"b"); (5,"a")]) - -[] -let ``test updateMin``() = - IntMap.updateMin (fun a -> Some ("X" + a)) (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal (IntMap.ofList [(3, "Xb"); (5, "a")]) - IntMap.updateMin (fun _ -> None) (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal (IntMap.singleton 5 "a") - -[] -let ``test updateMax``() = - IntMap.updateMax (fun a -> Some ("X" + a)) (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal (IntMap.ofList [(3, "b"); (5, "Xa")]) - IntMap.updateMax (fun _ -> None) (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal (IntMap.singleton 3 "b") - -[] -let ``test updateMinWithKey``() = - IntMap.updateMinWithKey (fun k a -> Some ((string k) + ":" + a)) (IntMap.ofList [(5,"a"); (3,"b")]) - |> should equal (IntMap.ofList [(3,"3:b"); (5,"a")]) - IntMap.updateMinWithKey (fun _ _ -> None) (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal (IntMap.singleton 5 "a") - -[] -let ``test updateMaxWithKey``() = - IntMap.updateMaxWithKey (fun k a -> Some ((string k) + ":" + a)) (IntMap.ofList [(5,"a"); (3,"b")]) - |> should equal (IntMap.ofList [(3,"b"); (5,"5:a")]) - IntMap.updateMaxWithKey (fun _ _ -> None) (IntMap.ofList [(5,"a"); (3,"b")]) - |> should equal (IntMap.singleton 3 "b") - -[] -let ``test minView``() = - IntMap.minView (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal (Some ("b", IntMap.singleton 5 "a")) - IntMap.minView IntMap.empty |> should equal None - -[] -let ``test maxView``() = - IntMap.maxView (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal (Some ("a", IntMap.singleton 3 "b")) - IntMap.maxView IntMap.empty |> should equal None - -[] -let ``test minViewWithKey``() = - IntMap.minViewWithKey (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal (Some ((3,"b"), IntMap.singleton 5 "a")) - IntMap.minViewWithKey IntMap.empty |> should equal None - -[] -let ``test maxViewWithKey``() = - IntMap.maxViewWithKey (IntMap.ofList [(5,"a"); (3,"b")]) |> should equal (Some ((5,"a"), IntMap.singleton 3 "b")) - IntMap.maxViewWithKey IntMap.empty |> should equal None - +open Properties open FsCheck -open FsCheck.NUnit -open FSharpx.Collections.Tests.Properties +open Expecto +open Expecto.Flip open System.Linq -let fsCheck t = fsCheck "" t - -type IntMapGen = - static member IntMap() = - let rec intMapGen() = - gen { - let! ks = Arb.generate - let! xs = Arb.generate - return IntMap.ofSeq (Seq.zip (Seq.ofList xs) (Seq.ofList ks)) - } - Arb.fromGen (intMapGen()) - -let registerGen = lazy (Arb.register() |> ignore) - -[] -let ``prop singleton``() = - fsCheck (fun k x -> IntMap.insert k x IntMap.empty = IntMap.singleton k x) - -[] -let ``prop insert and tryFind``() = - registerGen.Force() - fsCheck (fun k t -> IntMap.tryFind k (IntMap.insert k () t) <> None) +module IntMapTest = + type IntMapGen = + static member IntMap() = + let rec intMapGen() = + gen { + let! ks = Arb.generate + let! xs = Arb.generate + return IntMap.ofSeq (Seq.zip (Seq.ofList xs) (Seq.ofList ks)) + } + Arb.fromGen (intMapGen()) -[] -let ``prop insert and delete``() = - registerGen.Force() - fsCheck <| fun k t -> - IntMap.tryFind k t = None ==> (IntMap.delete k (IntMap.insert k () t) = t) + let registerGen = lazy (Arb.register() |> ignore) -[] -let ``prop delete non member``() = registerGen.Force() - fsCheck <| fun k t -> - IntMap.tryFind k t = None ==> (IntMap.delete k t = t) -[] -let ``prop append``() = - fsCheck <| fun xs ys -> - List.sort (IntMap.keys (IntMap.append (IntMap.ofList xs) (IntMap.ofList ys))) - = List.sort (List.ofSeq (Seq.distinct (List.append (List.map fst xs) (List.map fst ys)))) + [] + let testIntMap = + + let employeeDept = IntMap.ofList([(1,2); (3,1)]) + + testList "Experimental IntMap" [ + test "test isEmpty" { + IntMap.isEmpty IntMap.empty |> Expect.isTrue "" + (1, 'a') ||> IntMap.singleton |> IntMap.isEmpty |> Expect.isFalse "" } + + test "test size" { + IntMap.size IntMap.empty |> Expect.equal "" 0 + IntMap.singleton 1 'a' |> IntMap.size |> Expect.equal "" 1 + IntMap.ofList [(1,'a'); (2,'b'); (3,'c')] |> IntMap.size |> Expect.equal "" 3} + + test "test member" { + IntMap.exists 5 (IntMap.ofList [(5,'a'); (3,'b')]) |> Expect.isTrue "" + IntMap.exists 1 (IntMap.ofList [(5,'a'); (3,'b')]) |> Expect.isFalse "" } + + test "test notMember" { + IntMap.notExists 5 (IntMap.ofList [(5,'a'); (3,'b')]) |> Expect.isFalse "" + IntMap.notExists 1 (IntMap.ofList [(5,'a'); (3,'b')]) |> Expect.isTrue "" } + + test "test tryFind" { + let deptCountry = IntMap.ofList([(1,1); (2,2)]) + let countryCurrency = IntMap.ofList([(1, 2); (2, 1)]) + let employeeCurrency name = + match IntMap.tryFind name employeeDept with + | Some dept -> + match IntMap.tryFind dept deptCountry with + | Some country -> IntMap.tryFind country countryCurrency + | None -> None + | None -> None + + employeeCurrency 1 |> Expect.equal "" (Some 1) + employeeCurrency 2 |> Expect.isNone "" } + + test "test find" { + let employeeDept = IntMap.ofList([(1,1); (2,2)]) + Expect.equal "" 2 <| IntMap.find 2 employeeDept} + + + test "test findWithDefault" { + IntMap.findWithDefault 'x' 1 (IntMap.ofList [(5,'a'); (3,'b')]) |> Expect.equal "" 'x' + IntMap.findWithDefault 'x' 5 (IntMap.ofList [(5,'a'); (3,'b')]) |> Expect.equal "" 'a' } + + test "test tryFindLT" { + IntMap.tryFindLT 3 (IntMap.ofList [(3,'a'); (5,'b')]) |> Expect.isNone "" + IntMap.tryFindLT 4 (IntMap.ofList [(3,'a'); (5,'b')]) |> Expect.equal "" (Some(3, 'a')) } + + test "test tryFindGT" { + IntMap.tryFindGT 4 (IntMap.ofList [(3,'a'); (5,'b')]) |> Expect.equal "" (Some(5,'b')) + IntMap.tryFindGT 5 (IntMap.ofList [(3,'a'); (5,'b')]) |> Expect.isNone "" } + + test "test tryFindLE" { + IntMap.tryFindLE 2 (IntMap.ofList [(3,'a'); (5,'b')]) |> Expect.isNone "" + IntMap.tryFindLE 4 (IntMap.ofList [(3,'a'); (5,'b')]) |> Expect.equal "" (Some(3,'a')) + IntMap.tryFindLE 5 (IntMap.ofList [(3,'a'); (5,'b')]) |> Expect.equal "" (Some(5,'b')) } + + test "test tryFindGE" { + IntMap.tryFindGE 3 (IntMap.ofList [(3,'a'); (5,'b')]) |> Expect.equal "" (Some(3,'a')) + IntMap.tryFindGE 4 (IntMap.ofList [(3,'a'); (5,'b')]) |> Expect.equal "" (Some(5,'b')) + IntMap.tryFindGE 6 (IntMap.ofList [(3,'a'); (5,'b')]) |> Expect.isNone "" } + + // Construction + + test "test empty" { + IntMap.empty |> Expect.equal "" (IntMap.ofList []) + IntMap.size IntMap.empty |> Expect.equal "" 0 } + + test "test singleton" { + IntMap.singleton 1 'a' |> Expect.equal "" (IntMap.ofList [(1, 'a')]) + IntMap.size (IntMap.singleton 1 'a') |> Expect.equal "" 1 } + + test "test insert" { + IntMap.insert 5 'x' (IntMap.ofList [(5,'a'); (3,'b')]) |> Expect.equal "" (IntMap.ofList [(3, 'b'); (5, 'x')]) + IntMap.insert 7 'x' (IntMap.ofList [(5,'a'); (3,'b')]) |> Expect.equal "" (IntMap.ofList [(3, 'b'); (5, 'a'); (7, 'x')]) + IntMap.insert 5 'x' IntMap.empty |> Expect.equal "" (IntMap.singleton 5 'x') } + + test "test insertWith" { + IntMap.insertWith (+) 5 "xxx" (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" (IntMap.ofList [(3, "b"); (5, "xxxa")]) + IntMap.insertWith (+) 7 "xxx" (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" (IntMap.ofList [(3, "b"); (5, "a"); (7, "xxx")]) + IntMap.insertWith (+) 5 "xxx" IntMap.empty |> Expect.equal "" (IntMap.singleton 5 "xxx") } + + test "test insertWithKey" { + let f key new_value old_value = string key + ":" + new_value + "|" + old_value + IntMap.insertWithKey f 5 "xxx" (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" (IntMap.ofList [(3, "b"); (5, "5:xxx|a")]) + IntMap.insertWithKey f 7 "xxx" (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" (IntMap.ofList [(3, "b"); (5, "a"); (7, "xxx")]) + IntMap.insertWithKey f 5 "xxx" IntMap.empty |> Expect.equal "" (IntMap.singleton 5 "xxx") } + + test "test insertTryFindWithKey" { + let f key new_value old_value = string key + ":" + new_value + "|" + old_value + IntMap.insertTryFindWithKey f 5 "xxx" (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" (Some "a", IntMap.ofList [(3, "b"); (5, "5:xxx|a")]) + let fnd, map = IntMap.insertTryFindWithKey f 2 "xxx" (IntMap.ofList [(5,"a"); (3,"b")]) + fnd |> Expect.isNone "" + map |> Expect.equal "" (IntMap.ofList [(2,"xxx");(3,"b");(5,"a")]) + let fnd, map = IntMap.insertTryFindWithKey f 7 "xxx" (IntMap.ofList [(5,"a"); (3,"b")]) + fnd |> Expect.isNone "" + map |> Expect.equal "" (IntMap.ofList [(3, "b"); (5, "a"); (7, "xxx")]) + let fnd, map = IntMap.insertTryFindWithKey f 5 "xxx" IntMap.empty + fnd |> Expect.isNone "" + map |> Expect.equal "" (IntMap.singleton 5 "xxx") } + + // Delete/Update + + test "test delete" { + IntMap.delete 5 (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" (IntMap.singleton 3 "b") + IntMap.delete 7 (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" (IntMap.ofList [(3, "b"); (5, "a")]) + IntMap.delete 5 IntMap.empty |> Expect.equal "" IntMap.empty } + + test "test adjust" { + IntMap.adjust ((+) "new ") 5 (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" (IntMap.ofList [(3, "b"); (5, "new a")]) + IntMap.adjust ((+) "new ") 7 (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" (IntMap.ofList [(3, "b"); (5, "a")]) + IntMap.adjust ((+) "new ") 7 IntMap.empty |> Expect.equal "" IntMap.empty } + + test "test adjustWithKey" { + let f key x = (string key) + ":new " + x + IntMap.adjustWithKey f 5 (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" (IntMap.ofList [(3, "b"); (5, "5:new a")]) + IntMap.adjustWithKey f 7 (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" (IntMap.ofList [(3, "b"); (5, "a")]) + IntMap.adjustWithKey f 7 IntMap.empty |> Expect.equal "" IntMap.empty } + + test "test update" { + let f x = if x = "a" then Some "new a" else None + IntMap.update f 5 (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" (IntMap.ofList [(3, "b"); (5, "new a")]) + IntMap.update f 7 (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" (IntMap.ofList [(3, "b"); (5, "a")]) + IntMap.update f 3 (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" (IntMap.singleton 5 "a") } + + test "test updateWithKey" { + let f k x = if x = "a" then Some ((string k) + ":new a") else None + IntMap.updateWithKey f 5 (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" (IntMap.ofList [(3, "b"); (5, "5:new a")]) + IntMap.updateWithKey f 7 (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" (IntMap.ofList [(3, "b"); (5, "a")]) + IntMap.updateWithKey f 3 (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" (IntMap.singleton 5 "a") } + + test "test updateTryFindWithKey" { + let f k x = if x = "a" then Some ((string k) + ":new a") else None + IntMap.updateTryFindWithKey f 5 (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" (Some "a", IntMap.ofList [(3, "b"); (5, "5:new a")]) + let fnd, map = IntMap.updateTryFindWithKey f 7 (IntMap.ofList [(5,"a"); (3,"b")]) + fnd |> Expect.isNone "" + map |> Expect.equal "" (IntMap.ofList [(3, "b"); (5, "a")]) + IntMap.updateTryFindWithKey f 3 (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" (Some "b", IntMap.singleton 5 "a") } + + test "test alter" { + let f _ = None + let g _ = Some "c" + IntMap.alter f 7 (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" (IntMap.ofList [(3, "b"); (5, "a")]) + IntMap.alter f 5 (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" (IntMap.singleton 3 "b") + IntMap.alter g 7 (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" (IntMap.ofList [(3, "b"); (5, "a"); (7, "c")]) + IntMap.alter g 5 (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" (IntMap.ofList [(3, "b"); (5, "c")]) } + + // Combine + + test "test append" { + IntMap.append (IntMap.ofList [(5, "a"); (3, "b")]) (IntMap.ofList [(5, "A"); (7, "C")]) + |> Expect.equal "" (IntMap.ofList [(3, "b"); (5, "a"); (7, "C")]) } + + test "test appendWith" { + IntMap.appendWith (+) (IntMap.ofList [(5, "a"); (3, "b")]) (IntMap.ofList [(5, "A"); (7, "C")]) + |> Expect.equal "" (IntMap.ofList [(3, "b"); (5, "aA"); (7, "C")]) } + + test "test appendWithKey" { + let f key left_value right_value = (string key) + ":" + left_value + "|" + right_value + IntMap.appendWithKey f (IntMap.ofList [(5, "a"); (3, "b")]) (IntMap.ofList [(5, "A"); (7, "C")]) + |> Expect.equal "" (IntMap.ofList [(3, "b"); (5, "5:a|A"); (7, "C")]) } + + test "test concat" { + IntMap.concat [IntMap.ofList [(5, "a"); (3, "b")]; IntMap.ofList [(5, "A"); (7, "C")]; IntMap.ofList [(5, "A3"); (3, "B3")]] + |> Expect.equal "" (IntMap.ofList [(3, "b"); (5, "a"); (7, "C")]) + IntMap.concat [IntMap.ofList [(5, "A3"); (3, "B3")]; IntMap.ofList [(5, "A"); (7, "C")]; IntMap.ofList [(5, "a"); (3, "b")]] + |> Expect.equal "" (IntMap.ofList [(3, "B3"); (5, "A3"); (7, "C")]) } + + test "test concatWith" { + IntMap.concatWith (+) [IntMap.ofList [(5, "a"); (3, "b")]; IntMap.ofList [(5, "A"); (7, "C")]; IntMap.ofList [(5, "A3"); (3, "B3")]] + |> Expect.equal "" (IntMap.ofList [(3, "bB3"); (5, "aAA3"); (7, "C")]) } + + test "test difference" { + IntMap.difference (IntMap.ofList [(5, "a"); (3, "b")]) (IntMap.ofList [(5, "A"); (7, "C")]) + |> Expect.equal "" (IntMap.singleton 3 "b") } + + test "test differenceWith" { + let f al ar = if al = "b" then Some (al + ":" + ar) else None + IntMap.differenceWith f (IntMap.ofList [(5, "a"); (3, "b")]) (IntMap.ofList [(5, "A"); (3, "B"); (7, "C")]) + |> Expect.equal "" (IntMap.singleton 3 "b:B") } + + test "test differenceWithKey" { + let f k al ar = if al = "b" then Some ((string k) + ":" + al + "|" + ar) else None + IntMap.differenceWithKey f (IntMap.ofList [(5, "a"); (3, "b")]) (IntMap.ofList [(5, "A"); (3, "B"); (10, "C")]) + |> Expect.equal "" (IntMap.singleton 3 "3:b|B") } + + test "test intersection" { + IntMap.intersection (IntMap.ofList [(5, "a"); (3, "b")]) (IntMap.ofList [(5, "A"); (7, "C")]) + |> Expect.equal "" (IntMap.singleton 5 "a") } + + test "test intersectionWith" { + IntMap.intersectionWith (+) (IntMap.ofList [(5, "a"); (3, "b")]) (IntMap.ofList [(5, "A"); (7, "C")]) + |> Expect.equal "" (IntMap.singleton 5 "aA") } + + test "test intersectionWithKey" { + let f k al ar = (string k) + ":" + al + "|" + ar + IntMap.intersectionWithKey f (IntMap.ofList [(5, "a"); (3, "b")]) (IntMap.ofList [(5, "A"); (7, "C")]) + |> Expect.equal "" (IntMap.singleton 5 "5:a|A") } + + // Traversal + + test "test map" { + IntMap.map ((fun f a b -> f b a) (+) "x") (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" (IntMap.ofList [(3, "bx"); (5, "ax")]) } + + test "test mapWithKey" { + let f key x = (string key) + ":" + x + IntMap.mapWithKey f (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" (IntMap.ofList [(3, "3:b"); (5, "5:a")]) } + + test "test mapAccum" { + let f a b = (a + b, b + "X") + IntMap.mapAccum f "Everything: " (IntMap.ofList [(5,"a"); (3,"b")]) + |> Expect.equal "" ("Everything: ba", IntMap.ofList [(3, "bX"); (5, "aX")]) } + + test "test mapAccumWithKey" { + let f a k b = (a + " " + (string k) + "-" + b, b + "X") + IntMap.mapAccumWithKey f "Everything:" (IntMap.ofList [(5,"a"); (3,"b")]) + |> Expect.equal "" ("Everything: 3-b 5-a", IntMap.ofList [(3, "bX"); (5, "aX")]) } + + test "test mapKeys" { + IntMap.mapKeys ((fun f a b -> f b a) (+) 1) (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" (IntMap.ofList [(4, "b"); (6, "a")]) + IntMap.mapKeys (fun _ -> 1) (IntMap.ofList [(1,"b"); (2,"a"); (3,"d"); (4,"c")]) |> Expect.equal "" (IntMap.singleton 1 "c") + IntMap.mapKeys (fun _ -> 3) (IntMap.ofList [(1,"b"); (2,"a"); (3,"d"); (4,"c")]) |> Expect.equal "" (IntMap.singleton 3 "c") } + + test "test mapKeysWith" { + IntMap.mapKeysWith (+) (fun _ -> 1) (IntMap.ofList [(1,"b"); (2,"a"); (3,"d"); (4,"c")]) |> Expect.equal "" (IntMap.singleton 1 "cdab") + IntMap.mapKeysWith (+) (fun _ -> 3) (IntMap.ofList [(1,"b"); (2,"a"); (3,"d"); (4,"c")]) |> Expect.equal "" (IntMap.singleton 3 "cdab") } + + // Conversion + + test "test values" { + IntMap.values (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" ["b";"a"] + IntMap.values IntMap.empty |> Expect.equal "" [] } + + test "test keys" { + IntMap.keys (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" [3;5] + IntMap.keys IntMap.empty |> Expect.equal "" [] } + + // Lists + + test "test toList" { + IntMap.toList (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" [(3,"b"); (5,"a")] + IntMap.toList IntMap.empty |> Expect.equal "" [] } + + test "test ofList" { + IntMap.ofList [] |> Expect.equal "" IntMap.empty + IntMap.ofList [(5,"a"); (3,"b"); (5, "c")] |> Expect.equal "" (IntMap.ofList [(5,"c"); (3,"b")]) + IntMap.ofList [(5,"c"); (3,"b"); (5, "a")] |> Expect.equal "" (IntMap.ofList [(5,"a"); (3,"b")]) } + + test "test ofListWith" { + IntMap.ofListWith (+) [(5,"a"); (5,"b"); (3,"b"); (3,"a"); (5,"a")] |> Expect.equal "" (IntMap.ofList [(3, "ab"); (5, "aba")]) + IntMap.ofListWith (+) [] |> Expect.equal "" IntMap.empty } + + test "test ofListWithKey" { + let f k a1 a2 = (string k) + a1 + a2 + IntMap.ofListWithKey f [(5,"a"); (5,"b"); (3,"b"); (3,"a"); (5,"a")] |> Expect.equal "" (IntMap.ofList [(3, "3ab"); (5, "5a5ba")]) + IntMap.ofListWithKey f [] |> Expect.equal "" IntMap.empty } + + // Filter + + test "test filter" { + IntMap.filter ((fun f a b -> f b a) (>) "a") (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" (IntMap.singleton 3 "b") + IntMap.filter ((fun f a b -> f b a) (>) "x") (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" IntMap.empty + IntMap.filter ((fun f a b -> f b a) (<) "a") (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" IntMap.empty } + + test "test filteWithKey" { + IntMap.filterWithKey (fun k _ -> k > 4) (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" (IntMap.singleton 5 "a") } + + test "test partition" { + let left, right = IntMap.partition ((fun f a b -> f b a) (>) "a") (IntMap.ofList [(5,"a"); (3,"b")]) + left |> Expect.equal "" (IntMap.singleton 3 "b") + right |> Expect.equal "" (IntMap.singleton 5 "a") + let left, right = IntMap.partition ((fun f a b -> f b a) (<) "x") (IntMap.ofList [(5,"a"); (3,"b")]) + left |> Expect.equal "" (IntMap.ofList [(3, "b"); (5, "a")]) + right |> Expect.equal "" IntMap.empty + let left, right = IntMap.partition ((fun f a b -> f b a) (>) "x") (IntMap.ofList [(5,"a"); (3,"b")]) + left |> Expect.equal "" IntMap.empty + right |> Expect.equal "" (IntMap.ofList [(3, "b"); (5, "a")]) } + + test "test partitionWithKey" { + let left, right = IntMap.partitionWithKey (fun k _ -> k > 3) (IntMap.ofList [(5,"a"); (3,"b")]) + left |> Expect.equal "" (IntMap.singleton 5 "a") + right |> Expect.equal "" (IntMap.singleton 3 "b") + let left, right = IntMap.partitionWithKey (fun k _ -> k < 7) (IntMap.ofList [(5,"a"); (3,"b")]) + left |> Expect.equal "" (IntMap.ofList [(3, "b"); (5, "a")]) + right |> Expect.equal "" IntMap.empty + let left, right = IntMap.partitionWithKey (fun k _ -> k > 7) (IntMap.ofList [(5,"a"); (3,"b")]) + left |> Expect.equal "" IntMap.empty + right |> Expect.equal "" (IntMap.ofList [(3, "b"); (5, "a")]) } + + test "test mapOption" { + let f x = if x = "a" then Some "new a" else None + IntMap.mapOption f (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" (IntMap.singleton 5 "new a") } + + test "test mapOptionWithKey" { + let f k _ = if k < 5 then Some ("key : " + (string k)) else None + IntMap.mapOptionWithKey f (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" (IntMap.singleton 3 "key : 3") } + + test "test mapChoice" { + let f a = if a < "c" then Choice1Of2 a else Choice2Of2 a + IntMap.mapChoice f (IntMap.ofList [(5,"a"); (3,"b"); (1,"x"); (7,"z")]) + |> Expect.equal "" (IntMap.ofList [(3,"b"); (5,"a")], IntMap.ofList [(1,"x"); (7,"z")]) + IntMap.mapChoice (fun a -> Choice2Of2 a) (IntMap.ofList [(5,"a"); (3,"b"); (1,"x"); (7,"z")]) + |> Expect.equal "" (IntMap.empty, IntMap.ofList [(5,"a"); (3,"b"); (1,"x"); (7,"z")]) } + + test "test mapChoiceWithKey" { + let f k a = if k < 5 then Choice1Of2 (k * 2) else Choice2Of2 (a + a) + IntMap.mapChoiceWithKey f (IntMap.ofList [(5,"a"); (3,"b"); (1,"x"); (7,"z")]) + |> Expect.equal "" (IntMap.ofList [(1,2); (3,6)], IntMap.ofList [(5,"aa"); (7,"zz")]) + IntMap.mapChoiceWithKey (fun _ a -> Choice2Of2 a) (IntMap.ofList [(5,"a"); (3,"b"); (1,"x"); (7,"z")]) + |> Expect.equal "" (IntMap.empty, IntMap.ofList [(1,"x"); (3,"b"); (5,"a"); (7,"z")]) } + + test "test split" { + let left, right = IntMap.split 2 (IntMap.ofList [(5,"a"); (3,"b")]) + left |> Expect.equal "" IntMap.empty + right |> Expect.equal "" (IntMap.ofList [(3,"b"); (5,"a")]) + let left, right = IntMap.split 3 (IntMap.ofList [(5,"a"); (3,"b")]) + left |> Expect.equal "" IntMap.empty + right |> Expect.equal "" (IntMap.singleton 5 "a") + let left, right = IntMap.split 4 (IntMap.ofList [(5,"a"); (3,"b")]) + left |> Expect.equal "" (IntMap.singleton 3 "b") + right |> Expect.equal "" (IntMap.singleton 5 "a") + let left, right = IntMap.split 5 (IntMap.ofList [(5,"a"); (3,"b")]) + left |> Expect.equal "" (IntMap.singleton 3 "b") + right |> Expect.equal "" IntMap.empty + let left, right = IntMap.split 6 (IntMap.ofList [(5,"a"); (3,"b")]) + left |> Expect.equal "" (IntMap.ofList [(3,"b"); (5,"a")]) + right |> Expect.equal "" IntMap.empty } + + test "test splitTryFind" { + let left, center, right = IntMap.splitTryFind 2 (IntMap.ofList [(5,"a"); (3,"b")]) + left |> Expect.equal "" IntMap.empty + center |> Expect.isNone "" + right |> Expect.equal "" (IntMap.ofList [(3,"b"); (5,"a")]) + let left, center, right = IntMap.splitTryFind 3 (IntMap.ofList [(5,"a"); (3,"b")]) + left |> Expect.equal "" IntMap.empty + center |> Expect.equal "" (Some "b") + right |> Expect.equal "" (IntMap.singleton 5 "a") + let left, center, right = IntMap.splitTryFind 4 (IntMap.ofList [(5,"a"); (3,"b")]) + left |> Expect.equal "" (IntMap.singleton 3 "b") + center |> Expect.isNone "" + right |> Expect.equal "" (IntMap.singleton 5 "a") + let left, center, right = IntMap.splitTryFind 5 (IntMap.ofList [(5,"a"); (3,"b")]) + left |> Expect.equal "" (IntMap.singleton 3 "b") + center |> Expect.equal "" (Some "a") + right |> Expect.equal "" IntMap.empty + let left, center, right = IntMap.splitTryFind 6 (IntMap.ofList [(5,"a"); (3,"b")]) + left |> Expect.equal "" (IntMap.ofList [(3,"b"); (5,"a")]) + center |> Expect.isNone "" + right |> Expect.equal "" IntMap.empty } + + // Submap + + test "test isSubmapOfBy" { + IntMap.isSubmapOfBy (=) (IntMap.ofList [(int 'a',1)]) (IntMap.ofList [(int 'a',1);(int 'b',2)]) |> Expect.isTrue "" + IntMap.isSubmapOfBy (<=) (IntMap.ofList [(int 'a',1)]) (IntMap.ofList [(int 'a',1);(int 'b',2)]) |> Expect.isTrue "" + IntMap.isSubmapOfBy (=) (IntMap.ofList [(int 'a',1);(int 'b',2)]) (IntMap.ofList [(int 'a',1);(int 'b',2)]) |> Expect.isTrue "" + IntMap.isSubmapOfBy (=) (IntMap.ofList [(int 'a',2)]) (IntMap.ofList [(int 'a',1);(int 'b',2)]) |> Expect.isFalse "" + IntMap.isSubmapOfBy (<) (IntMap.ofList [(int 'a',1)]) (IntMap.ofList [(int 'a',1);(int 'b',2)]) |> Expect.isFalse "" + IntMap.isSubmapOfBy (=) (IntMap.ofList [(int 'a',1);(int 'b',2)]) (IntMap.ofList [(int 'a',1)]) |> Expect.isFalse "" } + + test "test isSubmapOf" { + IntMap.isSubmapOf (IntMap.ofList [(int 'a',1)]) (IntMap.ofList [(int 'a',1);(int 'b',2)]) |> Expect.isTrue "" + IntMap.isSubmapOf (IntMap.ofList [(int 'a',1);(int 'b',2)]) (IntMap.ofList [(int 'a',1);(int 'b',2)]) |> Expect.isTrue "" + IntMap.isSubmapOf (IntMap.ofList [(int 'a',2)]) (IntMap.ofList [(int 'a',1);(int 'b',2)]) |> Expect.isFalse "" + IntMap.isSubmapOf (IntMap.ofList [(int 'a',1);(int 'b',2)]) (IntMap.ofList [(int 'a',1)]) |> Expect.isFalse "" } + + test "test isProperSubmapOfBy" { + IntMap.isProperSubmapOfBy (=) (IntMap.ofList [(1,1)]) (IntMap.ofList [(1,1);(2,2)]) |> Expect.isTrue "" + IntMap.isProperSubmapOfBy (<=) (IntMap.ofList [(1,1)]) (IntMap.ofList [(1,1);(2,2)]) |> Expect.isTrue "" + IntMap.isProperSubmapOfBy (=) (IntMap.ofList [(1,1);(2,2)]) (IntMap.ofList [(1,1);(2,2)]) |> Expect.isFalse "" + IntMap.isProperSubmapOfBy (=) (IntMap.ofList [(1,1);(2,2)]) (IntMap.ofList [(1,1)]) |> Expect.isFalse "" + IntMap.isProperSubmapOfBy (<) (IntMap.ofList [(1,1)]) (IntMap.ofList [(1,1);(2,2)]) |> Expect.isFalse "" } + + test "test isProperSubmapOf" { + IntMap.isProperSubmapOf (IntMap.ofList [(1,1)]) (IntMap.ofList [(1,1);(2,2)]) |> Expect.isTrue "" + IntMap.isProperSubmapOf (IntMap.ofList [(1,1);(2,2)]) (IntMap.ofList [(1,1);(2,2)]) |> Expect.isFalse "" + IntMap.isProperSubmapOf (IntMap.ofList [(1,1);(2,2)]) (IntMap.ofList [(1,1)]) |> Expect.isFalse "" } + + // Min/Max + + test "test findMin" { + IntMap.findMin (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" (3,"b") } + + test "test findMax" { + IntMap.findMax (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" (5,"a") } + + test "test deleteMin" { + IntMap.deleteMin (IntMap.ofList [(5,"a"); (3,"b"); (7,"c")]) |> Expect.equal "" (IntMap.ofList [(5,"a"); (7,"c")]) + IntMap.deleteMin IntMap.empty |> Expect.equal "" IntMap.empty } + + test "test deleteMax" { + IntMap.deleteMax (IntMap.ofList [(5,"a"); (3,"b"); (7,"c")]) |> Expect.equal "" (IntMap.ofList [(3,"b"); (5,"a")]) + IntMap.deleteMax IntMap.empty |> Expect.equal "" IntMap.empty } + + test "test deleteFindMin" { + IntMap.deleteFindMin (IntMap.ofList [(5,"a"); (3,"b"); (10,"c")]) |> Expect.equal "" ((3,"b"), IntMap.ofList [(5,"a"); (10,"c")]) } + + test "test deleteFindMax" { + IntMap.deleteFindMax (IntMap.ofList [(5,"a"); (3,"b"); (10,"c")]) |> Expect.equal "" ((10,"c"), IntMap.ofList [(3,"b"); (5,"a")]) } + + test "test updateMin" { + IntMap.updateMin (fun a -> Some ("X" + a)) (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" (IntMap.ofList [(3, "Xb"); (5, "a")]) + IntMap.updateMin (fun _ -> None) (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" (IntMap.singleton 5 "a") } + + test "test updateMax" { + IntMap.updateMax (fun a -> Some ("X" + a)) (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" (IntMap.ofList [(3, "b"); (5, "Xa")]) + IntMap.updateMax (fun _ -> None) (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" (IntMap.singleton 3 "b") } + + test "test updateMinWithKey" { + IntMap.updateMinWithKey (fun k a -> Some ((string k) + ":" + a)) (IntMap.ofList [(5,"a"); (3,"b")]) + |> Expect.equal "" (IntMap.ofList [(3,"3:b"); (5,"a")]) + IntMap.updateMinWithKey (fun _ _ -> None) (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" (IntMap.singleton 5 "a") } + + test "test updateMaxWithKey" { + IntMap.updateMaxWithKey (fun k a -> Some ((string k) + ":" + a)) (IntMap.ofList [(5,"a"); (3,"b")]) + |> Expect.equal "" (IntMap.ofList [(3,"b"); (5,"5:a")]) + IntMap.updateMaxWithKey (fun _ _ -> None) (IntMap.ofList [(5,"a"); (3,"b")]) + |> Expect.equal "" (IntMap.singleton 3 "b") } + + test "test minView" { + IntMap.minView (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" (Some ("b", IntMap.singleton 5 "a")) + IntMap.minView IntMap.empty |> Expect.isNone "" } + + test "test maxView" { + IntMap.maxView (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" (Some ("a", IntMap.singleton 3 "b")) + IntMap.maxView IntMap.empty |> Expect.isNone "" } + + test "test minViewWithKey" { + IntMap.minViewWithKey (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" (Some ((3,"b"), IntMap.singleton 5 "a")) + IntMap.minViewWithKey IntMap.empty |> Expect.isNone "" } + + test "test maxViewWithKey" { + IntMap.maxViewWithKey (IntMap.ofList [(5,"a"); (3,"b")]) |> Expect.equal "" (Some ((5,"a"), IntMap.singleton 3 "b")) + IntMap.maxViewWithKey IntMap.empty |> Expect.isNone "" } + ] -[] -let ``prop append and singleton``() = - registerGen.Force() - fsCheck (fun t k x -> IntMap.append (IntMap.singleton k x) t = IntMap.insert k x t) - -[] -let ``prop append and sum``() = - fsCheck <| fun xs ys -> - List.sum (IntMap.values (IntMap.appendWith (+) (IntMap.ofListWith (+) xs) (IntMap.ofListWith (+) ys))) - = List.sum (List.map snd xs) + List.sum (List.map snd ys) - -let except (xs: _ seq) ys = xs.Except(ys) -let intersect (xs: _ seq) ys = xs.Intersect(ys) - -[] -let ``prop difference``() = - fsCheck <| fun xs ys -> - List.sort (IntMap.keys (IntMap.difference (IntMap.ofListWith (+) xs) (IntMap.ofListWith (+) ys))) - = List.sort (List.ofSeq (except (Seq.distinct (List.map fst xs)) (Seq.distinct (List.map fst ys)))) - -[] -let ``prop intersection``() = - fsCheck <| fun xs ys -> - List.sort (IntMap.keys (IntMap.intersection (IntMap.ofListWith (+) xs) (IntMap.ofListWith (+) ys))) - = List.sort (List.ofSeq (Seq.distinct (intersect (List.map fst xs) (List.map fst ys)))) - -[] -let ``prop intersectionWith``() = - fsCheck <| fun (xs: (int * int) list) (ys: (int * int) list) -> - let xs' = Seq.distinctBy fst xs |> Seq.toList - let ys' = Seq.distinctBy fst ys |> Seq.toList - let f l r = l + 2 * r - IntMap.toList (IntMap.intersectionWith f (IntMap.ofList xs') (IntMap.ofList ys')) - = [ for (kx, vx) in List.sort xs' do for (ky, vy) in ys' do if kx = ky then yield (kx, f vx vy) ] - -[] -let ``prop intersectionWithKey``() = - fsCheck <| fun (xs: (int * int) list) (ys: (int * int) list) -> - let xs' = Seq.distinctBy fst xs |> Seq.toList - let ys' = Seq.distinctBy fst ys |> Seq.toList - let f k l r = k + 2 * l + 3 * r - IntMap.toList (IntMap.intersectionWithKey f (IntMap.ofList xs') (IntMap.ofList ys')) - = [ for (kx, vx) in List.sort xs' do for (ky, vy) in ys' do if kx = ky then yield (kx, f kx vx vy) ] - -let mapOption (f: 'a -> 'b option) l = List.foldBack (fun x xs -> match f x with Some v -> v::xs | None -> xs) l [] - -[] -let ``prop mergeWithKey``() = - fsCheck <| fun (xs: (int * int) list) (ys: (int * int) list) -> - let xs' = Seq.distinctBy fst xs |> Seq.toList - let ys' = Seq.distinctBy fst ys |> Seq.toList - let xm = IntMap.ofList xs' - let ym = IntMap.ofList ys' - - let emulateMergeWithKey f keep_x keep_y = - let combine k = - match (List.tryFind (fst >> (=) k) xs', List.tryFind (fst >> (=) k) ys') with - | (None, Some(_, y)) -> if keep_y then Some (k, y) else None - | (Some(_, x), None) -> if keep_x then Some (k, x) else None - | (Some(_, x), Some(_, y)) -> f k x y |> Option.map (fun v -> (k, v)) - | _ -> failwith "emulateMergeWithKey: combine" - mapOption combine (List.sort (List.ofSeq (Seq.distinct (List.append (List.map fst xs') (List.map fst ys'))))) - - let testMergeWithKey f keep_x keep_y = - let keep b m = match b with | false -> IntMap.empty | true -> m - IntMap.toList (IntMap.mergeWithKey f (keep keep_x) (keep keep_y) xm ym) = emulateMergeWithKey f keep_x keep_y + [] + let testIntMapProperties = + + let except (xs: _ seq) ys = xs.Except(ys) + let intersect (xs: _ seq) ys = xs.Intersect(ys) + let mapOption (f: 'a -> 'b option) l = List.foldBack (fun x xs -> match f x with Some v -> v::xs | None -> xs) l [] + + testList "Experimental IntMap Properties" [ + + testPropertyWithConfig config10k "prop singleton" <| + fun k x -> IntMap.insert k x IntMap.empty = IntMap.singleton k x + + testPropertyWithConfig config10k "prop insert and tryFind" <| + fun k t -> IntMap.tryFind k (IntMap.insert k () t) <> None + + testPropertyWithConfig config10k "prop insert and delete" <| + fun k t -> IntMap.tryFind k t = None ==> (IntMap.delete k (IntMap.insert k () t) = t) + + testPropertyWithConfig config10k "prop delete non member" <| + fun k t -> IntMap.tryFind k t = None ==> (IntMap.delete k t = t) + + testPropertyWithConfig config10k "prop append" <| + fun xs ys -> + List.sort (IntMap.keys (IntMap.append (IntMap.ofList xs) (IntMap.ofList ys))) + = List.sort (List.ofSeq (Seq.distinct (List.append (List.map fst xs) (List.map fst ys)))) + + testPropertyWithConfig config10k "prop append and singleton" <| + fun t k x -> IntMap.append (IntMap.singleton k x) t = IntMap.insert k x t + + testPropertyWithConfig config10k "prop append and sum" <| + fun xs ys -> + List.sum (IntMap.values (IntMap.appendWith (+) (IntMap.ofListWith (+) xs) (IntMap.ofListWith (+) ys))) + = List.sum (List.map snd xs) + List.sum (List.map snd ys) + + testPropertyWithConfig config10k "prop difference" <| + fun xs ys -> + List.sort (IntMap.keys (IntMap.difference (IntMap.ofListWith (+) xs) (IntMap.ofListWith (+) ys))) + = List.sort (List.ofSeq (except (Seq.distinct (List.map fst xs)) (Seq.distinct (List.map fst ys)))) + + testPropertyWithConfig config10k "prop intersection" <| + fun xs ys -> + List.sort (IntMap.keys (IntMap.intersection (IntMap.ofListWith (+) xs) (IntMap.ofListWith (+) ys))) + = List.sort (List.ofSeq (Seq.distinct (intersect (List.map fst xs) (List.map fst ys)))) + + testPropertyWithConfig config10k "prop intersectionWith" <| + fun (xs: (int * int) list) (ys: (int * int) list) -> + let xs' = Seq.distinctBy fst xs |> Seq.toList + let ys' = Seq.distinctBy fst ys |> Seq.toList + let f l r = l + 2 * r + IntMap.toList (IntMap.intersectionWith f (IntMap.ofList xs') (IntMap.ofList ys')) + = [ for (kx, vx) in List.sort xs' do for (ky, vy) in ys' do if kx = ky then yield (kx, f vx vy) ] + + testPropertyWithConfig config10k "prop intersectionWithKey" <| + fun (xs: (int * int) list) (ys: (int * int) list) -> + let xs' = Seq.distinctBy fst xs |> Seq.toList + let ys' = Seq.distinctBy fst ys |> Seq.toList + let f k l r = k + 2 * l + 3 * r + IntMap.toList (IntMap.intersectionWithKey f (IntMap.ofList xs') (IntMap.ofList ys')) + = [ for (kx, vx) in List.sort xs' do for (ky, vy) in ys' do if kx = ky then yield (kx, f kx vx vy) ] + + testPropertyWithConfig config10k "prop mergeWithKey" <| + fun (xs: (int * int) list) (ys: (int * int) list) -> + let xs' = Seq.distinctBy fst xs |> Seq.toList + let ys' = Seq.distinctBy fst ys |> Seq.toList + let xm = IntMap.ofList xs' + let ym = IntMap.ofList ys' + + let emulateMergeWithKey f keep_x keep_y = + let combine k = + match (List.tryFind (fst >> (=) k) xs', List.tryFind (fst >> (=) k) ys') with + | (None, Some(_, y)) -> if keep_y then Some (k, y) else None + | (Some(_, x), None) -> if keep_x then Some (k, x) else None + | (Some(_, x), Some(_, y)) -> f k x y |> Option.map (fun v -> (k, v)) + | _ -> failwith "emulateMergeWithKey: combine" + mapOption combine (List.sort (List.ofSeq (Seq.distinct (List.append (List.map fst xs') (List.map fst ys'))))) + + let testMergeWithKey f keep_x keep_y = + let keep b m = match b with | false -> IntMap.empty | true -> m + IntMap.toList (IntMap.mergeWithKey f (keep keep_x) (keep keep_y) xm ym) = emulateMergeWithKey f keep_x keep_y - List.forall id [ for f in - [ (fun _ x1 _ -> Some x1); - (fun _ _ x2 -> Some x2); - (fun _ _ _ -> None); - (fun k x1 x2 -> if k % 2 = 0 then None else Some (2 * x1 + 3 * x2)) - ] do - for keep_x in [ true; false ] do - for keep_y in [ true; false ] do yield testMergeWithKey f keep_x keep_y + List.forall id [ for f in + [ (fun _ x1 _ -> Some x1); + (fun _ _ x2 -> Some x2); + (fun _ _ _ -> None); + (fun k x1 x2 -> if k % 2 = 0 then None else Some (2 * x1 + 3 * x2)) + ] do + for keep_x in [ true; false ] do + for keep_y in [ true; false ] do yield testMergeWithKey f keep_x keep_y + ] + + testPropertyWithConfig config10k "prop list" <| + fun (xs: int list) -> + List.sort (List.ofSeq (Seq.distinct xs)) = [ for (x,()) in IntMap.toList (IntMap.ofList [ for x in xs do yield (x,()) ]) do yield x ] + + testPropertyWithConfig config10k "prop alter" <| + fun t k -> + let f = function | Some () -> None | None -> Some () + let t' = IntMap.alter f k t + match IntMap.tryFind k t with + | Some _ -> IntMap.size t - 1 = IntMap.size t' && IntMap.tryFind k t' = None + | None -> IntMap.size t + 1 = IntMap.size t' && IntMap.tryFind k t' <> None + + testPropertyWithConfig config10k "prop isEmpty" <| + fun m -> IntMap.isEmpty m = (IntMap.size m = 0) + + testPropertyWithConfig config10k "prop exists" <| + fun xs n -> + let m = IntMap.ofList (List.zip xs xs) + List.forall (fun k -> IntMap.exists k m = List.exists ((=) k) xs) (n::xs) + + testPropertyWithConfig config10k "prop notExists" <| + fun xs n -> + let m = IntMap.ofList (List.zip xs xs) + List.forall (fun k -> IntMap.notExists k m = not (List.exists ((=) k) xs)) (n::xs) + + testPropertyWithConfig config10k "implements IEnumerable 1" <| + fun xs -> + let xs = List.zip xs xs + let map = IntMap.ofList xs + let a = map :> _ seq |> Seq.toList + set xs = set a + + testPropertyWithConfig config10k "implements IEnumerable 2" <| + fun xs -> + let xs = List.zip xs xs + let map = IntMap.ofList xs + let a = map :> _ seq |> Seq.toList + a.Length = (List.length (List.ofSeq (Seq.distinct xs))) + + //testPropertyWithConfig config10k "functor laws" <| + // let fmap = IntMap.map + // let n = sprintf "IntMap : functor %s" + // NUnit.fsCheck (n "preserves identity") <| + // fun value -> fmap id value = value + // NUnit.fsCheck (n "preserves composition") <| + // fun f g value -> fmap (f << g) value = (fmap f << fmap g) value ] - -[] -let ``prop list``() = - fsCheck <| fun (xs: int list) -> - List.sort (List.ofSeq (Seq.distinct xs)) = [ for (x,()) in IntMap.toList (IntMap.ofList [ for x in xs do yield (x,()) ]) do yield x ] - -[] -let ``prop alter``() = - fsCheck <| fun t k -> - let f = function | Some () -> None | None -> Some () - let t' = IntMap.alter f k t - match IntMap.tryFind k t with - | Some _ -> IntMap.size t - 1 = IntMap.size t' && IntMap.tryFind k t' = None - | None -> IntMap.size t + 1 = IntMap.size t' && IntMap.tryFind k t' <> None - -[] -let ``prop isEmpty``() = - registerGen.Force() - fsCheck (fun m -> IntMap.isEmpty m = (IntMap.size m = 0)) - -[] -let ``prop exists``() = - fsCheck <| fun xs n -> - let m = IntMap.ofList (List.zip xs xs) - List.forall (fun k -> IntMap.exists k m = List.exists ((=) k) xs) (n::xs) - -[] -let ``prop notExists``() = - fsCheck <| fun xs n -> - let m = IntMap.ofList (List.zip xs xs) - List.forall (fun k -> IntMap.notExists k m = not (List.exists ((=) k) xs)) (n::xs) - -[] -let ``implements IEnumerable``() = - fsCheck <| fun xs -> - let xs = List.zip xs xs - let map = IntMap.ofList xs - let a = map :> _ seq |> Seq.toList - set xs = set a && a.Length = List.length (List.ofSeq (Seq.distinct xs)) - -[] -let ``functor laws``() = - registerGen.Force() - let fmap = IntMap.map - let n = sprintf "IntMap : functor %s" - NUnit.fsCheck (n "preserves identity") <| - fun value -> fmap id value = value - NUnit.fsCheck (n "preserves composition") <| - fun f g value -> fmap (f << g) value = (fmap f << fmap g) value diff --git a/tests/FSharpx.Collections.Experimental.Tests/LeftistHeapTest.fs b/tests/FSharpx.Collections.Experimental.Tests/LeftistHeapTest.fs index b33dbda0..349551e3 100644 --- a/tests/FSharpx.Collections.Experimental.Tests/LeftistHeapTest.fs +++ b/tests/FSharpx.Collections.Experimental.Tests/LeftistHeapTest.fs @@ -1,189 +1,185 @@ -module FSharpx.Collections.Experimental.Tests.LeftistHeapTest +namespace FSharpx.Collections.Experimental.Tests open FSharpx.Collections open FSharpx.Collections.Experimental -open FSharpx.Collections.Experimental.LeftistHeap -open FSharpx.Collections.Tests.Properties -open NUnit.Framework +open Properties open FsCheck -open FsCheck.NUnit -open FsUnit +open Expecto +open Expecto.Flip open HeapGen //only going up to 5 elements is probably sufficient to test all edge cases -(* -Could not get IHeap<'c, 'a when 'c :> IHeap<'c, 'a> and 'a : comparison> interface working smoothly between shared code, -NUnit TestCaseSource(), FsCheck, and trying to pass around the tuple of heap generator and list. So need individual test -file for each heap type, unlike IQueue. - -Even restricting only to this type, never got generic element type 'a to work. Need separate tests for int and string. -*) - -// NUnit TestCaseSource does not understand array of tuples at runtime -let intGens start = - let v = Array.create 6 (box (maxLeftistHeapIntGen, "max LeftistHeap int")) - v.[1] <- box ((maxLeftistHeapIntOfSeqGen |> Gen.suchThat (fun (q, l) -> l.Length >= start)), "max LeftistHeap OfSeq") - v.[2] <- box ((maxLeftistHeapIntInsertGen |> Gen.suchThat (fun (q, l) -> l.Length >= start)), "max LeftistHeap from Insert") - v.[3] <- box (minLeftistHeapIntGen , "min LeftistHeap int") - v.[4] <- box ((minLeftistHeapIntOfSeqGen |> Gen.suchThat (fun (q, l) -> l.Length >= start)), "min LeftistHeap OfSeq") - v.[5] <- box ((minLeftistHeapIntInsertGen |> Gen.suchThat (fun (q, l) -> l.Length >= start)), "min LeftistHeap from Insert") - v +module LeftistHeapTest = -let stringGens = - let v = Array.create 2 (box (maxLeftistHeapStringGen, "max LeftistHeap string")) - v.[1] <- box (minLeftistHeapStringGen, "min LeftistHeap string") - v - -let intGensStart1 = - intGens 1 //this will accept all - -let intGensStart2 = - intGens 2 // this will accept 11 out of 12 - -[] -let ``cons pattern discriminator``() = - let h = ofSeq true ["f";"e";"d";"c";"b";"a"] - let h1, t1 = uncons h - - let h2, t2 = - match t1 with - | Cons(h, t) -> h, t - | _ -> "x", t1 - - ((h2 = "e") && ((length t2) = 4)) |> should equal true - -[] -let ``cons pattern discriminator 2``() = - let h = ofSeq true ["f";"e";"d";"c";"b";"a"] - - let t2 = - match h with - | Cons("f", Cons(_, t)) -> t - | _ -> h - - let h1, t3 = uncons t2 - - ((h1 = "d") && ((length t2) = 4)) |> should equal true - -[] -let ``empty list should be empty``() = - (LeftistHeap.empty true).IsEmpty |> should equal true - -[] -[] -let ``head should return``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun ((h : LeftistHeap), (l : int list)) -> - (h.Head = l.Head) - |> classifyCollect h h.Length)) - -[] -let ``IHeap insert works``() = - let h = empty true |> insert "a" |> insert "b" |> insert "c" |> insert "d" |> insert "e" |> insert "f" |> insert "g" |> insert "h" |> insert "i" |> insert "j" - ((h :> IHeap<_, string>).Insert "zz").Head |> should equal "zz" - -[] -let ``insert works``() = - (((LeftistHeap.empty true).Insert 1).Insert 2).IsEmpty |> should equal false - -[] -let ``seq enumerate matches build list``() = - - fsCheck "maxLeftistHeap" (Prop.forAll (Arb.fromGen maxLeftistHeapIntGen) - (fun (h, l) -> h |> List.ofSeq = l |> classifyCollect h h.Length)) - - fsCheck "minLeftistHeap" (Prop.forAll (Arb.fromGen minLeftistHeapIntGen) - (fun (h, l) -> h |> List.ofSeq = l |> classifyCollect h h.Length)) - -[] -let ``length of empty is 0``() = - (LeftistHeap.empty true).Length |> should equal 0 - -[] -[] -let ``seq enumerate matches build list int``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun (h : LeftistHeap, l) -> h |> Seq.toList = l |> classifyCollect h h.Length)) - -[] -[] -let ``seq enumerate matches build list string``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun (h : LeftistHeap, l) -> h |> Seq.toList = l |> classifyCollect h h.Length)) - -[] -let ``structure pattern match and merge``() = - let h = ofSeq true ["f";"e";"d";"c";"b";"a"] - - let x, h1, h2 = - match h with - | LeftistHeap.T(_, _, _, x', h1', h2') -> x', h1', h2' - | _ -> "zz", h, h - - let h3 = merge h1 h2 - - let x2, t3 = uncons h3 - - ((x = "f") && (x2 = "e") && ((length t3) = 4)) |> should equal true - -[] -[] -let ``tail should return``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun ((h : LeftistHeap), (l : int list)) -> - let tl = h.Tail() - let tlHead = - if (tl.Length > 0) then (tl.Head = l.Item(1)) - else true - (tlHead && (tl.Length = (l.Length - 1))) - |> classifyCollect h h.Length)) - -[] -let ``tryGetHead on empty should return None``() = - (LeftistHeap.empty true).TryGetHead |> should equal None - -[] -[] -let ``tryGetHead should return``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun ((h : LeftistHeap), (l : int list)) -> - (h.TryGetHead.Value = l.Head) - |> classifyCollect h h.Length)) - -[] -let ``tryGetTail on empty should return None``() = - (LeftistHeap.empty true).TryGetTail() |> should equal None - -[] -let ``tryGetTail on len 1 should return Some empty``() = - (LeftistHeap.empty true |> insert 1 |> tryGetTail).Value |> isEmpty |> should equal true - -[] -let ``tryMerge max and mis should be None``() = - let h1 = ofSeq true ["f";"e";"d";"c";"b";"a"] - let h2 = ofSeq false ["t";"u";"v";"w";"x";"y";"z"] - - tryMerge h1 h2 |> should equal None - -[] -[] -let ``tryUncons 1 element``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun ((h : LeftistHeap), (l : int list)) -> - let x, tl = h.TryUncons().Value - ((x = l.Head) && (tl.Length = (l.Length - 1))) - |> classifyCollect h h.Length)) - -[] -let ``tryUncons empty``() = - (LeftistHeap.empty true).TryUncons() |> should equal None - -[] -[] -let ``uncons 1 element``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun ((h : LeftistHeap), (l : int list)) -> - let x, tl = h.Uncons() - ((x = l.Head) && (tl.Length = (l.Length - 1))) - |> classifyCollect h h.Length)) \ No newline at end of file + let intGens start = + let v = Array.create 6 (box (maxLeftistHeapIntGen, "max LeftistHeap int")) + v.[1] <- box ((maxLeftistHeapIntOfSeqGen |> Gen.filter (fun (q, l) -> l.Length >= start)), "max LeftistHeap OfSeq") + v.[2] <- box ((maxLeftistHeapIntInsertGen |> Gen.filter (fun (q, l) -> l.Length >= start)), "max LeftistHeap from Insert") + v.[3] <- box (minLeftistHeapIntGen , "min LeftistHeap int") + v.[4] <- box ((minLeftistHeapIntOfSeqGen |> Gen.filter (fun (q, l) -> l.Length >= start)), "min LeftistHeap OfSeq") + v.[5] <- box ((minLeftistHeapIntInsertGen |> Gen.filter (fun (q, l) -> l.Length >= start)), "min LeftistHeap from Insert") + v + + let stringGens = + let v = Array.create 2 (box (maxLeftistHeapStringGen, "max LeftistHeap string")) + v.[1] <- box (minLeftistHeapStringGen, "min LeftistHeap string") + v + + let intGensStart1 = + intGens 1 //this will accept all + + let intGensStart2 = + intGens 2 // this will accept 11 out of 12 + + [] + let testLeftistHeap = + + testList "Experimental LeftistHeap" [ + //[] + //test "cons pattern discriminator" { + // let h = ofSeq true ["f";"e";"d";"c";"b";"a"] + // let h1, t1 = uncons h + + // let h2, t2 = + // match t1 with + // | Cons(h, t) -> h, t + // | _ -> "x", t1 + + // ((h2 = "e") && ((length t2) = 4)) |> Expect.isTrue "" } + + //[] + //test "cons pattern discriminator 2" { + // let h = ofSeq true ["f";"e";"d";"c";"b";"a"] + + // let t2 = + // match h with + // | Cons("f", Cons(_, t)) -> t + // | _ -> h + + // let h1, t3 = uncons t2 + + // ((h1 = "d") && ((length t2) = 4)) |> Expect.isTrue "" } + + //[] + //test "empty list should be empty" { + // (LeftistHeap.empty true).IsEmpty |> Expect.isTrue "" } + + //[] + //[] + //test "head should return``(x : obj) = + // let genAndName = unbox x + // fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun ((h : LeftistHeap), (l : int list)) -> + // (h.Head = l.Head) + // |> classifyCollect h h.Length)) + + //[] + //test "IHeap insert works" { + // let h = empty true |> insert "a" |> insert "b" |> insert "c" |> insert "d" |> insert "e" |> insert "f" |> insert "g" |> insert "h" |> insert "i" |> insert "j" + // ((h :> IHeap<_, string>).Insert "zz").Head |> Expect.equal "" "zz" } + + //[] + //test "insert works" { + // (((LeftistHeap.empty true).Insert 1).Insert 2).IsEmpty |> Expect.isFalse "" } + + //[] + //test "seq enumerate matches build list" { + + // fsCheck "maxLeftistHeap" (Prop.forAll (Arb.fromGen maxLeftistHeapIntGen) + // (fun (h, l) -> h |> List.ofSeq = l |> classifyCollect h h.Length)) + + // fsCheck "minLeftistHeap" (Prop.forAll (Arb.fromGen minLeftistHeapIntGen) + // (fun (h, l) -> h |> List.ofSeq = l |> classifyCollect h h.Length)) + + //[] + //test "length of empty is 0" { + // (LeftistHeap.empty true).Length |> Expect.equal "" } 0 + + //[] + //[] + //test "seq enumerate matches build list int``(x : obj) = + // let genAndName = unbox x + // fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun (h : LeftistHeap, l) -> h |> Seq.toList = l |> classifyCollect h h.Length)) + + //[] + //[] + //test "seq enumerate matches build list string``(x : obj) = + // let genAndName = unbox x + // fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun (h : LeftistHeap, l) -> h |> Seq.toList = l |> classifyCollect h h.Length)) + + //[] + //test "structure pattern match and merge" { + // let h = ofSeq true ["f";"e";"d";"c";"b";"a"] + + // let x, h1, h2 = + // match h with + // | LeftistHeap.T(_, _, _, x', h1', h2') -> x', h1', h2' + // | _ -> "zz", h, h + + // let h3 = merge h1 h2 + + // let x2, t3 = uncons h3 + + // ((x = "f") && (x2 = "e") && ((length t3) = 4)) |> Expect.isTrue "" } + + //[] + //[] + //test "tail should return``(x : obj) = + // let genAndName = unbox x + // fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun ((h : LeftistHeap), (l : int list)) -> + // let tl = h.Tail() + // let tlHead = + // if (tl.Length > 0) then (tl.Head = l.Item(1)) + // else true + // (tlHead && (tl.Length = (l.Length - 1))) + // |> classifyCollect h h.Length)) + + //[] + //test "tryGetHead on empty should return None" { + // (LeftistHeap.empty true).TryGetHead |> Expect.isNone "" } + + //[] + //[] + //test "tryGetHead should return``(x : obj) = + // let genAndName = unbox x + // fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun ((h : LeftistHeap), (l : int list)) -> + // (h.TryGetHead.Value = l.Head) + // |> classifyCollect h h.Length)) + + //[] + //test "tryGetTail on empty should return None" { + // (LeftistHeap.empty true).TryGetTail() |> Expect.isNone "" } + + //[] + //test "tryGetTail on len 1 should return Some empty" { + // (LeftistHeap.empty true |> insert 1 |> tryGetTail).Value |> isEmpty |> Expect.isTrue "" } + + //[] + //test "tryMerge max and mis should be None" { + // let h1 = ofSeq true ["f";"e";"d";"c";"b";"a"] + // let h2 = ofSeq false ["t";"u";"v";"w";"x";"y";"z"] + + // tryMerge h1 h2 |> Expect.isNone "" } + + //[] + //[] + //test "tryUncons 1 element``(x : obj) = + // let genAndName = unbox x + // fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun ((h : LeftistHeap), (l : int list)) -> + // let x, tl = h.TryUncons().Value + // ((x = l.Head) && (tl.Length = (l.Length - 1))) + // |> classifyCollect h h.Length)) + + //[] + //test "tryUncons empty" { + // (LeftistHeap.empty true).TryUncons() |> Expect.isNone "" } + + //[] + //[] + //test "uncons 1 element``(x : obj) = + // let genAndName = unbox x + // fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun ((h : LeftistHeap), (l : int list)) -> + // let x, tl = h.Uncons() + // ((x = l.Head) && (tl.Length = (l.Length - 1))) + // |> classifyCollect h h.Length)) + ] \ No newline at end of file diff --git a/tests/FSharpx.Collections.Experimental.Tests/ListZipperTest.fs b/tests/FSharpx.Collections.Experimental.Tests/ListZipperTest.fs index 9bc979f5..5787eb2b 100644 --- a/tests/FSharpx.Collections.Experimental.Tests/ListZipperTest.fs +++ b/tests/FSharpx.Collections.Experimental.Tests/ListZipperTest.fs @@ -1,29 +1,31 @@ -module FSharpx.Collections.Experimental.Tests.ListZipperTest +namespace FSharpx.Collections.Experimental.Tests -open FSharpx open FSharpx.Collections.Experimental -open FSharpx.Collections.Experimental.ListZipper -open NUnit.Framework +open Expecto +open Expecto.Flip -let chars = ['a'..'z'] -let digits = ['0'..'9'] +module ListZipperTest = -[] -let ``Can move forward``() = - let z = chars |> zipper |> forward |> forward - Assert.AreEqual(focus z,'c') + let chars = ['a'..'z'] + let digits = ['0'..'9'] -[] -let ``Can move back``() = - let z = chars |> zipper |> forward |> forward |> back - Assert.AreEqual(focus z,'b') + [] + let testListZipper = -[] -let ``Can move to the front``() = - let z = chars |> zipper |> forward |> forward |> front - Assert.AreEqual(focus z,'a') + testList "Experimental ListZipper" [ + test "Can move forward" { + let z = chars |> ListZipper.zipper |> ListZipper.forward |> ListZipper.forward + Expect.equal "" 'c' <| ListZipper.focus z } -[] -let ``Can modify an element``() = - let z = chars |> zipper |> forward |> forward |> modify 'e' |> back |> forward - Assert.AreEqual(focus z,'e') \ No newline at end of file + test "Can move back" { + let z = chars |> ListZipper.zipper |> ListZipper.forward |> ListZipper.forward |> ListZipper.back + Expect.equal "" 'b' <| ListZipper.focus z } + + test "Can move to the front" { + let z = chars |> ListZipper.zipper |> ListZipper.forward |> ListZipper.forward |> ListZipper.front + Expect.equal "" 'a' <| ListZipper.focus z } + + test "Can modify an element" { + let z = chars |> ListZipper.zipper |> ListZipper.forward |> ListZipper.forward |> ListZipper.modify 'e' |> ListZipper.back |> ListZipper.forward + Expect.equal "" 'e' <| ListZipper.focus z } + ] \ No newline at end of file diff --git a/tests/FSharpx.Collections.Experimental.Tests/NonEmptyListTests.fs b/tests/FSharpx.Collections.Experimental.Tests/NonEmptyListTests.fs index 56ac5923..b16501c5 100644 --- a/tests/FSharpx.Collections.Experimental.Tests/NonEmptyListTests.fs +++ b/tests/FSharpx.Collections.Experimental.Tests/NonEmptyListTests.fs @@ -1,148 +1,137 @@ -module FSharpx.NonEmptyListTests +namespace FSharpx.Collections.Experimental.Tests open FSharpx.Collections -open NUnit.Framework open FsCheck -open FsCheck.NUnit - -type NonEmptyListGen = - static member NonEmptyList() = - gen.Return NonEmptyList.create - |> Gen.ap Arb.generate - |> Gen.ap (Arb.generate |> Gen.suchThat (fun l -> l.Length < 10)) - |> Arb.fromGen - -let registerGen = lazy (Arb.register() |> ignore) - -[] -let ``functor laws``() = - registerGen.Force() - let n = sprintf "NonEmptyList : functor %s" - let map = NonEmptyList.map - fsCheck (n "preserves identity") <| - fun value -> map id value = value - fsCheck (n "preserves composition") <| - fun f g value -> map (f << g) value = (map f << map g) value - -[] -let ``monad laws``() = - registerGen.Force() - let ret (x: int) = NonEmptyList.singleton x - let n = sprintf "NonEmptyList : monad %s" - let inline (>>=) m f = NonEmptyList.collect f m - fsCheck "left identity" <| - fun f a -> ret a >>= f = f a - fsCheck "right identity" <| - fun x -> x >>= ret = x - fsCheck "associativity" <| - fun f g v -> - let a = (v >>= f) >>= g - let b = v >>= (fun x -> f x >>= g) - a = b - -let fsCheck t = fsCheck "" t - -[] -let ``toList gives non-empty list``() = - fsCheck (fun nel -> NonEmptyList.toList nel |> List.length > 0) - -[] -let ``toArray gives non-empty array``() = - fsCheck (fun nel -> NonEmptyList.toArray nel |> Array.length > 0) - -[] -let ``toList is same length as non-empty list`` () = - fsCheck (fun nel -> NonEmptyList.toList nel |> List.length = nel.Length) - -[] -let ``toArray is same length as non-empty list`` () = - fsCheck (fun nel -> NonEmptyList.toArray nel |> Array.length = nel.Length) - -[] -let ofArray () = - fsCheck <| fun arr -> - try Seq.forall2 (=) (NonEmptyList.ofArray arr) arr - with :? System.ArgumentException -> arr.Length = 0 - -[] -let ofList () = - fsCheck <| fun l -> - try Seq.forall2 (=) (NonEmptyList.ofList l) l - with :? System.ArgumentException -> l = [] - -[] -let ofSeq () = - let ArbitrarySeq = - gen { - let! len = Gen.choose (0, 10) - let! l = Gen.listOfLength len Arb.generate - return seq { for i = 0 to len - 1 do yield l.[i] } - } |> Arb.fromGen - fsCheck <| Prop.forAll ArbitrarySeq (fun s -> - try Seq.forall2 (=) (NonEmptyList.ofSeq s) s - with :? System.ArgumentException -> Seq.isEmpty s) - -[] -let ``reverse . reverse = id`` () = - fsCheck (fun nel -> (NonEmptyList.rev << NonEmptyList.rev) nel = nel) - -[] -let ``last . reverse = head``() = - fsCheck (fun nel -> (NonEmptyList.last << NonEmptyList.rev) nel = NonEmptyList.head nel) - -[] -let ``head . reverse = last``() = - fsCheck (fun nel -> (NonEmptyList.head << NonEmptyList.rev) nel = NonEmptyList.last nel) - -[] -let ``last is last and never fails``() = - fsCheck <| fun nel -> - let actualLast = NonEmptyList.last nel - let expectedLast = - let l = NonEmptyList.toList nel - l.[l.Length-1] - expectedLast = actualLast - -[] -let ``append has combined length``() = - fsCheck <| fun (a: _ list) (b: _ list) -> - if a.IsEmpty || b.IsEmpty then - // we don't test non-empty lists here. - true - else - let neA = NonEmptyList.create a.Head a.Tail - let neB = NonEmptyList.create b.Head b.Tail - (NonEmptyList.append neA neB).Length = neA.Length + neB.Length - -[] -let reduce() = - fsCheck <| fun nel -> - let actual = NonEmptyList.reduce (+) nel - let expected = nel |> NonEmptyList.toList |> List.sum - expected = actual - -[] -let zip() = - let EqualLengthNELGen = - gen { - let! a = NonEmptyListGen.NonEmptyList().Generator - let! b = Gen.listOfLength a.Length Arb.generate - |> Gen.map (fun l -> NonEmptyList.create (List.head l) (List.tail l)) - return a, b - } |> Arb.fromGen - - fsCheck <| Prop.forAll EqualLengthNELGen (fun (nel1, nel2) -> - let actual = NonEmptyList.zip nel1 nel2 |> NonEmptyList.toList - let expected = List.zip <| NonEmptyList.toList nel1 - <| NonEmptyList.toList nel2 - expected = actual) - -[] -let ``zip on lists with different lengths raises an exception``()= - fsCheck <| fun nel1 nel2 -> - try - NonEmptyList.zip nel1 nel2 |> ignore - nel1.Length = nel2.Length - with :? System.ArgumentException -> - nel1.Length <> nel2.Length - +open Expecto +open Expecto.Flip + +module NonEmptyListTests = + + //type NonEmptyListGen = + // static member NonEmptyList() = + // gen.Return NonEmptyList.create + // |> Gen.ap Arb.generate + // |> Gen.ap (Arb.generate |> Gen.filter (fun l -> l.Length < 10)) + // |> Arb.fromGen + + //let registerGen = lazy (Arb.register() |> ignore) + + [] + let testNonEmptyList = + + testList "Experimental NonEmptyList" [ + //test "functor laws" { + // registerGen.Force() + // let n = sprintf "NonEmptyList : functor %s" + // let map = NonEmptyList.map + // fsCheck (n "preserves identity") <| + // fun value -> map id value = value + // fsCheck (n "preserves composition") <| + // fun f g value -> map (f << g) value = (map f << map g) value + + //test "monad laws" { + // registerGen.Force() + // let ret (x: int) = NonEmptyList.singleton x + // let n = sprintf "NonEmptyList : monad %s" + // let inline (>>=) m f = NonEmptyList.collect f m + // fsCheck "left identity" <| + // fun f a -> ret a >>= f = f a + // fsCheck "right identity" <| + // fun x -> x >>= ret = x + // fsCheck "associativity" <| + // fun f g v -> + // let a = (v >>= f) >>= g + // let b = v >>= (fun x -> f x >>= g) + // a = b + + //let fsCheck t = fsCheck "" t + + //test "toList gives non-empty list" { + // fsCheck (fun nel -> NonEmptyList.toList nel |> List.length > 0) + + //test "toArray gives non-empty array" { + // fsCheck (fun nel -> NonEmptyList.toArray nel |> Array.length > 0) + + //test "toList is same length as non-empty list`` () = + // fsCheck (fun nel -> NonEmptyList.toList nel |> List.length = nel.Length) + + //test "toArray is same length as non-empty list`` () = + // fsCheck (fun nel -> NonEmptyList.toArray nel |> Array.length = nel.Length) + + //let ofArray () = + // fsCheck <| fun arr -> + // try Seq.forall2 (=) (NonEmptyList.ofArray arr) arr + // with :? System.ArgumentException -> arr.Length = 0 + + //let ofList () = + // fsCheck <| fun l -> + // try Seq.forall2 (=) (NonEmptyList.ofList l) l + // with :? System.ArgumentException -> l = [] + + //let ofSeq () = + // let ArbitrarySeq = + // gen { + // let! len = Gen.choose (0, 10) + // let! l = Gen.listOfLength len Arb.generate + // return seq { for i = 0 to len - 1 do yield l.[i] } + // } |> Arb.fromGen + // fsCheck <| Prop.forAll ArbitrarySeq (fun s -> + // try Seq.forall2 (=) (NonEmptyList.ofSeq s) s + // with :? System.ArgumentException -> Seq.isEmpty s) + + //test "reverse . reverse = id`` () = + // fsCheck (fun nel -> (NonEmptyList.rev << NonEmptyList.rev) nel = nel) + + //test "last . reverse = head" { + // fsCheck (fun nel -> (NonEmptyList.last << NonEmptyList.rev) nel = NonEmptyList.head nel) + + //test "head . reverse = last" { + // fsCheck (fun nel -> (NonEmptyList.head << NonEmptyList.rev) nel = NonEmptyList.last nel) + + //test "last is last and never fails" { + // fsCheck <| fun nel -> + // let actualLast = NonEmptyList.last nel + // let expectedLast = + // let l = NonEmptyList.toList nel + // l.[l.Length-1] + // expectedLast = actualLast + + //test "append has combined length" { + // fsCheck <| fun (a: _ list) (b: _ list) -> + // if a.IsEmpty || b.IsEmpty then + // // we don't test non-empty lists here. + // true + // else + // let neA = NonEmptyList.create a.Head a.Tail + // let neB = NonEmptyList.create b.Head b.Tail + // (NonEmptyList.append neA neB).Length = neA.Length + neB.Length + + //let reduce() = + // fsCheck <| fun nel -> + // let actual = NonEmptyList.reduce (+) nel + // let expected = nel |> NonEmptyList.toList |> List.sum + // expected = actual + + //let zip() = + // let EqualLengthNELGen = + // gen { + // let! a = NonEmptyListGen.NonEmptyList().Generator + // let! b = Gen.listOfLength a.Length Arb.generate + // |> Gen.map (fun l -> NonEmptyList.create (List.head l) (List.tail l)) + // return a, b + // } |> Arb.fromGen + + // fsCheck <| Prop.forAll EqualLengthNELGen (fun (nel1, nel2) -> + // let actual = NonEmptyList.zip nel1 nel2 |> NonEmptyList.toList + // let expected = List.zip <| NonEmptyList.toList nel1 + // <| NonEmptyList.toList nel2 + // expected = actual) + + //test "zip on lists with different lengths raises an exception``()= + // fsCheck <| fun nel1 nel2 -> + // try + // NonEmptyList.zip nel1 nel2 |> ignore + // nel1.Length = nel2.Length + // with :? System.ArgumentException -> + // nel1.Length <> nel2.Length + ] diff --git a/tests/FSharpx.Collections.Experimental.Tests/PairingHeapTest.fs b/tests/FSharpx.Collections.Experimental.Tests/PairingHeapTest.fs index bd4bb2ae..c9871625 100644 --- a/tests/FSharpx.Collections.Experimental.Tests/PairingHeapTest.fs +++ b/tests/FSharpx.Collections.Experimental.Tests/PairingHeapTest.fs @@ -1,13 +1,11 @@ -module FSharpx.Collections.Experimental.Tests.PairingHeapTest +namespace FSharpx.Collections.Experimental.Tests open FSharpx open FSharpx.Collections.Experimental -open FSharpx.Collections.Experimental.PairingHeap -open FSharpx.Collections.Tests.Properties -open NUnit.Framework +open Properties open FsCheck -open FsCheck.NUnit -open FsUnit +open Expecto +open Expecto.Flip open HeapGen //only going up to 5 elements is probably sufficient to test all edge cases @@ -21,149 +19,139 @@ Even restricting only to this type, never got generic element type 'a to work. N *) // NUnit TestCaseSource does not understand array of tuples at runtime -let intGens start = - let v = Array.create 6 (box (maxPairingHeapIntGen, "max PairingHeap int")) - v.[1] <- box ((maxPairingHeapIntOfSeqGen |> Gen.suchThat (fun (q, l) -> l.Length >= start)), "max PairingHeap OfSeq") - v.[2] <- box ((maxPairingHeapIntInsertGen |> Gen.suchThat (fun (q, l) -> l.Length >= start)), "max PairingHeap from Insert") - v.[3] <- box (minPairingHeapIntGen , "min PairingHeap int") - v.[4] <- box ((minPairingHeapIntOfSeqGen |> Gen.suchThat (fun (q, l) -> l.Length >= start)), "min PairingHeap OfSeq") - v.[5] <- box ((minPairingHeapIntInsertGen |> Gen.suchThat (fun (q, l) -> l.Length >= start)), "min PairingHeap from Insert") - v - -let stringGens = - let v = Array.create 2 (box (maxPairingHeapStringGen, "max PairingHeap string")) - v.[1] <- box (minPairingHeapStringGen, "min PairingHeap string") - v - -let intGensStart1 = - intGens 1 //this will accept all - -let intGensStart2 = - intGens 2 // this will accept 11 out of 12 - -[] -let ``cons pattern discriminator``() = - let h = ofSeq true ["f";"e";"d";"c";"b";"a"] - let h1, t1 = uncons h - - let h2, t2 = - match t1 with - | Cons(h, t) -> h, t - | _ -> "x", t1 - - ((h2 = "e") && ((length t2) = 4)) |> should equal true - -[] -let ``cons pattern discriminator 2``() = - let h = ofSeq true ["f";"e";"d";"c";"b";"a"] - - let t2 = - match h with - | Cons("f", Cons(_, t)) -> t - | _ -> h - - let h1, t3 = uncons t2 - - ((h1 = "d") && ((length t2) = 4)) |> should equal true - -[] -let ``empty list should be empty``() = - (PairingHeap.empty true).IsEmpty |> should equal true - -[] -[] -let ``head should return``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun ((h : PairingHeap), (l : int list)) -> - (h.Head() = l.Head) - |> classifyCollect h (h.Length()))) -[] -let ``insert works``() = - (((PairingHeap.empty true).Insert 1).Insert 2).IsEmpty |> should equal false - -[] -let ``seq enumerate matches build list``() = - - fsCheck "maxPairingHeap" (Prop.forAll (Arb.fromGen maxPairingHeapIntGen) - (fun (h, l) -> h |> List.ofSeq = l |> classifyCollect h (h.Length()))) - - fsCheck "minPairingHeap" (Prop.forAll (Arb.fromGen minPairingHeapIntGen) - (fun (h, l) -> h |> List.ofSeq = l |> classifyCollect h (h.Length()))) - -[] -let ``length of empty is 0``() = - (PairingHeap.empty true).Length() |> should equal 0 - -[] -[] -let ``seq enumerate matches build list int``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun (h : PairingHeap, l) -> h |> Seq.toList = l |> classifyCollect h (h.Length()))) - -[] -[] -let ``seq enumerate matches build list string``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun (h : PairingHeap, l) -> h |> Seq.toList = l |> classifyCollect h (h.Length()))) - -[] -[] -let ``tail should return``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun ((h : PairingHeap), (l : int list)) -> - let tl = h.Tail() - let tlHead = - if (tl.Length() > 0) then (tl.Head() = l.Item(1)) - else true - (tlHead && (tl.Length() = (l.Length - 1))) - |> classifyCollect h (h.Length()))) - -[] -let ``tryGetHead on empty should return None``() = - (PairingHeap.empty true).TryGetHead() |> should equal None - -[] -[] -let ``tryGetHead should return``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun ((h : PairingHeap), (l : int list)) -> - (h.TryGetHead().Value = l.Head) - |> classifyCollect h (h.Length()))) - -[] -let ``tryGetTail on empty should return None``() = - (PairingHeap.empty true).TryGetTail() |> should equal None - -[] -let ``tryGetTail on len 1 should return Some empty``() = - let h = PairingHeap.empty true |> insert 1 |> tryGetTail - h.Value |> isEmpty |> should equal true - -[] -let ``tryMerge max and mis should be None``() = - let h1 = ofSeq true ["f";"e";"d";"c";"b";"a"] - let h2 = ofSeq false ["t";"u";"v";"w";"x";"y";"z"] - - tryMerge h1 h2 |> should equal None - -[] -[] -let ``tryUncons 1 element``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun ((h : PairingHeap), (l : int list)) -> - let x, tl = h.TryUncons().Value - ((x = l.Head) && (tl.Length() = (l.Length - 1))) - |> classifyCollect h (h.Length()))) - -[] -let ``tryUncons empty``() = - (PairingHeap.empty true).TryUncons() |> should equal None - -[] -[] -let ``uncons 1 element``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun ((h : PairingHeap), (l : int list)) -> - let x, tl = h.Uncons() - ((x = l.Head) && (tl.Length() = (l.Length - 1))) - |> classifyCollect h (h.Length()))) \ No newline at end of file + +module PairingHeapTest = + + let intGens start = + let v = Array.create 6 (box (maxPairingHeapIntGen, "max PairingHeap int")) + v.[1] <- box ((maxPairingHeapIntOfSeqGen |> Gen.filter (fun (q, l) -> l.Length >= start)), "max PairingHeap OfSeq") + v.[2] <- box ((maxPairingHeapIntInsertGen |> Gen.filter (fun (q, l) -> l.Length >= start)), "max PairingHeap from Insert") + v.[3] <- box (minPairingHeapIntGen , "min PairingHeap int") + v.[4] <- box ((minPairingHeapIntOfSeqGen |> Gen.filter (fun (q, l) -> l.Length >= start)), "min PairingHeap OfSeq") + v.[5] <- box ((minPairingHeapIntInsertGen |> Gen.filter (fun (q, l) -> l.Length >= start)), "min PairingHeap from Insert") + v + + let stringGens = + let v = Array.create 2 (box (maxPairingHeapStringGen, "max PairingHeap string")) + v.[1] <- box (minPairingHeapStringGen, "min PairingHeap string") + v + + let intGensStart1 = + intGens 1 //this will accept all + + let intGensStart2 = + intGens 2 // this will accept 11 out of 12 + + [] + let testRealTimeDeque = + + testList "Experimental RealTimeDeque" [ + //test "cons pattern discriminator" { + // let h = ofSeq true ["f";"e";"d";"c";"b";"a"] + // let h1, t1 = uncons h + + // let h2, t2 = + // match t1 with + // | Cons(h, t) -> h, t + // | _ -> "x", t1 + + // ((h2 = "e") && ((length t2) = 4)) |> Expect.isTrue "" } + + //test "cons pattern discriminator 2" { + // let h = ofSeq true ["f";"e";"d";"c";"b";"a"] + + // let t2 = + // match h with + // | Cons("f", Cons(_, t)) -> t + // | _ -> h + + // let h1, t3 = uncons t2 + + // ((h1 = "d") && ((length t2) = 4)) |> Expect.isTrue "" } + + //test "empty list should be empty" { + // (PairingHeap.empty true).IsEmpty |> Expect.isTrue "" } + + //[] + //test "head should return``(x : obj) = + // let genAndName = unbox x + // fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun ((h : PairingHeap), (l : int list)) -> + // (h.Head() = l.Head) + // |> classifyCollect h (h.Length()))) + //test "insert works" { + // (((PairingHeap.empty true).Insert 1).Insert 2).IsEmpty |> Expect.isFalse "" } + + //test "seq enumerate matches build list" { + + // fsCheck "maxPairingHeap" (Prop.forAll (Arb.fromGen maxPairingHeapIntGen) + // (fun (h, l) -> h |> List.ofSeq = l |> classifyCollect h (h.Length()))) + + // fsCheck "minPairingHeap" (Prop.forAll (Arb.fromGen minPairingHeapIntGen) + // (fun (h, l) -> h |> List.ofSeq = l |> classifyCollect h (h.Length()))) + + //test "length of empty is 0" { + // (PairingHeap.empty true).Length() |> Expect.equal "" } 0 + + //[] + //test "seq enumerate matches build list int``(x : obj) = + // let genAndName = unbox x + // fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun (h : PairingHeap, l) -> h |> Seq.toList = l |> classifyCollect h (h.Length()))) + + //[] + //test "seq enumerate matches build list string``(x : obj) = + // let genAndName = unbox x + // fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun (h : PairingHeap, l) -> h |> Seq.toList = l |> classifyCollect h (h.Length()))) + + //[] + //test "tail should return``(x : obj) = + // let genAndName = unbox x + // fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun ((h : PairingHeap), (l : int list)) -> + // let tl = h.Tail() + // let tlHead = + // if (tl.Length() > 0) then (tl.Head() = l.Item(1)) + // else true + // (tlHead && (tl.Length() = (l.Length - 1))) + // |> classifyCollect h (h.Length()))) + + //test "tryGetHead on empty should return None" { + // (PairingHeap.empty true).TryGetHead() |> Expect.isNone "" } + + //[] + //test "tryGetHead should return``(x : obj) = + // let genAndName = unbox x + // fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun ((h : PairingHeap), (l : int list)) -> + // (h.TryGetHead().Value = l.Head) + // |> classifyCollect h (h.Length()))) + + //test "tryGetTail on empty should return None" { + // (PairingHeap.empty true).TryGetTail() |> Expect.isNone "" } + + //test "tryGetTail on len 1 should return Some empty" { + // let h = PairingHeap.empty true |> insert 1 |> tryGetTail + // h.Value |> isEmpty |> Expect.isTrue "" } + + //test "tryMerge max and mis should be None" { + // let h1 = ofSeq true ["f";"e";"d";"c";"b";"a"] + // let h2 = ofSeq false ["t";"u";"v";"w";"x";"y";"z"] + + // tryMerge h1 h2 |> Expect.isNone "" } + + //[] + //test "tryUncons 1 element``(x : obj) = + // let genAndName = unbox x + // fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun ((h : PairingHeap), (l : int list)) -> + // let x, tl = h.TryUncons().Value + // ((x = l.Head) && (tl.Length() = (l.Length - 1))) + // |> classifyCollect h (h.Length()))) + + //test "tryUncons empty" { + // (PairingHeap.empty true).TryUncons() |> Expect.isNone "" } + + //[] + //test "uncons 1 element``(x : obj) = + // let genAndName = unbox x + // fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun ((h : PairingHeap), (l : int list)) -> + // let x, tl = h.Uncons() + // ((x = l.Head) && (tl.Length() = (l.Length - 1))) + // |> classifyCollect h (h.Length()))) + ] \ No newline at end of file diff --git a/tests/FSharpx.Collections.Experimental.Tests/QueueGen.fs b/tests/FSharpx.Collections.Experimental.Tests/QueueGen.fs index 9c8c7eb5..809da0ee 100644 --- a/tests/FSharpx.Collections.Experimental.Tests/QueueGen.fs +++ b/tests/FSharpx.Collections.Experimental.Tests/QueueGen.fs @@ -2,11 +2,8 @@ open FSharpx.Collections open FSharpx.Collections.Experimental -open FSharpx.Collections.Tests.Properties -open NUnit.Framework +open FSharpx.Collections.Experimental.Tests.Properties open FsCheck -open FsCheck.NUnit -open FsUnit module QueueGen = diff --git a/tests/FSharpx.Collections.Experimental.Tests/RealTimeDequeTest.fs b/tests/FSharpx.Collections.Experimental.Tests/RealTimeDequeTest.fs index 541e31b1..7d4e00bd 100644 --- a/tests/FSharpx.Collections.Experimental.Tests/RealTimeDequeTest.fs +++ b/tests/FSharpx.Collections.Experimental.Tests/RealTimeDequeTest.fs @@ -1,2486 +1,2372 @@ -module FSharpx.Collections.Experimental.Tests.RealTimeDequeTest +namespace FSharpx.Collections.Experimental.Tests open System open FSharpx.Collections open FSharpx.Collections.Experimental -open FSharpx.Collections.Experimental.RealTimeDeque -open NUnit.Framework -open FsUnit +open Expecto +open Expecto.Flip //quite a lot going on and difficult to reason about edge cases -//testing up to length of 6 is the likely minimum to satisfy any arbitrary test case (less for some cases) +//testing up to RealTimeDeque.length of 6 is the likely minimum to satisfy any arbitrary test case (less for some cases) //6 makes front and back lists 3 long when C = 2 -let len1 = singleton "a" -let len2 = singleton "a" |> cons "b" -let len3 = singleton "a" |> cons "b" |> cons "c" -let len4 = singleton "a" |> cons "b" |> cons "c" |> cons "d" -let len5 = singleton "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" -let len6 = singleton "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" -let len7 = singleton "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" -let len8 = singleton "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" -let len9 = singleton "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" |> cons "i" -let lena = singleton "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" |> cons "i" |> cons "j" - -let len1snoc = singleton "a" -let len2snoc = singleton "b" |> snoc "a" -let len3snoc = singleton "c" |> snoc "b" |> snoc "a" -let len4snoc = singleton "d" |> snoc "c" |> snoc "b" |> snoc "a" -let len5snoc = singleton "e" |> snoc "d" |> snoc "c" |> snoc "b" |> snoc "a" -let len6snoc = singleton "f" |> snoc "e" |> snoc "d" |> snoc "c" |> snoc "b" |> snoc "a" -let len7snoc = singleton "g" |> snoc "f" |> snoc "e" |> snoc "d" |> snoc "c" |> snoc "b" |> snoc "a" -let len8snoc = singleton "h" |> snoc "g" |> snoc "f" |> snoc "e" |> snoc "d" |> snoc "c" |> snoc "b" |> snoc "a" -let len9snoc = singleton "i" |> snoc "h" |> snoc "g" |> snoc "f" |> snoc "e" |> snoc "d" |> snoc "c" |> snoc "b" |> snoc "a" -let lenasnoc = singleton "j" |> snoc "i" |> snoc "h" |> snoc "g" |> snoc "f" |> snoc "e" |> snoc "d" |> snoc "c" |> snoc "b" |> snoc "a" - -let len1C3 = empty 3 |> cons "a" -let len2C3 = empty 3 |> cons "a" |> cons "b" -let len3C3 = empty 3 |> cons "a" |> cons "b" |> cons "c" -let len4C3 = empty 3 |> cons "a" |> cons "b" |> cons "c" |> cons "d" -let len5C3 = empty 3 |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" -let len6C3 = empty 3 |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" -let len7C3 = empty 3 |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" -let len8C3 = empty 3 |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" -let len9C3 = empty 3 |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" |> cons "i" -let lenaC3 = empty 3 |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" |> cons "i" |> cons "j" - -let len1C3snoc = empty 3 |> snoc "a" -let len2C3snoc = empty 3 |> snoc "b" |> snoc "a" -let len3C3snoc = empty 3 |> snoc "c" |> snoc "b" |> snoc "a" -let len4C3snoc = empty 3 |> snoc "d" |> snoc "c" |> snoc "b" |> snoc "a" -let len5C3snoc = empty 3 |> snoc "e" |> snoc "d" |> snoc "c" |> snoc "b" |> snoc "a" -let len6C3snoc = empty 3 |> snoc "f" |> snoc "e" |> snoc "d" |> snoc "c" |> snoc "b" |> snoc "a" -let len7C3snoc = empty 3 |> snoc "g" |> snoc "f" |> snoc "e" |> snoc "d" |> snoc "c" |> snoc "b" |> snoc "a" -let len8C3snoc = empty 3 |> snoc "h" |> snoc "g" |> snoc "f" |> snoc "e" |> snoc "d" |> snoc "c" |> snoc "b" |> snoc "a" -let len9C3snoc = empty 3 |> snoc "i" |> snoc "h" |> snoc "g" |> snoc "f" |> snoc "e" |> snoc "d" |> snoc "c" |> snoc "b" |> snoc "a" -let lenaC3snoc = empty 3 |> snoc "j" |> snoc "i" |> snoc "h" |> snoc "g" |> snoc "f" |> snoc "e" |> snoc "d" |> snoc "c" |> snoc "b" |> snoc "a" - -[] -let ``empty dqueue should be empty``() = - isEmpty (empty 2) |> should equal true - -[] -let ``cons works``() = - ((len2 |> isEmpty) && (len2C3 |> isEmpty)) |> should equal false - -[] -let ``snoc works``() = - ((len2snoc |> isEmpty) && (len2C3snoc |> isEmpty)) |> should equal false - -[] -let ``singleton head works``() = - (((head len1) = "a") && ((len1C3 |> isEmpty)) = false) |> should equal true - -[] -let ``singleton last works``() = - len1 |> last |> should equal "a" - -[] -let ``tail of singleton empty``() = - len1 |> tail |> isEmpty |> should equal true - -[] -let ``tail of tail of 2 empty``() = - ( len2 |> tail |> tail |> isEmpty) |> should equal true - -[] -let ``init of singleton empty``() = - ((init len1) |> isEmpty) |> should equal true - -[] -let ``head, tail, and length work test 1``() = - let t1 = tail len2 - let t1C = tail len2C3 - let t1s = tail len2snoc - let t1Cs = tail len2C3snoc - let ht1 = head t1 - let ht1C = head t1C - let ht1s = head t1s - let ht1Cs = head t1Cs - - (((length t1) = 1) && ((length t1C) = 1) && ((length t1s) = 1) && ((length t1Cs) = 1) - && (ht1 = "a") && (ht1C = "a") && (ht1s = "a") && (ht1Cs = "a")) |> should equal true - -[] -let ``head, tail, and length work test 2``() = - let t1 = tail len3 - let t1C = tail len3C3 - let t1s = tail len3snoc - let t1Cs = tail len3C3snoc - - let t1_1 = tail t1 - let t1C_1 = tail t1C - let t1_1s = tail t1s - let t1C_1s = tail t1Cs - - (((length t1) = 2) && ((length t1C) = 2) && ((length t1s) = 2) && ((length t1Cs) = 2) - && ((head t1) = "b") && ((head t1C) = "b") && ((head t1s) = "b") && ((head t1Cs) = "b") - && ((length t1_1) = 1) && ((length t1C_1) = 1) && ((length t1_1s) = 1) && ((length t1C_1s) = 1) - && ((head t1_1) = "a") && ((head t1C_1) = "a") && ((head t1_1s) = "a") && ((head t1C_1s) = "a")) |> should equal true - -[] -let ``head, tail, and length work test 3``() = - let t1 = tail len4 - let t1C = tail len4C3 - let t1s = tail len4snoc - let t1Cs = tail len4C3snoc - - let t1_2 = tail t1 - let t1C_2 = tail t1C - let t1_2s = tail t1s - let t1C_2s = tail t1Cs - - let t1_1 = tail t1_2 - let t1C_1 = tail t1C_2 - let t1_1s = tail t1_2s - let t1C_1s = tail t1C_2s - - (((length t1) = 3) && ((length t1C) = 3) && ((length t1s) = 3) && ((length t1Cs) = 3) - && ((head t1) = "c") && ((head t1C) = "c") && ((head t1s) = "c") && ((head t1Cs) = "c") - && ((length t1_2) = 2) && ((length t1C_2) = 2) && ((length t1_2s) = 2) && ((length t1C_2s) = 2) - && ((head t1_2) = "b") && ((head t1C_2) = "b") && ((head t1_2s) = "b") && ((head t1C_2s) = "b") - && ((length t1_1) = 1) && ((length t1C_1) = 1) && ((length t1_1s) = 1) && ((length t1C_1s) = 1) - && ((head t1_1) = "a") && ((head t1C_1) = "a") && ((head t1_1s) = "a") && ((head t1C_1s) = "a")) |> should equal true - -[] -let ``head, tail, and length work test 4``() = - let t1 = tail len5 - let t1C = tail len5C3 - let t1s = tail len5snoc - let t1Cs = tail len5C3snoc - - let t1_3 = tail t1 - let t1C_3 = tail t1C - let t1_3s = tail t1s - let t1C_3s = tail t1Cs - - let t1_2 = tail t1_3 - let t1C_2 = tail t1C_3 - let t1_2s = tail t1_3s - let t1C_2s = tail t1C_3s - - let t1_1 = tail t1_2 - let t1C_1 = tail t1C_2 - let t1_1s = tail t1_2s - let t1C_1s = tail t1C_2s - - (((length t1) = 4) && ((length t1C) = 4) && ((length t1s) = 4) && ((length t1Cs) = 4) - && ((head t1) = "d") && ((head t1C) = "d") && ((head t1s) = "d") && ((head t1Cs) = "d") - && ((length t1_3) = 3) && ((length t1C_3) = 3) && ((length t1_3s) = 3) && ((length t1C_3s) = 3) - && ((head t1_3) = "c") && ((head t1C_3) = "c") && ((head t1_3s) = "c") && ((head t1C_3s) = "c") - && ((length t1_2) = 2) && ((length t1C_2) = 2) && ((length t1_2s) = 2) && ((length t1C_2s) = 2) - && ((head t1_2) = "b") && ((head t1C_2) = "b") && ((head t1_2s) = "b") && ((head t1C_2s) = "b") - && ((length t1_1) = 1) && ((length t1C_1) = 1) && ((length t1_1s) = 1) && ((length t1C_1s) = 1) - && ((head t1_1) = "a") && ((head t1C_1) = "a") && ((head t1_1s) = "a") && ((head t1C_1s) = "a")) |> should equal true - -[] -let ``head, tail, and length work test 5``() = - let t1 = tail len6 - let t1C = tail len6C3 - let t1s = tail len6snoc - let t1Cs = tail len6C3snoc - - let t1_4 = tail t1 - let t1C_4 = tail t1C - let t1_4s = tail t1s - let t1C_4s = tail t1Cs - - let t1_3 = tail t1_4 - let t1C_3 = tail t1C_4 - let t1_3s = tail t1_4s - let t1C_3s = tail t1C_4s - - let t1_2 = tail t1_3 - let t1C_2 = tail t1C_3 - let t1_2s = tail t1_3s - let t1C_2s = tail t1C_3s - - let t1_1 = tail t1_2 - let t1C_1 = tail t1C_2 - let t1_1s = tail t1_2s - let t1C_1s = tail t1C_2s - - (((length t1) = 5) && ((length t1C) = 5) && ((length t1s) = 5) && ((length t1Cs) = 5) - && ((head t1) = "e") && ((head t1C) = "e") && ((head t1s) = "e") && ((head t1Cs) = "e") - && ((length t1_4) = 4) && ((length t1C_4) = 4) && ((length t1_4s) = 4) && ((length t1C_4s) = 4) - && ((head t1_4) = "d") && ((head t1C_4) = "d") && ((head t1_4s) = "d") && ((head t1C_4s) = "d") - && ((length t1_3) = 3) && ((length t1C_3) = 3) && ((length t1_3s) = 3) && ((length t1C_3s) = 3) - && ((head t1_3) = "c") && ((head t1C_3) = "c") && ((head t1_3s) = "c") && ((head t1C_3s) = "c") - && ((length t1_2) = 2) && ((length t1C_2) = 2) && ((length t1_2s) = 2) && ((length t1C_2s) = 2) - && ((head t1_2) = "b") && ((head t1C_2) = "b") && ((head t1_2s) = "b") && ((head t1C_2s) = "b") - && ((length t1_1) = 1) && ((length t1C_1) = 1) && ((length t1_1s) = 1) && ((length t1C_1s) = 1) - && ((head t1_1) = "a") && ((head t1C_1) = "a") && ((head t1_1s) = "a") && ((head t1C_1s) = "a")) |> should equal true - -[] -let ``head, tail, and length work test 6``() = - let t1 = tail len7 - let t1C = tail len7C3 - let t1s = tail len7snoc - let t1Cs = tail len7C3snoc - - let t1_5 = tail t1 - let t1C_5 = tail t1C - let t1_5s = tail t1s - let t1C_5s = tail t1Cs - - let t1_4 = tail t1_5 - let t1C_4 = tail t1C_5 - let t1_4s = tail t1_5s - let t1C_4s = tail t1C_5s - - let t1_3 = tail t1_4 - let t1C_3 = tail t1C_4 - let t1_3s = tail t1_4s - let t1C_3s = tail t1C_4s - - let t1_2 = tail t1_3 - let t1C_2 = tail t1C_3 - let t1_2s = tail t1_3s - let t1C_2s = tail t1C_3s - - let t1_1 = tail t1_2 - let t1C_1 = tail t1C_2 - let t1_1s = tail t1_2s - let t1C_1s = tail t1C_2s - - (((length t1) = 6) && ((length t1C) = 6) && ((length t1s) = 6) && ((length t1Cs) = 6) - && ((head t1) = "f") && ((head t1C) = "f") && ((head t1s) = "f") && ((head t1Cs) = "f") - && ((length t1_5) = 5) && ((length t1C_5) = 5) && ((length t1_5s) = 5) && ((length t1C_5s) = 5) - && ((head t1_5) = "e") && ((head t1C_5) = "e") && ((head t1_5s) = "e") && ((head t1C_5s) = "e") - && ((length t1_4) = 4) && ((length t1C_4) = 4) && ((length t1_4s) = 4) && ((length t1C_4s) = 4) - && ((head t1_4) = "d") && ((head t1C_4) = "d") && ((head t1_4s) = "d") && ((head t1C_4s) = "d") - && ((length t1_3) = 3) && ((length t1C_3) = 3) && ((length t1_3s) = 3) && ((length t1C_3s) = 3) - && ((head t1_3) = "c") && ((head t1C_3) = "c") && ((head t1_3s) = "c") && ((head t1C_3s) = "c") - && ((length t1_2) = 2) && ((length t1C_2) = 2) && ((length t1_2s) = 2) && ((length t1C_2s) = 2) - && ((head t1_2) = "b") && ((head t1C_2) = "b") && ((head t1_2s) = "b") && ((head t1C_2s) = "b") - && ((length t1_1) = 1) && ((length t1C_1) = 1) && ((length t1_1s) = 1) && ((length t1C_1s) = 1) - && ((head t1_1) = "a") && ((head t1C_1) = "a") && ((head t1_1s) = "a") && ((head t1C_1s) = "a")) |> should equal true - -[] -let ``head, tail, and length work test 7``() = - let t1 = tail len8 - let t1C = tail len8C3 - let t1s = tail len8snoc - let t1Cs = tail len8C3snoc - - let t1_6 = tail t1 - let t1C_6 = tail t1C - let t1_6s = tail t1s - let t1C_6s = tail t1Cs - - let t1_5 = tail t1_6 - let t1C_5 = tail t1C_6 - let t1_5s = tail t1_6s - let t1C_5s = tail t1C_6s - - let t1_4 = tail t1_5 - let t1C_4 = tail t1C_5 - let t1_4s = tail t1_5s - let t1C_4s = tail t1C_5s - - let t1_3 = tail t1_4 - let t1C_3 = tail t1C_4 - let t1_3s = tail t1_4s - let t1C_3s = tail t1C_4s - - let t1_2 = tail t1_3 - let t1C_2 = tail t1C_3 - let t1_2s = tail t1_3s - let t1C_2s = tail t1C_3s - - let t1_1 = tail t1_2 - let t1C_1 = tail t1C_2 - let t1_1s = tail t1_2s - let t1C_1s = tail t1C_2s - - (((length t1) = 7) && ((length t1C) = 7) && ((length t1s) = 7) && ((length t1Cs) = 7) - && ((head t1) = "g") && ((head t1C) = "g") && ((head t1s) = "g") && ((head t1Cs) = "g") - && ((length t1_6) = 6) && ((length t1C_6) = 6) && ((length t1_6s) = 6) && ((length t1C_6s) = 6) - && ((head t1_6) = "f") && ((head t1C_6) = "f") && ((head t1_6s) = "f") && ((head t1C_6s) = "f") - && ((length t1_5) = 5) && ((length t1C_5) = 5) && ((length t1_5s) = 5) && ((length t1C_5s) = 5) - && ((head t1_5) = "e") && ((head t1C_5) = "e") && ((head t1_5s) = "e") && ((head t1C_5s) = "e") - && ((length t1_4) = 4) && ((length t1C_4) = 4) && ((length t1_4s) = 4) && ((length t1C_4s) = 4) - && ((head t1_4) = "d") && ((head t1C_4) = "d") && ((head t1_4s) = "d") && ((head t1C_4s) = "d") - && ((length t1_3) = 3) && ((length t1C_3) = 3) && ((length t1_3s) = 3) && ((length t1C_3s) = 3) - && ((head t1_3) = "c") && ((head t1C_3) = "c") && ((head t1_3s) = "c") && ((head t1C_3s) = "c") - && ((length t1_2) = 2) && ((length t1C_2) = 2) && ((length t1_2s) = 2) && ((length t1C_2s) = 2) - && ((head t1_2) = "b") && ((head t1C_2) = "b") && ((head t1_2s) = "b") && ((head t1C_2s) = "b") - && ((length t1_1) = 1) && ((length t1C_1) = 1) && ((length t1_1s) = 1) && ((length t1C_1s) = 1) - && ((head t1_1) = "a") && ((head t1C_1) = "a") && ((head t1_1s) = "a") && ((head t1C_1s) = "a")) |> should equal true - -[] -let ``head, tail, and length work test 8``() = - let t1 = tail len9 - let t1C = tail len9C3 - let t1s = tail len9snoc - let t1Cs = tail len9C3snoc - - let t1_7 = tail t1 - let t1C_7 = tail t1C - let t1_7s = tail t1s - let t1C_7s = tail t1Cs - - let t1_6 = tail t1_7 - let t1C_6 = tail t1C_7 - let t1_6s = tail t1_7s - let t1C_6s = tail t1C_7s - - let t1_5 = tail t1_6 - let t1C_5 = tail t1C_6 - let t1_5s = tail t1_6s - let t1C_5s = tail t1C_6s - - let t1_4 = tail t1_5 - let t1C_4 = tail t1C_5 - let t1_4s = tail t1_5s - let t1C_4s = tail t1C_5s - - let t1_3 = tail t1_4 - let t1C_3 = tail t1C_4 - let t1_3s = tail t1_4s - let t1C_3s = tail t1C_4s - - let t1_2 = tail t1_3 - let t1C_2 = tail t1C_3 - let t1_2s = tail t1_3s - let t1C_2s = tail t1C_3s - - let t1_1 = tail t1_2 - let t1C_1 = tail t1C_2 - let t1_1s = tail t1_2s - let t1C_1s = tail t1C_2s - - (((length t1) = 8) && ((length t1C) = 8) && ((length t1s) = 8) && ((length t1Cs) = 8) - && ((head t1) = "h") && ((head t1C) = "h") && ((head t1s) = "h") && ((head t1Cs) = "h") - && ((length t1_7) = 7) && ((length t1C_7) = 7) && ((length t1_7s) = 7) && ((length t1C_7s) = 7) - && ((head t1_7) = "g") && ((head t1C_7) = "g") && ((head t1_7s) = "g") && ((head t1C_7s) = "g") - && ((length t1_6) = 6) && ((length t1C_6) = 6) && ((length t1_6s) = 6) && ((length t1C_6s) = 6) - && ((head t1_6) = "f") && ((head t1C_6) = "f") && ((head t1_6s) = "f") && ((head t1C_6s) = "f") - && ((length t1_5) = 5) && ((length t1C_5) = 5) && ((length t1_5s) = 5) && ((length t1C_5s) = 5) - && ((head t1_5) = "e") && ((head t1C_5) = "e") && ((head t1_5s) = "e") && ((head t1C_5s) = "e") - && ((length t1_4) = 4) && ((length t1C_4) = 4) && ((length t1_4s) = 4) && ((length t1C_4s) = 4) - && ((head t1_4) = "d") && ((head t1C_4) = "d") && ((head t1_4s) = "d") && ((head t1C_4s) = "d") - && ((length t1_3) = 3) && ((length t1C_3) = 3) && ((length t1_3s) = 3) && ((length t1C_3s) = 3) - && ((head t1_3) = "c") && ((head t1C_3) = "c") && ((head t1_3s) = "c") && ((head t1C_3s) = "c") - && ((length t1_2) = 2) && ((length t1C_2) = 2) && ((length t1_2s) = 2) && ((length t1C_2s) = 2) - && ((head t1_2) = "b") && ((head t1C_2) = "b") && ((head t1_2s) = "b") && ((head t1C_2s) = "b") - && ((length t1_1) = 1) && ((length t1C_1) = 1) && ((length t1_1s) = 1) && ((length t1C_1s) = 1) - && ((head t1_1) = "a") && ((head t1C_1) = "a") && ((head t1_1s) = "a") && ((head t1C_1s) = "a")) |> should equal true - -[] -let ``head, tail, and length work test 9``() = - let t1 = tail lena - let t1C = tail lenaC3 - let t1s = tail lenasnoc - let t1Cs = tail lenaC3snoc - - let t1_8 = tail t1 - let t1C_8 = tail t1C - let t1_8s = tail t1s - let t1C_8s = tail t1Cs - - let t1_7 = tail t1_8 - let t1C_7 = tail t1C_8 - let t1_7s = tail t1_8s - let t1C_7s = tail t1C_8s - - let t1_6 = tail t1_7 - let t1C_6 = tail t1C_7 - let t1_6s = tail t1_7s - let t1C_6s = tail t1C_7s - - let t1_5 = tail t1_6 - let t1C_5 = tail t1C_6 - let t1_5s = tail t1_6s - let t1C_5s = tail t1C_6s - - let t1_4 = tail t1_5 - let t1C_4 = tail t1C_5 - let t1_4s = tail t1_5s - let t1C_4s = tail t1C_5s - - let t1_3 = tail t1_4 - let t1C_3 = tail t1C_4 - let t1_3s = tail t1_4s - let t1C_3s = tail t1C_4s - - let t1_2 = tail t1_3 - let t1C_2 = tail t1C_3 - let t1_2s = tail t1_3s - let t1C_2s = tail t1C_3s - - let t1_1 = tail t1_2 - let t1C_1 = tail t1C_2 - let t1_1s = tail t1_2s - let t1C_1s = tail t1C_2s - - (((length t1) = 9) && ((length t1C) = 9) && ((length t1s) = 9) && ((length t1Cs) = 9) - && ((head t1) = "i") && ((head t1C) = "i") && ((head t1s) = "i") && ((head t1Cs) = "i") - && ((length t1_8) = 8) && ((length t1C_8) = 8) && ((length t1_8s) = 8) && ((length t1C_8s) = 8) - && ((head t1_8) = "h") && ((head t1C_8) = "h") && ((head t1_8s) = "h") && ((head t1C_8s) = "h") - && ((length t1_7) = 7) && ((length t1C_7) = 7) && ((length t1_7s) = 7) && ((length t1C_7s) = 7) - && ((head t1_7) = "g") && ((head t1C_7) = "g") && ((head t1_7s) = "g") && ((head t1C_7s) = "g") - && ((length t1_6) = 6) && ((length t1C_6) = 6) && ((length t1_6s) = 6) && ((length t1C_6s) = 6) - && ((head t1_6) = "f") && ((head t1C_6) = "f") && ((head t1_6s) = "f") && ((head t1C_6s) = "f") - && ((length t1_5) = 5) && ((length t1C_5) = 5) && ((length t1_5s) = 5) && ((length t1C_5s) = 5) - && ((head t1_5) = "e") && ((head t1C_5) = "e") && ((head t1_5s) = "e") && ((head t1C_5s) = "e") - && ((length t1_4) = 4) && ((length t1C_4) = 4) && ((length t1_4s) = 4) && ((length t1C_4s) = 4) - && ((head t1_4) = "d") && ((head t1C_4) = "d") && ((head t1_4s) = "d") && ((head t1C_4s) = "d") - && ((length t1_3) = 3) && ((length t1C_3) = 3) && ((length t1_3s) = 3) && ((length t1C_3s) = 3) - && ((head t1_3) = "c") && ((head t1C_3) = "c") && ((head t1_3s) = "c") && ((head t1C_3s) = "c") - && ((length t1_2) = 2) && ((length t1C_2) = 2) && ((length t1_2s) = 2) && ((length t1C_2s) = 2) - && ((head t1_2) = "b") && ((head t1C_2) = "b") && ((head t1_2s) = "b") && ((head t1C_2s) = "b") - && ((length t1_1) = 1) && ((length t1C_1) = 1) && ((length t1_1s) = 1) && ((length t1C_1s) = 1) - && ((head t1_1) = "a") && ((head t1C_1) = "a") && ((head t1_1s) = "a") && ((head t1C_1s) = "a")) |> should equal true - -[] -//the previous series thoroughly tested construction by snoc, so we'll leave those out -let ``last, init, and length work test 1``() = - let t1 = init len2 - let t1C = init len2C3 +module RealTimeDequeTest = + + let len1 = RealTimeDeque.singleton "a" + let len2 = RealTimeDeque.singleton "a" |> RealTimeDeque.cons "b" + let len3 = RealTimeDeque.singleton "a" |> RealTimeDeque.cons "b" |> RealTimeDeque.cons "c" + let len4 = RealTimeDeque.singleton "a" |> RealTimeDeque.cons "b" |> RealTimeDeque.cons "c" |> RealTimeDeque.cons "d" + let len5 = RealTimeDeque.singleton "a" |> RealTimeDeque.cons "b" |> RealTimeDeque.cons "c" |> RealTimeDeque.cons "d" |> RealTimeDeque.cons "e" + let len6 = RealTimeDeque.singleton "a" |> RealTimeDeque.cons "b" |> RealTimeDeque.cons "c" |> RealTimeDeque.cons "d" |> RealTimeDeque.cons "e" |> RealTimeDeque.cons "f" + let len7 = RealTimeDeque.singleton "a" |> RealTimeDeque.cons "b" |> RealTimeDeque.cons "c" |> RealTimeDeque.cons "d" |> RealTimeDeque.cons "e" |> RealTimeDeque.cons "f" |> RealTimeDeque.cons "g" + let len8 = RealTimeDeque.singleton "a" |> RealTimeDeque.cons "b" |> RealTimeDeque.cons "c" |> RealTimeDeque.cons "d" |> RealTimeDeque.cons "e" |> RealTimeDeque.cons "f" |> RealTimeDeque.cons "g" |> RealTimeDeque.cons "h" + let len9 = RealTimeDeque.singleton "a" |> RealTimeDeque.cons "b" |> RealTimeDeque.cons "c" |> RealTimeDeque.cons "d" |> RealTimeDeque.cons "e" |> RealTimeDeque.cons "f" |> RealTimeDeque.cons "g" |> RealTimeDeque.cons "h" |> RealTimeDeque.cons "i" + let lena = RealTimeDeque.singleton "a" |> RealTimeDeque.cons "b" |> RealTimeDeque.cons "c" |> RealTimeDeque.cons "d" |> RealTimeDeque.cons "e" |> RealTimeDeque.cons "f" |> RealTimeDeque.cons "g" |> RealTimeDeque.cons "h" |> RealTimeDeque.cons "i" |> RealTimeDeque.cons "j" + + let len1snoc = RealTimeDeque.singleton "a" + let len2snoc = RealTimeDeque.singleton "b" |> RealTimeDeque.snoc "a" + let len3snoc = RealTimeDeque.singleton "c" |> RealTimeDeque.snoc "b" |> RealTimeDeque.snoc "a" + let len4snoc = RealTimeDeque.singleton "d" |> RealTimeDeque.snoc "c" |> RealTimeDeque.snoc "b" |> RealTimeDeque.snoc "a" + let len5snoc = RealTimeDeque.singleton "e" |> RealTimeDeque.snoc "d" |> RealTimeDeque.snoc "c" |> RealTimeDeque.snoc "b" |> RealTimeDeque.snoc "a" + let len6snoc = RealTimeDeque.singleton "f" |> RealTimeDeque.snoc "e" |> RealTimeDeque.snoc "d" |> RealTimeDeque.snoc "c" |> RealTimeDeque.snoc "b" |> RealTimeDeque.snoc "a" + let len7snoc = RealTimeDeque.singleton "g" |> RealTimeDeque.snoc "f" |> RealTimeDeque.snoc "e" |> RealTimeDeque.snoc "d" |> RealTimeDeque.snoc "c" |> RealTimeDeque.snoc "b" |> RealTimeDeque.snoc "a" + let len8snoc = RealTimeDeque.singleton "h" |> RealTimeDeque.snoc "g" |> RealTimeDeque.snoc "f" |> RealTimeDeque.snoc "e" |> RealTimeDeque.snoc "d" |> RealTimeDeque.snoc "c" |> RealTimeDeque.snoc "b" |> RealTimeDeque.snoc "a" + let len9snoc = RealTimeDeque.singleton "i" |> RealTimeDeque.snoc "h" |> RealTimeDeque.snoc "g" |> RealTimeDeque.snoc "f" |> RealTimeDeque.snoc "e" |> RealTimeDeque.snoc "d" |> RealTimeDeque.snoc "c" |> RealTimeDeque.snoc "b" |> RealTimeDeque.snoc "a" + let lenasnoc = RealTimeDeque.singleton "j" |> RealTimeDeque.snoc "i" |> RealTimeDeque.snoc "h" |> RealTimeDeque.snoc "g" |> RealTimeDeque.snoc "f" |> RealTimeDeque.snoc "e" |> RealTimeDeque.snoc "d" |> RealTimeDeque.snoc "c" |> RealTimeDeque.snoc "b" |> RealTimeDeque.snoc "a" + + let len1C3 = RealTimeDeque.empty 3 |> RealTimeDeque.cons "a" + let len2C3 = RealTimeDeque.empty 3 |> RealTimeDeque.cons "a" |> RealTimeDeque.cons "b" + let len3C3 = RealTimeDeque.empty 3 |> RealTimeDeque.cons "a" |> RealTimeDeque.cons "b" |> RealTimeDeque.cons "c" + let len4C3 = RealTimeDeque.empty 3 |> RealTimeDeque.cons "a" |> RealTimeDeque.cons "b" |> RealTimeDeque.cons "c" |> RealTimeDeque.cons "d" + let len5C3 = RealTimeDeque.empty 3 |> RealTimeDeque.cons "a" |> RealTimeDeque.cons "b" |> RealTimeDeque.cons "c" |> RealTimeDeque.cons "d" |> RealTimeDeque.cons "e" + let len6C3 = RealTimeDeque.empty 3 |> RealTimeDeque.cons "a" |> RealTimeDeque.cons "b" |> RealTimeDeque.cons "c" |> RealTimeDeque.cons "d" |> RealTimeDeque.cons "e" |> RealTimeDeque.cons "f" + let len7C3 = RealTimeDeque.empty 3 |> RealTimeDeque.cons "a" |> RealTimeDeque.cons "b" |> RealTimeDeque.cons "c" |> RealTimeDeque.cons "d" |> RealTimeDeque.cons "e" |> RealTimeDeque.cons "f" |> RealTimeDeque.cons "g" + let len8C3 = RealTimeDeque.empty 3 |> RealTimeDeque.cons "a" |> RealTimeDeque.cons "b" |> RealTimeDeque.cons "c" |> RealTimeDeque.cons "d" |> RealTimeDeque.cons "e" |> RealTimeDeque.cons "f" |> RealTimeDeque.cons "g" |> RealTimeDeque.cons "h" + let len9C3 = RealTimeDeque.empty 3 |> RealTimeDeque.cons "a" |> RealTimeDeque.cons "b" |> RealTimeDeque.cons "c" |> RealTimeDeque.cons "d" |> RealTimeDeque.cons "e" |> RealTimeDeque.cons "f" |> RealTimeDeque.cons "g" |> RealTimeDeque.cons "h" |> RealTimeDeque.cons "i" + let lenaC3 = RealTimeDeque.empty 3 |> RealTimeDeque.cons "a" |> RealTimeDeque.cons "b" |> RealTimeDeque.cons "c" |> RealTimeDeque.cons "d" |> RealTimeDeque.cons "e" |> RealTimeDeque.cons "f" |> RealTimeDeque.cons "g" |> RealTimeDeque.cons "h" |> RealTimeDeque.cons "i" |> RealTimeDeque.cons "j" + + let len1C3snoc = RealTimeDeque.empty 3 |> RealTimeDeque.snoc "a" + let len2C3snoc = RealTimeDeque.empty 3 |> RealTimeDeque.snoc "b" |> RealTimeDeque.snoc "a" + let len3C3snoc = RealTimeDeque.empty 3 |> RealTimeDeque.snoc "c" |> RealTimeDeque.snoc "b" |> RealTimeDeque.snoc "a" + let len4C3snoc = RealTimeDeque.empty 3 |> RealTimeDeque.snoc "d" |> RealTimeDeque.snoc "c" |> RealTimeDeque.snoc "b" |> RealTimeDeque.snoc "a" + let len5C3snoc = RealTimeDeque.empty 3 |> RealTimeDeque.snoc "e" |> RealTimeDeque.snoc "d" |> RealTimeDeque.snoc "c" |> RealTimeDeque.snoc "b" |> RealTimeDeque.snoc "a" + let len6C3snoc = RealTimeDeque.empty 3 |> RealTimeDeque.snoc "f" |> RealTimeDeque.snoc "e" |> RealTimeDeque.snoc "d" |> RealTimeDeque.snoc "c" |> RealTimeDeque.snoc "b" |> RealTimeDeque.snoc "a" + let len7C3snoc = RealTimeDeque.empty 3 |> RealTimeDeque.snoc "g" |> RealTimeDeque.snoc "f" |> RealTimeDeque.snoc "e" |> RealTimeDeque.snoc "d" |> RealTimeDeque.snoc "c" |> RealTimeDeque.snoc "b" |> RealTimeDeque.snoc "a" + let len8C3snoc = RealTimeDeque.empty 3 |> RealTimeDeque.snoc "h" |> RealTimeDeque.snoc "g" |> RealTimeDeque.snoc "f" |> RealTimeDeque.snoc "e" |> RealTimeDeque.snoc "d" |> RealTimeDeque.snoc "c" |> RealTimeDeque.snoc "b" |> RealTimeDeque.snoc "a" + let len9C3snoc = RealTimeDeque.empty 3 |> RealTimeDeque.snoc "i" |> RealTimeDeque.snoc "h" |> RealTimeDeque.snoc "g" |> RealTimeDeque.snoc "f" |> RealTimeDeque.snoc "e" |> RealTimeDeque.snoc "d" |> RealTimeDeque.snoc "c" |> RealTimeDeque.snoc "b" |> RealTimeDeque.snoc "a" + let lenaC3snoc = RealTimeDeque.empty 3 |> RealTimeDeque.snoc "j" |> RealTimeDeque.snoc "i" |> RealTimeDeque.snoc "h" |> RealTimeDeque.snoc "g" |> RealTimeDeque.snoc "f" |> RealTimeDeque.snoc "e" |> RealTimeDeque.snoc "d" |> RealTimeDeque.snoc "c" |> RealTimeDeque.snoc "b" |> RealTimeDeque.snoc "a" + + [] + let testRealTimeDeque = + + testList "Experimental RealTimeDeque" [ + test "RealTimeDeque.empty dqueue should be RealTimeDeque.empty" { + RealTimeDeque.isEmpty (RealTimeDeque.empty 2) |> Expect.isTrue "" } + + test "RealTimeDeque.cons works" { + ((len2 |> RealTimeDeque.isEmpty) && (len2C3 |> RealTimeDeque.isEmpty)) |> Expect.isFalse "" } + + test "RealTimeDeque.snoc works" { + ((len2snoc |> RealTimeDeque.isEmpty) && (len2C3snoc |> RealTimeDeque.isEmpty)) |> Expect.isFalse "" } + + test "RealTimeDeque.singleton RealTimeDeque.head works" { + (((RealTimeDeque.head len1) = "a") && ((len1C3 |> RealTimeDeque.isEmpty)) = false) |> Expect.isTrue "" } + + test "RealTimeDeque.singleton RealTimeDeque.last works" { + len1 |> RealTimeDeque.last |> Expect.equal "" "a" } + + test "RealTimeDeque.tail of RealTimeDeque.singleton RealTimeDeque.empty" { + len1 |> RealTimeDeque.tail |> RealTimeDeque.isEmpty |> Expect.isTrue "" } + + test "RealTimeDeque.tail of RealTimeDeque.tail of 2 RealTimeDeque.empty" { + ( len2 |> RealTimeDeque.tail |> RealTimeDeque.tail |> RealTimeDeque.isEmpty) |> Expect.isTrue "" } + + test "RealTimeDeque.init of RealTimeDeque.singleton RealTimeDeque.empty" { + ((RealTimeDeque.init len1) |> RealTimeDeque.isEmpty) |> Expect.isTrue "" } + + test "RealTimeDeque.head, RealTimeDeque.tail, and RealTimeDeque.length work test 1" { + let t1 = RealTimeDeque.tail len2 + let t1C = RealTimeDeque.tail len2C3 + let t1s = RealTimeDeque.tail len2snoc + let t1Cs = RealTimeDeque.tail len2C3snoc + let ht1 = RealTimeDeque.head t1 + let ht1C = RealTimeDeque.head t1C + let ht1s = RealTimeDeque.head t1s + let ht1Cs = RealTimeDeque.head t1Cs + + (((RealTimeDeque.length t1) = 1) && ((RealTimeDeque.length t1C) = 1) && ((RealTimeDeque.length t1s) = 1) && ((RealTimeDeque.length t1Cs) = 1) + && (ht1 = "a") && (ht1C = "a") && (ht1s = "a") && (ht1Cs = "a")) |> Expect.isTrue "" } + + test "RealTimeDeque.head, RealTimeDeque.tail, and RealTimeDeque.length work test 2" { + let t1 = RealTimeDeque.tail len3 + let t1C = RealTimeDeque.tail len3C3 + let t1s = RealTimeDeque.tail len3snoc + let t1Cs = RealTimeDeque.tail len3C3snoc + + let t1_1 = RealTimeDeque.tail t1 + let t1C_1 = RealTimeDeque.tail t1C + let t1_1s = RealTimeDeque.tail t1s + let t1C_1s = RealTimeDeque.tail t1Cs + + (((RealTimeDeque.length t1) = 2) && ((RealTimeDeque.length t1C) = 2) && ((RealTimeDeque.length t1s) = 2) && ((RealTimeDeque.length t1Cs) = 2) + && ((RealTimeDeque.head t1) = "b") && ((RealTimeDeque.head t1C) = "b") && ((RealTimeDeque.head t1s) = "b") && ((RealTimeDeque.head t1Cs) = "b") + && ((RealTimeDeque.length t1_1) = 1) && ((RealTimeDeque.length t1C_1) = 1) && ((RealTimeDeque.length t1_1s) = 1) && ((RealTimeDeque.length t1C_1s) = 1) + && ((RealTimeDeque.head t1_1) = "a") && ((RealTimeDeque.head t1C_1) = "a") && ((RealTimeDeque.head t1_1s) = "a") && ((RealTimeDeque.head t1C_1s) = "a")) |> Expect.isTrue "" } + + test "RealTimeDeque.head, RealTimeDeque.tail, and RealTimeDeque.length work test 3" { + let t1 = RealTimeDeque.tail len4 + let t1C = RealTimeDeque.tail len4C3 + let t1s = RealTimeDeque.tail len4snoc + let t1Cs = RealTimeDeque.tail len4C3snoc + + let t1_2 = RealTimeDeque.tail t1 + let t1C_2 = RealTimeDeque.tail t1C + let t1_2s = RealTimeDeque.tail t1s + let t1C_2s = RealTimeDeque.tail t1Cs + + let t1_1 = RealTimeDeque.tail t1_2 + let t1C_1 = RealTimeDeque.tail t1C_2 + let t1_1s = RealTimeDeque.tail t1_2s + let t1C_1s = RealTimeDeque.tail t1C_2s + + (((RealTimeDeque.length t1) = 3) && ((RealTimeDeque.length t1C) = 3) && ((RealTimeDeque.length t1s) = 3) && ((RealTimeDeque.length t1Cs) = 3) + && ((RealTimeDeque.head t1) = "c") && ((RealTimeDeque.head t1C) = "c") && ((RealTimeDeque.head t1s) = "c") && ((RealTimeDeque.head t1Cs) = "c") + && ((RealTimeDeque.length t1_2) = 2) && ((RealTimeDeque.length t1C_2) = 2) && ((RealTimeDeque.length t1_2s) = 2) && ((RealTimeDeque.length t1C_2s) = 2) + && ((RealTimeDeque.head t1_2) = "b") && ((RealTimeDeque.head t1C_2) = "b") && ((RealTimeDeque.head t1_2s) = "b") && ((RealTimeDeque.head t1C_2s) = "b") + && ((RealTimeDeque.length t1_1) = 1) && ((RealTimeDeque.length t1C_1) = 1) && ((RealTimeDeque.length t1_1s) = 1) && ((RealTimeDeque.length t1C_1s) = 1) + && ((RealTimeDeque.head t1_1) = "a") && ((RealTimeDeque.head t1C_1) = "a") && ((RealTimeDeque.head t1_1s) = "a") && ((RealTimeDeque.head t1C_1s) = "a")) |> Expect.isTrue "" } + + test "RealTimeDeque.head, RealTimeDeque.tail, and RealTimeDeque.length work test 4" { + let t1 = RealTimeDeque.tail len5 + let t1C = RealTimeDeque.tail len5C3 + let t1s = RealTimeDeque.tail len5snoc + let t1Cs = RealTimeDeque.tail len5C3snoc + + let t1_3 = RealTimeDeque.tail t1 + let t1C_3 = RealTimeDeque.tail t1C + let t1_3s = RealTimeDeque.tail t1s + let t1C_3s = RealTimeDeque.tail t1Cs + + let t1_2 = RealTimeDeque.tail t1_3 + let t1C_2 = RealTimeDeque.tail t1C_3 + let t1_2s = RealTimeDeque.tail t1_3s + let t1C_2s = RealTimeDeque.tail t1C_3s + + let t1_1 = RealTimeDeque.tail t1_2 + let t1C_1 = RealTimeDeque.tail t1C_2 + let t1_1s = RealTimeDeque.tail t1_2s + let t1C_1s = RealTimeDeque.tail t1C_2s + + (((RealTimeDeque.length t1) = 4) && ((RealTimeDeque.length t1C) = 4) && ((RealTimeDeque.length t1s) = 4) && ((RealTimeDeque.length t1Cs) = 4) + && ((RealTimeDeque.head t1) = "d") && ((RealTimeDeque.head t1C) = "d") && ((RealTimeDeque.head t1s) = "d") && ((RealTimeDeque.head t1Cs) = "d") + && ((RealTimeDeque.length t1_3) = 3) && ((RealTimeDeque.length t1C_3) = 3) && ((RealTimeDeque.length t1_3s) = 3) && ((RealTimeDeque.length t1C_3s) = 3) + && ((RealTimeDeque.head t1_3) = "c") && ((RealTimeDeque.head t1C_3) = "c") && ((RealTimeDeque.head t1_3s) = "c") && ((RealTimeDeque.head t1C_3s) = "c") + && ((RealTimeDeque.length t1_2) = 2) && ((RealTimeDeque.length t1C_2) = 2) && ((RealTimeDeque.length t1_2s) = 2) && ((RealTimeDeque.length t1C_2s) = 2) + && ((RealTimeDeque.head t1_2) = "b") && ((RealTimeDeque.head t1C_2) = "b") && ((RealTimeDeque.head t1_2s) = "b") && ((RealTimeDeque.head t1C_2s) = "b") + && ((RealTimeDeque.length t1_1) = 1) && ((RealTimeDeque.length t1C_1) = 1) && ((RealTimeDeque.length t1_1s) = 1) && ((RealTimeDeque.length t1C_1s) = 1) + && ((RealTimeDeque.head t1_1) = "a") && ((RealTimeDeque.head t1C_1) = "a") && ((RealTimeDeque.head t1_1s) = "a") && ((RealTimeDeque.head t1C_1s) = "a")) |> Expect.isTrue "" } + + test "RealTimeDeque.head, RealTimeDeque.tail, and RealTimeDeque.length work test 5" { + let t1 = RealTimeDeque.tail len6 + let t1C = RealTimeDeque.tail len6C3 + let t1s = RealTimeDeque.tail len6snoc + let t1Cs = RealTimeDeque.tail len6C3snoc + + let t1_4 = RealTimeDeque.tail t1 + let t1C_4 = RealTimeDeque.tail t1C + let t1_4s = RealTimeDeque.tail t1s + let t1C_4s = RealTimeDeque.tail t1Cs + + let t1_3 = RealTimeDeque.tail t1_4 + let t1C_3 = RealTimeDeque.tail t1C_4 + let t1_3s = RealTimeDeque.tail t1_4s + let t1C_3s = RealTimeDeque.tail t1C_4s + + let t1_2 = RealTimeDeque.tail t1_3 + let t1C_2 = RealTimeDeque.tail t1C_3 + let t1_2s = RealTimeDeque.tail t1_3s + let t1C_2s = RealTimeDeque.tail t1C_3s + + let t1_1 = RealTimeDeque.tail t1_2 + let t1C_1 = RealTimeDeque.tail t1C_2 + let t1_1s = RealTimeDeque.tail t1_2s + let t1C_1s = RealTimeDeque.tail t1C_2s + + (((RealTimeDeque.length t1) = 5) && ((RealTimeDeque.length t1C) = 5) && ((RealTimeDeque.length t1s) = 5) && ((RealTimeDeque.length t1Cs) = 5) + && ((RealTimeDeque.head t1) = "e") && ((RealTimeDeque.head t1C) = "e") && ((RealTimeDeque.head t1s) = "e") && ((RealTimeDeque.head t1Cs) = "e") + && ((RealTimeDeque.length t1_4) = 4) && ((RealTimeDeque.length t1C_4) = 4) && ((RealTimeDeque.length t1_4s) = 4) && ((RealTimeDeque.length t1C_4s) = 4) + && ((RealTimeDeque.head t1_4) = "d") && ((RealTimeDeque.head t1C_4) = "d") && ((RealTimeDeque.head t1_4s) = "d") && ((RealTimeDeque.head t1C_4s) = "d") + && ((RealTimeDeque.length t1_3) = 3) && ((RealTimeDeque.length t1C_3) = 3) && ((RealTimeDeque.length t1_3s) = 3) && ((RealTimeDeque.length t1C_3s) = 3) + && ((RealTimeDeque.head t1_3) = "c") && ((RealTimeDeque.head t1C_3) = "c") && ((RealTimeDeque.head t1_3s) = "c") && ((RealTimeDeque.head t1C_3s) = "c") + && ((RealTimeDeque.length t1_2) = 2) && ((RealTimeDeque.length t1C_2) = 2) && ((RealTimeDeque.length t1_2s) = 2) && ((RealTimeDeque.length t1C_2s) = 2) + && ((RealTimeDeque.head t1_2) = "b") && ((RealTimeDeque.head t1C_2) = "b") && ((RealTimeDeque.head t1_2s) = "b") && ((RealTimeDeque.head t1C_2s) = "b") + && ((RealTimeDeque.length t1_1) = 1) && ((RealTimeDeque.length t1C_1) = 1) && ((RealTimeDeque.length t1_1s) = 1) && ((RealTimeDeque.length t1C_1s) = 1) + && ((RealTimeDeque.head t1_1) = "a") && ((RealTimeDeque.head t1C_1) = "a") && ((RealTimeDeque.head t1_1s) = "a") && ((RealTimeDeque.head t1C_1s) = "a")) |> Expect.isTrue "" } + + test "RealTimeDeque.head, RealTimeDeque.tail, and RealTimeDeque.length work test 6" { + let t1 = RealTimeDeque.tail len7 + let t1C = RealTimeDeque.tail len7C3 + let t1s = RealTimeDeque.tail len7snoc + let t1Cs = RealTimeDeque.tail len7C3snoc + + let t1_5 = RealTimeDeque.tail t1 + let t1C_5 = RealTimeDeque.tail t1C + let t1_5s = RealTimeDeque.tail t1s + let t1C_5s = RealTimeDeque.tail t1Cs + + let t1_4 = RealTimeDeque.tail t1_5 + let t1C_4 = RealTimeDeque.tail t1C_5 + let t1_4s = RealTimeDeque.tail t1_5s + let t1C_4s = RealTimeDeque.tail t1C_5s + + let t1_3 = RealTimeDeque.tail t1_4 + let t1C_3 = RealTimeDeque.tail t1C_4 + let t1_3s = RealTimeDeque.tail t1_4s + let t1C_3s = RealTimeDeque.tail t1C_4s + + let t1_2 = RealTimeDeque.tail t1_3 + let t1C_2 = RealTimeDeque.tail t1C_3 + let t1_2s = RealTimeDeque.tail t1_3s + let t1C_2s = RealTimeDeque.tail t1C_3s + + let t1_1 = RealTimeDeque.tail t1_2 + let t1C_1 = RealTimeDeque.tail t1C_2 + let t1_1s = RealTimeDeque.tail t1_2s + let t1C_1s = RealTimeDeque.tail t1C_2s + + (((RealTimeDeque.length t1) = 6) && ((RealTimeDeque.length t1C) = 6) && ((RealTimeDeque.length t1s) = 6) && ((RealTimeDeque.length t1Cs) = 6) + && ((RealTimeDeque.head t1) = "f") && ((RealTimeDeque.head t1C) = "f") && ((RealTimeDeque.head t1s) = "f") && ((RealTimeDeque.head t1Cs) = "f") + && ((RealTimeDeque.length t1_5) = 5) && ((RealTimeDeque.length t1C_5) = 5) && ((RealTimeDeque.length t1_5s) = 5) && ((RealTimeDeque.length t1C_5s) = 5) + && ((RealTimeDeque.head t1_5) = "e") && ((RealTimeDeque.head t1C_5) = "e") && ((RealTimeDeque.head t1_5s) = "e") && ((RealTimeDeque.head t1C_5s) = "e") + && ((RealTimeDeque.length t1_4) = 4) && ((RealTimeDeque.length t1C_4) = 4) && ((RealTimeDeque.length t1_4s) = 4) && ((RealTimeDeque.length t1C_4s) = 4) + && ((RealTimeDeque.head t1_4) = "d") && ((RealTimeDeque.head t1C_4) = "d") && ((RealTimeDeque.head t1_4s) = "d") && ((RealTimeDeque.head t1C_4s) = "d") + && ((RealTimeDeque.length t1_3) = 3) && ((RealTimeDeque.length t1C_3) = 3) && ((RealTimeDeque.length t1_3s) = 3) && ((RealTimeDeque.length t1C_3s) = 3) + && ((RealTimeDeque.head t1_3) = "c") && ((RealTimeDeque.head t1C_3) = "c") && ((RealTimeDeque.head t1_3s) = "c") && ((RealTimeDeque.head t1C_3s) = "c") + && ((RealTimeDeque.length t1_2) = 2) && ((RealTimeDeque.length t1C_2) = 2) && ((RealTimeDeque.length t1_2s) = 2) && ((RealTimeDeque.length t1C_2s) = 2) + && ((RealTimeDeque.head t1_2) = "b") && ((RealTimeDeque.head t1C_2) = "b") && ((RealTimeDeque.head t1_2s) = "b") && ((RealTimeDeque.head t1C_2s) = "b") + && ((RealTimeDeque.length t1_1) = 1) && ((RealTimeDeque.length t1C_1) = 1) && ((RealTimeDeque.length t1_1s) = 1) && ((RealTimeDeque.length t1C_1s) = 1) + && ((RealTimeDeque.head t1_1) = "a") && ((RealTimeDeque.head t1C_1) = "a") && ((RealTimeDeque.head t1_1s) = "a") && ((RealTimeDeque.head t1C_1s) = "a")) |> Expect.isTrue "" } + + test "RealTimeDeque.head, RealTimeDeque.tail, and RealTimeDeque.length work test 7" { + let t1 = RealTimeDeque.tail len8 + let t1C = RealTimeDeque.tail len8C3 + let t1s = RealTimeDeque.tail len8snoc + let t1Cs = RealTimeDeque.tail len8C3snoc + + let t1_6 = RealTimeDeque.tail t1 + let t1C_6 = RealTimeDeque.tail t1C + let t1_6s = RealTimeDeque.tail t1s + let t1C_6s = RealTimeDeque.tail t1Cs + + let t1_5 = RealTimeDeque.tail t1_6 + let t1C_5 = RealTimeDeque.tail t1C_6 + let t1_5s = RealTimeDeque.tail t1_6s + let t1C_5s = RealTimeDeque.tail t1C_6s + + let t1_4 = RealTimeDeque.tail t1_5 + let t1C_4 = RealTimeDeque.tail t1C_5 + let t1_4s = RealTimeDeque.tail t1_5s + let t1C_4s = RealTimeDeque.tail t1C_5s + + let t1_3 = RealTimeDeque.tail t1_4 + let t1C_3 = RealTimeDeque.tail t1C_4 + let t1_3s = RealTimeDeque.tail t1_4s + let t1C_3s = RealTimeDeque.tail t1C_4s + + let t1_2 = RealTimeDeque.tail t1_3 + let t1C_2 = RealTimeDeque.tail t1C_3 + let t1_2s = RealTimeDeque.tail t1_3s + let t1C_2s = RealTimeDeque.tail t1C_3s + + let t1_1 = RealTimeDeque.tail t1_2 + let t1C_1 = RealTimeDeque.tail t1C_2 + let t1_1s = RealTimeDeque.tail t1_2s + let t1C_1s = RealTimeDeque.tail t1C_2s + + (((RealTimeDeque.length t1) = 7) && ((RealTimeDeque.length t1C) = 7) && ((RealTimeDeque.length t1s) = 7) && ((RealTimeDeque.length t1Cs) = 7) + && ((RealTimeDeque.head t1) = "g") && ((RealTimeDeque.head t1C) = "g") && ((RealTimeDeque.head t1s) = "g") && ((RealTimeDeque.head t1Cs) = "g") + && ((RealTimeDeque.length t1_6) = 6) && ((RealTimeDeque.length t1C_6) = 6) && ((RealTimeDeque.length t1_6s) = 6) && ((RealTimeDeque.length t1C_6s) = 6) + && ((RealTimeDeque.head t1_6) = "f") && ((RealTimeDeque.head t1C_6) = "f") && ((RealTimeDeque.head t1_6s) = "f") && ((RealTimeDeque.head t1C_6s) = "f") + && ((RealTimeDeque.length t1_5) = 5) && ((RealTimeDeque.length t1C_5) = 5) && ((RealTimeDeque.length t1_5s) = 5) && ((RealTimeDeque.length t1C_5s) = 5) + && ((RealTimeDeque.head t1_5) = "e") && ((RealTimeDeque.head t1C_5) = "e") && ((RealTimeDeque.head t1_5s) = "e") && ((RealTimeDeque.head t1C_5s) = "e") + && ((RealTimeDeque.length t1_4) = 4) && ((RealTimeDeque.length t1C_4) = 4) && ((RealTimeDeque.length t1_4s) = 4) && ((RealTimeDeque.length t1C_4s) = 4) + && ((RealTimeDeque.head t1_4) = "d") && ((RealTimeDeque.head t1C_4) = "d") && ((RealTimeDeque.head t1_4s) = "d") && ((RealTimeDeque.head t1C_4s) = "d") + && ((RealTimeDeque.length t1_3) = 3) && ((RealTimeDeque.length t1C_3) = 3) && ((RealTimeDeque.length t1_3s) = 3) && ((RealTimeDeque.length t1C_3s) = 3) + && ((RealTimeDeque.head t1_3) = "c") && ((RealTimeDeque.head t1C_3) = "c") && ((RealTimeDeque.head t1_3s) = "c") && ((RealTimeDeque.head t1C_3s) = "c") + && ((RealTimeDeque.length t1_2) = 2) && ((RealTimeDeque.length t1C_2) = 2) && ((RealTimeDeque.length t1_2s) = 2) && ((RealTimeDeque.length t1C_2s) = 2) + && ((RealTimeDeque.head t1_2) = "b") && ((RealTimeDeque.head t1C_2) = "b") && ((RealTimeDeque.head t1_2s) = "b") && ((RealTimeDeque.head t1C_2s) = "b") + && ((RealTimeDeque.length t1_1) = 1) && ((RealTimeDeque.length t1C_1) = 1) && ((RealTimeDeque.length t1_1s) = 1) && ((RealTimeDeque.length t1C_1s) = 1) + && ((RealTimeDeque.head t1_1) = "a") && ((RealTimeDeque.head t1C_1) = "a") && ((RealTimeDeque.head t1_1s) = "a") && ((RealTimeDeque.head t1C_1s) = "a")) |> Expect.isTrue "" } + + test "RealTimeDeque.head, RealTimeDeque.tail, and RealTimeDeque.length work test 8" { + let t1 = RealTimeDeque.tail len9 + let t1C = RealTimeDeque.tail len9C3 + let t1s = RealTimeDeque.tail len9snoc + let t1Cs = RealTimeDeque.tail len9C3snoc + + let t1_7 = RealTimeDeque.tail t1 + let t1C_7 = RealTimeDeque.tail t1C + let t1_7s = RealTimeDeque.tail t1s + let t1C_7s = RealTimeDeque.tail t1Cs + + let t1_6 = RealTimeDeque.tail t1_7 + let t1C_6 = RealTimeDeque.tail t1C_7 + let t1_6s = RealTimeDeque.tail t1_7s + let t1C_6s = RealTimeDeque.tail t1C_7s + + let t1_5 = RealTimeDeque.tail t1_6 + let t1C_5 = RealTimeDeque.tail t1C_6 + let t1_5s = RealTimeDeque.tail t1_6s + let t1C_5s = RealTimeDeque.tail t1C_6s + + let t1_4 = RealTimeDeque.tail t1_5 + let t1C_4 = RealTimeDeque.tail t1C_5 + let t1_4s = RealTimeDeque.tail t1_5s + let t1C_4s = RealTimeDeque.tail t1C_5s + + let t1_3 = RealTimeDeque.tail t1_4 + let t1C_3 = RealTimeDeque.tail t1C_4 + let t1_3s = RealTimeDeque.tail t1_4s + let t1C_3s = RealTimeDeque.tail t1C_4s + + let t1_2 = RealTimeDeque.tail t1_3 + let t1C_2 = RealTimeDeque.tail t1C_3 + let t1_2s = RealTimeDeque.tail t1_3s + let t1C_2s = RealTimeDeque.tail t1C_3s + + let t1_1 = RealTimeDeque.tail t1_2 + let t1C_1 = RealTimeDeque.tail t1C_2 + let t1_1s = RealTimeDeque.tail t1_2s + let t1C_1s = RealTimeDeque.tail t1C_2s + + (((RealTimeDeque.length t1) = 8) && ((RealTimeDeque.length t1C) = 8) && ((RealTimeDeque.length t1s) = 8) && ((RealTimeDeque.length t1Cs) = 8) + && ((RealTimeDeque.head t1) = "h") && ((RealTimeDeque.head t1C) = "h") && ((RealTimeDeque.head t1s) = "h") && ((RealTimeDeque.head t1Cs) = "h") + && ((RealTimeDeque.length t1_7) = 7) && ((RealTimeDeque.length t1C_7) = 7) && ((RealTimeDeque.length t1_7s) = 7) && ((RealTimeDeque.length t1C_7s) = 7) + && ((RealTimeDeque.head t1_7) = "g") && ((RealTimeDeque.head t1C_7) = "g") && ((RealTimeDeque.head t1_7s) = "g") && ((RealTimeDeque.head t1C_7s) = "g") + && ((RealTimeDeque.length t1_6) = 6) && ((RealTimeDeque.length t1C_6) = 6) && ((RealTimeDeque.length t1_6s) = 6) && ((RealTimeDeque.length t1C_6s) = 6) + && ((RealTimeDeque.head t1_6) = "f") && ((RealTimeDeque.head t1C_6) = "f") && ((RealTimeDeque.head t1_6s) = "f") && ((RealTimeDeque.head t1C_6s) = "f") + && ((RealTimeDeque.length t1_5) = 5) && ((RealTimeDeque.length t1C_5) = 5) && ((RealTimeDeque.length t1_5s) = 5) && ((RealTimeDeque.length t1C_5s) = 5) + && ((RealTimeDeque.head t1_5) = "e") && ((RealTimeDeque.head t1C_5) = "e") && ((RealTimeDeque.head t1_5s) = "e") && ((RealTimeDeque.head t1C_5s) = "e") + && ((RealTimeDeque.length t1_4) = 4) && ((RealTimeDeque.length t1C_4) = 4) && ((RealTimeDeque.length t1_4s) = 4) && ((RealTimeDeque.length t1C_4s) = 4) + && ((RealTimeDeque.head t1_4) = "d") && ((RealTimeDeque.head t1C_4) = "d") && ((RealTimeDeque.head t1_4s) = "d") && ((RealTimeDeque.head t1C_4s) = "d") + && ((RealTimeDeque.length t1_3) = 3) && ((RealTimeDeque.length t1C_3) = 3) && ((RealTimeDeque.length t1_3s) = 3) && ((RealTimeDeque.length t1C_3s) = 3) + && ((RealTimeDeque.head t1_3) = "c") && ((RealTimeDeque.head t1C_3) = "c") && ((RealTimeDeque.head t1_3s) = "c") && ((RealTimeDeque.head t1C_3s) = "c") + && ((RealTimeDeque.length t1_2) = 2) && ((RealTimeDeque.length t1C_2) = 2) && ((RealTimeDeque.length t1_2s) = 2) && ((RealTimeDeque.length t1C_2s) = 2) + && ((RealTimeDeque.head t1_2) = "b") && ((RealTimeDeque.head t1C_2) = "b") && ((RealTimeDeque.head t1_2s) = "b") && ((RealTimeDeque.head t1C_2s) = "b") + && ((RealTimeDeque.length t1_1) = 1) && ((RealTimeDeque.length t1C_1) = 1) && ((RealTimeDeque.length t1_1s) = 1) && ((RealTimeDeque.length t1C_1s) = 1) + && ((RealTimeDeque.head t1_1) = "a") && ((RealTimeDeque.head t1C_1) = "a") && ((RealTimeDeque.head t1_1s) = "a") && ((RealTimeDeque.head t1C_1s) = "a")) |> Expect.isTrue "" } + + test "RealTimeDeque.head, RealTimeDeque.tail, and RealTimeDeque.length work test 9" { + let t1 = RealTimeDeque.tail lena + let t1C = RealTimeDeque.tail lenaC3 + let t1s = RealTimeDeque.tail lenasnoc + let t1Cs = RealTimeDeque.tail lenaC3snoc + + let t1_8 = RealTimeDeque.tail t1 + let t1C_8 = RealTimeDeque.tail t1C + let t1_8s = RealTimeDeque.tail t1s + let t1C_8s = RealTimeDeque.tail t1Cs + + let t1_7 = RealTimeDeque.tail t1_8 + let t1C_7 = RealTimeDeque.tail t1C_8 + let t1_7s = RealTimeDeque.tail t1_8s + let t1C_7s = RealTimeDeque.tail t1C_8s + + let t1_6 = RealTimeDeque.tail t1_7 + let t1C_6 = RealTimeDeque.tail t1C_7 + let t1_6s = RealTimeDeque.tail t1_7s + let t1C_6s = RealTimeDeque.tail t1C_7s + + let t1_5 = RealTimeDeque.tail t1_6 + let t1C_5 = RealTimeDeque.tail t1C_6 + let t1_5s = RealTimeDeque.tail t1_6s + let t1C_5s = RealTimeDeque.tail t1C_6s + + let t1_4 = RealTimeDeque.tail t1_5 + let t1C_4 = RealTimeDeque.tail t1C_5 + let t1_4s = RealTimeDeque.tail t1_5s + let t1C_4s = RealTimeDeque.tail t1C_5s + + let t1_3 = RealTimeDeque.tail t1_4 + let t1C_3 = RealTimeDeque.tail t1C_4 + let t1_3s = RealTimeDeque.tail t1_4s + let t1C_3s = RealTimeDeque.tail t1C_4s + + let t1_2 = RealTimeDeque.tail t1_3 + let t1C_2 = RealTimeDeque.tail t1C_3 + let t1_2s = RealTimeDeque.tail t1_3s + let t1C_2s = RealTimeDeque.tail t1C_3s + + let t1_1 = RealTimeDeque.tail t1_2 + let t1C_1 = RealTimeDeque.tail t1C_2 + let t1_1s = RealTimeDeque.tail t1_2s + let t1C_1s = RealTimeDeque.tail t1C_2s + + (((RealTimeDeque.length t1) = 9) && ((RealTimeDeque.length t1C) = 9) && ((RealTimeDeque.length t1s) = 9) && ((RealTimeDeque.length t1Cs) = 9) + && ((RealTimeDeque.head t1) = "i") && ((RealTimeDeque.head t1C) = "i") && ((RealTimeDeque.head t1s) = "i") && ((RealTimeDeque.head t1Cs) = "i") + && ((RealTimeDeque.length t1_8) = 8) && ((RealTimeDeque.length t1C_8) = 8) && ((RealTimeDeque.length t1_8s) = 8) && ((RealTimeDeque.length t1C_8s) = 8) + && ((RealTimeDeque.head t1_8) = "h") && ((RealTimeDeque.head t1C_8) = "h") && ((RealTimeDeque.head t1_8s) = "h") && ((RealTimeDeque.head t1C_8s) = "h") + && ((RealTimeDeque.length t1_7) = 7) && ((RealTimeDeque.length t1C_7) = 7) && ((RealTimeDeque.length t1_7s) = 7) && ((RealTimeDeque.length t1C_7s) = 7) + && ((RealTimeDeque.head t1_7) = "g") && ((RealTimeDeque.head t1C_7) = "g") && ((RealTimeDeque.head t1_7s) = "g") && ((RealTimeDeque.head t1C_7s) = "g") + && ((RealTimeDeque.length t1_6) = 6) && ((RealTimeDeque.length t1C_6) = 6) && ((RealTimeDeque.length t1_6s) = 6) && ((RealTimeDeque.length t1C_6s) = 6) + && ((RealTimeDeque.head t1_6) = "f") && ((RealTimeDeque.head t1C_6) = "f") && ((RealTimeDeque.head t1_6s) = "f") && ((RealTimeDeque.head t1C_6s) = "f") + && ((RealTimeDeque.length t1_5) = 5) && ((RealTimeDeque.length t1C_5) = 5) && ((RealTimeDeque.length t1_5s) = 5) && ((RealTimeDeque.length t1C_5s) = 5) + && ((RealTimeDeque.head t1_5) = "e") && ((RealTimeDeque.head t1C_5) = "e") && ((RealTimeDeque.head t1_5s) = "e") && ((RealTimeDeque.head t1C_5s) = "e") + && ((RealTimeDeque.length t1_4) = 4) && ((RealTimeDeque.length t1C_4) = 4) && ((RealTimeDeque.length t1_4s) = 4) && ((RealTimeDeque.length t1C_4s) = 4) + && ((RealTimeDeque.head t1_4) = "d") && ((RealTimeDeque.head t1C_4) = "d") && ((RealTimeDeque.head t1_4s) = "d") && ((RealTimeDeque.head t1C_4s) = "d") + && ((RealTimeDeque.length t1_3) = 3) && ((RealTimeDeque.length t1C_3) = 3) && ((RealTimeDeque.length t1_3s) = 3) && ((RealTimeDeque.length t1C_3s) = 3) + && ((RealTimeDeque.head t1_3) = "c") && ((RealTimeDeque.head t1C_3) = "c") && ((RealTimeDeque.head t1_3s) = "c") && ((RealTimeDeque.head t1C_3s) = "c") + && ((RealTimeDeque.length t1_2) = 2) && ((RealTimeDeque.length t1C_2) = 2) && ((RealTimeDeque.length t1_2s) = 2) && ((RealTimeDeque.length t1C_2s) = 2) + && ((RealTimeDeque.head t1_2) = "b") && ((RealTimeDeque.head t1C_2) = "b") && ((RealTimeDeque.head t1_2s) = "b") && ((RealTimeDeque.head t1C_2s) = "b") + && ((RealTimeDeque.length t1_1) = 1) && ((RealTimeDeque.length t1C_1) = 1) && ((RealTimeDeque.length t1_1s) = 1) && ((RealTimeDeque.length t1C_1s) = 1) + && ((RealTimeDeque.head t1_1) = "a") && ((RealTimeDeque.head t1C_1) = "a") && ((RealTimeDeque.head t1_1s) = "a") && ((RealTimeDeque.head t1C_1s) = "a")) |> Expect.isTrue "" } + + //the previous series thoroughly tested construction by RealTimeDeque.snoc, so we'll leave those out + test "RealTimeDeque.last, RealTimeDeque.init, and RealTimeDeque.length work test 1" { + let t1 = RealTimeDeque.init len2 + let t1C = RealTimeDeque.init len2C3 - (((length t1) = 1) && ((length t1C) = 1) && ((last t1) = "b") && ((last t1C) = "b")) |> should equal true - -[] -let ``last, init, and length work test 2``() = - let t1 = init len3 - let t1C = init len3C3 - let t1_1 = init t1 - let t1C_1 = init t1C - - let lt1 = (last t1) - let lt1C = (last t1C) - let lt1_1 = (last t1_1) - let lt1C_1 = (last t1C_1) + (((RealTimeDeque.length t1) = 1) && ((RealTimeDeque.length t1C) = 1) && ((RealTimeDeque.last t1) = "b") && ((RealTimeDeque.last t1C) = "b")) |> Expect.isTrue "" } + + test "RealTimeDeque.last, RealTimeDeque.init, and RealTimeDeque.length work test 2" { + let t1 = RealTimeDeque.init len3 + let t1C = RealTimeDeque.init len3C3 + let t1_1 = RealTimeDeque.init t1 + let t1C_1 = RealTimeDeque.init t1C + + let lt1 = (RealTimeDeque.last t1) + let lt1C = (RealTimeDeque.last t1C) + let lt1_1 = (RealTimeDeque.last t1_1) + let lt1C_1 = (RealTimeDeque.last t1C_1) - (((length t1) = 2) && ((length t1C) = 2) && (lt1 = "b") && (lt1C = "b") && ((length t1_1) = 1) - && ((length t1C_1) = 1) && (lt1_1 = "c") - && (lt1C_1 = "c")) |> should equal true - -[] -let ``last, init, and length work test 3``() = - let t1 = init len4 - let t1C = init len4C3 - let t1_1 = init t1 - let t1C_1 = init t1C - let t1_2 = init t1_1 - let t1C_2 = init t1C_1 + (((RealTimeDeque.length t1) = 2) && ((RealTimeDeque.length t1C) = 2) && (lt1 = "b") && (lt1C = "b") && ((RealTimeDeque.length t1_1) = 1) + && ((RealTimeDeque.length t1C_1) = 1) && (lt1_1 = "c") + && (lt1C_1 = "c")) |> Expect.isTrue "" } + + test "RealTimeDeque.last, RealTimeDeque.init, and RealTimeDeque.length work test 3" { + let t1 = RealTimeDeque.init len4 + let t1C = RealTimeDeque.init len4C3 + let t1_1 = RealTimeDeque.init t1 + let t1C_1 = RealTimeDeque.init t1C + let t1_2 = RealTimeDeque.init t1_1 + let t1C_2 = RealTimeDeque.init t1C_1 - (((length t1) = 3) && ((length t1C) = 3) && ((last t1) = "b") && ((last t1C) = "b") - && ((length t1_1) = 2) && ((length t1C_1) = 2) && ((last t1_1) = "c") && ((last t1C_1) = "c") - && ((length t1_2) = 1) && ((length t1C_2) = 1) && ((last t1_2) = "d") && ((last t1C_2) = "d")) |> should equal true - -[] -let ``last, init, and length work test 4``() = - let t1 = init len5 - let t1C = init len5C3 - let t1_1 = init t1 - let t1C_1 = init t1C - let t1_2 = init t1_1 - let t1C_2 = init t1C_1 - let t1_3 = init t1_2 - let t1C_3 = init t1C_2 + (((RealTimeDeque.length t1) = 3) && ((RealTimeDeque.length t1C) = 3) && ((RealTimeDeque.last t1) = "b") && ((RealTimeDeque.last t1C) = "b") + && ((RealTimeDeque.length t1_1) = 2) && ((RealTimeDeque.length t1C_1) = 2) && ((RealTimeDeque.last t1_1) = "c") && ((RealTimeDeque.last t1C_1) = "c") + && ((RealTimeDeque.length t1_2) = 1) && ((RealTimeDeque.length t1C_2) = 1) && ((RealTimeDeque.last t1_2) = "d") && ((RealTimeDeque.last t1C_2) = "d")) |> Expect.isTrue "" } + + test "RealTimeDeque.last, RealTimeDeque.init, and RealTimeDeque.length work test 4" { + let t1 = RealTimeDeque.init len5 + let t1C = RealTimeDeque.init len5C3 + let t1_1 = RealTimeDeque.init t1 + let t1C_1 = RealTimeDeque.init t1C + let t1_2 = RealTimeDeque.init t1_1 + let t1C_2 = RealTimeDeque.init t1C_1 + let t1_3 = RealTimeDeque.init t1_2 + let t1C_3 = RealTimeDeque.init t1C_2 - (((length t1) = 4) && ((length t1C) = 4) && ((last t1) = "b") && ((last t1C) = "b") - && ((length t1_1) = 3) && ((length t1C_1) = 3) && ((last t1_1) = "c") && ((last t1C_1) = "c") - && ((length t1_2) = 2) && ((length t1C_2) = 2) && ((last t1_2) = "d") && ((last t1C_2) = "d") - && ((length t1_3) = 1) && ((length t1C_3) = 1) && ((last t1_3) = "e") && ((last t1C_3) = "e")) |> should equal true - -[] -let ``last, init, and length work test 5``() = - let t1 = init len6 - let t1C = init len6C3 - let t1_1 = init t1 - let t1C_1 = init t1C - let t1_2 = init t1_1 - let t1C_2 = init t1C_1 - let t1_3 = init t1_2 - let t1C_3 = init t1C_2 - let t1_4 = init t1_3 - let t1C_4 = init t1C_3 + (((RealTimeDeque.length t1) = 4) && ((RealTimeDeque.length t1C) = 4) && ((RealTimeDeque.last t1) = "b") && ((RealTimeDeque.last t1C) = "b") + && ((RealTimeDeque.length t1_1) = 3) && ((RealTimeDeque.length t1C_1) = 3) && ((RealTimeDeque.last t1_1) = "c") && ((RealTimeDeque.last t1C_1) = "c") + && ((RealTimeDeque.length t1_2) = 2) && ((RealTimeDeque.length t1C_2) = 2) && ((RealTimeDeque.last t1_2) = "d") && ((RealTimeDeque.last t1C_2) = "d") + && ((RealTimeDeque.length t1_3) = 1) && ((RealTimeDeque.length t1C_3) = 1) && ((RealTimeDeque.last t1_3) = "e") && ((RealTimeDeque.last t1C_3) = "e")) |> Expect.isTrue "" } + + test "RealTimeDeque.last, RealTimeDeque.init, and RealTimeDeque.length work test 5" { + let t1 = RealTimeDeque.init len6 + let t1C = RealTimeDeque.init len6C3 + let t1_1 = RealTimeDeque.init t1 + let t1C_1 = RealTimeDeque.init t1C + let t1_2 = RealTimeDeque.init t1_1 + let t1C_2 = RealTimeDeque.init t1C_1 + let t1_3 = RealTimeDeque.init t1_2 + let t1C_3 = RealTimeDeque.init t1C_2 + let t1_4 = RealTimeDeque.init t1_3 + let t1C_4 = RealTimeDeque.init t1C_3 - (((length t1) = 5) && ((length t1C) = 5) && ((last t1) = "b") && ((last t1C) = "b") - && ((length t1_1) = 4) && ((length t1C_1) = 4) && ((last t1_1) = "c") && ((last t1C_1) = "c") - && ((length t1_2) = 3) && ((length t1C_2) = 3) && ((last t1_2) = "d") && ((last t1C_2) = "d") - && ((length t1_3) = 2) && ((length t1C_3) = 2) && ((last t1_3) = "e") && ((last t1C_3) = "e") - && ((length t1_4) = 1) && ((length t1C_4) = 1) && ((last t1_4) = "f") && ((last t1C_4) = "f")) |> should equal true - -[] -let ``last, init, and length work test 6``() = - let t1 = init len7 - let t1C = init len7C3 - let t1_1 = init t1 - let t1C_1 = init t1C - let t1_2 = init t1_1 - let t1C_2 = init t1C_1 - let t1_3 = init t1_2 - let t1C_3 = init t1C_2 - let t1_4 = init t1_3 - let t1C_4 = init t1C_3 - let t1_5 = init t1_4 - let t1C_5 = init t1C_4 + (((RealTimeDeque.length t1) = 5) && ((RealTimeDeque.length t1C) = 5) && ((RealTimeDeque.last t1) = "b") && ((RealTimeDeque.last t1C) = "b") + && ((RealTimeDeque.length t1_1) = 4) && ((RealTimeDeque.length t1C_1) = 4) && ((RealTimeDeque.last t1_1) = "c") && ((RealTimeDeque.last t1C_1) = "c") + && ((RealTimeDeque.length t1_2) = 3) && ((RealTimeDeque.length t1C_2) = 3) && ((RealTimeDeque.last t1_2) = "d") && ((RealTimeDeque.last t1C_2) = "d") + && ((RealTimeDeque.length t1_3) = 2) && ((RealTimeDeque.length t1C_3) = 2) && ((RealTimeDeque.last t1_3) = "e") && ((RealTimeDeque.last t1C_3) = "e") + && ((RealTimeDeque.length t1_4) = 1) && ((RealTimeDeque.length t1C_4) = 1) && ((RealTimeDeque.last t1_4) = "f") && ((RealTimeDeque.last t1C_4) = "f")) |> Expect.isTrue "" } + + test "RealTimeDeque.last, RealTimeDeque.init, and RealTimeDeque.length work test 6" { + let t1 = RealTimeDeque.init len7 + let t1C = RealTimeDeque.init len7C3 + let t1_1 = RealTimeDeque.init t1 + let t1C_1 = RealTimeDeque.init t1C + let t1_2 = RealTimeDeque.init t1_1 + let t1C_2 = RealTimeDeque.init t1C_1 + let t1_3 = RealTimeDeque.init t1_2 + let t1C_3 = RealTimeDeque.init t1C_2 + let t1_4 = RealTimeDeque.init t1_3 + let t1C_4 = RealTimeDeque.init t1C_3 + let t1_5 = RealTimeDeque.init t1_4 + let t1C_5 = RealTimeDeque.init t1C_4 - (((length t1) = 6) && ((length t1C) = 6) && ((last t1) = "b") && ((last t1C) = "b") - && ((length t1_1) = 5) && ((length t1C_1) = 5) && ((last t1_1) = "c") && ((last t1C_1) = "c") - && ((length t1_2) = 4) && ((length t1C_2) = 4) && ((last t1_2) = "d") && ((last t1C_2) = "d") - && ((length t1_3) = 3) && ((length t1C_3) = 3) && ((last t1_3) = "e") && ((last t1C_3) = "e") - && ((length t1_4) = 2) && ((length t1C_4) = 2) && ((last t1_4) = "f") && ((last t1C_4) = "f") - && ((length t1_5) = 1) && ((length t1C_5) = 1) && ((last t1_5) = "g") && ((last t1C_5) = "g")) |> should equal true - -[] -let ``last, init, and length work test 7``() = - let t1 = init len8 - let t1C = init len8C3 - let t1_1 = init t1 - let t1C_1 = init t1C - let t1_2 = init t1_1 - let t1C_2 = init t1C_1 - let t1_3 = init t1_2 - let t1C_3 = init t1C_2 - let t1_4 = init t1_3 - let t1C_4 = init t1C_3 - let t1_5 = init t1_4 - let t1C_5 = init t1C_4 - let t1_6 = init t1_5 - let t1C_6 = init t1C_5 + (((RealTimeDeque.length t1) = 6) && ((RealTimeDeque.length t1C) = 6) && ((RealTimeDeque.last t1) = "b") && ((RealTimeDeque.last t1C) = "b") + && ((RealTimeDeque.length t1_1) = 5) && ((RealTimeDeque.length t1C_1) = 5) && ((RealTimeDeque.last t1_1) = "c") && ((RealTimeDeque.last t1C_1) = "c") + && ((RealTimeDeque.length t1_2) = 4) && ((RealTimeDeque.length t1C_2) = 4) && ((RealTimeDeque.last t1_2) = "d") && ((RealTimeDeque.last t1C_2) = "d") + && ((RealTimeDeque.length t1_3) = 3) && ((RealTimeDeque.length t1C_3) = 3) && ((RealTimeDeque.last t1_3) = "e") && ((RealTimeDeque.last t1C_3) = "e") + && ((RealTimeDeque.length t1_4) = 2) && ((RealTimeDeque.length t1C_4) = 2) && ((RealTimeDeque.last t1_4) = "f") && ((RealTimeDeque.last t1C_4) = "f") + && ((RealTimeDeque.length t1_5) = 1) && ((RealTimeDeque.length t1C_5) = 1) && ((RealTimeDeque.last t1_5) = "g") && ((RealTimeDeque.last t1C_5) = "g")) |> Expect.isTrue "" } + + test "RealTimeDeque.last, RealTimeDeque.init, and RealTimeDeque.length work test 7" { + let t1 = RealTimeDeque.init len8 + let t1C = RealTimeDeque.init len8C3 + let t1_1 = RealTimeDeque.init t1 + let t1C_1 = RealTimeDeque.init t1C + let t1_2 = RealTimeDeque.init t1_1 + let t1C_2 = RealTimeDeque.init t1C_1 + let t1_3 = RealTimeDeque.init t1_2 + let t1C_3 = RealTimeDeque.init t1C_2 + let t1_4 = RealTimeDeque.init t1_3 + let t1C_4 = RealTimeDeque.init t1C_3 + let t1_5 = RealTimeDeque.init t1_4 + let t1C_5 = RealTimeDeque.init t1C_4 + let t1_6 = RealTimeDeque.init t1_5 + let t1C_6 = RealTimeDeque.init t1C_5 - (((length t1) = 7) && ((length t1C) = 7) && ((last t1) = "b") && ((last t1C) = "b") - && ((length t1_1) = 6) && ((length t1C_1) = 6) && ((last t1_1) = "c") && ((last t1C_1) = "c") - && ((length t1_2) = 5) && ((length t1C_2) = 5) && ((last t1_2) = "d") && ((last t1C_2) = "d") - && ((length t1_3) = 4) && ((length t1C_3) = 4) && ((last t1_3) = "e") && ((last t1C_3) = "e") - && ((length t1_4) = 3) && ((length t1C_4) = 3) && ((last t1_4) = "f") && ((last t1C_4) = "f") - && ((length t1_5) = 2) && ((length t1C_5) = 2) && ((last t1_5) = "g") && ((last t1C_5) = "g") - && ((length t1_6) = 1) && ((length t1C_6) = 1) && ((last t1_6) = "h") && ((last t1C_6) = "h")) |> should equal true - -[] -let ``last, init, and length work test 8``() = - let t1 = init len9 - let t1C = init len9C3 - let t1_1 = init t1 - let t1C_1 = init t1C - let t1_2 = init t1_1 - let t1C_2 = init t1C_1 - let t1_3 = init t1_2 - let t1C_3 = init t1C_2 - let t1_4 = init t1_3 - let t1C_4 = init t1C_3 - let t1_5 = init t1_4 - let t1C_5 = init t1C_4 - let t1_6 = init t1_5 - let t1C_6 = init t1C_5 - let t1_7 = init t1_6 - let t1C_7 = init t1C_6 + (((RealTimeDeque.length t1) = 7) && ((RealTimeDeque.length t1C) = 7) && ((RealTimeDeque.last t1) = "b") && ((RealTimeDeque.last t1C) = "b") + && ((RealTimeDeque.length t1_1) = 6) && ((RealTimeDeque.length t1C_1) = 6) && ((RealTimeDeque.last t1_1) = "c") && ((RealTimeDeque.last t1C_1) = "c") + && ((RealTimeDeque.length t1_2) = 5) && ((RealTimeDeque.length t1C_2) = 5) && ((RealTimeDeque.last t1_2) = "d") && ((RealTimeDeque.last t1C_2) = "d") + && ((RealTimeDeque.length t1_3) = 4) && ((RealTimeDeque.length t1C_3) = 4) && ((RealTimeDeque.last t1_3) = "e") && ((RealTimeDeque.last t1C_3) = "e") + && ((RealTimeDeque.length t1_4) = 3) && ((RealTimeDeque.length t1C_4) = 3) && ((RealTimeDeque.last t1_4) = "f") && ((RealTimeDeque.last t1C_4) = "f") + && ((RealTimeDeque.length t1_5) = 2) && ((RealTimeDeque.length t1C_5) = 2) && ((RealTimeDeque.last t1_5) = "g") && ((RealTimeDeque.last t1C_5) = "g") + && ((RealTimeDeque.length t1_6) = 1) && ((RealTimeDeque.length t1C_6) = 1) && ((RealTimeDeque.last t1_6) = "h") && ((RealTimeDeque.last t1C_6) = "h")) |> Expect.isTrue "" } + + test "RealTimeDeque.last, RealTimeDeque.init, and RealTimeDeque.length work test 8" { + let t1 = RealTimeDeque.init len9 + let t1C = RealTimeDeque.init len9C3 + let t1_1 = RealTimeDeque.init t1 + let t1C_1 = RealTimeDeque.init t1C + let t1_2 = RealTimeDeque.init t1_1 + let t1C_2 = RealTimeDeque.init t1C_1 + let t1_3 = RealTimeDeque.init t1_2 + let t1C_3 = RealTimeDeque.init t1C_2 + let t1_4 = RealTimeDeque.init t1_3 + let t1C_4 = RealTimeDeque.init t1C_3 + let t1_5 = RealTimeDeque.init t1_4 + let t1C_5 = RealTimeDeque.init t1C_4 + let t1_6 = RealTimeDeque.init t1_5 + let t1C_6 = RealTimeDeque.init t1C_5 + let t1_7 = RealTimeDeque.init t1_6 + let t1C_7 = RealTimeDeque.init t1C_6 - (((length t1) = 8) && ((length t1C) = 8) && ((last t1) = "b") && ((last t1C) = "b") - && ((length t1_1) = 7) && ((length t1C_1) = 7) && ((last t1_1) = "c") && ((last t1C_1) = "c") - && ((length t1_2) = 6) && ((length t1C_2) = 6) && ((last t1_2) = "d") && ((last t1C_2) = "d") - && ((length t1_3) = 5) && ((length t1C_3) = 5) && ((last t1_3) = "e") && ((last t1C_3) = "e") - && ((length t1_4) = 4) && ((length t1C_4) = 4) && ((last t1_4) = "f") && ((last t1C_4) = "f") - && ((length t1_5) = 3) && ((length t1C_5) = 3) && ((last t1_5) = "g") && ((last t1C_5) = "g") - && ((length t1_6) = 2) && ((length t1C_6) = 2) && ((last t1_6) = "h") && ((last t1C_6) = "h") - && ((length t1_7) = 1) && ((length t1C_7) = 1) && ((last t1_7) = "i") && ((last t1C_7) = "i")) |> should equal true - -[] -let ``last, init, and length work test 9``() = - let t1 = init lena - let t1C = init lenaC3 - let t1_1 = init t1 - let t1C_1 = init t1C - let t1_2 = init t1_1 - let t1C_2 = init t1C_1 - let t1_3 = init t1_2 - let t1C_3 = init t1C_2 - let t1_4 = init t1_3 - let t1C_4 = init t1C_3 - let t1_5 = init t1_4 - let t1C_5 = init t1C_4 - let t1_6 = init t1_5 - let t1C_6 = init t1C_5 - let t1_7 = init t1_6 - let t1C_7 = init t1C_6 - let t1_8 = init t1_7 - let t1C_8 = init t1C_7 + (((RealTimeDeque.length t1) = 8) && ((RealTimeDeque.length t1C) = 8) && ((RealTimeDeque.last t1) = "b") && ((RealTimeDeque.last t1C) = "b") + && ((RealTimeDeque.length t1_1) = 7) && ((RealTimeDeque.length t1C_1) = 7) && ((RealTimeDeque.last t1_1) = "c") && ((RealTimeDeque.last t1C_1) = "c") + && ((RealTimeDeque.length t1_2) = 6) && ((RealTimeDeque.length t1C_2) = 6) && ((RealTimeDeque.last t1_2) = "d") && ((RealTimeDeque.last t1C_2) = "d") + && ((RealTimeDeque.length t1_3) = 5) && ((RealTimeDeque.length t1C_3) = 5) && ((RealTimeDeque.last t1_3) = "e") && ((RealTimeDeque.last t1C_3) = "e") + && ((RealTimeDeque.length t1_4) = 4) && ((RealTimeDeque.length t1C_4) = 4) && ((RealTimeDeque.last t1_4) = "f") && ((RealTimeDeque.last t1C_4) = "f") + && ((RealTimeDeque.length t1_5) = 3) && ((RealTimeDeque.length t1C_5) = 3) && ((RealTimeDeque.last t1_5) = "g") && ((RealTimeDeque.last t1C_5) = "g") + && ((RealTimeDeque.length t1_6) = 2) && ((RealTimeDeque.length t1C_6) = 2) && ((RealTimeDeque.last t1_6) = "h") && ((RealTimeDeque.last t1C_6) = "h") + && ((RealTimeDeque.length t1_7) = 1) && ((RealTimeDeque.length t1C_7) = 1) && ((RealTimeDeque.last t1_7) = "i") && ((RealTimeDeque.last t1C_7) = "i")) |> Expect.isTrue "" } + + test "RealTimeDeque.last, RealTimeDeque.init, and RealTimeDeque.length work test 9" { + let t1 = RealTimeDeque.init lena + let t1C = RealTimeDeque.init lenaC3 + let t1_1 = RealTimeDeque.init t1 + let t1C_1 = RealTimeDeque.init t1C + let t1_2 = RealTimeDeque.init t1_1 + let t1C_2 = RealTimeDeque.init t1C_1 + let t1_3 = RealTimeDeque.init t1_2 + let t1C_3 = RealTimeDeque.init t1C_2 + let t1_4 = RealTimeDeque.init t1_3 + let t1C_4 = RealTimeDeque.init t1C_3 + let t1_5 = RealTimeDeque.init t1_4 + let t1C_5 = RealTimeDeque.init t1C_4 + let t1_6 = RealTimeDeque.init t1_5 + let t1C_6 = RealTimeDeque.init t1C_5 + let t1_7 = RealTimeDeque.init t1_6 + let t1C_7 = RealTimeDeque.init t1C_6 + let t1_8 = RealTimeDeque.init t1_7 + let t1C_8 = RealTimeDeque.init t1C_7 - (((length t1) = 9) && ((length t1C) = 9) && ((last t1) = "b") && ((last t1C) = "b") - && ((length t1_1) = 8) && ((length t1C_1) = 8) && ((last t1_1) = "c") && ((last t1C_1) = "c") - && ((length t1_2) = 7) && ((length t1C_2) = 7) && ((last t1_2) = "d") && ((last t1C_2) = "d") - && ((length t1_3) = 6) && ((length t1C_3) = 6) && ((last t1_3) = "e") && ((last t1C_3) = "e") - && ((length t1_4) = 5) && ((length t1C_4) = 5) && ((last t1_4) = "f") && ((last t1C_4) = "f") - && ((length t1_5) = 4) && ((length t1C_5) = 4) && ((last t1_5) = "g") && ((last t1C_5) = "g") - && ((length t1_6) = 3) && ((length t1C_6) = 3) && ((last t1_6) = "h") && ((last t1C_6) = "h") - && ((length t1_7) = 2) && ((length t1C_7) = 2) && ((last t1_7) = "i") && ((last t1C_7) = "i") - && ((length t1_8) = 1) && ((length t1C_8) = 1) && ((last t1_8) = "j") && ((last t1C_8) = "j")) |> should equal true - -[] -let ``IEnumerable Seq``() = - (lena |> Seq.toArray).[5] |> should equal "e" - -[] -let ``IEnumerable Seq length``() = - lena |> Seq.length |> should equal 10 - -[] -let ``type cons works``() = - lena.Cons "zz" |> head |> should equal "zz" - -[] -let ``IDeque cons works``() = - ((lena :> IDeque).Cons "zz").Head |> should equal "zz" - -[] -let ``ofCatLists and uncons``() = - let d = ofCatLists ["a";"b";"c"] ["d";"e";"f"] - let h1, t1 = uncons d - let h2, t2 = uncons t1 - let h3, t3 = uncons t2 - let h4, t4 = uncons t3 - let h5, t5 = uncons t4 - let h6, t6 = uncons t5 - - ((h1 = "a") && (h2 = "b") && (h3 = "c") && (h4 = "d") && (h5 = "e") && (h6 = "f") && (isEmpty t6)) |> should equal true - -[] -let ``ofCatSeqs and uncons``() = - let d = ofCatSeqs (seq {'a'..'c'}) (seq {'d'..'f'}) - let h1, t1 = uncons d - let h2, t2 = uncons t1 - let h3, t3 = uncons t2 - let h4, t4 = uncons t3 - let h5, t5 = uncons t4 - let h6, t6 = uncons t5 - - ((h1 = 'a') && (h2 = 'b') && (h3 = 'c') && (h4 = 'd') && (h5 = 'e') && (h6 = 'f') && (isEmpty t6)) |> should equal true - -[] -let ``unsnoc works``() = - let d = ofCatLists ["f";"e";"d"] ["c";"b";"a"] - let i1, l1 = unsnoc d - let i2, l2 = unsnoc i1 - let i3, l3 = unsnoc i2 - let i4, l4 = unsnoc i3 - let i5, l5 = unsnoc i4 - let i6, l6 = unsnoc i5 - - ((l1 = "a") && (l2 = "b") && (l3 = "c") && (l4 = "d") && (l5 = "e") && (l6 = "f") && (isEmpty i6)) |> should equal true - -[] -let ``snoc pattern discriminator``() = - let d = (ofCatLists ["f";"e";"d"] ["c";"b";"a"]) - let i1, l1 = unsnoc d - - let i2, l2 = - match i1 with - | Snoc(i, l) -> i, l - | _ -> i1, "x" - - ((l2 = "b") && ((length i2) = 4)) |> should equal true - -[] -let ``cons pattern discriminator``() = - let d = (ofCatLists ["f";"e";"d"] ["c";"b";"a"]) - let h1, t1 = uncons d - - let h2, t2 = - match t1 with - | Cons(h, t) -> h, t - | _ -> "x", t1 - - ((h2 = "e") && ((length t2) = 4)) |> should equal true - -[] -let ``cons and snoc pattern discriminator``() = - let d = (ofCatLists ["f";"e";"d"] ["c";"b";"a"]) + (((RealTimeDeque.length t1) = 9) && ((RealTimeDeque.length t1C) = 9) && ((RealTimeDeque.last t1) = "b") && ((RealTimeDeque.last t1C) = "b") + && ((RealTimeDeque.length t1_1) = 8) && ((RealTimeDeque.length t1C_1) = 8) && ((RealTimeDeque.last t1_1) = "c") && ((RealTimeDeque.last t1C_1) = "c") + && ((RealTimeDeque.length t1_2) = 7) && ((RealTimeDeque.length t1C_2) = 7) && ((RealTimeDeque.last t1_2) = "d") && ((RealTimeDeque.last t1C_2) = "d") + && ((RealTimeDeque.length t1_3) = 6) && ((RealTimeDeque.length t1C_3) = 6) && ((RealTimeDeque.last t1_3) = "e") && ((RealTimeDeque.last t1C_3) = "e") + && ((RealTimeDeque.length t1_4) = 5) && ((RealTimeDeque.length t1C_4) = 5) && ((RealTimeDeque.last t1_4) = "f") && ((RealTimeDeque.last t1C_4) = "f") + && ((RealTimeDeque.length t1_5) = 4) && ((RealTimeDeque.length t1C_5) = 4) && ((RealTimeDeque.last t1_5) = "g") && ((RealTimeDeque.last t1C_5) = "g") + && ((RealTimeDeque.length t1_6) = 3) && ((RealTimeDeque.length t1C_6) = 3) && ((RealTimeDeque.last t1_6) = "h") && ((RealTimeDeque.last t1C_6) = "h") + && ((RealTimeDeque.length t1_7) = 2) && ((RealTimeDeque.length t1C_7) = 2) && ((RealTimeDeque.last t1_7) = "i") && ((RealTimeDeque.last t1C_7) = "i") + && ((RealTimeDeque.length t1_8) = 1) && ((RealTimeDeque.length t1C_8) = 1) && ((RealTimeDeque.last t1_8) = "j") && ((RealTimeDeque.last t1C_8) = "j")) |> Expect.isTrue "" } + + test "IEnumerable Seq" { + (lena |> Seq.toArray).[5] |> Expect.equal "" "e" } + + test "IEnumerable Seq RealTimeDeque.length" { + lena |> Seq.length |> Expect.equal "" 10 } + + test "type RealTimeDeque.cons works" { + lena.Cons "zz" |> RealTimeDeque.head |> Expect.equal "" "zz" } + + test "IDeque RealTimeDeque.cons works" { + ((lena :> IDeque).Cons "zz").Head |> Expect.equal "" "zz" } + + test "RealTimeDeque.ofCatLists and RealTimeDeque.uncons" { + let d = RealTimeDeque.ofCatLists ["a";"b";"c"] ["d";"e";"f"] + let h1, t1 = RealTimeDeque.uncons d + let h2, t2 = RealTimeDeque.uncons t1 + let h3, t3 = RealTimeDeque.uncons t2 + let h4, t4 = RealTimeDeque.uncons t3 + let h5, t5 = RealTimeDeque.uncons t4 + let h6, t6 = RealTimeDeque.uncons t5 + + ((h1 = "a") && (h2 = "b") && (h3 = "c") && (h4 = "d") && (h5 = "e") && (h6 = "f") && (RealTimeDeque.isEmpty t6)) |> Expect.isTrue "" } + + test "ofCatSeqs and RealTimeDeque.uncons" { + let d = RealTimeDeque.ofCatSeqs (seq {'a'..'c'}) (seq {'d'..'f'}) + let h1, t1 = RealTimeDeque.uncons d + let h2, t2 = RealTimeDeque.uncons t1 + let h3, t3 = RealTimeDeque.uncons t2 + let h4, t4 = RealTimeDeque.uncons t3 + let h5, t5 = RealTimeDeque.uncons t4 + let h6, t6 = RealTimeDeque.uncons t5 + + ((h1 = 'a') && (h2 = 'b') && (h3 = 'c') && (h4 = 'd') && (h5 = 'e') && (h6 = 'f') && (RealTimeDeque.isEmpty t6)) |> Expect.isTrue "" } + + test "unsnoc works" { + let d = RealTimeDeque.ofCatLists ["f";"e";"d"] ["c";"b";"a"] + let i1, l1 = RealTimeDeque.unsnoc d + let i2, l2 = RealTimeDeque.unsnoc i1 + let i3, l3 = RealTimeDeque.unsnoc i2 + let i4, l4 = RealTimeDeque.unsnoc i3 + let i5, l5 = RealTimeDeque.unsnoc i4 + let i6, l6 = RealTimeDeque.unsnoc i5 + + ((l1 = "a") && (l2 = "b") && (l3 = "c") && (l4 = "d") && (l5 = "e") && (l6 = "f") && (RealTimeDeque.isEmpty i6)) |> Expect.isTrue "" } + + test "RealTimeDeque.snoc pattern discriminator" { + let d = (RealTimeDeque.ofCatLists ["f";"e";"d"] ["c";"b";"a"]) + let i1, l1 = RealTimeDeque.unsnoc d + + let i2, l2 = + match i1 with + | RealTimeDeque.Snoc(i, l) -> i, l + | _ -> i1, "x" + + ((l2 = "b") && ((RealTimeDeque.length i2) = 4)) |> Expect.isTrue "" } + + test "RealTimeDeque.cons pattern discriminator" { + let d = (RealTimeDeque.ofCatLists ["f";"e";"d"] ["c";"b";"a"]) + let h1, t1 = RealTimeDeque.uncons d + + let h2, t2 = + match t1 with + | RealTimeDeque.Cons(h, t) -> h, t + | _ -> "x", t1 + + ((h2 = "e") && ((RealTimeDeque.length t2) = 4)) |> Expect.isTrue "" } + + test "RealTimeDeque.cons and RealTimeDeque.snoc pattern discriminator" { + let d = (RealTimeDeque.ofCatLists ["f";"e";"d"] ["c";"b";"a"]) - let mid1 = - match d with - | Cons(h, Snoc(i, l)) -> i - | _ -> d - - let head, last = - match mid1 with - | Cons(h, Snoc(i, l)) -> h, l - | _ -> "x", "x" - - ((head = "e") && (last = "b")) |> should equal true - -[] -let ``rev empty dqueue should be empty``() = - isEmpty (rev (empty 2)) |> should equal true - -[] -let ``rev dqueue length 1``() = - ((head (rev len1) = "a") && (head (rev len1C3) = "a")) |> should equal true - -[] -let ``rev dqueue length 2``() = - let r1 = rev len2 - let r1c = rev len2C3 - let h1 = head r1 - let h1c = head r1c - let t2 = tail r1 - let t2c = tail r1c - let h2 = head t2 - let h2c = head t2c - - ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b")) |> should equal true - -[] -let ``rev dqueue length 3``() = - let r1 = rev len3 - let r1c = rev len3C3 - let h1 = head r1 - let h1c = head r1c - let t2 = tail r1 - let t2c = tail r1c - let h2 = head t2 - let h2c = head t2c - let t3 = tail t2 - let t3c = tail t2c - let h3 = head t3 - let h3c = head t3c - - ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c")) |> should equal true - -[] -let ``rev dqueue length 4``() = - let r1 = rev len4 - let r1c = rev len4C3 - let h1 = head r1 - let h1c = head r1c - let t2 = tail r1 - let t2c = tail r1c - let h2 = head t2 - let h2c = head t2c - let t3 = tail t2 - let t3c = tail t2c - let h3 = head t3 - let h3c = head t3c - let t4 = tail t3 - let t4c = tail t3c - let h4 = head t4 - let h4c = head t4c - - ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d")) |> should equal true - -[] -let ``rev dqueue length 5``() = - let r1 = rev len5 - let r1c = rev len5C3 - let h1 = head r1 - let h1c = head r1c - let t2 = tail r1 - let t2c = tail r1c - let h2 = head t2 - let h2c = head t2c - let t3 = tail t2 - let t3c = tail t2c - let h3 = head t3 - let h3c = head t3c - let t4 = tail t3 - let t4c = tail t3c - let h4 = head t4 - let h4c = head t4c - let t5 = tail t4 - let t5c = tail t4c - let h5 = head t5 - let h5c = head t5c - - ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") - && (h5 = "e") && (h5c = "e")) |> should equal true - -[] -//length 6 more than sufficient to test rev -let ``rev dqueue length 6``() = - let r1 = rev len6 - let r1c = rev len6C3 - let h1 = head r1 - let h1c = head r1c - let t2 = tail r1 - let t2c = tail r1c - let h2 = head t2 - let h2c = head t2c - let t3 = tail t2 - let t3c = tail t2c - let h3 = head t3 - let h3c = head t3c - let t4 = tail t3 - let t4c = tail t3c - let h4 = head t4 - let h4c = head t4c - let t5 = tail t4 - let t5c = tail t4c - let h5 = head t5 - let h5c = head t5c - let t6 = tail t5 - let t6c = tail t5c - let h6 = head t6 - let h6c = head t6c - - ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") - && (h5 = "e") && (h5c = "e") && (h6 = "f") && (h6c = "f")) |> should equal true - -[] -let ``ofSeq and ofSeqC empty``() = - ((isEmpty (ofSeq [])) && (isEmpty (ofSeqC 3 []))) |> should equal true - -[] -let ``ofSeq and ofSeqC length 1``() = - ((head (ofSeq ["a"]) = "a") && (head (ofSeqC 3 ["a"]) = "a")) |> should equal true - -[] -let ``ofSeq and ofSeqC length 2``() = - let r1 = ofSeq ["a";"b"] - let r1c = ofSeqC 3 ["a";"b"] - let h1 = head r1 - let h1c = head r1c - let t2 = tail r1 - let t2c = tail r1c - let h2 = head t2 - let h2c = head t2c - - ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b")) |> should equal true - -[] -let ``ofSeq and ofSeqC length 3``() = - let r1 = ofSeq ["a";"b";"c"] - let r1c = ofSeqC 3 ["a";"b";"c"] - let h1 = head r1 - let h1c = head r1c - let t2 = tail r1 - let t2c = tail r1c - let h2 = head t2 - let h2c = head t2c - let t3 = tail t2 - let t3c = tail t2c - let h3 = head t3 - let h3c = head t3c - - ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c")) |> should equal true - -[] -let ``ofSeq and ofSeqC length 4``() = - let r1 = ofSeq ["a";"b";"c";"d"] - let r1c = ofSeqC 3 ["a";"b";"c";"d"] - let h1 = head r1 - let h1c = head r1c - let t2 = tail r1 - let t2c = tail r1c - let h2 = head t2 - let h2c = head t2c - let t3 = tail t2 - let t3c = tail t2c - let h3 = head t3 - let h3c = head t3c - let t4 = tail t3 - let t4c = tail t3c - let h4 = head t4 - let h4c = head t4c - - ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d")) |> should equal true - -[] -//length 5 more than sufficient to test ofSeq and ofSeqC -let ``ofSeq and ofSeqC length 5``() = - let r1 = ofSeq ["a";"b";"c";"d";"e"] - let r1c = ofSeqC 3 ["a";"b";"c";"d";"e"] - let h1 = head r1 - let h1c = head r1c - let t2 = tail r1 - let t2c = tail r1c - let h2 = head t2 - let h2c = head t2c - let t3 = tail t2 - let t3c = tail t2c - let h3 = head t3 - let h3c = head t3c - let t4 = tail t3 - let t4c = tail t3c - let h4 = head t4 - let h4c = head t4c - let t5 = tail t4 - let t5c = tail t4c - let h5 = head t5 - let h5c = head t5c - - ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") - && (h5 = "e") && (h5c = "e")) |> should equal true - -[] -//length 5 more than sufficient to test ofSeq and ofSeqC -let ``ofSeq and ofSeqC length 6``() = - let r1 = ofSeq ["a";"b";"c";"d";"e";"f"] - let r1c = ofSeqC 3 ["a";"b";"c";"d";"e";"f"] - let h1 = head r1 - let h1c = head r1c - let t2 = tail r1 - let t2c = tail r1c - let h2 = head t2 - let h2c = head t2c - let t3 = tail t2 - let t3c = tail t2c - let h3 = head t3 - let h3c = head t3c - let t4 = tail t3 - let t4c = tail t3c - let h4 = head t4 - let h4c = head t4c - let t5 = tail t4 - let t5c = tail t4c - let h5 = head t5 - let h5c = head t5c - let t6 = tail t5 - let t6c = tail t5c - let h6 = head t6 - let h6c = head t6c - - ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") - && (h5 = "e") && (h5c = "e") && (h6 = "f") && (h6c = "f")) |> should equal true - -[] -let ``appending empty dqueus``() = - ((isEmpty (append (ofSeq []) (ofSeq []) )) && (isEmpty (append (empty 3) (empty 3))) - ) |> should equal true - -[] -let ``appending empty and length 1``() = - ((head (append (ofSeq []) len1) = "a") && (head (append len1 (empty 3)) = "a")) |> should equal true - -[] -let ``appending empty and length 2``() = - let r1 = append (ofSeq []) (ofSeq ["a";"b"]) - let r1c = append (empty 3) (ofSeqC 3 ["a";"b"]) - let h1 = head r1 - let h1c = head r1c - let t2 = tail r1 - let t2c = tail r1c - let h2 = head t2 - let h2c = head t2c - - let r1r = append (ofSeq ["a";"b"]) (ofSeq []) - let r1cr = append (ofSeqC 3 ["a";"b"]) (empty 3) - let h1r = head r1r - let h1cr = head r1cr - let t2r = tail r1r - let t2cr = tail r1cr - let h2r = head t2r - let h2cr = head t2cr - - ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") - && (h1r = "a") && (h1cr = "a") && (h2r = "b") && (h2cr = "b")) |> should equal true - -[] -let ``appending length 1 and length 2``() = - let r1 = append (ofSeq ["a"]) (ofSeq ["b";"c"]) - let r1c = append (ofSeqC 3 ["a"]) (ofSeqC 3 ["b";"c"]) - let h1 = head r1 - let h1c = head r1c - let t2 = tail r1 - let t2c = tail r1c - let h2 = head t2 - let h2c = head t2c - let t3 = tail t2 - let t3c = tail t2c - let h3 = head t3 - let h3c = head t3c - - let r1r = append (ofSeq ["a";"b"]) (ofSeq ["c"]) - let r1cr = append (ofSeqC 3 ["a";"b"]) (ofSeqC 3 ["c"]) - let h1r = head r1r - let h1cr = head r1cr - let t2r = tail r1r - let t2cr = tail r1cr - let h2r = head t2r - let h2cr = head t2cr - let t3r = tail t2r - let t3cr = tail t2cr - let h3r = head t3r - let h3cr = head t3cr - - ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") - && (h1r = "a") && (h1cr = "a") && (h2r = "b") && (h2cr = "b") && (h3r = "c") && (h3cr = "c")) |> should equal true - -[] -let ``appending length 1 and length 3``() = - let r1 = append (ofSeq ["a"]) (ofSeq ["b";"c";"d"]) - let r1c = append (ofSeqC 3 ["a"]) (ofSeqC 3 ["b";"c";"d"]) - let h1 = head r1 - let h1c = head r1c - let t2 = tail r1 - let t2c = tail r1c - let h2 = head t2 - let h2c = head t2c - let t3 = tail t2 - let t3c = tail t2c - let h3 = head t3 - let h3c = head t3c - let t4 = tail t3 - let t4c = tail t3c - let h4 = head t4 - let h4c = head t4c - - let r1r = append (ofSeq ["a";"b";"c"]) (ofSeq ["d"]) - let r1cr = append (ofSeqC 3 ["a";"b";"c"]) (ofSeqC 3 ["d"]) - let h1r = head r1r - let h1cr = head r1cr - let t2r = tail r1r - let t2cr = tail r1cr - let h2r = head t2r - let h2cr = head t2cr - let t3r = tail t2r - let t3cr = tail t2cr - let h3r = head t3r - let h3cr = head t3cr - let t4r = tail t3r - let t4cr = tail t3cr - let h4r = head t4r - let h4cr = head t4cr - - ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") - && (h1r = "a") && (h1cr = "a") && (h2r = "b") && (h2cr = "b") && (h3r = "c") && (h3cr = "c") && (h4r = "d") && (h4cr = "d")) |> should equal true - -[] -let ``appending length 1 and length 4``() = - let r1 = append (ofSeq ["a"]) (ofSeq ["b";"c";"d";"e"]) - let r1c = append (ofSeqC 3 ["a"]) (ofSeqC 3 ["b";"c";"d";"e"]) - let h1 = head r1 - let h1c = head r1c - let t2 = tail r1 - let t2c = tail r1c - let h2 = head t2 - let h2c = head t2c - let t3 = tail t2 - let t3c = tail t2c - let h3 = head t3 - let h3c = head t3c - let t4 = tail t3 - let t4c = tail t3c - let h4 = head t4 - let h4c = head t4c - - let t5 = tail t4 - let t5c = tail t4c - let h5 = head t5 - let h5c = head t5c - - let r1r = append (ofSeq ["a";"b";"c";"d"]) (ofSeq ["e"]) - let r1cr = append (ofSeqC 3 ["a";"b";"c";"d"]) (ofSeqC 3 ["e"]) - let h1r = head r1r - let h1cr = head r1cr - let t2r = tail r1r - let t2cr = tail r1cr - let h2r = head t2r - let h2cr = head t2cr - let t3r = tail t2r - let t3cr = tail t2cr - let h3r = head t3r - let h3cr = head t3cr - let t4r = tail t3r - let t4cr = tail t3cr - let h4r = head t4r - let h4cr = head t4cr - - let t5r = tail t4r - let t5cr = tail t4cr - let h5r = head t5r - let h5cr = head t5cr - - ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") - && (h5 = "e") && (h5c = "e") - && (h1r = "a") && (h1cr = "a") && (h2r = "b") && (h2cr = "b") && (h3r = "c") && (h3cr = "c") && (h4r = "d") && (h4cr = "d") - && (h5r = "e") && (h5cr = "e")) |> should equal true - -[] -let ``appending length 1 and length 5``() = - let r1 = append (ofSeq ["a"]) (ofSeq ["b";"c";"d";"e";"f"]) - let r1c = append (ofSeqC 3 ["a"]) (ofSeqC 3 ["b";"c";"d";"e";"f"]) - let h1 = head r1 - let h1c = head r1c - let t2 = tail r1 - let t2c = tail r1c - let h2 = head t2 - let h2c = head t2c - let t3 = tail t2 - let t3c = tail t2c - let h3 = head t3 - let h3c = head t3c - let t4 = tail t3 - let t4c = tail t3c - let h4 = head t4 - let h4c = head t4c - let t5 = tail t4 - let t5c = tail t4c - let h5 = head t5 - let h5c = head t5c - let t6 = tail t5 - let t6c = tail t5c - let h6 = head t6 - let h6c = head t6c - - let r1r = append (ofSeq ["a";"b";"c";"d";"e"]) (ofSeq ["f"]) - let r1cr = append (ofSeqC 3 ["a";"b";"c";"d";"e"]) (ofSeqC 3 ["f"]) - let h1r = head r1r - let h1cr = head r1cr - let t2r = tail r1r - let t2cr = tail r1cr - let h2r = head t2r - let h2cr = head t2cr - let t3r = tail t2r - let t3cr = tail t2cr - let h3r = head t3r - let h3cr = head t3cr - let t4r = tail t3r - let t4cr = tail t3cr - let h4r = head t4r - let h4cr = head t4cr - let t5r = tail t4r - let t5cr = tail t4cr - let h5r = head t5r - let h5cr = head t5cr - let t6r = tail t5r - let t6cr = tail t5cr - let h6r = head t6r - let h6cr = head t6cr - - ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") - && (h5 = "e") && (h5c = "e") && (h6 = "f") && (h6c = "f") - && (h1r = "a") && (h1cr = "a") && (h2r = "b") && (h2cr = "b") && (h3r = "c") && (h3cr = "c") && (h4r = "d") && (h4cr = "d") - && (h5r = "e") && (h5cr = "e") && (h6r = "f") && (h6cr = "f")) |> should equal true - -[] -let ``appending length 2 and length 2``() = - let r1 = append (ofSeq ["a";"b"]) (ofSeq ["c";"d"]) - let r1c = append (ofSeqC 3 ["a";"b"]) (ofSeqC 3 ["c";"d"]) - let h1 = head r1 - let h1c = head r1c - let t2 = tail r1 - let t2c = tail r1c - let h2 = head t2 - let h2c = head t2c - let t3 = tail t2 - let t3c = tail t2c - let h3 = head t3 - let h3c = head t3c - let t4 = tail t3 - let t4c = tail t3c - let h4 = head t4 - let h4c = head t4c - - ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d")) |> should equal true - -[] -let ``appending length 2 and length 3``() = - let r1 = append (ofSeq ["a";"b"]) (ofSeq ["c";"d";"e"]) - let r1c = append (ofSeqC 3 ["a";"b"]) (ofSeqC 3 ["c";"d";"e"]) - let h1 = head r1 - let h1c = head r1c - let t2 = tail r1 - let t2c = tail r1c - let h2 = head t2 - let h2c = head t2c - let t3 = tail t2 - let t3c = tail t2c - let h3 = head t3 - let h3c = head t3c - let t4 = tail t3 - let t4c = tail t3c - let h4 = head t4 - let h4c = head t4c - - let t5 = tail t4 - let t5c = tail t4c - let h5 = head t5 - let h5c = head t5c - - let r1r = append (ofSeq ["a";"b";"c"]) (ofSeq ["d";"e"]) - let r1cr = append (ofSeqC 3 ["a";"b";"c"]) (ofSeqC 3 ["d";"e"]) - let h1r = head r1r - let h1cr = head r1cr - let t2r = tail r1r - let t2cr = tail r1cr - let h2r = head t2r - let h2cr = head t2cr - let t3r = tail t2r - let t3cr = tail t2cr - let h3r = head t3r - let h3cr = head t3cr - let t4r = tail t3r - let t4cr = tail t3cr - let h4r = head t4r - let h4cr = head t4cr - - let t5r = tail t4r - let t5cr = tail t4cr - let h5r = head t5r - let h5cr = head t5cr - - ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") - && (h5 = "e") && (h5c = "e") - && (h1r = "a") && (h1cr = "a") && (h2r = "b") && (h2cr = "b") && (h3r = "c") && (h3cr = "c") && (h4r = "d") && (h4cr = "d") - && (h5r = "e") && (h5cr = "e")) |> should equal true - -[] -let ``appending length 2 and length 4``() = - let r1 = append (ofSeq ["a";"b"]) (ofSeq ["c";"d";"e";"f"]) - let r1c = append (ofSeqC 3 ["a";"b"]) (ofSeqC 3 ["c";"d";"e";"f"]) - let h1 = head r1 - let h1c = head r1c - let t2 = tail r1 - let t2c = tail r1c - let h2 = head t2 - let h2c = head t2c - let t3 = tail t2 - let t3c = tail t2c - let h3 = head t3 - let h3c = head t3c - let t4 = tail t3 - let t4c = tail t3c - let h4 = head t4 - let h4c = head t4c - let t5 = tail t4 - let t5c = tail t4c - let h5 = head t5 - let h5c = head t5c - let t6 = tail t5 - let t6c = tail t5c - let h6 = head t6 - let h6c = head t6c - - let r1r = append (ofSeq ["a";"b";"c";"d"]) (ofSeq ["e";"f"]) - let r1cr = append (ofSeqC 3 ["a";"b";"c";"d"]) (ofSeqC 3 ["e";"f"]) - let h1r = head r1r - let h1cr = head r1cr - let t2r = tail r1r - let t2cr = tail r1cr - let h2r = head t2r - let h2cr = head t2cr - let t3r = tail t2r - let t3cr = tail t2cr - let h3r = head t3r - let h3cr = head t3cr - let t4r = tail t3r - let t4cr = tail t3cr - let h4r = head t4r - let h4cr = head t4cr - let t5r = tail t4r - let t5cr = tail t4cr - let h5r = head t5r - let h5cr = head t5cr - let t6r = tail t5r - let t6cr = tail t5cr - let h6r = head t6r - let h6cr = head t6cr - - ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") - && (h5 = "e") && (h5c = "e") && (h6 = "f") && (h6c = "f") - && (h1r = "a") && (h1cr = "a") && (h2r = "b") && (h2cr = "b") && (h3r = "c") && (h3cr = "c") && (h4r = "d") && (h4cr = "d") - && (h5r = "e") && (h5cr = "e") && (h6r = "f") && (h6cr = "f")) |> should equal true - -[] -let ``appending length 2 and length 5``() = - let r1 = append (ofSeq ["a";"b"]) (ofSeq ["c";"d";"e";"f";"g"]) - let r1c = append (ofSeqC 3 ["a";"b"]) (ofSeqC 3 ["c";"d";"e";"f";"g"]) - let h1 = head r1 - let h1c = head r1c - let t2 = tail r1 - let t2c = tail r1c - let h2 = head t2 - let h2c = head t2c - let t3 = tail t2 - let t3c = tail t2c - let h3 = head t3 - let h3c = head t3c - let t4 = tail t3 - let t4c = tail t3c - let h4 = head t4 - let h4c = head t4c - let t5 = tail t4 - let t5c = tail t4c - let h5 = head t5 - let h5c = head t5c - let t6 = tail t5 - let t6c = tail t5c - let h6 = head t6 - let h6c = head t6c - let t7 = tail t6 - let t7c = tail t6c - let h7 = head t7 - let h7c = head t7c - - let r1r = append (ofSeq ["a";"b";"c";"d";"e"]) (ofSeq ["f";"g"]) - let r1cr = append (ofSeqC 3 ["a";"b";"c";"d";"e"]) (ofSeqC 3 ["f";"g"]) - let h1r = head r1r - let h1cr = head r1cr - let t2r = tail r1r - let t2cr = tail r1cr - let h2r = head t2r - let h2cr = head t2cr - let t3r = tail t2r - let t3cr = tail t2cr - let h3r = head t3r - let h3cr = head t3cr - let t4r = tail t3r - let t4cr = tail t3cr - let h4r = head t4r - let h4cr = head t4cr - let t5r = tail t4r - let t5cr = tail t4cr - let h5r = head t5r - let h5cr = head t5cr - let t6r = tail t5r - let t6cr = tail t5cr - let h6r = head t6r - let h6cr = head t6cr - let t7r = tail t6r - let t7cr = tail t6cr - let h7r = head t7r - let h7cr = head t7cr - - ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") - && (h5 = "e") && (h5c = "e") && (h6 = "f") && (h6c = "f") && (h7 = "g") && (h7c = "g") - && (h1r = "a") && (h1cr = "a") && (h2r = "b") && (h2cr = "b") && (h3r = "c") && (h3cr = "c") && (h4r = "d") && (h4cr = "d") - && (h5r = "e") && (h5cr = "e") && (h6r = "f") && (h6cr = "f") && (h7r = "g") && (h7cr = "g")) |> should equal true - -[] -let ``appending length 3 and length 3``() = - let r1 = append (ofSeq ["a";"b";"c"]) (ofSeq ["d";"e";"f"]) - let r1c = append (ofSeqC 3 ["a";"b";"c"]) (ofSeqC 3 ["d";"e";"f"]) - let h1 = head r1 - let h1c = head r1c - let t2 = tail r1 - let t2c = tail r1c - let h2 = head t2 - let h2c = head t2c - let t3 = tail t2 - let t3c = tail t2c - let h3 = head t3 - let h3c = head t3c - let t4 = tail t3 - let t4c = tail t3c - let h4 = head t4 - let h4c = head t4c - let t5 = tail t4 - let t5c = tail t4c - let h5 = head t5 - let h5c = head t5c - let t6 = tail t5 - let t6c = tail t5c - let h6 = head t6 - let h6c = head t6c - - ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") - && (h5 = "e") && (h5c = "e") && (h6 = "f") && (h6c = "f")) |> should equal true - -[] -let ``appending length 6 and length 7``() = - let r1 = append (ofSeq ["a";"b";"c";"d";"e";"f"]) (ofSeq ["g";"h";"i";"j";"k";"l";"m"]) - let r1c = append (ofSeqC 3 ["a";"b";"c";"d";"e";"f"]) (ofSeqC 3 ["g";"h";"i";"j";"k";"l";"m"]) - let h1 = head r1 - let h1c = head r1c - let t2 = tail r1 - let t2c = tail r1c - let h2 = head t2 - let h2c = head t2c - let t3 = tail t2 - let t3c = tail t2c - let h3 = head t3 - let h3c = head t3c - let t4 = tail t3 - let t4c = tail t3c - let h4 = head t4 - let h4c = head t4c - let t5 = tail t4 - let t5c = tail t4c - let h5 = head t5 - let h5c = head t5c - let t6 = tail t5 - let t6c = tail t5c - let h6 = head t6 - let h6c = head t6c - let h6 = head t6 - let h6c = head t6c - let t7 = tail t6 - let t7c = tail t6c - let h7 = head t7 - let h7c = head t7c - let h7 = head t7 - let h7c = head t7c - let t8 = tail t7 - let t8c = tail t7c - let h8 = head t8 - let h8c = head t8c - let h8 = head t8 - let h8c = head t8c - let t9 = tail t8 - let t9c = tail t8c - let h9 = head t9 - let h9c = head t9c - let h9 = head t9 - let h9c = head t9c - let t10 = tail t9 - let t10c = tail t9c - let h10 = head t10 - let h10c = head t10c - let h10 = head t10 - let h10c = head t10c - let t11 = tail t10 - let t11c = tail t10c - let h11 = head t11 - let h11c = head t11c - let h11 = head t11 - let h11c = head t11c - let t12 = tail t11 - let t12c = tail t11c - let h12 = head t12 - let h12c = head t12c - let h12 = head t12 - let h12c = head t12c - let t13 = tail t12 - let t13c = tail t12c - let h13 = head t13 - let h13c = head t13c - let h13 = head t13 - let h13c = head t13c - - let r1r = append (ofSeq ["a";"b";"c";"d";"e";"f";"g"]) (ofSeq ["h";"i";"j";"k";"l";"m"]) - let r1cr = append (ofSeqC 3 ["a";"b";"c";"d";"e";"f";"g"]) (ofSeqC 3 ["h";"i";"j";"k";"l";"m"]) - let h1r = head r1r - let h1cr = head r1cr - let t2r = tail r1r - let t2cr = tail r1cr - let h2r = head t2r - let h2cr = head t2cr - let t3r = tail t2r - let t3cr = tail t2cr - let h3r = head t3r - let h3cr = head t3cr - let t4r = tail t3r - let t4cr = tail t3cr - let h4r = head t4r - let h4cr = head t4cr - let t5r = tail t4r - let t5cr = tail t4cr - let h5r = head t5r - let h5cr = head t5cr - let t6r = tail t5r - let t6cr = tail t5cr - let h6r = head t6r - let h6cr = head t6cr - let t7r = tail t6r - let t7cr = tail t6cr - let h7r = head t7r - let h7cr = head t7cr - let h7r = head t7r - let h7cr = head t7cr - let t8r = tail t7r - let t8cr = tail t7cr - let h8r = head t8r - let h8cr = head t8cr - let h8r = head t8r - let h8cr = head t8cr - let t9r = tail t8r - let t9cr = tail t8cr - let h9r = head t9r - let h9cr = head t9cr - let h9r = head t9r - let h9cr = head t9cr - let t10r = tail t9r - let t10cr = tail t9cr - let h10r = head t10r - let h10cr = head t10cr - let h10r = head t10r - let h10cr = head t10cr - let t11r = tail t10r - let t11cr = tail t10cr - let h11r = head t11r - let h11cr = head t11cr - let h11r = head t11r - let h11cr = head t11cr - let t12r = tail t11r - let t12cr = tail t11cr - let h12r = head t12r - let h12cr = head t12cr - let h12r = head t12r - let h12cr = head t12cr - let t13r = tail t12r - let t13cr = tail t12cr - let h13r = head t13r - let h13cr = head t13cr - let h13r = head t13r - let h13cr = head t13cr - - ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") - && (h5 = "e") && (h5c = "e") && (h6 = "f") && (h6c = "f") && (h7 = "g") && (h7c = "g") && (h8 = "h") && (h8c = "h") - && (h9 = "i") && (h9c = "i") && (h10 = "j") && (h10c = "j") && (h11 = "k") && (h11c = "k") && (h12 = "l") && (h12c = "l") - && (h13 = "m") && (h13c = "m") && (h1r = "a") && (h1cr = "a") && (h2r = "b") && (h2cr = "b") && (h3r = "c") && (h3cr = "c") - && (h4r = "d") && (h4cr = "d") && (h5r = "e") && (h5cr = "e") && (h6r = "f") && (h6cr = "f") && (h7r = "g") && (h7cr = "g") - && (h8r = "h") && (h8cr = "h") && (h9r = "i") && (h9cr = "i") && (h10r = "j") && (h10cr = "j") - && (h11r = "k") && (h11cr = "k") && (h12r = "l") && (h12cr = "l") && (h13r = "m") && (h13cr = "m")) |> should equal true - - -[] -let ``lookup length 1``() = - len1 |> lookup 0 |> should equal "a" - -[] -let ``lookup length 2``() = - (((len2 |> lookup 0) = "b") && ((len2 |> lookup 1) = "a")) |> should equal true - -[] -let ``lookup length 3``() = - (((len3 |> lookup 0) = "c") && ((len3 |> lookup 1) = "b") && ((len3 |> lookup 2) = "a")) |> should equal true - -[] -let ``lookup length 4``() = - (((len4 |> lookup 0) = "d") && ((len4 |> lookup 1) = "c") && ((len4 |> lookup 2) = "b") && ((len4 |> lookup 3) = "a")) - |> should equal true - -[] -let ``lookup length 5``() = - (((len5 |> lookup 0) = "e") && ((len5 |> lookup 1) = "d") && ((len5 |> lookup 2) = "c") && ((len5 |> lookup 3) = "b") - && ((len5 |> lookup 4) = "a")) |> should equal true - -[] -let ``lookup length 6``() = - (((len6 |> lookup 0) = "f") && ((len6 |> lookup 1) = "e") && ((len6 |> lookup 2) = "d") && ((len6 |> lookup 3) = "c") - && ((len6 |> lookup 4) = "b") && ((len6 |> lookup 5) = "a")) |> should equal true - -[] -let ``lookup length 7``() = - (((len7 |> lookup 0) = "g") && ((len7 |> lookup 1) = "f") && ((len7 |> lookup 2) = "e") && ((len7 |> lookup 3) = "d") - && ((len7 |> lookup 4) = "c") && ((len7 |> lookup 5) = "b") && ((len7 |> lookup 6) = "a")) |> should equal true - -[] -let ``lookup length 8``() = - (((len8 |> lookup 0) = "h") && ((len8 |> lookup 1) = "g") && ((len8 |> lookup 2) = "f") && ((len8 |> lookup 3) = "e") - && ((len8 |> lookup 4) = "d") && ((len8 |> lookup 5) = "c") && ((len8 |> lookup 6) = "b") && ((len8 |> lookup 7) = "a")) - |> should equal true - -[] -let ``lookup length 9``() = - (((len9 |> lookup 0) = "i") && ((len9 |> lookup 1) = "h") && ((len9 |> lookup 2) = "g") && ((len9 |> lookup 3) = "f") - && ((len9 |> lookup 4) = "e") && ((len9 |> lookup 5) = "d") && ((len9 |> lookup 6) = "c") && ((len9 |> lookup 7) = "b") - && ((len9 |> lookup 8) = "a")) |> should equal true - -[] -let ``lookup length 10``() = - (((lena |> lookup 0) = "j") && ((lena |> lookup 1) = "i") && ((lena |> lookup 2) = "h") && ((lena |> lookup 3) = "g") - && ((lena |> lookup 4) = "f") && ((lena |> lookup 5) = "e") && ((lena |> lookup 6) = "d") && ((lena |> lookup 7) = "c") - && ((lena |> lookup 8) = "b") && ((lena |> lookup 9) = "a")) |> should equal true - -[] -let ``tryLookup length 1``() = - let a = len1 |> tryLookup 0 - (a.Value = "a") |> should equal true - -[] -let ``tryLookup length 2``() = - let b = len2 |> tryLookup 0 - let a = len2 |> tryLookup 1 - ((b.Value = "b") && (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 3``() = - let c = len3 |> tryLookup 0 - let b = len3 |> tryLookup 1 - let a = len3 |> tryLookup 2 - ((c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 4``() = - let d = len4 |> tryLookup 0 - let c = len4 |> tryLookup 1 - let b = len4 |> tryLookup 2 - let a = len4 |> tryLookup 3 - ((d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 5``() = - let e = len5 |> tryLookup 0 - let d = len5 |> tryLookup 1 - let c = len5 |> tryLookup 2 - let b = len5 |> tryLookup 3 - let a = len5 |> tryLookup 4 - ((e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 6``() = - let f = len6 |> tryLookup 0 - let e = len6 |> tryLookup 1 - let d = len6 |> tryLookup 2 - let c = len6 |> tryLookup 3 - let b = len6 |> tryLookup 4 - let a = len6 |> tryLookup 5 - ((f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) - |> should equal true - -[] -let ``tryLookup length 7``() = - let g = len7 |> tryLookup 0 - let f = len7 |> tryLookup 1 - let e = len7 |> tryLookup 2 - let d = len7 |> tryLookup 3 - let c = len7 |> tryLookup 4 - let b = len7 |> tryLookup 5 - let a = len7 |> tryLookup 6 - ((g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") - && (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 8``() = - let h = len8 |> tryLookup 0 - let g = len8 |> tryLookup 1 - let f = len8 |> tryLookup 2 - let e = len8 |> tryLookup 3 - let d = len8 |> tryLookup 4 - let c = len8 |> tryLookup 5 - let b = len8 |> tryLookup 6 - let a = len8 |> tryLookup 7 - ((h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") - && (b.Value = "b")&& (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 9``() = - let i = len9 |> tryLookup 0 - let h = len9 |> tryLookup 1 - let g = len9 |> tryLookup 2 - let f = len9 |> tryLookup 3 - let e = len9 |> tryLookup 4 - let d = len9 |> tryLookup 5 - let c = len9 |> tryLookup 6 - let b = len9 |> tryLookup 7 - let a = len9 |> tryLookup 8 - ((i.Value = "i") && (h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") - && (c.Value = "c") && (b.Value = "b")&& (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 10``() = - let j = lena |> tryLookup 0 - let i = lena |> tryLookup 1 - let h = lena |> tryLookup 2 - let g = lena |> tryLookup 3 - let f = lena |> tryLookup 4 - let e = lena |> tryLookup 5 - let d = lena |> tryLookup 6 - let c = lena |> tryLookup 7 - let b = lena |> tryLookup 8 - let a = lena |> tryLookup 9 - ((j.Value = "j") && (i.Value = "i") && (h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") - && (d.Value = "d") && (c.Value = "c") && (b.Value = "b")&& (a.Value = "a")) |> should equal true - -[] -let ``tryLookup not found``() = - lena |> tryLookup 10 |> should equal None - -[] -let ``remove elements length 1``() = - len1 |> remove 0 |> isEmpty |> should equal true - -[] -let ``remove elements length 2``() = - let a = len2 |> remove 0 |> head - let b = len2 |> remove 1 |> head - ((a = "a") && (b = "b")) |> should equal true - -[] -let ``remove elements length 3``() = - let r0 = (ofSeq ["a";"b";"c"]) |> remove 0 - let b0 = head r0 - let t0 = tail r0 - let c0 = head t0 - - let r1 = (ofSeq ["a";"b";"c"]) |> remove 1 - let a1 = head r1 - let t1 = tail r1 - let c1 = head t1 - - let r2 = (ofSeq ["a";"b";"c"]) |> remove 2 - let a2 = head r2 - let t2 = tail r2 - let b2 = head t2 - - ((b0 = "b") && (c0 = "c") && (a1 = "a") && (c1 = "c") && (a2 = "a") && (b2 = "b")) |> should equal true - -[] -let ``remove elements length 4``() = - let r0 = (ofSeq ["a";"b";"c";"d"]) |> remove 0 - let b0 = head r0 - let t0 = tail r0 - let c0 = head t0 - let t01 = tail t0 - let d0 = head t01 - - let r1 = (ofSeq ["a";"b";"c";"d"]) |> remove 1 - let a1 = head r1 - let t11 = tail r1 - let c1 = head t11 - let t12 = tail t11 - let d1 = head t12 - - let r2 = (ofSeq ["a";"b";"c";"d"]) |> remove 2 - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 - - let r3 = (ofSeq ["a";"b";"c";"d"]) |> remove 3 - let a3 = head r3 - let t31 = tail r3 - let b3 = head t31 - let t32 = tail t31 - let c3 = head t32 - - ((b0 = "b") && (c0 = "c") && (d0 = "d") - && (a1 = "a") && (c1 = "c") && (d1 = "d") - && (a2 = "a") && (b2 = "b") && (c2 = "d") - && (a3 = "a") && (b3 = "b") && (c3 = "c")) |> should equal true - -[] -let ``remove elements length 5``() = - let r0 = (ofSeq ["a";"b";"c";"d";"e"]) |> remove 0 - let b0 = head r0 - let t01 = tail r0 - let c0 = head t01 - let t02= tail t01 - let d0 = head t02 - let t03 = tail t02 - let e0 = head t03 - - let r1 = (ofSeq ["a";"b";"c";"d";"e"]) |> remove 1 - let a1 = head r1 - let t11 = tail r1 - let c1 = head t11 - let t12 = tail t11 - let d1 = head t12 - let t13 = tail t12 - let e1 = head t13 - - let r2 = (ofSeq ["a";"b";"c";"d";"e"]) |> remove 2 - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 - let t23 = tail t22 - let e2 = head t23 - - let r3 = (ofSeq ["a";"b";"c";"d";"e"]) |> remove 3 - let a3 = head r3 - let t31 = tail r3 - let b3 = head t31 - let t32 = tail t31 - let c3 = head t32 - let t33 = tail t32 - let e3 = head t33 - - let r4 = (ofSeq ["a";"b";"c";"d";"e"]) |> remove 4 - let a4 = head r4 - let t41 = tail r4 - let b4 = head t41 - let t42 = tail t41 - let c4 = head t42 - let t43 = tail t42 - let d4 = head t43 - - ((b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") - && (a1 = "a") && (c1 = "c") && (d1 = "d") && (e1 = "e") - && (a2 = "a") && (b2 = "b") && (c2 = "d") && (e2 = "e") - && (a3 = "a") && (b3 = "b") && (c3 = "c") && (e3 = "e") - && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d")) |> should equal true - -[] -let ``remove elements length 6``() = - let r0 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> remove 0 - let b0 = head r0 - let t01 = tail r0 - let c0 = head t01 - let t02= tail t01 - let d0 = head t02 - let t03 = tail t02 - let e0 = head t03 - let t04 = tail t03 - let f0 = head t04 - - let r1 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> remove 1 - let a1 = head r1 - let t11 = tail r1 - let c1 = head t11 - let t12 = tail t11 - let d1 = head t12 - let t13 = tail t12 - let e1 = head t13 - let t14 = tail t13 - let f1 = head t14 - - let r2 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> remove 2 - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 - let t23 = tail t22 - let e2 = head t23 - let t24 = tail t23 - let f2 = head t24 - - let r3 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> remove 3 - let a3 = head r3 - let t31 = tail r3 - let b3 = head t31 - let t32 = tail t31 - let c3 = head t32 - let t33 = tail t32 - let e3 = head t33 - let t34 = tail t33 - let f3 = head t34 - - let r4 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> remove 4 - let a4 = head r4 - let t41 = tail r4 - let b4 = head t41 - let t42 = tail t41 - let c4 = head t42 - let t43 = tail t42 - let d4 = head t43 - let t44 = tail t43 - let f4 = head t44 - - let r5 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> remove 5 - let a5 = head r5 - let t51 = tail r5 - let b5 = head t51 - let t52 = tail t51 - let c5 = head t52 - let t53 = tail t52 - let d5 = head t53 - let t54 = tail t53 - let e5 = head t54 - - ((b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") && (f0 = "f") - && (a1 = "a") && (c1 = "c") && (d1 = "d") && (e1 = "e") && (f1 = "f") - && (a2 = "a") && (b2 = "b") && (c2 = "d") && (e2 = "e") && (f2 = "f") - && (a3 = "a") && (b3 = "b") && (c3 = "c") && (e3 = "e") && (f3 = "f") - && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d") && (f4 = "f") - && (a5 = "a") && (b5 = "b") && (c5 = "c") && (d5 = "d") && (e5 = "e")) |> should equal true - -[] -let ``tryRemoveempty``() = - (empty 3) |> tryRemove 0 |> should equal None - -[] -let ``tryRemove elements length 1``() = - let a = len1 |> tryRemove 0 - a.Value |> isEmpty |> should equal true - -[] -let ``tryRemove elements length 2``() = - let a = len2 |> tryRemove 0 - let a1 = head a.Value - let b = len2 |> tryRemove 1 - let b1 = head b.Value - ((a1 = "a") && (b1 = "b")) |> should equal true - -[] -let ``tryRemove elements length 3``() = - let x0 = (ofSeq ["a";"b";"c"]) |> tryRemove 0 - let r0 = x0.Value - let b0 = head r0 - let t0 = tail r0 - let c0 = head t0 - - let x1 = (ofSeq ["a";"b";"c"]) |> tryRemove 1 - let r1 = x1.Value - let a1 = head r1 - let t1 = tail r1 - let c1 = head t1 - - let x2 = (ofSeq ["a";"b";"c"]) |> tryRemove 2 - let r2 = x2.Value - let a2 = head r2 - let t2 = tail r2 - let b2 = head t2 - - ((b0 = "b") && (c0 = "c") && (a1 = "a") && (c1 = "c") && (a2 = "a") && (b2 = "b")) |> should equal true - -[] -let ``tryRemove elements length 4``() = - let x0 = (ofSeq ["a";"b";"c";"d"]) |> tryRemove 0 - let r0 = x0.Value - let b0 = head r0 - let t0 = tail r0 - let c0 = head t0 - let t01 = tail t0 - let d0 = head t01 - - let x1 = (ofSeq ["a";"b";"c";"d"]) |> tryRemove 1 - let r1 = x1.Value - let a1 = head r1 - let t11 = tail r1 - let c1 = head t11 - let t12 = tail t11 - let d1 = head t12 + let mid1 = + match d with + | RealTimeDeque.Cons(h, RealTimeDeque.Snoc(i, l)) -> i + | _ -> d + + let head, last = + match mid1 with + | RealTimeDeque.Cons(h, RealTimeDeque.Snoc(i, l)) -> h, l + | _ -> "x", "x" + + ((head = "e") && (last = "b")) |> Expect.isTrue "" } + + test "RealTimeDeque.rev RealTimeDeque.empty dqueue should be RealTimeDeque.empty" { + RealTimeDeque.isEmpty (RealTimeDeque.rev (RealTimeDeque.empty 2)) |> Expect.isTrue "" } + + test "RealTimeDeque.rev dqueue RealTimeDeque.length 1" { + ((RealTimeDeque.head (RealTimeDeque.rev len1) = "a") && (RealTimeDeque.head (RealTimeDeque.rev len1C3) = "a")) |> Expect.isTrue "" } + + test "RealTimeDeque.rev dqueue RealTimeDeque.length 2" { + let r1 = RealTimeDeque.rev len2 + let r1c = RealTimeDeque.rev len2C3 + let h1 = RealTimeDeque.head r1 + let h1c = RealTimeDeque.head r1c + let t2 = RealTimeDeque.tail r1 + let t2c = RealTimeDeque.tail r1c + let h2 = RealTimeDeque.head t2 + let h2c = RealTimeDeque.head t2c + + ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b")) |> Expect.isTrue "" } + + test "RealTimeDeque.rev dqueue RealTimeDeque.length 3" { + let r1 = RealTimeDeque.rev len3 + let r1c = RealTimeDeque.rev len3C3 + let h1 = RealTimeDeque.head r1 + let h1c = RealTimeDeque.head r1c + let t2 = RealTimeDeque.tail r1 + let t2c = RealTimeDeque.tail r1c + let h2 = RealTimeDeque.head t2 + let h2c = RealTimeDeque.head t2c + let t3 = RealTimeDeque.tail t2 + let t3c = RealTimeDeque.tail t2c + let h3 = RealTimeDeque.head t3 + let h3c = RealTimeDeque.head t3c + + ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c")) |> Expect.isTrue "" } + + test "RealTimeDeque.rev dqueue RealTimeDeque.length 4" { + let r1 = RealTimeDeque.rev len4 + let r1c = RealTimeDeque.rev len4C3 + let h1 = RealTimeDeque.head r1 + let h1c = RealTimeDeque.head r1c + let t2 = RealTimeDeque.tail r1 + let t2c = RealTimeDeque.tail r1c + let h2 = RealTimeDeque.head t2 + let h2c = RealTimeDeque.head t2c + let t3 = RealTimeDeque.tail t2 + let t3c = RealTimeDeque.tail t2c + let h3 = RealTimeDeque.head t3 + let h3c = RealTimeDeque.head t3c + let t4 = RealTimeDeque.tail t3 + let t4c = RealTimeDeque.tail t3c + let h4 = RealTimeDeque.head t4 + let h4c = RealTimeDeque.head t4c + + ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d")) |> Expect.isTrue "" } + + test "RealTimeDeque.rev dqueue RealTimeDeque.length 5" { + let r1 = RealTimeDeque.rev len5 + let r1c = RealTimeDeque.rev len5C3 + let h1 = RealTimeDeque.head r1 + let h1c = RealTimeDeque.head r1c + let t2 = RealTimeDeque.tail r1 + let t2c = RealTimeDeque.tail r1c + let h2 = RealTimeDeque.head t2 + let h2c = RealTimeDeque.head t2c + let t3 = RealTimeDeque.tail t2 + let t3c = RealTimeDeque.tail t2c + let h3 = RealTimeDeque.head t3 + let h3c = RealTimeDeque.head t3c + let t4 = RealTimeDeque.tail t3 + let t4c = RealTimeDeque.tail t3c + let h4 = RealTimeDeque.head t4 + let h4c = RealTimeDeque.head t4c + let t5 = RealTimeDeque.tail t4 + let t5c = RealTimeDeque.tail t4c + let h5 = RealTimeDeque.head t5 + let h5c = RealTimeDeque.head t5c + + ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") + && (h5 = "e") && (h5c = "e")) |> Expect.isTrue "" } + + //RealTimeDeque.length 6 more than sufficient to test RealTimeDeque.rev + test "RealTimeDeque.rev dqueue RealTimeDeque.length 6" { + let r1 = RealTimeDeque.rev len6 + let r1c = RealTimeDeque.rev len6C3 + let h1 = RealTimeDeque.head r1 + let h1c = RealTimeDeque.head r1c + let t2 = RealTimeDeque.tail r1 + let t2c = RealTimeDeque.tail r1c + let h2 = RealTimeDeque.head t2 + let h2c = RealTimeDeque.head t2c + let t3 = RealTimeDeque.tail t2 + let t3c = RealTimeDeque.tail t2c + let h3 = RealTimeDeque.head t3 + let h3c = RealTimeDeque.head t3c + let t4 = RealTimeDeque.tail t3 + let t4c = RealTimeDeque.tail t3c + let h4 = RealTimeDeque.head t4 + let h4c = RealTimeDeque.head t4c + let t5 = RealTimeDeque.tail t4 + let t5c = RealTimeDeque.tail t4c + let h5 = RealTimeDeque.head t5 + let h5c = RealTimeDeque.head t5c + let t6 = RealTimeDeque.tail t5 + let t6c = RealTimeDeque.tail t5c + let h6 = RealTimeDeque.head t6 + let h6c = RealTimeDeque.head t6c + + ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") + && (h5 = "e") && (h5c = "e") && (h6 = "f") && (h6c = "f")) |> Expect.isTrue "" } + + test "RealTimeDeque.ofSeq and RealTimeDeque.ofSeqC RealTimeDeque.empty" { + ((RealTimeDeque.isEmpty (RealTimeDeque.ofSeq [])) && (RealTimeDeque.isEmpty (RealTimeDeque.ofSeqC 3 []))) |> Expect.isTrue "" } + + test "RealTimeDeque.ofSeq and RealTimeDeque.ofSeqC RealTimeDeque.length 1" { + ((RealTimeDeque.head (RealTimeDeque.ofSeq ["a"]) = "a") && (RealTimeDeque.head (RealTimeDeque.ofSeqC 3 ["a"]) = "a")) |> Expect.isTrue "" } + + test "RealTimeDeque.ofSeq and RealTimeDeque.ofSeqC RealTimeDeque.length 2" { + let r1 = RealTimeDeque.ofSeq ["a";"b"] + let r1c = RealTimeDeque.ofSeqC 3 ["a";"b"] + let h1 = RealTimeDeque.head r1 + let h1c = RealTimeDeque.head r1c + let t2 = RealTimeDeque.tail r1 + let t2c = RealTimeDeque.tail r1c + let h2 = RealTimeDeque.head t2 + let h2c = RealTimeDeque.head t2c + + ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b")) |> Expect.isTrue "" } + + test "RealTimeDeque.ofSeq and RealTimeDeque.ofSeqC RealTimeDeque.length 3" { + let r1 = RealTimeDeque.ofSeq ["a";"b";"c"] + let r1c = RealTimeDeque.ofSeqC 3 ["a";"b";"c"] + let h1 = RealTimeDeque.head r1 + let h1c = RealTimeDeque.head r1c + let t2 = RealTimeDeque.tail r1 + let t2c = RealTimeDeque.tail r1c + let h2 = RealTimeDeque.head t2 + let h2c = RealTimeDeque.head t2c + let t3 = RealTimeDeque.tail t2 + let t3c = RealTimeDeque.tail t2c + let h3 = RealTimeDeque.head t3 + let h3c = RealTimeDeque.head t3c + + ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c")) |> Expect.isTrue "" } + + test "RealTimeDeque.ofSeq and RealTimeDeque.ofSeqC RealTimeDeque.length 4" { + let r1 = RealTimeDeque.ofSeq ["a";"b";"c";"d"] + let r1c = RealTimeDeque.ofSeqC 3 ["a";"b";"c";"d"] + let h1 = RealTimeDeque.head r1 + let h1c = RealTimeDeque.head r1c + let t2 = RealTimeDeque.tail r1 + let t2c = RealTimeDeque.tail r1c + let h2 = RealTimeDeque.head t2 + let h2c = RealTimeDeque.head t2c + let t3 = RealTimeDeque.tail t2 + let t3c = RealTimeDeque.tail t2c + let h3 = RealTimeDeque.head t3 + let h3c = RealTimeDeque.head t3c + let t4 = RealTimeDeque.tail t3 + let t4c = RealTimeDeque.tail t3c + let h4 = RealTimeDeque.head t4 + let h4c = RealTimeDeque.head t4c + + ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d")) |> Expect.isTrue "" } + + //RealTimeDeque.length 5 more than sufficient to test RealTimeDeque.ofSeq and RealTimeDeque.ofSeqC + test "RealTimeDeque.ofSeq and RealTimeDeque.ofSeqC RealTimeDeque.length 5" { + let r1 = RealTimeDeque.ofSeq ["a";"b";"c";"d";"e"] + let r1c = RealTimeDeque.ofSeqC 3 ["a";"b";"c";"d";"e"] + let h1 = RealTimeDeque.head r1 + let h1c = RealTimeDeque.head r1c + let t2 = RealTimeDeque.tail r1 + let t2c = RealTimeDeque.tail r1c + let h2 = RealTimeDeque.head t2 + let h2c = RealTimeDeque.head t2c + let t3 = RealTimeDeque.tail t2 + let t3c = RealTimeDeque.tail t2c + let h3 = RealTimeDeque.head t3 + let h3c = RealTimeDeque.head t3c + let t4 = RealTimeDeque.tail t3 + let t4c = RealTimeDeque.tail t3c + let h4 = RealTimeDeque.head t4 + let h4c = RealTimeDeque.head t4c + let t5 = RealTimeDeque.tail t4 + let t5c = RealTimeDeque.tail t4c + let h5 = RealTimeDeque.head t5 + let h5c = RealTimeDeque.head t5c + + ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") + && (h5 = "e") && (h5c = "e")) |> Expect.isTrue "" } + + //RealTimeDeque.length 5 more than sufficient to test RealTimeDeque.ofSeq and RealTimeDeque.ofSeqC + test "RealTimeDeque.ofSeq and RealTimeDeque.ofSeqC RealTimeDeque.length 6" { + let r1 = RealTimeDeque.ofSeq ["a";"b";"c";"d";"e";"f"] + let r1c = RealTimeDeque.ofSeqC 3 ["a";"b";"c";"d";"e";"f"] + let h1 = RealTimeDeque.head r1 + let h1c = RealTimeDeque.head r1c + let t2 = RealTimeDeque.tail r1 + let t2c = RealTimeDeque.tail r1c + let h2 = RealTimeDeque.head t2 + let h2c = RealTimeDeque.head t2c + let t3 = RealTimeDeque.tail t2 + let t3c = RealTimeDeque.tail t2c + let h3 = RealTimeDeque.head t3 + let h3c = RealTimeDeque.head t3c + let t4 = RealTimeDeque.tail t3 + let t4c = RealTimeDeque.tail t3c + let h4 = RealTimeDeque.head t4 + let h4c = RealTimeDeque.head t4c + let t5 = RealTimeDeque.tail t4 + let t5c = RealTimeDeque.tail t4c + let h5 = RealTimeDeque.head t5 + let h5c = RealTimeDeque.head t5c + let t6 = RealTimeDeque.tail t5 + let t6c = RealTimeDeque.tail t5c + let h6 = RealTimeDeque.head t6 + let h6c = RealTimeDeque.head t6c + + ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") + && (h5 = "e") && (h5c = "e") && (h6 = "f") && (h6c = "f")) |> Expect.isTrue "" } + + test "appending RealTimeDeque.empty dqueus" { + ((RealTimeDeque.isEmpty (RealTimeDeque.append (RealTimeDeque.ofSeq []) (RealTimeDeque.ofSeq []) )) && (RealTimeDeque.isEmpty (RealTimeDeque.append (RealTimeDeque.empty 3) (RealTimeDeque.empty 3))) + ) |> Expect.isTrue "" } + + test "appending RealTimeDeque.empty and RealTimeDeque.length 1" { + ((RealTimeDeque.head (RealTimeDeque.append (RealTimeDeque.ofSeq []) len1) = "a") && (RealTimeDeque.head (RealTimeDeque.append len1 (RealTimeDeque.empty 3)) = "a")) |> Expect.isTrue "" } + + test "appending RealTimeDeque.empty and RealTimeDeque.length 2" { + let r1 = RealTimeDeque.append (RealTimeDeque.ofSeq []) (RealTimeDeque.ofSeq ["a";"b"]) + let r1c = RealTimeDeque.append (RealTimeDeque.empty 3) (RealTimeDeque.ofSeqC 3 ["a";"b"]) + let h1 = RealTimeDeque.head r1 + let h1c = RealTimeDeque.head r1c + let t2 = RealTimeDeque.tail r1 + let t2c = RealTimeDeque.tail r1c + let h2 = RealTimeDeque.head t2 + let h2c = RealTimeDeque.head t2c + + let r1r = RealTimeDeque.append (RealTimeDeque.ofSeq ["a";"b"]) (RealTimeDeque.ofSeq []) + let r1cr = RealTimeDeque.append (RealTimeDeque.ofSeqC 3 ["a";"b"]) (RealTimeDeque.empty 3) + let h1r = RealTimeDeque.head r1r + let h1cr = RealTimeDeque.head r1cr + let t2r = RealTimeDeque.tail r1r + let t2cr = RealTimeDeque.tail r1cr + let h2r = RealTimeDeque.head t2r + let h2cr = RealTimeDeque.head t2cr + + ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") + && (h1r = "a") && (h1cr = "a") && (h2r = "b") && (h2cr = "b")) |> Expect.isTrue "" } + + test "appending RealTimeDeque.length 1 and RealTimeDeque.length 2" { + let r1 = RealTimeDeque.append (RealTimeDeque.ofSeq ["a"]) (RealTimeDeque.ofSeq ["b";"c"]) + let r1c = RealTimeDeque.append (RealTimeDeque.ofSeqC 3 ["a"]) (RealTimeDeque.ofSeqC 3 ["b";"c"]) + let h1 = RealTimeDeque.head r1 + let h1c = RealTimeDeque.head r1c + let t2 = RealTimeDeque.tail r1 + let t2c = RealTimeDeque.tail r1c + let h2 = RealTimeDeque.head t2 + let h2c = RealTimeDeque.head t2c + let t3 = RealTimeDeque.tail t2 + let t3c = RealTimeDeque.tail t2c + let h3 = RealTimeDeque.head t3 + let h3c = RealTimeDeque.head t3c + + let r1r = RealTimeDeque.append (RealTimeDeque.ofSeq ["a";"b"]) (RealTimeDeque.ofSeq ["c"]) + let r1cr = RealTimeDeque.append (RealTimeDeque.ofSeqC 3 ["a";"b"]) (RealTimeDeque.ofSeqC 3 ["c"]) + let h1r = RealTimeDeque.head r1r + let h1cr = RealTimeDeque.head r1cr + let t2r = RealTimeDeque.tail r1r + let t2cr = RealTimeDeque.tail r1cr + let h2r = RealTimeDeque.head t2r + let h2cr = RealTimeDeque.head t2cr + let t3r = RealTimeDeque.tail t2r + let t3cr = RealTimeDeque.tail t2cr + let h3r = RealTimeDeque.head t3r + let h3cr = RealTimeDeque.head t3cr + + ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") + && (h1r = "a") && (h1cr = "a") && (h2r = "b") && (h2cr = "b") && (h3r = "c") && (h3cr = "c")) |> Expect.isTrue "" } + + test "appending RealTimeDeque.length 1 and RealTimeDeque.length 3" { + let r1 = RealTimeDeque.append (RealTimeDeque.ofSeq ["a"]) (RealTimeDeque.ofSeq ["b";"c";"d"]) + let r1c = RealTimeDeque.append (RealTimeDeque.ofSeqC 3 ["a"]) (RealTimeDeque.ofSeqC 3 ["b";"c";"d"]) + let h1 = RealTimeDeque.head r1 + let h1c = RealTimeDeque.head r1c + let t2 = RealTimeDeque.tail r1 + let t2c = RealTimeDeque.tail r1c + let h2 = RealTimeDeque.head t2 + let h2c = RealTimeDeque.head t2c + let t3 = RealTimeDeque.tail t2 + let t3c = RealTimeDeque.tail t2c + let h3 = RealTimeDeque.head t3 + let h3c = RealTimeDeque.head t3c + let t4 = RealTimeDeque.tail t3 + let t4c = RealTimeDeque.tail t3c + let h4 = RealTimeDeque.head t4 + let h4c = RealTimeDeque.head t4c + + let r1r = RealTimeDeque.append (RealTimeDeque.ofSeq ["a";"b";"c"]) (RealTimeDeque.ofSeq ["d"]) + let r1cr = RealTimeDeque.append (RealTimeDeque.ofSeqC 3 ["a";"b";"c"]) (RealTimeDeque.ofSeqC 3 ["d"]) + let h1r = RealTimeDeque.head r1r + let h1cr = RealTimeDeque.head r1cr + let t2r = RealTimeDeque.tail r1r + let t2cr = RealTimeDeque.tail r1cr + let h2r = RealTimeDeque.head t2r + let h2cr = RealTimeDeque.head t2cr + let t3r = RealTimeDeque.tail t2r + let t3cr = RealTimeDeque.tail t2cr + let h3r = RealTimeDeque.head t3r + let h3cr = RealTimeDeque.head t3cr + let t4r = RealTimeDeque.tail t3r + let t4cr = RealTimeDeque.tail t3cr + let h4r = RealTimeDeque.head t4r + let h4cr = RealTimeDeque.head t4cr + + ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") + && (h1r = "a") && (h1cr = "a") && (h2r = "b") && (h2cr = "b") && (h3r = "c") && (h3cr = "c") && (h4r = "d") && (h4cr = "d")) |> Expect.isTrue "" } + + test "appending RealTimeDeque.length 1 and RealTimeDeque.length 4" { + let r1 = RealTimeDeque.append (RealTimeDeque.ofSeq ["a"]) (RealTimeDeque.ofSeq ["b";"c";"d";"e"]) + let r1c = RealTimeDeque.append (RealTimeDeque.ofSeqC 3 ["a"]) (RealTimeDeque.ofSeqC 3 ["b";"c";"d";"e"]) + let h1 = RealTimeDeque.head r1 + let h1c = RealTimeDeque.head r1c + let t2 = RealTimeDeque.tail r1 + let t2c = RealTimeDeque.tail r1c + let h2 = RealTimeDeque.head t2 + let h2c = RealTimeDeque.head t2c + let t3 = RealTimeDeque.tail t2 + let t3c = RealTimeDeque.tail t2c + let h3 = RealTimeDeque.head t3 + let h3c = RealTimeDeque.head t3c + let t4 = RealTimeDeque.tail t3 + let t4c = RealTimeDeque.tail t3c + let h4 = RealTimeDeque.head t4 + let h4c = RealTimeDeque.head t4c + + let t5 = RealTimeDeque.tail t4 + let t5c = RealTimeDeque.tail t4c + let h5 = RealTimeDeque.head t5 + let h5c = RealTimeDeque.head t5c + + let r1r = RealTimeDeque.append (RealTimeDeque.ofSeq ["a";"b";"c";"d"]) (RealTimeDeque.ofSeq ["e"]) + let r1cr = RealTimeDeque.append (RealTimeDeque.ofSeqC 3 ["a";"b";"c";"d"]) (RealTimeDeque.ofSeqC 3 ["e"]) + let h1r = RealTimeDeque.head r1r + let h1cr = RealTimeDeque.head r1cr + let t2r = RealTimeDeque.tail r1r + let t2cr = RealTimeDeque.tail r1cr + let h2r = RealTimeDeque.head t2r + let h2cr = RealTimeDeque.head t2cr + let t3r = RealTimeDeque.tail t2r + let t3cr = RealTimeDeque.tail t2cr + let h3r = RealTimeDeque.head t3r + let h3cr = RealTimeDeque.head t3cr + let t4r = RealTimeDeque.tail t3r + let t4cr = RealTimeDeque.tail t3cr + let h4r = RealTimeDeque.head t4r + let h4cr = RealTimeDeque.head t4cr + + let t5r = RealTimeDeque.tail t4r + let t5cr = RealTimeDeque.tail t4cr + let h5r = RealTimeDeque.head t5r + let h5cr = RealTimeDeque.head t5cr + + ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") + && (h5 = "e") && (h5c = "e") + && (h1r = "a") && (h1cr = "a") && (h2r = "b") && (h2cr = "b") && (h3r = "c") && (h3cr = "c") && (h4r = "d") && (h4cr = "d") + && (h5r = "e") && (h5cr = "e")) |> Expect.isTrue "" } + + test "appending RealTimeDeque.length 1 and RealTimeDeque.length 5" { + let r1 = RealTimeDeque.append (RealTimeDeque.ofSeq ["a"]) (RealTimeDeque.ofSeq ["b";"c";"d";"e";"f"]) + let r1c = RealTimeDeque.append (RealTimeDeque.ofSeqC 3 ["a"]) (RealTimeDeque.ofSeqC 3 ["b";"c";"d";"e";"f"]) + let h1 = RealTimeDeque.head r1 + let h1c = RealTimeDeque.head r1c + let t2 = RealTimeDeque.tail r1 + let t2c = RealTimeDeque.tail r1c + let h2 = RealTimeDeque.head t2 + let h2c = RealTimeDeque.head t2c + let t3 = RealTimeDeque.tail t2 + let t3c = RealTimeDeque.tail t2c + let h3 = RealTimeDeque.head t3 + let h3c = RealTimeDeque.head t3c + let t4 = RealTimeDeque.tail t3 + let t4c = RealTimeDeque.tail t3c + let h4 = RealTimeDeque.head t4 + let h4c = RealTimeDeque.head t4c + let t5 = RealTimeDeque.tail t4 + let t5c = RealTimeDeque.tail t4c + let h5 = RealTimeDeque.head t5 + let h5c = RealTimeDeque.head t5c + let t6 = RealTimeDeque.tail t5 + let t6c = RealTimeDeque.tail t5c + let h6 = RealTimeDeque.head t6 + let h6c = RealTimeDeque.head t6c + + let r1r = RealTimeDeque.append (RealTimeDeque.ofSeq ["a";"b";"c";"d";"e"]) (RealTimeDeque.ofSeq ["f"]) + let r1cr = RealTimeDeque.append (RealTimeDeque.ofSeqC 3 ["a";"b";"c";"d";"e"]) (RealTimeDeque.ofSeqC 3 ["f"]) + let h1r = RealTimeDeque.head r1r + let h1cr = RealTimeDeque.head r1cr + let t2r = RealTimeDeque.tail r1r + let t2cr = RealTimeDeque.tail r1cr + let h2r = RealTimeDeque.head t2r + let h2cr = RealTimeDeque.head t2cr + let t3r = RealTimeDeque.tail t2r + let t3cr = RealTimeDeque.tail t2cr + let h3r = RealTimeDeque.head t3r + let h3cr = RealTimeDeque.head t3cr + let t4r = RealTimeDeque.tail t3r + let t4cr = RealTimeDeque.tail t3cr + let h4r = RealTimeDeque.head t4r + let h4cr = RealTimeDeque.head t4cr + let t5r = RealTimeDeque.tail t4r + let t5cr = RealTimeDeque.tail t4cr + let h5r = RealTimeDeque.head t5r + let h5cr = RealTimeDeque.head t5cr + let t6r = RealTimeDeque.tail t5r + let t6cr = RealTimeDeque.tail t5cr + let h6r = RealTimeDeque.head t6r + let h6cr = RealTimeDeque.head t6cr + + ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") + && (h5 = "e") && (h5c = "e") && (h6 = "f") && (h6c = "f") + && (h1r = "a") && (h1cr = "a") && (h2r = "b") && (h2cr = "b") && (h3r = "c") && (h3cr = "c") && (h4r = "d") && (h4cr = "d") + && (h5r = "e") && (h5cr = "e") && (h6r = "f") && (h6cr = "f")) |> Expect.isTrue "" } + + test "appending RealTimeDeque.length 2 and RealTimeDeque.length 2" { + let r1 = RealTimeDeque.append (RealTimeDeque.ofSeq ["a";"b"]) (RealTimeDeque.ofSeq ["c";"d"]) + let r1c = RealTimeDeque.append (RealTimeDeque.ofSeqC 3 ["a";"b"]) (RealTimeDeque.ofSeqC 3 ["c";"d"]) + let h1 = RealTimeDeque.head r1 + let h1c = RealTimeDeque.head r1c + let t2 = RealTimeDeque.tail r1 + let t2c = RealTimeDeque.tail r1c + let h2 = RealTimeDeque.head t2 + let h2c = RealTimeDeque.head t2c + let t3 = RealTimeDeque.tail t2 + let t3c = RealTimeDeque.tail t2c + let h3 = RealTimeDeque.head t3 + let h3c = RealTimeDeque.head t3c + let t4 = RealTimeDeque.tail t3 + let t4c = RealTimeDeque.tail t3c + let h4 = RealTimeDeque.head t4 + let h4c = RealTimeDeque.head t4c + + ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d")) |> Expect.isTrue "" } + + test "appending RealTimeDeque.length 2 and RealTimeDeque.length 3" { + let r1 = RealTimeDeque.append (RealTimeDeque.ofSeq ["a";"b"]) (RealTimeDeque.ofSeq ["c";"d";"e"]) + let r1c = RealTimeDeque.append (RealTimeDeque.ofSeqC 3 ["a";"b"]) (RealTimeDeque.ofSeqC 3 ["c";"d";"e"]) + let h1 = RealTimeDeque.head r1 + let h1c = RealTimeDeque.head r1c + let t2 = RealTimeDeque.tail r1 + let t2c = RealTimeDeque.tail r1c + let h2 = RealTimeDeque.head t2 + let h2c = RealTimeDeque.head t2c + let t3 = RealTimeDeque.tail t2 + let t3c = RealTimeDeque.tail t2c + let h3 = RealTimeDeque.head t3 + let h3c = RealTimeDeque.head t3c + let t4 = RealTimeDeque.tail t3 + let t4c = RealTimeDeque.tail t3c + let h4 = RealTimeDeque.head t4 + let h4c = RealTimeDeque.head t4c + + let t5 = RealTimeDeque.tail t4 + let t5c = RealTimeDeque.tail t4c + let h5 = RealTimeDeque.head t5 + let h5c = RealTimeDeque.head t5c + + let r1r = RealTimeDeque.append (RealTimeDeque.ofSeq ["a";"b";"c"]) (RealTimeDeque.ofSeq ["d";"e"]) + let r1cr = RealTimeDeque.append (RealTimeDeque.ofSeqC 3 ["a";"b";"c"]) (RealTimeDeque.ofSeqC 3 ["d";"e"]) + let h1r = RealTimeDeque.head r1r + let h1cr = RealTimeDeque.head r1cr + let t2r = RealTimeDeque.tail r1r + let t2cr = RealTimeDeque.tail r1cr + let h2r = RealTimeDeque.head t2r + let h2cr = RealTimeDeque.head t2cr + let t3r = RealTimeDeque.tail t2r + let t3cr = RealTimeDeque.tail t2cr + let h3r = RealTimeDeque.head t3r + let h3cr = RealTimeDeque.head t3cr + let t4r = RealTimeDeque.tail t3r + let t4cr = RealTimeDeque.tail t3cr + let h4r = RealTimeDeque.head t4r + let h4cr = RealTimeDeque.head t4cr + + let t5r = RealTimeDeque.tail t4r + let t5cr = RealTimeDeque.tail t4cr + let h5r = RealTimeDeque.head t5r + let h5cr = RealTimeDeque.head t5cr + + ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") + && (h5 = "e") && (h5c = "e") + && (h1r = "a") && (h1cr = "a") && (h2r = "b") && (h2cr = "b") && (h3r = "c") && (h3cr = "c") && (h4r = "d") && (h4cr = "d") + && (h5r = "e") && (h5cr = "e")) |> Expect.isTrue "" } + + test "appending RealTimeDeque.length 2 and RealTimeDeque.length 4" { + let r1 = RealTimeDeque.append (RealTimeDeque.ofSeq ["a";"b"]) (RealTimeDeque.ofSeq ["c";"d";"e";"f"]) + let r1c = RealTimeDeque.append (RealTimeDeque.ofSeqC 3 ["a";"b"]) (RealTimeDeque.ofSeqC 3 ["c";"d";"e";"f"]) + let h1 = RealTimeDeque.head r1 + let h1c = RealTimeDeque.head r1c + let t2 = RealTimeDeque.tail r1 + let t2c = RealTimeDeque.tail r1c + let h2 = RealTimeDeque.head t2 + let h2c = RealTimeDeque.head t2c + let t3 = RealTimeDeque.tail t2 + let t3c = RealTimeDeque.tail t2c + let h3 = RealTimeDeque.head t3 + let h3c = RealTimeDeque.head t3c + let t4 = RealTimeDeque.tail t3 + let t4c = RealTimeDeque.tail t3c + let h4 = RealTimeDeque.head t4 + let h4c = RealTimeDeque.head t4c + let t5 = RealTimeDeque.tail t4 + let t5c = RealTimeDeque.tail t4c + let h5 = RealTimeDeque.head t5 + let h5c = RealTimeDeque.head t5c + let t6 = RealTimeDeque.tail t5 + let t6c = RealTimeDeque.tail t5c + let h6 = RealTimeDeque.head t6 + let h6c = RealTimeDeque.head t6c + + let r1r = RealTimeDeque.append (RealTimeDeque.ofSeq ["a";"b";"c";"d"]) (RealTimeDeque.ofSeq ["e";"f"]) + let r1cr = RealTimeDeque.append (RealTimeDeque.ofSeqC 3 ["a";"b";"c";"d"]) (RealTimeDeque.ofSeqC 3 ["e";"f"]) + let h1r = RealTimeDeque.head r1r + let h1cr = RealTimeDeque.head r1cr + let t2r = RealTimeDeque.tail r1r + let t2cr = RealTimeDeque.tail r1cr + let h2r = RealTimeDeque.head t2r + let h2cr = RealTimeDeque.head t2cr + let t3r = RealTimeDeque.tail t2r + let t3cr = RealTimeDeque.tail t2cr + let h3r = RealTimeDeque.head t3r + let h3cr = RealTimeDeque.head t3cr + let t4r = RealTimeDeque.tail t3r + let t4cr = RealTimeDeque.tail t3cr + let h4r = RealTimeDeque.head t4r + let h4cr = RealTimeDeque.head t4cr + let t5r = RealTimeDeque.tail t4r + let t5cr = RealTimeDeque.tail t4cr + let h5r = RealTimeDeque.head t5r + let h5cr = RealTimeDeque.head t5cr + let t6r = RealTimeDeque.tail t5r + let t6cr = RealTimeDeque.tail t5cr + let h6r = RealTimeDeque.head t6r + let h6cr = RealTimeDeque.head t6cr + + ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") + && (h5 = "e") && (h5c = "e") && (h6 = "f") && (h6c = "f") + && (h1r = "a") && (h1cr = "a") && (h2r = "b") && (h2cr = "b") && (h3r = "c") && (h3cr = "c") && (h4r = "d") && (h4cr = "d") + && (h5r = "e") && (h5cr = "e") && (h6r = "f") && (h6cr = "f")) |> Expect.isTrue "" } + + test "appending RealTimeDeque.length 2 and RealTimeDeque.length 5" { + let r1 = RealTimeDeque.append (RealTimeDeque.ofSeq ["a";"b"]) (RealTimeDeque.ofSeq ["c";"d";"e";"f";"g"]) + let r1c = RealTimeDeque.append (RealTimeDeque.ofSeqC 3 ["a";"b"]) (RealTimeDeque.ofSeqC 3 ["c";"d";"e";"f";"g"]) + let h1 = RealTimeDeque.head r1 + let h1c = RealTimeDeque.head r1c + let t2 = RealTimeDeque.tail r1 + let t2c = RealTimeDeque.tail r1c + let h2 = RealTimeDeque.head t2 + let h2c = RealTimeDeque.head t2c + let t3 = RealTimeDeque.tail t2 + let t3c = RealTimeDeque.tail t2c + let h3 = RealTimeDeque.head t3 + let h3c = RealTimeDeque.head t3c + let t4 = RealTimeDeque.tail t3 + let t4c = RealTimeDeque.tail t3c + let h4 = RealTimeDeque.head t4 + let h4c = RealTimeDeque.head t4c + let t5 = RealTimeDeque.tail t4 + let t5c = RealTimeDeque.tail t4c + let h5 = RealTimeDeque.head t5 + let h5c = RealTimeDeque.head t5c + let t6 = RealTimeDeque.tail t5 + let t6c = RealTimeDeque.tail t5c + let h6 = RealTimeDeque.head t6 + let h6c = RealTimeDeque.head t6c + let t7 = RealTimeDeque.tail t6 + let t7c = RealTimeDeque.tail t6c + let h7 = RealTimeDeque.head t7 + let h7c = RealTimeDeque.head t7c + + let r1r = RealTimeDeque.append (RealTimeDeque.ofSeq ["a";"b";"c";"d";"e"]) (RealTimeDeque.ofSeq ["f";"g"]) + let r1cr = RealTimeDeque.append (RealTimeDeque.ofSeqC 3 ["a";"b";"c";"d";"e"]) (RealTimeDeque.ofSeqC 3 ["f";"g"]) + let h1r = RealTimeDeque.head r1r + let h1cr = RealTimeDeque.head r1cr + let t2r = RealTimeDeque.tail r1r + let t2cr = RealTimeDeque.tail r1cr + let h2r = RealTimeDeque.head t2r + let h2cr = RealTimeDeque.head t2cr + let t3r = RealTimeDeque.tail t2r + let t3cr = RealTimeDeque.tail t2cr + let h3r = RealTimeDeque.head t3r + let h3cr = RealTimeDeque.head t3cr + let t4r = RealTimeDeque.tail t3r + let t4cr = RealTimeDeque.tail t3cr + let h4r = RealTimeDeque.head t4r + let h4cr = RealTimeDeque.head t4cr + let t5r = RealTimeDeque.tail t4r + let t5cr = RealTimeDeque.tail t4cr + let h5r = RealTimeDeque.head t5r + let h5cr = RealTimeDeque.head t5cr + let t6r = RealTimeDeque.tail t5r + let t6cr = RealTimeDeque.tail t5cr + let h6r = RealTimeDeque.head t6r + let h6cr = RealTimeDeque.head t6cr + let t7r = RealTimeDeque.tail t6r + let t7cr = RealTimeDeque.tail t6cr + let h7r = RealTimeDeque.head t7r + let h7cr = RealTimeDeque.head t7cr + + ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") + && (h5 = "e") && (h5c = "e") && (h6 = "f") && (h6c = "f") && (h7 = "g") && (h7c = "g") + && (h1r = "a") && (h1cr = "a") && (h2r = "b") && (h2cr = "b") && (h3r = "c") && (h3cr = "c") && (h4r = "d") && (h4cr = "d") + && (h5r = "e") && (h5cr = "e") && (h6r = "f") && (h6cr = "f") && (h7r = "g") && (h7cr = "g")) |> Expect.isTrue "" } + + test "appending RealTimeDeque.length 3 and RealTimeDeque.length 3" { + let r1 = RealTimeDeque.append (RealTimeDeque.ofSeq ["a";"b";"c"]) (RealTimeDeque.ofSeq ["d";"e";"f"]) + let r1c = RealTimeDeque.append (RealTimeDeque.ofSeqC 3 ["a";"b";"c"]) (RealTimeDeque.ofSeqC 3 ["d";"e";"f"]) + let h1 = RealTimeDeque.head r1 + let h1c = RealTimeDeque.head r1c + let t2 = RealTimeDeque.tail r1 + let t2c = RealTimeDeque.tail r1c + let h2 = RealTimeDeque.head t2 + let h2c = RealTimeDeque.head t2c + let t3 = RealTimeDeque.tail t2 + let t3c = RealTimeDeque.tail t2c + let h3 = RealTimeDeque.head t3 + let h3c = RealTimeDeque.head t3c + let t4 = RealTimeDeque.tail t3 + let t4c = RealTimeDeque.tail t3c + let h4 = RealTimeDeque.head t4 + let h4c = RealTimeDeque.head t4c + let t5 = RealTimeDeque.tail t4 + let t5c = RealTimeDeque.tail t4c + let h5 = RealTimeDeque.head t5 + let h5c = RealTimeDeque.head t5c + let t6 = RealTimeDeque.tail t5 + let t6c = RealTimeDeque.tail t5c + let h6 = RealTimeDeque.head t6 + let h6c = RealTimeDeque.head t6c + + ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") + && (h5 = "e") && (h5c = "e") && (h6 = "f") && (h6c = "f")) |> Expect.isTrue "" } + + test "appending RealTimeDeque.length 6 and RealTimeDeque.length 7" { + let r1 = RealTimeDeque.append (RealTimeDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) (RealTimeDeque.ofSeq ["g";"h";"i";"j";"k";"l";"m"]) + let r1c = RealTimeDeque.append (RealTimeDeque.ofSeqC 3 ["a";"b";"c";"d";"e";"f"]) (RealTimeDeque.ofSeqC 3 ["g";"h";"i";"j";"k";"l";"m"]) + let h1 = RealTimeDeque.head r1 + let h1c = RealTimeDeque.head r1c + let t2 = RealTimeDeque.tail r1 + let t2c = RealTimeDeque.tail r1c + let h2 = RealTimeDeque.head t2 + let h2c = RealTimeDeque.head t2c + let t3 = RealTimeDeque.tail t2 + let t3c = RealTimeDeque.tail t2c + let h3 = RealTimeDeque.head t3 + let h3c = RealTimeDeque.head t3c + let t4 = RealTimeDeque.tail t3 + let t4c = RealTimeDeque.tail t3c + let h4 = RealTimeDeque.head t4 + let h4c = RealTimeDeque.head t4c + let t5 = RealTimeDeque.tail t4 + let t5c = RealTimeDeque.tail t4c + let h5 = RealTimeDeque.head t5 + let h5c = RealTimeDeque.head t5c + let t6 = RealTimeDeque.tail t5 + let t6c = RealTimeDeque.tail t5c + let h6 = RealTimeDeque.head t6 + let h6c = RealTimeDeque.head t6c + let h6 = RealTimeDeque.head t6 + let h6c = RealTimeDeque.head t6c + let t7 = RealTimeDeque.tail t6 + let t7c = RealTimeDeque.tail t6c + let h7 = RealTimeDeque.head t7 + let h7c = RealTimeDeque.head t7c + let h7 = RealTimeDeque.head t7 + let h7c = RealTimeDeque.head t7c + let t8 = RealTimeDeque.tail t7 + let t8c = RealTimeDeque.tail t7c + let h8 = RealTimeDeque.head t8 + let h8c = RealTimeDeque.head t8c + let h8 = RealTimeDeque.head t8 + let h8c = RealTimeDeque.head t8c + let t9 = RealTimeDeque.tail t8 + let t9c = RealTimeDeque.tail t8c + let h9 = RealTimeDeque.head t9 + let h9c = RealTimeDeque.head t9c + let h9 = RealTimeDeque.head t9 + let h9c = RealTimeDeque.head t9c + let t10 = RealTimeDeque.tail t9 + let t10c = RealTimeDeque.tail t9c + let h10 = RealTimeDeque.head t10 + let h10c = RealTimeDeque.head t10c + let h10 = RealTimeDeque.head t10 + let h10c = RealTimeDeque.head t10c + let t11 = RealTimeDeque.tail t10 + let t11c = RealTimeDeque.tail t10c + let h11 = RealTimeDeque.head t11 + let h11c = RealTimeDeque.head t11c + let h11 = RealTimeDeque.head t11 + let h11c = RealTimeDeque.head t11c + let t12 = RealTimeDeque.tail t11 + let t12c = RealTimeDeque.tail t11c + let h12 = RealTimeDeque.head t12 + let h12c = RealTimeDeque.head t12c + let h12 = RealTimeDeque.head t12 + let h12c = RealTimeDeque.head t12c + let t13 = RealTimeDeque.tail t12 + let t13c = RealTimeDeque.tail t12c + let h13 = RealTimeDeque.head t13 + let h13c = RealTimeDeque.head t13c + let h13 = RealTimeDeque.head t13 + let h13c = RealTimeDeque.head t13c + + let r1r = RealTimeDeque.append (RealTimeDeque.ofSeq ["a";"b";"c";"d";"e";"f";"g"]) (RealTimeDeque.ofSeq ["h";"i";"j";"k";"l";"m"]) + let r1cr = RealTimeDeque.append (RealTimeDeque.ofSeqC 3 ["a";"b";"c";"d";"e";"f";"g"]) (RealTimeDeque.ofSeqC 3 ["h";"i";"j";"k";"l";"m"]) + let h1r = RealTimeDeque.head r1r + let h1cr = RealTimeDeque.head r1cr + let t2r = RealTimeDeque.tail r1r + let t2cr = RealTimeDeque.tail r1cr + let h2r = RealTimeDeque.head t2r + let h2cr = RealTimeDeque.head t2cr + let t3r = RealTimeDeque.tail t2r + let t3cr = RealTimeDeque.tail t2cr + let h3r = RealTimeDeque.head t3r + let h3cr = RealTimeDeque.head t3cr + let t4r = RealTimeDeque.tail t3r + let t4cr = RealTimeDeque.tail t3cr + let h4r = RealTimeDeque.head t4r + let h4cr = RealTimeDeque.head t4cr + let t5r = RealTimeDeque.tail t4r + let t5cr = RealTimeDeque.tail t4cr + let h5r = RealTimeDeque.head t5r + let h5cr = RealTimeDeque.head t5cr + let t6r = RealTimeDeque.tail t5r + let t6cr = RealTimeDeque.tail t5cr + let h6r = RealTimeDeque.head t6r + let h6cr = RealTimeDeque.head t6cr + let t7r = RealTimeDeque.tail t6r + let t7cr = RealTimeDeque.tail t6cr + let h7r = RealTimeDeque.head t7r + let h7cr = RealTimeDeque.head t7cr + let h7r = RealTimeDeque.head t7r + let h7cr = RealTimeDeque.head t7cr + let t8r = RealTimeDeque.tail t7r + let t8cr = RealTimeDeque.tail t7cr + let h8r = RealTimeDeque.head t8r + let h8cr = RealTimeDeque.head t8cr + let h8r = RealTimeDeque.head t8r + let h8cr = RealTimeDeque.head t8cr + let t9r = RealTimeDeque.tail t8r + let t9cr = RealTimeDeque.tail t8cr + let h9r = RealTimeDeque.head t9r + let h9cr = RealTimeDeque.head t9cr + let h9r = RealTimeDeque.head t9r + let h9cr = RealTimeDeque.head t9cr + let t10r = RealTimeDeque.tail t9r + let t10cr = RealTimeDeque.tail t9cr + let h10r = RealTimeDeque.head t10r + let h10cr = RealTimeDeque.head t10cr + let h10r = RealTimeDeque.head t10r + let h10cr = RealTimeDeque.head t10cr + let t11r = RealTimeDeque.tail t10r + let t11cr = RealTimeDeque.tail t10cr + let h11r = RealTimeDeque.head t11r + let h11cr = RealTimeDeque.head t11cr + let h11r = RealTimeDeque.head t11r + let h11cr = RealTimeDeque.head t11cr + let t12r = RealTimeDeque.tail t11r + let t12cr = RealTimeDeque.tail t11cr + let h12r = RealTimeDeque.head t12r + let h12cr = RealTimeDeque.head t12cr + let h12r = RealTimeDeque.head t12r + let h12cr = RealTimeDeque.head t12cr + let t13r = RealTimeDeque.tail t12r + let t13cr = RealTimeDeque.tail t12cr + let h13r = RealTimeDeque.head t13r + let h13cr = RealTimeDeque.head t13cr + let h13r = RealTimeDeque.head t13r + let h13cr = RealTimeDeque.head t13cr + + ((h1 = "a") && (h1c = "a") && (h2 = "b") && (h2c = "b") && (h3 = "c") && (h3c = "c") && (h4 = "d") && (h4c = "d") + && (h5 = "e") && (h5c = "e") && (h6 = "f") && (h6c = "f") && (h7 = "g") && (h7c = "g") && (h8 = "h") && (h8c = "h") + && (h9 = "i") && (h9c = "i") && (h10 = "j") && (h10c = "j") && (h11 = "k") && (h11c = "k") && (h12 = "l") && (h12c = "l") + && (h13 = "m") && (h13c = "m") && (h1r = "a") && (h1cr = "a") && (h2r = "b") && (h2cr = "b") && (h3r = "c") && (h3cr = "c") + && (h4r = "d") && (h4cr = "d") && (h5r = "e") && (h5cr = "e") && (h6r = "f") && (h6cr = "f") && (h7r = "g") && (h7cr = "g") + && (h8r = "h") && (h8cr = "h") && (h9r = "i") && (h9cr = "i") && (h10r = "j") && (h10cr = "j") + && (h11r = "k") && (h11cr = "k") && (h12r = "l") && (h12cr = "l") && (h13r = "m") && (h13cr = "m")) |> Expect.isTrue "" } + + + test "RealTimeDeque.lookup RealTimeDeque.length 1" { + len1 |> RealTimeDeque.lookup 0 |> Expect.equal "" "a" } + + test "RealTimeDeque.lookup RealTimeDeque.length 2" { + (((len2 |> RealTimeDeque.lookup 0) = "b") && ((len2 |> RealTimeDeque.lookup 1) = "a")) |> Expect.isTrue "" } + + test "RealTimeDeque.lookup RealTimeDeque.length 3" { + (((len3 |> RealTimeDeque.lookup 0) = "c") && ((len3 |> RealTimeDeque.lookup 1) = "b") && ((len3 |> RealTimeDeque.lookup 2) = "a")) |> Expect.isTrue "" } + + test "RealTimeDeque.lookup RealTimeDeque.length 4" { + (((len4 |> RealTimeDeque.lookup 0) = "d") && ((len4 |> RealTimeDeque.lookup 1) = "c") && ((len4 |> RealTimeDeque.lookup 2) = "b") && ((len4 |> RealTimeDeque.lookup 3) = "a")) + |> Expect.isTrue "" } + + test "RealTimeDeque.lookup RealTimeDeque.length 5" { + (((len5 |> RealTimeDeque.lookup 0) = "e") && ((len5 |> RealTimeDeque.lookup 1) = "d") && ((len5 |> RealTimeDeque.lookup 2) = "c") && ((len5 |> RealTimeDeque.lookup 3) = "b") + && ((len5 |> RealTimeDeque.lookup 4) = "a")) |> Expect.isTrue "" } + + test "RealTimeDeque.lookup RealTimeDeque.length 6" { + (((len6 |> RealTimeDeque.lookup 0) = "f") && ((len6 |> RealTimeDeque.lookup 1) = "e") && ((len6 |> RealTimeDeque.lookup 2) = "d") && ((len6 |> RealTimeDeque.lookup 3) = "c") + && ((len6 |> RealTimeDeque.lookup 4) = "b") && ((len6 |> RealTimeDeque.lookup 5) = "a")) |> Expect.isTrue "" } + + test "RealTimeDeque.lookup RealTimeDeque.length 7" { + (((len7 |> RealTimeDeque.lookup 0) = "g") && ((len7 |> RealTimeDeque.lookup 1) = "f") && ((len7 |> RealTimeDeque.lookup 2) = "e") && ((len7 |> RealTimeDeque.lookup 3) = "d") + && ((len7 |> RealTimeDeque.lookup 4) = "c") && ((len7 |> RealTimeDeque.lookup 5) = "b") && ((len7 |> RealTimeDeque.lookup 6) = "a")) |> Expect.isTrue "" } + + test "RealTimeDeque.lookup RealTimeDeque.length 8" { + (((len8 |> RealTimeDeque.lookup 0) = "h") && ((len8 |> RealTimeDeque.lookup 1) = "g") && ((len8 |> RealTimeDeque.lookup 2) = "f") && ((len8 |> RealTimeDeque.lookup 3) = "e") + && ((len8 |> RealTimeDeque.lookup 4) = "d") && ((len8 |> RealTimeDeque.lookup 5) = "c") && ((len8 |> RealTimeDeque.lookup 6) = "b") && ((len8 |> RealTimeDeque.lookup 7) = "a")) + |> Expect.isTrue "" } + + test "RealTimeDeque.lookup RealTimeDeque.length 9" { + (((len9 |> RealTimeDeque.lookup 0) = "i") && ((len9 |> RealTimeDeque.lookup 1) = "h") && ((len9 |> RealTimeDeque.lookup 2) = "g") && ((len9 |> RealTimeDeque.lookup 3) = "f") + && ((len9 |> RealTimeDeque.lookup 4) = "e") && ((len9 |> RealTimeDeque.lookup 5) = "d") && ((len9 |> RealTimeDeque.lookup 6) = "c") && ((len9 |> RealTimeDeque.lookup 7) = "b") + && ((len9 |> RealTimeDeque.lookup 8) = "a")) |> Expect.isTrue "" } + + test "RealTimeDeque.lookup RealTimeDeque.length 10" { + (((lena |> RealTimeDeque.lookup 0) = "j") && ((lena |> RealTimeDeque.lookup 1) = "i") && ((lena |> RealTimeDeque.lookup 2) = "h") && ((lena |> RealTimeDeque.lookup 3) = "g") + && ((lena |> RealTimeDeque.lookup 4) = "f") && ((lena |> RealTimeDeque.lookup 5) = "e") && ((lena |> RealTimeDeque.lookup 6) = "d") && ((lena |> RealTimeDeque.lookup 7) = "c") + && ((lena |> RealTimeDeque.lookup 8) = "b") && ((lena |> RealTimeDeque.lookup 9) = "a")) |> Expect.isTrue "" } + + test "RealTimeDeque.tryLookup RealTimeDeque.length 1" { + let a = len1 |> RealTimeDeque.tryLookup 0 + (a.Value = "a") |> Expect.isTrue "" } + + test "RealTimeDeque.tryLookup RealTimeDeque.length 2" { + let b = len2 |> RealTimeDeque.tryLookup 0 + let a = len2 |> RealTimeDeque.tryLookup 1 + ((b.Value = "b") && (a.Value = "a")) |> Expect.isTrue "" } + + test "RealTimeDeque.tryLookup RealTimeDeque.length 3" { + let c = len3 |> RealTimeDeque.tryLookup 0 + let b = len3 |> RealTimeDeque.tryLookup 1 + let a = len3 |> RealTimeDeque.tryLookup 2 + ((c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> Expect.isTrue "" } + + test "RealTimeDeque.tryLookup RealTimeDeque.length 4" { + let d = len4 |> RealTimeDeque.tryLookup 0 + let c = len4 |> RealTimeDeque.tryLookup 1 + let b = len4 |> RealTimeDeque.tryLookup 2 + let a = len4 |> RealTimeDeque.tryLookup 3 + ((d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> Expect.isTrue "" } + + test "RealTimeDeque.tryLookup RealTimeDeque.length 5" { + let e = len5 |> RealTimeDeque.tryLookup 0 + let d = len5 |> RealTimeDeque.tryLookup 1 + let c = len5 |> RealTimeDeque.tryLookup 2 + let b = len5 |> RealTimeDeque.tryLookup 3 + let a = len5 |> RealTimeDeque.tryLookup 4 + ((e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> Expect.isTrue "" } + + test "RealTimeDeque.tryLookup RealTimeDeque.length 6" { + let f = len6 |> RealTimeDeque.tryLookup 0 + let e = len6 |> RealTimeDeque.tryLookup 1 + let d = len6 |> RealTimeDeque.tryLookup 2 + let c = len6 |> RealTimeDeque.tryLookup 3 + let b = len6 |> RealTimeDeque.tryLookup 4 + let a = len6 |> RealTimeDeque.tryLookup 5 + ((f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) + |> Expect.isTrue "" } + + test "RealTimeDeque.tryLookup RealTimeDeque.length 7" { + let g = len7 |> RealTimeDeque.tryLookup 0 + let f = len7 |> RealTimeDeque.tryLookup 1 + let e = len7 |> RealTimeDeque.tryLookup 2 + let d = len7 |> RealTimeDeque.tryLookup 3 + let c = len7 |> RealTimeDeque.tryLookup 4 + let b = len7 |> RealTimeDeque.tryLookup 5 + let a = len7 |> RealTimeDeque.tryLookup 6 + ((g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") + && (a.Value = "a")) |> Expect.isTrue "" } + + test "RealTimeDeque.tryLookup RealTimeDeque.length 8" { + let h = len8 |> RealTimeDeque.tryLookup 0 + let g = len8 |> RealTimeDeque.tryLookup 1 + let f = len8 |> RealTimeDeque.tryLookup 2 + let e = len8 |> RealTimeDeque.tryLookup 3 + let d = len8 |> RealTimeDeque.tryLookup 4 + let c = len8 |> RealTimeDeque.tryLookup 5 + let b = len8 |> RealTimeDeque.tryLookup 6 + let a = len8 |> RealTimeDeque.tryLookup 7 + ((h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") + && (b.Value = "b")&& (a.Value = "a")) |> Expect.isTrue "" } + + test "RealTimeDeque.tryLookup RealTimeDeque.length 9" { + let i = len9 |> RealTimeDeque.tryLookup 0 + let h = len9 |> RealTimeDeque.tryLookup 1 + let g = len9 |> RealTimeDeque.tryLookup 2 + let f = len9 |> RealTimeDeque.tryLookup 3 + let e = len9 |> RealTimeDeque.tryLookup 4 + let d = len9 |> RealTimeDeque.tryLookup 5 + let c = len9 |> RealTimeDeque.tryLookup 6 + let b = len9 |> RealTimeDeque.tryLookup 7 + let a = len9 |> RealTimeDeque.tryLookup 8 + ((i.Value = "i") && (h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") + && (c.Value = "c") && (b.Value = "b")&& (a.Value = "a")) |> Expect.isTrue "" } + + test "RealTimeDeque.tryLookup RealTimeDeque.length 10" { + let j = lena |> RealTimeDeque.tryLookup 0 + let i = lena |> RealTimeDeque.tryLookup 1 + let h = lena |> RealTimeDeque.tryLookup 2 + let g = lena |> RealTimeDeque.tryLookup 3 + let f = lena |> RealTimeDeque.tryLookup 4 + let e = lena |> RealTimeDeque.tryLookup 5 + let d = lena |> RealTimeDeque.tryLookup 6 + let c = lena |> RealTimeDeque.tryLookup 7 + let b = lena |> RealTimeDeque.tryLookup 8 + let a = lena |> RealTimeDeque.tryLookup 9 + ((j.Value = "j") && (i.Value = "i") && (h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") + && (d.Value = "d") && (c.Value = "c") && (b.Value = "b")&& (a.Value = "a")) |> Expect.isTrue "" } + + test "RealTimeDeque.tryLookup not found" { + lena |> RealTimeDeque.tryLookup 10 |> Expect.isNone "" } + + test "RealTimeDeque.remove elements RealTimeDeque.length 1" { + len1 |> RealTimeDeque.remove 0 |> RealTimeDeque.isEmpty |> Expect.isTrue "" } + + test "RealTimeDeque.remove elements RealTimeDeque.length 2" { + let a = len2 |> RealTimeDeque.remove 0 |> RealTimeDeque.head + let b = len2 |> RealTimeDeque.remove 1 |> RealTimeDeque.head + ((a = "a") && (b = "b")) |> Expect.isTrue "" } + + test "RealTimeDeque.remove elements RealTimeDeque.length 3" { + let r0 = (RealTimeDeque.ofSeq ["a";"b";"c"]) |> RealTimeDeque.remove 0 + let b0 = RealTimeDeque.head r0 + let t0 = RealTimeDeque.tail r0 + let c0 = RealTimeDeque.head t0 + + let r1 = (RealTimeDeque.ofSeq ["a";"b";"c"]) |> RealTimeDeque.remove 1 + let a1 = RealTimeDeque.head r1 + let t1 = RealTimeDeque.tail r1 + let c1 = RealTimeDeque.head t1 + + let r2 = (RealTimeDeque.ofSeq ["a";"b";"c"]) |> RealTimeDeque.remove 2 + let a2 = RealTimeDeque.head r2 + let t2 = RealTimeDeque.tail r2 + let b2 = RealTimeDeque.head t2 + + ((b0 = "b") && (c0 = "c") && (a1 = "a") && (c1 = "c") && (a2 = "a") && (b2 = "b")) |> Expect.isTrue "" } + + test "RealTimeDeque.remove elements RealTimeDeque.length 4" { + let r0 = (RealTimeDeque.ofSeq ["a";"b";"c";"d"]) |> RealTimeDeque.remove 0 + let b0 = RealTimeDeque.head r0 + let t0 = RealTimeDeque.tail r0 + let c0 = RealTimeDeque.head t0 + let t01 = RealTimeDeque.tail t0 + let d0 = RealTimeDeque.head t01 + + let r1 = (RealTimeDeque.ofSeq ["a";"b";"c";"d"]) |> RealTimeDeque.remove 1 + let a1 = RealTimeDeque.head r1 + let t11 = RealTimeDeque.tail r1 + let c1 = RealTimeDeque.head t11 + let t12 = RealTimeDeque.tail t11 + let d1 = RealTimeDeque.head t12 + + let r2 = (RealTimeDeque.ofSeq ["a";"b";"c";"d"]) |> RealTimeDeque.remove 2 + let a2 = RealTimeDeque.head r2 + let t21 = RealTimeDeque.tail r2 + let b2 = RealTimeDeque.head t21 + let t22 = RealTimeDeque.tail t21 + let c2 = RealTimeDeque.head t22 + + let r3 = (RealTimeDeque.ofSeq ["a";"b";"c";"d"]) |> RealTimeDeque.remove 3 + let a3 = RealTimeDeque.head r3 + let t31 = RealTimeDeque.tail r3 + let b3 = RealTimeDeque.head t31 + let t32 = RealTimeDeque.tail t31 + let c3 = RealTimeDeque.head t32 + + ((b0 = "b") && (c0 = "c") && (d0 = "d") + && (a1 = "a") && (c1 = "c") && (d1 = "d") + && (a2 = "a") && (b2 = "b") && (c2 = "d") + && (a3 = "a") && (b3 = "b") && (c3 = "c")) |> Expect.isTrue "" } + + test "RealTimeDeque.remove elements RealTimeDeque.length 5" { + let r0 = (RealTimeDeque.ofSeq ["a";"b";"c";"d";"e"]) |> RealTimeDeque.remove 0 + let b0 = RealTimeDeque.head r0 + let t01 = RealTimeDeque.tail r0 + let c0 = RealTimeDeque.head t01 + let t02= RealTimeDeque.tail t01 + let d0 = RealTimeDeque.head t02 + let t03 = RealTimeDeque.tail t02 + let e0 = RealTimeDeque.head t03 + + let r1 = (RealTimeDeque.ofSeq ["a";"b";"c";"d";"e"]) |> RealTimeDeque.remove 1 + let a1 = RealTimeDeque.head r1 + let t11 = RealTimeDeque.tail r1 + let c1 = RealTimeDeque.head t11 + let t12 = RealTimeDeque.tail t11 + let d1 = RealTimeDeque.head t12 + let t13 = RealTimeDeque.tail t12 + let e1 = RealTimeDeque.head t13 + + let r2 = (RealTimeDeque.ofSeq ["a";"b";"c";"d";"e"]) |> RealTimeDeque.remove 2 + let a2 = RealTimeDeque.head r2 + let t21 = RealTimeDeque.tail r2 + let b2 = RealTimeDeque.head t21 + let t22 = RealTimeDeque.tail t21 + let c2 = RealTimeDeque.head t22 + let t23 = RealTimeDeque.tail t22 + let e2 = RealTimeDeque.head t23 + + let r3 = (RealTimeDeque.ofSeq ["a";"b";"c";"d";"e"]) |> RealTimeDeque.remove 3 + let a3 = RealTimeDeque.head r3 + let t31 = RealTimeDeque.tail r3 + let b3 = RealTimeDeque.head t31 + let t32 = RealTimeDeque.tail t31 + let c3 = RealTimeDeque.head t32 + let t33 = RealTimeDeque.tail t32 + let e3 = RealTimeDeque.head t33 + + let r4 = (RealTimeDeque.ofSeq ["a";"b";"c";"d";"e"]) |> RealTimeDeque.remove 4 + let a4 = RealTimeDeque.head r4 + let t41 = RealTimeDeque.tail r4 + let b4 = RealTimeDeque.head t41 + let t42 = RealTimeDeque.tail t41 + let c4 = RealTimeDeque.head t42 + let t43 = RealTimeDeque.tail t42 + let d4 = RealTimeDeque.head t43 + + ((b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") + && (a1 = "a") && (c1 = "c") && (d1 = "d") && (e1 = "e") + && (a2 = "a") && (b2 = "b") && (c2 = "d") && (e2 = "e") + && (a3 = "a") && (b3 = "b") && (c3 = "c") && (e3 = "e") + && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d")) |> Expect.isTrue "" } + + test "RealTimeDeque.remove elements RealTimeDeque.length 6" { + let r0 = (RealTimeDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> RealTimeDeque.remove 0 + let b0 = RealTimeDeque.head r0 + let t01 = RealTimeDeque.tail r0 + let c0 = RealTimeDeque.head t01 + let t02= RealTimeDeque.tail t01 + let d0 = RealTimeDeque.head t02 + let t03 = RealTimeDeque.tail t02 + let e0 = RealTimeDeque.head t03 + let t04 = RealTimeDeque.tail t03 + let f0 = RealTimeDeque.head t04 + + let r1 = (RealTimeDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> RealTimeDeque.remove 1 + let a1 = RealTimeDeque.head r1 + let t11 = RealTimeDeque.tail r1 + let c1 = RealTimeDeque.head t11 + let t12 = RealTimeDeque.tail t11 + let d1 = RealTimeDeque.head t12 + let t13 = RealTimeDeque.tail t12 + let e1 = RealTimeDeque.head t13 + let t14 = RealTimeDeque.tail t13 + let f1 = RealTimeDeque.head t14 + + let r2 = (RealTimeDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> RealTimeDeque.remove 2 + let a2 = RealTimeDeque.head r2 + let t21 = RealTimeDeque.tail r2 + let b2 = RealTimeDeque.head t21 + let t22 = RealTimeDeque.tail t21 + let c2 = RealTimeDeque.head t22 + let t23 = RealTimeDeque.tail t22 + let e2 = RealTimeDeque.head t23 + let t24 = RealTimeDeque.tail t23 + let f2 = RealTimeDeque.head t24 + + let r3 = (RealTimeDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> RealTimeDeque.remove 3 + let a3 = RealTimeDeque.head r3 + let t31 = RealTimeDeque.tail r3 + let b3 = RealTimeDeque.head t31 + let t32 = RealTimeDeque.tail t31 + let c3 = RealTimeDeque.head t32 + let t33 = RealTimeDeque.tail t32 + let e3 = RealTimeDeque.head t33 + let t34 = RealTimeDeque.tail t33 + let f3 = RealTimeDeque.head t34 + + let r4 = (RealTimeDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> RealTimeDeque.remove 4 + let a4 = RealTimeDeque.head r4 + let t41 = RealTimeDeque.tail r4 + let b4 = RealTimeDeque.head t41 + let t42 = RealTimeDeque.tail t41 + let c4 = RealTimeDeque.head t42 + let t43 = RealTimeDeque.tail t42 + let d4 = RealTimeDeque.head t43 + let t44 = RealTimeDeque.tail t43 + let f4 = RealTimeDeque.head t44 + + let r5 = (RealTimeDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> RealTimeDeque.remove 5 + let a5 = RealTimeDeque.head r5 + let t51 = RealTimeDeque.tail r5 + let b5 = RealTimeDeque.head t51 + let t52 = RealTimeDeque.tail t51 + let c5 = RealTimeDeque.head t52 + let t53 = RealTimeDeque.tail t52 + let d5 = RealTimeDeque.head t53 + let t54 = RealTimeDeque.tail t53 + let e5 = RealTimeDeque.head t54 + + ((b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") && (f0 = "f") + && (a1 = "a") && (c1 = "c") && (d1 = "d") && (e1 = "e") && (f1 = "f") + && (a2 = "a") && (b2 = "b") && (c2 = "d") && (e2 = "e") && (f2 = "f") + && (a3 = "a") && (b3 = "b") && (c3 = "c") && (e3 = "e") && (f3 = "f") + && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d") && (f4 = "f") + && (a5 = "a") && (b5 = "b") && (c5 = "c") && (d5 = "d") && (e5 = "e")) |> Expect.isTrue "" } + + test "tryRemoveempty" { + (RealTimeDeque.empty 3) |> RealTimeDeque.tryRemove 0 |> Expect.isNone "" } + + test "RealTimeDeque.tryRemove elements RealTimeDeque.length 1" { + let a = len1 |> RealTimeDeque.tryRemove 0 + a.Value |> RealTimeDeque.isEmpty |> Expect.isTrue "" } + + test "RealTimeDeque.tryRemove elements RealTimeDeque.length 2" { + let a = len2 |> RealTimeDeque.tryRemove 0 + let a1 = RealTimeDeque.head a.Value + let b = len2 |> RealTimeDeque.tryRemove 1 + let b1 = RealTimeDeque.head b.Value + ((a1 = "a") && (b1 = "b")) |> Expect.isTrue "" } + + test "RealTimeDeque.tryRemove elements RealTimeDeque.length 3" { + let x0 = (RealTimeDeque.ofSeq ["a";"b";"c"]) |> RealTimeDeque.tryRemove 0 + let r0 = x0.Value + let b0 = RealTimeDeque.head r0 + let t0 = RealTimeDeque.tail r0 + let c0 = RealTimeDeque.head t0 + + let x1 = (RealTimeDeque.ofSeq ["a";"b";"c"]) |> RealTimeDeque.tryRemove 1 + let r1 = x1.Value + let a1 = RealTimeDeque.head r1 + let t1 = RealTimeDeque.tail r1 + let c1 = RealTimeDeque.head t1 + + let x2 = (RealTimeDeque.ofSeq ["a";"b";"c"]) |> RealTimeDeque.tryRemove 2 + let r2 = x2.Value + let a2 = RealTimeDeque.head r2 + let t2 = RealTimeDeque.tail r2 + let b2 = RealTimeDeque.head t2 + + ((b0 = "b") && (c0 = "c") && (a1 = "a") && (c1 = "c") && (a2 = "a") && (b2 = "b")) |> Expect.isTrue "" } + + test "RealTimeDeque.tryRemove elements RealTimeDeque.length 4" { + let x0 = (RealTimeDeque.ofSeq ["a";"b";"c";"d"]) |> RealTimeDeque.tryRemove 0 + let r0 = x0.Value + let b0 = RealTimeDeque.head r0 + let t0 = RealTimeDeque.tail r0 + let c0 = RealTimeDeque.head t0 + let t01 = RealTimeDeque.tail t0 + let d0 = RealTimeDeque.head t01 + + let x1 = (RealTimeDeque.ofSeq ["a";"b";"c";"d"]) |> RealTimeDeque.tryRemove 1 + let r1 = x1.Value + let a1 = RealTimeDeque.head r1 + let t11 = RealTimeDeque.tail r1 + let c1 = RealTimeDeque.head t11 + let t12 = RealTimeDeque.tail t11 + let d1 = RealTimeDeque.head t12 - let x2 = (ofSeq ["a";"b";"c";"d"]) |> tryRemove 2 - let r2 = x2.Value - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 + let x2 = (RealTimeDeque.ofSeq ["a";"b";"c";"d"]) |> RealTimeDeque.tryRemove 2 + let r2 = x2.Value + let a2 = RealTimeDeque.head r2 + let t21 = RealTimeDeque.tail r2 + let b2 = RealTimeDeque.head t21 + let t22 = RealTimeDeque.tail t21 + let c2 = RealTimeDeque.head t22 - let x3 = (ofSeq ["a";"b";"c";"d"]) |> tryRemove 3 - let r3 = x3.Value - let a3 = head r3 - let t31 = tail r3 - let b3 = head t31 - let t32 = tail t31 - let c3 = head t32 - - ((b0 = "b") && (c0 = "c") && (d0 = "d") - && (a1 = "a") && (c1 = "c") && (d1 = "d") - && (a2 = "a") && (b2 = "b") && (c2 = "d") - && (a3 = "a") && (b3 = "b") && (c3 = "c")) |> should equal true - -[] -let ``tryRemove elements length 5``() = - let x0 = (ofSeq ["a";"b";"c";"d";"e"]) |> tryRemove 0 - let r0 = x0.Value - let b0 = head r0 - let t01 = tail r0 - let c0 = head t01 - let t02= tail t01 - let d0 = head t02 - let t03 = tail t02 - let e0 = head t03 - - let x1 = (ofSeq ["a";"b";"c";"d";"e"]) |> tryRemove 1 - let r1 = x1.Value - let a1 = head r1 - let t11 = tail r1 - let c1 = head t11 - let t12 = tail t11 - let d1 = head t12 - let t13 = tail t12 - let e1 = head t13 - - let x2 = (ofSeq ["a";"b";"c";"d";"e"]) |> tryRemove 2 - let r2 = x2.Value - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 - let t23 = tail t22 - let e2 = head t23 - - let x3 = (ofSeq ["a";"b";"c";"d";"e"]) |> tryRemove 3 - let r3 = x3.Value - let a3 = head r3 - let t31 = tail r3 - let b3 = head t31 - let t32 = tail t31 - let c3 = head t32 - let t33 = tail t32 - let e3 = head t33 - - let x4 = (ofSeq ["a";"b";"c";"d";"e"]) |> tryRemove 4 - let r4 = x4.Value - let a4 = head r4 - let t41 = tail r4 - let b4 = head t41 - let t42 = tail t41 - let c4 = head t42 - let t43 = tail t42 - let d4 = head t43 - - ((b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") - && (a1 = "a") && (c1 = "c") && (d1 = "d") && (e1 = "e") - && (a2 = "a") && (b2 = "b") && (c2 = "d") && (e2 = "e") - && (a3 = "a") && (b3 = "b") && (c3 = "c") && (e3 = "e") - && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d")) |> should equal true - -[] -let ``tryRemove elements length 6``() = - let x0 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> tryRemove 0 - let r0 = x0.Value - let b0 = head r0 - let t01 = tail r0 - let c0 = head t01 - let t02= tail t01 - let d0 = head t02 - let t03 = tail t02 - let e0 = head t03 - let t04 = tail t03 - let f0 = head t04 - - let x1 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> tryRemove 1 - let r1 =x1.Value - let a1 = head r1 - let t11 = tail r1 - let c1 = head t11 - let t12 = tail t11 - let d1 = head t12 - let t13 = tail t12 - let e1 = head t13 - let t14 = tail t13 - let f1 = head t14 - - let x2 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> tryRemove 2 - let r2 = x2.Value - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 - let t23 = tail t22 - let e2 = head t23 - let t24 = tail t23 - let f2 = head t24 - - let x3 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> tryRemove 3 - let r3 = x3.Value - let a3 = head r3 - let t31 = tail r3 - let b3 = head t31 - let t32 = tail t31 - let c3 = head t32 - let t33 = tail t32 - let e3 = head t33 - let t34 = tail t33 - let f3 = head t34 - - let x4 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> tryRemove 4 - let r4 = x4.Value - let a4 = head r4 - let t41 = tail r4 - let b4 = head t41 - let t42 = tail t41 - let c4 = head t42 - let t43 = tail t42 - let d4 = head t43 - let t44 = tail t43 - let f4 = head t44 - - let x5 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> tryRemove 5 - let r5 = x5.Value - let a5 = head r5 - let t51 = tail r5 - let b5 = head t51 - let t52 = tail t51 - let c5 = head t52 - let t53 = tail t52 - let d5 = head t53 - let t54 = tail t53 - let e5 = head t54 - - ((b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") && (f0 = "f") - && (a1 = "a") && (c1 = "c") && (d1 = "d") && (e1 = "e") && (f1 = "f") - && (a2 = "a") && (b2 = "b") && (c2 = "d") && (e2 = "e") && (f2 = "f") - && (a3 = "a") && (b3 = "b") && (c3 = "c") && (e3 = "e") && (f3 = "f") - && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d") && (f4 = "f") - && (a5 = "a") && (b5 = "b") && (c5 = "c") && (d5 = "d") && (e5 = "e")) |> should equal true - -[] -let ``update elements length 1``() = - len1 |> update 0 "aa" |> head |> should equal "aa" - -[] -let ``update elements length 2``() = - let r0 = (ofSeq ["a";"b"]) |> update 0 "zz" - let a0 = head r0 - let t01 = tail r0 - let b0 = head t01 - - let r1 = (ofSeq ["a";"b"]) |> update 1 "zz" - let a1 = head r1 - let t11 = tail r1 - let b1 = head t11 - - ((a0 = "zz") && (b0 = "b") - && (a1 = "a") && (b1 = "zz")) |> should equal true - -[] -let ``update elements length 3``() = - let r0 = (ofSeq ["a";"b";"c"]) |> update 0 "zz" - let a0 = head r0 - let t01 = tail r0 - let b0 = head t01 - let t02 = tail t01 - let c0 = head t02 - - let r1 = (ofSeq ["a";"b";"c"]) |> update 1 "zz" - let a1 = head r1 - let t11 = tail r1 - let b1 = head t11 - let t12 = tail t11 - let c1 = head t12 - - let r2 = (ofSeq ["a";"b";"c"]) |> update 2 "zz" - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 - - ((a0 = "zz") && (b0 = "b") && (c0 = "c") - && (a1 = "a") && (b1 = "zz") && (c1 = "c") - && (a2 = "a") && (b2 = "b") && (c2 = "zz")) |> should equal true - -[] -let ``update elements length 4``() = - let r0 = (ofSeq ["a";"b";"c";"d"]) |> update 0 "zz" - let a0 = head r0 - let t01 = tail r0 - let b0 = head t01 - let t02 = tail t01 - let c0 = head t02 - let t03 = tail t02 - let d0 = head t03 - - let r1 = (ofSeq ["a";"b";"c";"d"]) |> update 1 "zz" - let a1 = head r1 - let t11 = tail r1 - let b1 = head t11 - let t12 = tail t11 - let c1 = head t12 - let t13 = tail t12 - let d1 = head t13 - - let r2 = (ofSeq ["a";"b";"c";"d"]) |> update 2 "zz" - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 - let t23 = tail t22 - let d2 = head t23 - - let r3 = (ofSeq ["a";"b";"c";"d"]) |> update 3 "zz" - let a3 = head r3 - let t31 = tail r3 - let b3 = head t31 - let t32 = tail t31 - let c3 = head t32 - let t33 = tail t32 - let d3 = head t33 - - ((a0 = "zz") && (b0 = "b") && (c0 = "c") && (d0 = "d") - && (a1 = "a") && (b1 = "zz") && (c1 = "c") && (d1 = "d") - && (a2 = "a") && (b2 = "b") && (c2 = "zz") && (d2 = "d") - && (a3 = "a") && (b3 = "b") && (c3 = "c") && (d3 = "zz")) |> should equal true - -[] -let ``update elements length 5``() = - let r0 = (ofSeq ["a";"b";"c";"d";"e"]) |> update 0 "zz" - let a0 = head r0 - let t01 = tail r0 - let b0 = head t01 - let t02 = tail t01 - let c0 = head t02 - let t03 = tail t02 - let d0 = head t03 - let t04 = tail t03 - let e0 = head t04 - - let r1 = (ofSeq ["a";"b";"c";"d";"e"]) |> update 1 "zz" - let a1 = head r1 - let t11 = tail r1 - let b1 = head t11 - let t12 = tail t11 - let c1 = head t12 - let t13 = tail t12 - let d1 = head t13 - let t14 = tail t13 - let e1 = head t14 - - let r2 = (ofSeq ["a";"b";"c";"d";"e"]) |> update 2 "zz" - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 - let t23 = tail t22 - let d2 = head t23 - let t24 = tail t23 - let e2 = head t24 - - let r3 = (ofSeq ["a";"b";"c";"d";"e"]) |> update 3 "zz" - let a3 = head r3 - let t31 = tail r3 - let b3 = head t31 - let t32 = tail t31 - let c3 = head t32 - let t33 = tail t32 - let d3 = head t33 - let t34 = tail t33 - let e3 = head t34 - - let r4 = (ofSeq ["a";"b";"c";"d";"e"]) |> update 4 "zz" - let a4 = head r4 - let t41 = tail r4 - let b4 = head t41 - let t42 = tail t41 - let c4 = head t42 - let t43 = tail t42 - let d4 = head t43 - let t44 = tail t43 - let e4 = head t44 - - ((a0 = "zz") && (b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") - && (a1 = "a") && (b1 = "zz") && (c1 = "c") && (d1 = "d") && (e1 = "e") - && (a2 = "a") && (b2 = "b") && (c2 = "zz") && (d2 = "d") && (e2 = "e") - && (a3 = "a") && (b3 = "b") && (c3 = "c") && (d3 = "zz") && (e3 = "e") - && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d") && (e4 = "zz")) |> should equal true - -[] -let ``update elements length 6``() = - let r0 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> update 0 "zz" - let a0 = head r0 - let t01 = tail r0 - let b0 = head t01 - let t02 = tail t01 - let c0 = head t02 - let t03 = tail t02 - let d0 = head t03 - let t04 = tail t03 - let e0 = head t04 - let t05 = tail t04 - let f0 = head t05 - - let r1 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> update 1 "zz" - let a1 = head r1 - let t11 = tail r1 - let b1 = head t11 - let t12 = tail t11 - let c1 = head t12 - let t13 = tail t12 - let d1 = head t13 - let t14 = tail t13 - let e1 = head t14 - let t15 = tail t14 - let f1 = head t15 - - let r2 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> update 2 "zz" - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 - let t23 = tail t22 - let d2 = head t23 - let t24 = tail t23 - let e2 = head t24 - let t25 = tail t24 - let f2 = head t25 - - let r3 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> update 3 "zz" - let a3 = head r3 - let t31 = tail r3 - let b3 = head t31 - let t32 = tail t31 - let c3 = head t32 - let t33 = tail t32 - let d3 = head t33 - let t34 = tail t33 - let e3 = head t34 - let t35 = tail t34 - let f3 = head t35 - - let r4 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> update 4 "zz" - let a4 = head r4 - let t41 = tail r4 - let b4 = head t41 - let t42 = tail t41 - let c4 = head t42 - let t43 = tail t42 - let d4 = head t43 - let t44 = tail t43 - let e4 = head t44 - let t45 = tail t44 - let f4 = head t45 - - let r5 = (ofSeq ["a";"b";"c";"d";"e";"f"]) |> update 5 "zz" - let a5 = head r5 - let t51 = tail r5 - let b5 = head t51 - let t52 = tail t51 - let c5 = head t52 - let t53 = tail t52 - let d5 = head t53 - let t54 = tail t53 - let e5 = head t54 - let t55 = tail t54 - let f5 = head t55 - - ((a0 = "zz") && (b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") && (f0 = "f") - && (a1 = "a") && (b1 = "zz") && (c1 = "c") && (d1 = "d") && (e1 = "e") && (f1 = "f") - && (a2 = "a") && (b2 = "b") && (c2 = "zz") && (d2 = "d") && (e2 = "e") && (f2 = "f") - && (a3 = "a") && (b3 = "b") && (c3 = "c") && (d3 = "zz") && (e3 = "e") && (f3 = "f") - && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d") && (e4 = "zz") && (f4 = "f") - && (a5 = "a") && (b5 = "b") && (c5 = "c") && (d5 = "d") && (e5 = "e") && (f5 = "zz")) |> should equal true - -[] -let ``tryUpdate elements length 1``() = - let a = len1 |> tryUpdate 0 "aa" - a.Value |> head |> should equal "aa" - -[] -let ``tryUpdate elements length 2``() = - let x0 = (ofSeq ["a";"b"]) |> tryUpdate 0 "zz" - let r0 = x0.Value - let a0 = head r0 - let t01 = tail r0 - let b0 = head t01 - - let x1 = (ofSeq ["a";"b"]) |> tryUpdate 1 "zz" - let r1 = x1.Value - let a1 = head r1 - let t11 = tail r1 - let b1 = head t11 - - ((a0 = "zz") && (b0 = "b") - && (a1 = "a") && (b1 = "zz")) |> should equal true - -[] -let ``tryUpdate elements length 3``() = - let x0 = (ofSeq ["a";"b";"c"]) |> tryUpdate 0 "zz" - let r0 = x0.Value - let a0 = head r0 - let t01 = tail r0 - let b0 = head t01 - let t02 = tail t01 - let c0 = head t02 - - let x1 = (ofSeq ["a";"b";"c"]) |> tryUpdate 1 "zz" - let r1 = x1.Value - let a1 = head r1 - let t11 = tail r1 - let b1 = head t11 - let t12 = tail t11 - let c1 = head t12 - - let x2 = (ofSeq ["a";"b";"c"]) |> tryUpdate 2 "zz" - let r2 = x2.Value - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 - - ((a0 = "zz") && (b0 = "b") && (c0 = "c") - && (a1 = "a") && (b1 = "zz") && (c1 = "c") - && (a2 = "a") && (b2 = "b") && (c2 = "zz")) |> should equal true - -[] -let ``tryUpdate elements length 4``() = - let x0 = (ofSeq ["a";"b";"c";"d"]) |> tryUpdate 0 "zz" - let r0 = x0.Value - let a0 = head r0 - let t01 = tail r0 - let b0 = head t01 - let t02 = tail t01 - let c0 = head t02 - let t03 = tail t02 - let d0 = head t03 - - let x1 = (ofSeq ["a";"b";"c";"d"]) |> tryUpdate 1 "zz" - let r1 = x1.Value - let a1 = head r1 - let t11 = tail r1 - let b1 = head t11 - let t12 = tail t11 - let c1 = head t12 - let t13 = tail t12 - let d1 = head t13 - - let x2 = (ofSeq ["a";"b";"c";"d"]) |> tryUpdate 2 "zz" - let r2 = x2.Value - let a2 = head r2 - let t21 = tail r2 - let b2 = head t21 - let t22 = tail t21 - let c2 = head t22 - let t23 = tail t22 - let d2 = head t23 - - let x3 = (ofSeq ["a";"b";"c";"d"]) |> tryUpdate 3 "zz" - let r3 = x3.Value - let a3 = head r3 - let t31 = tail r3 - let b3 = head t31 - let t32 = tail t31 - let c3 = head t32 - let t33 = tail t32 - let d3 = head t33 - - ((a0 = "zz") && (b0 = "b") && (c0 = "c") && (d0 = "d") - && (a1 = "a") && (b1 = "zz") && (c1 = "c") && (d1 = "d") - && (a2 = "a") && (b2 = "b") && (c2 = "zz") && (d2 = "d") - && (a3 = "a") && (b3 = "b") && (c3 = "c") && (d3 = "zz")) |> should equal true - -[] -let ``tryUncons on empty``() = - let q = empty 2 - (tryUncons q = None) |> should equal true - -[] -let ``tryUncons on q``() = - let q = ofSeq ["a";"b";"c";"d"] - let x, xs = (tryUncons q).Value - x |> should equal "a" - -[] -let ``tryUnsnoc on empty``() = - let q = empty 2 - (tryUnsnoc q = None) |> should equal true - -[] -let ``tryUnsnoc on q``() = - let q = ofSeq ["a";"b";"c";"d"] - let xs, x = (tryUnsnoc q).Value - x |> should equal "d" - -[] -let ``tryGetHead on empty``() = - let q = empty 2 - (tryGetHead q = None) |> should equal true - -[] -let ``tryGetHead on q``() = - let q = ofSeq ["a";"b";"c";"d"] - (tryGetHead q).Value |> should equal "a" - -[] -let ``tryGetInit on empty``() = - let q = empty 2 - (tryGetInit q = None) |> should equal true - -[] -let ``tryGetInit on q``() = - let q = ofSeq ["a";"b";"c";"d"] -// (tryGetInit q).Value |> last |> should equal "c" - let x = (tryGetInit q).Value - let x2 = x|> last - x2 |> should equal "c" - -[] -let ``tryGetLast on empty``() = - let q = empty 2 - (tryGetLast q = None) |> should equal true - -[] -let ``tryGetLast on q``() = - let q = ofSeq ["a";"b";"c";"d"] - (tryGetLast q).Value |> should equal "d" - - -[] -let ``tryGetTail on empty``() = - let q = empty 2 - (tryGetTail q = None) |> should equal true - -[] -let ``tryGetTail on q``() = - let q = ofSeq ["a";"b";"c";"d"] - (tryGetTail q).Value |> head |> should equal "b" \ No newline at end of file + let x3 = (RealTimeDeque.ofSeq ["a";"b";"c";"d"]) |> RealTimeDeque.tryRemove 3 + let r3 = x3.Value + let a3 = RealTimeDeque.head r3 + let t31 = RealTimeDeque.tail r3 + let b3 = RealTimeDeque.head t31 + let t32 = RealTimeDeque.tail t31 + let c3 = RealTimeDeque.head t32 + + ((b0 = "b") && (c0 = "c") && (d0 = "d") + && (a1 = "a") && (c1 = "c") && (d1 = "d") + && (a2 = "a") && (b2 = "b") && (c2 = "d") + && (a3 = "a") && (b3 = "b") && (c3 = "c")) |> Expect.isTrue "" } + + test "RealTimeDeque.tryRemove elements RealTimeDeque.length 5" { + let x0 = (RealTimeDeque.ofSeq ["a";"b";"c";"d";"e"]) |> RealTimeDeque.tryRemove 0 + let r0 = x0.Value + let b0 = RealTimeDeque.head r0 + let t01 = RealTimeDeque.tail r0 + let c0 = RealTimeDeque.head t01 + let t02= RealTimeDeque.tail t01 + let d0 = RealTimeDeque.head t02 + let t03 = RealTimeDeque.tail t02 + let e0 = RealTimeDeque.head t03 + + let x1 = (RealTimeDeque.ofSeq ["a";"b";"c";"d";"e"]) |> RealTimeDeque.tryRemove 1 + let r1 = x1.Value + let a1 = RealTimeDeque.head r1 + let t11 = RealTimeDeque.tail r1 + let c1 = RealTimeDeque.head t11 + let t12 = RealTimeDeque.tail t11 + let d1 = RealTimeDeque.head t12 + let t13 = RealTimeDeque.tail t12 + let e1 = RealTimeDeque.head t13 + + let x2 = (RealTimeDeque.ofSeq ["a";"b";"c";"d";"e"]) |> RealTimeDeque.tryRemove 2 + let r2 = x2.Value + let a2 = RealTimeDeque.head r2 + let t21 = RealTimeDeque.tail r2 + let b2 = RealTimeDeque.head t21 + let t22 = RealTimeDeque.tail t21 + let c2 = RealTimeDeque.head t22 + let t23 = RealTimeDeque.tail t22 + let e2 = RealTimeDeque.head t23 + + let x3 = (RealTimeDeque.ofSeq ["a";"b";"c";"d";"e"]) |> RealTimeDeque.tryRemove 3 + let r3 = x3.Value + let a3 = RealTimeDeque.head r3 + let t31 = RealTimeDeque.tail r3 + let b3 = RealTimeDeque.head t31 + let t32 = RealTimeDeque.tail t31 + let c3 = RealTimeDeque.head t32 + let t33 = RealTimeDeque.tail t32 + let e3 = RealTimeDeque.head t33 + + let x4 = (RealTimeDeque.ofSeq ["a";"b";"c";"d";"e"]) |> RealTimeDeque.tryRemove 4 + let r4 = x4.Value + let a4 = RealTimeDeque.head r4 + let t41 = RealTimeDeque.tail r4 + let b4 = RealTimeDeque.head t41 + let t42 = RealTimeDeque.tail t41 + let c4 = RealTimeDeque.head t42 + let t43 = RealTimeDeque.tail t42 + let d4 = RealTimeDeque.head t43 + + ((b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") + && (a1 = "a") && (c1 = "c") && (d1 = "d") && (e1 = "e") + && (a2 = "a") && (b2 = "b") && (c2 = "d") && (e2 = "e") + && (a3 = "a") && (b3 = "b") && (c3 = "c") && (e3 = "e") + && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d")) |> Expect.isTrue "" } + + test "RealTimeDeque.tryRemove elements RealTimeDeque.length 6" { + let x0 = (RealTimeDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> RealTimeDeque.tryRemove 0 + let r0 = x0.Value + let b0 = RealTimeDeque.head r0 + let t01 = RealTimeDeque.tail r0 + let c0 = RealTimeDeque.head t01 + let t02= RealTimeDeque.tail t01 + let d0 = RealTimeDeque.head t02 + let t03 = RealTimeDeque.tail t02 + let e0 = RealTimeDeque.head t03 + let t04 = RealTimeDeque.tail t03 + let f0 = RealTimeDeque.head t04 + + let x1 = (RealTimeDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> RealTimeDeque.tryRemove 1 + let r1 =x1.Value + let a1 = RealTimeDeque.head r1 + let t11 = RealTimeDeque.tail r1 + let c1 = RealTimeDeque.head t11 + let t12 = RealTimeDeque.tail t11 + let d1 = RealTimeDeque.head t12 + let t13 = RealTimeDeque.tail t12 + let e1 = RealTimeDeque.head t13 + let t14 = RealTimeDeque.tail t13 + let f1 = RealTimeDeque.head t14 + + let x2 = (RealTimeDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> RealTimeDeque.tryRemove 2 + let r2 = x2.Value + let a2 = RealTimeDeque.head r2 + let t21 = RealTimeDeque.tail r2 + let b2 = RealTimeDeque.head t21 + let t22 = RealTimeDeque.tail t21 + let c2 = RealTimeDeque.head t22 + let t23 = RealTimeDeque.tail t22 + let e2 = RealTimeDeque.head t23 + let t24 = RealTimeDeque.tail t23 + let f2 = RealTimeDeque.head t24 + + let x3 = (RealTimeDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> RealTimeDeque.tryRemove 3 + let r3 = x3.Value + let a3 = RealTimeDeque.head r3 + let t31 = RealTimeDeque.tail r3 + let b3 = RealTimeDeque.head t31 + let t32 = RealTimeDeque.tail t31 + let c3 = RealTimeDeque.head t32 + let t33 = RealTimeDeque.tail t32 + let e3 = RealTimeDeque.head t33 + let t34 = RealTimeDeque.tail t33 + let f3 = RealTimeDeque.head t34 + + let x4 = (RealTimeDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> RealTimeDeque.tryRemove 4 + let r4 = x4.Value + let a4 = RealTimeDeque.head r4 + let t41 = RealTimeDeque.tail r4 + let b4 = RealTimeDeque.head t41 + let t42 = RealTimeDeque.tail t41 + let c4 = RealTimeDeque.head t42 + let t43 = RealTimeDeque.tail t42 + let d4 = RealTimeDeque.head t43 + let t44 = RealTimeDeque.tail t43 + let f4 = RealTimeDeque.head t44 + + let x5 = (RealTimeDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> RealTimeDeque.tryRemove 5 + let r5 = x5.Value + let a5 = RealTimeDeque.head r5 + let t51 = RealTimeDeque.tail r5 + let b5 = RealTimeDeque.head t51 + let t52 = RealTimeDeque.tail t51 + let c5 = RealTimeDeque.head t52 + let t53 = RealTimeDeque.tail t52 + let d5 = RealTimeDeque.head t53 + let t54 = RealTimeDeque.tail t53 + let e5 = RealTimeDeque.head t54 + + ((b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") && (f0 = "f") + && (a1 = "a") && (c1 = "c") && (d1 = "d") && (e1 = "e") && (f1 = "f") + && (a2 = "a") && (b2 = "b") && (c2 = "d") && (e2 = "e") && (f2 = "f") + && (a3 = "a") && (b3 = "b") && (c3 = "c") && (e3 = "e") && (f3 = "f") + && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d") && (f4 = "f") + && (a5 = "a") && (b5 = "b") && (c5 = "c") && (d5 = "d") && (e5 = "e")) |> Expect.isTrue "" } + + test "RealTimeDeque.update elements RealTimeDeque.length 1" { + len1 |> RealTimeDeque.update 0 "aa" |> RealTimeDeque.head |> Expect.equal "" "aa" } + + test "RealTimeDeque.update elements RealTimeDeque.length 2" { + let r0 = (RealTimeDeque.ofSeq ["a";"b"]) |> RealTimeDeque.update 0 "zz" + let a0 = RealTimeDeque.head r0 + let t01 = RealTimeDeque.tail r0 + let b0 = RealTimeDeque.head t01 + + let r1 = (RealTimeDeque.ofSeq ["a";"b"]) |> RealTimeDeque.update 1 "zz" + let a1 = RealTimeDeque.head r1 + let t11 = RealTimeDeque.tail r1 + let b1 = RealTimeDeque.head t11 + + ((a0 = "zz") && (b0 = "b") + && (a1 = "a") && (b1 = "zz")) |> Expect.isTrue "" } + + test "RealTimeDeque.update elements RealTimeDeque.length 3" { + let r0 = (RealTimeDeque.ofSeq ["a";"b";"c"]) |> RealTimeDeque.update 0 "zz" + let a0 = RealTimeDeque.head r0 + let t01 = RealTimeDeque.tail r0 + let b0 = RealTimeDeque.head t01 + let t02 = RealTimeDeque.tail t01 + let c0 = RealTimeDeque.head t02 + + let r1 = (RealTimeDeque.ofSeq ["a";"b";"c"]) |> RealTimeDeque.update 1 "zz" + let a1 = RealTimeDeque.head r1 + let t11 = RealTimeDeque.tail r1 + let b1 = RealTimeDeque.head t11 + let t12 = RealTimeDeque.tail t11 + let c1 = RealTimeDeque.head t12 + + let r2 = (RealTimeDeque.ofSeq ["a";"b";"c"]) |> RealTimeDeque.update 2 "zz" + let a2 = RealTimeDeque.head r2 + let t21 = RealTimeDeque.tail r2 + let b2 = RealTimeDeque.head t21 + let t22 = RealTimeDeque.tail t21 + let c2 = RealTimeDeque.head t22 + + ((a0 = "zz") && (b0 = "b") && (c0 = "c") + && (a1 = "a") && (b1 = "zz") && (c1 = "c") + && (a2 = "a") && (b2 = "b") && (c2 = "zz")) |> Expect.isTrue "" } + + test "RealTimeDeque.update elements RealTimeDeque.length 4" { + let r0 = (RealTimeDeque.ofSeq ["a";"b";"c";"d"]) |> RealTimeDeque.update 0 "zz" + let a0 = RealTimeDeque.head r0 + let t01 = RealTimeDeque.tail r0 + let b0 = RealTimeDeque.head t01 + let t02 = RealTimeDeque.tail t01 + let c0 = RealTimeDeque.head t02 + let t03 = RealTimeDeque.tail t02 + let d0 = RealTimeDeque.head t03 + + let r1 = (RealTimeDeque.ofSeq ["a";"b";"c";"d"]) |> RealTimeDeque.update 1 "zz" + let a1 = RealTimeDeque.head r1 + let t11 = RealTimeDeque.tail r1 + let b1 = RealTimeDeque.head t11 + let t12 = RealTimeDeque.tail t11 + let c1 = RealTimeDeque.head t12 + let t13 = RealTimeDeque.tail t12 + let d1 = RealTimeDeque.head t13 + + let r2 = (RealTimeDeque.ofSeq ["a";"b";"c";"d"]) |> RealTimeDeque.update 2 "zz" + let a2 = RealTimeDeque.head r2 + let t21 = RealTimeDeque.tail r2 + let b2 = RealTimeDeque.head t21 + let t22 = RealTimeDeque.tail t21 + let c2 = RealTimeDeque.head t22 + let t23 = RealTimeDeque.tail t22 + let d2 = RealTimeDeque.head t23 + + let r3 = (RealTimeDeque.ofSeq ["a";"b";"c";"d"]) |> RealTimeDeque.update 3 "zz" + let a3 = RealTimeDeque.head r3 + let t31 = RealTimeDeque.tail r3 + let b3 = RealTimeDeque.head t31 + let t32 = RealTimeDeque.tail t31 + let c3 = RealTimeDeque.head t32 + let t33 = RealTimeDeque.tail t32 + let d3 = RealTimeDeque.head t33 + + ((a0 = "zz") && (b0 = "b") && (c0 = "c") && (d0 = "d") + && (a1 = "a") && (b1 = "zz") && (c1 = "c") && (d1 = "d") + && (a2 = "a") && (b2 = "b") && (c2 = "zz") && (d2 = "d") + && (a3 = "a") && (b3 = "b") && (c3 = "c") && (d3 = "zz")) |> Expect.isTrue "" } + + test "RealTimeDeque.update elements RealTimeDeque.length 5" { + let r0 = (RealTimeDeque.ofSeq ["a";"b";"c";"d";"e"]) |> RealTimeDeque.update 0 "zz" + let a0 = RealTimeDeque.head r0 + let t01 = RealTimeDeque.tail r0 + let b0 = RealTimeDeque.head t01 + let t02 = RealTimeDeque.tail t01 + let c0 = RealTimeDeque.head t02 + let t03 = RealTimeDeque.tail t02 + let d0 = RealTimeDeque.head t03 + let t04 = RealTimeDeque.tail t03 + let e0 = RealTimeDeque.head t04 + + let r1 = (RealTimeDeque.ofSeq ["a";"b";"c";"d";"e"]) |> RealTimeDeque.update 1 "zz" + let a1 = RealTimeDeque.head r1 + let t11 = RealTimeDeque.tail r1 + let b1 = RealTimeDeque.head t11 + let t12 = RealTimeDeque.tail t11 + let c1 = RealTimeDeque.head t12 + let t13 = RealTimeDeque.tail t12 + let d1 = RealTimeDeque.head t13 + let t14 = RealTimeDeque.tail t13 + let e1 = RealTimeDeque.head t14 + + let r2 = (RealTimeDeque.ofSeq ["a";"b";"c";"d";"e"]) |> RealTimeDeque.update 2 "zz" + let a2 = RealTimeDeque.head r2 + let t21 = RealTimeDeque.tail r2 + let b2 = RealTimeDeque.head t21 + let t22 = RealTimeDeque.tail t21 + let c2 = RealTimeDeque.head t22 + let t23 = RealTimeDeque.tail t22 + let d2 = RealTimeDeque.head t23 + let t24 = RealTimeDeque.tail t23 + let e2 = RealTimeDeque.head t24 + + let r3 = (RealTimeDeque.ofSeq ["a";"b";"c";"d";"e"]) |> RealTimeDeque.update 3 "zz" + let a3 = RealTimeDeque.head r3 + let t31 = RealTimeDeque.tail r3 + let b3 = RealTimeDeque.head t31 + let t32 = RealTimeDeque.tail t31 + let c3 = RealTimeDeque.head t32 + let t33 = RealTimeDeque.tail t32 + let d3 = RealTimeDeque.head t33 + let t34 = RealTimeDeque.tail t33 + let e3 = RealTimeDeque.head t34 + + let r4 = (RealTimeDeque.ofSeq ["a";"b";"c";"d";"e"]) |> RealTimeDeque.update 4 "zz" + let a4 = RealTimeDeque.head r4 + let t41 = RealTimeDeque.tail r4 + let b4 = RealTimeDeque.head t41 + let t42 = RealTimeDeque.tail t41 + let c4 = RealTimeDeque.head t42 + let t43 = RealTimeDeque.tail t42 + let d4 = RealTimeDeque.head t43 + let t44 = RealTimeDeque.tail t43 + let e4 = RealTimeDeque.head t44 + + ((a0 = "zz") && (b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") + && (a1 = "a") && (b1 = "zz") && (c1 = "c") && (d1 = "d") && (e1 = "e") + && (a2 = "a") && (b2 = "b") && (c2 = "zz") && (d2 = "d") && (e2 = "e") + && (a3 = "a") && (b3 = "b") && (c3 = "c") && (d3 = "zz") && (e3 = "e") + && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d") && (e4 = "zz")) |> Expect.isTrue "" } + + test "RealTimeDeque.update elements RealTimeDeque.length 6" { + let r0 = (RealTimeDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> RealTimeDeque.update 0 "zz" + let a0 = RealTimeDeque.head r0 + let t01 = RealTimeDeque.tail r0 + let b0 = RealTimeDeque.head t01 + let t02 = RealTimeDeque.tail t01 + let c0 = RealTimeDeque.head t02 + let t03 = RealTimeDeque.tail t02 + let d0 = RealTimeDeque.head t03 + let t04 = RealTimeDeque.tail t03 + let e0 = RealTimeDeque.head t04 + let t05 = RealTimeDeque.tail t04 + let f0 = RealTimeDeque.head t05 + + let r1 = (RealTimeDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> RealTimeDeque.update 1 "zz" + let a1 = RealTimeDeque.head r1 + let t11 = RealTimeDeque.tail r1 + let b1 = RealTimeDeque.head t11 + let t12 = RealTimeDeque.tail t11 + let c1 = RealTimeDeque.head t12 + let t13 = RealTimeDeque.tail t12 + let d1 = RealTimeDeque.head t13 + let t14 = RealTimeDeque.tail t13 + let e1 = RealTimeDeque.head t14 + let t15 = RealTimeDeque.tail t14 + let f1 = RealTimeDeque.head t15 + + let r2 = (RealTimeDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> RealTimeDeque.update 2 "zz" + let a2 = RealTimeDeque.head r2 + let t21 = RealTimeDeque.tail r2 + let b2 = RealTimeDeque.head t21 + let t22 = RealTimeDeque.tail t21 + let c2 = RealTimeDeque.head t22 + let t23 = RealTimeDeque.tail t22 + let d2 = RealTimeDeque.head t23 + let t24 = RealTimeDeque.tail t23 + let e2 = RealTimeDeque.head t24 + let t25 = RealTimeDeque.tail t24 + let f2 = RealTimeDeque.head t25 + + let r3 = (RealTimeDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> RealTimeDeque.update 3 "zz" + let a3 = RealTimeDeque.head r3 + let t31 = RealTimeDeque.tail r3 + let b3 = RealTimeDeque.head t31 + let t32 = RealTimeDeque.tail t31 + let c3 = RealTimeDeque.head t32 + let t33 = RealTimeDeque.tail t32 + let d3 = RealTimeDeque.head t33 + let t34 = RealTimeDeque.tail t33 + let e3 = RealTimeDeque.head t34 + let t35 = RealTimeDeque.tail t34 + let f3 = RealTimeDeque.head t35 + + let r4 = (RealTimeDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> RealTimeDeque.update 4 "zz" + let a4 = RealTimeDeque.head r4 + let t41 = RealTimeDeque.tail r4 + let b4 = RealTimeDeque.head t41 + let t42 = RealTimeDeque.tail t41 + let c4 = RealTimeDeque.head t42 + let t43 = RealTimeDeque.tail t42 + let d4 = RealTimeDeque.head t43 + let t44 = RealTimeDeque.tail t43 + let e4 = RealTimeDeque.head t44 + let t45 = RealTimeDeque.tail t44 + let f4 = RealTimeDeque.head t45 + + let r5 = (RealTimeDeque.ofSeq ["a";"b";"c";"d";"e";"f"]) |> RealTimeDeque.update 5 "zz" + let a5 = RealTimeDeque.head r5 + let t51 = RealTimeDeque.tail r5 + let b5 = RealTimeDeque.head t51 + let t52 = RealTimeDeque.tail t51 + let c5 = RealTimeDeque.head t52 + let t53 = RealTimeDeque.tail t52 + let d5 = RealTimeDeque.head t53 + let t54 = RealTimeDeque.tail t53 + let e5 = RealTimeDeque.head t54 + let t55 = RealTimeDeque.tail t54 + let f5 = RealTimeDeque.head t55 + + ((a0 = "zz") && (b0 = "b") && (c0 = "c") && (d0 = "d") && (e0 = "e") && (f0 = "f") + && (a1 = "a") && (b1 = "zz") && (c1 = "c") && (d1 = "d") && (e1 = "e") && (f1 = "f") + && (a2 = "a") && (b2 = "b") && (c2 = "zz") && (d2 = "d") && (e2 = "e") && (f2 = "f") + && (a3 = "a") && (b3 = "b") && (c3 = "c") && (d3 = "zz") && (e3 = "e") && (f3 = "f") + && (a4 = "a") && (b4 = "b") && (c4 = "c") && (d4 = "d") && (e4 = "zz") && (f4 = "f") + && (a5 = "a") && (b5 = "b") && (c5 = "c") && (d5 = "d") && (e5 = "e") && (f5 = "zz")) |> Expect.isTrue "" } + + test "RealTimeDeque.tryUpdate elements RealTimeDeque.length 1" { + let a = len1 |> RealTimeDeque.tryUpdate 0 "aa" + a.Value |> RealTimeDeque.head |> Expect.equal "" "aa" } + + test "RealTimeDeque.tryUpdate elements RealTimeDeque.length 2" { + let x0 = (RealTimeDeque.ofSeq ["a";"b"]) |> RealTimeDeque.tryUpdate 0 "zz" + let r0 = x0.Value + let a0 = RealTimeDeque.head r0 + let t01 = RealTimeDeque.tail r0 + let b0 = RealTimeDeque.head t01 + + let x1 = (RealTimeDeque.ofSeq ["a";"b"]) |> RealTimeDeque.tryUpdate 1 "zz" + let r1 = x1.Value + let a1 = RealTimeDeque.head r1 + let t11 = RealTimeDeque.tail r1 + let b1 = RealTimeDeque.head t11 + + ((a0 = "zz") && (b0 = "b") + && (a1 = "a") && (b1 = "zz")) |> Expect.isTrue "" } + + test "RealTimeDeque.tryUpdate elements RealTimeDeque.length 3" { + let x0 = (RealTimeDeque.ofSeq ["a";"b";"c"]) |> RealTimeDeque.tryUpdate 0 "zz" + let r0 = x0.Value + let a0 = RealTimeDeque.head r0 + let t01 = RealTimeDeque.tail r0 + let b0 = RealTimeDeque.head t01 + let t02 = RealTimeDeque.tail t01 + let c0 = RealTimeDeque.head t02 + + let x1 = (RealTimeDeque.ofSeq ["a";"b";"c"]) |> RealTimeDeque.tryUpdate 1 "zz" + let r1 = x1.Value + let a1 = RealTimeDeque.head r1 + let t11 = RealTimeDeque.tail r1 + let b1 = RealTimeDeque.head t11 + let t12 = RealTimeDeque.tail t11 + let c1 = RealTimeDeque.head t12 + + let x2 = (RealTimeDeque.ofSeq ["a";"b";"c"]) |> RealTimeDeque.tryUpdate 2 "zz" + let r2 = x2.Value + let a2 = RealTimeDeque.head r2 + let t21 = RealTimeDeque.tail r2 + let b2 = RealTimeDeque.head t21 + let t22 = RealTimeDeque.tail t21 + let c2 = RealTimeDeque.head t22 + + ((a0 = "zz") && (b0 = "b") && (c0 = "c") + && (a1 = "a") && (b1 = "zz") && (c1 = "c") + && (a2 = "a") && (b2 = "b") && (c2 = "zz")) |> Expect.isTrue "" } + + test "RealTimeDeque.tryUpdate elements RealTimeDeque.length 4" { + let x0 = (RealTimeDeque.ofSeq ["a";"b";"c";"d"]) |> RealTimeDeque.tryUpdate 0 "zz" + let r0 = x0.Value + let a0 = RealTimeDeque.head r0 + let t01 = RealTimeDeque.tail r0 + let b0 = RealTimeDeque.head t01 + let t02 = RealTimeDeque.tail t01 + let c0 = RealTimeDeque.head t02 + let t03 = RealTimeDeque.tail t02 + let d0 = RealTimeDeque.head t03 + + let x1 = (RealTimeDeque.ofSeq ["a";"b";"c";"d"]) |> RealTimeDeque.tryUpdate 1 "zz" + let r1 = x1.Value + let a1 = RealTimeDeque.head r1 + let t11 = RealTimeDeque.tail r1 + let b1 = RealTimeDeque.head t11 + let t12 = RealTimeDeque.tail t11 + let c1 = RealTimeDeque.head t12 + let t13 = RealTimeDeque.tail t12 + let d1 = RealTimeDeque.head t13 + + let x2 = (RealTimeDeque.ofSeq ["a";"b";"c";"d"]) |> RealTimeDeque.tryUpdate 2 "zz" + let r2 = x2.Value + let a2 = RealTimeDeque.head r2 + let t21 = RealTimeDeque.tail r2 + let b2 = RealTimeDeque.head t21 + let t22 = RealTimeDeque.tail t21 + let c2 = RealTimeDeque.head t22 + let t23 = RealTimeDeque.tail t22 + let d2 = RealTimeDeque.head t23 + + let x3 = (RealTimeDeque.ofSeq ["a";"b";"c";"d"]) |> RealTimeDeque.tryUpdate 3 "zz" + let r3 = x3.Value + let a3 = RealTimeDeque.head r3 + let t31 = RealTimeDeque.tail r3 + let b3 = RealTimeDeque.head t31 + let t32 = RealTimeDeque.tail t31 + let c3 = RealTimeDeque.head t32 + let t33 = RealTimeDeque.tail t32 + let d3 = RealTimeDeque.head t33 + + ((a0 = "zz") && (b0 = "b") && (c0 = "c") && (d0 = "d") + && (a1 = "a") && (b1 = "zz") && (c1 = "c") && (d1 = "d") + && (a2 = "a") && (b2 = "b") && (c2 = "zz") && (d2 = "d") + && (a3 = "a") && (b3 = "b") && (c3 = "c") && (d3 = "zz")) |> Expect.isTrue "" } + + test "RealTimeDeque.tryUncons on RealTimeDeque.empty" { + let q = RealTimeDeque.empty 2 + (RealTimeDeque.tryUncons q = None) |> Expect.isTrue "" } + + test "RealTimeDeque.tryUncons on q" { + let q = RealTimeDeque.ofSeq ["a";"b";"c";"d"] + let x, xs = (RealTimeDeque.tryUncons q).Value + x |> Expect.equal "" "a" } + + test "RealTimeDeque.tryUnsnoc on RealTimeDeque.empty" { + let q = RealTimeDeque.empty 2 + (RealTimeDeque.tryUnsnoc q = None) |> Expect.isTrue "" } + + test "RealTimeDeque.tryUnsnoc on q" { + let q = RealTimeDeque.ofSeq ["a";"b";"c";"d"] + let xs, x = (RealTimeDeque.tryUnsnoc q).Value + x |> Expect.equal "" "d" } + + test "RealTimeDeque.tryGetHead on RealTimeDeque.empty" { + let q = RealTimeDeque.empty 2 + (RealTimeDeque.tryGetHead q = None) |> Expect.isTrue "" } + + test "RealTimeDeque.tryGetHead on q" { + let q = RealTimeDeque.ofSeq ["a";"b";"c";"d"] + (RealTimeDeque.tryGetHead q).Value |> Expect.equal "" "a" } + + test "tryGetInit on RealTimeDeque.empty" { + let q = RealTimeDeque.empty 2 + (RealTimeDeque.tryGetInit q = None) |> Expect.isTrue "" } + + test "tryGetInit on q" { + let q = RealTimeDeque.ofSeq ["a";"b";"c";"d"] + let x = (RealTimeDeque.tryGetInit q).Value + let x2 = x|> RealTimeDeque.last + x2 |> Expect.equal "" "c" } + + test "tryGetLast on RealTimeDeque.empty" { + let q = RealTimeDeque.empty 2 + (RealTimeDeque.tryGetLast q = None) |> Expect.isTrue "" } + + test "tryGetLast on q" { + let q = RealTimeDeque.ofSeq ["a";"b";"c";"d"] + (RealTimeDeque.tryGetLast q).Value |> Expect.equal "" "d" } + + + test "tryGetTail on RealTimeDeque.empty" { + let q = RealTimeDeque.empty 2 + (RealTimeDeque.tryGetTail q = None) |> Expect.isTrue "" } + + test "tryGetTail on q" { + let q = RealTimeDeque.ofSeq ["a";"b";"c";"d"] + (RealTimeDeque.tryGetTail q).Value |> RealTimeDeque.head |> Expect.equal "" "b" } + ] \ No newline at end of file diff --git a/tests/FSharpx.Collections.Experimental.Tests/RealTimeQueueTest.fs b/tests/FSharpx.Collections.Experimental.Tests/RealTimeQueueTest.fs index 2f6082d5..42285b10 100644 --- a/tests/FSharpx.Collections.Experimental.Tests/RealTimeQueueTest.fs +++ b/tests/FSharpx.Collections.Experimental.Tests/RealTimeQueueTest.fs @@ -1,61 +1,55 @@ -module FSharpx.Collections.Experimental.Tests.RealTimeQueueTest +namespace FSharpx.Collections.Experimental.Tests -open System open FSharpx.Collections open FSharpx.Collections.Experimental -open FSharpx.Collections.Experimental.RealTimeQueue -open NUnit.Framework -open FsUnit - -[] -let ``empty queue should be empty``() = - isEmpty empty |> should equal true - -[] -let ``it should allow to enqueue``() = - empty |> snoc 1 |> snoc 2 |> isEmpty |> should equal false - -[] -let ``it should allow to dequeue``() = - empty |> snoc 1 |> tail |> isEmpty |> should equal true - -[] -let ``it should fail if there is no head in the queue``() = - let ok = ref false - try - empty |> head |> ignore - with x when x = Exceptions.Empty -> ok := true - !ok |> should equal true - -[] -let ``it should give None if there is no head in the queue``() = - empty |> tryGetHead |> should equal None - -[] -let ``it should fail if there is no tail the queue``() = - let ok = ref false - try - empty |> tail |> ignore - with x when x = Exceptions.Empty -> ok := true - !ok |> should equal true - -[] -let ``it should give None if there is no tail in the queue``() = - empty |> tryGetTail |> should equal None - -[] -let ``it should allow to get the head from a queue``() = - empty |> snoc 1 |> snoc 2 |> head |> should equal 1 - -[] -let ``it should allow to get the head from a queue safely``() = - empty |> snoc 1 |> snoc 2 |> tryGetHead |> should equal (Some 1) - -[] -let ``it should allow to get the tail from the queue``() = - empty |> snoc "a" |> snoc "b" |> snoc "c" |> tail |> head |> should equal "b" - -[] -let ``it should allow to get the tail from a queue safely``() = - let value = empty |> snoc 1 |> snoc 2 |> tryGetTail - value.Value |> head |> should equal 2 \ No newline at end of file +open Expecto +open Expecto.Flip + +module RealTimeQueueTest = + + [] + let testRealTimeQueue = + + testList "Experimental RealTimeQueue" [ + test "RealTimeQueue.empty queue should be RealTimeQueue.empty" { + RealTimeQueue.isEmpty RealTimeQueue.empty |> Expect.isTrue "" } + + test "it should allow to enqueue" { + RealTimeQueue.empty |> RealTimeQueue.snoc 1 |> RealTimeQueue.snoc 2 |> RealTimeQueue.isEmpty |> Expect.isFalse "" } + + test "it should allow to dequeue" { + RealTimeQueue.empty |> RealTimeQueue.snoc 1 |> RealTimeQueue.tail |> RealTimeQueue.isEmpty |> Expect.isTrue "" } + + test "it should fail if there is no RealTimeQueue.head in the queue" { + let ok = ref false + try + RealTimeQueue.empty |> RealTimeQueue.head |> ignore + with x when x = Exceptions.Empty -> ok := true + !ok |> Expect.isTrue "" } + + test "it should give None if there is no RealTimeQueue.head in the queue" { + RealTimeQueue.empty |> RealTimeQueue.tryGetHead |> Expect.isNone "" } + + test "it should fail if there is no RealTimeQueue.tail the queue" { + let ok = ref false + try + RealTimeQueue.empty |> RealTimeQueue.tail |> ignore + with x when x = Exceptions.Empty -> ok := true + !ok |> Expect.isTrue "" } + + test "it should give None if there is no RealTimeQueue.tail in the queue" { + RealTimeQueue.empty |> RealTimeQueue.tryGetTail |> Expect.isNone "" } + + test "it should allow to get the RealTimeQueue.head from a queue" { + RealTimeQueue.empty |> RealTimeQueue.snoc 1 |> RealTimeQueue.snoc 2 |> RealTimeQueue.head |> Expect.equal "" 1 } + + test "it should allow to get the RealTimeQueue.head from a queue safely" { + RealTimeQueue.empty |> RealTimeQueue.snoc 1 |> RealTimeQueue.snoc 2 |> RealTimeQueue.tryGetHead |> Expect.equal "" (Some 1) } + + test "it should allow to get the RealTimeQueue.tail from the queue" { + RealTimeQueue.empty |> RealTimeQueue.snoc "a" |> RealTimeQueue.snoc "b" |> RealTimeQueue.snoc "c" |> RealTimeQueue.tail |> RealTimeQueue.head |> Expect.equal "" "b" } + + test "it should allow to get the RealTimeQueue.tail from a queue safely" { + let value = RealTimeQueue.empty |> RealTimeQueue.snoc 1 |> RealTimeQueue.snoc 2 |> RealTimeQueue.tryGetTail + value.Value |> RealTimeQueue.head |> Expect.equal "" 2 } + ] \ No newline at end of file diff --git a/tests/FSharpx.Collections.Experimental.Tests/RingBufferTest.fs b/tests/FSharpx.Collections.Experimental.Tests/RingBufferTest.fs index a88a367e..680ebd22 100644 --- a/tests/FSharpx.Collections.Experimental.Tests/RingBufferTest.fs +++ b/tests/FSharpx.Collections.Experimental.Tests/RingBufferTest.fs @@ -1,78 +1,73 @@ -module FSharpx.Collections.Experimental.Tests.RingBufferTest +namespace FSharpx.Collections.Experimental.Tests open System open FSharpx.Collections.Experimental -open FSharpx.Collections.Experimental.RingBuffer -open NUnit.Framework -open FsUnit +open Expecto +open Expecto.Flip -[] -let ``I can create a ring buffer with a given size``() = - let actual = new RingBuffer(10) - let expected = Array.init 10 (fun _ -> 0) - actual.ToArray() |> should equal expected +module RingBufferTest = -[] -let ``I can create a ring buffer with a given set of values``() = - let actual = new RingBuffer([|1;2;3;4;5;6;7;8;9;10|]) - let expected = Array.init 10 (fun i -> i + 1) - actual.ToArray() |> should equal expected + [] + let testRingBuffer = -[] -let ``I can normalise a ring buffer``() = - let actual = new RingBuffer([|1;2;3;4;5;6;7;8;9;10|]) - actual.Advance(5) |> ignore - actual.Position |> should equal 5 - actual.Normalize() - actual.Position |> should equal 0 - actual.ToArray() |> should equal [|6;7;8;9;10;0;0;0;0;0|] + testList "Experimental RingBuffer" [ + test "I can create a ring buffer with a given size" { + let actual = new RingBuffer(10) + let expected = Array.init 10 (fun _ -> 0) + actual.ToArray() |> Expect.equal "" expected } -[] -let ``I can insert values at 0 offset``() = - let buffer = new RingBuffer(10) - buffer.Insert(0, [|1;2;3;4;5|]) - buffer.ToArray() |> should equal [|1;2;3;4;5;0;0;0;0;0|] + test "I can create a ring buffer with a given set of values" { + let actual = new RingBuffer([|1;2;3;4;5;6;7;8;9;10|]) + let expected = Array.init 10 (fun i -> i + 1) + actual.ToArray() |> Expect.equal "" expected } -[] -let ``I should not be able to insert more values than the size of the buffer``() = - let buffer = new RingBuffer(10) - buffer.Insert(0, [|1;2;3;4;5;6;7;8;9;10;11|]) - buffer.ToArray() |> should equal [|1;2;3;4;5;6;7;8;9;10|] + test "I can normalise a ring buffer" { + let actual = new RingBuffer([|1;2;3;4;5;6;7;8;9;10|]) + actual.Advance(5) |> ignore + actual.Position |> Expect.equal "" 5 + actual.Normalize() + actual.Position |> Expect.equal "" 0 + actual.ToArray() |> Expect.equal "" [|6;7;8;9;10;0;0;0;0;0|] } -[] -let ``Insert should not fail if an empty sequence is inserted``() = - let actual = new RingBuffer(10) - actual.Insert(0, [||]) - let expected = Array.init 10 (fun _ -> 0) - actual.ToArray() |> should equal expected + test "I can insert values at 0 offset" { + let buffer = new RingBuffer(10) + buffer.Insert(0, [|1;2;3;4;5|]) + buffer.ToArray() |> Expect.equal "" [|1;2;3;4;5;0;0;0;0;0|] } -[] -let ``I should be able to move the start index of the buffer``() = - let buffer = new RingBuffer([|1;2;3;4;5;6;7;8;9;10|]) - buffer.Advance(5) |> ignore - buffer.ToArray() |> should equal [|6;7;8;9;10;0;0;0;0;0|] + test "I should not be able to insert more values than the size of the buffer" { + let buffer = new RingBuffer(10) + buffer.Insert(0, [|1;2;3;4;5;6;7;8;9;10;11|]) + buffer.ToArray() |> Expect.equal "" [|1;2;3;4;5;6;7;8;9;10|] } + + test "Insert should not fail if an empty sequence is inserted" { + let actual = new RingBuffer(10) + actual.Insert(0, [||]) + let expected = Array.init 10 (fun _ -> 0) + actual.ToArray() |> Expect.equal "" expected } + + test "I should be able to move the start index of the buffer" { + let buffer = new RingBuffer([|1;2;3;4;5;6;7;8;9;10|]) + buffer.Advance(5) |> ignore + buffer.ToArray() |> Expect.equal "" [|6;7;8;9;10;0;0;0;0;0|] } -[] -let ``Advancing past the end of the buffer should cause it to wrap``() = - let buffer = new RingBuffer([|1;2;3;4;5;6;7;8;9;10|]) - buffer.Advance(11) |> ignore - buffer.ToArray() |> should equal [|0;0;0;0;0;0;0;0;0;0|] - buffer.Position |> should equal 1 + test "Advancing past the end of the buffer should cause it to wrap" { + let buffer = new RingBuffer([|1;2;3;4;5;6;7;8;9;10|]) + buffer.Advance(11) |> ignore + buffer.ToArray() |> Expect.equal "" [|0;0;0;0;0;0;0;0;0;0|] + buffer.Position |> Expect.equal "" 1 } -[] -let ``I should be able to clone a ring buffer``() = - let buffer = new RingBuffer([|1;2;3;4;5;6;7;8;9;10|]) - let clone = buffer.Clone() - buffer.ToArray() |> should equal (clone.ToArray()) - clone.Advance(2) |> ignore - Assert.AreNotEqual(buffer.ToArray(),clone.ToArray()) - buffer.Position |> should equal 0 - clone.Position |> should equal 2 + test "I should be able to clone a ring buffer" { + let buffer = new RingBuffer([|1;2;3;4;5;6;7;8;9;10|]) + let clone = buffer.Clone() + buffer.ToArray() |> Expect.equal "" <| clone.ToArray() + clone.Advance(2) |> ignore + Expect.notEqual "" (buffer.ToArray()) <| clone.ToArray() + buffer.Position |> Expect.equal "" 0 + clone.Position |> Expect.equal "" 2 } -[] -let ``I can insert with an operation into the buffer``() = - let buffer = new RingBuffer(10) - buffer.Insert(0, [|1;2;3;4;5;6;7;8;9;10;11|]) - buffer.Insert((+), 5, [100;100;100;100;100;100]) - buffer.ToArray() |> should equal [|1;2;3;4;5;106;107;108;109;110|] - \ No newline at end of file + test "I can insert with an operation into the buffer" { + let buffer = new RingBuffer(10) + buffer.Insert(0, [|1;2;3;4;5;6;7;8;9;10;11|]) + buffer.Insert((+), 5, [100;100;100;100;100;100]) + buffer.ToArray() |> Expect.equal "" [|1;2;3;4;5;106;107;108;109;110|] } + ] \ No newline at end of file diff --git a/tests/FSharpx.Collections.Experimental.Tests/RoseTreeTest.fs b/tests/FSharpx.Collections.Experimental.Tests/RoseTreeTest.fs index f23ec272..fe7ca08c 100644 --- a/tests/FSharpx.Collections.Experimental.Tests/RoseTreeTest.fs +++ b/tests/FSharpx.Collections.Experimental.Tests/RoseTreeTest.fs @@ -1,130 +1,123 @@ -module FSharpx.Collections.Experimental.Tests.RoseTreeTest +namespace FSharpx.Collections.Experimental.Tests open FSharpx open FSharpx.Collections open FSharpx.Collections.Experimental -open NUnit.Framework +open Expecto +open Expecto.Flip -let tree a b = RoseTree.create a (LazyList.ofList b) +module RoseTreeTest = -let atree = tree 1 [tree 2 [tree 3 []]; tree 4 [tree 5 [tree 6 []]]] -let ctree = tree "f" [tree "b" [tree "a" []; tree "d" [tree "c" []; tree "e" []]]; tree "g" [tree "i" [tree "h" []]]] + let tree a b = RoseTree.create a (LazyList.ofList b) -// dfs examples borrowed from http://en.wikipedia.org/wiki/Tree_traversal#Example + let atree = tree 1 [tree 2 [tree 3 []]; tree 4 [tree 5 [tree 6 []]]] + let ctree = tree "f" [tree "b" [tree "a" []; tree "d" [tree "c" []; tree "e" []]]; tree "g" [tree "i" [tree "h" []]]] -[] -let ``dfs pre``() = - let actual = RoseTree.dfsPre ctree |> Seq.toList - Assert.AreEqual(["f";"b";"a";"d";"c";"e";"g";"i";"h"], actual) + type HtmlElement = { TagName: string; Attributes: (string * string) list } -[] -let ``dfs post``() = - let actual = RoseTree.dfsPost ctree |> Seq.toList - Assert.AreEqual(["a";"c";"e";"d";"b";"h";"i";"g";"f"], actual) + type HtmlNode = + | Element of HtmlElement + | Text of string + + let elemA tag attr = HtmlNode.Element { TagName = tag; Attributes = attr } + let elem tag = elemA tag [] + let text t = tree (HtmlNode.Text t) [] + type Html = HtmlNode RoseTree + + let htmldoc = + tree (elem "body") [tree (elem "div") [text "hello world"]] + + // dfs examples borrowed from http://en.wikipedia.org/wiki/Tree_traversal#Exampl + [] + let testRoseTree = + + testList "Experimental RoseTree" [ + test "dfs pre" { + let actual = RoseTree.dfsPre ctree |> Seq.toList + Expect.equal "" ["f";"b";"a";"d";"c";"e";"g";"i";"h"] actual } + + test "dfs post" { + let actual = RoseTree.dfsPost ctree |> Seq.toList + Expect.equal "" ["a";"c";"e";"d";"b";"h";"i";"g";"f"] actual } -[] -let map() = - let actual = RoseTree.map ((+) 1) atree - let expected = tree 2 [tree 3 [tree 4 []]; tree 5 [tree 6 [tree 7 []]]] - Assert.AreEqual(expected, actual) - -[] -let ``fold via dfs``() = - let actual = RoseTree.dfsPre atree |> Seq.fold (*) 1 - Assert.AreEqual(720, actual) - - -[] -let unfold() = - let a = RoseTree.unfold (fun i -> i, LazyList.ofSeq {i+1..3}) 0 - let expected = tree 0 [tree 1 [tree 2 [tree 3 []]; tree 3 []]; tree 2 [tree 3 []]; tree 3 []] - Assert.AreEqual(expected, a) - -// not the best example, as text nodes cannot have children - -type HtmlElement = { TagName: string; Attributes: (string * string) list } - -type HtmlNode = -| Element of HtmlElement -| Text of string - -let elemA tag attr = HtmlNode.Element { TagName = tag; Attributes = attr } -let elem tag = elemA tag [] -let text t = tree (HtmlNode.Text t) [] -type Html = HtmlNode RoseTree - -let htmldoc = - tree (elem "body") [tree (elem "div") [text "hello world"]] - -[] -let mapAccum() = - let e, taggedHtmlDoc = - RoseTree.mapAccum - (fun i -> function - | Element x -> i+1, Element { x with Attributes = ("data-i",i.ToString())::x.Attributes } - | x -> i,x) 0 htmldoc - let expected = - tree (elemA "body" ["data-i","0"]) - [tree (elemA "div" ["data-i","1"]) [text "hello world"]] - Assert.AreEqual(expected, taggedHtmlDoc) - Assert.AreEqual(2, e) - -[] -let bind() = - let wrapText = - function - | Text t -> tree (elem "span") [text t] - | x -> RoseTree.singleton x - let newDoc = htmldoc |> RoseTree.bind wrapText - let expected = tree (elem "body") [tree (elem "div") [tree (elem "span") [text "hello world"]]] - Assert.AreEqual(expected, newDoc) - -open FsCheck -open FsCheck.NUnit -open FSharpx.Collections.Tests.Properties - -type RoseTreeGen = - static member RoseTree() = - let rec roseTreeGen() = - gen { - let! root = Arb.generate - // need to set these frequencies to avoid blowing the stack - let! children = Gen.frequency [70, gen.Return LazyList.empty; 1, Gen.finiteLazyList()] - return RoseTree.create root children - } - Arb.fromGen (roseTreeGen()) - -let registerGen = lazy (Arb.register() |> ignore) - -[] -let equality() = - registerGen.Force() - checkEquality "RoseTree" - -[] -let ``functor laws``() = - registerGen.Force() - let map = RoseTree.map - let n = sprintf "RoseTree : functor %s" - fsCheck (n "preserves identity") <| - fun value -> map id value = value - fsCheck (n "preserves composition") <| - fun f g value -> map (f << g) value = (map f << map g) value - -[] -let ``monad laws``() = - registerGen.Force() - let n = sprintf "RoseTree : monad %s" - let inline (>>=) m f = RoseTree.bind f m - let ret = RoseTree.singleton - fsCheck "left identity" <| - fun f a -> ret a >>= f = f a - fsCheck "right identity" <| - fun x -> x >>= ret = x - fsCheck "associativity" <| - fun f g v -> - let a = (v >>= f) >>= g - let b = v >>= (fun x -> f x >>= g) - a = b - -// TODO port example from http://blog.moertel.com/articles/2007/03/07/directory-tree-printing-in-haskell-part-two-refactoring + test "map" { + let actual = RoseTree.map ((+) 1) atree + let expected = tree 2 [tree 3 [tree 4 []]; tree 5 [tree 6 [tree 7 []]]] + Expect.equal "" expected actual } + + test "fold via dfs" { + let actual = RoseTree.dfsPre atree |> Seq.fold (*) 1 + Expect.equal "" 720 actual } + + test "unfold" { + let a = RoseTree.unfold (fun i -> i, LazyList.ofSeq {i+1..3}) 0 + let expected = tree 0 [tree 1 [tree 2 [tree 3 []]; tree 3 []]; tree 2 [tree 3 []]; tree 3 []] + Expect.equal "" expected a } + + test "mapAccum" { + let e, taggedHtmlDoc = + RoseTree.mapAccum + (fun i -> function + | Element x -> i+1, Element { x with Attributes = ("data-i",i.ToString())::x.Attributes } + | x -> i,x) 0 htmldoc + let expected = + tree (elemA "body" ["data-i","0"]) + [tree (elemA "div" ["data-i","1"]) [text "hello world"]] + Expect.equal "" expected taggedHtmlDoc + Expect.equal "" 2 e } + + test "bind" { + let wrapText = + function + | Text t -> tree (elem "span") [text t] + | x -> RoseTree.singleton x + let newDoc = htmldoc |> RoseTree.bind wrapText + let expected = tree (elem "body") [tree (elem "div") [tree (elem "span") [text "hello world"]]] + Expect.equal "" expected newDoc } + + //open FsCheck + //open FSharpx.Collections.Experimental.Tests.Properties + + //type RoseTreeGen = + // static member RoseTree() = + // let rec roseTreeGen() = + // gen { + // let! root = Arb.generate + // // need to set these frequencies to avoid blowing the stack + // let! children = Gen.frequency [70, gen.Return LazyList.empty; 1, Gen.finiteLazyList()] + // return RoseTree.create root children + // } + // Arb.fromGen (roseTreeGen()) + + //let registerGen = lazy (Arb.register() |> ignore) + + //let equality() = + // registerGen.Force() + // checkEquality "RoseTree" + + //test "functor laws" { + // registerGen.Force() + // let map = RoseTree.map + // let n = sprintf "RoseTree : functor %s" + // fsCheck (n "preserves identity") <| + // fun value -> map id value = value + // fsCheck (n "preserves composition") <| + // fun f g value -> map (f << g) value = (map f << map g) value + + //test "monad laws" { + // registerGen.Force() + // let n = sprintf "RoseTree : monad %s" + // let inline (>>=) m f = RoseTree.bind f m + // let ret = RoseTree.singleton + // fsCheck "left identity" <| + // fun f a -> ret a >>= f = f a + // fsCheck "right identity" <| + // fun x -> x >>= ret = x + // fsCheck "associativity" <| + // fun f g v -> + // let a = (v >>= f) >>= g + // let b = v >>= (fun x -> f x >>= g) + // a = b + + //// TODO port example from http://blog.moertel.com/articles/2007/03/07/directory-tree-printing-in-haskell-part-two-refactoring + ] diff --git a/tests/FSharpx.Collections.Experimental.Tests/RunTests.fs b/tests/FSharpx.Collections.Experimental.Tests/RunTests.fs new file mode 100644 index 00000000..d1c59b84 --- /dev/null +++ b/tests/FSharpx.Collections.Experimental.Tests/RunTests.fs @@ -0,0 +1,83 @@ +namespace FSharpx.Collections.Experimental.Tests + +open Expecto + +module RunTests = + + [] + let main args = + + Tests.runTestsWithArgs defaultConfig args AltBinaryRandomAccessListTest.testAltBinaryRandomAccessList |> ignore + + Tests.runTestsWithArgs defaultConfig args BankersDequeTest.testBankersDeque |> ignore + + Tests.runTestsWithArgs defaultConfig args BatchDequeTest.testBatchDeque |> ignore + + Tests.runTestsWithArgs defaultConfig args BinaryRandomAccessListTest.testBinaryRandomAccessList |> ignore + + Tests.runTestsWithArgs defaultConfig args BinaryRoseTreeTest.testBinaryRoseTree |> ignore + + Tests.runTestsWithArgs defaultConfig args BinaryTreeZipperTest.testBinaryTreeZipper |> ignore + + Tests.runTestsWithArgs defaultConfig args BinomialHeapTest.testBinomialHeap |> ignore + Tests.runTestsWithArgs defaultConfig args BinomialHeapTest.propertyBinomialHeap |> ignore + + Tests.runTestsWithArgs defaultConfig args BKTreeTest.testBKTree |> ignore + + Tests.runTestsWithArgs defaultConfig args BlockResizeArrayTest.testBlockResizeArray |> ignore + + Tests.runTestsWithArgs defaultConfig args BootstrappedQueueTest.testBootstrappedQueue |> ignore + + Tests.runTestsWithArgs defaultConfig args BottomUpMergeSortTest.testBottomUpMergeSort |> ignore + + Tests.runTestsWithArgs defaultConfig args DequeTest.testDeque |> ignore + + Tests.runTestsWithArgs defaultConfig args DListTest.testDList |> ignore + + Tests.runTestsWithArgs defaultConfig args EagerRoseTreeTest.testEagerRoseTree |> ignore + Tests.runTestsWithArgs defaultConfig args EagerRoseTreeTest.testEagerRoseTreePropeerties |> ignore + + Tests.runTestsWithArgs defaultConfig args EditDistanceTest.testEditDistance |> ignore + + Tests.runTestsWithArgs defaultConfig args FileSystemZipperTest.testFileSystemZipper |> ignore + + //Tests.runTestsWithArgs defaultConfig args FlatListTest.testFlatList |> ignore + //Tests.runTestsWithArgs defaultConfig args FlatListTest.testFlatListProperties|> ignore + + Tests.runTestsWithArgs defaultConfig args HeapPriorityQueueTest.testHeapPriorityQueue |> ignore + + Tests.runTestsWithArgs defaultConfig args ImplicitQueueTest.testImplicitQueue |> ignore + + Tests.runTestsWithArgs defaultConfig args IndexedRoseTreeTest.testIndexedRoseTree |> ignore + + Tests.runTestsWithArgs defaultConfig args IntMapTest.testIntMap |> ignore + Tests.runTestsWithArgs defaultConfig args IntMapTest.testIntMapProperties |> ignore + + //Tests.runTestsWithArgs defaultConfig args IQueueTest.<> |> ignore + + //Tests.runTestsWithArgs defaultConfig args LeftistHeapTest.<> |> ignore + + Tests.runTestsWithArgs defaultConfig args ListZipperTest.testListZipper |> ignore + + //Tests.runTestsWithArgs defaultConfig args NonEmptyListTests.<> |> ignore + + //Tests.runTestsWithArgs defaultConfig args PairingHeapTest.<> |> ignore + + Tests.runTestsWithArgs defaultConfig args RealTimeDequeTest.testRealTimeDeque |> ignore + + Tests.runTestsWithArgs defaultConfig args RealTimeQueueTest.testRealTimeQueue |> ignore + + Tests.runTestsWithArgs defaultConfig args RingBufferTest.testRingBuffer |> ignore + + //Tests.runTestsWithArgs defaultConfig args RoseTreeTest.testRoseTree |> ignore + //Tests.runTestsWithArgs defaultConfig args RoseTreeTest.<> |> ignore + + Tests.runTestsWithArgs defaultConfig args SkewBinaryRandomAccessListTest.testSkewBinaryRandomAccessList |> ignore + + // to do: register SkewBinomialHeap + //Tests.runTestsWithArgs defaultConfig args SkewBinomialHeapTest.testSkewBinomialHeap |> ignore + + Tests.runTestsWithArgs defaultConfig args TimeSeriesTest.testTimeSeries |> ignore + + 0 + diff --git a/tests/FSharpx.Collections.Experimental.Tests/SkewBinaryRandomAccessListTest.fs b/tests/FSharpx.Collections.Experimental.Tests/SkewBinaryRandomAccessListTest.fs index e654e843..183a7390 100644 --- a/tests/FSharpx.Collections.Experimental.Tests/SkewBinaryRandomAccessListTest.fs +++ b/tests/FSharpx.Collections.Experimental.Tests/SkewBinaryRandomAccessListTest.fs @@ -1,497 +1,440 @@ -module FSharpx.Collections.Experimental.Tests.SkewBinaryRandomAccessListTest +namespace FSharpx.Collections.Experimental.Tests open System open FSharpx.Collections open FSharpx.Collections.Experimental -open FSharpx.Collections.Experimental.SkewBinaryRandomAccessList -open NUnit.Framework -open FsUnit +open Expecto +open Expecto.Flip //only going up to len5 is probably sufficient to test all edge cases //but better too many unit tests than too few -[] -let ``empty list should be empty``() = - empty() |> isEmpty |> should equal true - -[] -let ``cons works``() = - empty()|> cons 1 |> cons 2 |> isEmpty |> should equal false - -[] -let ``uncons 1 element``() = - let x, _ = empty() |> cons 1 |> uncons - (x = 1) |> should equal true - -[] -let ``uncons 2 elements``() = - let x, _ = empty() |> cons 1 |> cons 2 |> uncons - (x = 2) |> should equal true - -[] -let ``uncons 3 elements``() = - let x, _ = empty() |> cons 1 |> cons 2 |> cons 3 |> uncons - (x = 3) |> should equal true - -[] -let ``tryUncons 1 element``() = - let x = empty() |> cons 1 |> tryUncons - (fst(x.Value) = 1) |> should equal true - -[] -let ``tryUncons 2 elements``() = - let x = empty() |> cons 1 |> cons 2 |> tryUncons - (fst(x.Value) = 2) |> should equal true - -[] -let ``tryUncons 3 elements``() = - let x = empty() |> cons 1 |> cons 2 |> cons 3 |> tryUncons - (fst(x.Value) = 3) |> should equal true - -[] -let ``tryUncons empty``() = - empty() |> tryUncons |> should equal None +module SkewBinaryRandomAccessListTest = + + [] + let testSkewBinaryRandomAccessList = + + testList "Experimental SkewBinaryRandomAccessList" [ + test "empty list should be empty" { + SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.isEmpty |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.cons works" { + SkewBinaryRandomAccessList.empty()|> SkewBinaryRandomAccessList.cons 1 |> SkewBinaryRandomAccessList.cons 2 |> SkewBinaryRandomAccessList.isEmpty |> Expect.isFalse "" } + + test "SkewBinaryRandomAccessList.uncons 1 element" { + let x, _ = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons 1 |> SkewBinaryRandomAccessList.uncons + (x = 1) |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.uncons 2 elements" { + let x, _ = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons 1 |> SkewBinaryRandomAccessList.cons 2 |> SkewBinaryRandomAccessList.uncons + (x = 2) |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.uncons 3 elements" { + let x, _ = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons 1 |> SkewBinaryRandomAccessList.cons 2 |> SkewBinaryRandomAccessList.cons 3 |> SkewBinaryRandomAccessList.uncons + (x = 3) |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.tryUncons 1 element" { + let x = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons 1 |> SkewBinaryRandomAccessList.tryUncons + (fst(x.Value) = 1) |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.tryUncons 2 elements" { + let x = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons 1 |> SkewBinaryRandomAccessList.cons 2 |> SkewBinaryRandomAccessList.tryUncons + (fst(x.Value) = 2) |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.tryUncons 3 elements" { + let x = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons 1 |> SkewBinaryRandomAccessList.cons 2 |> SkewBinaryRandomAccessList.cons 3 |> SkewBinaryRandomAccessList.tryUncons + (fst(x.Value) = 3) |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.tryUncons empty" { + SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.tryUncons |> Expect.isNone "" } -[] -let ``head should return``() = - let x = empty() |> cons 1 |> cons 2 |> head - x |> should equal 2 - -[] -let ``tryGetHead should return``() = - let x = empty() |> cons 1 |> cons 2 |> tryGetHead - x.Value |> should equal 2 - -[] -let ``tryGetHead on empty should return None``() = - empty() |> tryGetHead |> should equal None - -[] -let ``tryGetTail on empty should return None``() = - empty() |> tryGetTail |> should equal None - -[] -let ``tryGetTail on len 1 should return Some empty``() = - let x = (empty() |> cons 1 |> tryGetTail).Value - x |> isEmpty |> should equal true - -[] -let ``tail on len 2 should return``() = - empty() |> cons 1 |> cons 2 |> tail |> head |> should equal 1 - -[] -let ``tryGetTail on len 2 should return``() = - let a = empty() |> cons 1 |> cons 2 |> tryGetTail - ((head a.Value) = 1) |> should equal true - -[] -let ``lookup length 1``() = - let x = empty() |> cons "a" -// let x = empty() |> cons "a" - let x' = x |> lookup 0 - x' |> should equal "a" - -[] -let ``rev empty``() = - isEmpty (empty() |> rev) |> should equal true + test "SkewBinaryRandomAccessList.head should return" { + let x = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons 1 |> SkewBinaryRandomAccessList.cons 2 |> SkewBinaryRandomAccessList.head + x |> Expect.equal "" 2 } + + test "SkewBinaryRandomAccessList.tryGetHead should return" { + let x = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons 1 |> SkewBinaryRandomAccessList.cons 2 |> SkewBinaryRandomAccessList.tryGetHead + x.Value |> Expect.equal "" 2 } + + test "SkewBinaryRandomAccessList.tryGetHead on empty should return None" { + SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.tryGetHead |> Expect.isNone "" } + + test "SkewBinaryRandomAccessList.tryGetTail on empty should return None" { + SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.tryGetTail |> Expect.isNone "" } + + test "SkewBinaryRandomAccessList.tryGetTail on len 1 should return Some empty" { + let x = (SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons 1 |> SkewBinaryRandomAccessList.tryGetTail).Value + x |> SkewBinaryRandomAccessList.isEmpty |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.tail on len 2 should return" { + SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons 1 |> SkewBinaryRandomAccessList.cons 2 |> SkewBinaryRandomAccessList.tail |> SkewBinaryRandomAccessList.head |> Expect.equal "" 1 } + + test "SkewBinaryRandomAccessList.tryGetTail on len 2 should return" { + let a = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons 1 |> SkewBinaryRandomAccessList.cons 2 |> SkewBinaryRandomAccessList.tryGetTail + ((SkewBinaryRandomAccessList.head a.Value) = 1) |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.lookup length 1" { + let x = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" + // let x = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" + let x' = x |> SkewBinaryRandomAccessList.lookup 0 + x' |> Expect.equal "" "a" } + + test "SkewBinaryRandomAccessList.rev empty" { + SkewBinaryRandomAccessList.isEmpty (SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.rev) |> Expect.isTrue "" } -[] -let ``rev elements length 5``() = - let a = ofSeq ["a";"b";"c";"d";"e"] - - let b = rev a - - let c = List.ofSeq b - - c.Head |> should equal "e" - -[] -let ``lookup length 2``() = - (((empty() |> cons "a" |> cons "b" |> lookup 0) = "b") && ((empty() |> cons "a" |> cons "b" |> lookup 1) = "a")) |> should equal true - -[] -let ``lookup length 3``() = - let len3 = empty() |> cons "a" |> cons "b" |> cons "c" - (((len3 |> lookup 0) = "c") - && ((len3 |> lookup 1) = "b") - && ((len3 |> lookup 2) = "a")) |> should equal true - -[] -let ``lookup length 4``() = - let len4 = empty() |> cons "a" |> cons "b" |> cons "c" |> cons "d" - (((len4 |> lookup 0) = "d") && ((len4 |> lookup 1) = "c") && ((len4 |> lookup 2) = "b") && ((len4 |> lookup 3) = "a")) - |> should equal true - -[] -let ``lookup length 5``() = - let len5 = empty() |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" - (((len5 |> lookup 0) = "e") && ((len5 |> lookup 1) = "d") && ((len5 |> lookup 2) = "c") && ((len5 |> lookup 3) = "b") - && ((len5 |> lookup 4) = "a")) |> should equal true - -[] -let ``lookup length 6``() = - let len6 = empty() |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" - (((len6 |> lookup 0) = "f") && ((len6 |> lookup 1) = "e") && ((len6 |> lookup 2) = "d") && ((len6 |> lookup 3) = "c") - && ((len6 |> lookup 4) = "b") && ((len6 |> lookup 5) = "a")) |> should equal true - -[] -let ``lookup length 7``() = - let len7 = empty() |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" - (((len7 |> lookup 0) = "g") && ((len7 |> lookup 1) = "f") && ((len7 |> lookup 2) = "e") && ((len7 |> lookup 3) = "d") - && ((len7 |> lookup 4) = "c") && ((len7 |> lookup 5) = "b") && ((len7 |> lookup 6) = "a")) |> should equal true - -[] -let ``lookup length 8``() = - let len8 = empty() |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" - (((len8 |> lookup 0) = "h") && ((len8 |> lookup 1) = "g") && ((len8 |> lookup 2) = "f") && ((len8 |> lookup 3) = "e") - && ((len8 |> lookup 4) = "d") && ((len8 |> lookup 5) = "c") && ((len8 |> lookup 6) = "b") && ((len8 |> lookup 7) = "a")) - |> should equal true - -[] -let ``lookup length 9``() = - let len9 = empty() |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" |> cons "i" - (((len9 |> lookup 0) = "i") && ((len9 |> lookup 1) = "h") && ((len9 |> lookup 2) = "g") && ((len9 |> lookup 3) = "f") - && ((len9 |> lookup 4) = "e") && ((len9 |> lookup 5) = "d") && ((len9 |> lookup 6) = "c") && ((len9 |> lookup 7) = "b") - && ((len9 |> lookup 8) = "a")) |> should equal true - -[] -let ``lookup length 10``() = - let lena = empty() |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" |> cons "i" |> cons "j" - (((lena |> lookup 0) = "j") && ((lena |> lookup 1) = "i") && ((lena |> lookup 2) = "h") && ((lena |> lookup 3) = "g") - && ((lena |> lookup 4) = "f") && ((lena |> lookup 5) = "e") && ((lena |> lookup 6) = "d") && ((lena |> lookup 7) = "c") - && ((lena |> lookup 8) = "b") && ((lena |> lookup 9) = "a")) |> should equal true - -[] -let ``tryLookup length 1``() = - let a = empty() |> cons "a" |> tryLookup 0 - (a.Value = "a") |> should equal true - -[] -let ``tryLookup length 2``() = - let len2 = empty() |> cons "a" |> cons "b" - let b = len2 |> tryLookup 0 - let a = len2 |> tryLookup 1 - ((b.Value = "b") && (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 3``() = - let len3 = empty() |> cons "a" |> cons "b" |> cons "c" - let c = len3 |> tryLookup 0 - let b = len3 |> tryLookup 1 - let a = len3 |> tryLookup 2 - ((c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 4``() = - let len4 = empty() |> cons "a" |> cons "b" |> cons "c" |> cons "d" - let d = len4 |> tryLookup 0 - let c = len4 |> tryLookup 1 - let b = len4 |> tryLookup 2 - let a = len4 |> tryLookup 3 - ((d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 5``() = - let len5 = empty() |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" - let e = len5 |> tryLookup 0 - let d = len5 |> tryLookup 1 - let c = len5 |> tryLookup 2 - let b = len5 |> tryLookup 3 - let a = len5 |> tryLookup 4 - ((e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 6``() = - let len6 = empty() |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" - let f = len6 |> tryLookup 0 - let e = len6 |> tryLookup 1 - let d = len6 |> tryLookup 2 - let c = len6 |> tryLookup 3 - let b = len6 |> tryLookup 4 - let a = len6 |> tryLookup 5 - ((f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) - |> should equal true - -[] -let ``tryLookup length 7``() = - let len7 = empty() |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" - let g = len7 |> tryLookup 0 - let f = len7 |> tryLookup 1 - let e = len7 |> tryLookup 2 - let d = len7 |> tryLookup 3 - let c = len7 |> tryLookup 4 - let b = len7 |> tryLookup 5 - let a = len7 |> tryLookup 6 - ((g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") - && (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 8``() = - let len8 = empty() |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" - let h = len8 |> tryLookup 0 - let g = len8 |> tryLookup 1 - let f = len8 |> tryLookup 2 - let e = len8 |> tryLookup 3 - let d = len8 |> tryLookup 4 - let c = len8 |> tryLookup 5 - let b = len8 |> tryLookup 6 - let a = len8 |> tryLookup 7 - ((h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") - && (b.Value = "b")&& (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 9``() = - let len9 = empty() |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" |> cons "i" - let i = len9 |> tryLookup 0 - let h = len9 |> tryLookup 1 - let g = len9 |> tryLookup 2 - let f = len9 |> tryLookup 3 - let e = len9 |> tryLookup 4 - let d = len9 |> tryLookup 5 - let c = len9 |> tryLookup 6 - let b = len9 |> tryLookup 7 - let a = len9 |> tryLookup 8 - ((i.Value = "i") && (h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") - && (c.Value = "c") && (b.Value = "b")&& (a.Value = "a")) |> should equal true - -[] -let ``tryLookup length 10``() = - let lena = empty() |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" |> cons "i" |> cons "j" - let j = lena |> tryLookup 0 - let i = lena |> tryLookup 1 - let h = lena |> tryLookup 2 - let g = lena |> tryLookup 3 - let f = lena |> tryLookup 4 - let e = lena |> tryLookup 5 - let d = lena |> tryLookup 6 - let c = lena |> tryLookup 7 - let b = lena |> tryLookup 8 - let a = lena |> tryLookup 9 - ((j.Value = "j") && (i.Value = "i") && (h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") - && (d.Value = "d") && (c.Value = "c") && (b.Value = "b")&& (a.Value = "a")) |> should equal true - -[] -let ``tryLookup not found``() = - let lena = empty() |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" |> cons "i" |> cons "j" - lena |> tryLookup 10 |> should equal None - -[] -let ``update length 1``() = - empty() |> cons "a" |> update 0 "aa"|> lookup 0 |> should equal "aa" - -[] -let ``update length 2``() = - let len2 = empty() |> cons "a" |> cons "b" - (((len2 |> update 0 "bb"|> lookup 0) = "bb") && ((len2 |> update 1 "aa"|> lookup 1) = "aa")) |> should equal true - -[] -let ``update length 3``() = - let len3 = empty() |> cons "a" |> cons "b" |> cons "c" - (((len3 |> update 0 "cc"|> lookup 0) = "cc") && ((len3 |> update 1 "bb"|> lookup 1) = "bb") - && ((len3 |> update 2 "aa"|> lookup 2) = "aa")) |> should equal true - -[] -let ``update length 4``() = - let len4 = empty() |> cons "a" |> cons "b" |> cons "c" |> cons "d" - (((len4 |> update 0 "dd"|> lookup 0) = "dd") && ((len4 |> update 1 "cc"|> lookup 1) = "cc") - && ((len4 |> update 2 "bb"|> lookup 2) = "bb") && ((len4 |> update 3 "aa"|> lookup 3) = "aa")) - |> should equal true - -[] -let ``update length 5``() = - let len5 = empty() |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" - (((len5 |> update 0 "ee"|> lookup 0) = "ee") && ((len5 |> update 1 "dd"|> lookup 1) = "dd") - && ((len5 |> update 2 "cc"|> lookup 2) = "cc") && ((len5 |> update 3 "bb"|> lookup 3) = "bb") - && ((len5 |> update 4 "aa"|> lookup 4) = "aa")) |> should equal true - -[] -let ``update length 6``() = - let len6 = empty() |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" - (((len6 |> update 0 "ff"|> lookup 0) = "ff") && ((len6 |> update 1 "ee"|> lookup 1) = "ee") - && ((len6 |> update 2 "dd"|> lookup 2) = "dd") && ((len6 |> update 3 "cc"|> lookup 3) = "cc") - && ((len6 |> update 4 "bb"|> lookup 4) = "bb") && ((len6 |> update 5 "aa"|> lookup 5) = "aa")) |> should equal true - -[] -let ``update length 7``() = - let len7 = empty() |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" - (((len7 |> update 0 "gg"|> lookup 0) = "gg") && ((len7 |> update 1 "ff"|> lookup 1) = "ff") - && ((len7 |> update 2 "ee"|> lookup 2) = "ee") && ((len7 |> update 3 "dd"|> lookup 3) = "dd") - && ((len7 |> update 4 "cc"|> lookup 4) = "cc") && ((len7 |> update 5 "bb"|> lookup 5) = "bb") - && ((len7 |> update 6 "aa"|> lookup 6) = "aa")) |> should equal true - -[] -let ``update length 8``() = - let len8 = empty() |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" - (((len8 |> update 0 "hh"|> lookup 0) = "hh") && ((len8 |> update 1 "gg"|> lookup 1) = "gg") - && ((len8 |> update 2 "ff"|> lookup 2) = "ff") && ((len8 |> update 3 "ee"|> lookup 3) = "ee") - && ((len8 |> update 4 "dd"|> lookup 4) = "dd") && ((len8 |> update 5 "cc"|> lookup 5) = "cc") - && ((len8 |> update 6 "bb"|> lookup 6) = "bb") && ((len8 |> update 7 "aa"|> lookup 7) = "aa")) - |> should equal true - -[] -let ``update length 9``() = - let len9 = empty() |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" |> cons "i" - (((len9 |> update 0 "ii"|> lookup 0) = "ii") && ((len9 |> update 1 "hh"|> lookup 1) = "hh") - && ((len9 |> update 2 "gg"|> lookup 2) = "gg") && ((len9 |> update 3 "ff"|> lookup 3) = "ff") - && ((len9 |> update 4 "ee"|> lookup 4) = "ee") && ((len9 |> update 5 "dd"|> lookup 5) = "dd") - && ((len9 |> update 6 "cc"|> lookup 6) = "cc") && ((len9 |> update 7 "bb"|> lookup 7) = "bb") - && ((len9 |> update 8 "aa"|> lookup 8) = "aa")) |> should equal true - -[] -let ``update length 10``() = - let lena = empty() |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" |> cons "i" |> cons "j" - (((lena |> update 0 "jj"|> lookup 0) = "jj") && ((lena |> update 1 "ii"|> lookup 1) = "ii") - && ((lena |> update 2 "hh"|> lookup 2) = "hh") && ((lena |> update 3 "gg"|> lookup 3) = "gg") - && ((lena |> update 4 "ff"|> lookup 4) = "ff") && ((lena |> update 5 "ee"|> lookup 5) = "ee") - && ((lena |> update 6 "dd"|> lookup 6) = "dd") && ((lena |> update 7 "cc"|> lookup 7) = "cc") - && ((lena |> update 8 "bb"|> lookup 8) = "bb") && ((lena |> update 9 "aa"|> lookup 9) = "aa")) |> should equal true - -[] -let ``tryUpdate length 1``() = - let a = empty() |> cons "a" |> tryUpdate 0 "aa" - ((a.Value |> lookup 0) = "aa") |> should equal true - -[] -let ``tryUpdate length 2``() = - let len2 = empty() |> cons "a" |> cons "b" - let b = len2 |> tryUpdate 0 "bb" - let a = len2 |> tryUpdate 1 "aa" - (((b.Value |> lookup 0) = "bb") && ((a.Value |> lookup 1) = "aa")) |> should equal true - -[] -let ``tryUpdate length 3``() = - let len3 = empty() |> cons "a" |> cons "b" |> cons "c" - let c = len3 |> tryUpdate 0 "cc" - let b = len3 |> tryUpdate 1 "bb" - let a = len3 |> tryUpdate 2 "aa" - (((c.Value |> lookup 0) = "cc") && ((b.Value |> lookup 1) = "bb") && ((a.Value |> lookup 2) = "aa")) |> should equal true - -[] -let ``tryUpdate length 4``() = - let len4 = empty() |> cons "a" |> cons "b" |> cons "c" |> cons "d" - let d = len4 |> tryUpdate 0 "dd" - let c = len4 |> tryUpdate 1 "cc" - let b = len4 |> tryUpdate 2 "bb" - let a = len4 |> tryUpdate 3 "aa" - (((d.Value |> lookup 0) = "dd") && ((c.Value |> lookup 1) = "cc") && ((b.Value |> lookup 2) = "bb") - && ((a.Value |> lookup 3) = "aa")) |> should equal true - -[] -let ``tryUpdate length 5``() = - let len5 = empty() |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" - let e = len5 |> tryUpdate 0 "ee" - let d = len5 |> tryUpdate 1 "dd" - let c = len5 |> tryUpdate 2 "cc" - let b = len5 |> tryUpdate 3 "bb" - let a = len5 |> tryUpdate 4 "aa" - (((e.Value |> lookup 0) = "ee") && ((d.Value |> lookup 1) = "dd") && ((c.Value |> lookup 2) = "cc") - && ((b.Value |> lookup 3) = "bb") && ((a.Value |> lookup 4) = "aa")) |> should equal true - -[] -let ``tryUpdate length 6``() = - let len6 = empty() |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" - let f = len6 |> tryUpdate 0 "ff" - let e = len6 |> tryUpdate 1 "ee" - let d = len6 |> tryUpdate 2 "dd" - let c = len6 |> tryUpdate 3 "cc" - let b = len6 |> tryUpdate 4 "bb" - let a = len6 |> tryUpdate 5 "aa" - (((f.Value |> lookup 0) = "ff") && ((e.Value |> lookup 1) = "ee") && ((d.Value |> lookup 2) = "dd") - && ((c.Value |> lookup 3) = "cc") && ((b.Value |> lookup 4) = "bb") && ((a.Value |> lookup 5) = "aa")) - |> should equal true - -[] -let ``tryUpdate length 7``() = - let len7 = empty() |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" - let g = len7 |> tryUpdate 0 "gg" - let f = len7 |> tryUpdate 1 "ff" - let e = len7 |> tryUpdate 2 "ee" - let d = len7 |> tryUpdate 3 "dd" - let c = len7 |> tryUpdate 4 "cc" - let b = len7 |> tryUpdate 5 "bb" - let a = len7 |> tryUpdate 6 "aa" - (((g.Value |> lookup 0) = "gg") && ((f.Value |> lookup 1) = "ff") && ((e.Value |> lookup 2) = "ee") - && ((d.Value |> lookup 3) = "dd") && ((c.Value |> lookup 4) = "cc") && ((b.Value |> lookup 5) = "bb") - && ((a.Value |> lookup 6) = "aa")) |> should equal true - -[] -let ``tryUpdate length 8``() = - let len8 = empty() |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" - let h = len8 |> tryUpdate 0 "hh" - let g = len8 |> tryUpdate 1 "gg" - let f = len8 |> tryUpdate 2 "ff" - let e = len8 |> tryUpdate 3 "ee" - let d = len8 |> tryUpdate 4 "dd" - let c = len8 |> tryUpdate 5 "cc" - let b = len8 |> tryUpdate 6 "bb" - let a = len8 |> tryUpdate 7 "aa" - (((h.Value |> lookup 0) = "hh") && ((g.Value |> lookup 1) = "gg") && ((f.Value |> lookup 2) = "ff") - && ((e.Value |> lookup 3) = "ee") && ((d.Value |> lookup 4) = "dd") && ((c.Value |> lookup 5) = "cc") - && ((b.Value |> lookup 6) = "bb")&& ((a.Value |> lookup 7) = "aa")) |> should equal true - -[] -let ``tryUpdate length 9``() = - let len9 = empty() |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" |> cons "i" - let i = len9 |> tryUpdate 0 "ii" - let h = len9 |> tryUpdate 1 "hh" - let g = len9 |> tryUpdate 2 "gg" - let f = len9 |> tryUpdate 3 "ff" - let e = len9 |> tryUpdate 4 "ee" - let d = len9 |> tryUpdate 5 "dd" - let c = len9 |> tryUpdate 6 "cc" - let b = len9 |> tryUpdate 7 "bb" - let a = len9 |> tryUpdate 8 "aa" - (((i.Value |> lookup 0) = "ii") && ((h.Value |> lookup 1) = "hh") && ((g.Value |> lookup 2) = "gg") - && ((f.Value |> lookup 3) = "ff") && ((e.Value |> lookup 4) = "ee") && ((d.Value |> lookup 5) = "dd") - && ((c.Value |> lookup 6) = "cc") && ((b.Value |> lookup 7) = "bb")&& ((a.Value |> lookup 8) = "aa")) |> should equal true - -[] -let ``tryUpdate length 10``() = - let lena = empty() |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" |> cons "i" |> cons "j" - let j = lena |> tryUpdate 0 "jj" - let i = lena |> tryUpdate 1 "ii" - let h = lena |> tryUpdate 2 "hh" - let g = lena |> tryUpdate 3 "gg" - let f = lena |> tryUpdate 4 "ff" - let e = lena |> tryUpdate 5 "ee" - let d = lena |> tryUpdate 6 "dd" - let c = lena |> tryUpdate 7 "cc" - let b = lena |> tryUpdate 8 "bb" - let a = lena |> tryUpdate 9 "aa" - (((j.Value |> lookup 0) = "jj") && ((i.Value |> lookup 1) = "ii") && ((h.Value |> lookup 2) = "hh") - && ((g.Value |> lookup 3) = "gg") && ((f.Value |> lookup 4) = "ff") && ((e.Value |> lookup 5) = "ee") - && ((d.Value |> lookup 6) = "dd") && ((c.Value |> lookup 7) = "cc") && ((b.Value |> lookup 8) = "bb") - && ((a.Value |> lookup 9) = "aa")) |> should equal true - -[] -let ``length of empty is 0``() = - empty() |> length |> should equal 0 - -[] -let ``length of 1 - 10 good``() = - let len1 = empty() |> cons "a" - let len2 = empty() |> cons "a" |> cons "b" - let len3 = empty() |> cons "a" |> cons "b" |> cons "c" - let len4 = empty() |> cons "a" |> cons "b" |> cons "c" |> cons "d" - let len5 = empty() |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" - let len6 = empty() |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" - let len7 = empty() |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" - let len8 = empty() |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" - let len9 = empty() |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" |> cons "i" - let lena = empty() |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" |> cons "i" |> cons "j" - (((length len1) = 1) && ((length len2) = 2) && ((length len3) = 3) && ((length len4) = 4) - && ((length len5) = 5) && ((length len6) = 6) && ((length len7) = 7) && ((length len8) = 8) - && ((length len9) = 9) && ((length lena) = 10)) |> should equal true - -[] -let ``ofSeq``() = - let x = ofSeq ["a";"b";"c";"d";"e";"f";"g";"h";"i";"j"] - - (((x |> lookup 0) = "a") && ((x |> lookup 1) = "b") && ((x |> lookup 2) = "c") && ((x |> lookup 3) = "d") - && ((x |> lookup 4) = "e") && ((x |> lookup 5) = "f") && ((x |> lookup 6) = "g") && ((x |> lookup 7) = "h") - && ((x |> lookup 8) = "i") && ((x |> lookup 9) = "j")) |> should equal true - -[] -let ``IRandomAccessList cons works``() = - let lena = empty() |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" |> cons "i" |> cons "j" - ((lena :> IRandomAccessList).Cons "zz").Head |> should equal "zz" \ No newline at end of file + test "SkewBinaryRandomAccessList.rev elements length 5" { + let a = SkewBinaryRandomAccessList.ofSeq ["a";"b";"c";"d";"e"] + + let b = SkewBinaryRandomAccessList.rev a + + let c = List.ofSeq b + + c.Head |> Expect.equal "" "e" } + + test "SkewBinaryRandomAccessList.lookup length 2" { + (((SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" |> SkewBinaryRandomAccessList.lookup 0) = "b") && ((SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" |> SkewBinaryRandomAccessList.lookup 1) = "a")) |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.lookup length 3" { + let len3 = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" |> SkewBinaryRandomAccessList.cons "c" + (((len3 |> SkewBinaryRandomAccessList.lookup 0) = "c") + && ((len3 |> SkewBinaryRandomAccessList.lookup 1) = "b") + && ((len3 |> SkewBinaryRandomAccessList.lookup 2) = "a")) |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.lookup length 4" { + let len4 = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" |> SkewBinaryRandomAccessList.cons "c" |> SkewBinaryRandomAccessList.cons "d" + (((len4 |> SkewBinaryRandomAccessList.lookup 0) = "d") && ((len4 |> SkewBinaryRandomAccessList.lookup 1) = "c") && ((len4 |> SkewBinaryRandomAccessList.lookup 2) = "b") && ((len4 |> SkewBinaryRandomAccessList.lookup 3) = "a")) + |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.lookup length 5" { + let len5 = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" |> SkewBinaryRandomAccessList.cons "c" |> SkewBinaryRandomAccessList.cons "d" |> SkewBinaryRandomAccessList.cons "e" + (((len5 |> SkewBinaryRandomAccessList.lookup 0) = "e") && ((len5 |> SkewBinaryRandomAccessList.lookup 1) = "d") && ((len5 |> SkewBinaryRandomAccessList.lookup 2) = "c") && ((len5 |> SkewBinaryRandomAccessList.lookup 3) = "b") + && ((len5 |> SkewBinaryRandomAccessList.lookup 4) = "a")) |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.lookup length 6" { + let len6 = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" |> SkewBinaryRandomAccessList.cons "c" |> SkewBinaryRandomAccessList.cons "d" |> SkewBinaryRandomAccessList.cons "e" |> SkewBinaryRandomAccessList.cons "f" + (((len6 |> SkewBinaryRandomAccessList.lookup 0) = "f") && ((len6 |> SkewBinaryRandomAccessList.lookup 1) = "e") && ((len6 |> SkewBinaryRandomAccessList.lookup 2) = "d") && ((len6 |> SkewBinaryRandomAccessList.lookup 3) = "c") + && ((len6 |> SkewBinaryRandomAccessList.lookup 4) = "b") && ((len6 |> SkewBinaryRandomAccessList.lookup 5) = "a")) |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.lookup length 7" { + let len7 = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" |> SkewBinaryRandomAccessList.cons "c" |> SkewBinaryRandomAccessList.cons "d" |> SkewBinaryRandomAccessList.cons "e" |> SkewBinaryRandomAccessList.cons "f" |> SkewBinaryRandomAccessList.cons "g" + (((len7 |> SkewBinaryRandomAccessList.lookup 0) = "g") && ((len7 |> SkewBinaryRandomAccessList.lookup 1) = "f") && ((len7 |> SkewBinaryRandomAccessList.lookup 2) = "e") && ((len7 |> SkewBinaryRandomAccessList.lookup 3) = "d") + && ((len7 |> SkewBinaryRandomAccessList.lookup 4) = "c") && ((len7 |> SkewBinaryRandomAccessList.lookup 5) = "b") && ((len7 |> SkewBinaryRandomAccessList.lookup 6) = "a")) |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.lookup length 8" { + let len8 = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" |> SkewBinaryRandomAccessList.cons "c" |> SkewBinaryRandomAccessList.cons "d" |> SkewBinaryRandomAccessList.cons "e" |> SkewBinaryRandomAccessList.cons "f" |> SkewBinaryRandomAccessList.cons "g" |> SkewBinaryRandomAccessList.cons "h" + (((len8 |> SkewBinaryRandomAccessList.lookup 0) = "h") && ((len8 |> SkewBinaryRandomAccessList.lookup 1) = "g") && ((len8 |> SkewBinaryRandomAccessList.lookup 2) = "f") && ((len8 |> SkewBinaryRandomAccessList.lookup 3) = "e") + && ((len8 |> SkewBinaryRandomAccessList.lookup 4) = "d") && ((len8 |> SkewBinaryRandomAccessList.lookup 5) = "c") && ((len8 |> SkewBinaryRandomAccessList.lookup 6) = "b") && ((len8 |> SkewBinaryRandomAccessList.lookup 7) = "a")) + |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.lookup length 9" { + let len9 = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" |> SkewBinaryRandomAccessList.cons "c" |> SkewBinaryRandomAccessList.cons "d" |> SkewBinaryRandomAccessList.cons "e" |> SkewBinaryRandomAccessList.cons "f" |> SkewBinaryRandomAccessList.cons "g" |> SkewBinaryRandomAccessList.cons "h" |> SkewBinaryRandomAccessList.cons "i" + (((len9 |> SkewBinaryRandomAccessList.lookup 0) = "i") && ((len9 |> SkewBinaryRandomAccessList.lookup 1) = "h") && ((len9 |> SkewBinaryRandomAccessList.lookup 2) = "g") && ((len9 |> SkewBinaryRandomAccessList.lookup 3) = "f") + && ((len9 |> SkewBinaryRandomAccessList.lookup 4) = "e") && ((len9 |> SkewBinaryRandomAccessList.lookup 5) = "d") && ((len9 |> SkewBinaryRandomAccessList.lookup 6) = "c") && ((len9 |> SkewBinaryRandomAccessList.lookup 7) = "b") + && ((len9 |> SkewBinaryRandomAccessList.lookup 8) = "a")) |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.lookup length 10" { + let lena = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" |> SkewBinaryRandomAccessList.cons "c" |> SkewBinaryRandomAccessList.cons "d" |> SkewBinaryRandomAccessList.cons "e" |> SkewBinaryRandomAccessList.cons "f" |> SkewBinaryRandomAccessList.cons "g" |> SkewBinaryRandomAccessList.cons "h" |> SkewBinaryRandomAccessList.cons "i" |> SkewBinaryRandomAccessList.cons "j" + (((lena |> SkewBinaryRandomAccessList.lookup 0) = "j") && ((lena |> SkewBinaryRandomAccessList.lookup 1) = "i") && ((lena |> SkewBinaryRandomAccessList.lookup 2) = "h") && ((lena |> SkewBinaryRandomAccessList.lookup 3) = "g") + && ((lena |> SkewBinaryRandomAccessList.lookup 4) = "f") && ((lena |> SkewBinaryRandomAccessList.lookup 5) = "e") && ((lena |> SkewBinaryRandomAccessList.lookup 6) = "d") && ((lena |> SkewBinaryRandomAccessList.lookup 7) = "c") + && ((lena |> SkewBinaryRandomAccessList.lookup 8) = "b") && ((lena |> SkewBinaryRandomAccessList.lookup 9) = "a")) |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.tryLookup length 1" { + let a = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.tryLookup 0 + (a.Value = "a") |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.tryLookup length 2" { + let len2 = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" + let b = len2 |> SkewBinaryRandomAccessList.tryLookup 0 + let a = len2 |> SkewBinaryRandomAccessList.tryLookup 1 + ((b.Value = "b") && (a.Value = "a")) |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.tryLookup length 3" { + let len3 = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" |> SkewBinaryRandomAccessList.cons "c" + let c = len3 |> SkewBinaryRandomAccessList.tryLookup 0 + let b = len3 |> SkewBinaryRandomAccessList.tryLookup 1 + let a = len3 |> SkewBinaryRandomAccessList.tryLookup 2 + ((c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.tryLookup length 4" { + let len4 = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" |> SkewBinaryRandomAccessList.cons "c" |> SkewBinaryRandomAccessList.cons "d" + let d = len4 |> SkewBinaryRandomAccessList.tryLookup 0 + let c = len4 |> SkewBinaryRandomAccessList.tryLookup 1 + let b = len4 |> SkewBinaryRandomAccessList.tryLookup 2 + let a = len4 |> SkewBinaryRandomAccessList.tryLookup 3 + ((d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.tryLookup length 5" { + let len5 = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" |> SkewBinaryRandomAccessList.cons "c" |> SkewBinaryRandomAccessList.cons "d" |> SkewBinaryRandomAccessList.cons "e" + let e = len5 |> SkewBinaryRandomAccessList.tryLookup 0 + let d = len5 |> SkewBinaryRandomAccessList.tryLookup 1 + let c = len5 |> SkewBinaryRandomAccessList.tryLookup 2 + let b = len5 |> SkewBinaryRandomAccessList.tryLookup 3 + let a = len5 |> SkewBinaryRandomAccessList.tryLookup 4 + ((e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.tryLookup length 6" { + let len6 = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" |> SkewBinaryRandomAccessList.cons "c" |> SkewBinaryRandomAccessList.cons "d" |> SkewBinaryRandomAccessList.cons "e" |> SkewBinaryRandomAccessList.cons "f" + let f = len6 |> SkewBinaryRandomAccessList.tryLookup 0 + let e = len6 |> SkewBinaryRandomAccessList.tryLookup 1 + let d = len6 |> SkewBinaryRandomAccessList.tryLookup 2 + let c = len6 |> SkewBinaryRandomAccessList.tryLookup 3 + let b = len6 |> SkewBinaryRandomAccessList.tryLookup 4 + let a = len6 |> SkewBinaryRandomAccessList.tryLookup 5 + ((f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) + |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.tryLookup length 7" { + let len7 = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" |> SkewBinaryRandomAccessList.cons "c" |> SkewBinaryRandomAccessList.cons "d" |> SkewBinaryRandomAccessList.cons "e" |> SkewBinaryRandomAccessList.cons "f" |> SkewBinaryRandomAccessList.cons "g" + let g = len7 |> SkewBinaryRandomAccessList.tryLookup 0 + let f = len7 |> SkewBinaryRandomAccessList.tryLookup 1 + let e = len7 |> SkewBinaryRandomAccessList.tryLookup 2 + let d = len7 |> SkewBinaryRandomAccessList.tryLookup 3 + let c = len7 |> SkewBinaryRandomAccessList.tryLookup 4 + let b = len7 |> SkewBinaryRandomAccessList.tryLookup 5 + let a = len7 |> SkewBinaryRandomAccessList.tryLookup 6 + ((g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") + && (a.Value = "a")) |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.tryLookup length 8" { + let len8 = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" |> SkewBinaryRandomAccessList.cons "c" |> SkewBinaryRandomAccessList.cons "d" |> SkewBinaryRandomAccessList.cons "e" |> SkewBinaryRandomAccessList.cons "f" |> SkewBinaryRandomAccessList.cons "g" |> SkewBinaryRandomAccessList.cons "h" + let h = len8 |> SkewBinaryRandomAccessList.tryLookup 0 + let g = len8 |> SkewBinaryRandomAccessList.tryLookup 1 + let f = len8 |> SkewBinaryRandomAccessList.tryLookup 2 + let e = len8 |> SkewBinaryRandomAccessList.tryLookup 3 + let d = len8 |> SkewBinaryRandomAccessList.tryLookup 4 + let c = len8 |> SkewBinaryRandomAccessList.tryLookup 5 + let b = len8 |> SkewBinaryRandomAccessList.tryLookup 6 + let a = len8 |> SkewBinaryRandomAccessList.tryLookup 7 + ((h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") + && (b.Value = "b")&& (a.Value = "a")) |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.tryLookup length 9" { + let len9 = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" |> SkewBinaryRandomAccessList.cons "c" |> SkewBinaryRandomAccessList.cons "d" |> SkewBinaryRandomAccessList.cons "e" |> SkewBinaryRandomAccessList.cons "f" |> SkewBinaryRandomAccessList.cons "g" |> SkewBinaryRandomAccessList.cons "h" |> SkewBinaryRandomAccessList.cons "i" + let i = len9 |> SkewBinaryRandomAccessList.tryLookup 0 + let h = len9 |> SkewBinaryRandomAccessList.tryLookup 1 + let g = len9 |> SkewBinaryRandomAccessList.tryLookup 2 + let f = len9 |> SkewBinaryRandomAccessList.tryLookup 3 + let e = len9 |> SkewBinaryRandomAccessList.tryLookup 4 + let d = len9 |> SkewBinaryRandomAccessList.tryLookup 5 + let c = len9 |> SkewBinaryRandomAccessList.tryLookup 6 + let b = len9 |> SkewBinaryRandomAccessList.tryLookup 7 + let a = len9 |> SkewBinaryRandomAccessList.tryLookup 8 + ((i.Value = "i") && (h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") + && (c.Value = "c") && (b.Value = "b")&& (a.Value = "a")) |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.tryLookup length 10" { + let lena = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" |> SkewBinaryRandomAccessList.cons "c" |> SkewBinaryRandomAccessList.cons "d" |> SkewBinaryRandomAccessList.cons "e" |> SkewBinaryRandomAccessList.cons "f" |> SkewBinaryRandomAccessList.cons "g" |> SkewBinaryRandomAccessList.cons "h" |> SkewBinaryRandomAccessList.cons "i" |> SkewBinaryRandomAccessList.cons "j" + let j = lena |> SkewBinaryRandomAccessList.tryLookup 0 + let i = lena |> SkewBinaryRandomAccessList.tryLookup 1 + let h = lena |> SkewBinaryRandomAccessList.tryLookup 2 + let g = lena |> SkewBinaryRandomAccessList.tryLookup 3 + let f = lena |> SkewBinaryRandomAccessList.tryLookup 4 + let e = lena |> SkewBinaryRandomAccessList.tryLookup 5 + let d = lena |> SkewBinaryRandomAccessList.tryLookup 6 + let c = lena |> SkewBinaryRandomAccessList.tryLookup 7 + let b = lena |> SkewBinaryRandomAccessList.tryLookup 8 + let a = lena |> SkewBinaryRandomAccessList.tryLookup 9 + ((j.Value = "j") && (i.Value = "i") && (h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") + && (d.Value = "d") && (c.Value = "c") && (b.Value = "b")&& (a.Value = "a")) |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.tryLookup not found" { + let lena = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" |> SkewBinaryRandomAccessList.cons "c" |> SkewBinaryRandomAccessList.cons "d" |> SkewBinaryRandomAccessList.cons "e" |> SkewBinaryRandomAccessList.cons "f" |> SkewBinaryRandomAccessList.cons "g" |> SkewBinaryRandomAccessList.cons "h" |> SkewBinaryRandomAccessList.cons "i" |> SkewBinaryRandomAccessList.cons "j" + lena |> SkewBinaryRandomAccessList.tryLookup 10 |> Expect.isNone "" } + + test "SkewBinaryRandomAccessList.update length 1" { + SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.update 0 "aa"|> SkewBinaryRandomAccessList.lookup 0 |> Expect.equal "" "aa" } + + test "SkewBinaryRandomAccessList.update length 2" { + let len2 = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" + (((len2 |> SkewBinaryRandomAccessList.update 0 "bb"|> SkewBinaryRandomAccessList.lookup 0) = "bb") && ((len2 |> SkewBinaryRandomAccessList.update 1 "aa"|> SkewBinaryRandomAccessList.lookup 1) = "aa")) |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.update length 3" { + let len3 = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" |> SkewBinaryRandomAccessList.cons "c" + (((len3 |> SkewBinaryRandomAccessList.update 0 "cc"|> SkewBinaryRandomAccessList.lookup 0) = "cc") && ((len3 |> SkewBinaryRandomAccessList.update 1 "bb"|> SkewBinaryRandomAccessList.lookup 1) = "bb") + && ((len3 |> SkewBinaryRandomAccessList.update 2 "aa"|> SkewBinaryRandomAccessList.lookup 2) = "aa")) |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.update length 4" { + let len4 = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" |> SkewBinaryRandomAccessList.cons "c" |> SkewBinaryRandomAccessList.cons "d" + (((len4 |> SkewBinaryRandomAccessList.update 0 "dd"|> SkewBinaryRandomAccessList.lookup 0) = "dd") && ((len4 |> SkewBinaryRandomAccessList.update 1 "cc"|> SkewBinaryRandomAccessList.lookup 1) = "cc") + && ((len4 |> SkewBinaryRandomAccessList.update 2 "bb"|> SkewBinaryRandomAccessList.lookup 2) = "bb") && ((len4 |> SkewBinaryRandomAccessList.update 3 "aa"|> SkewBinaryRandomAccessList.lookup 3) = "aa")) + |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.update length 5" { + let len5 = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" |> SkewBinaryRandomAccessList.cons "c" |> SkewBinaryRandomAccessList.cons "d" |> SkewBinaryRandomAccessList.cons "e" + (((len5 |> SkewBinaryRandomAccessList.update 0 "ee"|> SkewBinaryRandomAccessList.lookup 0) = "ee") && ((len5 |> SkewBinaryRandomAccessList.update 1 "dd"|> SkewBinaryRandomAccessList.lookup 1) = "dd") + && ((len5 |> SkewBinaryRandomAccessList.update 2 "cc"|> SkewBinaryRandomAccessList.lookup 2) = "cc") && ((len5 |> SkewBinaryRandomAccessList.update 3 "bb"|> SkewBinaryRandomAccessList.lookup 3) = "bb") + && ((len5 |> SkewBinaryRandomAccessList.update 4 "aa"|> SkewBinaryRandomAccessList.lookup 4) = "aa")) |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.update length 6" { + let len6 = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" |> SkewBinaryRandomAccessList.cons "c" |> SkewBinaryRandomAccessList.cons "d" |> SkewBinaryRandomAccessList.cons "e" |> SkewBinaryRandomAccessList.cons "f" + (((len6 |> SkewBinaryRandomAccessList.update 0 "ff"|> SkewBinaryRandomAccessList.lookup 0) = "ff") && ((len6 |> SkewBinaryRandomAccessList.update 1 "ee"|> SkewBinaryRandomAccessList.lookup 1) = "ee") + && ((len6 |> SkewBinaryRandomAccessList.update 2 "dd"|> SkewBinaryRandomAccessList.lookup 2) = "dd") && ((len6 |> SkewBinaryRandomAccessList.update 3 "cc"|> SkewBinaryRandomAccessList.lookup 3) = "cc") + && ((len6 |> SkewBinaryRandomAccessList.update 4 "bb"|> SkewBinaryRandomAccessList.lookup 4) = "bb") && ((len6 |> SkewBinaryRandomAccessList.update 5 "aa"|> SkewBinaryRandomAccessList.lookup 5) = "aa")) |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.update length 7" { + let len7 = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" |> SkewBinaryRandomAccessList.cons "c" |> SkewBinaryRandomAccessList.cons "d" |> SkewBinaryRandomAccessList.cons "e" |> SkewBinaryRandomAccessList.cons "f" |> SkewBinaryRandomAccessList.cons "g" + (((len7 |> SkewBinaryRandomAccessList.update 0 "gg"|> SkewBinaryRandomAccessList.lookup 0) = "gg") && ((len7 |> SkewBinaryRandomAccessList.update 1 "ff"|> SkewBinaryRandomAccessList.lookup 1) = "ff") + && ((len7 |> SkewBinaryRandomAccessList.update 2 "ee"|> SkewBinaryRandomAccessList.lookup 2) = "ee") && ((len7 |> SkewBinaryRandomAccessList.update 3 "dd"|> SkewBinaryRandomAccessList.lookup 3) = "dd") + && ((len7 |> SkewBinaryRandomAccessList.update 4 "cc"|> SkewBinaryRandomAccessList.lookup 4) = "cc") && ((len7 |> SkewBinaryRandomAccessList.update 5 "bb"|> SkewBinaryRandomAccessList.lookup 5) = "bb") + && ((len7 |> SkewBinaryRandomAccessList.update 6 "aa"|> SkewBinaryRandomAccessList.lookup 6) = "aa")) |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.update length 8" { + let len8 = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" |> SkewBinaryRandomAccessList.cons "c" |> SkewBinaryRandomAccessList.cons "d" |> SkewBinaryRandomAccessList.cons "e" |> SkewBinaryRandomAccessList.cons "f" |> SkewBinaryRandomAccessList.cons "g" |> SkewBinaryRandomAccessList.cons "h" + (((len8 |> SkewBinaryRandomAccessList.update 0 "hh"|> SkewBinaryRandomAccessList.lookup 0) = "hh") && ((len8 |> SkewBinaryRandomAccessList.update 1 "gg"|> SkewBinaryRandomAccessList.lookup 1) = "gg") + && ((len8 |> SkewBinaryRandomAccessList.update 2 "ff"|> SkewBinaryRandomAccessList.lookup 2) = "ff") && ((len8 |> SkewBinaryRandomAccessList.update 3 "ee"|> SkewBinaryRandomAccessList.lookup 3) = "ee") + && ((len8 |> SkewBinaryRandomAccessList.update 4 "dd"|> SkewBinaryRandomAccessList.lookup 4) = "dd") && ((len8 |> SkewBinaryRandomAccessList.update 5 "cc"|> SkewBinaryRandomAccessList.lookup 5) = "cc") + && ((len8 |> SkewBinaryRandomAccessList.update 6 "bb"|> SkewBinaryRandomAccessList.lookup 6) = "bb") && ((len8 |> SkewBinaryRandomAccessList.update 7 "aa"|> SkewBinaryRandomAccessList.lookup 7) = "aa")) + |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.update length 9" { + let len9 = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" |> SkewBinaryRandomAccessList.cons "c" |> SkewBinaryRandomAccessList.cons "d" |> SkewBinaryRandomAccessList.cons "e" |> SkewBinaryRandomAccessList.cons "f" |> SkewBinaryRandomAccessList.cons "g" |> SkewBinaryRandomAccessList.cons "h" |> SkewBinaryRandomAccessList.cons "i" + (((len9 |> SkewBinaryRandomAccessList.update 0 "ii"|> SkewBinaryRandomAccessList.lookup 0) = "ii") && ((len9 |> SkewBinaryRandomAccessList.update 1 "hh"|> SkewBinaryRandomAccessList.lookup 1) = "hh") + && ((len9 |> SkewBinaryRandomAccessList.update 2 "gg"|> SkewBinaryRandomAccessList.lookup 2) = "gg") && ((len9 |> SkewBinaryRandomAccessList.update 3 "ff"|> SkewBinaryRandomAccessList.lookup 3) = "ff") + && ((len9 |> SkewBinaryRandomAccessList.update 4 "ee"|> SkewBinaryRandomAccessList.lookup 4) = "ee") && ((len9 |> SkewBinaryRandomAccessList.update 5 "dd"|> SkewBinaryRandomAccessList.lookup 5) = "dd") + && ((len9 |> SkewBinaryRandomAccessList.update 6 "cc"|> SkewBinaryRandomAccessList.lookup 6) = "cc") && ((len9 |> SkewBinaryRandomAccessList.update 7 "bb"|> SkewBinaryRandomAccessList.lookup 7) = "bb") + && ((len9 |> SkewBinaryRandomAccessList.update 8 "aa"|> SkewBinaryRandomAccessList.lookup 8) = "aa")) |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.update length 10" { + let lena = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" |> SkewBinaryRandomAccessList.cons "c" |> SkewBinaryRandomAccessList.cons "d" |> SkewBinaryRandomAccessList.cons "e" |> SkewBinaryRandomAccessList.cons "f" |> SkewBinaryRandomAccessList.cons "g" |> SkewBinaryRandomAccessList.cons "h" |> SkewBinaryRandomAccessList.cons "i" |> SkewBinaryRandomAccessList.cons "j" + (((lena |> SkewBinaryRandomAccessList.update 0 "jj"|> SkewBinaryRandomAccessList.lookup 0) = "jj") && ((lena |> SkewBinaryRandomAccessList.update 1 "ii"|> SkewBinaryRandomAccessList.lookup 1) = "ii") + && ((lena |> SkewBinaryRandomAccessList.update 2 "hh"|> SkewBinaryRandomAccessList.lookup 2) = "hh") && ((lena |> SkewBinaryRandomAccessList.update 3 "gg"|> SkewBinaryRandomAccessList.lookup 3) = "gg") + && ((lena |> SkewBinaryRandomAccessList.update 4 "ff"|> SkewBinaryRandomAccessList.lookup 4) = "ff") && ((lena |> SkewBinaryRandomAccessList.update 5 "ee"|> SkewBinaryRandomAccessList.lookup 5) = "ee") + && ((lena |> SkewBinaryRandomAccessList.update 6 "dd"|> SkewBinaryRandomAccessList.lookup 6) = "dd") && ((lena |> SkewBinaryRandomAccessList.update 7 "cc"|> SkewBinaryRandomAccessList.lookup 7) = "cc") + && ((lena |> SkewBinaryRandomAccessList.update 8 "bb"|> SkewBinaryRandomAccessList.lookup 8) = "bb") && ((lena |> SkewBinaryRandomAccessList.update 9 "aa"|> SkewBinaryRandomAccessList.lookup 9) = "aa")) |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.tryUpdate length 1" { + let a = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.tryUpdate 0 "aa" + ((a.Value |> SkewBinaryRandomAccessList.lookup 0) = "aa") |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.tryUpdate length 2" { + let len2 = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" + let b = len2 |> SkewBinaryRandomAccessList.tryUpdate 0 "bb" + let a = len2 |> SkewBinaryRandomAccessList.tryUpdate 1 "aa" + (((b.Value |> SkewBinaryRandomAccessList.lookup 0) = "bb") && ((a.Value |> SkewBinaryRandomAccessList.lookup 1) = "aa")) |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.tryUpdate length 3" { + let len3 = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" |> SkewBinaryRandomAccessList.cons "c" + let c = len3 |> SkewBinaryRandomAccessList.tryUpdate 0 "cc" + let b = len3 |> SkewBinaryRandomAccessList.tryUpdate 1 "bb" + let a = len3 |> SkewBinaryRandomAccessList.tryUpdate 2 "aa" + (((c.Value |> SkewBinaryRandomAccessList.lookup 0) = "cc") && ((b.Value |> SkewBinaryRandomAccessList.lookup 1) = "bb") && ((a.Value |> SkewBinaryRandomAccessList.lookup 2) = "aa")) |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.tryUpdate length 4" { + let len4 = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" |> SkewBinaryRandomAccessList.cons "c" |> SkewBinaryRandomAccessList.cons "d" + let d = len4 |> SkewBinaryRandomAccessList.tryUpdate 0 "dd" + let c = len4 |> SkewBinaryRandomAccessList.tryUpdate 1 "cc" + let b = len4 |> SkewBinaryRandomAccessList.tryUpdate 2 "bb" + let a = len4 |> SkewBinaryRandomAccessList.tryUpdate 3 "aa" + (((d.Value |> SkewBinaryRandomAccessList.lookup 0) = "dd") && ((c.Value |> SkewBinaryRandomAccessList.lookup 1) = "cc") && ((b.Value |> SkewBinaryRandomAccessList.lookup 2) = "bb") + && ((a.Value |> SkewBinaryRandomAccessList.lookup 3) = "aa")) |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.tryUpdate length 5" { + let len5 = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" |> SkewBinaryRandomAccessList.cons "c" |> SkewBinaryRandomAccessList.cons "d" |> SkewBinaryRandomAccessList.cons "e" + let e = len5 |> SkewBinaryRandomAccessList.tryUpdate 0 "ee" + let d = len5 |> SkewBinaryRandomAccessList.tryUpdate 1 "dd" + let c = len5 |> SkewBinaryRandomAccessList.tryUpdate 2 "cc" + let b = len5 |> SkewBinaryRandomAccessList.tryUpdate 3 "bb" + let a = len5 |> SkewBinaryRandomAccessList.tryUpdate 4 "aa" + (((e.Value |> SkewBinaryRandomAccessList.lookup 0) = "ee") && ((d.Value |> SkewBinaryRandomAccessList.lookup 1) = "dd") && ((c.Value |> SkewBinaryRandomAccessList.lookup 2) = "cc") + && ((b.Value |> SkewBinaryRandomAccessList.lookup 3) = "bb") && ((a.Value |> SkewBinaryRandomAccessList.lookup 4) = "aa")) |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.tryUpdate length 6" { + let len6 = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" |> SkewBinaryRandomAccessList.cons "c" |> SkewBinaryRandomAccessList.cons "d" |> SkewBinaryRandomAccessList.cons "e" |> SkewBinaryRandomAccessList.cons "f" + let f = len6 |> SkewBinaryRandomAccessList.tryUpdate 0 "ff" + let e = len6 |> SkewBinaryRandomAccessList.tryUpdate 1 "ee" + let d = len6 |> SkewBinaryRandomAccessList.tryUpdate 2 "dd" + let c = len6 |> SkewBinaryRandomAccessList.tryUpdate 3 "cc" + let b = len6 |> SkewBinaryRandomAccessList.tryUpdate 4 "bb" + let a = len6 |> SkewBinaryRandomAccessList.tryUpdate 5 "aa" + (((f.Value |> SkewBinaryRandomAccessList.lookup 0) = "ff") && ((e.Value |> SkewBinaryRandomAccessList.lookup 1) = "ee") && ((d.Value |> SkewBinaryRandomAccessList.lookup 2) = "dd") + && ((c.Value |> SkewBinaryRandomAccessList.lookup 3) = "cc") && ((b.Value |> SkewBinaryRandomAccessList.lookup 4) = "bb") && ((a.Value |> SkewBinaryRandomAccessList.lookup 5) = "aa")) + |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.tryUpdate length 7" { + let len7 = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" |> SkewBinaryRandomAccessList.cons "c" |> SkewBinaryRandomAccessList.cons "d" |> SkewBinaryRandomAccessList.cons "e" |> SkewBinaryRandomAccessList.cons "f" |> SkewBinaryRandomAccessList.cons "g" + let g = len7 |> SkewBinaryRandomAccessList.tryUpdate 0 "gg" + let f = len7 |> SkewBinaryRandomAccessList.tryUpdate 1 "ff" + let e = len7 |> SkewBinaryRandomAccessList.tryUpdate 2 "ee" + let d = len7 |> SkewBinaryRandomAccessList.tryUpdate 3 "dd" + let c = len7 |> SkewBinaryRandomAccessList.tryUpdate 4 "cc" + let b = len7 |> SkewBinaryRandomAccessList.tryUpdate 5 "bb" + let a = len7 |> SkewBinaryRandomAccessList.tryUpdate 6 "aa" + (((g.Value |> SkewBinaryRandomAccessList.lookup 0) = "gg") && ((f.Value |> SkewBinaryRandomAccessList.lookup 1) = "ff") && ((e.Value |> SkewBinaryRandomAccessList.lookup 2) = "ee") + && ((d.Value |> SkewBinaryRandomAccessList.lookup 3) = "dd") && ((c.Value |> SkewBinaryRandomAccessList.lookup 4) = "cc") && ((b.Value |> SkewBinaryRandomAccessList.lookup 5) = "bb") + && ((a.Value |> SkewBinaryRandomAccessList.lookup 6) = "aa")) |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.tryUpdate length 8" { + let len8 = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" |> SkewBinaryRandomAccessList.cons "c" |> SkewBinaryRandomAccessList.cons "d" |> SkewBinaryRandomAccessList.cons "e" |> SkewBinaryRandomAccessList.cons "f" |> SkewBinaryRandomAccessList.cons "g" |> SkewBinaryRandomAccessList.cons "h" + let h = len8 |> SkewBinaryRandomAccessList.tryUpdate 0 "hh" + let g = len8 |> SkewBinaryRandomAccessList.tryUpdate 1 "gg" + let f = len8 |> SkewBinaryRandomAccessList.tryUpdate 2 "ff" + let e = len8 |> SkewBinaryRandomAccessList.tryUpdate 3 "ee" + let d = len8 |> SkewBinaryRandomAccessList.tryUpdate 4 "dd" + let c = len8 |> SkewBinaryRandomAccessList.tryUpdate 5 "cc" + let b = len8 |> SkewBinaryRandomAccessList.tryUpdate 6 "bb" + let a = len8 |> SkewBinaryRandomAccessList.tryUpdate 7 "aa" + (((h.Value |> SkewBinaryRandomAccessList.lookup 0) = "hh") && ((g.Value |> SkewBinaryRandomAccessList.lookup 1) = "gg") && ((f.Value |> SkewBinaryRandomAccessList.lookup 2) = "ff") + && ((e.Value |> SkewBinaryRandomAccessList.lookup 3) = "ee") && ((d.Value |> SkewBinaryRandomAccessList.lookup 4) = "dd") && ((c.Value |> SkewBinaryRandomAccessList.lookup 5) = "cc") + && ((b.Value |> SkewBinaryRandomAccessList.lookup 6) = "bb")&& ((a.Value |> SkewBinaryRandomAccessList.lookup 7) = "aa")) |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.tryUpdate length 9" { + let len9 = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" |> SkewBinaryRandomAccessList.cons "c" |> SkewBinaryRandomAccessList.cons "d" |> SkewBinaryRandomAccessList.cons "e" |> SkewBinaryRandomAccessList.cons "f" |> SkewBinaryRandomAccessList.cons "g" |> SkewBinaryRandomAccessList.cons "h" |> SkewBinaryRandomAccessList.cons "i" + let i = len9 |> SkewBinaryRandomAccessList.tryUpdate 0 "ii" + let h = len9 |> SkewBinaryRandomAccessList.tryUpdate 1 "hh" + let g = len9 |> SkewBinaryRandomAccessList.tryUpdate 2 "gg" + let f = len9 |> SkewBinaryRandomAccessList.tryUpdate 3 "ff" + let e = len9 |> SkewBinaryRandomAccessList.tryUpdate 4 "ee" + let d = len9 |> SkewBinaryRandomAccessList.tryUpdate 5 "dd" + let c = len9 |> SkewBinaryRandomAccessList.tryUpdate 6 "cc" + let b = len9 |> SkewBinaryRandomAccessList.tryUpdate 7 "bb" + let a = len9 |> SkewBinaryRandomAccessList.tryUpdate 8 "aa" + (((i.Value |> SkewBinaryRandomAccessList.lookup 0) = "ii") && ((h.Value |> SkewBinaryRandomAccessList.lookup 1) = "hh") && ((g.Value |> SkewBinaryRandomAccessList.lookup 2) = "gg") + && ((f.Value |> SkewBinaryRandomAccessList.lookup 3) = "ff") && ((e.Value |> SkewBinaryRandomAccessList.lookup 4) = "ee") && ((d.Value |> SkewBinaryRandomAccessList.lookup 5) = "dd") + && ((c.Value |> SkewBinaryRandomAccessList.lookup 6) = "cc") && ((b.Value |> SkewBinaryRandomAccessList.lookup 7) = "bb")&& ((a.Value |> SkewBinaryRandomAccessList.lookup 8) = "aa")) |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.tryUpdate length 10" { + let lena = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" |> SkewBinaryRandomAccessList.cons "c" |> SkewBinaryRandomAccessList.cons "d" |> SkewBinaryRandomAccessList.cons "e" |> SkewBinaryRandomAccessList.cons "f" |> SkewBinaryRandomAccessList.cons "g" |> SkewBinaryRandomAccessList.cons "h" |> SkewBinaryRandomAccessList.cons "i" |> SkewBinaryRandomAccessList.cons "j" + let j = lena |> SkewBinaryRandomAccessList.tryUpdate 0 "jj" + let i = lena |> SkewBinaryRandomAccessList.tryUpdate 1 "ii" + let h = lena |> SkewBinaryRandomAccessList.tryUpdate 2 "hh" + let g = lena |> SkewBinaryRandomAccessList.tryUpdate 3 "gg" + let f = lena |> SkewBinaryRandomAccessList.tryUpdate 4 "ff" + let e = lena |> SkewBinaryRandomAccessList.tryUpdate 5 "ee" + let d = lena |> SkewBinaryRandomAccessList.tryUpdate 6 "dd" + let c = lena |> SkewBinaryRandomAccessList.tryUpdate 7 "cc" + let b = lena |> SkewBinaryRandomAccessList.tryUpdate 8 "bb" + let a = lena |> SkewBinaryRandomAccessList.tryUpdate 9 "aa" + (((j.Value |> SkewBinaryRandomAccessList.lookup 0) = "jj") && ((i.Value |> SkewBinaryRandomAccessList.lookup 1) = "ii") && ((h.Value |> SkewBinaryRandomAccessList.lookup 2) = "hh") + && ((g.Value |> SkewBinaryRandomAccessList.lookup 3) = "gg") && ((f.Value |> SkewBinaryRandomAccessList.lookup 4) = "ff") && ((e.Value |> SkewBinaryRandomAccessList.lookup 5) = "ee") + && ((d.Value |> SkewBinaryRandomAccessList.lookup 6) = "dd") && ((c.Value |> SkewBinaryRandomAccessList.lookup 7) = "cc") && ((b.Value |> SkewBinaryRandomAccessList.lookup 8) = "bb") + && ((a.Value |> SkewBinaryRandomAccessList.lookup 9) = "aa")) |> Expect.isTrue "" } + + test "length of empty is 0" { + SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.length |> Expect.equal "" 0 } + + test "length of 1 - 10 good" { + let len1 = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" + let len2 = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" + let len3 = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" |> SkewBinaryRandomAccessList.cons "c" + let len4 = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" |> SkewBinaryRandomAccessList.cons "c" |> SkewBinaryRandomAccessList.cons "d" + let len5 = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" |> SkewBinaryRandomAccessList.cons "c" |> SkewBinaryRandomAccessList.cons "d" |> SkewBinaryRandomAccessList.cons "e" + let len6 = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" |> SkewBinaryRandomAccessList.cons "c" |> SkewBinaryRandomAccessList.cons "d" |> SkewBinaryRandomAccessList.cons "e" |> SkewBinaryRandomAccessList.cons "f" + let len7 = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" |> SkewBinaryRandomAccessList.cons "c" |> SkewBinaryRandomAccessList.cons "d" |> SkewBinaryRandomAccessList.cons "e" |> SkewBinaryRandomAccessList.cons "f" |> SkewBinaryRandomAccessList.cons "g" + let len8 = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" |> SkewBinaryRandomAccessList.cons "c" |> SkewBinaryRandomAccessList.cons "d" |> SkewBinaryRandomAccessList.cons "e" |> SkewBinaryRandomAccessList.cons "f" |> SkewBinaryRandomAccessList.cons "g" |> SkewBinaryRandomAccessList.cons "h" + let len9 = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" |> SkewBinaryRandomAccessList.cons "c" |> SkewBinaryRandomAccessList.cons "d" |> SkewBinaryRandomAccessList.cons "e" |> SkewBinaryRandomAccessList.cons "f" |> SkewBinaryRandomAccessList.cons "g" |> SkewBinaryRandomAccessList.cons "h" |> SkewBinaryRandomAccessList.cons "i" + let lena = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" |> SkewBinaryRandomAccessList.cons "c" |> SkewBinaryRandomAccessList.cons "d" |> SkewBinaryRandomAccessList.cons "e" |> SkewBinaryRandomAccessList.cons "f" |> SkewBinaryRandomAccessList.cons "g" |> SkewBinaryRandomAccessList.cons "h" |> SkewBinaryRandomAccessList.cons "i" |> SkewBinaryRandomAccessList.cons "j" + (((SkewBinaryRandomAccessList.length len1) = 1) && ((SkewBinaryRandomAccessList.length len2) = 2) && ((SkewBinaryRandomAccessList.length len3) = 3) && ((SkewBinaryRandomAccessList.length len4) = 4) + && ((SkewBinaryRandomAccessList.length len5) = 5) && ((SkewBinaryRandomAccessList.length len6) = 6) && ((SkewBinaryRandomAccessList.length len7) = 7) && ((SkewBinaryRandomAccessList.length len8) = 8) + && ((SkewBinaryRandomAccessList.length len9) = 9) && ((SkewBinaryRandomAccessList.length lena) = 10)) |> Expect.isTrue "" } + + test "SkewBinaryRandomAccessList.ofSeq" { + let x = SkewBinaryRandomAccessList.ofSeq ["a";"b";"c";"d";"e";"f";"g";"h";"i";"j"] + + (((x |> SkewBinaryRandomAccessList.lookup 0) = "a") && ((x |> SkewBinaryRandomAccessList.lookup 1) = "b") && ((x |> SkewBinaryRandomAccessList.lookup 2) = "c") && ((x |> SkewBinaryRandomAccessList.lookup 3) = "d") + && ((x |> SkewBinaryRandomAccessList.lookup 4) = "e") && ((x |> SkewBinaryRandomAccessList.lookup 5) = "f") && ((x |> SkewBinaryRandomAccessList.lookup 6) = "g") && ((x |> SkewBinaryRandomAccessList.lookup 7) = "h") + && ((x |> SkewBinaryRandomAccessList.lookup 8) = "i") && ((x |> SkewBinaryRandomAccessList.lookup 9) = "j")) |> Expect.isTrue "" } + + test "IRandomAccessList SkewBinaryRandomAccessList.cons works" { + let lena = SkewBinaryRandomAccessList.empty() |> SkewBinaryRandomAccessList.cons "a" |> SkewBinaryRandomAccessList.cons "b" |> SkewBinaryRandomAccessList.cons "c" |> SkewBinaryRandomAccessList.cons "d" |> SkewBinaryRandomAccessList.cons "e" |> SkewBinaryRandomAccessList.cons "f" |> SkewBinaryRandomAccessList.cons "g" |> SkewBinaryRandomAccessList.cons "h" |> SkewBinaryRandomAccessList.cons "i" |> SkewBinaryRandomAccessList.cons "j" + ((lena :> IRandomAccessList).Cons "zz").Head |> Expect.equal "" "zz" } + ] \ No newline at end of file diff --git a/tests/FSharpx.Collections.Experimental.Tests/SkewBinomialHeapTest.fs b/tests/FSharpx.Collections.Experimental.Tests/SkewBinomialHeapTest.fs index 1dd3d65a..bc2939cf 100644 --- a/tests/FSharpx.Collections.Experimental.Tests/SkewBinomialHeapTest.fs +++ b/tests/FSharpx.Collections.Experimental.Tests/SkewBinomialHeapTest.fs @@ -1,318 +1,281 @@ -[] -module FSharpx.Collections.Experimental.Tests.SkewBinomialHeapTest +namespace FSharpx.Collections.Experimental.Tests open FSharpx.Collections.Experimental +open Properties open FsCheck -open FsCheck.NUnit -open NUnit.Framework -open FsUnit +open Expecto +open Expecto.Flip open System -let ofList desc items = List.fold (fun h x -> SkewBinomialHeap.insert x h) (SkewBinomialHeap.empty desc) items - -//sorts a list with the same ordering as the heap -let sortList heap items = items |> List.sort |> if SkewBinomialHeap.isDescending heap then List.rev else id - -let actualHead heap items = items |> if SkewBinomialHeap.isDescending heap then List.max else List.min - -let actualTail heap = sortList heap >> List.tail - -type ComparableGenerator<'T when 'T :> IComparable> = - static member Generate () = - gen{ - let! t = Arb.generate<'T> - return (t :> System.IComparable)} - |> Arb.fromGen - -type HeapData<'T, 'L when 'T: comparison> = { Heap: 'T SkewBinomialHeap; Items: 'L list; Desc: bool } - -type SkewBinomialHeapGenerators() = - static let genDesc d = - match d with - | Some v -> Gen.constant v - | None -> Gen.elements [true; false] - // Empty heaps only, some are empty after removing all of its elements - static member private EmptyOnly<'T when 'T: comparison> (d): Gen> = gen{ - let! desc = genDesc d - let! s = Gen.listOf (Arb.generate<'T>) - return { Heap = Seq.init (s.Length) id |> Seq.fold (fun heap _ -> heap |> SkewBinomialHeap.tail) (ofList desc s); Items = []; Desc = desc }} - // Non-emtpy heaps only, after a sucession of insertions and deletions - static member private NonemptyOnly<'T when 'T: comparison> (d): Gen> = gen{ - let! desc = genDesc d - let! t = Gen.elements [true; false] - let! s = Gen.nonEmptyListOf (Arb.generate<'T>) - let! ndel = if t then Gen.constant Int32.MaxValue else Gen.choose (2, max 2 (s |> List.length)) - let (heap, list, _) = - s - |> List.fold - (fun (heap, lst, k) item -> - let newHeap = heap |> SkewBinomialHeap.insert item - let newList = item::lst - if k + 1 = ndel then - (newHeap |> SkewBinomialHeap.tail, newList |> List.sort |> (if desc then List.rev else id) |> List.tail, 0) - else - (newHeap, newList, k + 1)) - (SkewBinomialHeap.empty desc, [], 0) - return {Heap = heap; Items = list; Desc = desc}} +module SkewBinomialHeapTest = + + let ofList desc items = List.fold (fun h x -> SkewBinomialHeap.insert x h) (SkewBinomialHeap.empty desc) items + + //sorts a list with the same ordering as the heap + let sortList heap items = items |> List.sort |> if SkewBinomialHeap.isDescending heap then List.rev else id + + let actualHead heap items = items |> if SkewBinomialHeap.isDescending heap then List.max else List.min + + let actualTail heap = sortList heap >> List.tail + + type ComparableGenerator<'T when 'T :> IComparable> = + static member Generate () = + gen{ + let! t = Arb.generate<'T> + return (t :> System.IComparable)} + |> Arb.fromGen + + type HeapData<'T, 'L when 'T: comparison> = { Heap: 'T SkewBinomialHeap; Items: 'L list; Desc: bool } + + type SkewBinomialHeapGenerators() = + static let genDesc d = + match d with + | Some v -> Gen.constant v + | None -> Gen.elements [true; false] + // Empty heaps only, some are empty after removing all of its elements + static member private EmptyOnly<'T when 'T: comparison> (d): Gen> = gen{ + let! desc = genDesc d + let! s = Gen.listOf (Arb.generate<'T>) + return { Heap = Seq.init (s.Length) id |> Seq.fold (fun heap _ -> heap |> SkewBinomialHeap.tail) (ofList desc s); Items = []; Desc = desc }} + // Non-emtpy heaps only, after a sucession of insertions and deletions + static member private NonemptyOnly<'T when 'T: comparison> (d): Gen> = gen{ + let! desc = genDesc d + let! t = Gen.elements [true; false] + let! s = Gen.nonEmptyListOf (Arb.generate<'T>) + let! ndel = if t then Gen.constant Int32.MaxValue else Gen.choose (2, max 2 (s |> List.length)) + let (heap, list, _) = + s + |> List.fold + (fun (heap, lst, k) item -> + let newHeap = heap |> SkewBinomialHeap.insert item + let newList = item::lst + if k + 1 = ndel then + (newHeap |> SkewBinomialHeap.tail, newList |> List.sort |> (if desc then List.rev else id) |> List.tail, 0) + else + (newHeap, newList, k + 1)) + (SkewBinomialHeap.empty desc, [], 0) + return {Heap = heap; Items = list; Desc = desc}} - static member private Mixed<'T when 'T: comparison> (): Gen> = - Gen.frequency [200, SkewBinomialHeapGenerators.EmptyOnly<'T> (None); 800, SkewBinomialHeapGenerators.NonemptyOnly<'T> (None)] + static member private Mixed<'T when 'T: comparison> (): Gen> = + Gen.frequency [200, SkewBinomialHeapGenerators.EmptyOnly<'T> (None); 800, SkewBinomialHeapGenerators.NonemptyOnly<'T> (None)] - //Distribute the cases, so the tests that receive two heaps and need both to have the same isDescending don't exhaust the arguments, ex: the merge tests - static member private TwoMixed<'T when 'T: comparison> (): Gen * HeapData<'T, 'T>> = - Gen.frequency [ - 500, Gen.oneof [SkewBinomialHeapGenerators.EmptyOnly<'T> (None); SkewBinomialHeapGenerators.NonemptyOnly<'T> (None)] |> Gen.two - 250, Gen.oneof [SkewBinomialHeapGenerators.EmptyOnly<'T> (Some true); SkewBinomialHeapGenerators.NonemptyOnly<'T> (Some true)] |> Gen.two - 250, Gen.oneof [SkewBinomialHeapGenerators.EmptyOnly<'T> (Some false); SkewBinomialHeapGenerators.NonemptyOnly<'T> (Some false)] |> Gen.two - ] + //Distribute the cases, so the tests that receive two heaps and need both to have the same isDescending don't exhaust the arguments, ex: the merge tests + static member private TwoMixed<'T when 'T: comparison> (): Gen * HeapData<'T, 'T>> = + Gen.frequency [ + 500, Gen.oneof [SkewBinomialHeapGenerators.EmptyOnly<'T> (None); SkewBinomialHeapGenerators.NonemptyOnly<'T> (None)] |> Gen.two + 250, Gen.oneof [SkewBinomialHeapGenerators.EmptyOnly<'T> (Some true); SkewBinomialHeapGenerators.NonemptyOnly<'T> (Some true)] |> Gen.two + 250, Gen.oneof [SkewBinomialHeapGenerators.EmptyOnly<'T> (Some false); SkewBinomialHeapGenerators.NonemptyOnly<'T> (Some false)] |> Gen.two + ] - static member ComparableAndComparable() = SkewBinomialHeapGenerators.Mixed () |> Arb.fromGen + static member ComparableAndComparable() = SkewBinomialHeapGenerators.Mixed () |> Arb.fromGen - static member ComparableAndComparablePair() = SkewBinomialHeapGenerators.TwoMixed() |> Arb.fromGen + static member ComparableAndComparablePair() = SkewBinomialHeapGenerators.TwoMixed() |> Arb.fromGen - static member ComparableAndObject() = gen { - let! data = SkewBinomialHeapGenerators.Mixed () - return { Heap = data.Heap; Items = data.Items |> Seq.cast |> Seq.toList; Desc = data.Desc }} |> Arb.fromGen + static member ComparableAndObject() = gen { + let! data = SkewBinomialHeapGenerators.Mixed () + return { Heap = data.Heap; Items = data.Items |> Seq.cast |> Seq.toList; Desc = data.Desc }} |> Arb.fromGen - static member ComparableAndObjectPair() = gen { - let! data1, data2 = SkewBinomialHeapGenerators.TwoMixed () - return { Heap = data1.Heap; Items = data1.Items |> Seq.cast |> Seq.toList; Desc = data1.Desc }, - { Heap = data2.Heap; Items = data2.Items |> Seq.cast |> Seq.toList; Desc = data2.Desc }} |> Arb.fromGen - -let register = - lazy ( - Arb.register>() |> ignore - Arb.register() |> ignore) - -[] -let setUp () = - register.Force () - -let fail str = Assert.Fail str - -let fsCheck a = fsCheck null a - -//************* TESTS ***************** -//Only tested the functions on the SkewBinomialHeap module for now, later I could test the remaining functions and methods -//TODO: Test ofSeq - -[] -let ``toSeq returns all the elements`` () = - fsCheck <| fun { Heap = heap; Items = orig } -> - heap |> SkewBinomialHeap.toSeq |> Seq.toList |> List.sort = List.sort orig - -[] -let ``toSeq returns the elements in the correct order`` () = - fsCheck <| fun { Heap = heap; Items = orig } -> - heap |> SkewBinomialHeap.toSeq |> Seq.toList = sortList heap orig - -[] -let ``toList returns the same as toSeq |> List.ofSeq`` () = - fsCheck <| fun { Heap = heap } -> - heap |> SkewBinomialHeap.toList = (heap |> SkewBinomialHeap.toSeq |> List.ofSeq) - -[] -let ``isDescending returns correct value`` () = - fsCheck <| fun { Heap = heap; Desc = desc } -> - SkewBinomialHeap.isDescending heap = desc - -[] -let ``isEmpty returns true if count = 0, false otherwise`` () = - fsCheck <| fun { Heap = heap } -> - SkewBinomialHeap.count heap = 0 = SkewBinomialHeap.isEmpty heap - -[] -let ``isEmpty returns true if the heap is empty, false otherwise`` () = - fsCheck <| fun { Heap = heap; Items = orig } -> - SkewBinomialHeap.isEmpty heap = List.isEmpty orig - -[] -let ``count returns the number of elements`` () = - fsCheck <| fun { Heap = heap; Items = orig } -> - heap |> SkewBinomialHeap.count = List.length orig - -[] -let ``length is the same as count`` () = - fsCheck <| fun { Heap = heap } -> - heap |> SkewBinomialHeap.count = SkewBinomialHeap.length heap - -[] -let ``head returns the first element when the heap is not empty`` () = - fsCheck <| fun { Heap = heap; Items = orig } -> - heap |> SkewBinomialHeap.isEmpty |> not ==> lazy(heap |> SkewBinomialHeap.head = actualHead heap orig) - -[] -let ``head throws when the heap is empty`` () = - fsCheck <| fun { Heap = heap } -> - heap |> SkewBinomialHeap.isEmpty ==> lazy(should throw typeof <| fun () -> heap |> SkewBinomialHeap.head |> ignore) - -[] -let ``tryHead returns Some head when the heap is not empty`` () = - fsCheck <| fun { Heap = heap; Items = orig } -> - heap |> SkewBinomialHeap.isEmpty |> not ==> - match SkewBinomialHeap.tryHead heap with - | Some head -> head = actualHead heap orig - | None -> false - -[] -let ``tryHead returns None when the heap is empty`` () = - fsCheck <| fun { Heap = heap } -> - heap |> SkewBinomialHeap.isEmpty ==> (heap |> SkewBinomialHeap.tryHead |> Option.isNone) - -[] -let ``tail returns a heap with the first element removed when the heap is not empty`` () = - fsCheck <| fun { Heap = heap; Items = orig } -> - heap |> SkewBinomialHeap.isEmpty |> not ==> lazy(heap |> SkewBinomialHeap.tail |> SkewBinomialHeap.toList = actualTail heap orig) - -[] -let ``tail throws when the heap is empty`` () = - fsCheck <| fun { Heap = heap } -> - heap |> SkewBinomialHeap.isEmpty ==> lazy(should throw typeof <| fun () -> heap |> SkewBinomialHeap.tail |> ignore) - -[] -let ``tryTail returns Some tail when the heap is not empty`` () = - fsCheck <| fun { Heap = heap; Items = orig } -> - heap |> SkewBinomialHeap.isEmpty |> not ==> - lazy( - match SkewBinomialHeap.tryTail heap with - | Some tail -> tail |> SkewBinomialHeap.toList = actualTail heap orig - | None -> false) - -[] -let ``tryTail returns None when the heap is empty`` () = - fsCheck <| fun { Heap = heap } -> - heap |> SkewBinomialHeap.isEmpty ==> (heap |> SkewBinomialHeap.tryTail |> Option.isNone) - -[] -let ``uncons returns (head, tail) when the heap is not empty`` () = - fsCheck <| fun { Heap = heap; Items = orig } -> - heap |> SkewBinomialHeap.isEmpty |> not ==> - lazy( - let (h, t) = SkewBinomialHeap.uncons heap - h = actualHead heap orig && - SkewBinomialHeap.toList t = actualTail heap orig) - -[] -let ``uncons throws when the heap is empty`` () = - fsCheck <| fun { Heap = heap } -> - heap |> SkewBinomialHeap.isEmpty ==> lazy(should throw typeof <| fun () -> heap |> SkewBinomialHeap.uncons |> ignore) - -[] -let ``tryUncons returns Some (head, tail) when the heap is not empty`` () = - fsCheck <| fun { Heap = heap; Items = orig } -> - heap |> SkewBinomialHeap.isEmpty |> not ==> - lazy( - match SkewBinomialHeap.tryUncons heap with - | Some (h, t) -> - h = actualHead heap orig && - SkewBinomialHeap.toList t = actualTail heap orig - | None -> false) - -[] -let ``tryUncons returns None when the heap is empty`` () = - fsCheck <| fun { Heap = heap } -> - heap |> SkewBinomialHeap.isEmpty ==> lazy(heap |> SkewBinomialHeap.tryUncons |> Option.isNone) - -[] -let ``insert always insert`` () = - fsCheck <| fun { Heap = heap; Items = orig } x -> - heap - |> SkewBinomialHeap.insert x - |> SkewBinomialHeap.toList - |> should equal (x::orig |> sortList heap) - -[] -let ``merge should merge if both heaps have the same ordering`` () = - fsCheck <| fun ({ Heap = heap1; Items = orig1 }, { Heap = heap2; Items = orig2 }) -> - heap1.IsDescending = heap2.IsDescending ==> - lazy( - SkewBinomialHeap.merge heap1 heap2 - |> SkewBinomialHeap.toList - |> should equal (orig1 |> List.append orig2 |> sortList heap1)) - -[] -let ``merge throws when both heaps have diferent ordering`` () = - fsCheck <| fun ({ Heap = heap1 }, { Heap = heap2 }) -> - heap1.IsDescending <> heap2.IsDescending ==> - lazy(should throw typeof <| fun () -> SkewBinomialHeap.merge heap1 heap2 |> ignore) - -[] -let ``tryMerge returns Some merged heap when both heaps have the same ordering`` () = - fsCheck <| fun ({ Heap = heap1; Items = orig1 }, { Heap = heap2; Items = orig2 }) -> - heap1.IsDescending = heap2.IsDescending ==> - lazy( - match SkewBinomialHeap.tryMerge heap1 heap2 |> Option.map SkewBinomialHeap.toList with - | Some list -> list = (List.append orig1 orig2 |> sortList heap1) - | None -> false) - -[] -let ``tryMerge returns None when both heaps have diferent ordering`` () = - fsCheck <| fun ({ Heap = heap1; Items = orig1 }, { Heap = heap2; Items = orig2 }) -> - heap1.IsDescending <> heap2.IsDescending ==> lazy(SkewBinomialHeap.tryMerge heap1 heap2 |> Option.isNone) - -[] -let ``Cons pattern always match if the heap is not empty`` () = - fsCheck <| fun { Heap = heap } -> - heap |> SkewBinomialHeap.isEmpty |> not ==> - match heap with - | SkewBinomialHeap.Cons (_, _) -> true - | _ -> false - -[] -let ``Nil pattern always match if the heap is empty`` () = - fsCheck <| fun { Heap = heap } -> - heap |> SkewBinomialHeap.isEmpty ==> - match heap with - | SkewBinomialHeap.Cons (_, _) -> false - | _ -> true - -[] -let ``Cons pattern return the same as uncons`` () = - fsCheck <| fun { Heap = heap } -> - heap |> SkewBinomialHeap.isEmpty |> not ==> - match heap with - | SkewBinomialHeap.Cons (h, t) -> - let (h', t') = heap |> SkewBinomialHeap.uncons - h = h' && t = t' - | _ -> false - -[] -let ``GetHashCode is the same for equal heaps`` () = - fsCheck <| fun { Heap = heap } item -> - let heap1 = heap |> SkewBinomialHeap.insert item |> SkewBinomialHeap.tail - let heap2 = heap |> SkewBinomialHeap.insert item |> SkewBinomialHeap.tail - Unchecked.hash heap1 = Unchecked.hash heap2 - -//Maybe the distribution of the hash should be checked -//to avoid bad hashes, I don't know if that should be done as part of unit testing - -[] -let ``Equality reflexivity`` () = - fsCheck <| fun { Heap = heap } -> - heap = heap - -[] -let ``Equality symmetry`` () = - fsCheck <| fun { Heap = heap } item -> - let heap1 = heap |> SkewBinomialHeap.insert item |> SkewBinomialHeap.tail - let heap2 = heap |> SkewBinomialHeap.insert item |> SkewBinomialHeap.tail - heap1 = heap2 ==> (heap2 = heap1) - -[] -let ``Equality transitivity`` () = //maybe this is too much, I guess It would be hard to write an Equals that violates this property and not the others - fsCheck <| fun { Heap = heap } item -> - let heap1 = heap |> SkewBinomialHeap.insert item |> SkewBinomialHeap.tail - let heap2 = heap |> SkewBinomialHeap.insert item |> SkewBinomialHeap.tail - let heap3 = heap |> SkewBinomialHeap.insert item |> SkewBinomialHeap.tail - (heap1 = heap2 && heap2 = heap3) ==> (heap1 = heap3) - -[] -let ``Equals returns false when comparing two heaps with the same ordering but different items`` () = - fsCheck <| fun ({ Heap = heap1; Items = orig1}, { Heap = heap2; Items = orig2}) -> - (heap1.IsDescending = heap2.IsDescending && orig1 <> orig2) ==> (heap1 <> heap2 && not (heap1.Equals heap2)) - -[] -let ``Equals returns false when comparing two heaps with the same items but different ordering`` () = - fsCheck <| fun { Heap = heap1; Items = orig} -> - let heap2 = ofList (not heap1.IsDescending) orig - heap1 <> heap2 && not (heap1.Equals heap2) \ No newline at end of file + static member ComparableAndObjectPair() = gen { + let! data1, data2 = SkewBinomialHeapGenerators.TwoMixed () + return { Heap = data1.Heap; Items = data1.Items |> Seq.cast |> Seq.toList; Desc = data1.Desc }, + { Heap = data2.Heap; Items = data2.Items |> Seq.cast |> Seq.toList; Desc = data2.Desc }} |> Arb.fromGen + + let register = + lazy ( + Arb.register>() |> ignore + Arb.register() |> ignore) + + register.Force() + + //TODO: Test ofSeq + + [] + let testSkewBinomialHeap = + + testList "Experimental SkewBinomialHeap" [ + testPropertyWithConfig config10k "toSeq returns all the elements" <| + fun { Heap = heap; Items = orig } -> + heap |> SkewBinomialHeap.toSeq |> Seq.toList |> List.sort = List.sort orig + + testPropertyWithConfig config10k "toSeq returns the elements in the correct order" <| + fun { Heap = heap; Items = orig } -> + heap |> SkewBinomialHeap.toSeq |> Seq.toList = sortList heap orig + + testPropertyWithConfig config10k "toList returns the same as toSeq |> List.ofSeq" <| + fun { Heap = heap } -> + heap |> SkewBinomialHeap.toList = (heap |> SkewBinomialHeap.toSeq |> List.ofSeq) + + testPropertyWithConfig config10k "isDescending returns correct value" <| + fun { Heap = heap; Desc = desc } -> + SkewBinomialHeap.isDescending heap = desc + + testPropertyWithConfig config10k "isEmpty returns true if count = 0, false otherwise" <| + fun { Heap = heap } -> + SkewBinomialHeap.count heap = 0 = SkewBinomialHeap.isEmpty heap + + testPropertyWithConfig config10k "isEmpty returns true if the heap is empty, false otherwise" <| + fun { Heap = heap; Items = orig } -> + SkewBinomialHeap.isEmpty heap = List.isEmpty orig + + testPropertyWithConfig config10k "count returns the number of elements" <| + fun { Heap = heap; Items = orig } -> + heap |> SkewBinomialHeap.count = List.length orig + + testPropertyWithConfig config10k "length is the same as count" <| + fun { Heap = heap } -> + heap |> SkewBinomialHeap.count = SkewBinomialHeap.length heap + + testPropertyWithConfig config10k "head returns the first element when the heap is not empty" <| + fun { Heap = heap; Items = orig } -> + heap |> SkewBinomialHeap.isEmpty |> not ==> lazy(heap |> SkewBinomialHeap.head = actualHead heap orig) + + testPropertyWithConfig config10k "head throws when the heap is empty" <| + fun { Heap = heap } -> + heap |> SkewBinomialHeap.isEmpty ==> lazy(Expect.throwsT "" <| fun () -> heap |> SkewBinomialHeap.head |> ignore) + + testPropertyWithConfig config10k "tryHead returns Some head when the heap is not empty" <| + fun { Heap = heap; Items = orig } -> + heap |> SkewBinomialHeap.isEmpty |> not ==> + match SkewBinomialHeap.tryHead heap with + | Some head -> head = actualHead heap orig + | None -> false + + testPropertyWithConfig config10k "tryHead returns None when the heap is empty" <| + fun { Heap = heap } -> + heap |> SkewBinomialHeap.isEmpty ==> (heap |> SkewBinomialHeap.tryHead |> Option.isNone) + + testPropertyWithConfig config10k "tail returns a heap with the first element removed when the heap is not empty" <| + fun { Heap = heap; Items = orig } -> + heap |> SkewBinomialHeap.isEmpty |> not ==> lazy(heap |> SkewBinomialHeap.tail |> SkewBinomialHeap.toList = actualTail heap orig) + + testPropertyWithConfig config10k "tail throws when the heap is empty" <| + fun { Heap = heap } -> + heap |> SkewBinomialHeap.isEmpty ==> lazy(Expect.throwsT "" <| fun () -> heap |> SkewBinomialHeap.tail |> ignore) + + testPropertyWithConfig config10k "tryTail returns Some tail when the heap is not empty" <| + fun { Heap = heap; Items = orig } -> + heap |> SkewBinomialHeap.isEmpty |> not ==> + lazy( + match SkewBinomialHeap.tryTail heap with + | Some tail -> tail |> SkewBinomialHeap.toList = actualTail heap orig + | None -> false) + + testPropertyWithConfig config10k "tryTail returns None when the heap is empty" <| + fun { Heap = heap } -> + heap |> SkewBinomialHeap.isEmpty ==> (heap |> SkewBinomialHeap.tryTail |> Option.isNone) + + testPropertyWithConfig config10k "uncons returns (head, tail) when the heap is not empty" <| + fun { Heap = heap; Items = orig } -> + heap |> SkewBinomialHeap.isEmpty |> not ==> + lazy( + let (h, t) = SkewBinomialHeap.uncons heap + h = actualHead heap orig && + SkewBinomialHeap.toList t = actualTail heap orig) + + testPropertyWithConfig config10k "uncons throws when the heap is empty" <| + fun { Heap = heap } -> + heap |> SkewBinomialHeap.isEmpty ==> lazy(Expect.throwsT "" <| fun () -> heap |> SkewBinomialHeap.uncons |> ignore) + + testPropertyWithConfig config10k "tryUncons returns Some (head, tail) when the heap is not empty" <| + fun { Heap = heap; Items = orig } -> + heap |> SkewBinomialHeap.isEmpty |> not ==> + lazy( + match SkewBinomialHeap.tryUncons heap with + | Some (h, t) -> + h = actualHead heap orig && + SkewBinomialHeap.toList t = actualTail heap orig + | None -> false) + + testPropertyWithConfig config10k "tryUncons returns None when the heap is empty" <| + fun { Heap = heap } -> + heap |> SkewBinomialHeap.isEmpty ==> lazy(heap |> SkewBinomialHeap.tryUncons |> Option.isNone) + + testPropertyWithConfig config10k "insert always insert" <| + fun { Heap = heap; Items = orig } x -> + heap + |> SkewBinomialHeap.insert x + |> SkewBinomialHeap.toList + |> Expect.equal "" (x::orig |> sortList heap) + + testPropertyWithConfig config10k "merge should merge if both heaps have the same ordering" <| + fun ({ Heap = heap1; Items = orig1 }, { Heap = heap2; Items = orig2 }) -> + heap1.IsDescending = heap2.IsDescending ==> + lazy( + SkewBinomialHeap.merge heap1 heap2 + |> SkewBinomialHeap.toList + |> Expect.equal "" (orig1 |> List.append orig2 |> sortList heap1)) + + testPropertyWithConfig config10k "merge throws when both heaps have diferent ordering" <| + fun ({ Heap = heap1 }, { Heap = heap2 }) -> + heap1.IsDescending <> heap2.IsDescending ==> + lazy(Expect.throwsT "" <| fun () -> SkewBinomialHeap.merge heap1 heap2 |> ignore) + + testPropertyWithConfig config10k "tryMerge returns Some merged heap when both heaps have the same ordering" <| + fun ({ Heap = heap1; Items = orig1 }, { Heap = heap2; Items = orig2 }) -> + heap1.IsDescending = heap2.IsDescending ==> + lazy( + match SkewBinomialHeap.tryMerge heap1 heap2 |> Option.map SkewBinomialHeap.toList with + | Some list -> list = (List.append orig1 orig2 |> sortList heap1) + | None -> false) + + testPropertyWithConfig config10k "tryMerge returns None when both heaps have diferent ordering" <| + fun ({ Heap = heap1; Items = orig1 }, { Heap = heap2; Items = orig2 }) -> + heap1.IsDescending <> heap2.IsDescending ==> lazy(SkewBinomialHeap.tryMerge heap1 heap2 |> Option.isNone) + + testPropertyWithConfig config10k "Cons pattern always match if the heap is not empty" <| + fun { Heap = heap } -> + heap |> SkewBinomialHeap.isEmpty |> not ==> + match heap with + | SkewBinomialHeap.Cons (_, _) -> true + | _ -> false + + testPropertyWithConfig config10k "Nil pattern always match if the heap is empty" <| + fun { Heap = heap } -> + heap |> SkewBinomialHeap.isEmpty ==> + match heap with + | SkewBinomialHeap.Cons (_, _) -> false + | _ -> true + + testPropertyWithConfig config10k "Cons pattern return the same as uncons" <| + fun { Heap = heap } -> + heap |> SkewBinomialHeap.isEmpty |> not ==> + match heap with + | SkewBinomialHeap.Cons (h, t) -> + let (h', t') = heap |> SkewBinomialHeap.uncons + h = h' && t = t' + | _ -> false + + testPropertyWithConfig config10k "GetHashCode is the same for equal heaps" <| + fun { Heap = heap } item -> + let heap1 = heap |> SkewBinomialHeap.insert item |> SkewBinomialHeap.tail + let heap2 = heap |> SkewBinomialHeap.insert item |> SkewBinomialHeap.tail + Unchecked.hash heap1 = Unchecked.hash heap2 + + ////Maybe the distribution of the hash should be checked + ////to avoid bad hashes, I don't know if that should be done as part of unit testPropertyWithConfig config10king + + testPropertyWithConfig config10k "Equality reflexivity" <| + fun { Heap = heap } -> heap = heap + + testPropertyWithConfig config10k "Equality symmetry" <| + fun { Heap = heap } item -> + let heap1 = heap |> SkewBinomialHeap.insert item |> SkewBinomialHeap.tail + let heap2 = heap |> SkewBinomialHeap.insert item |> SkewBinomialHeap.tail + heap1 = heap2 ==> (heap2 = heap1) + + testPropertyWithConfig config10k "Equality transitivity" <| //maybe this is too much, I guess It would be hard to write an Equals that violates this property and not the others + fun { Heap = heap } item -> + let heap1 = heap |> SkewBinomialHeap.insert item |> SkewBinomialHeap.tail + let heap2 = heap |> SkewBinomialHeap.insert item |> SkewBinomialHeap.tail + let heap3 = heap |> SkewBinomialHeap.insert item |> SkewBinomialHeap.tail + (heap1 = heap2 && heap2 = heap3) ==> (heap1 = heap3) + + testPropertyWithConfig config10k "Equals returns false when comparing two heaps with the same ordering but different items" <| + fun ({ Heap = heap1; Items = orig1}, { Heap = heap2; Items = orig2}) -> + (heap1.IsDescending = heap2.IsDescending && orig1 <> orig2) ==> (heap1 <> heap2 && not (heap1.Equals heap2)) + + testPropertyWithConfig config10k "Equals returns false when comparing two heaps with the same items but different ordering" <| + fun { Heap = heap1; Items = orig} -> + let heap2 = ofList (not heap1.IsDescending) orig + heap1 <> heap2 && not (heap1.Equals heap2) + ] \ No newline at end of file diff --git a/tests/FSharpx.Collections.Experimental.Tests/TimeSeriesTest.fs b/tests/FSharpx.Collections.Experimental.Tests/TimeSeriesTest.fs index 90c91845..1e82b4e3 100644 --- a/tests/FSharpx.Collections.Experimental.Tests/TimeSeriesTest.fs +++ b/tests/FSharpx.Collections.Experimental.Tests/TimeSeriesTest.fs @@ -1,210 +1,198 @@ -module FSharpx.Collections.Experimental.Tests.TimeSeriesTest +namespace FSharpx.Collections.Experimental.Tests open System open FSharpx.Collections.Experimental -open NUnit.Framework -open FsUnit - -let startDate = (new DateTimeOffset(2012, 1, 1, 0, 0, 0, TimeSpan.Zero)) -let size = 72 -let granularity = TimeSpan.FromHours(1.) - -[] -let ``I should be able to extract the values from the timeseries at a smaller granularity``() = - let actual = (new Timeseries(startDate, granularity, size)).ToGranularity(TimeSpan.FromMinutes(5.)).AsTimeseries() |> Seq.toList - let expected = Seq.init (72 * 12) (fun i -> startDate.AddMinutes((i |> float) * 5.), 0) |> Seq.toList - actual |> should equal expected - -[] -let ``I should be able to extract the values from the timeseries at a larger granularity``() = - let actual = (new Timeseries(startDate, TimeSpan.FromMinutes(5.), 864)).ToGranularity(TimeSpan.FromHours(1.)).AsTimeseries() |> Seq.toList - let expected = Seq.init 72 (fun i -> startDate.AddMinutes((i |> float) * 60.), 0) |> Seq.toList - actual |> should equal expected - -[] -let ``I can create a timeseries``() = - let actual = new Timeseries(startDate, granularity, size) - let expected = Seq.init 72 (fun _ -> 0) - actual.Buffer.ToArray() |> should equal expected +open Expecto +open Expecto.Flip + +module TimeSeriesTest = + + let startDate = (new DateTimeOffset(2012, 1, 1, 0, 0, 0, TimeSpan.Zero)) + let size = 72 + let granularity = TimeSpan.FromHours(1.) + + [] + let testTimeSeries = + + testList "Experimental TimeSeries" [ + + test "I should be able to extract the values from the timeseries at a smaller granularity" { + let actual = (new Timeseries(startDate, granularity, size)).ToGranularity(TimeSpan.FromMinutes(5.)).AsTimeseries() |> Seq.toList + let expected = Seq.init (72 * 12) (fun i -> startDate.AddMinutes((i |> float) * 5.), 0) |> Seq.toList + actual |> Expect.equal "" expected } + + test "I should be able to extract the values from the timeseries at a larger granularity" { + let actual = (new Timeseries(startDate, TimeSpan.FromMinutes(5.), 864)).ToGranularity(TimeSpan.FromHours(1.)).AsTimeseries() |> Seq.toList + let expected = Seq.init 72 (fun i -> startDate.AddMinutes((i |> float) * 60.), 0) |> Seq.toList + actual |> Expect.equal "" expected } + + test "I can create a timeseries" { + let actual = new Timeseries(startDate, granularity, size) + let expected = Seq.init 72 (fun _ -> 0) + actual.Buffer.ToArray() |> Expect.sequenceEqual "" expected } -[] -let ``I should not be able to advance a timeseries less than one minute``() = - let toDate = startDate.AddSeconds(30.) - let actual = new Timeseries(startDate, granularity, size) - let startDate' = actual.Advance(toDate) - startDate' |> should equal startDate - -[] -let ``I should not be able to advance a timeseries to a past date``() = - let toDate = startDate.AddDays(-1.) - let actual = new Timeseries(startDate, granularity, size) - Assert.Throws(fun _ -> actual.Advance(toDate) |> ignore) |> ignore - -[] -let ``I should be to advance a timeseries to a future date``() = - let toDate = startDate.AddDays(1.) - let actual = new Timeseries(startDate, granularity, Seq.init 72 id) - let expected = - seq { - yield! Seq.init 48 (fun i -> i + 24) - yield! Seq.init 24 (fun _ -> 0) - } - actual.Advance(toDate) |> ignore - actual.StartDate |> should equal toDate - actual.Buffer.Position |> should equal 0 - actual.Buffer.ToArray() |> should equal expected - -[] -let ``I should be able to insert a set of values with the different date and same granularity``() = - let actual = new Timeseries(startDate, granularity, size) - actual.Insert((fun a b -> b), startDate.AddDays(1.), granularity, List.init 10 (fun i -> i + 1)) - let expected = - seq { - yield! Array.zeroCreate 24 - yield! [1..10] - yield! Array.zeroCreate 38 - } - actual.Buffer.ToArray() |> should equal expected - -[] -let ``I should be able to insert a set of values with the different date and smaller granularity``() = - let actual = new Timeseries(startDate, granularity, size) - actual.Insert((fun a b -> b), startDate.AddDays(1.), TimeSpan.FromMinutes(12.), List.init 10 (fun i -> i + 1)) - let expected = - seq { - yield! Array.zeroCreate 24 - yield! [5;10] - yield! Array.zeroCreate 46 - } - actual.Buffer.ToArray() |> should equal expected - -[] -let ``I should be able to insert a set of values with the different date and larger granularity``() = - let actual = new Timeseries(startDate, granularity, size) - actual.Insert((fun a b -> b), startDate.AddDays(1.), TimeSpan.FromHours(2.), List.init 10 (fun i -> i + 1)) - let expected = - seq { - yield! Array.zeroCreate 24 - yield! (List.init 10 (fun i -> [i + 1;i+1])) |> List.concat - yield! Array.zeroCreate 28 - } - actual.Buffer.ToArray() |> should equal expected - -[] -let ``I should be able to insert a set of values with the same date and granularity``() = - let actual = new Timeseries(startDate, granularity, size) - actual.Insert((fun a b -> b), startDate, granularity, List.init 10 (fun i -> i + 1)) - let expected = - seq { - yield! [1..10] - yield! Array.zeroCreate 62 - } - actual.Buffer.ToArray() |> should equal expected - -[] -let ``I should be able to insert a set of values with the same date and smaller granularity``() = - let actual = new Timeseries(startDate, granularity, size) - actual.Insert((fun a b -> b), startDate, TimeSpan.FromMinutes(12.), List.init 10 (fun i -> i + 1)) - let expected = - seq { - yield! [5;10] - yield! Array.zeroCreate 70 - } - actual.Buffer.ToArray() |> should equal expected - -[] -let ``I should be able to insert a set of values with the same date and larger granularity``() = - let actual = new Timeseries(startDate, granularity, size) - actual.Insert((fun a b -> b), startDate, TimeSpan.FromHours(2.), List.init 10 (fun i -> i + 1)) - let expected = - seq { - yield! (List.init 10 (fun i -> [i + 1;i+1])) |> List.concat - yield! Array.zeroCreate 52 - } - actual.Buffer.ToArray() |> should equal expected - -[] -let ``I should be able to insert a set of values with the past date and same granularity``() = - let actual = new Timeseries(startDate, granularity, size) - actual.Insert((fun a b -> b), startDate.AddDays(-1.), granularity, List.init 48 (fun i -> i + 1)) - let expected = - seq { - yield! [25..48] - yield! Array.zeroCreate 48 - } - actual.Buffer.ToArray() |> should equal expected - -[] -let ``I should be able to insert a set of values with the past date and smaller granularity``() = - let actual = new Timeseries(startDate, granularity, size) - actual.Insert((fun a b -> b), startDate.AddDays(-1.), TimeSpan.FromMinutes(12.), List.init 288 (fun i -> i + 1)) - let expected = - seq { - yield! [125..5..285] - yield! Array.zeroCreate 39 - } |> Seq.toList - actual.Buffer.ToArray() |> Seq.toList |> should equal expected - -[] -let ``I should be able to insert a set of values with the past date and larger granularity``() = - let actual = new Timeseries(startDate, granularity, size) - actual.Insert((fun a b -> b), startDate.AddDays(-1.), TimeSpan.FromHours(2.), List.init 24 (fun i -> i + 1)) - let expected = - seq { - yield! (List.init 12 (fun i -> [i + 13; i + 13])) |> List.concat - yield! Array.zeroCreate 48 - } - actual.Buffer.ToArray() |> should equal expected - -[] -let ``I should be able to insert a set of values offset from the timeseries start without wrapping round beyond the timeseries position``() = - let actual = new Timeseries(startDate, granularity, size) - actual.Insert((fun _ b -> b), startDate, granularity, List.init size (fun i -> 1)) - actual.Insert((fun _ b -> b), startDate.AddDays(1.), granularity, List.init (size * 2) (fun i -> 2)) - let expected = - seq { - yield! Array.init 24 (fun i -> 1) - yield! Array.init 48 (fun i -> 2) - } - actual.Buffer.ToArray() |> should equal expected - -[] -let ``I should not be able to insert a set of values offset beyond the timeseries position``() = - let actual = new Timeseries(startDate, granularity, size) - actual.Insert((fun _ b -> b), startDate, granularity, List.init size (fun i -> 1)) - actual.Insert((fun _ b -> b), startDate.AddDays(4.), granularity, List.init (size * 2) (fun i -> 2)) - let expected = - seq { - yield! Array.init size (fun i -> 1) - } - actual.Buffer.ToArray() |> should equal expected - -[] -let ``I should be able to clone a timeseries``() = - let buffer = new Timeseries(startDate, granularity, [|1;2;3;4;5;6;7;8;9;10|]) - let clone = buffer.Clone() - buffer.Buffer.ToArray() |> should equal (clone.Buffer.ToArray()) - clone.Buffer.Advance(2) |> ignore - Assert.AreNotEqual(buffer.Buffer.ToArray(),clone.Buffer.ToArray()) - buffer.Buffer.Position |> should equal 0 - clone.Buffer.Position |> should equal 2 + test "I should not be able to advance a timeseries less than one minute" { + let toDate = startDate.AddSeconds(30.) + let actual = new Timeseries(startDate, granularity, size) + let startDate' = actual.Advance(toDate) + startDate' |> Expect.equal "" startDate } + + test "I should not be able to advance a timeseries to a past date" { + let toDate = startDate.AddDays(-1.) + let actual = new Timeseries(startDate, granularity, size) + Expect.throwsT "" <| fun _ -> actual.Advance(toDate) |> ignore } + + test "I should be to advance a timeseries to a future date" { + let toDate = startDate.AddDays(1.) + let actual = new Timeseries(startDate, granularity, Seq.init 72 id) + let expected = + seq { + yield! Seq.init 48 (fun i -> i + 24) + yield! Seq.init 24 (fun _ -> 0) + } + actual.Advance(toDate) |> ignore + actual.StartDate |> Expect.equal "" toDate + actual.Buffer.Position |> Expect.equal "" 0 + actual.Buffer.ToArray() |> Expect.sequenceEqual "" expected } + + test "I should be able to insert a set of values with the different date and same granularity" { + let actual = new Timeseries(startDate, granularity, size) + actual.Insert((fun a b -> b), startDate.AddDays(1.), granularity, List.init 10 (fun i -> i + 1)) + let expected = + seq { + yield! Array.zeroCreate 24 + yield! [1..10] + yield! Array.zeroCreate 38 + } + actual.Buffer.ToArray() |> Expect.sequenceEqual "" expected } + + test "I should be able to insert a set of values with the different date and smaller granularity" { + let actual = new Timeseries(startDate, granularity, size) + actual.Insert((fun a b -> b), startDate.AddDays(1.), TimeSpan.FromMinutes(12.), List.init 10 (fun i -> i + 1)) + let expected = + seq { + yield! Array.zeroCreate 24 + yield! [5;10] + yield! Array.zeroCreate 46 + } + actual.Buffer.ToArray() |> Expect.sequenceEqual "" expected } + + test "I should be able to insert a set of values with the different date and larger granularity" { + let actual = new Timeseries(startDate, granularity, size) + actual.Insert((fun a b -> b), startDate.AddDays(1.), TimeSpan.FromHours(2.), List.init 10 (fun i -> i + 1)) + let expected = + seq { + yield! Array.zeroCreate 24 + yield! (List.init 10 (fun i -> [i + 1;i+1])) |> List.concat + yield! Array.zeroCreate 28 + } + actual.Buffer.ToArray() |> Expect.sequenceEqual "" expected } + + test "I should be able to insert a set of values with the same date and granularity" { + let actual = new Timeseries(startDate, granularity, size) + actual.Insert((fun a b -> b), startDate, granularity, List.init 10 (fun i -> i + 1)) + let expected = + seq { + yield! [1..10] + yield! Array.zeroCreate 62 + } + actual.Buffer.ToArray() |> Expect.sequenceEqual "" expected } + + test "I should be able to insert a set of values with the same date and smaller granularity" { + let actual = new Timeseries(startDate, granularity, size) + actual.Insert((fun a b -> b), startDate, TimeSpan.FromMinutes(12.), List.init 10 (fun i -> i + 1)) + let expected = + seq { + yield! [5;10] + yield! Array.zeroCreate 70 + } + actual.Buffer.ToArray() |> Expect.sequenceEqual "" expected } + + test "I should be able to insert a set of values with the same date and larger granularity" { + let actual = new Timeseries(startDate, granularity, size) + actual.Insert((fun a b -> b), startDate, TimeSpan.FromHours(2.), List.init 10 (fun i -> i + 1)) + let expected = + seq { + yield! (List.init 10 (fun i -> [i + 1;i+1])) |> List.concat + yield! Array.zeroCreate 52 + } + actual.Buffer.ToArray() |> Expect.sequenceEqual "" expected } + + test "I should be able to insert a set of values with the past date and same granularity" { + let actual = new Timeseries(startDate, granularity, size) + actual.Insert((fun a b -> b), startDate.AddDays(-1.), granularity, List.init 48 (fun i -> i + 1)) + let expected = + seq { + yield! [25..48] + yield! Array.zeroCreate 48 + } + actual.Buffer.ToArray() |> Expect.sequenceEqual "" expected } + + test "I should be able to insert a set of values with the past date and smaller granularity" { + let actual = new Timeseries(startDate, granularity, size) + actual.Insert((fun a b -> b), startDate.AddDays(-1.), TimeSpan.FromMinutes(12.), List.init 288 (fun i -> i + 1)) + let expected = + seq { + yield! [125..5..285] + yield! Array.zeroCreate 39 + } |> Seq.toList + actual.Buffer.ToArray() |> Seq.toList |> Expect.equal "" expected } + + test "I should be able to insert a set of values with the past date and larger granularity" { + let actual = new Timeseries(startDate, granularity, size) + actual.Insert((fun a b -> b), startDate.AddDays(-1.), TimeSpan.FromHours(2.), List.init 24 (fun i -> i + 1)) + let expected = + seq { + yield! (List.init 12 (fun i -> [i + 13; i + 13])) |> List.concat + yield! Array.zeroCreate 48 + } + actual.Buffer.ToArray() |> Expect.sequenceEqual "" expected } + + test "I should be able to insert a set of values offset from the timeseries start without wrapping round beyond the timeseries position" { + let actual = new Timeseries(startDate, granularity, size) + actual.Insert((fun _ b -> b), startDate, granularity, List.init size (fun i -> 1)) + actual.Insert((fun _ b -> b), startDate.AddDays(1.), granularity, List.init (size * 2) (fun i -> 2)) + let expected = + seq { + yield! Array.init 24 (fun i -> 1) + yield! Array.init 48 (fun i -> 2) + } + actual.Buffer.ToArray() |> Expect.sequenceEqual "" expected } + + test "I should not be able to insert a set of values offset beyond the timeseries position" { + let actual = new Timeseries(startDate, granularity, size) + actual.Insert((fun _ b -> b), startDate, granularity, List.init size (fun i -> 1)) + actual.Insert((fun _ b -> b), startDate.AddDays(4.), granularity, List.init (size * 2) (fun i -> 2)) + let expected = + seq { + yield! Array.init size (fun i -> 1) + } + actual.Buffer.ToArray() |> Expect.sequenceEqual "" expected } + + test "I should be able to clone a timeseries" { + let buffer = new Timeseries(startDate, granularity, [|1;2;3;4;5;6;7;8;9;10|]) + let clone = buffer.Clone() + buffer.Buffer.ToArray() |> Expect.equal "" (clone.Buffer.ToArray()) + clone.Buffer.Advance(2) |> ignore + Expect.equal "" (buffer.Buffer.ToArray()) <|clone.Buffer.ToArray() + buffer.Buffer.Position |> Expect.equal "" 0 + clone.Buffer.Position |> Expect.equal "" 2 } -[] -let ``I should be able to create an empty timeseries in the past and extract all values``() = - let actual = new Timeseries>(startDate, granularity, 10) - let expected = - Seq.init 10 (fun i -> startDate.AddHours(i |> float), Nullable()) - actual.AsTimeseries(startDate) |> should equal expected + test "I should be able to create an empty timeseries in the past and extract all values" { + let actual = new Timeseries>(startDate, granularity, 10) + let expected = + Seq.init 10 (fun i -> startDate.AddHours(i |> float), Nullable()) + actual.AsTimeseries(startDate) |> Expect.sequenceEqual "" expected } -[] -let ``I should be able to insert a set of values with a zero offset from the timeseries start applying an operation between existing and new values``() = - let merge op (a:Nullable) (b:Nullable) = - if a.HasValue then - if b.HasValue then Nullable(op a.Value b.Value) else a - else - b - let actual = new Timeseries>(startDate, granularity, 10) - actual.Insert(merge (+), startDate, granularity, [1..10] |> List.map (fun i -> Nullable(float i))) - actual.Insert(merge (+), startDate, granularity, [1..10] |> List.map (fun i -> Nullable(float i))) - let expected = [1..10] |> List.map (fun i -> startDate.AddHours(i - 1 |> float), Nullable(float i * 2.)) - actual.AsTimeseries(startDate) |> should equal expected \ No newline at end of file + test "I should be able to insert a set of values with a zero offset from the timeseries start applying an operation between existing and new values" { + let merge op (a:Nullable) (b:Nullable) = + if a.HasValue then + if b.HasValue then Nullable(op a.Value b.Value) else a + else + b + let actual = new Timeseries>(startDate, granularity, 10) + actual.Insert(merge (+), startDate, granularity, [1..10] |> List.map (fun i -> Nullable(float i))) + actual.Insert(merge (+), startDate, granularity, [1..10] |> List.map (fun i -> Nullable(float i))) + let expected = [1..10] |> List.map (fun i -> startDate.AddHours(i - 1 |> float), Nullable(float i * 2.)) + actual.AsTimeseries(startDate) |> Expect.sequenceEqual "" expected } + ] \ No newline at end of file diff --git a/tests/FSharpx.Collections.Experimental.Tests/app.config b/tests/FSharpx.Collections.Experimental.Tests/app.config deleted file mode 100644 index fa0dece8..00000000 --- a/tests/FSharpx.Collections.Experimental.Tests/app.config +++ /dev/null @@ -1,9 +0,0 @@ - - - - - True - - - - diff --git a/tests/FSharpx.Collections.Experimental.Tests/paket.references b/tests/FSharpx.Collections.Experimental.Tests/paket.references index 6d0ba182..51bf72dc 100644 --- a/tests/FSharpx.Collections.Experimental.Tests/paket.references +++ b/tests/FSharpx.Collections.Experimental.Tests/paket.references @@ -1,4 +1,4 @@ FSharp.Core FsCheck -FsUnit -NUnit +Expecto +Expecto.FsCheck \ No newline at end of file diff --git a/tests/FSharpx.Collections.Tests/ArrayTests.fs b/tests/FSharpx.Collections.Tests/ArrayTests.fs index 7dc43f1f..5431597b 100644 --- a/tests/FSharpx.Collections.Tests/ArrayTests.fs +++ b/tests/FSharpx.Collections.Tests/ArrayTests.fs @@ -1,48 +1,49 @@ -module FSharpx.Collections.Tests.ArrayTests +namespace FSharpx.Collections.Tests open FSharpx.Collections -open NUnit.Framework -open FsUnit - -[] -let ``I should be able to part of an array to a target array``() = - let a, b = [|1;2;3;4;5|], [|10;11;12;13;14|] - (Array.copyTo 0 2 a b) - b |> should equal [|10;11;1;2;3|] - -[] -let ``I should be able to convert a tuple to an array``() = - (1,2) |> Array.ofTuple - |> should equal [|1;2|] - -[] -let ``I should be able to convert an array to a tuple``() = - let result : (int*int) = [|1;2|] |> Array.toTuple - result |> should equal (1,2) - -let data = [|1.;2.;3.;4.;5.;6.;7.;8.;9.;10.|] - -[] -let ``I should be able to create a centered window from a seq``() = - let result = Array.centeredWindow 3 data - result |> should equal [| - [|1;2;3;4|] - [|1;2;3;4;5|] - [|1;2;3;4;5;6|] - [|1;2;3;4;5;6;7|] - [|2;3;4;5;6;7;8|] - [|3;4;5;6;7;8;9|] - [|4;5;6;7;8;9;10|] - [|5;6;7;8;9;10|] - [|6;7;8;9;10|] - [|7;8;9;10|] - |] - -[] -let ``I should be able to compute the central moving average of a seq``() = - let result = Array.centralMovingAverage 3 data |> Seq.toList - result |> should equal [| - 2.5; 3.; 3.5; 4.; - 5.; 6.; 7.; - 7.5; 8.; 8.5 - |] \ No newline at end of file +open Expecto +open Expecto.Flip + +module ArrayTests = + + let data = [|1.;2.;3.;4.;5.;6.;7.;8.;9.;10.|] + + [] + let testArray = + testList "Array" [ + test "I should be able to part of an array to a target array" { + let a, b = [|1;2;3;4;5|], [|10;11;12;13;14|] + Array.copyTo 0 2 a b + Expect.equal "expect arrays equal" [|10;11;1;2;3|] b } + + test "I should be able to convert a tuple to an array" { + (1,2) |> Array.ofTuple + |> (Expect.equal "expect arrays equal" [|1;2|]) } + + test "I should be able to convert an array to a tuple" { + let result : (int*int) = [|1;2|] |> Array.toTuple + Expect.equal "expect tuples equal" (1,2) result } + + test "I should be able to create a centered window from a seq" { + let expected = [| + [|1.;2.;3.;4.|] + [|1.;2.;3.;4.;5.|] + [|1.;2.;3.;4.;5.;6.|] + [|1.;2.;3.;4.;5.;6.;7.|] + [|2.;3.;4.;5.;6.;7.;8.|] + [|3.;4.;5.;6.;7.;8.;9.|] + [|4.;5.;6.;7.;8.;9.;10.|] + [|5.;6.;7.;8.;9.;10.|] + [|6.;7.;8.;9.;10.|] + [|7.;8.;9.;10.|] + |] + Expect.equal "expect arrays equal" expected <|Array.centeredWindow 3 data } + + test "I should be able to compute the central moving average of a seq" { + let expected = [| + 2.5; 3.; 3.5; 4.; + 5.; 6.; 7.; + 7.5; 8.; 8.5 + |] + Expect.equal "expect arrays equal" expected <| Array.centralMovingAverage 3 data } + ] diff --git a/tests/FSharpx.Collections.Tests/ByteStringTest.fs b/tests/FSharpx.Collections.Tests/ByteStringTest.fs index 33954304..f1dfbc64 100644 --- a/tests/FSharpx.Collections.Tests/ByteStringTest.fs +++ b/tests/FSharpx.Collections.Tests/ByteStringTest.fs @@ -1,144 +1,122 @@ -module FSharpx.Collections.Tests.ByteStringTest +namespace FSharpx.Collections.Tests open System -open FSharpx open FSharpx.Collections -open FSharpx.Collections.ByteString -open NUnit.Framework -open FsUnit - -type BS = ByteString - -let comparisonTests = [| - [| box (create ""B); box (create ""B); box 0 |] - [| box (create "a"B); box (create "a"B); box 0 |] - [| box (create "a"B); box (create "b"B); box -1 |] - [| box (create "b"B); box (create "a"B); box 1 |] -|] +open Expecto +open Expecto.Flip + +module ByteStringTests = + type BS = ByteString + + let comparisonTests = [| + [| box (ByteString.create ""B); box (ByteString.create ""B); box 0 |] + [| box (ByteString.create "a"B); box (ByteString.create "a"B); box 0 |] + [| box (ByteString.create "a"B); box (ByteString.create "b"B); box -1 |] + [| box (ByteString.create "b"B); box (ByteString.create "a"B); box 1 |] + |] -[] -[] -let ``test ByteString comparison should correctly return -1, 0, or 1``(left:BS, right:BS, result:int) = - BS.Compare(left, right) |> should equal result - -[] -let ``test ByteString_length should return the length of the byte string``() = - let input = create "Hello, world!"B - let actual = length input - actual |> should equal 13 - -let spanAndSplitTests = [| - [| box "Howdy! Want to play?"B; box ' 'B; box 6 |] - [| box "Howdy! Want to play?"B; box '?'B; box 19 |] - [| box "Howdy! Want to play?"B; box '\r'B; box 20 |] -|] - -[] -[] -let ``test ByteString_span correctly breaks the ByteString on the specified predicate``(input:byte [], breakChar:byte, breakIndex:int) = - let str = create input - let expected = if input.Length = breakIndex then str, empty - else BS(input, 0, breakIndex), BS(input, breakIndex, input.Length - breakIndex) - let actual = span ((<>) breakChar) str - actual |> should equal expected - -[] -[] -let ``test ByteString_split correctly breaks the ByteString on the specified predicate``(input:byte [], breakChar:byte, breakIndex:int) = - let str = create input - let expected = if input.Length = breakIndex then str, empty - else BS(input, 0, breakIndex), BS(input, breakIndex, input.Length - breakIndex) - let actual = split ((=) breakChar) str - actual |> should equal expected - -[] -let ``test ByteString_span correctly breaks the ByteString on \r``() = - let input = "test\r\ntest"B - let str = create input - let expected = BS(input, 0, 4), BS(input, 4, 6) - let actual = span (fun c -> c <> '\r'B && c <> '\n'B) str - actual |> should equal expected - -[] -let ``test ByteString_split correctly breaks the ByteString on \r``() = - let input = "test\r\ntest"B - let str = create input - let expected = BS(input, 0, 4), BS(input, 4, 6) - let actual = split (fun c -> c = '\r'B || c = '\n'B) str - actual |> should equal expected - -[] -let ``test ByteString_splitAt correctly breaks the ByteString on the specified index``() = - let input = "Howdy! Want to play?"B - let str = create input - let expected = BS(input, 0, 6), BS(input, 6, 14) - let actual = splitAt 6 str - actual |> should equal expected - -[] -let ``test ByteString_fold should concatenate bytes into a string``() = - create "Howdy"B - |> fold (fun a b -> a + (char b).ToString()) "" - |> should equal "Howdy" - -[] -let ``test ByteString_take correctly truncates the ByteString at the selected index``() = - let input = "Howdy! Want to play?"B - let str = create input - let expected = BS(input, 0, 6) - let actual = take 6 str - actual |> should equal expected - -[] -[] -let ``test drop should drop the first n items``([] x) = - let input = "Howdy! Want to play?"B - let actual = skip 7 (create input) - actual |> should equal (BS(input,7,13)) - -[] -let ``test dropWhile should drop anything before the first space``() = - let input = create "Howdy! Want to play?"B - let dropWhile2Head = skipWhile ((<>) ' 'B) >> head - let actual = dropWhile2Head input - actual |> should equal ' 'B - -[] -let ``test take should return an empty ArraySegment when asked to take 0``() = - let actual = take 0 (create "Nothing should be taken"B) - actual |> should equal empty - -[] -let ``test take should return an empty ArraySegment when given an empty ArraySegment``() = - let actual = take 4 empty - actual |> should equal empty - -[] -[] -let ``test take should take the first n items``([] x) = - let input = [|0uy..9uy|] - let expected = BS(input,0,x) - let actual = take x (create input) - actual |> should equal expected - -[] -let ``test takeWhile should return an empty ArraySegment when given an empty ArraySegment``() = - let actual = takeWhile ((<>) ' 'B) empty - actual |> should equal empty - -[] -let ``test takeWhile should take anything before the first space``() = - let input = "Hello world"B - let actual = takeWhile ((<>) ' 'B) (create input) - actual |> should equal (BS(input, 0, 5)) - -[] -let ``test takeUntil should return an empty ArraySegment when given an empty ArraySegment``() = - let actual = takeUntil ((=) ' 'B) empty - actual |> should equal empty - -[] -let ``test takeUntil should correctly split the input``() = - let input = "abcde"B - let actual = takeUntil ((=) 'c'B) (create input) - actual |> should equal (BS(input, 0, 2)) + let spanAndSplitTests = [| + [| box "Howdy! Want to play?"B; box ' 'B; box 6 |] + [| box "Howdy! Want to play?"B; box '?'B; box 19 |] + [| box "Howdy! Want to play?"B; box '\r'B; box 20 |] + |] + + [] + let testByteString = + testList "ByteString" [ + test "test ByteString comparison should correctly return -1, 0, or 1" { + comparisonTests + |> Array.iter (fun x -> BS.Compare(unbox x.[0], unbox x.[1]) |> (Expect.equal "comparison" <| unbox x.[2]) ) } + + test "test ByteString_length should return the length of the byte string" { + let input = ByteString.create "Hello, world!"B + Expect.equal "length" 13 <| ByteString.length input } + + test "test ByteString_span correctly breaks the ByteString on the specified predicate" { + spanAndSplitTests + |> Array.iter (fun x -> + let input = unbox x.[0] + let breakChar = unbox x.[1] + let breakIndex = unbox x.[2] + let str = ByteString.create input + let expected = if input.Length = breakIndex then str, ByteString.empty + else BS(input, 0, breakIndex), BS(input, breakIndex, input.Length - breakIndex) + Expect.equal "ByteString * ByteString" expected <| ByteString.span ((<>) breakChar) str ) } + + test "test ByteString_split correctly breaks the ByteString on the specified predicate" { + spanAndSplitTests + |> Array.iter (fun x -> + let input = unbox x.[0] + let breakChar = unbox x.[1] + let breakIndex = unbox x.[2] + let str = ByteString.create input + let expected = if input.Length = breakIndex then str, ByteString.empty + else BS(input, 0, breakIndex), BS(input, breakIndex, input.Length - breakIndex) + Expect.equal "ByteString * ByteString" expected <| ByteString.split ((=) breakChar) str ) } + + test "test ByteString_span correctly breaks the ByteString on \r" { + let input = "test\r\ntest"B + let str = ByteString.create input + let expected = BS(input, 0, 4), BS(input, 4, 6) + Expect.equal "ByteString * ByteString" expected <| ByteString.span (fun c -> c <> '\r'B && c <> '\n'B) str } + + test "test ByteString_split correctly breaks the ByteString on \r" { + let input = "test\r\ntest"B + let str = ByteString.create input + let expected = BS(input, 0, 4), BS(input, 4, 6) + Expect.equal "ByteString * ByteString" expected <| ByteString.split (fun c -> c = '\r'B || c = '\n'B) str } + + test "test ByteString_splitAt correctly breaks the ByteString on the specified index" { + let input = "Howdy! Want to play?"B + let str = ByteString.create input + let expected = BS(input, 0, 6), BS(input, 6, 14) + Expect.equal "ByteString * ByteString" expected <| ByteString.splitAt 6 str } + + test "test ByteString_fold should concatenate bytes into a string" { + Expect.equal "string" "Howdy" + <| (ByteString.create "Howdy"B + |> ByteString.fold (fun a b -> a + (char b).ToString()) "" ) } + + test "test ByteString_take correctly truncates the ByteString at the selected index" { + let input = "Howdy! Want to play?"B + let str = ByteString.create input + let expected = BS(input, 0, 6) + Expect.equal "ByteString" expected <| ByteString.take 6 str } + + + test "test drop should drop the first n items" { + let input = "Howdy! Want to play?"B + Expect.equal "ByteString" (BS(input,7,13)) <|ByteString. skip 7 (ByteString.create input) } + + test "test dropWhile should drop anything before the first space" { + let input = ByteString.create "Howdy! Want to play?"B + let dropWhile2Head = ByteString.skipWhile ((<>) ' 'B) >> ByteString.head + Expect.equal "Byte" ' 'B <| dropWhile2Head input } + + test "test take should return an empty ArraySegment when asked to take 0" { + Expect.equal "empty ByteString" ByteString.empty <| ByteString.take 0 (ByteString.create "Nothing should be taken"B) } + + test "test take should return an empty ArraySegment when given an empty ArraySegment" { + Expect.equal "empty ByteString" ByteString.empty <| ByteString.take 4 ByteString.empty } + + test "test take should take the first n items" { + let input = [|0uy..9uy|] + + [1;2;3;4;5;6;7;8;9;10] + |> List.iter (fun x -> + Expect.equal "ByteString" (BS(input,0,x)) <| ByteString.take x (ByteString.create input) ) } + + test "test takeWhile should return an empty ArraySegment when given an empty ArraySegment" { + Expect.equal "empty ByteString" ByteString.empty <| ByteString.takeWhile ((<>) ' 'B) ByteString.empty } + + test "test takeWhile should take anything before the first space" { + let input = "Hello world"B + Expect.equal "ByteString" (BS(input, 0, 5)) <| (ByteString.takeWhile ((<>) ' 'B) (ByteString.create input)) } + + test "test takeUntil should return an empty ArraySegment when given an empty ArraySegment" { + Expect.equal "empty ByteString" ByteString.empty <| ByteString.takeUntil ((=) ' 'B) ByteString.empty } + + test "test takeUntil should correctly split the input" { + let input = "abcde"B + Expect.equal "ByteString" (BS(input, 0, 2)) <| ByteString.takeUntil ((=) 'c'B) (ByteString.create input) } + ] \ No newline at end of file diff --git a/tests/FSharpx.Collections.Tests/ColllectionTests.fs b/tests/FSharpx.Collections.Tests/ColllectionTests.fs deleted file mode 100644 index a74b471f..00000000 --- a/tests/FSharpx.Collections.Tests/ColllectionTests.fs +++ /dev/null @@ -1,202 +0,0 @@ -namespace FSharpx.Collections.Tests - -open Microsoft.FSharp.Collections -open NUnit.Framework -open FSharpx.Collections.Tests - -[] -type public ResizeArrayTests() = - - [] - member this.BasicTests() = - let rng = System.Random() - let ra = ResizeArray.ofList - let (=?) a b = ResizeArray.toList a = b - - test "ra_exists2_a" <| ResizeArray.exists2 (=) - (ra [1; 2; 3; 4; 5; 6]) - (ra [2; 3; 4; 5; 6; 6]) - - test "exists2_b" <| not (ResizeArray.exists2 (=) - (ra [1; 2; 3; 4; 5; 6]) - (ra [2; 3; 4; 5; 6; 7])) - - test "ra_findIndex_a" - (ResizeArray.findIndex (fun i -> i >= 4) (ra [0..10]) = 4) - - test "ra_findIndex_b" - (try ResizeArray.findIndex (fun i -> i >= 20) (ra [0..10]) |> ignore; false - with _ -> true) - - test "ra_find_indexi_a" - (ResizeArray.findIndexi (=) (ra [1; 2; 3; 3; 2; 1]) = 3) - - test "ra_find_indexi_b" - (try ResizeArray.findIndexi (=) (ra [1..10]) |> ignore; false - with _ -> true) - - test "ra_forall2_a" - (ResizeArray.forall2 (=) (ra [1..10]) (ra [1..10])) - - test "ra_forall2_b" <| not - (ResizeArray.forall2 (=) (ra [1;2;3;4;5]) (ra [1;2;3;0;5])) - - test "ra_isEmpty_a" - (ResizeArray.isEmpty (ra [])) - - test "ra_isEmpty_b" <| not - (ResizeArray.isEmpty (ra [1; 2])) - - test "ra_mapi2" - (ResizeArray.mapi2 (fun i j k -> i+j+k) (ra [1..10]) (ra [1..10]) =? [2..+3..29]) - - test "ra_mapi2_b" - (try ResizeArray.mapi2 (fun i j k -> i+j+k) (ra []) (ra [1..10]) |> ignore; false - with _ -> true) - - let c = ref 0 - ResizeArray.iteri2 (fun i j k -> c := !c+i+j+k) (ra [1;2;3]) (ra [10;20;30]) - test "ra_iteri2" (!c = 6+60+3) - - test "ra_singleton" - (ResizeArray.singleton 42 =? [42]) - - test "ra_zip" - (ResizeArray.zip (ra [1..10]) (ra [1..10]) =? [for i in 1..10 -> i, i]) - - let unzip1, unzip2 = ResizeArray.unzip <| ra [for i in 1..10 -> i, i+1] - test "ra_unzip" (unzip1 =? [1..10] && unzip2 =? [2..11]) - - test "ra_reduce_left" - (ResizeArray.reduce (+) (ra [2;2;2;2]) = 8) - - test "ra_reduce_right" - (ResizeArray.reduceBack (+) (ra [2;2;2;2]) = 8) - - test "ra_fold2" - (ResizeArray.fold2 (fun i j k -> i+j+k) 100 (ra [1;2;3]) (ra [1;2;3]) = 112) - - test "ra_fold2_b" - (ResizeArray.fold2 (fun i j k -> i-j-k) 100 (ra [1;2;3]) (ra [1;2;3]) = 100-12) - - test "ra_foldBack2" - (ResizeArray.foldBack2 (fun i j k -> i+j+k) (ra [1;2;3]) (ra [1;2;3]) 100 = 112) - - test "ra_foldBack2_b" - (ResizeArray.foldBack2 (fun i j k -> k-i-j) (ra [1;2;3]) (ra [1;2;3]) 100 = 100-12) - - test "ra_scan" - (ResizeArray.scan (+) 0 (ra [1..5]) =? [0; 1; 3; 6; 10; 15]) - - test "ra_scanBack" - (ResizeArray.scanBack (+) (ra [1..5]) 0 =? [15; 14; 12; 9; 5; 0]) - - test "ra_tryfind_index" - (ResizeArray.tryFindIndex (fun x -> x = 4) (ra [0..10]) = Some 4) - - test "ra_tryfind_index_b" - (ResizeArray.tryFindIndex (fun x -> x = 42) (ra [0..10]) = None) - - test "ra_tryfind_indexi" - (ResizeArray.tryFindIndexi (=) (ra [1;2;3;4;4;3;2;1]) = Some 4) - - test "ra_tryfind_indexi_b" - (ResizeArray.tryFindIndexi (=) (ra [1..10]) = None) - - c := -1 - ResizeArray.iter (fun x -> incr c; test "ra_iter" (x = !c)) (ra [0..100]) - test "ra_iter" (!c = 100) - - test "ra_map" - (ra [1..100] |> ResizeArray.map ((+) 1) =? [2..101]) - - test "ra_mapi" - (ra [0..100] |> ResizeArray.mapi (+) =? [0..+2..200]) - - c := -1 - ResizeArray.iteri (fun i x -> incr c; test "ra_iteri" (x = !c && i = !c)) (ra [0..100]) - test "ra_iteri" (!c = 100) - - test "ra_exists" - (ra [1..100] |> ResizeArray.exists ((=) 50)) - - test "ra_exists b" <| not - (ra [1..100] |> ResizeArray.exists ((=) 150)) - - test "ra_forall" - (ra [1..100] |> ResizeArray.forall (fun x -> x < 150)) - - test "ra_forall b" <| not - (ra [1..100] |> ResizeArray.forall (fun x -> x < 80)) - - test "ra_find" - (ra [1..100] |> ResizeArray.find (fun x -> x > 50) = 51) - - test "ra_find b" - (try ra [1..100] |> ResizeArray.find (fun x -> x > 180) |> ignore; false - with _ -> true) - - test "ra_first" - (ra [1..100] |> ResizeArray.tryPick (fun x -> if x > 50 then Some (x*x) else None) = Some (51*51)) - - test "ra_first b" - (ra [1..100] |> ResizeArray.tryPick (fun x -> None) = None) - - test "ra_first c" - (ra [] |> ResizeArray.tryPick (fun _ -> Some 42) = None) - - test "ra_tryfind" - (ra [1..100] |> ResizeArray.tryFind (fun x -> x > 50) = Some 51) - - test "ra_tryfind b" - (ra [1..100] |> ResizeArray.tryFind (fun x -> x > 180) = None) - - c := -1 - ResizeArray.iter2 (fun x y -> incr c; test "ra_iter2" (!c = x && !c = y)) (ra [0..100]) (ra [0..100]) - test "ra_iter2" (!c = 100) - - test "ra_map2" - (ResizeArray.map2 (+) (ra [0..100]) (ra [0..100]) =? [0..+2..200]) - - test "ra_choose" - (ResizeArray.choose (fun x -> if x % 2 = 0 then Some (x/2) else None) (ra [0..100]) =? [0..50]) - - test "ra_filter" - (ResizeArray.filter (fun x -> x % 2 = 0) (ra [0..100]) =? [0..+2..100]) - - test "ra_filter b" - (ResizeArray.filter (fun x -> false) (ra [0..100]) =? []) - - test "ra_filter c" - (ResizeArray.filter (fun x -> true) (ra [0..100]) =? [0..100]) - - let p1, p2 = ResizeArray.partition (fun x -> x % 2 = 0) (ra [0..100]) - test "ra_partition" - (p1 =? [0..+2..100] && p2 =? [1..+2..100]) - - test "ra_rev" - (ResizeArray.rev (ra [0..100]) =? [100..-1 ..0]) - - test "ra_rev b" - (ResizeArray.rev (ra [1]) =? [1]) - - test "ra_rev c" - (ResizeArray.rev (ra []) =? []) - - test "ra_rev d" - (ResizeArray.rev (ra [1; 2]) =? [2; 1]) - - test "ra_concat ra ra" - (ResizeArray.concat (ra [ra [1; 2]; ra [3]; ra [4; 5; 6;]; ra []; ra [7]]) =? [1; 2; 3; 4; 5; 6; 7]) - - test "ra_concat list ra" - (ResizeArray.concat [ra [1; 2]; ra [3]; ra [4; 5; 6;]; ra []; ra [7]] =? [1; 2; 3; 4; 5; 6; 7]) - - test "ra_concat concat" - (ResizeArray.concat (ra [ra [1; 2]; ra [3]; ra [4; 5; 6;]; ra []; ra [7]]) =? (ResizeArray.concat (Seq.ofList[ra [1; 2]; ra [3]; ra [4; 5; 6;]; ra []; ra [7]]) |> List.ofSeq)) - - test "ra_distinct a" - (let ar = [for i=1 to 100 do yield rng.Next(0,10)] in (ar |> Seq.distinct |> Seq.toArray) = (ar |> ra |> ResizeArray.distinct |> ResizeArray.toArray)) - - test "ra_distinctBy a" - (let ar = [for i=1 to 100 do yield rng.Next(0,10),rng.Next(0,10)] in (ar |> Seq.distinctBy(fun (x,_) -> x) |> Seq.toArray) = (ar |> ra |> ResizeArray.distinctBy(fun (x,_) -> x) |> ResizeArray.toArray)) \ No newline at end of file diff --git a/tests/FSharpx.Collections.Tests/DListTest.fs b/tests/FSharpx.Collections.Tests/DListTest.fs index 5effcfe8..dfebe531 100644 --- a/tests/FSharpx.Collections.Tests/DListTest.fs +++ b/tests/FSharpx.Collections.Tests/DListTest.fs @@ -1,293 +1,270 @@ -module FSharpx.Collections.Tests.DListTest +namespace FSharpx.Collections.Tests open System open FSharpx.Collections -open FSharpx.Collections.DList -open FSharpx.Collections.Tests.Properties -open NUnit.Framework +open Properties +open Expecto +open Expecto.Flip open FsCheck -open FsCheck.NUnit -open FsUnit -let emptyDList = DList.empty +module DListTests = + + [] + let testDList = -let enDListThruList l q = - let rec loop (q' : 'a DList) (l' : 'a list) = - match l' with - | hd :: [] -> q'.Conj hd - | hd :: tl -> loop (q'.Conj hd) tl - | [] -> q' - - loop q l - -//DList -(* -non-IDList generators from random ofList -*) -let DListOfListGen = - gen { let! n = Gen.length2thru12 - let! x = Gen.listInt n - return ( (DList.ofSeq x), x) } - -(* -IDList generators from random ofSeq and/or conj elements from random list -*) -let DListIntGen = - gen { let! n = Gen.length1thru12 - let! n2 = Gen.length2thru12 - let! x = Gen.listInt n - let! y = Gen.listInt n2 - return ( (DList.ofSeq x |> enDListThruList y), (x @ y) ) } - -let DListIntOfSeqGen = - gen { let! n = Gen.length1thru12 - let! x = Gen.listInt n - return ( (DList.ofSeq x), x) } - -let DListIntConjGen = - gen { let! n = Gen.length1thru12 - let! x = Gen.listInt n - return ( (DList.empty |> enDListThruList x), x) } - -let DListObjGen = - gen { let! n = Gen.length2thru12 - let! n2 = Gen.length1thru12 - let! x = Gen.listObj n - let! y = Gen.listObj n2 - return ( (DList.ofSeq x |> enDListThruList y), (x @ y) ) } - -let DListStringGen = - gen { let! n = Gen.length1thru12 - let! n2 = Gen.length2thru12 - let! x = Gen.listString n - let! y = Gen.listString n2 - return ( (DList.ofSeq x |> enDListThruList y), (x @ y) ) } - -// NUnit TestCaseSource does not understand array of tuples at runtime -let intGens start = - let v = Array.create 3 (box (DListIntGen, "DList")) - v.[1] <- box ((DListIntOfSeqGen |> Gen.suchThat (fun (q, l) -> l.Length >= start)), "DList OfSeq") - v.[2] <- box ((DListIntConjGen |> Gen.suchThat (fun (q, l) -> l.Length >= start)), "DList conjDList") - v - -let intGensStart1 = - intGens 1 //this will accept all - -let intGensStart2 = - intGens 2 // this will accept 11 out of 12 - -[] -let ``allow to tail to work``() = - emptyDList |> conj 1 |> tail |> isEmpty |> should equal true - -[] -let ``conj to work``() = - emptyDList |> conj 1 |> conj 2 |> isEmpty |> should equal false - -[] -let ``cons to work``() = - emptyDList |> cons 1 |> cons 2 |> length |> should equal 2 - -[] -let ``allow to cons and conj to work``() = - emptyDList |> cons 1 |> cons 2 |> conj 3 |> length |> should equal 3 - -[] -let ``cons pattern discriminator - DList``() = - let q = ofSeq ["f";"e";"d";"c";"b";"a"] + let emptyDList = DList.empty + + testList "DList" [ + test "allow to DList.tail to work" { + Expect.isTrue "DList.conj DList.tail" (emptyDList |> DList.conj 1 |> DList.tail |> DList.isEmpty) } + + test "DList.conj to work" { + Expect.isFalse "DList.conj length" (emptyDList |> DList.conj 1 |> DList.conj 2 |> DList.isEmpty) } + + test "DList.cons to work" { + Expect.equal "DList.cons length" 2 (emptyDList |> DList.cons 1 |> DList.cons 2 |> DList.length) } + + test "allow to DList.cons and DList.conj to work" { + Expect.equal "DList.cons DList.conj length" 3 (emptyDList |> DList.cons 1 |> DList.cons 2 |> DList.conj 3 |> DList.length) } + + test "DList.cons pattern discriminator - DList" { + let q = DList.ofSeq ["f";"e";"d";"c";"b";"a"] - let h1, t1 = - match q with - | Cons(h, t) -> h, t - | _ -> "x", q + let h1, t1 = + match q with + | DList.Cons(h, t) -> h, t + | _ -> "x", q - ((h1 = "f") && (t1.Length = 5)) |> should equal true + Expect.isTrue "DList.cons pattern discriminator" ((h1 = "f") && (t1.Length = 5)) } -[] -let ``empty DList should be empty``() = - emptyDList |> isEmpty |> should equal true + test "empty DList should be empty" { + Expect.isTrue "empty" (emptyDList |> DList.isEmpty) } -[] -let ``fail if there is no head in the DList``() = - (fun () -> emptyDList |> head |> ignore) |> should throw typeof + test "fail if there is no DList.head in the DList" { + Expect.throwsT "empty DList.head" (fun () -> emptyDList |> DList.head |> ignore) } -[] -let ``fail if there is no tail in the DList``() = - (fun () -> emptyDList |> tail |> ignore) |> should throw typeof + test "fail if there is no DList.tail in the DList" { + Expect.throwsT "no DList.tail" (fun () -> emptyDList |> DList.tail |> ignore) } -[] -let ``fold matches build list rev``() = + test "foldBack matches build list 2" { + let q = DList.ofSeq ["f";"e";"d";"c";"b";"a"] + let lq = DList.foldBack (fun (elem : string) (l' : string list) -> elem::l') q [] + Expect.equal "foldBack" (DList.toList q) lq } - fsCheck "DList" (Prop.forAll (Arb.fromGen DListIntGen) - (fun ((q :DList), (l : int list)) -> q |> fold (fun (l' : int list) (elem : int) -> elem::l') [] = (List.rev l) )) - - fsCheck "DList OfSeq" (Prop.forAll (Arb.fromGen DListIntOfSeqGen) - (fun ((q :DList), (l : int list)) -> q |> fold (fun (l' : int list) (elem : int) -> elem::l') [] = (List.rev l) )) + test "fold matches build list rev 2" { + let q = DList.ofSeq ["f";"e";"d";"c";"b";"a"] + let lq = DList.fold (fun (l' : string list) (elem : string) -> elem::l') [] q + Expect.equal "fold rev" (List.rev <| DList.toList q) lq } + + test "give None if there is no DList.head in the DList" { + Expect.isNone "DList.tryHead" (emptyDList |> DList.tryHead) } + + test "give None if there is no DList.tail in the DList" { + Expect.isNone "tryTail" (emptyDList |> DList.tryTail) } + + test "TryUncons wind-down to None" { + let q = DList.ofSeq ["f";"e";"d";"c";"b";"a"] + + let rec loop (q' : DList) = + match (q'.TryUncons) with + | Some(hd, tl) -> loop tl + | None -> None + + Expect.isNone "TryUncons" <| loop q } + + test "Uncons wind-down to None" { + let q = DList.ofSeq ["f";"e";"d";"c";"b";"a"] + + let rec loop (q' : DList) = + match (q'.Uncons) with + | hd, tl when tl.IsEmpty -> true + | hd, tl -> loop tl + + Expect.isTrue "Uncons" <| loop q } + + test "test length should return 6" { + let q = DList.ofSeq ["f";"e";"d";"c";"b";"a"] + Expect.equal "length" 6 <| DList.length q } + + test "singleton length 1" { + Expect.equal "singleton length" 1 (DList.singleton 1 |> DList.length) } + + test "empty length 0" { + Expect.equal "empty length" 0 (DList.empty |> DList.length) } + + test "test ofSeq should create a DList from a list" { + let test = [ for i in 0..4 -> i ] + Expect.sequenceEqual "ofSeq" (List.toSeq test) (DList.ofSeq test |> DList.toSeq) } + + test "test ofSeq should create a DList from an array" { + let test = [| for i in 0..4 -> i |] + Expect.sequenceEqual "ofSeq from Array" (Array.toSeq test) (DList.ofSeq test |> DList.toSeq) } + + test "test singleton should return a Unit containing the solo value" { + Expect.equal "singleton" 1 (DList.singleton 1 |> DList.head) } - fsCheck "DList Conj" (Prop.forAll (Arb.fromGen DListIntConjGen) - (fun ((q :DList), (l : int list)) -> q |> fold (fun (l' : int list) (elem : int) -> elem::l') [] = (List.rev l) )) + test "test append should join two DLists together" { + let q = DList.ofSeq ["f";"e";"d";"c";"b";"a"] + let q2 = DList.ofSeq ["1";"2";"3";"4";"5";"6"] + let q3 = DList.append q q2 + Expect.equal "append" 12 (q3 |> DList.length) + Expect.equal "append" "f" (q3 |> DList.head) } -[] -let ``foldBack matches build list``() = + test "test toSeq" { + let q = DList.ofSeq ["f";"e";"d";"c";"b";"a"] + Expect.equal "toSeq" ["f";"e";"d";"c";"b";"a"] <| List.ofSeq (DList.toSeq q) } - fsCheck "DList" (Prop.forAll (Arb.fromGen DListIntGen) - (fun ((q :DList), (l : int list)) -> foldBack (fun (elem : int) (l' : int list) -> elem::l') q [] = l )) + test "test toList" { + let l = ["f";"e";"d";"c";"b";"a"] + let q = DList.ofSeq l + Expect.equal "toList" l <| DList.toList q } + + test "structural equality" { + let l1 = DList.ofSeq [1..100] + let l2 = DList.ofSeq [1..100] + + Expect.sequenceEqual "structural equality" l1 l2 + + let l3 = DList.ofSeq [1..99] |> DList.conj 7 + + Expect.isFalse "structural equality" (l1 = l3) } + ] + + [] + let propertyTestDList = + + let enDListThruList l q = + let rec loop (q' : 'a DList) (l' : 'a list) = + match l' with + | hd :: [] -> q'.Conj hd + | hd :: tl -> loop (q'.Conj hd) tl + | [] -> q' + + loop q l + + //DList + (* + non-IDList generators from random ofList + *) + let DListOfListGen = + gen { let! n = Gen.length2thru12 + let! x = Gen.listInt n + return ( (DList.ofSeq x), x) } + + (* + IDList generators from random ofSeq and/or DList.conj elements from random list + *) + let DListIntGen = + gen { let! n = Gen.length1thru12 + let! n2 = Gen.length2thru12 + let! x = Gen.listInt n + let! y = Gen.listInt n2 + return ( (DList.ofSeq x |> enDListThruList y), (x @ y) ) } + + let DListIntOfSeqGen = + gen { let! n = Gen.length1thru12 + let! x = Gen.listInt n + return ( (DList.ofSeq x), x) } + + let DListIntConjGen = + gen { let! n = Gen.length1thru12 + let! x = Gen.listInt n + return ( (DList.empty |> enDListThruList x), x) } + + let DListObjGen = + gen { let! n = Gen.length2thru12 + let! n2 = Gen.length1thru12 + let! x = Gen.listObj n + let! y = Gen.listObj n2 + return ( (DList.ofSeq x |> enDListThruList y), (x @ y) ) } + + let DListStringGen = + gen { let! n = Gen.length1thru12 + let! n2 = Gen.length2thru12 + let! x = Gen.listString n + let! y = Gen.listString n2 + return ( (DList.ofSeq x |> enDListThruList y), (x @ y) ) } + + let intGens start = + let v = Array.create 3 DListIntGen + v.[1] <- DListIntOfSeqGen |> Gen.filter (fun (q, l) -> l.Length >= start) + v.[2] <- DListIntConjGen |> Gen.filter (fun (q, l) -> l.Length >= start) + v + + let intGensStart1 = + intGens 1 //this will accept all + + let intGensStart2 = + intGens 2 // this will accept 11 out of 12 + + testList "DList property tests" [ + + testPropertyWithConfig config10k "DList fold matches build list rev" (Prop.forAll (Arb.fromGen DListIntGen) <| + fun (q, l) -> q |> DList.fold (fun l' elem -> elem::l') [] = List.rev l ) - fsCheck "DList OfSeq" (Prop.forAll (Arb.fromGen DListIntOfSeqGen) - (fun ((q :DList), (l : int list)) -> foldBack (fun (elem : int) (l' : int list) -> elem::l') q [] = l )) - - fsCheck "DList Conj" (Prop.forAll (Arb.fromGen DListIntConjGen) - (fun ((q :DList), (l : int list)) -> foldBack (fun (elem : int) (l' : int list) -> elem::l') q [] = l )) - -[] -let ``foldBack matches build list 2``() = - let q = ofSeq ["f";"e";"d";"c";"b";"a"] - let lq = foldBack (fun (elem : string) (l' : string list) -> elem::l') q [] - lq |> should equal (DList.toList q) - -[] -let ``fold matches build list rev 2``() = - let q = ofSeq ["f";"e";"d";"c";"b";"a"] - let lq = fold (fun (l' : string list) (elem : string) -> elem::l') [] q - lq |> should equal (List.rev (DList.toList q)) - -[] -[] -let ``get head from DList``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun (q : DList, l) -> (head q) = (List.nth l 0) )) - -[] -[] -let ``get head from DList safely``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun (q : DList, l) -> (tryHead q).Value = (List.nth l 0) )) - -[] -[] -let ``get tail from DList``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun ((q : DList), l) -> q.Tail.Head = (List.nth l 1) )) - -[] -[] -let ``get tail from DList safely``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun (q : DList, l) -> q.TryTail.Value.Head = (List.nth l 1) )) - -[] -let ``give None if there is no head in the DList``() = - emptyDList |> tryHead |> should equal None - -[] -let ``give None if there is no tail in the DList``() = - emptyDList |> tryTail |> should equal None - -[] -[] -let ``int DList builds and serializes``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun (q : DList, l) -> q |> Seq.toList = l )) - -[] -let ``obj DList builds and serializes``() = - fsCheck "obj DList" (Prop.forAll (Arb.fromGen DListObjGen) (fun (q : DList, l) -> q |> Seq.toList = l )) - -[] -let ``string DList builds and serializes``() = - fsCheck "string DList" (Prop.forAll (Arb.fromGen DListStringGen) (fun (q : DList, l) -> q |> Seq.toList = l )) - -[] -let ``TryUncons wind-down to None``() = - let q = ofSeq ["f";"e";"d";"c";"b";"a"] - - let rec loop (q' : DList) = - match (q'.TryUncons) with - | Some(hd, tl) -> loop tl - | None -> () - - loop q - - true |> should equal true - -[] -let ``Uncons wind-down to None``() = - let q = ofSeq ["f";"e";"d";"c";"b";"a"] - - let rec loop (q' : DList) = - match (q'.Uncons) with - | hd, tl when tl.IsEmpty -> () - | hd, tl -> loop tl - - loop q - - true |> should equal true - -[] -let ``test length should return 6``() = - let q = ofSeq ["f";"e";"d";"c";"b";"a"] - length q |> should equal 6 - -[] -let ``singleton length 1``() = - singleton 1 |> length |> should equal 1 - -[] -let ``empty length 0``() = - empty |> length |> should equal 0 - -[] -let ``test ofSeq should create a DList from a list``() = - let test = [ for i in 0..4 -> i ] - let x = DList.ofSeq test - x |> should equal (List.toSeq test) - -[] -let ``test ofSeq should create a DList from an array``() = - let test = [| for i in 0..4 -> i |] - DList.ofSeq test |> should equal (Array.toSeq test) - -[] -let ``test singleton should return a Unit containing the solo value``() = - singleton 1 |> head |> should equal 1 - -[] -let ``test append should join two DLists together``() = - let q = ofSeq ["f";"e";"d";"c";"b";"a"] - let q2 = ofSeq ["1";"2";"3";"4";"5";"6"] - let q3 = append q q2 - q3 |> length |> should equal 12 - q3 |> head |> should equal "f" - -[] -let ``test toSeq``() = - let q = ofSeq ["f";"e";"d";"c";"b";"a"] - List.ofSeq (DList.toSeq q) |> should equal ["f";"e";"d";"c";"b";"a"] - -[] -let ``test toList``() = - let q = ofSeq ["f";"e";"d";"c";"b";"a"] - DList.toList q |> should equal ["f";"e";"d";"c";"b";"a"] + testPropertyWithConfig config10k "DList OfSeq fold matches build list rev" (Prop.forAll (Arb.fromGen DListIntOfSeqGen) <| + fun (q, l) -> q |> DList.fold (fun l' elem -> elem::l') [] = List.rev l ) + + testPropertyWithConfig config10k "DList Conj fold matches build list rev" (Prop.forAll (Arb.fromGen DListIntConjGen) <| + fun (q, l) -> q |> DList.fold (fun l' elem -> elem::l') [] = List.rev l ) + + testPropertyWithConfig config10k "DList foldBack matches build list" (Prop.forAll (Arb.fromGen DListIntGen) <| + fun (q, l) -> DList.foldBack (fun elem l' -> elem::l') q [] = l ) + + testPropertyWithConfig config10k "DList OfSeq foldBack matches build list" (Prop.forAll (Arb.fromGen DListIntOfSeqGen) <| + fun (q, l) -> DList.foldBack (fun elem l' -> elem::l') q [] = l ) + + testPropertyWithConfig config10k "DList Conj foldBack matches build list" (Prop.forAll (Arb.fromGen DListIntConjGen) <| + fun (q, l) -> DList.foldBack (fun elem l' -> elem::l') q [] = l ) + + testPropertyWithConfig config10k "get DList.head from DList 0" (Prop.forAll (Arb.fromGen intGensStart1.[0]) <| + fun (q, l) -> DList.head q = List.item 0 l ) + + testPropertyWithConfig config10k "get DList.head from DList 1" (Prop.forAll (Arb.fromGen intGensStart1.[1]) <| + fun (q, l) -> DList.head q = List.item 0 l ) + + testPropertyWithConfig config10k "get DList.head from DList 2" (Prop.forAll (Arb.fromGen intGensStart1.[2]) <| + fun (q, l) -> DList.head q = List.item 0 l ) + + testPropertyWithConfig config10k "get DList.head from DList safely 0" (Prop.forAll (Arb.fromGen intGensStart1.[0]) <| + fun (q, l) -> (DList.tryHead q).Value = List.item 0 l ) + + testPropertyWithConfig config10k "get DList.head from DList safely 1" (Prop.forAll (Arb.fromGen intGensStart1.[1]) <| + fun (q, l) -> (DList.tryHead q).Value = List.item 0 l ) + + testPropertyWithConfig config10k "get DList.head from DList safely 2" (Prop.forAll (Arb.fromGen intGensStart1.[2]) <| + fun (q, l) -> (DList.tryHead q).Value = List.item 0 l ) + + testPropertyWithConfig config10k "get DList.tail from DList 0" (Prop.forAll (Arb.fromGen intGensStart2.[0]) <| + fun ((q : DList), l) -> q.Tail.Head = (List.item 1 l) ) + + testPropertyWithConfig config10k "get DList.tail from DList 1" (Prop.forAll (Arb.fromGen intGensStart2.[1]) <| + fun ((q : DList), l) -> q.Tail.Head = (List.item 1 l) ) + + testPropertyWithConfig config10k "get DList.tail from DList 2" (Prop.forAll (Arb.fromGen intGensStart2.[2]) <| + fun ((q : DList), l) -> q.Tail.Head = (List.item 1 l) ) + + testPropertyWithConfig config10k "get DList.tail from DList safely 0" (Prop.forAll (Arb.fromGen intGensStart2.[0]) <| + fun (q, l) -> q.TryTail.Value.Head = (List.item 1 l) ) + + testPropertyWithConfig config10k "get DList.tail from DList safely 1" (Prop.forAll (Arb.fromGen intGensStart2.[1]) <| + fun (q, l) -> q.TryTail.Value.Head = (List.item 1 l) ) -type DListGen = - static member DList() = - let rec dListGen() = - gen { - let! xs = Arb.generate - return DList.ofSeq (Seq.ofList xs) - } - Arb.fromGen (dListGen()) + testPropertyWithConfig config10k "get DList.tail from DList safely 2" (Prop.forAll (Arb.fromGen intGensStart2.[2]) <| + fun (q, l) -> q.TryTail.Value.Head = (List.item 1 l) ) -let registerGen = lazy (Arb.register() |> ignore) - -[] -let ``structural equality``() = + testPropertyWithConfig config10k "int DList builds and serializes 0" (Prop.forAll (Arb.fromGen intGensStart1.[0]) <| + fun (q, l) -> q |> Seq.toList = l ) - let l1 = ofSeq [1..100] - let l2 = ofSeq [1..100] + testPropertyWithConfig config10k "int DList builds and serializes 1" (Prop.forAll (Arb.fromGen intGensStart1.[1]) <| + fun (q, l) -> q |> Seq.toList = l ) - l1 = l2 |> should equal true + testPropertyWithConfig config10k "int DList builds and serializes 2" (Prop.forAll (Arb.fromGen intGensStart1.[2]) <| + fun (q, l) -> q |> Seq.toList = l ) - let l3 = ofSeq [1..99] |> conj 7 + testPropertyWithConfig config10k "obj DList builds and serializes" (Prop.forAll (Arb.fromGen DListObjGen) <| + fun (q, l) -> q |> Seq.toList = l ) - l1 = l3 |> should equal false \ No newline at end of file + testPropertyWithConfig config10k "string DList builds and serializes" (Prop.forAll (Arb.fromGen DListStringGen) <| + fun (q, l) -> q |> Seq.toList = l ) + ] \ No newline at end of file diff --git a/tests/FSharpx.Collections.Tests/DequeTest.fs b/tests/FSharpx.Collections.Tests/DequeTest.fs index ea1e0717..65827876 100644 --- a/tests/FSharpx.Collections.Tests/DequeTest.fs +++ b/tests/FSharpx.Collections.Tests/DequeTest.fs @@ -1,809 +1,759 @@ -module FSharpx.Collections.Tests.Deque +namespace FSharpx.Collections.Tests open System open FSharpx.Collections -open FSharpx.Collections.Deque -open FSharpx.Collections.Tests.Properties -open NUnit.Framework +open Properties open FsCheck -open FsCheck.NUnit -open FsUnit +open Expecto +open Expecto.Flip + +module DequeTests = + + [] + let testDeque = + + //quite a lot going on and difficult to reason about edge cases + //testing up to length of 6 is the likely minimum to satisfy any arbitrary test case (less for some cases) -let emptyDeque = Deque.empty + let len1 = Deque.singleton "a" + let len2 = Deque.singleton "a" |> Deque.cons "b" + let len3 = Deque.singleton "a" |> Deque.cons "b" |> Deque.cons "c" + let len4 = Deque.singleton "a" |> Deque.cons "b" |> Deque.cons "c" |> Deque.cons "d" + let len5 = Deque.singleton "a" |> Deque.cons "b" |> Deque.cons "c" |> Deque.cons "d" |> Deque.cons "e" + let len6 = Deque.singleton "a" |> Deque.cons "b" |> Deque.cons "c" |> Deque.cons "d" |> Deque.cons "e" |> Deque.cons "f" + let len7 = Deque.singleton "a" |> Deque.cons "b" |> Deque.cons "c" |> Deque.cons "d" |> Deque.cons "e" |> Deque.cons "f" |> Deque.cons "g" + let len8 = Deque.singleton "a" |> Deque.cons "b" |> Deque.cons "c" |> Deque.cons "d" |> Deque.cons "e" |> Deque.cons "f" |> Deque.cons "g" |> Deque.cons "h" + let len9 = Deque.singleton "a" |> Deque.cons "b" |> Deque.cons "c" |> Deque.cons "d" |> Deque.cons "e" |> Deque.cons "f" |> Deque.cons "g" |> Deque.cons "h" |> Deque.cons "i" + let lena = Deque.singleton "a" |> Deque.cons "b" |> Deque.cons "c" |> Deque.cons "d" |> Deque.cons "e" |> Deque.cons "f" |> Deque.cons "g" |> Deque.cons "h" |> Deque.cons "i" |> Deque.cons "j" -let conjThruList l q = - let rec loop (q' : 'a Deque) (l' : 'a list) = - match l' with - | hd :: tl -> loop (q'.Conj hd) tl - | [] -> q' - - loop q l - -//Deque -(* -non-Deque generators from random ofList -*) -let dequeOfListGen = - gen { let! n = Gen.length2thru12 - let! x = Gen.listInt n - return ( (Deque.ofList x), x) } - -(* -Deque generators from random ofSeq and/or conj elements from random list -*) -let dequeIntGen = - gen { let! n = Gen.length1thru12 - let! n2 = Gen.length2thru12 - let! x = Gen.listInt n - let! y = Gen.listInt n2 - return ( (Deque.ofSeq x |> conjThruList y), (x @ y) ) } - -let dequeIntOfSeqGen = - gen { let! n = Gen.length1thru12 - let! x = Gen.listInt n - return ( (Deque.ofSeq x), x) } - -let dequeIntConjGen = - gen { let! n = Gen.length1thru12 - let! x = Gen.listInt n - return ( (Deque.empty |> conjThruList x), x) } - -let dequeObjGen = - gen { let! n = Gen.length2thru12 - let! n2 = Gen.length1thru12 - let! x = Gen.listObj n - let! y = Gen.listObj n2 - return ( (Deque.ofSeq x |> conjThruList y), (x @ y) ) } - -let dequeStringGen = - gen { let! n = Gen.length1thru12 - let! n2 = Gen.length2thru12 - let! x = Gen.listString n - let! y = Gen.listString n2 - return ( (Deque.ofSeq x |> conjThruList y), (x @ y) ) } - -// NUnit TestCaseSource does not understand array of tuples at runtime -let intGens start = - let v = Array.create 3 (box (dequeIntGen, "Deque")) - v.[1] <- box ((dequeIntOfSeqGen |> Gen.suchThat (fun (q, l) -> l.Length >= start)), "Deque OfSeq") - v.[2] <- box ((dequeIntConjGen |> Gen.suchThat (fun (q, l) -> l.Length >= start)), "Deque Enqueue") - v - -let intGensStart1 = - intGens 1 //this will accept all - -let intGensStart2 = - intGens 2 // this will accept 11 out of 12 - -//quite a lot going on and difficult to reason about edge cases -//testing up to length of 6 is the likely minimum to satisfy any arbitrary test case (less for some cases) - -let len1 = singleton "a" -let len2 = singleton "a" |> cons "b" -let len3 = singleton "a" |> cons "b" |> cons "c" -let len4 = singleton "a" |> cons "b" |> cons "c" |> cons "d" -let len5 = singleton "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" -let len6 = singleton "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" -let len7 = singleton "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" -let len8 = singleton "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" -let len9 = singleton "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" |> cons "i" -let lena = singleton "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" |> cons "i" |> cons "j" - -let len1conj = empty |> conj "a" -let len2conj = empty |> conj "b" |> conj "a" -let len3conj = empty |> conj "c" |> conj "b" |> conj "a" -let len4conj = empty |> conj "d" |> conj "c" |> conj "b" |> conj "a" -let len5conj = empty |> conj "e" |> conj "d" |> conj "c" |> conj "b" |> conj "a" -let len6conj = empty |> conj "f" |> conj "e" |> conj "d" |> conj "c" |> conj "b" |> conj "a" -let len7conj = empty |> conj "g" |> conj "f" |> conj "e" |> conj "d" |> conj "c" |> conj "b" |> conj "a" -let len8conj = empty |> conj "h" |> conj "g" |> conj "f" |> conj "e" |> conj "d" |> conj "c" |> conj "b" |> conj "a" -let len9conj = empty |> conj "i" |> conj "h" |> conj "g" |> conj "f" |> conj "e" |> conj "d" |> conj "c" |> conj "b" |> conj "a" -let lenaconj = empty |> conj "j" |> conj "i" |> conj "h" |> conj "g" |> conj "f" |> conj "e" |> conj "d" |> conj "c" |> conj "b" |> conj "a" - -[] -let ``empty dqueue should be empty``() = - empty |> isEmpty |> should equal true - -[] -let ``cons works``() = - len2 |> isEmpty |> should equal false - -[] -let ``conj works``() = - len2conj |> isEmpty |> should equal false - -[] -let ``singleton head works``() = - len1 |> head |> should equal "a" - -[] -let ``singleton last works``() = - len1 |> last |> should equal "a" - -[] -let ``fold matches build list rev``() = - - fsCheck "Deque" (Prop.forAll (Arb.fromGen dequeIntGen) - (fun ((q :Deque), (l : int list)) -> q |> fold (fun (l' : int list) (elem : int) -> elem::l') [] = (List.rev l) )) - - fsCheck "Deque OfSeq" (Prop.forAll (Arb.fromGen dequeIntOfSeqGen) - (fun ((q :Deque), (l : int list)) -> q |> fold (fun (l' : int list) (elem : int) -> elem::l') [] = (List.rev l) )) + let len1conj = Deque.empty |> Deque.conj "a" + let len2conj = Deque.empty |> Deque.conj "b" |> Deque.conj "a" + let len3conj = Deque.empty |> Deque.conj "c" |> Deque.conj "b" |> Deque.conj "a" + let len4conj = Deque.empty |> Deque.conj "d" |> Deque.conj "c" |> Deque.conj "b" |> Deque.conj "a" + let len5conj = Deque.empty |> Deque.conj "e" |> Deque.conj "d" |> Deque.conj "c" |> Deque.conj "b" |> Deque.conj "a" + let len6conj = Deque.empty |> Deque.conj "f" |> Deque.conj "e" |> Deque.conj "d" |> Deque.conj "c" |> Deque.conj "b" |> Deque.conj "a" + let len7conj = Deque.empty |> Deque.conj "g" |> Deque.conj "f" |> Deque.conj "e" |> Deque.conj "d" |> Deque.conj "c" |> Deque.conj "b" |> Deque.conj "a" + let len8conj = Deque.empty |> Deque.conj "h" |> Deque.conj "g" |> Deque.conj "f" |> Deque.conj "e" |> Deque.conj "d" |> Deque.conj "c" |> Deque.conj "b" |> Deque.conj "a" + let len9conj = Deque.empty |> Deque.conj "i" |> Deque.conj "h" |> Deque.conj "g" |> Deque.conj "f" |> Deque.conj "e" |> Deque.conj "d" |> Deque.conj "c" |> Deque.conj "b" |> Deque.conj "a" + let lenaconj = Deque.empty |> Deque.conj "j" |> Deque.conj "i" |> Deque.conj "h" |> Deque.conj "g" |> Deque.conj "f" |> Deque.conj "e" |> Deque.conj "d" |> Deque.conj "c" |> Deque.conj "b" |> Deque.conj "a" - fsCheck "Deque Conj" (Prop.forAll (Arb.fromGen dequeIntConjGen) - (fun ((q :Deque), (l : int list)) -> q |> fold (fun (l' : int list) (elem : int) -> elem::l') [] = (List.rev l) )) + testList "Deque" [ + test "empty dqueue should be empty" { + Expect.isTrue "empty is empty" (Deque.empty |> Deque.isEmpty) } -[] -let ``foldback matches build list``() = + test "Deque.cons works" { + Expect.isFalse "not empty" (len2 |> Deque.isEmpty) } - fsCheck "Deque" (Prop.forAll (Arb.fromGen dequeIntGen) - (fun ((q : Deque), (l : int list)) -> foldBack (fun (elem : int) (l' : int list) -> elem::l') q [] = l )) - - fsCheck "Deque OfSeq" (Prop.forAll (Arb.fromGen dequeIntOfSeqGen) - (fun ((q : Deque), (l : int list)) -> foldBack (fun (elem : int) (l' : int list) -> elem::l') q [] = l )) + test "Deque.conj works" { + Expect.isFalse "" (len2conj |> Deque.isEmpty) } - fsCheck "Deque Conj" (Prop.forAll (Arb.fromGen dequeIntConjGen) - (fun ((q : Deque), (l : int list)) -> foldBack (fun (elem : int) (l' : int list) -> elem::l') q [] = l )) + test "Deque.singleton head works" { + Expect.equal "Deque.singleton" "a" (len1 |> Deque.head) } -[] -[] -let ``int deque builds and serializes``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun (q : Deque, l) -> q |> Seq.toList = l )) + test "Deque.singleton last works" { + Expect.equal "" "a" (len1 |> Deque.last) } -[] -let ``obj deque builds and serializes``() = - fsCheck "obj Deque" (Prop.forAll (Arb.fromGen dequeObjGen) (fun (q : Deque, l) -> q |> Seq.toList = l )) + test "TryUncons wind-down to None" { + let q = Deque.ofSeq ["f";"e";"d";"c";"b";"a"] -[] -let ``string deque builds and serializes``() = - fsCheck "string Deque" (Prop.forAll (Arb.fromGen dequeStringGen) (fun (q : Deque, l) -> q |> Seq.toList = l )) + let rec loop (q' : Deque) = + match (q'.TryUncons) with + | Some(hd, tl) -> loop tl + | None -> () -[] -let ``reverse . reverse = id``() = - - fsCheck "obj Deque" (Prop.forAll (Arb.fromGen dequeObjGen) - (fun (q, l) -> q |> rev |> rev |> Seq.toList = (q |> Seq.toList) )) - -[] -let ``ofList build and serialize``() = - - fsCheck "Deque" (Prop.forAll (Arb.fromGen dequeOfListGen) - (fun ((q : Deque), (l : int list)) -> q |> Seq.toList = l )) - -[] -let ``TryUncons wind-down to None``() = - let q = ofSeq ["f";"e";"d";"c";"b";"a"] - - let rec loop (q' : Deque) = - match (q'.TryUncons) with - | Some(hd, tl) -> loop tl - | None -> () - - loop q - - true |> should equal true - -[] -let ``Uncons wind-down to None``() = - let q = ofSeq ["f";"e";"d";"c";"b";"a"] - - let rec loop (q' : Deque) = - match (q'.Uncons) with - | hd, tl when tl.Length = 0 -> () - | hd, tl -> loop tl - - loop q - - true |> should equal true - -[] -let ``toSeq works``() = - let q = ofSeq ["f";"e";"d";"c";"b";"a"] - let l = List.ofSeq q - let l' = List.ofSeq (toSeq q) - l |> should equal l' - -[] -[] -let ``get head from deque``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun (q : Deque, l) -> (head q) = (List.nth l 0) )) - -[] -[] -let ``get head from deque safely``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun (q : Deque, l) -> (tryHead q).Value = (List.nth l 0) )) - -[] -[] -let ``get tail from deque``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun ((q : Deque), l) -> q.Tail.Head = (List.nth l 1) )) - -[] -[] -let ``get tail from deque safely``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun (q : Deque, l) -> q.TryTail.Value.Head = (List.nth l 1) )) - -[] -[] -let ``get initial from deque``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun ((q : Deque), l) -> List.ofSeq (initial q) = (List.rev l |> List.tail |> List.rev) )) - -[] -[] -let ``get initial from deque safely``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun (q : Deque, l) -> List.ofSeq q.TryInitial.Value = (List.rev l |> List.tail |> List.rev) )) - -[] -let ``tail of singleton empty``() = - len1 |> tail |> isEmpty |> should equal true - len1conj |> tail |> isEmpty |> should equal true - -[] -let ``tail of tail of 2 empty``() = - len2 |> tail |> tail |> isEmpty |> should equal true - len2conj |> tail |> tail |> isEmpty |> should equal true - -[] -let ``initial of singleton empty``() = - len1 |> initial |> isEmpty |> should equal true - len1conj |> initial |> isEmpty |> should equal true - -[] -let ``head, tail, and length work test 1``() = - let t1 = tail len2 - let t1s = tail len2conj - (((length t1) = 1) && ((length t1s) = 1) && ((head t1) = "a") && ((head t1s) = "a")) |> should equal true - -[] -let ``head, tail, and length work test 2``() = - let t1 = tail len3 - let t1s = tail len3conj - - let t1_1 = tail t1 - let t1_1s = tail t1s - - (((length t1) = 2) && ((length t1s) = 2) && ((head t1) = "b") && ((head t1s) = "b") && ((length t1_1) = 1) && ((length t1_1s) = 1) - && ((head t1_1) = "a") && ((head t1_1s) = "a")) |> should equal true - -[] -let ``head, tail, and length work test 3``() = - let t1 = tail len4 - let t1s = tail len4conj - - let t1_2 = tail t1 - let t1_2s = tail t1s - - let t1_1 = tail t1_2 - let t1_1s = tail t1_2s - - (((length t1) = 3) && ((length t1s) = 3) && ((head t1) = "c")&& ((head t1s) = "c") && ((length t1_2) = 2) && ((length t1_2s) = 2) - && ((head t1_2) = "b") && ((head t1_2s) = "b") && ((length t1_1) = 1) && ((length t1_1s) = 1) && ((head t1_1) = "a") - && ((head t1_1s) = "a")) |> should equal true - -[] -let ``head, tail, and length work test 4``() = - let t1 = tail len5 - let t1s = tail len5conj - - let t1_3 = tail t1 - let t1_3s = tail t1s - - let t1_2 = tail t1_3 - let t1_2s = tail t1_3s - - let t1_1 = tail t1_2 - let t1_1s = tail t1_2s - - (((length t1) = 4) && ((length t1s) = 4) && ((head t1) = "d") && ((head t1s) = "d") && ((length t1_3) = 3) && ((length t1_3s) = 3) - && ((head t1_3) = "c") && ((head t1_3s) = "c") && ((length t1_2) = 2) && ((length t1_2s) = 2) && ((head t1_2) = "b") && ((head t1_2s) = "b") - && ((length t1_1) = 1) && ((length t1_1s) = 1) && ((head t1_1) = "a") && ((head t1_1s) = "a")) |> should equal true - -[] -let ``head, tail, and length work test 5``() = - let t1 = tail len6 - let t1s = tail len6conj - - let t1_4 = tail t1 - let t1_4s = tail t1s - - let t1_3 = tail t1_4 - let t1_3s = tail t1_4s - - let t1_2 = tail t1_3 - let t1_2s = tail t1_3s - - let t1_1 = tail t1_2 - let t1_1s = tail t1_2s - - (((length t1) = 5) && ((length t1s) = 5) && ((head t1) = "e") && ((head t1s) = "e") && ((length t1_4) = 4) && ((length t1_4s) = 4) - && ((head t1_4) = "d") && ((head t1_4s) = "d") && ((length t1_3) = 3) && ((length t1_3s) = 3) && ((head t1_3) = "c") && ((head t1_3s) = "c") - && ((length t1_2) = 2) && ((length t1_2s) = 2) && ((head t1_2) = "b") && ((head t1_2s) = "b") && ((length t1_1) = 1) && ((length t1_1s) = 1) - && ((head t1_1) = "a") && ((head t1_1s) = "a")) |> should equal true - -[] -let ``head, tail, and length work test 6``() = - let t1 = tail len7 - let t1s = tail len7conj - - let t1_5 = tail t1 - let t1_5s = tail t1s - - let t1_4 = tail t1_5 - let t1_4s = tail t1_5s - - let t1_3 = tail t1_4 - let t1_3s = tail t1_4s - - let t1_2 = tail t1_3 - let t1_2s = tail t1_3s - - let t1_1 = tail t1_2 - let t1_1s = tail t1_2s - - (((length t1) = 6) && ((length t1s) = 6) - && ((head t1) = "f") && ((head t1s) = "f") - && ((length t1_5) = 5) && ((length t1_5s) = 5) - && ((head t1_5) = "e") && ((head t1_5s) = "e") - && ((length t1_4) = 4) && ((length t1_4s) = 4) - && ((head t1_4) = "d") && ((head t1_4s) = "d") - && ((length t1_3) = 3) && ((length t1_3s) = 3) - && ((head t1_3) = "c") && ((head t1_3s) = "c") - && ((length t1_2) = 2) && ((length t1_2s) = 2) - && ((head t1_2) = "b") && ((head t1_2s) = "b") - && ((length t1_1) = 1) && ((length t1_1s) = 1) - && ((head t1_1) = "a") && ((head t1_1s) = "a") ) |> should equal true - -[] -let ``head, tail, and length work test 7``() = - let t1 = tail len8 - let t1s = tail len8conj - let t1_6 = tail t1 - let t1_6s = tail t1s - let t1_5 = tail t1_6 - let t1_5s = tail t1_6s - let t1_4 = tail t1_5 - let t1_4s = tail t1_5s - let t1_3 = tail t1_4 - let t1_3s = tail t1_4s - let t1_2 = tail t1_3 - let t1_2s = tail t1_3s - let t1_1 = tail t1_2 - let t1_1s = tail t1_2s - - (((length t1) = 7) && ((length t1s) = 7) - && ((head t1) = "g") && ((head t1s) = "g") - && ((length t1_6) = 6) && ((length t1_6s) = 6) - && ((head t1_6) = "f") && ((head t1_6s) = "f") - && ((length t1_5) = 5) && ((length t1_5s) = 5) - && ((head t1_5) = "e") && ((head t1_5s) = "e") - && ((length t1_4) = 4) && ((length t1_4s) = 4) - && ((head t1_4) = "d") && ((head t1_4s) = "d") - && ((length t1_3) = 3) && ((length t1_3s) = 3) - && ((head t1_3) = "c") && ((head t1_3s) = "c") - && ((length t1_2) = 2) && ((length t1_2s) = 2) - && ((head t1_2) = "b") && ((head t1_2s) = "b") - && ((length t1_1) = 1) && ((length t1_1s) = 1) - && ((head t1_1) = "a") && ((head t1_1s) = "a") ) |> should equal true - -[] -let ``head, tail, and length work test 8``() = - let t1 = tail len9 - let t1s = tail len9conj - let t1_7 = tail t1 - let t1_7s = tail t1s - let t1_6 = tail t1_7 - let t1_6s = tail t1_7s - let t1_5 = tail t1_6 - let t1_5s = tail t1_6s - let t1_4 = tail t1_5 - let t1_4s = tail t1_5s - let t1_3 = tail t1_4 - let t1_3s = tail t1_4s - let t1_2 = tail t1_3 - let t1_2s = tail t1_3s - let t1_1 = tail t1_2 - let t1_1s = tail t1_2s - - (((length t1) = 8) && ((length t1s) = 8) - && ((head t1) = "h") && ((head t1s) = "h") - && ((length t1_7) = 7) && ((length t1_7s) = 7) - && ((head t1_7) = "g") && ((head t1_7s) = "g") - && ((length t1_6) = 6) && ((length t1_6s) = 6) - && ((head t1_6) = "f") && ((head t1_6s) = "f") - && ((length t1_5) = 5) && ((length t1_5s) = 5) - && ((head t1_5) = "e") && ((head t1_5s) = "e") - && ((length t1_4) = 4) && ((length t1_4s) = 4) - && ((head t1_4) = "d") && ((head t1_4s) = "d") - && ((length t1_3) = 3) && ((length t1_3s) = 3) - && ((head t1_3) = "c") && ((head t1_3s) = "c") - && ((length t1_2) = 2) && ((length t1_2s) = 2) - && ((head t1_2) = "b") && ((head t1_2s) = "b") - && ((length t1_1) = 1) && ((length t1_1s) = 1) - && ((head t1_1) = "a") && ((head t1_1s) = "a") ) |> should equal true - -[] -let ``head, tail, and length work test 9``() = - let t1 = tail lena - let t1s = tail lenaconj - let t1_8 = tail t1 - let t1_8s = tail t1s - let t1_7 = tail t1_8 - let t1_7s = tail t1_8s - let t1_6 = tail t1_7 - let t1_6s = tail t1_7s - let t1_5 = tail t1_6 - let t1_5s = tail t1_6s - let t1_4 = tail t1_5 - let t1_4s = tail t1_5s - let t1_3 = tail t1_4 - let t1_3s = tail t1_4s - let t1_2 = tail t1_3 - let t1_2s = tail t1_3s - let t1_1 = tail t1_2 - let t1_1s = tail t1_2s + Expect.equal "unit" () <| loop q } + + test "Uncons wind-down to None" { + let q = Deque.ofSeq ["f";"e";"d";"c";"b";"a"] + + let rec loop (q' : Deque) = + match (q'.Uncons) with + | hd, tl when tl.Length = 0 -> () + | hd, tl -> loop tl + + Expect.equal "unit" () <| loop q } + + test "toSeq works" { + let q = Deque.ofSeq ["f";"e";"d";"c";"b";"a"] + let l = List.ofSeq q + Expect.equal "toSeq" l <|List.ofSeq (Deque.toSeq q) } + + test "Deque.tail of Deque.singleton empty" { + Expect.isTrue "Deque.isEmpty" (len1 |> Deque.tail |> Deque.isEmpty) + Expect.isTrue "Deque.isEmpty" (len1conj |> Deque.tail |> Deque.isEmpty) } + + test "Deque.tail of Deque.tail of 2 empty" { + Expect.isTrue "Deque.isEmpty" (len2 |> Deque.tail |> Deque.tail |> Deque.isEmpty) + Expect.isTrue "Deque.isEmpty" (len2conj |> Deque.tail |> Deque.tail |> Deque.isEmpty) } + + test "Deque.initial of Deque.singleton empty" { + Expect.isTrue "Deque.isEmpty" (len1 |> Deque.initial |> Deque.isEmpty) + Expect.isTrue "Deque.isEmpty" (len1conj |> Deque.initial |> Deque.isEmpty) } + + test "head, Deque.tail, and length work test 1" { + let t1 = Deque.tail len2 + let t1s = Deque.tail len2conj + Expect.isTrue "head, Deque.tail, and length" (((Deque.length t1) = 1) && ((Deque.length t1s) = 1) && ((Deque.head t1) = "a") && ((Deque.head t1s) = "a")) } + + test "head, Deque.tail, and length work test 2" { + let t1 = Deque.tail len3 + let t1s = Deque.tail len3conj + + let t1_1 = Deque.tail t1 + let t1_1s = Deque.tail t1s + + (((Deque.length t1) = 2) && ((Deque.length t1s) = 2) && ((Deque.head t1) = "b") && ((Deque.head t1s) = "b") && ((Deque.length t1_1) = 1) && ((Deque.length t1_1s) = 1) + && ((Deque.head t1_1) = "a") && ((Deque.head t1_1s) = "a")) |> Expect.isTrue "head, Deque.tail, and length" } + + test "head, Deque.tail, and length work test 3" { + let t1 = Deque.tail len4 + let t1s = Deque.tail len4conj + + let t1_2 = Deque.tail t1 + let t1_2s = Deque.tail t1s + + let t1_1 = Deque.tail t1_2 + let t1_1s = Deque.tail t1_2s + + (((Deque.length t1) = 3) && ((Deque.length t1s) = 3) && ((Deque.head t1) = "c")&& ((Deque.head t1s) = "c") && ((Deque.length t1_2) = 2) && ((Deque.length t1_2s) = 2) + && ((Deque.head t1_2) = "b") && ((Deque.head t1_2s) = "b") && ((Deque.length t1_1) = 1) && ((Deque.length t1_1s) = 1) && ((Deque.head t1_1) = "a") + && ((Deque.head t1_1s) = "a")) |> Expect.isTrue "head, Deque.tail, and length" } + + test "head, Deque.tail, and length work test 4" { + let t1 = Deque.tail len5 + let t1s = Deque.tail len5conj + + let t1_3 = Deque.tail t1 + let t1_3s = Deque.tail t1s + + let t1_2 = Deque.tail t1_3 + let t1_2s = Deque.tail t1_3s + + let t1_1 = Deque.tail t1_2 + let t1_1s = Deque.tail t1_2s + + (((Deque.length t1) = 4) && ((Deque.length t1s) = 4) && ((Deque.head t1) = "d") && ((Deque.head t1s) = "d") && ((Deque.length t1_3) = 3) && ((Deque.length t1_3s) = 3) + && ((Deque.head t1_3) = "c") && ((Deque.head t1_3s) = "c") && ((Deque.length t1_2) = 2) && ((Deque.length t1_2s) = 2) && ((Deque.head t1_2) = "b") && ((Deque.head t1_2s) = "b") + && ((Deque.length t1_1) = 1) && ((Deque.length t1_1s) = 1) && ((Deque.head t1_1) = "a") && ((Deque.head t1_1s) = "a")) |> Expect.isTrue "head, Deque.tail, and length" } + + test "head, Deque.tail, and length work test 5" { + let t1 = Deque.tail len6 + let t1s = Deque.tail len6conj + + let t1_4 = Deque.tail t1 + let t1_4s = Deque.tail t1s + + let t1_3 = Deque.tail t1_4 + let t1_3s = Deque.tail t1_4s + + let t1_2 = Deque.tail t1_3 + let t1_2s = Deque.tail t1_3s + + let t1_1 = Deque.tail t1_2 + let t1_1s = Deque.tail t1_2s + + (((Deque.length t1) = 5) && ((Deque.length t1s) = 5) && ((Deque.head t1) = "e") && ((Deque.head t1s) = "e") && ((Deque.length t1_4) = 4) && ((Deque.length t1_4s) = 4) + && ((Deque.head t1_4) = "d") && ((Deque.head t1_4s) = "d") && ((Deque.length t1_3) = 3) && ((Deque.length t1_3s) = 3) && ((Deque.head t1_3) = "c") && ((Deque.head t1_3s) = "c") + && ((Deque.length t1_2) = 2) && ((Deque.length t1_2s) = 2) && ((Deque.head t1_2) = "b") && ((Deque.head t1_2s) = "b") && ((Deque.length t1_1) = 1) && ((Deque.length t1_1s) = 1) + && ((Deque.head t1_1) = "a") && ((Deque.head t1_1s) = "a")) |> Expect.isTrue "head, Deque.tail, and length" } + + test "head, Deque.tail, and length work test 6" { + let t1 = Deque.tail len7 + let t1s = Deque.tail len7conj + + let t1_5 = Deque.tail t1 + let t1_5s = Deque.tail t1s + + let t1_4 = Deque.tail t1_5 + let t1_4s = Deque.tail t1_5s + + let t1_3 = Deque.tail t1_4 + let t1_3s = Deque.tail t1_4s + + let t1_2 = Deque.tail t1_3 + let t1_2s = Deque.tail t1_3s + + let t1_1 = Deque.tail t1_2 + let t1_1s = Deque.tail t1_2s + + (((Deque.length t1) = 6) && ((Deque.length t1s) = 6) + && ((Deque.head t1) = "f") && ((Deque.head t1s) = "f") + && ((Deque.length t1_5) = 5) && ((Deque.length t1_5s) = 5) + && ((Deque.head t1_5) = "e") && ((Deque.head t1_5s) = "e") + && ((Deque.length t1_4) = 4) && ((Deque.length t1_4s) = 4) + && ((Deque.head t1_4) = "d") && ((Deque.head t1_4s) = "d") + && ((Deque.length t1_3) = 3) && ((Deque.length t1_3s) = 3) + && ((Deque.head t1_3) = "c") && ((Deque.head t1_3s) = "c") + && ((Deque.length t1_2) = 2) && ((Deque.length t1_2s) = 2) + && ((Deque.head t1_2) = "b") && ((Deque.head t1_2s) = "b") + && ((Deque.length t1_1) = 1) && ((Deque.length t1_1s) = 1) + && ((Deque.head t1_1) = "a") && ((Deque.head t1_1s) = "a") ) |> Expect.isTrue "head, Deque.tail, and length" } + + test "head, Deque.tail, and length work test 7" { + let t1 = Deque.tail len8 + let t1s = Deque.tail len8conj + let t1_6 = Deque.tail t1 + let t1_6s = Deque.tail t1s + let t1_5 = Deque.tail t1_6 + let t1_5s = Deque.tail t1_6s + let t1_4 = Deque.tail t1_5 + let t1_4s = Deque.tail t1_5s + let t1_3 = Deque.tail t1_4 + let t1_3s = Deque.tail t1_4s + let t1_2 = Deque.tail t1_3 + let t1_2s = Deque.tail t1_3s + let t1_1 = Deque.tail t1_2 + let t1_1s = Deque.tail t1_2s + + (((Deque.length t1) = 7) && ((Deque.length t1s) = 7) + && ((Deque.head t1) = "g") && ((Deque.head t1s) = "g") + && ((Deque.length t1_6) = 6) && ((Deque.length t1_6s) = 6) + && ((Deque.head t1_6) = "f") && ((Deque.head t1_6s) = "f") + && ((Deque.length t1_5) = 5) && ((Deque.length t1_5s) = 5) + && ((Deque.head t1_5) = "e") && ((Deque.head t1_5s) = "e") + && ((Deque.length t1_4) = 4) && ((Deque.length t1_4s) = 4) + && ((Deque.head t1_4) = "d") && ((Deque.head t1_4s) = "d") + && ((Deque.length t1_3) = 3) && ((Deque.length t1_3s) = 3) + && ((Deque.head t1_3) = "c") && ((Deque.head t1_3s) = "c") + && ((Deque.length t1_2) = 2) && ((Deque.length t1_2s) = 2) + && ((Deque.head t1_2) = "b") && ((Deque.head t1_2s) = "b") + && ((Deque.length t1_1) = 1) && ((Deque.length t1_1s) = 1) + && ((Deque.head t1_1) = "a") && ((Deque.head t1_1s) = "a") ) |> Expect.isTrue "head, Deque.tail, and length" } + + test "head, Deque.tail, and length work test 8" { + let t1 = Deque.tail len9 + let t1s = Deque.tail len9conj + let t1_7 = Deque.tail t1 + let t1_7s = Deque.tail t1s + let t1_6 = Deque.tail t1_7 + let t1_6s = Deque.tail t1_7s + let t1_5 = Deque.tail t1_6 + let t1_5s = Deque.tail t1_6s + let t1_4 = Deque.tail t1_5 + let t1_4s = Deque.tail t1_5s + let t1_3 = Deque.tail t1_4 + let t1_3s = Deque.tail t1_4s + let t1_2 = Deque.tail t1_3 + let t1_2s = Deque.tail t1_3s + let t1_1 = Deque.tail t1_2 + let t1_1s = Deque.tail t1_2s + + (((Deque.length t1) = 8) && ((Deque.length t1s) = 8) + && ((Deque.head t1) = "h") && ((Deque.head t1s) = "h") + && ((Deque.length t1_7) = 7) && ((Deque.length t1_7s) = 7) + && ((Deque.head t1_7) = "g") && ((Deque.head t1_7s) = "g") + && ((Deque.length t1_6) = 6) && ((Deque.length t1_6s) = 6) + && ((Deque.head t1_6) = "f") && ((Deque.head t1_6s) = "f") + && ((Deque.length t1_5) = 5) && ((Deque.length t1_5s) = 5) + && ((Deque.head t1_5) = "e") && ((Deque.head t1_5s) = "e") + && ((Deque.length t1_4) = 4) && ((Deque.length t1_4s) = 4) + && ((Deque.head t1_4) = "d") && ((Deque.head t1_4s) = "d") + && ((Deque.length t1_3) = 3) && ((Deque.length t1_3s) = 3) + && ((Deque.head t1_3) = "c") && ((Deque.head t1_3s) = "c") + && ((Deque.length t1_2) = 2) && ((Deque.length t1_2s) = 2) + && ((Deque.head t1_2) = "b") && ((Deque.head t1_2s) = "b") + && ((Deque.length t1_1) = 1) && ((Deque.length t1_1s) = 1) + && ((Deque.head t1_1) = "a") && ((Deque.head t1_1s) = "a") ) |> Expect.isTrue "head, Deque.tail, and length" } + + test "head, Deque.tail, and length work test 9" { + let t1 = Deque.tail lena + let t1s = Deque.tail lenaconj + let t1_8 = Deque.tail t1 + let t1_8s = Deque.tail t1s + let t1_7 = Deque.tail t1_8 + let t1_7s = Deque.tail t1_8s + let t1_6 = Deque.tail t1_7 + let t1_6s = Deque.tail t1_7s + let t1_5 = Deque.tail t1_6 + let t1_5s = Deque.tail t1_6s + let t1_4 = Deque.tail t1_5 + let t1_4s = Deque.tail t1_5s + let t1_3 = Deque.tail t1_4 + let t1_3s = Deque.tail t1_4s + let t1_2 = Deque.tail t1_3 + let t1_2s = Deque.tail t1_3s + let t1_1 = Deque.tail t1_2 + let t1_1s = Deque.tail t1_2s - (((length t1) = 9) && ((length t1s) = 9) && ((head t1) = "i") && ((head t1s) = "i") - && ((length t1_8) = 8) && ((length t1_8s) = 8) && ((head t1_8) = "h") && ((head t1_8s) = "h") - && ((length t1_7) = 7) && ((length t1_7s) = 7) && ((head t1_7) = "g") && ((head t1_7s) = "g") - && ((length t1_6) = 6) && ((length t1_6s) = 6) && ((head t1_6) = "f") && ((head t1_6s) = "f") - && ((length t1_5) = 5) && ((length t1_5s) = 5) && ((head t1_5) = "e") && ((head t1_5s) = "e") - && ((length t1_4) = 4) && ((length t1_4s) = 4) && ((head t1_4) = "d") && ((head t1_4s) = "d") - && ((length t1_3) = 3) && ((length t1_3s) = 3) && ((head t1_3) = "c") && ((head t1_3s) = "c") - && ((length t1_2) = 2) && ((length t1_2s) = 2) && ((head t1_2) = "b") && ((head t1_2s) = "b") - && ((length t1_1) = 1) && ((length t1_1s) = 1) && ((head t1_1) = "a") && ((head t1_1s) = "a")) |> should equal true - -[] -//the previous series thoroughly tested construction by conj, so we'll leave those out -let ``last, init, and length work test 1``() = - let t1 = initial len2 + (((Deque.length t1) = 9) && ((Deque.length t1s) = 9) && ((Deque.head t1) = "i") && ((Deque.head t1s) = "i") + && ((Deque.length t1_8) = 8) && ((Deque.length t1_8s) = 8) && ((Deque.head t1_8) = "h") && ((Deque.head t1_8s) = "h") + && ((Deque.length t1_7) = 7) && ((Deque.length t1_7s) = 7) && ((Deque.head t1_7) = "g") && ((Deque.head t1_7s) = "g") + && ((Deque.length t1_6) = 6) && ((Deque.length t1_6s) = 6) && ((Deque.head t1_6) = "f") && ((Deque.head t1_6s) = "f") + && ((Deque.length t1_5) = 5) && ((Deque.length t1_5s) = 5) && ((Deque.head t1_5) = "e") && ((Deque.head t1_5s) = "e") + && ((Deque.length t1_4) = 4) && ((Deque.length t1_4s) = 4) && ((Deque.head t1_4) = "d") && ((Deque.head t1_4s) = "d") + && ((Deque.length t1_3) = 3) && ((Deque.length t1_3s) = 3) && ((Deque.head t1_3) = "c") && ((Deque.head t1_3s) = "c") + && ((Deque.length t1_2) = 2) && ((Deque.length t1_2s) = 2) && ((Deque.head t1_2) = "b") && ((Deque.head t1_2s) = "b") + && ((Deque.length t1_1) = 1) && ((Deque.length t1_1s) = 1) && ((Deque.head t1_1) = "a") && ((Deque.head t1_1s) = "a")) |> Expect.isTrue "head, Deque.tail, and length" } + + //the previous series thoroughly tested construction by Deque.conj, so we'll leave those out + test "last, init, and length work test 1" { + let t1 = Deque.initial len2 + Expect.isTrue "last, init, and length" (((Deque.length t1) = 1) && ((Deque.last t1) = "b")) } + + test "last, init, and length work test 2" { + let t1 = Deque.initial len3 + let t1_1 = Deque.initial t1 - (((length t1) = 1) && ((last t1) = "b")) |> should equal true + Expect.isTrue "last, init, and length" (((Deque.length t1) = 2) && ((Deque.last t1) = "b") && ((Deque.length t1_1) = 1) && ((Deque.last t1_1) = "c") ) } -[] -let ``last, init, and length work test 2``() = - let t1 = initial len3 - let t1_1 = initial t1 + test "last, init, and length work test 3" { + let t1 = Deque.initial len4 + let t1_1 = Deque.initial t1 + let t1_2 = Deque.initial t1_1 - (((length t1) = 2) && ((last t1) = "b") && ((length t1_1) = 1) && ((last t1_1) = "c") ) |> should equal true - -[] -let ``last, init, and length work test 3``() = - let t1 = initial len4 - let t1_1 = initial t1 - let t1_2 = initial t1_1 + (((Deque.length t1) = 3) && ((Deque.last t1) = "b") + && ((Deque.length t1_1) = 2) && ((Deque.last t1_1) = "c") + && ((Deque.length t1_2) = 1) && ((Deque.last t1_2) = "d") ) |> Expect.isTrue "last, init, and length" } + + test "last, init, and length work test 4" { + let t1 = Deque.initial len5 + let t1_1 = Deque.initial t1 + let t1_2 = Deque.initial t1_1 + let t1_3 = Deque.initial t1_2 - (((length t1) = 3) && ((last t1) = "b") - && ((length t1_1) = 2) && ((last t1_1) = "c") - && ((length t1_2) = 1) && ((last t1_2) = "d") ) |> should equal true - -[] -let ``last, init, and length work test 4``() = - let t1 = initial len5 - let t1_1 = initial t1 - let t1_2 = initial t1_1 - let t1_3 = initial t1_2 + (((Deque.length t1) = 4) && ((Deque.last t1) = "b") + && ((Deque.length t1_1) = 3) && ((Deque.last t1_1) = "c") + && ((Deque.length t1_2) = 2) && ((Deque.last t1_2) = "d") + && ((Deque.length t1_3) = 1) && ((Deque.last t1_3) = "e") ) |> Expect.isTrue "last, init, and length" } + + test "last, init, and length work test 5" { + let t1 = Deque.initial len6 + let t1_1 = Deque.initial t1 + let t1_2 = Deque.initial t1_1 + let t1_3 = Deque.initial t1_2 + let t1_4 = Deque.initial t1_3 - (((length t1) = 4) && ((last t1) = "b") - && ((length t1_1) = 3) && ((last t1_1) = "c") - && ((length t1_2) = 2) && ((last t1_2) = "d") - && ((length t1_3) = 1) && ((last t1_3) = "e") ) |> should equal true - -[] -let ``last, init, and length work test 5``() = - let t1 = initial len6 - let t1_1 = initial t1 - let t1_2 = initial t1_1 - let t1_3 = initial t1_2 - let t1_4 = initial t1_3 + (((Deque.length t1) = 5) && ((Deque.last t1) = "b") + && ((Deque.length t1_1) = 4) && ((Deque.last t1_1) = "c") + && ((Deque.length t1_2) = 3) && ((Deque.last t1_2) = "d") + && ((Deque.length t1_3) = 2) && ((Deque.last t1_3) = "e") + && ((Deque.length t1_4) = 1) && ((Deque.last t1_4) = "f") ) |> Expect.isTrue "last, init, and length" } + + test "last, init, and length work test 6" { + let t1 = Deque.initial len7 + let t1_1 = Deque.initial t1 + let t1_2 = Deque.initial t1_1 + let t1_3 = Deque.initial t1_2 + let t1_4 = Deque.initial t1_3 + let t1_5 = Deque.initial t1_4 - (((length t1) = 5) && ((last t1) = "b") - && ((length t1_1) = 4) && ((last t1_1) = "c") - && ((length t1_2) = 3) && ((last t1_2) = "d") - && ((length t1_3) = 2) && ((last t1_3) = "e") - && ((length t1_4) = 1) && ((last t1_4) = "f") ) |> should equal true - -[] -let ``last, init, and length work test 6``() = - let t1 = initial len7 - let t1_1 = initial t1 - let t1_2 = initial t1_1 - let t1_3 = initial t1_2 - let t1_4 = initial t1_3 - let t1_5 = initial t1_4 + (((Deque.length t1) = 6) && ((Deque.last t1) = "b") + && ((Deque.length t1_1) = 5) && ((Deque.last t1_1) = "c") + && ((Deque.length t1_2) = 4) && ((Deque.last t1_2) = "d") + && ((Deque.length t1_3) = 3) && ((Deque.last t1_3) = "e") + && ((Deque.length t1_4) = 2) && ((Deque.last t1_4) = "f") + && ((Deque.length t1_5) = 1) && ((Deque.last t1_5) = "g") ) |> Expect.isTrue "last, init, and length" } + + test "last, init, and length work test 7" { + let t1 = Deque.initial len8 + let t1_1 = Deque.initial t1 + let t1_2 = Deque.initial t1_1 + let t1_3 = Deque.initial t1_2 + let t1_4 = Deque.initial t1_3 + let t1_5 = Deque.initial t1_4 + let t1_6 = Deque.initial t1_5 - (((length t1) = 6) && ((last t1) = "b") - && ((length t1_1) = 5) && ((last t1_1) = "c") - && ((length t1_2) = 4) && ((last t1_2) = "d") - && ((length t1_3) = 3) && ((last t1_3) = "e") - && ((length t1_4) = 2) && ((last t1_4) = "f") - && ((length t1_5) = 1) && ((last t1_5) = "g") ) |> should equal true - -[] -let ``last, init, and length work test 7``() = - let t1 = initial len8 - let t1_1 = initial t1 - let t1_2 = initial t1_1 - let t1_3 = initial t1_2 - let t1_4 = initial t1_3 - let t1_5 = initial t1_4 - let t1_6 = initial t1_5 + (((Deque.length t1) = 7) && ((Deque.last t1) = "b") + && ((Deque.length t1_1) = 6) && ((Deque.last t1_1) = "c") + && ((Deque.length t1_2) = 5) && ((Deque.last t1_2) = "d") + && ((Deque.length t1_3) = 4) && ((Deque.last t1_3) = "e") + && ((Deque.length t1_4) = 3) && ((Deque.last t1_4) = "f") + && ((Deque.length t1_5) = 2) && ((Deque.last t1_5) = "g") + && ((Deque.length t1_6) = 1) && ((Deque.last t1_6) = "h") ) |> Expect.isTrue "last, init, and length" } + + test "last, init, and length work test 8" { + let t1 = Deque.initial len9 + let t1_1 = Deque.initial t1 + let t1_2 = Deque.initial t1_1 + let t1_3 = Deque.initial t1_2 + let t1_4 = Deque.initial t1_3 + let t1_5 = Deque.initial t1_4 + let t1_6 = Deque.initial t1_5 + let t1_7 = Deque.initial t1_6 - (((length t1) = 7) && ((last t1) = "b") - && ((length t1_1) = 6) && ((last t1_1) = "c") - && ((length t1_2) = 5) && ((last t1_2) = "d") - && ((length t1_3) = 4) && ((last t1_3) = "e") - && ((length t1_4) = 3) && ((last t1_4) = "f") - && ((length t1_5) = 2) && ((last t1_5) = "g") - && ((length t1_6) = 1) && ((last t1_6) = "h") ) |> should equal true - -[] -let ``last, init, and length work test 8``() = - let t1 = initial len9 - let t1_1 = initial t1 - let t1_2 = initial t1_1 - let t1_3 = initial t1_2 - let t1_4 = initial t1_3 - let t1_5 = initial t1_4 - let t1_6 = initial t1_5 - let t1_7 = initial t1_6 + (((Deque.length t1) = 8) && ((Deque.last t1) = "b") + && ((Deque.length t1_1) = 7) && ((Deque.last t1_1) = "c") + && ((Deque.length t1_2) = 6) && ((Deque.last t1_2) = "d") + && ((Deque.length t1_3) = 5) && ((Deque.last t1_3) = "e") + && ((Deque.length t1_4) = 4) && ((Deque.last t1_4) = "f") + && ((Deque.length t1_5) = 3) && ((Deque.last t1_5) = "g") + && ((Deque.length t1_6) = 2) && ((Deque.last t1_6) = "h") + && ((Deque.length t1_7) = 1) && ((Deque.last t1_7) = "i") ) |> Expect.isTrue "last, init, and length" } + + test "last, init, and length work test 9" { + let t1 = Deque.initial lena + let t1_1 = Deque.initial t1 + let t1_2 = Deque.initial t1_1 + let t1_3 = Deque.initial t1_2 + let t1_4 = Deque.initial t1_3 + let t1_5 = Deque.initial t1_4 + let t1_6 = Deque.initial t1_5 + let t1_7 = Deque.initial t1_6 + let t1_8 = Deque.initial t1_7 - (((length t1) = 8) && ((last t1) = "b") - && ((length t1_1) = 7) && ((last t1_1) = "c") - && ((length t1_2) = 6) && ((last t1_2) = "d") - && ((length t1_3) = 5) && ((last t1_3) = "e") - && ((length t1_4) = 4) && ((last t1_4) = "f") - && ((length t1_5) = 3) && ((last t1_5) = "g") - && ((length t1_6) = 2) && ((last t1_6) = "h") - && ((length t1_7) = 1) && ((last t1_7) = "i") ) |> should equal true - -[] -let ``last, init, and length work test 9``() = - let t1 = initial lena - let t1_1 = initial t1 - let t1_2 = initial t1_1 - let t1_3 = initial t1_2 - let t1_4 = initial t1_3 - let t1_5 = initial t1_4 - let t1_6 = initial t1_5 - let t1_7 = initial t1_6 - let t1_8 = initial t1_7 + (((Deque.length t1) = 9) && ((Deque.last t1) = "b") + && ((Deque.length t1_1) = 8) && ((Deque.last t1_1) = "c") + && ((Deque.length t1_2) = 7) && ((Deque.last t1_2) = "d") + && ((Deque.length t1_3) = 6) && ((Deque.last t1_3) = "e") + && ((Deque.length t1_4) = 5) && ((Deque.last t1_4) = "f") + && ((Deque.length t1_5) = 4) && ((Deque.last t1_5) = "g") + && ((Deque.length t1_6) = 3) && ((Deque.last t1_6) = "h") + && ((Deque.length t1_7) = 2) && ((Deque.last t1_7) = "i") + && ((Deque.length t1_8) = 1) && ((Deque.last t1_8) = "j") ) |> Expect.isTrue "last, init, and length" } + + test "IEnumerable Seq nth" { + Expect.equal "IEnumerable nth" "e" (lena |> Seq.item 5) } + + test "IEnumerable Seq length" { + Expect.equal "IEnumerable length" 10 (lena |> Seq.length) } + + test "type Deque.cons works" { + Expect.equal "Deque.cons" "zz" (lena.Cons "zz" |> Deque.head) } + + test "ofCatLists and Deque.uncons" { + let d = Deque.ofCatLists ["a";"b";"c"] ["d";"e";"f"] + let h1, t1 = Deque.uncons d + let h2, t2 = Deque.uncons t1 + let h3, t3 = Deque.uncons t2 + let h4, t4 = Deque.uncons t3 + let h5, t5 = Deque.uncons t4 + let h6, t6 = Deque.uncons t5 + + Expect.isTrue "ofCatLists and Deque.uncons" ((h1 = "a") && (h2 = "b") && (h3 = "c") && (h4 = "d") && (h5 = "e") && (h6 = "f") && (Deque.isEmpty t6)) } + + test "Deque.unconj works" { + let d = Deque.ofCatLists ["f";"e";"d"] ["c";"b";"a"] + let i1, l1 = Deque.unconj d + let i2, l2 = Deque.unconj i1 + let i3, l3 = Deque.unconj i2 + let i4, l4 = Deque.unconj i3 + let i5, l5 = Deque.unconj i4 + let i6, l6 = Deque.unconj i5 + + Expect.isTrue "Deque.unconj" ((l1 = "a") && (l2 = "b") && (l3 = "c") && (l4 = "d") && (l5 = "e") && (l6 = "f") && (Deque.isEmpty i6)) } + + test "Deque.conj pattern discriminator" { + let d = (Deque.ofCatLists ["f";"e";"d"] ["c";"b";"a"]) + let i1, l1 = Deque.unconj d + + let i2, l2 = + match i1 with + | Deque.Conj(i, l) -> i, l + | _ -> i1, "x" + + Expect.isTrue "Deque.conj" ((l2 = "b") && ((Deque.length i2) = 4)) } + + test "Deque.cons pattern discriminator" { + let d = (Deque.ofCatLists ["f";"e";"d"] ["c";"b";"a"]) + let h1, t1 = Deque.uncons d + + let h2, t2 = + match t1 with + | Deque.Cons(h, t) -> h, t + | _ -> "x", t1 + + Expect.isTrue "Deque.cons" ((h2 = "e") && ((Deque.length t2) = 4)) } + + test "Deque.cons and Deque.conj pattern discriminator" { + let d = (Deque.ofCatLists ["f";"e";"d"] ["c";"b";"a"]) - (((length t1) = 9) && ((last t1) = "b") - && ((length t1_1) = 8) && ((last t1_1) = "c") - && ((length t1_2) = 7) && ((last t1_2) = "d") - && ((length t1_3) = 6) && ((last t1_3) = "e") - && ((length t1_4) = 5) && ((last t1_4) = "f") - && ((length t1_5) = 4) && ((last t1_5) = "g") - && ((length t1_6) = 3) && ((last t1_6) = "h") - && ((length t1_7) = 2) && ((last t1_7) = "i") - && ((length t1_8) = 1) && ((last t1_8) = "j") ) |> should equal true - -[] -let ``IEnumerable Seq nth``() = - lena |> Seq.nth 5 |> should equal "e" - -[] -let ``IEnumerable Seq length``() = - lena |> Seq.length |> should equal 10 - -[] -let ``type cons works``() = - lena.Cons "zz" |> head |> should equal "zz" - -[] -let ``ofCatLists and uncons``() = - let d = ofCatLists ["a";"b";"c"] ["d";"e";"f"] - let h1, t1 = uncons d - let h2, t2 = uncons t1 - let h3, t3 = uncons t2 - let h4, t4 = uncons t3 - let h5, t5 = uncons t4 - let h6, t6 = uncons t5 - - ((h1 = "a") && (h2 = "b") && (h3 = "c") && (h4 = "d") && (h5 = "e") && (h6 = "f") && (isEmpty t6)) |> should equal true - -[] -let ``unconj works``() = - let d = ofCatLists ["f";"e";"d"] ["c";"b";"a"] - let i1, l1 = unconj d - let i2, l2 = unconj i1 - let i3, l3 = unconj i2 - let i4, l4 = unconj i3 - let i5, l5 = unconj i4 - let i6, l6 = unconj i5 - - ((l1 = "a") && (l2 = "b") && (l3 = "c") && (l4 = "d") && (l5 = "e") && (l6 = "f") && (isEmpty i6)) |> should equal true - -[] -let ``conj pattern discriminator``() = - let d = (ofCatLists ["f";"e";"d"] ["c";"b";"a"]) - let i1, l1 = unconj d - - let i2, l2 = - match i1 with - | Conj(i, l) -> i, l - | _ -> i1, "x" - - ((l2 = "b") && ((length i2) = 4)) |> should equal true - -[] -let ``cons pattern discriminator``() = - let d = (ofCatLists ["f";"e";"d"] ["c";"b";"a"]) - let h1, t1 = uncons d - - let h2, t2 = - match t1 with - | Cons(h, t) -> h, t - | _ -> "x", t1 - - ((h2 = "e") && ((length t2) = 4)) |> should equal true - -[] -let ``cons and conj pattern discriminator``() = - let d = (ofCatLists ["f";"e";"d"] ["c";"b";"a"]) + let mid1 = + match d with + | Deque.Cons(h, Deque.Conj(i, l)) -> i + | _ -> d + + let head, last = + match mid1 with + | Deque.Cons(h, Deque.Conj(i, l)) -> h, l + | _ -> "x", "x" + + Expect.isTrue "Deque.cons and Deque.conj" ((head = "e") && (last = "b")) } + + test "rev deque length 1" { + Expect.equal "length" "a" (Deque.rev len1 |> Deque.head) } + + test "rev deque length 2" { + let r1 = Deque.rev len2 + let h1 = Deque.head r1 + let t2 = Deque.tail r1 + let h2 = Deque.head t2 + + Expect.isTrue "length" ((h1 = "a") && (h2 = "b")) } + + test "rev deque length 3" { + let r1 = Deque.rev len3 + let h1 = Deque.head r1 + let t2 = Deque.tail r1 + let h2 = Deque.head t2 + let t3 = Deque.tail t2 + let h3 = Deque.head t3 + + Expect.isTrue "length" ((h1 = "a") && (h2 = "b") && (h3 = "c")) } + + test "rev deque length 4" { + let r1 = Deque.rev len4 + let h1 = Deque.head r1 + let t2 = Deque.tail r1 + let h2 = Deque.head t2 + let t3 = Deque.tail t2 + let h3 = Deque.head t3 + let t4 = Deque.tail t3 + let h4 = Deque.head t4 + + Expect.isTrue "length" ((h1 = "a") && (h2 = "b") && (h3 = "c") && (h4 = "d")) } + + test "rev deque length 5" { + let r1 = Deque.rev len5 + let h1 = Deque.head r1 + let t2 = Deque.tail r1 + let h2 = Deque.head t2 + let t3 = Deque.tail t2 + let h3 = Deque.head t3 + let t4 = Deque.tail t3 + let h4 = Deque.head t4 + let t5 = Deque.tail t4 + let h5 = Deque.head t5 + + Expect.isTrue "length" ((h1 = "a") && (h2 = "b") && (h3 = "c") && (h4 = "d") && (h5 = "e")) } + + test "rev deque length 6" { + let r1 = Deque.rev len6 + let h1 = Deque.head r1 + let t2 = Deque.tail r1 + let h2 = Deque.head t2 + let t3 = Deque.tail t2 + let h3 = Deque.head t3 + let t4 = Deque.tail t3 + let h4 = Deque.head t4 + let t5 = Deque.tail t4 + let h5 = Deque.head t5 + let t6 = Deque.tail t5 + let h6 = Deque.head t6 + + Expect.isTrue "rev length"((h1 = "a") && (h2 = "b") && (h3 = "c") && (h4 = "d") && (h5 = "e") && (h6 = "f")) } + + test "Deque.tryUncons on empty" { + let q = Deque.empty + Expect.isNone "Deque.tryUncons" <| Deque.tryUncons q } + + test "Deque.tryUncons on q" { + let q = Deque.ofSeq ["a";"b";"c";"d"] + let x, _ = (Deque.tryUncons q).Value + Expect.equal "Deque.tryUncons" "a" x } + + test "tryUnconj on empty" { + let q = Deque.empty + Expect.isNone "tryUnconj" <| Deque.tryUnconj q } + + test "tryUnconj on q" { + let q = Deque.ofSeq ["a";"b";"c";"d"] + let _, x = (Deque.tryUnconj q).Value + Expect.equal "tryUnconj" "d" x } + + test "tryHead on empty" { + let q = Deque.empty + Expect.isNone "tryHead" <| Deque.tryHead q } + + test "tryHead on q" { + let q = Deque.ofSeq ["a";"b";"c";"d"] + Expect.equal "tryHead" "a" (Deque.tryHead q).Value } + + test "tryInitial on empty" { + let q = Deque.empty + Expect.isNone "tryInitial" <| Deque.tryInitial q } + + test "tryinitial on q" { + let q = Deque.ofSeq ["a";"b";"c";"d"] + let x = (Deque.tryInitial q).Value + let x2 = x|> Deque.last + Expect.equal "tryinitial" "c" x2 } + + test "tryLast on empty" { + let q = Deque.empty + Expect.isNone "tryLast" <| Deque.tryLast q } + + test "tryLast on deque" { + let q = Deque.ofSeq ["a";"b";"c";"d"] + Expect.equal "tryLast" "d" (Deque.tryLast q).Value + Expect.equal "tryLast" "a" (len2 |> Deque.tryLast).Value + Expect.equal "tryLast" "a" (len2conj |> Deque.tryLast).Value } + + test "tryTail on empty" { + let q = Deque.empty + Expect.isNone "tryTail" <| Deque.tryTail q } + + test "tryTail on q" { + let q = Deque.ofSeq ["a";"b";"c";"d"] + Expect.equal "tryTail" "b" ((Deque.tryTail q).Value |> Deque.head) } + + test "structural equality" { + + let l1 = Deque.ofSeq [1..100] + let l2 = Deque.ofSeq [1..100] + + Expect.equal "equality" l1 l2 + + let l3 = Deque.ofSeq [1..99] |> Deque.conj 7 + + Expect.notEqual "equality" l1 l3 } + ] + + [] + let propertyTestDeque = + + let conjThruList l q = + let rec loop (q' : 'a Deque) (l' : 'a list) = + match l' with + | hd :: tl -> loop (q'.Conj hd) tl + | [] -> q' + + loop q l + (* + non-Deque generators from random ofList + *) + let dequeOfListGen = + gen { let! n = Gen.length2thru12 + let! x = Gen.listInt n + return ( (Deque.ofList x), x) } + + (* + Deque generators from random ofSeq and/or Deque.conj elements from random list + *) + let dequeIntGen = + gen { let! n = Gen.length1thru12 + let! n2 = Gen.length2thru12 + let! x = Gen.listInt n + let! y = Gen.listInt n2 + return ( (Deque.ofSeq x |> conjThruList y), (x @ y) ) } + + let dequeIntOfSeqGen = + gen { let! n = Gen.length1thru12 + let! x = Gen.listInt n + return ( (Deque.ofSeq x), x) } + + let dequeIntConjGen = + gen { let! n = Gen.length1thru12 + let! x = Gen.listInt n + return ( (Deque.empty |> conjThruList x), x) } + + let dequeObjGen = + gen { let! n = Gen.length2thru12 + let! n2 = Gen.length1thru12 + let! x = Gen.listObj n + let! y = Gen.listObj n2 + return ( (Deque.ofSeq x |> conjThruList y), (x @ y) ) } + + let dequeStringGen = + gen { let! n = Gen.length1thru12 + let! n2 = Gen.length2thru12 + let! x = Gen.listString n + let! y = Gen.listString n2 + return ( (Deque.ofSeq x |> conjThruList y), (x @ y) ) } + + let intGens start = + let v = Array.create 3 dequeIntGen + v.[1] <- dequeIntOfSeqGen |> Gen.filter (fun (q, l) -> l.Length >= start) + v.[2] <- dequeIntConjGen |> Gen.filter (fun (q, l) -> l.Length >= start) + v + + let intGensStart1 = + intGens 1 //this will accept all + + let intGensStart2 = + intGens 2 // this will accept 11 out of 12 + + testList "Deque property tests" [ + + testPropertyWithConfig config10k "Deque fold matches build list rev" (Prop.forAll (Arb.fromGen dequeIntGen) <| + fun (q, l) -> q |> Deque.fold (fun l' elem -> elem::l') [] = List.rev l ) + + testPropertyWithConfig config10k "Deque OfSeq fold matches build list rev" (Prop.forAll (Arb.fromGen dequeIntOfSeqGen) <| + fun (q, l) -> q |> Deque.fold (fun l' elem -> elem::l') [] = List.rev l ) + + testPropertyWithConfig config10k "Deque Conj fold matches build list rev" (Prop.forAll (Arb.fromGen dequeIntConjGen) <| + fun (q, l) -> q |> Deque.fold (fun l' elem -> elem::l') [] = List.rev l ) + + testPropertyWithConfig config10k "Deque foldback matches build list" (Prop.forAll (Arb.fromGen dequeIntGen) <| + fun (q, l) -> Deque.foldBack (fun elem l' -> elem::l') q [] = l ) + + testPropertyWithConfig config10k "Deque OfSeq foldback matches build list" (Prop.forAll (Arb.fromGen dequeIntOfSeqGen) <| + fun (q, l) -> Deque.foldBack (fun elem l' -> elem::l') q [] = l ) + + testPropertyWithConfig config10k "Deque Conj foldback matches build list" (Prop.forAll (Arb.fromGen dequeIntConjGen) <| + fun (q, l) -> Deque.foldBack (fun elem l' -> elem::l') q [] = l ) + + testPropertyWithConfig config10k "int deque builds and serializes 0" (Prop.forAll (Arb.fromGen intGensStart1.[0]) <| + fun (q, l) -> q |> Seq.toList = l ) + + testPropertyWithConfig config10k "int deque builds and serializes 1" (Prop.forAll (Arb.fromGen intGensStart1.[1]) <| + fun (q, l) -> q |> Seq.toList = l ) + + testPropertyWithConfig config10k "int deque builds and serializes 2" (Prop.forAll (Arb.fromGen intGensStart1.[2]) <| + fun (q, l) -> q |> Seq.toList = l ) + + testPropertyWithConfig config10k "obj deque builds and serializes" (Prop.forAll (Arb.fromGen dequeObjGen) <| + fun (q, l) -> q |> Seq.toList = l ) + + testPropertyWithConfig config10k "string deque builds and serializes" (Prop.forAll (Arb.fromGen dequeStringGen) <| + fun (q , l) -> q |> Seq.toList = l ) + + testPropertyWithConfig config10k "obj Deque reverse . reverse = id" (Prop.forAll (Arb.fromGen dequeObjGen) <| + fun (q, l) -> q |> Deque.rev |> Deque.rev |> Seq.toList = (q |> Seq.toList) ) - let mid1 = - match d with - | Cons(h, Conj(i, l)) -> i - | _ -> d - - let head, last = - match mid1 with - | Cons(h, Conj(i, l)) -> h, l - | _ -> "x", "x" - - ((head = "e") && (last = "b")) |> should equal true - -[] -let ``rev deque length 1``() = - rev len1 |> head |> should equal "a" - -[] -let ``rev deque length 2``() = - let r1 = rev len2 - let h1 = head r1 - let t2 = tail r1 - let h2 = head t2 - - ((h1 = "a") && (h2 = "b")) |> should equal true - -[] -let ``rev deque length 3``() = - let r1 = rev len3 - let h1 = head r1 - let t2 = tail r1 - let h2 = head t2 - let t3 = tail t2 - let h3 = head t3 - - ((h1 = "a") && (h2 = "b") && (h3 = "c")) |> should equal true - -[] -let ``rev deque length 4``() = - let r1 = rev len4 - let h1 = head r1 - let t2 = tail r1 - let h2 = head t2 - let t3 = tail t2 - let h3 = head t3 - let t4 = tail t3 - let h4 = head t4 - - ((h1 = "a") && (h2 = "b") && (h3 = "c") && (h4 = "d")) |> should equal true - -[] -let ``rev deque length 5``() = - let r1 = rev len5 - let h1 = head r1 - let t2 = tail r1 - let h2 = head t2 - let t3 = tail t2 - let h3 = head t3 - let t4 = tail t3 - let h4 = head t4 - let t5 = tail t4 - let h5 = head t5 - - ((h1 = "a") && (h2 = "b") && (h3 = "c") && (h4 = "d") && (h5 = "e")) |> should equal true - -[] -//length 6 more than sufficient to test rev -let ``rev deque length 6``() = - let r1 = rev len6 - let h1 = head r1 - let t2 = tail r1 - let h2 = head t2 - let t3 = tail t2 - let h3 = head t3 - let t4 = tail t3 - let h4 = head t4 - let t5 = tail t4 - let h5 = head t5 - let t6 = tail t5 - let h6 = head t6 - - ((h1 = "a") && (h2 = "b") && (h3 = "c") && (h4 = "d") && (h5 = "e") && (h6 = "f")) |> should equal true - -[] -let ``tryUncons on empty``() = - let q = empty - (tryUncons q = None) |> should equal true - -[] -let ``tryUncons on q``() = - let q = ofSeq ["a";"b";"c";"d"] - let x, xs = (tryUncons q).Value - x |> should equal "a" - -[] -let ``tryUnconj on empty``() = - let q = empty - (tryUnconj q = None) |> should equal true - -[] -let ``tryUnconj on q``() = - let q = ofSeq ["a";"b";"c";"d"] - let xs, x = (tryUnconj q).Value - x |> should equal "d" - -[] -let ``tryHead on empty``() = - let q = empty - (tryHead q = None) |> should equal true - -[] -let ``tryHead on q``() = - let q = ofSeq ["a";"b";"c";"d"] - (tryHead q).Value |> should equal "a" - -[] -let ``tryInitial on empty``() = - let q = empty - (tryInitial q = None) |> should equal true - -[] -let ``tryinitial on q``() = - let q = ofSeq ["a";"b";"c";"d"] - let x = (tryInitial q).Value - let x2 = x|> last - x2 |> should equal "c" - -[] -let ``tryLast on empty``() = - let q = empty - (tryLast q = None) |> should equal true - -[] -let ``tryLast on deque``() = - let q = ofSeq ["a";"b";"c";"d"] - (tryLast q).Value |> should equal "d" - (len2 |> tryLast).Value |> should equal "a" - (len2conj |> tryLast).Value |> should equal "a" - -[] -let ``tryTail on empty``() = - let q = empty - (tryTail q = None) |> should equal true - -[] -let ``tryTail on q``() = - let q = ofSeq ["a";"b";"c";"d"] - (tryTail q).Value |> head |> should equal "b" - -[] -let ``structural equality``() = - - let l1 = ofSeq [1..100] - let l2 = ofSeq [1..100] - - l1 = l2 |> should equal true - - let l3 = ofSeq [1..99] |> conj 7 - - l1 = l3 |> should equal false \ No newline at end of file + testPropertyWithConfig config10k "Deque ofList build and serialize" (Prop.forAll (Arb.fromGen dequeOfListGen) <| + fun (q, l) -> q |> Seq.toList = l ) + + testPropertyWithConfig config10k "get head from deque 0" (Prop.forAll (Arb.fromGen intGensStart1.[0]) <| + fun (q, l) -> Deque.head q = List.item 0 l ) + + testPropertyWithConfig config10k "get head from deque 1" (Prop.forAll (Arb.fromGen intGensStart1.[1]) <| + fun (q, l) -> Deque.head q = List.item 0 l ) + + testPropertyWithConfig config10k "get head from deque 2" (Prop.forAll (Arb.fromGen intGensStart1.[2]) <| + fun (q, l) -> Deque.head q = List.item 0 l ) + + testPropertyWithConfig config10k "get head from deque safely 0" (Prop.forAll (Arb.fromGen intGensStart1.[0]) <| + fun (q, l) -> (Deque.tryHead q).Value = List.item 0 l ) + + testPropertyWithConfig config10k "get head from deque safely 1" (Prop.forAll (Arb.fromGen intGensStart1.[1]) <| + fun (q, l) -> (Deque.tryHead q).Value = List.item 0 l ) + + testPropertyWithConfig config10k "get head from deque safely 2" (Prop.forAll (Arb.fromGen intGensStart1.[2]) <| + fun (q, l) -> (Deque.tryHead q).Value = List.item 0 l ) + + testPropertyWithConfig config10k "get Deque.tail from deque 0" (Prop.forAll (Arb.fromGen intGensStart2.[0]) <| + fun (q, l) -> q.Tail.Head = List.item 1 l ) + + testPropertyWithConfig config10k "get Deque.tail from deque 1" (Prop.forAll (Arb.fromGen intGensStart2.[1]) <| + fun (q, l) -> q.Tail.Head = List.item 1 l ) + + testPropertyWithConfig config10k "get Deque.tail from deque 2" (Prop.forAll (Arb.fromGen intGensStart2.[2]) <| + fun (q, l) -> q.Tail.Head = List.item 1 l ) + + testPropertyWithConfig config10k "get Deque.tail from deque safely 0" (Prop.forAll (Arb.fromGen intGensStart2.[0]) <| + fun (q, l) -> q.TryTail.Value.Head = List.item 1 l ) + + testPropertyWithConfig config10k "get Deque.tail from deque safely 1" (Prop.forAll (Arb.fromGen intGensStart2.[1]) <| + fun (q, l) -> q.TryTail.Value.Head = List.item 1 l ) + + testPropertyWithConfig config10k "get Deque.tail from deque safely 2" (Prop.forAll (Arb.fromGen intGensStart2.[2]) <| + fun (q, l) -> q.TryTail.Value.Head = List.item 1 l ) + + testPropertyWithConfig config10k "get Deque.initial from deque 0" (Prop.forAll (Arb.fromGen intGensStart2.[0]) <| + fun (q, l) -> List.ofSeq (Deque.initial q) = (List.rev l |> List.tail |> List.rev) ) + + testPropertyWithConfig config10k "get Deque.initial from deque 1" (Prop.forAll (Arb.fromGen intGensStart2.[1]) <| + fun (q, l) -> List.ofSeq (Deque.initial q) = (List.rev l |> List.tail |> List.rev) ) + + testPropertyWithConfig config10k "get Deque.initial from deque 2" (Prop.forAll (Arb.fromGen intGensStart2.[2]) <| + fun (q, l) -> List.ofSeq (Deque.initial q) = (List.rev l |> List.tail |> List.rev) ) + + testPropertyWithConfig config10k "get Deque.initial from deque safely 0" (Prop.forAll (Arb.fromGen intGensStart2.[0]) <| + fun (q, l) -> List.ofSeq q.TryInitial.Value = (List.rev l |> List.tail |> List.rev) ) + + testPropertyWithConfig config10k "get Deque.initial from deque safely 1" (Prop.forAll (Arb.fromGen intGensStart2.[1]) <| + fun (q, l) -> List.ofSeq q.TryInitial.Value = (List.rev l |> List.tail |> List.rev) ) + + testPropertyWithConfig config10k "get Deque.initial from deque safely 2" (Prop.forAll (Arb.fromGen intGensStart2.[2]) <| + fun (q, l) -> List.ofSeq q.TryInitial.Value = (List.rev l |> List.tail |> List.rev) ) + ] \ No newline at end of file diff --git a/tests/FSharpx.Collections.Tests/DictionaryExtensionsTests.fs b/tests/FSharpx.Collections.Tests/DictionaryExtensionsTests.fs index 2c9553a8..b7e382c1 100644 --- a/tests/FSharpx.Collections.Tests/DictionaryExtensionsTests.fs +++ b/tests/FSharpx.Collections.Tests/DictionaryExtensionsTests.fs @@ -1,19 +1,20 @@ -module FSharpx.Collections.Tests.DictionaryExtensionsTest +namespace FSharpx.Collections.Tests open FSharpx.Collections -open NUnit.Framework -open FsUnit +open Expecto +open Expecto.Flip -[] -let ``dictionary tryfind with some``() = - let a = dict [1,"one"; 2,"two"] - let v = a |> Dictionary.tryFind 1 - match v with - | Some a -> a |> should equal "one" - | None -> failwith "key should have been found" +module DictionaryExtensionsTests = -[] -let ``dictionary tryfind with none``() = - let a = dict [1,"one"; 2,"two"] - let v = a |> Dictionary.tryFind 3 - v |> should sameAs None + [] + let testDictionaryExtensions = + testList "DictionaryExtensions" [ + + test "dictionary tryfind with some" { + let a = dict [1,"one"; 2,"two"] + Expect.equal "tryfind" (Some "one") (a |> Dictionary.tryFind 1) } + + test "dictionary tryfind with none" { + let a = dict [1,"one"; 2,"two"] + Expect.isNone "tryfind" (a |> Dictionary.tryFind 3) } + ] diff --git a/tests/FSharpx.Collections.Tests/FSharpx.Collections.Tests.fsproj b/tests/FSharpx.Collections.Tests/FSharpx.Collections.Tests.fsproj index 22657ebb..b30c8296 100644 --- a/tests/FSharpx.Collections.Tests/FSharpx.Collections.Tests.fsproj +++ b/tests/FSharpx.Collections.Tests/FSharpx.Collections.Tests.fsproj @@ -1,76 +1,20 @@ - - + + - Debug - AnyCPU - 2.0 b397365b-f6ef-4abc-94f1-8f6ea900bf20 - Library + Exe FSharpx.Collections.Tests FSharpx.Collections.Tests FSharpx.Collections.Tests - 4.3.0.0 - v4.5 - - $(MSBuildProjectDirectory)\..\..\ + net47 + true - - true - full - false - bin\Debug - TRACE;DEBUG - prompt - 3 - - - - - - pdbonly - true - bin\Release\ - TRACE - 3 - - - 11 - - - - - - $(MSBuildExtensionsPath32)\..\Microsoft SDKs\F#\3.0\Framework\v4.0\Microsoft.FSharp.Targets - - - - - $(MSBuildExtensionsPath32)\Microsoft\VisualStudio\v$(VisualStudioVersion)\FSharp\Microsoft.FSharp.Targets - - - - - - - - - + @@ -87,12 +31,7 @@ - - - - - - + @@ -101,55 +40,5 @@ True - - - - - - - ..\..\packages\FsCheck\lib\net40-Client\FsCheck.dll - True - True - - - - - - - - - ..\..\packages\FSharp.Core\lib\net45\FSharp.Core.dll - True - True - - - - - - - - - ..\..\packages\FsUnit\lib\net45\FsUnit.NUnit.dll - True - True - - - ..\..\packages\FsUnit\lib\net45\NHamcrest.dll - True - True - - - - - - - - - ..\..\packages\NUnit\lib\nunit.framework.dll - True - True - - - - + \ No newline at end of file diff --git a/tests/FSharpx.Collections.Tests/FsCheckProperties.fs b/tests/FSharpx.Collections.Tests/FsCheckProperties.fs index 128eea09..39848ea8 100644 --- a/tests/FSharpx.Collections.Tests/FsCheckProperties.fs +++ b/tests/FSharpx.Collections.Tests/FsCheckProperties.fs @@ -1,21 +1,11 @@ module FSharpx.Collections.Tests.Properties -open FSharpx +open Expecto open FSharpx.Collections open FsCheck -open FsCheck.NUnit - -let checkEquality<'a when 'a : equality> name = - let n = sprintf "%s : equality %s" name - fsCheck (n "identity") <| - fun (x: 'a) -> x = x - fsCheck (n "predicate") <| - // depends a lot on the quality of the generated predicates, i.e. a constant predicate isn't useful. - fun (f: 'a -> bool) x y -> f x = f y - fsCheck (n "transitive") <| - // not very useful, it's not likely that relevant values will be generated - fun (x: 'a) (y: 'a) (z: 'a) -> - if x = y && y = z then x = z else true + +let configReplay = { FsCheckConfig.defaultConfig with maxTest = 10000 ; replay = Some <| (1940624926, 296296394) } +let config10k = { FsCheckConfig.defaultConfig with maxTest = 10000 } let classifyCollect xs (count : int) (y : bool) = y |> Prop.collect count diff --git a/tests/FSharpx.Collections.Tests/FsCheckRunner.fs b/tests/FSharpx.Collections.Tests/FsCheckRunner.fs deleted file mode 100644 index d0662cd3..00000000 --- a/tests/FSharpx.Collections.Tests/FsCheckRunner.fs +++ /dev/null @@ -1,24 +0,0 @@ -module FsCheck.NUnit - -open FSharpx -open FsCheck -open NUnit.Framework - -let private nUnitRunner = - { new IRunner with - member x.OnStartFixture t = () - member x.OnArguments(ntest, args, every) = () - member x.OnShrink(args, everyShrink) = () - member x.OnFinished(name, result) = - match result with - | TestResult.True data -> - printfn "%s" (Runner.onFinishedToString name result) - | _ -> Assert.Fail(Runner.onFinishedToString name result) } - -let private nUnitConfig = { Config.Default with Runner = nUnitRunner } - -let fsCheck name testable = - FsCheck.Check.One (name, nUnitConfig, testable) - -module Gen = - let ap x y = Gen.apply y x \ No newline at end of file diff --git a/tests/FSharpx.Collections.Tests/FsUnit.fs b/tests/FSharpx.Collections.Tests/FsUnit.fs deleted file mode 100644 index f656da54..00000000 --- a/tests/FSharpx.Collections.Tests/FsUnit.fs +++ /dev/null @@ -1,48 +0,0 @@ -module FsUnit - -open NUnit.Framework -open NUnit.Framework.Constraints - -let should (f : 'a -> #Constraint) x (y : obj) = - let c = f x - let y = - match y with - | :? (unit -> unit) -> box (new TestDelegate(y :?> unit -> unit)) - | _ -> y - Assert.That(y, c) - -let equal x = new EqualConstraint(x) - -// like "should equal", but validates same-type -let shouldEqual (x: 'a) (y: 'a) = Assert.AreEqual(x, y, sprintf "Expected: %A\nActual: %A" x y) - - -// like "should equal", but validates same-type -let shouldNotEqual (x: 'a) (y: 'a) = Assert.AreNotEqual(x, y, sprintf "Expected: %A\nActual: %A" x y) - -// overriding a standard language function is not cool -//let not x = new NotConstraint(x) - -let contain x = new ContainsConstraint(x) - -let haveLength n = Has.Length.EqualTo(n) - -let haveCount n = Has.Count.EqualTo(n) - -let be = id - -let Null = new NullConstraint() - -let Empty = new EmptyConstraint() - -let EmptyString = new EmptyStringConstraint() - -let NullOrEmptyString = new NullOrEmptyStringConstraint() - -let True = new TrueConstraint() - -let False = new FalseConstraint() - -let sameAs x = new SameAsConstraint(x) - -let throw = Throws.TypeOf diff --git a/tests/FSharpx.Collections.Tests/HeapTest.fs b/tests/FSharpx.Collections.Tests/HeapTest.fs index 39709f0a..e05bf1a4 100644 --- a/tests/FSharpx.Collections.Tests/HeapTest.fs +++ b/tests/FSharpx.Collections.Tests/HeapTest.fs @@ -1,268 +1,376 @@ -module FSharpx.Collections.Tests.HeapTest +namespace FSharpx.Collections.Tests -open FSharpx open FSharpx.Collections -open FSharpx.Collections.Heap -open FSharpx.Collections.Tests.Properties -open NUnit.Framework +open Properties open FsCheck -open FsCheck.NUnit -open FsUnit - -//only going up to 5 elements is probably sufficient to test all edge cases - -let insertThruList l h = - List.fold (fun (h' : Heap<'a>) x -> h'.Insert x ) h l - -let maxHeapIntGen = - gen { let! n = Gen.length2thru12 - let! n2 = Gen.length1thru12 - let! x = Gen.listInt n - let! y = Gen.listInt n2 - return ( (Heap.ofSeq true x |> insertThruList y), ((x @ y) |> List.sort |> List.rev) ) } - -let maxHeapIntOfSeqGen = - gen { let! n = Gen.length1thru12 - let! x = Gen.listInt n - return ( (Heap.ofSeq true x), (x |> List.sort |> List.rev) ) } - -let maxHeapIntInsertGen = - gen { let! n = Gen.length1thru12 - let! x = Gen.listInt n - return ( (Heap.empty true |> insertThruList x), (x |> List.sort |> List.rev) ) } - -let maxHeapStringGen = - gen { let! n = Gen.length1thru12 - let! n2 = Gen.length2thru12 - let! x = Gen.listString n - let! y = Gen.listString n2 - return ( (Heap.ofSeq true x |> insertThruList y), ((x @ y) |> List.sort |> List.rev) ) } - -let minHeapIntGen = - gen { let! n = Gen.length2thru12 - let! n2 = Gen.length1thru12 - let! x = Gen.listInt n - let! y = Gen.listInt n2 - return ( (Heap.ofSeq false x |> insertThruList y), ((x @ y) |> List.sort) ) } - -let minHeapIntOfSeqGen = - gen { let! n = Gen.length1thru12 - let! x = Gen.listInt n - return ( (Heap.ofSeq false x), (x |> List.sort) ) } - -let minHeapIntInsertGen = - gen { let! n = Gen.length1thru12 - let! x = Gen.listInt n - return ( (Heap.empty false |> insertThruList x), (x |> List.sort) ) } - -let minHeapStringGen = - gen { let! n = Gen.length1thru12 - let! n2 = Gen.length2thru12 - let! x = Gen.listString n - let! y = Gen.listString n2 - return ( (Heap.ofSeq false x |> insertThruList y), ((x @ y) |> List.sort) ) } - -// NUnit TestCaseSource does not understand array of tuples at runtime -let intGens start = - let v = Array.create 6 (box (maxHeapIntGen, "max Heap int")) - v.[1] <- box ((maxHeapIntOfSeqGen |> Gen.suchThat (fun (q, l) -> l.Length >= start)), "max Heap OfSeq") - v.[2] <- box ((maxHeapIntInsertGen |> Gen.suchThat (fun (q, l) -> l.Length >= start)), "max Heap from Insert") - v.[3] <- box (minHeapIntGen , "min Heap int") - v.[4] <- box ((minHeapIntOfSeqGen |> Gen.suchThat (fun (q, l) -> l.Length >= start)), "min Heap OfSeq") - v.[5] <- box ((minHeapIntInsertGen |> Gen.suchThat (fun (q, l) -> l.Length >= start)), "min Heap from Insert") - v - -let stringGens = - let v = Array.create 2 (box (maxHeapStringGen, "max Heap string")) - v.[1] <- box (minHeapStringGen, "min Heap string") - v - -let intGensStart1 = - intGens 1 //this will accept all - -let intGensStart2 = - intGens 2 // this will accept 11 out of 12 - -[] -let ``cons pattern discriminator``() = - let h = ofSeq true ["f";"e";"d";"c";"b";"a"] - let h1, t1 = uncons h - - let h2, t2 = - match t1 with - | Cons(h, t) -> h, t - | _ -> "x", t1 - - ((h2 = "e") && ((length t2) = 4)) |> should equal true - -[] -let ``cons pattern discriminator 2``() = - let h = ofSeq true ["f";"e";"d";"c";"b";"a"] - - let t2 = - match h with - | Cons("f", Cons(_, t)) -> t - | _ -> h - - let h1, t3 = uncons t2 - - ((h1 = "d") && ((length t2) = 4)) |> should equal true - -[] -let ``empty list should be empty``() = - (Heap.empty true).IsEmpty |> should equal true - -[] -[] -let ``head should return``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun ((h : Heap), (l : int list)) -> - (h.Head = l.Head) )) -[] -let ``insert works``() = - (((Heap.empty true).Insert 1).Insert 2).IsEmpty |> should equal false - -[] -let ``seq enumerate matches build list``() = - - fsCheck "maxHeap" (Prop.forAll (Arb.fromGen maxHeapIntGen) - (fun (h, l) -> h |> List.ofSeq = l |> classifyCollect h (h.Length))) - - fsCheck "minHeap" (Prop.forAll (Arb.fromGen minHeapIntGen) - (fun (h, l) -> h |> List.ofSeq = l |> classifyCollect h (h.Length))) - -[] -let ``rev works``() = - - let h = empty true - h |> rev |> isEmpty |> should equal true - let h' = empty false - h' |> rev |> isEmpty |> should equal true - - fsCheck "isDescending" (Prop.forAll (Arb.fromGen maxHeapIntGen) - (fun (h, l) -> h |> rev |> List.ofSeq = (h |> List.ofSeq |> List.rev) )) - - fsCheck "ascending" (Prop.forAll (Arb.fromGen minHeapIntGen) - (fun (h, l) -> h |> rev |> List.ofSeq = (h |> List.ofSeq |> List.rev) )) - -[] -let ``length of empty is 0``() = - (Heap.empty true).Length |> should equal 0 - -[] -[] -let ``seq enumerate matches build list int``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun (h : Heap, l) -> h |> Seq.toList = l )) - -[] -[] -let ``seq enumerate matches build list string``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun (h : Heap, l) -> h |> Seq.toList = l )) - -[] -[] -let ``tail should return``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun ((h : Heap), (l : int list)) -> - let tl = h.Tail() - let tlHead = - if (tl.Length > 0) then (tl.Head = l.Item(1)) - else true - (tlHead && (tl.Length = (l.Length - 1))) )) - -[] -let ``tryHead on empty should return None``() = - (Heap.empty true).TryHead |> should equal None - -[] -[] -let ``tryHead should return``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun ((h : Heap), (l : int list)) -> - (h.TryHead.Value = l.Head) )) - -[] -let ``tryTail on empty should return None``() = - (Heap.empty true).TryTail() |> should equal None - -[] -let ``tryTail on len 1 should return Some empty``() = - let h = Heap.empty true |> insert 1 |> tryTail - h.Value |> isEmpty |> should equal true - -[] -let ``tryMerge max and mis should be None``() = - let h1 = ofSeq true ["f";"e";"d";"c";"b";"a"] - let h2 = ofSeq false ["t";"u";"v";"w";"x";"y";"z"] - - tryMerge h1 h2 |> should equal None - -[] -let ``structural equality``() = - - let l1 = ofSeq true [1..100] - let l2 = ofSeq true [1..100] - - l1 = l2 |> should equal true - - let l3 = ofSeq true [1..99] |> insert 7 - - l1 = l3 |> should equal false - -[] -let ``toSeq to list``() = - let l = ["f";"e";"d";"c";"b";"a"] - let h = ofSeq true l - - h|> toSeq |> List.ofSeq |> should equal l - -[] -[] -let ``tryUncons 1 element``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun ((h : Heap), (l : int list)) -> - let x, tl = h.TryUncons().Value - ((x = l.Head) && (tl.Length = (l.Length - 1))) )) - -[] -let ``tryUncons empty``() = - (Heap.empty true).TryUncons() |> should equal None - -[] -[] -let ``uncons 1 element``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun ((h : Heap), (l : int list)) -> - let x, tl = h.Uncons() - ((x = l.Head) && (tl.Length = (l.Length - 1))) )) -[] -let ``Tail of large heap does no result in stackoverflow`` () = - let rnd = new System.Random() - let h = - [1..1000000] - |> Seq.sortBy (fun x -> rnd.Next()) - |> Heap.ofSeq false +open Expecto +open Expecto.Flip + +module HeapTests = + + [] + let testHeap = + testList "Heap" [ + + test "cons pattern discriminator" { + let h = Heap.ofSeq true ["f";"e";"d";"c";"b";"a"] + let h1, t1 = Heap.uncons h + + let h2, t2 = + match t1 with + | Heap.Cons(h, t) -> h, t + | _ -> "x", t1 + + Expect.isTrue "cons pattern" ((h2 = "e") && ((Heap.length t2) = 4)) } + + test "cons pattern discriminator 2" { + let h = Heap.ofSeq true ["f";"e";"d";"c";"b";"a"] + + let t2 = + match h with + | Heap.Cons("f", Heap.Cons(_, t)) -> t + | _ -> h + + let h1, t3 = Heap.uncons t2 + + Expect.isTrue "cons pattern" ((h1 = "d") && ((Heap.length t2) = 4)) } + + test "empty list should be empty" { + Expect.isTrue "empty" (Heap.empty true).IsEmpty } + + test "rev empty" { + let h = Heap.empty true + Expect.isTrue "" (h |> Heap.rev |> Heap.isEmpty) + let h' = Heap.empty false + Expect.isTrue "" (h' |> Heap.rev |> Heap.isEmpty) } + + test "insert works" { + Expect.isFalse "" (((Heap.empty true).Insert 1).Insert 2).IsEmpty } + + test "length of empty is 0" { + Expect.equal "empty" 0 (Heap.empty true).Length } + + test "tryHead on empty should return None" { + Expect.isNone "tryHead" (Heap.empty true).TryHead } + + test "tryTail on empty should return None" { + Expect.isNone "tryTail" <| (Heap.empty true).TryTail() } + + test "tryTail on len 1 should return Some empty" { + let h = Heap.empty true |> Heap.insert 1 |> Heap.tryTail + Expect.isTrue "tryTail" (h.Value |> Heap.isEmpty) } + + test "tryMerge max and min should be None" { + let h1 = Heap.ofSeq true ["f";"e";"d";"c";"b";"a"] + let h2 = Heap.ofSeq false ["t";"u";"v";"w";"x";"y";"z"] + + Expect.isNone "tryMerge" <| Heap.tryMerge h1 h2 } + + test "structural equality" { + let l1 = Heap.ofSeq true [1..100] + let l2 = Heap.ofSeq true [1..100] + + Expect.equal "structural equality" l1 l2 + + let l3 = Heap.ofSeq true [1..99] |> Heap.insert 7 + + Expect.notEqual "structural equality" l1 l3 } + + test "toSeq to list" { + let l = ["f";"e";"d";"c";"b";"a"] + let h = Heap.ofSeq true l + + Expect.equal "toSeq to list" l (h |> Heap.toSeq |> List.ofSeq) } + + test "tryUncons empty" { + Expect.isNone "TryUncons" <| (Heap.empty true).TryUncons() } + + test "Tail of large heap does not result in stackoverflow" { + let rnd = new System.Random() + let h = + [1..1000000] + |> Seq.sortBy (fun x -> rnd.Next()) + |> Heap.ofSeq false - Heap.tail h |> ignore - -type HeapGen = - static member Heap() = - let rec heapGen() = - gen { - let! n = Gen.length1thru100 - let! xs = Gen.listInt n - return Heap.ofSeq true xs - } - Arb.fromGen (heapGen()) - -let registerGen = lazy (Arb.register() |> ignore) - -//fsCheck having trouble with Heap -//FSharpx.Tests.HeapTest.monoid law: -//System.Exception : Geneflect: type not handled FSharpx.Collections.Heap`1[System.IComparable] -//[] -//let ``monoid law``() = -// registerGen.Force() -// checkMonoid "Heap" (Heap.monoid) \ No newline at end of file + Heap.tail h |> ignore + Expect.isTrue "" true } + ] + + [] + let propertyTestHeap = + //only going up to 5 elements is probably sufficient to test all edge cases + + let insertThruList l h = + List.fold (fun (h' : Heap<'a>) x -> h'.Insert x ) h l + + let maxHeapIntGen = + gen { let! n = Gen.length2thru12 + let! n2 = Gen.length1thru12 + let! x = Gen.listInt n + let! y = Gen.listInt n2 + return ( (Heap.ofSeq true x |> insertThruList y), ((x @ y) |> List.sort |> List.rev) ) } + + let maxHeapIntOfSeqGen = + gen { let! n = Gen.length1thru12 + let! x = Gen.listInt n + return ( (Heap.ofSeq true x), (x |> List.sort |> List.rev) ) } + + let maxHeapIntInsertGen = + gen { let! n = Gen.length1thru12 + let! x = Gen.listInt n + return ( (Heap.empty true |> insertThruList x), (x |> List.sort |> List.rev) ) } + + let maxHeapStringGen = + gen { let! n = Gen.length1thru12 + let! n2 = Gen.length2thru12 + let! x = Gen.listString n + let! y = Gen.listString n2 + return ( (Heap.ofSeq true x |> insertThruList y), ((x @ y) |> List.sort |> List.rev) ) } + + let minHeapIntGen = + gen { let! n = Gen.length2thru12 + let! n2 = Gen.length1thru12 + let! x = Gen.listInt n + let! y = Gen.listInt n2 + return ( (Heap.ofSeq false x |> insertThruList y), ((x @ y) |> List.sort) ) } + + let minHeapIntOfSeqGen = + gen { let! n = Gen.length1thru12 + let! x = Gen.listInt n + return ( (Heap.ofSeq false x), (x |> List.sort) ) } + + let minHeapIntInsertGen = + gen { let! n = Gen.length1thru12 + let! x = Gen.listInt n + return ( (Heap.empty false |> insertThruList x), (x |> List.sort) ) } + + let minHeapStringGen = + gen { let! n = Gen.length1thru12 + let! n2 = Gen.length2thru12 + let! x = Gen.listString n + let! y = Gen.listString n2 + return ( (Heap.ofSeq false x |> insertThruList y), ((x @ y) |> List.sort) ) } + + let intGens start = + let v = Array.create 6 maxHeapIntGen + v.[1] <- maxHeapIntOfSeqGen |> Gen.filter (fun (q, l) -> l.Length >= start) + v.[2] <- maxHeapIntInsertGen |> Gen.filter (fun (q, l) -> l.Length >= start) + v.[3] <- minHeapIntGen + v.[4] <- minHeapIntOfSeqGen |> Gen.filter (fun (q, l) -> l.Length >= start) + v.[5] <- minHeapIntInsertGen |> Gen.filter (fun (q, l) -> l.Length >= start) + v + + let stringGens = + let v = Array.create 2 maxHeapStringGen + v.[1] <- minHeapStringGen + v + + let intGensStart1 = + intGens 1 //this will accept all + + let intGensStart2 = + intGens 2 // this will accept 11 out of 12 + + testList "Heap property tests" [ + + testPropertyWithConfig config10k "head should return 0" (Prop.forAll (Arb.fromGen intGensStart2.[0]) <| + fun (h , l) -> h.Head = l.Head ) + + testPropertyWithConfig config10k "head should return 1" (Prop.forAll (Arb.fromGen intGensStart2.[1]) <| + fun (h , l) -> h.Head = l.Head ) + + testPropertyWithConfig config10k "head should return 2" (Prop.forAll (Arb.fromGen intGensStart2.[2]) <| + fun (h , l) -> h.Head = l.Head ) + + testPropertyWithConfig config10k "head should return 3" (Prop.forAll (Arb.fromGen intGensStart2.[3]) <| + fun (h , l) -> h.Head = l.Head ) + + testPropertyWithConfig config10k "head should return 4" (Prop.forAll (Arb.fromGen intGensStart2.[4]) <| + fun (h , l) -> h.Head = l.Head ) + + testPropertyWithConfig config10k "head should return 5" (Prop.forAll (Arb.fromGen intGensStart2.[5]) <| + fun (h , l) -> h.Head = l.Head ) + + testPropertyWithConfig config10k "maxHeap seq enumerate matches build list" (Prop.forAll (Arb.fromGen maxHeapIntGen) <| + fun (h, l) -> h |> List.ofSeq = l |> classifyCollect h h.Length ) + + testPropertyWithConfig config10k "minHeap seq enumerate matches build list" (Prop.forAll (Arb.fromGen minHeapIntGen) <| + fun (h, l) -> h |> List.ofSeq = l |> classifyCollect h h.Length ) + + testPropertyWithConfig config10k "rev works max heap" (Prop.forAll (Arb.fromGen maxHeapIntGen) <| + fun (h, l) -> h |> Heap.rev |> List.ofSeq = (h |> List.ofSeq |> List.rev) ) + + testPropertyWithConfig config10k "rev works min heap" (Prop.forAll (Arb.fromGen minHeapIntGen) <| + fun (h, l) -> h |> Heap.rev |> List.ofSeq = (h |> List.ofSeq |> List.rev) ) + + testPropertyWithConfig config10k "seq enumerate matches build list int 0" (Prop.forAll (Arb.fromGen intGensStart1.[0]) <| + fun (h , l) -> h |> Seq.toList = l ) + + testPropertyWithConfig config10k "seq enumerate matches build list int 1" (Prop.forAll (Arb.fromGen intGensStart1.[1]) <| + fun (h , l) -> h |> Seq.toList = l ) + + testPropertyWithConfig config10k "seq enumerate matches build list int 2" (Prop.forAll (Arb.fromGen intGensStart1.[2]) <| + fun (h , l) -> h |> Seq.toList = l ) + + testPropertyWithConfig config10k "seq enumerate matches build list int 3" (Prop.forAll (Arb.fromGen intGensStart1.[3]) <| + fun (h , l) -> h |> Seq.toList = l ) + + testPropertyWithConfig config10k "seq enumerate matches build list int 4" (Prop.forAll (Arb.fromGen intGensStart1.[4]) <| + fun (h , l) -> h |> Seq.toList = l ) + + testPropertyWithConfig config10k "seq enumerate matches build list int 5" (Prop.forAll (Arb.fromGen intGensStart1.[5]) <| + fun (h , l) -> h |> Seq.toList = l ) + + testPropertyWithConfig config10k "seq enumerate matches build list string 0" (Prop.forAll (Arb.fromGen stringGens.[0]) <| + fun (h : Heap, l) -> h |> Seq.toList = l ) + + testPropertyWithConfig config10k "seq enumerate matches build list string 1" (Prop.forAll (Arb.fromGen stringGens.[1]) <| + fun (h : Heap, l) -> h |> Seq.toList = l ) + + testPropertyWithConfig config10k "tail should return 0" (Prop.forAll (Arb.fromGen intGensStart2.[0]) <| + fun (h , l) -> + let tl = h.Tail() + let tlHead = + if (tl.Length > 0) then tl.Head = l.Item(1) + else true + tlHead && (tl.Length = l.Length - 1) ) + + testPropertyWithConfig config10k "tail should return 1" (Prop.forAll (Arb.fromGen intGensStart2.[1]) <| + fun (h , l) -> + let tl = h.Tail() + let tlHead = + if (tl.Length > 0) then tl.Head = l.Item(1) + else true + tlHead && (tl.Length = l.Length - 1) ) + + testPropertyWithConfig config10k "tail should return 2" (Prop.forAll (Arb.fromGen intGensStart2.[2]) <| + fun (h , l) -> + let tl = h.Tail() + let tlHead = + if (tl.Length > 0) then tl.Head = l.Item(1) + else true + tlHead && (tl.Length = l.Length - 1) ) + + testPropertyWithConfig config10k "tail should return 3" (Prop.forAll (Arb.fromGen intGensStart2.[3]) <| + fun (h , l) -> + let tl = h.Tail() + let tlHead = + if (tl.Length > 0) then tl.Head = l.Item(1) + else true + tlHead && (tl.Length = l.Length - 1) ) + + + testPropertyWithConfig config10k "tail should return 4" (Prop.forAll (Arb.fromGen intGensStart2.[4]) <| + fun (h , l) -> + let tl = h.Tail() + let tlHead = + if (tl.Length > 0) then tl.Head = l.Item(1) + else true + tlHead && (tl.Length = l.Length - 1) ) + + testPropertyWithConfig config10k "tail should return 5" (Prop.forAll (Arb.fromGen intGensStart2.[5]) <| + fun (h , l) -> + let tl = h.Tail() + let tlHead = + if (tl.Length > 0) then tl.Head = l.Item(1) + else true + tlHead && (tl.Length = l.Length - 1) ) + + testPropertyWithConfig config10k "tryHead should return 0" (Prop.forAll (Arb.fromGen intGensStart2.[0]) <| + fun (h , l) -> h.TryHead.Value = l.Head ) + + testPropertyWithConfig config10k "tryHead should return 1" (Prop.forAll (Arb.fromGen intGensStart2.[1]) <| + fun (h , l) -> h.TryHead.Value = l.Head ) + + testPropertyWithConfig config10k "tryHead should return 2" (Prop.forAll (Arb.fromGen intGensStart2.[2]) <| + fun (h , l) -> h.TryHead.Value = l.Head ) + + testPropertyWithConfig config10k "tryHead should return 3" (Prop.forAll (Arb.fromGen intGensStart2.[3]) <| + fun (h , l) -> h.TryHead.Value = l.Head ) + + testPropertyWithConfig config10k "tryHead should return 4" (Prop.forAll (Arb.fromGen intGensStart2.[4]) <| + fun (h , l) -> h.TryHead.Value = l.Head ) + + testPropertyWithConfig config10k "tryHead should return 5" (Prop.forAll (Arb.fromGen intGensStart2.[5]) <| + fun (h , l) -> h.TryHead.Value = l.Head ) + + testPropertyWithConfig config10k "tryUncons 1 element 0" (Prop.forAll (Arb.fromGen intGensStart2.[0]) <| + fun (h , l) -> + let x, tl = h.TryUncons().Value + x = l.Head && tl.Length = (l.Length - 1) ) + + testPropertyWithConfig config10k "tryUncons 1 element 1" (Prop.forAll (Arb.fromGen intGensStart2.[1]) <| + fun (h , l) -> + let x, tl = h.TryUncons().Value + x = l.Head && tl.Length = (l.Length - 1) ) + + testPropertyWithConfig config10k "tryUncons 1 element 2" (Prop.forAll (Arb.fromGen intGensStart2.[2]) <| + fun (h , l) -> + let x, tl = h.TryUncons().Value + x = l.Head && tl.Length = (l.Length - 1) ) + + testPropertyWithConfig config10k "tryUncons 1 element 3" (Prop.forAll (Arb.fromGen intGensStart2.[3]) <| + fun (h , l) -> + let x, tl = h.TryUncons().Value + x = l.Head && tl.Length = (l.Length - 1) ) + + testPropertyWithConfig config10k "tryUncons 1 element 4" (Prop.forAll (Arb.fromGen intGensStart2.[4]) <| + fun (h , l) -> + let x, tl = h.TryUncons().Value + x = l.Head && tl.Length = (l.Length - 1) ) + + testPropertyWithConfig config10k "tryUncons 1 element 5" (Prop.forAll (Arb.fromGen intGensStart2.[5]) <| + fun (h , l) -> + let x, tl = h.TryUncons().Value + x = l.Head && tl.Length = (l.Length - 1) ) + + testPropertyWithConfig config10k "Heap.uncons 1 element 0" (Prop.forAll (Arb.fromGen intGensStart2.[0]) <| + fun (h , l) -> + let x, tl = h.Uncons() + x = l.Head && tl.Length = (l.Length - 1) ) + + testPropertyWithConfig config10k "Heap.uncons 1 element 1" (Prop.forAll (Arb.fromGen intGensStart2.[1]) <| + fun (h , l) -> + let x, tl = h.Uncons() + x = l.Head && tl.Length = (l.Length - 1) ) + + testPropertyWithConfig config10k "Heap.uncons 1 element 2" (Prop.forAll (Arb.fromGen intGensStart2.[2]) <| + fun (h , l) -> + let x, tl = h.Uncons() + x = l.Head && tl.Length = (l.Length - 1) ) + + testPropertyWithConfig config10k "Heap.uncons 1 element 3" (Prop.forAll (Arb.fromGen intGensStart2.[3]) <| + fun (h , l) -> + let x, tl = h.Uncons() + x = l.Head && tl.Length = (l.Length - 1) ) + + testPropertyWithConfig config10k "Heap.uncons 1 element 4" (Prop.forAll (Arb.fromGen intGensStart2.[4]) <| + fun (h , l) -> + let x, tl = h.Uncons() + x = l.Head && tl.Length = (l.Length - 1) ) + + testPropertyWithConfig config10k "Heap.uncons 1 element 5" (Prop.forAll (Arb.fromGen intGensStart2.[5]) <| + fun (h , l) -> + let x, tl = h.Uncons() + x = l.Head && tl.Length = (l.Length - 1) ) + + //type HeapGen = + // static member Heap{ + // let rec heapGen{ + // gen { + // let! n = Gen.length1thru100 + // let! xs = Gen.listInt n + // return Heap.ofSeq true xs + // } + // Arb.fromGen (heapGen()) + + //let registerGen = lazy (Arb.register() |> ignore) + + //fsCheck having trouble with Heap + //FSharpx.Tests.HeapTest.monoid law: + //System.Exception : Geneflect: type not handled FSharpx.Collections.Heap`1[System.IComparable] + //[] + //testPropertyWithConfig config10k "monoid law" { + // registerGen.Force() + // checkMonoid "Heap" (Heap.monoid) + ] \ No newline at end of file diff --git a/tests/FSharpx.Collections.Tests/LazyListTests.fs b/tests/FSharpx.Collections.Tests/LazyListTests.fs index 5b1044a0..081f916c 100644 --- a/tests/FSharpx.Collections.Tests/LazyListTests.fs +++ b/tests/FSharpx.Collections.Tests/LazyListTests.fs @@ -1,189 +1,290 @@ -// First version copied from the F# Power Pack +namespace FSharpx.Collections.Tests +// First version copied from the F# Power Pack // https://raw.github.com/fsharp/powerpack/master/src/FSharp.PowerPack.Unittests/LazyListTests.fs -namespace FSharpx.Collections.Tests - open FSharpx.Collections -open FSharpx.Collections.Tests -open NUnit.Framework +open Expecto +open Expecto.Flip +open System.Collections.Generic #nowarn "40" -#nowarn "49" -[] -type public LazyListTests() = - - [] - member this.BasicTests1() = - - let l = LazyList.ofList [1;2;3] in - let res = ref 2 in - for i in (LazyList.toSeq l) do res := !res + i done; - check "test2398984: LazyList.toSeq" 8 !res; - let res = ref 2 in - for i in LazyList.toSeq l do - res := !res + i - done; - check "test2398984: LazyList.toSeq" 8 !res +module LazyList = + + let rec pairReduce xs = + match xs with + | LazyList.Cons (x, LazyList.Cons (y,ys)) -> LazyList.consDelayed (x+y) (fun () -> pairReduce ys) + | LazyList.Cons (x, LazyList.Nil) -> LazyList.cons x LazyList.empty + | LazyList.Nil -> LazyList.empty + + let rec inf = LazyList.consDelayed 0 (fun () -> LazyList.map (fun x -> x + 1) inf) + + let countEnumeratorsAndCheckedDisposedAtMostOnce numActiveEnumerators (seq: seq<'a>) = + let enumerator() = + let disposed = ref false in + let endReached = ref false in + let ie = seq.GetEnumerator() in + numActiveEnumerators := !numActiveEnumerators + 1; + { new System.Collections.Generic.IEnumerator<'a> with + member x.Current = + if !endReached then + failwith "end reached in Generic.IEnumerator.Current" + if !disposed then + failwith "disposed in Generic.IEnumerator.Current" + ie.Current + member x.Dispose() = + if !disposed then + failwith "disposed in Generic.IEnumerator.Dispose" + numActiveEnumerators := !numActiveEnumerators - 1; + disposed := true; + ie.Dispose() + interface System.Collections.IEnumerator with + member x.MoveNext() = + if !endReached then + failwith "end reached in IEnumerator.MoveNext" + if !disposed then + failwith "disposed in IEnumerator.MoveNext" + endReached := not (ie.MoveNext()); + not !endReached + member x.Current = + if !endReached then + failwith "end reached in IEnumerator.Current" + if !disposed then + failwith "disposed in IEnumerator.Current" + box ie.Current + member x.Reset() = + ie.Reset() + } in + + { new seq<'a> with + member x.GetEnumerator() = enumerator() + interface System.Collections.IEnumerable with + member x.GetEnumerator() = (enumerator() :> _) } + + let countEnumeratorsAndCheckedDisposedAtMostOnceAtEnd numActiveEnumerators (seq: seq<'a>) = + let enumerator() = + numActiveEnumerators := !numActiveEnumerators + 1; + let disposed = ref false in + let endReached = ref false in + let ie = seq.GetEnumerator() in + { new System.Collections.Generic.IEnumerator<'a> with + member x.Current = + if !endReached then + failwith "end reached in Generic.IEnumerator.Current" + if !disposed then + failwith "disposed in Generic.IEnumerator.Current" + ie.Current + member x.Dispose() = + if !endReached then + failwith "end reached in Generic.IEnumerator.Dispose" + if !disposed then + failwith "disposed in Generic.IEnumerator.Dispose" + numActiveEnumerators := !numActiveEnumerators - 1; + disposed := true; + ie.Dispose() + interface System.Collections.IEnumerator with + member x.MoveNext() = + if !endReached then + failwith "end reached in IEnumerator.MoveNext" + if !disposed then + failwith "disposed in IEnumerator.MoveNext" + endReached := not (ie.MoveNext()); + not !endReached + member x.Current = + if !endReached then + failwith "end reached in IEnumerator.Current" + if !disposed then + failwith "disposed in IEnumerator.Current" + box ie.Current + member x.Reset() = + ie.Reset() + } in + + { new seq<'a> with + member x.GetEnumerator() = enumerator() + interface System.Collections.IEnumerable with + member x.GetEnumerator() = (enumerator() :> _) } - [] - member this.BasicTests2() = - let l = LazyList.ofList [1;2;3] in - let res = ref 2 in - Seq.iter (fun i -> res := !res + i) (LazyList.toSeq l) - check "test2398994: foreach, LazyList.toSeq" 8 !res - - [] - member this.BasicTests3() = - - test "se1" (LazyList.isEmpty LazyList.empty) - test "se2" (not (LazyList.isEmpty (LazyList.cons 1 LazyList.empty))) - test "se3" (not (LazyList.isEmpty (LazyList.repeat 1))) - test "se4" (not (LazyList.isEmpty (LazyList.unfold (fun z -> Some (z,z+1)) 0))) - - test "seq1" (LazyList.head (LazyList.cons 1 LazyList.empty) = 1) - test "seq2" (LazyList.head (LazyList.cons 1 (LazyList.cons 2 LazyList.empty)) = 1) - test "seq3" (LazyList.head (LazyList.tail (LazyList.cons 1 (LazyList.cons 2 LazyList.empty))) = 2) - - test "tryHead empty" ((LazyList.tryHead LazyList.empty) = None) - test "tryHead seq1" ((LazyList.tryHead (LazyList.cons 1 LazyList.empty)).Value = 1) - test "tryHead seq2" ((LazyList.tryHead (LazyList.cons 1 (LazyList.cons 2 LazyList.empty))).Value = 1) - - test "tryTail empty" ((LazyList.tryTail LazyList.empty) = None) - test "tryTail seq1" (LazyList.isEmpty (LazyList.tryTail (LazyList.cons 1 LazyList.empty)).Value) - test "tryTail seq2" (LazyList.toList ((LazyList.tryTail (LazyList.cons 1 (LazyList.cons 2 LazyList.empty))).Value) = [2]) - test "tryTail seq3" (LazyList.toList ((LazyList.tryTail (LazyList.cons 1 (LazyList.cons 2 (LazyList.cons 3 LazyList.empty)))).Value) = [2;3]) - - let nats = LazyList.unfold (fun z -> Some (z,z+1)) 0 - test "take1" (LazyList.toList (LazyList.take 4 nats) = [0;1;2;3]) - test "drop1" (LazyList.head (LazyList.skip 4 nats) = 4) - test "drop1" (LazyList.head (LazyList.skip 0 nats) = 0) - - test "tryTake empty" ((LazyList.tryTake 4 LazyList.empty) = None) - test "tryTake0" (LazyList.isEmpty (LazyList.tryTake 0 LazyList.empty).Value) - test "tryTake1" (LazyList.toList (LazyList.tryTake 1 nats).Value = [0]) - test "tryTake4" (LazyList.toList (LazyList.tryTake 4 nats).Value = [0;1;2;3]) - test "tryTake4 from list of 3" (LazyList.toList (LazyList.tryTake 4 (LazyList.tryTake 3 nats).Value).Value = [0;1;2]) - - test "trySkip 0" (LazyList.head (LazyList.trySkip 0 nats).Value = 0) - test "trySkip 4" (LazyList.head (LazyList.trySkip 4 nats).Value = 4) - test "trySkip -1" ((LazyList.trySkip -1 nats) = None) - test "trySkip 4 from list of 3" ((LazyList.trySkip 4 (LazyList.tryTake 3 nats).Value) = None) - - test "tryUncons empty" ((LazyList.tryUncons LazyList.empty) = None) - let x, y = (LazyList.tryUncons (LazyList.take 1 nats)).Value - test "tryUncons 1" ((x, (LazyList.isEmpty y)) = (0, true)) - let x2, y2 = (LazyList.tryUncons (LazyList.take 2 nats)).Value - test "tryUncons 2" ((x2, (LazyList.toList y2)) = (0, [1])) - let x3, y3 = (LazyList.tryUncons (LazyList.take 3 nats)).Value - test "tryUncons 2" ((x3, (LazyList.toList y3)) = (0, [1;2])) - - let xa, ya = LazyList.uncons (LazyList.take 1 nats) - test "uncons 1" ((xa, (LazyList.isEmpty ya)) = (0, true)) - let xa2, ya2 = LazyList.uncons (LazyList.take 2 nats) - test "uncons 2" ((xa2, (LazyList.toList ya2)) = (0, [1])) - let xa3, ya3 = LazyList.uncons (LazyList.take 3 nats) - test "uncons 2" ((xa3, (LazyList.toList ya3)) = (0, [1;2])) - - let ll = LazyList.ofList [-5..-1] - let expected = (15, [5;4;3;2;1]) - let x, y = LazyList.mapAccum (fun a b -> let c = abs b in (a+c,c)) 0 ll - test "mapAccum" ((x, (LazyList.toList y)) = expected) - - let ll = LazyList.ofList [-5..-1] - let expected = 15 - let x = LazyList.fold (fun a b -> a + abs b) 0 ll - test "fold" (x = expected) - - test "repeat" (LazyList.toList (LazyList.take 4 (LazyList.repeat 1)) = [1;1;1;1]) - test "append" (LazyList.toList (LazyList.take 4 (LazyList.append (LazyList.cons 77 (LazyList.empty)) nats)) = [77;0;1;2]) - test "zip" (LazyList.toList (LazyList.take 3 (LazyList.zip nats (LazyList.skip 6 nats))) = [0,6;1,7; 2,8]) - test "firstS" (LazyList.tryFind (fun x -> x>=8) nats = Some 8) - test "firstN" (LazyList.tryFind (fun x -> x>=8) (LazyList.take 5 nats) = None) - test "find S" (LazyList.find (fun x -> x>=8) nats = 8) - test "find N" (let res = - try - LazyList.find (fun x -> x>=8) (LazyList.take 5 nats) - with - Not_found -> 9999 - res = 9999) (* testing for exception *) + [] + let testLazyList = + let nats = LazyList.unfold (fun z -> Some (z,z+1)) 0 let rec diverge () = diverge () - test "consfA" (LazyList.head (LazyList.consDelayed 1 diverge) = 1) - test "consfB" (let ss = LazyList.tail (LazyList.consDelayed 1 diverge) in true) (* testing for lazy divergence *) - test "dropDiverge1" (let ss = LazyList.skip 1 (LazyList.consDelayed 1 diverge) in true) (* testing for lazy divergence *) - test "dropDiverge0" (let ss = LazyList.skip 0 (LazyList.delayed (fun () -> failwith "errors")) in true) (* testing for lazy divergence *) - test "takedrop" (LazyList.toList (LazyList.take 3 (LazyList.skip 4 nats)) = [4;5;6]) - - test "filter" (LazyList.toList (LazyList.take 4 (LazyList.filter (fun x -> x % 2 = 0) nats)) = [0;2;4;6]) - test "map" (LazyList.toList (LazyList.take 4 (LazyList.map (fun x -> x+1) nats)) = [1;2;3;4]) - test "map2" (LazyList.toList (LazyList.take 4 (LazyList.map2 (fun x y -> x*y) nats (LazyList.tail nats))) = [0*1;1*2;2*3;3*4]) - - test "array" (Array.toList (LazyList.toArray (LazyList.take 6 nats)) = LazyList.toList (LazyList.take 6 nats)) - test "array" (LazyList.toList (LazyList.ofArray [|1;2;3;4|]) = LazyList.toList (LazyList.ofList [1;2;3;4])) - - // This checks that LazyList.map, LazyList.length etc. are tail recursive - check "LazyList.length" (LazyList.ofSeq (Seq.init 100 (fun c -> c)) |> LazyList.length) 100 - check "LazyList.length" (LazyList.ofSeq (Seq.init 1000000 (fun c -> c)) |> LazyList.length) 1000000 - check "LazyList.length" (LazyList.ofSeq (Seq.init 0 (fun c -> c)) |> LazyList.length) 0 - check "LazyList.map" (LazyList.map (fun x -> x + 1) (LazyList.ofSeq (Seq.init 1000000 (fun c -> c))) |> Seq.length) 1000000 - check "LazyList.filter" (LazyList.filter (fun x -> x % 2 = 0) (LazyList.ofSeq (Seq.init 1000000 (fun c -> c))) |> Seq.length) 500000 - check "LazyList.iter" (let count = ref 0 in LazyList.iter (fun x -> incr count) (LazyList.ofSeq (Seq.init 0 (fun c -> c))); !count) 0 - check "LazyList.iter" (let count = ref 0 in LazyList.iter (fun x -> incr count) (LazyList.ofSeq (Seq.init 1000000 (fun c -> c))); !count) 1000000 - check "LazyList.toList" (LazyList.toList (LazyList.ofSeq (Seq.init 200000 (fun c -> c))) |> Seq.length) 200000 - check "LazyList.toArray" (LazyList.toArray (LazyList.ofSeq (Seq.init 200000 (fun c -> c))) |> Seq.length) 200000 - - /// check exists on an infinite stream terminates - check "IEnumerableTest.exists" (Seq.exists ((=) "a") (LazyList.repeat "a" |> LazyList.toSeq)) true - /// check a succeeding 'exists' on a concat of an infinite number of finite streams terminates - check "IEnumerableTest.exists" (Seq.exists ((=) "a") (Seq.concat (LazyList.repeat [| "a"; "b"|] |> LazyList.toSeq))) true - /// check a succeeding 'exists' on a concat of an infinite number of infinite streams terminates - check "IEnumerableTest.exists" (Seq.exists ((=) "a") (Seq.concat (LazyList.repeat (LazyList.repeat "a" |> LazyList.toSeq) |> LazyList.toSeq))) true - /// check a failing for_all on an infinite stream terminates - check "IEnumerableTest.exists" (Seq.forall ((=) "a" >> not) (LazyList.repeat "a" |> LazyList.toSeq)) false - /// check a failing for_all on a concat of an infinite number of finite streams terminates - check "IEnumerableTest.exists" (Seq.forall ((=) "a" >> not) (Seq.concat (LazyList.repeat [| "a"; "b"|] |> LazyList.toSeq))) false - check "IEnumerableTest.append, infinite, infinite, then take" (Seq.take 2 (Seq.append (LazyList.repeat "a" |> LazyList.toSeq) (LazyList.repeat "b" |> LazyList.toSeq)) |> Seq.toList) [ "a"; "a" ] - /// check exists on an infinite stream terminates - check "IEnumerableTest.exists" (Seq.exists ((=) "a") (LazyList.repeat "a" |> LazyList.toSeq |> countEnumeratorsAndCheckedDisposedAtMostOnce)) true - check "" !numActiveEnumerators 0 - /// check a succeeding 'exists' on a concat of an infinite number of finite streams terminates - check "IEnumerableTest.exists" (Seq.exists ((=) "a") (Seq.concat (LazyList.repeat [| "a"; "b"|] |> LazyList.toSeq |> countEnumeratorsAndCheckedDisposedAtMostOnce))) true - check "" !numActiveEnumerators 0 - /// check a succeeding 'exists' on a concat of an infinite number of infinite streams terminates - check "IEnumerableTest.exists" (Seq.exists ((=) "a") (Seq.concat (LazyList.repeat (LazyList.repeat "a" |> LazyList.toSeq) |> LazyList.toSeq |> countEnumeratorsAndCheckedDisposedAtMostOnce))) true - check "" !numActiveEnumerators 0 - /// check a failing for_all on an infinite stream terminates - check "IEnumerableTest.exists" (Seq.forall ((=) "a" >> not) (LazyList.repeat "a" |> LazyList.toSeq |> countEnumeratorsAndCheckedDisposedAtMostOnce)) false - check "" !numActiveEnumerators 0 - - /// check a failing for_all on a concat of an infinite number of finite streams terminates - check "" !numActiveEnumerators 0 - check "IEnumerableTest.exists" (Seq.forall ((=) "a" >> not) (Seq.concat (LazyList.repeat [| "a"; "b"|] |> LazyList.toSeq |> countEnumeratorsAndCheckedDisposedAtMostOnce))) false - check "" !numActiveEnumerators 0 - check "IEnumerableTest.append, infinite, infinite, then take" (Seq.take 2 (Seq.append (LazyList.repeat "a" |> LazyList.toSeq) (LazyList.repeat "b" |> LazyList.toSeq)) |> countEnumeratorsAndCheckedDisposedAtMostOnceAtEnd |> Seq.toList) [ "a"; "a" ] - check "" !numActiveEnumerators 0 - - - [] - member this.PatternsTests() = - - let matchTwo ll = - match ll with - | LazyList.Cons(h1,LazyList.Cons(h2,t)) -> printf "%O,%O\n" h1 h2 - | LazyList.Cons(h1,t) -> printf "%O\n" h1 - | LazyList.Nil() -> printf "empty!\n" - - let rec pairReduce xs = - match xs with - | LazyList.Cons (x, LazyList.Cons (y,ys)) -> LazyList.consDelayed (x+y) (fun () -> pairReduce ys) - | LazyList.Cons (x, LazyList.Nil) -> LazyList.cons x LazyList.empty - | LazyList.Nil -> LazyList.empty - - let rec inf = LazyList.consDelayed 0 (fun () -> LazyList.map (fun x -> x + 1) inf) - - let ll = LazyList.ofList [1;2;3;4] - check "we09wek" (sprintf "%A" (LazyList.toList (LazyList.take 10 (pairReduce inf)))) "[1; 5; 9; 13; 17; 21; 25; 29; 33; 37]" - - check "we09wek" (LazyList.scan (+) 0 (LazyList.ofList [1;2]) |> LazyList.toList) [0;1;3] - check "we09wek" (LazyList.scan (+) 0 (LazyList.ofList []) |> LazyList.toList) [0] \ No newline at end of file + + testList "LazyList" [ + + test "test2398984: LazyList.toSeq" { + let l = LazyList.ofList [1;2;3] in + let res = ref 2 in + for i in (LazyList.toSeq l) do res := !res + i done + Expect.equal "LazyList.toSeq" 8 !res } + + test "test2398984: LazyList.toSeq 2" { + let l = LazyList.ofList [1;2;3] in + let res = ref 2 in + for i in LazyList.toSeq l do + res := !res + i + done + Expect.equal "LazyList.toSeq" 8 !res } + + test "test2398994: foreach, LazyList.toSeq" { + let l = LazyList.ofList [1;2;3] in + let res = ref 2 in + Seq.iter (fun i -> res := !res + i) (LazyList.toSeq l) + Expect.equal "LazyList.toSeq" 8 !res } + + test "se1" {Expect.isTrue "isEmpty" <| LazyList.isEmpty LazyList.empty } + test "se2" {Expect.isFalse "cons" <| LazyList.isEmpty (LazyList.cons 1 LazyList.empty) } + test "se3" {Expect.isFalse "repeat" <| LazyList.isEmpty (LazyList.repeat 1) } + test "se4" {Expect.isFalse "unfold" <| LazyList.isEmpty (LazyList.unfold (fun z -> Some (z,z+1)) 0) } + + test "seq1" {Expect.equal "cons" 1 <| LazyList.head (LazyList.cons 1 LazyList.empty) } + test "seq2" {Expect.equal "cons" 1 <| LazyList.head (LazyList.cons 1 (LazyList.cons 2 LazyList.empty)) } + test "seq3" {Expect.equal "cons" 2 <| LazyList.head (LazyList.tail (LazyList.cons 1 (LazyList.cons 2 LazyList.empty))) } + + test "tryHead empty" {Expect.isNone "tryHead" <| LazyList.tryHead LazyList.empty } + test "tryHead seq1" {Expect.equal "tryHead" 1 (LazyList.tryHead (LazyList.cons 1 LazyList.empty)).Value } + test "tryHead seq2" {Expect.equal "tryHead" 1 (LazyList.tryHead (LazyList.cons 1 (LazyList.cons 2 LazyList.empty))).Value } + + test "tryTail empty" {Expect.isNone "tryTail" (LazyList.tryTail LazyList.empty) } + test "tryTail seq1" {Expect.isTrue "tryTail" <| LazyList.isEmpty (LazyList.tryTail (LazyList.cons 1 LazyList.empty)).Value} + test "tryTail seq2" {Expect.equal "tryTail" [2] <| LazyList.toList ((LazyList.tryTail (LazyList.cons 1 (LazyList.cons 2 LazyList.empty))).Value) } + test "tryTail seq3" {Expect.equal "tryTail" [2;3] <| LazyList.toList ((LazyList.tryTail (LazyList.cons 1 (LazyList.cons 2 (LazyList.cons 3 LazyList.empty)))).Value) } + + test "take1" {Expect.equal "take1" [0;1;2;3] <| LazyList.toList (LazyList.take 4 nats) } + test "skip 4" {Expect.equal "drop1" 4 <| LazyList.head (LazyList.skip 4 nats) } + test "skip 0" {Expect.equal "drop1" 0 <| LazyList.head (LazyList.skip 0 nats) } + + test "tryTake empty" {Expect.isNone "tryTake" <| LazyList.tryTake 4 LazyList.empty } + test "tryTake0" {Expect.isTrue "tryTake0" <| LazyList.isEmpty (LazyList.tryTake 0 LazyList.empty).Value} + test "tryTake1" {Expect.equal "tryTake1" [0] <| LazyList.toList (LazyList.tryTake 1 nats).Value } + test "tryTake4" {Expect.equal "tryTake4" [0;1;2;3] <|LazyList.toList (LazyList.tryTake 4 nats).Value } + test "tryTake4 from list of 3" {Expect.equal "" [0;1;2] <| LazyList.toList (LazyList.tryTake 4 (LazyList.tryTake 3 nats).Value).Value } + + test "trySkip 0" {Expect.equal "" 0 <| LazyList.head (LazyList.trySkip 0 nats).Value } + test "trySkip 4" {Expect.equal "" 4 <| LazyList.head (LazyList.trySkip 4 nats).Value } + test "trySkip -1" {Expect.isNone "" <|LazyList.trySkip -1 nats } + test "trySkip 4 from list of 3" {Expect.isNone "" <| LazyList.trySkip 4 (LazyList.tryTake 3 nats).Value } + + test "tryUncons empty" {Expect.isNone "" <| LazyList.tryUncons LazyList.empty } + + test "tryUncons 1" { + let x, y = (LazyList.tryUncons (LazyList.take 1 nats)).Value + Expect.equal "tryUncons" (0, true) (x, (LazyList.isEmpty y)) } + + test "tryUncons take 2" { + let x2, y2 = (LazyList.tryUncons (LazyList.take 2 nats)).Value + Expect.equal "tryUncons" (0, [1]) (x2, (LazyList.toList y2)) } + + test "tryUncons take 3" { + let x3, y3 = (LazyList.tryUncons (LazyList.take 3 nats)).Value + Expect.equal "tryUncons" (0, [1;2]) (x3, (LazyList.toList y3)) } + + test "uncons 1" { + let xa, ya = LazyList.uncons (LazyList.take 1 nats) + Expect.equal "uncons" (0, true) (xa, (LazyList.isEmpty ya)) } + + test "uncons take 2" { + let xa2, ya2 = LazyList.uncons (LazyList.take 2 nats) + Expect.equal "uncons" (0, [1]) (xa2, (LazyList.toList ya2)) } + + test "uncons take 3" { + let xa3, ya3 = LazyList.uncons (LazyList.take 3 nats) + Expect.equal "uncons" (0, [1;2]) (xa3, (LazyList.toList ya3)) } + + test "mapAccum" { + let ll = LazyList.ofList [-5..-1] + let expected = (15, [5;4;3;2;1]) + let x, y = LazyList.mapAccum (fun a b -> let c = abs b in (a+c,c)) 0 ll + Expect.equal "mapAccum" expected (x, (LazyList.toList y)) } + + test "fold" { + let ll = LazyList.ofList [-5..-1] + let expected = 15 + Expect.equal "fold" expected <| LazyList.fold (fun a b -> a + abs b) 0 ll } + + test "repeat" {Expect.equal "take repeat" [1;1;1;1] <| LazyList.toList (LazyList.take 4 (LazyList.repeat 1)) } + test "append" {Expect.equal "append" [77;0;1;2] <| LazyList.toList (LazyList.take 4 (LazyList.append (LazyList.cons 77 (LazyList.empty)) nats)) } + test "zip" {Expect.equal "zip" [0,6;1,7; 2,8] <| LazyList.toList (LazyList.take 3 (LazyList.zip nats (LazyList.skip 6 nats))) } + test "firstS" {Expect.equal "tryFind" (Some 8) <| LazyList.tryFind (fun x -> x>=8) nats } + test "firstN" {Expect.isNone "take" <| LazyList.tryFind (fun x -> x>=8) (LazyList.take 5 nats) } + test "find S" {Expect.equal "find" 8 <| LazyList.find (fun x -> x>=8) nats } + + test "find N" {Expect.throwsT "find N" (fun () -> LazyList.find (fun x -> x>=8) (LazyList.take 5 nats) |> ignore) } + + test "consfA" {Expect.equal "consDelayed" 1 <| LazyList.head (LazyList.consDelayed 1 diverge) } + test "consfB" {Expect.isTrue "divergence" (let ss = LazyList.tail (LazyList.consDelayed 1 diverge) in true) } (* testing for lazy divergence *) + test "dropDiverge1" {Expect.isTrue "divergence" (let ss = LazyList.skip 1 (LazyList.consDelayed 1 diverge) in true) } (* testing for lazy divergence *) + test "dropDiverge0" {Expect.isTrue "divergence" (let ss = LazyList.skip 0 (LazyList.delayed (fun () -> failwith "errors")) in true) } (* testing for lazy divergence *) + + test "takedrop" {Expect.equal "takedrop" [4;5;6] <| LazyList.toList (LazyList.take 3 (LazyList.skip 4 nats)) } + test "filter" {Expect.equal "filter" [0;2;4;6] <| LazyList.toList (LazyList.take 4 (LazyList.filter (fun x -> x % 2 = 0) nats)) } + test "map" {Expect.equal "map" [1;2;3;4] <| LazyList.toList (LazyList.take 4 (LazyList.map (fun x -> x+1) nats)) } + test "map2" {Expect.equal "map2" [0*1;1*2;2*3;3*4] <| LazyList.toList (LazyList.take 4 (LazyList.map2 (fun x y -> x*y) nats (LazyList.tail nats))) } + + test "array take6" {Expect.equal "array" (LazyList.toList (LazyList.take 6 nats)) <| Array.toList (LazyList.toArray (LazyList.take 6 nats)) } + test "array list" {Expect.equal "array" (LazyList.toList (LazyList.ofArray [|1;2;3;4|])) <| LazyList.toList (LazyList.ofList [1;2;3;4]) } + + // This checks that LazyList.map, LazyList.length etc. are tail recursive + test "LazyList.length 100" {Expect.equal "length" 100 (LazyList.ofSeq (Seq.init 100 (fun c -> c)) |> LazyList.length) } + test "LazyList.length 1000000" {Expect.equal "length" 1000000 (LazyList.ofSeq (Seq.init 1000000 (fun c -> c)) |> LazyList.length) } + test "LazyList.length 0" {Expect.equal "length" 0 (LazyList.ofSeq (Seq.init 0 (fun c -> c)) |> LazyList.length) } + test "LazyList.map" {Expect.equal "map" 1000000 (LazyList.map (fun x -> x + 1) (LazyList.ofSeq (Seq.init 1000000 (fun c -> c))) |> Seq.length) } + test "LazyList.filter" {Expect.equal "filter" 500000 (LazyList.filter (fun x -> x % 2 = 0) (LazyList.ofSeq (Seq.init 1000000 (fun c -> c))) |> Seq.length) } + test "LazyList.iter 0" {Expect.equal "iter" 0 (let count = ref 0 in LazyList.iter (fun x -> incr count) (LazyList.ofSeq (Seq.init 0 (fun c -> c))); !count) } + test "LazyList.iter" {Expect.equal "iter" 1000000 (let count = ref 0 in LazyList.iter (fun x -> incr count) (LazyList.ofSeq (Seq.init 1000000 (fun c -> c))); !count) } + test "LazyList.toList" {Expect.equal "toList" 200000 (LazyList.toList (LazyList.ofSeq (Seq.init 200000 (fun c -> c))) |> Seq.length) } + test "LazyList.toArray" {Expect.equal "toArray" 200000 (LazyList.toArray (LazyList.ofSeq (Seq.init 200000 (fun c -> c))) |> Seq.length) } + + // check exists on an infinite stream terminates + test "IEnumerableTest.exists 1" {Expect.isTrue "exists" (Seq.exists ((=) "a") (LazyList.repeat "a" |> LazyList.toSeq)) } + // test a succeeding 'exists' on a concat of an infinite number of finite streams terminates + test "IEnumerableTest.exists 2" {Expect.isTrue "exists" (Seq.exists ((=) "a") (Seq.concat (LazyList.repeat [| "a"; "b"|] |> LazyList.toSeq))) } + // test a succeeding 'exists' on a concat of an infinite number of infinite streams terminates + test "IEnumerableTest.exists 3" {Expect.isTrue "exists" (Seq.exists ((=) "a") (Seq.concat (LazyList.repeat (LazyList.repeat "a" |> LazyList.toSeq) |> LazyList.toSeq))) } + // test a failing for_all on an infinite stream terminates + test "IEnumerableTest.exists 4" {Expect.isFalse "exists" (Seq.forall ((=) "a" >> not) (LazyList.repeat "a" |> LazyList.toSeq)) } + // test a failing for_all on a concat of an infinite number of finite streams terminates + test "IEnumerableTest.exists 5" {Expect.isFalse "exists" (Seq.forall ((=) "a" >> not) (Seq.concat (LazyList.repeat [| "a"; "b"|] |> LazyList.toSeq))) } + test "IEnumerableTest.append, infinite, infinite, then take 2" {Expect.equal "append, infinite, infinite, then take" [ "a"; "a" ] (Seq.take 2 (Seq.append (LazyList.repeat "a" |> LazyList.toSeq) (LazyList.repeat "b" |> LazyList.toSeq)) |> Seq.toList) } + + // test exists on an infinite stream terminates + test "IEnumerableTest.exists 6" { + let numActiveEnumerators = ref 0 + Expect.isTrue "exists" (Seq.exists ((=) "a") (LazyList.repeat "a" |> LazyList.toSeq |> countEnumeratorsAndCheckedDisposedAtMostOnce numActiveEnumerators )) + Expect.equal "" 0 !numActiveEnumerators } + + // test a succeeding 'exists' on a concat of an infinite number of finite streams terminates + test "IEnumerableTest.exists 7" { + let numActiveEnumerators = ref 0 + Expect.isTrue "" (Seq.exists ((=) "a") (Seq.concat (LazyList.repeat [| "a"; "b"|] |> LazyList.toSeq |> countEnumeratorsAndCheckedDisposedAtMostOnce numActiveEnumerators))) + Expect.equal "" 0 !numActiveEnumerators } + + // test a succeeding 'exists' on a concat of an infinite number of infinite streams terminates + test "IEnumerableTest.exists 8" { + let numActiveEnumerators = ref 0 + Expect.isTrue "" (Seq.exists ((=) "a") (Seq.concat (LazyList.repeat (LazyList.repeat "a" |> LazyList.toSeq) |> LazyList.toSeq |> countEnumeratorsAndCheckedDisposedAtMostOnce numActiveEnumerators))) + Expect.equal "" 0 !numActiveEnumerators} + + // test a failing for_all on an infinite stream terminates + test "IEnumerableTest.exists 9" { + let numActiveEnumerators = ref 0 + Expect.isFalse "exists" (Seq.forall ((=) "a" >> not) (LazyList.repeat "a" |> LazyList.toSeq |> countEnumeratorsAndCheckedDisposedAtMostOnce numActiveEnumerators)) + Expect.equal "" 0 !numActiveEnumerators } + + // check a failing for_all on a concat of an infinite number of finite streams terminates + test "IEnumerableTest.exists 10" { + let numActiveEnumerators = ref 0 + Expect.isFalse "exists" (Seq.forall ((=) "a" >> not) (Seq.concat (LazyList.repeat [| "a"; "b"|] |> LazyList.toSeq |> countEnumeratorsAndCheckedDisposedAtMostOnce numActiveEnumerators))) + Expect.equal "exists" 0 !numActiveEnumerators } + + test "IEnumerableTest.append, repeat" { + let numActiveEnumerators = ref 0 + Expect.equal "" [ "a"; "a" ] (Seq.take 2 (Seq.append (LazyList.repeat "a" |> LazyList.toSeq) (LazyList.repeat "b" |> LazyList.toSeq)) |> countEnumeratorsAndCheckedDisposedAtMostOnceAtEnd numActiveEnumerators |> Seq.toList) + Expect.equal "exists" 0 !numActiveEnumerators } + + test "pairReduce" {Expect.equal "pairReduce" [1; 5; 9; 13; 17; 21; 25; 29; 33; 37] <| LazyList.toList (LazyList.take 10 (pairReduce inf)) } + + test "scan 3" {Expect.equal "scan" [0;1;3] (LazyList.scan (+) 0 (LazyList.ofList [1;2]) |> LazyList.toList) } + test "scan 0" {Expect.equal "scan" [0] (LazyList.scan (+) 0 (LazyList.ofList []) |> LazyList.toList) } + ] diff --git a/tests/FSharpx.Collections.Tests/ListExtensionsTest.fs b/tests/FSharpx.Collections.Tests/ListExtensionsTest.fs index 680fe125..c44a222c 100644 --- a/tests/FSharpx.Collections.Tests/ListExtensionsTest.fs +++ b/tests/FSharpx.Collections.Tests/ListExtensionsTest.fs @@ -1,107 +1,95 @@ -module FSharpx.Collections.Tests.ListExtensionsTest +namespace FSharpx.Collections.Tests open FSharpx.Collections -open NUnit.Framework -open FsCheck -open FsCheck.NUnit -open FsUnit - -[] -let ``test List_split correctly breaks the list on the specified predicate``() = - let str = List.ofSeq "Howdy! Want to play?" - let expected = (List.ofSeq "Howdy!", List.ofSeq " Want to play?") - List.split (fun c -> c = ' ') str |> should equal expected - -[] -let ``test List_splitAt correctly breaks the list on the specified index``() = - let str = List.ofSeq "Howdy! Want to play?" - let expected = (List.ofSeq "Howdy!", List.ofSeq " Want to play?") - List.splitAt 6 str |> should equal expected - - -[] -let ``Can splitAt 3``() = - let list = [1..5] - let expected = [1;2;3],[4;5] - List.splitAt 3 list |> should equal expected - -[] -let ``Can split at 3``() = - let list = [1..5] - let expected = [1;2],[3;4;5] - List.split ((=) 3) list |> should equal expected - -[] -let ``Can split at 0``() = - let l1,l2 = List.split ((=) 0) [1..5] - l1 |> should equal [1..5] - l2 |> should equal [] - -[] -let ``test List_span correctly breaks the list on the specified predicate``() = - let str = List.ofSeq "Howdy! Want to play?" - let expected = (List.ofSeq "Howdy!", List.ofSeq " Want to play?") - List.span (fun c -> c <> ' ') str |> should equal expected - -[] -let lift2() = - List.lift2 (+) [0;1] [0;2] - |> should equal [0;2;1;3] - -[] -let mapAccum() = - let list = [-5..-1] - let expected = (15, [5;4;3;2;1]) - List.mapAccum (fun a b -> let c = abs b in (a+c,c)) 0 list |> should equal expected - -[] -let ``Should be able to merge to lists``() = - let a,b = [1;2;3;4;5], [6;7;8;9;10] - List.mergeBy id a b - |> should equal [1;2;3;4;5;6;7;8;9;10] - -[] -let ``Should be able to merge two lists II``() = - let a,b = [1;2;3;4;5], [6;7;8;9;10] - List.merge a b - |> should equal [1;2;3;4;5;6;7;8;9;10] - -[] -let ``I should be able to transpose a list``() = - let a = - [ - [1;2;3]; - [4;5;6] - ] - let expected = - [ - [1;4]; - [2;5]; - [3;6] +open FSharpx.Collections.Tests.Properties +open Expecto +open Expecto.Flip + +module ListExtensionsTests = + + let testListExtensions = + testList "ListExtensions" [ + + test "test List_split correctly breaks the list on the specified predicate" { + let str = List.ofSeq "Howdy! Want to play?" + let expected = (List.ofSeq "Howdy!", List.ofSeq " Want to play?") + Expect.equal "split" expected <| List.split (fun c -> c = ' ') str } + + test "test List_splitAt correctly breaks the list on the specified index" { + let str = List.ofSeq "Howdy! Want to play?" + let expected = (List.ofSeq "Howdy!", List.ofSeq " Want to play?") + Expect.equal "splitAt" expected <| List.splitAt 6 str } + + test "Can splitAt 3" { + let list = [1..5] + let expected = [1;2;3],[4;5] + Expect.equal "splitAt" expected <|List.splitAt 3 list } + + test "Can split at 3" { + let list = [1..5] + let expected = [1;2],[3;4;5] + Expect.equal "split" expected <| List.split ((=) 3) list } + + test "Can split at 0" { + let l1,l2 = List.split ((=) 0) [1..5] + Expect.equal "split" [1..5] l1 + Expect.equal "split" [] l2 } + + test "test List_span correctly breaks the list on the specified predicate" { + let str = List.ofSeq "Howdy! Want to play?" + let expected = (List.ofSeq "Howdy!", List.ofSeq " Want to play?") + Expect.equal "span" expected <| List.span (fun c -> c <> ' ') str } + + test "lift2" { + Expect.equal "lift2" [0;2;1;3] <| List.lift2 (+) [0;1] [0;2] } + + test "mapAccum" { + let list = [-5..-1] + let expected = (15, [5;4;3;2;1]) + Expect.equal "mapAccum" expected <| List.mapAccum (fun a b -> let c = abs b in (a+c,c)) 0 list } + + test "Should be able to merge to lists" { + let a,b = [1;2;3;4;5], [6;7;8;9;10] + Expect.equal "merge" [1;2;3;4;5;6;7;8;9;10] <| List.mergeBy id a b} + + test "Should be able to merge two lists II" { + let a,b = [1;2;3;4;5], [6;7;8;9;10] + Expect.equal "merge" [1;2;3;4;5;6;7;8;9;10] <| List.merge a b } + + test "I should be able to transpose a list" { + let a = + [ + [1;2;3]; + [4;5;6] + ] + let expected = + [ + [1;4]; + [2;5]; + [3;6] + ] + Expect.equal "transpose" expected (a |> List.transpose) } ] - (a |> List.transpose) |> should equal expected + let propertyTestListExtensions = + let fill (total:int) (elem:'a) (list:'a list) = + let padded = List.fill total elem list -[] -let ``I should fill a list`` () = - let fill (total:int) (elem:'a) (list:'a list) = - let padded = List.fill total elem list + if total > 0 && total > List.length list then + List.length padded = total + else + List.length padded = List.length list - if total > 0 && total > List.length list then - List.length padded = total - else - List.length padded = List.length list + let pad (total:int) (elem:'a) (list:'a list) = + let padded = List.pad total elem list - fsCheck "fill a list" fill + if total > 0 then + List.length padded = total + List.length list + else + List.length padded = List.length list -[] -let ``I should padd a list`` () = - let pad (total:int) (elem:'a) (list:'a list) = - let padded = List.pad total elem list + testList "ListExtensions property tests" [ + testPropertyWithConfig config10k "fill a list" fill - if total > 0 then - List.length padded = total + List.length list - else - List.length padded = List.length list - - fsCheck "pad a list" pad \ No newline at end of file + testPropertyWithConfig config10k "pad a list" pad + ] \ No newline at end of file diff --git a/tests/FSharpx.Collections.Tests/MapExtensionsTest.fs b/tests/FSharpx.Collections.Tests/MapExtensionsTest.fs index 8aa63ef4..4b33d832 100644 --- a/tests/FSharpx.Collections.Tests/MapExtensionsTest.fs +++ b/tests/FSharpx.Collections.Tests/MapExtensionsTest.fs @@ -1,39 +1,36 @@ -module FSharpx.Collections.Tests.MapExtensionsTest +namespace FSharpx.Collections.Tests open FSharpx.Collections -open NUnit.Framework -open FsUnit +open Expecto +open Expecto.Flip -[] -let ``map insertWith``() = - let a = Map.ofList [1,"one"; 2,"two"] - let v = a |> Map.insertWith (+) 1 "new " |> Map.toList - v |> should equal [1,"new one"; 2,"two"] +module MapExtensionsTests = + [] + let testMapExtensions = + testList "MapExtensions" [ + test "map insertWith" { + let a = Map.ofList [1,"one"; 2,"two"] + Expect.equal "insertWith" [1,"new one"; 2,"two"] (a |> Map.insertWith (+) 1 "new " |> Map.toList) } -[] -let ``map updateWith should update value if (f x) is Some``() = - let f x = if x = "one" then Some "new one" else None - let a = Map.ofList [1,"one"; 2,"two"] - let v = a |> Map.updateWith f 1 |> Map.toList - v |> should equal [1,"new one"; 2,"two"] + test "map updateWith should update value if (f x) is Some" { + let f x = if x = "one" then Some "new one" else None + let a = Map.ofList [1,"one"; 2,"two"] + Expect.equal "updateWith" [1,"new one"; 2,"two"] (a |> Map.updateWith f 1 |> Map.toList) } -[] -let ``map updateWith should delete element if (f x) is None``() = - let f x = if x = "one" then Some "new one" else None - let a = Map.ofList [1,"one"; 2,"two"] - let v = a |> Map.updateWith f 2 |> Map.toList - v |> should equal [1,"one"] + test "map updateWith should delete element if (f x) is None" { + let f x = if x = "one" then Some "new one" else None + let a = Map.ofList [1,"one"; 2,"two"] + Expect.equal "updateWith" [1,"one"] (a |> Map.updateWith f 2 |> Map.toList) } -[] -let ``test Map_splitWithKey correctly breaks the dictionary on the specified predicate``() = - let a = Map.ofList [0,"zero"; 1,"one"; 2,"two"; 3,"three"; 4,"four"] - let v1,v2 = a |> Map.splitWithKey ((>=) 2) - v1 |> Map.toList |> should equal [0,"zero"; 1,"one"; 2,"two"] - v2 |> Map.toList |> should equal [3,"three"; 4,"four"] + test "test Map_splitWithKey correctly breaks the dictionary on the specified predicate" { + let a = Map.ofList [0,"zero"; 1,"one"; 2,"two"; 3,"three"; 4,"four"] + let v1,v2 = a |> Map.splitWithKey ((>=) 2) + Expect.equal "splitWithKey" [0,"zero"; 1,"one"; 2,"two"] <| Map.toList v1 + Expect.equal "splitWithKey" [3,"three"; 4,"four"] <| Map.toList v2 } -[] -let ``test Map_spanWithKey correctly breaks the dictionary on the specified predicate``() = - let a = Map.ofList [0,"zero"; 1,"one"; 2,"two"; 3,"three"; 4,"four"] - let v1,v2 = a |> Map.spanWithKey ((<) 2) - v1 |> Map.toList |> should equal [0,"zero"; 1,"one"; 2,"two"] - v2 |> Map.toList |> should equal [3,"three"; 4,"four"] + test "test Map_spanWithKey correctly breaks the dictionary on the specified predicate" { + let a = Map.ofList [0,"zero"; 1,"one"; 2,"two"; 3,"three"; 4,"four"] + let v1,v2 = a |> Map.spanWithKey ((<) 2) + Expect.equal "spanWithKey" [0,"zero"; 1,"one"; 2,"two"] <| Map.toList v1 + Expect.equal "spanWithKey" [3,"three"; 4,"four"] <| Map.toList v2 } + ] diff --git a/tests/FSharpx.Collections.Tests/MapTests.fs b/tests/FSharpx.Collections.Tests/MapTests.fs index 266a6f91..cc5f7586 100644 --- a/tests/FSharpx.Collections.Tests/MapTests.fs +++ b/tests/FSharpx.Collections.Tests/MapTests.fs @@ -1,41 +1,39 @@ -// originally from https://bitbucket.org/colinbul/fsharpent -module FSharpx.Collections.Tests.MapTests +namespace FSharpx.Collections.Tests + +// originally from https://bitbucket.org/colinbul/fsharpent -open System open FSharpx.Collections -open NUnit.Framework -open FsUnit - -let data = - [ - (1,1); (2,2); (3,3); (4,4); (5,5) - (6,6); (7,7); (8,8); (9,9); (10,10) - ] |> Map.ofList - -[] -let ``I should be able to choose elements from a map``() = - let expected = - [(2,2);(4,4);(6,6);(8,8);(10,10)] - |> Map.ofList - - let actual = Map.choose (fun k _ -> if k % 2 = 0 then Some k else None) data - - actual |> should equal expected - -[] -let ``I should be able to remove elements by key``() = - let toRemove = [1;2;3;4;5] - - let actual = Map.removeMany toRemove data - let expected = [ (6,6); (7,7); (8,8); (9,9); (10,10) ] |> Map.ofList - actual |> should equal expected - -[] -let ``I should be able to extract values from a map``() = - let expected = [1;2;3;4;5;6;7;8;9;10] |> Seq.ofList - Map.values data |> should equal expected - -[] -let ``I should be able to extract keys from a map``() = - let expected = [1;2;3;4;5;6;7;8;9;10] |> Seq.ofList - Map.keys data |> should equal expected \ No newline at end of file +open Expecto +open Expecto.Flip + +module MapTests = + let data = + [ + (1,1); (2,2); (3,3); (4,4); (5,5) + (6,6); (7,7); (8,8); (9,9); (10,10) + ] |> Map.ofList + + [] + let testMap = + testList "Map" [ + + test "I should be able to choose elements from a map" { + let expected = + [(2,2);(4,4);(6,6);(8,8);(10,10)] + |> Map.ofList + + Expect.equal "choose" expected <| Map.choose (fun k _ -> if k % 2 = 0 then Some k else None) data} + + test "I should be able to remove elements by key" { + let toRemove = [1;2;3;4;5] + let expected = [ (6,6); (7,7); (8,8); (9,9); (10,10) ] |> Map.ofList + Expect.equal "removeMany" expected <| Map.removeMany toRemove data} + + test "I should be able to extract values from a map" { + let expected = [1;2;3;4;5;6;7;8;9;10] |> Seq.ofList + Expect.sequenceEqual "values" expected <| Map.values data } + + test "I should be able to extract keys from a map" { + let expected = [1;2;3;4;5;6;7;8;9;10] |> Seq.ofList + Expect.sequenceEqual "keys" expected <| Map.keys data } + ] \ No newline at end of file diff --git a/tests/FSharpx.Collections.Tests/NameValueCollectionTests.fs b/tests/FSharpx.Collections.Tests/NameValueCollectionTests.fs index 06224de0..222c956d 100644 --- a/tests/FSharpx.Collections.Tests/NameValueCollectionTests.fs +++ b/tests/FSharpx.Collections.Tests/NameValueCollectionTests.fs @@ -1,82 +1,83 @@ -module FSharpx.Collections.Tests.NameValueCollectionTests +namespace FSharpx.Collections.Tests -open FsUnit -open FSharpx.Collections -open NUnit.Framework open System.Collections.Generic open System.Collections.Specialized open System.Linq +open FSharpx.Collections +open Expecto +open Expecto.Flip + +module NameValueCollectionTests = + + let testNameValueCollection = + + let assertKeyIs (l: ILookup<_,_>) a key = + Expect.equal "assertKeyIs" a (l.[key] |> Seq.toList) + + testList "NameValueCollection" [ -[] -let ofSeq() = - let n1 = NameValueCollection.ofSeq ["1","uno"; "1","one"; "2","two"] - let n2 = NameValueCollection() - n2.Add("1", "uno") - n2.Add("1", "one") - n2.Add("2", "two") - Assert.AreEqual(n1,n2) + test "ofSeq" { + let n1 = NameValueCollection.ofSeq ["1","uno"; "1","one"; "2","two"] + let n2 = NameValueCollection() + n2.Add("1", "uno") + n2.Add("1", "one") + n2.Add("2", "two") + Expect.equal "ofSeq" n1 n2 } -[] -let toSeq() = - let r = ["1","uno"; "1","one"; "2","two"] - let a = NameValueCollection.ofSeq r - let s = NameValueCollection.toSeq a - Assert.AreEqual(r,s) + test "toSeq" { + let r = ["1","uno"; "1","one"; "2","two"] + let a = NameValueCollection.ofSeq r + let s = NameValueCollection.toSeq a + Expect.sequenceEqual "toSeq" (List.toSeq r) s } -[] -let toArray() = - let r = [|"1","uno"; "1","one"; "2","two"|] - let a = NameValueCollection.ofSeq r - let s = NameValueCollection.toArray a - Assert.AreEqual(r,s) - -[] -let toList() = - let r = ["1","uno"; "1","one"; "2","two"] - let a = NameValueCollection.ofSeq r - let s = NameValueCollection.toList a - Assert.AreEqual(r,s) + test "toArray" { + let r = [|"1","uno"; "1","one"; "2","two"|] + let a = NameValueCollection.ofSeq r + let s = NameValueCollection.toArray a + Expect.equal "toArray" r s } -[] -let concat() = - let a = NameValueCollection() - a.Add("1", "uno") - a.Add("2", "dos") - let b = NameValueCollection() - b.Add("1", "one") - b.Add("2", "two") - let c = NameValueCollection.concat a b - () + test "toList" { + let r = ["1","uno"; "1","one"; "2","two"] + let a = NameValueCollection.ofSeq r + let s = NameValueCollection.toList a + Expect.equal "toList" r s } -let assertKeyIs (l: ILookup<_,_>) a key = - Assert.AreEqual(a, l.[key] |> Seq.toList) + //This is incorrect behavior. Duplicate name should add comma-separated value to value list + //https://github.com/fsprojects/FSharpx.Collections/issues/96 + test "concat" { + let a = NameValueCollection() + a.Add("1", "uno") + a.Add("2", "dos") + let b = NameValueCollection() + b.Add("1", "one") + b.Add("2", "two") + let c = NameValueCollection.concat a b + Expect.equal "concat" [("1", "uno"); ("1", "one"); ("2", "dos"); ("2", "two")] <| NameValueCollection.toList c } -[] -let toLookup() = - let n1 = NameValueCollection.ofSeq ["1","uno"; "1","one"; "2","two"] - let l = NameValueCollection.toLookup n1 - "1" |> assertKeyIs l ["uno"; "one"] - "2" |> assertKeyIs l ["two"] - "3" |> assertKeyIs l [] - n1.Add("3", "three") - "3" |> assertKeyIs l [] + test "toLookup" { + let n1 = NameValueCollection.ofSeq ["1","uno"; "1","one"; "2","two"] + let l = NameValueCollection.toLookup n1 + "1" |> assertKeyIs l ["uno"; "one"] + "2" |> assertKeyIs l ["two"] + "3" |> assertKeyIs l [] + n1.Add("3", "three") + "3" |> assertKeyIs l [] } -[] -let asLookup() = - let n1 = NameValueCollection.ofSeq ["1","uno"; "1","one"; "2","two"] - let l = NameValueCollection.asLookup n1 - "1" |> assertKeyIs l ["uno"; "one"] - "2" |> assertKeyIs l ["two"] - "3" |> assertKeyIs l [] - n1.Add("3", "three") - "3" |> assertKeyIs l ["three"] + test "asLookup" { + let n1 = NameValueCollection.ofSeq ["1","uno"; "1","one"; "2","two"] + let l = NameValueCollection.asLookup n1 + "1" |> assertKeyIs l ["uno"; "one"] + "2" |> assertKeyIs l ["two"] + "3" |> assertKeyIs l [] + n1.Add("3", "three") + "3" |> assertKeyIs l ["three"] } -[] -let asDictionary() = - let n1 = NameValueCollection.ofSeq ["1","uno"; "1","one"; "2","two"] - let d = NameValueCollection.asDictionary n1 - Assert.AreEqual([|"uno";"one"|], d.["1"]) - Assert.AreEqual([|"two"|], d.["2"]) - (fun () -> ignore d.["3"]) |> should throw typeof - n1.Add("3", "three") - Assert.AreEqual([|"three"|], d.["3"]) \ No newline at end of file + test "asDictionary" { + let n1 = NameValueCollection.ofSeq ["1","uno"; "1","one"; "2","two"] + let d = NameValueCollection.asDictionary n1 + Expect.equal "asDictionary" [|"uno";"one"|] d.["1"] + Expect.equal "asDictionary" [|"two"|] d.["2"] + Expect.throwsT "asDictionary" (fun () -> ignore d.["3"] |> ignore) + n1.Add("3", "three") + Expect.equal "asDictionary" [|"three"|] d.["3"] } + ] diff --git a/tests/FSharpx.Collections.Tests/PersistentHashMapTest.fs b/tests/FSharpx.Collections.Tests/PersistentHashMapTest.fs index 387b9bb1..4a454526 100644 --- a/tests/FSharpx.Collections.Tests/PersistentHashMapTest.fs +++ b/tests/FSharpx.Collections.Tests/PersistentHashMapTest.fs @@ -1,263 +1,231 @@ -module FSharpx.Collections.Experimental.Tests.PersistentHashMapTest +namespace FSharpx.Collections.Tests open System open FSharpx.Collections -open FSharpx.Collections.PersistentHashMap -open NUnit.Framework -open FsUnit - -[] -let ``empty map should be empty``() = - let x = empty - x |> length |> should equal 0 - - -[] -let ``empty map should not contain key 0``() = - let x = empty - x |> containsKey 1 |> should equal false - -[] -let ``can add null entry to empty map``() = - let x = empty - x |> containsKey "value" |> should equal false - x |> containsKey null |> should equal false - x |> add null "Hello" |> containsKey null |> should equal true - - -[] -let ``can add empty string as key to empty map``() = - let x = empty - x |> containsKey "" |> should equal false - x |> add "" "Hello" |> containsKey null |> should equal false - x |> add "" "Hello" |> containsKey "" |> should equal true - x |> add "" "Hello" |> length |> shouldEqual 1 - -[] -let ``can add some integers to empty map``() = - let x = - empty - |> add 1 "h" - |> add 2 "a" - |> add 3 "l" - |> add 4 "l" - |> add 5 "o" - - x |> containsKey 1 |> shouldEqual true - x |> containsKey 5 |> shouldEqual true - x |> containsKey 6 |> shouldEqual false - x |> length |> shouldEqual 5 - -[] -let ``add operates immutable``() = - let y = - empty - |> add 1 "h" - |> add 2 "a" - |> add 3 "l" - let x = - y - |> add 4 "l" - |> add 5 "o" - - y |> length |> shouldEqual 3 - x |> length |> shouldEqual 5 - - -[] -let ``can remove some integers from a map``() = - let x = - empty - |> add 1 "h" - |> add 2 "a" - |> add 3 "l" - |> add 4 "l" - |> add 5 "o" - |> remove 1 - |> remove 4 +open FSharpx.Collections.Tests.TransientHashMapTests +open Expecto +open Expecto.Flip + +module PersistentHashMapTests = + let testPersistentHashMap = + + testList "PersistentHashMap" [ + + test "PersistentHashMap.empty map should be PersistentHashMap.empty" { + let x = PersistentHashMap.empty + Expect.equal "length" 0 <| PersistentHashMap.length x } + + test "PersistentHashMap.empty map should not contain key 0" { + let x = PersistentHashMap.empty + Expect.isFalse "PersistentHashMap.containsKey" <| PersistentHashMap.containsKey 1 x } + + test "can PersistentHashMap.add null entry to PersistentHashMap.empty map" { + Expect.isFalse "PersistentHashMap.empty" <| PersistentHashMap.containsKey "value" PersistentHashMap.empty + Expect.isFalse "PersistentHashMap.empty" <| PersistentHashMap.containsKey null PersistentHashMap.empty + Expect.isTrue "PersistentHashMap.empty" (PersistentHashMap.add null "Hello" PersistentHashMap.empty |> PersistentHashMap.containsKey null) } + + test "can PersistentHashMap.add PersistentHashMap.empty string as key to PersistentHashMap.empty map" { + Expect.isFalse "PersistentHashMap.empty" <| PersistentHashMap.containsKey "" PersistentHashMap.empty + Expect.isFalse "PersistentHashMap.empty" (PersistentHashMap.add "" "Hello" PersistentHashMap.empty |> PersistentHashMap.containsKey null) + Expect.isTrue "PersistentHashMap.empty" (PersistentHashMap.add "" "Hello" PersistentHashMap.empty |> PersistentHashMap.containsKey "") + Expect.equal "PersistentHashMap.empty" 1 (PersistentHashMap.add "" "Hello" PersistentHashMap.empty |> PersistentHashMap.length) } + + test "can PersistentHashMap.add some integers to PersistentHashMap.empty map" { + let x = + PersistentHashMap.empty + |> PersistentHashMap.add 1 "h" + |> PersistentHashMap.add 2 "a" + |> PersistentHashMap.add 3 "l" + |> PersistentHashMap.add 4 "l" + |> PersistentHashMap.add 5 "o" + + Expect.isTrue "PersistentHashMap.add" <| PersistentHashMap.containsKey 1 x + Expect.isTrue "PersistentHashMap.add" <| PersistentHashMap.containsKey 5 x + Expect.isFalse "PersistentHashMap.add" <| PersistentHashMap.containsKey 6 x + Expect.equal "PersistentHashMap.add" 5 <| PersistentHashMap.length x } + + test "PersistentHashMap.add operates immutable" { + let y = + PersistentHashMap.empty + |> PersistentHashMap.add 1 "h" + |> PersistentHashMap.add 2 "a" + |> PersistentHashMap.add 3 "l" + let x = + y + |> PersistentHashMap.add 4 "l" + |> PersistentHashMap.add 5 "o" + + Expect.equal "" 3 <| PersistentHashMap.length y + Expect.equal "" 5 <| PersistentHashMap.length x } + + test "can remove some integers from a map" { + let x = + PersistentHashMap.empty + |> PersistentHashMap.add 1 "h" + |> PersistentHashMap.add 2 "a" + |> PersistentHashMap.add 3 "l" + |> PersistentHashMap.add 4 "l" + |> PersistentHashMap.add 5 "o" + |> PersistentHashMap.remove 1 + |> PersistentHashMap.remove 4 - x |> containsKey 1 |> shouldEqual false - x |> containsKey 4 |> shouldEqual false - x |> containsKey 5 |> shouldEqual true - x |> containsKey 6 |> shouldEqual false - x |> length |> shouldEqual 3 - -[] -let ``remove operates``() = - let y = - empty - |> add 1 "h" - |> add 2 "a" - |> add 3 "l" - |> add 4 "l" - |> add 5 "o" - let x = - y - |> remove 1 - |> remove 4 + Expect.isFalse "PersistentHashMap.add remove" <| PersistentHashMap.containsKey 1 x + Expect.isFalse "PersistentHashMap.add remove" <| PersistentHashMap.containsKey 4 x + Expect.isTrue "PersistentHashMap.add remove" <| PersistentHashMap.containsKey 5 x + Expect.isFalse "PersistentHashMap.add remove" <| PersistentHashMap.containsKey 6 x + Expect.equal "PersistentHashMap.add remove" 3 <| PersistentHashMap.length x } + + test "remove operates" { + let y = + PersistentHashMap.empty + |> PersistentHashMap.add 1 "h" + |> PersistentHashMap.add 2 "a" + |> PersistentHashMap.add 3 "l" + |> PersistentHashMap.add 4 "l" + |> PersistentHashMap.add 5 "o" + let x = + y + |> PersistentHashMap.remove 1 + |> PersistentHashMap.remove 4 - x |> length |> shouldEqual 3 - y |> length |> shouldEqual 5 - -[] -let ``can find integers in a map``() = - let x = - empty - |> add 1 "h" - |> add 2 "a" - |> add 3 "l" - |> add 4 "l" - |> add 5 "o" + Expect.equal "remove" 3 <| PersistentHashMap.length x + Expect.equal "PersistentHashMap.add" 5 <| PersistentHashMap.length y } + + test "can find integers in a map" { + let x = + PersistentHashMap.empty + |> PersistentHashMap.add 1 "h" + |> PersistentHashMap.add 2 "a" + |> PersistentHashMap.add 3 "l" + |> PersistentHashMap.add 4 "l" + |> PersistentHashMap.add 5 "o" - x |> find 1 |> shouldEqual "h" - x |> find 4 |> shouldEqual "l" - x |> find 5 |> shouldEqual "o" - -[] -let ``can lookup integers from a map``() = - let x = - empty - |> add 1 "h" - |> add 2 "a" - |> add 3 "l" - |> add 4 "l" - |> add 5 "o" + Expect.equal "PersistentHashMap.add" "h" <| PersistentHashMap.find 1 x + Expect.equal "PersistentHashMap.add" "l" <| PersistentHashMap.find 4 x + Expect.equal "PersistentHashMap.add" "o" <| PersistentHashMap.find 5 x } + + test "can lookup integers from a map" { + let x = + PersistentHashMap.empty + |> PersistentHashMap.add 1 "h" + |> PersistentHashMap.add 2 "a" + |> PersistentHashMap.add 3 "l" + |> PersistentHashMap.add 4 "l" + |> PersistentHashMap.add 5 "o" - x.[1] |> shouldEqual "h" - x.[4] |> shouldEqual "l" - x.[5] |> shouldEqual "o" - - -[] -let ``can add the same key multiple to a map``() = - let x = - empty - |> add 1 "h" - |> add 2 "a" - |> add 3 "l" - |> add 4 "l" - |> add 5 "o" - |> add 3 "a" - |> add 4 "a" + Expect.equal "lookup" "h" x.[1] + Expect.equal "lookup" "l" x.[4] + Expect.equal "lookup" "o" x.[5] } + + test "can PersistentHashMap.add the same key multiple to a map" { + let x = + PersistentHashMap.empty + |> PersistentHashMap.add 1 "h" + |> PersistentHashMap.add 2 "a" + |> PersistentHashMap.add 3 "l" + |> PersistentHashMap.add 4 "l" + |> PersistentHashMap.add 5 "o" + |> PersistentHashMap.add 3 "a" + |> PersistentHashMap.add 4 "a" - x |> find 1 |> shouldEqual "h" - x |> find 4 |> shouldEqual "a" - x |> find 5 |> shouldEqual "o" - x |> length |> shouldEqual 5 - -[] -let ``can iterate through a map``() = - let x = - empty - |> add 1 "h" - |> add 2 "a" - |> add 3 "l" - |> add 4 "l" - |> add 5 "o" + Expect.equal "find" "h" <| PersistentHashMap.find 1 x + Expect.equal "find" "a" <| PersistentHashMap.find 4 x + Expect.equal "find" "o" <| PersistentHashMap.find 5 x + Expect.equal "length" 5 <| PersistentHashMap.length x } + + test "can iterate through a map" { + let x = + PersistentHashMap.empty + |> PersistentHashMap.add 1 "h" + |> PersistentHashMap.add 2 "a" + |> PersistentHashMap.add 3 "l" + |> PersistentHashMap.add 4 "l" + |> PersistentHashMap.add 5 "o" - x |> find 1 |> shouldEqual "h" - x |> find 4 |> shouldEqual "l" - x |> find 5 |> shouldEqual "o" - + Expect.equal "find" "h" <| PersistentHashMap.find 1 x + Expect.equal "find" "l" <| PersistentHashMap.find 4 x + Expect.equal "find" "o" <| PersistentHashMap.find 5 x } + + test "can convert a seq to a map" { + let list = [1,"h"; 2,"a"; 3,"l"; 4,"l"; 5,"o"] + Expect.equal "ofSeq" [1,"h"; 2,"a"; 3,"l"; 4,"l"; 5,"o"] (PersistentHashMap.ofSeq list |> PersistentHashMap.toSeq |> Seq.toList) } + + test "a map is always sorter" { + let list = [ 4,"l"; 5,"o"; 2,"a"; 1,"h"; 3,"l"] + Expect.equal "toSeq" [1,"h"; 2,"a"; 3,"l"; 4,"l"; 5,"o"] (PersistentHashMap.ofSeq list |> PersistentHashMap.toSeq |> Seq.toList) } + + test "can map a HashMap" { + let x = + PersistentHashMap.empty + |> PersistentHashMap.add 1 1 + |> PersistentHashMap.add 2 2 + |> PersistentHashMap.add 3 3 + |> PersistentHashMap.add 4 4 + |> PersistentHashMap.add 5 5 + + Expect.equal "map" [1,2; 2,3; 3,4; 4,5; 5,6] (x |> PersistentHashMap.map (fun x -> x + 1) |> Seq.toList) } -[] -let ``can convert a seq to a map``() = - let list = [1,"h"; 2,"a"; 3,"l"; 4,"l"; 5,"o"] + test "can PersistentHashMap.add tons of integers to PersistentHashMap.empty map" { + let x = ref PersistentHashMap.empty + let counter = 1000 - let x = ofSeq list + for i in 0 .. counter do + x := PersistentHashMap.add i i !x - x |> toSeq |> Seq.toList |> shouldEqual [1,"h"; 2,"a"; 3,"l"; 4,"l"; 5,"o"] + for i in 0 .. counter do + !x |> PersistentHashMap.containsKey i |> Expect.isTrue "PersistentHashMap.containsKey" } -[] -let ``a map is always sorter``() = - let list = [ 4,"l"; 5,"o"; 2,"a"; 1,"h"; 3,"l"] + test "can find tons of integers in a map" { + let x = ref PersistentHashMap.empty + let counter = 1000 - let x = ofSeq list + for i in 0 .. counter do + x := PersistentHashMap.add i i !x - x |> toSeq |> Seq.toList |> shouldEqual [1,"h"; 2,"a"; 3,"l"; 4,"l"; 5,"o"] + for i in 0 .. counter do + !x |> PersistentHashMap.find i |> Expect.equal "find" i } -[] -let ``can map a HashMap``() = - let x = - empty - |> add 1 1 - |> add 2 2 - |> add 3 3 - |> add 4 4 - |> add 5 5 - - x |> map (fun x -> x + 1) |> Seq.toList |> shouldEqual [1,2; 2,3; 3,4; 4,5; 5,6] - -[] -let ``can add tons of integers to empty map``() = - let x = ref empty - let counter = 1000 - - for i in 0 .. counter do - x := add i i !x - - for i in 0 .. counter do - !x |> containsKey i |> should equal true - -[] -let ``can find tons of integers in a map``() = - let x = ref empty - let counter = 1000 - - for i in 0 .. counter do - x := add i i !x - - for i in 0 .. counter do - !x |> find i |> shouldEqual i - -open FSharpx.Collections.Experimental.Tests.TransientHashMapTest - -[] -let ``can add keys with colliding hashes to empty map``() = - let x = { Name = "Test"} - let y = { Name = "Test1"} - let map = - empty - |> add x x.Name - |> add y y.Name + test "can PersistentHashMap.add keys with colliding hashes to PersistentHashMap.empty map" { + let x = { Name = "Test"} + let y = { Name = "Test1"} + let map = + PersistentHashMap.empty + |> PersistentHashMap.add x x.Name + |> PersistentHashMap.add y y.Name - map |> containsKey x |> should equal true - map |> containsKey y |> should equal true - - empty |> containsKey y |> should equal false - - -[] -let ``can lookup keys with colliding hashes from map``() = - let x = { Name = "Test"} - let y = { Name = "Test1"} - let map = - empty - |> add x x - |> add y y + Expect.isTrue "" <| PersistentHashMap.containsKey x map + Expect.isTrue "" <| PersistentHashMap.containsKey y map + Expect.isFalse "" <| PersistentHashMap.containsKey y PersistentHashMap.empty } + + test "can lookup keys with colliding hashes from map" { + let x = { Name = "Test"} + let y = { Name = "Test1"} + let map = + PersistentHashMap.empty + |> PersistentHashMap.add x x + |> PersistentHashMap.add y y - map |> find x |> shouldEqual { Name = "Test"} - map |> find y |> shouldEqual { Name = "Test1"} + Expect.equal "colliding hashes" { Name = "Test"} <| PersistentHashMap.find x map + Expect.equal "colliding hashes" { Name = "Test1"} <| PersistentHashMap.find y map } -[] -let ``can add lots of keys with colliding hashes to empty map``() = - let x = ref empty - let counter = 1000 + test "can PersistentHashMap.add lots of keys with colliding hashes to PersistentHashMap.empty map" { + let x = ref PersistentHashMap.empty + let counter = 1000 - for i in 0 .. counter do - x := add { Name = i.ToString() } i !x + for i in 0 .. counter do + x := PersistentHashMap.add { Name = i.ToString() } i !x - for i in 0 .. counter do - !x |> containsKey { Name = i.ToString() } |> should equal true + for i in 0 .. counter do + !x |> PersistentHashMap.containsKey { Name = i.ToString() } |> Expect.isTrue "colliding hashes" } -[] -let ``can find tons of strings in a map``() = - let x = ref empty - let n = 10000 - let r = new Random() + test "can find tons of strings in a map" { + let x = ref PersistentHashMap.empty + let n = 10000 + let r = new Random() - for i in 0 .. n do - x := add (i.ToString()) i !x + for i in 0 .. n do + x := PersistentHashMap.add (i.ToString()) i !x - for i in 0 .. 1000000 do - !x |> containsKey ((r.Next n).ToString()) |> should equal true \ No newline at end of file + for i in 0 .. 1000000 do + !x |> PersistentHashMap.containsKey ((r.Next n).ToString()) |> Expect.isTrue "Next" } + ] \ No newline at end of file diff --git a/tests/FSharpx.Collections.Tests/PersistentVectorTest.fs b/tests/FSharpx.Collections.Tests/PersistentVectorTest.fs index 6ab59526..49bff17a 100644 --- a/tests/FSharpx.Collections.Tests/PersistentVectorTest.fs +++ b/tests/FSharpx.Collections.Tests/PersistentVectorTest.fs @@ -1,313 +1,284 @@ -module FSharpx.Collections.Experimental.Tests.PersistentVectorTest +namespace FSharpx.Collections.Tests open System open FSharpx.Collections -open FSharpx.Collections.PersistentVector -open NUnit.Framework -open FsUnit - -[] -let ``empty vector should be empty``() = - let x = empty - x |> length |> should equal 0 - -[] -let ``multiple cons to an empty vector should increase the count``() = - empty |> conj 1 |> conj 4 |> conj 25 |> length |> should equal 3 - -[] -let ``cons to an empty vector should create a singleton vector``() = - empty |> conj 1 |> nth 0 |> should equal 1 - -[] -let ``multiple cons to an empty vector should create a vector``() = - empty |> conj 1 |> conj 4 |> conj 25 |> nth 1 |> should equal 4 - -[] -let ``multiple assoc to the end should work like cons and create a vector``() = - let v = empty |> update 0 1 |> update 1 4 |> update 2 25 - v |> nth 0 |> should equal 1 - v |> nth 1 |> should equal 4 - v |> nth 2 |> should equal 25 - -[] -let ``300 cons to an empty vector should create a vector``() = - let vector = ref empty - for i in 1..300 do - vector := conj i (!vector) - - !vector |> nth 100 |> should equal 101 - !vector |> nth 200 |> should equal 201 - -[] -let ``assoc an element to a nonempty vector should not change the original vector``() = - let v = empty |> conj "1" |> conj "4" |> conj "25" - - v |> update 2 "5" |> nth 2 |> should equal "5" - v |> nth 2 |> should equal "25" - -[] -let ``vector should should be convertable to a seq``() = - empty |> conj 1 |> conj 4 |> conj 25 |> Seq.toList |> should equal [1;4;25] - -[] -let ``vector with 300 elements should be convertable to a seq``() = - let vector = ref empty - for i in 1..300 do - vector := conj i (!vector) - - let a = !vector |> Seq.toArray - for i in 1..300 do i |> should equal a.[i-1] - -[] -let ``vector can be created from a seq``() = - let xs = [7;88;1;4;25;30] - ofSeq xs |> Seq.toList |> should equal xs - -[] -let ``vector with 300 elements should allow assocN``() = - let vector = ref empty - for i in 1..300 do - vector := conj i (!vector) - - for i in 1..300 do - vector := update (i-1) (i*2) (!vector) - - let a = !vector |> Seq.toArray - for i in 1..300 do i * 2 |> should equal a.[i-1] - -[] -let ``vector of vectors can be accessed with nthNth``() = - let inner = [1; 2; 3; 4; 5] |> ofSeq - let outer = empty |> conj inner |> conj inner - - outer |> nthNth 0 2 |> should equal 3 - outer |> nthNth 1 4 |> should equal 5 - -[] -let ``nthNth throws exception for out-of-bounds indices``() = - let inner = [1; 2; 3; 4; 5] |> ofSeq - let outer = empty |> conj inner |> conj inner - - (fun () -> nthNth 2 2 outer |> ignore) |> should throw typeof - (fun () -> nthNth 1 5 outer |> ignore) |> should throw typeof - (fun () -> nthNth -1 2 outer |> ignore) |> should throw typeof - (fun () -> nthNth 1 -2 outer |> ignore) |> should throw typeof - -[] -let ``vector of vectors can be accessed with tryNthNth``() = - let inner = [1; 2; 3; 4; 5] |> ofSeq - let outer = empty |> conj inner |> conj inner - - outer |> tryNthNth 0 2 |> should equal (Some 3) - outer |> tryNthNth 1 4 |> should equal (Some 5) - -[] -let ``tryNthNth returns None for out-of-bounds indices``() = - let inner = [1; 2; 3; 4; 5] |> ofSeq - let outer = empty |> conj inner |> conj inner - - outer |> tryNthNth 2 2 |> should equal None - outer |> tryNthNth 1 5 |> should equal None - outer |> tryNthNth -1 2 |> should equal None - outer |> tryNthNth 1 -2 |> should equal None - -[] -let ``vector of vectors can be updated with updateNth``() = - let inner = [1; 2; 3; 4; 5] |> ofSeq - let outer = empty |> conj inner |> conj inner - - outer |> updateNth 0 2 7 |> nthNth 0 2 |> should equal 7 - outer |> updateNth 1 4 9 |> nthNth 1 4 |> should equal 9 - -[] -let ``updateNth should not change the original vector``() = - let inner = [1; 2; 3; 4; 5] |> ofSeq - let outer = ref empty - outer := conj inner (!outer) - outer := conj inner (!outer) - - !outer |> updateNth 0 2 7 |> nthNth 0 2 |> should equal 7 - !outer |> nthNth 0 2 |> should equal 3 - !outer |> updateNth 1 4 9 |> nthNth 1 4 |> should equal 9 - !outer |> nthNth 1 4 |> should equal 5 - -[] -let ``updateNth throws exception for out-of-bounds indices``() = - let inner = [1; 2; 3; 4; 5] |> ofSeq - let outer = empty |> conj inner |> conj inner - - (fun () -> updateNth 0 6 7 outer |> ignore) |> should throw typeof - (fun () -> updateNth 9 2 7 outer |> ignore) |> should throw typeof - (fun () -> updateNth 1 -4 7 outer |> ignore) |> should throw typeof - (fun () -> updateNth -1 4 7 outer |> ignore) |> should throw typeof - -[] -let ``tryUpdateNth returns None for out-of-bounds indices``() = - let inner = [1; 2; 3; 4; 5] |> ofSeq - let outer = empty |> conj inner |> conj inner - - tryUpdateNth 0 6 7 outer |> should equal None - tryUpdateNth 9 2 7 outer |> should equal None - tryUpdateNth 1 -4 7 outer |> should equal None - tryUpdateNth -1 4 7 outer |> should equal None - -[] -let ``tryUpdateNth is like updateNth but returns option``() = - let inner = [1; 2; 3; 4; 5] |> ofSeq - let outer = empty |> conj inner |> conj inner - - let result = outer |> tryUpdateNth 0 2 7 - result |> Option.isSome |> should be True - result |> Option.get |> nthNth 0 2 |> should equal 7 - - let result2 = outer |> tryUpdateNth 1 4 9 - result2 |> Option.isSome |> should be True - result2 |> Option.get |> nthNth 1 4 |> should equal 9 - -[] -let ``tryUpdateNth should not change the original vector``() = - let inner = [1; 2; 3; 4; 5] |> ofSeq - let outer = ref empty - outer := conj inner (!outer) - outer := conj inner (!outer) - - !outer |> tryUpdateNth 0 2 7 |> Option.get |> nthNth 0 2 |> should equal 7 - !outer |> nthNth 0 2 |> should equal 3 - !outer |> tryUpdateNth 1 4 9 |> Option.get |> nthNth 1 4 |> should equal 9 - !outer |> nthNth 1 4 |> should equal 5 - -[] -let ``can peek elements from a vector``() = - let vector = empty |> conj 1 |> conj 4 |> conj 25 - vector |> last |> should equal 25 - -[] -let ``can pop elements from a vector``() = - let vector = empty |> conj 1 |> conj 4 |> conj 25 - vector |> last |> should equal 25 - vector |> initial |> last |> should equal 4 - vector |> initial |> initial |> last |> should equal 1 - - vector |> length |> should equal 3 - vector |> initial |> length |> should equal 2 - vector |> initial |> initial |> length |> should equal 1 - -[] -let ``vector with 300 elements should allow pop``() = - let vector = ref empty - for i in 1..300 do - vector := conj i (!vector) - - for i in 1..300 do - vector := initial (!vector) - - !vector |> Seq.toList |> should equal [] - -[] -let ``vector with 3 elements can compute hashcodes``() = - let vector1 = ref empty - for i in 1..3 do - vector1 := conj i (!vector1) - - let vector2 = ref empty - for i in 1..3 do - vector2 := conj i (!vector2) - - let vector3 = ref empty - for i in 1..3 do - vector3 := conj (2*i) (!vector3) - - vector1.GetHashCode() |> should equal (vector2.GetHashCode()) - vector1.GetHashCode() |> should equal (vector2.GetHashCode()) - -[] -let ``vector with 3 elements can be compared``() = - let vector1 = ref empty - for i in 1..3 do - vector1 := conj i (!vector1) - - let vector2 = ref empty - for i in 1..3 do - vector2 := conj i (!vector2) - - let vector3 = ref empty - for i in 1..3 do - vector3 := conj (2*i) (!vector3) - - - vector1 = vector1 |> should equal true - vector1 = vector2 |> should equal true - vector1 = vector3 |> should equal false - -[] -let ``appending two vectors keeps order of items``() = - let vector1 = ref empty - for i in 1..3 do - vector1 := conj i (!vector1) - - let vector2 = ref empty - for i in 7..9 do - vector2 := conj i (!vector2) - - append (!vector1) (!vector2) |> toSeq |> Seq.toList |> should equal [1;2;3;7;8;9] - -[] -let ``vector should allow map``() = - let vector = ref empty - for i in 1..300 do - vector := conj i (!vector) - - let vector2 = map (fun x -> x * 2) (!vector) - - let a = vector2 |> Seq.toArray - for i in 1..300 do i * 2 |> should equal a.[i-1] - -[] -let ``vector should allow init``() = - let vector = init 5 (fun x -> x * 2) - let s = Seq.init 5 (fun x -> x * 2) - - s |> Seq.toList |> should equal [0;2;4;6;8] - vector |> Seq.toList |> should equal [0;2;4;6;8] - -[] -let ``windowSeq should keep every value from its original list``() = - let seq30 = seq { for i in 1..30 do yield i } - let fullVec = ofSeq seq30 - for i in 1..35 do - let vecs = windowSeq i seq30 - vecs |> fold append empty |> should equal fullVec - -[] -let ``windowSeq should return vectors of equal length if possible``() = - let seq30 = seq { for i in 1..30 do yield i } - - let len3vecs = windowSeq 3 seq30 - let len5vecs = windowSeq 5 seq30 - let len6vecs = windowSeq 6 seq30 - - len3vecs |> length |> should equal 10 - len5vecs |> length |> should equal 6 - len6vecs |> length |> should equal 5 - len3vecs |> map length |> toSeq |> Seq.toList |> should equal [3;3;3;3;3;3;3;3;3;3] - len5vecs |> map length |> toSeq |> Seq.toList |> should equal [5;5;5;5;5;5] - len6vecs |> map length |> toSeq |> Seq.toList |> should equal [6;6;6;6;6] - -[] -let ``windowSeq should return vectors all of equal length except the last``() = - let seq30 = seq { for i in 1..30 do yield i } - - let len4vecs = windowSeq 4 seq30 - let len7vecs = windowSeq 7 seq30 - let len8vecs = windowSeq 8 seq30 - let len17vecs = windowSeq 17 seq30 - - len4vecs |> length |> should equal 8 - len7vecs |> length |> should equal 5 - len8vecs |> length |> should equal 4 - len17vecs |> length |> should equal 2 - len4vecs |> map length |> toSeq |> Seq.toList |> should equal [4;4;4;4;4;4;4;2] - len7vecs |> map length |> toSeq |> Seq.toList |> should equal [7;7;7;7;2] - len8vecs |> map length |> toSeq |> Seq.toList |> should equal [8;8;8;6] - len17vecs |> map length |> toSeq |> Seq.toList |> should equal [17;13] +open Expecto +open Expecto.Flip + +module PersistentVectorTests = + let testPersistentVector = + + testList "PersistentVector" [ + test "PersistentVector.empty vector should be PersistentVector.empty" { + let x = PersistentVector.empty + Expect.equal "PersistentVector.empty" 0 (x |> PersistentVector.length) } + + test "multiple cons to an PersistentVector.empty vector should increase the count" { + Expect.equal "cons" 3 (PersistentVector.empty |> PersistentVector.conj 1 |> PersistentVector.conj 4 |> PersistentVector.conj 25 |> PersistentVector.length) } + + test "cons to an PersistentVector.empty vector should create a singleton vector" { + Expect.equal "cons" 1 (PersistentVector.empty |> PersistentVector.conj 1 |> PersistentVector.nth 0) } + + test "multiple cons to an PersistentVector.empty vector should create a vector" { + Expect.equal "cons" 4 (PersistentVector.empty |> PersistentVector.conj 1 |> PersistentVector.conj 4 |> PersistentVector.conj 25 |> PersistentVector.nth 1) } + + test "multiple assoc to the end should work like cons and create a vector" { + let v = PersistentVector.empty |> PersistentVector.update 0 1 |> PersistentVector.update 1 4 |> PersistentVector.update 2 25 + Expect.equal "assoc" 1 (v |> PersistentVector.nth 0) + Expect.equal "assoc" 4 (v |> PersistentVector.nth 1) + Expect.equal "assoc" 25 (v |> PersistentVector.nth 2) } + + test "300 cons to an PersistentVector.empty vector should create a vector" { + let vector = ref PersistentVector.empty + for i in 1..300 do + vector := PersistentVector.conj i (!vector) + + Expect.equal "" 101 (!vector |> PersistentVector.nth 100) + Expect.equal "" 201 (!vector |> PersistentVector.nth 200) } + + test "assoc an element to a nonempty vector should not change the original vector" { + let v = PersistentVector.empty |> PersistentVector.conj "1" |> PersistentVector.conj "4" |> PersistentVector.conj "25" + + Expect.equal "assoc" "5" (v |> PersistentVector.update 2 "5" |> PersistentVector.nth 2) + Expect.equal "assoc" "25" (v |> PersistentVector.nth 2) } + + test "vector should should be convertable to a seq" { + Expect.equal "" [1;4;25] (PersistentVector.empty |> PersistentVector.conj 1 |> PersistentVector.conj 4 |> PersistentVector.conj 25 |> Seq.toList) } + + test "vector with 300 elements should be convertable to a seq" { + let vector = ref PersistentVector.empty + for i in 1..300 do + vector := PersistentVector.conj i (!vector) + + let a = !vector |> Seq.toArray + for i in 1..300 do i |> Expect.equal "toSeq toArray" a.[i-1] } + + test "vector can be created from a seq" { + let xs = [7;88;1;4;25;30] + Expect.equal "" xs (PersistentVector.ofSeq xs |> Seq.toList) } + + test "vector with 300 elements should allow assocN" { + let vector = ref PersistentVector.empty + for i in 1..300 do + vector := PersistentVector.conj i (!vector) + + for i in 1..300 do + vector := PersistentVector.update (i-1) (i*2) (!vector) + + let a = !vector |> Seq.toArray + for i in 1..300 do i * 2 |> Expect.equal "assocN" a.[i-1] } + + test "vector of vectors can be accessed with PersistentVector.nthNth" { + let inner = [1; 2; 3; 4; 5] |> PersistentVector.ofSeq + let outer = PersistentVector.empty |> PersistentVector.conj inner |> PersistentVector.conj inner + + Expect.equal "" 3 (outer |> PersistentVector.nthNth 0 2) + Expect.equal "" 5 (outer |> PersistentVector.nthNth 1 4) } + + test "PersistentVector.nthNth throws exception for out-of-bounds indices" { + let inner = [1; 2; 3; 4; 5] |> PersistentVector.ofSeq + let outer = PersistentVector.empty |> PersistentVector.conj inner |> PersistentVector.conj inner + + Expect.throwsT "PersistentVector.nthNth" (fun () -> PersistentVector.nthNth 2 2 outer |> ignore) + Expect.throwsT "PersistentVector.nthNth" (fun () -> PersistentVector.nthNth 1 5 outer |> ignore) + Expect.throwsT "PersistentVector.nthNth" (fun () -> PersistentVector.nthNth -1 2 outer |> ignore) + Expect.throwsT "PersistentVector.nthNth" (fun () -> PersistentVector.nthNth 1 -2 outer |> ignore) } + + test "vector of vectors can be accessed with PersistentVector.tryNthNth" { + let inner = [1; 2; 3; 4; 5] |> PersistentVector.ofSeq + let outer = PersistentVector.empty |> PersistentVector.conj inner |> PersistentVector.conj inner + + Expect.equal "" (Some 3) (outer |> PersistentVector.tryNthNth 0 2) + Expect.equal "" (Some 5) (outer |> PersistentVector.tryNthNth 1 4) } + + test "PersistentVector.tryNthNth returns None for out-of-bounds indices" { + let inner = [1; 2; 3; 4; 5] |> PersistentVector.ofSeq + let outer = PersistentVector.empty |> PersistentVector.conj inner |> PersistentVector.conj inner + + Expect.isNone "PersistentVector.tryNthNth" (outer |> PersistentVector.tryNthNth 2 2) + Expect.isNone "PersistentVector.tryNthNth" (outer |> PersistentVector.tryNthNth 1 5) + Expect.isNone "PersistentVector.tryNthNth" (outer |> PersistentVector.tryNthNth -1 2) + Expect.isNone "PersistentVector.tryNthNth" (outer |> PersistentVector.tryNthNth 1 -2) } + + test "vector of vectors can be updated with PersistentVector.updateNth" { + let inner = [1; 2; 3; 4; 5] |> PersistentVector.ofSeq + let outer = PersistentVector.empty |> PersistentVector.conj inner |> PersistentVector.conj inner + + Expect.equal "PersistentVector.updateNth" 7 (outer |> PersistentVector.updateNth 0 2 7 |> PersistentVector.nthNth 0 2) + Expect.equal "PersistentVector.updateNth" 9 (outer |> PersistentVector.updateNth 1 4 9 |> PersistentVector.nthNth 1 4) } + + test "PersistentVector.updateNth should not change the original vector" { + let inner = [1; 2; 3; 4; 5] |> PersistentVector.ofSeq + let outer = ref PersistentVector.empty + outer := PersistentVector.conj inner (!outer) + outer := PersistentVector.conj inner (!outer) + + Expect.equal "PersistentVector.updateNth" 7 (!outer |> PersistentVector.updateNth 0 2 7 |> PersistentVector.nthNth 0 2) + Expect.equal "PersistentVector.updateNth" 3 (!outer |> PersistentVector.nthNth 0 2) + Expect.equal "PersistentVector.updateNth" 9 (!outer |> PersistentVector.updateNth 1 4 9 |> PersistentVector.nthNth 1 4) + Expect.equal "PersistentVector.updateNth" 5 (!outer |> PersistentVector.nthNth 1 4) } + + test "PersistentVector.updateNth throws exception for out-of-bounds indices" { + let inner = [1; 2; 3; 4; 5] |> PersistentVector.ofSeq + let outer = PersistentVector.empty |> PersistentVector.conj inner |> PersistentVector.conj inner + + Expect.throwsT "PersistentVector.updateNth" (fun () -> PersistentVector.updateNth 0 6 7 outer |> ignore) + Expect.throwsT "PersistentVector.updateNth" (fun () -> PersistentVector.updateNth 9 2 7 outer |> ignore) + Expect.throwsT "PersistentVector.updateNth" (fun () -> PersistentVector.updateNth 1 -4 7 outer |> ignore) + Expect.throwsT "PersistentVector.updateNth" (fun () -> PersistentVector.updateNth -1 4 7 outer |> ignore) } + + test "PersistentVector.tryUpdateNth returns None for out-of-bounds indices" { + let inner = [1; 2; 3; 4; 5] |> PersistentVector.ofSeq + let outer = PersistentVector.empty |> PersistentVector.conj inner |> PersistentVector.conj inner + + Expect.isNone "" (PersistentVector.tryUpdateNth 0 6 7 outer) + Expect.isNone "" (PersistentVector.tryUpdateNth 9 2 7 outer) + Expect.isNone "" (PersistentVector.tryUpdateNth 1 -4 7 outer) + Expect.isNone "" (PersistentVector.tryUpdateNth -1 4 7 outer) } + + test "PersistentVector.tryUpdateNth is like PersistentVector.updateNth but returns option" { + let inner = [1; 2; 3; 4; 5] |> PersistentVector.ofSeq + let outer = PersistentVector.empty |> PersistentVector.conj inner |> PersistentVector.conj inner + + let result = outer |> PersistentVector.tryUpdateNth 0 2 7 + Expect.isSome "PersistentVector.tryUpdateNth" result + Expect.equal "PersistentVector.tryUpdateNth" 7 (result |> Option.get |> PersistentVector.nthNth 0 2) + + let result2 = outer |> PersistentVector.tryUpdateNth 1 4 9 + Expect.isSome "PersistentVector.tryUpdateNth" result2 + Expect.equal "PersistentVector.tryUpdateNth" 9 (result2 |> Option.get |> PersistentVector.nthNth 1 4) } + + test "PersistentVector.tryUpdateNth should not change the original vector" { + let inner = [1; 2; 3; 4; 5] |> PersistentVector.ofSeq + let outer = ref PersistentVector.empty + outer := PersistentVector.conj inner (!outer) + outer := PersistentVector.conj inner (!outer) + + Expect.equal "PersistentVector.tryUpdateNth" 7 (!outer |> PersistentVector.tryUpdateNth 0 2 7 |> Option.get |> PersistentVector.nthNth 0 2) + Expect.equal "PersistentVector.tryUpdateNth" 3 (!outer |> PersistentVector.nthNth 0 2) + Expect.equal "PersistentVector.tryUpdateNth" 9 (!outer |> PersistentVector.tryUpdateNth 1 4 9 |> Option.get |> PersistentVector.nthNth 1 4) + Expect.equal "PersistentVector.tryUpdateNth" 5 (!outer |> PersistentVector.nthNth 1 4) } + + test "can peek elements from a vector" { + let vector = PersistentVector.empty |> PersistentVector.conj 1 |> PersistentVector.conj 4 |> PersistentVector.conj 25 + Expect.equal "last" 25 (vector |> PersistentVector.last) } + + test "can pop elements from a vector" { + let vector = PersistentVector.empty |> PersistentVector.conj 1 |> PersistentVector.conj 4 |> PersistentVector.conj 25 + Expect.equal "last" 25 (vector |> PersistentVector.last) + Expect.equal "last" 4 (vector |> PersistentVector.initial |> PersistentVector.last) + Expect.equal "last" 1 (vector |> PersistentVector.initial |> PersistentVector.initial |> PersistentVector.last) + + Expect.equal "last" 3 (vector |> PersistentVector.length) + Expect.equal "last" 2 (vector |> PersistentVector.initial |> PersistentVector.length) + Expect.equal "last" 1 (vector |> PersistentVector.initial |> PersistentVector.initial |> PersistentVector.length) } + + test "vector with 300 elements should allow pop" { + let vector = ref PersistentVector.empty + for i in 1..300 do + vector := PersistentVector.conj i (!vector) + + for i in 1..300 do + vector := PersistentVector.initial (!vector) + + Expect.equal "PersistentVector.initial" [] (!vector |> Seq.toList) } + + test "vector with 3 elements can compute hashcodes" { + let vector1 = ref PersistentVector.empty + for i in 1..3 do + vector1 := PersistentVector.conj i (!vector1) + + let vector2 = ref PersistentVector.empty + for i in 1..3 do + vector2 := PersistentVector.conj i (!vector2) + + let vector3 = ref PersistentVector.empty + for i in 1..3 do + vector3 := PersistentVector.conj (2*i) (!vector3) + + Expect.equal "GetHashCode" (vector2.GetHashCode()) (vector1.GetHashCode()) + Expect.equal "GetHashCode" (vector2.GetHashCode()) (vector1.GetHashCode()) } + + test "vector with 3 elements can be compared" { + let vector1 = ref PersistentVector.empty + for i in 1..3 do + vector1 := PersistentVector.conj i (!vector1) + + let vector2 = ref PersistentVector.empty + for i in 1..3 do + vector2 := PersistentVector.conj i (!vector2) + + let vector3 = ref PersistentVector.empty + for i in 1..3 do + vector3 := PersistentVector.conj (2*i) (!vector3) + + Expect.equal "compare" vector1 vector1 + Expect.equal "compare" vector1 vector2 + Expect.notEqual "compare" vector1 vector3 } + + test "appending two vectors keeps order of items" { + let vector1 = ref PersistentVector.empty + for i in 1..3 do + vector1 := PersistentVector.conj i (!vector1) + + let vector2 = ref PersistentVector.empty + for i in 7..9 do + vector2 := PersistentVector.conj i (!vector2) + + Expect.equal "append" [1;2;3;7;8;9] (PersistentVector.append (!vector1) (!vector2) |> PersistentVector.toSeq |> Seq.toList) } + + test "vector should allow map" { + let vector = ref PersistentVector.empty + for i in 1..300 do + vector := PersistentVector.conj i (!vector) + + let vector2 = PersistentVector.map (fun x -> x * 2) (!vector) + + let a = vector2 |> Seq.toArray + for i in 1..300 do i * 2 |> Expect.equal "map" a.[i-1] } + + test "vector should allow init" { + let vector = PersistentVector.init 5 (fun x -> x * 2) + let s = Seq.init 5 (fun x -> x * 2) + + Expect.equal "init" [0;2;4;6;8] (s |> Seq.toList) + Expect.equal "init" [0;2;4;6;8] (vector |> Seq.toList) } + + test "windowSeq should keep every value from its original list" { + let seq30 = seq { for i in 1..30 do yield i } + let fullVec = PersistentVector.ofSeq seq30 + for i in 1..35 do + let vecs = PersistentVector.windowSeq i seq30 + Expect.equal "windowSeq" fullVec (vecs |> PersistentVector.fold PersistentVector.append PersistentVector.empty) } + + test "windowSeq should return vectors of equal length if possible" { + let seq30 = seq { for i in 1..30 do yield i } + + let len3vecs = PersistentVector.windowSeq 3 seq30 + let len5vecs = PersistentVector.windowSeq 5 seq30 + let len6vecs = PersistentVector.windowSeq 6 seq30 + + Expect.equal "windowSeq" 10 (len3vecs |> PersistentVector.length) + Expect.equal "windowSeq" 6 (len5vecs |> PersistentVector.length) + Expect.equal "windowSeq" 5 (len6vecs |> PersistentVector.length) + Expect.equal "windowSeq" [3;3;3;3;3;3;3;3;3;3] (len3vecs |> PersistentVector.map PersistentVector.length |> PersistentVector.toSeq |> Seq.toList) + Expect.equal "windowSeq" [5;5;5;5;5;5] (len5vecs |> PersistentVector.map PersistentVector.length |> PersistentVector.toSeq |> Seq.toList) + Expect.equal "windowSeq" [6;6;6;6;6] (len6vecs |> PersistentVector.map PersistentVector.length |> PersistentVector.toSeq |> Seq.toList) } + + test "windowSeq should return vectors all of equal length except the last" { + let seq30 = seq { for i in 1..30 do yield i } + + let len4vecs = PersistentVector.windowSeq 4 seq30 + let len7vecs = PersistentVector.windowSeq 7 seq30 + let len8vecs = PersistentVector.windowSeq 8 seq30 + let len17vecs = PersistentVector.windowSeq 17 seq30 + + Expect.equal "windowSeq" 8 (len4vecs |> PersistentVector.length) + Expect.equal "windowSeq" 5 (len7vecs |> PersistentVector.length) + Expect.equal "windowSeq" 4 (len8vecs |> PersistentVector.length) + Expect.equal "windowSeq" 2 (len17vecs |> PersistentVector.length) + Expect.equal "windowSeq" [4;4;4;4;4;4;4;2] (len4vecs |> PersistentVector.map PersistentVector.length |> PersistentVector.toSeq |> Seq.toList) + Expect.equal "windowSeq" [7;7;7;7;2] (len7vecs |> PersistentVector.map PersistentVector.length |> PersistentVector.toSeq |> Seq.toList) + Expect.equal "windowSeq" [8;8;8;6] (len8vecs |> PersistentVector.map PersistentVector.length |> PersistentVector.toSeq |> Seq.toList) + Expect.equal "windowSeq" [17;13] (len17vecs |> PersistentVector.map PersistentVector.length |> PersistentVector.toSeq |> Seq.toList) } + ] \ No newline at end of file diff --git a/tests/FSharpx.Collections.Tests/PriorityQueueTest.fs b/tests/FSharpx.Collections.Tests/PriorityQueueTest.fs index f944c991..131ac175 100644 --- a/tests/FSharpx.Collections.Tests/PriorityQueueTest.fs +++ b/tests/FSharpx.Collections.Tests/PriorityQueueTest.fs @@ -1,88 +1,82 @@ -module FSharpx.Collections.Tests.PriorityQueueTest +namespace FSharpx.Collections.Tests -open FSharpx -open FSharpx.Collections.PriorityQueue -open NUnit.Framework -open FsUnit +open FSharpx.Collections +open Expecto +open Expecto.Flip -[] -let ``empty queue should be empty``() = - let pq = empty false +module PriorityQueueTests = + let testPriorityQueue = - isEmpty pq |> should equal true - tryPeek pq |> should equal None - tryPop pq |> should equal None + testList "PriorityQueue" [ + test "empty queue should be empty" { + let pq = PriorityQueue.empty false -[] -let ``After adding an element to the PQ it shouldn't be empty``() = - let pq = empty false |> insert 1 + Expect.isTrue "empty" <| PriorityQueue.isEmpty pq + Expect.isNone "empty" <| PriorityQueue.tryPeek pq + Expect.isNone "empty" <| PriorityQueue.tryPop pq } - isEmpty pq |> should equal false - + test "After adding an element to the PQ it shouldn't be empty" { + let pq = PriorityQueue.empty false |> PriorityQueue.insert 1 + Expect.isFalse "PriorityQueue.insert" <| PriorityQueue.isEmpty pq } -[] -let ``After adding an element to the PQ the element should be the smallest``() = - let pq = empty false |> insert 1 + test "After adding an element to the PQ the element should be the smallest" { + let pq = PriorityQueue.empty false |> PriorityQueue.insert 1 - tryPeek pq |> should equal (Some 1) - peek pq |> should equal 1 + Expect.equal "PriorityQueue.insert" (Some 1) <| PriorityQueue.tryPeek pq + Expect.equal "PriorityQueue.insert" 1 <| PriorityQueue.peek pq } -[] -let ``After adding an element to the PQ and popping it the PQ should be empty``() = - let pq = empty false |> insert 1 + test "After adding an element to the PQ and popping it the PQ should be empty" { + let pq = PriorityQueue.empty false |> PriorityQueue.insert 1 - let element,newPQ = pop pq - element |> should equal 1 - isEmpty newPQ |> should equal true + let element,newPQ = PriorityQueue.pop pq + Expect.equal "PriorityQueue.pop" 1 element + Expect.isTrue "PriorityQueue.pop" <| PriorityQueue.isEmpty newPQ - let element,newPQ = (tryPop pq).Value - element |> should equal 1 - isEmpty newPQ |> should equal true + let element,newPQ = (PriorityQueue.tryPop pq).Value + Expect.equal "PriorityQueue.tryPop" 1 element + Expect.isTrue "PriorityQueue.tryPop" <| PriorityQueue.isEmpty newPQ } -[] -let ``Adding multiple elements to the PQ should allow to pop the smallest``() = - let pq = empty false |> insert 1 |> insert 3 |> insert 0 |> insert 4 |> insert -3 + test "Adding multiple elements to the PQ should allow to PriorityQueue.pop the smallest" { + let pq = PriorityQueue.empty false |> PriorityQueue.insert 1 |> PriorityQueue.insert 3 |> PriorityQueue.insert 0 |> PriorityQueue.insert 4 |> PriorityQueue.insert -3 - let element,newPQ = pop pq - element |> should equal -3 + let element,newPQ = PriorityQueue.pop pq + Expect.equal "PriorityQueue.pop" -3 element - let element,newPQ = pop newPQ - element |> should equal 0 + let element,newPQ = PriorityQueue.pop newPQ + Expect.equal "PriorityQueue.pop" 0 element - let element,newPQ = pop newPQ - element |> should equal 1 + let element,newPQ = PriorityQueue.pop newPQ + Expect.equal "PriorityQueue.pop" 1 element - let element,newPQ = pop newPQ - element |> should equal 3 + let element,newPQ = PriorityQueue.pop newPQ + Expect.equal "PriorityQueue.pop" 3 element - let element,newPQ = pop newPQ - element |> should equal 4 + let element,newPQ = PriorityQueue.pop newPQ + Expect.equal "PriorityQueue.pop" 4 element - isEmpty newPQ |> should equal true + Expect.isTrue "PriorityQueue.pop" <| PriorityQueue.isEmpty newPQ } -[] -let ``Adding multiple elements to a MaxPriorityQueue should allow to pop the smallest``() = - let pq = empty true |> insert 1 |> insert 3 |> insert 0 |> insert 4 |> insert -3 + test "Adding multiple elements to a MaxPriorityQueue should allow to PriorityQueue.pop the smallest" { + let pq = PriorityQueue.empty true |> PriorityQueue.insert 1 |> PriorityQueue.insert 3 |> PriorityQueue.insert 0 |> PriorityQueue.insert 4 |> PriorityQueue.insert -3 - let element,newPQ = pop pq - element |> should equal 4 + let element,newPQ = PriorityQueue.pop pq + Expect.equal "PriorityQueue.pop" 4 element - let element,newPQ = pop newPQ - element |> should equal 3 + let element,newPQ = PriorityQueue.pop newPQ + Expect.equal "PriorityQueue.pop" 3 element - let element,newPQ = pop newPQ - element |> should equal 1 + let element,newPQ = PriorityQueue.pop newPQ + Expect.equal "PriorityQueue.pop" 1 element - let element,newPQ = pop newPQ - element |> should equal 0 + let element,newPQ = PriorityQueue.pop newPQ + Expect.equal "PriorityQueue.pop" 0 element - let element,newPQ = pop newPQ - element |> should equal -3 + let element,newPQ = PriorityQueue.pop newPQ + Expect.equal "PriorityQueue.pop" -3 element - isEmpty newPQ |> should equal true + Expect.isTrue "PriorityQueue.pop" <| PriorityQueue.isEmpty newPQ } -[] -let ``Can use a PQ as a seq``() = - let pq = empty false |> insert 15 |> insert 3 |> insert 0 |> insert 4 |> insert -3 - - pq |> Seq.toList |> should equal [-3;0;3;4;15] \ No newline at end of file + test "Can use a PQ as a seq" { + let pq = PriorityQueue.empty false |> PriorityQueue.insert 15 |> PriorityQueue.insert 3 |> PriorityQueue.insert 0 |> PriorityQueue.insert 4 |> PriorityQueue.insert -3 + Expect.equal "" [-3;0;3;4;15] (pq |> Seq.toList) } + ] \ No newline at end of file diff --git a/tests/FSharpx.Collections.Tests/QueueTest.fs b/tests/FSharpx.Collections.Tests/QueueTest.fs index 8f634d4e..114b301b 100644 --- a/tests/FSharpx.Collections.Tests/QueueTest.fs +++ b/tests/FSharpx.Collections.Tests/QueueTest.fs @@ -1,241 +1,226 @@ -module FSharpx.Collections.Tests.QueueTest +namespace FSharpx.Collections.Tests open FSharpx.Collections -open FSharpx.Collections.Queue -open FSharpx.Collections.Tests.Properties -open NUnit.Framework +open Properties open FsCheck -open FsCheck.NUnit -open FsUnit +open Expecto +open Expecto.Flip -let emptyQueue = Queue.empty +module QueueTests = + let emptyQueue = Queue.empty -let enqueueThruList l q = - let rec loop (q' : 'a Queue) (l' : 'a list) = - match l' with - | hd :: [] -> q'.Conj hd - | hd :: tl -> loop (q'.Conj hd) tl - | [] -> q' - - loop q l - -//Queue -(* -non-IQueue generators from random ofList -*) -let queueOfListGen = - gen { let! n = Gen.length2thru12 - let! x = Gen.listInt n - return ( (Queue.ofList x), x) } - -(* -IQueue generators from random ofSeq and/or conj elements from random list -*) -let queueIntGen = - gen { let! n = Gen.length1thru12 - let! n2 = Gen.length2thru12 - let! x = Gen.listInt n - let! y = Gen.listInt n2 - return ( (Queue.ofSeq x |> enqueueThruList y), (x @ y) ) } - -let queueIntOfSeqGen = - gen { let! n = Gen.length1thru12 - let! x = Gen.listInt n - return ( (Queue.ofSeq x), x) } - -let queueIntConjGen = - gen { let! n = Gen.length1thru12 - let! x = Gen.listInt n - return ( (Queue.empty |> enqueueThruList x), x) } - -let queueObjGen = - gen { let! n = Gen.length2thru12 - let! n2 = Gen.length1thru12 - let! x = Gen.listObj n - let! y = Gen.listObj n2 - return ( (Queue.ofSeq x |> enqueueThruList y), (x @ y) ) } - -let queueStringGen = - gen { let! n = Gen.length1thru12 - let! n2 = Gen.length2thru12 - let! x = Gen.listString n - let! y = Gen.listString n2 - return ( (Queue.ofSeq x |> enqueueThruList y), (x @ y) ) } - -// NUnit TestCaseSource does not understand array of tuples at runtime -let intGens start = - let v = Array.create 3 (box (queueIntGen, "Queue")) - v.[1] <- box ((queueIntOfSeqGen |> Gen.suchThat (fun (q, l) -> l.Length >= start)), "Queue OfSeq") - v.[2] <- box ((queueIntConjGen |> Gen.suchThat (fun (q, l) -> l.Length >= start)), "Queue Enqueue") - v - -let intGensStart1 = - intGens 1 //this will accept all - -let intGensStart2 = - intGens 2 // this will accept 11 out of 12 - -[] -let ``allow to dequeue``() = - emptyQueue |> conj 1 |> tail |> isEmpty |> should equal true - -[] -let ``allow to enqueue``() = - emptyQueue |> conj 1 |> conj 2 |> isEmpty |> should equal false - -[] -let ``cons pattern discriminator - Queue``() = - let q = ofSeq ["f";"e";"d";"c";"b";"a"] + let testQueue = + + testList "Queue" [ + test "allow to dequeue" { + Expect.isTrue "tail Queue.isEmpty" (emptyQueue |> Queue.conj 1 |> Queue.tail |> Queue.isEmpty) } + + test "allow to enqueue" { + Expect.isFalse "tail" (emptyQueue |> Queue.conj 1 |> Queue.conj 2 |> Queue.isEmpty) } + + test "cons pattern discriminator - Queue" { + let q = Queue.ofSeq ["f";"e";"d";"c";"b";"a"] - let h1, t1 = - match q with - | Cons(h, t) -> h, t - | _ -> "x", q + let h1, t1 = + match q with + | Queue.Cons(h, t) -> h, t + | _ -> "x", q - ((h1 = "f") && (t1.Length = 5)) |> should equal true + Expect.isTrue "cons pattern discriminator" ((h1 = "f") && (t1.Length = 5)) } -[] -let ``empty queue should be empty``() = - emptyQueue |> isEmpty |> should equal true + test "empty queue should be empty" { + Expect.isTrue "empty" (emptyQueue |> Queue.isEmpty) } -[] -let ``fail if there is no head in the queue``() = - (fun () -> emptyQueue |> head |> ignore) |> should throw typeof + test "fail if there is no head in the queue" { + Expect.throwsT "no head" (fun () -> emptyQueue |>Queue. head |> ignore) } -[] -let ``fail if there is no tail in the queue``() = - (fun () -> emptyQueue |> tail |> ignore) |> should throw typeof + test "fail if there is no tail in the queue" { + Expect.throwsT "no tail" (fun () -> emptyQueue |> Queue.tail |> ignore) } -[] -let ``fold matches build list rev``() = + test "give None if there is no head in the queue" { + Expect.isNone "no head" (emptyQueue |> Queue.tryHead) } - fsCheck "Queue" (Prop.forAll (Arb.fromGen queueIntGen) - (fun ((q :Queue), (l : int list)) -> q |> fold (fun (l' : int list) (elem : int) -> elem::l') [] = (List.rev l) |> classifyCollect q q.Length)) - - fsCheck "Queue OfSeq" (Prop.forAll (Arb.fromGen queueIntOfSeqGen) -// (fun ((q :Queue), (l : int list)) -> q |> fold (fun (l' : int list) (elem : int) -> elem::l') [] = (List.rev l) |> classifyCollect q q.Length)) -//executes faster; classifyCollect for debugging - (fun ((q :Queue), (l : int list)) -> q |> fold (fun (l' : int list) (elem : int) -> elem::l') [] = (List.rev l) )) + test "give None if there is no tail in the queue" { + Expect.isNone "no tail" (emptyQueue |> Queue.tryTail) } + + test "toSeq to list" { + let l = ["f";"e";"d";"c";"b";"a"] + let q = Queue.ofSeq l + + Expect.equal "toSeq" l (q|> Queue.toSeq |> List.ofSeq) } + + test "TryUncons wind-down to None" { + let q = Queue.ofSeq ["f";"e";"d";"c";"b";"a"] + + let rec loop (q' : Queue) = + match (q'.TryUncons) with + | Some(_, tl) -> loop tl + | None -> None + + Expect.isNone "TryUncons" <| loop q } + + test "Uncons wind-down to None" { + let q = Queue.ofSeq ["f";"e";"d";"c";"b";"a"] + + let rec loop (q' : Queue) = + match (q'.Uncons) with + | _, tl when tl.IsEmpty -> true + | _, tl -> loop tl + + Expect.isTrue "Uncons" <| loop q } - fsCheck "Queue Conj" (Prop.forAll (Arb.fromGen queueIntConjGen) -// (fun ((q :Queue), (l : int list)) -> q |> fold (fun (l' : int list) (elem : int) -> elem::l') [] = (List.rev l) |> classifyCollect q q.Length)) - (fun ((q :Queue), (l : int list)) -> q |> fold (fun (l' : int list) (elem : int) -> elem::l') [] = (List.rev l) )) + test "structural equality" { + let l1 = Queue.ofSeq [1..100] + let l2 = Queue.ofSeq [1..100] -[] -let ``foldback matches build list``() = + Expect.equal "structural equality" l1 l2 - fsCheck "Queue" (Prop.forAll (Arb.fromGen queueIntGen) -// (fun ((q : Queue), (l : int list)) -> foldBack (fun (elem : int) (l' : int list) -> elem::l') q [] = l |> classifyCollect q q.Length)) - (fun ((q : Queue), (l : int list)) -> foldBack (fun (elem : int) (l' : int list) -> elem::l') q [] = l )) + let l3 = Queue.ofSeq [1..99] |> Queue.conj 7 + + Expect.notEqual "" l1 l3 } + ] + + [] + let propertyTestQueue = + + let enqueueThruList l q = + let rec loop (q' : 'a Queue) (l' : 'a list) = + match l' with + | hd :: [] -> q'.Conj hd + | hd :: tl -> loop (q'.Conj hd) tl + | [] -> q' + + loop q l + + //Queue + (* + non-IQueue generators from random ofList + *) + let queueOfListGen = + gen { let! n = Gen.length2thru12 + let! x = Gen.listInt n + return ( (Queue.ofList x), x) } + + (* + IQueue generators from random Queue.ofSeq and/or Queue.conj elements from random list + *) + let queueIntGen = + gen { let! n = Gen.length1thru12 + let! n2 = Gen.length2thru12 + let! x = Gen.listInt n + let! y = Gen.listInt n2 + return ( (Queue.ofSeq x |> enqueueThruList y), (x @ y) ) } + + let queueIntOfSeqGen = + gen { let! n = Gen.length1thru12 + let! x = Gen.listInt n + return ( (Queue.ofSeq x), x) } + + let queueIntConjGen = + gen { let! n = Gen.length1thru12 + let! x = Gen.listInt n + return ( (Queue.empty |> enqueueThruList x), x) } + + let queueObjGen = + gen { let! n = Gen.length2thru12 + let! n2 = Gen.length1thru12 + let! x = Gen.listObj n + let! y = Gen.listObj n2 + return ( (Queue.ofSeq x |> enqueueThruList y), (x @ y) ) } + + let queueStringGen = + gen { let! n = Gen.length1thru12 + let! n2 = Gen.length2thru12 + let! x = Gen.listString n + let! y = Gen.listString n2 + return ( (Queue.ofSeq x |> enqueueThruList y), (x @ y) ) } + + let intGens start = + let v = Array.create 3 queueIntGen + v.[1] <- queueIntOfSeqGen |> Gen.filter (fun (q, l) -> l.Length >= start) + v.[2] <-queueIntConjGen |> Gen.filter (fun (q, l) -> l.Length >= start) + v + + let intGensStart1 = + intGens 1 //this will accept all + + let intGensStart2 = + intGens 2 // this will accept 11 out of 12 + + testList "Queue property tests" [ + + testPropertyWithConfig config10k "fold matches build list rev" (Prop.forAll (Arb.fromGen queueIntGen) <| + fun (q, l) -> q |> Queue.fold (fun l' elem -> elem::l') [] = (List.rev l) |> classifyCollect q q.Length) - fsCheck "Queue OfSeq" (Prop.forAll (Arb.fromGen queueIntOfSeqGen) -// (fun ((q : Queue), (l : int list)) -> foldBack (fun (elem : int) (l' : int list) -> elem::l') q [] = l |> classifyCollect q q.Length)) - (fun ((q : Queue), (l : int list)) -> foldBack (fun (elem : int) (l' : int list) -> elem::l') q [] = l |> classifyCollect q q.Length)) - - fsCheck "Queue Conj" (Prop.forAll (Arb.fromGen queueIntConjGen) -// (fun ((q : Queue), (l : int list)) -> foldBack (fun (elem : int) (l' : int list) -> elem::l') q [] = l |> classifyCollect q q.Length)) - (fun ((q : Queue), (l : int list)) -> foldBack (fun (elem : int) (l' : int list) -> elem::l') q [] = l )) - -[] -[] -let ``get head from queue``(x : obj) = - let genAndName = unbox x -// fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun (q : Queue, l) -> (peek q) = (List.nth l 0) |> classifyCollect q q.Length)) - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun (q : Queue, l) -> (head q) = (List.nth l 0) )) - -[] -[] -let ``get head from queue safely``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun (q : Queue, l) -> (tryHead q).Value = (List.nth l 0) )) - -[] -[] -let ``get tail from queue``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun ((q : Queue), l) -> q.Tail.Head = (List.nth l 1) )) - -[] -[] -let ``get tail from queue safely``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun (q : Queue, l) -> q.TryTail.Value.Head = (List.nth l 1) )) - -[] -let ``give None if there is no head in the queue``() = - emptyQueue |> tryHead |> should equal None - -[] -let ``give None if there is no tail in the queue``() = - emptyQueue |> tryTail |> should equal None - -[] -[] -let ``int queue builds and serializes``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun (q : Queue, l) -> q |> Seq.toList = l )) - -[] -let ``obj queue builds and serializes``() = - fsCheck "obj Queue" (Prop.forAll (Arb.fromGen queueObjGen) (fun (q : Queue, l) -> q |> Seq.toList = l )) - -[] -let ``string queue builds and serializes``() = - fsCheck "string Queue" (Prop.forAll (Arb.fromGen queueStringGen) (fun (q : Queue, l) -> q |> Seq.toList = l )) - -[] -let ``reverse . reverse = id``() = - - fsCheck "obj Queue" (Prop.forAll (Arb.fromGen queueObjGen) - (fun (q, l) -> q |> rev |> rev |> Seq.toList = (q |> Seq.toList) )) - -[] -let ``ofList build and serialize``() = + testPropertyWithConfig config10k "Queue OfSeq fold matches build list rev" (Prop.forAll (Arb.fromGen queueIntOfSeqGen) <| + fun (q, l) -> q |> Queue.fold (fun l' elem -> elem::l') [] = (List.rev l) ) + + testPropertyWithConfig config10k "Queue Conj fold matches build list rev" (Prop.forAll (Arb.fromGen queueIntConjGen) <| + fun (q, l) -> q |> Queue.fold (fun l' elem -> elem::l') [] = (List.rev l) ) + + testPropertyWithConfig config10k "Queue foldback matches build list" (Prop.forAll (Arb.fromGen queueIntGen) <| + fun (q, l) -> Queue.foldBack (fun elem l' -> elem::l') q [] = l ) + + testPropertyWithConfig config10k " Queue OfSeqfoldback matches build list" (Prop.forAll (Arb.fromGen queueIntOfSeqGen) <| + fun (q, l) -> Queue.foldBack (fun elem l' -> elem::l') q [] = l |> classifyCollect q q.Length) + + testPropertyWithConfig config10k "Queue Conj foldback matches build list" (Prop.forAll (Arb.fromGen queueIntConjGen) <| + fun (q, l) -> Queue.foldBack (fun elem l' -> elem::l') q [] = l ) + + testPropertyWithConfig config10k "get head from queue 0" (Prop.forAll (Arb.fromGen intGensStart1.[0]) <| + fun (q, l) -> (Queue.head q) = (List.item 0 l) ) + + testPropertyWithConfig config10k "get head from queue 1" (Prop.forAll (Arb.fromGen intGensStart1.[1]) <| + fun (q, l) -> (Queue.head q) = (List.item 0 l) ) + + testPropertyWithConfig config10k "get head from queue 2" (Prop.forAll (Arb.fromGen intGensStart1.[2]) <| + fun (q, l) -> (Queue.head q) = (List.item 0 l) ) - fsCheck "Queue" (Prop.forAll (Arb.fromGen queueOfListGen) - (fun ((q : Queue), (l : int list)) -> q |> Seq.toList = l )) + testPropertyWithConfig config10k "get head from queue safely 0" (Prop.forAll (Arb.fromGen intGensStart1.[0]) <| + fun (q, l) -> (Queue.tryHead q).Value = (List.item 0 l) ) -[] -let ``toSeq to list``() = - let l = ["f";"e";"d";"c";"b";"a"] - let q = ofSeq l + testPropertyWithConfig config10k "get head from queue safely 1" (Prop.forAll (Arb.fromGen intGensStart1.[1]) <| + fun (q, l) -> (Queue.tryHead q).Value = (List.item 0 l) ) - q|> toSeq |> List.ofSeq |> should equal l + testPropertyWithConfig config10k "get head from queue safely 2" (Prop.forAll (Arb.fromGen intGensStart1.[2]) <| + fun (q, l) -> (Queue.tryHead q).Value = (List.item 0 l) ) -[] -let ``TryUncons wind-down to None``() = - let q = ofSeq ["f";"e";"d";"c";"b";"a"] + testPropertyWithConfig config10k "get tail from queue 0" (Prop.forAll (Arb.fromGen intGensStart2.[0]) <| + fun ((q), l) -> q.Tail.Head = (List.item 1 l) ) - let rec loop (q' : Queue) = - match (q'.TryUncons) with - | Some(hd, tl) -> loop tl - | None -> () + testPropertyWithConfig config10k "get tail from queue 1" (Prop.forAll (Arb.fromGen intGensStart2.[1]) <| + fun ((q), l) -> q.Tail.Head = (List.item 1 l) ) - loop q + testPropertyWithConfig config10k "get tail from queue 2" (Prop.forAll (Arb.fromGen intGensStart2.[2]) <| + fun ((q), l) -> q.Tail.Head = (List.item 1 l) ) - true |> should equal true + testPropertyWithConfig config10k "get tail from queue safely 0" (Prop.forAll (Arb.fromGen intGensStart2.[0]) <| + fun (q, l) -> q.TryTail.Value.Head = (List.item 1 l) ) -[] -let ``Uncons wind-down to None``() = - let q = ofSeq ["f";"e";"d";"c";"b";"a"] + testPropertyWithConfig config10k "get tail from queue safely 1" (Prop.forAll (Arb.fromGen intGensStart2.[1]) <| + fun (q, l) -> q.TryTail.Value.Head = (List.item 1 l) ) - let rec loop (q' : Queue) = - match (q'.Uncons) with - | hd, tl when tl.IsEmpty -> () - | hd, tl -> loop tl + testPropertyWithConfig config10k "get tail from queue safely 2" (Prop.forAll (Arb.fromGen intGensStart2.[2]) <| + fun (q, l) -> q.TryTail.Value.Head = (List.item 1 l) ) - loop q + testPropertyWithConfig config10k "int queue builds and serializes 0" (Prop.forAll (Arb.fromGen intGensStart1.[0]) <| + fun (q, l) -> q |> Seq.toList = l ) - true |> should equal true + testPropertyWithConfig config10k "int queue builds and serializes 1" (Prop.forAll (Arb.fromGen intGensStart1.[1]) <| + fun (q, l) -> q |> Seq.toList = l ) -[] -let ``structural equality``() = + testPropertyWithConfig config10k "int queue builds and serializes 2" (Prop.forAll (Arb.fromGen intGensStart1.[2]) <| + fun (q, l) -> q |> Seq.toList = l ) - let l1 = ofSeq [1..100] - let l2 = ofSeq [1..100] + testPropertyWithConfig config10k "obj queue builds and serializes" (Prop.forAll (Arb.fromGen queueObjGen) <| + fun (q : Queue, l) -> q |> Seq.toList = l ) - l1 = l2 |> should equal true + testPropertyWithConfig config10k "string queue builds and serializes" (Prop.forAll (Arb.fromGen queueStringGen) <| + fun (q : Queue, l) -> q |> Seq.toList = l ) - let l3 = ofSeq [1..99] |> conj 7 + testPropertyWithConfig config10k "reverse . reverse = id" (Prop.forAll (Arb.fromGen queueObjGen) <| + fun (q, l) -> q |> Queue.rev |> Queue.rev |> Seq.toList = (q |> Seq.toList) ) - l1 = l3 |> should equal false \ No newline at end of file + testPropertyWithConfig config10k "ofList build and serialize" (Prop.forAll (Arb.fromGen queueOfListGen) <| + fun (q, l) -> q |> Seq.toList = l ) + ] \ No newline at end of file diff --git a/tests/FSharpx.Collections.Tests/RandomAccessListTest.fs b/tests/FSharpx.Collections.Tests/RandomAccessListTest.fs index 4f8c3762..04147edc 100644 --- a/tests/FSharpx.Collections.Tests/RandomAccessListTest.fs +++ b/tests/FSharpx.Collections.Tests/RandomAccessListTest.fs @@ -1,928 +1,829 @@ -module FSharpx.Collections.Tests.RandomAccessListTest +namespace FSharpx.Collections.Tests open System open FSharpx.Collections -open FSharpx.Collections.RandomAccessList -open FSharpx.Collections.Tests.Properties -open NUnit.Framework +open Properties open FsCheck -open FsCheck.NUnit -open FsUnit +open Expecto +open Expecto.Flip //there's a crap-load to test here :) //vector blocksizej of 32, need to generate lists up to 100 -let emptyRandomAccessList = RandomAccessList.empty +module RandomAccessListTest = + let emptyRandomAccessList = RandomAccessList.empty -let consThruList l q = - let rec loop (q' : 'a RandomAccessList) (l' : 'a list) = - match l' with - | hd :: [] -> q'.Cons hd - | hd :: tl -> loop (q'.Cons hd) tl - | [] -> q' - - loop q l - -//RandomAccessList -(* -non-IRandomAccessList generators from random ofList -*) -let RandomAccessListOfListGen = - gen { let! n = Gen.length2thru100 - let! x = Gen.listInt n - return ( (RandomAccessList.ofSeq x), x) } - -(* -IRandomAccessList generators from random ofSeq and/or conj elements from random list -*) -let RandomAccessListIntGen = - gen { let! n = Gen.length1thru100 - let! n2 = Gen.length2thru100 - let! x = Gen.listInt n - let! y = Gen.listInt n2 - return ( (RandomAccessList.ofSeq x |> consThruList y), ((List.rev y) @ x) ) } - -let RandomAccessListIntOfSeqGen = - gen { let! n = Gen.length1thru100 - let! x = Gen.listInt n - return ( (RandomAccessList.ofSeq x), x) } - -let RandomAccessListIntConsGen = - gen { let! n = Gen.length1thru100 - let! x = Gen.listInt n - return ( (RandomAccessList.empty |> consThruList x), List.rev x) } - -let RandomAccessListObjGen = - gen { let! n = Gen.length2thru100 - let! n2 = Gen.length1thru100 - let! x = Gen.listObj n - let! y = Gen.listObj n2 - return ( (RandomAccessList.ofSeq x |> consThruList y), ((List.rev y) @ x) ) } - -let RandomAccessListStringGen = - gen { let! n = Gen.length1thru100 - let! n2 = Gen.length2thru100 - let! x = Gen.listString n - let! y = Gen.listString n2 - return ( (RandomAccessList.ofSeq x |> consThruList y), ((List.rev y) @ x) ) } - -// NUnit TestCaseSource does not understand array of tuples at runtime -let intGens start = - let v = Array.create 3 (box (RandomAccessListIntGen, "RandomAccessList")) - v.[1] <- box ((RandomAccessListIntOfSeqGen |> Gen.suchThat (fun (q, l) -> l.Length >= start)), "RandomAccessList OfSeq") - v.[2] <- box ((RandomAccessListIntConsGen |> Gen.suchThat (fun (q, l) -> l.Length >= start)), "RandomAccessList conjRandomAccessList") - v - -let intGensStart1 = - intGens 1 //this will accept all - -let intGensStart2 = - intGens 2 // this will accept 11 out of 12 - -[] -let ``fail if there is no head in the RandomAccessList``() = - (fun () -> emptyRandomAccessList |> head |> ignore) |> should throw typeof - -[] -let ``fail if there is no tail in the RandomAccessList``() = - (fun () -> emptyRandomAccessList |> tail |> ignore) |> should throw typeof - -[] -let ``fold matches build list rev``() = - - fsCheck "RandomAccessList" (Prop.forAll (Arb.fromGen RandomAccessListIntGen) - (fun ((q :RandomAccessList), (l : int list)) -> q |> fold (fun (l' : int list) (elem : int) -> elem::l') [] = (List.rev l) )) - - fsCheck "RandomAccessList OfSeq" (Prop.forAll (Arb.fromGen RandomAccessListIntOfSeqGen) - (fun ((q :RandomAccessList), (l : int list)) -> q |> fold (fun (l' : int list) (elem : int) -> elem::l') [] = (List.rev l) )) + let testRandomAccessList = - fsCheck "RandomAccessList Cons" (Prop.forAll (Arb.fromGen RandomAccessListIntConsGen) - (fun ((q :RandomAccessList), (l : int list)) -> q |> fold (fun (l' : int list) (elem : int) -> elem::l') [] = (List.rev l) )) + testList "RandomAccessList" [ -[] -let ``foldBack matches build list``() = + test "fail if there is no RandomAccessList.head in the RandomAccessList" { + Expect.throwsT "no RandomAccessList.head" (fun () -> emptyRandomAccessList |> RandomAccessList.head |> ignore) } - fsCheck "RandomAccessList" (Prop.forAll (Arb.fromGen RandomAccessListIntGen) - (fun ((q :RandomAccessList), (l : int list)) -> foldBack (fun (elem : int) (l' : int list) -> elem::l') q [] = l )) - - fsCheck "RandomAccessList OfSeq" (Prop.forAll (Arb.fromGen RandomAccessListIntOfSeqGen) - (fun ((q :RandomAccessList), (l : int list)) -> foldBack (fun (elem : int) (l' : int list) -> elem::l') q [] = l )) - - fsCheck "RandomAccessList Conj" (Prop.forAll (Arb.fromGen RandomAccessListIntConsGen) - (fun ((q :RandomAccessList), (l : int list)) -> foldBack (fun (elem : int) (l' : int list) -> elem::l') q [] = l )) - -[] -let ``foldBack matches build list 2``() = - let q = ofSeq ["f";"e";"d";"c";"b";"a"] - let lq = foldBack (fun (elem : string) (l' : string list) -> elem::l') q [] - lq |> should equal (List.ofSeq q) - -[] -let ``fold matches build list rev 2``() = - let q = ofSeq ["f";"e";"d";"c";"b";"a"] - let lq = fold (fun (l' : string list) (elem : string) -> elem::l') [] q - lq |> should equal (List.rev (List.ofSeq q)) - -[] -[] -let ``get head from RandomAccessList``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun (q : RandomAccessList, l) -> (head q) = (List.nth l 0) )) - -[] -[] -let ``get head from RandomAccessList safely``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun (q : RandomAccessList, l) -> (tryHead q).Value = (List.nth l 0) )) - -[] -[] -let ``get tail from RandomAccessList``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun ((q : RandomAccessList), l) -> q.Tail.Head = (List.nth l 1) )) - -[] -[] -let ``get tail from RandomAccessList safely``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun (q : RandomAccessList, l) -> q.TryTail.Value.Head = (List.nth l 1) )) - -[] -[] -let ``int RandomAccessList builds and serializes``(x : obj) = - let genAndName = unbox x - fsCheck (snd genAndName) (Prop.forAll (Arb.fromGen (fst genAndName)) (fun (q : RandomAccessList, l) -> q |> Seq.toList = l )) - -[] -let ``obj RandomAccessList builds and serializes``() = - fsCheck "obj RandomAccessList" (Prop.forAll (Arb.fromGen RandomAccessListObjGen) (fun (q : RandomAccessList, l) -> q |> Seq.toList = l )) - -[] -let ``string RandomAccessList builds and serializes``() = - fsCheck "string RandomAccessList" (Prop.forAll (Arb.fromGen RandomAccessListStringGen) (fun (q : RandomAccessList, l) -> q |> Seq.toList = l )) - -[] -let ``TryUncons wind-down to None``() = - let q = ofSeq ["f";"e";"d";"c";"b";"a"] - - let rec loop (q' : RandomAccessList) = - match (q'.TryUncons) with - | Some(hd, tl) -> loop tl - | None -> () - - loop q - - true |> should equal true - -[] -let ``Uncons wind-down to None``() = - let q = ofSeq ["f";"e";"d";"c";"b";"a"] - - let rec loop (q' : RandomAccessList) = - match (q'.Uncons) with - | hd, tl when tl.IsEmpty -> () - | hd, tl -> loop tl - - loop q - - true |> should equal true - -[] -let ``empty list should be empty``() = - empty |> isEmpty |> should equal true - -[] -let ``cons works``() = - empty|> cons 1 |> cons 2 |> isEmpty |> should equal false - -[] -let ``uncons 1 element``() = - let x, _ = empty |> cons 1 |> uncons - (x = 1) |> should equal true - -[] -let ``uncons 2 elements``() = - let x, _ = empty |> cons 1 |> cons 2 |> uncons - (x = 2) |> should equal true - -[] -let ``uncons 3 elements``() = - let x, _ = empty |> cons 1 |> cons 2 |> cons 3 |> uncons - (x = 3) |> should equal true - -[] -let ``tryUncons 1 element``() = - let x = empty |> cons 1 |> tryUncons - (fst(x.Value) = 1) |> should equal true - -[] -let ``tryUncons 2 elements``() = - let x = empty |> cons 1 |> cons 2 |> tryUncons - (fst(x.Value) = 2) |> should equal true - -[] -let ``tryUncons 3 elements``() = - let x = empty |> cons 1 |> cons 2 |> cons 3 |> tryUncons - (fst(x.Value) = 3) |> should equal true - -[] -let ``tryUncons empty``() = - empty |> tryUncons |> should equal None - -[] -let ``head should return``() = - let x = empty |> cons 1 |> cons 2 |> head - x |> should equal 2 - -[] -let ``tryHead should return``() = - let x = empty |> cons 1 |> cons 2 |> tryHead - x.Value |> should equal 2 - -[] -let ``tryHead on empty should return None``() = - empty |> tryHead |> should equal None - -[] -let ``tryTail on empty should return None``() = - empty |> tryTail |> should equal None - -[] -let ``tryTail on len 1 should return Some empty``() = - let x = (empty |> cons 1 |> tryTail).Value - x |> isEmpty |> should equal true - -[] -let ``tail on len 2 should return``() = - empty |> cons 1 |> cons 2 |> tail |> head |> should equal 1 - -[] -let ``tryTail on len 2 should return``() = - let a = empty |> cons 1 |> cons 2 |> tryTail - ((head a.Value) = 1) |> should equal true - -[] -let ``randomAccessList of randomAccessLists constructed by consing tail``() = - - let windowFun windowLength = - fun (v : RandomAccessList>) t -> - if v.Head.Length = windowLength then RandomAccessList.cons (RandomAccessList.empty.Cons(t)) v - else RandomAccessList.tail v |> RandomAccessList.cons (RandomAccessList.cons t (RandomAccessList.head v)) - - let windowed = - seq{1..100} - |> Seq.fold (windowFun 5) (RandomAccessList.empty.Cons RandomAccessList.empty) - - windowed.Length |> should equal 20 - windowed.[2].Length |> should equal 5 - -[] -let ``windowSeq should keep every value from its original list``() = - let seq30 = seq { for i in 1..30 do yield i } - let fullVec = ofSeq seq30 - for i in 1..35 do - let lists = windowSeq i seq30 - lists |> fold append empty |> should equal fullVec - lists |> fold append empty |> toSeq |> Seq.take 5 |> Seq.toList |> should equal [1;2;3;4;5] - -[] -let ``windowSeq should return vectors of equal length if possible``() = - let seq30 = seq { for i in 1..30 do yield i } - - let len3lists = windowSeq 3 seq30 - let len5lists = windowSeq 5 seq30 - let len6lists = windowSeq 6 seq30 - - len3lists |> length |> should equal 10 - len5lists |> length |> should equal 6 - len6lists |> length |> should equal 5 - len3lists |> map length |> toSeq |> Seq.toList |> should equal [3;3;3;3;3;3;3;3;3;3] - len5lists |> map length |> toSeq |> Seq.toList |> should equal [5;5;5;5;5;5] - len6lists |> map length |> toSeq |> Seq.toList |> should equal [6;6;6;6;6] - -[] -let ``windowSeq should return vectors all of equal length except the first``() = - let seq30 = seq { for i in 1..30 do yield i } - - let len4lists = windowSeq 4 seq30 - let len7lists = windowSeq 7 seq30 - let len8lists = windowSeq 8 seq30 - let len17lists = windowSeq 17 seq30 - - len4lists |> length |> should equal 8 - len7lists |> length |> should equal 5 - len8lists |> length |> should equal 4 - len17lists |> length |> should equal 2 - len4lists |> map length |> toSeq |> Seq.toList |> should equal [2;4;4;4;4;4;4;4] (*[4;4;4;4;4;4;4;2]*) - len7lists |> map length |> toSeq |> Seq.toList |> should equal [2;7;7;7;7] - len8lists |> map length |> toSeq |> Seq.toList |> should equal [6;8;8;8] - len17lists |> map length |> toSeq |> Seq.toList |> should equal [13;17] - -[] -let ``nth on empty list should throw``() = - let x = empty - (fun () -> x |> nth 0 |> ignore) |> should throw typeof - -[] -let ``nth length 1``() = - let x = empty |> cons "a" - let x' = x |> nth 0 - x' |> should equal "a" - -[] -let ``appending two lists keeps order of items``() = - let list1 = ref empty - for i in 3 .. -1 .. 1 do - list1 := cons i (!list1) - - let list2 = ref empty - for i in 9 .. -1 .. 7 do - list2 := cons i (!list2) - - append (!list1) (!list2) |> toSeq |> Seq.toList |> should equal [1;2;3;7;8;9] - -[] -let ``rev empty``() = - isEmpty (empty |> rev) |> should equal true + test "fail if there is no RandomAccessList.tail in the RandomAccessList" { + Expect.throwsT "no RandomAccessList.tail" (fun () -> emptyRandomAccessList |> RandomAccessList.tail |> ignore) } + + test "RandomAccessList.foldBack matches build list 2" { + let q = RandomAccessList.ofSeq ["f";"e";"d";"c";"b";"a"] + Expect.equal "RandomAccessList.foldBack" (List.ofSeq q) <| RandomAccessList.foldBack (fun (elem : string) (l' : string list) -> elem::l') q [] } + + test "RandomAccessList.fold matches build list rev 2" { + let q = RandomAccessList.ofSeq ["f";"e";"d";"c";"b";"a"] + Expect.equal "RandomAccessList.fold" (List.rev (List.ofSeq q)) <| RandomAccessList.fold (fun (l' : string list) (elem : string) -> elem::l') [] q } + + test "TryUncons wind-down to None" { + let q = RandomAccessList.ofSeq ["f";"e";"d";"c";"b";"a"] + + let rec loop (q' : RandomAccessList) = + match (q'.TryUncons) with + | Some(hd, tl) -> loop tl + | None -> None + + Expect.isNone "TryUncons" <| loop q } + + test "Uncons wind-down to None" { + let q = RandomAccessList.ofSeq ["f";"e";"d";"c";"b";"a"] + + let rec loop (q' : RandomAccessList) = + match (q'.Uncons) with + | hd, tl when tl.IsEmpty -> true + | hd, tl -> loop tl + + Expect.isTrue "Uncons" <| loop q } + + test "RandomAccessList.empty list should be RandomAccessList.empty" { + Expect.isTrue "RandomAccessList.empty" (RandomAccessList.empty |> RandomAccessList.isEmpty) } + + test "RandomAccessList.cons works" { + Expect.isFalse "RandomAccessList.cons" (RandomAccessList.empty|> RandomAccessList.cons 1 |> RandomAccessList.cons 2 |> RandomAccessList.isEmpty) } + + test "RandomAccessList.uncons 1 element" { + let x, _ = RandomAccessList.empty |> RandomAccessList.cons 1 |> RandomAccessList.uncons + Expect.equal "RandomAccessList.uncons" 1 x } + + test "RandomAccessList.uncons 2 elements" { + let x, _ = RandomAccessList.empty |> RandomAccessList.cons 1 |> RandomAccessList.cons 2 |> RandomAccessList.uncons + Expect.equal "RandomAccessList.uncons" 2 x } + + test "RandomAccessList.uncons 3 elements" { + let x, _ = RandomAccessList.empty |> RandomAccessList.cons 1 |> RandomAccessList.cons 2 |> RandomAccessList.cons 3 |> RandomAccessList.uncons + Expect.equal "RandomAccessList.uncons" 3 x } + + test "RandomAccessList.tryUncons 1 element" { + let x = RandomAccessList.empty |> RandomAccessList.cons 1 |> RandomAccessList.tryUncons + Expect.equal "RandomAccessList.tryUncons" 1 <| fst x.Value } + + test "RandomAccessList.tryUncons 2 elements" { + let x = RandomAccessList.empty |> RandomAccessList.cons 1 |> RandomAccessList.cons 2 |> RandomAccessList.tryUncons + Expect.equal "RandomAccessList.tryUncons" 2 <| fst x.Value } + + test "RandomAccessList.tryUncons 3 elements" { + let x = RandomAccessList.empty |> RandomAccessList.cons 1 |> RandomAccessList.cons 2 |> RandomAccessList.cons 3 |> RandomAccessList.tryUncons + Expect.equal "RandomAccessList.tryUncons" 3 <| fst x.Value } + + test "RandomAccessList.tryUncons RandomAccessList.empty" { + Expect.isNone "RandomAccessList.tryUncons" (RandomAccessList.empty |> RandomAccessList.tryUncons) } + + test "RandomAccessList.head should return" { + Expect.equal "RandomAccessList.head" 2 (RandomAccessList.empty |> RandomAccessList.cons 1 |> RandomAccessList.cons 2 |> RandomAccessList.head) } + + test "RandomAccessList.tryHead should return" { + Expect.equal "RandomAccessList.tryHead" 2 (RandomAccessList.empty |> RandomAccessList.cons 1 |> RandomAccessList.cons 2 |> RandomAccessList.tryHead).Value } + + test "RandomAccessList.tryHead on RandomAccessList.empty should return None" { + Expect.isNone "RandomAccessList.tryHead" (RandomAccessList.empty |> RandomAccessList.tryHead) } + + test "RandomAccessList.tryTail on RandomAccessList.empty should return None" { + Expect.isNone "RandomAccessList.tryTail" (RandomAccessList.empty |> RandomAccessList.tryTail) } + + test "RandomAccessList.tryTail on len 1 should return Some RandomAccessList.empty" { + let x = (RandomAccessList.empty |> RandomAccessList.cons 1 |> RandomAccessList.tryTail).Value + Expect.isTrue "RandomAccessList.tryTail" (x |> RandomAccessList.isEmpty) } + + test "RandomAccessList.tail on len 2 should return" { + Expect.equal "RandomAccessList.tail" 1 (RandomAccessList.empty |> RandomAccessList.cons 1 |> RandomAccessList.cons 2 |> RandomAccessList.tail |> RandomAccessList.head) } + + test "RandomAccessList.tryTail on len 2 should return" { + let a = RandomAccessList.empty |> RandomAccessList.cons 1 |> RandomAccessList.cons 2 |> RandomAccessList.tryTail + Expect.equal "RandomAccessList.tryTail" 1 <| RandomAccessList.head a.Value } + + test "randomAccessList of randomAccessLists constructed by consing RandomAccessList.tail" { + + let windowFun windowLength = + fun (v : RandomAccessList>) t -> + if v.Head.Length = windowLength then RandomAccessList.cons (RandomAccessList.empty.Cons(t)) v + else RandomAccessList.tail v |> RandomAccessList.cons (RandomAccessList.cons t (RandomAccessList.head v)) + + let windowed = + seq{1..100} + |> Seq.fold (windowFun 5) (RandomAccessList.empty.Cons RandomAccessList.empty) + + Expect.equal "windowed" 20 windowed.Length + Expect.equal "windowed" 5 windowed.[2].Length } + + test "RandomAccessList.windowSeq should keep every value from its original list" { + let seq30 = seq { for i in 1..30 do yield i } + let fullVec = RandomAccessList.ofSeq seq30 + for i in 1..35 do + let lists = RandomAccessList.windowSeq i seq30 + Expect.equal "RandomAccessList.windowSeq" fullVec (lists |> RandomAccessList.fold RandomAccessList.append RandomAccessList.empty) + Expect.equal "RandomAccessList.windowSeq" [1;2;3;4;5] (lists |> RandomAccessList.fold RandomAccessList.append RandomAccessList.empty |> RandomAccessList.toSeq |> Seq.take 5 |> Seq.toList) } + + test "RandomAccessList.windowSeq should return vectors of equal RandomAccessList.length if possible" { + let seq30 = seq { for i in 1..30 do yield i } + + let len3lists = RandomAccessList.windowSeq 3 seq30 + let len5lists = RandomAccessList.windowSeq 5 seq30 + let len6lists = RandomAccessList.windowSeq 6 seq30 + + Expect.equal "RandomAccessList.windowSeq" 10 (len3lists |> RandomAccessList.length) + Expect.equal "RandomAccessList.windowSeq" 6 (len5lists |> RandomAccessList.length) + Expect.equal "RandomAccessList.windowSeq" 5 (len6lists |> RandomAccessList.length) + Expect.equal "RandomAccessList.windowSeq" [3;3;3;3;3;3;3;3;3;3] (len3lists |> RandomAccessList.map RandomAccessList.length |> RandomAccessList.toSeq |> Seq.toList) + Expect.equal "RandomAccessList.windowSeq" [5;5;5;5;5;5] (len5lists |> RandomAccessList.map RandomAccessList.length |> RandomAccessList.toSeq |> Seq.toList) + Expect.equal "RandomAccessList.windowSeq" [6;6;6;6;6] (len6lists |> RandomAccessList.map RandomAccessList.length |> RandomAccessList.toSeq |> Seq.toList) } + + test "RandomAccessList.windowSeq should return vectors all of equal RandomAccessList.length except the first" { + let seq30 = seq { for i in 1..30 do yield i } + + let len4lists = RandomAccessList.windowSeq 4 seq30 + let len7lists = RandomAccessList.windowSeq 7 seq30 + let len8lists = RandomAccessList.windowSeq 8 seq30 + let len17lists = RandomAccessList.windowSeq 17 seq30 + + Expect.equal "" 8 (len4lists |> RandomAccessList.length) + Expect.equal "" 5 (len7lists |> RandomAccessList.length) + Expect.equal "" 4 (len8lists |> RandomAccessList.length) + Expect.equal "" 2 (len17lists |> RandomAccessList.length) + Expect.equal "" [2;4;4;4;4;4;4;4] (len4lists |> RandomAccessList.map RandomAccessList.length |> RandomAccessList.toSeq |> Seq.toList) (*[4;4;4;4;4;4;4;2]*) + Expect.equal "" [2;7;7;7;7] (len7lists |> RandomAccessList.map RandomAccessList.length |> RandomAccessList.toSeq |> Seq.toList) + Expect.equal "" [6;8;8;8] (len8lists |> RandomAccessList.map RandomAccessList.length |> RandomAccessList.toSeq |> Seq.toList) + Expect.equal "" [13;17] (len17lists |> RandomAccessList.map RandomAccessList.length |> RandomAccessList.toSeq |> Seq.toList) } + + test "RandomAccessList.nth on RandomAccessList.empty list should throw" { + Expect.throwsT "RandomAccessList.empty list" (fun () -> RandomAccessList.empty |> RandomAccessList.nth 0 |> ignore) } + + test "RandomAccessList.nth RandomAccessList.length 1" { + let x = RandomAccessList.empty |> RandomAccessList.cons "a" + Expect.equal "RandomAccessList.nth" "a" (x |> RandomAccessList.nth 0) } + + test "appending two lists keeps order of items" { + let list1 = ref RandomAccessList.empty + for i in 3 .. -1 .. 1 do + list1 := RandomAccessList.cons i (!list1) + + let list2 = ref RandomAccessList.empty + for i in 9 .. -1 .. 7 do + list2 := RandomAccessList.cons i (!list2) + + Expect.equal "" [1;2;3;7;8;9] (RandomAccessList.append (!list1) (!list2) |> RandomAccessList.toSeq |> Seq.toList) } + + test "rev RandomAccessList.empty" { + Expect.isTrue "rev RandomAccessList.empty" <| RandomAccessList.isEmpty (RandomAccessList.empty |> RandomAccessList.rev) } + + test "rev elements RandomAccessList.length 5" { + let a = RandomAccessList.ofSeq ["a";"b";"c";"d";"e"] + let b = RandomAccessList.rev a + + let c = List.ofSeq b + Expect.equal "rev" "a" a.Head + Expect.equal "rev" "e" b.Head + Expect.equal "rev" "e" c.Head + Expect.equal "rev" (["a";"b";"c";"d";"e"] |> List.rev) (b |> List.ofSeq) } + + test "rev elements RandomAccessList.length 15" { + let a = RandomAccessList.ofSeq ["a";"b";"c";"d";"e"; "f"; "g"; "h"; "i"; "j"; "l"; "m"; "n"; "o"; "p"] + let b = RandomAccessList.rev a + Expect.equal "rev" (["a";"b";"c";"d";"e"; "f"; "g"; "h"; "i"; "j"; "l"; "m"; "n"; "o"; "p"] |> List.rev) (b |> List.ofSeq) } + + test "rev 300" { + let x = RandomAccessList.ofSeq [1..300] + Expect.equal "rev" (List.rev [1..300]) (x.Rev() |> List.ofSeq) } + + test "RandomAccessList.nth RandomAccessList.length 2" { + Expect.isTrue "" (((RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" |> RandomAccessList.nth 0) = "b") && ((RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" |> RandomAccessList.nth 1) = "a")) } + + test "RandomAccessList.nth RandomAccessList.length 3" { + let len3 = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" |> RandomAccessList.cons "c" + (((len3 |> RandomAccessList.nth 0) = "c") + && ((len3 |> RandomAccessList.nth 1) = "b") + && ((len3 |> RandomAccessList.nth 2) = "a")) |> Expect.isTrue "RandomAccessList.nth" } + + test "RandomAccessList.nth RandomAccessList.length 4" { + let len4 = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" |> RandomAccessList.cons "c" |> RandomAccessList.cons "d" + Expect.isTrue "RandomAccessList.nth" (((len4 |> RandomAccessList.nth 0) = "d") && ((len4 |> RandomAccessList.nth 1) = "c") && ((len4 |> RandomAccessList.nth 2) = "b") && ((len4 |> RandomAccessList.nth 3) = "a")) } + + test "RandomAccessList.nth RandomAccessList.length 5" { + let len5 = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" |> RandomAccessList.cons "c" |> RandomAccessList.cons "d" |> RandomAccessList.cons "e" + (((len5 |> RandomAccessList.nth 0) = "e") && ((len5 |> RandomAccessList.nth 1) = "d") && ((len5 |> RandomAccessList.nth 2) = "c") && ((len5 |> RandomAccessList.nth 3) = "b") + && ((len5 |> RandomAccessList.nth 4) = "a")) |> Expect.isTrue "RandomAccessList.nth" } + + test "RandomAccessList.nth RandomAccessList.length 6" { + let len6 = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" |> RandomAccessList.cons "c" |> RandomAccessList.cons "d" |> RandomAccessList.cons "e" |> RandomAccessList.cons "f" + (((len6 |> RandomAccessList.nth 0) = "f") && ((len6 |> RandomAccessList.nth 1) = "e") && ((len6 |> RandomAccessList.nth 2) = "d") && ((len6 |> RandomAccessList.nth 3) = "c") + && ((len6 |> RandomAccessList.nth 4) = "b") && ((len6 |> RandomAccessList.nth 5) = "a")) |> Expect.isTrue "RandomAccessList.nth" } + + test "RandomAccessList.nth RandomAccessList.length 7" { + let len7 = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" |> RandomAccessList.cons "c" |> RandomAccessList.cons "d" |> RandomAccessList.cons "e" |> RandomAccessList.cons "f" |> RandomAccessList.cons "g" + (((len7 |> RandomAccessList.nth 0) = "g") && ((len7 |> RandomAccessList.nth 1) = "f") && ((len7 |> RandomAccessList.nth 2) = "e") && ((len7 |> RandomAccessList.nth 3) = "d") + && ((len7 |> RandomAccessList.nth 4) = "c") && ((len7 |> RandomAccessList.nth 5) = "b") && ((len7 |> RandomAccessList.nth 6) = "a")) |> Expect.isTrue "RandomAccessList.nth" } + + test "RandomAccessList.nth RandomAccessList.length 8" { + let len8 = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" |> RandomAccessList.cons "c" |> RandomAccessList.cons "d" |> RandomAccessList.cons "e" |> RandomAccessList.cons "f" |> RandomAccessList.cons "g" |> RandomAccessList.cons "h" + (((len8 |> RandomAccessList.nth 0) = "h") && ((len8 |> RandomAccessList.nth 1) = "g") && ((len8 |> RandomAccessList.nth 2) = "f") && ((len8 |> RandomAccessList.nth 3) = "e") + && ((len8 |> RandomAccessList.nth 4) = "d") && ((len8 |> RandomAccessList.nth 5) = "c") && ((len8 |> RandomAccessList.nth 6) = "b") && ((len8 |> RandomAccessList.nth 7) = "a")) + |> Expect.isTrue "RandomAccessList.nth" } + + test "RandomAccessList.nth RandomAccessList.length 9" { + let len9 = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" |> RandomAccessList.cons "c" |> RandomAccessList.cons "d" |> RandomAccessList.cons "e" |> RandomAccessList.cons "f" |> RandomAccessList.cons "g" |> RandomAccessList.cons "h" |> RandomAccessList.cons "i" + (((len9 |> RandomAccessList.nth 0) = "i") && ((len9 |> RandomAccessList.nth 1) = "h") && ((len9 |> RandomAccessList.nth 2) = "g") && ((len9 |> RandomAccessList.nth 3) = "f") + && ((len9 |> RandomAccessList.nth 4) = "e") && ((len9 |> RandomAccessList.nth 5) = "d") && ((len9 |> RandomAccessList.nth 6) = "c") && ((len9 |> RandomAccessList.nth 7) = "b") + && ((len9 |> RandomAccessList.nth 8) = "a")) |> Expect.isTrue "RandomAccessList.nth" } + + test "RandomAccessList.nth RandomAccessList.length 10" { + let lena = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" |> RandomAccessList.cons "c" |> RandomAccessList.cons "d" |> RandomAccessList.cons "e" |> RandomAccessList.cons "f" |> RandomAccessList.cons "g" |> RandomAccessList.cons "h" |> RandomAccessList.cons "i" |> RandomAccessList.cons "j" + (((lena |> RandomAccessList.nth 0) = "j") && ((lena |> RandomAccessList.nth 1) = "i") && ((lena |> RandomAccessList.nth 2) = "h") && ((lena |> RandomAccessList.nth 3) = "g") + && ((lena |> RandomAccessList.nth 4) = "f") && ((lena |> RandomAccessList.nth 5) = "e") && ((lena |> RandomAccessList.nth 6) = "d") && ((lena |> RandomAccessList.nth 7) = "c") + && ((lena |> RandomAccessList.nth 8) = "b") && ((lena |> RandomAccessList.nth 9) = "a")) |> Expect.isTrue "RandomAccessList.nth" } + + test "RandomAccessList.tryNth RandomAccessList.length 1" { + let a = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.tryNth 0 + Expect.equal "RandomAccessList.tryNth" "a" a.Value} + + test "RandomAccessList.tryNth RandomAccessList.length 2" { + let len2 = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" + let b = len2 |> RandomAccessList.tryNth 0 + let a = len2 |> RandomAccessList.tryNth 1 + Expect.isTrue "RandomAccessList.tryNth" ((b.Value = "b") && (a.Value = "a")) } + + test "RandomAccessList.tryNth RandomAccessList.length 3" { + let len3 = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" |> RandomAccessList.cons "c" + let c = len3 |> RandomAccessList.tryNth 0 + let b = len3 |> RandomAccessList.tryNth 1 + let a = len3 |> RandomAccessList.tryNth 2 + Expect.isTrue "RandomAccessList.tryNth"((c.Value = "c") && (b.Value = "b") && (a.Value = "a")) } + + test "RandomAccessList.tryNth RandomAccessList.length 4" { + let len4 = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" |> RandomAccessList.cons "c" |> RandomAccessList.cons "d" + let d = len4 |> RandomAccessList.tryNth 0 + let c = len4 |> RandomAccessList.tryNth 1 + let b = len4 |> RandomAccessList.tryNth 2 + let a = len4 |> RandomAccessList.tryNth 3 + Expect.isTrue "RandomAccessList.tryNth" ((d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) } + + test "RandomAccessList.tryNth RandomAccessList.length 5" { + let len5 = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" |> RandomAccessList.cons "c" |> RandomAccessList.cons "d" |> RandomAccessList.cons "e" + let e = len5 |> RandomAccessList.tryNth 0 + let d = len5 |> RandomAccessList.tryNth 1 + let c = len5 |> RandomAccessList.tryNth 2 + let b = len5 |> RandomAccessList.tryNth 3 + let a = len5 |> RandomAccessList.tryNth 4 + Expect.isTrue "RandomAccessList.tryNth" ((e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) } + + test "RandomAccessList.tryNth RandomAccessList.length 6" { + let len6 = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" |> RandomAccessList.cons "c" |> RandomAccessList.cons "d" |> RandomAccessList.cons "e" |> RandomAccessList.cons "f" + let f = len6 |> RandomAccessList.tryNth 0 + let e = len6 |> RandomAccessList.tryNth 1 + let d = len6 |> RandomAccessList.tryNth 2 + let c = len6 |> RandomAccessList.tryNth 3 + let b = len6 |> RandomAccessList.tryNth 4 + let a = len6 |> RandomAccessList.tryNth 5 + + Expect.isTrue "RandomAccessList.tryNth" ((f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) } + + test "RandomAccessList.tryNth RandomAccessList.length 7" { + let len7 = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" |> RandomAccessList.cons "c" |> RandomAccessList.cons "d" |> RandomAccessList.cons "e" |> RandomAccessList.cons "f" |> RandomAccessList.cons "g" + let g = len7 |> RandomAccessList.tryNth 0 + let f = len7 |> RandomAccessList.tryNth 1 + let e = len7 |> RandomAccessList.tryNth 2 + let d = len7 |> RandomAccessList.tryNth 3 + let c = len7 |> RandomAccessList.tryNth 4 + let b = len7 |> RandomAccessList.tryNth 5 + let a = len7 |> RandomAccessList.tryNth 6 + ((g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") + && (a.Value = "a")) |> Expect.isTrue "RandomAccessList.tryNth" } + + test "RandomAccessList.tryNth RandomAccessList.length 8" { + let len8 = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" |> RandomAccessList.cons "c" |> RandomAccessList.cons "d" |> RandomAccessList.cons "e" |> RandomAccessList.cons "f" |> RandomAccessList.cons "g" |> RandomAccessList.cons "h" + let h = len8 |> RandomAccessList.tryNth 0 + let g = len8 |> RandomAccessList.tryNth 1 + let f = len8 |> RandomAccessList.tryNth 2 + let e = len8 |> RandomAccessList.tryNth 3 + let d = len8 |> RandomAccessList.tryNth 4 + let c = len8 |> RandomAccessList.tryNth 5 + let b = len8 |> RandomAccessList.tryNth 6 + let a = len8 |> RandomAccessList.tryNth 7 + ((h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") + && (b.Value = "b")&& (a.Value = "a")) |> Expect.isTrue "RandomAccessList.tryNth" } + + test "RandomAccessList.tryNth RandomAccessList.length 9" { + let len9 = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" |> RandomAccessList.cons "c" |> RandomAccessList.cons "d" |> RandomAccessList.cons "e" |> RandomAccessList.cons "f" |> RandomAccessList.cons "g" |> RandomAccessList.cons "h" |> RandomAccessList.cons "i" + let i = len9 |> RandomAccessList.tryNth 0 + let h = len9 |> RandomAccessList.tryNth 1 + let g = len9 |> RandomAccessList.tryNth 2 + let f = len9 |> RandomAccessList.tryNth 3 + let e = len9 |> RandomAccessList.tryNth 4 + let d = len9 |> RandomAccessList.tryNth 5 + let c = len9 |> RandomAccessList.tryNth 6 + let b = len9 |> RandomAccessList.tryNth 7 + let a = len9 |> RandomAccessList.tryNth 8 + ((i.Value = "i") && (h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") + && (c.Value = "c") && (b.Value = "b")&& (a.Value = "a")) |> Expect.isTrue "RandomAccessList.tryNth" } + + test "RandomAccessList.tryNth RandomAccessList.length 10" { + let lena = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" |> RandomAccessList.cons "c" |> RandomAccessList.cons "d" |> RandomAccessList.cons "e" |> RandomAccessList.cons "f" |> RandomAccessList.cons "g" |> RandomAccessList.cons "h" |> RandomAccessList.cons "i" |> RandomAccessList.cons "j" + let j = lena |> RandomAccessList.tryNth 0 + let i = lena |> RandomAccessList.tryNth 1 + let h = lena |> RandomAccessList.tryNth 2 + let g = lena |> RandomAccessList.tryNth 3 + let f = lena |> RandomAccessList.tryNth 4 + let e = lena |> RandomAccessList.tryNth 5 + let d = lena |> RandomAccessList.tryNth 6 + let c = lena |> RandomAccessList.tryNth 7 + let b = lena |> RandomAccessList.tryNth 8 + let a = lena |> RandomAccessList.tryNth 9 + ((j.Value = "j") && (i.Value = "i") && (h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") + && (d.Value = "d") && (c.Value = "c") && (b.Value = "b")&& (a.Value = "a")) |> Expect.isTrue "RandomAccessList.tryNth" } + + test "RandomAccessList.tryNth not found" { + let lena = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" |> RandomAccessList.cons "c" |> RandomAccessList.cons "d" |> RandomAccessList.cons "e" |> RandomAccessList.cons "f" |> RandomAccessList.cons "g" |> RandomAccessList.cons "h" |> RandomAccessList.cons "i" |> RandomAccessList.cons "j" + Expect.isNone "RandomAccessList.tryNth" (lena |> RandomAccessList.tryNth 10) } + + test "list of lists can be accessed with RandomAccessList.nthNth" { + let inner = [1; 2; 3; 4; 5] |> RandomAccessList.ofSeq + let outer = RandomAccessList.empty |> RandomAccessList.cons inner |> RandomAccessList.cons inner + + Expect.equal "RandomAccessList.nthNth" 3 (outer |> RandomAccessList.nthNth 0 2) + Expect.equal "RandomAccessList.nthNth" 5 ( outer |> RandomAccessList.nthNth 1 4) } + + test "RandomAccessList.nthNth throws exception for out-of-bounds indices" { + let inner = [1; 2; 3; 4; 5] |> RandomAccessList.ofSeq + let outer = RandomAccessList.empty |> RandomAccessList.cons inner |> RandomAccessList.cons inner + + Expect.throwsT "RandomAccessList.nthNth" (fun () -> RandomAccessList.nthNth 2 2 outer |> ignore) + Expect.throwsT "RandomAccessList.nthNth" (fun () -> RandomAccessList.nthNth 1 5 outer |> ignore) + Expect.throwsT "RandomAccessList.nthNth" (fun () -> RandomAccessList.nthNth -1 2 outer |> ignore) + Expect.throwsT "RandomAccessList.nthNth" (fun () -> RandomAccessList.nthNth 1 -2 outer |> ignore) } + + test "list of lists can be accessed with RandomAccessList.tryNthNth" { + let inner = [1; 2; 3; 4; 5] |> RandomAccessList.ofSeq + let outer = RandomAccessList.empty |> RandomAccessList.cons inner |> RandomAccessList.cons inner + + Expect.equal "RandomAccessList.tryNthNth" (Some 3) (outer |> RandomAccessList.tryNthNth 0 2) + Expect.equal "RandomAccessList.tryNthNth" (Some 5) (outer |> RandomAccessList.tryNthNth 1 4) } + + test "RandomAccessList.tryNthNth returns None for out-of-bounds indices" { + let inner = [1; 2; 3; 4; 5] |> RandomAccessList.ofSeq + let outer = RandomAccessList.empty |> RandomAccessList.cons inner |> RandomAccessList.cons inner + + Expect.isNone "RandomAccessList.tryNthNth" (outer |> RandomAccessList.tryNthNth 2 2) + Expect.isNone "RandomAccessList.tryNthNth" (outer |> RandomAccessList.tryNthNth 1 5) + Expect.isNone "RandomAccessList.tryNthNth" (outer |> RandomAccessList.tryNthNth -1 2) + Expect.isNone "RandomAccessList.tryNthNth" (outer |> RandomAccessList.tryNthNth 1 -2) } + + test "list of lists can be RandomAccessList.updated with RandomAccessList.updateNth" { + let inner = [1; 2; 3; 4; 5] |> RandomAccessList.ofSeq + let outer = RandomAccessList.empty |> RandomAccessList.cons inner |> RandomAccessList.cons inner + + Expect.equal "RandomAccessList.updateNth" 7 (outer |> RandomAccessList.updateNth 0 2 7 |> RandomAccessList.nthNth 0 2) + Expect.equal "RandomAccessList.updateNth" 9 (outer |> RandomAccessList.updateNth 1 4 9 |> RandomAccessList.nthNth 1 4) } + + test "RandomAccessList.updateNth should not change the original list" { + let inner = [1; 2; 3; 4; 5] |> RandomAccessList.ofSeq + let outer = ref RandomAccessList.empty + outer := RandomAccessList.cons inner (!outer) + outer := RandomAccessList.cons inner (!outer) + + Expect.equal "RandomAccessList.updateNth" 7 (!outer |> RandomAccessList.updateNth 0 2 7 |> RandomAccessList.nthNth 0 2) + Expect.equal "RandomAccessList.updateNth" 3 (!outer |> RandomAccessList.nthNth 0 2) + Expect.equal "RandomAccessList.updateNth" 9 (!outer |> RandomAccessList.updateNth 1 4 9 |> RandomAccessList.nthNth 1 4) + Expect.equal "RandomAccessList.updateNth" 5 (!outer |> RandomAccessList.nthNth 1 4) } + + test "RandomAccessList.updateNth throws exception for out-of-bounds indices" { + let inner = [1; 2; 3; 4; 5] |> RandomAccessList.ofSeq + let outer = RandomAccessList.empty |> RandomAccessList.cons inner |> RandomAccessList.cons inner + + Expect.throwsT "RandomAccessList.updateNth" (fun () -> RandomAccessList.updateNth 0 6 7 outer |> ignore) + Expect.throwsT "RandomAccessList.updateNth" (fun () -> RandomAccessList.updateNth 9 2 7 outer |> ignore) + Expect.throwsT "RandomAccessList.updateNth" (fun () -> RandomAccessList.updateNth 1 -4 7 outer |> ignore) + Expect.throwsT "RandomAccessList.updateNth" (fun () -> RandomAccessList.updateNth -1 4 7 outer |> ignore) } + + test "RandomAccessList.tryUpdateNth returns None for out-of-bounds indices" { + let inner = [1; 2; 3; 4; 5] |> RandomAccessList.ofSeq + let outer = RandomAccessList.empty |> RandomAccessList.cons inner |> RandomAccessList.cons inner + + Expect.isNone "RandomAccessList.tryUpdateNth" <| RandomAccessList.tryUpdateNth 0 6 7 outer + Expect.isNone "RandomAccessList.tryUpdateNth" <| RandomAccessList.tryUpdateNth 9 2 7 outer + Expect.isNone "RandomAccessList.tryUpdateNth" <| RandomAccessList.tryUpdateNth 1 -4 7 outer + Expect.isNone "RandomAccessList.tryUpdateNth" <| RandomAccessList.tryUpdateNth -1 4 7 outer } + + test "RandomAccessList.tryUpdateNth is like RandomAccessList.updateNth but returns option" { + let inner = [1; 2; 3; 4; 5] |> RandomAccessList.ofSeq + let outer = RandomAccessList.empty |> RandomAccessList.cons inner |> RandomAccessList.cons inner + + let result = outer |> RandomAccessList.tryUpdateNth 0 2 7 + Expect.isTrue "RandomAccessList.tryUpdateNth" (result |> Option.isSome) + Expect.equal "RandomAccessList.tryUpdateNth" 7 (result |> Option.get |> RandomAccessList.nthNth 0 2) + + let result2 = outer |> RandomAccessList.tryUpdateNth 1 4 9 + Expect.isTrue "RandomAccessList.tryUpdateNth" (result2 |> Option.isSome) + Expect.equal "RandomAccessList.tryUpdateNth" 9 (result2 |> Option.get |> RandomAccessList.nthNth 1 4) } + + test "RandomAccessList.tryUpdateNth should not change the original list" { + let inner = [1; 2; 3; 4; 5] |> RandomAccessList.ofSeq + let outer = ref RandomAccessList.empty + outer := RandomAccessList.cons inner (!outer) + outer := RandomAccessList.cons inner (!outer) + + Expect.equal "" 7 (!outer |> RandomAccessList.tryUpdateNth 0 2 7 |> Option.get |> RandomAccessList.nthNth 0 2) + Expect.equal "RandomAccessList.tryUpdateNth" 3 (!outer |> RandomAccessList.nthNth 0 2) + Expect.equal "" 9 (!outer |> RandomAccessList.tryUpdateNth 1 4 9 |> Option.get |> RandomAccessList.nthNth 1 4) + Expect.equal "RandomAccessList.tryUpdateNth" 5 (!outer |> RandomAccessList.nthNth 1 4) } + + test "RandomAccessList.update RandomAccessList.length 1" { + Expect.equal "RandomAccessList.update" "aa" (RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.update 0 "aa"|> RandomAccessList.nth 0) } + + test "RandomAccessList.update RandomAccessList.length 2" { + let len2 = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" + Expect.isTrue "RandomAccessList.update" (((len2 |> RandomAccessList.update 0 "bb"|> RandomAccessList.nth 0) = "bb") && ((len2 |> RandomAccessList.update 1 "aa"|> RandomAccessList.nth 1) = "aa")) } + + test "RandomAccessList.update RandomAccessList.length 3" { + let len3 = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" |> RandomAccessList.cons "c" + (((len3 |> RandomAccessList.update 0 "cc"|> RandomAccessList.nth 0) = "cc") && ((len3 |> RandomAccessList.update 1 "bb"|> RandomAccessList.nth 1) = "bb") + && ((len3 |> RandomAccessList.update 2 "aa"|> RandomAccessList.nth 2) = "aa")) |> Expect.isTrue "RandomAccessList.update" } + + test "RandomAccessList.update RandomAccessList.length 4" { + let len4 = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" |> RandomAccessList.cons "c" |> RandomAccessList.cons "d" + (((len4 |> RandomAccessList.update 0 "dd"|> RandomAccessList.nth 0) = "dd") && ((len4 |> RandomAccessList.update 1 "cc"|> RandomAccessList.nth 1) = "cc") + && ((len4 |> RandomAccessList.update 2 "bb"|> RandomAccessList.nth 2) = "bb") && ((len4 |> RandomAccessList.update 3 "aa"|> RandomAccessList.nth 3) = "aa")) + |> Expect.isTrue "RandomAccessList.update" } + + test "RandomAccessList.update RandomAccessList.length 5" { + let len5 = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" |> RandomAccessList.cons "c" |> RandomAccessList.cons "d" |> RandomAccessList.cons "e" + (((len5 |> RandomAccessList.update 0 "ee"|> RandomAccessList.nth 0) = "ee") && ((len5 |> RandomAccessList.update 1 "dd"|> RandomAccessList.nth 1) = "dd") + && ((len5 |> RandomAccessList.update 2 "cc"|> RandomAccessList.nth 2) = "cc") && ((len5 |> RandomAccessList.update 3 "bb"|> RandomAccessList.nth 3) = "bb") + && ((len5 |> RandomAccessList.update 4 "aa"|> RandomAccessList.nth 4) = "aa")) |> Expect.isTrue "RandomAccessList.update" } + + test "RandomAccessList.update RandomAccessList.length 6" { + let len6 = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" |> RandomAccessList.cons "c" |> RandomAccessList.cons "d" |> RandomAccessList.cons "e" |> RandomAccessList.cons "f" + (((len6 |> RandomAccessList.update 0 "ff"|> RandomAccessList.nth 0) = "ff") && ((len6 |> RandomAccessList.update 1 "ee"|> RandomAccessList.nth 1) = "ee") + && ((len6 |> RandomAccessList.update 2 "dd"|> RandomAccessList.nth 2) = "dd") && ((len6 |> RandomAccessList.update 3 "cc"|> RandomAccessList.nth 3) = "cc") + && ((len6 |> RandomAccessList.update 4 "bb"|> RandomAccessList.nth 4) = "bb") && ((len6 |> RandomAccessList.update 5 "aa"|> RandomAccessList.nth 5) = "aa")) |> Expect.isTrue "RandomAccessList.update" } + + test "RandomAccessList.update RandomAccessList.length 7" { + let len7 = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" |> RandomAccessList.cons "c" |> RandomAccessList.cons "d" |> RandomAccessList.cons "e" |> RandomAccessList.cons "f" |> RandomAccessList.cons "g" + (((len7 |> RandomAccessList.update 0 "gg"|> RandomAccessList.nth 0) = "gg") && ((len7 |> RandomAccessList.update 1 "ff"|> RandomAccessList.nth 1) = "ff") + && ((len7 |> RandomAccessList.update 2 "ee"|> RandomAccessList.nth 2) = "ee") && ((len7 |> RandomAccessList.update 3 "dd"|> RandomAccessList.nth 3) = "dd") + && ((len7 |> RandomAccessList.update 4 "cc"|> RandomAccessList.nth 4) = "cc") && ((len7 |> RandomAccessList.update 5 "bb"|> RandomAccessList.nth 5) = "bb") + && ((len7 |> RandomAccessList.update 6 "aa"|> RandomAccessList.nth 6) = "aa")) |> Expect.isTrue "RandomAccessList.update" } + + test "RandomAccessList.update RandomAccessList.length 8" { + let len8 = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" |> RandomAccessList.cons "c" |> RandomAccessList.cons "d" |> RandomAccessList.cons "e" |> RandomAccessList.cons "f" |> RandomAccessList.cons "g" |> RandomAccessList.cons "h" + (((len8 |> RandomAccessList.update 0 "hh"|> RandomAccessList.nth 0) = "hh") && ((len8 |> RandomAccessList.update 1 "gg"|> RandomAccessList.nth 1) = "gg") + && ((len8 |> RandomAccessList.update 2 "ff"|> RandomAccessList.nth 2) = "ff") && ((len8 |> RandomAccessList.update 3 "ee"|> RandomAccessList.nth 3) = "ee") + && ((len8 |> RandomAccessList.update 4 "dd"|> RandomAccessList.nth 4) = "dd") && ((len8 |> RandomAccessList.update 5 "cc"|> RandomAccessList.nth 5) = "cc") + && ((len8 |> RandomAccessList.update 6 "bb"|> RandomAccessList.nth 6) = "bb") && ((len8 |> RandomAccessList.update 7 "aa"|> RandomAccessList.nth 7) = "aa")) + |> Expect.isTrue "RandomAccessList.update" } + + test "RandomAccessList.update RandomAccessList.length 9" { + let len9 = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" |> RandomAccessList.cons "c" |> RandomAccessList.cons "d" |> RandomAccessList.cons "e" |> RandomAccessList.cons "f" |> RandomAccessList.cons "g" |> RandomAccessList.cons "h" |> RandomAccessList.cons "i" + (((len9 |> RandomAccessList.update 0 "ii"|> RandomAccessList.nth 0) = "ii") && ((len9 |> RandomAccessList.update 1 "hh"|> RandomAccessList.nth 1) = "hh") + && ((len9 |> RandomAccessList.update 2 "gg"|> RandomAccessList.nth 2) = "gg") && ((len9 |> RandomAccessList.update 3 "ff"|> RandomAccessList.nth 3) = "ff") + && ((len9 |> RandomAccessList.update 4 "ee"|> RandomAccessList.nth 4) = "ee") && ((len9 |> RandomAccessList.update 5 "dd"|> RandomAccessList.nth 5) = "dd") + && ((len9 |> RandomAccessList.update 6 "cc"|> RandomAccessList.nth 6) = "cc") && ((len9 |> RandomAccessList.update 7 "bb"|> RandomAccessList.nth 7) = "bb") + && ((len9 |> RandomAccessList.update 8 "aa"|> RandomAccessList.nth 8) = "aa")) |> Expect.isTrue "RandomAccessList.update" } + + test "RandomAccessList.update RandomAccessList.length 10" { + let lena = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" |> RandomAccessList.cons "c" |> RandomAccessList.cons "d" |> RandomAccessList.cons "e" |> RandomAccessList.cons "f" |> RandomAccessList.cons "g" |> RandomAccessList.cons "h" |> RandomAccessList.cons "i" |> RandomAccessList.cons "j" + (((lena |> RandomAccessList.update 0 "jj"|> RandomAccessList.nth 0) = "jj") && ((lena |> RandomAccessList.update 1 "ii"|> RandomAccessList.nth 1) = "ii") + && ((lena |> RandomAccessList.update 2 "hh"|> RandomAccessList.nth 2) = "hh") && ((lena |> RandomAccessList.update 3 "gg"|> RandomAccessList.nth 3) = "gg") + && ((lena |> RandomAccessList.update 4 "ff"|> RandomAccessList.nth 4) = "ff") && ((lena |> RandomAccessList.update 5 "ee"|> RandomAccessList.nth 5) = "ee") + && ((lena |> RandomAccessList.update 6 "dd"|> RandomAccessList.nth 6) = "dd") && ((lena |> RandomAccessList.update 7 "cc"|> RandomAccessList.nth 7) = "cc") + && ((lena |> RandomAccessList.update 8 "bb"|> RandomAccessList.nth 8) = "bb") && ((lena |> RandomAccessList.update 9 "aa"|> RandomAccessList.nth 9) = "aa")) |> Expect.isTrue "RandomAccessList.update" } + + test "RandomAccessList.tryUpdate RandomAccessList.length 1" { + let a = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.tryUpdate 0 "aa" + ((a.Value |> RandomAccessList.nth 0) = "aa") |> Expect.isTrue "RandomAccessList.tryUpdate" } + + test "RandomAccessList.tryUpdate RandomAccessList.length 2" { + let len2 = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" + let b = len2 |> RandomAccessList.tryUpdate 0 "bb" + let a = len2 |> RandomAccessList.tryUpdate 1 "aa" + (((b.Value |> RandomAccessList.nth 0) = "bb") && ((a.Value |> RandomAccessList.nth 1) = "aa")) |> Expect.isTrue "RandomAccessList.tryUpdate" } + + test "RandomAccessList.tryUpdate RandomAccessList.length 3" { + let len3 = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" |> RandomAccessList.cons "c" + let c = len3 |> RandomAccessList.tryUpdate 0 "cc" + let b = len3 |> RandomAccessList.tryUpdate 1 "bb" + let a = len3 |> RandomAccessList.tryUpdate 2 "aa" + (((c.Value |> RandomAccessList.nth 0) = "cc") && ((b.Value |> RandomAccessList.nth 1) = "bb") && ((a.Value |> RandomAccessList.nth 2) = "aa")) |> Expect.isTrue "RandomAccessList.tryUpdate" } + + test "RandomAccessList.tryUpdate RandomAccessList.length 4" { + let len4 = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" |> RandomAccessList.cons "c" |> RandomAccessList.cons "d" + let d = len4 |> RandomAccessList.tryUpdate 0 "dd" + let c = len4 |> RandomAccessList.tryUpdate 1 "cc" + let b = len4 |> RandomAccessList.tryUpdate 2 "bb" + let a = len4 |> RandomAccessList.tryUpdate 3 "aa" + (((d.Value |> RandomAccessList.nth 0) = "dd") && ((c.Value |> RandomAccessList.nth 1) = "cc") && ((b.Value |> RandomAccessList.nth 2) = "bb") + && ((a.Value |> RandomAccessList.nth 3) = "aa")) |> Expect.isTrue "RandomAccessList.tryUpdate" } + + test "RandomAccessList.tryUpdate RandomAccessList.length 5" { + let len5 = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" |> RandomAccessList.cons "c" |> RandomAccessList.cons "d" |> RandomAccessList.cons "e" + let e = len5 |> RandomAccessList.tryUpdate 0 "ee" + let d = len5 |> RandomAccessList.tryUpdate 1 "dd" + let c = len5 |> RandomAccessList.tryUpdate 2 "cc" + let b = len5 |> RandomAccessList.tryUpdate 3 "bb" + let a = len5 |> RandomAccessList.tryUpdate 4 "aa" + (((e.Value |> RandomAccessList.nth 0) = "ee") && ((d.Value |> RandomAccessList.nth 1) = "dd") && ((c.Value |> RandomAccessList.nth 2) = "cc") + && ((b.Value |> RandomAccessList.nth 3) = "bb") && ((a.Value |> RandomAccessList.nth 4) = "aa")) |> Expect.isTrue "RandomAccessList.tryUpdate" } + + test "RandomAccessList.tryUpdate RandomAccessList.length 6" { + let len6 = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" |> RandomAccessList.cons "c" |> RandomAccessList.cons "d" |> RandomAccessList.cons "e" |> RandomAccessList.cons "f" + let f = len6 |> RandomAccessList.tryUpdate 0 "ff" + let e = len6 |> RandomAccessList.tryUpdate 1 "ee" + let d = len6 |> RandomAccessList.tryUpdate 2 "dd" + let c = len6 |> RandomAccessList.tryUpdate 3 "cc" + let b = len6 |> RandomAccessList.tryUpdate 4 "bb" + let a = len6 |> RandomAccessList.tryUpdate 5 "aa" + (((f.Value |> RandomAccessList.nth 0) = "ff") && ((e.Value |> RandomAccessList.nth 1) = "ee") && ((d.Value |> RandomAccessList.nth 2) = "dd") + && ((c.Value |> RandomAccessList.nth 3) = "cc") && ((b.Value |> RandomAccessList.nth 4) = "bb") && ((a.Value |> RandomAccessList.nth 5) = "aa")) + |> Expect.isTrue "RandomAccessList.tryUpdate" } + + test "RandomAccessList.tryUpdate RandomAccessList.length 7" { + let len7 = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" |> RandomAccessList.cons "c" |> RandomAccessList.cons "d" |> RandomAccessList.cons "e" |> RandomAccessList.cons "f" |> RandomAccessList.cons "g" + let g = len7 |> RandomAccessList.tryUpdate 0 "gg" + let f = len7 |> RandomAccessList.tryUpdate 1 "ff" + let e = len7 |> RandomAccessList.tryUpdate 2 "ee" + let d = len7 |> RandomAccessList.tryUpdate 3 "dd" + let c = len7 |> RandomAccessList.tryUpdate 4 "cc" + let b = len7 |> RandomAccessList.tryUpdate 5 "bb" + let a = len7 |> RandomAccessList.tryUpdate 6 "aa" + (((g.Value |> RandomAccessList.nth 0) = "gg") && ((f.Value |> RandomAccessList.nth 1) = "ff") && ((e.Value |> RandomAccessList.nth 2) = "ee") + && ((d.Value |> RandomAccessList.nth 3) = "dd") && ((c.Value |> RandomAccessList.nth 4) = "cc") && ((b.Value |> RandomAccessList.nth 5) = "bb") + && ((a.Value |> RandomAccessList.nth 6) = "aa")) |> Expect.isTrue "RandomAccessList.tryUpdate" } + + test "RandomAccessList.tryUpdate RandomAccessList.length 8" { + let len8 = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" |> RandomAccessList.cons "c" |> RandomAccessList.cons "d" |> RandomAccessList.cons "e" |> RandomAccessList.cons "f" |> RandomAccessList.cons "g" |> RandomAccessList.cons "h" + let h = len8 |> RandomAccessList.tryUpdate 0 "hh" + let g = len8 |> RandomAccessList.tryUpdate 1 "gg" + let f = len8 |> RandomAccessList.tryUpdate 2 "ff" + let e = len8 |> RandomAccessList.tryUpdate 3 "ee" + let d = len8 |> RandomAccessList.tryUpdate 4 "dd" + let c = len8 |> RandomAccessList.tryUpdate 5 "cc" + let b = len8 |> RandomAccessList.tryUpdate 6 "bb" + let a = len8 |> RandomAccessList.tryUpdate 7 "aa" + (((h.Value |> RandomAccessList.nth 0) = "hh") && ((g.Value |> RandomAccessList.nth 1) = "gg") && ((f.Value |> RandomAccessList.nth 2) = "ff") + && ((e.Value |> RandomAccessList.nth 3) = "ee") && ((d.Value |> RandomAccessList.nth 4) = "dd") && ((c.Value |> RandomAccessList.nth 5) = "cc") + && ((b.Value |> RandomAccessList.nth 6) = "bb")&& ((a.Value |> RandomAccessList.nth 7) = "aa")) |> Expect.isTrue "RandomAccessList.tryUpdate" } + + test "RandomAccessList.tryUpdate RandomAccessList.length 9" { + let len9 = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" |> RandomAccessList.cons "c" |> RandomAccessList.cons "d" |> RandomAccessList.cons "e" |> RandomAccessList.cons "f" |> RandomAccessList.cons "g" |> RandomAccessList.cons "h" |> RandomAccessList.cons "i" + let i = len9 |> RandomAccessList.tryUpdate 0 "ii" + let h = len9 |> RandomAccessList.tryUpdate 1 "hh" + let g = len9 |> RandomAccessList.tryUpdate 2 "gg" + let f = len9 |> RandomAccessList.tryUpdate 3 "ff" + let e = len9 |> RandomAccessList.tryUpdate 4 "ee" + let d = len9 |> RandomAccessList.tryUpdate 5 "dd" + let c = len9 |> RandomAccessList.tryUpdate 6 "cc" + let b = len9 |> RandomAccessList.tryUpdate 7 "bb" + let a = len9 |> RandomAccessList.tryUpdate 8 "aa" + (((i.Value |> RandomAccessList.nth 0) = "ii") && ((h.Value |> RandomAccessList.nth 1) = "hh") && ((g.Value |> RandomAccessList.nth 2) = "gg") + && ((f.Value |> RandomAccessList.nth 3) = "ff") && ((e.Value |> RandomAccessList.nth 4) = "ee") && ((d.Value |> RandomAccessList.nth 5) = "dd") + && ((c.Value |> RandomAccessList.nth 6) = "cc") && ((b.Value |> RandomAccessList.nth 7) = "bb")&& ((a.Value |> RandomAccessList.nth 8) = "aa")) |> Expect.isTrue "RandomAccessList.tryUpdate" } + + test "RandomAccessList.tryUpdate RandomAccessList.length 10" { + let lena = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" |> RandomAccessList.cons "c" |> RandomAccessList.cons "d" |> RandomAccessList.cons "e" |> RandomAccessList.cons "f" |> RandomAccessList.cons "g" |> RandomAccessList.cons "h" |> RandomAccessList.cons "i" |> RandomAccessList.cons "j" + let j = lena |> RandomAccessList.tryUpdate 0 "jj" + let i = lena |> RandomAccessList.tryUpdate 1 "ii" + let h = lena |> RandomAccessList.tryUpdate 2 "hh" + let g = lena |> RandomAccessList.tryUpdate 3 "gg" + let f = lena |> RandomAccessList.tryUpdate 4 "ff" + let e = lena |> RandomAccessList.tryUpdate 5 "ee" + let d = lena |> RandomAccessList.tryUpdate 6 "dd" + let c = lena |> RandomAccessList.tryUpdate 7 "cc" + let b = lena |> RandomAccessList.tryUpdate 8 "bb" + let a = lena |> RandomAccessList.tryUpdate 9 "aa" + (((j.Value |> RandomAccessList.nth 0) = "jj") && ((i.Value |> RandomAccessList.nth 1) = "ii") && ((h.Value |> RandomAccessList.nth 2) = "hh") + && ((g.Value |> RandomAccessList.nth 3) = "gg") && ((f.Value |> RandomAccessList.nth 4) = "ff") && ((e.Value |> RandomAccessList.nth 5) = "ee") + && ((d.Value |> RandomAccessList.nth 6) = "dd") && ((c.Value |> RandomAccessList.nth 7) = "cc") && ((b.Value |> RandomAccessList.nth 8) = "bb") + && ((a.Value |> RandomAccessList.nth 9) = "aa")) |> Expect.isTrue "RandomAccessList.tryUpdate" } + + test "tryRandomAccessList.update of long RAL" { + let v = RandomAccessList.ofSeq [1..100] + Expect.equal "RandomAccessList.tryUpdate" 5 (v |> RandomAccessList.update 99 5 |> RandomAccessList.nth 99) } + + test "RandomAccessList.length of RandomAccessList.empty is 0" { + Expect.equal "" 0 (RandomAccessList.empty |> RandomAccessList.length) } + + test "RandomAccessList.length of 1 - 10 good" { + let len1 = RandomAccessList.empty |> RandomAccessList.cons "a" + let len2 = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" + let len3 = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" |> RandomAccessList.cons "c" + let len4 = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" |> RandomAccessList.cons "c" |> RandomAccessList.cons "d" + let len5 = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" |> RandomAccessList.cons "c" |> RandomAccessList.cons "d" |> RandomAccessList.cons "e" + let len6 = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" |> RandomAccessList.cons "c" |> RandomAccessList.cons "d" |> RandomAccessList.cons "e" |> RandomAccessList.cons "f" + let len7 = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" |> RandomAccessList.cons "c" |> RandomAccessList.cons "d" |> RandomAccessList.cons "e" |> RandomAccessList.cons "f" |> RandomAccessList.cons "g" + let len8 = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" |> RandomAccessList.cons "c" |> RandomAccessList.cons "d" |> RandomAccessList.cons "e" |> RandomAccessList.cons "f" |> RandomAccessList.cons "g" |> RandomAccessList.cons "h" + let len9 = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" |> RandomAccessList.cons "c" |> RandomAccessList.cons "d" |> RandomAccessList.cons "e" |> RandomAccessList.cons "f" |> RandomAccessList.cons "g" |> RandomAccessList.cons "h" |> RandomAccessList.cons "i" + let lena = RandomAccessList.empty |> RandomAccessList.cons "a" |> RandomAccessList.cons "b" |> RandomAccessList.cons "c" |> RandomAccessList.cons "d" |> RandomAccessList.cons "e" |> RandomAccessList.cons "f" |> RandomAccessList.cons "g" |> RandomAccessList.cons "h" |> RandomAccessList.cons "i" |> RandomAccessList.cons "j" + (((RandomAccessList.length len1) = 1) && ((RandomAccessList.length len2) = 2) && ((RandomAccessList.length len3) = 3) && ((RandomAccessList.length len4) = 4) + && ((RandomAccessList.length len5) = 5) && ((RandomAccessList.length len6) = 6) && ((RandomAccessList.length len7) = 7) && ((RandomAccessList.length len8) = 8) + && ((RandomAccessList.length len9) = 9) && ((RandomAccessList.length lena) = 10)) |> Expect.isTrue "RandomAccessList.length" } + + test "allow map" { + let x = RandomAccessList.ofSeq [1..300] + let randomAccessList2 = RandomAccessList.map (fun x -> x * 2) x + Expect.equal "map" [for i in 1..300 -> i * 2] (randomAccessList2 |> Seq.toList) } + + test "RandomAccessList.cons pattern discriminator - randomAccessList" { + let q = RandomAccessList.ofSeq ["f";"e";"d";"c";"b";"a"] -[] -let ``rev elements length 5``() = - let a = ofSeq ["a";"b";"c";"d";"e"] - - let b = rev a - - let c = List.ofSeq b - a.Head |> should equal "a" - b.Head |> should equal "e" - c.Head |> should equal "e" - b |> List.ofSeq |> should equal (["a";"b";"c";"d";"e"] |> List.rev) - -[] -let ``rev elements length 15``() = - let a = ofSeq ["a";"b";"c";"d";"e"; "f"; "g"; "h"; "i"; "j"; "l"; "m"; "n"; "o"; "p"] - let b = rev a - b |> List.ofSeq |> should equal (["a";"b";"c";"d";"e"; "f"; "g"; "h"; "i"; "j"; "l"; "m"; "n"; "o"; "p"] |> List.rev) - -[] -let ``rev 300``() = - let x = ofSeq [1..300] - x.Rev() |> List.ofSeq |> should equal (List.rev [1..300]) - -[] -let ``rev matches build list rev``() = - - fsCheck "RandomAccessList" (Prop.forAll (Arb.fromGen RandomAccessListIntGen) - (fun ((q :RandomAccessList), (l : int list)) -> q |> rev |> List.ofSeq = (List.rev l) )) + let h1, t1 = + match q with + | RandomAccessList.Cons(h, t) -> h, t + | _ -> "x", q + + Expect.isTrue "RandomAccessList.cons pattern discriminato" ((h1 = "f") && (t1.Length = 5)) } + + test "structural equality" { + let l1 = RandomAccessList.ofSeq [1..100] + let l2 = RandomAccessList.ofSeq [1..100] + + Expect.isTrue "structural equality" (l1 = l2) + + let l3 = l2 |> RandomAccessList.update 98 7 + + Expect.isFalse "structural equality" (l1 = l3) } + + test "RandomAccessList.ofSeq random access list" { + let x = RandomAccessList.ofSeq ["a";"b";"c";"d";"e";"f";"g";"h";"i";"j"] + + (((x |> RandomAccessList.nth 0) = "a") && ((x |> RandomAccessList.nth 1) = "b") && ((x |> RandomAccessList.nth 2) = "c") && ((x |> RandomAccessList.nth 3) = "d") + && ((x |> RandomAccessList.nth 4) = "e") && ((x |> RandomAccessList.nth 5) = "f") && ((x |> RandomAccessList.nth 6) = "g") && ((x |> RandomAccessList.nth 7) = "h") + && ((x |> RandomAccessList.nth 8) = "i") && ((x |> RandomAccessList.nth 9) = "j")) |> Expect.isTrue "RandomAccessList.ofSeq" } + + test "allow init" { + let randomAccessList = RandomAccessList.init 5 (fun x -> x * 2) + let s = Seq.init 5 (fun x -> x * 2) + + s |> Seq.toList |> Expect.equal "" [0;2;4;6;8] + Expect.equal "init" [0;2;4;6;8] (randomAccessList |> Seq.toList) } + + test "RandomAccessList.toSeq to list" { + let l = ["f";"e";"d";"c";"b";"a"] + let rl = RandomAccessList.ofSeq l + + Expect.equal "RandomAccessList.toSeq" l (rl |> RandomAccessList.toSeq |> List.ofSeq) } + + test "enumerate RandomAccessList.empty" { + for i in RandomAccessList.empty do + ignore() + + Expect.isTrue "enumerate RandomAccessList.empty" true } + ] + + [] + let propertyTestRandomAccessList = + let consThruList l q = + let rec loop (q' : 'a RandomAccessList) (l' : 'a list) = + match l' with + | hd :: [] -> q'.Cons hd + | hd :: tl -> loop (q'.Cons hd) tl + | [] -> q' + + loop q l + + //RandomAccessList + (* + non-IRandomAccessList generators from random ofList + *) + let RandomAccessListOfListGen = + gen { let! n = Gen.length2thru100 + let! x = Gen.listInt n + return ( (RandomAccessList.ofSeq x), x) } + + (* + IRandomAccessList generators from random RandomAccessList.ofSeq and/or conj elements from random list + *) + let RandomAccessListIntGen = + gen { let! n = Gen.length1thru100 + let! n2 = Gen.length2thru100 + let! x = Gen.listInt n + let! y = Gen.listInt n2 + return ( (RandomAccessList.ofSeq x |> consThruList y), ((List.rev y) @ x) ) } + + let RandomAccessListIntOfSeqGen = + gen { let! n = Gen.length1thru100 + let! x = Gen.listInt n + return ( (RandomAccessList.ofSeq x), x) } + + let RandomAccessListIntConsGen = + gen { let! n = Gen.length1thru100 + let! x = Gen.listInt n + return ( (RandomAccessList.empty |> consThruList x), List.rev x) } + + let RandomAccessListObjGen = + gen { let! n = Gen.length2thru100 + let! n2 = Gen.length1thru100 + let! x = Gen.listObj n + let! y = Gen.listObj n2 + return ( (RandomAccessList.ofSeq x |> consThruList y), ((List.rev y) @ x) ) } + + let RandomAccessListStringGen = + gen { let! n = Gen.length1thru100 + let! n2 = Gen.length2thru100 + let! x = Gen.listString n + let! y = Gen.listString n2 + return ( (RandomAccessList.ofSeq x |> consThruList y), ((List.rev y) @ x) ) } + + let intGens start = + let v = Array.create 3 RandomAccessListIntGen + v.[1] <- RandomAccessListIntOfSeqGen |> Gen.filter (fun (q, l) -> l.Length >= start) + v.[2] <- RandomAccessListIntConsGen |> Gen.filter (fun (q, l) -> l.Length >= start) + v + + let intGensStart1 = + intGens 1 //this will accept all + + let intGensStart2 = + intGens 2 // this will accept 11 out of 12 + + testList "RandomAccessList property tests" [ + testPropertyWithConfig config10k "RandomAccessList.fold matches build list rev" (Prop.forAll (Arb.fromGen RandomAccessListIntGen) <| + fun (q, l) -> q |> RandomAccessList.fold (fun l' elem -> elem::l') [] = (List.rev l) ) - fsCheck "RandomAccessList OfSeq" (Prop.forAll (Arb.fromGen RandomAccessListIntOfSeqGen) - (fun ((q :RandomAccessList), (l : int list)) -> q |> rev |> List.ofSeq = (List.rev l) )) - - fsCheck "RandomAccessList Cons" (Prop.forAll (Arb.fromGen RandomAccessListIntConsGen) - (fun ((q :RandomAccessList), (l : int list)) -> q |> rev |> List.ofSeq = (List.rev l) )) - - - -[] -let ``nth length 2``() = - (((empty |> cons "a" |> cons "b" |> nth 0) = "b") && ((empty |> cons "a" |> cons "b" |> nth 1) = "a")) |> should equal true - -[] -let ``nth length 3``() = - let len3 = empty |> cons "a" |> cons "b" |> cons "c" - (((len3 |> nth 0) = "c") - && ((len3 |> nth 1) = "b") - && ((len3 |> nth 2) = "a")) |> should equal true - -[] -let ``nth length 4``() = - let len4 = empty |> cons "a" |> cons "b" |> cons "c" |> cons "d" - (((len4 |> nth 0) = "d") && ((len4 |> nth 1) = "c") && ((len4 |> nth 2) = "b") && ((len4 |> nth 3) = "a")) - |> should equal true - -[] -let ``nth length 5``() = - let len5 = empty |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" - (((len5 |> nth 0) = "e") && ((len5 |> nth 1) = "d") && ((len5 |> nth 2) = "c") && ((len5 |> nth 3) = "b") - && ((len5 |> nth 4) = "a")) |> should equal true - -[] -let ``nth length 6``() = - let len6 = empty |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" - (((len6 |> nth 0) = "f") && ((len6 |> nth 1) = "e") && ((len6 |> nth 2) = "d") && ((len6 |> nth 3) = "c") - && ((len6 |> nth 4) = "b") && ((len6 |> nth 5) = "a")) |> should equal true - -[] -let ``nth length 7``() = - let len7 = empty |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" - (((len7 |> nth 0) = "g") && ((len7 |> nth 1) = "f") && ((len7 |> nth 2) = "e") && ((len7 |> nth 3) = "d") - && ((len7 |> nth 4) = "c") && ((len7 |> nth 5) = "b") && ((len7 |> nth 6) = "a")) |> should equal true - -[] -let ``nth length 8``() = - let len8 = empty |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" - (((len8 |> nth 0) = "h") && ((len8 |> nth 1) = "g") && ((len8 |> nth 2) = "f") && ((len8 |> nth 3) = "e") - && ((len8 |> nth 4) = "d") && ((len8 |> nth 5) = "c") && ((len8 |> nth 6) = "b") && ((len8 |> nth 7) = "a")) - |> should equal true - -[] -let ``nth length 9``() = - let len9 = empty |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" |> cons "i" - (((len9 |> nth 0) = "i") && ((len9 |> nth 1) = "h") && ((len9 |> nth 2) = "g") && ((len9 |> nth 3) = "f") - && ((len9 |> nth 4) = "e") && ((len9 |> nth 5) = "d") && ((len9 |> nth 6) = "c") && ((len9 |> nth 7) = "b") - && ((len9 |> nth 8) = "a")) |> should equal true - -[] -let ``nth length 10``() = - let lena = empty |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" |> cons "i" |> cons "j" - (((lena |> nth 0) = "j") && ((lena |> nth 1) = "i") && ((lena |> nth 2) = "h") && ((lena |> nth 3) = "g") - && ((lena |> nth 4) = "f") && ((lena |> nth 5) = "e") && ((lena |> nth 6) = "d") && ((lena |> nth 7) = "c") - && ((lena |> nth 8) = "b") && ((lena |> nth 9) = "a")) |> should equal true - -[] -let ``tryNth length 1``() = - let a = empty |> cons "a" |> tryNth 0 - (a.Value = "a") |> should equal true - -[] -let ``tryNth length 2``() = - let len2 = empty |> cons "a" |> cons "b" - let b = len2 |> tryNth 0 - let a = len2 |> tryNth 1 - ((b.Value = "b") && (a.Value = "a")) |> should equal true - -[] -let ``tryNth length 3``() = - let len3 = empty |> cons "a" |> cons "b" |> cons "c" - let c = len3 |> tryNth 0 - let b = len3 |> tryNth 1 - let a = len3 |> tryNth 2 - ((c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> should equal true - -[] -let ``tryNth length 4``() = - let len4 = empty |> cons "a" |> cons "b" |> cons "c" |> cons "d" - let d = len4 |> tryNth 0 - let c = len4 |> tryNth 1 - let b = len4 |> tryNth 2 - let a = len4 |> tryNth 3 - ((d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> should equal true - -[] -let ``tryNth length 5``() = - let len5 = empty |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" - let e = len5 |> tryNth 0 - let d = len5 |> tryNth 1 - let c = len5 |> tryNth 2 - let b = len5 |> tryNth 3 - let a = len5 |> tryNth 4 - ((e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) |> should equal true - -[] -let ``tryNth length 6``() = - let len6 = empty |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" - let f = len6 |> tryNth 0 - let e = len6 |> tryNth 1 - let d = len6 |> tryNth 2 - let c = len6 |> tryNth 3 - let b = len6 |> tryNth 4 - let a = len6 |> tryNth 5 - ((f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") && (a.Value = "a")) - |> should equal true - -[] -let ``tryNth length 7``() = - let len7 = empty |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" - let g = len7 |> tryNth 0 - let f = len7 |> tryNth 1 - let e = len7 |> tryNth 2 - let d = len7 |> tryNth 3 - let c = len7 |> tryNth 4 - let b = len7 |> tryNth 5 - let a = len7 |> tryNth 6 - ((g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") && (b.Value = "b") - && (a.Value = "a")) |> should equal true - -[] -let ``tryNth length 8``() = - let len8 = empty |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" - let h = len8 |> tryNth 0 - let g = len8 |> tryNth 1 - let f = len8 |> tryNth 2 - let e = len8 |> tryNth 3 - let d = len8 |> tryNth 4 - let c = len8 |> tryNth 5 - let b = len8 |> tryNth 6 - let a = len8 |> tryNth 7 - ((h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") && (c.Value = "c") - && (b.Value = "b")&& (a.Value = "a")) |> should equal true - -[] -let ``tryNth length 9``() = - let len9 = empty |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" |> cons "i" - let i = len9 |> tryNth 0 - let h = len9 |> tryNth 1 - let g = len9 |> tryNth 2 - let f = len9 |> tryNth 3 - let e = len9 |> tryNth 4 - let d = len9 |> tryNth 5 - let c = len9 |> tryNth 6 - let b = len9 |> tryNth 7 - let a = len9 |> tryNth 8 - ((i.Value = "i") && (h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") && (d.Value = "d") - && (c.Value = "c") && (b.Value = "b")&& (a.Value = "a")) |> should equal true - -[] -let ``tryNth length 10``() = - let lena = empty |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" |> cons "i" |> cons "j" - let j = lena |> tryNth 0 - let i = lena |> tryNth 1 - let h = lena |> tryNth 2 - let g = lena |> tryNth 3 - let f = lena |> tryNth 4 - let e = lena |> tryNth 5 - let d = lena |> tryNth 6 - let c = lena |> tryNth 7 - let b = lena |> tryNth 8 - let a = lena |> tryNth 9 - ((j.Value = "j") && (i.Value = "i") && (h.Value = "h") && (g.Value = "g") && (f.Value = "f") && (e.Value = "e") - && (d.Value = "d") && (c.Value = "c") && (b.Value = "b")&& (a.Value = "a")) |> should equal true - -[] -let ``tryNth not found``() = - let lena = empty |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" |> cons "i" |> cons "j" - lena |> tryNth 10 |> should equal None - -[] -let ``list of lists can be accessed with nthNth``() = - let inner = [1; 2; 3; 4; 5] |> ofSeq - let outer = empty |> cons inner |> cons inner - - outer |> nthNth 0 2 |> should equal 3 - outer |> nthNth 1 4 |> should equal 5 - -[] -let ``nthNth throws exception for out-of-bounds indices``() = - let inner = [1; 2; 3; 4; 5] |> ofSeq - let outer = empty |> cons inner |> cons inner - - (fun () -> nthNth 2 2 outer |> ignore) |> should throw typeof - (fun () -> nthNth 1 5 outer |> ignore) |> should throw typeof - (fun () -> nthNth -1 2 outer |> ignore) |> should throw typeof - (fun () -> nthNth 1 -2 outer |> ignore) |> should throw typeof - -[] -let ``list of lists can be accessed with tryNthNth``() = - let inner = [1; 2; 3; 4; 5] |> ofSeq - let outer = empty |> cons inner |> cons inner - - outer |> tryNthNth 0 2 |> should equal (Some 3) - outer |> tryNthNth 1 4 |> should equal (Some 5) - -[] -let ``tryNthNth returns None for out-of-bounds indices``() = - let inner = [1; 2; 3; 4; 5] |> ofSeq - let outer = empty |> cons inner |> cons inner - - outer |> tryNthNth 2 2 |> should equal None - outer |> tryNthNth 1 5 |> should equal None - outer |> tryNthNth -1 2 |> should equal None - outer |> tryNthNth 1 -2 |> should equal None - -[] -let ``list of lists can be updated with updateNth``() = - let inner = [1; 2; 3; 4; 5] |> ofSeq - let outer = empty |> cons inner |> cons inner - - outer |> updateNth 0 2 7 |> nthNth 0 2 |> should equal 7 - outer |> updateNth 1 4 9 |> nthNth 1 4 |> should equal 9 - -[] -let ``updateNth should not change the original list``() = - let inner = [1; 2; 3; 4; 5] |> ofSeq - let outer = ref empty - outer := cons inner (!outer) - outer := cons inner (!outer) - - !outer |> updateNth 0 2 7 |> nthNth 0 2 |> should equal 7 - !outer |> nthNth 0 2 |> should equal 3 - !outer |> updateNth 1 4 9 |> nthNth 1 4 |> should equal 9 - !outer |> nthNth 1 4 |> should equal 5 - -[] -let ``updateNth throws exception for out-of-bounds indices``() = - let inner = [1; 2; 3; 4; 5] |> ofSeq - let outer = empty |> cons inner |> cons inner - - (fun () -> updateNth 0 6 7 outer |> ignore) |> should throw typeof - (fun () -> updateNth 9 2 7 outer |> ignore) |> should throw typeof - (fun () -> updateNth 1 -4 7 outer |> ignore) |> should throw typeof - (fun () -> updateNth -1 4 7 outer |> ignore) |> should throw typeof - -[] -let ``tryUpdateNth returns None for out-of-bounds indices``() = - let inner = [1; 2; 3; 4; 5] |> ofSeq - let outer = empty |> cons inner |> cons inner - - tryUpdateNth 0 6 7 outer |> should equal None - tryUpdateNth 9 2 7 outer |> should equal None - tryUpdateNth 1 -4 7 outer |> should equal None - tryUpdateNth -1 4 7 outer |> should equal None - -[] -let ``tryUpdateNth is like updateNth but returns option``() = - let inner = [1; 2; 3; 4; 5] |> ofSeq - let outer = empty |> cons inner |> cons inner - - let result = outer |> tryUpdateNth 0 2 7 - result |> Option.isSome |> should be True - result |> Option.get |> nthNth 0 2 |> should equal 7 - - let result2 = outer |> tryUpdateNth 1 4 9 - result2 |> Option.isSome |> should be True - result2 |> Option.get |> nthNth 1 4 |> should equal 9 - -[] -let ``tryUpdateNth should not change the original list``() = - let inner = [1; 2; 3; 4; 5] |> ofSeq - let outer = ref empty - outer := cons inner (!outer) - outer := cons inner (!outer) - - !outer |> tryUpdateNth 0 2 7 |> Option.get |> nthNth 0 2 |> should equal 7 - !outer |> nthNth 0 2 |> should equal 3 - !outer |> tryUpdateNth 1 4 9 |> Option.get |> nthNth 1 4 |> should equal 9 - !outer |> nthNth 1 4 |> should equal 5 - -[] -let ``update length 1``() = - empty |> cons "a" |> update 0 "aa"|> nth 0 |> should equal "aa" - -[] -let ``update length 2``() = - let len2 = empty |> cons "a" |> cons "b" - (((len2 |> update 0 "bb"|> nth 0) = "bb") && ((len2 |> update 1 "aa"|> nth 1) = "aa")) |> should equal true - -[] -let ``update length 3``() = - let len3 = empty |> cons "a" |> cons "b" |> cons "c" - (((len3 |> update 0 "cc"|> nth 0) = "cc") && ((len3 |> update 1 "bb"|> nth 1) = "bb") - && ((len3 |> update 2 "aa"|> nth 2) = "aa")) |> should equal true - -[] -let ``update length 4``() = - let len4 = empty |> cons "a" |> cons "b" |> cons "c" |> cons "d" - (((len4 |> update 0 "dd"|> nth 0) = "dd") && ((len4 |> update 1 "cc"|> nth 1) = "cc") - && ((len4 |> update 2 "bb"|> nth 2) = "bb") && ((len4 |> update 3 "aa"|> nth 3) = "aa")) - |> should equal true - -[] -let ``update length 5``() = - let len5 = empty |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" - (((len5 |> update 0 "ee"|> nth 0) = "ee") && ((len5 |> update 1 "dd"|> nth 1) = "dd") - && ((len5 |> update 2 "cc"|> nth 2) = "cc") && ((len5 |> update 3 "bb"|> nth 3) = "bb") - && ((len5 |> update 4 "aa"|> nth 4) = "aa")) |> should equal true - -[] -let ``update length 6``() = - let len6 = empty |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" - (((len6 |> update 0 "ff"|> nth 0) = "ff") && ((len6 |> update 1 "ee"|> nth 1) = "ee") - && ((len6 |> update 2 "dd"|> nth 2) = "dd") && ((len6 |> update 3 "cc"|> nth 3) = "cc") - && ((len6 |> update 4 "bb"|> nth 4) = "bb") && ((len6 |> update 5 "aa"|> nth 5) = "aa")) |> should equal true - -[] -let ``update length 7``() = - let len7 = empty |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" - (((len7 |> update 0 "gg"|> nth 0) = "gg") && ((len7 |> update 1 "ff"|> nth 1) = "ff") - && ((len7 |> update 2 "ee"|> nth 2) = "ee") && ((len7 |> update 3 "dd"|> nth 3) = "dd") - && ((len7 |> update 4 "cc"|> nth 4) = "cc") && ((len7 |> update 5 "bb"|> nth 5) = "bb") - && ((len7 |> update 6 "aa"|> nth 6) = "aa")) |> should equal true - -[] -let ``update length 8``() = - let len8 = empty |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" - (((len8 |> update 0 "hh"|> nth 0) = "hh") && ((len8 |> update 1 "gg"|> nth 1) = "gg") - && ((len8 |> update 2 "ff"|> nth 2) = "ff") && ((len8 |> update 3 "ee"|> nth 3) = "ee") - && ((len8 |> update 4 "dd"|> nth 4) = "dd") && ((len8 |> update 5 "cc"|> nth 5) = "cc") - && ((len8 |> update 6 "bb"|> nth 6) = "bb") && ((len8 |> update 7 "aa"|> nth 7) = "aa")) - |> should equal true - -[] -let ``update length 9``() = - let len9 = empty |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" |> cons "i" - (((len9 |> update 0 "ii"|> nth 0) = "ii") && ((len9 |> update 1 "hh"|> nth 1) = "hh") - && ((len9 |> update 2 "gg"|> nth 2) = "gg") && ((len9 |> update 3 "ff"|> nth 3) = "ff") - && ((len9 |> update 4 "ee"|> nth 4) = "ee") && ((len9 |> update 5 "dd"|> nth 5) = "dd") - && ((len9 |> update 6 "cc"|> nth 6) = "cc") && ((len9 |> update 7 "bb"|> nth 7) = "bb") - && ((len9 |> update 8 "aa"|> nth 8) = "aa")) |> should equal true - -[] -let ``update length 10``() = - let lena = empty |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" |> cons "i" |> cons "j" - (((lena |> update 0 "jj"|> nth 0) = "jj") && ((lena |> update 1 "ii"|> nth 1) = "ii") - && ((lena |> update 2 "hh"|> nth 2) = "hh") && ((lena |> update 3 "gg"|> nth 3) = "gg") - && ((lena |> update 4 "ff"|> nth 4) = "ff") && ((lena |> update 5 "ee"|> nth 5) = "ee") - && ((lena |> update 6 "dd"|> nth 6) = "dd") && ((lena |> update 7 "cc"|> nth 7) = "cc") - && ((lena |> update 8 "bb"|> nth 8) = "bb") && ((lena |> update 9 "aa"|> nth 9) = "aa")) |> should equal true - -[] -let ``tryUpdate length 1``() = - let a = empty |> cons "a" |> tryUpdate 0 "aa" - ((a.Value |> nth 0) = "aa") |> should equal true - -[] -let ``tryUpdate length 2``() = - let len2 = empty |> cons "a" |> cons "b" - let b = len2 |> tryUpdate 0 "bb" - let a = len2 |> tryUpdate 1 "aa" - (((b.Value |> nth 0) = "bb") && ((a.Value |> nth 1) = "aa")) |> should equal true - -[] -let ``tryUpdate length 3``() = - let len3 = empty |> cons "a" |> cons "b" |> cons "c" - let c = len3 |> tryUpdate 0 "cc" - let b = len3 |> tryUpdate 1 "bb" - let a = len3 |> tryUpdate 2 "aa" - (((c.Value |> nth 0) = "cc") && ((b.Value |> nth 1) = "bb") && ((a.Value |> nth 2) = "aa")) |> should equal true - -[] -let ``tryUpdate length 4``() = - let len4 = empty |> cons "a" |> cons "b" |> cons "c" |> cons "d" - let d = len4 |> tryUpdate 0 "dd" - let c = len4 |> tryUpdate 1 "cc" - let b = len4 |> tryUpdate 2 "bb" - let a = len4 |> tryUpdate 3 "aa" - (((d.Value |> nth 0) = "dd") && ((c.Value |> nth 1) = "cc") && ((b.Value |> nth 2) = "bb") - && ((a.Value |> nth 3) = "aa")) |> should equal true - -[] -let ``tryUpdate length 5``() = - let len5 = empty |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" - let e = len5 |> tryUpdate 0 "ee" - let d = len5 |> tryUpdate 1 "dd" - let c = len5 |> tryUpdate 2 "cc" - let b = len5 |> tryUpdate 3 "bb" - let a = len5 |> tryUpdate 4 "aa" - (((e.Value |> nth 0) = "ee") && ((d.Value |> nth 1) = "dd") && ((c.Value |> nth 2) = "cc") - && ((b.Value |> nth 3) = "bb") && ((a.Value |> nth 4) = "aa")) |> should equal true - -[] -let ``tryUpdate length 6``() = - let len6 = empty |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" - let f = len6 |> tryUpdate 0 "ff" - let e = len6 |> tryUpdate 1 "ee" - let d = len6 |> tryUpdate 2 "dd" - let c = len6 |> tryUpdate 3 "cc" - let b = len6 |> tryUpdate 4 "bb" - let a = len6 |> tryUpdate 5 "aa" - (((f.Value |> nth 0) = "ff") && ((e.Value |> nth 1) = "ee") && ((d.Value |> nth 2) = "dd") - && ((c.Value |> nth 3) = "cc") && ((b.Value |> nth 4) = "bb") && ((a.Value |> nth 5) = "aa")) - |> should equal true - -[] -let ``tryUpdate length 7``() = - let len7 = empty |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" - let g = len7 |> tryUpdate 0 "gg" - let f = len7 |> tryUpdate 1 "ff" - let e = len7 |> tryUpdate 2 "ee" - let d = len7 |> tryUpdate 3 "dd" - let c = len7 |> tryUpdate 4 "cc" - let b = len7 |> tryUpdate 5 "bb" - let a = len7 |> tryUpdate 6 "aa" - (((g.Value |> nth 0) = "gg") && ((f.Value |> nth 1) = "ff") && ((e.Value |> nth 2) = "ee") - && ((d.Value |> nth 3) = "dd") && ((c.Value |> nth 4) = "cc") && ((b.Value |> nth 5) = "bb") - && ((a.Value |> nth 6) = "aa")) |> should equal true - -[] -let ``tryUpdate length 8``() = - let len8 = empty |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" - let h = len8 |> tryUpdate 0 "hh" - let g = len8 |> tryUpdate 1 "gg" - let f = len8 |> tryUpdate 2 "ff" - let e = len8 |> tryUpdate 3 "ee" - let d = len8 |> tryUpdate 4 "dd" - let c = len8 |> tryUpdate 5 "cc" - let b = len8 |> tryUpdate 6 "bb" - let a = len8 |> tryUpdate 7 "aa" - (((h.Value |> nth 0) = "hh") && ((g.Value |> nth 1) = "gg") && ((f.Value |> nth 2) = "ff") - && ((e.Value |> nth 3) = "ee") && ((d.Value |> nth 4) = "dd") && ((c.Value |> nth 5) = "cc") - && ((b.Value |> nth 6) = "bb")&& ((a.Value |> nth 7) = "aa")) |> should equal true - -[] -let ``tryUpdate length 9``() = - let len9 = empty |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" |> cons "i" - let i = len9 |> tryUpdate 0 "ii" - let h = len9 |> tryUpdate 1 "hh" - let g = len9 |> tryUpdate 2 "gg" - let f = len9 |> tryUpdate 3 "ff" - let e = len9 |> tryUpdate 4 "ee" - let d = len9 |> tryUpdate 5 "dd" - let c = len9 |> tryUpdate 6 "cc" - let b = len9 |> tryUpdate 7 "bb" - let a = len9 |> tryUpdate 8 "aa" - (((i.Value |> nth 0) = "ii") && ((h.Value |> nth 1) = "hh") && ((g.Value |> nth 2) = "gg") - && ((f.Value |> nth 3) = "ff") && ((e.Value |> nth 4) = "ee") && ((d.Value |> nth 5) = "dd") - && ((c.Value |> nth 6) = "cc") && ((b.Value |> nth 7) = "bb")&& ((a.Value |> nth 8) = "aa")) |> should equal true - -[] -let ``tryUpdate length 10``() = - let lena = empty |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" |> cons "i" |> cons "j" - let j = lena |> tryUpdate 0 "jj" - let i = lena |> tryUpdate 1 "ii" - let h = lena |> tryUpdate 2 "hh" - let g = lena |> tryUpdate 3 "gg" - let f = lena |> tryUpdate 4 "ff" - let e = lena |> tryUpdate 5 "ee" - let d = lena |> tryUpdate 6 "dd" - let c = lena |> tryUpdate 7 "cc" - let b = lena |> tryUpdate 8 "bb" - let a = lena |> tryUpdate 9 "aa" - (((j.Value |> nth 0) = "jj") && ((i.Value |> nth 1) = "ii") && ((h.Value |> nth 2) = "hh") - && ((g.Value |> nth 3) = "gg") && ((f.Value |> nth 4) = "ff") && ((e.Value |> nth 5) = "ee") - && ((d.Value |> nth 6) = "dd") && ((c.Value |> nth 7) = "cc") && ((b.Value |> nth 8) = "bb") - && ((a.Value |> nth 9) = "aa")) |> should equal true - - -[] -let ``tryupdate of long RAL``() = - let v = ofSeq [1..100] - - v |> update 99 5 |> nth 99 |> should equal 5 - -[] -let ``length of empty is 0``() = - empty |> length |> should equal 0 - -[] -let ``length of 1 - 10 good``() = - let len1 = empty |> cons "a" - let len2 = empty |> cons "a" |> cons "b" - let len3 = empty |> cons "a" |> cons "b" |> cons "c" - let len4 = empty |> cons "a" |> cons "b" |> cons "c" |> cons "d" - let len5 = empty |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" - let len6 = empty |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" - let len7 = empty |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" - let len8 = empty |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" - let len9 = empty |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" |> cons "i" - let lena = empty |> cons "a" |> cons "b" |> cons "c" |> cons "d" |> cons "e" |> cons "f" |> cons "g" |> cons "h" |> cons "i" |> cons "j" - (((length len1) = 1) && ((length len2) = 2) && ((length len3) = 3) && ((length len4) = 4) - && ((length len5) = 5) && ((length len6) = 6) && ((length len7) = 7) && ((length len8) = 8) - && ((length len9) = 9) && ((length lena) = 10)) |> should equal true - -[] -let ``allow map``() = - let x = ofSeq [1..300] - let randomAccessList2 = map (fun x -> x * 2) x - randomAccessList2 |> Seq.toList |> should equal [for i in 1..300 -> i * 2] - -[] -let ``cons pattern discriminator - randomAccessList``() = - let q = ofSeq ["f";"e";"d";"c";"b";"a"] - - let h1, t1 = - match q with - | Cons(h, t) -> h, t - | _ -> "x", q + testPropertyWithConfig config10k "RandomAccessList OfSeq RandomAccessList.fold matches build list rev" (Prop.forAll (Arb.fromGen RandomAccessListIntOfSeqGen) <| + fun (q, l) -> q |> RandomAccessList.fold (fun l' elem -> elem::l') [] = (List.rev l) ) + + testPropertyWithConfig config10k "andomAccessList Consfold matches build list rev" (Prop.forAll (Arb.fromGen RandomAccessListIntConsGen) <| + fun (q, l) -> q |> RandomAccessList.fold (fun l' elem -> elem::l') [] = (List.rev l) ) + + testPropertyWithConfig config10k "RandomAccessList.foldBack matches build list" (Prop.forAll (Arb.fromGen RandomAccessListIntGen) <| + fun (q, l) -> RandomAccessList.foldBack (fun elem l' -> elem::l') q [] = l ) + + testPropertyWithConfig config10k "OfSeq RandomAccessList.foldBack matches build list" (Prop.forAll (Arb.fromGen RandomAccessListIntOfSeqGen) <| + fun (q, l) -> RandomAccessList.foldBack (fun elem l' -> elem::l') q [] = l ) - ((h1 = "f") && (t1.Length = 5)) |> should equal true + testPropertyWithConfig config10k "Conj RandomAccessList.foldBack matches build list" (Prop.forAll (Arb.fromGen RandomAccessListIntConsGen) <| + fun (q, l) -> RandomAccessList.foldBack (fun elem l' -> elem::l') q [] = l ) -[] -let ``structural equality``() = + testPropertyWithConfig config10k "get RandomAccessList.head from RandomAccessList 0" (Prop.forAll (Arb.fromGen intGensStart1.[0]) <| + fun (q, l) -> (RandomAccessList.head q) = (List.item 0 l) ) - let l1 = ofSeq [1..100] - let l2 = ofSeq [1..100] + testPropertyWithConfig config10k "get RandomAccessList.head from RandomAccessList 1" (Prop.forAll (Arb.fromGen intGensStart1.[1]) <| + fun (q, l) -> (RandomAccessList.head q) = (List.item 0 l) ) - l1 = l2 |> should equal true + testPropertyWithConfig config10k "get RandomAccessList.head from RandomAccessList 2" (Prop.forAll (Arb.fromGen intGensStart1.[2]) <| + fun (q, l) -> (RandomAccessList.head q) = (List.item 0 l) ) - let l3 = l2 |> update 98 7 + testPropertyWithConfig config10k "get RandomAccessList.head from RandomAccessList safely 0" (Prop.forAll (Arb.fromGen intGensStart1.[0]) <| + fun (q, l) -> (RandomAccessList.tryHead q).Value = (List.item 0 l) ) - l1 = l3 |> should equal false + testPropertyWithConfig config10k "get RandomAccessList.head from RandomAccessList safely 1" (Prop.forAll (Arb.fromGen intGensStart1.[1]) <| + fun (q, l) -> (RandomAccessList.tryHead q).Value = (List.item 0 l) ) -[] -let ``ofSeq random access list``() = - let x = ofSeq ["a";"b";"c";"d";"e";"f";"g";"h";"i";"j"] + testPropertyWithConfig config10k "get RandomAccessList.head from RandomAccessList safely 2" (Prop.forAll (Arb.fromGen intGensStart1.[2]) <| + fun (q, l) -> (RandomAccessList.tryHead q).Value = (List.item 0 l) ) - (((x |> nth 0) = "a") && ((x |> nth 1) = "b") && ((x |> nth 2) = "c") && ((x |> nth 3) = "d") - && ((x |> nth 4) = "e") && ((x |> nth 5) = "f") && ((x |> nth 6) = "g") && ((x |> nth 7) = "h") - && ((x |> nth 8) = "i") && ((x |> nth 9) = "j")) |> should equal true + testPropertyWithConfig config10k "get RandomAccessList.tail from RandomAccessList 0" (Prop.forAll (Arb.fromGen intGensStart2.[0]) <| + fun ((q), l) -> q.Tail.Head = (List.item 1 l) ) -[] -let ``allow init``() = - let randomAccessList = init 5 (fun x -> x * 2) - let s = Seq.init 5 (fun x -> x * 2) + testPropertyWithConfig config10k "get RandomAccessList.tail from RandomAccessList 1" (Prop.forAll (Arb.fromGen intGensStart2.[1]) <| + fun ((q), l) -> q.Tail.Head = (List.item 1 l) ) - s |> Seq.toList |> should equal [0;2;4;6;8] - randomAccessList |> Seq.toList |> should equal [0;2;4;6;8] + testPropertyWithConfig config10k "get RandomAccessList.tail from RandomAccessList 2" (Prop.forAll (Arb.fromGen intGensStart2.[2]) <| + fun ((q), l) -> q.Tail.Head = (List.item 1 l) ) -[] -let ``toSeq to list``() = - let l = ["f";"e";"d";"c";"b";"a"] - let rl = ofSeq l + testPropertyWithConfig config10k "get RandomAccessList.tail from RandomAccessList safely 0" (Prop.forAll (Arb.fromGen intGensStart2.[0]) <| + fun (q, l) -> q.TryTail.Value.Head = (List.item 1 l) ) - rl |> toSeq |> List.ofSeq |> should equal l + testPropertyWithConfig config10k "get RandomAccessList.tail from RandomAccessList safely 1" (Prop.forAll (Arb.fromGen intGensStart2.[1]) <| + fun (q, l) -> q.TryTail.Value.Head = (List.item 1 l) ) -[] -let ``enumerate empty``() = - for i in RandomAccessList.empty do - ignore() + testPropertyWithConfig config10k "get RandomAccessList.tail from RandomAccessList safely 2" (Prop.forAll (Arb.fromGen intGensStart2.[2]) <| + fun (q, l) -> q.TryTail.Value.Head = (List.item 1 l) ) + + testPropertyWithConfig config10k "int RandomAccessList builds and serializes 0" (Prop.forAll (Arb.fromGen intGensStart1.[0]) <| + fun (q, l) -> q |> Seq.toList = l ) + + testPropertyWithConfig config10k "int RandomAccessList builds and serializes 1" (Prop.forAll (Arb.fromGen intGensStart1.[1]) <| + fun (q, l) -> q |> Seq.toList = l ) + + testPropertyWithConfig config10k "int RandomAccessList builds and serializes 2" (Prop.forAll (Arb.fromGen intGensStart1.[2]) <| + fun (q, l) -> q |> Seq.toList = l ) + + testPropertyWithConfig config10k "obj RandomAccessList builds and serializes" (Prop.forAll (Arb.fromGen RandomAccessListObjGen) <| + fun (q, l) -> q |> Seq.toList = l ) + + testPropertyWithConfig config10k "string RandomAccessList builds and serializes" (Prop.forAll (Arb.fromGen RandomAccessListStringGen) <| + fun (q, l) -> q |> Seq.toList = l ) + + testPropertyWithConfig config10k "rev matches build list rev" (Prop.forAll (Arb.fromGen RandomAccessListIntGen) <| + fun (q, l) -> q |> RandomAccessList.rev |> List.ofSeq = (List.rev l) ) + + testPropertyWithConfig config10k "OfSeq rev matches build list rev" (Prop.forAll (Arb.fromGen RandomAccessListIntOfSeqGen) <| + fun (q, l) -> q |> RandomAccessList.rev |> List.ofSeq = (List.rev l) ) - true |> should equal true + testPropertyWithConfig config10k "Cons rev matches build list rev" (Prop.forAll (Arb.fromGen RandomAccessListIntConsGen) <| + fun (q, l) -> q |> RandomAccessList.rev |> List.ofSeq = (List.rev l) ) + ] \ No newline at end of file diff --git a/tests/FSharpx.Collections.Tests/ResizeArrayTests.fs b/tests/FSharpx.Collections.Tests/ResizeArrayTests.fs new file mode 100644 index 00000000..728aa9d4 --- /dev/null +++ b/tests/FSharpx.Collections.Tests/ResizeArrayTests.fs @@ -0,0 +1,218 @@ +namespace FSharpx.Collections.Tests + +open Microsoft.FSharp.Collections +open Expecto +open Expecto.Flip + +module ResizeArrayTests = + open System.Collections.Generic + + let rng = System.Random() + let ra = ResizeArray.ofList + let (=?) a b = ResizeArray.toList a = b + + [] + let testResizeArray = + testList "ResizeArray" [ + test "ra_exists2_a" { + Expect.isTrue "exists2" <| ResizeArray.exists2 (=) + (ra [1; 2; 3; 4; 5; 6]) + (ra [2; 3; 4; 5; 6; 6]) } + + test "exists2_b" { + Expect.isFalse "exists2" <| ResizeArray.exists2 (=) + (ra [1; 2; 3; 4; 5; 6]) + (ra [2; 3; 4; 5; 6; 7]) } + + test "ra_findIndex_a" { + Expect.equal "findIndex" 4 <| ResizeArray.findIndex (fun i -> i >= 4) (ra [0..10]) } + + test "ra_findIndex_b" { + Expect.throwsT "findIndex" (fun () -> ResizeArray.findIndex (fun i -> i >= 20) (ra [0..10]) |> ignore) } + + test "ra_find_indexi_a" { + Expect.equal "findIndexi" 3 <| ResizeArray.findIndexi (=) (ra [1; 2; 3; 3; 2; 1]) } + + test "ra_find_indexi_b" { + Expect.throwsT "findIndexi" (fun () -> ResizeArray.findIndexi (=) (ra [1..10]) |> ignore) } + + test "ra_forall2_a" { + Expect.isTrue "forall2" <| ResizeArray.forall2 (=) (ra [1..10]) (ra [1..10]) } + + test "ra_forall2_b" { + Expect.isFalse "forall2" <| ResizeArray.forall2 (=) (ra [1;2;3;4;5]) (ra [1;2;3;0;5]) } + + test "ra_isEmpty_a" { + Expect.isTrue "isEmpty" <| ResizeArray.isEmpty (ra []) } + + test "ra_isEmpty_b" { + Expect.isFalse "isEmpty" <| ResizeArray.isEmpty (ra [1; 2]) } + + test "ra_mapi2" { + Expect.isTrue "mapi2" (ResizeArray.mapi2 (fun i j k -> i+j+k) (ra [1..10]) (ra [1..10]) =? [2..+3..29]) } + + test "ra_mapi2_b" { + Expect.throwsT "mapi2" (fun () -> ResizeArray.mapi2 (fun i j k -> i+j+k) (ra []) (ra [1..10]) |> ignore) } + + + test "ra_iteri2" { + Expect.equal "iteri2" (6+60+3) + <| (let c = ref 0 + ResizeArray.iteri2 (fun i j k -> c := !c+i+j+k) (ra [1;2;3]) (ra [10;20;30]) + !c) } + + test "ra_singleton" { + Expect.isTrue "singleton" (ResizeArray.singleton 42 =? [42]) } + + test "ra_zip" { + Expect.isTrue "zip" (ResizeArray.zip (ra [1..10]) (ra [1..10]) =? [for i in 1..10 -> i, i]) } + + test "ra_unzip" { + Expect.isTrue "unzip" + <| (let unzip1, unzip2 = ResizeArray.unzip <| ra [for i in 1..10 -> i, i+1] + unzip1 =? [1..10] && unzip2 =? [2..11] ) } + + test "ra_reduce_left" { + Expect.equal "reduce" 8 <| ResizeArray.reduce (+) (ra [2;2;2;2]) } + + test "ra_reduce_right" { + Expect.equal "reduceBack" 8 <| ResizeArray.reduceBack (+) (ra [2;2;2;2]) } + + test "ra_fold2" { + Expect.equal "fold2" 112 <| ResizeArray.fold2 (fun i j k -> i+j+k) 100 (ra [1;2;3]) (ra [1;2;3]) } + + test "ra_fold2_b" { + Expect.equal "fold2" (100-12) <| ResizeArray.fold2 (fun i j k -> i-j-k) 100 (ra [1;2;3]) (ra [1;2;3]) } + + test "ra_foldBack2" { + Expect.equal "foldBack2" 112 <| ResizeArray.foldBack2 (fun i j k -> i+j+k) (ra [1;2;3]) (ra [1;2;3]) 100 } + + test "ra_foldBack2_b" { + Expect.equal "foldBack2" (100-12) <| ResizeArray.foldBack2 (fun i j k -> k-i-j) (ra [1;2;3]) (ra [1;2;3]) 100 } + + test "ra_scan" { + Expect.isTrue "scan" (ResizeArray.scan (+) 0 (ra [1..5]) =? [0; 1; 3; 6; 10; 15]) } + + test "ra_scanBack" { + Expect.isTrue "scanBack" (ResizeArray.scanBack (+) (ra [1..5]) 0 =? [15; 14; 12; 9; 5; 0]) } + + test "ra_tryfind_index" { + Expect.equal "tryFindIndex" (Some 4) <| ResizeArray.tryFindIndex (fun x -> x = 4) (ra [0..10]) } + + test "ra_tryfind_index_b" { + Expect.isNone "tryFindIndex" <| ResizeArray.tryFindIndex (fun x -> x = 42) (ra [0..10]) } + + test "ra_tryfind_indexi" { + Expect.equal "tryFindIndexi" (Some 4) <| ResizeArray.tryFindIndexi (=) (ra [1;2;3;4;4;3;2;1]) } + + test "ra_tryfind_indexi_b" { + Expect.isNone "tryFindIndexi" <| ResizeArray.tryFindIndexi (=) (ra [1..10]) } + + test "ra_iter" { + Expect.equal "iter" 100 + <| (let c = ref -1 + ResizeArray.iter (fun x -> incr c; Expect.equal "ra_iter" x !c) (ra [0..100]) + !c) } + + test "ra_map" { + Expect.isTrue "map" (ra [1..100] |> ResizeArray.map ((+) 1) =? [2..101]) } + + test "ra_mapi" { + Expect.isTrue "mapi" (ra [0..100] |> ResizeArray.mapi (+) =? [0..+2..200]) } + + test "ra_iteri" { + Expect.equal "iteri" 100 + <| (let c = ref -1 + ResizeArray.iteri (fun i x -> incr c; Expect.isTrue "ra_iteri" (x = !c && i = !c)) (ra [0..100]) + !c) } + + test "ra_exists" { + Expect.isTrue "exists" (ra [1..100] |> ResizeArray.exists ((=) 50)) } + + test "ra_exists b" { + Expect.isFalse "exists" (ra [1..100] |> ResizeArray.exists ((=) 150)) } + + test "ra_forall" { + Expect.isTrue "forall" (ra [1..100] |> ResizeArray.forall (fun x -> x < 150)) } + + test "ra_forall b" { + Expect.isFalse "forall" (ra [1..100] |> ResizeArray.forall (fun x -> x < 80)) } + + test "ra_find" { + Expect.equal "find" 51 <| (ra [1..100] |> ResizeArray.find (fun x -> x > 50) ) } + + test "ra_find b" { + Expect.throwsT "find" (fun () -> ra [1..100] |> ResizeArray.find (fun x -> x > 180) |> ignore) } + + test "ra_first" { + Expect.equal "tryPick" (Some (51*51)) (ra [1..100] |> ResizeArray.tryPick (fun x -> if x > 50 then Some (x*x) else None) ) } + + test "ra_first b" { + Expect.isNone "tryPick" (ra [1..100] |> ResizeArray.tryPick (fun x -> None) ) } + + test "ra_first c" { + Expect.isNone "tryPick" (ra [] |> ResizeArray.tryPick (fun _ -> Some 42) ) } + + test "ra_tryfind" { + Expect.equal "tryFind" (Some 51) (ra [1..100] |> ResizeArray.tryFind (fun x -> x > 50) ) } + + test "ra_tryfind b" { + Expect.isNone "tryFind" (ra [1..100] |> ResizeArray.tryFind (fun x -> x > 180) ) } + + test "ra_iter2" { + Expect.equal "iter2" 100 + <| (let c = ref -1 + ResizeArray.iter2 (fun x y -> incr c; Expect.isTrue "ra_iter2" (!c = x && !c = y)) (ra [0..100]) (ra [0..100]) + !c) } + + test "ra_map2" { + Expect.isTrue "map2" (ResizeArray.map2 (+) (ra [0..100]) (ra [0..100]) =? [0..+2..200]) } + + test "ra_choose" { + Expect.isTrue "choose" (ResizeArray.choose (fun x -> if x % 2 = 0 then Some (x/2) else None) (ra [0..100]) =? [0..50]) } + + test "ra_filter" { + Expect.isTrue "filter" (ResizeArray.filter (fun x -> x % 2 = 0) (ra [0..100]) =? [0..+2..100]) } + + test "ra_filter b" { + Expect.isTrue "filter" (ResizeArray.filter (fun x -> false) (ra [0..100]) =? []) } + + test "ra_filter c" { + Expect.isTrue "filter" (ResizeArray.filter (fun x -> true) (ra [0..100]) =? [0..100]) } + + test "ra_partition" { + Expect.isTrue "partition" + ( let p1, p2 = ResizeArray.partition (fun x -> x % 2 = 0) (ra [0..100]) + p1 =? [0..+2..100] && p2 =? [1..+2..100]) } + + test "ra_rev" { + Expect.isTrue "rev" (ResizeArray.rev (ra [0..100]) =? [100..-1 ..0]) } + + test "ra_rev b" { + Expect.isTrue "rev" (ResizeArray.rev (ra [1]) =? [1]) } + + test "ra_rev c" { + Expect .isTrue"rev" (ResizeArray.rev (ra []) =? []) } + + test "ra_rev d" { + Expect.isTrue "rev" (ResizeArray.rev (ra [1; 2]) =? [2; 1]) } + + test "ra_concat ra ra" { + Expect.isTrue "concat" (ResizeArray.concat (ra [ra [1; 2]; ra [3]; ra [4; 5; 6;]; ra []; ra [7]]) =? [1; 2; 3; 4; 5; 6; 7]) } + + test "ra_concat list ra" { + Expect.isTrue "concat" (ResizeArray.concat [ra [1; 2]; ra [3]; ra [4; 5; 6;]; ra []; ra [7]] =? [1; 2; 3; 4; 5; 6; 7]) } + + test "ra_concat concat" { + Expect.isTrue "concat" (ResizeArray.concat (ra [ra [1; 2]; ra [3]; ra [4; 5; 6;]; ra []; ra [7]]) + =? (ResizeArray.concat (Seq.ofList[ra [1; 2]; ra [3]; ra [4; 5; 6;]; ra []; ra [7]]) |> List.ofSeq)) } + + test "ra_distinct a" { + Expect.isTrue "distinct" (let ar = [for i=1 to 100 do yield rng.Next(0,10)] + in (ar |> Seq.distinct |> Seq.toArray) = (ar |> ra |> ResizeArray.distinct |> ResizeArray.toArray)) } + + test "ra_distinctBy a" { + Expect.isTrue "distinctBy" (let ar = [for i=1 to 100 do yield rng.Next(0,10),rng.Next(0,10)] + in (ar |> Seq.distinctBy(fun (x,_) -> x) |> Seq.toArray) + = (ar |> ra |> ResizeArray.distinctBy(fun (x,_) -> x) |> ResizeArray.toArray)) } + ] \ No newline at end of file diff --git a/tests/FSharpx.Collections.Tests/RunTests.fs b/tests/FSharpx.Collections.Tests/RunTests.fs new file mode 100644 index 00000000..a0d7c7f9 --- /dev/null +++ b/tests/FSharpx.Collections.Tests/RunTests.fs @@ -0,0 +1,55 @@ +namespace FSharpx.Collections.Tests + +open Expecto + +module RunTests = + + [] + let main args = + + Tests.runTestsWithArgs defaultConfig args ArrayTests.testArray |> ignore + + Tests.runTestsWithArgs defaultConfig args ByteStringTests.testByteString |> ignore + + Tests.runTestsWithArgs defaultConfig args ResizeArrayTests.testResizeArray |> ignore + + Tests.runTestsWithArgs defaultConfig args DequeTests.testDeque |> ignore + Tests.runTestsWithArgs defaultConfig args DequeTests.propertyTestDeque |> ignore + + Tests.runTestsWithArgs defaultConfig args DictionaryExtensionsTests.testDictionaryExtensions |> ignore + + Tests.runTestsWithArgs defaultConfig args DListTests.testDList |> ignore + Tests.runTestsWithArgs defaultConfig args DListTests.propertyTestDList |> ignore + + Tests.runTestsWithArgs defaultConfig args HeapTests.testHeap |> ignore + Tests.runTestsWithArgs defaultConfig args HeapTests.propertyTestHeap |> ignore + + Tests.runTestsWithArgs defaultConfig args LazyList.testLazyList |> ignore + + Tests.runTestsWithArgs defaultConfig args ListExtensionsTests.testListExtensions |> ignore + Tests.runTestsWithArgs defaultConfig args ListExtensionsTests.propertyTestListExtensions |> ignore + + Tests.runTestsWithArgs defaultConfig args MapExtensionsTests.testMapExtensions |> ignore + + Tests.runTestsWithArgs defaultConfig args MapTests.testMap |> ignore + + Tests.runTestsWithArgs defaultConfig args NameValueCollectionTests.testNameValueCollection |> ignore + + Tests.runTestsWithArgs defaultConfig args PriorityQueueTests.testPriorityQueue |> ignore + + Tests.runTestsWithArgs defaultConfig args QueueTests.testQueue |> ignore + Tests.runTestsWithArgs defaultConfig args QueueTests.propertyTestQueue |> ignore + + Tests.runTestsWithArgs defaultConfig args RandomAccessListTest.testRandomAccessList |> ignore + Tests.runTestsWithArgs defaultConfig args RandomAccessListTest.propertyTestRandomAccessList |> ignore + + Tests.runTestsWithArgs defaultConfig args SeqTests.testSeq |> ignore + + Tests.runTestsWithArgs defaultConfig args PersistentVectorTests.testPersistentVector |> ignore + + Tests.runTestsWithArgs defaultConfig args TransientHashMapTests.testTransientHashMap |> ignore + + Tests.runTestsWithArgs defaultConfig args PersistentHashMapTests.testPersistentHashMap |> ignore + + 0 + diff --git a/tests/FSharpx.Collections.Tests/SeqTests.fs b/tests/FSharpx.Collections.Tests/SeqTests.fs index 03a4c9f3..16bf3229 100644 --- a/tests/FSharpx.Collections.Tests/SeqTests.fs +++ b/tests/FSharpx.Collections.Tests/SeqTests.fs @@ -1,231 +1,192 @@ -module FSharpx.Collections.Tests.SeqTests +namespace FSharpx.Collections.Tests open System +open System.Linq open FSharpx.Collections -open FsCheck -open FsCheck.NUnit -open NUnit.Framework -open FsUnit - -[] -let index() = - let a = {'a'..'z'} - Seq.index a |> Seq.take 5 |> Seq.toList - |> should equal [0,'a'; 1,'b'; 2,'c'; 3,'d'; 4,'e'] - -[] -let tryFindWithIndex_None() = - let a = {1..10} - Seq.tryFindWithIndex ((<)10) a - |> should equal None - -[] -let tryFindWithIndex_Some() = - let a = {'a'..'z'} - Seq.tryFindWithIndex ((=)'e') a - |> should equal (Some (4,'e')) - -[] -let lift2() = - Seq.lift2 (+) [0;1] [0;2] |> Seq.toList - |> should equal [0;2;1;3] - -let data = [1.;2.;3.;4.;5.;6.;7.;8.;9.;10.] - -[] -let ``I should be able to break the iteration of a seq based on a predicate``() = - let result = ref [] - Seq.iterBreak (fun a -> result := a :: !result; a <= 5.) data - !result |> List.rev |> should equal [1.;2.;3.;4.;5.;6.] - -[] -let ``If I tryAverage an empty seq I should get none``() = - Seq.empty - |> Seq.tryAverage - |> should equal None - -[] -let ``If I tryAverage a none empty seq I should get the average``() = - data |> Seq.tryAverage - |> should equal (Some (5.5)) - -[] -let ``I should be a to split a seq at an index``() = - let (a,b) = Seq.splitAt 5 data - a |> should equal [1.;2.;3.;4.;5.] - b |> should equal [6.;7.;8.;9.;10.] - -[] -let ``I should be able to turn a stream reader into a sequence``() = - use data = new IO.MemoryStream(Text.Encoding.UTF8.GetBytes("1\r\n2\r\n3\r\n")) - use reader = new IO.StreamReader(data) - Seq.ofStreamReader reader - |> should equal ["1";"2";"3"] - -[] -let ``I should be able to turn a stream into a sequence of bytes``() = - let bytes = Text.Encoding.UTF8.GetBytes("1\r\n2\r\n3\r\n") - use stream = new IO.MemoryStream(bytes) - Seq.ofStreamByByte stream - |> should equal bytes - -[] -let ``I should be able to turn a stream into a chunked sequence of bytes``() = - let bytes = Text.Encoding.UTF8.GetBytes("1\r\n2\r\n3\r\n") - use stream = new IO.MemoryStream(bytes) - Seq.ofStreamByChunk 3 stream - |> should equal ([ - Text.Encoding.UTF8.GetBytes("1\r\n") - Text.Encoding.UTF8.GetBytes("2\r\n") - Text.Encoding.UTF8.GetBytes("3\r\n") - ] |> List.toSeq) - -[] -let ``I should be able to create a inifinite seq of values``() = - let data = [1;2] - Seq.asCircular [1;2] |> Seq.take 4 - |> should equal [1;2;1;2] - -[] -let ``I should be able to create a inifinite seq of values and have none in between each iteration``() = - let data = [1;2] - Seq.asCircularWithBreak [1;2] |> Seq.take 5 - |> should equal [Some 1;Some 2; None; Some 1; Some 2] - -[] -let ``I should be able to create a inifinite seq of values and call function when seq exhusted``() = - let called = ref false - let data = [1;2] - Seq.asCircularOnLoop (fun () -> called := true) [1;2] - |> Seq.take 4 - |> should equal [1;2;1;2] - -[] -let ``I should get none if try to get a index outside the seq``() = - Seq.tryNth 20 data - |> should equal None - -[] -let ``I should get some if try to get a index inside the seq``() = - Seq.tryNth 2 data - |> should equal (Some(3.)) - -[] -let ``I should get none when trySkip past the end of the seq``() = - Seq.skipNoFail 20 data - |> should equal Seq.empty - -[] -let ``I should get Some when trySkip``() = - Seq.skipNoFail 5 data - |> should equal [6.;7.;8.;9.;10.] - -[] -let ``I should be able to repeat a single value infinitely``() = - Seq.repeat 1 |> Seq.take 5 - |> should equal [1;1;1;1;1] - -[] -let ``I should be able to get the tail of a sequence``() = - Seq.tail [1;2;3;4] - |> should equal [2;3;4] - -[] -[)>] -let ``I should not be able to get the tail of a empty sequence``() = - Seq.tail [] - |> should equal [] - -[] -let ``I should be able to get the tail of a empty sequence without a fail``() = - Seq.tailNoFail [] - |> should equal [] - -[] -let ``I should be able to contract a seq taking every nth value``() = - Seq.contract 5 data - |> should equal [5;10] - -[] -let ``I should be able to contract a seq sequence by a given ratio``() = - let actual = Seq.contract 2 (Seq.init 72 (fun i -> 0)) |> Seq.toList - let expected = Seq.init 36 (fun i -> 0) |> Seq.toList - actual |> should equal expected - -[] -let ``I should be able to contract an empty sequence``() = - let actual = Seq.contract 5 (Seq.empty) - actual |> should equal [] - -[] -let ``I should be able to contract a infinite sequence``() = - let actual = Seq.contract 5 (Seq.initInfinite (fun i -> i + 1)) - actual |> Seq.take 5 |> should equal [5;10;15;20;25] - - -[] -let ``Should be able to combine two sequences``() = - let a,b = [1;2;3;4;5], [6;7;8;9;10] - Seq.combine (+) a b - |> should equal [7;9;11;13;15] - -[] -let ``Should be able to combine two empty sequences``() = - let a,b = [], [] - Seq.combine (+) a b - |> should equal [] - -[] -let ``Should be able to combine two sequences when one is infinite``() = - let a,b = [1;2;3;4;5], (Seq.initInfinite (fun i -> i + 6)) - Seq.combine (+) a b |> Seq.take 5 - |> should equal [7;9;11;13;15] - -[] -let ``Should be able to combine two sequences when both are infinite``() = - let a,b = (Seq.initInfinite (fun i -> i + 1)), (Seq.initInfinite (fun i -> i + 6)) - Seq.combine (+) a b |> Seq.take 5 - |> should equal [7;9;11;13;15] - -[] -let ``I should be able to expand a seq``() = - let a = [1;2;3;4;5] - Seq.grow 2 a - |> should equal [1;1;2;2;3;3;4;4;5;5] - -[] -let ``I should be able to page a seq``() = - Seq.page 0 2 data |> should equal [1.;2.] - Seq.page 1 2 data |> should equal [3.;4.] - Seq.page 2 2 data |> should equal [5.;6.] - - -[] -let ``I should intersperse a seq``() = - let a = "foobar".ToCharArray() - - let expected = ['f';',';'o';',';'o';',';'b';',';'a';',';'r'] - - (a |> Seq.intersperse ',') |> should equal expected - -[] -let ``I shouldn't interperse an empty list``() = - let a = [] - - (a |> Seq.intersperse ',') |> should equal a - -[] -let ``I should interperse always 2n-1 elements``() = - let intersperse elem (list:'a list) = - let interpersed = Seq.intersperse elem list - - if Seq.length list = 0 then - Seq.length interpersed = 0 - else - Seq.length interpersed = (Seq.length list) * 2 - 1 - - fsCheck "interperse a list" intersperse +open FSharpx.Collections.Tests.Properties +open Expecto +open Expecto.Flip + +module SeqTests = + let testSeq = + + let data = [1.;2.;3.;4.;5.;6.;7.;8.;9.;10.] + let intersperse elem (list:'a list) = + let interpersed = Seq.intersperse elem list + if Seq.length list = 0 then + Seq.length interpersed = 0 + else + Seq.length interpersed = (Seq.length list) * 2 - 1 + testList "Seq" [ + + test "index "{ + let a = {'a'..'z'} + Expect.equal "index" [0,'a'; 1,'b'; 2,'c'; 3,'d'; 4,'e'] (Seq.index a |> Seq.take 5 |> Seq.toList) } + + test "tryFindWithIndex_None" { + let a = {1..10} + Expect.isNone "tryFindWithIndex" (Seq.tryFindWithIndex ((<)10) a) } + + test "tryFindWithIndex_Some" { + let a = {'a'..'z'} + Expect.equal "" (Some (4,'e')) (Seq.tryFindWithIndex ((=)'e') a) } + test "lift2" { + Expect.equal "" [0;2;1;3] (Seq.lift2 (+) [0;1] [0;2] |> Seq.toList) } + + test "I should be able to break the iteration of a seq based on a predicate" { + let result = ref [] + Seq.iterBreak (fun a -> result := a :: !result; a <= 5.) data + Expect.equal "iterBreak" [1.;2.;3.;4.;5.;6.] (!result |> List.rev) } + + test "If I tryAverage an empty seq I should get none" { + Seq.empty + |> Seq.tryAverage + |> Expect.isNone "tryAverage" } + + test "If I tryAverage a none empty seq I should get the average" { + data |> Seq.tryAverage + |> Expect.equal "tryAverage" (Some (5.5)) } + + test "I should be a to split a seq at an index" { + let (a,b) = Seq.splitAt 5 data + Expect.sequenceEqual "splitAt" (List.toSeq [1.;2.;3.;4.;5.]) a + Expect.sequenceEqual "splitAt" (List.toSeq [6.;7.;8.;9.;10.]) b } + + test "I should be able to turn a stream reader into a sequence" { + use data = new IO.MemoryStream(Text.Encoding.UTF8.GetBytes("1\r\n2\r\n3\r\n")) + use reader = new IO.StreamReader(data) + let expected = List.toSeq ["1";"2";"3"] + let actual = Seq.ofStreamReader reader + Expect.isTrue "ofStreamReader" (expected.SequenceEqual(actual)); + } + + test "I should be able to turn a stream into a sequence of bytes" { + let bytes = Text.Encoding.UTF8.GetBytes("1\r\n2\r\n3\r\n") + use stream = new IO.MemoryStream(bytes) + let expected = Array.toSeq bytes + let actual = Seq.ofStreamByByte stream |> Seq.map (fun x -> byte x) + Expect.isTrue "ofStreamByByte" (expected.SequenceEqual(actual)) + } + + test "I should be able to turn a stream into a chunked sequence of bytes" { + let bytes = Text.Encoding.UTF8.GetBytes("1\r\n2\r\n3\r\n") + use stream = new IO.MemoryStream(bytes) + + Seq.ofStreamByChunk 3 stream + |> Expect.sequenceEqual + "ofStreamByChunk" ([ + Text.Encoding.UTF8.GetBytes("1\r\n") + Text.Encoding.UTF8.GetBytes("2\r\n") + Text.Encoding.UTF8.GetBytes("3\r\n") + ] |> List.toSeq) + } + + test "I should be able to create a infinite seq of values" { + let data = [1;2] + Seq.asCircular [1;2] |> Seq.take 4 + |> Expect.sequenceEqual "asCircular" (List.toSeq [1;2;1;2]) } + + test "I should be able to create a infinite seq of values and have none in between each iteration" { + let data = [1;2] + Seq.asCircularWithBreak [1;2] |> Seq.take 5 + |> Expect.sequenceEqual "asCircularWithBreak" (List.toSeq [Some 1;Some 2; None; Some 1; Some 2]) } + + test "I should be able to create a infinite seq of values and call function when seq exhusted" { + let called = ref false + let data = [1;2] + Seq.asCircularOnLoop (fun () -> called := true) [1;2] + |> Seq.take 4 + |> Expect.sequenceEqual "asCircularOnLoop" (List.toSeq [1;2;1;2]) } + + test "I should get none if try to get a index outside the seq" { + Seq.tryNth 20 data + |> Expect.isNone "tryNth" } + + test "I should get some if try to get a index inside the seq" { + Seq.tryNth 2 data + |> Expect.equal "tryNth" (Some(3.)) } + + test "I should get none when trySkip past the end of the seq" { + Seq.skipNoFail 20 data + |> Expect.sequenceEqual "skipNoFail" Seq.empty } + + test "I should get Some when trySkip" { + Seq.skipNoFail 5 data + |> Expect.sequenceEqual "skipNoFail" (List.toSeq [6.;7.;8.;9.;10.]) } + + test "I should be able to repeat a single value infinitely" { + Seq.repeat 1 |> Seq.take 5 + |> Expect.sequenceEqual "repeat" (List.toSeq [1;1;1;1;1]) } + + test "I should be able to get the tail of a sequence" { + Seq.tail [1;2;3;4] + |> Expect.sequenceEqual "tail" (List.toSeq [2;3;4]) } + + test "I should not be able to get the tail of a empty sequence" { + Expect.throwsT "empty tail" (fun () -> Seq.tail [] |> ignore) } + + test "I should be able to get the tail of a empty sequence without a fail" { + Seq.tailNoFail [] + |> Expect.sequenceEqual "tailNoFail" Seq.empty } + + test "I should be able to contract a seq taking every nth value" { + Seq.contract 5 data + |> Expect.sequenceEqual "contract" (List.toSeq [5.;10.]) } + + test "I should be able to contract a seq sequence by a given ratio" { + let actual = Seq.contract 2 (Seq.init 72 (fun i -> 0)) |> Seq.toList + let expected = Seq.init 36 (fun i -> 0) |> Seq.toList + Expect.sequenceEqual "contract" expected actual} + + test "I should be able to contract an empty sequence" { + Expect.sequenceEqual "contract" Seq.empty <| Seq.contract 5 (Seq.empty)} + + test "I should be able to contract a infinite sequence" { + let actual = Seq.contract 5 (Seq.initInfinite (fun i -> i + 1)) + Expect.sequenceEqual "contract" (List.toSeq [5;10;15;20;25]) (actual |> Seq.take 5) } + + test "Should be able to combine two sequences" { + let a,b = [1;2;3;4;5], [6;7;8;9;10] + Seq.combine (+) a b + |> Expect.sequenceEqual "combine" (List.toSeq [7;9;11;13;15]) } + + test "Should be able to combine two empty sequences" { + let a,b = [], [] + Expect.sequenceEqual "combine" Seq.empty <| Seq.combine (+) a b } + + test "Should be able to combine two sequences when one is infinite" { + let a,b = [1;2;3;4;5], (Seq.initInfinite (fun i -> i + 6)) + Seq.combine (+) a b |> Seq.take 5 + |> Expect.sequenceEqual "combine" (List.toSeq [7;9;11;13;15]) } + + test "Should be able to combine two sequences when both are infinite" { + let a,b = (Seq.initInfinite (fun i -> i + 1)), (Seq.initInfinite (fun i -> i + 6)) + Seq.combine (+) a b |> Seq.take 5 + |> Expect.sequenceEqual "combine" (List.toSeq [7;9;11;13;15]) } + + test "I should be able to expand a seq" { + let a = [1;2;3;4;5] + Seq.grow 2 a + |> Expect.sequenceEqual "grow" (List.toSeq [1;1;2;2;3;3;4;4;5;5]) } + + test "I should be able to page a seq" { + Seq.page 0 2 data |> Expect.sequenceEqual "page" (List.toSeq [1.;2.]) + Seq.page 1 2 data |> Expect.sequenceEqual "page" (List.toSeq [3.;4.]) + Seq.page 2 2 data |> Expect.sequenceEqual "page" (List.toSeq [5.;6.]) } + + test "I should intersperse a seq" { + let a = "foobar".ToCharArray() + let expected = ['f';',';'o';',';'o';',';'b';',';'a';',';'r'] |> List.toSeq + + Expect.sequenceEqual "" expected (a |> Seq.intersperse ',') } + + test "I shouldn't interperse an empty list" { + let a = Seq.empty + Expect.sequenceEqual "" a (a |> Seq.intersperse ',') } + + testPropertyWithConfig config10k "I should interperse always 2n-1 elements" intersperse + ] \ No newline at end of file diff --git a/tests/FSharpx.Collections.Tests/TransientHashMapTest.fs b/tests/FSharpx.Collections.Tests/TransientHashMapTest.fs index 85f40ee9..f5def32d 100644 --- a/tests/FSharpx.Collections.Tests/TransientHashMapTest.fs +++ b/tests/FSharpx.Collections.Tests/TransientHashMapTest.fs @@ -1,223 +1,204 @@ -module FSharpx.Collections.Experimental.Tests.TransientHashMapTest +namespace FSharpx.Collections.Tests open System open FSharpx.Collections -open FSharpx.Collections.PersistentHashMap -open NUnit.Framework -open FsUnit +open Expecto +open Expecto.Flip -[] -type AlwaysSameHash = - { Name : string; } +module TransientHashMapTests = + [] + type AlwaysSameHash = + { Name : string; } - interface System.IComparable with - member this.CompareTo { Name = name } = - compare this.Name name + interface System.IComparable with + member this.CompareTo { Name = name } = + compare this.Name name - interface IComparable with - member this.CompareTo obj = + interface IComparable with + member this.CompareTo obj = + match obj with + | :? AlwaysSameHash as other -> (this :> IComparable<_>).CompareTo other + | _ -> invalidArg "obj" "not a AlwaysSameHash" + + interface IEquatable with + member this.Equals { Name = name } = this.Name = name + + override this.Equals obj = match obj with - | :? AlwaysSameHash as other -> (this :> IComparable<_>).CompareTo other + | :? AlwaysSameHash as other -> (this :> IEquatable<_>).Equals other | _ -> invalidArg "obj" "not a AlwaysSameHash" - interface IEquatable with - member this.Equals { Name = name } = this.Name = name - - override this.Equals obj = - match obj with - | :? AlwaysSameHash as other -> (this :> IEquatable<_>).Equals other - | _ -> invalidArg "obj" "not a AlwaysSameHash" - - override this.GetHashCode () = 42 - -[] -let ``two AlwaysSameHash have same hash``() = - hash { Name = "Test"} |> should equal (hash { Name = "Test"}) - { Name = "Test"} |> should equal { Name = "Test"} - hash { Name = "Test"} |> should equal (hash { Name = "Test1"}) - { Name = "Test"} |> shouldNotEqual { Name = "Test1"} - -[] -let ``empty map should be empty``() = - let x = TransientHashMap.Empty() - x.persistent() |> length |> should equal 0 - - -[] -let ``empty map should not contain key 0``() = - let x = TransientHashMap.Empty() - x.persistent() |> containsKey 1 |> should equal false - -[] -let ``can add null entry to empty map``() = - let x = TransientHashMap.Empty() - x.persistent() |> containsKey "value" |> should equal false - x.persistent() |> containsKey null |> should equal false - x.Add(null,"Hello").persistent() |> containsKey null |> should equal true - - -[] -let ``can add empty string as key to empty map``() = - let x = TransientHashMap.Empty() - x.persistent() |> containsKey "" |> should equal false - x.Add("","Hello").persistent() |> containsKey null |> should equal false - x.Add("","Hello").persistent() |> containsKey "" |> should equal true - -[] -let ``can add some integers to empty map``() = - let x = - TransientHashMap.Empty() - .Add(1,"h") - .Add(2,"a") - .Add(3,"l") - .Add(4,"l") - .Add(5,"o") - .persistent() - - x |> containsKey 1 |> shouldEqual true - x |> containsKey 5 |> shouldEqual true - x |> containsKey 6 |> shouldEqual false - - -[] -let ``can remove some integers from a map``() = - let x = - TransientHashMap.Empty() - .Add(1,"h") - .Add(2,"a") - .Add(3,"l") - .Add(4,"l") - .Add(5,"o") - .Remove(1) - .Remove(4) - .persistent() - - - x |> containsKey 1 |> shouldEqual false - x |> containsKey 4 |> shouldEqual false - x |> containsKey 5 |> shouldEqual true - x |> containsKey 6 |> shouldEqual false - -[] -let ``can find integers in a map``() = - let x = - TransientHashMap.Empty() - .Add(1,"h") - .Add(2,"a") - .Add(3,"l") - .Add(4,"l") - .Add(5,"o") - .persistent() + override __.GetHashCode () = 42 + + let testTransientHashMap = + + testList "TransientHashMap" [ + + test "two AlwaysSameHash have same hash" { + Expect.equal "AlwaysSameHash" (hash { Name = "Test"}) (hash { Name = "Test"}) + Expect.equal "AlwaysSameHash" { Name = "Test"} { Name = "Test"} + Expect.equal "AlwaysSameHash" (hash { Name = "Test1"}) (hash { Name = "Test"}) + Expect.notEqual "AlwaysSameHash" { Name = "Test1"} { Name = "Test"} } + + test "empty map should be empty" { + let x = TransientHashMap.Empty() + Expect.equal "empty" 0 (x.persistent() |> PersistentHashMap.length) } + + test "empty map should not contain key 0" { + let x = TransientHashMap.Empty() + Expect.isFalse "empty" (x.persistent() |> PersistentHashMap.containsKey 1) } + + test "can add null entry to empty map" { + let x = TransientHashMap.Empty() + Expect.isFalse "PersistentHashMap.containsKey" (x.persistent() |> PersistentHashMap.containsKey "value") + Expect.isFalse "PersistentHashMap.containsKey" (x.persistent() |> PersistentHashMap.containsKey null) + Expect.isTrue "PersistentHashMap.containsKey" (x.Add(null,"Hello").persistent() |> PersistentHashMap.containsKey null) } + + test "can add empty string as key to empty map" { + let x = TransientHashMap.Empty() + Expect.isFalse "" (x.persistent() |> PersistentHashMap.containsKey "") + Expect.isFalse "" (x.Add("","Hello").persistent() |> PersistentHashMap.containsKey null) + Expect.isTrue "" (x.Add("","Hello").persistent() |> PersistentHashMap.containsKey "") } + + test "can add some integers to empty map" { + let x = + TransientHashMap.Empty() + .Add(1,"h") + .Add(2,"a") + .Add(3,"l") + .Add(4,"l") + .Add(5,"o") + .persistent() + + Expect.isTrue "PersistentHashMap.containsKey" (x |> PersistentHashMap.containsKey 1) + Expect.isTrue "PersistentHashMap.containsKey" (x |> PersistentHashMap.containsKey 5) + Expect.isFalse "PersistentHashMap.containsKey" (x |> PersistentHashMap.containsKey 6) } + + test "can remove some integers from a map" { + let x = + TransientHashMap.Empty() + .Add(1,"h") + .Add(2,"a") + .Add(3,"l") + .Add(4,"l") + .Add(5,"o") + .Remove(1) + .Remove(4) + .persistent() + + Expect.isFalse "PersistentHashMap.containsKey" <| PersistentHashMap.containsKey 1 x + Expect.isFalse "PersistentHashMap.containsKey" <| PersistentHashMap.containsKey 4 x + Expect.isTrue "PersistentHashMap.containsKey" <| PersistentHashMap.containsKey 5 x + Expect.isFalse "PersistentHashMap.containsKey" <| PersistentHashMap.containsKey 6 x } + + test "can find integers in a map" { + let x = + TransientHashMap.Empty() + .Add(1,"h") + .Add(2,"a") + .Add(3,"l") + .Add(4,"l") + .Add(5,"o") + .persistent() - x |> find 1 |> shouldEqual "h" - x |> find 4 |> shouldEqual "l" - x |> find 5 |> shouldEqual "o" - -[] -let ``can lookup integers from a map``() = - let x = - TransientHashMap.Empty() - .Add(1,"h") - .Add(2,"a") - .Add(3,"l") - .Add(4,"l") - .Add(5,"o") + Expect.equal "find" "h" (x |> PersistentHashMap.find 1) + Expect.equal "find" "l" (x |> PersistentHashMap.find 4) + Expect.equal "find" "o" (x |> PersistentHashMap.find 5) } + + test "can lookup integers from a map" { + let x = + TransientHashMap.Empty() + .Add(1,"h") + .Add(2,"a") + .Add(3,"l") + .Add(4,"l") + .Add(5,"o") - x.[1] |> shouldEqual "h" - x.[4] |> shouldEqual "l" - x.[5] |> shouldEqual "o" - - -[] -let ``can add the same key multiple to a map``() = - let x = - TransientHashMap.Empty() - .Add(1,"h") - .Add(2,"a") - .Add(3,"l") - .Add(4,"l") - .Add(5,"o") - .Add(4,"a") - .Add(5,"o") - .persistent() + Expect.equal "lookup" "h" x.[1] + Expect.equal "lookup" "l" x.[4] + Expect.equal "lookup" "o" x.[5] } + + test "can add the same key multiple to a map" { + let x = + TransientHashMap.Empty() + .Add(1,"h") + .Add(2,"a") + .Add(3,"l") + .Add(4,"l") + .Add(5,"o") + .Add(4,"a") + .Add(5,"o") + .persistent() - x |> find 1 |> shouldEqual "h" - x |> find 4 |> shouldEqual "a" - x |> find 5 |> shouldEqual "o" + Expect.equal "" "h" <| PersistentHashMap.find 1 x + Expect.equal "" "a" <| PersistentHashMap.find 4 x + Expect.equal "" "o" <| PersistentHashMap.find 5 x } - -[] -let ``can add tons of integers to empty map``() = - let x = ref (TransientHashMap.Empty()) - let counter = 1000 - - for i in 0 .. counter do - x := (!x).Add(i,i) - - let x = (!x).persistent() - for i in 0 .. counter do - x |> containsKey i |> should equal true - -[] -let ``can lookup tons of integers from a map``() = - let x = ref (TransientHashMap.Empty()) - let counter = 1000 - - for i in 0 .. counter do - x := (!x).Add(i,i) - - for i in 0 .. counter do - (!x).[i] |> shouldEqual i - -[] -let ``can find tons of integers in a map``() = - let x = ref (TransientHashMap.Empty()) - let counter = 1000 - - for i in 0 .. counter do - x := (!x).Add(i,i) - - for i in 0 .. counter do - (!x).[i] |> shouldEqual i - - -[] -let ``can add keys with colliding hashes to empty map``() = - let x = { Name = "Test"} - let y = { Name = "Test1"} - let map = - TransientHashMap.Empty() - .Add(x,x.Name) - .Add(y,y.Name) - .persistent() - - map |> containsKey x |> should equal true - map |> containsKey y |> should equal true + test "can add tons of integers to empty map" { + let x = ref (TransientHashMap.Empty()) + let counter = 1000 + + for i in 0 .. counter do + x := (!x).Add(i,i) - empty |> containsKey y |> should equal false + let x = (!x).persistent() + for i in 0 .. counter do + x |> PersistentHashMap.containsKey i |> Expect.isTrue "lookup" } + test "can lookup tons of integers from a map" { + let x = ref (TransientHashMap.Empty()) + let counter = 1000 -[] -let ``can lookup keys with colliding hashes from map``() = - let x = { Name = "Test"} - let y = { Name = "Test1"} - let map = - TransientHashMap.Empty() - .Add(x,x) - .Add(y,y) - .persistent() + for i in 0 .. counter do + x := (!x).Add(i,i) + + for i in 0 .. counter do + (!x).[i] |> Expect.equal "lookup" i } + + test "can find tons of integers in a map" { + let x = ref (TransientHashMap.Empty()) + let counter = 1000 + + for i in 0 .. counter do + x := (!x).Add(i,i) + + for i in 0 .. counter do + (!x).[i] |> Expect.equal "lookup" i } + + test "can add keys with colliding hashes to empty map" { + let x = { Name = "Test"} + let y = { Name = "Test1"} + let map = + TransientHashMap.Empty() + .Add(x,x.Name) + .Add(y,y.Name) + .persistent() + + Expect.isTrue "PersistentHashMap.containsKey" <| PersistentHashMap.containsKey x map + Expect.isTrue "PersistentHashMap.containsKey" <| PersistentHashMap.containsKey y map + + Expect.isFalse "PersistentHashMap.containsKey" <| PersistentHashMap.containsKey y PersistentHashMap.empty } + + test "can lookup keys with colliding hashes from map" { + let x = { Name = "Test"} + let y = { Name = "Test1"} + let map = + TransientHashMap.Empty() + .Add(x,x) + .Add(y,y) + .persistent() - map |> find x |> shouldEqual { Name = "Test"} - map |> find y |> shouldEqual { Name = "Test1"} + Expect.equal "find" { Name = "Test"} (map |> PersistentHashMap.find x) + Expect.equal "find" { Name = "Test1"} (map |> PersistentHashMap.find y) } -[] -let ``can add lots of keys with colliding hashes to empty map``() = - let x = ref (TransientHashMap.Empty() ) - let counter = 1000 + test "can add lots of keys with colliding hashes to empty map" { + let x = ref (TransientHashMap.Empty() ) + let counter = 1000 - for i in 0 .. counter do - x := (!x).Add({ Name = i.ToString() },i) + for i in 0 .. counter do + x := (!x).Add({ Name = i.ToString() },i) - let x = (!x).persistent() - for i in 0 .. counter do - x |> containsKey { Name = i.ToString() } |> should equal true \ No newline at end of file + let x = (!x).persistent() + for i in 0 .. counter do + x |> PersistentHashMap.containsKey { Name = i.ToString() } |> Expect.isTrue "PersistentHashMap.containsKey" } + ] \ No newline at end of file diff --git a/tests/FSharpx.Collections.Tests/Utilities.fs b/tests/FSharpx.Collections.Tests/Utilities.fs deleted file mode 100644 index 8becf839..00000000 --- a/tests/FSharpx.Collections.Tests/Utilities.fs +++ /dev/null @@ -1,128 +0,0 @@ -// First version copied from the F# Power Pack -// https://raw.github.com/fsharp/powerpack/master/src/FSharp.PowerPack.Unittests/Utilities.fs - -namespace FSharpx.Collections.Tests -open NUnit.Framework -open System -open System.Collections.Generic - -[] -module Utilities = - let test msg b = Assert.IsTrue(b, "MiniTest '" + msg + "'") - let logMessage msg = - System.Console.WriteLine("LOG:" + msg) -// System.Diagnostics.Trace.WriteLine("LOG:" + msg) - let check msg v1 v2 = test msg (v1 = v2) - let reportFailure msg = Assert.Fail msg - let numActiveEnumerators = ref 0 - let throws f = try f() |> ignore; false with e -> true - - let countEnumeratorsAndCheckedDisposedAtMostOnceAtEnd (seq: seq<'a>) = - let enumerator() = - numActiveEnumerators := !numActiveEnumerators + 1; - let disposed = ref false in - let endReached = ref false in - let ie = seq.GetEnumerator() in - { new System.Collections.Generic.IEnumerator<'a> with - member x.Current = - test "rvlrve0" (not !endReached); - test "rvlrve1" (not !disposed); - ie.Current - member x.Dispose() = - test "rvlrve2" !endReached; - test "rvlrve4" (not !disposed); - numActiveEnumerators := !numActiveEnumerators - 1; - disposed := true; - ie.Dispose() - interface System.Collections.IEnumerator with - member x.MoveNext() = - test "rvlrve0" (not !endReached); - test "rvlrve3" (not !disposed); - endReached := not (ie.MoveNext()); - not !endReached - member x.Current = - test "qrvlrve0" (not !endReached); - test "qrvlrve1" (not !disposed); - box ie.Current - member x.Reset() = - ie.Reset() - } in - - { new seq<'a> with - member x.GetEnumerator() = enumerator() - interface System.Collections.IEnumerable with - member x.GetEnumerator() = (enumerator() :> _) } - - let countEnumeratorsAndCheckedDisposedAtMostOnce (seq: seq<'a>) = - let enumerator() = - let disposed = ref false in - let endReached = ref false in - let ie = seq.GetEnumerator() in - numActiveEnumerators := !numActiveEnumerators + 1; - { new System.Collections.Generic.IEnumerator<'a> with - member x.Current = - test "qrvlrve0" (not !endReached); - test "qrvlrve1" (not !disposed); - ie.Current - member x.Dispose() = - test "qrvlrve4" (not !disposed); - numActiveEnumerators := !numActiveEnumerators - 1; - disposed := true; - ie.Dispose() - interface System.Collections.IEnumerator with - member x.MoveNext() = - test "qrvlrve0" (not !endReached); - test "qrvlrve3" (not !disposed); - endReached := not (ie.MoveNext()); - not !endReached - member x.Current = - test "qrvlrve0" (not !endReached); - test "qrvlrve1" (not !disposed); - box ie.Current - member x.Reset() = - ie.Reset() - } in - - { new seq<'a> with - member x.GetEnumerator() = enumerator() - interface System.Collections.IEnumerable with - member x.GetEnumerator() = (enumerator() :> _) } - - // Verifies two sequences are equal (same length, equiv elements) - let verifySeqsEqual seq1 seq2 = - if Seq.length seq1 <> Seq.length seq2 then Assert.Fail() - - let zippedElements = Seq.zip seq1 seq2 - if zippedElements |> Seq.forall (fun (a, b) -> a = b) - then () - else Assert.Fail() - - /// Check that the lamda throws an exception of the given type. Otherwise - /// calls Assert.Fail() - let private checkThrowsExn<'a when 'a :> exn> (f : unit -> unit) = - let funcThrowsAsExpected = - try - let _ = f () - false // Did not throw! - with - | :? 'a - -> true // Thew null ref, OK - | _ -> false // Did now throw a null ref exception! - if funcThrowsAsExpected - then () - else Assert.Fail() - - // Illegitimate exceptions. Once we've scrubbed the library, we should add an - // attribute to flag these exception's usage as a bug. - let checkThrowsNullRefException f = checkThrowsExn f - let checkThrowsIndexOutRangException f = checkThrowsExn f - - // Legit exceptions - let checkThrowsNotSupportedException f = checkThrowsExn f - let checkThrowsArgumentException f = checkThrowsExn f - let checkThrowsArgumentNullException f = checkThrowsExn f - let checkThrowsKeyNotFoundException f = checkThrowsExn f - let checkThrowsDivideByZeroException f = checkThrowsExn f - let checkThrowsInvalidOperationExn f = checkThrowsExn f - - \ No newline at end of file diff --git a/tests/FSharpx.Collections.Tests/app.config b/tests/FSharpx.Collections.Tests/app.config deleted file mode 100644 index ee895760..00000000 --- a/tests/FSharpx.Collections.Tests/app.config +++ /dev/null @@ -1,55 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - True - - - - - - - - \ No newline at end of file diff --git a/tests/FSharpx.Collections.Tests/paket.references b/tests/FSharpx.Collections.Tests/paket.references index 999c8bce..51bf72dc 100644 --- a/tests/FSharpx.Collections.Tests/paket.references +++ b/tests/FSharpx.Collections.Tests/paket.references @@ -1,3 +1,4 @@ +FSharp.Core FsCheck -FsUnit -NUnit +Expecto +Expecto.FsCheck \ No newline at end of file