diff --git a/.gitignore b/.gitignore
index 131b21a3..2fc55b4e 100644
--- a/.gitignore
+++ b/.gitignore
@@ -1,6 +1,5 @@
bin
obj
-build
output
*.user
*.suo
diff --git a/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.BizTalk.dll b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.BizTalk.dll
new file mode 100644
index 00000000..192d5c22
Binary files /dev/null and b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.BizTalk.dll differ
diff --git a/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.BizTalk.pdb b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.BizTalk.pdb
new file mode 100644
index 00000000..c11a3e95
Binary files /dev/null and b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.BizTalk.pdb differ
diff --git a/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.BizTalk.xsd b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.BizTalk.xsd
new file mode 100644
index 00000000..95fdf78a
--- /dev/null
+++ b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.BizTalk.xsd
@@ -0,0 +1,166 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Framework.xsd b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Framework.xsd
new file mode 100644
index 00000000..b7955ea3
--- /dev/null
+++ b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Framework.xsd
@@ -0,0 +1,1245 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Iis7.dll b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Iis7.dll
new file mode 100644
index 00000000..edf2a652
Binary files /dev/null and b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Iis7.dll differ
diff --git a/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Iis7.pdb b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Iis7.pdb
new file mode 100644
index 00000000..8d66e97f
Binary files /dev/null and b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Iis7.pdb differ
diff --git a/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Iis7.xsd b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Iis7.xsd
new file mode 100644
index 00000000..b6bcc527
--- /dev/null
+++ b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Iis7.xsd
@@ -0,0 +1,118 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.JSharp.dll b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.JSharp.dll
new file mode 100644
index 00000000..f157516e
Binary files /dev/null and b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.JSharp.dll differ
diff --git a/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.JSharp.pdb b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.JSharp.pdb
new file mode 100644
index 00000000..648e127a
Binary files /dev/null and b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.JSharp.pdb differ
diff --git a/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.JSharp.xsd b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.JSharp.xsd
new file mode 100644
index 00000000..c5c57337
--- /dev/null
+++ b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.JSharp.xsd
@@ -0,0 +1,29 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.MSTFSBuild2008.xsd b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.MSTFSBuild2008.xsd
new file mode 100644
index 00000000..ec204a2d
--- /dev/null
+++ b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.MSTFSBuild2008.xsd
@@ -0,0 +1,745 @@
+
+
+
+
+
+
+
+ The Get task retrieves a read-only copy of the files and folders in a workspace by using specified options.
+
+
+
+
+
+
+
+
+ REQUIRED. Team Foundation Server URL.
+
+
+
+
+
+
+ The build URI.
+
+
+
+
+
+
+ REQUIRED. The workspace name.
+
+
+
+
+
+
+ The file versionspec. By default the versionspec used is T, or the latest version.
+
+
+
+
+
+
+ The items in the workspace. By default, Team Foundation Build gets all items in the workspace specified by the WorkspaceName property.
+
+
+
+
+
+
+ Specifies whether to overwrite writable files that are not checked out.
+
+
+
+
+
+
+ Populate the Gets, Replaces, Deletes and GetWarnings Item Groups
+
+
+
+
+
+
+ Specifies whether to display what would occur without actually performing the Get operation.
+
+
+
+
+
+
+ Specifies whether files are retrieved recursively.
+
+
+
+
+
+
+ Specifies whether the files are retrieved incrementally.
+
+
+
+
+
+
+
+
+
+
+
+ The Label task attaches a label to the latest version of the files in the workspace.
+
+
+
+
+
+
+
+
+ REQUIRED. Team Foundation Server URL.
+
+
+
+
+
+
+ REQUIRED. The label name. By default, the name of the label created by Team Foundation Build is the same as the BuildNumber property.
+
+
+
+
+
+
+ The version of the file or folder.
+
+
+
+
+
+
+ Specifies the scope of the label
+
+
+
+
+
+
+ REQUIRED. The items to be labeled.
+
+
+
+
+
+
+ This corresponds to the /child option of tf.exe label command.
+
+
+
+
+
+
+ Specifies whether the files are labeled recursively.
+
+
+
+
+
+
+ The comment used for the label by Team Foundation Build.
+
+
+
+
+
+
+
+
+
+
+
+ The GenCheckinNotesUpdateWorkItems task associates changesets and work items with a specified build.
+
+
+
+
+
+
+
+
+ REQUIRED. Team Foundation Server URL.
+
+
+
+
+
+
+ REQUIRED. The URI for the build definition.
+
+
+
+
+
+
+ The Team Foundation Build build number.
+
+
+
+
+
+
+ REQUIRED. The version number label to which the changesets and work items are associated.
+
+
+
+
+
+
+ The starting version number label from which the changesets and work items are associated.
+
+
+
+
+
+
+ Boolean property that specifies whether the Microsoft.VSTS.Build.IntegrationBuild of the associated work items should be updated with the build number.
+
+
+
+
+
+
+
+
+
+
+
+ The CreateNewWorkItem task creates a new work item of the specified type and with the specified title and description.
+
+
+
+
+
+
+
+
+ REQUIRED. Team Foundation Server URL.
+
+
+
+
+
+
+ The Team Foundation Build build number.
+
+
+
+
+
+
+ REQUIRED. The work item description.
+
+
+
+
+
+
+ REQUIRED. The team project name.
+
+
+
+
+
+
+ REQUIRED. The work item title.
+
+
+
+
+
+
+ Specifies a list of field names and values for the created work item.
+
+
+
+
+
+
+ The work item type.
+
+
+
+
+
+
+
+
+
+
+
+ The CreateWorkspaceTask task creates a workspace with the name and mapping file specified in the TFSBuild.proj file.
+
+
+
+
+
+
+
+
+ REQUIRED. Team Foundation Server URL.
+
+
+
+
+
+
+ REQUIRED. The URI for the build definition.
+
+
+
+
+
+
+ REQUIRED. The build directory.
+
+
+
+
+
+
+ REQUIRED. The solution root for directory for source files.
+
+
+
+
+
+
+ REQUIRED. The workspace name.
+
+
+
+
+
+
+ The comment used for the workspace.
+
+
+
+
+
+
+
+
+
+
+
+ The DeleteWorkspaceTask task deletes the workspace left by the previous build.
+
+
+
+
+
+
+
+
+ REQUIRED. Team Foundation Server URL.
+
+
+
+
+
+
+ Indicates whether local items that are specified in the workspace mappings are deleted or not.
+
+
+
+
+
+
+ REQUIRED. The workspace name.
+
+
+
+
+
+
+
+
+
+
+
+ The TestToolsTask task runs tests for an end-to-end build or for a desktop build.
+
+
+
+
+
+
+
+
+ The build configuration e.g. debug
+
+
+
+
+
+
+ The platform e.g. x86
+
+
+
+
+
+
+ The Team Foundation Server URL.
+
+
+
+
+
+
+ The build number for the build.
+
+
+
+
+
+
+ The search path for test files.
+
+
+
+
+
+
+ Specifies where test results get uploaded.
+
+
+
+
+
+
+ The test metadata file.
+
+
+
+
+
+
+ The test configuration file.
+
+
+
+
+
+
+ The test list that is contained in the test metadata file.
+
+
+
+
+
+
+ The team project name.
+
+
+
+
+
+
+ The files that contain tests.
+
+
+
+
+
+
+
+
+
+
+
+ The UpdateBuildNumberDropLocation updates the build number and drop location in the Team Foundation version control database.
+
+
+
+
+
+
+
+
+ REQUIRED. Team Foundation Server URL.
+
+
+
+
+
+
+ REQUIRED. The URI for the build definition.
+
+
+
+
+
+
+ REQUIRED. The new build number.
+
+
+
+
+
+
+ REQUIRED. The new drop location.
+
+
+
+
+
+
+
+
+
+
+
+ The BuildStep task is a convenience task that adds, and potentially updates via the output ID property, a BuildStep.
+
+
+
+
+
+
+
+
+ REQUIRED. Team Foundation Server URL.
+
+
+
+
+
+
+ If specified, this is the Id of the build step that is updated. If not specified, a new build step is created.
+
+
+
+
+
+
+ REQUIRED. The URI for the build definition.
+
+
+
+
+
+
+ The name of the build step that this task adds.
+
+
+
+
+
+
+ The message that is displayed in the build report in the build steps section.
+
+
+
+
+
+
+ The status for the build step.
+
+
+
+
+
+
+
+
+
+
+
+ The GetBuildProperties task outputs the initial values for the build properties.
+
+
+
+
+
+
+
+
+ REQUIRED. Team Foundation Server URL.
+
+
+
+
+
+
+ REQUIRED. The URI for the build definition.
+
+
+
+
+
+
+
+
+
+
+
+ The SetBuildProperty task sets various properties for a build.
+
+
+
+
+
+
+
+
+ REQUIRED. Team Foundation Server URL.
+
+
+
+
+
+
+ REQUIRED. The URI for the build definition.
+
+
+
+
+
+
+ The build number.
+
+
+
+
+
+
+ The label name.
+
+
+
+
+
+
+ The Log Location.
+
+
+
+
+
+
+
+ The compilation status. Valid values are Succeeded, Failed and Unknown.
+
+
+
+
+
+
+
+
+
+
+
+
+
+ The drop location.
+
+
+
+
+
+
+ The build quality.
+
+
+
+
+
+
+ The build status. Valid values are NotStarted, InProgress, Succeeded, PartiallySucceeded, Failed, and Stopped.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ The test status. Valid values are Succeeded, Failed, and Unknown.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ The WorkspaceItemConverterTask task converts server items to local items and local items to server items.
+
+
+
+
+
+
+
+
+ REQUIRED. Team Foundation Server URL.
+
+
+
+
+
+
+ REQUIRED. The workspace name.
+
+
+
+
+
+
+ The workspace owner.
+
+
+
+
+
+
+ The server items that are converted to local items.
+
+
+
+
+
+
+ The local items that are converted to server items.
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Sql2005.dll b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Sql2005.dll
new file mode 100644
index 00000000..a139a189
Binary files /dev/null and b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Sql2005.dll differ
diff --git a/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Sql2005.pdb b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Sql2005.pdb
new file mode 100644
index 00000000..3dfad742
Binary files /dev/null and b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Sql2005.pdb differ
diff --git a/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Sql2005.xsd b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Sql2005.xsd
new file mode 100644
index 00000000..fc237743
--- /dev/null
+++ b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Sql2005.xsd
@@ -0,0 +1,72 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Sql2008.dll b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Sql2008.dll
new file mode 100644
index 00000000..f27b2d43
Binary files /dev/null and b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Sql2008.dll differ
diff --git a/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Sql2008.pdb b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Sql2008.pdb
new file mode 100644
index 00000000..08cdad1e
Binary files /dev/null and b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Sql2008.pdb differ
diff --git a/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Sql2008.xsd b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Sql2008.xsd
new file mode 100644
index 00000000..03eb5863
--- /dev/null
+++ b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Sql2008.xsd
@@ -0,0 +1,72 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.StyleCop.dll b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.StyleCop.dll
new file mode 100644
index 00000000..74317f96
Binary files /dev/null and b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.StyleCop.dll differ
diff --git a/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.StyleCop.pdb b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.StyleCop.pdb
new file mode 100644
index 00000000..1a943e4a
Binary files /dev/null and b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.StyleCop.pdb differ
diff --git a/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.StyleCop.xsd b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.StyleCop.xsd
new file mode 100644
index 00000000..04370bbf
--- /dev/null
+++ b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.StyleCop.xsd
@@ -0,0 +1,28 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Sync.dll b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Sync.dll
new file mode 100644
index 00000000..c3b6697b
Binary files /dev/null and b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Sync.dll differ
diff --git a/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Sync.pdb b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Sync.pdb
new file mode 100644
index 00000000..ff44ac1d
Binary files /dev/null and b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Sync.pdb differ
diff --git a/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Sync.xsd b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Sync.xsd
new file mode 100644
index 00000000..a6741604
--- /dev/null
+++ b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Sync.xsd
@@ -0,0 +1,30 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Tfs.dll b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Tfs.dll
new file mode 100644
index 00000000..6864378c
Binary files /dev/null and b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Tfs.dll differ
diff --git a/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Tfs.pdb b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Tfs.pdb
new file mode 100644
index 00000000..3a70e618
Binary files /dev/null and b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Tfs.pdb differ
diff --git a/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Tfs.xsd b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Tfs.xsd
new file mode 100644
index 00000000..eb37db21
--- /dev/null
+++ b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.Tfs.xsd
@@ -0,0 +1,46 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.VersionNumber.targets b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.VersionNumber.targets
new file mode 100644
index 00000000..a723d57b
--- /dev/null
+++ b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.VersionNumber.targets
@@ -0,0 +1,127 @@
+
+
+
+
+
+ 1
+ 0
+
+
+ DateString
+ MMdd
+ AutoIncrement
+ 00
+
+
+
+
+ 1
+ 0
+
+
+ DateString
+ MMdd
+ AutoIncrement
+ 00
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ false
+ false
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ $(CoreCompileDependsOn);
+ UpdateAssemblyInfoFiles
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.dll b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.dll
new file mode 100644
index 00000000..bc19d807
Binary files /dev/null and b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.dll differ
diff --git a/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.dll.config b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.dll.config
new file mode 100644
index 00000000..f4e14fa8
--- /dev/null
+++ b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.dll.config
@@ -0,0 +1,10 @@
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.pdb b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.pdb
new file mode 100644
index 00000000..ffd5a2a0
Binary files /dev/null and b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.pdb differ
diff --git a/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.tasks b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.tasks
new file mode 100644
index 00000000..4c1f2b9f
--- /dev/null
+++ b/build/MSBuild_Extension_Pack_3.5.3/MSBuild.ExtensionPack.tasks
@@ -0,0 +1,107 @@
+
+
+
+ $(MSBuildProjectDirectory)
+ $(BuildPath)\..\..\BuildBinaries\
+ $(MSBuildExtensionsPath)\ExtensionPack\
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/lib/FsCheck_0.6.1/Contributors.txt b/lib/FsCheck_0.6.1/Contributors.txt
new file mode 100644
index 00000000..70107632
--- /dev/null
+++ b/lib/FsCheck_0.6.1/Contributors.txt
@@ -0,0 +1,11 @@
+Contributors:
+Neil Mitchell (the first version of reflective generators and shrinker)
+Ganesh Sittampalam (various improvements and fixes in the property DSL)
+toyvo (Makefile for mono users)
+Steve Gilham (byte arbitrary instance)
+David Crocker (first version of replay mechanism, bug fix)
+(my sincerest apologies to anyone I overlooked - feel free to protest!)
+
+Thanks to:
+Howard Mansell and team from Credit Suisse, for taking the time to clear up legal stuff and donate code, and being enthusiastic early adopters :).
+Everyone that takes the time to report bugs or send feedback.
\ No newline at end of file
diff --git a/lib/FsCheck_0.6.1/FsCheck.XML b/lib/FsCheck_0.6.1/FsCheck.XML
new file mode 100644
index 00000000..4ee68309
--- /dev/null
+++ b/lib/FsCheck_0.6.1/FsCheck.XML
@@ -0,0 +1,1609 @@
+
+
+FsCheck
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Generates (), of the unit type.
+
+
+
+
+Genereate a 6-tuple.
+
+
+
+
+Genereate a 5-tuple.
+
+
+
+
+Genereate a 4-tuple.
+
+
+
+
+Genereate a 3-tuple.
+
+
+
+
+Genereate a 2-tuple.
+
+
+
+
+Generates arbitrary strings, which are lists of chars generated by Char.
+
+
+
+
+Generate an option value that is 'None' 1/4 of the time.
+
+
+
+
+Generate an object.
+
+
+
+
+Generate arbitrary int that is between -size and size.
+
+
+
+
+
+
+
+Generate a list of values. The size of the list is between 0 and the test size + 1.
+
+
+
+
+Generates arbitrary floats, NaN, NegativeInfinity, PositiveInfinity, Maxvalue, MinValue, Epsilon included fairly frequently.
+
+
+
+
+Generates arbitrary chars, between ASCII codes Char.MinValue and 127.
+
+
+
+
+
+
+
+Generates arbitrary bytes.
+
+
+
+
+Generates arbitrary bools.
+
+
+
+
+Generate a function value.
+
+
+
+
+
+
+
+
+
+
+A collection of default generators.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Executes the command on the model of the object.
+
+
+
+
+Excecutes the command on the actual object under test.
+
+
+
+
+Precondition for execution of the command.
+
+
+
+
+
+
+
+Postcondition that must hold after execution of the command.
+
+
+
+
+
+
+
+
+
+
+A single command describes pre and post conditions and the model for a single method under test.
+
+
+
+
+Initial state of both object and model.
+
+
+
+
+Generate a number of possible commands based on the current state of the model. The commands
+are just hints to speed up execution; preconditions are still checked.
+
+
+
+
+A specification for an object under test, based on an abstract model of the
+object's behavior.
+
+
+
+
+Turn a specification into a property.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Returns a generator for 'a.
+
+
+
+
+Returns a sequence of the immediate shrinks of the given value. The immediate shrinks should not include
+doubles or the given value itself. The default implementation returns the empty sequence (i.e. no shrinking).
+
+
+
+
+
+
+
+
+
+
+
+
+
+Returns a generator transformer for 'a. Necessary to generate functions with 'a as domain. Fails by
+default if it is not overridden.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+The workflow type for generators.
+
+
+
+
+map the given function to the value in the generator, yielding a new generator of the result type.
+
+
+
+
+
+
+
+Generator of a random value, based on a size parameter and a randomly generated int.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Returns a Gen<'a>
+
+
+
+
+Generates an integer between l and h, inclusive.
+Note to QuickCheck users: this function is more general in QuickCheck, generating a Random a.
+
+
+
+
+Returns a generator transformer for the given value, aka a coarbitrary function.
+
+
+
+
+Always generate v.
+
+
+
+
+Build a generator that randomly generates one of the values in the given non-empty list.
+
+
+
+
+Apply ('map') the function f on the value in the generator, yielding a new generator.
+
+
+
+
+Build a generator that generates a 4-tuple of the values generated by the given generator.
+
+
+
+
+Build a generator that generates a value from one of the generators in the given non-empty list, with
+given probabilities. The sum of the probabilities must be larger than zero.
+
+
+
+
+The workflow function for generators, e.g. gen { ... }
+
+
+
+
+Generates a value out of the generator with maximum size n.
+
+
+
+
+
+
+
+
+
+
+
+
+
+Lift the given function over values to a function over generators of those values.
+
+
+
+
+Lift the given function over values to a function over generators of those values.
+
+
+
+
+Lift the given function over values to a function over generators of those values.
+
+
+
+
+Lift the given function over values to a function over generators of those values.
+
+
+
+
+Lift the given function over values to a function over generators of those values.
+
+
+
+
+Lift the given function over values to a function over generators of those values.
+
+
+
+
+ Generates a list of random length. The maximum length depends on the
+ size parameter.
+
+
+
+
+ Generates a non-empty list of random length. The maximum length
+ depends on the size parameter.
+
+
+
+
+Build a generator that generates a value from one of the generators in the given non-empty list, with
+equal probability.
+
+
+
+
+Register the generators that are static members of the type argument, overwriting any existing generators.
+
+
+
+
+Register the generators that are static members of the given type, overwriting any existing generators.
+
+
+
+
+Promote the given function f to a function generator.
+
+
+
+
+Default generator that generates a random number generator. Useful for starting off the process
+of generating a random value.
+
+
+
+
+Register the generators that are static members of the type argument.
+
+
+
+
+Register the generators that are static members of the given type.
+
+
+
+
+Override the current size of the test. resize n g invokes generator g with size parameter n.
+
+
+
+
+Sequence the given list of generators into a generator of a list.
+Note to QuickCheck users: this is monadic sequence, which cannot be expressed generally in F#.
+
+
+
+
+Returns the immediate shrinks for the given value.
+
+
+
+
+Obtain the current size. sized g calls g, passing it the current size as a parameter.
+
+
+
+
+Generates a value that satisfies a predicate. Contrary to suchThatOption, this function keeps re-trying
+by increasing the size of the original generator ad infinitum. Make sure there is a high chance that
+the predicate is satisfied.
+Note to QuickCheck users: order of arguments wrt QuickCheck is reversed, to make piping easier.
+
+
+
+
+Tries to generate a value that satisfies a predicate. This function 'gives up' by generating None
+if the given original generator did not generate any values that satisfied the predicate, after trying to
+get values from by increasing its size.
+Note to QuickCheck users: order of arguments wrt QuickCheck is reversed, to make piping easier.
+
+
+
+
+Build a generator that generates a 3-tuple of the values generated by the given generator.
+
+
+
+
+Build a generator that generates a 2-tuple of the values generated by the given generator.
+
+
+
+
+Basic co-arbitrary generator transformer, which is dependent on an int.
+
+
+
+
+Generates a list of given length, containing values generated by the given generator.
+vector g n generates a list of n t's, if t is the type that g generates.
+
+
+
+
+Generates a list of given length, containing values generated by the given generator.
+Identical to vector, but with arguments reversed so it is consistent with listOf and nonEmptyListOf.
+
+
+
+
+
+
+
+ determines for which OUtcome the result should be shrunk, or shrinking should continue.
+
+
+
+
+
+
+
+Type synonym for a test result generator.
+
+
+
+
+
+
+
+Returns a new result that is Succeeded if and only if both this
+and the given Result are Succeeded.
+
+
+
+
+The result of one execution of a property.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Classify test cases combinator. Test cases satisfying the condition are assigned the classification given.
+
+
+
+
+Collect data values property combinator. The argument of collect is evaluated in each test case,
+and the distribution of values is reported, using any_to_string.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Quantified property combinator. Provide a custom test data generator to a property.
+
+
+
+
+Quantified property combinator. Provide a custom test data generator to a property.
+Shrink failing test cases using the given shrink function.
+
+
+
+
+
+
+
+
+
+
+Add the given label to the property. The labels of a failing sub-property are displayed when it fails.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Add the given label to the property. label on the left hand side, property on the right.
+
+
+
+
+Add the given label to the property. Property on the left hand side, label on the right.
+
+
+
+
+Construct a property that succeeds if both succeed. (cfr 'and')
+
+
+
+
+Construct a property that fails if both fail. (cfr 'or')
+
+
+
+
+Conditional property combinator. Resulting property holds if the property after ==> holds whenever the condition does.
+
+
+
+
+
+
+
+Property constructor. Constructs a property from a bool.
+
+
+
+
+
+
+
+Lazy property constructor. Constructs a property from a Lazy.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Property combinator to shrink an original value x using the shrinking function shrink:'a -> #seq<'a>, and the testable
+function pf.
+
+
+
+
+
+
+
+
+
+
+Expect exception 't when executing p. So, results in success if an exception of the given type is thrown,
+and a failure otherwise.
+
+
+
+
+
+
+
+Count trivial cases property combinator. Test cases for which the condition is True are classified as trivial.
+
+
+
+
+Fails the property if it does not complete within t milliseconds. Note that the called property gets a
+cancel signal, but whether it responds to that is up to the property; the execution may not actually stop.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Equality for generic types
+
+
+
+
+ Get constructor for record type
+
+
+
+
+ Get information on the fields of a record type
+
+
+
+
+ Get reader for record type
+
+
+
+
+ Returns the case name, type, and functions that will construct a constructor and a reader of a union type respectively
+
+
+
+
+ Get reader for union case name (aka tag)
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Builds a generator for the given type based on reflection. Currently works for record and union types.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+For configuring a run.
+
+
+
+
+Called on a succesful shrink.
+
+
+
+
+Called whenever all tests are done, either True, False or Exhausted.
+
+
+
+
+Called whenever arguments are generated and after the test is run.
+
+
+
+
+For implementing your own test runner.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Check the given property p using the given Config.
+
+
+
+
+Check all public static methods on the given type that have a Testable return type(this includes let-bound functions in a module)
+
+
+
+
+
+
+
+
+
+
+A runner that simply prints results to the console.
+
+
+
+
+
+
+
+Force this value to do the necessary initializations of typeclasses. Normally this initialization happens automatically.
+In any case, it can be forced any number of times without problem.
+
+
+
+
+
+
+
+The quick configuration only prints a summary result at the end of the test.
+
+
+
+
+Check with the configuration 'quick'.
+
+
+
+
+Check all public static methods on the given type that have a Testable return type with configuration 'quick'
+
+
+
+
+Check with the configuration 'quick', and using the given name.
+
+
+
+
+
+
+
+
+
+
+
+
+
+A function that returns the default string that is printed as a result of the test.
+
+
+
+
+
+
+
+
+
+
+The verbose configuration prints each generated argument.
+
+
+
+
+Check with the configuration 'verbose'.
+
+
+
+
+ Check all public static methods on the given type that have a Testable return type with configuration 'verbose'
+
+
+
+
+Check with the configuration 'verbose', and using the given name.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Get the typeclass instance from the given typeclass and instance type.
+
+
+
+
+Define a new typeclass of the given (generic) type. The methods on this class are the ones that will be associated with
+its generic type.
+
+
+
+
+Register instances in a given class as instances of the given type class, overwriting any existing instances.
+
+
+
+
+Register instances in a given class as instances of the given type class, overwriting any existing instances.
+
+
+
+
+Register instances in a given class as instances of the given type class.
+
+
+
+
+Register instances in a given class as instances of the given type class.
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/lib/FsCheck_0.6.1/FsCheck.dll b/lib/FsCheck_0.6.1/FsCheck.dll
new file mode 100644
index 00000000..8d407103
Binary files /dev/null and b/lib/FsCheck_0.6.1/FsCheck.dll differ
diff --git a/lib/FsCheck_0.6.1/FsCheck.pdb b/lib/FsCheck_0.6.1/FsCheck.pdb
new file mode 100644
index 00000000..8ddc3615
Binary files /dev/null and b/lib/FsCheck_0.6.1/FsCheck.pdb differ
diff --git a/lib/FsCheck_0.6.1/License.txt b/lib/FsCheck_0.6.1/License.txt
new file mode 100644
index 00000000..c0cea5c2
--- /dev/null
+++ b/lib/FsCheck_0.6.1/License.txt
@@ -0,0 +1,12 @@
+Copyright (c) 2008-2009, Kurt Schelfthout
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+
+* Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+
+* Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+
+* Neither the name of Kurt Schelfthout nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
\ No newline at end of file
diff --git a/lib/Gallio_3.0.6.787/ASL - Apache Software Foundation License.txt b/lib/Gallio_3.0.6.787/ASL - Apache Software Foundation License.txt
new file mode 100644
index 00000000..e259b584
--- /dev/null
+++ b/lib/Gallio_3.0.6.787/ASL - Apache Software Foundation License.txt
@@ -0,0 +1,57 @@
+Apache License, Version 2.0
+
+Apache License
+Version 2.0, January 2004
+http://www.apache.org/licenses/
+
+TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+1. Definitions.
+
+"License" shall mean the terms and conditions for use, reproduction, and distribution as defined by Sections 1 through 9 of this document.
+
+"Licensor" shall mean the copyright owner or entity authorized by the copyright owner that is granting the License.
+
+"Legal Entity" shall mean the union of the acting entity and all other entities that control, are controlled by, or are under common control with that entity. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
+
+"You" (or "Your") shall mean an individual or Legal Entity exercising permissions granted by this License.
+
+"Source" form shall mean the preferred form for making modifications, including but not limited to software source code, documentation source, and configuration files.
+
+"Object" form shall mean any form resulting from mechanical transformation or translation of a Source form, including but not limited to compiled object code, generated documentation, and conversions to other media types.
+
+"Work" shall mean the work of authorship, whether in Source or Object form, made available under the License, as indicated by a copyright notice that is included in or attached to the work (an example is provided in the Appendix below).
+
+"Derivative Works" shall mean any work, whether in Source or Object form, that is based on (or derived from) the Work and for which the editorial revisions, annotations, elaborations, or other modifications represent, as a whole, an original work of authorship. For the purposes of this License, Derivative Works shall not include works that remain separable from, or merely link (or bind by name) to the interfaces of, the Work and Derivative Works thereof.
+
+"Contribution" shall mean any work of authorship, including the original version of the Work and any modifications or additions to that Work or Derivative Works thereof, that is intentionally submitted to Licensor for inclusion in the Work by the copyright owner or by an individual or Legal Entity authorized to submit on behalf of the copyright owner. For the purposes of this definition, "submitted" means any form of electronic, verbal, or written communication sent to the Licensor or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, the Licensor for the purpose of discussing and improving the Work, but excluding communication that is conspicuously marked or otherwise designated in writing by the copyright owner as "Not a Contribution."
+
+"Contributor" shall mean Licensor and any individual or Legal Entity on behalf of whom a Contribution has been received by Licensor and subsequently incorporated within the Work.
+
+2. Grant of Copyright License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare Derivative Works of, publicly display, publicly perform, sublicense, and distribute the Work and such Derivative Works in Source or Object form.
+
+3. Grant of Patent License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s) with the Work to which such Contribution(s) was submitted. If You institute patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Work or a Contribution incorporated within the Work constitutes direct or contributory patent infringement, then any patent licenses granted to You under this License for that Work shall terminate as of the date such litigation is filed.
+
+4. Redistribution. You may reproduce and distribute copies of the Work or Derivative Works thereof in any medium, with or without modifications, and in Source or Object form, provided that You meet the following conditions:
+
+ 1. You must give any other recipients of the Work or Derivative Works a copy of this License; and
+
+ 2. You must cause any modified files to carry prominent notices stating that You changed the files; and
+
+ 3. You must retain, in the Source form of any Derivative Works that You distribute, all copyright, patent, trademark, and attribution notices from the Source form of the Work, excluding those notices that do not pertain to any part of the Derivative Works; and
+
+ 4. If the Work includes a "NOTICE" text file as part of its distribution, then any Derivative Works that You distribute must include a readable copy of the attribution notices contained within such NOTICE file, excluding those notices that do not pertain to any part of the Derivative Works, in at least one of the following places: within a NOTICE text file distributed as part of the Derivative Works; within the Source form or documentation, if provided along with the Derivative Works; or, within a display generated by the Derivative Works, if and wherever such third-party notices normally appear. The contents of the NOTICE file are for informational purposes only and do not modify the License. You may add Your own attribution notices within Derivative Works that You distribute, alongside or as an addendum to the NOTICE text from the Work, provided that such additional attribution notices cannot be construed as modifying the License.
+
+You may add Your own copyright statement to Your modifications and may provide additional or different license terms and conditions for use, reproduction, or distribution of Your modifications, or for any such Derivative Works as a whole, provided Your use, reproduction, and distribution of the Work otherwise complies with the conditions stated in this License.
+
+5. Submission of Contributions. Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Work by You to the Licensor shall be under the terms and conditions of this License, without any additional terms or conditions. Notwithstanding the above, nothing herein shall supersede or modify the terms of any separate license agreement you may have executed with Licensor regarding such Contributions.
+
+6. Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor, except as required for reasonable and customary use in describing the origin of the Work and reproducing the content of the NOTICE file.
+
+7. Disclaimer of Warranty. Unless required by applicable law or agreed to in writing, Licensor provides the Work (and each Contributor provides its Contributions) on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are solely responsible for determining the appropriateness of using or redistributing the Work and assume any risks associated with Your exercise of permissions under this License.
+
+8. Limitation of Liability. In no event and under no legal theory, whether in tort (including negligence), contract, or otherwise, unless required by applicable law (such as deliberate and grossly negligent acts) or agreed to in writing, shall any Contributor be liable to You for damages, including any direct, indirect, special, incidental, or consequential damages of any character arising as a result of this License or out of the use or inability to use the Work (including but not limited to damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses), even if such Contributor has been advised of the possibility of such damages.
+
+9. Accepting Warranty or Additional Liability. While redistributing the Work or Derivative Works thereof, You may choose to offer, and charge a fee for, acceptance of support, warranty, indemnity, or other liability obligations and/or rights consistent with this License. However, in accepting such obligations, You may act only on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability.
+
+END OF TERMS AND CONDITIONS
diff --git a/lib/Gallio_3.0.6.787/Cecil.FlowAnalysis.license.html b/lib/Gallio_3.0.6.787/Cecil.FlowAnalysis.license.html
new file mode 100644
index 00000000..d7d78ce5
--- /dev/null
+++ b/lib/Gallio_3.0.6.787/Cecil.FlowAnalysis.license.html
@@ -0,0 +1,37 @@
+
+
+Cecil.FlowAnalysis.license
+
+
+
+
+ (C) 2005-2006 db4objects, Inc. http://www.db4o.com
+
+
+ Permission is hereby granted, free of charge, to any person obtaining a copy of
+ this software and associated documentation files (the "Software"), to deal in the
+ Software without restriction, including without limitation the rights to use, copy,
+ modify, merge, publish, distribute, sublicense, and/or sell copies of the Software,
+ and to permit persons to whom the Software is furnished to do so, subject to the
+ following conditions:
+
+
+ The above copyright notice and this permission notice shall be included in all copies
+ or substantial portions of the Software.
+
+
+ THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,
+ INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR
+ PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
+ BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+ TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
+ USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+
+
\ No newline at end of file
diff --git a/lib/Gallio_3.0.6.787/Credits.html b/lib/Gallio_3.0.6.787/Credits.html
new file mode 100644
index 00000000..d43c7ef0
--- /dev/null
+++ b/lib/Gallio_3.0.6.787/Credits.html
@@ -0,0 +1,83 @@
+
+Credits
+
+
+Many people have donated their creativity, insight, time and effort
+to the Gallio and MbUnit projects.
+
+We would like to take a moment to recognize and thank these individuals.
+
+
Contributors
+
+These people have contributed directly to this project as developers,
+writers, editors, leaders, and promoters.
+
+We thank them all for their careful attention to detail and work
+in pursuit of excellence.
+
+These people have contributed indirectly to this project as peers,
+users, reviewers, bug reporters, friends and family.
+
+We thank them all for their ideas, support and constructive criticism.
+
+
+
Brad Wilson, co-creator of xUnit.Net
+
Cathal Connolly, patches
+
Charlie Poole, lead of NUnit
+
Damir Gorenman, tester
+
Elizabeth Hanelt, spouse
+
Ilya Ryzhenkov, developer at JetBrains
+
James Newkirk, co-creator of xUnit.Net
+
Jamie Cansdale, creator of TestDriven.Net
+
Jay Flowers, creator of CI Factory
+
Jeroen van Menen, creator of WatiN
+
Joe O'Campo, co-creator of NBehave
+
Lior Friedman, developer at JetBrains
+
Manfred Lange, creator of CSUnit
+
Matthew Podwysocki, blogger
+
Oren "Ayende" Eini, blogger
+
Phil Haack, patches
+
Ray Johnson, employer
+
Roy Osherove, blogger
+
Santosh Kumar Gottipamula, tester
+
Todd Menier, patches
+
Tomas Chaloupka, patches
+
+
+
Final Thanks
+
+In addition to these fine people, there are always countless others whose
+efforts directly or indirectly supported this project. They produced
+the tools we use, invented the ideas we borrowed, and offered a kind word
+in a time of need.
+
+We thank them all.
+
+If you are one of these people and your name does not appear on this list,
+please let us know and we shall update it.
+
+
+
diff --git a/lib/Gallio_3.0.6.787/Gallio License.txt b/lib/Gallio_3.0.6.787/Gallio License.txt
new file mode 100644
index 00000000..3d41c893
--- /dev/null
+++ b/lib/Gallio_3.0.6.787/Gallio License.txt
@@ -0,0 +1,14 @@
+Copyright 2005-2009 Gallio Project - http://www.gallio.org/
+Portions Copyright 2000-2004 Jonathan de Halleux
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file except in compliance with the License.
+You may obtain a copy of the License at
+
+ http://www.apache.org/licenses/LICENSE-2.0
+
+Unless required by applicable law or agreed to in writing, software
+distributed under the License is distributed on an "AS IS" BASIS,
+WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+See the License for the specific language governing permissions and
+limitations under the License.
diff --git a/lib/Gallio_3.0.6.787/Gallio Website.url b/lib/Gallio_3.0.6.787/Gallio Website.url
new file mode 100644
index 00000000..f488e52a
--- /dev/null
+++ b/lib/Gallio_3.0.6.787/Gallio Website.url
@@ -0,0 +1,8 @@
+[InternetShortcut]
+URL=http://www.gallio.org/
+IDList=
+IconFile=http://www.mbunit.com/favicon.ico
+IconIndex=1
+HotKey=0
+[{000214A0-0000-0000-C000-000000000046}]
+Prop3=19,2
diff --git a/lib/Gallio_3.0.6.787/MbUnit Website.url b/lib/Gallio_3.0.6.787/MbUnit Website.url
new file mode 100644
index 00000000..6f2b4e28
--- /dev/null
+++ b/lib/Gallio_3.0.6.787/MbUnit Website.url
@@ -0,0 +1,8 @@
+[InternetShortcut]
+URL=http://www.mbunit.com/
+IDList=
+IconFile=http://www.mbunit.com/favicon.ico
+IconIndex=1
+HotKey=0
+[{000214A0-0000-0000-C000-000000000046}]
+Prop3=19,2
diff --git a/lib/Gallio_3.0.6.787/Mono.Cecil.license.html b/lib/Gallio_3.0.6.787/Mono.Cecil.license.html
new file mode 100644
index 00000000..8025bbaf
--- /dev/null
+++ b/lib/Gallio_3.0.6.787/Mono.Cecil.license.html
@@ -0,0 +1,36 @@
+
+
+Mono.Cecil.license
+
+
+
+
+ (C) 2004-2006 Jb Evain
+
+
+ Permission is hereby granted, free of charge, to any person obtaining a copy of
+ this software and associated documentation files (the "Software"), to deal in the
+ Software without restriction, including without limitation the rights to use, copy,
+ modify, merge, publish, distribute, sublicense, and/or sell copies of the Software,
+ and to permit persons to whom the Software is furnished to do so, subject to the
+ following conditions:
+
+
+ The above copyright notice and this permission notice shall be included in all copies
+ or substantial portions of the Software.
+
+
+ THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,
+ INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR
+ PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
+ BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+ TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
+ USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+
\ No newline at end of file
diff --git a/lib/Gallio_3.0.6.787/Mono.GetOptions.license.html b/lib/Gallio_3.0.6.787/Mono.GetOptions.license.html
new file mode 100644
index 00000000..22c56b31
--- /dev/null
+++ b/lib/Gallio_3.0.6.787/Mono.GetOptions.license.html
@@ -0,0 +1,38 @@
+
+
+Mono.GetOptions.license
+
+
+
+
+ Permission is hereby granted, free of charge, to any person obtaining a copy of
+ this software and associated documentation files (the "Software"), to deal in the
+ Software without restriction, including without limitation the rights to use, copy,
+ modify, merge, publish, distribute, sublicense, and/or sell copies of the Software,
+ and to permit persons to whom the Software is furnished to do so, subject to the
+ following conditions:
+
+
+ The above copyright notice and this permission notice shall be included in all copies
+ or substantial portions of the Software.
+
+
+ THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,
+ INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR
+ PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
+ BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+ TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
+ USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+
+
\ No newline at end of file
diff --git a/lib/Gallio_3.0.6.787/db4o.license.html b/lib/Gallio_3.0.6.787/db4o.license.html
new file mode 100644
index 00000000..a38d4052
--- /dev/null
+++ b/lib/Gallio_3.0.6.787/db4o.license.html
@@ -0,0 +1,384 @@
+
+
+GNU GENERAL PUBLIC LICENSE
+
+
+
+
+ GNU GENERAL PUBLIC LICENSE
+
+
+ Version 2, June 1991
+
+ Copyright (C) 1989, 1991 Free Software Foundation, Inc.
+
+ 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+
+ Everyone is permitted to copy and distribute verbatim copies of this license document,
+ but changing it is not allowed.
+
+
+
+ Preamble
+
+ The licenses for most software are designed to take away your freedom to share and
+ change it. By contrast, the GNU General Public License is intended to guarantee
+ your freedom to share and change free software--to make sure the software is free
+ for all its users. This General Public License applies to most of the Free Software
+ Foundation's software and to any other program whose authors commit to using it.
+ (Some other Free Software Foundation software is covered by the GNU Library General
+ Public License instead.) You can apply it to your programs, too.
+
+
+
+ When we speak of free software, we are referring to freedom, not price. Our General
+ Public Licenses are designed to make sure that you have the freedom to distribute
+ copies of free software (and charge for this service if you wish), that you receive
+ source code or can get it if you want it, that you can change the software or use
+ pieces of it in new free programs; and that you know you can do these things.
+
+
+
+ To protect your rights, we need to make restrictions that forbid anyone to deny
+ you these rights or to ask you to surrender the rights. These restrictions translate
+ to certain responsibilities for you if you distribute copies of the software, or
+ if you modify it.
+
+
+ For example, if you distribute copies of such a program, whether gratis or for a
+ fee, you must give the recipients all the rights that you have. You must make sure
+ that they, too, receive or can get the source code. And you must show them these
+ terms so they know their rights.
+
+
+ We protect your rights with two steps: (1) copyright the software, and (2) offer
+ you this license which gives you legal permission to copy, distribute and/or modify
+ the software.
+
+
+ Also, for each author's protection and ours, we want to make certain that everyone
+ understands that there is no warranty for this free software. If the software is
+ modified by someone else and passed on, we want its recipients to know that what
+ they have is not the original, so that any problems introduced by others will not
+ reflect on the original authors' reputations.
+
+
+ Finally, any free program is threatened constantly by software patents. We wish
+ to avoid the danger that redistributors of a free program will individually obtain
+ patent licenses, in effect making the program proprietary. To prevent this, we have
+ made it clear that any patent must be licensed for everyone's free use or not licensed
+ at all.
+
+
+ The precise terms and conditions for copying, distribution and modification follow.
+
+
+
+ GNU GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+
+ 0. This License applies to any program or other work which contains a notice placed
+ by the copyright holder saying it may be distributed under the terms of this General
+ Public License. The "Program", below, refers to any such program or work, and a
+ "work based on the Program" means either the Program or any derivative work under
+ copyright law: that is to say, a work containing the Program or a portion of it,
+ either verbatim or with modifications and/or translated into another language. (Hereinafter,
+ translation is included without limitation in the term "modification".) Each licensee
+ is addressed as "you".
+
+
+ Activities other than copying, distribution and modification are not covered by
+ this License; they are outside its scope. The act of running the Program is not
+ restricted, and the output from the Program is covered only if its contents constitute
+ a work based on the Program (independent of having been made by running the Program).
+ Whether that is true depends on what the Program does.
+
+
+ 1. You may copy and distribute verbatim copies of the Program's source code as you
+ receive it, in any medium, provided that you conspicuously and appropriately publish
+ on each copy an appropriate copyright notice and disclaimer of warranty; keep intact
+ all the notices that refer to this License and to the absence of any warranty; and
+ give any other recipients of the Program a copy of this License along with the Program.
+
+
+ You may charge a fee for the physical act of transferring a copy, and you may at
+ your option offer warranty protection in exchange for a fee.
+
+
+ 2. You may modify your copy or copies of the Program or any portion of it, thus
+ forming a work based on the Program, and copy and distribute such modifications
+ or work under the terms of Section 1 above, provided that you also meet all of these
+ conditions:
+
+ a) You must cause the modified files to carry prominent notices stating that you
+ changed the files and the date of any change.
+
+ b) You must cause any work that you distribute or publish, that in whole or in part
+ contains or is derived from the Program or any part thereof, to be licensed as a
+ whole at no charge to all third parties under the terms of this License.
+
+ c) If the modified program normally reads commands interactively when run, you must
+ cause it, when started running for such interactive use in the most ordinary way,
+ to print or display an announcement including an appropriate copyright notice and
+ a notice that there is no warranty (or else, saying that you provide a warranty)
+ and that users may redistribute the program under these conditions, and telling
+ the user how to view a copy of this License. (Exception: if the Program itself is
+ interactive but does not normally print such an announcement, your work based on
+ the Program is not required to print an announcement.)
+
+
+ These requirements apply to the modified work as a whole. If identifiable sections
+ of that work are not derived from the Program, and can be reasonably considered
+ independent and separate works in themselves, then this License, and its terms,
+ do not apply to those sections when you distribute them as separate works. But when
+ you distribute the same sections as part of a whole which is a work based on the
+ Program, the distribution of the whole must be on the terms of this License, whose
+ permissions for other licensees extend to the entire whole, and thus to each and
+ every part regardless of who wrote it.
+
+
+ Thus, it is not the intent of this section to claim rights or contest your rights
+ to work written entirely by you; rather, the intent is to exercise the right to
+ control the distribution of derivative or collective works based on the Program.
+
+
+ In addition, mere aggregation of another work not based on the Program with the
+ Program (or with a work based on the Program) on a volume of a storage or distribution
+ medium does not bring the other work under the scope of this License.
+
+
+ 3. You may copy and distribute the Program (or a work based on it, under Section
+ 2) in object code or executable form under the terms of Sections 1 and 2 above provided
+ that you also do one of the following:
+
+ a) Accompany it with the complete corresponding machine-readable source code, which
+ must be distributed under the terms of Sections 1 and 2 above on a medium customarily
+ used for software interchange; or,
+
+ b) Accompany it with a written offer, valid for at least three years, to give any
+ third party, for a charge no more than your cost of physically performing source
+ distribution, a complete machine-readable copy of the corresponding source code,
+ to be distributed under the terms of Sections 1 and 2 above on a medium customarily
+ used for software interchange; or,
+
+ c) Accompany it with the information you received as to the offer to distribute
+ corresponding source code. (This alternative is allowed only for noncommercial distribution
+ and only if you received the program in object code or executable form with such
+ an offer, in accord with Subsection b above.)
+
+
+ The source code for a work means the preferred form of the work for making modifications
+ to it. For an executable work, complete source code means all the source code for
+ all modules it contains, plus any associated interface definition files, plus the
+ scripts used to control compilation and installation of the executable. However,
+ as a special exception, the source code distributed need not include anything that
+ is normally distributed (in either source or binary form) with the major components
+ (compiler, kernel, and so on) of the operating system on which the executable runs,
+ unless that component itself accompanies the executable.
+
+
+ If distribution of executable or object code is made by offering access to copy
+ from a designated place, then offering equivalent access to copy the source code
+ from the same place counts as distribution of the source code, even though third
+ parties are not compelled to copy the source along with the object code.
+
+
+ 4. You may not copy, modify, sublicense, or distribute the Program except as expressly
+ provided under this License. Any attempt otherwise to copy, modify, sublicense or
+ distribute the Program is void, and will automatically terminate your rights under
+ this License. However, parties who have received copies, or rights, from you under
+ this License will not have their licenses terminated so long as such parties remain
+ in full compliance.
+
+
+ 5. You are not required to accept this License, since you have not signed it. However,
+ nothing else grants you permission to modify or distribute the Program or its derivative
+ works. These actions are prohibited by law if you do not accept this License. Therefore,
+ by modifying or distributing the Program (or any work based on the Program), you
+ indicate your acceptance of this License to do so, and all its terms and conditions
+ for copying, distributing or modifying the Program or works based on it.
+
+
+ 6. Each time you redistribute the Program (or any work based on the Program), the
+ recipient automatically receives a license from the original licensor to copy, distribute
+ or modify the Program subject to these terms and conditions. You may not impose
+ any further restrictions on the recipients' exercise of the rights granted herein.
+ You are not responsible for enforcing compliance by third parties to this License.
+
+
+ 7. If, as a consequence of a court judgment or allegation of patent infringement
+ or for any other reason (not limited to patent issues), conditions are imposed on
+ you (whether by court order, agreement or otherwise) that contradict the conditions
+ of this License, they do not excuse you from the conditions of this License. If
+ you cannot distribute so as to satisfy simultaneously your obligations under this
+ License and any other pertinent obligations, then as a consequence you may not distribute
+ the Program at all. For example, if a patent license would not permit royalty-free
+ redistribution of the Program by all those who receive copies directly or indirectly
+ through you, then the only way you could satisfy both it and this License would
+ be to refrain entirely from distribution of the Program.
+
+
+ If any portion of this section is held invalid or unenforceable under any particular
+ circumstance, the balance of the section is intended to apply and the section as
+ a whole is intended to apply in other circumstances.
+
+
+ It is not the purpose of this section to induce you to infringe any patents or other
+ property right claims or to contest validity of any such claims; this section has
+ the sole purpose of protecting the integrity of the free software distribution system,
+ which is implemented by public license practices. Many people have made generous
+ contributions to the wide range of software distributed through that system in reliance
+ on consistent application of that system; it is up to the author/donor to decide
+ if he or she is willing to distribute software through any other system and a licensee
+ cannot impose that choice.
+
+
+ This section is intended to make thoroughly clear what is believed to be a consequence
+ of the rest of this License.
+
+
+ 8. If the distribution and/or use of the Program is restricted in certain countries
+ either by patents or by copyrighted interfaces, the original copyright holder who
+ places the Program under this License may add an explicit geographical distribution
+ limitation excluding those countries, so that distribution is permitted only in
+ or among countries not thus excluded. In such case, this License incorporates the
+ limitation as if written in the body of this License.
+
+
+ 9. The Free Software Foundation may publish revised and/or new versions of the General
+ Public License from time to time. Such new versions will be similar in spirit to
+ the present version, but may differ in detail to address new problems or concerns.
+
+
+ Each version is given a distinguishing version number. If the Program specifies
+ a version number of this License which applies to it and "any later version", you
+ have the option of following the terms and conditions either of that version or
+ of any later version published by the Free Software Foundation. If the Program does
+ not specify a version number of this License, you may choose any version ever published
+ by the Free Software Foundation.
+
+
+ 10. If you wish to incorporate parts of the Program into other free programs whose
+ distribution conditions are different, write to the author to ask for permission.
+ For software which is copyrighted by the Free Software Foundation, write to the
+ Free Software Foundation; we sometimes make exceptions for this. Our decision will
+ be guided by the two goals of preserving the free status of all derivatives of our
+ free software and of promoting the sharing and reuse of software generally.
+
+
+ NO WARRANTY
+
+
+ 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE
+ PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED
+ IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS"
+ WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED
+ TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
+ THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD
+ THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR
+ OR CORRECTION.
+
+
+ 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY
+ COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE PROGRAM
+ AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL,
+ INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE
+ PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE
+ OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE
+ WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF
+ THE POSSIBILITY OF SUCH DAMAGES.
+
+
+ END OF TERMS AND CONDITIONS
+
+
+ How to Apply These Terms to Your New Programs
+
+
+ If you develop a new program, and you want it to be of the greatest possible use
+ to the public, the best way to achieve this is to make it free software which everyone
+ can redistribute and change under these terms.
+
+
+ To do so, attach the following notices to the program. It is safest to attach them
+ to the start of each source file to most effectively convey the exclusion of warranty;
+ and each file should have at least the "copyright" line and a pointer to where the
+ full notice is found.
+
+
+ <one line to give the program's name and a brief idea of what it does.>
+
+ Copyright (C) <year> <name of author>
+
+
+
+ This program is free software; you can redistribute it and/or modify it under the
+ terms of the GNU General Public License as published by the Free Software Foundation;
+ either version 2 of the License, or (at your option) any later version.
+
+
+ This program
+ is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without
+ even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
+ See the GNU General Public License for more details.
+
+
+ You should have received a
+ copy of the GNU General Public License along with this program; if not, write to
+ the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
+ USA
+
+
+ Also add information on how to contact you by electronic and paper mail.
+
+
+ If
+ the program is interactive, make it output a short notice like this when it starts
+ in an interactive mode:
+
+
+ Gnomovision version 69, Copyright (C) year name of author
+
+ Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+ This is
+ free software, and you are welcome to redistribute it under certain conditions;
+ type `show c' for details.
+
+
+ The hypothetical commands `show w' and `show c' should
+ show the appropriate parts of the General Public License. Of course, the commands
+ you use may be called something other than `show w' and `show c'; they could even
+ be mouse-clicks or menu items
+ -whatever suits your program.
+
+
+ You should also get
+ your employer (if you work as a programmer) or your school, if any, to sign a "copyright
+ disclaimer" for the program, if necessary. Here is a sample; alter the names:
+
+
+
+
+ Yoyodyne,
+ Inc., hereby disclaims all copyright interest in the program `Gnomovision' (which
+ makes passes at compilers) written by James Hacker.
+
+ <signature of Ty Coon>,
+ 1 April 1989 Ty Coon, President of Vice
+
+
+
+ This General Public License does not permit
+ incorporating your program into proprietary programs. If your program is a subroutine
+ library, you may consider it more useful to permit linking proprietary applications
+ with the library. If this is what you want to do, use the GNU Library General Public
+ License instead of this License.
+
+
+
\ No newline at end of file
diff --git a/lib/Gallio_3.0.6.787/docs/Gallio.chm b/lib/Gallio_3.0.6.787/docs/Gallio.chm
new file mode 100644
index 00000000..d9781060
Binary files /dev/null and b/lib/Gallio_3.0.6.787/docs/Gallio.chm differ
diff --git a/lib/Gallio_3.0.6.787/docs/Samples/Gallio/EasyTest/EasyTest Sample Readme.txt b/lib/Gallio_3.0.6.787/docs/Samples/Gallio/EasyTest/EasyTest Sample Readme.txt
new file mode 100644
index 00000000..d5a4ee89
--- /dev/null
+++ b/lib/Gallio_3.0.6.787/docs/Samples/Gallio/EasyTest/EasyTest Sample Readme.txt
@@ -0,0 +1,8 @@
+EasyTest Sample
+===============
+
+This sample illustrates the process of creating a new test framework
+using Gallio.
+
+For more information about this sample, please refer to the
+"Creating a Test Framework" chapter in the Gallio book.
diff --git a/lib/Gallio_3.0.6.787/docs/vs/Gallio.HxS b/lib/Gallio_3.0.6.787/docs/vs/Gallio.HxS
new file mode 100644
index 00000000..8bbaf621
Binary files /dev/null and b/lib/Gallio_3.0.6.787/docs/vs/Gallio.HxS differ
diff --git a/lib/Gallio_3.0.6.787/docs/vs/GallioCollection.HxC b/lib/Gallio_3.0.6.787/docs/vs/GallioCollection.HxC
new file mode 100644
index 00000000..8be1c552
--- /dev/null
+++ b/lib/Gallio_3.0.6.787/docs/vs/GallioCollection.HxC
@@ -0,0 +1,14 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/lib/Gallio_3.0.6.787/docs/vs/GallioCollection.HxT b/lib/Gallio_3.0.6.787/docs/vs/GallioCollection.HxT
new file mode 100644
index 00000000..de346ee4
--- /dev/null
+++ b/lib/Gallio_3.0.6.787/docs/vs/GallioCollection.HxT
@@ -0,0 +1,5 @@
+
+
+
+
+
\ No newline at end of file
diff --git a/lib/Gallio_3.0.6.787/docs/vs/GallioCollection.h2reg.ini b/lib/Gallio_3.0.6.787/docs/vs/GallioCollection.h2reg.ini
new file mode 100644
index 00000000..f36c5502
--- /dev/null
+++ b/lib/Gallio_3.0.6.787/docs/vs/GallioCollection.h2reg.ini
@@ -0,0 +1,28 @@
+; This file is intended for input into the H2Reg.exe help registration utility.
+; H2Reg.exe is a shareware product from The Helpware Group that can be integrated into
+; installers used for deploying html help 2 titles and collections.
+; H2Reg.exe can be downloaded and licensed from http://www.helpware.net
+
+[Reg_Namespace]
+GallioCollection|GallioCollection.HxC|Gallio API Documentation
+
+[UnReg_Namespace]
+GallioCollection
+
+[Reg_Plugin]
+ms.vsipcc+|_DEFAULT|GallioCollection|_DEFAULT|
+
+[UnReg_Plugin]
+ms.vsipcc+|_DEFAULT|GallioCollection|_DEFAULT|
+
+[Reg_Filter]
+GallioCollection|Gallio API Documentation|("DocSet"="Gallio")
+
+[UnReg_Filter]
+GallioCollection|Gallio API Documentation
+
+[Reg_Title]
+GallioCollection|Gallio|1033|Gallio.HxS|Gallio.HxS||||||
+
+[UnReg_Title]
+GallioCollection|Gallio|1033
diff --git a/lib/Gallio_3.0.6.787/docs/vs/GallioCollection_A.HxK b/lib/Gallio_3.0.6.787/docs/vs/GallioCollection_A.HxK
new file mode 100644
index 00000000..dd8127c0
--- /dev/null
+++ b/lib/Gallio_3.0.6.787/docs/vs/GallioCollection_A.HxK
@@ -0,0 +1,4 @@
+
+
+
+
\ No newline at end of file
diff --git a/lib/Gallio_3.0.6.787/docs/vs/GallioCollection_F.HxK b/lib/Gallio_3.0.6.787/docs/vs/GallioCollection_F.HxK
new file mode 100644
index 00000000..810bb822
--- /dev/null
+++ b/lib/Gallio_3.0.6.787/docs/vs/GallioCollection_F.HxK
@@ -0,0 +1,4 @@
+
+
+
+
\ No newline at end of file
diff --git a/lib/Gallio_3.0.6.787/docs/vs/GallioCollection_K.HxK b/lib/Gallio_3.0.6.787/docs/vs/GallioCollection_K.HxK
new file mode 100644
index 00000000..764d4713
--- /dev/null
+++ b/lib/Gallio_3.0.6.787/docs/vs/GallioCollection_K.HxK
@@ -0,0 +1,4 @@
+
+
+
+
\ No newline at end of file
diff --git a/lib/Gallio_3.0.6.787/extras/CCNet/How to use Gallio with CruiseControl.Net.txt b/lib/Gallio_3.0.6.787/extras/CCNet/How to use Gallio with CruiseControl.Net.txt
new file mode 100644
index 00000000..4aa4c85d
--- /dev/null
+++ b/lib/Gallio_3.0.6.787/extras/CCNet/How to use Gallio with CruiseControl.Net.txt
@@ -0,0 +1,107 @@
+How to use Gallio with CruiseControl.Net
+========================================
+
+Using Gallio in CruiseControl.Net is very straightforward.
+
+NOTE: These instructions are designed for use with CruiseControl.Net v1.4 RTM.
+ They may work with other versions but there are no guarantees.
+
+
+CONFIGURING THE SERVER
+----------------------
+
+For the server, we need to ensure that the build script runs the tests and generates an XML
+formatted Gallio Test Report that is then merged into the CruiseControl.Net artifacts file
+with the publisher task.
+
+You can use any of the supported Gallio test runners to run your tests such as Gallio.Echo,
+Gallio.MSBuildTasks, Gallio.NAntTasks or Gallio.PowerShellCmdlet. The important thing is
+to provide appropriate arguments to the test runner such that an XML report is generated
+so that the test results can be saved for subsequent display in the dashboard.
+
+Here is one way to do this:
+
+1. Edit the "ccnet.config" file in the CruiseControl.Net "server" folder.
+
+ * Within the element, add an element similar to the following AFTER the tasks that
+ build your project. This will run the tests in your test assembly and generate an
+ XML test report in the project working directory.
+
+
+ $$$PathToGallioInstallationFolder$$$\bin\Gallio.Echo.exe
+ /rnf:test-report /rt:Xml-Inline /v:Quiet $$$MyTestAssembly.dll$$$
+
+
+ * Within the element, add an element similar to the following BEFORE the
+ task element. This will merge the XML test report into the build artifacts.
+
+ test-report.xml
+
+2. Double-check:
+
+ * The XML test report is being generated as part of a build task.
+ * The XML test report is being merged into the CruiseControl.Net artifacts file
+ as part of a publisher task.
+
+3. There is normally no need to restart the CruiseControl.Net server since it automatically
+ detects changes to the "ccnet.config" file.
+
+
+CONFIGURING THE DASHBOARD
+-------------------------
+
+For the dashboard, we need to add some new resources that are used to render the Gallio Test Report
+we must update the dashboard configuration file to include the new test report plugin.
+
+1. Copy the entire contents of the "extras\CCNet\webdashboard" folder from the Gallio
+ installation direction into the "webdashboard" folder of your CruiseControl.Net
+ installation.
+
+2. (Skip if running CruiseControl.Net v1.4 or more recent.)
+
+ Edit the "templates/SiteTemplates.vm" file manually to add the following DTD
+ declaraction to the top of this file:
+
+
+
+3. Edit the "dashboard.config" file in the CruiseControl.Net "webdashboard" folder.
+
+ * Within the element, add the following elements:
+
+
+
+
+
+4. Double-check:
+
+ * The "webdashboard" folder now contains "gallio\css", "gallio\img", "gallio\js", "gallio\xml".
+ * The "webdashboard" folder now contains "bin\CCNet.Gallio.WebDashboard.Plugin.dll".
+ * The "webdashboard" folder now contains "templates\SiteTemplate.vm" with an updated DTD declaration.
+ * The "dashboard.config" file has been edited to include the new build report section.
+
+5. Restart the CruiseControl.Net web application. (eg. By resetting IIS.)
+
+Note:
+
+ It can happen that the plugin distributed with Gallio is incompatible with the version
+ of CruiseControl.Net that you have installed. The dashboard may fail to start in this
+ case.
+
+ In this case you may choose to omit the element and
+ delete the plugin dll from your dashboard's bin directory which will cause attachments and
+ images within the Gallio reports to not be displayed.
+
+ Or you may choose to recompile the plugin yourself by checking out the Gallio source tree,
+ replacing the version of the CruiseControl.Net libraries in the "src\Extensions\CCNet\libs"
+ folder and running the "Build.bat" file.
+
+
+Usage Remark:
+
+ The full Gallio report may be quite large and take a long time to load because it includes
+ all test results. In contrast, the "Condensed" report excludes passing tests so it is
+ often somewhat easier to work with when there are only a few failures in a large test suite.
diff --git a/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/css/Gallio-Report.css b/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/css/Gallio-Report.css
new file mode 100644
index 00000000..a99d7400
--- /dev/null
+++ b/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/css/Gallio-Report.css
@@ -0,0 +1,509 @@
+/* Common inherited text options */
+.gallio-report
+{
+ font-family: Verdana, Arial, Helvetica, Helv, sans-serif;
+ font-size: 10pt;
+ word-wrap: break-word; /* IE and CSS3, we use for other browsers */
+}
+
+/* Containers */
+div.gallio-report, body.gallio-report
+{
+ margin: 0px 0px 0px 0px;
+ padding: 0px 0px 0px 0px;
+ overflow: hidden;
+ width: 100%;
+}
+
+.gallio-report div.header
+{
+ margin: 0px 0px 0px 0px;
+ padding: 0px 0px 0px 0px;
+ background-color: #95b0be;
+ background-image: url(../img/header-background.gif);
+ background-repeat: repeat-y;
+ width: 100%;
+ height: 59px;
+ border-bottom: solid 1px black;
+}
+
+.gallio-report div.header-image
+{
+ margin: 0px 0px 0px 0px;
+ padding: 0px 0px 0px 0px;
+ width: 100%;
+ height: 60px;
+ background-image: url(../img/GallioTestReportHeader.png);
+ background-repeat: no-repeat;
+ background-position: 0 0;
+}
+
+.gallio-report div.content
+{
+ width: 100%;
+}
+
+/* Navigation bar */
+.gallio-report div.navigator
+{
+ position: fixed;
+ right: 0px;
+ bottom: 0px;
+ margin: 0px 0px 0px 0px;
+ padding: 0px 0px 0px 0px;
+ width: 17px;
+ background-color: #d0d4d8;
+ overflow: hidden;
+}
+
+.gallio-report div.navigator a.navigator-box
+{
+ display: block;
+ cursor: pointer;
+ width: 9px;
+ height: 9px;
+ position: absolute;
+ top: 3px;
+ left: 3px;
+ border: solid 1px black;
+}
+
+.gallio-report div.navigator div.navigator-stripes
+{
+ position: absolute;
+ top: 17px;
+ bottom: 0px;
+ width: 17px;
+}
+
+.gallio-report div.navigator div.navigator-stripes a
+{
+ display: block;
+ cursor: pointer;
+ width: 11px;
+ height: 2px;
+ position: absolute;
+ left: 3px;
+}
+
+/* Generate a fixed layout when the report is the whole document */
+body.gallio-report div.header
+{
+ position: fixed;
+ top: 0px;
+ left: 0px;
+}
+
+body.gallio-report div.content
+{
+ position: fixed;
+ top: 60px;
+ left: 0px;
+ right: 17px;
+ bottom: 0px;
+ overflow: auto;
+ width: auto;
+}
+
+body.gallio-report div.navigator
+{
+ top: 60px;
+}
+
+/* Generate an embedded layout when the report is only a fragment */
+div.gallio-report div.header
+{
+ border: solid 1px black;
+}
+
+div.gallio-report div.navigator
+{
+ top: 0px;
+}
+
+/* Section headings */
+.gallio-report h2
+{
+ font-size: 13pt;
+ letter-spacing: 0.15em;
+ color: #1f1f1f;
+ padding: 0;
+ margin: 0 0 3px 0;
+ text-indent: 8px;
+}
+
+/* Toggle regions */
+.gallio-report ul
+{
+ list-style-type: none;
+ padding-left: 0px;
+ margin: 0px 0px 0px 0px;
+}
+
+.gallio-report div.panel
+{
+ margin: 0px 0px 0px 24px;
+}
+
+.gallio-report img.toggle
+{
+ cursor: pointer;
+ margin-right: 6px;
+}
+
+/* Status colors */
+.gallio-report .status-passed
+{
+ background-color: #008000;
+}
+
+.gallio-report .status-failed
+{
+ background-color: #ff0000;
+}
+
+.gallio-report .status-inconclusive
+{
+ background-color: #ffff00;
+}
+
+.gallio-report .status-skipped
+{
+ background-color: #999999;
+}
+
+/* Outcome bar */
+.gallio-report table.outcome-bar
+{
+ display: inline;
+ vertical-align: middle;
+ margin-left: 8px;
+}
+
+.gallio-report div.outcome-bar
+{
+ overflow: hidden;
+
+ border: solid 1px #000000;
+ padding: 0px 0px 0px 0px;
+ margin: 0px 0px 0px 0px;
+
+ height: 8px;
+ width: 72px;
+}
+
+.gallio-report div.outcome-bar.condensed
+{
+ height: 6px;
+ width: 20px;
+}
+
+
+/* Outcome statistics */
+.gallio-report span.outcome-icons
+{
+ font-size: 11pt;
+}
+
+
+/* Test runs */
+.gallio-report .testStepRun
+{
+ margin-top: 12pt;
+ font-size: 10pt;
+}
+
+.gallio-report .testStepRunHeading
+{
+ font-weight: bold;
+ font-size: 10pt;
+}
+
+.gallio-report .testStepRunHeading-Level1
+{
+ font-size: 12pt;
+}
+
+.gallio-report .testStepRunHeading-Level2
+{
+ font-size: 11pt;
+}
+
+.gallio-report .testStepRunHeading-Level3
+{
+ font-size: 10pt;
+}
+
+.gallio-report .testStepRunHeading-Level4
+{
+ font-size: 10pt;
+}
+
+
+/* Metadata entries */
+.gallio-report .metadata
+{
+ margin: 5px 5px 5px 0px;
+ padding: 5px 5px 5px 5px;
+
+ background: #f4f4ff;
+ font-size: 9pt;
+}
+
+/* Test logs */
+.gallio-report .log
+{
+ margin: 5px 0px 5px 0px;
+}
+
+.gallio-report .logAttachmentList
+{
+ font-size: 10pt;
+ font-style: italic;
+}
+
+.gallio-report .logStream
+{
+ background-color: #f0f0f0;
+ border-bottom: solid 1px #c6c6c6;
+ border-right: solid 1px #c6c6c6;
+ margin: 5px 5px 5px 0px;
+ padding: 5px 5px 5px 5px;
+}
+
+.gallio-report .logStreamHeading
+{
+ font-weight:bold;
+ font-size: 10pt;
+ text-decoration: underline;
+}
+
+.gallio-report .logStreamBody
+{
+ font-size: 9pt;
+ border-style: none;
+}
+
+.gallio-report .logStreamSection
+{
+ margin-top: 12pt;
+ margin-bottom: 12pt;
+ padding-left: 6px;
+ border-left: solid 3px black;
+}
+
+.gallio-report .logStreamSectionHeading
+{
+ font-weight: bold;
+ text-decoration: underline;
+}
+
+.gallio-report .logStreamEmbed
+{
+ font-style: italic;
+ padding: 5px 10px 5px 10px;
+}
+
+/* Test log streams */
+.gallio-report .logStream-Failures
+{
+ background-color: #ffd8d8;
+ border: dotted 1px #905050;
+}
+
+.gallio-report .logStream-Warnings
+{
+ background-color: #ffffc8;
+ border: dotted 1px #909050;
+}
+
+/* Test log stream markers */
+.gallio-report .logStreamMarker-AssertionFailure
+{
+}
+
+.gallio-report .logStreamMarker-Label
+{
+ font-weight: bold;
+}
+
+.gallio-report .logStreamMarker-Exception
+{
+ font-style: italic;
+}
+
+.gallio-report .logStreamMarker-StackTrace
+{
+ font-style: italic;
+}
+
+.gallio-report .logStreamMarker-Monospace
+{
+ font-family: Consolas, Courier New, Courier;
+}
+
+.gallio-report .logStreamMarker-Highlight
+{
+ background-color: Yellow;
+}
+
+.gallio-report .logStreamMarker-DiffAddition
+{
+ background-color: #b0ffb0;
+}
+
+.gallio-report .logStreamMarker-DiffDeletion
+{
+ background-color: #ffb0b0;
+ text-decoration: line-through;
+}
+
+.gallio-report .logStreamMarker-DiffChange
+{
+ background-color: #b0b0ff;
+}
+
+.gallio-report .logStreamMarker-Ellipsis
+{
+ text-decoration: underline;
+}
+
+.gallio-report .embeddedImage
+{
+ /* Nice idea in principle but IE will not navigate to the full-size embedded image
+ * (or to any other links) when the report is stored on the local filesystem. -- Jeff.
+ max-width: 800px;
+ */
+}
+
+/* Sections */
+.gallio-report div.section
+{
+ background-color: #ebeaea;
+ margin: 5px;
+ padding: 10px;
+ border-bottom: solid 1px #dcdcdc;
+ border-right: solid 1px #dcdcdc;
+ overflow: hidden;
+}
+
+.gallio-report div.section-content
+{
+ background-color: #fbfbfb;
+ padding: 10px 10px 10px 10px;
+ overflow: hidden;
+}
+
+.gallio-report table.statistics-table
+{
+ border-collapse: collapse;
+}
+
+.gallio-report table.statistics-table td
+{
+ width: 100%;
+}
+
+.gallio-report table.statistics-table td.statistics-label-cell
+{
+ font-weight: bolder;
+ color: #646464;
+ padding: 0px 10px 0px 10px;
+ width: auto;
+}
+
+.gallio-report table.statistics-table tr.alternate-row td
+{
+ background-color: #f2f2f2;
+}
+
+
+/* Annotations */
+.gallio-report div.annotation
+{
+}
+
+.gallio-report div.annotation-message
+{
+ margin-left: 2em;
+ text-indent: -2em;
+}
+
+.gallio-report div.annotation-location, div.annotation-reference, div.annotation-details
+{
+ margin-left: 4em;
+ text-indent: -2em;
+ font-style: italic;
+}
+
+.gallio-report .annotation-type-error
+{
+ color: #990000;
+}
+
+.gallio-report .annotation-type-warning
+{
+ color: #999900;
+}
+
+.gallio-report .annotation-type-info
+{
+ color: #999999;
+}
+
+/* Log Entries */
+.gallio-report div.logEntry
+{
+}
+
+.gallio-report div.logEntry-text
+{
+ margin-left: 2em;
+ text-indent: -2em;
+}
+
+.gallio-report div.logEntry-details
+{
+ margin-left: 4em;
+ text-indent: -2em;
+ font-style: italic;
+}
+
+.gallio-report .logEntry-severity-error
+{
+ color: #990000;
+}
+
+.gallio-report .logEntry-severity-warning
+{
+ color: #999900;
+}
+
+.gallio-report .logEntry-severity-important
+{
+ color: #000000;
+}
+
+.gallio-report .logEntry-severity-info
+{
+ color: #999999;
+}
+
+.gallio-report .logEntry-severity-debug
+{
+ color: #aaaaaa;
+}
+
+/* Cross-References */
+
+.gallio-report a:hover.crossref
+{
+ background-color: #eeee99;
+}
+
+.gallio-report a.crossref
+{
+ color: #000000;
+ text-decoration: none;
+ border-bottom: dotted 1px #aa00dd;
+}
diff --git a/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/img/Container.png b/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/img/Container.png
new file mode 100644
index 00000000..105c0549
Binary files /dev/null and b/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/img/Container.png differ
diff --git a/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/img/Failed.gif b/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/img/Failed.gif
new file mode 100644
index 00000000..bcf4c078
Binary files /dev/null and b/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/img/Failed.gif differ
diff --git a/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/img/Fixture.png b/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/img/Fixture.png
new file mode 100644
index 00000000..9fbddd8d
Binary files /dev/null and b/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/img/Fixture.png differ
diff --git a/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/img/FullStop.gif b/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/img/FullStop.gif
new file mode 100644
index 00000000..dda8c62b
Binary files /dev/null and b/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/img/FullStop.gif differ
diff --git a/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/img/GallioTestReportHeader.png b/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/img/GallioTestReportHeader.png
new file mode 100644
index 00000000..111cca6f
Binary files /dev/null and b/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/img/GallioTestReportHeader.png differ
diff --git a/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/img/Ignored.gif b/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/img/Ignored.gif
new file mode 100644
index 00000000..dd90f466
Binary files /dev/null and b/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/img/Ignored.gif differ
diff --git a/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/img/Logo.png b/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/img/Logo.png
new file mode 100644
index 00000000..874a2a7d
Binary files /dev/null and b/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/img/Logo.png differ
diff --git a/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/img/Minus.gif b/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/img/Minus.gif
new file mode 100644
index 00000000..46acbcc7
Binary files /dev/null and b/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/img/Minus.gif differ
diff --git a/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/img/Passed.gif b/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/img/Passed.gif
new file mode 100644
index 00000000..1dee9cd8
Binary files /dev/null and b/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/img/Passed.gif differ
diff --git a/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/img/Plus.gif b/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/img/Plus.gif
new file mode 100644
index 00000000..0ce509a8
Binary files /dev/null and b/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/img/Plus.gif differ
diff --git a/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/img/Test.png b/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/img/Test.png
new file mode 100644
index 00000000..16ce0887
Binary files /dev/null and b/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/img/Test.png differ
diff --git a/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/img/header-background.gif b/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/img/header-background.gif
new file mode 100644
index 00000000..0e01c4c0
Binary files /dev/null and b/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/img/header-background.gif differ
diff --git a/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/js/Gallio-Report.js b/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/js/Gallio-Report.js
new file mode 100644
index 00000000..dd7fb3d3
--- /dev/null
+++ b/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/js/Gallio-Report.js
@@ -0,0 +1,47 @@
+function toggle(id)
+{
+ var icon = document.getElementById('toggle-' + id);
+ if (icon != null)
+ {
+ var childElement = document.getElementById(id);
+ if (icon.src.indexOf('Plus.gif') != -1)
+ {
+ icon.src = icon.src.replace('Plus.gif', 'Minus.gif');
+ if (childElement != null)
+ childElement.style.display = "block";
+ }
+ else
+ {
+ icon.src = icon.src.replace('Minus.gif', 'Plus.gif');
+ if (childElement != null)
+ childElement.style.display = "none";
+ }
+ }
+}
+
+function expand(ids)
+{
+ for (var i = 0; i < ids.length; i++)
+ {
+ var id = ids[i];
+ var icon = document.getElementById('toggle-' + id);
+ if (icon != null)
+ {
+ if (icon.src.indexOf('Plus.gif') != -1)
+ {
+ icon.src = icon.src.replace('Plus.gif', 'Minus.gif');
+
+ var childElement = document.getElementById(id);
+ if (childElement != null)
+ childElement.style.display = "block";
+ }
+ }
+ }
+}
+
+function navigateTo(path, line, column)
+{
+ var navigator = new ActiveXObject("Gallio.Navigator.GallioNavigator");
+ if (navigator)
+ navigator.NavigateTo(path, line, column);
+}
diff --git a/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/xsl/Gallio-Report.ccnet-details-condensed.xsl b/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/xsl/Gallio-Report.ccnet-details-condensed.xsl
new file mode 100644
index 00000000..3d1fd818
--- /dev/null
+++ b/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/xsl/Gallio-Report.ccnet-details-condensed.xsl
@@ -0,0 +1,20 @@
+
+
+
+
+
+ /gallio/css/
+ /gallio/js/
+ /gallio/img/
+ GallioAttachment.aspx?
+
+
+
+
+
+
+
+
+
diff --git a/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/xsl/Gallio-Report.ccnet-details.xsl b/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/xsl/Gallio-Report.ccnet-details.xsl
new file mode 100644
index 00000000..0a6baf36
--- /dev/null
+++ b/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/xsl/Gallio-Report.ccnet-details.xsl
@@ -0,0 +1,20 @@
+
+
+
+
+
+ /gallio/css/
+ /gallio/js/
+ /gallio/img/
+ GallioAttachment.aspx?
+
+
+
+
+
+
+
+
+
diff --git a/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/xsl/Gallio-Report.common.xsl b/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/xsl/Gallio-Report.common.xsl
new file mode 100644
index 00000000..49c9f537
--- /dev/null
+++ b/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/xsl/Gallio-Report.common.xsl
@@ -0,0 +1,356 @@
+
+
+
+
+
+
+
+
+
+ run,
+
+
+ passed
+
+
+ passed
+
+ ,
+
+
+ failed
+
+
+ failed
+
+ ,
+
+
+ inconclusive
+
+
+ inconclusive
+
+ ,
+
+
+ skipped
+
+
+ skipped
+
+
+
+
+
+
+
+
+
+
+ (
+
+
+
+ ,
+
+
+
+
+ )
+
+
+
+
+
+
+
+
+
+
+
+ (
+
+
+ ,
+
+
+ )
+
+
+
+ (unknown)
+
+
+
+
+
+
+
+
+
+ Parameter
+
+ of
+
+
+
+
+
+
+ .
+
+
+
+
+
+
+
+
+
+
+ ,
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ skipped
+
+
+
+ passed
+
+
+
+ inconclusive
+
+
+
+ failed
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ ,
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ /
+ %20
+ %25
+
+
+
+
+
+
+
+
diff --git a/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/xsl/Gallio-Report.html+xhtml.xsl b/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/xsl/Gallio-Report.html+xhtml.xsl
new file mode 100644
index 00000000..42ba4eb5
--- /dev/null
+++ b/lib/Gallio_3.0.6.787/extras/CCNet/webdashboard/gallio/xsl/Gallio-Report.html+xhtml.xsl
@@ -0,0 +1,785 @@
+
+
+
+
+
+ saved from url=(0014)about:internet
+
+ Gallio Test Report
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
The F# May 2009 Community Technology Preview, 1.9.6.16
+
+
Welcome to the F# May 2009
+ Community Technology Preview (CTP). F# is a typesafe, scalable, succinct, typed, efficient
+ programming language for the .NET platform. This release represents an important step in
+ the evolution of the F# language as we progress it towards product quality.
+ The release contains:
+
+
The F# command-line compiler
+
F# Interactive, for dynamic execution and interactive evaluation
+
The F# library components
+
The F# Visual Studio 2008 components
+
Tools such as the F# lexer and parser generators and the value-add "F#
+ PowerPack"
+
+
Full details can be found
+ at the F# Developer Center or the F# website .
+ There you can find additional F# learning resources, links to the F# community and
+ more.
+ You may be interested in
+ tracking Don Syme's F# blog
+ and/or blogging about your experiences with using F#. If you are getting started with F#, try the following sites:
The .NET Framework SDK or .NET Framework Redistributable Components.
+ Versions 2.0, 3.0 and 3.5 are supported.
+
Visual Studio 2008 Standard Edition or above.
+
The freely available Visual Studio 2008 Shell.
+
The Microsoft SSCLI Shared-Source implementation of the CLR.
+
Another CLI implementation (e.g. Mono). See the notes on using Mono below. Always ensure you have the
+ latest stable Mono release installed (e.g. the Mono 2.0 preview release or later as of the time of writing) -
+ some versions of Linux come with very old Mono releases.
+
+
+
If you are not using Visual Studio, you will need an alternate editor. If you use Emacs you will probably want to use the
+ Emacs F# mode..
+ You will also need a command line prompt to run F# Interactive and the command line compiler.
+
+
A sense of adventure and discovery!
+
+
+
+
+
+
+
Providing Feedback
+
+
+ Your feedback is highly valuable to the F# team. Please send any comments
+ to fsbugs@microsoft.com. Your positive
+ and negative feedback, as well as suggestions, comments, feature requests, and
+ bug reports are warmly welcomed.
+
+ If you have questions for the F# user community, post them to one of the sites
+ listed in the Support section below.
+
+
+
+
Support
+
+
+ This F# CTP is pre-release software and is not officially supported by Microsoft
+ product support. If you have issues or questions that require support, you
+ can use one of the following resources:
Install the F# libraries to the GAC using install-mono.sh. This script also contains the commands to trigger
+ pre-compilation, but since some versions of Mono have had problems with pre-compilation the code is commented out.
+
+
Run the compiler using mono bin/fsc.exe. You will want to make an alias for this.
+
+
Run F# Interactive compiler using mono bin/fsi.exe. You may wish to make an alias for this.
+
+
Ahead-of-time compilation can be useful for F# assemblies, but there have been reports of issues with using this on Mono.
+ If you find out that it works on your version of Mono, go ahead and run it on fsc.exe, fsi.exe,
+ FSharp.Compiler.dll, and FSharp.Core.dll to improve startup times for mono bin/fsc.exe.
+
+
Debugging symbols are not generated. Using the -g flag will generate a warning.
+
+
Strong name signing is now available in the F# compiler via the --keyfile command line option.
+
+
F# has in the past exposed Mono bugs in corner cases. If you see a problem, this is likely
+ to be the result of a bug in Mono. Please
+ be sure to investigate and report these to both the F# team and through the Mono bug reporting process.
+
+
+
+
+
Changes: F# CTP 2009 Release
+
+
This release makes many improvements to the core experience provided with the last F# CTP,
+with improved debugging support, performance and scalability improvements in the language,
+libraries and Visual Studio, many minor language extensions, and a release of Visual Studio 2010 Beta1 with F# integrated.
+
+
+
The changes in this release are documented briefly below. More details are contained
+in the blog announcements coinciding with this release.
+
+
Summary
+
+
+ Release
+
+
F# is integrated into Visual Studio 2010 Beta1
+
F# in Visual Studio2010 can build applications for .NET 4.0 Beta1
+
Updated F# CTP for Visual Studio 2008 and .NET 2.0/3.0/3.5
+
F# PowerPack to be available on CodePlex and also in the CTP Update for this release
+
+
+
+ F# Language
+
+
#light is the default
+
Support for calling and exposing .NET ParamArray parameters (‘params’ in C#)
+
Performance improvement for Sequence Expressions
+
Units of measure support for signed integral types
+
Support for custom numeric types (123X, 1.0R, etc.)
+
Overloading tie-breaker rules result in fewer ambiguity errors when calling overloaded members
+
? operator enables definition of dynamic member lookup
+
Attributes can be placed on implicit class constructors
+
Let bindings and implicit constructor parameters in type definitions only generate fields when necessary
+
Curried members are generated as un-curried .NET members
+
Support for InternalsVisibleTo
+
Support for all Assembly*Attributes
+
+
+
+ F# Compiler
+
+
Fsc.exe command line compiler options cleanup and standardization
+
Passing mscorlib and FSharp.Core.dll explicitly is supported, and defines the targeted runtime
+
+
+
+ F# Core Libraries
+
+
FSharp.Core.dll API naming standardization resulting in a handful of API changes
+
Silverlight2 version of FSharp.Core.dll available in the CTP Update
+
RequiresQualifiedAccess applied to many of the modules in FSharp.Core.dll to prevent opening the module in client code
+
BigInteger/BigRational changes
+
ResizeArray module moved to F# Power Pack
+
IStructuralHash removed, IStructuralEquatable and IStructuralComparable added
+
[.Net 4.0] FSharp.Core.dll is SecurityTransparent and can be used in partial trust
+
[.Net 4.0] F# uses new .NET4.0 Lazy and Tuple types
+
[.Net 4.0] Async.StartAsTask and Task<>.AwaitValue convert between F# Async and .NET4.0 Task
+
[.Net 4.0] Array.Parallel.* functions provide data parallel versions of common array operations
+
+
+
+ Visual Studio
+
+
Error List populated by results of Build as well as background errors
+
Performance improvements in F# Visual Studio language service
+
Many improvements to debugging in Visual Studio, including breakpoint setting and data visualization.
+
More reliable F# Intellisense in the face of incomplete or incorrect code
+
Improved project build and rebuild performance and reliability
+
QuickInfo on #r shows details of the referenced assembly
+
+
+
+ F# Interactive
+
+
F# Interactive displays all bound values
+
Simplified command line format for fsi.exe makes it easy to execute simple F# scripts with fsi.exe script.fsx a1 a2
+
Fsi.exe emits debug symbols, so can be attached to, to debug a running script
+
+
+
+ F# PowerPack
+
+
Additional Async utility functions
+
An API for accessing F#-specific metadata from F# assemblies - FSharp.PowerPack.Metadata.dll
+
+
+
+ Miscellaneous
+
+
Beta F# Language and Compiler documentation on MSDN
+
Deletion of features deprecated in previous F# releases
+
Plus many, many more minor fixes and improvements
+
+
+
+
+
F# Language
+
#light is the default
+
+
+ All F# source files now use the whitespace-aware #light
+ syntax by default. This may be
+ turned off with #light off at the top of a source file.
+
+
.NET ParamArray parameters (‘params’ in C#)
+
+ F# can call methods with ParamArray parameters defined in
+ other .NET languages such as:
+
+ System.Console.WriteLine("a","b","c","d","e","f")
+ // Results in the following call:
+ // System.Console.WriteLine("a", [|"b";"c";"d";"e";"f"|])
+
+
+ F# types can also expose ParamArray parameters themselves
+ using System.ParamArrayAttribute:
+
+ open System
+ type MyType() =
+ member this.M([] args : string[]) =
+ args |> Array.iter (printfn "%A")
+
+
+
Performance of Sequence Expressions
+
+ Sequence expressions are now compiled to state machines,
+ instead of as a collection of API calls. This results in improved performance of F# code which works with seq. Many of the Seq.* library functions
+ also have improved performance as a result of this change.
+
Units of measure support for signed integral types
+
+ Units of measure may now be applied to integral types such as int and int64, as
+ well as existing floating point types such as float and decimal.
+
+ [<Measure>]
+ type clicks
+
+ let x = 64<clicks>
+
Also, a few bugs fixes to enable definitions of OO types annotated with measures to have the full
+ range of overloaded operators (e.g. Vector, Matrix etc.).
+
Support for custom numeric types (123X, 1.0R, etc.)
+
+ It is now possible to bind numeric literals to custom numeric
+ types. Custom numeric literals, with
+ a numeric constant followed by a single letter, are treated as syntactic sugar
+ for API calls.
+
"?" operator enables definition of
+ dynamic member lookup
+
The ? and ?<- operators now treat their right-hand argument as a parse-time
+ symbol, and pass this symbol to the operator definition as a string argument. This enables the definition of
+ dynamic lookup as a library implementation of the ? operator.
+
+
+ open System.Reflection
+
+ let (?) (x: 'a) (prop: string) : 'b =
+ // A simplified '?' operator for dynamic property
+ // lookup using reflection
+ let pi = typeof<'a>.GetProperty(prop)
+ pi.GetValue(x, [||]) :?> 'b
+
+ let statically = "hello".Length
+ let dynamically : int = "hello"?Length
+
+
+
+
F# Compiler
+
Compiler command line option normalization
+
+
+ The command line options for the F# compiler have been further aligned with
+ standard .NET compiler practice. Here are a few notable changes:
+
+
All long-form compiler options taking parameters now require a ':', as in --target:exe
+
Tailcalls is now set based on a separate --tailcalls[+/-] flag, which is on by default
+
Cross-module optimization is now set based on a separate --crossoptimize[+/-] flag, which is on by default
+
+
To see the full list of compiler options, use fsc.exe -?
+
F# Core Libraries
+
FSharp.Core.dll API naming standardization resulting in a handful of API changes
+
The camelCase naming scheme has been adopted in place of
+ under_scores in the compositional functional programming modules.
+
+
A few other functions have been renamed to align better with
+ this naming convention.
+
BigInteger/BigRational
+
F# BigInteger has been aligned with the new .NET4.0 BigInteger type. On .NET 2.0, a matching BigInteger
+ implementation is included in FSharp.Core.dll.
+
+ The BigRational type has been moved into the F# PowerPack.
+
Structured Formatting Customization
+
Two tools for customizing structured formatting of values with
+ %A or in the F# Interactive have been added to this release.
+
+
Width and node count parameters on %A format
+
+ %<width>.<node-count>A
+
+ A width of 0 will mean "no line splitting", i.e. 1-dimensional layout.
+
+
+ This attribute is used to mark how a type is displayed by
+ default when using %A printf formatting patterns and other two-dimensional
+ text-based display layouts. In version 1 of F# the only valid values will be of
+ the form PreText {PropertyName} PostText. The property name indicates a
+ property to evaluate and to display instead of the object itself.
+
+
As a library developer:
+
+
Override ToString for simple types
+
Consider implementing DebuggerDisplay
+
+
if you expect users to often see this type in the debgugger
+
AND overriding ToString is not adequate for this purpose
+
+
+
Consider implementing StructuredFormatDisplay if
+
+
you expect users to see this type in a console or other textual display
+
and the default results of printf %A for the type is not adequate
+
and overriding ToString is not adequate
+
+
+
It is OK to implement all three
+
+
As a library developer:
+
+
Use %A for structured formatting
+
Use fsi.AddPrinter to make adhoc changes to how FSI displays data
+
+
[.Net 4.0] F# uses new .NET4.0 Lazy and Tuple types
+
F# compiled for .NET4.0 uses the new System.Tuple and System.Lazy types in place
+ of F#-specific types.
+
[.Net 4.0] Converting between F# Async
+ and .NET4.0 Tasks
+
F# Async workflows can be used to compose together .NET4.0 Tasks, using the
+ Task<'T>.AsyncValue and Async.StartAsTask functions.
+
+ async { // Await the value from some future we've been given
+ // This is effectively "ContinueWith"
+ let! v1 = someFuture.AsyncValue
+ ... }
+
+ async { // Set a sub-async program running as a future
+ let! subtask = Async.StartChildAsTask ( async { ... } )
+ // Await the value from the future (don't block the thread!)
+ // This is effectively "ContinueWith"
+ let! v1 = subtask.AsyncValue
+ ... }
+
+ let mytask = async { ... } |> Async.StartAsTask
+
[.Net 4.0] Array.Parallel
+
Data parallel versions of some of the common Array operations are available in
+ the Array.Parallel module. These can
+ be used to quickly parallelize key loops in F# code. The performance profile of these
+ operations is derived from the System.Threading.Parallel.For API in .NET4.0.
+
+ let random = new System.Random()
+ let numPoints = 10000000
+ let points = Array.init numPoints (fun _ -> random.NextDouble(), random.NextDouble())
+ let numInCircle =
+ points
+ |> Array.Parallel.choose (fun (x,y) ->
+ if x*x + y*y <= 1.0 then Some (x,y) else None)
+ |> Array.length
+ let pi = 4.0 * float numInCircle / float numPoints
+
F# PowerPack
+
Additional Async utility functions
+
The following Async utility functions have been added to the PowerPack:
+
+
Async.AwaitEvent
+
Async.AsBeginEnd
+
AsyncResult<_>
+
AsyncResultCell<_>
+
System.Net.WebClient.AsyncDownloadString
+
+
+
FSharp.PowerPack.Metadata.dll
+
The API in this assembly
+ provides access to the F#-specific metadata. This can be used to get information about F# notions such as type
+ abbreviations, units of measure, and currying or parameters.
+
+ #r "FSharp.PowerPack.Metadata.dll"
+ open FSharp.PowerPack.Metadata
+
+ let assm = FSharpAssembly.FromFile(@"FSharp.Core.dll")
+ let entities = assm.Entities
+ let allAbbreviations =
+ [ for e in entities do
+ if e.IsAbbreviation
+ then yield e.Name ]
+
+
+
\ No newline at end of file
diff --git a/tools/FSharp_1.9.6.16/doc/README-samples.html b/tools/FSharp_1.9.6.16/doc/README-samples.html
new file mode 100644
index 00000000..87b93fc3
--- /dev/null
+++ b/tools/FSharp_1.9.6.16/doc/README-samples.html
@@ -0,0 +1,26 @@
+
+
+
+The F# Compiler Version 1.9.6.16
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/tools/FSharp_1.9.6.16/doc/README-vfsi.html b/tools/FSharp_1.9.6.16/doc/README-vfsi.html
new file mode 100644
index 00000000..d8e58271
--- /dev/null
+++ b/tools/FSharp_1.9.6.16/doc/README-vfsi.html
@@ -0,0 +1,88 @@
+
+
+
+The F# Compiler Version 1.9.6.16
+
+
+
+
+
+
+
+
+
+
+
Using F# Interactive in Visual Studio
+
+
+If you use Visual Studio 2008 (including the
+freely available Visual Studio 2008 Shell),
+you can use 'F# Interactive' as a tool window!
+
+
Starting F# Interactive
+
+
To start the session, go to the View -> Other Windows and select 'F# Interactive'. You can also start a session
+simply using Alt-Return in an F# source document, or using the shortcut Ctrl+Alt+F.
+
+
+
Editing and Evaluating a Script
+
+
You create a script file using File -> New File -> Script -> F# Script File.
+
+
The normal mode of operation is to edit an F# script file and send fragments for execution in the tool window. In
+this mode, your fragments are typechecked as you type, and you are actively working towards a completed
+file that can act as the finished product of your explorative programming. The tool window is then
+just used for displaying data.
+
+
In the script file, you should use #r and #I to reference assemblies
+and augment your assembly include path.
+
+
+
The session is global to the instance of Visual Studio and text can be sent from any
+F# source code file (.fs, .fsi, .fsx, .ml, .mli).
+Use the Alt-Return combination to evaluate
+selected text. For example, highlight printfn "Hello World" and use this key combination - the code will then
+execute.
+
+
+
Execution Context for Scripts
+
+
+
The F# Interactive session executes only those code fragments you direct it to. If you select a fragment from
+half-way through your script, earlier portions of the script will not be executed implicitly.
+
+
When sending text from a file, file names are resolved relative to the scripts containing the reference. Visual F# Interactive sets the
+line and directory context of the session each time an entry is sent from Visual Studio, though it doesn't
+adjust the value of System.Environment.CurrentDirectory. It can be useful to add
to your script. __SOURCE_DIRECTORY can be used in any F# source file and is expanded to the directory
+containing the file.
+
+
+
Organizing Your Scripts
+
+
Although scripts can be authored without a project, it can be useful to create an F# Project to hold a group of related scripts.
+You can do this with New Project or by making a copy of one of the projects in
+the F# Samples directory. You can also use #load to load both signature and implementation files as
+if they have been compiled as compilation units by the command-line compiler.
+
+
+
Controlling the Evaluation Session
+
+
In the tool window, #quit;; will quit and Ctrl+C will cancel execution.
+The context menu in the tool window includes
+"Reset Session" and "Cancel Evaluation" commands.
+If you do type into the tool window, history is available with the up/down arrows.
+
+
+
To troubleshoot, see README-fsharp.html
+
+
Please contact fsbugs@microsoft.com with feedback on this documentation.
+
+
+
\ No newline at end of file
diff --git a/tools/FSharp_1.9.6.16/doc/core-style.css b/tools/FSharp_1.9.6.16/doc/core-style.css
new file mode 100644
index 00000000..3fbff6f9
--- /dev/null
+++ b/tools/FSharp_1.9.6.16/doc/core-style.css
@@ -0,0 +1,64 @@
+
diff --git a/tools/FSharp_1.9.6.16/doc/groupStyle-copy.css b/tools/FSharp_1.9.6.16/doc/groupStyle-copy.css
new file mode 100644
index 00000000..61ec4f6b
--- /dev/null
+++ b/tools/FSharp_1.9.6.16/doc/groupStyle-copy.css
@@ -0,0 +1,112 @@
+BODY
+{
+ font-family: verdana;
+}
+P
+{
+ padding-left: 20px;
+}
+.TitleHeader
+{
+ padding-left: 20px;
+ font-size: 1em;
+ font-weight: bold;
+}
+.linkbox
+{
+ margin-left: 20px;
+ margin-right: 30px;
+ margin-bottom: 20px;
+ padding-bottom: 10px;
+ width: 175px;
+ float: right;
+ border-right: #0066CC 1px solid;
+ background: #f1f1f1;
+ border-left: #0066CC 1px solid;
+ border-bottom: #0066CC 1px solid;
+}
+.outlineDivTitle
+{
+ background-color: #0066CC;
+ color: #FFFFFF;
+ padding-left: 15px;
+ padding-bottom: 2px;
+ padding-top: 2px;
+ font: bold 70% Verdana;
+ color: #ffffff;
+}
+.outlineDiv
+{
+ padding-left: 20px;
+ background-image: URL(/images/blueTriangle.gif);
+ background-repeat: no-repeat;
+ background-position: 6 8;
+ font: 70% verdana;
+ color: #003399;
+ line-height: 200%;
+}
+
+.GroupContactTitle
+{
+ color: #003399;
+ font-size: .93em;
+}
+.GroupContact
+{
+ color: #003399;
+ font-size: .93em;
+ font-weight: bold;
+}
+A.GroupContactLink
+{
+ color: #003399;
+}
+.BlankPictureDiv
+{
+ background-color: #cccccc;
+ width: 75px;
+ height: 75px;
+ border: solid #999999 1px;
+ font-size: 70%;
+ font-weight: bold;
+ padding-left: 5px;
+ padding-top: 20px;
+ padding-right: 5px;
+ padding-bottom: 5px;
+}
+.PeopleGroupImage
+{
+ border-color: #999999;
+}
+A.PeopleLastNameLink
+{
+ color: #003399;
+}
+.PeopleLastNameLinked
+{
+ padding-top: 3px;
+ font-size: .82em;
+ font-weight: bold;
+}
+.PeopleFirstNameLinked
+{
+ color: #003399;
+ padding-top: 3px;
+ padding-bottom: 8px;
+ font-size: .82em;
+ text-decoration: none;
+}
+.PeopleLastName
+{
+ padding-top: 3px;
+ font-size: .82em;
+ font-weight: bold;
+}
+.PeopleFirstName
+{
+ padding-top: 3px;
+ padding-bottom: 8px;
+ font-size: .82em;
+ text-decoration: none;
+}
+
diff --git a/tools/FSharp_1.9.6.16/doc/rmcstyle-copy.css b/tools/FSharp_1.9.6.16/doc/rmcstyle-copy.css
new file mode 100644
index 00000000..42bc2277
--- /dev/null
+++ b/tools/FSharp_1.9.6.16/doc/rmcstyle-copy.css
@@ -0,0 +1,287 @@
+.title_2ndLvl
+{
+ font-family: tahoma;
+ font-size: 120%;
+ color: #FFFFFF;
+ padding-left: 5px;
+}
+.BODY
+{
+ font-family:verdana;
+}
+A
+{
+ color: #003399;
+}
+.VR
+{
+ background-color: #cccccc;
+ width: 1px;
+}
+.HR
+{
+ background-color: #cccccc;
+ height: 1px;
+}
+.link1
+{
+ font-size:70%;
+ font-family: verdana;
+}
+.link2
+{
+ font-size: 70%;
+ font-family:Verdana;
+ font-style:italic;
+}
+.link3
+{
+ font-style: italic;
+ font-family: Verdana;
+ color: #000000;
+ font-weight: bold;
+}
+.link4
+{
+ font: italic 70% Verdana;
+ color: #000000;
+ text-decoration: none;
+}
+.link5
+{
+ font: 70% Verdana;
+ color: #003399;
+ text-decoration: none;
+}
+.link6
+{
+ font: 70% verdana;
+ color: #003399;
+}
+.text1
+{
+ font: 70% Verdana;
+}
+.text2
+{
+ padding-bottom: 10px;
+ font: 70% Verdana;
+}
+.text3
+{
+ font-size: 120%;
+ font-family:Verdana;
+ color: #000000;
+}
+.text3_w_padding
+{
+ font: 120% Verdana;
+ color: #000000;
+ padding-left:20px;
+}
+.text4
+{
+ font-weight: bold;
+ font-size: 70%;
+ font-family: Verdana;
+ color: #000000;
+}
+.text5
+{
+ padding-left: 5px;
+ font-weight: bold;
+ font-size: 70%;
+ font-family: Verdana;
+ color: #ffffff;
+}
+.text6
+{
+ font: 70%;
+ font-family: verdana;
+}
+.newsTitle
+{
+ font-family: tahoma;
+ font-size: 120%;
+ color: #CCCCCC;
+}
+.areaTitle
+{
+ font-family: tahoma;
+ font-size: 120%;
+ color: #FFFFFF;
+}
+.newsContentTitle
+{
+ font-family: tahoma;
+ font-size: 120%;
+ color: #FFFFFF;
+}
+.areaContentTitle
+{
+ font-family: verdana;
+ font-size: 140%;
+ color: #000000;
+}
+.areaContentTitle_w_pad
+{
+ font-family: verdana;
+ font-size: 140%;
+ color: #000000;
+ padding-left: 20px;
+ padding-top: 20px;
+}
+
+.newsArchiveTitle
+{
+ font-family: verdana;
+ font-size: 150%;
+ color: #000000;
+}
+.FeatureStoryTitle
+{
+ font-family: verdana;
+ font-size: 130%;
+ color: #000000;
+}
+.FeatureStoryByLine
+{
+ font-family: verdana;
+ font-size: 80%;
+ color: #000000;
+}
+.SideBarLink
+{
+ font-family: verdana;
+ font-size: 80%;
+ color: #000000;
+}
+.newsArchiveSubTitle
+{
+ font-family: verdana;
+ font-size: 118%;
+ color: #666666;
+}
+.newsArchiveYear
+{
+ font: bold 80% Verdana;
+ color: #000000;
+ border-bottom: #cccccc 1px solid;
+ border-top: #cccccc 1px solid;
+}
+
+.newsHeadlineTitle
+{
+ font-family: verdana;
+ font-size: 140%;
+ color: #000000;
+}
+
+.newsPublicationDate
+{
+ font-family: Verdana;
+ font-size: 60%;
+ color: #000000;
+ font-weight: bold;
+}
+.newsPublicationSource
+{
+ font-family: Verdana;
+ font-size: 60%;
+ color: #000000;
+ font-weight: bold;
+}
+H1
+{
+ font-family: tahoma;
+ font-weight: bold;
+ font-size: 120%;
+ color: #000000;
+}
+H3
+{
+ font-family: tahoma;
+ font-weight: bold;
+ font-size: 110%;
+ color: #000000;
+}
+P
+{
+ font-family: verdana;
+ font-size: 70%;
+ color: #000000;
+}
+P P
+{
+ font-size: 100%;
+}
+HR
+{
+ color: #cccccc;
+ height: 1px;
+}
+
+
+.groupheading
+{
+ padding-left: 20px;
+ padding-top: 40px;
+ padding-bottom: 10px;
+ font-size: 1.4em;
+ color: #0065CF;
+ font-family:verdana;
+}
+.GroupTitle
+{
+ padding-left: 20px;
+ padding-top: 20px;
+ padding-bottom: 10px;
+ font-size: 1.4em;
+ color: #0065CF;
+}
+LI
+{
+ font-size: 70%;
+ font-family: Verdana;
+}
+LI LI
+{
+ font-size: 100%;
+}
+LI A
+{
+ font-size: 100%;
+}
+.linkbox
+{
+ margin-left: 20px;
+ margin-right: 30px;
+ margin-bottom: 20px;
+ padding-bottom: 10px;
+ width: 175px;
+ float: right;
+ border-right: #0066CC 1px solid;
+ background: #f1f1f1;
+ border-left: #0066CC 1px solid;
+ border-bottom: #0066CC 1px solid;
+}
+.outlineDivTitle
+{
+ background-color: #0066CC;
+ color: #FFFFFF;
+ padding-left: 15px;
+ padding-bottom: 2px;
+ padding-top: 2px;
+ font: bold 70% Verdana;
+ color: #ffffff;
+}
+.outlineDiv
+{
+ padding-left: 20px;
+ background-image: URL(/images/blueTriangle.gif);
+ background-repeat: no-repeat;
+ background-position: 6 8;
+ font: 70% verdana;
+ color: #003399;
+ line-height: 200%;
+}
\ No newline at end of file
diff --git a/tools/FSharp_1.9.6.16/install-mono.sh b/tools/FSharp_1.9.6.16/install-mono.sh
new file mode 100644
index 00000000..c3bc4541
--- /dev/null
+++ b/tools/FSharp_1.9.6.16/install-mono.sh
@@ -0,0 +1,19 @@
+#!/bin/sh
+
+# This script is for use with CLIs on Unix, e.g. Mono
+gacutil -i bin/FSharp.Core.dll
+gacutil -i bin/FSharp.Compiler.dll
+gacutil -i bin/FSharp.PowerPack.dll
+
+# Trying to use --aot on Mono does not seem to work correctly,
+# at least on the pre-release of Mono 2.0.
+# On Un*x, it seems to work in the sense that it creates the
+# .so files, but then fsi.exe does not seem to work at all.
+# On Windows, it just does not work.
+# For this reason, it does not seem to be advisable to try to
+# use it.
+#mono --aot bin/FSharp.Core.dll
+#mono --aot bin/FSharp.Compiler.dll
+#mono --aot bin/FSharp.PowerPack.dll
+#mono --aot bin/fsc.exe
+#mono --aot bin/fsi.exe
diff --git a/tools/FSharp_1.9.6.16/lib/FSharp.Core/array.fs b/tools/FSharp_1.9.6.16/lib/FSharp.Core/array.fs
new file mode 100644
index 00000000..6117a9cb
--- /dev/null
+++ b/tools/FSharp_1.9.6.16/lib/FSharp.Core/array.fs
@@ -0,0 +1,754 @@
+//=========================================================================
+// (c) Microsoft Corporation 2005-2009.
+//=========================================================================
+
+namespace Microsoft.FSharp.Collections
+
+ open System
+ open System.Diagnostics
+ open System.Collections.Generic
+ open System.Diagnostics.CodeAnalysis
+ open Microsoft.FSharp.Core
+ open Microsoft.FSharp.Collections
+ open Microsoft.FSharp.Core.Operators
+ open Microsoft.FSharp.Core.LanguagePrimitives.IntrinsicOperators
+ open Microsoft.FSharp.Primitives.Basics
+
+ /// Basic operations on arrays
+ []
+ []
+ module Array =
+
+ []
+ let length (array: array<_>) = array.Length
+
+ []
+ let init n f = Microsoft.FSharp.Primitives.Basics.Array.init n f
+
+ []
+ let zeroCreate n = Microsoft.FSharp.Primitives.Basics.Array.zeroCreate n
+
+ []
+ let create (n:int) (x:'T) =
+ let array = (zeroCreate n : array<'T>)
+ for i = 0 to n - 1 do
+ array.[i] <- x
+ array
+
+
+ []
+ let isEmpty (array: array<'T>) = (array.Length = 0)
+
+ []
+ let empty<'T> = ([| |] : 'T [])
+
+ []
+ let blit (array1 : array<'T>) sourceIndex (array2: array<'T>) targetIndex count =
+ if sourceIndex < 0 then invalidArg "sourceIndex" "index must be positive"
+ if count < 0 then invalidArg "count" "length must be positive"
+ if targetIndex < 0 then invalidArg "targetIndex" "index must be positive"
+ if sourceIndex + count > array1.Length then invalidArg "sourceIndex" "out of range"
+ if targetIndex + count > array2.Length then invalidArg "targetIndex" "out of range"
+ for i = 0 to count - 1 do
+ array2.[targetIndex+i] <- array1.[sourceIndex + i]
+
+ let rec concatAddLengths (arrs:array<'T> array) i acc =
+ if i >= arrs.Length then acc
+ else concatAddLengths arrs (i+1) (acc + arrs.[i].Length)
+
+ let rec concatBlit (arrs:array>) i j (tgt:array<'T>) =
+ if i < arrs.Length then
+ let h = arrs.[i]
+ let len = h.Length in
+ for i = 0 to len - 1 do
+ tgt.[j+i] <- h.[i]
+ concatBlit arrs (i+1) (j+len) tgt
+
+ []
+ let concatArrays (arrs : array>) =
+ let res = zeroCreate (concatAddLengths arrs 0 0)
+ concatBlit arrs 0 0 res ;
+ res
+
+ []
+ let concat (arrs: seq>) =
+ let arrs = Seq.to_array arrs in
+ concatArrays arrs
+
+ []
+ let collect (f : 'T -> array<'U>) (input : array<'T>) : array<'U>=
+ let inputLength = input.Length
+ let result = Array.zeroCreate> inputLength
+ for i = 0 to inputLength - 1 do
+ result.[i] <- f input.[i]
+ concatArrays result
+
+ []
+ let append (array1:array<'T>) (array2:array<'T>) =
+ let n1 = array1.Length
+ let n2 = array2.Length
+ let res = zeroCreate (n1 + n2)
+ for i = 0 to n1 - 1 do
+ res.[i] <- array1.[i]
+ for i = 0 to n2 - 1 do
+ res.[i+n1] <- array2.[i]
+ res
+
+ []
+ let copy (array: array<'T>) =
+ let len = array.Length
+ let res = zeroCreate len
+ for i = 0 to len - 1 do
+ res.[i] <- array.[i]
+ res
+
+ []
+ let to_list array = Microsoft.FSharp.Primitives.Basics.List.of_array array
+
+ []
+ let of_list xs = Microsoft.FSharp.Primitives.Basics.List.to_array xs
+
+ []
+ let iter f (array: array<'T>) =
+ let len = array.Length
+ for i = 0 to len - 1 do
+ f array.[i]
+
+ []
+ let map (f: 'T -> 'U) (array:array<'T>) =
+ let len = array.Length
+ let res = (zeroCreate len : array<'U>)
+ for i = 0 to len - 1 do
+ res.[i] <- f array.[i]
+ res
+
+ []
+ let iter2 f (array1: array<'T>) (array2: array<'U>) =
+ let f = OptimizedClosures.FastFunc2<_,_,_>.Adapt(f)
+ let len1 = array1.Length
+ if len1 <> array2.Length then invalidArg "array2" "the arrays have different lengths";
+ for i = 0 to len1 - 1 do
+ f.Invoke(array1.[i], array2.[i])
+
+ []
+ let map2 f (array1: array<'T>) (array2: array<'U>) =
+ let f = OptimizedClosures.FastFunc2<_,_,_>.Adapt(f)
+ let len1 = array1.Length
+ if len1 <> array2.Length then invalidArg "array2" "the arrays have different lengths";
+ let res = zeroCreate len1
+ for i = 0 to len1 - 1 do
+ res.[i] <- f.Invoke(array1.[i], array2.[i])
+ res
+
+ []
+ let mapi2 f (array1: array<'T>) (array2: array<'U>) =
+ let f = OptimizedClosures.FastFunc3<_,_,_,_>.Adapt(f)
+ let len1 = array1.Length
+ if len1 <> array2.Length then invalidArg "array2" "the arrays have different lengths";
+ let res = zeroCreate len1
+ for i = 0 to len1 - 1 do
+ res.[i] <- f.Invoke(i,array1.[i], array2.[i])
+ res
+
+ []
+ let iteri f (array:array<'T>) =
+ let f = OptimizedClosures.FastFunc2<_,_,_>.Adapt(f)
+ let len = array.Length
+ for i = 0 to len - 1 do
+ f.Invoke(i, array.[i])
+
+ []
+ let iteri2 f (array1: array<'T>) (array2: array<'U>) =
+ let f = OptimizedClosures.FastFunc3<_,_,_,_>.Adapt(f)
+ let len1 = array1.Length
+ if len1 <> array2.Length then invalidArg "array2" "the arrays have different lengths";
+ for i = 0 to len1 - 1 do
+ f.Invoke(i,array1.[i], array2.[i])
+
+ []
+ let mapi (f : int -> 'T -> 'U) (array: array<'T>) =
+ let f = OptimizedClosures.FastFunc2<_,_,_>.Adapt(f)
+ let len = array.Length
+ let res = zeroCreate<'U> len
+ for i = 0 to len - 1 do
+ res.[i] <- f.Invoke(i,array.[i])
+ res
+
+ []
+ let exists (f: 'T -> bool) (array:array<'T>) =
+ let len = array.Length
+ let rec loop i = i < len && (f array.[i] || loop (i+1))
+ loop 0
+
+ []
+ let exists2 f (array1: array<_>) (array2: array<_>) =
+ let f = OptimizedClosures.FastFunc2<_,_,_>.Adapt(f)
+ let len1 = array1.Length
+ if len1 <> array2.Length then invalidArg "array2" "the arrays have different lengths"
+ let rec loop i = i < len1 && (f.Invoke(array1.[i], array2.[i]) || loop (i+1))
+ loop 0
+
+ []
+ let forall (f: 'T -> bool) (array:array<'T>) =
+ let len = array.Length
+ let rec loop i = i >= len || (f array.[i] && loop (i+1))
+ loop 0
+
+ []
+ let forall2 f (array1: array<_>) (array2: array<_>) =
+ let f = OptimizedClosures.FastFunc2<_,_,_>.Adapt(f)
+ let len1 = array1.Length
+ if len1 <> array2.Length then invalidArg "array2" "the arrays have different lengths"
+ let rec loop i = i >= len1 || (f.Invoke(array1.[i], array2.[i]) && loop (i+1))
+ loop 0
+
+ []
+ let pick f (array: array<_>) =
+ let rec loop i =
+ if i >= array.Length then raise (System.Collections.Generic.KeyNotFoundException()) else
+ match f array.[i] with
+ | None -> loop(i+1)
+ | Some res -> res
+ loop 0
+
+ []
+ let tryPick f (array: array<_>) =
+ let rec loop i =
+ if i >= array.Length then None else
+ match f array.[i] with
+ | None -> loop(i+1)
+ | res -> res
+ loop 0
+
+ []
+ let choose f (array: array<_>) =
+ let res = new System.Collections.Generic.List<_>() // ResizeArray
+ for i = 0 to array.Length - 1 do
+ match f array.[i] with
+ | None -> ()
+ | Some b -> res.Add(b)
+ res.ToArray()
+
+ []
+ let filter f (array: array<_>) =
+ let res = new System.Collections.Generic.List<_>() // ResizeArray
+ for i = 0 to array.Length - 1 do
+ let x = array.[i]
+ if f x then res.Add(x)
+ res.ToArray()
+
+ []
+ let partition f (array: array<_>) =
+ let res1 = new System.Collections.Generic.List<_>() // ResizeArray
+ let res2 = new System.Collections.Generic.List<_>() // ResizeArray
+ for i = 0 to array.Length - 1 do
+ let x = array.[i]
+ if f x then res1.Add(x) else res2.Add(x)
+ res1.ToArray(), res2.ToArray()
+
+ []
+ let find f (array: array<_>) =
+ let rec loop i =
+ if i >= array.Length then raise (System.Collections.Generic.KeyNotFoundException()) else
+ if f array.[i] then array.[i] else loop (i+1)
+ loop 0
+
+ []
+ let tryFind f (array: array<_>) =
+ let rec loop i =
+ if i >= array.Length then None else
+ if f array.[i] then Some array.[i] else loop (i+1)
+ loop 0
+
+ []
+ let zip (array1: array<_>) (array2: array<_>) =
+ let len1 = array1.Length
+ if len1 <> array2.Length then invalidArg "array2" "the arrays have different lengths"
+ let res = zeroCreate len1
+ for i = 0 to len1 - 1 do
+ res.[i] <- (array1.[i],array2.[i])
+ res
+
+ []
+ let zip3 (array1: array<_>) (array2: array<_>) (array3: array<_>) =
+ let len1 = array1.Length
+ if len1 <> array2.Length then invalidArg "array2" "the arrays have different lengths"
+ if len1 <> array3.Length then invalidArg "array3" "the arrays have different lengths"
+ let res = zeroCreate len1
+ for i = 0 to len1 - 1 do
+ res.[i] <- (array1.[i],array2.[i],array3.[i])
+ res
+
+ []
+ let unzip (array: array<_>) =
+ let len = array.Length
+ let res1 = zeroCreate len
+ let res2 = zeroCreate len
+ for i = 0 to len - 1 do
+ let x,y = array.[i]
+ res1.[i] <- x;
+ res2.[i] <- y;
+ res1,res2
+
+ []
+ let unzip3 (array: array<_>) =
+ let len = array.Length
+ let res1 = zeroCreate len
+ let res2 = zeroCreate len
+ let res3 = zeroCreate len
+ for i = 0 to len - 1 do
+ let x,y,z = array.[i]
+ res1.[i] <- x;
+ res2.[i] <- y;
+ res3.[i] <- z;
+ res1,res2,res3
+
+ []
+ let rev (array: array<_>) =
+ let len = array.Length
+ let res = zeroCreate len
+ for i = 0 to len - 1 do
+ res.[(len - i) - 1] <- array.[i]
+ res
+
+ []
+ let fold (f : 'T -> 'U -> 'T) (acc: 'T) (array:array<'U>) =
+ let f = OptimizedClosures.FastFunc2<_,_,_>.Adapt(f)
+ let mutable state = acc
+ let len = array.Length
+ for i = 0 to len - 1 do
+ state <- f.Invoke(state,array.[i])
+ state
+
+ []
+ let foldBack (f : 'T -> 'U -> 'U) (array:array<'T>) (acc: 'U) =
+ let f = OptimizedClosures.FastFunc2<_,_,_>.Adapt(f)
+ let mutable res = acc
+ let len = array.Length
+ for i = len - 1 downto 0 do
+ res <- f.Invoke(array.[i],res)
+ res
+
+
+ []
+ let foldBack2 f (array1:'T1[]) (array2:'T2 []) (acc: 'U) =
+ let f = OptimizedClosures.FastFunc3<_,_,_,_>.Adapt(f)
+ let mutable res = acc
+ let len = array1.Length
+ if len <> array2.Length then invalidArg "array2" "the arrays have different lengths"
+ for i = len - 1 downto 0 do
+ res <- f.Invoke(array1.[i],array2.[i],res)
+ res
+
+ []
+ let fold2 f (acc: 'T) (array1:'T1[]) (array2:'T2 []) =
+ let f = OptimizedClosures.FastFunc3<_,_,_,_>.Adapt(f)
+ let mutable state = acc
+ let len = array1.Length
+ if len <> array2.Length then invalidArg "array2" "the arrays have different lengths"
+ for i = 0 to len - 1 do
+ state <- f.Invoke(state,array1.[i],array2.[i])
+ state
+
+
+ []
+ let foldSubLeft f acc (array : array<_>) start fin =
+ let f = OptimizedClosures.FastFunc2<_,_,_>.Adapt(f)
+ let mutable res = acc
+ for i = start to fin do
+ res <- f.Invoke(res,array.[i])
+ res
+
+ []
+ let foldSubRight f (array : array<_>) start fin acc =
+ let f = OptimizedClosures.FastFunc2<_,_,_>.Adapt(f)
+ let mutable res = acc
+ for i = fin downto start do
+ res <- f.Invoke(array.[i],res)
+ res
+
+ []
+ let scanSubRight f (array : array<_>) start fin initState =
+ let f = OptimizedClosures.FastFunc2<_,_,_>.Adapt(f)
+ let mutable state = initState
+ let res = create (2+fin-start) initState
+ for i = fin downto start do
+ state <- f.Invoke(array.[i],state);
+ res.[i - start] <- state
+ res
+
+ []
+ let scanSubLeft f initState (array : array<_>) start fin =
+ let f = OptimizedClosures.FastFunc2<_,_,_>.Adapt(f)
+ let mutable state = initState
+ let res = create (2+fin-start) initState
+ for i = start to fin do
+ state <- f.Invoke(state,array.[i]);
+ res.[i - start+1] <- state
+ res
+
+ []
+ let scan f acc (array : array<_>) =
+ let arrn = array.Length
+ scanSubLeft f acc array 0 (arrn - 1)
+
+ []
+ let scanBack f (array : array<_>) acc =
+ let arrn = array.Length
+ scanSubRight f array 0 (arrn - 1) acc
+
+ []
+ let reduce f (array : array<_>) =
+ let arrn = array.Length
+ if arrn = 0 then invalidArg "array" "the input array may not be empty"
+ else foldSubLeft f array.[0] array 1 (arrn - 1)
+
+ []
+ let reduceBack f (array : array<_>) =
+ let arrn = array.Length
+ if arrn = 0 then invalidArg "array" "the input array may not be empty"
+ else foldSubRight f array 0 (arrn - 2) array.[arrn - 1]
+
+ []
+ let sortInPlaceWith f (array : array<'T>) =
+ let len = array.Length
+ if len < 2 then ()
+ elif len = 2 then
+ let c = f array.[0] array.[1]
+ if c > 0 then
+ let tmp = array.[0]
+ array.[0] <- array.[1];
+ array.[1] <- tmp
+ else
+ System.Array.Sort(array, ComparisonIdentity.FromFunction(f))
+
+ []
+ let sortInPlaceBy (f: 'T -> 'U) (array : array<'T>) =
+ let len = array.Length
+ if len < 2 then ()
+ elif len = 2 then
+ let c = Operators.compare (f array.[0]) (f array.[1])
+ if c > 0 then
+ let tmp = array.[0]
+ array.[0] <- array.[1];
+ array.[1] <- tmp
+ else
+ System.Array.Sort(array, ComparisonIdentity.FromFunction(fun x y -> Operators.compare (f x) (f y)))
+
+ []
+ let sortWith (f: 'T -> 'T -> int) (array : array<'T>) =
+ let array = copy array
+ sortInPlaceWith f array;
+ array
+
+ []
+ let sortBy f array =
+ let array = copy array
+ sortInPlaceBy f array;
+ array
+
+ []
+ let sort array =
+ sortWith Operators.compare array
+
+ []
+ let sortInPlace array =
+ sortInPlaceWith Operators.compare array
+
+ []
+ let to_seq a = Seq.of_array a
+
+ []
+ let of_seq ie = Seq.to_array ie
+
+ []
+ let findIndex f (array : array<_>) =
+ let len = array.Length
+ let rec go n = if n >= len then raise (System.Collections.Generic.KeyNotFoundException()) elif f array.[n] then n else go (n+1)
+ go 0
+
+ []
+ let tryFindIndex f (array : array<_>) =
+ let len = array.Length
+ let rec go n = if n >= len then None elif f array.[n] then Some n else go (n+1)
+ go 0
+
+ []
+ let permute p (array : array<_>) = Microsoft.FSharp.Primitives.Basics.Array.permute p array
+
+ []
+ let inline sum (array:array< (^T) >) : ^T =
+ let mutable acc = LanguagePrimitives.GenericZero< (^T) >
+ for i = 0 to array.Length - 1 do
+ acc <- Checked.(+) acc array.[i]
+ acc
+
+ []
+ let inline sumBy (f: 'T -> ^U) (array:array<'T>) : ^U =
+ let mutable acc = LanguagePrimitives.GenericZero< (^U) >
+ for i = 0 to array.Length - 1 do
+ acc <- Checked.(+) acc (f array.[i])
+ acc
+
+ []
+ let min (array:array<_>) =
+ if array.Length = 0 then invalidArg "array" "the array is empty"
+ let mutable acc = array.[0]
+ for i = 1 to array.Length - 1 do
+ acc <- Operators.min acc array.[i]
+ acc
+
+ []
+ let minBy f (array:array<_>) =
+ if array.Length = 0 then invalidArg "array" "the array is empty"
+ let mutable acc = f array.[0]
+ let mutable acc_v = array.[0]
+ for i = 1 to array.Length - 1 do
+ let cur = f array.[i]
+ if cur < acc then
+ acc <- cur
+ acc_v <- array.[i]
+ acc_v
+
+ []
+ let max (array:array<_>) =
+ if array.Length = 0 then invalidArg "array" "the array is empty"
+ let mutable acc = array.[0]
+ for i = 1 to array.Length - 1 do
+ acc <- Operators.max acc array.[i]
+ acc
+
+ []
+ let maxBy f (array:array<_>) =
+ if array.Length = 0 then invalidArg "array" "the array is empty"
+ let mutable acc = f array.[0]
+ let mutable acc_v = array.[0]
+ for i = 1 to array.Length - 1 do
+ let cur = f array.[i]
+ if cur > acc then
+ acc <- cur
+ acc_v <- array.[i]
+ acc_v
+
+ []
+ let inline average (array:array<_>) = Seq.average array
+
+ []
+ let inline averageBy f (array:array<_>) = Seq.averageBy f array
+
+ []
+ let sub (array:array<'T>) (startIndex:int) (count:int) =
+ if startIndex < 0 then invalidArg "startIndex" "index must be positive"
+ if count < 0 then invalidArg "count" "length must be positive"
+ if startIndex + count > array.Length then invalidArg "count" "out of range"
+
+ let res = (zeroCreate count : array<'T>)
+ for i = 0 to count - 1 do
+ res.[i] <- array.[startIndex + i]
+ res
+
+
+ []
+ let is_empty array = isEmpty array
+
+ []
+ let get (array:array<_>) n = array.[n]
+
+ []
+ let set (array:array<_>) n v = array.[n] <- v
+
+ []
+ let zero_create n = Array.zeroCreate n
+
+ []
+ let fill (array:array<'T>) (startIndex:int) (count:int) (x:'T) =
+ if startIndex < 0 then invalidArg "startIndex" "index must be positive"
+ if count < 0 then invalidArg "count" "length must be positive"
+ for i = startIndex to startIndex + count - 1 do
+ array.[i] <- x
+
+ []
+ let fold_left f z array = fold f z array
+
+ []
+ let fold_right f array z = foldBack f array z
+
+ []
+ let fold_left2 f z array1 array2 = fold2 f z array1 array2
+
+ []
+ let fold_right2 f array1 array2 z = foldBack2 f array1 array2 z
+
+ []
+ let reduce_left f array = reduce f array
+
+ []
+ let reduce_right f array = reduceBack f array
+
+ []
+ let scan_left f z array = scan f z array
+
+ []
+ let scan_right f array z = scanBack f array z
+
+ []
+ let for_all f array = forall f array
+
+ []
+ let for_all2 f array1 array2 = forall2 f array1 array2
+
+ []
+ let tryfind f array = tryFind f array
+
+ []
+ let find_index f array = findIndex f array
+
+ []
+ let tryfind_index f array = tryFindIndex f array
+
+ []
+ let first f array = tryPick f array
+
+(*
+ []
+ let sort f array = sortInPlaceWith f array
+*)
+
+ []
+ let sort_by f array = sortInPlaceBy f array
+
+ []
+ let inline sum_by f array = sumBy f array
+
+ []
+ let inline average_by f array = averageBy f array
+
+ []
+ let min_by f array = minBy f array
+
+ []
+ let max_by f array = maxBy f array
+
+ []
+ let find_indexi f (array : array<_>) =
+ let len = array.Length
+ let rec go n = if n >= len then raise (System.Collections.Generic.KeyNotFoundException()) elif f n array.[n] then n else go (n+1)
+ go 0
+
+ []
+ let tryfind_indexi f (array : array<_>) =
+ let len = array.Length
+ let rec go n = if n >= len then None elif f n array.[n] then Some n else go (n+1)
+ go 0
+
+
+ []
+ let split array = unzip array
+
+ []
+ let combine array1 array2 = zip array1 array2
+
+ []
+ let make (n:int) (x:'T) = create n x
+
+#if FX_ATLEAST_40
+ module Parallel =
+ open System.Threading
+
+ []
+ let choose f (c: array<'T>) =
+ let inputLength = c.Length
+ let lastInputIndex = inputLength - 1
+
+ let isChosen = zeroCreate inputLength
+ let results = zeroCreate<'U> inputLength
+
+ Parallel.For(0, inputLength, (fun i ->
+ match f c.[i] with
+ | None -> ()
+ | Some v ->
+ isChosen.[i] <- true;
+ results.[i] <- v
+ )) |> ignore
+
+ let mutable outputLength = 0
+ for i = 0 to lastInputIndex do
+ if isChosen.[i] then
+ outputLength <- outputLength + 1
+
+ let output = zeroCreate<'U> outputLength
+ let mutable curr = 0
+ for i = 0 to lastInputIndex do
+ if isChosen.[i] then
+ output.[curr] <- results.[i]
+ curr <- curr + 1
+ output
+
+ []
+ let collect (f : 'T -> array<'U>) (input : array<'T>) : array<'U>=
+ let inputLength = input.Length
+ let result = zeroCreate> inputLength
+ Parallel.For(0, inputLength,
+ (fun i -> result.[i] <- f input.[i])) |> ignore
+ concatArrays result
+
+ []
+ let map (f: 'T -> 'U) (input : array<'T>) : array<'U>=
+ let inputLength = input.Length
+ let result = zeroCreate<'U> inputLength
+ Parallel.For(0, inputLength, fun i ->
+ result.[i] <- f input.[i]) |> ignore
+ result
+
+ []
+ let mapi f (input: array<'T>) =
+ let f = OptimizedClosures.FastFunc2<_,_,_>.Adapt(f)
+ let inputLength = input.Length
+ let result = zeroCreate inputLength
+ Parallel.For(0, inputLength, fun i ->
+ result.[i] <- f.Invoke (i, input.[i])) |> ignore
+ result
+
+ []
+ let iter f (input : array<'T>) =
+ Parallel.For (0, input.Length, fun i -> f input.[i]) |> ignore
+
+ []
+ let iteri f (input : array<'T>) =
+ let f = OptimizedClosures.FastFunc2<_,_,_>.Adapt(f)
+ Parallel.For (0, input.Length, fun i -> f.Invoke(i, input.[i])) |> ignore
+
+ []
+ let init count f =
+ let result = zeroCreate count
+ Parallel.For (0, count, fun i -> result.[i] <- f i) |> ignore
+ result
+
+ []
+ let partition predicate (array : array<'T>) =
+ let inputLength = array.Length
+ let lastInputIndex = inputLength - 1
+
+ let isTrue = zeroCreate inputLength
+ Parallel.For(0, inputLength,
+ fun i -> isTrue.[i] <- predicate array.[i]
+ ) |> ignore
+
+ let mutable trueLength = 0
+ for i in 0 .. lastInputIndex do
+ if isTrue.[i] then trueLength <- trueLength + 1
+
+ let trueResult = zeroCreate<'T> trueLength
+ let falseResult = zeroCreate<'T> (inputLength - trueLength)
+ let mutable iTrue = 0
+ let mutable iFalse = 0
+ for i = 0 to lastInputIndex do
+ if isTrue.[i] then
+ trueResult.[iTrue] <- array.[i]
+ iTrue <- iTrue + 1
+ else
+ falseResult.[iFalse] <- array.[i]
+ iFalse <- iFalse + 1
+
+ (trueResult, falseResult)
+#endif
\ No newline at end of file
diff --git a/tools/FSharp_1.9.6.16/lib/FSharp.Core/array.fsi b/tools/FSharp_1.9.6.16/lib/FSharp.Core/array.fsi
new file mode 100644
index 00000000..9381fdd9
--- /dev/null
+++ b/tools/FSharp_1.9.6.16/lib/FSharp.Core/array.fsi
@@ -0,0 +1,463 @@
+//=========================================================================
+// (c) Microsoft Corporation 2005-2009.
+//=========================================================================
+
+namespace Microsoft.FSharp.Collections
+
+ open System
+ open Microsoft.FSharp.Core
+ open Microsoft.FSharp.Collections
+ open System.Collections.Generic
+
+ /// Basic operations on arrays
+ []
+ []
+ module Array =
+
+ /// Build a new array that contains the elements of the first array followed by the elements of the second array
+ val append: array1:array<'T> -> array2:array<'T> -> array<'T>
+
+ /// Return the average of the elements in the array. If the array is empty an ArgumentException is thrown.
+ val inline average : array:^T array -> ^T
+ when ^T : (static member ( + ) : ^T * ^T -> ^T)
+ and ^T : (static member DivideByInt : ^T*int -> ^T)
+ and ^T : (static member Zero : ^T)
+
+
+ /// Return the average of the elements generated by applying the function to each element of the array.
+ /// If the array is empty an ArgumentException is thrown.
+ val inline averageBy : projection:('T -> ^U) -> array:array<'T> -> ^U
+ when ^U : (static member ( + ) : ^U * ^U -> ^U)
+ and ^U : (static member DivideByInt : ^U*int -> ^U)
+ and ^U : (static member Zero : ^U)
+
+ /// Read a range of elements from the first array and write them into the second.
+ val blit: source:array<'T> -> sourceIndex:int -> target:array<'T> -> targetIndex:int -> count:int -> unit
+
+ /// For each element of the array, apply the given function. Concatenate all the results and return the combined array.
+ val collect : mapping:('T -> array<'U>) -> array:array<'T> -> array<'U>
+
+ /// Build a new array that contains the elements of each of the given sequence of arrays
+ val concat: arrays:seq> -> array<'T>
+
+ /// Build a new array that contains the elements of the given array
+ val copy: array:array<'T> -> array<'T>
+
+ /// Create an array whose elements are all initially the given value.
+ val create: count:int -> value:'T -> array<'T>
+
+ /// Apply the given function to successive elements, returning the first
+ /// result where function returns Some(x) for some x. If the function
+ /// never returns Some(x) then None is returned.
+ val tryPick: chooser:('T -> 'U option) -> array:array<'T> -> 'U option
+
+ /// Fill a range of elements of the array with the given value.
+ val fill: target:array<'T> -> targetIndex:int -> count:int -> value:'T -> unit
+
+ /// Apply the given function to successive elements, returning the first
+ /// result where function returns Some(x) for some x. If the function
+ /// never returns Some(x) then KeyNotFoundException is raised.
+ val pick: chooser:('T -> 'U option) -> array:array<'T> -> 'U
+
+ /// Apply the given function to each element of the array. Return
+ /// the array comprised of the results "x" for each element where
+ /// the function returns Some(x)
+ val choose: chooser:('T -> 'U option) -> array:array<'T> -> 'U array
+
+ /// Return an empty array of the given type
+ []
+ val empty<'T> : array<'T>
+
+ /// Test if any element of the array satisfies the given predicate.
+ ///
+ /// The predicate is applied to the elements of the input array. If any application
+ /// returns true then the overall result is true and no further elements are tested.
+ /// Otherwise, false is returned.
+ val exists: predicate:('T -> bool) -> array:array<'T> -> bool
+
+ /// Test if any pair of corresponding elements of the arrays satisfies the given predicate.
+ ///
+ /// The predicate is applied to matching elements in the two collections up to the lesser of the
+ /// two lengths of the collections. If any application returns true then the overall result is
+ /// true and no further elements are tested. Otherwise, if one collections is longer
+ /// than the other then the ArgumentException exception is raised.
+ /// Otherwise, false is returned.
+ val exists2: predicate:('T1 -> 'T2 -> bool) -> array1:'T1 array -> array2:'T2 array -> bool
+
+ /// Return a new collection containing only the elements of the collection
+ /// for which the given predicate returns "true"
+ val filter: predicate:('T -> bool) -> array:array<'T> -> array<'T>
+
+ /// Return the first element for which the given function returns 'true'.
+ /// Raise KeyNotFoundException if no such element exists.
+ val find: predicate:('T -> bool) -> array:array<'T> -> 'T
+
+ /// Return the index of the first element in the array
+ /// that satisfies the given predicate. Raise KeyNotFoundException if
+ /// none of the elements satisy the predicate.
+ val findIndex: predicate:('T -> bool) -> array:array<'T> -> int
+
+ /// Test if all elements of the array satisfy the given predicate.
+ ///
+ /// The predicate is applied to the elements of the input collection. If any application
+ /// returns false then the overall result is false and no further elements are tested.
+ /// Otherwise, true is returned.
+ val forall: predicate:('T -> bool) -> array:array<'T> -> bool
+
+
+ /// Test if all corresponding elements of the array satisfy the given predicate pairwise.
+ ///
+ /// The predicate is applied to matching elements in the two collections up to the lesser of the
+ /// two lengths of the collections. If any application returns false then the overall result is
+ /// false and no further elements are tested. Otherwise, if one collection is longer
+ /// than the other then the ArgumentException exception is raised.
+ /// Otherwise, true is returned.
+ val forall2: predicate:('T1 -> 'T2 -> bool) -> array1:'T1 array -> array2:'T2 array -> bool
+
+ /// Apply a function to each element of the collection, threading an accumulator argument
+ /// through the computation. If the input function is f and the elements are i0...iN then computes
+ /// f (... (f s i0)...) iN
+ val fold: folder:('State -> 'T -> 'State) -> state:'State -> array: array<'T> -> 'State
+
+ /// Apply a function to each element of the array, threading an accumulator argument
+ /// through the computation. If the input function is f and the elements are i0...iN then computes
+ /// f i0 (...(f iN s))
+ val foldBack: folder:('T -> 'State -> 'State) -> array:array<'T> -> state:'State -> 'State
+
+ /// Apply a function to pairs of elements drawn from the two collections,
+ /// left-to-right, threading an accumulator argument
+ /// through the computation. The two input
+ /// arrays must have the same lengths, otherwise an ArgumentException is
+ /// raised.
+ val fold2: folder:('State -> 'T1 -> 'T2 -> 'State) -> state:'State -> array1:'T1 array -> array2:'T2 array -> 'State
+
+ /// Apply a function to pairs of elements drawn from the two collections, right-to-left,
+ /// threading an accumulator argument through the computation. The two input
+ /// arrays must have the same lengths, otherwise an ArgumentException is
+ /// raised.
+ val foldBack2: folder:('T1 -> 'T2 -> 'State -> 'State) -> array1:'T1 array -> array2:'T2 array -> state:'State -> 'State
+
+ /// Get an element from an array
+ val get: array:array<'T> -> index:int -> 'T
+
+ /// Create an array given the dimension and a generator function to compute the elements.
+ val init: count:int -> initializer:(int -> 'T) -> array<'T>
+
+ /// Create an array where the entries are initially the default value Unchecked.defaultof<'T>.
+ val zeroCreate: count:int -> array<'T>
+
+ /// Return true if the given array is empty, otherwise false
+ val isEmpty: array:array<'T> -> bool
+
+ /// Apply the given function to each element of the array.
+ val iter: action:('T -> unit) -> array:array<'T> -> unit
+
+ /// Apply the given function to pair of elements drawn from matching indices in two arrays. The
+ /// two arrays must have the same lengths, otherwise an ArgumentException is
+ /// raised.
+ val iter2: action:('T1 -> 'T2 -> unit) -> array1:'T1 array -> array2:'T2 array -> unit
+
+ /// Apply the given function to each element of the array. The integer passed to the
+ /// function indicates the index of element.
+ val iteri: action:(int -> 'T -> unit) -> array:array<'T> -> unit
+
+ /// Apply the given function to pair of elements drawn from matching indices in two arrays,
+ /// also passing the index of the elements. The two arrays must have the same lengths,
+ /// otherwise an ArgumentException is raised.
+ val iteri2: action:(int -> 'T1 -> 'T2 -> unit) -> array1:'T1 array -> array2:'T2 array -> unit
+
+ /// Return the length of an array. You can also use property arr.Length.
+ val length: array:array<'T> -> int
+
+ /// Build a new array whose elements are the results of applying the given function
+ /// to each of the elements of the array.
+ val map: mapping:('T -> 'U) -> array:array<'T> -> 'U array
+
+ /// Build a new collection whose elements are the results of applying the given function
+ /// to the corresponding elements of the two collections pairwise. The two input
+ /// arrays must have the same lengths, otherwise an ArgumentException is
+ /// raised.
+ val map2: mapping:('T1 -> 'T2 -> 'U) -> array1:'T1 array -> array2:'T2 array -> 'U array
+
+ /// Build a new collection whose elements are the results of applying the given function
+ /// to the corresponding elements of the two collections pairwise, also passing the index of
+ /// the elements. The two input arrays must have the same lengths, otherwise an ArgumentException is
+ /// raised.
+ val mapi2: mapping:(int -> 'T1 -> 'T2 -> 'U) -> array1:'T1 array -> array2:'T2 array -> 'U array
+
+ /// Build a new array whose elements are the results of applying the given function
+ /// to each of the elements of the array. The integer index passed to the
+ /// function indicates the index of element being transformed.
+ val mapi: mapping:(int -> 'T -> 'U) -> array:array<'T> -> 'U array
+
+ /// Return the greatest of all elements of the array, compared via Operators.max on the function result
+ val max : array:array<'T> -> 'T
+
+ /// Return the greatest of all elements of the array, compared via Operators.max on the function result
+ val maxBy : projection:('T -> 'U) -> array:array<'T> -> 'T
+
+ /// Return the lowest of all elements of the array, compared via Operators.min
+ val min : array:array<'T> -> 'T
+
+ /// Return the lowest of all elements of the array, compared via Operators.min on the function result
+ val minBy : projection:('T -> 'U) -> array:array<'T> -> 'T
+
+ /// Build an array from the given list
+ val of_list: elements:'T list -> array<'T>
+
+ /// Build a new array from the given enumerable object
+ val of_seq: elements:seq<'T> -> array<'T>
+
+ /// Split the collection into two collections, containing the
+ /// elements for which the given predicate returns "true" and "false"
+ /// respectively
+ val partition: predicate:('T -> bool) -> array:array<'T> -> array<'T> * array<'T>
+
+ /// Returns an array with all elements permuted according to the
+ /// specified permutation
+ val permute : indexMap:(int -> int) -> array:array<'T> -> array<'T>
+
+ /// Apply a function to each element of the array, threading an accumulator argument
+ /// through the computation. If the input function is f and the elements are i0...iN
+ /// then computes f (... (f i0 i1)...) iN.
+ /// Raises ArgumentException if the array has size zero.
+ val reduce: reduction:('T -> 'T -> 'T) -> array:array<'T> -> 'T
+
+ /// Apply a function to each element of the array, threading an accumulator argument
+ /// through the computation. If the input function is f and the elements are i0...iN
+ /// then computes f i0 (...(f iN-1 iN)).
+ /// Raises ArgumentException if the array has size zero.
+ val reduceBack: reduction:('T -> 'T -> 'T) -> array:array<'T> -> 'T
+
+ /// Return a new array with the elements in reverse order
+ val rev: array:array<'T> -> array<'T>
+
+ /// Like fold_left, but return the intermediary and final results
+ val scan : folder:('State -> 'T -> 'State) -> state:'State -> array:array<'T> -> 'State array
+
+ /// Like fold_right, but return both the intermediary and final results
+ val scanBack : folder:('T -> 'State -> 'State) -> array:array<'T> -> state:'State -> 'State array
+
+ /// Set an element of an array
+ val set: array:array<'T> -> index:int -> value:'T -> unit
+
+ /// Build a new array that contains the given subrange specified by
+ /// starting index and length.
+ val sub: array:array<'T> -> startIndex:int -> count:int -> array<'T>
+
+ /// Sort the elements of an array, returning a new array. Elements are compared using Operators.compare.
+ val sort: array:array<'T> -> array<'T>
+
+ /// Sort the elements of an array, using the given projection for the keys and returning a new array. Elements are compared using Operators.compare.
+ val sortBy: projection:('T -> 'U) -> array:array<'T> -> array<'T>
+
+ /// Sort the elements of an array, using the given comparison function as the order, returning a new array
+ val sortWith: comparer:('T -> 'T -> int) -> array:array<'T> -> array<'T>
+
+ /// Sort the elements of an array by mutating the array in-place, using the given projection for the keys. Elements are compared using Operators.compare.
+ val sortInPlaceBy: projection:('T -> 'U) -> array:array<'T> -> unit
+
+
+ /// Sort the elements of an array by mutating the array in-place, using the given comparison function as the order
+ val sortInPlaceWith: comparer:('T -> 'T -> int) -> array:array<'T> -> unit
+
+ /// Sort the elements of an array by mutating the array in-place, using the given comparison function. Elements are compared using Operators.compare.
+ val sortInPlace: array:array<'T> -> unit
+
+ /// Return the sum of the elements in the array
+ val inline sum : array: ^T array -> ^T
+ when ^T : (static member ( + ) : ^T * ^T -> ^T)
+ and ^T : (static member Zero : ^T)
+
+
+ /// Return the sum of the results generated by applying the function to each element of the array.
+ val inline sumBy : projection:('T -> ^U) -> array:array<'T> -> ^U
+ when ^U : (static member ( + ) : ^U * ^U -> ^U)
+ and ^U : (static member Zero : ^U)
+
+ /// Build a list from the given array
+ val to_list: array:array<'T> -> 'T list
+
+ /// View the given array as a sequence
+ val to_seq: array:array<'T> -> seq<'T>
+
+ /// Return the first element for which the given function returns true.
+ /// Return None if no such element exists.
+ val tryFind: predicate:('T -> bool) -> array:array<'T> -> 'T option
+
+ /// Return the index of the first element in the array
+ /// that satisfies the given predicate.
+ val tryFindIndex : predicate:('T -> bool) -> array:array<'T> -> int option
+
+ /// Split an array of pairs into two arrays
+ val unzip: array:('T1 * 'T2) array -> ('T1 array * 'T2 array)
+
+ /// Split an array of triples into three arrays
+ val unzip3: array:('T1 * 'T2 * 'T3) array -> ('T1 array * 'T2 array * 'T3 array)
+
+ /// Combine the two arrays into an array of pairs. The two arrays must have equal lengths, otherwise an ArgumentException is
+ /// raised.
+ val zip: array1:'T1 array -> array2:'T2 array -> ('T1 * 'T2) array
+
+ /// Combine three arrays into an array of pairs. The three arrays must have equal lengths, otherwise an ArgumentException is
+ /// raised.
+ val zip3: array1:'T1 array -> array2:'T2 array -> array3:'T3 array -> ('T1 * 'T2 * 'T3) array
+
+#if FX_ATLEAST_40
+ /// Provides parallel operations on arrays
+ module Parallel =
+
+ /// Apply the given function to each element of the array. Return
+ /// the array comprised of the results "x" for each element where
+ /// the function returns Some(x).
+ ///
+ /// Performs the operation in parallel using System.Threading.Parallel.For.
+ /// The order in which the given function is applied to elements of the input array is not specified.
+ val choose: chooser:('T -> 'U option) -> array:'T array -> 'U array
+
+ /// For each element of the array, apply the given function. Concatenate all the results and return the combined array.
+ ///
+ /// Performs the operation in parallel using System.Threading.Parallel.For.
+ /// The order in which the given function is applied to elements of the input array is not specified.
+ val collect : mapping:('T -> array<'U>) -> array:array<'T> -> array<'U>
+
+ /// Build a new array whose elements are the results of applying the given function
+ /// to each of the elements of the array.
+ ///
+ /// Performs the operation in parallel using System.Threading.Parallel.For.
+ /// The order in which the given function is applied to elements of the input array is not specified.
+ val map : mapping:('T -> 'U) -> array:array<'T> -> array<'U>
+
+ /// Build a new array whose elements are the results of applying the given function
+ /// to each of the elements of the array. The integer index passed to the
+ /// function indicates the index of element being transformed.
+ ///
+ /// Performs the operation in parallel using System.Threading.Parallel.For.
+ /// The order in which the given function is applied to elements of the input array is not specified.
+ val mapi: mapping:(int -> 'T -> 'U) -> array:'T array -> 'U array
+
+ /// Apply the given function to each element of the array.
+ ///
+ /// Performs the operation in parallel using System.Threading.Parallel.For.
+ /// The order in which the given function is applied to elements of the input array is not specified.
+ val iter : action:('T -> unit) -> array:array<'T> -> unit
+
+ /// Apply the given function to each element of the array. The integer passed to the
+ /// function indicates the index of element.
+ ///
+ /// Performs the operation in parallel using System.Threading.Parallel.For.
+ /// The order in which the given function is applied to elements of the input array is not specified.
+ val iteri: action:(int -> 'T -> unit) -> array:'T array -> unit
+
+ /// Create an array given the dimension and a generator function to compute the elements.
+ ///
+ /// Performs the operation in parallel using System.Threading.Parallel.For.
+ /// The order in which the given function is applied to indicies is not specified.
+ val init : count:int -> initializer:(int -> 'T) -> array<'T>
+
+ /// Split the collection into two collections, containing the
+ /// elements for which the given predicate returns "true" and "false"
+ /// respectively
+ ///
+ /// Performs the operation in parallel using System.Threading.Parallel.For.
+ /// The order in which the given function is applied to indicies is not specified.
+ val partition : predicate:('T -> bool) -> array:array<'T> -> array<'T> * array<'T>
+#endif
+
+#if DONT_INCLUDE_DEPRECATED
+#else
+ []
+ val combine: array1:'T1 array -> array2:'T2 array -> ('T1 * 'T2) array
+
+ []
+ val split: array:('T1 * 'T2) array -> ('T1 array * 'T2 array)
+
+ []
+ val inline average_by : projection:('T -> ^U) -> array:array<'T> -> ^U
+ when ^U : (static member ( + ) : ^U * ^U -> ^U)
+ and ^U : (static member DivideByInt : ^U*int -> ^U)
+ and ^U : (static member Zero : ^U)
+
+ []
+ val find_index: predicate:('T -> bool) -> array:array<'T> -> int
+
+ []
+ val for_all: predicate:('T -> bool) -> array:array<'T> -> bool
+
+ []
+ val make: count:int -> value:'T -> array<'T>
+
+ []
+ val first: chooser:('T -> 'U option) -> array:array<'T> -> 'U option
+
+ []
+ val for_all2: predicate:('T1 -> 'T2 -> bool) -> array1:'T1 array -> array2:'T2 array -> bool
+
+ []
+ val fold_left: folder:('State -> 'T -> 'State) -> state:'State -> array: array<'T> -> 'State
+
+ /// Apply a function to each element of the array, threading an accumulator argument
+ /// through the computation. If the input function is f and the elements are i0...iN
+ /// then computes f i0 (...(f iN s))
+ []
+ val fold_right: folder:('T -> 'State -> 'State) -> array:array<'T> -> state:'State -> 'State
+
+ /// Apply a function to pairs of elements drawn from the two collections,
+ /// left-to-right, threading an accumulator argument
+ /// through the computation. The two input
+ /// arrays must have the same lengths, otherwise an ArgumentException is
+ /// raised.
+ []
+ val fold_left2: folder:('State -> 'T1 -> 'T2 -> 'State) -> state:'State -> array1:'T1 array -> array2:'T2 array -> 'State
+
+ []
+ val fold_right2: folder:('T1 -> 'T2 -> 'State -> 'State) -> array1:'T1 array -> array2:'T2 array -> state:'State -> 'State
+
+ /// Create an array where the entries are initially the default value Unchecked.defaultof<'T>.
+ []
+ val zero_create: count:int -> array<'T>
+
+ []
+ val is_empty: array:array<'T> -> bool
+
+ []
+ val max_by : projection:('T -> 'U) -> array:array<'T> -> 'T
+
+ []
+ val min_by : projection:('T -> 'U) -> array:array<'T> -> 'T
+
+ []
+ val reduce_left: reduction:('T -> 'T -> 'T) -> array:array<'T> -> 'T
+
+ []
+ val reduce_right: reduction:('T -> 'T -> 'T) -> array:array<'T> -> 'T
+
+ []
+ val scan_left : folder:('State -> 'T -> 'State) -> state:'State -> array:array<'T> -> 'State array
+
+ []
+ val scan_right : folder:('T -> 'State -> 'State) -> array:array<'T> -> state:'State -> 'State array
+
+ /// Sort the elements of an array, using the given projection for the keys. Elements are compared using Operators.compare.
+ []
+ val sort_by: projection:('T -> 'U) -> array:array<'T> -> unit
+
+ []
+ val inline sum_by : projection:('T -> ^U) -> array:array<'T> -> ^U
+ when ^U : (static member ( + ) : ^U * ^U -> ^U)
+ and ^U : (static member Zero : ^U)
+
+
+ []
+ val tryfind: predicate:('T -> bool) -> array:array<'T> -> 'T option
+
+ []
+ val tryfind_index: predicate:('T -> bool) -> array:array<'T> -> int option
+
+ []
+ val tryfind_indexi: predicate:(int -> 'T -> bool) -> array:array<'T> -> int option
+
+ []
+ val find_indexi: predicate:(int -> 'T -> bool) -> array:array<'T> -> int
+
+#endif
diff --git a/tools/FSharp_1.9.6.16/lib/FSharp.Core/array2.fs b/tools/FSharp_1.9.6.16/lib/FSharp.Core/array2.fs
new file mode 100644
index 00000000..596f5b70
--- /dev/null
+++ b/tools/FSharp_1.9.6.16/lib/FSharp.Core/array2.fs
@@ -0,0 +1,160 @@
+//=========================================================================
+// (c) Microsoft Corporation 2005-2009.
+//=========================================================================
+
+namespace Microsoft.FSharp.Collections
+
+ open System.Diagnostics
+ open Microsoft.FSharp.Collections
+ open Microsoft.FSharp.Core
+ open Microsoft.FSharp.Core.LanguagePrimitives.IntrinsicOperators
+ open Microsoft.FSharp.Core.Operators
+ open Microsoft.FSharp.Primitives.Basics
+
+ []
+ []
+ module Array2D =
+
+ // Define the primitive operations.
+ // Note: the "type" syntax is for the type parameter for inline
+ // polymorphic IL. This helps the compiler inline these fragments,
+ // i.e. work out the correspondence between IL and F# type variables.
+
+ []
+ let length1 (arr: 'a[,]) = (# "ldlen.multi 2 0" arr : int #)
+ []
+ let length2 (arr: 'a[,]) = (# "ldlen.multi 2 1" arr : int #)
+ []
+ let base1 (arr: 'a[,]) = arr.GetLowerBound(0)
+ []
+ let base2 (arr: 'a[,]) = arr.GetLowerBound(1)
+ []
+ let get (arr: 'a[,]) (n:int) (m:int) = (# "ldelem.multi 2 !0" type ('a) arr n m : 'a #)
+ []
+ let set (arr: 'a[,]) (n:int) (m:int) (x:'a) = (# "stelem.multi 2 !0" type ('a) arr n m x #)
+
+ []
+ let zeroCreate (n:int) (m:int) = (# "newarr.multi 2 !0" type ('a) n m : 'a[,] #)
+
+ let zeroCreateBased (b1:int) (b2:int) (n1:int) (n2:int) =
+ if (b1 = 0 && b2 = 0) then
+ // Note: this overload is available on Compact Framework and Silverlight
+ (System.Array.CreateInstance(typeof<'a>, [|n1;n2|]) :?> 'a[,])
+ else
+#if FX_NO_BASED_ARRAYS
+ raise (new System.NotSupportedException("arrays with non-zero base may not be created on this platform"))
+#else
+ (System.Array.CreateInstance(typeof<'a>, [|n1;n2|],[|b1;b2|]) :?> 'a[,])
+#endif
+
+ []
+ let zero_create_based b1 b2 n1 n2 = zeroCreateBased b1 b2 n1 n2
+
+ []
+ let createBased b1 b2 n m (x:'a) =
+ let arr = (zeroCreateBased b1 b2 n m : 'a[,])
+ for i = b1 to b1+n - 1 do
+ for j = b2 to b2+m - 1 do
+ arr.[i,j] <- x
+ arr
+
+ []
+ let initBased b1 b2 n m f =
+ let arr = (zeroCreateBased b1 b2 n m : 'a[,])
+ for i = b1 to b1+n - 1 do
+ for j = b2 to b2+m - 1 do
+ arr.[i,j] <- f i j
+ arr
+
+
+ []
+ let create n m (x:'a) =
+ createBased 0 0 n m x
+
+ []
+ let init n m f =
+ initBased 0 0 n m f
+
+ []
+ let iter f arr =
+ let count1 = length1 arr
+ let count2 = length2 arr
+ let b1 = base1 arr
+ let b2 = base2 arr
+ for i = b1 to b1+count1 - 1 do
+ for j = b1 to b2+count2 - 1 do
+ f arr.[i,j]
+
+ []
+ let iteri (f : int -> int -> 'a -> unit) (arr:'a[,]) =
+ let count1 = length1 arr
+ let count2 = length2 arr
+ let b1 = base1 arr
+ let b2 = base2 arr
+ for i = b1 to b1+count1 - 1 do
+ for j = b1 to b2+count2 - 1 do
+ f i j arr.[i,j]
+
+ []
+ let map f arr =
+ initBased (base1 arr) (base2 arr) (length1 arr) (length2 arr) (fun i j -> f arr.[i,j])
+
+ []
+ let mapi f arr =
+ initBased (base1 arr) (base2 arr) (length1 arr) (length2 arr) (fun i j -> f i j arr.[i,j])
+
+ []
+ let copy arr =
+ initBased (base1 arr) (base2 arr) (length1 arr) (length2 arr) (fun i j -> arr.[i,j])
+
+ []
+ let rebase arr =
+ let b1 = base1 arr
+ let b2 = base2 arr
+ init (length1 arr) (length2 arr) (fun i j -> arr.[b1+i,b2+j])
+
+
+ []
+ let copyTo(source: 'a[,],sourceIndex1,sourceIndex2,target: 'a[,],targetIndex1,targetIndex2,count1,count2) =
+ if sourceIndex1 < 0 then invalidArg "sourceIndex1" "index must be positive"
+ if sourceIndex2 < 0 then invalidArg "sourceIndex2" "index must be positive"
+ if targetIndex1 < 0 then invalidArg "targetIndex1" "index must be positive"
+ if targetIndex2 < 0 then invalidArg "targetIndex2" "index must be positive"
+ if sourceIndex1 + count1 > length1 source then invalidArg "count1" "out of range"
+ if sourceIndex2 + count2 > length2 source then invalidArg "count2" "out of range"
+ if targetIndex1 + count1 > length1 target then invalidArg "count1" "out of range"
+ if targetIndex2 + count2 > length2 target then invalidArg "count2" "out of range"
+
+ for i = 0 to count1 - 1 do
+ for j = 0 to count2 - 1 do
+ target.[targetIndex1+i,targetIndex2+j] <- source.[sourceIndex1+i,sourceIndex2+j]
+
+
+ []
+ let zero_create count1 count2 = zeroCreate count1 count2
+
+ []
+ let create_based base1 base2 count1 count2 initial = createBased base1 base2 count1 count2 initial
+
+ []
+ let init_based base1 base2 count1 count2 f = initBased base1 base2 count1 count2 f
+
+ []
+ let sub (source : 'a[,]) sourceIndex1 sourceIndex2 count1 count2 =
+ if sourceIndex1 < 0 then invalidArg "sourceIndex1" "index must be positive"
+ if sourceIndex2 < 0 then invalidArg "sourceIndex2" "index must be positive"
+ if count1 < 0 then invalidArg "count1" "length must be positive"
+ if count2 < 0 then invalidArg "count2" "length must be positive"
+ if sourceIndex1 + count1 > length1 source then invalidArg "count1" "out of range"
+ if sourceIndex2 + count2 > length2 source then invalidArg "count2" "out of range"
+
+ let res = zeroCreate count1 count2
+ for i = 0 to count1 - 1 do
+ for j = 0 to count2 - 1 do
+ res.[i,j] <- source.[sourceIndex1 + i,sourceIndex2 + j]
+ res
+
+ []
+ let blit (source : 'a[,]) sourceIndex1 sourceIndex2 target targetIndex1 targetIndex2 count1 count2 =
+ copyTo(source,sourceIndex1,sourceIndex2,target,targetIndex1,targetIndex2,count1,count2)
+
diff --git a/tools/FSharp_1.9.6.16/lib/FSharp.Core/array2.fsi b/tools/FSharp_1.9.6.16/lib/FSharp.Core/array2.fsi
new file mode 100644
index 00000000..8e1f3c11
--- /dev/null
+++ b/tools/FSharp_1.9.6.16/lib/FSharp.Core/array2.fsi
@@ -0,0 +1,121 @@
+//=========================================================================
+// (c) Microsoft Corporation 2005-2009.
+//=========================================================================
+
+namespace Microsoft.FSharp.Collections
+
+ open System
+ open Microsoft.FSharp.Collections
+ open Microsoft.FSharp.Core
+
+ []
+ []
+ /// Basic operations on 2-dimensional arrays.
+ ///
+ /// F# and .NET multi-dimensional arrays are typically zero-based.
+ /// However, .NET multi-dimensional arrays used in conjunction with external
+ /// libraries (e.g. libraries associated with Visual Basic) be
+ /// non-zero based, using a potentially different base for each dimension.
+ /// The operations in this module will accept such arrays, and
+ /// the basing on an input array will be propogated to a matching output
+ /// array on the Array2D.map and Array2D.mapi operations.
+ /// Non-zero-based arrays can also be created using Array2D.zero_create_based,
+ /// Array2D.create_based and Array2D.init_based.
+ module Array2D =
+
+ /// Fetch the base-index for the first dimension of the array.
+ ///
+ /// See notes on the Array2D module re. zero-basing.
+ val base1: array:'T[,] -> int
+
+ /// Fetch the base-index for the second dimension of the array.
+ ///
+ /// See notes on the Array2D module re. zero-basing.
+ val base2: array:'T[,] -> int
+
+ /// Build a new array whose elements are the same as the input array.
+ ///
+ /// For non-zero-based arrays the basing on an input array will be propogated to the output
+ /// array.
+ val copy: array:'T[,] -> 'T[,]
+
+ /// Read a range of elements from the first array and write them into the second.
+ val blit: source:'T[,] -> sourceIndex1:int -> sourceIndex2:int -> target:'T[,] -> targetIndex1:int -> targetIndex2:int -> length1:int -> length2:int -> unit
+
+ /// Create an array given the dimensions and a generator function to compute the elements.
+ val init: length1:int -> length2:int -> initializer:(int -> int -> 'T) -> 'T[,]
+
+ /// Create an array whose elements are all initially the given value
+ val create: length1:int -> length2:int -> value:'T -> 'T[,]
+
+ /// Create an array where the entries are initially Unchecked.defaultof<'T>.
+ val zeroCreate : length1:int -> length2:int -> 'T[,]
+
+#if FX_NO_BASED_ARRAYS
+#else
+ /// Create a based array given the dimensions and a generator function to compute the elements.
+ val initBased: base1:int -> base2:int -> length1:int -> length2:int -> initializer:(int -> int -> 'T) -> 'T[,]
+
+ /// Create a based array whose elements are all initially the given value
+ val createBased: base1:int -> base2:int -> length1:int -> length2:int -> initial: 'T -> 'T[,]
+
+ /// Create a based array where the entries are initially Unchecked.defaultof<'T>.
+ val zeroCreateBased : base1:int -> base2:int -> length1:int -> length2:int -> 'T[,]
+#endif
+
+ /// Apply the given function to each element of the array.
+ val iter: action:('T -> unit) -> array:'T[,] -> unit
+
+ /// Apply the given function to each element of the array. The integer indicies passed to the
+ /// function indicates the index of element.
+ val iteri: action:(int -> int -> 'T -> unit) -> array:'T[,] -> unit
+
+ /// Return the length of an array in the first dimension
+ val length1: array:'T[,] -> int
+
+ /// Return the length of an array in the second dimension
+ val length2: array:'T[,] -> int
+ /// Build a new array whose elements are the results of applying the given function
+ /// to each of the elements of the array.
+ ///
+ /// For non-zero-based arrays the basing on an input array will be propogated to the output
+ /// array.
+ val map: mapping:('T -> 'U) -> array:'T[,] -> 'U[,]
+
+ /// Build a new array whose elements are the results of applying the given function
+ /// to each of the elements of the array. The integer indices passed to the
+ /// function indicates the element being transformed.
+ ///
+ /// For non-zero-based arrays the basing on an input array will be propogated to the output
+ /// array.
+ val mapi: mapping:(int -> int -> 'T -> 'U) -> array:'T[,] -> 'U[,]
+
+
+ /// Build a new array whose elements are the same as the input array but
+ /// where a non-zero-based input array generates a corresponding zero-based
+ /// output array.
+ val rebase: array:'T[,] -> 'T[,]
+
+ /// Set the value of an element in an array. You can also use the syntax 'array.[index1,index2] <- value'
+ val set: array:'T[,] -> index1:int -> index2:int -> value:'T -> unit
+
+ /// Fetch an element from a 2D array. You can also use the syntax 'array.[index1,index2]'
+ val get: array:'T[,] -> index1:int -> index2:int -> 'T
+
+#if DONT_INCLUDE_DEPRECATED
+#else
+ []
+ val init_based: base1:int -> base2:int -> length1:int -> length2:int -> initializer:(int -> int -> 'T) -> 'T[,]
+
+ []
+ val create_based: base1:int -> base2:int -> length1:int -> length2:int -> initial: 'T -> 'T[,]
+
+ []
+ val zero_create : length1:int -> length2:int -> 'T[,]
+
+ []
+ val zero_create_based : base1:int -> base2:int -> length1:int -> length2:int -> 'T[,]
+
+ []
+ val sub: source:'T[,] -> sourceIndex1:int -> sourceIndex2:int -> count1:int -> count2:int -> 'T[,]
+#endif
diff --git a/tools/FSharp_1.9.6.16/lib/FSharp.Core/array3.fs b/tools/FSharp_1.9.6.16/lib/FSharp.Core/array3.fs
new file mode 100644
index 00000000..04309231
--- /dev/null
+++ b/tools/FSharp_1.9.6.16/lib/FSharp.Core/array3.fs
@@ -0,0 +1,145 @@
+//=========================================================================
+// (c) Microsoft Corporation 2005-2009.
+//=========================================================================
+
+namespace Microsoft.FSharp.Collections
+
+ open System.Diagnostics
+ open Microsoft.FSharp.Collections
+ open Microsoft.FSharp.Core
+ open Microsoft.FSharp.Core.LanguagePrimitives.IntrinsicOperators
+ open Microsoft.FSharp.Core.Operators
+
+ []
+ []
+ module Array3D =
+
+ []
+ let length1 (arr: 'a[,,]) = (# "ldlen.multi 3 0" arr : int #)
+
+ []
+ let length2 (arr: 'a[,,]) = (# "ldlen.multi 3 1" arr : int #)
+
+ []
+ let length3 (arr: 'a[,,]) = (# "ldlen.multi 3 2" arr : int #)
+
+ []
+ let get (arr: 'a[,,]) (n1:int) (n2:int) (n3:int) = (# "ldelem.multi 3 !0" type ('a) arr n1 n2 n3 : 'a #)
+
+ []
+ let set (arr: 'a[,,]) (n1:int) (n2:int) (n3:int) (x:'a) = (# "stelem.multi 3 !0" type ('a) arr n1 n2 n3 x #)
+
+ []
+ let zeroCreate (n1:int) (n2:int) (n3:int) = (# "newarr.multi 3 !0" type ('a) n1 n2 n3 : 'a[,,] #)
+
+ []
+ let create (n1:int) (n2:int) (n3:int) (x:'a) =
+ let arr = (zeroCreate n1 n2 n3 : 'a[,,])
+ for i = 0 to n1 - 1 do
+ for j = 0 to n2 - 1 do
+ for k = 0 to n3 - 1 do
+ arr.[i,j,k] <- x
+ arr
+
+ []
+ let init n1 n2 n3 f =
+ let arr = (zeroCreate n1 n2 n3 : 'a[,,])
+ for i = 0 to n1 - 1 do
+ for j = 0 to n2 - 1 do
+ for k = 0 to n3 - 1 do
+ arr.[i,j,k] <- f i j k
+ arr
+
+ []
+ let iter f arr =
+ let len1 = length1 arr
+ let len2 = length2 arr
+ let len3 = length3 arr
+ for i = 0 to len1 - 1 do
+ for j = 0 to len2 - 1 do
+ for k = 0 to len3 - 1 do
+ f arr.[i,j,k]
+
+ []
+ let map f arr =
+ let len1 = length1 arr
+ let len2 = length2 arr
+ let len3 = length3 arr
+ let res = (zeroCreate len1 len2 len3 : 'b[,,])
+ for i = 0 to len1 - 1 do
+ for j = 0 to len2 - 1 do
+ for k = 0 to len3 - 1 do
+ res.[i,j,k] <- f arr.[i,j,k]
+ res
+
+ []
+ let iteri f arr =
+ let len1 = length1 arr
+ let len2 = length2 arr
+ let len3 = length3 arr
+ for i = 0 to len1 - 1 do
+ for j = 0 to len2 - 1 do
+ for k = 0 to len3 - 1 do
+ f i j k arr.[i,j,k]
+
+ []
+ let mapi f arr =
+ let len1 = length1 arr
+ let len2 = length2 arr
+ let len3 = length3 arr
+ let res = (zeroCreate len1 len2 len3 : 'b[,,])
+ for i = 0 to len1 - 1 do
+ for j = 0 to len2 - 1 do
+ for k = 0 to len3 - 1 do
+ res.[i,j,k] <- f i j k arr.[i,j,k]
+ res
+
+ [
+ 
+ 
+ 
+ 
+