diff --git a/.gitignore b/.gitignore index 03942ba2..15b0563c 100644 --- a/.gitignore +++ b/.gitignore @@ -62,7 +62,8 @@ packages/* !packages/FSharp.Core # FAKE & Paket -packages/FAKE +packages +paket-files .paket/paket.exe .fake diff --git a/build.fsx b/build.fsx index 7e92f16d..ed684152 100644 --- a/build.fsx +++ b/build.fsx @@ -23,6 +23,7 @@ open Fake.DocuHelper open Fake.AssemblyInfoFile open Fake.ReleaseNotesHelper open Fake.StringHelper +open Fake.Testing.NUnit3 open System open System.IO @@ -491,12 +492,11 @@ Target "DataBuild" (fun _ -> build !! "MathNet.Numerics.Data.sln") // -------------------------------------------------------------------------------------- let test target = - let quick p = if hasBuildParam "quick" then { p with ExcludeCategory="LongRunning" } else p - NUnit (fun p -> + let quick p = if hasBuildParam "quick" then { p with Where="!~LongRunning" } else p + NUnit3 (fun p -> { p with - DisableShadowCopy = true - TimeOut = TimeSpan.FromMinutes 60. - OutputFile = "TestResults.xml" } |> quick) target + ShadowCopy = false + TimeOut = TimeSpan.FromMinutes 60. } |> quick) target Target "Test" (fun _ -> test !! "out/test/**/*UnitTests*.dll") "Build" ?=> "Test" diff --git a/packages/.gitattributes b/packages/.gitattributes deleted file mode 100644 index 62544950..00000000 --- a/packages/.gitattributes +++ /dev/null @@ -1 +0,0 @@ -* -text diff --git a/packages/FSharp.Core/FSharp.Core.3.1.2.5.nupkg b/packages/FSharp.Core/FSharp.Core.3.1.2.5.nupkg deleted file mode 100644 index ce4198db..00000000 Binary files a/packages/FSharp.Core/FSharp.Core.3.1.2.5.nupkg and /dev/null differ diff --git a/packages/FSharp.Core/FSharp.Core.nuspec b/packages/FSharp.Core/FSharp.Core.nuspec deleted file mode 100644 index 6ca42c90..00000000 --- a/packages/FSharp.Core/FSharp.Core.nuspec +++ /dev/null @@ -1,30 +0,0 @@ - - - - FSharp.Core - 3.1.2.5 - FSharp.Core for F# 3.1 - F# Software Foundation - F# Software Foundation - https://github.com/fsharp/fsharp/blob/master/LICENSE - https://github.com/fsharp/fsharp - http://fsharp.org/img/logo.png - false - FSharp.Core for F# 3.1 - - FSharp.Core redistributables from Visual F# 3.1.2 - - .NET 2.0 - .NET 4.0 - .NET Portable Profile 7 (portable-net45+netcore45) - .NET Portable Profile 47 (portable-net45+sl5+netcore45) - .NET Portable Profile 78 (portable-net45+netcore45+wp8) - .NET Portable Profile 259 (portable-net45+netcore45+wpa81+wp8) - - FSharp.Core built by F# Software Foundation - - MonoAndroid, MonoTouch, Xamarin.iOS (portable-net45+monoandroid10+monotouch10+xamarinios10) - FSharp.Core for F# 3.1 - F#, FSharp, FSharp.Core - - \ No newline at end of file diff --git a/packages/FSharp.Core/[Content_Types].xml b/packages/FSharp.Core/[Content_Types].xml deleted file mode 100644 index 0506e9c5..00000000 --- a/packages/FSharp.Core/[Content_Types].xml +++ /dev/null @@ -1 +0,0 @@ - \ No newline at end of file diff --git a/packages/FSharp.Core/_rels/.rels b/packages/FSharp.Core/_rels/.rels deleted file mode 100644 index 818ca15d..00000000 --- a/packages/FSharp.Core/_rels/.rels +++ /dev/null @@ -1 +0,0 @@ - \ No newline at end of file diff --git a/packages/FSharp.Core/lib/net20/FSharp.Core.dll b/packages/FSharp.Core/lib/net20/FSharp.Core.dll deleted file mode 100644 index f27c8a07..00000000 Binary files a/packages/FSharp.Core/lib/net20/FSharp.Core.dll and /dev/null differ diff --git a/packages/FSharp.Core/lib/net20/FSharp.Core.optdata b/packages/FSharp.Core/lib/net20/FSharp.Core.optdata deleted file mode 100644 index d635db22..00000000 Binary files a/packages/FSharp.Core/lib/net20/FSharp.Core.optdata and /dev/null differ diff --git a/packages/FSharp.Core/lib/net20/FSharp.Core.sigdata b/packages/FSharp.Core/lib/net20/FSharp.Core.sigdata deleted file mode 100644 index 75d34846..00000000 Binary files a/packages/FSharp.Core/lib/net20/FSharp.Core.sigdata and /dev/null differ diff --git a/packages/FSharp.Core/lib/net20/FSharp.Core.xml b/packages/FSharp.Core/lib/net20/FSharp.Core.xml deleted file mode 100644 index d9862e3f..00000000 --- a/packages/FSharp.Core/lib/net20/FSharp.Core.xml +++ /dev/null @@ -1,9715 +0,0 @@ - - -FSharp.Core - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Gets the tail of the list, which is a list containing all the elements of the list, excluding the first element - - - Gets the number of items contained in the list - - - Gets the element of the list at the given position. - Lists are represented as linked lists so this is an O(n) operation. - The index. - The value at the given index. - - - Gets a value indicating if the list contains no entries - - - Gets the first element of the list - - - Returns an empty list of a particular type - - - Returns a list with head as its first element and tail as its subsequent elements - A new head value for the list. - The existing list. - The list with head appended to the front of tail. - - - The type of immutable singly-linked lists. - - Use the constructors [] and :: (infix) to create values of this type, or - the notation [1;2;3]. Use the values in the List module to manipulate - values of this type, or pattern match against the values directly. - - - Lookup an element in the map. Raise KeyNotFoundException if no binding - exists in the map. - The input key. - Thrown when the key is not found. - The value mapped to the key. - - - Returns true if there are no bindings in the map. - - - The number of bindings in the map. - - - Lookup an element in the map, returning a Some value if the element is in the domain - of the map and None if not. - The input key. - The mapped value, or None if the key is not in the map. - - - Removes an element from the domain of the map. No exception is raised if the element is not present. - The input key. - The resulting map. - - - - - - Tests if an element is in the domain of the map. - The input key. - True if the map contains the given key. - - - Returns a new map with the binding added to the given map. - The input key. - The resulting map. - - - Builds a map that contains the bindings of the given IEnumerable. - The input sequence of key/value pairs. - The resulting map. - - - Immutable maps. Keys are ordered by F# generic comparison. - - Maps based on generic comparison are efficient for small keys. They are not a suitable choice if keys are recursive data structures - or if keys require bespoke comparison semantics. - - All members of this class are thread-safe and may be used concurrently from multiple threads. - - - An abbreviation for the CLI type System.Collections.Generic.List<_> - - - Returns a new set with the elements of the second set removed from the first. - The first input set. - The second input set. - A set containing elements of the first set that are not contained in the second set. - - - Compute the union of the two sets. - The first input set. - The second input set. - The union of the two input sets. - - - Returns the lowest element in the set according to the ordering being used for the set. - - - Returns the highest element in the set according to the ordering being used for the set. - - - A useful shortcut for Set.isEmpty. See the Set module for further operations on sets. - - - The number of elements in the set - - - A useful shortcut for Set.remove. Note this operation produces a new set - and does not mutate the original set. The new set will share many storage - nodes with the original. See the Set module for further operations on sets. - The value to remove from the set. - The result set. - - - Evaluates to "true" if all elements of the second set are in the first. - The set to test against. - True if this set is a superset of otherSet. - - - Evaluates to "true" if all elements of the first set are in the second. - The set to test against. - True if this set is a subset of otherSet. - - - Evaluates to "true" if all elements of the second set are in the first, and at least - one element of the first is not in the second. - The set to test against. - True if this set is a proper superset of otherSet. - - - Evaluates to "true" if all elements of the first set are in the second, and at least - one element of the second is not in the first. - The set to test against. - True if this set is a proper subset of otherSet. - - - - - - A useful shortcut for Set.contains. See the Set module for further operations on sets. - The value to check. - True if the set contains value. - - - A useful shortcut for Set.add. Note this operation produces a new set - and does not mutate the original set. The new set will share many storage - nodes with the original. See the Set module for further operations on sets. - The value to add to the set. - The result set. - - - Create a set containing elements drawn from the given sequence. - The input sequence. - The result set. - - - Immutable sets based on binary trees, where comparison is the - F# structural comparison function, potentially using implementations - of the IComparable interface on key values. - - See the Set module for further operations on sets. - - All members of this class are thread-safe and may be used concurrently from multiple threads. - - - An abbreviation for the type of immutable singly-linked lists. - - Use the constructors [] and :: (infix) to create values of this type, or - the notation [1;2;3]. Use the values in the List module to manipulate - values of this type, or pattern match against the values directly. - - - An abbreviation for the CLI type System.Collections.Generic.IEnumerable<_> - - - Fetches an element from a 2D array. You can also use the syntax array.[index1,index2]. - - The input array. - The index along the first dimension. - The index along the second dimension. - - The value of the array at the given index. - Thrown when the indices are negative or exceed the bounds of the array. - - - Sets the value of an element in an array. You can also use the syntax array.[index1,index2] <- value. - - The input array. - The index along the first dimension. - The index along the second dimension. - The value to set in the array. - Thrown when the indices are negative or exceed the bounds of the array. - - - Builds 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. - - The input array. - - The zero-based output array. - - - Builds 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 propagated to the output - array. - - A function that is applied to transform each element of the array. The two integers - provide the index of the element. - The input array. - - An array whose elements have been transformed by the given mapping. - - - Builds 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. - - A function that is applied to transform each item of the input array. - The input array. - - An array whose elements have been transformed by the given mapping. - - - Returns the length of an array in the second dimension. - - The input array. - - The length of the array in the second dimension. - - - Returns the length of an array in the first dimension. - - The input array. - - The length of the array in the first dimension. - - - Applies the given function to each element of the array. The integer indices passed to the - function indicates the index of element. - - A function to apply to each element of the array with the indices available as an argument. - The input array. - - - Applies the given function to each element of the array. - - A function to apply to each element of the array. - The input array. - - - Creates a based array where the entries are initially Unchecked.defaultof<'T>. - - The base for the first dimension of the array. - The base for the second dimension of the array. - The length of the first dimension of the array. - The length of the second dimension of the array. - - The created array. - Thrown when base1, base2, length1, or length2 is negative. - - - Creates a based array whose elements are all initially the given value. - - The base for the first dimension of the array. - The base for the second dimension of the array. - The length of the first dimension of the array. - The length of the second dimension of the array. - The value to populate the new array. - - The created array. - Thrown when base1, base2, length1, or length2 is negative. - - - Creates a based array given the dimensions and a generator function to compute the elements. - - The base for the first dimension of the array. - The base for the second dimension of the array. - The length of the first dimension of the array. - The length of the second dimension of the array. - A function to produce elements of the array given the two indices. - - The created array. - Thrown when base1, base2, length1, or length2 is negative. - - - Creates an array where the entries are initially Unchecked.defaultof<'T>. - - The length of the first dimension of the array. - The length of the second dimension of the array. - - The created array. - Thrown when length1 or length2 is negative. - - - Creates an array whose elements are all initially the given value. - - The length of the first dimension of the array. - The length of the second dimension of the array. - The value to populate the new array. - - The created array. - Thrown when length1 or length2 is negative. - - - Creates an array given the dimensions and a generator function to compute the elements. - - The length of the first dimension of the array. - The length of the second dimension of the array. - A function to produce elements of the array given the two indices. - - The generated array. - Thrown when either of the lengths is negative. - - - Reads a range of elements from the first array and write them into the second. - - The source array. - The first-dimension index to begin copying from in the source array. - The second-dimension index to begin copying from in the source array. - The target array. - The first-dimension index to begin copying into in the target array. - The second-dimension index to begin copying into in the target array. - The number of elements to copy across the first dimension of the arrays. - The number of elements to copy across the second dimension of the arrays. - Thrown when any of the indices are negative or if either of - the counts are larger than the dimensions of the array allow. - - - Builds 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. - - The input array. - - A copy of the input array. - - - Fetches the base-index for the second dimension of the array. - - The input array. - - The base-index of the second dimension of the array. - - - Fetches the base-index for the first dimension of the array. - - The input array. - - The base-index of the first dimension of the array. - - - Basic operations on 2-dimensional arrays. - - F# and CLI multi-dimensional arrays are typically zero-based. - However, CLI 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 propagated to a matching output - array on the Array2D.map and Array2D.mapi operations. - Non-zero-based arrays can also be created using Array2D.zeroCreateBased, - Array2D.createBased and Array2D.initBased. - - - Creates an array where the entries are initially the "default" value. - The length of the first dimension. - The length of the second dimension. - The length of the third dimension. - The created array. - - - Sets the value of an element in an array. You can also - use the syntax 'array.[index1,index2,index3] <- value'. - The input array. - The index along the first dimension. - The index along the second dimension. - The index along the third dimension. - The value to set at the given index. - - - Builds 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. - The function to transform the elements at each index in the array. - The input array. - The array created from the transformed elements. - - - Builds 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. - The function to transform each element of the array. - The input array. - The array created from the transformed elements. - - - Returns the length of an array in the third dimension. - The input array. - The length of the array in the third dimension. - - - Returns the length of an array in the second dimension. - The input array. - The length of the array in the second dimension. - - - Returns the length of an array in the first dimension - The input array. - The length of the array in the first dimension. - - - Applies the given function to each element of the array. The integer indicies passed to the - function indicates the index of element. - The function to apply to each element of the array. - The input array. - - - Applies the given function to each element of the array. - The function to apply to each element of the array. - The input array. - - - Fetches an element from a 3D array. You can also use the syntax 'array.[index1,index2,index3]' - The input array. - The index along the first dimension. - The index along the second dimension. - The index along the third dimension. - The value at the given index. - - - Creates an array given the dimensions and a generator function to compute the elements. - The length of the first dimension. - The length of the second dimension. - The length of the third dimension. - The function to create an initial value at each index into the array. - The created array. - - - Creates an array whose elements are all initially the given value. - The length of the first dimension. - The length of the second dimension. - The length of the third dimension. - The value of the array elements. - The created array. - - - Basic operations on rank 3 arrays. - - - Sets the value of an element in an array. You can also - use the syntax 'array.[index1,index2,index3,index4] <- value'. - The input array. - The index along the first dimension. - The index along the second dimension. - The index along the third dimension. - The index along the fourth dimension. - The value to set. - - - Fetches an element from a 4D array. You can also use the syntax 'array.[index1,index2,index3,index4]' - The input array. - The index along the first dimension. - The index along the second dimension. - The index along the third dimension. - The index along the fourth dimension. - The value at the given index. - - - Creates an array where the entries are initially the "default" value. - The length of the first dimension. - The length of the second dimension. - The length of the third dimension. - The length of the fourth dimension. - The created array. - - - Returns the length of an array in the fourth dimension. - The input array. - The length of the array in the fourth dimension. - - - Returns the length of an array in the third dimension. - The input array. - The length of the array in the third dimension. - - - Returns the length of an array in the second dimension. - The input array. - The length of the array in the second dimension. - - - Returns the length of an array in the first dimension - The input array. - The length of the array in the first dimension. - - - Creates an array given the dimensions and a generator function to compute the elements. - The length of the first dimension. - The length of the second dimension. - The length of the third dimension. - The length of the fourth dimension. - The function to create an initial value at each index in the array. - The created array. - - - Creates an array whose elements are all initially the given value - The length of the first dimension. - The length of the second dimension. - The length of the third dimension. - The length of the fourth dimension. - The initial value for each element of the array. - The created array. - - - Basic operations on rank 4 arrays. - - - Combines three arrays into an array of pairs. The three arrays must have equal lengths, otherwise an ArgumentException is - raised. - The first input array. - The second input array. - The third input array. - Thrown when the input arrays differ in length. - The array of tupled elements. - - - Combines the two arrays into an array of pairs. The two arrays must have equal lengths, otherwise an ArgumentException is - raised. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - The array of tupled elements. - - - Splits an array of triples into three arrays. - The input array. - The tuple of three arrays. - - - Splits an array of pairs into two arrays. - The input array. - The two arrays. - - - Returns the index of the first element in the array - that satisfies the given predicate. - The function to test the input elements. - The input array. - The index of the first element that satisfies the predicate, or None. - - - Returns the first element for which the given function returns true. - Return None if no such element exists. - The function to test the input elements. - The input array. - The first element that satisfies the predicate, or None. - - - Views the given array as a sequence. - The input array. - The sequence of array elements. - - - Builds a list from the given array. - The input array. - The list of array elements. - - - Returns the sum of the results generated by applying the function to each element of the array. - The function to transform the array elements into the type to be summed. - The input array. - The resulting sum. - - - Returns the sum of the elements in the array. - The input array. - The resulting sum. - - - Sorts the elements of an array by mutating the array in-place, using the given comparison function. - Elements are compared using Operators.compare. - The input array. - - - Sorts the elements of an array by mutating the array in-place, using the given comparison function as the order. - The function to compare pairs of array elements. - The input array. - - - Sorts the elements of an array by mutating the array in-place, using the given projection for the keys. - Elements are compared using Operators.compare. - - This is not a stable sort, i.e. the original order of equal elements is not necessarily preserved. - For a stable sort, consider using Seq.sort. - The function to transform array elements into the type that is compared. - The input array. - - - Sorts the elements of an array, using the given comparison function as the order, returning a new array. - - This is not a stable sort, i.e. the original order of equal elements is not necessarily preserved. - For a stable sort, consider using Seq.sort. - The function to compare pairs of array elements. - The input array. - The sorted array. - - - Sorts the elements of an array, using the given projection for the keys and returning a new array. - Elements are compared using Operators.compare. - - This is not a stable sort, i.e. the original order of equal elements is not necessarily preserved. - For a stable sort, consider using Seq.sort. - The function to transform array elements into the type that is compared. - The input array. - The sorted array. - - - Sorts the elements of an array, returning a new array. Elements are compared using Operators.compare. - - This is not a stable sort, i.e. the original order of equal elements is not necessarily preserved. - For a stable sort, consider using Seq.sort. - The input array. - The sorted array. - - - Builds a new array that contains the given subrange specified by - starting index and length. - The input array. - The index of the first element of the sub array. - The length of the sub array. - The created sub array. - - - Sets an element of an array. - The input array. - The input index. - The input value. - - - Like foldBack, but return both the intermediary and final results. - The function to update the state given the input elements. - The input array. - The initial state. - The array of state values. - - - Like fold, but return the intermediary and final results. - The function to update the state given the input elements. - The initial state. - The input array. - The array of state values. - - - Returns a new array with the elements in reverse order. - The input array. - The reversed array. - - - Applies 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. - The function to reduce a pair of elements to a single element. - The input array. - Thrown when the input array is empty. - The final result of the reductions. - - - Applies 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. - The function to reduce a pair of elements to a single element. - The input array. - Thrown when the input array is empty. - The final result of the redcutions. - - - Returns an array with all elements permuted according to the - specified permutation. - The function that maps input indices to output indices. - The input array. - The output array. - - - Splits the collection into two collections, containing the - elements for which the given predicate returns "true" and "false" - respectively. - The function to test the input elements. - The input array. - A pair of arrays. The first containing the elements the predicate evaluated to true, - and the second containing those evaluated to false. - - - Builds a new array from the given enumerable object. - The input sequence. - The array of elements from the sequence. - - - Builds an array from the given list. - The input list. - The array of elements from the list. - - - Returns the lowest of all elements of the array, compared via Operators.min on the function result. - - Throws ArgumentException for empty arrays. - The function to transform the elements into a type supporting comparison. - The input array. - Thrown when the input array is empty. - The minimum element. - - - Returns the lowest of all elements of the array, compared via Operators.min. - - Throws ArgumentException for empty arrays - The input array. - Thrown when the input array is empty. - The minimum element. - - - Returns the greatest of all elements of the array, compared via Operators.max on the function result. - - Throws ArgumentException for empty arrays. - The function to transform the elements into a type supporting comparison. - The input array. - Thrown when the input array is empty. - The maximum element. - - - Returns the greatest of all elements of the array, compared via Operators.max on the function result. - - Throws ArgumentException for empty arrays. - The input array. - Thrown when the input array is empty. - The maximum element. - - - Builds 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. - The function to transform elements and their indices. - The input array. - The array of transformed elements. - - - Builds 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. - The function to transform pairs of input elements and their indices. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - The array of transformed elements. - - - Builds 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. - The function to transform the pairs of the input elements. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - The array of transformed elements. - - - Builds a new array whose elements are the results of applying the given function - to each of the elements of the array. - The function to transform elements of the array. - The input array. - The array of transformed elements. - - - Returns the length of an array. You can also use property arr.Length. - The input array. - The length of the array. - - - Applies 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. - The function to apply to each index and pair of elements. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - - - Applies the given function to each element of the array. The integer passed to the - function indicates the index of element. - The function to apply to each index and element. - The input array. - - - Applies 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. - The function to apply. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - - - Applies the given function to each element of the array. - The function to apply. - The input array. - - - Returns true if the given array is empty, otherwise false. - The input array. - True if the array is empty. - - - Creates an array where the entries are initially the default value Unchecked.defaultof<'T>. - The length of the array to create. - The created array. - - - Creates an array given the dimension and a generator function to compute the elements. - The number of elements to initialize. - The function to generate the initial values for each index. - The created array. - - - Gets an element from an array. - The input array. - The input index. - The value of the array at the given index. - - - 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. - The function to update the state given the input elements. - The first input array. - The second input array. - The initial state. - Thrown when the input arrays differ in length. - The final state. - - - Applies 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. - The function to update the state given the input elements. - The initial state. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - The final state. - - - Applies 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)) - The function to update the state given the input elements. - The input array. - The initial state. - The final state. - - - Applies 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 - The function to update the state given the input elements. - The initial state. - The input array. - The final state. - - - Tests 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. - The function to test the input elements. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - True if all of the array elements satisfy the predicate. - - - Tests 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. - The function to test the input elements. - The input array. - True if all of the array elements satisfy the predicate. - - - Returns the index of the first element in the array - that satisfies the given predicate. Raise KeyNotFoundException if - none of the elements satisy the predicate. - The function to test the input elements. - The input array. - Thrown if predicate - never returns true. - The index of the first element in the array that satisfies the given predicate. - - - Returns the first element for which the given function returns 'true'. - Raise KeyNotFoundException if no such element exists. - The function to test the input elements. - The input array. - Thrown if predicate - never returns true. - The first element for which predicate returns true. - - - Returns a new collection containing only the elements of the collection - for which the given predicate returns "true". - The function to test the input elements. - The input array. - An array containing the elements for which the given predicate returns true. - - - Tests 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. - The function to test the input elements. - The first input array. - The second input array. - True if any result from predicate is true. - - - Tests 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. - The function to test the input elements. - The input array. - True if any result from predicate is true. - - - Returns an empty array of the given type. - - - Applies the given function to each element of the array. Returns - the array comprised of the results "x" for each element where - the function returns Some(x) - The function to generate options from the elements. - The input array. - The array of results. - - - Applies 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. - The function to generate options from the elements. - The input array. - Thrown if every result from - chooser is None. - The first result. - - - Fills a range of elements of the array with the given value. - The target array. - The index of the first element to set. - The number of elements to set. - The value to set. - - - Applies 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. - The function to transform the array elements into options. - The input array. - The first transformed element that is Some(x). - - - Creates an array whose elements are all initially the given value. - The length of the array to create. - The value for the elements. - The created array. - - - Builds a new array that contains the elements of the given array. - The input array. - A copy of the input array. - - - Builds a new array that contains the elements of each of the given sequence of arrays. - The input sequence of arrays. - The concatenation of the sequence of input arrays. - - - For each element of the array, applies the given function. Concatenates all the results and return the combined array. - The function to create sub-arrays from the input array elements. - The input array. - The concatenation of the sub-arrays. - - - Reads a range of elements from the first array and write them into the second. - The source array. - The starting index of the source array. - The target array. - The starting index of the target array. - The number of elements to copy. - - - Returns the average of the elements generated by applying the function to each element of the array. - The function to transform the array elements before averaging. - The input array. - Thrown when array is empty. - The computed average. - - - Returns the average of the elements in the array. - The input array. - Thrown when array is empty. - The average of the elements in the array. - - - Builds a new array that contains the elements of the first array followed by the elements of the second array. - The first input array. - The second input array. - The resulting array. - - - Basic operations on arrays. - - - Compare using the given comparer function. - A function to compare two values. - An object implementing IComparer using the supplied comparer. - - - Structural comparison. Compare using Operators.compare. - - - Common notions of comparison identity used with sorted data structures. - - - Hash using the given hashing and equality functions. - A function to generate a hash code from a value. - A function to test equality of two values. - An object implementing IEqualityComparer using the supplied functions. - - - Physical hashing (hash on reference identity of objects, and the contents of value types). - Hash using LanguagePrimitives.PhysicalEquality and LanguagePrimitives.PhysicalHash, - That is, for value types use GetHashCode and Object.Equals (if no other optimization available), - and for reference types use System.Runtime.CompilerServices.RuntimeHelpers.GetHashCode and - reference equality. - - - - - - Structural hashing. Hash using Operators.(=) and Operators.hash. - - - Common notions of value identity used with hash tables. - - - Combines the three lists into a list of triples. The lists must have equal lengths. - The first input list. - The second input list. - The third input list. - A single list containing triples of matching elements from the input lists. - - - Combines the two lists into a list of pairs. The two lists must have equal lengths. - The first input list. - The second input list. - A single list containing pairs of matching elements from the input lists. - - - Splits a list of triples into three lists. - The input list. - Three lists of split elements. - - - Splits a list of pairs into two lists. - The input list. - Two lists of split elements. - - - Returns the index of the first element in the list - that satisfies the given predicate. - Return None if no such element exists. - The function to test the input elements. - The input list. - The index of the first element for which the predicate returns true, or None if - every element evaluates to false. - - - Returns the first element for which the given function returns true.. - Return None if no such element exists. - The function to test the input elements. - The input list. - The first element for which the predicate returns true, or None if - every element evaluates to false. - - - Applies the given function to successive elements, returning Some(x) the first - result where function returns Some(x) for some x. If no such element - exists then return None. - The function to generate options from the elements. - The input list. - The first resulting value or None. - - - Views the given list as a sequence. - The input list. - The sequence of elements in the list. - - - Builds an array from the given list. - The input list. - The array containing the elements of the list. - - - Returns the list after removing the first element. - - The input list. - Thrown when the list is empty. - The list after removing the first element. - - - Returns the sum of the results generated by applying the function to each element of the list. - The function to transform the list elements into the type to be summed. - The input list. - The resulting sum. - - - Returns the sum of the elements in the list. - The input list. - The resulting sum. - - - Sorts the given list using Operators.compare. - - This is a stable sort, i.e. the original order of equal elements is preserved. - The input list. - The sorted list. - - - Sorts the given list using keys given by the given projection. Keys are compared using Operators.compare. - - This is a stable sort, i.e. the original order of equal elements is preserved. - The function to transform the list elements into the type to be compared. - The input list. - The sorted list. - - - Sorts the given list using the given comparison function. - - This is a stable sort, i.e. the original order of equal elements is preserved. - The function to compare the list elements. - The input list. - The sorted list. - - - Like foldBack, but returns both the intermediary and final results - The function to update the state given the input elements. - The input list. - The initial state. - The list of states. - - - Applies a function to each element of the collection, threading an accumulator argument - through the computation. Take the second argument, and apply the function to it - and the first element of the list. Then feed this result into the function along - with the second element and so on. Returns the list of intermediate results and the final result. - The function to update the state given the input elements. - The initial state. - The input list. - The list of states. - - - Returns a new list with the elements in reverse order. - The input list. - The reversed list. - - - Creates a list by calling the given generator on each index. - The number of elements to replicate. - The value to replicate - The generated list. - - - Applies 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 i0 (...(f iN-1 iN)). - - Raises System.ArgumentException if list is empty - The function to reduce two list elements to a single element. - The input list. - Thrown when the list is empty. - The final reduced value. - - - Apply a function to each element of the collection, threading an accumulator argument - through the computation. Apply the function to the first two elements of the list. - Then feed this result into the function along with the third element and so on. - Return the final result. If the input function is f and the elements are i0...iN then computes - f (... (f i0 i1) i2 ...) iN. - - Raises System.ArgumentException if list is empty - The function to reduce two list elements to a single element. - The input list. - Thrown when the list is empty. - The final reduced value. - - - Returns a list with all elements permuted according to the - specified permutation. - The function to map input indices to output indices. - The input list. - The permutated list. - - - Applies the given function to successive elements, returning the first - result where function returns Some(x) for some x. If no such - element exists then raise System.Collections.Generic.KeyNotFoundException - The function to generate options from the elements. - The input list. - Thrown when the list is empty. - The first resulting value. - - - Splits the collection into two collections, containing the - elements for which the given predicate returns true and false - respectively. Element order is preserved in both of the created lists. - The function to test the input elements. - The input list. - A list containing the elements for which the predicate evaluated to false and a list - containing the elements for which the predicate evaluated to true. - - - Builds a new list from the given enumerable object. - The input sequence. - The list of elements from the sequence. - - - Builds a list from the given array. - The input array. - The list of elements from the array. - - - Indexes into the list. The first element has index 0. - The input list. - The index to retrieve. - The value at the given index. - - - Returns the lowest of all elements of the list, compared via Operators.min on the function result - - Raises System.ArgumentException if list is empty. - The function to transform list elements into the type to be compared. - The input list. - Thrown when the list is empty. - The minimum value. - - - Returns the lowest of all elements of the list, compared via Operators.min. - - Raises System.ArgumentException if list is empty - The input list. - Thrown when the list is empty. - The minimum value. - - - Returns the greatest of all elements of the list, compared via Operators.max on the function result. - - Raises System.ArgumentException if list is empty. - The function to transform the list elements into the type to be compared. - The input list. - Thrown when the list is empty. - The maximum element. - - - Return the greatest of all elements of the list, compared via Operators.max. - - Raises System.ArgumentException if list is empty - The input list. - Thrown when the list is empty. - The maximum element. - - - Like mapi, but mapping corresponding elements from two lists of equal length. - The function to transform pairs of elements from the two lists and their index. - The first input list. - The second input list. - The list of transformed elements. - - - Builds a new collection whose elements are the results of applying the given function - to each of the elements of the collection. The integer index passed to the - function indicates the index (from 0) of element being transformed. - The function to transform elements and their indices. - The input list. - The list of transformed elements. - - - Builds a new collection whose elements are the results of applying the given function - to the corresponding elements of the three collections simultaneously. - The function to transform triples of elements from the input lists. - The first input list. - The second input list. - The third input list. - The list of transformed elements. - - - Builds a new collection whose elements are the results of applying the given function - to the corresponding elements of the two collections pairwise. - The function to transform pairs of elements from the input lists. - The first input list. - The second input list. - The list of transformed elements. - - - Builds a new collection whose elements are the results of applying the given function - to each of the elements of the collection. - The function to transform elements from the input list. - The input list. - The list of transformed elements. - - - Returns the length of the list. - The input list. - The length of the list. - - - Applies the given function to two collections simultaneously. The - collections must have identical size. The integer passed to the - function indicates the index of element. - The function to apply to a pair of elements from the input lists along with their index. - The first input list. - The second input list. - - - Applies the given function to each element of the collection. The integer passed to the - function indicates the index of element. - The function to apply to the elements of the list along with their index. - The input list. - - - Applies the given function to two collections simultaneously. The - collections must have identical size. - The function to apply to pairs of elements from the input lists. - The first input list. - The second input list. - - - Applies the given function to each element of the collection. - The function to apply to elements from the input list. - The input list. - - - Returns true if the list contains no elements, false otherwise. - The input list. - True if the list is empty. - - - Creates a list by calling the given generator on each index. - The length of the list to generate. - The function to generate an element from an index. - The list of generated elements. - - - Returns the first element of the list. - - The input list. - Thrown when the list is empty. - The first element of the list. - - - Tests if all corresponding elements of the collection 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 System.ArgumentException exception is raised. - Otherwise, true is returned. - The function to test the input elements. - The first input list. - The second input list. - Thrown when the input lists differ in length. - True if all of the pairs of elements satisfy the predicate. - - - Tests if all elements of the collection satisfy the given predicate. - - The predicate is applied to the elements of the input list. If any application - returns false then the overall result is false and no further elements are tested. - Otherwise, true is returned. - The function to test the input elements. - The input list. - True if all of the elements satisfy the predicate. - - - Applies a function to corresponding elements of two collections, threading an accumulator argument - through the computation. The collections must have identical sizes. - If the input function is f and the elements are i0...iN and j0...jN - then computes f i0 j0 (...(f iN jN s)). - The function to update the state given the input elements. - The first input list. - The second input list. - The initial state. - The final state value. - - - Applies 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 i0 (...(f iN s)). - The function to update the state given the input elements. - The input list. - The initial state. - The final state value. - - - Applies a function to corresponding elements of two collections, threading an accumulator argument - through the computation. The collections must have identical sizes. - If the input function is f and the elements are i0...iN and j0...jN - then computes f (... (f s i0 j0)...) iN jN. - The function to update the state given the input elements. - The initial state. - The first input list. - The second input list. - The final state value. - - - Applies a function to each element of the collection, threading an accumulator argument - through the computation. Take the second argument, and apply the function to it - and the first element of the list. Then feed this result into the function along - with the second element and so on. Return the final result. - If the input function is f and the elements are i0...iN then - computes f (... (f s i0) i1 ...) iN. - The function to update the state given the input elements. - The initial state. - The input list. - The final state value. - - - Returns a new collection containing only the elements of the collection - for which the given predicate returns "true" - The function to test the input elements. - The input list. - A list containing only the elements that satisfy the predicate. - - - Returns the index of the first element in the list - that satisfies the given predicate. - Raises KeyNotFoundException if no such element exists. - The function to test the input elements. - The input list. - Thrown if the predicate evaluates to false for all the - elements of the list. - The index of the first element that satisfies the predicate. - - - Returns the first element for which the given function returns true. - Raises KeyNotFoundException if no such element exists. - The function to test the input elements. - The input list. - Thrown if the predicate evaluates to false for - all the elements of the list. - The first element that satisfies the predicate. - - - Tests if any pair of corresponding elements of the lists 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 System.ArgumentException exception is raised. - Otherwise, false is returned. - The function to test the input elements. - The first input list. - The second input list. - Thrown when the input lists differ in length. - True if any pair of elements satisfy the predicate. - - - Tests if any element of the list satisfies the given predicate. - - The predicate is applied to the elements of the input list. If any application - returns true then the overall result is true and no further elements are tested. - Otherwise, false is returned. - The function to test the input elements. - The input list. - True if any element satisfies the predicate. - - - Returns an empty list of the given type. - - - Returns a new list that contains the elements of each the lists in order. - The input sequence of lists. - The resulting concatenated list. - - - For each element of the list, applies the given function. Concatenates all the results and return the combined list. - The function to transform each input element into a sublist to be concatenated. - The input list. - The concatenation of the transformed sublists. - - - Applies the given function to each element of the list. Returns - the list comprised of the results x for each element where - the function returns Some(x) - The function to generate options from the elements. - The input list. - The list comprising the values selected from the chooser function. - - - Returns the average of the elements generated by applying the function to each element of the list. - - Raises System.ArgumentException if list is empty. - The function to transform the list elements into the type to be averaged. - The input list. - Thrown when the list is empty. - The resulting average. - - - Returns the average of the elements in the list. - - Raises System.ArgumentException if list is empty. - The input list. - Thrown when the list is empty. - The resulting average. - - - Returns a new list that contains the elements of the first list - followed by elements of the second. - The first input list. - The second input list. - The resulting list. - - - Basic operations on lists. - - - Returns the key of the first mapping in the collection that satisfies the given predicate. - Returns 'None' if no such element exists. - The function to test the input elements. - The input map. - The first key for which the predicate returns true or None if the predicate evaluates to false for each key/value pair. - - - Evaluates the function on each mapping in the collection. Returns the key for the first mapping - where the function returns 'true'. Raise KeyNotFoundException if no such element exists. - The function to test the input elements. - The input map. - Thrown if the key does not exist in the map. - The first key for which the predicate evaluates true. - - - Lookup an element in the map, returning a Some value if the element is in the domain - of the map and None if not. - The input key. - The input map. - The found Some value or None. - - - Removes an element from the domain of the map. No exception is raised if the element is not present. - The input key. - The input map. - The resulting map. - - - Builds two new maps, one containing the bindings for which the given predicate returns 'true', - and the other the remaining bindings. - The function to test the input elements. - The input map. - A pair of maps in which the first contains the elements for which the predicate returned true - and the second containing the elements for which the predicated returned false. - - - Tests if an element is in the domain of the map. - The input key. - The input map. - True if the map contains the key. - - - Builds a new collection whose elements are the results of applying the given function - to each of the elements of the collection. The key passed to the - function indicates the key of element being transformed. - The function to transform the key/value pairs. - The input map. - The resulting map of keys and transformed values. - - - Returns true if the given predicate returns true for all of the - bindings in the map. - The function to test the input elements. - The input map. - True if the predicate evaluates to true for all of the bindings in the map. - - - Builds a new map containing only the bindings for which the given predicate returns 'true'. - The function to test the key/value pairs. - The input map. - The filtered map. - - - Returns true if the given predicate returns true for one of the - bindings in the map. - The function to test the input elements. - The input map. - True if the predicate returns true for one of the key/value pairs. - - - Applies the given function to each binding in the dictionary - The function to apply to each key/value pair. - The input map. - - - Folds over the bindings in the map - The function to update the state given the input key/value pairs. - The initial state. - The input map. - The final state value. - - - Folds over the bindings in the map. - The function to update the state given the input key/value pairs. - The input map. - The initial state. - The final state value. - - - Searches the map looking for the first element where the given function returns a Some value - The function to generate options from the key/value pairs. - The input map. - The first result. - - - Searches the map looking for the first element where the given function returns a Some value. - The function to generate options from the key/value pairs. - The input map. - The first result. - - - Lookup an element in the map, raising KeyNotFoundException if no binding - exists in the map. - The input key. - The input map. - Thrown when the key does not exist in the map. - The value mapped to the given key. - - - The empty map. - - - Is the map empty? - The input map. - True if the map is empty. - - - Returns an array of all key-value pairs in the mapping. - The array will be ordered by the keys of the map. - The input map. - The array of key/value pairs. - - - Returns a list of all key-value pairs in the mapping. - The list will be ordered by the keys of the map. - The input map. - The list of key/value pairs. - - - Views the collection as an enumerable sequence of pairs. - The sequence will be ordered by the keys of the map. - The input map. - The sequence of key/value pairs. - - - Returns a new map made from the given bindings. - The input sequence of key/value pairs. - The resulting map. - - - Returns a new map made from the given bindings. - The input array of key/value pairs. - The resulting map. - - - Returns a new map made from the given bindings. - The input list of key/value pairs. - The resulting map. - - - Returns a new map with the binding added to the given map. - The input key. - The input value. - The input map. - The resulting map. - - - Functional programming operators related to the Map<_,_> type. - - - Combines the three sequences into a list of triples. The sequences need not have equal lengths: - when one sequence is exhausted any remaining elements in the other - sequences are ignored. - - The first input sequence. - The second input sequence. - The third input sequence. - - The result sequence. - - Thrown when any of the input sequences is null. - - - Combines the two sequences into a list of pairs. The two sequences need not have equal lengths: - when one sequence is exhausted any remaining elements in the other - sequence are ignored. - - The first input sequence. - The second input sequence. - - The result sequence. - - Thrown when either of the input sequences is null. - - - Returns a sequence that yields sliding windows of containing elements drawn from the input - sequence. Each window is returned as a fresh array. - - The number of elements in each window. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - - - Returns a sequence that contains the elements generated by the given computation. - The given initial state argument is passed to the element generator. - For each IEnumerator elements in the stream are generated on-demand by applying the element - generator, until a None value is returned by the element generator. Each call to the element - generator returns a new residual state. - - The stream will be recomputed each time an IEnumerator is requested and iterated for the Seq. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - A function that takes in the current state and returns an option tuple of the next - element of the sequence and the next state value. - The initial state value. - - The result sequence. - - - Returns a sequence that when enumerated returns at most N elements. - - The maximum number of items to enumerate. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Applies the given function to successive elements, returning the first - result where the function returns "Some(x)". - - A function that transforms items from the input sequence into options. - The input sequence. - - The chosen element or None. - - Thrown when the input sequence is null. - - - Returns the index of the first element in the sequence - that satisfies the given predicate. Return None if no such element exists. - - A function that evaluates to a Boolean when given an item in the sequence. - The input sequence. - - The found index or None. - - Thrown when the input sequence is null. - - - Returns the first element for which the given function returns true. - Return None if no such element exists. - - A function that evaluates to a Boolean when given an item in the sequence. - The input sequence. - - The found element or None. - - Thrown when the input sequence is null. - - - Builds a list from the given collection. - - The input sequence. - - The result list. - - Thrown when the input sequence is null. - - - Builds an array from the given collection. - - The input sequence. - - The result array. - - Thrown when the input sequence is null. - - - Returns a sequence that, when iterated, yields elements of the underlying sequence while the - given predicate returns true, and then returns no further elements. - - A function that evaluates to false when no more items should be returned. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns the first N elements of the sequence. - Throws InvalidOperationException - if the count exceeds the number of elements in the sequence. Seq.truncate - returns as many items as the sequence contains instead of throwing an exception. - - The number of items to take. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - Thrown when count exceeds the number of elements - in the sequence. - - - Returns the sum of the results generated by applying the function to each element of the sequence. - The generated elements are summed using the + operator and Zero property associated with the generated type. - - A function to transform items from the input sequence into the type that will be summed. - The input sequence. - - The computed sum. - - - Returns the sum of the elements in the sequence. - - The elements are summed using the + operator and Zero property associated with the generated type. - - The input sequence. - - The computed sum. - - - Applies a key-generating function to each element of a sequence and yield a sequence ordered - by keys. The keys are compared using generic comparison as implemented by Operators.compare. - - This function returns a sequence that digests the whole initial sequence as soon as - that sequence is iterated. As a result this function should not be used with - large or infinite sequences. The function makes no assumption on the ordering of the original - sequence. - - This is a stable sort, that is the original order of equal elements is preserved. - - A function to transform items of the input sequence into comparable keys. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Yields a sequence ordered by keys. - - This function returns a sequence that digests the whole initial sequence as soon as - that sequence is iterated. As a result this function should not be used with - large or infinite sequences. The function makes no assumption on the ordering of the original - sequence. - - This is a stable sort, that is the original order of equal elements is preserved. - - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns a sequence that, when iterated, skips elements of the underlying sequence while the - given predicate returns true, and then yields the remaining elements of the sequence. - - A function that evaluates an element of the sequence to a boolean value. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns a sequence that skips N elements of the underlying sequence and then yields the - remaining elements of the sequence. - - The number of items to skip. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - Thrown when count exceeds the number of elements - in the sequence. - - - Returns a sequence that yields one item only. - - The input item. - - The result sequence of one item. - - - Like fold, but computes on-demand and returns the sequence of intermediary and final results. - - A function that updates the state with each element from the sequence. - The initial state. - The input sequence. - - The resulting sequence of computed states. - - Thrown when the input sequence is null. - - - Applies a function to each element of the sequence, threading an accumulator argument - through the computation. Begin by applying the function to the first two elements. - Then feed this result into the function along with the third element and so on. - Return the final result. - - A function that takes in the current accumulated result and the next - element of the sequence to produce the next accumulated result. - The input sequence. - - The final result of the reduction function. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - - - Builds a new sequence object that delegates to the given sequence object. This ensures - the original sequence cannot be rediscovered and mutated by a type cast. For example, - if given an array the returned sequence will return the elements of the array, but - you cannot cast the returned sequence object to an array. - - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Applies the given function to successive elements, returning the first - x where the function returns "Some(x)". - - A function to transform each item of the input sequence into an option of the output type. - The input sequence. - - The selected element. - - Thrown when the input sequence is null. - Thrown when every item of the sequence - evaluates to None when the given function is applied. - - - Returns a sequence of each element in the input sequence and its predecessor, with the - exception of the first element which is only returned as the predecessor of the second element. - - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Views the given list as a sequence. - - The input list. - - The result sequence. - - - Views the given array as a sequence. - - The input array. - - The result sequence. - - Thrown when the input sequence is null. - - - Computes the nth element in the collection. - - The index of element to retrieve. - The input sequence. - - The nth element of the sequence. - - Thrown when the input sequence is null. - - - Returns the lowest of all elements of the sequence, compared via Operators.min on the function result. - - A function to transform items from the input sequence into comparable keys. - The input sequence. - - The smallest element of the sequence. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - - - Returns the lowest of all elements of the sequence, compared via Operators.min. - - The input sequence. - - The smallest element of the sequence. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - - - Returns the greatest of all elements of the sequence, compared via Operators.max on the function result. - - A function to transform items from the input sequence into comparable keys. - The input sequence. - - The largest element of the sequence. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - - - Returns the greatest of all elements of the sequence, compared via Operators.max - - The input sequence. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - - The largest element of the sequence. - - - Builds a new collection whose elements are the results of applying the given function - to each of the elements of the collection. The integer index passed to the - function indicates the index (from 0) of element being transformed. - - A function to transform items from the input sequence that also supplies the current index. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Builds a new collection whose elements are the results of applying the given function - to the corresponding pairs of elements from the two sequences. If one input sequence is shorter than - the other then the remaining elements of the longer sequence are ignored. - - A function to transform pairs of items from the input sequences. - The first input sequence. - The second input sequence. - - The result sequence. - - Thrown when either of the input sequences is null. - - - Builds a new collection whose elements are the results of applying the given function - to each of the elements of the collection. The given function will be applied - as elements are demanded using the MoveNext method on enumerators retrieved from the - object. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - A function to transform items from the input sequence. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns the length of the sequence - - The input sequence. - - The length of the sequence. - - Thrown when the input sequence is null. - - - Applies the given function to two collections simultaneously. If one sequence is shorter than - the other then the remaining elements of the longer sequence are ignored. - - A function to apply to each pair of elements from the input sequences. - The first input sequence. - The second input sequence. - - Thrown when either of the input sequences is null. - - - Applies the given function to each element of the collection. The integer passed to the - function indicates the index of element. - - A function to apply to each element of the sequence that can also access the current index. - The input sequence. - - Thrown when the input sequence is null. - - - Applies the given function to each element of the collection. - - A function to apply to each element of the sequence. - The input sequence. - - Thrown when the input sequence is null. - - - Generates a new sequence which, when iterated, will return successive - elements by calling the given function. The results of calling the function - will not be saved, that is the function will be reapplied as necessary to - regenerate the elements. The function is passed the index of the item being - generated. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - Iteration can continue up to Int32.MaxValue. - - A function that generates an item in the sequence from a given index. - - The result sequence. - - - Generates a new sequence which, when iterated, will return successive - elements by calling the given function, up to the given count. Each element is saved after its - initialization. The function is passed the index of the item being - generated. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - The maximum number of items to generate for the sequence. - A function that generates an item in the sequence from a given index. - - The result sequence. - - Thrown when count is negative. - - - Returns true if the sequence contains no elements, false otherwise. - - The input sequence. - - True if the sequence is empty; false otherwise. - - Thrown when the input sequence is null. - - - Returns the only element of the sequence. - - The input sequence. - - The last element of the sequence. - - Thrown when the input sequence is null. - Thrown when the input does not have precisely one element. - - - Returns the last element of the sequence. - - The input sequence. - - The last element of the sequence. - - Thrown when the input sequence is null. - Thrown when the input does not have any elements. - - - Returns the first element of the sequence. - - The input sequence. - - The first element of the sequence. - - Thrown when the input sequence is null. - Thrown when the input does not have any elements. - - - Applies a key-generating function to each element of a sequence and yields a sequence of - unique keys. Each unique key contains a sequence of all elements that match - to this key. - - This function returns a sequence that digests the whole initial sequence as soon as - that sequence is iterated. As a result this function should not be used with - large or infinite sequences. The function makes no assumption on the ordering of the original - sequence. - - A function that transforms an element of the sequence into a comparable key. - The input sequence. - - The result sequence. - - - Tests the all pairs of elements drawn from the two sequences satisfy the - given predicate. If one sequence is shorter than - the other then the remaining elements of the longer sequence are ignored. - - A function to test pairs of elements from the input sequences. - The first input sequence. - The second input sequence. - - True if all pairs satisfy the predicate; false otherwise. - - Thrown when either of the input sequences is null. - - - Tests if all elements of the sequence satisfy the given predicate. - - The predicate is applied to the elements of the input sequence. If any application - returns false then the overall result is false and no further elements are tested. - Otherwise, true is returned. - - A function to test an element of the input sequence. - The input sequence. - - True if every element of the sequence satisfies the predicate; false otherwise. - - Thrown when the input sequence is null. - - - Applies 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 - - A function that updates the state with each element from the sequence. - The initial state. - The input sequence. - - The state object after the folding function is applied to each element of the sequence. - - Thrown when the input sequence is null. - - - Returns the index of the first element for which the given function returns true. - - A function to test whether the index of a particular element should be returned. - The input sequence. - - The index of the first element for which the predicate returns true. - - Thrown if no element returns true when - evaluated by the predicate - Thrown when the input sequence is null - - - Returns the first element for which the given function returns true. - - A function to test whether an item in the sequence should be returned. - The input sequence. - - The first element for which the predicate returns true. - - Thrown if no element returns true when - evaluated by the predicate - Thrown when the input sequence is null - - - Returns a new collection containing only the elements of the collection - for which the given predicate returns "true". - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - Remember sequence is lazy, effects are delayed until it is enumerated. - - A synonym for Seq.filter. - - A function to test whether each item in the input sequence should be included in the output. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns a new collection containing only the elements of the collection - for which the given predicate returns "true". This is a synonym for Seq.where. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - Remember sequence is lazy, effects are delayed until it is enumerated. - - A function to test whether each item in the input sequence should be included in the output. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Tests if any pair of corresponding elements of the input sequences satisfies the given predicate. - - The predicate is applied to matching elements in the two sequences 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, false is returned. If one sequence is shorter than - the other then the remaining elements of the longer sequence are ignored. - - A function to test each pair of items from the input sequences. - The first input sequence. - The second input sequence. - - True if any result from the predicate is true; false otherwise. - - Thrown when either of the two input sequences is null. - - - Tests if any element of the sequence satisfies the given predicate. - - The predicate is applied to the elements of the input sequence. If any application - returns true then the overall result is true and no further elements are tested. - Otherwise, false is returned. - - A function to test each item of the input sequence. - The input sequence. - - True if any result from the predicate is true; false otherwise. - - Thrown when the input sequence is null. - - - Creates an empty sequence. - - An empty sequence. - - - Returns a sequence that contains no duplicate entries according to the - generic hash and equality comparisons on the keys returned by the given key-generating function. - If an element occurs multiple times in the sequence then the later occurrences are discarded. - - A function transforming the sequence items into comparable keys. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns a sequence that contains no duplicate entries according to generic hash and - equality comparisons on the entries. - If an element occurs multiple times in the sequence then the later occurrences are discarded. - - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns a sequence that is built from the given delayed specification of a - sequence. - - The input function is evaluated each time an IEnumerator for the sequence - is requested. - - The generating function for the sequence. - - - Applies a key-generating function to each element of a sequence and return a sequence yielding unique - keys and their number of occurrences in the original sequence. - - Note that this function returns a sequence that digests the whole initial sequence as soon as - that sequence is iterated. As a result this function should not be used with - large or infinite sequences. The function makes no assumption on the ordering of the original - sequence. - - A function transforming each item of input sequence into a key to be - compared against the others. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Combines the given enumeration-of-enumerations as a single concatenated - enumeration. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - The input enumeration-of-enumerations. - - The result sequence. - - Thrown when the input sequence is null. - - - Compares two sequences using the given comparison function, element by element. - Returns the first non-zero result from the comparison function. If the end of a sequence - is reached it returns a -1 if the first sequence is shorter and a 1 if the second sequence - is shorter. - - A function that takes an element from each sequence and returns an int. - If it evaluates to a non-zero value iteration is stopped and that value is returned. - The first input sequence. - The second input sequence. - - The first non-zero value from the comparison function. - - Thrown when either of the input sequences - is null. - - - Applies the given function to each element of the sequence and concatenates all the - results. - - Remember sequence is lazy, effects are delayed until it is enumerated. - - A function to transform elements of the input sequence into the sequences - that will then be concatenated. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Applies the given function to each element of the list. Return - the list comprised of the results "x" for each element where - the function returns Some(x). - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not - be accessed concurrently. - - A function to transform items of type T into options of type U. - The input sequence of type T. - - The result sequence. - - Thrown when the input sequence is null. - - - Wraps a loosely-typed System.Collections sequence as a typed sequence. - - The use of this function usually requires a type annotation. - An incorrect type annotation may result in runtime type - errors. - Individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns a sequence that corresponds to a cached version of the input sequence. - This result sequence will have the same elements as the input sequence. The result - can be enumerated multiple times. The input sequence will be enumerated at most - once and only as far as is necessary. Caching a sequence is typically useful when repeatedly - evaluating items in the original sequence is computationally expensive or if - iterating the sequence causes side-effects that the user does not want to be - repeated multiple times. - - Enumeration of the result sequence is thread safe in the sense that multiple independent IEnumerator - values may be used simultaneously from different threads (accesses to - the internal lookaside table are thread safe). Each individual IEnumerator - is not typically thread safe and should not be accessed concurrently. - - Once enumeration of the input sequence has started, - it's enumerator will be kept live by this object until the enumeration has completed. - At that point, the enumerator will be disposed. - - The enumerator may be disposed and underlying cache storage released by - converting the returned sequence object to type IDisposable, and calling the Dispose method - on this object. The sequence object may then be re-enumerated and a fresh enumerator will - be used. - - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns the average of the results generated by applying the function to each element - of the sequence. - - The elements are averaged using the + operator, DivideByInt method and Zero property - associated with the generated type. - - A function applied to transform each element of the sequence. - The input sequence. - - The average. - - Thrown when the input sequence is null. - Thrown when the input sequence has zero elements. - - - Returns the average of the elements in the sequence. - - The elements are averaged using the + operator, DivideByInt method and Zero property - associated with the element type. - - The input sequence. - - The average. - - Thrown when the input sequence is null. - Thrown when the input sequence has zero elements. - - - Wraps the two given enumerations as a single concatenated - enumeration. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed - concurrently. - - The first sequence. - The second sequence. - - The result sequence. - - Thrown when either of the two provided sequences is - null. - - - Basic operations on IEnumerables. - - - Returns a new set with the elements of the second set removed from the first. - The first input set. - The set whose elements will be removed from set1. - The set with the elements of set2 removed from set1. - - - Builds a new collection from the given enumerable object. - The input sequence. - The set containing elements. - - - Returns an ordered view of the collection as an enumerable object. - The input set. - An ordered sequence of the elements of set. - - - Builds an array that contains the elements of the set in order. - The input set. - An ordered array of the elements of set. - - - Builds a set that contains the same elements as the given array. - The input array. - A set containing the elements of array. - - - Builds a list that contains the elements of the set in order. - The input set. - An ordered list of the elements of set. - - - Builds a set that contains the same elements as the given list. - The input list. - A set containing the elements form the input list. - - - Returns the highest element in the set according to the ordering being used for the set. - The input set. - The max value from the set. - - - Returns the lowest element in the set according to the ordering being used for the set. - The input set. - The min value from the set. - - - Returns a new set with the given element removed. No exception is raised if - the set doesn't contain the given element. - The element to remove. - The input set. - The input set with value removed. - - - Splits the set into two sets containing the elements for which the given predicate - returns true and false respectively. - The function to test set elements. - The input set. - A pair of sets with the first containing the elements for which predicate returns - true and the second containing the elements for which predicate returns false. - - - Applies the given function to each element of the set, in order according - to the comparison function. - The function to apply to each element. - The input set. - - - Returns "true" if the set is empty. - The input set. - True if set is empty. - - - Computes the union of a sequence of sets. - The sequence of sets to untion. - The union of the input sets. - - - Computes the union of the two sets. - The first input set. - The second input set. - The union of set1 and set2. - - - Computes the intersection of a sequence of sets. The sequence must be non-empty. - The sequence of sets to intersect. - The intersection of the input sets. - - - Computes the intersection of the two sets. - The first input set. - The second input set. - The intersection of set1 and set2. - - - Tests if all elements of the collection satisfy the given predicate. - If the input function is f and the elements are i0...iN and "j0...jN" - then computes p i0 && ... && p iN. - The function to test set elements. - The input set. - True if all elements of set satisfy predicate. - - - Applies the given accumulating function to all the elements of the set. - The accumulating function. - The input set. - The initial state. - The final state. - - - Applies the given accumulating function to all the elements of the set - The accumulating function. - The initial state. - The input set. - The final state. - - - Returns a new collection containing the results of applying the - given function to each element of the input set. - The function to transform elements of the input set. - The input set. - A set containing the transformed elements. - - - Returns a new collection containing only the elements of the collection - for which the given predicate returns true. - The function to test set elements. - The input set. - The set containing only the elements for which predicate returns true. - - - Tests if any element of the collection satisfies the given predicate. - If the input function is predicate and the elements are i0...iN - then computes p i0 or ... or p iN. - The function to test set elements. - The input set. - True if any element of set satisfies predicate. - - - Returns the number of elements in the set. Same as size. - The input set. - The number of elements in the set. - - - Evaluates to "true" if all elements of the second set are in the first, and at least - one element of the first is not in the second. - The potential superset. - The set to test against. - True if set1 is a proper superset of set2. - - - Evaluates to "true" if all elements of the second set are in the first. - The potential superset. - The set to test against. - True if set1 is a superset of set2. - - - Evaluates to "true" if all elements of the first set are in the second, and at least - one element of the second is not in the first. - The potential subset. - The set to test against. - True if set1 is a proper subset of set2. - - - Evaluates to "true" if all elements of the first set are in the second - The potential subset. - The set to test against. - True if set1 is a subset of set2. - - - Evaluates to "true" if the given element is in the given set. - The element to test. - The input set. - True if element is in set. - - - Returns a new set with an element added to the set. No exception is raised if - the set already contains the given element. - The value to add. - The input set. - A new set containing value. - - - The set containing the given element. - The value for the set to contain. - The set containing value. - - - The empty set for the type 'T. - - - Functional programming operators related to the Set<_> type. - - - Gets the default cancellation token for executing asynchronous computations. - The default CancellationToken. - - - Creates an asynchronous computation that returns the CancellationToken governing the execution - of the computation. - In async { let! token = Async.CancellationToken ...} token can be used to initiate other - asynchronous operations that will cancel cooperatively with this workflow. - An asynchronous computation capable of retrieving the CancellationToken from a computation - expression. - - - Creates an asynchronous computation that executes computation. - If this computation is cancelled before it completes then the computation generated by - running compensation is executed. - The input asynchronous computation. - The function to be run if the computation is cancelled. - An asynchronous computation that runs the compensation if the input computation - is cancelled. - - - Creates an asynchronous computation that queues a work item that runs - its continuation. - A computation that generates a new work item in the thread pool. - - - Creates an asynchronous computation that creates a new thread and runs - its continuation in that thread. - A computation that will execute on a new thread. - - - Creates an asynchronous computation that runs - its continuation using syncContext.Post. If syncContext is null - then the asynchronous computation is equivalent to SwitchToThreadPool(). - The synchronization context to accept the posted computation. - An asynchronous computation that uses the syncContext context to execute. - - - Runs an asynchronous computation, starting immediately on the current operating system - thread. Call one of the three continuations when the operation completes. - If no cancellation token is provided then the default cancellation token - is used. - The asynchronous computation to execute. - The function called on success. - The function called on exception. - The function called on cancellation. - The CancellationToken to associate with the computation. - The default is used if this parameter is not provided. - - - Runs an asynchronous computation, starting immediately on the current operating system - thread. - If no cancellation token is provided then the default cancellation token is used. - The asynchronous computation to execute. - The CancellationToken to associate with the computation. - The default is used if this parameter is not provided. - - - Starts a child computation within an asynchronous workflow. - This allows multiple asynchronous computations to be executed simultaneously. - - This method should normally be used as the immediate - right-hand-side of a let! binding in an F# asynchronous workflow, that is, - - async { ... - let! completor1 = childComputation1 |> Async.StartChild - let! completor2 = childComputation2 |> Async.StartChild - ... - let! result1 = completor1 - let! result2 = completor2 - ... } - - When used in this way, each use of StartChild starts an instance of childComputation - and returns a completor object representing a computation to wait for the completion of the operation. - When executed, the completor awaits the completion of childComputation. - The child computation. - The timeout value in milliseconds. If one is not provided - then the default value of -1 corresponding to System.Threading.Timeout.Infinite. - A new computation that waits for the input computation to finish. - - - Starts the asynchronous computation in the thread pool. Do not await its result. - - If no cancellation token is provided then the default cancellation token is used. - The computation to run asynchronously. - The cancellation token to be associated with the computation. - If one is not supplied, the default cancellation token is used. - - - Creates an asynchronous computation that will sleep for the given time. This is scheduled - using a System.Threading.Timer object. The operation will not block operating system threads - for the duration of the wait. - The number of milliseconds to sleep. - An asynchronous computation that will sleep for the given time. - Thrown when the due time is negative - and not infinite. - - - Runs the asynchronous computation and await its result. - - If an exception occurs in the asynchronous computation then an exception is re-raised by this - function. - - If no cancellation token is provided then the default cancellation token is used. - - The timeout parameter is given in milliseconds. A value of -1 is equivalent to - System.Threading.Timeout.Infinite. - The computation to run. - The amount of time in milliseconds to wait for the result of the - computation before raising a System.TimeoutException. If no value is provided - for timeout then a default of -1 is used to correspond to System.Threading.Timeout.Infinite. - The cancellation token to be associated with the computation. - If one is not supplied, the default cancellation token is used. - The result of the computation. - - - Creates an asynchronous computation that executes all the given asynchronous computations, - initially queueing each as work items and using a fork/join pattern. - - If all child computations succeed, an array of results is passed to the success continuation. - - If any child computation raises an exception, then the overall computation will trigger an - exception, and cancel the others. - - The overall computation will respond to cancellation while executing the child computations. - If cancelled, the computation will cancel any remaining child computations but will still wait - for the other child computations to complete. - A sequence of distinct computations to be parallelized. - A computation that returns an array of values from the sequence of input computations. - - - Generates a scoped, cooperative cancellation handler for use within an asynchronous workflow. - - For example, - async { use! holder = Async.OnCancel interruption ... } - generates an asynchronous computation where, if a cancellation happens any time during - the execution of the asynchronous computation in the scope of holder, then action - interruption is executed on the thread that is performing the cancellation. This can - be used to arrange for a computation to be asynchronously notified that a cancellation - has occurred, e.g. by setting a flag, or deregistering a pending I/O action. - The function that is executed on the thread performing the - cancellation. - An asynchronous computation that triggers the interruption if it is cancelled - before being disposed. - - - Creates an asynchronous computation that runs the given computation and ignores - its result. - The input computation. - A computation that is equivalent to the input computation, but disregards the result. - - - Creates an asynchronous computation that captures the current - success, exception and cancellation continuations. The callback must - eventually call exactly one of the given continuations. - The function that accepts the current success, exception, and cancellation - continuations. - An asynchronous computation that provides the callback with the current continuations. - - - Creates an asynchronous computation in terms of a Begin/End pair of actions in - the style used in CLI APIs. This overlaod should be used if the operation is - qualified by three arguments. For example, - Async.FromBeginEnd(arg1,arg2,arg3,ws.BeginGetWeather,ws.EndGetWeather) - When the computation is run, beginFunc is executed, with - a callback which represents the continuation of the computation. - When the callback is invoked, the overall result is fetched using endFunc. - - The computation will respond to cancellation while waiting for the completion - of the operation. If a cancellation occurs, and cancelAction is specified, then it is - executed, and the computation continues to wait for the completion of the operation. - - If cancelAction is not specified, then cancellation causes the computation - to stop immediately, and subsequent invocations of the callback are ignored. - The first argument for the operation. - The second argument for the operation. - The third argument for the operation. - The function initiating a traditional CLI asynchronous operation. - The function completing a traditional CLI asynchronous operation. - An optional function to be executed when a cancellation is requested. - An asynchronous computation wrapping the given Begin/End functions. - - - Creates an asynchronous computation in terms of a Begin/End pair of actions in - the style used in CLI APIs. This overlaod should be used if the operation is - qualified by two arguments. For example, - Async.FromBeginEnd(arg1,arg2,ws.BeginGetWeather,ws.EndGetWeather) - When the computation is run, beginFunc is executed, with - a callback which represents the continuation of the computation. - When the callback is invoked, the overall result is fetched using endFunc. - - The computation will respond to cancellation while waiting for the completion - of the operation. If a cancellation occurs, and cancelAction is specified, then it is - executed, and the computation continues to wait for the completion of the operation. - - If cancelAction is not specified, then cancellation causes the computation - to stop immediately, and subsequent invocations of the callback are ignored. - The first argument for the operation. - The second argument for the operation. - The function initiating a traditional CLI asynchronous operation. - The function completing a traditional CLI asynchronous operation. - An optional function to be executed when a cancellation is requested. - An asynchronous computation wrapping the given Begin/End functions. - - - Creates an asynchronous computation in terms of a Begin/End pair of actions in - the style used in CLI APIs. This overlaod should be used if the operation is - qualified by one argument. For example, - Async.FromBeginEnd(place,ws.BeginGetWeather,ws.EndGetWeather) - When the computation is run, beginFunc is executed, with - a callback which represents the continuation of the computation. - When the callback is invoked, the overall result is fetched using endFunc. - - The computation will respond to cancellation while waiting for the completion - of the operation. If a cancellation occurs, and cancelAction is specified, then it is - executed, and the computation continues to wait for the completion of the operation. - - If cancelAction is not specified, then cancellation causes the computation - to stop immediately, and subsequent invocations of the callback are ignored. - The argument for the operation. - The function initiating a traditional CLI asynchronous operation. - The function completing a traditional CLI asynchronous operation. - An optional function to be executed when a cancellation is requested. - An asynchronous computation wrapping the given Begin/End functions. - - - Creates an asynchronous computation in terms of a Begin/End pair of actions in - the style used in CLI APIs. For example, - Async.FromBeginEnd(ws.BeginGetWeather,ws.EndGetWeather) - When the computation is run, beginFunc is executed, with - a callback which represents the continuation of the computation. - When the callback is invoked, the overall result is fetched using endFunc. - - The computation will respond to cancellation while waiting for the completion - of the operation. If a cancellation occurs, and cancelAction is specified, then it is - executed, and the computation continues to wait for the completion of the operation. - - If cancelAction is not specified, then cancellation causes the computation - to stop immediately, and subsequent invocations of the callback are ignored. - The function initiating a traditional CLI asynchronous operation. - The function completing a traditional CLI asynchronous operation. - An optional function to be executed when a cancellation is requested. - An asynchronous computation wrapping the given Begin/End functions. - - - Creates an asynchronous computation that executes computation. - If this computation completes successfully then return Choice1Of2 with the returned - value. If this computation raises an exception before it completes then return Choice2Of2 - with the raised exception. - The input computation that returns the type T. - A computation that returns a choice of type T or exception. - - - Raises the cancellation condition for the most recent set of asynchronous computations started - without any specific CancellationToken. Replaces the global CancellationTokenSource with a new - global token source for any asynchronous computations created after this point without any - specific CancellationToken. - - - Creates an asynchronous computation that will wait on the given WaitHandle. - - The computation returns true if the handle indicated a result within the given timeout. - The WaitHandle that can be signalled. - The timeout value in milliseconds. If one is not provided - then the default value of -1 corresponding to System.Threading.Timeout.Infinite. - An asynchronous computation that waits on the given WaitHandle. - - - Creates an asynchronous computation that will wait on the IAsyncResult. - - The computation returns true if the handle indicated a result within the given timeout. - The IAsyncResult to wait on. - The timeout value in milliseconds. If one is not provided - then the default value of -1 corresponding to System.Threading.Timeout.Infinite. - An asynchronous computation that waits on the given IAsyncResult. - - - Creates an asynchronous computation that waits for a single invocation of a CLI - event by adding a handler to the event. Once the computation completes or is - cancelled, the handler is removed from the event. - - The computation will respond to cancellation while waiting for the event. If a - cancellation occurs, and cancelAction is specified, then it is executed, and - the computation continues to wait for the event. - - If cancelAction is not specified, then cancellation causes the computation - to cancel immediately. - The event to handle once. - An optional function to execute instead of cancelling when a - cancellation is issued. - An asynchronous computation that waits for the event to be invoked. - - - Creates three functions that can be used to implement the .NET Asynchronous - Programming Model (APM) for a given asynchronous computation. - - The functions should normally be published as members with prefix Begin, - End and Cancel, and can be used within a type definition as follows: - - let beginAction,endAction,cancelAction = Async.AsBeginEnd (fun arg -> computation) - member x.BeginSomeOperation(arg,callback,state:obj) = beginAction(arg,callback,state) - member x.EndSomeOperation(iar) = endAction(iar) - member x.CancelSomeOperation(iar) = cancelAction(iar) - - - If the asynchronous computation takes no arguments, then AsBeginEnd is used as follows: - - let beginAction,endAction,cancelAction = Async.AsBeginEnd (fun () -> computation) - member x.BeginSomeOperation(callback,state:obj) = beginAction((),callback,state) - member x.EndSomeOperation(iar) = endAction(iar) - member x.CancelSomeOperation(iar) = cancelAction(iar) - - - - If the asynchronous computation takes two arguments, then AsBeginEnd is used as follows: - - let beginAction,endAction,cancelAction = Async.AsBeginEnd (fun arg1 arg2 -> computation) - member x.BeginSomeOperation(arg1,arg2,callback,state:obj) = beginAction((),callback,state) - member x.EndSomeOperation(iar) = endAction(iar) - member x.CancelSomeOperation(iar) = cancelAction(iar) - - - In each case, the resulting API will be familiar to programmers in other CLI languages and - is a useful way to publish asynchronous computations in CLI components. - A function generating the asynchronous computation to split into the traditional - .NET Asynchronous Programming Model. - A tuple of the begin, end, and cancel members. - - - This static class holds members for creating and manipulating asynchronous computations. - - - Creates an asynchronous computation that just returns (). - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of empty else branches in the - async { ... } computation expression syntax. - An asynchronous computation that returns (). - - - Creates an asynchronous computation that runs computation repeatedly - until guard() becomes false. - - A cancellation check is performed whenever the computation is executed. - - The existence of this method permits the use of while in the - async { ... } computation expression syntax. - The function to determine when to stop executing computation. - The function to be executed. Equivalent to the body - of a while expression. - An asynchronous computation that behaves similarly to a while loop when run. - - - Creates an asynchronous computation that runs binder(resource). - The action resource.Dispose() is executed as this computation yields its result - or if the asynchronous computation exits by an exception or by cancellation. - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of use and use! in the - async { ... } computation expression syntax. - The resource to be used and disposed. - The function that takes the resource and returns an asynchronous - computation. - An asynchronous computation that binds and eventually disposes resource. - - - Creates an asynchronous computation that runs computation and returns its result. - If an exception happens then catchHandler(exn) is called and the resulting computation executed instead. - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of try/with in the - async { ... } computation expression syntax. - The input computation. - The function to run when computation throws an exception. - An asynchronous computation that executes computation and calls catchHandler if an - exception is thrown. - - - Creates an asynchronous computation that runs computation. The action compensation is executed - after computation completes, whether computation exits normally or by an exception. If compensation raises an exception itself - the original exception is discarded and the new exception becomes the overall result of the computation. - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of try/finally in the - async { ... } computation expression syntax. - The input computation. - The action to be run after computation completes or raises an - exception (including cancellation). - An asynchronous computation that executes computation and compensation aftewards or - when an exception is raised. - - - Delegates to the input computation. - - The existence of this method permits the use of return! in the - async { ... } computation expression syntax. - The input computation. - The input computation. - - - Creates an asynchronous computation that returns the result v. - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of return in the - async { ... } computation expression syntax. - The value to return from the computation. - An asynchronous computation that returns value when executed. - - - Creates an asynchronous computation that enumerates the sequence seq - on demand and runs body for each element. - - A cancellation check is performed on each iteration of the loop. - - The existence of this method permits the use of for in the - async { ... } computation expression syntax. - The sequence to enumerate. - A function to take an item from the sequence and create - an asynchronous computation. Can be seen as the body of the for expression. - An asynchronous computation that will enumerate the sequence and run body - for each element. - - - Creates an asynchronous computation that runs generator. - - A cancellation check is performed when the computation is executed. - The function to run. - An asynchronous computation that runs generator. - - - Creates an asynchronous computation that first runs computation1 - and then runs computation2, returning the result of computation2. - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of expression sequencing in the - async { ... } computation expression syntax. - The first part of the sequenced computation. - The second part of the sequenced computation. - An asynchronous computation that runs both of the computations sequentially. - - - Creates an asynchronous computation that runs computation, and when - computation generates a result T, runs binder res. - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of let! in the - async { ... } computation expression syntax. - The computation to provide an unbound result. - The function to bind the result of computation. - An asynchronous computation that performs a monadic bind on the result - of computation. - - - - Generate an object used to build asynchronous computations using F# computation expressions. The value - 'async' is a pre-defined instance of this type. - - A cancellation check is performed when the computation is executed. - - - - The type of the async operator, used to build workflows for asynchronous computations. - - - Sends a reply to a PostAndReply message. - The value to send. - - - A handle to a capability to reply to a PostAndReply message. - - - A compositional asynchronous computation, which, when run, will eventually produce a value - of type T, or else raises an exception. - - Asynchronous computations are normally specified using an F# computation expression. - - When run, asynchronous computations have two modes: as a work item (executing synchronous - code), or as a wait item (waiting for an event or I/O completion). - - When run, asynchronous computations can be governed by CancellationToken. This can usually - be specified when the async computation is started. The associated CancellationTokenSource - may be used to cancel the asynchronous computation. Asynchronous computations built using - computation expressions can check the cancellation condition regularly. Synchronous - computations within an asynchronous computation do not automatically check this condition. - - - Publishes the event as a first class event value. - - - Triggers the event using the given parameters. - The parameters for the event. - - - Creates an event object suitable for implementing an arbitrary type of delegate. - The event object. - - - Event implementations for an arbitrary type of delegate. - - - Publishes an observation as a first class value. - - - Triggers an observation using the given parameters. - The event parameters. - - - Creates an observable object. - The created event. - - - Event implementations for the IEvent<_> type. - - - Publishes the event as a first class event value. - - - Triggers the event using the given sender object and parameters. The sender object may be null. - The object triggering the event. - The parameters for the event. - - - Creates an event object suitable for delegate types following the standard .NET Framework convention of a first 'sender' argument. - The created event. - - - Event implementations for a delegate types following the standard .NET Framework convention of a first 'sender' argument. - - - - - - A delegate type associated with the F# event type IEvent<_> - The object that fired the event. - The event arguments. - - - Remove a listener delegate from an event listener store. - The delegate to be removed from the event listener store. - - - Connect a handler delegate object to the event. A handler can - be later removed using RemoveHandler. The listener will - be invoked when the event is fired. - A delegate to be invoked when the event is fired. - - - First class event values for arbitrary delegate types. - - F# gives special status to member properties compatible with type IDelegateEvent and - tagged with the CLIEventAttribute. In this case the F# compiler generates approriate - CLI metadata to make the member appear to other CLI languages as a CLI event. - - - First-class listening points (i.e. objects that permit you to register a callback - activated when the event is triggered). - - - First class event values for CLI events conforming to CLI Framework standards. - - - The type of delayed computations. - - Use the values in the Lazy module to manipulate - values of this type, and the notation lazy expr to create values - of type . - - - Raises a timeout exception if a message not received in this amount of time. By default - no timeout is used. - - - Occurs when the execution of the agent results in an exception. - - - Occurs when the execution of the agent results in an exception. - - - Raises a timeout exception if a message not received in this amount of time. By default - no timeout is used. - - - Returns the number of unprocessed messages in the message queue of the agent. - - - Occurs when the execution of the agent results in an exception. - - - Scans for a message by looking through messages in arrival order until scanner - returns a Some value. Other messages remain in the queue. - - This method is for use within the body of the agent. For each agent, at most - one concurrent reader may be active, so no more than one concurrent call to - Receive, TryReceive, Scan and/or TryScan may be active. - The function to return None if the message is to be skipped - or Some if the message is to be processed and removed from the queue. - An optional timeout in milliseconds. Defaults to -1 which corresponds - to System.Threading.Timeout.Infinite. - An asynchronous computation that scanner built off the read message. - - - Waits for a message. This will consume the first message in arrival order. - - This method is for use within the body of the agent. - - Returns None if a timeout is given and the timeout is exceeded. - - This method is for use within the body of the agent. For each agent, at most - one concurrent reader may be active, so no more than one concurrent call to - Receive, TryReceive, Scan and/or TryScan may be active. - An optional timeout in milliseconds. Defaults to -1 which - corresponds to System.Threading.Timeout.Infinite. - An asynchronous computation that returns the received message or - None if the timeout is exceeded. - - - Like PostAndReply, but returns None if no reply within the timeout period. - The function to incorporate the AsyncReplyChannel into - the message to be sent. - An optional timeout parameter (in milliseconds) to wait for a reply message. - Defaults to -1 which corresponds to System.Threading.Timeout.Infinite. - The reply from the agent or None if the timeout expires. - - - Starts the agent. - - - Creates and starts an agent. The body function is used to generate the asynchronous - computation executed by the agent. - The function to produce an asynchronous computation that will be executed - as the read loop for the MailboxProcessor when Start is called. - An optional cancellation token for the body. - Defaults to Async.DefaultCancellationToken. - The created MailboxProcessor. - - - Scans for a message by looking through messages in arrival order until scanner - returns a Some value. Other messages remain in the queue. - - Returns None if a timeout is given and the timeout is exceeded. - - This method is for use within the body of the agent. For each agent, at most - one concurrent reader may be active, so no more than one concurrent call to - Receive, TryReceive, Scan and/or TryScan may be active. - The function to return None if the message is to be skipped - or Some if the message is to be processed and removed from the queue. - An optional timeout in milliseconds. Defaults to -1 which corresponds - to System.Threading.Timeout.Infinite. - An asynchronous computation that scanner built off the read message. - Thrown when the timeout is exceeded. - - - Waits for a message. This will consume the first message in arrival order. - - This method is for use within the body of the agent. - - This method is for use within the body of the agent. For each agent, at most - one concurrent reader may be active, so no more than one concurrent call to - Receive, TryReceive, Scan and/or TryScan may be active. - An optional timeout in milliseconds. Defaults to -1 which corresponds - to System.Threading.Timeout.Infinite. - An asynchronous computation that returns the received message. - Thrown when the timeout is exceeded. - - - Like AsyncPostAndReply, but returns None if no reply within the timeout period. - The function to incorporate the AsyncReplyChannel into - the message to be sent. - An optional timeout parameter (in milliseconds) to wait for a reply message. - Defaults to -1 which corresponds to System.Threading.Timeout.Infinite. - An asynchronous computation that will return the reply or None if the timeout expires. - - - Posts a message to an agent and await a reply on the channel, synchronously. - - The message is generated by applying buildMessage to a new reply channel - to be incorporated into the message. The receiving agent must process this - message and invoke the Reply method on this reply channel precisely once. - The function to incorporate the AsyncReplyChannel into - the message to be sent. - An optional timeout parameter (in milliseconds) to wait for a reply message. - Defaults to -1 which corresponds to System.Threading.Timeout.Infinite. - The reply from the agent. - - - Posts a message to an agent and await a reply on the channel, asynchronously. - - The message is generated by applying buildMessage to a new reply channel - to be incorporated into the message. The receiving agent must process this - message and invoke the Reply method on this reply channel precisely once. - The function to incorporate the AsyncReplyChannel into - the message to be sent. - An optional timeout parameter (in milliseconds) to wait for a reply message. - Defaults to -1 which corresponds to System.Threading.Timeout.Infinite. - An asychronous computation that will wait for the reply from the agent. - - - Posts a message to the message queue of the MailboxProcessor, asynchronously. - The message to post. - - - Creates an agent. The body function is used to generate the asynchronous - computation executed by the agent. This function is not executed until - Start is called. - The function to produce an asynchronous computation that will be executed - as the read loop for the MailboxProcessor when Start is called. - An optional cancellation token for the body. - Defaults to Async.DefaultCancellationToken. - The created MailboxProcessor. - - - A message-processing agent which executes an asynchronous computation. - - The agent encapsulates a message queue that supports multiple-writers and - a single reader agent. Writers send messages to the agent by using the Post - method and its variations. - - The agent may wait for messages using the Receive or TryReceive methods or - scan through all available messages using the Scan or TryScan method. - - - - - - Connects a listener function to the observable. The listener will - be invoked for each observation. The listener can be removed by - calling Dispose on the returned IDisposable object. - The function to be called for each observation. - An object that will remove the listener if disposed. - - - Permanently connects a listener function to the observable. The listener will - be invoked for each observation. - The function to be called for each observation. - - - Returns an asynchronous computation that will write the given bytes to the stream. - The buffer to write from. - An optional offset as a number of bytes in the stream. - An optional number of bytes to write to the stream. - An asynchronous computation that will write the given bytes to the stream. - Thrown when the sum of offset and count is longer than - the buffer length. - Thrown when offset or count is negative. - - - Returns an asynchronous computation that will read the given number of bytes from the stream. - The number of bytes to read. - An asynchronous computation that returns the read byte[] when run. - - - Returns an asynchronous computation that will read from the stream into the given buffer. - The buffer to read into. - An optional offset as a number of bytes in the stream. - An optional number of bytes to read from the stream. - An asynchronous computation that will read from the stream into the given buffer. - Thrown when the sum of offset and count is longer than - the buffer length. - Thrown when offset or count is negative. - - - A module of extension members providing asynchronous operations for some basic CLI types related to concurrency and I/O. - - - Returns a new event that triggers on the second and subsequent triggerings of the input event. - The Nth triggering of the input event passes the arguments from the N-1th and Nth triggering as - a pair. The argument passed to the N-1th triggering is held in hidden internal state until the - Nth triggering occurs. - The input event. - An event that triggers on pairs of consecutive values passed from the source event. - - - Runs the given function each time the given event is triggered. - The function to call when the event is triggered. - The input event. - - - Returns a new event consisting of the results of applying the given accumulating function - to successive values triggered on the input event. An item of internal state - records the current value of the state parameter. The internal state is not locked during the - execution of the accumulation function, so care should be taken that the - input IEvent not triggered by multiple threads simultaneously. - The function to update the state with each event value. - The initial state. - The input event. - An event that fires on the updated state values. - - - Returns a new event which fires on a selection of messages from the original event. - The selection function takes an original message to an optional new message. - The function to select and transform event values to pass on. - The input event. - An event that fires only when the chooser returns Some. - - - Returns a new event that listens to the original event and triggers the - first resulting event if the application of the function to the event arguments - returned a Choice1Of2, and the second event if it returns a Choice2Of2. - The function to transform event values into one of two types. - The input event. - A tuple of events. The first fires whenever splitter evaluates to Choice1of1 and - the second fires whenever splitter evaluates to Choice2of2. - - - Returns a new event that listens to the original event and triggers the - first resulting event if the application of the predicate to the event arguments - returned true, and the second event if it returned false. - The function to determine which output event to trigger. - The input event. - A tuple of events. The first is triggered when the predicate evaluates to true - and the second when the predicate evaluates to false. - - - Returns a new event that listens to the original event and triggers the resulting - event only when the argument to the event passes the given function. - The function to determine which triggers from the event to propagate. - The input event. - An event that only passes values that pass the predicate. - - - Returns a new event that passes values transformed by the given function. - The function to transform event values. - The input event. - An event that passes the transformed values. - - - Fires the output event when either of the input events fire. - The first input event. - The second input event. - An event that fires when either of the input events fire. - - - - - - Forces the execution of this value and return its result. Same as Value. Mutual exclusion is used to - prevent other threads also computing the value. - The value of the Lazy object. - - - Creates a lazy computation that evaluates to the given value when forced. - The input value. - The created Lazy object. - - - Creates a lazy computation that evaluates to the result of the given function when forced. - The function to provide the value when needed. - The created Lazy object. - - - Extensions related to Lazy values. - - - Returns a new observable that triggers on the second and subsequent triggerings of the input observable. - The Nth triggering of the input observable passes the arguments from the N-1th and Nth triggering as - a pair. The argument passed to the N-1th triggering is held in hidden internal state until the - Nth triggering occurs. - - For each observer, the registered intermediate observing object is not thread safe. - That is, observations arising from the source must not be triggered concurrently - on different threads. - The input Observable. - An Observable that triggers on successive pairs of observations from the input Observable. - - - Creates an observer which subscribes to the given observable and which calls - the given function for each observation. - The function to be called on each observation. - The input Observable. - An object that will remove the callback if disposed. - - - Creates an observer which permanently subscribes to the given observable and which calls - the given function for each observation. - The function to be called on each observation. - The input Observable. - - - Returns an observable which, for each observer, allocates an item of state - and applies the given accumulating function to successive values arising from - the input. The returned object will trigger observations for each computed - state value, excluding the initial value. The returned object propagates - all errors arising from the source and completes when the source completes. - - For each observer, the registered intermediate observing object is not thread safe. - That is, observations arising from the source must not be triggered concurrently - on different threads. - The function to update the state with each observation. - The initial state. - The input Observable. - An Observable that triggers on the updated state values. - - - Returns an observable which chooses a projection of observations from the source - using the given function. The returned object will trigger observations x - for which the splitter returns Some x. The returned object also propagates - all errors arising from the source and completes when the source completes. - The function that returns Some for observations to be propagated - and None for observations to ignore. - The input Observable. - An Observable that only propagates some of the observations from the source. - - - Returns two observables which split the observations of the source by the - given function. The first will trigger observations x for which the - splitter returns Choice1Of2 x. The second will trigger observations - y for which the splitter returns Choice2Of2 y The splitter is - executed once for each subscribed observer. Both also propagate error - observations arising from the source and each completes when the source - completes. - The function that takes an observation an transforms - it into one of the two output Choice types. - The input Observable. - A tuple of Observables. The first triggers when splitter returns Choice1of2 - and the second triggers when splitter returns Choice2of2. - - - Returns two observables which partition the observations of the source by - the given function. The first will trigger observations for those values - for which the predicate returns true. The second will trigger observations - for those values where the predicate returns false. The predicate is - executed once for each subscribed observer. Both also propagate all error - observations arising from the source and each completes when the source - completes. - The function to determine which output Observable will trigger - a particular observation. - The input Observable. - A tuple of Observables. The first triggers when the predicate returns true, and - the second triggers when the predicate returns false. - - - Returns an observable which filters the observations of the source - by the given function. The observable will see only those observations - for which the predicate returns true. The predicate is executed once for - each subscribed observer. The returned object also propagates error - observations arising from the source and completes when the source completes. - The function to apply to observations to determine if it should - be kept. - The input Observable. - An Observable that filters observations based on filter. - - - Returns an observable which transforms the observations of the source by the - given function. The transformation function is executed once for each - subscribed observer. The returned object also propagates error observations - arising from the source and completes when the source completes. - The function applied to observations from the source. - The input Observable. - An Observable of the type specified by mapping. - - - Returns an observable for the merged observations from the sources. - The returned object propagates success and error values arising - from either source and completes when both the sources have completed. - - For each observer, the registered intermediate observing object is not - thread safe. That is, observations arising from the sources must not - be triggered concurrently on different threads. - The first Observable. - The second Observable. - An Observable that propagates information from both sources. - - - Basic operations on first class event and other observable objects. - - - Returns an asynchronous computation that, when run, will wait for the download of the given URI. - The URI to retrieve. - An asynchronous computation that will wait for the download of the URI. - - - Returns an asynchronous computation that, when run, will wait for a response to the given WebRequest. - An asynchronous computation that waits for response to the WebRequest. - - - A module of extension members providing asynchronous operations for some basic Web operations. - - - Creates an instance of the attribute - AbstractClassAttribute - - - Adding this attribute to class definition makes it abstract, which means it need not - implement all its methods. Instances of abstract classes may not be constructed directly. - - - Creates an instance of the attribute - AllowNullLiteralAttribute - - - Adding this attribute to a type lets the 'null' literal be used for the type - within F# code. This attribute may only be added to F#-defined class or - interface types. - - - Indicates the namespace or module to be automatically opened when an assembly is referenced - or an enclosing module opened. - - - Creates an attribute used to mark a namespace or module path to be 'automatically opened' when an assembly is referenced - The namespace or module to be automatically opened when an assembly is referenced - or an enclosing module opened. - AutoOpenAttribute - - - Creates an attribute used to mark a module as 'automatically opened' when the enclosing namespace is opened - AutoOpenAttribute - - - This attribute is used for two purposes. When applied to an assembly, it must be given a string - argument, and this argument must indicate a valid module or namespace in that assembly. Source - code files compiled with a reference to this assembly are processed in an environment - where the given path is automatically oepned. - - When applied to a module within an assembly, then the attribute must not be given any arguments. - When the enclosing namespace is opened in user source code, the module is also implicitly opened. - - - The value of the attribute, indicating whether the type is automatically marked serializable or not - - - Creates an instance of the attribute - Indicates whether the type should be serializable by default. - AutoSerializableAttribute - - - Adding this attribute to a type with value 'false' disables the behaviour where F# makes the - type Serializable by default. - - - Creates an instance of the attribute - CLIEventAttribute - - - Adding this attribute to a property with event type causes it to be compiled with as a CLI - metadata event, through a syntactic translation to a pair of 'add_EventName' and - 'remove_EventName' methods. - - - Creates an instance of the attribute - CLIMutableAttribute - - - Adding this attribute to a record type causes it to be compiled to a CLI representation - with a default constructor with property getters and setters. - - - Choice 2 of 2 choices - - - Choice 1 of 2 choices - - - Helper types for active patterns with 2 choices. - - - Choice 3 of 3 choices - - - Choice 2 of 3 choices - - - Choice 1 of 3 choices - - - Helper types for active patterns with 3 choices. - - - Choice 4 of 4 choices - - - Choice 3 of 4 choices - - - Choice 2 of 4 choices - - - Choice 1 of 4 choices - - - Helper types for active patterns with 4 choices. - - - Choice 5 of 5 choices - - - Choice 4 of 5 choices - - - Choice 3 of 5 choices - - - Choice 2 of 5 choices - - - Choice 1 of 5 choices - - - Helper types for active patterns with 5 choices. - - - Choice 6 of 6 choices - - - Choice 5 of 6 choices - - - Choice 4 of 6 choices - - - Choice 3 of 6 choices - - - Choice 2 of 6 choices - - - Choice 1 of 6 choices - - - Helper types for active patterns with 6 choices. - - - Choice 7 of 7 choices - - - Choice 6 of 7 choices - - - Choice 5 of 7 choices - - - Choice 4 of 7 choices - - - Choice 3 of 7 choices - - - Choice 2 of 7 choices - - - Choice 1 of 7 choices - - - Helper types for active patterns with 7 choices. - - - Creates an instance of the attribute - ClassAttribute - - - Adding this attribute to a type causes it to be represented using a CLI class. - - - Creates an instance of the attribute - ComparisonConditionalOnAttribute - - - This attribute is used to indicate a generic container type satisfies the F# 'comparison' - constraint only if a generic argument also satisfies this constraint. For example, adding - this attribute to parameter 'T on a type definition C<'T> means that a type C<X> only supports - comparison if the type X also supports comparison and all other conditions for C<X> to support - comparison are also met. The type C<'T> can still be used with other type arguments, but a type such - as C<(int -> int)> will not support comparison because the type (int -> int) is an F# function type - and does not support comparison. - - This attribute will be ignored if it is used on the generic parameters of functions or methods. - - - Indicates the number of arguments in each argument group - - - Creates an instance of the attribute - Indicates the number of arguments in each argument group. - CompilationArgumentCountsAttribute - - - This attribute is generated automatically by the F# compiler to tag functions and members - that accept a partial application of some of their arguments and return a residual function - - - Indicates the variant number of the entity, if any, in a linear sequence of elements with F# source code - - - Indicates the relationship between the compiled entity and F# source code - - - Indicates the sequence number of the entity, if any, in a linear sequence of elements with F# source code - - - Creates an instance of the attribute - Indicates the type of source construct. - CompilationMappingAttribute - - - Creates an instance of the attribute - Indicates the type of source construct. - CompilationMappingAttribute - - - Creates an instance of the attribute - Indicates the type of source construct. - CompilationMappingAttribute - - - This attribute is inserted automatically by the F# compiler to tag types - and methods in the generated CLI code with flags indicating the correspondence - with original source constructs. It is used by the functions in the - Microsoft.FSharp.Reflection namespace to reverse-map compiled constructs to - their original forms. It is not intended for use from user code. - - - Indicates one or more adjustments to the compiled representation of an F# type or member - - - Creates an instance of the attribute - Indicates adjustments to the compiled representation of the type or member. - CompilationRepresentationAttribute - - - This attribute is used to adjust the runtime representation for a type. - For example, it may be used to note that the null representation - may be used for a type. This affects how some constructs are compiled. - - - Compile a property as a CLI event. - - - Permit the use of null as a representation for nullary discriminators in a discriminated union. - - - append 'Module' to the end of a module whose name clashes with a type name in the same namespace. - - - Compile a member as 'instance' even if null is used as a representation for this type. - - - Compile an instance member as 'static' . - - - No special compilation representation. - - - - - - Indicates one or more adjustments to the compiled representation of an F# type or member. - - - Indicates the name of the entity in F# source code - - - Creates an instance of the attribute - The name of the method in source. - CompilationSourceNameAttribute - - - This attribute is inserted automatically by the F# compiler to tag - methods which are given the 'CompiledName' attribute. It is not intended - for use from user code. - - - The name of the value as it appears in compiled code - - - Creates an instance of the attribute - The name to use in compiled code. - CompiledNameAttribute - - - Adding this attribute to a value or function definition in an F# module changes the name used - for the value in compiled CLI code. - - - Indicates if the construct should always be hidden in an editing environment. - - - Indicates if the message should indicate a compiler error. Error numbers less than - 10000 are considered reserved for use by the F# compiler and libraries. - - - Indicates the number associated with the message. - - - Indicates the warning message to be emitted when F# source code uses this construct - - - Indicates if the construct should always be hidden in an editing environment. - - - Indicates if the message should indicate a compiler error. Error numbers less than - 10000 are considered reserved for use by the F# compiler and libraries. - - - Creates an instance of the attribute. - - - Indicates that a message should be emitted when F# source code uses this construct. - - - Creates an instance of the attribute - CustomComparisonAttribute - - - Adding this attribute to a type indicates it is a type with a user-defined implementation of comparison. - - - Creates an instance of the attribute - CustomEqualityAttribute - - - Adding this attribute to a type indicates it is a type with a user-defined implementation of equality. - - - Indicates if the custom operation maintains the variable space of the query of computation expression through the use of a bind operation - - - Indicates if the custom operation maintains the variable space of the query of computation expression - - - Indicates the name used for the 'on' part of the custom query operator for join-like operators - - - Indicates if the custom operation is an operation similar to a zip in a sequence computation, supporting two inputs - - - Indicates if the custom operation is an operation similar to a join in a sequence computation, supporting two inputs and a correlation constraint - - - Indicates if the custom operation is an operation similar to a group join in a sequence computation, supporting two inputs and a correlation constraint, and generating a group - - - Indicates if the custom operation supports the use of 'into' immediately after the use of the operation in a query or other computation expression to consume the results of the operation - - - Get the name of the custom operation when used in a query or other computation expression - - - Indicates if the custom operation maintains the variable space of the query of computation expression through the use of a bind operation - - - Indicates if the custom operation maintains the variable space of the query of computation expression - - - Indicates the name used for the 'on' part of the custom query operator for join-like operators - - - Indicates if the custom operation is an operation similar to a zip in a sequence computation, supporting two inputs - - - Indicates if the custom operation is an operation similar to a join in a sequence computation, supporting two inputs and a correlation constraint - - - Indicates if the custom operation is an operation similar to a group join in a sequence computation, supporting two inputs and a correlation constraint, and generating a group - - - Indicates if the custom operation supports the use of 'into' immediately after the use of the operation in a query or other computation expression to consume the results of the operation - - - Creates an instance of the attribute - CustomOperationAttribute - - - - Indicates that a member on a computation builder type is a custom query operator, - and indicates the name of that operator. - - - - The value of the attribute, indicating whether the type has a default augmentation or not - - - Creates an instance of the attribute - Indicates whether to generate helper members on the CLI class representing a discriminated - union. - DefaultAugmentationAttribute - - - Adding this attribute to a discriminated union with value false - turns off the generation of standard helper member tester, constructor - and accessor members for the generated CLI class for that type. - - - Indicates if a constraint is asserted that the field type supports 'null' - - - Creates an instance of the attribute - Indicates whether to assert that the field type supports null. - DefaultValueAttribute - - - Creates an instance of the attribute - DefaultValueAttribute - - - Adding this attribute to a field declaration means that the field is - not initialized. During type checking a constraint is asserted that the field type supports 'null'. - If the 'check' value is false then the constraint is not asserted. - - - Creates an instance of the attribute - EntryPointAttribute - - - Adding this attribute to a function indicates it is the entrypoint for an application. - If this attribute is not specified for an EXE then the initialization implicit in the - module bindings in the last file in the compilation sequence are used as the entrypoint. - - - Creates an instance of the attribute - EqualityConditionalOnAttribute - - - This attribute is used to indicate a generic container type satisfies the F# 'equality' - constraint only if a generic argument also satisfies this constraint. For example, adding - this attribute to parameter 'T on a type definition C<'T> means that a type C<X> only supports - equality if the type X also supports equality and all other conditions for C<X> to support - equality are also met. The type C<'T> can still be used with other type arguments, but a type such - as C<(int -> int)> will not support equality because the type (int -> int) is an F# function type - and does not support equality. - - This attribute will be ignored if it is used on the generic parameters of functions or methods. - - - Indicates the warning message to be emitted when F# source code uses this construct - - - Creates an instance of the attribute - The warning message to be emitted when code uses this construct. - ExperimentalAttribute - - - This attribute is used to tag values that are part of an experimental library - feature. - - - Convert an value of type System.Converter to a F# first class function value - The input System.Converter. - An F# function of the same type. - - - Convert an F# first class function value to a value of type System.Converter - The input function. - A System.Converter of the function type. - - - Convert an F# first class function value to a value of type System.Converter - The input function. - System.Converter<'T,'U> - - - Invoke an F# first class function value with two curried arguments. In some cases this - will result in a more efficient application than applying the arguments successively. - The input function. - The first arg. - The second arg. - The function result. - - - Invoke an F# first class function value with three curried arguments. In some cases this - will result in a more efficient application than applying the arguments successively. - The input function. - The first arg. - The second arg. - The third arg. - The function result. - - - Invoke an F# first class function value with four curried arguments. In some cases this - will result in a more efficient application than applying the arguments successively. - The input function. - The first arg. - The second arg. - The third arg. - The fourth arg. - The function result. - - - Invoke an F# first class function value with five curried arguments. In some cases this - will result in a more efficient application than applying the arguments successively. - The input function. - The first arg. - The second arg. - The third arg. - The fourth arg. - The fifth arg. - The function result. - - - Invoke an F# first class function value with one argument - - 'U - - - Convert an value of type System.Converter to a F# first class function value - The input System.Converter. - An F# function of the same type. - - - Construct an instance of an F# first class function value - The created F# function. - - - The CLI type used to represent F# function values. This type is not - typically used directly, though may be used from other CLI languages. - - - The release number of the F# version associated with the attribute - - - The minor version number of the F# version associated with the attribute - - - The major version number of the F# version associated with the attribute - - - Creates an instance of the attribute - The major version number. - The minor version number. - The release number. - FSharpInterfaceDataVersionAttribute - - - This attribute is added to generated assemblies to indicate the - version of the data schema used to encode additional F# - specific information in the resource attached to compiled F# libraries. - - - Specialize the type function at a given type - The specialized type. - - - Construct an instance of an F# first class type function value - FSharpTypeFunc - - - The CLI type used to represent F# first-class type function values. This type is for use - by compiled F# code. - - - Type of a formatting expression. - Function type generated by printf. - Type argument passed to %a formatters - Value generated by the overall printf action (e.g. sprint generates a string) - Value generated after post processing (e.g. failwithf generates a string internally then raises an exception) - - - Type of a formatting expression. - Function type generated by printf. - Type argument passed to %a formatters - Value generated by the overall printf action (e.g. sprint generates a string) - Value generated after post processing (e.g. failwithf generates a string internally then raises an exception) - Tuple of values generated by scan or match. - - - Convert the given Converter delegate object to an F# function value - The input Converter. - The F# function. - - - Convert the given Action delegate object to an F# function value - The input action. - The F# function. - - - A utility function to convert function values from tupled to curried form - The input tupled function. - The output curried function. - - - A utility function to convert function values from tupled to curried form - The input tupled function. - The output curried function. - - - A utility function to convert function values from tupled to curried form - The input tupled function. - The output curried function. - - - A utility function to convert function values from tupled to curried form - The input tupled function. - The output curried function. - - - Helper functions for converting F# first class function values to and from CLI representaions - of functions using delegates. - - - Creates an instance of the attribute - GeneralizableValueAttribute - - - Adding this attribute to a non-function value with generic parameters indicates that - uses of the construct can give rise to generic code through type inference. - - - Creates an instance of the attribute - InterfaceAttribute - - - Adding this attribute to a type causes it to be represented using a CLI interface. - - - Creates an instance of the attribute - LiteralAttribute - - - Adding this attribute to a value causes it to be compiled as a CLI constant literal. - - - Creates an instance of the attribute - MeasureAnnotatedAbbreviationAttribute - - - Adding this attribute to a type causes it to be interpreted as a refined type, currently limited to measure-parameterized types. - This may only be used under very limited conditions. - - - Creates an instance of the attribute - MeasureAttribute - - - Adding this attribute to a type causes it to be interpreted as a unit of measure. - This may only be used under very limited conditions. - - - Creates an instance of the attribute - NoComparisonAttribute - - - Adding this attribute to a type indicates it is a type where comparison is an abnormal operation. - This means that the type does not satisfy the F# 'comparison' constraint. Within the bounds of the - F# type system, this helps ensure that the F# generic comparison function is not instantiated directly - at this type. The attribute and checking does not constrain the use of comparison with base or child - types of this type. - - - Creates an instance of the attribute - NoDynamicInvocationAttribute - - - This attribute is used to tag values that may not be dynamically invoked at runtime. This is - typically added to inlined functions whose implementations include unverifiable code. It - causes the method body emitted for the inlined function to raise an exception if - dynamically invoked, rather than including the unverifiable code in the generated - assembly. - - - Creates an instance of the attribute - NoEqualityAttribute - - - Adding this attribute to a type indicates it is a type where equality is an abnormal operation. - This means that the type does not satisfy the F# 'equality' constraint. Within the bounds of the - F# type system, this helps ensure that the F# generic equality function is not instantiated directly - at this type. The attribute and checking does not constrain the use of comparison with base or child - types of this type. - - - The representation of "Value of type 'T" - The input value. - An option representing the value. - - - The representation of "No value" - - - Get the value of a 'Some' option. A NullReferenceException is raised if the option is 'None'. - - - Create an option value that is a 'None' value. - - - Return 'true' if the option is a 'Some' value. - - - Return 'true' if the option is a 'None' value. - - - Create an option value that is a 'Some' value. - The input value - An option representing the value. - - - The type of optional values. When used from other CLI languages the - empty option is the null value. - - Use the constructors Some and None to create values of this type. - Use the values in the Option module to manipulate values of this type, - or pattern match against the values directly. - - None values will appear as the value null to other CLI languages. - Instance methods on this type will appear as static methods to other CLI languages - due to the use of null as a value representation. - - - Creates an instance of the attribute - OptionalArgumentAttribute - - - This attribute is added automatically for all optional arguments. - - - The raw text of the format string. - - - Construct a format string - The input string. - The PrintfFormat containing the formatted result. - - - Type of a formatting expression. - Function type generated by printf. - Type argument passed to %a formatters - Value generated by the overall printf action (e.g. sprint generates a string) - Value generated after post processing (e.g. failwithf generates a string internally then raises an exception) - - - Construct a format string - The input string. - The created format string. - - - Type of a formatting expression. - Function type generated by printf. - Type argument passed to %a formatters - Value generated by the overall printf action (e.g. sprint generates a string) - Value generated after post processing (e.g. failwithf generates a string internally then raises an exception) - Tuple of values generated by scan or match. - - - Creates an instance of the attribute - ProjectionParameterAttribute - - - Indicates that, when a custom operator is used in a computation expression, - a parameter is automatically parameterized by the variable space of the computation expression - - - - The current value of the reference cell - - - - The current value of the reference cell - - - The current value of the reference cell - - - The type of mutable references. Use the functions [:=] and [!] to get and - set values of this type. - - - Creates an instance of the attribute - ReferenceEqualityAttribute - - - Adding this attribute to a record or union type disables the automatic generation - of overrides for 'System.Object.Equals(obj)', 'System.Object.GetHashCode()' - and 'System.IComparable' for the type. The type will by default use reference equality. - - - Creates an instance of the attribute - ReflectedDefinitionAttribute - - - Adding this attribute to the let-binding for the definition of a top-level - value makes the quotation expression that implements the value available - for use at runtime. - - - Creates an instance of the attribute - RequireQualifiedAccessAttribute - - - This attribute is used to indicate that references to the elements of a module, record or union - type require explicit qualified access. - - - Creates an instance of the attribute - RequiresExplicitTypeArgumentsAttribute - - - Adding this attribute to a type, value or member requires that - uses of the construct must explicitly instantiate any generic type parameters. - - - The value of the attribute, indicating whether the type is sealed or not. - - - Creates an instance of the attribute - Indicates whether the class is sealed. - SealedAttribute - - - Creates an instance of the attribute. - The created attribute. - - - Adding this attribute to class definition makes it sealed, which means it may not - be extended or implemented. - - - Indicates that the compiled entity had private or internal representation in F# source code. - - - The mask of values related to the kind of the compiled entity. - - - Indicates that the compiled entity is part of the representation of an F# value declaration. - - - Indicates that the compiled entity is part of the representation of an F# union case declaration. - - - Indicates that the compiled entity is part of the representation of an F# module declaration. - - - Indicates that the compiled entity is part of the representation of an F# closure. - - - Indicates that the compiled entity is part of the representation of an F# exception declaration. - - - Indicates that the compiled entity is part of the representation of an F# record or union case field declaration. - - - Indicates that the compiled entity is part of the representation of an F# class or other object type declaration. - - - Indicates that the compiled entity is part of the representation of an F# record type declaration. - - - Indicates that the compiled entity is part of the representation of an F# union type declaration. - - - Indicates that the compiled entity has no relationship to an element in F# source code. - - - - - - Indicates the relationship between a compiled entity in a CLI binary and an element in F# source code. - - - Creates an instance of the attribute - StructAttribute - - - Adding this attribute to a type causes it to be represented using a CLI struct. - - - Creates an instance of the attribute - StructuralComparisonAttribute - - - Adding this attribute to a record, union, exception, or struct type confirms the - automatic generation of implementations for 'System.IComparable' for the type. - - - Creates an instance of the attribute - StructuralEqualityAttribute - - - Adding this attribute to a record, union or struct type confirms the automatic - generation of overrides for 'System.Object.Equals(obj)' and - 'System.Object.GetHashCode()' for the type. - - - Indicates the text to display by default when objects of this type are displayed - using '%A' printf formatting patterns and other two-dimensional text-based display - layouts. - - - Creates an instance of the attribute - Indicates the text to display when using the '%A' printf formatting. - StructuredFormatDisplayAttribute - - - 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 this version of F# the only valid values are of the form PreText {PropertyName} PostText. - The property name indicates a property to evaluate and to display instead of the object itself. - - - The type 'unit', which has only one value "()". This value is special and - always uses the representation 'null'. - - - Creates an instance of the attribute - UnverifiableAttribute - - - This attribute is used to tag values whose use will result in the generation - of unverifiable code. These values are inevitably marked 'inline' to ensure that - the unverifiable constructs are not present in the actual code for the F# library, - but are rather copied to the source code of the caller. - - - Creates an instance of the attribute - VolatileFieldAttribute - - - Adding this attribute to an F# mutable binding causes the "volatile" - prefix to be used for all accesses to the field. - - - Four dimensional arrays, typically zero-based. Non-zero-based arrays - can be created using methods on the System.Array type. - - Use the values in the Array4D module - to manipulate values of this type, or the notation arr.[x1,x2,x3,x4] to get and set array - values. - - - Three dimensional arrays, typically zero-based. Non-zero-based arrays - can be created using methods on the System.Array type. - - Use the values in the Array3D module - to manipulate values of this type, or the notation arr.[x1,x2,x3] to get and set array - values. - - - Two dimensional arrays, typically zero-based. - - Use the values in the Array2D module - to manipulate values of this type, or the notation arr.[x,y] to get/set array - values. - - Non-zero-based arrays can also be created using methods on the System.Array type. - - - Single dimensional, zero-based arrays, written int[], string[] etc. - Use the values in the Array module to manipulate values - of this type, or the notation arr.[x] to get/set array - values. - - - Single dimensional, zero-based arrays, written int[], string[] etc. - - Use the values in the Array module to manipulate values - of this type, or the notation arr.[x] to get/set array - values. - - - - - - An abbreviation for the CLI type System.Boolean. - - - Represents a managed pointer in F# code. - - - An abbreviation for the CLI type System.Byte. - - - An abbreviation for the CLI type System.Char. - - - An abbreviation for the CLI type System.Decimal. - - - The type of decimal numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.Decimal. - - - An abbreviation for the CLI type System.Double. - - - An abbreviation for the CLI type System.Exception. - - - An abbreviation for the CLI type System.Double. - - - An abbreviation for the CLI type System.Single. - - - The type of floating point numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.Single. - - - The type of floating point numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.Double. - - - This type is for internal use by the F# code generator. - - - An abbreviation for the CLI type System.Int32. - - - An abbreviation for the CLI type System.Int16. - - - The type of 16-bit signed integer numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.Int16. - - - An abbreviation for the CLI type System.Int32. - - - An abbreviation for the CLI type System.Int64. - - - The type of 64-bit signed integer numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.Int64. - - - An abbreviation for the CLI type System.SByte. - - - The type of 32-bit signed integer numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.Int32. - - - An abbreviation for the CLI type System.IntPtr. - - - Represents an unmanaged pointer in F# code. - - This type should only be used when writing F# code that interoperates - with native code. Use of this type in F# code may result in - unverifiable code being generated. Conversions to and from the - nativeint type may be required. Values of this type can be generated - by the functions in the NativeInterop.NativePtr module. - - - An abbreviation for the CLI type System.Object. - - - The type of optional values. When used from other CLI languages the - empty option is the null value. - - Use the constructors Some and None to create values of this type. - Use the values in the Option module to manipulate values of this type, - or pattern match against the values directly. - - 'None' values will appear as the value null to other CLI languages. - Instance methods on this type will appear as static methods to other CLI languages - due to the use of null as a value representation. - - - The type of mutable references. Use the functions [:=] and [!] to get and - set values of this type. - - - An abbreviation for the CLI type System.SByte. - - - The type of 8-bit signed integer numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.SByte. - - - An abbreviation for the CLI type System.Single. - - - An abbreviation for the CLI type System.String. - - - An abbreviation for the CLI type System.UInt16. - - - An abbreviation for the CLI type System.UInt32. - - - An abbreviation for the CLI type System.UInt64. - - - An abbreviation for the CLI type System.Byte. - - - An abbreviation for the CLI type System.UIntPtr. - - - The type 'unit', which has only one value "()". This value is special and - always uses the representation 'null'. - - - - - - - - - - - - Non-exhaustive match failures will raise the MatchFailureException exception - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - A new enumerator for the sequence. - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - A reference to the sequence. - - A 0, 1, and 2 respectively indicate Stop, Yield, and Goto conditions for the sequence generator. - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - A new sequence generator for the expression. - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - - - - - - - - - - - - - - Creates an anonymous event with the given handlers. - - A function to handle adding a delegate for the event to trigger. - A function to handle removing a delegate that the event triggers. - A function to produce the delegate type the event can trigger. - - The initialized event. - - - The F# compiler emits calls to this function to implement the use operator for F# sequence - expressions. - - The resource to be used and disposed. - The input sequence. - - The result sequence. - - - The F# compiler emits calls to this function to implement the compiler-intrinsic - conversions from untyped System.Collections.IEnumerable sequences to typed sequences. - - An initializer function. - A function to iterate and test if end of sequence is reached. - A function to retrieve the current element. - - The resulting typed sequence. - - - The F# compiler emits calls to this function to - implement the try/finally operator for F# sequence expressions. - - The input sequence. - A computation to be included in an enumerator's Dispose method. - - The result sequence. - - - The F# compiler emits calls to this function to - implement the while operator for F# sequence expressions. - - A function that indicates whether iteration should continue. - The input sequence. - - The result sequence. - - - A group of functions used as part of the compiled representation of F# sequence expressions. - - - An active pattern to force the execution of values of type Lazy<_>. - - - Special prefix operator for splicing untyped expressions into quotation holes. - - - Special prefix operator for splicing typed expressions into quotation holes. - - - Builds a 2D array from a sequence of sequences of elements. - - - Builds a read-only lookup table from a sequence of key/value pairs. The key objects are indexed using generic hashing and equality. - - - Converts the argument to signed byte. - This is a direct conversion for all - primitive numeric types. For strings, the input is converted using SByte.Parse() with InvariantCulture settings. - Otherwise the operation requires and invokes a ToSByte method on the input type. - - - Converts the argument to byte. - This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Byte.Parse() on strings and otherwise requires a ToByte method on the input type. - - - Converts the argument to 64-bit float. - This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Double.Parse() with InvariantCulture settings. Otherwise the operation requires and invokes a ToDouble method on the input type. - - - Converts the argument to 32-bit float. - This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Single.Parse() with InvariantCulture settings. Otherwise the operation requires and invokes a ToSingle method on the input type. - - - Builds an aysnchronous workflow using computation expression syntax. - - - Builds a set from a sequence of objects. The objects are indexed using generic comparison. - The input sequence of elements. - The created set. - - - Print to a file using the given format, and add a newline. - The file TextWriter. - The formatter. - The formatted result. - - - Print to a file using the given format. - The file TextWriter. - The formatter. - The formatted result. - - - Print to a string buffer and raise an exception with the given - result. Helper printers must return strings. - The formatter. - The formatted result. - - - Print to a string using the given format. - The formatter. - The formatted result. - - - Print to stderr using the given format, and add a newline. - The formatter. - The formatted result. - - - Print to stderr using the given format. - The formatter. - The formatted result. - - - Print to stdout using the given format, and add a newline. - The formatter. - The formatted result. - - - Print to stdout using the given format. - The formatter. - The formatted result. - - - - - - Divides a value by an integer. - The input value. - The input int. - The division result. - - - - - - Resolves to the value 'one' for any primitive numeric type or any type with a static member called 'One' - - - Resolves to the zero value for any primitive numeric type or any type with a static member called 'Zero' - - - A compiler intrinsic that implements dynamic invocations for the DivideByInt primitive. - - - A compiler intrinsic that implements dynamic invocations to the checked '*' operator. - - - A compiler intrinsic that implements dynamic invocations to the '*' operator. - - - A compiler intrinsic that implements dynamic invocations to the checked '+' operator. - - - A compiler intrinsic that implements dynamic invocations to the '+' operator. - - - Resolves to the value 'one' for any primitive numeric type or any type with a static member called 'One'. - - - Resolves to the zero value for any primitive numeric type or any type with a static member called 'Zero'. - - - Parse an uint64 according to the rules used by the overloaded 'uint64' conversion operator when applied to strings - The input string. - The parsed value. - - - Parse an int64 according to the rules used by the overloaded 'int64' conversion operator when applied to strings - The input string. - The parsed value. - - - Parse an uint32 according to the rules used by the overloaded 'uint32' conversion operator when applied to strings - The input string. - The parsed value. - - - Parse an int32 according to the rules used by the overloaded 'int32' conversion operator when applied to strings - The input string. - The parsed value. - - - Creates an sbyte value with units-of-measure - The input sbyte. - The sbyte with units-of-measure. - - - Creates an int16 value with units-of-measure - The input int16. - The int16 with units-of-measure. - - - Creates an int64 value with units-of-measure - The input int64. - The int64 with units of measure. - - - Creates an int32 value with units-of-measure - The input int. - The int with units of measure. - - - Creates a decimal value with units-of-measure - The input decimal. - The decimal with units of measure. - - - Creates a float32 value with units-of-measure - The input float. - The float with units-of-measure. - - - Creates a float value with units-of-measure - The input float. - The float with units-of-measure. - - - Get the underlying value for an enum value - The input enum. - The enumeration as a value. - - - Build an enum value from an underlying value - The input value. - The value as an enumeration. - - - Recursively hash a part of a value according to its structure. - The comparison function. - The input object. - The hashed value. - - - Hash a value according to its structure. Use the given limit to restrict the hash when hashing F# - records, lists and union types. - The limit on the number of nodes. - The input object. - The hashed value. - - - Hash a value according to its structure. This hash is not limited by an overall node count when hashing F# - records, lists and union types. - The input object. - The hashed value. - - - Make an F# hash/equality object for the given type using node-limited hashing when hashing F# - records, lists and union types. - The input limit on the number of nodes. - System.Collections.Generic.IEqualityComparer<'T> - - - Make an F# hash/equality object for the given type - - - Make an F# comparer object for the given type, where it can be null if System.Collections.Generic.Comparer<'T>.Default - - - Make an F# comparer object for the given type - - - A static F# comparer object - - - Return an F# comparer object suitable for hashing and equality. This hashing behaviour - of the returned comparer is not limited by an overall node count when hashing F# - records, lists and union types. This equality comparer has equivalence - relation semantics ([nan] = [nan]). - - - Return an F# comparer object suitable for hashing and equality. This hashing behaviour - of the returned comparer is not limited by an overall node count when hashing F# - records, lists and union types. - - - The physical hash. Hashes on the object identity, except for value types, - where we hash on the contents. - The input object. - The hashed value. - - - Reference/physical equality. - True if the inputs are reference-equal, false otherwise. - The first value. - The second value. - The result of the comparison. - - - Take the maximum of two values structurally according to the order given by GenericComparison - The first value. - The second value. - The maximum value. - - - Take the minimum of two values structurally according to the order given by GenericComparison - The first value. - The second value. - The minimum value. - - - Compare two values - The first value. - The second value. - The result of the comparison. - - - Compare two values - The first value. - The second value. - The result of the comparison. - - - Compare two values - The first value. - The second value. - The result of the comparison. - - - Compare two values - The first value. - The second value. - The result of the comparison. - - - Compare two values. May be called as a recursive case from an implementation of System.IComparable to - ensure consistent NaN comparison semantics. - The function to compare the values. - The first value. - The second value. - The result of the comparison. - - - Compare two values - The first value. - The second value. - The result of the comparison. - - - Compare two values for equality - - The first value. - The second value. - The result of the comparison. - - - Compare two values for equality using equivalence relation semantics ([nan] = [nan]) - The first value. - The second value. - The result of the comparison. - - - Compare two values for equality using partial equivalence relation semantics ([nan] <> [nan]) - The first value. - The second value. - The result of the comparison. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - The F# compiler emits calls to some of the functions in this module as part of the compiled form of some language constructs - - - - The standard overloaded associative (4-indexed) mutation operator - - - - The standard overloaded associative (3-indexed) mutation operator - - - The standard overloaded associative (2-indexed) mutation operator - - - The standard overloaded associative (indexed) mutation operator - - - The standard overloaded associative (4-indexed) lookup operator - - - The standard overloaded associative (3-indexed) lookup operator - - - The standard overloaded associative (2-indexed) lookup operator - - - The standard overloaded associative (indexed) lookup operator - - - A compiler intrinsic for checking initialization soundness of recursive bindings - - - A compiler intrinsic for checking initialization soundness of recursive static bindings - - - A compiler intrinsic for checking initialization soundness of recursive bindings - - - A compiler intrinsic for the efficient compilation of sequence expressions - - - This function implements parsing of decimal constants - - - This function implements calls to default constructors - acccessed by 'new' constraints. - - - Primitive used by pattern match compilation - - - A compiler intrinsic that implements the ':?' operator - - - A compiler intrinsic that implements the ':?' operator - - - A compiler intrinsic that implements the ':?>' operator - - - A compiler intrinsic that implements the ':?>' operator - - - The F# compiler emits calls to some of the functions in this module as part of the compiled form of some language constructs - - - Address-of. Uses of this value may result in the generation of unverifiable code. - The input object. - The unmanaged pointer. - - - Address-of. Uses of this value may result in the generation of unverifiable code. - The input object. - The managed pointer. - - - Binary 'or'. When used as a binary operator the right hand value is evaluated only on demand - The first value. - The second value. - The result of the operation. - - - Binary 'or'. When used as a binary operator the right hand value is evaluated only on demand. - - - Binary 'and'. When used as a binary operator the right hand value is evaluated only on demand - The first value. - The second value. - The result of the operation. - - - Binary 'and'. When used as a binary operator the right hand value is evaluated only on demand. - - - The F# compiler emits calls to some of the functions in this module as part of the compiled form of some language constructs - - - - - - - - - - - - - - - - - - For internal use only - - - Language primitives associated with the F# language - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - An active pattern to match values of type System.Collections.Generic.KeyValuePair - The input key/value pair. - A tuple containing the key and value. - - - Converts the argument to character. Numeric inputs are converted according to the UTF-16 - encoding for characters. String inputs must be exactly one character long. For other - input types the operation requires an appropriate static conversion method on the input type. - The input value. - The converted char. - - - Converts the argument to System.Decimal using a direct conversion for all - primitive numeric types. For strings, the input is converted using UInt64.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted decimal. - - - Converts the argument to a string using ToString. - - For standard integer and floating point values the ToString conversion - uses CultureInfo.InvariantCulture. - The input value. - The converted string. - - - Converts the argument to unsigned native integer using a direct conversion for all - primitive numeric types. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted unativeint - - - Converts the argument to signed native integer. This is a direct conversion for all - primitive numeric types. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted nativeint - - - Converts the argument to 64-bit float. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Double.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted float - - - Converts the argument to 32-bit float. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Single.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted float32 - - - Converts the argument to unsigned 64-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using UInt64.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint64 - - - Converts the argument to signed 64-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Int64.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int64 - - - Converts the argument to unsigned 32-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using UInt32.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint32 - - - Converts the argument to signed 32-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Int32.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int32 - - - Converts the argument to a particular enum type. - The input value. - The converted enum type. - - - Converts the argument to signed 32-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Int32.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int - - - Converts the argument to unsigned 16-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using UInt16.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint16 - - - Converts the argument to signed 16-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Int16.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int16 - - - Converts the argument to signed byte. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using SByte.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted sbyte - - - Converts the argument to byte. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Byte.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted byte - - - Overloaded power operator. If n > 0 then equivalent to x*...*x for n occurrences of x. - The input base. - The input exponent. - The base raised to the exponent. - - - Overloaded power operator. - The input base. - The input exponent. - The base raised to the exponent. - - - Overloaded truncate operator. - The input value. - The truncated value. - - - Hyperbolic tangent of the given number - The input value. - The hyperbolic tangent of the input. - - - Tangent of the given number - The input value. - The tangent of the input. - - - Hyperbolic sine of the given number - The input value. - The hyperbolic sine of the input. - - - Sine of the given number - The input value. - The sine of the input. - - - Hyperbolic cosine of the given number - The input value. - The hyperbolic cosine of the input. - - - Cosine of the given number - The input value. - The cosine of the input. - - - Square root of the given number - The input value. - The square root of the input. - - - Logarithm to base 10 of the given number - The input value. - The logarithm to base 10 of the input. - - - Natural logarithm of the given number - The input value. - The natural logarithm of the input. - - - Round the given number - The input value. - The nearest integer to the input value. - - - Sign of the given number - The input value. - -1, 0, or 1 depending on the sign of the input. - - - Floor of the given number - The input value. - The floor of the input. - - - Exponential of the given number - The input value. - The exponential of the input. - - - Ceiling of the given number - The input value. - The ceiling of the input. - - - Inverse tangent of x/y where x and y are specified separately - The y input value. - The x input value. - The inverse tangent of the input ratio. - - - Inverse tangent of the given number - The input value. - The inverse tangent of the input. - - - Inverse sine of the given number - The input value. - The inverse sine of the input. - - - Inverse cosine of the given number - The input value. - The inverse cosine of the input. - - - Absolute value of the given number. - The input value. - The absolute value of the input. - - - A generic hash function. This function has the same behaviour as 'hash', - however the default structural hashing for F# union, record and tuple - types stops when the given limit of nodes is reached. The exact behaviour of - the function can be adjusted on a type-by-type basis by implementing - GetHashCode for each type. - The limit of nodes. - The input object. - The computed hash. - - - A generic hash function, designed to return equal hash values for items that are - equal according to the "=" operator. By default it will use structural hashing - for F# union, record and tuple types, hashing the complete contents of the - type. The exact behaviour of the function can be adjusted on a - type-by-type basis by implementing GetHashCode for each type. - The input object. - The computed hash. - - - Returns the internal size of a type in bytes. For example, sizeof<int> returns 4. - - - Generate a System.Type representation for a type definition. If the - input type is a generic type instantiation then return the - generic type definition associated with all such instantiations. - - - An internal, library-only compiler intrinsic for compile-time - generation of a RuntimeMethodHandle. - - - Generate a System.Type runtime representation of a static type. - The static type is still maintained on the value returned. - - - Clean up resources associated with the input object after the completion of the given function. - Cleanup occurs even when an exception is raised by the protected - code. - The resource to be disposed after action is called. - The action that accepts the resource. - The resulting value. - - - Execute the function as a mutual-exclusion region using the input value as a lock. - The object to be locked. - The action to perform during the lock. - The resulting value. - - - The standard overloaded skip range operator, e.g. [n..skip..m] for lists, seq {n..skip..m} for sequences - The start value of the range. - The step value of the range. - The end value of the range. - The sequence spanning the range using the specified step size. - - - The standard overloaded range operator, e.g. [n..m] for lists, seq {n..m} for sequences - The start value of the range. - The end value of the range. - The sequence spanning the range. - - - Reads the value of the property System.Console.Out. - - - Reads the value of the property System.Console.Error. - - - Reads the value of the property System.Console.In. - - - Equivalent to System.Single.NaN - - - Equivalent to System.Single.PositiveInfinity - - - Equivalent to System.Double.NaN - - - Equivalent to System.Double.PositiveInfinity - - - Exit the current hardware isolated process, if security settings permit, - otherwise raise an exception. Calls System.Environment.Exit. - The exit code to use. - The result value. - - - Builds a sequence using sequence expression syntax - The input sequence. - The result sequence. - - - Negate a logical value. not true equals false and not false equals true - The value to negate. - The result of the negation. - - - Concatenate two lists. - The first list. - The second list. - The concatenation of the lists. - - - Increment a mutable reference cell containing an integer - The reference cell. - - - Decrement a mutable reference cell containing an integer - The reference cell. - - - Dereference a mutable reference cell - The cell to dereference. - The value contained in the cell. - - - Assign to a mutable reference cell - The cell to mutate. - The value to set inside the cell. - - - Create a mutable reference cell - The value to contain in the cell. - The created reference cell. - - - The identity function - The input value. - The same value. - - - Throw a System.InvalidOperationException exception - The exception message. - The result value. - - - Throw a System.ArgumentNullException exception - The argument name. - The result value. - - - Throw a System.ArgumentException exception with - the given argument name and message. - The argument name. - The exception message. - The result value. - - - Throw a System.Exception exception. - The exception message. - The result value. - - - Boxes a strongly typed value. - The value to box. - The boxed object. - - - Unboxes a strongly typed value. This is the inverse of box, unbox<t>(box<t> a) equals a. - The boxed value. - The unboxed result. - - - Ignore the passed value. This is often used to throw away results of a computation. - The value to ignore. - - - Minimum based on generic comparison - The first value. - The second value. - The minimum value. - - - Maximum based on generic comparison - The first value. - The second value. - The maximum value. - - - Generic comparison. - The first value. - The second value. - The result of the comparison. - - - Return the second element of a tuple, snd (a,b) = b. - The input tuple. - The second value. - - - Return the first element of a tuple, fst (a,b) = a. - The input tuple. - The first value. - - - Matches System.Exception objects whose runtime type is precisely System.Exception - The input exception. - A string option. - - - Builds a System.Exception object. - The message for the Exception. - A System.Exception. - - - Rethrows an exception. This should only be used when handling an exception - The result value. - - - Rethrows an exception. This should only be used when handling an exception - The result value. - - - Raises an exception - The exception to raise. - The result value. - - - Concatenate two strings. The operator '+' may also be used. - - - Used to specify a default value for an optional argument in the implementation of a function - An option representing the argument. - The default value of the argument. - The argument value. If it is None, the defaultValue is returned. - - - Apply a function to three values, the values being a triple on the right, the function on the left - The function. - The first argument. - The second argument. - The third argument. - The function result. - - - Apply a function to two values, the values being a pair on the right, the function on the left - The function. - The first argument. - The second argument. - The function result. - - - Apply a function to a value, the value being on the right, the function on the left - The function. - The argument. - The function result. - - - Apply a function to three values, the values being a triple on the left, the function on the right - The first argument. - The second argument. - The third argument. - The function. - The function result. - - - Apply a function to two values, the values being a pair on the left, the function on the right - The first argument. - The second argument. - The function. - The function result. - - - Apply a function to a value, the value being on the left, the function on the right - The argument. - The function. - The function result. - - - Compose two functions, the function on the right being applied first - The second function to apply. - The first function to apply. - The composition of the input functions. - - - Compose two functions, the function on the left being applied first - The first function to apply. - The second function to apply. - The composition of the input functions. - - - Structural inequality - The first parameter. - The second parameter. - The result of the comparison. - - - Structural equality - The first parameter. - The second parameter. - The result of the comparison. - - - Structural less-than-or-equal comparison - The first parameter. - The second parameter. - The result of the comparison. - - - Structural greater-than-or-equal - The first parameter. - The second parameter. - The result of the comparison. - - - Structural greater-than - The first parameter. - The second parameter. - The result of the comparison. - - - Structural less-than comparison - The first parameter. - The second parameter. - The result of the comparison. - - - Overloaded prefix=plus operator - The input value. - The result of the operation. - - - Overloaded logical-NOT operator - The input value. - The result of the operation. - - - Overloaded byte-shift right operator by a specified number of bits - The input value. - The amount to shift. - The result of the operation. - - - Overloaded byte-shift left operator by a specified number of bits - The input value. - The amount to shift. - The result of the operation. - - - Overloaded logical-XOR operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded logical-OR operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded logical-AND operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded modulo operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded division operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded multiplication operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded subtraction operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded addition operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded unary negation. - The value to negate. - The result of the operation. - - - Converts the argument to char. Numeric inputs are converted using a checked - conversion according to the UTF-16 encoding for characters. String inputs must - be exactly one character long. For other input types the operation requires an - appropriate static conversion method on the input type. - The input value. - The converted char - - - Converts the argument to unativeint. This is a direct, checked conversion for all - primitive numeric types. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted unativeint - - - Converts the argument to nativeint. This is a direct, checked conversion for all - primitive numeric types. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted nativeint - - - Converts the argument to uint64. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.UInt64.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint64 - - - Converts the argument to int64. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.Int64.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int64 - - - Converts the argument to uint32. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.UInt32.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint32 - - - Converts the argument to int32. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.Int32.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int32 - - - Converts the argument to int. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.Int32.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int - - - Converts the argument to uint16. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.UInt16.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint16 - - - Converts the argument to int16. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.Int16.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int16 - - - Converts the argument to sbyte. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.SByte.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted sbyte - - - Converts the argument to byte. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.Byte.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted byte - - - Overloaded multiplication operator (checks for overflow) - The first value. - The second value. - The product of the two input values. - - - Overloaded addition operator (checks for overflow) - The first value. - The second value. - The sum of the two input values. - - - Overloaded subtraction operator (checks for overflow) - The first value. - The second value. - The first value minus the second value. - - - Overloaded unary negation (checks for overflow) - The input value. - The negated value. - - - This module contains the basic arithmetic operations with overflow checks. - - - Perform generic hashing on a value where the type of the value is not - statically required to satisfy the 'equality' constraint. - The computed hash value. - - - Perform generic equality on two values where the type of the values is not - statically required to satisfy the 'equality' constraint. - The result of the comparison. - - - Perform generic comparison on two values where the type of the values is not - statically required to have the 'comparison' constraint. - The result of the comparison. - - - Generate a default value for any type. This is null for reference types, - For structs, this is struct value where all fields have the default value. - This function is unsafe in the sense that some F# values do not have proper null values. - - - Unboxes a strongly typed value. This is the inverse of box, unbox<t>(box<t> a) equals a. - The boxed value. - The unboxed result. - - - This module contains basic operations which do not apply runtime and/or static checks - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'decimal' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'float' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'float32' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'unativeint' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'nativeint' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'uint64' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'int64' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'uint32' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'int32' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'uint16' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'int16' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'sbyte' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'byte' - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - Generate a range of values using the given zero, add, start, step and stop values - - - Generate a range of values using the given zero, add, start, step and stop values - - - Generate a range of char values - - - Generate a range of byte values - - - Generate a range of sbyte values - - - Generate a range of uint16 values - - - Generate a range of int16 values - - - Generate a range of unativeint values - - - Generate a range of nativeint values - - - Generate a range of uint32 values - - - Generate a range of uint64 values - - - Generate a range of int64 values - - - Generate a range of float32 values - - - Generate a range of float values - - - Generate a range of integers - - - Gets a slice from a string - The source string. - The index of the first character of the slice. - The index of the last character of the slice. - The substring from the given indices. - - - Sets a slice of an array - The target array. - The start index of the first dimension. - The end index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The start index of the third dimension. - The end index of the third dimension. - The start index of the fourth dimension. - The end index of the fourth dimension. - The source array. - - - Gets a slice of an array - The source array. - The start index of the first dimension. - The end index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The start index of the third dimension. - The end index of the third dimension. - The start index of the fourth dimension. - The end index of the fourth dimension. - The four dimensional sub array from the given indices. - - - Sets a slice of an array - The target array. - The start index of the first dimension. - The end index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The start index of the third dimension. - The end index of the third dimension. - The source array. - - - Gets a slice of an array - The source array. - The start index of the first dimension. - The end index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The start index of the third dimension. - The end index of the third dimension. - The three dimensional sub array from the given indices. - - - Sets a slice of an array - The target array. - The start index of the first dimension. - The end index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The source array. - - - Gets a slice of an array - The source array. - The start index of the first dimension. - The end index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The two dimensional sub array from the input indices. - - - Sets a slice of an array - The target array. - The start index. - The end index. - The source array. - - - Gets a slice of an array - The input array. - The start index. - The end index. - The sub array from the input indices. - - - A module of compiler intrinsic functions for efficient implementations of F# integer ranges - and dynamic invocations of other F# operators - - - Basic F# Operators. This module is automatically opened in all F# code. - - - Invoke an F# first class function value that accepts five curried arguments - without intervening execution - The first arg. - The second arg. - The third arg. - The fourth arg. - The fifth arg. - The function result. - - - Adapt an F# first class function value to be an optimized function value that can - accept five curried arguments without intervening execution. - The input function. - The optimized function. - - - Construct an optimized function value that can accept five curried - arguments without intervening execution. - The optimized function. - - - The CLI type used to represent F# function values that accept five curried arguments - without intervening execution. This type should not typically used directly from - either F# code or from other CLI languages. - - - Invoke an F# first class function value that accepts four curried arguments - without intervening execution - The first arg. - The second arg. - The third arg. - The fourth arg. - The function result. - - - Adapt an F# first class function value to be an optimized function value that can - accept four curried arguments without intervening execution. - The input function. - The optimized function. - - - Construct an optimized function value that can accept four curried - arguments without intervening execution. - The optimized function. - - - The CLI type used to represent F# function values that accept four curried arguments - without intervening execution. This type should not typically used directly from - either F# code or from other CLI languages. - - - Invoke an F# first class function value that accepts three curried arguments - without intervening execution - The first arg. - The second arg. - The third arg. - The function result. - - - Adapt an F# first class function value to be an optimized function value that can - accept three curried arguments without intervening execution. - The input function. - The adapted function. - - - Construct an optimized function value that can accept three curried - arguments without intervening execution. - The optimized function. - - - The CLI type used to represent F# function values that accept - three iterated (curried) arguments without intervening execution. This type should not - typically used directly from either F# code or from other CLI languages. - - - Invoke the optimized function value with two curried arguments - The first arg. - The second arg. - The function result. - - - Adapt an F# first class function value to be an optimized function value that can - accept two curried arguments without intervening execution. - The input function. - The adapted function. - - - Construct an optimized function value that can accept two curried - arguments without intervening execution. - The optimized function. - - - The CLI type used to represent F# function values that accept - two iterated (curried) arguments without intervening execution. This type should not - typically used directly from either F# code or from other CLI languages. - - - An implementation module used to hold some private implementations of function - value invocation. - - - Convert the option to a list of length 0 or 1. - The input option. - The result list. - - - Convert the option to an array of length 0 or 1. - The input option. - The result array. - - - bind f inp evaluates to match inp with None -> None | Some x -> f x - A function that takes the value of type T from an option and transforms it into - an option containing a value of type U. - The input option. - An option of the output type of the binder. - - - map f inp evaluates to match inp with None -> None | Some x -> Some (f x). - A function to apply to the option value. - The input option. - An option of the input value after applying the mapping function, or None if the input is None. - - - iter f inp executes match inp with None -> () | Some x -> f x. - A function to apply to the option value. - The input option. - Unit if the option is None, otherwise it returns the result of applying the predicate - to the option value. - - - forall p inp evaluates to match inp with None -> true | Some x -> p x. - A function that evaluates to a boolean when given a value from the option type. - The input option. - True if the option is None, otherwise it returns the result of applying the predicate - to the option value. - - - exists p inp evaluates to match inp with None -> false | Some x -> p x. - A function that evaluates to a boolean when given a value from the option type. - The input option. - False if the option is None, otherwise it returns the result of applying the predicate - to the option value. - - - fold f inp s evaluates to match inp with None -> s | Some x -> f x s. - A function to update the state data when given a value from an option. - The input option. - The initial state. - The original state if the option is None, otherwise it returns the updated state with the folder - and the option value. - - - fold f s inp evaluates to match inp with None -> s | Some x -> f s x. - A function to update the state data when given a value from an option. - The initial state. - The input option. - The original state if the option is None, otherwise it returns the updated state with the folder - and the option value. - - - count inp evaluates to match inp with None -> 0 | Some _ -> 1. - The input option. - A zero if the option is None, a one otherwise. - - - Gets the value associated with the option. - The input option. - The value within the option. - Thrown when the option is None. - - - Returns true if the option is None. - The input option. - True if the option is None. - - - Returns true if the option is not None. - The input option. - True if the option is not None. - - - Basic operations on options. - - - Represents a statically-analyzed format associated with writing to a System.IO.TextWriter. The type parameter indicates the - arguments and return type of the format operation. - - - Represents a statically-analyzed format when formatting builds a string. The type parameter indicates the - arguments and return type of the format operation. - - - Represents a statically-analyzed format associated with writing to a System.Text.StringBuilder. The type parameter indicates the - arguments and return type of the format operation. - - - Represents a statically-analyzed format associated with writing to a System.IO.TextWriter. The first type parameter indicates the - arguments of the format operation and the last the overall return type. - - - Represents a statically-analyzed format when formatting builds a string. The first type parameter indicates the - arguments of the format operation and the last the overall return type. - - - Represents a statically-analyzed format associated with writing to a System.Text.StringBuilder. The first type parameter indicates the - arguments of the format operation and the last the overall return type. - - - Print to a string buffer and raise an exception with the given - result. Helper printers must return strings. - The input formatter. - The arguments of the formatter. - - - sprintf, but call the given 'final' function to generate the result. - See kprintf. - The function called to generate a result from the formatted string. - The input formatter. - The arguments of the formatter. - - - printf, but call the given 'final' function to generate the result. - For example, these let the printing force a flush after all output has - been entered onto the channel, but not before. - The function called after formatting to generate the format result. - The input formatter. - The arguments of the formatter. - - - fprintf, but call the given 'final' function to generate the result. - See kprintf. - The function called after formatting to generate the format result. - The input TextWriter. - The input formatter. - The arguments of the formatter. - - - bprintf, but call the given 'final' function to generate the result. - See kprintf. - The function called after formatting to generate the format result. - The input StringBuilder. - The input formatter. - The arguments of the formatter. - - - Print to a string via an internal string buffer and return - the result as a string. Helper printers must return strings. - The input formatter. - The formatted string. - - - Formatted printing to stdout, adding a newline. - The input formatter. - The return type and arguments of the formatter. - - - Formatted printing to stdout - The input formatter. - The return type and arguments of the formatter. - - - Formatted printing to stderr, adding a newline - The input formatter. - The return type and arguments of the formatter. - - - Formatted printing to stderr - The input formatter. - The return type and arguments of the formatter. - - - Print to a text writer, adding a newline - The TextWriter to print to. - The input formatter. - The return type and arguments of the formatter. - - - Print to a text writer. - The TextWriter to print to. - The input formatter. - The return type and arguments of the formatter. - - - Print to a System.Text.StringBuilder - The StringBuilder to print to. - The input formatter. - The return type and arguments of the formatter. - - - Extensible printf-style formatting for numbers and other datatypes - - Format specifications are strings with "%" markers indicating format - placeholders. Format placeholders consist of: - - %[flags][width][.precision][type] - - where the type is interpreted as follows: - - %b: bool, formatted as "true" or "false" - %s: string, formatted as its unescaped contents - %c: character literal - %d, %i: any basic integer type formatted as a decimal integer, signed if the basic integer type is signed. - %u: any basic integer type formatted as an unsigned decimal integer - %x, %X, %o: any basic integer type formatted as an unsigned hexadecimal - (a-f)/Hexadecimal (A-F)/Octal integer - - %e, %E, %f, %F, %g, %G: - any basic floating point type (float,float32) formatted - using a C-style floating point format specifications, i.e - - %e, %E: Signed value having the form [-]d.dddde[sign]ddd where - d is a single decimal digit, dddd is one or more decimal - digits, ddd is exactly three decimal digits, and sign - is + or - - - %f: Signed value having the form [-]dddd.dddd, where dddd is one - or more decimal digits. The number of digits before the - decimal point depends on the magnitude of the number, and - the number of digits after the decimal point depends on - the requested precision. - - %g, %G: Signed value printed in f or e format, whichever is - more compact for the given value and precision. - - - %M: System.Decimal value - - %O: Any value, printed by boxing the object and using it's ToString method(s) - - %A: Any value, printed with the default layout settings - - %a: A general format specifier, requires two arguments: - (1) a function which accepts two arguments: - (a) a context parameter of the appropriate type for the - given formatting function (e.g. an #System.IO.TextWriter) - (b) a value to print - and which either outputs or returns appropriate text. - - (2) the particular value to print - - - %t: A general format specifier, requires one argument: - (1) a function which accepts a context parameter of the - appropriate type for the given formatting function (e.g. - an System.IO.TextWriter)and which either outputs or returns - appropriate text. - - Basic integer types are: - byte,sbyte,int16,uint16,int32,uint32,int64,uint64,nativeint,unativeint - Basic floating point types are: - float, float32 - - The optional width is an integer indicating the minimal width of the - result. For instance, %6d prints an integer, prefixing it with spaces - to fill at least 6 characters. If width is '*', then an extra integer - argument is taken to specify the corresponding width. - - any number - '*': - - Valid flags are: - - 0: add zeros instead of spaces to make up the required width - '-': left justify the result within the width specified - '+': add a '+' character if the number is positive (to match a '-' sign - for negatives) - ' ': add an extra space if the number is positive (to match a '-' - sign for negatives) - - The printf '#' flag is invalid and a compile-time error will be reported if it is used. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Returns the length of the string. - The input string. - The number of characters in the string. - Thrown when the input string is null. - - - Returns a string by concatenating count instances of str. - The number of copies of the input string will be copied. - The input string. - The concatenated string. - Thrown when the input string is null. - - - Tests if any character of the string satisfies the given predicate. - The function to test each character of the string. - The input string. - True if any character returns true for the predicate and false otherwise. - Thrown when the input string is null. - - - Tests if all characters in the string satisfy the given predicate. - The function to test each character of the string. - The input string. - True if all characters return true for the predicate and false otherwise. - Thrown when the input string is null. - - - Builds a new string whose characters are the results of applying the function mapping - to each index from 0 to count-1 and concatenating the resulting - strings. - The number of strings to initialize. - The function to take an index and produce a string to - be concatenated with the others. - The constructed string. - Thrown when count is negative. - - - Builds a new string whose characters are the results of applying the function mapping - to each of the characters of the input string and concatenating the resulting - strings. - The function to produce a string from each character of the input string. - The input string. - The concatenated string. - Thrown when the input string is null. - - - Builds a new string whose characters are the results of applying the function mapping - to each character and index of the input string. - The function to apply to each character and index of the string. - The input string. - The resulting string. - Thrown when the input string is null. - - - Builds a new string whose characters are the results of applying the function mapping - to each of the characters of the input string. - The function to apply to the characters of the string. - The input string. - The resulting string. - Thrown when the input string is null. - - - Applies the function action to the index of each character in the string and the - character itself. - The function to apply to each character and index of the string. - The input string. - Thrown when the input string is null. - - - Applies the function action to each character in the string. - The function to be applied to each character of the string. - The input string. - Thrown when the input string is null. - - - Returns a new string made by concatenating the given strings - with separator sep, that is a1 + sep + ... + sep + aN. - The separator string to be inserted between the strings - of the input sequence. - The sequence of strings to be concatenated. - A new string consisting of the concatenated strings separated by - the separation string. - Thrown when strings is null. - - - Functional programming operators for string processing. Further string operations - are available via the member functions on strings and other functionality in - System.String - and System.Text.RegularExpressions types. - - - - The SI unit of catalytic activity - - - - - The SI unit of does equivalent - - - - - The SI unit of absorbed dose - - - - - The SI unit of activity referred to a radionuclide - - - - - The SI unit of illuminance - - - - - The SI unit of luminous flux - - - - - The SI unit of inductance - - - - - The SI unit of magnetic flux density - - - - - The SI unit of magnetic flux - - - - - The SI unit of electric conductance - - - - - The SI unit of electric resistance - - - - - The SI unit of capacitance - - - - - The SI unit of electric potential difference, electromotive force - - - - - The SI unit of electric charge, amount of electricity - - - - - The SI unit of power, radiant flux - - - - - The SI unit of energy, work, amount of heat - - - - - The SI unit of pressure, stress - - - - - The SI unit of force - - - - - The SI unit of frequency - - - - - The SI unit of luminous intensity - - - - - The SI unit of amount of substance - - - - - The SI unit of thermodynamic temperature - - - - - The SI unit of electric current - - - - - The SI unit of time - - - - - The SI unit of mass - - - - - The SI unit of length - - - - - The SI unit of length - - - - - A synonym for henry, the SI unit of inductance - - - - - A synonym for katal, the SI unit of catalytic activity - - - - - A synonym for sievert, the SI unit of does equivalent - - - - - A synonym for gray, the SI unit of absorbed dose - - - - - A synonym for becquerel, the SI unit of activity referred to a radionuclide - - - - - A synonym for lux, the SI unit of illuminance - - - - - A synonym for lumen, the SI unit of luminous flux - - - - - A synonym for tesla, the SI unit of magnetic flux density - - - - - A synonym for weber, the SI unit of magnetic flux - - - - - A synonym for UnitNames.ohm, the SI unit of electric resistance. - - - - - A synonym for siemens, the SI unit of electric conductance - - - - - A synonym for farad, the SI unit of capacitance - - - - - A synonym for volt, the SI unit of electric potential difference, electromotive force - - - - - A synonym for coulomb, the SI unit of electric charge, amount of electricity - - - - - A synonym for watt, the SI unit of power, radiant flux - - - - - A synonym for joule, the SI unit of energy, work, amount of heat - - - - - A synonym for pascal, the SI unit of pressure, stress - - - - - A synonym for newton, the SI unit of force - - - - - A synonym for hertz, the SI unit of frequency - - - - - A synonym for candela, the SI unit of luminous intensity - - - - - A synonym for mole, the SI unit of amount of substance - - - - - A synonym for kelvin, the SI unit of thermodynamic temperature - - - - - A synonym for ampere, the SI unit of electric current - - - - - A synonym for second, the SI unit of time - - - - - A synonym for kilogram, the SI unit of mass - - - - - A synonym for Metre, the SI unit of length - - - - - Abstract internal type - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Allocates a region of memory on the stack. - The number of objects of type T to allocate. - A typed pointer to the allocated memory. - - - Assigns the value into the memory location referenced by the typed native - pointer computed by adding index * sizeof<'T> to the given input pointer. - The input pointer. - The index by which to offset the pointer. - The value to assign. - - - Assigns the value into the memory location referenced by the given typed native pointer. - The input pointer. - The value to assign. - - - Dereferences the given typed native pointer. - The input pointer. - The value at the pointer address. - - - Dereferences the typed native pointer computed by adding index * sizeof<'T> to the - given input pointer. - The input pointer. - The index by which to offset the pointer. - The value at the pointer address. - - - Returns a typed native pointer by adding index * sizeof<'T> to the - given input pointer. - The input pointer. - The index by which to offset the pointer. - A typed pointer. - - - Returns a machine address for a given typed native pointer. - The input pointer. - The machine address. - - - Returns a typed native pointer for a given machine address. - The pointer address. - A typed pointer. - - - Contains operations on native pointers. Use of these operators may - result in the generation of unverifiable code. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Gets the raw expression associated with this type-carrying expression - - - Type-carrying quoted expressions. Expressions are generated either - by quotations in source text or programatically - - - Returns type of an expression. - - - Returns the custom attributes of an expression. - - - Builds an expression that represents a while loop - The predicate to control the loop iteration. - The body of the while loop. - The resulting expression. - - - Builds an expression that represents setting a mutable variable - The input variable. - The value to set. - The resulting expression. - - - Builds an expression that represents a variable - The input variable. - The resulting expression. - - - Builds an expression that represents a constant value - The typed value. - The resulting expression. - - - Builds an expression that represents a constant value of a particular type - The untyped object. - The type of the object. - The resulting expression. - - - Builds an expression that represents a test of a value is of a particular union case - The expression to test. - The description of the union case. - The resulting expression. - - - Builds an expression that represents a type test. - The expression to test. - The target type. - The resulting expression. - - - Builds an expression that represents getting a field of a tuple - The input tuple. - The index of the tuple element to get. - The resulting expression. - - - Builds an expression that represents a try/with construct for exception filtering and catching. - The body of the try expression. - - - The variable to bind to a caught exception. - The expression evaluated when an exception is caught. - The resulting expression. - - - Try and find a stored reflection definition for the given method. Stored reflection - definitions are added to an F# assembly through the use of the [<ReflectedDefinition>] attribute. - The description of the method to find. - The reflection definition or None if a match could not be found. - - - Builds an expression that represents a try/finally construct - The body of the try expression. - The final part of the expression to be evaluated. - The resulting expression. - - - Format the expression as a string - Indicates if method, property, constructor and type objects should be printed in detail. If false, these are abbreviated to their name. - The formatted string. - - - Substitutes through the given expression using the given functions - to map variables to new values. The functions must give consistent results - at each application. Variable renaming may occur on the target expression - if variable capture occurs. - The function to map variables into expressions. - The expression with the given substitutions. - - - Builds an expression that represents the sequential execution of one expression followed by another - The first expression. - The second expression. - The resulting expression. - - - Permits interactive environments such as F# Interactive - to explicitly register new pickled resources that represent persisted - top level definitions. The string indicates a unique name for the resources - being added. The format for the bytes is the encoding generated by the F# compiler. - The assembly associated with the resource. - The unique name for the resources being added. - The serialized resource to register with the environment. - - - Builds an expression that represents a nested quotation literal - The expression being quoted. - The resulting expression. - - - Builds an expression that represents writing to a static property - The description of the property. - The value to set. - List of indices for the property if it is an indexed property. - The resulting expression. - - - Builds an expression that represents writing to a property of an object - The input object. - The description of the property. - The value to set. - List of indices for the property if it is an indexed property. - The resulting expression. - - - Builds an expression that represents reading a static property - The description of the property. - List of indices for the property if it is an indexed property. - The resulting expression. - - - Builds an expression that represents reading a property of an object - The input object. - The description of the property. - List of indices for the property if it is an indexed property. - The resulting expression. - - - Builds an expression that represents the creation of a union case value - The description of the union case. - The list of arguments for the case. - The resulting expression. - - - Builds an expression that represents the creation of an F# tuple value - The list of elements of the tuple. - The resulting expression. - - - Builds record-construction expressions - The type of record. - The list of elements of the record. - The resulting expression. - - - Builds an expression that represents the invocation of an object constructor - The description of the constructor. - The list of arguments to the constructor. - The resulting expression. - - - Builds an expression that represents the creation of a delegate value for the given type - The type of delegate. - The parameters for the delegate. - The body of the function. - The resulting expression. - - - Builds an expression that represents the creation of an array value initialized with the given elements - The type for the elements of the array. - The list of elements of the array. - The resulting expression. - - - Builds recursives expressions associated with 'let rec' constructs - The list of bindings for the let expression. - The sub-expression where the bindings are in scope. - The resulting expression. - - - Builds expressions associated with 'let' constructs - The variable in the let expression. - The expression bound to the variable. - The sub-expression where the binding is in scope. - The resulting expression. - - - Builds an expression that represents the constrution of an F# function value - The parameter to the function. - The body of the function. - The resulting expression. - - - Builds 'if ... then ... else' expressions. - The condition expression. - The then sub-expression. - The else sub-expression. - The resulting expression. - - - Fetches or creates a new variable with the given name and type from a global pool of shared variables - indexed by name and type. The type is given by the expicit or inferred type parameter - The variable name. - The created of fetched typed global variable. - - - Gets the free expression variables of an expression as a list. - A sequence of the free variables in the expression. - - - Builds a 'for i = ... to ... do ...' expression that represent loops over integer ranges - The sub-expression declaring the loop variable. - The sub-expression setting the initial value of the loop variable. - The sub-expression declaring the final value of the loop variable. - The sub-expression representing the body of the loop. - The resulting expression. - - - Builds an expression that represents writing to a field of an object - The input object. - The description of the field to write to. - The value to set to the field. - The resulting expression. - - - Builds an expression that represents writing to a static field - The description of the field to write to. - The value to the set to the field. - The resulting expression. - - - Builds an expression that represents the access of a field of an object - The input object. - The description of the field to access. - The resulting expression. - - - Builds an expression that represents the access of a static field - The description of the field to access. - The resulting expression. - - - - - - This function is called automatically when quotation syntax (<@ @>) and related typed-expression - quotations are used. The bytes are a pickled binary representation of an unlinked form of the quoted expression, - and the System.Type argument is any type in the assembly where the quoted - expression occurs, i.e. it helps scope the interpretation of the cross-assembly - references in the bytes. - A type in the assembly where the quotation occurs. - The list of spliced types. - The list of spliced expressions. - The serialized form of the quoted expression. - The resulting expression. - - - Builds an expression that represents the invocation of a default object constructor - The type on which the constructor is invoked. - The resulting expression. - - - Builds an expression that represents the coercion of an expression to a type - The expression to coerce. - The target type. - The resulting expression. - - - Returns a new typed expression given an underlying runtime-typed expression. - A type annotation is usually required to use this function, and - using an incorrect type annotation may result in a later runtime exception. - The expression to cast. - The resulting typed expression. - - - Builds an expression that represents a call to an instance method associated with an object - The input object. - The description of the method to call. - The list of arguments to the method. - The resulting expression. - - - Builds an expression that represents a call to an static method or module-bound function - The MethodInfo describing the method to call. - The list of arguments to the method. - The resulting expression. - - - Builds an expression that represents the application of a first class function value to multiple arguments - The function to apply. - The list of lists of arguments to the function. - The resulting expression. - - - Builds an expression that represents the application of a first class function value to a single argument. - The function to apply. - The argument to the function. - The resulting expression. - - - Builds an expression that represents setting the value held at a particular address. - The target expression. - The value to set at the address. - The resulting expression. - - - Builds an expression that represents getting the address of a value. - The target expression. - The resulting expression. - - - Quoted expressions annotated with System.Type values. - - - The type associated with the variable - - - The declared name of the variable - - - Indicates if the variable represents a mutable storage location - - - Fetches or create a new variable with the given name and type from a global pool of shared variables - indexed by name and type - The name of the variable. - The type associated with the variable. - The retrieved or created variable. - - - Creates a new variable with the given name, type and mutability - The declared name of the variable. - The type associated with the variable. - Indicates if the variable represents a mutable storage location. Default is false. - The created variable. - - - Information at the binding site of a variable - - - Re-build combination expressions. The first parameter should be an object - returned by the ShapeCombination case of the active pattern in this module. - The input shape. - The list of arguments. - The rebuilt expression. - - - An active pattern that performs a complete decomposition viewing the expression tree as a binding structure - The input expression. - The decomposed Var, Lambda, or ConstApp. - - - Active patterns for traversing, visiting, rebuilding and tranforming expressions in a generic way - - - An active pattern to recognize property setters that have an associated ReflectedDefinition - The description of the property. - The expression of the method definition if found, or None. - - - An active pattern to recognize property getters or values in modules that have an associated ReflectedDefinition - The description of the property. - The expression of the method definition if found, or None. - - - An active pattern to recognize methods that have an associated ReflectedDefinition - The description of the method. - The expression of the method definition if found, or None. - - - A parameterized active pattern to recognize calls to a specified function or method. - The returned elements are the optional target object (present if the target is an - instance method), the generic type instantation (non-empty if the target is a generic - instantiation), and the arguments to the function or method. - The input template expression to specify the method to call. - The optional target object (present if the target is an - instance method), the generic type instantation (non-empty if the target is a generic - instantiation), and the arguments to the function or method. - - - An active pattern to recognize constant unsigned int64 expressions - The input expression to match against. - uint64 option - - - An active pattern to recognize constant int64 expressions - The input expression to match against. - int64 option - - - An active pattern to recognize constant unsigned int32 expressions - The input expression to match against. - uint32 option - - - An active pattern to recognize constant int32 expressions - The input expression to match against. - int32 option - - - An active pattern to recognize constant unsigned int16 expressions - The input expression to match against. - uint16 option - - - An active pattern to recognize constant int16 expressions - The input expression to match against. - int16 option - - - An active pattern to recognize constant byte expressions - The input expression to match against. - byte option - - - An active pattern to recognize constant signed byte expressions - The input expression to match against. - sbyte option - - - An active pattern to recognize constant unicode character expressions - The input expression to match against. - char option - - - An active pattern to recognize constant 64-bit floating point number expressions - The input expression to match against. - float option - - - An active pattern to recognize constant 32-bit floating point number expressions - The input expression to match against. - float32 option - - - An active pattern to recognize constant string expressions - The input expression to match against. - string option - - - An active pattern to recognize constant boolean expressions - The input expression to match against. - bool option - - - An active pattern to recognize () constant expressions - The input expression to match against. - unit option - - - An active pattern to recognize expressions of the form a || b - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions of the form a && b - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions that represent the application of a (possibly curried or tupled) first class function value - The input expression to match against. - (Expr * Expr list list) option - - - An active pattern to recognize expressions that represent a (possibly curried or tupled) first class function value - The input expression to match against. - (Var list list * Expr) option - - - Contains a set of derived F# active patterns to analyze F# expression objects - - - An active pattern to recognize expressions that represent setting a mutable variable - The input expression to match against. - (Var * Expr) option - - - An active pattern to recognize expressions that represent a variable - The input expression to match against. - Var option - - - An active pattern to recognize expressions that represent a constant value - The input expression to match against. - (obj * Type) option - - - An active pattern to recognize expressions that represent a test if a value is of a particular union case - The input expression to match against. - (Expr * UnionCaseInfo) option - - - An active pattern to recognize expressions that represent a dynamic type test - The input expression to match against. - (Expr * Type) option - - - An active pattern to recognize expressions that represent getting a tuple field - The input expression to match against. - (Expr * int) option - - - An active pattern to recognize expressions that represent a try/finally construct - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions that represent a try/with construct for exception filtering and catching - The input expression to match against. - (Expr * Var * Expr * Var * Expr) option - - - An active pattern to recognize expressions that represent sequential exeuction of one expression followed by another - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions that represent a nested quotation literal - The input expression to match against. - Expr option - - - An active pattern to recognize expressions that represent setting a static or instance property, or a non-function value declared in a module - The input expression to match against. - (Expr option * PropertyInfo * Expr list * Expr) option - - - An active pattern to recognize expressions that represent the read of a static or instance property, or a non-function value declared in a module - The input expression to match against. - (Expr option * PropertyInfo * Expr list) option - - - An active pattern to recognize expressions that represent construction of tuple values - The input expression to match against. - (Expr list) option - - - An active pattern to recognize expressions that represent construction of particular union case values - The input expression to match against. - (UnionCaseInfo * Expr list) option - - - An active pattern to recognize expressions that represent construction of record values - The input expression to match against. - (Type * Expr list) option - - - An active pattern to recognize expressions that represent invocation of object constructors - The input expression to match against. - (ConstructorInfo * Expr list) option - - - An active pattern to recognize expressions that represent construction of delegate values - The input expression to match against. - (Type * Var list * Expr) option - - - An active pattern to recognize expressions that represent invocations of a default constructor of a struct - The input expression to match against. - Type option - - - An active pattern to recognize expressions that represent the construction of arrays - The input expression to match against. - (Type * Expr list) option - - - An active pattern to recognize expressions that represent recursive let bindings of one or more variables - The input expression to match against. - ((Var * Expr) list * Expr) option - - - An active pattern to recognize expressions that represent let bindings - The input expression to match against. - (Var * Expr * Expr) option - - - An active pattern to recognize expressions that represent first class function values - The input expression to match against. - (Var * Expr) option - - - An active pattern to recognize expressions that represent conditionals - The input expression to match against. - (Expr * Expr * Expr) option - - - An active pattern to recognize expressions that represent while loops - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions that represent loops over integer ranges - The input expression to match against. - (Var * Expr * Expr * Expr) option - - - An active pattern to recognize expressions that represent setting a static or instance field - The input expression to match against. - (Expr option * FieldInfo * Expr) option - - - An active pattern to recognize expressions that represent getting a static or instance field - The input expression to match against. - (Expr option * FieldInfo) option - - - An active pattern to recognize expressions that represent coercions from one type to another - The input expression to match against. - (Expr * Type) option - - - An active pattern to recognize expressions that represent calls to static and instance methods, and functions defined in modules - The input expression to match against. - (Expr option * MethodInfo * Expr list) option - - - An active pattern to recognize expressions that represent applications of first class function values - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions that represent setting the value held at an address - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions that represent getting the address of a value - The input expression to match against. - Expr option - - - Contains a set of primitive F# active patterns to analyze F# expression objects - - - Returns a System.Type representing an F# tuple type with the given element types - An array of types for the tuple elements. - The type representing the tuple containing the input elements. - - - Returns a System.Type representing the F# function type with the given domain and range - The input type of the function. - The output type of the function. - The function type with the given domain and range. - - - Returns true if the typ is a representation of an F# union type or the runtime type of a value of that type - The type to check. - Optional binding flags. - True if the type check succeeds. - - - Return true if the typ is a representation of an F# tuple type - The type to check. - True if the type check succeeds. - - - Return true if the typ is a representation of an F# record type - The type to check. - Optional binding flags. - True if the type check succeeds. - - - Return true if the typ is a System.Type value corresponding to the compiled form of an F# module - The type to check. - True if the type check succeeds. - - - Return true if the typ is a representation of an F# function type or the runtime type of a closure implementing an F# function type - The type to check. - True if the type check succeeds. - - - Returns true if the typ is a representation of an F# exception declaration - The type to check. - Optional binding flags. - True if the type check is an F# exception. - - - Gets the cases of a union type. - - Assumes the given type is a union type. If not, ArgumentException is raised during pre-computation. - The input union type. - Optional binding flags. - Thrown when the input type is not a union type. - An array of descriptions of the cases of the given union type. - - - Gets the tuple elements from the representation of an F# tuple type. - The input tuple type. - An array of the types contained in the given tuple type. - - - Reads all the fields from a record value, in declaration order - - Assumes the given input is a record value. If not, ArgumentException is raised. - The input record type. - Optional binding flags. - An array of descriptions of the properties of the record type. - - - Gets the domain and range types from an F# function type or from the runtime type of a closure implementing an F# type - The input function type. - A tuple of the domain and range types of the input function. - - - Reads all the fields from an F# exception declaration, in declaration order - - Assumes exceptionType is an exception representation type. If not, ArgumentException is raised. - The exception type to read. - Optional binding flags. - Thrown if the given type is not an exception. - An array containing the PropertyInfo of each field in the exception. - - - Contains operations associated with constructing and analyzing F# types such as records, unions and tuples - - - Assumes the given type is a union type. - If not, ArgumentException is raised during pre-computation. - - Using the computed function is more efficient than calling GetUnionCase - because the path executed by the computed function is optimized given the knowledge that it will be - used to read values of the given type. - The type of union to optimize reading. - Optional binding flags. - An optimized function to read the tags of the given union type. - - - Precompute a property or static method for reading an integer representing the case tag of a union type. - The type of union to read. - Optional binding flags. - The description of the union case reader. - - - Precomputes a function for reading all the fields for a particular discriminator case of a union type - - Using the computed function will typically be faster than executing a corresponding call to GetFields - The description of the union case to read. - Optional binding flags. - A function to for reading the fields of the given union case. - - - A method that constructs objects of the given case - The description of the union case. - Optional binding flags. - The description of the constructor of the given union case. - - - Precomputes a function for constructing a discriminated union value for a particular union case. - The description of the union case. - Optional binding flags. - A function for constructing values of the given union case. - - - Precomputes a function for reading the values of a particular tuple type - - Assumes the given type is a TupleType. - If not, ArgumentException is raised during pre-computation. - The tuple type to read. - Thrown when the given type is not a tuple type. - A function to read values of the given tuple type. - - - Gets information that indicates how to read a field of a tuple - The input tuple type. - The index of the tuple element to describe. - The description of the tuple element and an optional type and index if the tuple is big. - - - Gets a method that constructs objects of the given tuple type. - For small tuples, no additional type will be returned. - - For large tuples, an additional type is returned indicating that - a nested encoding has been used for the tuple type. In this case - the suffix portion of the tuple type has the given type and an - object of this type must be created and passed as the last argument - to the ConstructorInfo. A recursive call to PreComputeTupleConstructorInfo - can be used to determine the constructor for that the suffix type. - The input tuple type. - The description of the tuple type constructor and an optional extra type - for large tuples. - - - Precomputes a function for reading the values of a particular tuple type - - Assumes the given type is a TupleType. - If not, ArgumentException is raised during pre-computation. - The type of tuple to read. - Thrown when the given type is not a tuple type. - A function to read a particular tuple type. - - - Precompute a function for reading all the fields from a record. The fields are returned in the - same order as the fields reported by a call to Microsoft.FSharp.Reflection.Type.GetInfo for - this type. - - Assumes the given type is a RecordType. - If not, ArgumentException is raised during pre-computation. - - Using the computed function will typically be faster than executing a corresponding call to Value.GetInfo - because the path executed by the computed function is optimized given the knowledge that it will be - used to read values of the given type. - The type of record to read. - Optional binding flags. - Thrown when the input type is not a record type. - An optimized reader for the given record type. - - - Precompute a function for reading a particular field from a record. - Assumes the given type is a RecordType with a field of the given name. - If not, ArgumentException is raised during pre-computation. - - Using the computed function will typically be faster than executing a corresponding call to Value.GetInfo - because the path executed by the computed function is optimized given the knowledge that it will be - used to read values of the given type. - The PropertyInfo of the field to read. - Thrown when the input type is not a record type. - A function to read the specified field from the record. - - - Get a ConstructorInfo for a record type - The record type. - Optional binding flags. - A ConstructorInfo for the given record type. - - - Precompute a function for constructing a record value. - - Assumes the given type is a RecordType. - If not, ArgumentException is raised during pre-computation. - The type of record to construct. - Optional binding flags. - Thrown when the input type is not a record type. - A function to construct records of the given type. - - - Create a union case value. - The description of the union case to create. - The array of arguments to construct the given case. - Optional binding flags. - The constructed union case. - - - Creates an instance of a tuple type - - Assumes at least one element is given. If not, ArgumentException is raised. - The array of tuple fields. - The tuple type to create. - Thrown if no elements are given. - An instance of the tuple type with the given elements. - - - Creates an instance of a record type. - - Assumes the given input is a record type. - The type of record to make. - The array of values to initialize the record. - Optional binding flags for the record. - Thrown when the input type is not a record type. - The created record. - - - Builds a typed function from object from a dynamic function implementation - The function type of the implementation. - The untyped lambda of the function implementation. - A typed function from the given dynamic implementation. - - - Identify the union case and its fields for an object - - Assumes the given input is a union case value. If not, ArgumentException is raised. - - If the type is not given, then the runtime type of the input object is used to identify the - relevant union type. The type should always be given if the input object may be null. For example, - option values may be represented using the 'null'. - The input union case. - The union type containing the value. - Optional binding flags. - Thrown when the input type is not a union case value. - The description of the union case and its fields. - - - Reads all fields from a tuple. - - Assumes the given input is a tuple value. If not, ArgumentException is raised. - The input tuple. - Thrown when the input is not a tuple value. - An array of the fields from the given tuple. - - - Reads a field from a tuple value. - - Assumes the given input is a tuple value. If not, ArgumentException is raised. - The input tuple. - The index of the field to read. - The value of the field. - - - Reads all the fields from a record value. - - Assumes the given input is a record value. If not, ArgumentException is raised. - The record object. - Optional binding flags for the record. - Thrown when the input type is not a record type. - The array of fields from the record. - - - Reads a field from a record value. - - Assumes the given input is a record value. If not, ArgumentException is raised. - The record object. - The PropertyInfo describing the field to read. - Thrown when the input type is not a record type. - The field from the record. - - - Reads all the fields from a value built using an instance of an F# exception declaration - - Assumes the given input is an F# exception value. If not, ArgumentException is raised. - The exception instance. - Optional binding flags. - Thrown when the input type is not an F# exception. - The fields from the given exception. - - - Contains operations associated with constructing and analyzing values associated with F# types - such as records, unions and tuples. - - - The integer tag for the case. - - - The name of the case. - - - The type in which the case occurs. - - - The fields associated with the case, represented by a PropertyInfo. - The fields associated with the case. - - - Returns the custom attributes associated with the case matching the given attribute type. - The type of attributes to return. - An array of custom attributes. - - - Returns the custom attributes associated with the case. - An array of custom attributes. - - - Represents a case of a discriminated union type - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - A record of options to control structural formatting. - For F# Interactive properties matching those of this value can be accessed via the 'fsi' - value. - - Floating Point format given in the same format accepted by System.Double.ToString, - e.g. f6 or g15. - - If ShowProperties is set the printing process will evaluate properties of the values being - displayed. This may cause additional computation. - - The ShowIEnumerable is set the printing process will force the evalution of IEnumerable objects - to a small, finite depth, as determined by the printing parameters. - This may lead to additional computation being performed during printing. - - <example> - From F# Interactive the default settings can be adjusted using, for example, - <pre> - open Microsoft.FSharp.Compiler.Interactive.Settings;; - setPrintWidth 120;; - </pre> - </example> - - - - - Data representing structured layouts of terms. - - - - - Convert any value to a layout using the given formatting options. The - layout can then be processed using formatting display engines such as - those in the LayoutOps module. any_to_string and output_any are - built using any_to_layout with default format options. - - - - - - - - Ouput any value to a channel using the same set of formatting rules - as any_to_string - - - - - Convert any value to a string using a standard formatter - Data is typically formatted in a structured format, e.g. - lists are formatted using the "[1;2]" notation. - The details of the format are not specified and may change - from version to version and according to the flags given - to the F# compiler. The format is intended to be human-readable, - not machine readable. If alternative generic formats are required - you should develop your own formatter, using the code in the - implementation of this file as a starting point. - - Data from other .NET languages is formatted using a virtual - call to Object.ToString() on the boxed version of the input. - - - - - - - - For limitting layout of list-like sequences (lists,arrays,etc). - unfold a list of items using (project and z) making layout list via itemL. - If reach maxLength (before exhausting) then truncate. - - - - - See tagL - - - - - Layout like an F# list. - - - - - Layout like an F# option. - - - - - Layout list vertically. - - - - - Layout two vertically. - - - - - Form tuple of layouts. - - - - - Wrap braces around layout. - - - - - Wrap square brackets around layout. - - - - - Wrap round brackets around Layout. - - - - - Join layouts into a list separated using the given Layout. - - - - - Join layouts into a semi-colon separated list. - - - - - Join layouts into a space separated list. - - - - - Join layouts into a comma separated list. - - - - - Join broken with ident=2 - - - - - Join broken with ident=1 - - - - - Join broken with ident=0 - - - - - Join, possible break with indent=2 - - - - - Join, possible break with indent=1 - - - - - Join, possible break with indent=0 - - - - - Join, unbreakable. - - - - - An string which is left parenthesis (no space on the right). - - - - - An string which is right parenthesis (no space on the left). - - - - - An string which requires no spaces either side. - - - - - An string leaf - - - - - An uninterpreted leaf, to be interpreted into a string - by the layout engine. This allows leaf layouts for numbers, strings and - other atoms to be customized according to culture. - - - - - Is it the empty layout? - - - - - The empty layout - - - - - A layout is a sequence of strings which have been joined together. - The strings are classified as words, separators and left and right parenthesis. - This classification determines where spaces are inserted. - A joint is either unbreakable, breakable or broken. - If a joint is broken the RHS layout occurs on the next line with optional indentation. - A layout can be squashed to for given width which forces breaks as required. - - - - Gets a read-only collection of the Exception instances that caused - the current exception. - - - Represents one or more errors that occur during application execution. - - - Subscribe an observer to the source of results - The observer to be added to those that are notified. - An IDisposable to allow for unsubscription. - - - A source of observable results - - - Notify an observer of a new result - The value to notify observers. - - - Notify an observer of an error - The exception to notify observers. - - - Notify an observer that no more results will be produced. - - - A client that may be subscribed to observe the results from an IObservable. - - - The value contained in the Lazy. - - - Is true if the value is ready to be accessed. - - - Encapsulates a lazily computed value. - - - - - - - - - Compiled versions of F# tuple types. These are not used directly, though - these compiled forms are seen by other CLI languages. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Determines whether the current object precedes, occurs in the same position as, - or follows another object in the sort order. - The object to compare with the current instance. - An object that performs comparisons. - An integer that indicates the relationship of the current object to the target object. - - - - - - Returns a hash code for the current instance. - An object that computes the hash code of the current object. - The hash code for the current instance. - - - Equality comparison against a target object with a given comparer. - The target for comparison. - Compares the two objects. - The result of the comparer. - - - - - - - Return the given big integer - - - - - Return the negation of a big integer - - - - - Return the difference of two big integers - - - - - Return the product of big integers - - - - - Return the modulus of big integers - - - - - This operator is for consistency when this type be used from other CLI languages - - - - - This operator is for consistency when this type be used from other CLI languages - - - - - This operator is for consistency when this type be used from other CLI languages - - - - - This operator is for consistency when this type be used from other CLI languages - - - - - This operator is for consistency when this type be used from other CLI languages - - - - - Convert a big integer to a 32-bit signed integer - - - - - Convert a big integer to a 64-bit signed integer - - - - - Convert a big integer to a floating point number - - - - - This operator is for consistency when this type be used from other CLI languages - - - - - Return the ratio of two big integers - - - - - Return the sum of two big integers - - - - - Get the big integer for zero - - - - - Return the sign of a big integer: 0, +1 or -1 - - - - - Get the big integer for one - - - - - Return true if a big integer is 'zero' - - - - - Return true if a big integer is 'one' - - - - - - - - Return n^m for two big integers - - - - - Parse a big integer from a string format - - - - - Return the greatest common divisor of two big integers - - - - - - - - - - - Compute the ratio and remainder of two big integers - - - - - Compute the absolute value of a big integer - - - - - Construct a BigInteger value for the given 64-bit integer - - - - - Construct a BigInteger value for the given integer - - - - - The type of arbitrary-sized integers - - - - Fetches the token representing the capability to detect cancellation of an operation. - - - Discards resources associated with this capability. - - - Creates a cancellation capability linking two tokens. - The first input token. - The second input token. - The created CancellationTokenSource. - - - Cancels the operation. - - - Creates a new cancellation capability. - - - Signals to a CancellationToken that it should be cancelled. - - - - - - Inequality operator for tokens. - The first input token. - The second input token. - False if the two tokens are equal. - - - Equality operator for tokens. - The first input token. - The second input token. - True if the two tokens are equal. - - - Flags whether an operation should be cancelled. - - - Registers an action to perform with the CancellationToken. - The action to associate with the token. - The state associated with the action. - The created registration object. - - - Equality comparison against another token. - The target for comparison. - True if the two tokens are equal. - - - Represents a capability to detect cancellation of an operation. - - - - - - - - - Inequality operator for registrations. - The first input registration. - The second input registration. - False if the two registrations are equal. - - - Equality operator for registrations. - The first input registration. - The second input registration. - True if the two registrations are equal. - - - Equality comparison against another registration. - The target for comparison. - True if the two registrations are equal. - - - Frees resources associated with the registration. - - - Represents a registration to a Cancellation token source. - - - diff --git a/packages/FSharp.Core/lib/net40/FSharp.Core.dll b/packages/FSharp.Core/lib/net40/FSharp.Core.dll deleted file mode 100644 index 633ef3da..00000000 Binary files a/packages/FSharp.Core/lib/net40/FSharp.Core.dll and /dev/null differ diff --git a/packages/FSharp.Core/lib/net40/FSharp.Core.optdata b/packages/FSharp.Core/lib/net40/FSharp.Core.optdata deleted file mode 100644 index 98ab64a0..00000000 Binary files a/packages/FSharp.Core/lib/net40/FSharp.Core.optdata and /dev/null differ diff --git a/packages/FSharp.Core/lib/net40/FSharp.Core.sigdata b/packages/FSharp.Core/lib/net40/FSharp.Core.sigdata deleted file mode 100644 index 7c21c754..00000000 Binary files a/packages/FSharp.Core/lib/net40/FSharp.Core.sigdata and /dev/null differ diff --git a/packages/FSharp.Core/lib/net40/FSharp.Core.xml b/packages/FSharp.Core/lib/net40/FSharp.Core.xml deleted file mode 100644 index 77e69d3e..00000000 --- a/packages/FSharp.Core/lib/net40/FSharp.Core.xml +++ /dev/null @@ -1,10715 +0,0 @@ - - -FSharp.Core - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Gets the tail of the list, which is a list containing all the elements of the list, excluding the first element - - - Gets the number of items contained in the list - - - Gets the element of the list at the given position. - Lists are represented as linked lists so this is an O(n) operation. - The index. - The value at the given index. - - - Gets a value indicating if the list contains no entries - - - Gets the first element of the list - - - Returns an empty list of a particular type - - - Returns a list with head as its first element and tail as its subsequent elements - A new head value for the list. - The existing list. - The list with head appended to the front of tail. - - - The type of immutable singly-linked lists. - - Use the constructors [] and :: (infix) to create values of this type, or - the notation [1;2;3]. Use the values in the List module to manipulate - values of this type, or pattern match against the values directly. - - - Lookup an element in the map. Raise KeyNotFoundException if no binding - exists in the map. - The input key. - Thrown when the key is not found. - The value mapped to the key. - - - Returns true if there are no bindings in the map. - - - The number of bindings in the map. - - - Lookup an element in the map, returning a Some value if the element is in the domain - of the map and None if not. - The input key. - The mapped value, or None if the key is not in the map. - - - Removes an element from the domain of the map. No exception is raised if the element is not present. - The input key. - The resulting map. - - - - - - Tests if an element is in the domain of the map. - The input key. - True if the map contains the given key. - - - Returns a new map with the binding added to the given map. - The input key. - The resulting map. - - - Builds a map that contains the bindings of the given IEnumerable. - The input sequence of key/value pairs. - The resulting map. - - - Immutable maps. Keys are ordered by F# generic comparison. - - Maps based on generic comparison are efficient for small keys. They are not a suitable choice if keys are recursive data structures - or if keys require bespoke comparison semantics. - - All members of this class are thread-safe and may be used concurrently from multiple threads. - - - An abbreviation for the CLI type System.Collections.Generic.List<_> - - - Returns a new set with the elements of the second set removed from the first. - The first input set. - The second input set. - A set containing elements of the first set that are not contained in the second set. - - - Compute the union of the two sets. - The first input set. - The second input set. - The union of the two input sets. - - - Returns the lowest element in the set according to the ordering being used for the set. - - - Returns the highest element in the set according to the ordering being used for the set. - - - A useful shortcut for Set.isEmpty. See the Set module for further operations on sets. - - - The number of elements in the set - - - A useful shortcut for Set.remove. Note this operation produces a new set - and does not mutate the original set. The new set will share many storage - nodes with the original. See the Set module for further operations on sets. - The value to remove from the set. - The result set. - - - Evaluates to "true" if all elements of the second set are in the first. - The set to test against. - True if this set is a superset of otherSet. - - - Evaluates to "true" if all elements of the first set are in the second. - The set to test against. - True if this set is a subset of otherSet. - - - Evaluates to "true" if all elements of the second set are in the first, and at least - one element of the first is not in the second. - The set to test against. - True if this set is a proper superset of otherSet. - - - Evaluates to "true" if all elements of the first set are in the second, and at least - one element of the second is not in the first. - The set to test against. - True if this set is a proper subset of otherSet. - - - - - - A useful shortcut for Set.contains. See the Set module for further operations on sets. - The value to check. - True if the set contains value. - - - A useful shortcut for Set.add. Note this operation produces a new set - and does not mutate the original set. The new set will share many storage - nodes with the original. See the Set module for further operations on sets. - The value to add to the set. - The result set. - - - Create a set containing elements drawn from the given sequence. - The input sequence. - The result set. - - - Immutable sets based on binary trees, where comparison is the - F# structural comparison function, potentially using implementations - of the IComparable interface on key values. - - See the Set module for further operations on sets. - - All members of this class are thread-safe and may be used concurrently from multiple threads. - - - An abbreviation for the type of immutable singly-linked lists. - - Use the constructors [] and :: (infix) to create values of this type, or - the notation [1;2;3]. Use the values in the List module to manipulate - values of this type, or pattern match against the values directly. - - - An abbreviation for the CLI type System.Collections.Generic.IEnumerable<_> - - - Fetches an element from a 2D array. You can also use the syntax array.[index1,index2]. - - The input array. - The index along the first dimension. - The index along the second dimension. - - The value of the array at the given index. - Thrown when the indices are negative or exceed the bounds of the array. - - - Sets the value of an element in an array. You can also use the syntax array.[index1,index2] <- value. - - The input array. - The index along the first dimension. - The index along the second dimension. - The value to set in the array. - Thrown when the indices are negative or exceed the bounds of the array. - - - Builds 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. - - The input array. - - The zero-based output array. - - - Builds 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 propagated to the output - array. - - A function that is applied to transform each element of the array. The two integers - provide the index of the element. - The input array. - - An array whose elements have been transformed by the given mapping. - - - Builds 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. - - A function that is applied to transform each item of the input array. - The input array. - - An array whose elements have been transformed by the given mapping. - - - Returns the length of an array in the second dimension. - - The input array. - - The length of the array in the second dimension. - - - Returns the length of an array in the first dimension. - - The input array. - - The length of the array in the first dimension. - - - Applies the given function to each element of the array. The integer indices passed to the - function indicates the index of element. - - A function to apply to each element of the array with the indices available as an argument. - The input array. - - - Applies the given function to each element of the array. - - A function to apply to each element of the array. - The input array. - - - Creates a based array where the entries are initially Unchecked.defaultof<'T>. - - The base for the first dimension of the array. - The base for the second dimension of the array. - The length of the first dimension of the array. - The length of the second dimension of the array. - - The created array. - Thrown when base1, base2, length1, or length2 is negative. - - - Creates a based array whose elements are all initially the given value. - - The base for the first dimension of the array. - The base for the second dimension of the array. - The length of the first dimension of the array. - The length of the second dimension of the array. - The value to populate the new array. - - The created array. - Thrown when base1, base2, length1, or length2 is negative. - - - Creates a based array given the dimensions and a generator function to compute the elements. - - The base for the first dimension of the array. - The base for the second dimension of the array. - The length of the first dimension of the array. - The length of the second dimension of the array. - A function to produce elements of the array given the two indices. - - The created array. - Thrown when base1, base2, length1, or length2 is negative. - - - Creates an array where the entries are initially Unchecked.defaultof<'T>. - - The length of the first dimension of the array. - The length of the second dimension of the array. - - The created array. - Thrown when length1 or length2 is negative. - - - Creates an array whose elements are all initially the given value. - - The length of the first dimension of the array. - The length of the second dimension of the array. - The value to populate the new array. - - The created array. - Thrown when length1 or length2 is negative. - - - Creates an array given the dimensions and a generator function to compute the elements. - - The length of the first dimension of the array. - The length of the second dimension of the array. - A function to produce elements of the array given the two indices. - - The generated array. - Thrown when either of the lengths is negative. - - - Reads a range of elements from the first array and write them into the second. - - The source array. - The first-dimension index to begin copying from in the source array. - The second-dimension index to begin copying from in the source array. - The target array. - The first-dimension index to begin copying into in the target array. - The second-dimension index to begin copying into in the target array. - The number of elements to copy across the first dimension of the arrays. - The number of elements to copy across the second dimension of the arrays. - Thrown when any of the indices are negative or if either of - the counts are larger than the dimensions of the array allow. - - - Builds 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. - - The input array. - - A copy of the input array. - - - Fetches the base-index for the second dimension of the array. - - The input array. - - The base-index of the second dimension of the array. - - - Fetches the base-index for the first dimension of the array. - - The input array. - - The base-index of the first dimension of the array. - - - Basic operations on 2-dimensional arrays. - - F# and CLI multi-dimensional arrays are typically zero-based. - However, CLI 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 propagated to a matching output - array on the Array2D.map and Array2D.mapi operations. - Non-zero-based arrays can also be created using Array2D.zeroCreateBased, - Array2D.createBased and Array2D.initBased. - - - Creates an array where the entries are initially the "default" value. - The length of the first dimension. - The length of the second dimension. - The length of the third dimension. - The created array. - - - Sets the value of an element in an array. You can also - use the syntax 'array.[index1,index2,index3] <- value'. - The input array. - The index along the first dimension. - The index along the second dimension. - The index along the third dimension. - The value to set at the given index. - - - Builds 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. - The function to transform the elements at each index in the array. - The input array. - The array created from the transformed elements. - - - Builds 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. - The function to transform each element of the array. - The input array. - The array created from the transformed elements. - - - Returns the length of an array in the third dimension. - The input array. - The length of the array in the third dimension. - - - Returns the length of an array in the second dimension. - The input array. - The length of the array in the second dimension. - - - Returns the length of an array in the first dimension - The input array. - The length of the array in the first dimension. - - - Applies the given function to each element of the array. The integer indicies passed to the - function indicates the index of element. - The function to apply to each element of the array. - The input array. - - - Applies the given function to each element of the array. - The function to apply to each element of the array. - The input array. - - - Fetches an element from a 3D array. You can also use the syntax 'array.[index1,index2,index3]' - The input array. - The index along the first dimension. - The index along the second dimension. - The index along the third dimension. - The value at the given index. - - - Creates an array given the dimensions and a generator function to compute the elements. - The length of the first dimension. - The length of the second dimension. - The length of the third dimension. - The function to create an initial value at each index into the array. - The created array. - - - Creates an array whose elements are all initially the given value. - The length of the first dimension. - The length of the second dimension. - The length of the third dimension. - The value of the array elements. - The created array. - - - Basic operations on rank 3 arrays. - - - Sets the value of an element in an array. You can also - use the syntax 'array.[index1,index2,index3,index4] <- value'. - The input array. - The index along the first dimension. - The index along the second dimension. - The index along the third dimension. - The index along the fourth dimension. - The value to set. - - - Fetches an element from a 4D array. You can also use the syntax 'array.[index1,index2,index3,index4]' - The input array. - The index along the first dimension. - The index along the second dimension. - The index along the third dimension. - The index along the fourth dimension. - The value at the given index. - - - Creates an array where the entries are initially the "default" value. - The length of the first dimension. - The length of the second dimension. - The length of the third dimension. - The length of the fourth dimension. - The created array. - - - Returns the length of an array in the fourth dimension. - The input array. - The length of the array in the fourth dimension. - - - Returns the length of an array in the third dimension. - The input array. - The length of the array in the third dimension. - - - Returns the length of an array in the second dimension. - The input array. - The length of the array in the second dimension. - - - Returns the length of an array in the first dimension - The input array. - The length of the array in the first dimension. - - - Creates an array given the dimensions and a generator function to compute the elements. - The length of the first dimension. - The length of the second dimension. - The length of the third dimension. - The length of the fourth dimension. - The function to create an initial value at each index in the array. - The created array. - - - Creates an array whose elements are all initially the given value - The length of the first dimension. - The length of the second dimension. - The length of the third dimension. - The length of the fourth dimension. - The initial value for each element of the array. - The created array. - - - Basic operations on rank 4 arrays. - - - Combines three arrays into an array of pairs. The three arrays must have equal lengths, otherwise an ArgumentException is - raised. - The first input array. - The second input array. - The third input array. - Thrown when the input arrays differ in length. - The array of tupled elements. - - - Combines the two arrays into an array of pairs. The two arrays must have equal lengths, otherwise an ArgumentException is - raised. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - The array of tupled elements. - - - Splits an array of triples into three arrays. - The input array. - The tuple of three arrays. - - - Splits an array of pairs into two arrays. - The input array. - The two arrays. - - - Returns the index of the first element in the array - that satisfies the given predicate. - The function to test the input elements. - The input array. - The index of the first element that satisfies the predicate, or None. - - - Returns the first element for which the given function returns true. - Return None if no such element exists. - The function to test the input elements. - The input array. - The first element that satisfies the predicate, or None. - - - Views the given array as a sequence. - The input array. - The sequence of array elements. - - - Builds a list from the given array. - The input array. - The list of array elements. - - - Returns the sum of the results generated by applying the function to each element of the array. - The function to transform the array elements into the type to be summed. - The input array. - The resulting sum. - - - Returns the sum of the elements in the array. - The input array. - The resulting sum. - - - Sorts the elements of an array by mutating the array in-place, using the given comparison function. - Elements are compared using Operators.compare. - The input array. - - - Sorts the elements of an array by mutating the array in-place, using the given comparison function as the order. - The function to compare pairs of array elements. - The input array. - - - Sorts the elements of an array by mutating the array in-place, using the given projection for the keys. - Elements are compared using Operators.compare. - - This is not a stable sort, i.e. the original order of equal elements is not necessarily preserved. - For a stable sort, consider using Seq.sort. - The function to transform array elements into the type that is compared. - The input array. - - - Sorts the elements of an array, using the given comparison function as the order, returning a new array. - - This is not a stable sort, i.e. the original order of equal elements is not necessarily preserved. - For a stable sort, consider using Seq.sort. - The function to compare pairs of array elements. - The input array. - The sorted array. - - - Sorts the elements of an array, using the given projection for the keys and returning a new array. - Elements are compared using Operators.compare. - - This is not a stable sort, i.e. the original order of equal elements is not necessarily preserved. - For a stable sort, consider using Seq.sort. - The function to transform array elements into the type that is compared. - The input array. - The sorted array. - - - Sorts the elements of an array, returning a new array. Elements are compared using Operators.compare. - - This is not a stable sort, i.e. the original order of equal elements is not necessarily preserved. - For a stable sort, consider using Seq.sort. - The input array. - The sorted array. - - - Builds a new array that contains the given subrange specified by - starting index and length. - The input array. - The index of the first element of the sub array. - The length of the sub array. - The created sub array. - - - Sets an element of an array. - The input array. - The input index. - The input value. - - - Like foldBack, but return both the intermediary and final results. - The function to update the state given the input elements. - The input array. - The initial state. - The array of state values. - - - Like fold, but return the intermediary and final results. - The function to update the state given the input elements. - The initial state. - The input array. - The array of state values. - - - Returns a new array with the elements in reverse order. - The input array. - The reversed array. - - - Applies 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. - The function to reduce a pair of elements to a single element. - The input array. - Thrown when the input array is empty. - The final result of the reductions. - - - Applies 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. - The function to reduce a pair of elements to a single element. - The input array. - Thrown when the input array is empty. - The final result of the redcutions. - - - Returns an array with all elements permuted according to the - specified permutation. - The function that maps input indices to output indices. - The input array. - The output array. - - - Splits the collection into two collections, containing the - elements for which the given predicate returns "true" and "false" - respectively. - The function to test the input elements. - The input array. - A pair of arrays. The first containing the elements the predicate evaluated to true, - and the second containing those evaluated to false. - - - Builds a new array from the given enumerable object. - The input sequence. - The array of elements from the sequence. - - - Builds an array from the given list. - The input list. - The array of elements from the list. - - - Returns the lowest of all elements of the array, compared via Operators.min on the function result. - - Throws ArgumentException for empty arrays. - The function to transform the elements into a type supporting comparison. - The input array. - Thrown when the input array is empty. - The minimum element. - - - Returns the lowest of all elements of the array, compared via Operators.min. - - Throws ArgumentException for empty arrays - The input array. - Thrown when the input array is empty. - The minimum element. - - - Returns the greatest of all elements of the array, compared via Operators.max on the function result. - - Throws ArgumentException for empty arrays. - The function to transform the elements into a type supporting comparison. - The input array. - Thrown when the input array is empty. - The maximum element. - - - Returns the greatest of all elements of the array, compared via Operators.max on the function result. - - Throws ArgumentException for empty arrays. - The input array. - Thrown when the input array is empty. - The maximum element. - - - Builds 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. - The function to transform elements and their indices. - The input array. - The array of transformed elements. - - - Builds 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. - The function to transform pairs of input elements and their indices. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - The array of transformed elements. - - - Builds 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. - The function to transform the pairs of the input elements. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - The array of transformed elements. - - - Builds a new array whose elements are the results of applying the given function - to each of the elements of the array. - The function to transform elements of the array. - The input array. - The array of transformed elements. - - - Returns the length of an array. You can also use property arr.Length. - The input array. - The length of the array. - - - Applies 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. - The function to apply to each index and pair of elements. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - - - Applies the given function to each element of the array. The integer passed to the - function indicates the index of element. - The function to apply to each index and element. - The input array. - - - Applies 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. - The function to apply. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - - - Applies the given function to each element of the array. - The function to apply. - The input array. - - - Returns true if the given array is empty, otherwise false. - The input array. - True if the array is empty. - - - Creates an array where the entries are initially the default value Unchecked.defaultof<'T>. - The length of the array to create. - The created array. - - - Creates an array given the dimension and a generator function to compute the elements. - The number of elements to initialize. - The function to generate the initial values for each index. - The created array. - - - Gets an element from an array. - The input array. - The input index. - The value of the array at the given index. - - - 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. - The function to update the state given the input elements. - The first input array. - The second input array. - The initial state. - Thrown when the input arrays differ in length. - The final state. - - - Applies 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. - The function to update the state given the input elements. - The initial state. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - The final state. - - - Applies 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)) - The function to update the state given the input elements. - The input array. - The initial state. - The final state. - - - Applies 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 - The function to update the state given the input elements. - The initial state. - The input array. - The final state. - - - Tests 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. - The function to test the input elements. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - True if all of the array elements satisfy the predicate. - - - Tests 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. - The function to test the input elements. - The input array. - True if all of the array elements satisfy the predicate. - - - Returns the index of the first element in the array - that satisfies the given predicate. Raise KeyNotFoundException if - none of the elements satisy the predicate. - The function to test the input elements. - The input array. - Thrown if predicate - never returns true. - The index of the first element in the array that satisfies the given predicate. - - - Returns the first element for which the given function returns 'true'. - Raise KeyNotFoundException if no such element exists. - The function to test the input elements. - The input array. - Thrown if predicate - never returns true. - The first element for which predicate returns true. - - - Returns a new collection containing only the elements of the collection - for which the given predicate returns "true". - The function to test the input elements. - The input array. - An array containing the elements for which the given predicate returns true. - - - Tests 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. - The function to test the input elements. - The first input array. - The second input array. - True if any result from predicate is true. - - - Tests 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. - The function to test the input elements. - The input array. - True if any result from predicate is true. - - - Returns an empty array of the given type. - - - Applies the given function to each element of the array. Returns - the array comprised of the results "x" for each element where - the function returns Some(x) - The function to generate options from the elements. - The input array. - The array of results. - - - Applies 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. - The function to generate options from the elements. - The input array. - Thrown if every result from - chooser is None. - The first result. - - - Fills a range of elements of the array with the given value. - The target array. - The index of the first element to set. - The number of elements to set. - The value to set. - - - Applies 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. - The function to transform the array elements into options. - The input array. - The first transformed element that is Some(x). - - - Creates an array whose elements are all initially the given value. - The length of the array to create. - The value for the elements. - The created array. - - - Builds a new array that contains the elements of the given array. - The input array. - A copy of the input array. - - - Builds a new array that contains the elements of each of the given sequence of arrays. - The input sequence of arrays. - The concatenation of the sequence of input arrays. - - - For each element of the array, applies the given function. Concatenates all the results and return the combined array. - The function to create sub-arrays from the input array elements. - The input array. - The concatenation of the sub-arrays. - - - Reads a range of elements from the first array and write them into the second. - The source array. - The starting index of the source array. - The target array. - The starting index of the target array. - The number of elements to copy. - - - Returns the average of the elements generated by applying the function to each element of the array. - The function to transform the array elements before averaging. - The input array. - Thrown when array is empty. - The computed average. - - - Returns the average of the elements in the array. - The input array. - Thrown when array is empty. - The average of the elements in the array. - - - Builds a new array that contains the elements of the first array followed by the elements of the second array. - The first input array. - The second input array. - The resulting array. - - - 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. - The function to test the input elements. - The input array. - 'T[] * 'T[] - - - 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. - - - 'T[] - - - 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. - - The input 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. - - The input 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. - - 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. - - The input 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. - - The input array. - 'U[] - - - 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. - - The input array. - '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). - - 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. - The function to generate options from the elements. - The input array. - 'U[] - - - Provides parallel operations on arrays - - - Basic operations on arrays. - - - Compare using the given comparer function. - A function to compare two values. - An object implementing IComparer using the supplied comparer. - - - Structural comparison. Compare using Operators.compare. - - - Common notions of comparison identity used with sorted data structures. - - - Hash using the given hashing and equality functions. - A function to generate a hash code from a value. - A function to test equality of two values. - An object implementing IEqualityComparer using the supplied functions. - - - Physical hashing (hash on reference identity of objects, and the contents of value types). - Hash using LanguagePrimitives.PhysicalEquality and LanguagePrimitives.PhysicalHash, - That is, for value types use GetHashCode and Object.Equals (if no other optimization available), - and for reference types use System.Runtime.CompilerServices.RuntimeHelpers.GetHashCode and - reference equality. - - - - - - Structural hashing. Hash using Operators.(=) and Operators.hash. - - - Common notions of value identity used with hash tables. - - - Combines the three lists into a list of triples. The lists must have equal lengths. - The first input list. - The second input list. - The third input list. - A single list containing triples of matching elements from the input lists. - - - Combines the two lists into a list of pairs. The two lists must have equal lengths. - The first input list. - The second input list. - A single list containing pairs of matching elements from the input lists. - - - Splits a list of triples into three lists. - The input list. - Three lists of split elements. - - - Splits a list of pairs into two lists. - The input list. - Two lists of split elements. - - - Returns the index of the first element in the list - that satisfies the given predicate. - Return None if no such element exists. - The function to test the input elements. - The input list. - The index of the first element for which the predicate returns true, or None if - every element evaluates to false. - - - Returns the first element for which the given function returns true.. - Return None if no such element exists. - The function to test the input elements. - The input list. - The first element for which the predicate returns true, or None if - every element evaluates to false. - - - Applies the given function to successive elements, returning Some(x) the first - result where function returns Some(x) for some x. If no such element - exists then return None. - The function to generate options from the elements. - The input list. - The first resulting value or None. - - - Views the given list as a sequence. - The input list. - The sequence of elements in the list. - - - Builds an array from the given list. - The input list. - The array containing the elements of the list. - - - Returns the list after removing the first element. - - The input list. - Thrown when the list is empty. - The list after removing the first element. - - - Returns the sum of the results generated by applying the function to each element of the list. - The function to transform the list elements into the type to be summed. - The input list. - The resulting sum. - - - Returns the sum of the elements in the list. - The input list. - The resulting sum. - - - Sorts the given list using Operators.compare. - - This is a stable sort, i.e. the original order of equal elements is preserved. - The input list. - The sorted list. - - - Sorts the given list using keys given by the given projection. Keys are compared using Operators.compare. - - This is a stable sort, i.e. the original order of equal elements is preserved. - The function to transform the list elements into the type to be compared. - The input list. - The sorted list. - - - Sorts the given list using the given comparison function. - - This is a stable sort, i.e. the original order of equal elements is preserved. - The function to compare the list elements. - The input list. - The sorted list. - - - Like foldBack, but returns both the intermediary and final results - The function to update the state given the input elements. - The input list. - The initial state. - The list of states. - - - Applies a function to each element of the collection, threading an accumulator argument - through the computation. Take the second argument, and apply the function to it - and the first element of the list. Then feed this result into the function along - with the second element and so on. Returns the list of intermediate results and the final result. - The function to update the state given the input elements. - The initial state. - The input list. - The list of states. - - - Returns a new list with the elements in reverse order. - The input list. - The reversed list. - - - Creates a list by calling the given generator on each index. - The number of elements to replicate. - The value to replicate - The generated list. - - - Applies 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 i0 (...(f iN-1 iN)). - - Raises System.ArgumentException if list is empty - The function to reduce two list elements to a single element. - The input list. - Thrown when the list is empty. - The final reduced value. - - - Apply a function to each element of the collection, threading an accumulator argument - through the computation. Apply the function to the first two elements of the list. - Then feed this result into the function along with the third element and so on. - Return the final result. If the input function is f and the elements are i0...iN then computes - f (... (f i0 i1) i2 ...) iN. - - Raises System.ArgumentException if list is empty - The function to reduce two list elements to a single element. - The input list. - Thrown when the list is empty. - The final reduced value. - - - Returns a list with all elements permuted according to the - specified permutation. - The function to map input indices to output indices. - The input list. - The permutated list. - - - Applies the given function to successive elements, returning the first - result where function returns Some(x) for some x. If no such - element exists then raise System.Collections.Generic.KeyNotFoundException - The function to generate options from the elements. - The input list. - Thrown when the list is empty. - The first resulting value. - - - Splits the collection into two collections, containing the - elements for which the given predicate returns true and false - respectively. Element order is preserved in both of the created lists. - The function to test the input elements. - The input list. - A list containing the elements for which the predicate evaluated to false and a list - containing the elements for which the predicate evaluated to true. - - - Builds a new list from the given enumerable object. - The input sequence. - The list of elements from the sequence. - - - Builds a list from the given array. - The input array. - The list of elements from the array. - - - Indexes into the list. The first element has index 0. - The input list. - The index to retrieve. - The value at the given index. - - - Returns the lowest of all elements of the list, compared via Operators.min on the function result - - Raises System.ArgumentException if list is empty. - The function to transform list elements into the type to be compared. - The input list. - Thrown when the list is empty. - The minimum value. - - - Returns the lowest of all elements of the list, compared via Operators.min. - - Raises System.ArgumentException if list is empty - The input list. - Thrown when the list is empty. - The minimum value. - - - Returns the greatest of all elements of the list, compared via Operators.max on the function result. - - Raises System.ArgumentException if list is empty. - The function to transform the list elements into the type to be compared. - The input list. - Thrown when the list is empty. - The maximum element. - - - Return the greatest of all elements of the list, compared via Operators.max. - - Raises System.ArgumentException if list is empty - The input list. - Thrown when the list is empty. - The maximum element. - - - Like mapi, but mapping corresponding elements from two lists of equal length. - The function to transform pairs of elements from the two lists and their index. - The first input list. - The second input list. - The list of transformed elements. - - - Builds a new collection whose elements are the results of applying the given function - to each of the elements of the collection. The integer index passed to the - function indicates the index (from 0) of element being transformed. - The function to transform elements and their indices. - The input list. - The list of transformed elements. - - - Builds a new collection whose elements are the results of applying the given function - to the corresponding elements of the three collections simultaneously. - The function to transform triples of elements from the input lists. - The first input list. - The second input list. - The third input list. - The list of transformed elements. - - - Builds a new collection whose elements are the results of applying the given function - to the corresponding elements of the two collections pairwise. - The function to transform pairs of elements from the input lists. - The first input list. - The second input list. - The list of transformed elements. - - - Builds a new collection whose elements are the results of applying the given function - to each of the elements of the collection. - The function to transform elements from the input list. - The input list. - The list of transformed elements. - - - Returns the length of the list. - The input list. - The length of the list. - - - Applies the given function to two collections simultaneously. The - collections must have identical size. The integer passed to the - function indicates the index of element. - The function to apply to a pair of elements from the input lists along with their index. - The first input list. - The second input list. - - - Applies the given function to each element of the collection. The integer passed to the - function indicates the index of element. - The function to apply to the elements of the list along with their index. - The input list. - - - Applies the given function to two collections simultaneously. The - collections must have identical size. - The function to apply to pairs of elements from the input lists. - The first input list. - The second input list. - - - Applies the given function to each element of the collection. - The function to apply to elements from the input list. - The input list. - - - Returns true if the list contains no elements, false otherwise. - The input list. - True if the list is empty. - - - Creates a list by calling the given generator on each index. - The length of the list to generate. - The function to generate an element from an index. - The list of generated elements. - - - Returns the first element of the list. - - The input list. - Thrown when the list is empty. - The first element of the list. - - - Tests if all corresponding elements of the collection 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 System.ArgumentException exception is raised. - Otherwise, true is returned. - The function to test the input elements. - The first input list. - The second input list. - Thrown when the input lists differ in length. - True if all of the pairs of elements satisfy the predicate. - - - Tests if all elements of the collection satisfy the given predicate. - - The predicate is applied to the elements of the input list. If any application - returns false then the overall result is false and no further elements are tested. - Otherwise, true is returned. - The function to test the input elements. - The input list. - True if all of the elements satisfy the predicate. - - - Applies a function to corresponding elements of two collections, threading an accumulator argument - through the computation. The collections must have identical sizes. - If the input function is f and the elements are i0...iN and j0...jN - then computes f i0 j0 (...(f iN jN s)). - The function to update the state given the input elements. - The first input list. - The second input list. - The initial state. - The final state value. - - - Applies 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 i0 (...(f iN s)). - The function to update the state given the input elements. - The input list. - The initial state. - The final state value. - - - Applies a function to corresponding elements of two collections, threading an accumulator argument - through the computation. The collections must have identical sizes. - If the input function is f and the elements are i0...iN and j0...jN - then computes f (... (f s i0 j0)...) iN jN. - The function to update the state given the input elements. - The initial state. - The first input list. - The second input list. - The final state value. - - - Applies a function to each element of the collection, threading an accumulator argument - through the computation. Take the second argument, and apply the function to it - and the first element of the list. Then feed this result into the function along - with the second element and so on. Return the final result. - If the input function is f and the elements are i0...iN then - computes f (... (f s i0) i1 ...) iN. - The function to update the state given the input elements. - The initial state. - The input list. - The final state value. - - - Returns a new collection containing only the elements of the collection - for which the given predicate returns "true" - The function to test the input elements. - The input list. - A list containing only the elements that satisfy the predicate. - - - Returns the index of the first element in the list - that satisfies the given predicate. - Raises KeyNotFoundException if no such element exists. - The function to test the input elements. - The input list. - Thrown if the predicate evaluates to false for all the - elements of the list. - The index of the first element that satisfies the predicate. - - - Returns the first element for which the given function returns true. - Raises KeyNotFoundException if no such element exists. - The function to test the input elements. - The input list. - Thrown if the predicate evaluates to false for - all the elements of the list. - The first element that satisfies the predicate. - - - Tests if any pair of corresponding elements of the lists 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 System.ArgumentException exception is raised. - Otherwise, false is returned. - The function to test the input elements. - The first input list. - The second input list. - Thrown when the input lists differ in length. - True if any pair of elements satisfy the predicate. - - - Tests if any element of the list satisfies the given predicate. - - The predicate is applied to the elements of the input list. If any application - returns true then the overall result is true and no further elements are tested. - Otherwise, false is returned. - The function to test the input elements. - The input list. - True if any element satisfies the predicate. - - - Returns an empty list of the given type. - - - Returns a new list that contains the elements of each the lists in order. - The input sequence of lists. - The resulting concatenated list. - - - For each element of the list, applies the given function. Concatenates all the results and return the combined list. - The function to transform each input element into a sublist to be concatenated. - The input list. - The concatenation of the transformed sublists. - - - Applies the given function to each element of the list. Returns - the list comprised of the results x for each element where - the function returns Some(x) - The function to generate options from the elements. - The input list. - The list comprising the values selected from the chooser function. - - - Returns the average of the elements generated by applying the function to each element of the list. - - Raises System.ArgumentException if list is empty. - The function to transform the list elements into the type to be averaged. - The input list. - Thrown when the list is empty. - The resulting average. - - - Returns the average of the elements in the list. - - Raises System.ArgumentException if list is empty. - The input list. - Thrown when the list is empty. - The resulting average. - - - Returns a new list that contains the elements of the first list - followed by elements of the second. - The first input list. - The second input list. - The resulting list. - - - Basic operations on lists. - - - Returns the key of the first mapping in the collection that satisfies the given predicate. - Returns 'None' if no such element exists. - The function to test the input elements. - The input map. - The first key for which the predicate returns true or None if the predicate evaluates to false for each key/value pair. - - - Evaluates the function on each mapping in the collection. Returns the key for the first mapping - where the function returns 'true'. Raise KeyNotFoundException if no such element exists. - The function to test the input elements. - The input map. - Thrown if the key does not exist in the map. - The first key for which the predicate evaluates true. - - - Lookup an element in the map, returning a Some value if the element is in the domain - of the map and None if not. - The input key. - The input map. - The found Some value or None. - - - Removes an element from the domain of the map. No exception is raised if the element is not present. - The input key. - The input map. - The resulting map. - - - Builds two new maps, one containing the bindings for which the given predicate returns 'true', - and the other the remaining bindings. - The function to test the input elements. - The input map. - A pair of maps in which the first contains the elements for which the predicate returned true - and the second containing the elements for which the predicated returned false. - - - Tests if an element is in the domain of the map. - The input key. - The input map. - True if the map contains the key. - - - Builds a new collection whose elements are the results of applying the given function - to each of the elements of the collection. The key passed to the - function indicates the key of element being transformed. - The function to transform the key/value pairs. - The input map. - The resulting map of keys and transformed values. - - - Returns true if the given predicate returns true for all of the - bindings in the map. - The function to test the input elements. - The input map. - True if the predicate evaluates to true for all of the bindings in the map. - - - Builds a new map containing only the bindings for which the given predicate returns 'true'. - The function to test the key/value pairs. - The input map. - The filtered map. - - - Returns true if the given predicate returns true for one of the - bindings in the map. - The function to test the input elements. - The input map. - True if the predicate returns true for one of the key/value pairs. - - - Applies the given function to each binding in the dictionary - The function to apply to each key/value pair. - The input map. - - - Folds over the bindings in the map - The function to update the state given the input key/value pairs. - The initial state. - The input map. - The final state value. - - - Folds over the bindings in the map. - The function to update the state given the input key/value pairs. - The input map. - The initial state. - The final state value. - - - Searches the map looking for the first element where the given function returns a Some value - The function to generate options from the key/value pairs. - The input map. - The first result. - - - Searches the map looking for the first element where the given function returns a Some value. - The function to generate options from the key/value pairs. - The input map. - The first result. - - - Lookup an element in the map, raising KeyNotFoundException if no binding - exists in the map. - The input key. - The input map. - Thrown when the key does not exist in the map. - The value mapped to the given key. - - - The empty map. - - - Is the map empty? - The input map. - True if the map is empty. - - - Returns an array of all key-value pairs in the mapping. - The array will be ordered by the keys of the map. - The input map. - The array of key/value pairs. - - - Returns a list of all key-value pairs in the mapping. - The list will be ordered by the keys of the map. - The input map. - The list of key/value pairs. - - - Views the collection as an enumerable sequence of pairs. - The sequence will be ordered by the keys of the map. - The input map. - The sequence of key/value pairs. - - - Returns a new map made from the given bindings. - The input sequence of key/value pairs. - The resulting map. - - - Returns a new map made from the given bindings. - The input array of key/value pairs. - The resulting map. - - - Returns a new map made from the given bindings. - The input list of key/value pairs. - The resulting map. - - - Returns a new map with the binding added to the given map. - The input key. - The input value. - The input map. - The resulting map. - - - Functional programming operators related to the Map<_,_> type. - - - Combines the three sequences into a list of triples. The sequences need not have equal lengths: - when one sequence is exhausted any remaining elements in the other - sequences are ignored. - - The first input sequence. - The second input sequence. - The third input sequence. - - The result sequence. - - Thrown when any of the input sequences is null. - - - Combines the two sequences into a list of pairs. The two sequences need not have equal lengths: - when one sequence is exhausted any remaining elements in the other - sequence are ignored. - - The first input sequence. - The second input sequence. - - The result sequence. - - Thrown when either of the input sequences is null. - - - Returns a sequence that yields sliding windows of containing elements drawn from the input - sequence. Each window is returned as a fresh array. - - The number of elements in each window. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - - - Returns a sequence that contains the elements generated by the given computation. - The given initial state argument is passed to the element generator. - For each IEnumerator elements in the stream are generated on-demand by applying the element - generator, until a None value is returned by the element generator. Each call to the element - generator returns a new residual state. - - The stream will be recomputed each time an IEnumerator is requested and iterated for the Seq. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - A function that takes in the current state and returns an option tuple of the next - element of the sequence and the next state value. - The initial state value. - - The result sequence. - - - Returns a sequence that when enumerated returns at most N elements. - - The maximum number of items to enumerate. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Applies the given function to successive elements, returning the first - result where the function returns "Some(x)". - - A function that transforms items from the input sequence into options. - The input sequence. - - The chosen element or None. - - Thrown when the input sequence is null. - - - Returns the index of the first element in the sequence - that satisfies the given predicate. Return None if no such element exists. - - A function that evaluates to a Boolean when given an item in the sequence. - The input sequence. - - The found index or None. - - Thrown when the input sequence is null. - - - Returns the first element for which the given function returns true. - Return None if no such element exists. - - A function that evaluates to a Boolean when given an item in the sequence. - The input sequence. - - The found element or None. - - Thrown when the input sequence is null. - - - Builds a list from the given collection. - - The input sequence. - - The result list. - - Thrown when the input sequence is null. - - - Builds an array from the given collection. - - The input sequence. - - The result array. - - Thrown when the input sequence is null. - - - Returns a sequence that, when iterated, yields elements of the underlying sequence while the - given predicate returns true, and then returns no further elements. - - A function that evaluates to false when no more items should be returned. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns the first N elements of the sequence. - Throws InvalidOperationException - if the count exceeds the number of elements in the sequence. Seq.truncate - returns as many items as the sequence contains instead of throwing an exception. - - The number of items to take. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - Thrown when count exceeds the number of elements - in the sequence. - - - Returns the sum of the results generated by applying the function to each element of the sequence. - The generated elements are summed using the + operator and Zero property associated with the generated type. - - A function to transform items from the input sequence into the type that will be summed. - The input sequence. - - The computed sum. - - - Returns the sum of the elements in the sequence. - - The elements are summed using the + operator and Zero property associated with the generated type. - - The input sequence. - - The computed sum. - - - Applies a key-generating function to each element of a sequence and yield a sequence ordered - by keys. The keys are compared using generic comparison as implemented by Operators.compare. - - This function returns a sequence that digests the whole initial sequence as soon as - that sequence is iterated. As a result this function should not be used with - large or infinite sequences. The function makes no assumption on the ordering of the original - sequence. - - This is a stable sort, that is the original order of equal elements is preserved. - - A function to transform items of the input sequence into comparable keys. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Yields a sequence ordered by keys. - - This function returns a sequence that digests the whole initial sequence as soon as - that sequence is iterated. As a result this function should not be used with - large or infinite sequences. The function makes no assumption on the ordering of the original - sequence. - - This is a stable sort, that is the original order of equal elements is preserved. - - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns a sequence that, when iterated, skips elements of the underlying sequence while the - given predicate returns true, and then yields the remaining elements of the sequence. - - A function that evaluates an element of the sequence to a boolean value. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns a sequence that skips N elements of the underlying sequence and then yields the - remaining elements of the sequence. - - The number of items to skip. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - Thrown when count exceeds the number of elements - in the sequence. - - - Returns a sequence that yields one item only. - - The input item. - - The result sequence of one item. - - - Like fold, but computes on-demand and returns the sequence of intermediary and final results. - - A function that updates the state with each element from the sequence. - The initial state. - The input sequence. - - The resulting sequence of computed states. - - Thrown when the input sequence is null. - - - Applies a function to each element of the sequence, threading an accumulator argument - through the computation. Begin by applying the function to the first two elements. - Then feed this result into the function along with the third element and so on. - Return the final result. - - A function that takes in the current accumulated result and the next - element of the sequence to produce the next accumulated result. - The input sequence. - - The final result of the reduction function. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - - - Builds a new sequence object that delegates to the given sequence object. This ensures - the original sequence cannot be rediscovered and mutated by a type cast. For example, - if given an array the returned sequence will return the elements of the array, but - you cannot cast the returned sequence object to an array. - - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Applies the given function to successive elements, returning the first - x where the function returns "Some(x)". - - A function to transform each item of the input sequence into an option of the output type. - The input sequence. - - The selected element. - - Thrown when the input sequence is null. - Thrown when every item of the sequence - evaluates to None when the given function is applied. - - - Returns a sequence of each element in the input sequence and its predecessor, with the - exception of the first element which is only returned as the predecessor of the second element. - - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Views the given list as a sequence. - - The input list. - - The result sequence. - - - Views the given array as a sequence. - - The input array. - - The result sequence. - - Thrown when the input sequence is null. - - - Computes the nth element in the collection. - - The index of element to retrieve. - The input sequence. - - The nth element of the sequence. - - Thrown when the input sequence is null. - - - Returns the lowest of all elements of the sequence, compared via Operators.min on the function result. - - A function to transform items from the input sequence into comparable keys. - The input sequence. - - The smallest element of the sequence. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - - - Returns the lowest of all elements of the sequence, compared via Operators.min. - - The input sequence. - - The smallest element of the sequence. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - - - Returns the greatest of all elements of the sequence, compared via Operators.max on the function result. - - A function to transform items from the input sequence into comparable keys. - The input sequence. - - The largest element of the sequence. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - - - Returns the greatest of all elements of the sequence, compared via Operators.max - - The input sequence. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - - The largest element of the sequence. - - - Builds a new collection whose elements are the results of applying the given function - to each of the elements of the collection. The integer index passed to the - function indicates the index (from 0) of element being transformed. - - A function to transform items from the input sequence that also supplies the current index. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Builds a new collection whose elements are the results of applying the given function - to the corresponding pairs of elements from the two sequences. If one input sequence is shorter than - the other then the remaining elements of the longer sequence are ignored. - - A function to transform pairs of items from the input sequences. - The first input sequence. - The second input sequence. - - The result sequence. - - Thrown when either of the input sequences is null. - - - Builds a new collection whose elements are the results of applying the given function - to each of the elements of the collection. The given function will be applied - as elements are demanded using the MoveNext method on enumerators retrieved from the - object. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - A function to transform items from the input sequence. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns the length of the sequence - - The input sequence. - - The length of the sequence. - - Thrown when the input sequence is null. - - - Applies the given function to two collections simultaneously. If one sequence is shorter than - the other then the remaining elements of the longer sequence are ignored. - - A function to apply to each pair of elements from the input sequences. - The first input sequence. - The second input sequence. - - Thrown when either of the input sequences is null. - - - Applies the given function to each element of the collection. The integer passed to the - function indicates the index of element. - - A function to apply to each element of the sequence that can also access the current index. - The input sequence. - - Thrown when the input sequence is null. - - - Applies the given function to each element of the collection. - - A function to apply to each element of the sequence. - The input sequence. - - Thrown when the input sequence is null. - - - Generates a new sequence which, when iterated, will return successive - elements by calling the given function. The results of calling the function - will not be saved, that is the function will be reapplied as necessary to - regenerate the elements. The function is passed the index of the item being - generated. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - Iteration can continue up to Int32.MaxValue. - - A function that generates an item in the sequence from a given index. - - The result sequence. - - - Generates a new sequence which, when iterated, will return successive - elements by calling the given function, up to the given count. Each element is saved after its - initialization. The function is passed the index of the item being - generated. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - The maximum number of items to generate for the sequence. - A function that generates an item in the sequence from a given index. - - The result sequence. - - Thrown when count is negative. - - - Returns true if the sequence contains no elements, false otherwise. - - The input sequence. - - True if the sequence is empty; false otherwise. - - Thrown when the input sequence is null. - - - Returns the only element of the sequence. - - The input sequence. - - The last element of the sequence. - - Thrown when the input sequence is null. - Thrown when the input does not have precisely one element. - - - Returns the last element of the sequence. - - The input sequence. - - The last element of the sequence. - - Thrown when the input sequence is null. - Thrown when the input does not have any elements. - - - Returns the first element of the sequence. - - The input sequence. - - The first element of the sequence. - - Thrown when the input sequence is null. - Thrown when the input does not have any elements. - - - Applies a key-generating function to each element of a sequence and yields a sequence of - unique keys. Each unique key contains a sequence of all elements that match - to this key. - - This function returns a sequence that digests the whole initial sequence as soon as - that sequence is iterated. As a result this function should not be used with - large or infinite sequences. The function makes no assumption on the ordering of the original - sequence. - - A function that transforms an element of the sequence into a comparable key. - The input sequence. - - The result sequence. - - - Tests the all pairs of elements drawn from the two sequences satisfy the - given predicate. If one sequence is shorter than - the other then the remaining elements of the longer sequence are ignored. - - A function to test pairs of elements from the input sequences. - The first input sequence. - The second input sequence. - - True if all pairs satisfy the predicate; false otherwise. - - Thrown when either of the input sequences is null. - - - Tests if all elements of the sequence satisfy the given predicate. - - The predicate is applied to the elements of the input sequence. If any application - returns false then the overall result is false and no further elements are tested. - Otherwise, true is returned. - - A function to test an element of the input sequence. - The input sequence. - - True if every element of the sequence satisfies the predicate; false otherwise. - - Thrown when the input sequence is null. - - - Applies 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 - - A function that updates the state with each element from the sequence. - The initial state. - The input sequence. - - The state object after the folding function is applied to each element of the sequence. - - Thrown when the input sequence is null. - - - Returns the index of the first element for which the given function returns true. - - A function to test whether the index of a particular element should be returned. - The input sequence. - - The index of the first element for which the predicate returns true. - - Thrown if no element returns true when - evaluated by the predicate - Thrown when the input sequence is null - - - Returns the first element for which the given function returns true. - - A function to test whether an item in the sequence should be returned. - The input sequence. - - The first element for which the predicate returns true. - - Thrown if no element returns true when - evaluated by the predicate - Thrown when the input sequence is null - - - Returns a new collection containing only the elements of the collection - for which the given predicate returns "true". - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - Remember sequence is lazy, effects are delayed until it is enumerated. - - A synonym for Seq.filter. - - A function to test whether each item in the input sequence should be included in the output. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns a new collection containing only the elements of the collection - for which the given predicate returns "true". This is a synonym for Seq.where. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - Remember sequence is lazy, effects are delayed until it is enumerated. - - A function to test whether each item in the input sequence should be included in the output. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Tests if any pair of corresponding elements of the input sequences satisfies the given predicate. - - The predicate is applied to matching elements in the two sequences 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, false is returned. If one sequence is shorter than - the other then the remaining elements of the longer sequence are ignored. - - A function to test each pair of items from the input sequences. - The first input sequence. - The second input sequence. - - True if any result from the predicate is true; false otherwise. - - Thrown when either of the two input sequences is null. - - - Tests if any element of the sequence satisfies the given predicate. - - The predicate is applied to the elements of the input sequence. If any application - returns true then the overall result is true and no further elements are tested. - Otherwise, false is returned. - - A function to test each item of the input sequence. - The input sequence. - - True if any result from the predicate is true; false otherwise. - - Thrown when the input sequence is null. - - - Creates an empty sequence. - - An empty sequence. - - - Returns a sequence that contains no duplicate entries according to the - generic hash and equality comparisons on the keys returned by the given key-generating function. - If an element occurs multiple times in the sequence then the later occurrences are discarded. - - A function transforming the sequence items into comparable keys. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns a sequence that contains no duplicate entries according to generic hash and - equality comparisons on the entries. - If an element occurs multiple times in the sequence then the later occurrences are discarded. - - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns a sequence that is built from the given delayed specification of a - sequence. - - The input function is evaluated each time an IEnumerator for the sequence - is requested. - - The generating function for the sequence. - - - Applies a key-generating function to each element of a sequence and return a sequence yielding unique - keys and their number of occurrences in the original sequence. - - Note that this function returns a sequence that digests the whole initial sequence as soon as - that sequence is iterated. As a result this function should not be used with - large or infinite sequences. The function makes no assumption on the ordering of the original - sequence. - - A function transforming each item of input sequence into a key to be - compared against the others. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Combines the given enumeration-of-enumerations as a single concatenated - enumeration. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - The input enumeration-of-enumerations. - - The result sequence. - - Thrown when the input sequence is null. - - - Compares two sequences using the given comparison function, element by element. - Returns the first non-zero result from the comparison function. If the end of a sequence - is reached it returns a -1 if the first sequence is shorter and a 1 if the second sequence - is shorter. - - A function that takes an element from each sequence and returns an int. - If it evaluates to a non-zero value iteration is stopped and that value is returned. - The first input sequence. - The second input sequence. - - The first non-zero value from the comparison function. - - Thrown when either of the input sequences - is null. - - - Applies the given function to each element of the sequence and concatenates all the - results. - - Remember sequence is lazy, effects are delayed until it is enumerated. - - A function to transform elements of the input sequence into the sequences - that will then be concatenated. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Applies the given function to each element of the list. Return - the list comprised of the results "x" for each element where - the function returns Some(x). - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not - be accessed concurrently. - - A function to transform items of type T into options of type U. - The input sequence of type T. - - The result sequence. - - Thrown when the input sequence is null. - - - Wraps a loosely-typed System.Collections sequence as a typed sequence. - - The use of this function usually requires a type annotation. - An incorrect type annotation may result in runtime type - errors. - Individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns a sequence that corresponds to a cached version of the input sequence. - This result sequence will have the same elements as the input sequence. The result - can be enumerated multiple times. The input sequence will be enumerated at most - once and only as far as is necessary. Caching a sequence is typically useful when repeatedly - evaluating items in the original sequence is computationally expensive or if - iterating the sequence causes side-effects that the user does not want to be - repeated multiple times. - - Enumeration of the result sequence is thread safe in the sense that multiple independent IEnumerator - values may be used simultaneously from different threads (accesses to - the internal lookaside table are thread safe). Each individual IEnumerator - is not typically thread safe and should not be accessed concurrently. - - Once enumeration of the input sequence has started, - it's enumerator will be kept live by this object until the enumeration has completed. - At that point, the enumerator will be disposed. - - The enumerator may be disposed and underlying cache storage released by - converting the returned sequence object to type IDisposable, and calling the Dispose method - on this object. The sequence object may then be re-enumerated and a fresh enumerator will - be used. - - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns the average of the results generated by applying the function to each element - of the sequence. - - The elements are averaged using the + operator, DivideByInt method and Zero property - associated with the generated type. - - A function applied to transform each element of the sequence. - The input sequence. - - The average. - - Thrown when the input sequence is null. - Thrown when the input sequence has zero elements. - - - Returns the average of the elements in the sequence. - - The elements are averaged using the + operator, DivideByInt method and Zero property - associated with the element type. - - The input sequence. - - The average. - - Thrown when the input sequence is null. - Thrown when the input sequence has zero elements. - - - Wraps the two given enumerations as a single concatenated - enumeration. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed - concurrently. - - The first sequence. - The second sequence. - - The result sequence. - - Thrown when either of the two provided sequences is - null. - - - Basic operations on IEnumerables. - - - Returns a new set with the elements of the second set removed from the first. - The first input set. - The set whose elements will be removed from set1. - The set with the elements of set2 removed from set1. - - - Builds a new collection from the given enumerable object. - The input sequence. - The set containing elements. - - - Returns an ordered view of the collection as an enumerable object. - The input set. - An ordered sequence of the elements of set. - - - Builds an array that contains the elements of the set in order. - The input set. - An ordered array of the elements of set. - - - Builds a set that contains the same elements as the given array. - The input array. - A set containing the elements of array. - - - Builds a list that contains the elements of the set in order. - The input set. - An ordered list of the elements of set. - - - Builds a set that contains the same elements as the given list. - The input list. - A set containing the elements form the input list. - - - Returns the highest element in the set according to the ordering being used for the set. - The input set. - The max value from the set. - - - Returns the lowest element in the set according to the ordering being used for the set. - The input set. - The min value from the set. - - - Returns a new set with the given element removed. No exception is raised if - the set doesn't contain the given element. - The element to remove. - The input set. - The input set with value removed. - - - Splits the set into two sets containing the elements for which the given predicate - returns true and false respectively. - The function to test set elements. - The input set. - A pair of sets with the first containing the elements for which predicate returns - true and the second containing the elements for which predicate returns false. - - - Applies the given function to each element of the set, in order according - to the comparison function. - The function to apply to each element. - The input set. - - - Returns "true" if the set is empty. - The input set. - True if set is empty. - - - Computes the union of a sequence of sets. - The sequence of sets to untion. - The union of the input sets. - - - Computes the union of the two sets. - The first input set. - The second input set. - The union of set1 and set2. - - - Computes the intersection of a sequence of sets. The sequence must be non-empty. - The sequence of sets to intersect. - The intersection of the input sets. - - - Computes the intersection of the two sets. - The first input set. - The second input set. - The intersection of set1 and set2. - - - Tests if all elements of the collection satisfy the given predicate. - If the input function is f and the elements are i0...iN and "j0...jN" - then computes p i0 && ... && p iN. - The function to test set elements. - The input set. - True if all elements of set satisfy predicate. - - - Applies the given accumulating function to all the elements of the set. - The accumulating function. - The input set. - The initial state. - The final state. - - - Applies the given accumulating function to all the elements of the set - The accumulating function. - The initial state. - The input set. - The final state. - - - Returns a new collection containing the results of applying the - given function to each element of the input set. - The function to transform elements of the input set. - The input set. - A set containing the transformed elements. - - - Returns a new collection containing only the elements of the collection - for which the given predicate returns true. - The function to test set elements. - The input set. - The set containing only the elements for which predicate returns true. - - - Tests if any element of the collection satisfies the given predicate. - If the input function is predicate and the elements are i0...iN - then computes p i0 or ... or p iN. - The function to test set elements. - The input set. - True if any element of set satisfies predicate. - - - Returns the number of elements in the set. Same as size. - The input set. - The number of elements in the set. - - - Evaluates to "true" if all elements of the second set are in the first, and at least - one element of the first is not in the second. - The potential superset. - The set to test against. - True if set1 is a proper superset of set2. - - - Evaluates to "true" if all elements of the second set are in the first. - The potential superset. - The set to test against. - True if set1 is a superset of set2. - - - Evaluates to "true" if all elements of the first set are in the second, and at least - one element of the second is not in the first. - The potential subset. - The set to test against. - True if set1 is a proper subset of set2. - - - Evaluates to "true" if all elements of the first set are in the second - The potential subset. - The set to test against. - True if set1 is a subset of set2. - - - Evaluates to "true" if the given element is in the given set. - The element to test. - The input set. - True if element is in set. - - - Returns a new set with an element added to the set. No exception is raised if - the set already contains the given element. - The value to add. - The input set. - A new set containing value. - - - The set containing the given element. - The value for the set to contain. - The set containing value. - - - The empty set for the type 'T. - - - Functional programming operators related to the Set<_> type. - - - Gets the default cancellation token for executing asynchronous computations. - The default CancellationToken. - - - Creates an asynchronous computation that returns the CancellationToken governing the execution - of the computation. - In async { let! token = Async.CancellationToken ...} token can be used to initiate other - asynchronous operations that will cancel cooperatively with this workflow. - An asynchronous computation capable of retrieving the CancellationToken from a computation - expression. - - - Creates an asynchronous computation that executes computation. - If this computation is cancelled before it completes then the computation generated by - running compensation is executed. - The input asynchronous computation. - The function to be run if the computation is cancelled. - An asynchronous computation that runs the compensation if the input computation - is cancelled. - - - Creates an asynchronous computation that queues a work item that runs - its continuation. - A computation that generates a new work item in the thread pool. - - - Creates an asynchronous computation that creates a new thread and runs - its continuation in that thread. - A computation that will execute on a new thread. - - - Creates an asynchronous computation that runs - its continuation using syncContext.Post. If syncContext is null - then the asynchronous computation is equivalent to SwitchToThreadPool(). - The synchronization context to accept the posted computation. - An asynchronous computation that uses the syncContext context to execute. - - - Runs an asynchronous computation, starting immediately on the current operating system - thread. Call one of the three continuations when the operation completes. - If no cancellation token is provided then the default cancellation token - is used. - The asynchronous computation to execute. - The function called on success. - The function called on exception. - The function called on cancellation. - The CancellationToken to associate with the computation. - The default is used if this parameter is not provided. - - - Runs an asynchronous computation, starting immediately on the current operating system - thread. - If no cancellation token is provided then the default cancellation token is used. - The asynchronous computation to execute. - The CancellationToken to associate with the computation. - The default is used if this parameter is not provided. - - - Creates an asynchronous computation which starts the given computation as a System.Threading.Tasks.Task - - - Starts a child computation within an asynchronous workflow. - This allows multiple asynchronous computations to be executed simultaneously. - - This method should normally be used as the immediate - right-hand-side of a let! binding in an F# asynchronous workflow, that is, - - async { ... - let! completor1 = childComputation1 |> Async.StartChild - let! completor2 = childComputation2 |> Async.StartChild - ... - let! result1 = completor1 - let! result2 = completor2 - ... } - - When used in this way, each use of StartChild starts an instance of childComputation - and returns a completor object representing a computation to wait for the completion of the operation. - When executed, the completor awaits the completion of childComputation. - The child computation. - The timeout value in milliseconds. If one is not provided - then the default value of -1 corresponding to System.Threading.Timeout.Infinite. - A new computation that waits for the input computation to finish. - - - Executes a computation in the thread pool. - If no cancellation token is provided then the default cancellation token is used. - A System.Threading.Tasks.Task that will be completed - in the corresponding state once the computation terminates (produces the result, throws exception or gets canceled) - - - - Starts the asynchronous computation in the thread pool. Do not await its result. - - If no cancellation token is provided then the default cancellation token is used. - The computation to run asynchronously. - The cancellation token to be associated with the computation. - If one is not supplied, the default cancellation token is used. - - - Creates an asynchronous computation that will sleep for the given time. This is scheduled - using a System.Threading.Timer object. The operation will not block operating system threads - for the duration of the wait. - The number of milliseconds to sleep. - An asynchronous computation that will sleep for the given time. - Thrown when the due time is negative - and not infinite. - - - Runs the asynchronous computation and await its result. - - If an exception occurs in the asynchronous computation then an exception is re-raised by this - function. - - If no cancellation token is provided then the default cancellation token is used. - - The timeout parameter is given in milliseconds. A value of -1 is equivalent to - System.Threading.Timeout.Infinite. - The computation to run. - The amount of time in milliseconds to wait for the result of the - computation before raising a System.TimeoutException. If no value is provided - for timeout then a default of -1 is used to correspond to System.Threading.Timeout.Infinite. - The cancellation token to be associated with the computation. - If one is not supplied, the default cancellation token is used. - The result of the computation. - - - Creates an asynchronous computation that executes all the given asynchronous computations, - initially queueing each as work items and using a fork/join pattern. - - If all child computations succeed, an array of results is passed to the success continuation. - - If any child computation raises an exception, then the overall computation will trigger an - exception, and cancel the others. - - The overall computation will respond to cancellation while executing the child computations. - If cancelled, the computation will cancel any remaining child computations but will still wait - for the other child computations to complete. - A sequence of distinct computations to be parallelized. - A computation that returns an array of values from the sequence of input computations. - - - Generates a scoped, cooperative cancellation handler for use within an asynchronous workflow. - - For example, - async { use! holder = Async.OnCancel interruption ... } - generates an asynchronous computation where, if a cancellation happens any time during - the execution of the asynchronous computation in the scope of holder, then action - interruption is executed on the thread that is performing the cancellation. This can - be used to arrange for a computation to be asynchronously notified that a cancellation - has occurred, e.g. by setting a flag, or deregistering a pending I/O action. - The function that is executed on the thread performing the - cancellation. - An asynchronous computation that triggers the interruption if it is cancelled - before being disposed. - - - Creates an asynchronous computation that runs the given computation and ignores - its result. - The input computation. - A computation that is equivalent to the input computation, but disregards the result. - - - Creates an asynchronous computation that captures the current - success, exception and cancellation continuations. The callback must - eventually call exactly one of the given continuations. - The function that accepts the current success, exception, and cancellation - continuations. - An asynchronous computation that provides the callback with the current continuations. - - - Creates an asynchronous computation in terms of a Begin/End pair of actions in - the style used in CLI APIs. This overlaod should be used if the operation is - qualified by three arguments. For example, - Async.FromBeginEnd(arg1,arg2,arg3,ws.BeginGetWeather,ws.EndGetWeather) - When the computation is run, beginFunc is executed, with - a callback which represents the continuation of the computation. - When the callback is invoked, the overall result is fetched using endFunc. - - The computation will respond to cancellation while waiting for the completion - of the operation. If a cancellation occurs, and cancelAction is specified, then it is - executed, and the computation continues to wait for the completion of the operation. - - If cancelAction is not specified, then cancellation causes the computation - to stop immediately, and subsequent invocations of the callback are ignored. - The first argument for the operation. - The second argument for the operation. - The third argument for the operation. - The function initiating a traditional CLI asynchronous operation. - The function completing a traditional CLI asynchronous operation. - An optional function to be executed when a cancellation is requested. - An asynchronous computation wrapping the given Begin/End functions. - - - Creates an asynchronous computation in terms of a Begin/End pair of actions in - the style used in CLI APIs. This overlaod should be used if the operation is - qualified by two arguments. For example, - Async.FromBeginEnd(arg1,arg2,ws.BeginGetWeather,ws.EndGetWeather) - When the computation is run, beginFunc is executed, with - a callback which represents the continuation of the computation. - When the callback is invoked, the overall result is fetched using endFunc. - - The computation will respond to cancellation while waiting for the completion - of the operation. If a cancellation occurs, and cancelAction is specified, then it is - executed, and the computation continues to wait for the completion of the operation. - - If cancelAction is not specified, then cancellation causes the computation - to stop immediately, and subsequent invocations of the callback are ignored. - The first argument for the operation. - The second argument for the operation. - The function initiating a traditional CLI asynchronous operation. - The function completing a traditional CLI asynchronous operation. - An optional function to be executed when a cancellation is requested. - An asynchronous computation wrapping the given Begin/End functions. - - - Creates an asynchronous computation in terms of a Begin/End pair of actions in - the style used in CLI APIs. This overlaod should be used if the operation is - qualified by one argument. For example, - Async.FromBeginEnd(place,ws.BeginGetWeather,ws.EndGetWeather) - When the computation is run, beginFunc is executed, with - a callback which represents the continuation of the computation. - When the callback is invoked, the overall result is fetched using endFunc. - - The computation will respond to cancellation while waiting for the completion - of the operation. If a cancellation occurs, and cancelAction is specified, then it is - executed, and the computation continues to wait for the completion of the operation. - - If cancelAction is not specified, then cancellation causes the computation - to stop immediately, and subsequent invocations of the callback are ignored. - The argument for the operation. - The function initiating a traditional CLI asynchronous operation. - The function completing a traditional CLI asynchronous operation. - An optional function to be executed when a cancellation is requested. - An asynchronous computation wrapping the given Begin/End functions. - - - Creates an asynchronous computation in terms of a Begin/End pair of actions in - the style used in CLI APIs. For example, - Async.FromBeginEnd(ws.BeginGetWeather,ws.EndGetWeather) - When the computation is run, beginFunc is executed, with - a callback which represents the continuation of the computation. - When the callback is invoked, the overall result is fetched using endFunc. - - The computation will respond to cancellation while waiting for the completion - of the operation. If a cancellation occurs, and cancelAction is specified, then it is - executed, and the computation continues to wait for the completion of the operation. - - If cancelAction is not specified, then cancellation causes the computation - to stop immediately, and subsequent invocations of the callback are ignored. - The function initiating a traditional CLI asynchronous operation. - The function completing a traditional CLI asynchronous operation. - An optional function to be executed when a cancellation is requested. - An asynchronous computation wrapping the given Begin/End functions. - - - Creates an asynchronous computation that executes computation. - If this computation completes successfully then return Choice1Of2 with the returned - value. If this computation raises an exception before it completes then return Choice2Of2 - with the raised exception. - The input computation that returns the type T. - A computation that returns a choice of type T or exception. - - - Raises the cancellation condition for the most recent set of asynchronous computations started - without any specific CancellationToken. Replaces the global CancellationTokenSource with a new - global token source for any asynchronous computations created after this point without any - specific CancellationToken. - - - Creates an asynchronous computation that will wait on the given WaitHandle. - - The computation returns true if the handle indicated a result within the given timeout. - The WaitHandle that can be signalled. - The timeout value in milliseconds. If one is not provided - then the default value of -1 corresponding to System.Threading.Timeout.Infinite. - An asynchronous computation that waits on the given WaitHandle. - - - - Return an asynchronous computation that will wait for the given task to complete and return - its result. - - - - Creates an asynchronous computation that will wait on the IAsyncResult. - - The computation returns true if the handle indicated a result within the given timeout. - The IAsyncResult to wait on. - The timeout value in milliseconds. If one is not provided - then the default value of -1 corresponding to System.Threading.Timeout.Infinite. - An asynchronous computation that waits on the given IAsyncResult. - - - Creates an asynchronous computation that waits for a single invocation of a CLI - event by adding a handler to the event. Once the computation completes or is - cancelled, the handler is removed from the event. - - The computation will respond to cancellation while waiting for the event. If a - cancellation occurs, and cancelAction is specified, then it is executed, and - the computation continues to wait for the event. - - If cancelAction is not specified, then cancellation causes the computation - to cancel immediately. - The event to handle once. - An optional function to execute instead of cancelling when a - cancellation is issued. - An asynchronous computation that waits for the event to be invoked. - - - Creates three functions that can be used to implement the .NET Asynchronous - Programming Model (APM) for a given asynchronous computation. - - The functions should normally be published as members with prefix Begin, - End and Cancel, and can be used within a type definition as follows: - - let beginAction,endAction,cancelAction = Async.AsBeginEnd (fun arg -> computation) - member x.BeginSomeOperation(arg,callback,state:obj) = beginAction(arg,callback,state) - member x.EndSomeOperation(iar) = endAction(iar) - member x.CancelSomeOperation(iar) = cancelAction(iar) - - - If the asynchronous computation takes no arguments, then AsBeginEnd is used as follows: - - let beginAction,endAction,cancelAction = Async.AsBeginEnd (fun () -> computation) - member x.BeginSomeOperation(callback,state:obj) = beginAction((),callback,state) - member x.EndSomeOperation(iar) = endAction(iar) - member x.CancelSomeOperation(iar) = cancelAction(iar) - - - - If the asynchronous computation takes two arguments, then AsBeginEnd is used as follows: - - let beginAction,endAction,cancelAction = Async.AsBeginEnd (fun arg1 arg2 -> computation) - member x.BeginSomeOperation(arg1,arg2,callback,state:obj) = beginAction((),callback,state) - member x.EndSomeOperation(iar) = endAction(iar) - member x.CancelSomeOperation(iar) = cancelAction(iar) - - - In each case, the resulting API will be familiar to programmers in other CLI languages and - is a useful way to publish asynchronous computations in CLI components. - A function generating the asynchronous computation to split into the traditional - .NET Asynchronous Programming Model. - A tuple of the begin, end, and cancel members. - - - This static class holds members for creating and manipulating asynchronous computations. - - - Creates an asynchronous computation that just returns (). - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of empty else branches in the - async { ... } computation expression syntax. - An asynchronous computation that returns (). - - - Creates an asynchronous computation that runs computation repeatedly - until guard() becomes false. - - A cancellation check is performed whenever the computation is executed. - - The existence of this method permits the use of while in the - async { ... } computation expression syntax. - The function to determine when to stop executing computation. - The function to be executed. Equivalent to the body - of a while expression. - An asynchronous computation that behaves similarly to a while loop when run. - - - Creates an asynchronous computation that runs binder(resource). - The action resource.Dispose() is executed as this computation yields its result - or if the asynchronous computation exits by an exception or by cancellation. - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of use and use! in the - async { ... } computation expression syntax. - The resource to be used and disposed. - The function that takes the resource and returns an asynchronous - computation. - An asynchronous computation that binds and eventually disposes resource. - - - Creates an asynchronous computation that runs computation and returns its result. - If an exception happens then catchHandler(exn) is called and the resulting computation executed instead. - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of try/with in the - async { ... } computation expression syntax. - The input computation. - The function to run when computation throws an exception. - An asynchronous computation that executes computation and calls catchHandler if an - exception is thrown. - - - Creates an asynchronous computation that runs computation. The action compensation is executed - after computation completes, whether computation exits normally or by an exception. If compensation raises an exception itself - the original exception is discarded and the new exception becomes the overall result of the computation. - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of try/finally in the - async { ... } computation expression syntax. - The input computation. - The action to be run after computation completes or raises an - exception (including cancellation). - An asynchronous computation that executes computation and compensation aftewards or - when an exception is raised. - - - Delegates to the input computation. - - The existence of this method permits the use of return! in the - async { ... } computation expression syntax. - The input computation. - The input computation. - - - Creates an asynchronous computation that returns the result v. - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of return in the - async { ... } computation expression syntax. - The value to return from the computation. - An asynchronous computation that returns value when executed. - - - Creates an asynchronous computation that enumerates the sequence seq - on demand and runs body for each element. - - A cancellation check is performed on each iteration of the loop. - - The existence of this method permits the use of for in the - async { ... } computation expression syntax. - The sequence to enumerate. - A function to take an item from the sequence and create - an asynchronous computation. Can be seen as the body of the for expression. - An asynchronous computation that will enumerate the sequence and run body - for each element. - - - Creates an asynchronous computation that runs generator. - - A cancellation check is performed when the computation is executed. - The function to run. - An asynchronous computation that runs generator. - - - Creates an asynchronous computation that first runs computation1 - and then runs computation2, returning the result of computation2. - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of expression sequencing in the - async { ... } computation expression syntax. - The first part of the sequenced computation. - The second part of the sequenced computation. - An asynchronous computation that runs both of the computations sequentially. - - - Creates an asynchronous computation that runs computation, and when - computation generates a result T, runs binder res. - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of let! in the - async { ... } computation expression syntax. - The computation to provide an unbound result. - The function to bind the result of computation. - An asynchronous computation that performs a monadic bind on the result - of computation. - - - - Generate an object used to build asynchronous computations using F# computation expressions. The value - 'async' is a pre-defined instance of this type. - - A cancellation check is performed when the computation is executed. - - - - The type of the async operator, used to build workflows for asynchronous computations. - - - Sends a reply to a PostAndReply message. - The value to send. - - - A handle to a capability to reply to a PostAndReply message. - - - A compositional asynchronous computation, which, when run, will eventually produce a value - of type T, or else raises an exception. - - Asynchronous computations are normally specified using an F# computation expression. - - When run, asynchronous computations have two modes: as a work item (executing synchronous - code), or as a wait item (waiting for an event or I/O completion). - - When run, asynchronous computations can be governed by CancellationToken. This can usually - be specified when the async computation is started. The associated CancellationTokenSource - may be used to cancel the asynchronous computation. Asynchronous computations built using - computation expressions can check the cancellation condition regularly. Synchronous - computations within an asynchronous computation do not automatically check this condition. - - - Publishes the event as a first class event value. - - - Triggers the event using the given parameters. - The parameters for the event. - - - Creates an event object suitable for implementing an arbitrary type of delegate. - The event object. - - - Event implementations for an arbitrary type of delegate. - - - Publishes an observation as a first class value. - - - Triggers an observation using the given parameters. - The event parameters. - - - Creates an observable object. - The created event. - - - Event implementations for the IEvent<_> type. - - - Publishes the event as a first class event value. - - - Triggers the event using the given sender object and parameters. The sender object may be null. - The object triggering the event. - The parameters for the event. - - - Creates an event object suitable for delegate types following the standard .NET Framework convention of a first 'sender' argument. - The created event. - - - Event implementations for a delegate types following the standard .NET Framework convention of a first 'sender' argument. - - - - - - A delegate type associated with the F# event type IEvent<_> - The object that fired the event. - The event arguments. - - - Remove a listener delegate from an event listener store. - The delegate to be removed from the event listener store. - - - Connect a handler delegate object to the event. A handler can - be later removed using RemoveHandler. The listener will - be invoked when the event is fired. - A delegate to be invoked when the event is fired. - - - First class event values for arbitrary delegate types. - - F# gives special status to member properties compatible with type IDelegateEvent and - tagged with the CLIEventAttribute. In this case the F# compiler generates approriate - CLI metadata to make the member appear to other CLI languages as a CLI event. - - - First-class listening points (i.e. objects that permit you to register a callback - activated when the event is triggered). - - - First class event values for CLI events conforming to CLI Framework standards. - - - The type of delayed computations. - - Use the values in the Lazy module to manipulate - values of this type, and the notation lazy expr to create values - of type . - - - Raises a timeout exception if a message not received in this amount of time. By default - no timeout is used. - - - Occurs when the execution of the agent results in an exception. - - - Occurs when the execution of the agent results in an exception. - - - Raises a timeout exception if a message not received in this amount of time. By default - no timeout is used. - - - Returns the number of unprocessed messages in the message queue of the agent. - - - Occurs when the execution of the agent results in an exception. - - - Scans for a message by looking through messages in arrival order until scanner - returns a Some value. Other messages remain in the queue. - - This method is for use within the body of the agent. For each agent, at most - one concurrent reader may be active, so no more than one concurrent call to - Receive, TryReceive, Scan and/or TryScan may be active. - The function to return None if the message is to be skipped - or Some if the message is to be processed and removed from the queue. - An optional timeout in milliseconds. Defaults to -1 which corresponds - to System.Threading.Timeout.Infinite. - An asynchronous computation that scanner built off the read message. - - - Waits for a message. This will consume the first message in arrival order. - - This method is for use within the body of the agent. - - Returns None if a timeout is given and the timeout is exceeded. - - This method is for use within the body of the agent. For each agent, at most - one concurrent reader may be active, so no more than one concurrent call to - Receive, TryReceive, Scan and/or TryScan may be active. - An optional timeout in milliseconds. Defaults to -1 which - corresponds to System.Threading.Timeout.Infinite. - An asynchronous computation that returns the received message or - None if the timeout is exceeded. - - - Like PostAndReply, but returns None if no reply within the timeout period. - The function to incorporate the AsyncReplyChannel into - the message to be sent. - An optional timeout parameter (in milliseconds) to wait for a reply message. - Defaults to -1 which corresponds to System.Threading.Timeout.Infinite. - The reply from the agent or None if the timeout expires. - - - Starts the agent. - - - Creates and starts an agent. The body function is used to generate the asynchronous - computation executed by the agent. - The function to produce an asynchronous computation that will be executed - as the read loop for the MailboxProcessor when Start is called. - An optional cancellation token for the body. - Defaults to Async.DefaultCancellationToken. - The created MailboxProcessor. - - - Scans for a message by looking through messages in arrival order until scanner - returns a Some value. Other messages remain in the queue. - - Returns None if a timeout is given and the timeout is exceeded. - - This method is for use within the body of the agent. For each agent, at most - one concurrent reader may be active, so no more than one concurrent call to - Receive, TryReceive, Scan and/or TryScan may be active. - The function to return None if the message is to be skipped - or Some if the message is to be processed and removed from the queue. - An optional timeout in milliseconds. Defaults to -1 which corresponds - to System.Threading.Timeout.Infinite. - An asynchronous computation that scanner built off the read message. - Thrown when the timeout is exceeded. - - - Waits for a message. This will consume the first message in arrival order. - - This method is for use within the body of the agent. - - This method is for use within the body of the agent. For each agent, at most - one concurrent reader may be active, so no more than one concurrent call to - Receive, TryReceive, Scan and/or TryScan may be active. - An optional timeout in milliseconds. Defaults to -1 which corresponds - to System.Threading.Timeout.Infinite. - An asynchronous computation that returns the received message. - Thrown when the timeout is exceeded. - - - Like AsyncPostAndReply, but returns None if no reply within the timeout period. - The function to incorporate the AsyncReplyChannel into - the message to be sent. - An optional timeout parameter (in milliseconds) to wait for a reply message. - Defaults to -1 which corresponds to System.Threading.Timeout.Infinite. - An asynchronous computation that will return the reply or None if the timeout expires. - - - Posts a message to an agent and await a reply on the channel, synchronously. - - The message is generated by applying buildMessage to a new reply channel - to be incorporated into the message. The receiving agent must process this - message and invoke the Reply method on this reply channel precisely once. - The function to incorporate the AsyncReplyChannel into - the message to be sent. - An optional timeout parameter (in milliseconds) to wait for a reply message. - Defaults to -1 which corresponds to System.Threading.Timeout.Infinite. - The reply from the agent. - - - Posts a message to an agent and await a reply on the channel, asynchronously. - - The message is generated by applying buildMessage to a new reply channel - to be incorporated into the message. The receiving agent must process this - message and invoke the Reply method on this reply channel precisely once. - The function to incorporate the AsyncReplyChannel into - the message to be sent. - An optional timeout parameter (in milliseconds) to wait for a reply message. - Defaults to -1 which corresponds to System.Threading.Timeout.Infinite. - An asychronous computation that will wait for the reply from the agent. - - - Posts a message to the message queue of the MailboxProcessor, asynchronously. - The message to post. - - - Creates an agent. The body function is used to generate the asynchronous - computation executed by the agent. This function is not executed until - Start is called. - The function to produce an asynchronous computation that will be executed - as the read loop for the MailboxProcessor when Start is called. - An optional cancellation token for the body. - Defaults to Async.DefaultCancellationToken. - The created MailboxProcessor. - - - A message-processing agent which executes an asynchronous computation. - - The agent encapsulates a message queue that supports multiple-writers and - a single reader agent. Writers send messages to the agent by using the Post - method and its variations. - - The agent may wait for messages using the Receive or TryReceive methods or - scan through all available messages using the Scan or TryScan method. - - - - - - Connects a listener function to the observable. The listener will - be invoked for each observation. The listener can be removed by - calling Dispose on the returned IDisposable object. - The function to be called for each observation. - An object that will remove the listener if disposed. - - - Permanently connects a listener function to the observable. The listener will - be invoked for each observation. - The function to be called for each observation. - - - Returns an asynchronous computation that will write the given bytes to the stream. - The buffer to write from. - An optional offset as a number of bytes in the stream. - An optional number of bytes to write to the stream. - An asynchronous computation that will write the given bytes to the stream. - Thrown when the sum of offset and count is longer than - the buffer length. - Thrown when offset or count is negative. - - - Returns an asynchronous computation that will read the given number of bytes from the stream. - The number of bytes to read. - An asynchronous computation that returns the read byte[] when run. - - - Returns an asynchronous computation that will read from the stream into the given buffer. - The buffer to read into. - An optional offset as a number of bytes in the stream. - An optional number of bytes to read from the stream. - An asynchronous computation that will read from the stream into the given buffer. - Thrown when the sum of offset and count is longer than - the buffer length. - Thrown when offset or count is negative. - - - A module of extension members providing asynchronous operations for some basic CLI types related to concurrency and I/O. - - - Returns a new event that triggers on the second and subsequent triggerings of the input event. - The Nth triggering of the input event passes the arguments from the N-1th and Nth triggering as - a pair. The argument passed to the N-1th triggering is held in hidden internal state until the - Nth triggering occurs. - The input event. - An event that triggers on pairs of consecutive values passed from the source event. - - - Runs the given function each time the given event is triggered. - The function to call when the event is triggered. - The input event. - - - Returns a new event consisting of the results of applying the given accumulating function - to successive values triggered on the input event. An item of internal state - records the current value of the state parameter. The internal state is not locked during the - execution of the accumulation function, so care should be taken that the - input IEvent not triggered by multiple threads simultaneously. - The function to update the state with each event value. - The initial state. - The input event. - An event that fires on the updated state values. - - - Returns a new event which fires on a selection of messages from the original event. - The selection function takes an original message to an optional new message. - The function to select and transform event values to pass on. - The input event. - An event that fires only when the chooser returns Some. - - - Returns a new event that listens to the original event and triggers the - first resulting event if the application of the function to the event arguments - returned a Choice1Of2, and the second event if it returns a Choice2Of2. - The function to transform event values into one of two types. - The input event. - A tuple of events. The first fires whenever splitter evaluates to Choice1of1 and - the second fires whenever splitter evaluates to Choice2of2. - - - Returns a new event that listens to the original event and triggers the - first resulting event if the application of the predicate to the event arguments - returned true, and the second event if it returned false. - The function to determine which output event to trigger. - The input event. - A tuple of events. The first is triggered when the predicate evaluates to true - and the second when the predicate evaluates to false. - - - Returns a new event that listens to the original event and triggers the resulting - event only when the argument to the event passes the given function. - The function to determine which triggers from the event to propagate. - The input event. - An event that only passes values that pass the predicate. - - - Returns a new event that passes values transformed by the given function. - The function to transform event values. - The input event. - An event that passes the transformed values. - - - Fires the output event when either of the input events fire. - The first input event. - The second input event. - An event that fires when either of the input events fire. - - - - - - Forces the execution of this value and return its result. Same as Value. Mutual exclusion is used to - prevent other threads also computing the value. - The value of the Lazy object. - - - Creates a lazy computation that evaluates to the given value when forced. - The input value. - The created Lazy object. - - - Creates a lazy computation that evaluates to the result of the given function when forced. - The function to provide the value when needed. - The created Lazy object. - - - Extensions related to Lazy values. - - - Returns a new observable that triggers on the second and subsequent triggerings of the input observable. - The Nth triggering of the input observable passes the arguments from the N-1th and Nth triggering as - a pair. The argument passed to the N-1th triggering is held in hidden internal state until the - Nth triggering occurs. - - For each observer, the registered intermediate observing object is not thread safe. - That is, observations arising from the source must not be triggered concurrently - on different threads. - The input Observable. - An Observable that triggers on successive pairs of observations from the input Observable. - - - Creates an observer which subscribes to the given observable and which calls - the given function for each observation. - The function to be called on each observation. - The input Observable. - An object that will remove the callback if disposed. - - - Creates an observer which permanently subscribes to the given observable and which calls - the given function for each observation. - The function to be called on each observation. - The input Observable. - - - Returns an observable which, for each observer, allocates an item of state - and applies the given accumulating function to successive values arising from - the input. The returned object will trigger observations for each computed - state value, excluding the initial value. The returned object propagates - all errors arising from the source and completes when the source completes. - - For each observer, the registered intermediate observing object is not thread safe. - That is, observations arising from the source must not be triggered concurrently - on different threads. - The function to update the state with each observation. - The initial state. - The input Observable. - An Observable that triggers on the updated state values. - - - Returns an observable which chooses a projection of observations from the source - using the given function. The returned object will trigger observations x - for which the splitter returns Some x. The returned object also propagates - all errors arising from the source and completes when the source completes. - The function that returns Some for observations to be propagated - and None for observations to ignore. - The input Observable. - An Observable that only propagates some of the observations from the source. - - - Returns two observables which split the observations of the source by the - given function. The first will trigger observations x for which the - splitter returns Choice1Of2 x. The second will trigger observations - y for which the splitter returns Choice2Of2 y The splitter is - executed once for each subscribed observer. Both also propagate error - observations arising from the source and each completes when the source - completes. - The function that takes an observation an transforms - it into one of the two output Choice types. - The input Observable. - A tuple of Observables. The first triggers when splitter returns Choice1of2 - and the second triggers when splitter returns Choice2of2. - - - Returns two observables which partition the observations of the source by - the given function. The first will trigger observations for those values - for which the predicate returns true. The second will trigger observations - for those values where the predicate returns false. The predicate is - executed once for each subscribed observer. Both also propagate all error - observations arising from the source and each completes when the source - completes. - The function to determine which output Observable will trigger - a particular observation. - The input Observable. - A tuple of Observables. The first triggers when the predicate returns true, and - the second triggers when the predicate returns false. - - - Returns an observable which filters the observations of the source - by the given function. The observable will see only those observations - for which the predicate returns true. The predicate is executed once for - each subscribed observer. The returned object also propagates error - observations arising from the source and completes when the source completes. - The function to apply to observations to determine if it should - be kept. - The input Observable. - An Observable that filters observations based on filter. - - - Returns an observable which transforms the observations of the source by the - given function. The transformation function is executed once for each - subscribed observer. The returned object also propagates error observations - arising from the source and completes when the source completes. - The function applied to observations from the source. - The input Observable. - An Observable of the type specified by mapping. - - - Returns an observable for the merged observations from the sources. - The returned object propagates success and error values arising - from either source and completes when both the sources have completed. - - For each observer, the registered intermediate observing object is not - thread safe. That is, observations arising from the sources must not - be triggered concurrently on different threads. - The first Observable. - The second Observable. - An Observable that propagates information from both sources. - - - Basic operations on first class event and other observable objects. - - - Returns an asynchronous computation that, when run, will wait for the download of the given URI. - The URI to retrieve. - An asynchronous computation that will wait for the download of the URI. - - - Returns an asynchronous computation that, when run, will wait for a response to the given WebRequest. - An asynchronous computation that waits for response to the WebRequest. - - - A module of extension members providing asynchronous operations for some basic Web operations. - - - Creates an instance of the attribute - AbstractClassAttribute - - - Adding this attribute to class definition makes it abstract, which means it need not - implement all its methods. Instances of abstract classes may not be constructed directly. - - - Creates an instance of the attribute - AllowNullLiteralAttribute - - - Adding this attribute to a type lets the 'null' literal be used for the type - within F# code. This attribute may only be added to F#-defined class or - interface types. - - - Indicates the namespace or module to be automatically opened when an assembly is referenced - or an enclosing module opened. - - - Creates an attribute used to mark a namespace or module path to be 'automatically opened' when an assembly is referenced - The namespace or module to be automatically opened when an assembly is referenced - or an enclosing module opened. - AutoOpenAttribute - - - Creates an attribute used to mark a module as 'automatically opened' when the enclosing namespace is opened - AutoOpenAttribute - - - This attribute is used for two purposes. When applied to an assembly, it must be given a string - argument, and this argument must indicate a valid module or namespace in that assembly. Source - code files compiled with a reference to this assembly are processed in an environment - where the given path is automatically opened. - - When applied to a module within an assembly, then the attribute must not be given any arguments. - When the enclosing namespace is opened in user source code, the module is also implicitly opened. - - - The value of the attribute, indicating whether the type is automatically marked serializable or not - - - Creates an instance of the attribute - Indicates whether the type should be serializable by default. - AutoSerializableAttribute - - - Adding this attribute to a type with value 'false' disables the behaviour where F# makes the - type Serializable by default. - - - Creates an instance of the attribute - CLIEventAttribute - - - Adding this attribute to a property with event type causes it to be compiled with as a CLI - metadata event, through a syntactic translation to a pair of 'add_EventName' and - 'remove_EventName' methods. - - - Creates an instance of the attribute - CLIMutableAttribute - - - Adding this attribute to a record type causes it to be compiled to a CLI representation - with a default constructor with property getters and setters. - - - Choice 2 of 2 choices - - - Choice 1 of 2 choices - - - Helper types for active patterns with 2 choices. - - - Choice 3 of 3 choices - - - Choice 2 of 3 choices - - - Choice 1 of 3 choices - - - Helper types for active patterns with 3 choices. - - - Choice 4 of 4 choices - - - Choice 3 of 4 choices - - - Choice 2 of 4 choices - - - Choice 1 of 4 choices - - - Helper types for active patterns with 4 choices. - - - Choice 5 of 5 choices - - - Choice 4 of 5 choices - - - Choice 3 of 5 choices - - - Choice 2 of 5 choices - - - Choice 1 of 5 choices - - - Helper types for active patterns with 5 choices. - - - Choice 6 of 6 choices - - - Choice 5 of 6 choices - - - Choice 4 of 6 choices - - - Choice 3 of 6 choices - - - Choice 2 of 6 choices - - - Choice 1 of 6 choices - - - Helper types for active patterns with 6 choices. - - - Choice 7 of 7 choices - - - Choice 6 of 7 choices - - - Choice 5 of 7 choices - - - Choice 4 of 7 choices - - - Choice 3 of 7 choices - - - Choice 2 of 7 choices - - - Choice 1 of 7 choices - - - Helper types for active patterns with 7 choices. - - - Creates an instance of the attribute - ClassAttribute - - - Adding this attribute to a type causes it to be represented using a CLI class. - - - Creates an instance of the attribute - ComparisonConditionalOnAttribute - - - This attribute is used to indicate a generic container type satisfies the F# 'comparison' - constraint only if a generic argument also satisfies this constraint. For example, adding - this attribute to parameter 'T on a type definition C<'T> means that a type C<X> only supports - comparison if the type X also supports comparison and all other conditions for C<X> to support - comparison are also met. The type C<'T> can still be used with other type arguments, but a type such - as C<(int -> int)> will not support comparison because the type (int -> int) is an F# function type - and does not support comparison. - - This attribute will be ignored if it is used on the generic parameters of functions or methods. - - - Indicates the number of arguments in each argument group - - - Creates an instance of the attribute - Indicates the number of arguments in each argument group. - CompilationArgumentCountsAttribute - - - This attribute is generated automatically by the F# compiler to tag functions and members - that accept a partial application of some of their arguments and return a residual function - - - Indicates the variant number of the entity, if any, in a linear sequence of elements with F# source code - - - Indicates the relationship between the compiled entity and F# source code - - - Indicates the sequence number of the entity, if any, in a linear sequence of elements with F# source code - - - Creates an instance of the attribute - Indicates the type of source construct. - CompilationMappingAttribute - - - Creates an instance of the attribute - Indicates the type of source construct. - CompilationMappingAttribute - - - Creates an instance of the attribute - Indicates the type of source construct. - CompilationMappingAttribute - - - This attribute is inserted automatically by the F# compiler to tag types - and methods in the generated CLI code with flags indicating the correspondence - with original source constructs. It is used by the functions in the - Microsoft.FSharp.Reflection namespace to reverse-map compiled constructs to - their original forms. It is not intended for use from user code. - - - Indicates one or more adjustments to the compiled representation of an F# type or member - - - Creates an instance of the attribute - Indicates adjustments to the compiled representation of the type or member. - CompilationRepresentationAttribute - - - This attribute is used to adjust the runtime representation for a type. - For example, it may be used to note that the null representation - may be used for a type. This affects how some constructs are compiled. - - - Compile a property as a CLI event. - - - Permit the use of null as a representation for nullary discriminators in a discriminated union. - - - append 'Module' to the end of a module whose name clashes with a type name in the same namespace. - - - Compile a member as 'instance' even if null is used as a representation for this type. - - - Compile an instance member as 'static' . - - - No special compilation representation. - - - - - - Indicates one or more adjustments to the compiled representation of an F# type or member. - - - Indicates the name of the entity in F# source code - - - Creates an instance of the attribute - The name of the method in source. - CompilationSourceNameAttribute - - - This attribute is inserted automatically by the F# compiler to tag - methods which are given the 'CompiledName' attribute. It is not intended - for use from user code. - - - The name of the value as it appears in compiled code - - - Creates an instance of the attribute - The name to use in compiled code. - CompiledNameAttribute - - - Adding this attribute to a value or function definition in an F# module changes the name used - for the value in compiled CLI code. - - - Indicates if the construct should always be hidden in an editing environment. - - - Indicates if the message should indicate a compiler error. Error numbers less than - 10000 are considered reserved for use by the F# compiler and libraries. - - - Indicates the number associated with the message. - - - Indicates the warning message to be emitted when F# source code uses this construct - - - Indicates if the construct should always be hidden in an editing environment. - - - Indicates if the message should indicate a compiler error. Error numbers less than - 10000 are considered reserved for use by the F# compiler and libraries. - - - Creates an instance of the attribute. - - - Indicates that a message should be emitted when F# source code uses this construct. - - - Creates an instance of the attribute - CustomComparisonAttribute - - - Adding this attribute to a type indicates it is a type with a user-defined implementation of comparison. - - - Creates an instance of the attribute - CustomEqualityAttribute - - - Adding this attribute to a type indicates it is a type with a user-defined implementation of equality. - - - Indicates if the custom operation maintains the variable space of the query of computation expression through the use of a bind operation - - - Indicates if the custom operation maintains the variable space of the query of computation expression - - - Indicates the name used for the 'on' part of the custom query operator for join-like operators - - - Indicates if the custom operation is an operation similar to a zip in a sequence computation, supporting two inputs - - - Indicates if the custom operation is an operation similar to a join in a sequence computation, supporting two inputs and a correlation constraint - - - Indicates if the custom operation is an operation similar to a group join in a sequence computation, supporting two inputs and a correlation constraint, and generating a group - - - Indicates if the custom operation supports the use of 'into' immediately after the use of the operation in a query or other computation expression to consume the results of the operation - - - Get the name of the custom operation when used in a query or other computation expression - - - Indicates if the custom operation maintains the variable space of the query of computation expression through the use of a bind operation - - - Indicates if the custom operation maintains the variable space of the query of computation expression - - - Indicates the name used for the 'on' part of the custom query operator for join-like operators - - - Indicates if the custom operation is an operation similar to a zip in a sequence computation, supporting two inputs - - - Indicates if the custom operation is an operation similar to a join in a sequence computation, supporting two inputs and a correlation constraint - - - Indicates if the custom operation is an operation similar to a group join in a sequence computation, supporting two inputs and a correlation constraint, and generating a group - - - Indicates if the custom operation supports the use of 'into' immediately after the use of the operation in a query or other computation expression to consume the results of the operation - - - Creates an instance of the attribute - CustomOperationAttribute - - - - Indicates that a member on a computation builder type is a custom query operator, - and indicates the name of that operator. - - - - The value of the attribute, indicating whether the type has a default augmentation or not - - - Creates an instance of the attribute - Indicates whether to generate helper members on the CLI class representing a discriminated - union. - DefaultAugmentationAttribute - - - Adding this attribute to a discriminated union with value false - turns off the generation of standard helper member tester, constructor - and accessor members for the generated CLI class for that type. - - - Indicates if a constraint is asserted that the field type supports 'null' - - - Creates an instance of the attribute - Indicates whether to assert that the field type supports null. - DefaultValueAttribute - - - Creates an instance of the attribute - DefaultValueAttribute - - - Adding this attribute to a field declaration means that the field is - not initialized. During type checking a constraint is asserted that the field type supports 'null'. - If the 'check' value is false then the constraint is not asserted. - - - Creates an instance of the attribute - EntryPointAttribute - - - Adding this attribute to a function indicates it is the entrypoint for an application. - If this attribute is not specified for an EXE then the initialization implicit in the - module bindings in the last file in the compilation sequence are used as the entrypoint. - - - Creates an instance of the attribute - EqualityConditionalOnAttribute - - - This attribute is used to indicate a generic container type satisfies the F# 'equality' - constraint only if a generic argument also satisfies this constraint. For example, adding - this attribute to parameter 'T on a type definition C<'T> means that a type C<X> only supports - equality if the type X also supports equality and all other conditions for C<X> to support - equality are also met. The type C<'T> can still be used with other type arguments, but a type such - as C<(int -> int)> will not support equality because the type (int -> int) is an F# function type - and does not support equality. - - This attribute will be ignored if it is used on the generic parameters of functions or methods. - - - Indicates the warning message to be emitted when F# source code uses this construct - - - Creates an instance of the attribute - The warning message to be emitted when code uses this construct. - ExperimentalAttribute - - - This attribute is used to tag values that are part of an experimental library - feature. - - - Convert an value of type System.Converter to a F# first class function value - The input System.Converter. - An F# function of the same type. - - - Convert an F# first class function value to a value of type System.Converter - The input function. - A System.Converter of the function type. - - - Convert an F# first class function value to a value of type System.Converter - The input function. - System.Converter<'T,'U> - - - Invoke an F# first class function value with two curried arguments. In some cases this - will result in a more efficient application than applying the arguments successively. - The input function. - The first arg. - The second arg. - The function result. - - - Invoke an F# first class function value with three curried arguments. In some cases this - will result in a more efficient application than applying the arguments successively. - The input function. - The first arg. - The second arg. - The third arg. - The function result. - - - Invoke an F# first class function value with four curried arguments. In some cases this - will result in a more efficient application than applying the arguments successively. - The input function. - The first arg. - The second arg. - The third arg. - The fourth arg. - The function result. - - - Invoke an F# first class function value with five curried arguments. In some cases this - will result in a more efficient application than applying the arguments successively. - The input function. - The first arg. - The second arg. - The third arg. - The fourth arg. - The fifth arg. - The function result. - - - Invoke an F# first class function value with one argument - - 'U - - - Convert an value of type System.Converter to a F# first class function value - The input System.Converter. - An F# function of the same type. - - - Construct an instance of an F# first class function value - The created F# function. - - - The CLI type used to represent F# function values. This type is not - typically used directly, though may be used from other CLI languages. - - - The release number of the F# version associated with the attribute - - - The minor version number of the F# version associated with the attribute - - - The major version number of the F# version associated with the attribute - - - Creates an instance of the attribute - The major version number. - The minor version number. - The release number. - FSharpInterfaceDataVersionAttribute - - - This attribute is added to generated assemblies to indicate the - version of the data schema used to encode additional F# - specific information in the resource attached to compiled F# libraries. - - - Specialize the type function at a given type - The specialized type. - - - Construct an instance of an F# first class type function value - FSharpTypeFunc - - - The CLI type used to represent F# first-class type function values. This type is for use - by compiled F# code. - - - Type of a formatting expression. - Function type generated by printf. - Type argument passed to %a formatters - Value generated by the overall printf action (e.g. sprint generates a string) - Value generated after post processing (e.g. failwithf generates a string internally then raises an exception) - - - Type of a formatting expression. - Function type generated by printf. - Type argument passed to %a formatters - Value generated by the overall printf action (e.g. sprint generates a string) - Value generated after post processing (e.g. failwithf generates a string internally then raises an exception) - Tuple of values generated by scan or match. - - - Convert the given Converter delegate object to an F# function value - The input Converter. - The F# function. - - - Convert the given Action delegate object to an F# function value - The input action. - The F# function. - - - A utility function to convert function values from tupled to curried form - The input tupled function. - The output curried function. - - - A utility function to convert function values from tupled to curried form - The input tupled function. - The output curried function. - - - A utility function to convert function values from tupled to curried form - The input tupled function. - The output curried function. - - - A utility function to convert function values from tupled to curried form - The input tupled function. - The output curried function. - - - Helper functions for converting F# first class function values to and from CLI representaions - of functions using delegates. - - - Creates an instance of the attribute - GeneralizableValueAttribute - - - Adding this attribute to a non-function value with generic parameters indicates that - uses of the construct can give rise to generic code through type inference. - - - Creates an instance of the attribute - InterfaceAttribute - - - Adding this attribute to a type causes it to be represented using a CLI interface. - - - Creates an instance of the attribute - LiteralAttribute - - - Adding this attribute to a value causes it to be compiled as a CLI constant literal. - - - Creates an instance of the attribute - MeasureAnnotatedAbbreviationAttribute - - - Adding this attribute to a type causes it to be interpreted as a refined type, currently limited to measure-parameterized types. - This may only be used under very limited conditions. - - - Creates an instance of the attribute - MeasureAttribute - - - Adding this attribute to a type causes it to be interpreted as a unit of measure. - This may only be used under very limited conditions. - - - Creates an instance of the attribute - NoComparisonAttribute - - - Adding this attribute to a type indicates it is a type where comparison is an abnormal operation. - This means that the type does not satisfy the F# 'comparison' constraint. Within the bounds of the - F# type system, this helps ensure that the F# generic comparison function is not instantiated directly - at this type. The attribute and checking does not constrain the use of comparison with base or child - types of this type. - - - Creates an instance of the attribute - NoDynamicInvocationAttribute - - - This attribute is used to tag values that may not be dynamically invoked at runtime. This is - typically added to inlined functions whose implementations include unverifiable code. It - causes the method body emitted for the inlined function to raise an exception if - dynamically invoked, rather than including the unverifiable code in the generated - assembly. - - - Creates an instance of the attribute - NoEqualityAttribute - - - Adding this attribute to a type indicates it is a type where equality is an abnormal operation. - This means that the type does not satisfy the F# 'equality' constraint. Within the bounds of the - F# type system, this helps ensure that the F# generic equality function is not instantiated directly - at this type. The attribute and checking does not constrain the use of comparison with base or child - types of this type. - - - The representation of "Value of type 'T" - The input value. - An option representing the value. - - - The representation of "No value" - - - Get the value of a 'Some' option. A NullReferenceException is raised if the option is 'None'. - - - Create an option value that is a 'None' value. - - - Return 'true' if the option is a 'Some' value. - - - Return 'true' if the option is a 'None' value. - - - Create an option value that is a 'Some' value. - The input value - An option representing the value. - - - The type of optional values. When used from other CLI languages the - empty option is the null value. - - Use the constructors Some and None to create values of this type. - Use the values in the Option module to manipulate values of this type, - or pattern match against the values directly. - - None values will appear as the value null to other CLI languages. - Instance methods on this type will appear as static methods to other CLI languages - due to the use of null as a value representation. - - - Creates an instance of the attribute - OptionalArgumentAttribute - - - This attribute is added automatically for all optional arguments. - - - The raw text of the format string. - - - Construct a format string - The input string. - The PrintfFormat containing the formatted result. - - - Type of a formatting expression. - Function type generated by printf. - Type argument passed to %a formatters - Value generated by the overall printf action (e.g. sprint generates a string) - Value generated after post processing (e.g. failwithf generates a string internally then raises an exception) - - - Construct a format string - The input string. - The created format string. - - - Type of a formatting expression. - Function type generated by printf. - Type argument passed to %a formatters - Value generated by the overall printf action (e.g. sprint generates a string) - Value generated after post processing (e.g. failwithf generates a string internally then raises an exception) - Tuple of values generated by scan or match. - - - Creates an instance of the attribute - ProjectionParameterAttribute - - - Indicates that, when a custom operator is used in a computation expression, - a parameter is automatically parameterized by the variable space of the computation expression - - - - The current value of the reference cell - - - - The current value of the reference cell - - - The current value of the reference cell - - - The type of mutable references. Use the functions [:=] and [!] to get and - set values of this type. - - - Creates an instance of the attribute - ReferenceEqualityAttribute - - - Adding this attribute to a record or union type disables the automatic generation - of overrides for 'System.Object.Equals(obj)', 'System.Object.GetHashCode()' - and 'System.IComparable' for the type. The type will by default use reference equality. - - - Creates an instance of the attribute - ReflectedDefinitionAttribute - - - Adding this attribute to the let-binding for the definition of a top-level - value makes the quotation expression that implements the value available - for use at runtime. - - - Creates an instance of the attribute - RequireQualifiedAccessAttribute - - - This attribute is used to indicate that references to the elements of a module, record or union - type require explicit qualified access. - - - Creates an instance of the attribute - RequiresExplicitTypeArgumentsAttribute - - - Adding this attribute to a type, value or member requires that - uses of the construct must explicitly instantiate any generic type parameters. - - - The value of the attribute, indicating whether the type is sealed or not. - - - Creates an instance of the attribute - Indicates whether the class is sealed. - SealedAttribute - - - Creates an instance of the attribute. - The created attribute. - - - Adding this attribute to class definition makes it sealed, which means it may not - be extended or implemented. - - - Indicates that the compiled entity had private or internal representation in F# source code. - - - The mask of values related to the kind of the compiled entity. - - - Indicates that the compiled entity is part of the representation of an F# value declaration. - - - Indicates that the compiled entity is part of the representation of an F# union case declaration. - - - Indicates that the compiled entity is part of the representation of an F# module declaration. - - - Indicates that the compiled entity is part of the representation of an F# closure. - - - Indicates that the compiled entity is part of the representation of an F# exception declaration. - - - Indicates that the compiled entity is part of the representation of an F# record or union case field declaration. - - - Indicates that the compiled entity is part of the representation of an F# class or other object type declaration. - - - Indicates that the compiled entity is part of the representation of an F# record type declaration. - - - Indicates that the compiled entity is part of the representation of an F# union type declaration. - - - Indicates that the compiled entity has no relationship to an element in F# source code. - - - - - - Indicates the relationship between a compiled entity in a CLI binary and an element in F# source code. - - - Creates an instance of the attribute - StructAttribute - - - Adding this attribute to a type causes it to be represented using a CLI struct. - - - Creates an instance of the attribute - StructuralComparisonAttribute - - - Adding this attribute to a record, union, exception, or struct type confirms the - automatic generation of implementations for 'System.IComparable' for the type. - - - Creates an instance of the attribute - StructuralEqualityAttribute - - - Adding this attribute to a record, union or struct type confirms the automatic - generation of overrides for 'System.Object.Equals(obj)' and - 'System.Object.GetHashCode()' for the type. - - - Indicates the text to display by default when objects of this type are displayed - using '%A' printf formatting patterns and other two-dimensional text-based display - layouts. - - - Creates an instance of the attribute - Indicates the text to display when using the '%A' printf formatting. - StructuredFormatDisplayAttribute - - - 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 this version of F# the only valid values are of the form PreText {PropertyName} PostText. - The property name indicates a property to evaluate and to display instead of the object itself. - - - The type 'unit', which has only one value "()". This value is special and - always uses the representation 'null'. - - - Creates an instance of the attribute - UnverifiableAttribute - - - This attribute is used to tag values whose use will result in the generation - of unverifiable code. These values are inevitably marked 'inline' to ensure that - the unverifiable constructs are not present in the actual code for the F# library, - but are rather copied to the source code of the caller. - - - Creates an instance of the attribute - VolatileFieldAttribute - - - Adding this attribute to an F# mutable binding causes the "volatile" - prefix to be used for all accesses to the field. - - - Four dimensional arrays, typically zero-based. Non-zero-based arrays - can be created using methods on the System.Array type. - - Use the values in the Array4D module - to manipulate values of this type, or the notation arr.[x1,x2,x3,x4] to get and set array - values. - - - Three dimensional arrays, typically zero-based. Non-zero-based arrays - can be created using methods on the System.Array type. - - Use the values in the Array3D module - to manipulate values of this type, or the notation arr.[x1,x2,x3] to get and set array - values. - - - Two dimensional arrays, typically zero-based. - - Use the values in the Array2D module - to manipulate values of this type, or the notation arr.[x,y] to get/set array - values. - - Non-zero-based arrays can also be created using methods on the System.Array type. - - - Single dimensional, zero-based arrays, written int[], string[] etc. - Use the values in the Array module to manipulate values - of this type, or the notation arr.[x] to get/set array - values. - - - Single dimensional, zero-based arrays, written int[], string[] etc. - - Use the values in the Array module to manipulate values - of this type, or the notation arr.[x] to get/set array - values. - - - - - - An abbreviation for the CLI type System.Boolean. - - - Represents a managed pointer in F# code. - - - An abbreviation for the CLI type System.Byte. - - - An abbreviation for the CLI type System.Char. - - - An abbreviation for the CLI type System.Decimal. - - - The type of decimal numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.Decimal. - - - An abbreviation for the CLI type System.Double. - - - An abbreviation for the CLI type System.Exception. - - - An abbreviation for the CLI type System.Double. - - - An abbreviation for the CLI type System.Single. - - - The type of floating point numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.Single. - - - The type of floating point numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.Double. - - - This type is for internal use by the F# code generator. - - - An abbreviation for the CLI type System.Int32. - - - An abbreviation for the CLI type System.Int16. - - - The type of 16-bit signed integer numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.Int16. - - - An abbreviation for the CLI type System.Int32. - - - An abbreviation for the CLI type System.Int64. - - - The type of 64-bit signed integer numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.Int64. - - - An abbreviation for the CLI type System.SByte. - - - The type of 32-bit signed integer numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.Int32. - - - An abbreviation for the CLI type System.IntPtr. - - - Represents an unmanaged pointer in F# code. - - This type should only be used when writing F# code that interoperates - with native code. Use of this type in F# code may result in - unverifiable code being generated. Conversions to and from the - nativeint type may be required. Values of this type can be generated - by the functions in the NativeInterop.NativePtr module. - - - An abbreviation for the CLI type System.Object. - - - The type of optional values. When used from other CLI languages the - empty option is the null value. - - Use the constructors Some and None to create values of this type. - Use the values in the Option module to manipulate values of this type, - or pattern match against the values directly. - - 'None' values will appear as the value null to other CLI languages. - Instance methods on this type will appear as static methods to other CLI languages - due to the use of null as a value representation. - - - The type of mutable references. Use the functions [:=] and [!] to get and - set values of this type. - - - An abbreviation for the CLI type System.SByte. - - - The type of 8-bit signed integer numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.SByte. - - - An abbreviation for the CLI type System.Single. - - - An abbreviation for the CLI type System.String. - - - An abbreviation for the CLI type System.UInt16. - - - An abbreviation for the CLI type System.UInt32. - - - An abbreviation for the CLI type System.UInt64. - - - An abbreviation for the CLI type System.Byte. - - - An abbreviation for the CLI type System.UIntPtr. - - - The type 'unit', which has only one value "()". This value is special and - always uses the representation 'null'. - - - - - - - - - - - - Non-exhaustive match failures will raise the MatchFailureException exception - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - A new enumerator for the sequence. - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - A reference to the sequence. - - A 0, 1, and 2 respectively indicate Stop, Yield, and Goto conditions for the sequence generator. - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - A new sequence generator for the expression. - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - - - Namespace name the provider injects types into. - - - - - Compilers call this method to query a type provider for a type name. - - Resolver should return a type called name in namespace NamespaceName or null if the type is unknown. - - - - - - The top-level types - - - - - - The sub-namespaces in this namespace. An optional member to prevent generation of namespaces until an outer namespace is explored. - - - - - - - - Triggered when an assumption changes that invalidates the resolutions so far reported by the provider - - - - - Triggered when an assumption changes that invalidates the resolutions so far reported by the provider - - - - - Triggered when an assumption changes that invalidates the resolutions so far reported by the provider - - - - - Get the static parameters for a provided type. - - A type returned by GetTypes or ResolveTypeName - - - - - Namespace name the this TypeProvider injects types into. - - - - - Called by the compiler to ask for an Expression tree to replace the given MethodBase with. - - MethodBase that was given to the compiler by a type returned by a GetType(s) call. - Expressions that represent the parameters to this call. - An expression that the compiler will use in place of the given method base. - - - - Get the physical contents of the given logical provided assembly. - - - - - Apply static arguments to a provided type that accepts static arguments. - - The provider must return a type with the given mangled name. - the provided type definition which has static parameters - the full path of the type, including encoded representations of static parameters - the static parameters, indexed by name - - - - - - - Represents the inverse of a measure expressions when returned as a generic argument of a provided type. - - - Represents the '1' measure expression when returned as a generic argument of a provided type. - - - Represents the product of two measure expressions when returned as a generic argument of a provided type. - - - - - - Creates an instance of the attribute - TypeProviderAssemblyAttribute - The name of the design-time assembly for this type provider. - - - Creates an instance of the attribute - TypeProviderAssemblyAttribute - - - Place attribute on runtime assembly to indicate that there is a corresponding design-time - assembly that contains a type provider. Runtime and designer assembly may be the same. - - - Creates an instance of the attribute - TypeProviderAttribute - - - Place on a class that implements ITypeProvider to extend the compiler - - - - Get the full path to use for temporary files for the type provider instance. - - - - - version of referenced system runtime assembly - - - - - Get the full path to referenced assembly that caused this type provider instance to be created. - - - - - Get the full path to use to resolve relative paths in any file name arguments given to the type provider instance. - - - - - Get the referenced assemblies for the type provider instance. - - - - - Indicates if the type provider host responds to invalidation events for type provider instances. - - - - - Indicates if the type provider instance is used in an environment which executes provided code such as F# Interactive. - - - - - Get the full path to use for temporary files for the type provider instance. - - - - - version of referenced system runtime assembly - - - - - Get the full path to referenced assembly that caused this type provider instance to be created. - - - - - Get the full path to use to resolve relative paths in any file name arguments given to the type provider instance. - - - - - Get the referenced assemblies for the type provider instance. - - - - - Indicates if the type provider host responds to invalidation events for type provider instances. - - - - - Indicates if the type provider instance is used in an environment which executes provided code such as F# Interactive. - - - - - Checks if given type exists in target system runtime library - - - - - - - - If the class that implements ITypeProvider has a constructor that accepts TypeProviderConfig - then it will be constructed with an instance of TypeProviderConfig. - - - - - - - - - - - - - - - - - - - - - - - - - - - - Creates an instance of the attribute - TypeProviderEditorHideMethodsAttribute - - - Indicates that a code editor should hide all System.Object methods from the intellisense menus for instances of a provided type - - - - - - - - - - - - Additional type attribute flags related to provided types - - - - - - Creates an instance of the attribute - TypeProviderXmlDocAttribute - - - - The TypeProviderXmlDocAttribute attribute can be added to types and members. - The language service will display the CommentText property from the attribute - in the appropriate place when the user hovers over a type or member. - - - - - - - - - - - - - - - - Creates an anonymous event with the given handlers. - - A function to handle adding a delegate for the event to trigger. - A function to handle removing a delegate that the event triggers. - A function to produce the delegate type the event can trigger. - - The initialized event. - - - The F# compiler emits calls to this function to implement the use operator for F# sequence - expressions. - - The resource to be used and disposed. - The input sequence. - - The result sequence. - - - The F# compiler emits calls to this function to implement the compiler-intrinsic - conversions from untyped System.Collections.IEnumerable sequences to typed sequences. - - An initializer function. - A function to iterate and test if end of sequence is reached. - A function to retrieve the current element. - - The resulting typed sequence. - - - The F# compiler emits calls to this function to - implement the try/finally operator for F# sequence expressions. - - The input sequence. - A computation to be included in an enumerator's Dispose method. - - The result sequence. - - - The F# compiler emits calls to this function to - implement the while operator for F# sequence expressions. - - A function that indicates whether iteration should continue. - The input sequence. - - The result sequence. - - - A group of functions used as part of the compiled representation of F# sequence expressions. - - - Builds a query using query syntax and operators. - - - An active pattern to force the execution of values of type Lazy<_>. - - - Special prefix operator for splicing untyped expressions into quotation holes. - - - Special prefix operator for splicing typed expressions into quotation holes. - - - Builds a 2D array from a sequence of sequences of elements. - - - Builds a read-only lookup table from a sequence of key/value pairs. The key objects are indexed using generic hashing and equality. - - - Converts the argument to signed byte. - This is a direct conversion for all - primitive numeric types. For strings, the input is converted using SByte.Parse() with InvariantCulture settings. - Otherwise the operation requires and invokes a ToSByte method on the input type. - - - Converts the argument to byte. - This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Byte.Parse() on strings and otherwise requires a ToByte method on the input type. - - - Converts the argument to 64-bit float. - This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Double.Parse() with InvariantCulture settings. Otherwise the operation requires and invokes a ToDouble method on the input type. - - - Converts the argument to 32-bit float. - This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Single.Parse() with InvariantCulture settings. Otherwise the operation requires and invokes a ToSingle method on the input type. - - - Builds an aysnchronous workflow using computation expression syntax. - - - Builds a set from a sequence of objects. The objects are indexed using generic comparison. - The input sequence of elements. - The created set. - - - Print to a file using the given format, and add a newline. - The file TextWriter. - The formatter. - The formatted result. - - - Print to a file using the given format. - The file TextWriter. - The formatter. - The formatted result. - - - Print to a string buffer and raise an exception with the given - result. Helper printers must return strings. - The formatter. - The formatted result. - - - Print to a string using the given format. - The formatter. - The formatted result. - - - Print to stderr using the given format, and add a newline. - The formatter. - The formatted result. - - - Print to stderr using the given format. - The formatter. - The formatted result. - - - Print to stdout using the given format, and add a newline. - The formatter. - The formatted result. - - - Print to stdout using the given format. - The formatter. - The formatted result. - - - - - - Divides a value by an integer. - The input value. - The input int. - The division result. - - - - - - Resolves to the value 'one' for any primitive numeric type or any type with a static member called 'One' - - - Resolves to the zero value for any primitive numeric type or any type with a static member called 'Zero' - - - A compiler intrinsic that implements dynamic invocations for the DivideByInt primitive. - - - A compiler intrinsic that implements dynamic invocations to the checked '*' operator. - - - A compiler intrinsic that implements dynamic invocations to the '*' operator. - - - A compiler intrinsic that implements dynamic invocations to the checked '+' operator. - - - A compiler intrinsic that implements dynamic invocations to the '+' operator. - - - Resolves to the value 'one' for any primitive numeric type or any type with a static member called 'One'. - - - Resolves to the zero value for any primitive numeric type or any type with a static member called 'Zero'. - - - Parse an uint64 according to the rules used by the overloaded 'uint64' conversion operator when applied to strings - The input string. - The parsed value. - - - Parse an int64 according to the rules used by the overloaded 'int64' conversion operator when applied to strings - The input string. - The parsed value. - - - Parse an uint32 according to the rules used by the overloaded 'uint32' conversion operator when applied to strings - The input string. - The parsed value. - - - Parse an int32 according to the rules used by the overloaded 'int32' conversion operator when applied to strings - The input string. - The parsed value. - - - Creates an sbyte value with units-of-measure - The input sbyte. - The sbyte with units-of-measure. - - - Creates an int16 value with units-of-measure - The input int16. - The int16 with units-of-measure. - - - Creates an int64 value with units-of-measure - The input int64. - The int64 with units of measure. - - - Creates an int32 value with units-of-measure - The input int. - The int with units of measure. - - - Creates a decimal value with units-of-measure - The input decimal. - The decimal with units of measure. - - - Creates a float32 value with units-of-measure - The input float. - The float with units-of-measure. - - - Creates a float value with units-of-measure - The input float. - The float with units-of-measure. - - - Get the underlying value for an enum value - The input enum. - The enumeration as a value. - - - Build an enum value from an underlying value - The input value. - The value as an enumeration. - - - Recursively hash a part of a value according to its structure. - The comparison function. - The input object. - The hashed value. - - - Hash a value according to its structure. Use the given limit to restrict the hash when hashing F# - records, lists and union types. - The limit on the number of nodes. - The input object. - The hashed value. - - - Hash a value according to its structure. This hash is not limited by an overall node count when hashing F# - records, lists and union types. - The input object. - The hashed value. - - - Make an F# hash/equality object for the given type using node-limited hashing when hashing F# - records, lists and union types. - The input limit on the number of nodes. - System.Collections.Generic.IEqualityComparer<'T> - - - Make an F# hash/equality object for the given type - - - Make an F# comparer object for the given type, where it can be null if System.Collections.Generic.Comparer<'T>.Default - - - Make an F# comparer object for the given type - - - A static F# comparer object - - - Return an F# comparer object suitable for hashing and equality. This hashing behaviour - of the returned comparer is not limited by an overall node count when hashing F# - records, lists and union types. This equality comparer has equivalence - relation semantics ([nan] = [nan]). - - - Return an F# comparer object suitable for hashing and equality. This hashing behaviour - of the returned comparer is not limited by an overall node count when hashing F# - records, lists and union types. - - - The physical hash. Hashes on the object identity, except for value types, - where we hash on the contents. - The input object. - The hashed value. - - - Reference/physical equality. - True if the inputs are reference-equal, false otherwise. - The first value. - The second value. - The result of the comparison. - - - Take the maximum of two values structurally according to the order given by GenericComparison - The first value. - The second value. - The maximum value. - - - Take the minimum of two values structurally according to the order given by GenericComparison - The first value. - The second value. - The minimum value. - - - Compare two values - The first value. - The second value. - The result of the comparison. - - - Compare two values - The first value. - The second value. - The result of the comparison. - - - Compare two values - The first value. - The second value. - The result of the comparison. - - - Compare two values - The first value. - The second value. - The result of the comparison. - - - Compare two values. May be called as a recursive case from an implementation of System.IComparable to - ensure consistent NaN comparison semantics. - The function to compare the values. - The first value. - The second value. - The result of the comparison. - - - Compare two values - The first value. - The second value. - The result of the comparison. - - - Compare two values for equality - - The first value. - The second value. - The result of the comparison. - - - Compare two values for equality using equivalence relation semantics ([nan] = [nan]) - The first value. - The second value. - The result of the comparison. - - - Compare two values for equality using partial equivalence relation semantics ([nan] <> [nan]) - The first value. - The second value. - The result of the comparison. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - The F# compiler emits calls to some of the functions in this module as part of the compiled form of some language constructs - - - - The standard overloaded associative (4-indexed) mutation operator - - - - The standard overloaded associative (3-indexed) mutation operator - - - The standard overloaded associative (2-indexed) mutation operator - - - The standard overloaded associative (indexed) mutation operator - - - The standard overloaded associative (4-indexed) lookup operator - - - The standard overloaded associative (3-indexed) lookup operator - - - The standard overloaded associative (2-indexed) lookup operator - - - The standard overloaded associative (indexed) lookup operator - - - A compiler intrinsic for checking initialization soundness of recursive bindings - - - A compiler intrinsic for checking initialization soundness of recursive static bindings - - - A compiler intrinsic for checking initialization soundness of recursive bindings - - - A compiler intrinsic for the efficient compilation of sequence expressions - - - This function implements parsing of decimal constants - - - This function implements calls to default constructors - acccessed by 'new' constraints. - - - Primitive used by pattern match compilation - - - A compiler intrinsic that implements the ':?' operator - - - A compiler intrinsic that implements the ':?' operator - - - A compiler intrinsic that implements the ':?>' operator - - - A compiler intrinsic that implements the ':?>' operator - - - The F# compiler emits calls to some of the functions in this module as part of the compiled form of some language constructs - - - Address-of. Uses of this value may result in the generation of unverifiable code. - The input object. - The unmanaged pointer. - - - Address-of. Uses of this value may result in the generation of unverifiable code. - The input object. - The managed pointer. - - - Binary 'or'. When used as a binary operator the right hand value is evaluated only on demand - The first value. - The second value. - The result of the operation. - - - Binary 'or'. When used as a binary operator the right hand value is evaluated only on demand. - - - Binary 'and'. When used as a binary operator the right hand value is evaluated only on demand - The first value. - The second value. - The result of the operation. - - - Binary 'and'. When used as a binary operator the right hand value is evaluated only on demand. - - - The F# compiler emits calls to some of the functions in this module as part of the compiled form of some language constructs - - - - - - - - - - - - - - - - - - For internal use only - - - Language primitives associated with the F# language - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - An active pattern to match values of type System.Collections.Generic.KeyValuePair - The input key/value pair. - A tuple containing the key and value. - - - Converts the argument to character. Numeric inputs are converted according to the UTF-16 - encoding for characters. String inputs must be exactly one character long. For other - input types the operation requires an appropriate static conversion method on the input type. - The input value. - The converted char. - - - Converts the argument to System.Decimal using a direct conversion for all - primitive numeric types. For strings, the input is converted using UInt64.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted decimal. - - - Converts the argument to a string using ToString. - - For standard integer and floating point values the ToString conversion - uses CultureInfo.InvariantCulture. - The input value. - The converted string. - - - Converts the argument to unsigned native integer using a direct conversion for all - primitive numeric types. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted unativeint - - - Converts the argument to signed native integer. This is a direct conversion for all - primitive numeric types. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted nativeint - - - Converts the argument to 64-bit float. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Double.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted float - - - Converts the argument to 32-bit float. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Single.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted float32 - - - Converts the argument to unsigned 64-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using UInt64.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint64 - - - Converts the argument to signed 64-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Int64.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int64 - - - Converts the argument to unsigned 32-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using UInt32.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint32 - - - Converts the argument to signed 32-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Int32.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int32 - - - Converts the argument to a particular enum type. - The input value. - The converted enum type. - - - Converts the argument to signed 32-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Int32.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int - - - Converts the argument to unsigned 16-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using UInt16.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint16 - - - Converts the argument to signed 16-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Int16.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int16 - - - Converts the argument to signed byte. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using SByte.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted sbyte - - - Converts the argument to byte. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Byte.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted byte - - - Overloaded power operator. If n > 0 then equivalent to x*...*x for n occurrences of x. - The input base. - The input exponent. - The base raised to the exponent. - - - Overloaded power operator. - The input base. - The input exponent. - The base raised to the exponent. - - - Overloaded truncate operator. - The input value. - The truncated value. - - - Hyperbolic tangent of the given number - The input value. - The hyperbolic tangent of the input. - - - Tangent of the given number - The input value. - The tangent of the input. - - - Hyperbolic sine of the given number - The input value. - The hyperbolic sine of the input. - - - Sine of the given number - The input value. - The sine of the input. - - - Hyperbolic cosine of the given number - The input value. - The hyperbolic cosine of the input. - - - Cosine of the given number - The input value. - The cosine of the input. - - - Square root of the given number - The input value. - The square root of the input. - - - Logarithm to base 10 of the given number - The input value. - The logarithm to base 10 of the input. - - - Natural logarithm of the given number - The input value. - The natural logarithm of the input. - - - Round the given number - The input value. - The nearest integer to the input value. - - - Sign of the given number - The input value. - -1, 0, or 1 depending on the sign of the input. - - - Floor of the given number - The input value. - The floor of the input. - - - Exponential of the given number - The input value. - The exponential of the input. - - - Ceiling of the given number - The input value. - The ceiling of the input. - - - Inverse tangent of x/y where x and y are specified separately - The y input value. - The x input value. - The inverse tangent of the input ratio. - - - Inverse tangent of the given number - The input value. - The inverse tangent of the input. - - - Inverse sine of the given number - The input value. - The inverse sine of the input. - - - Inverse cosine of the given number - The input value. - The inverse cosine of the input. - - - Absolute value of the given number. - The input value. - The absolute value of the input. - - - A generic hash function. This function has the same behaviour as 'hash', - however the default structural hashing for F# union, record and tuple - types stops when the given limit of nodes is reached. The exact behaviour of - the function can be adjusted on a type-by-type basis by implementing - GetHashCode for each type. - The limit of nodes. - The input object. - The computed hash. - - - A generic hash function, designed to return equal hash values for items that are - equal according to the "=" operator. By default it will use structural hashing - for F# union, record and tuple types, hashing the complete contents of the - type. The exact behaviour of the function can be adjusted on a - type-by-type basis by implementing GetHashCode for each type. - The input object. - The computed hash. - - - Returns the internal size of a type in bytes. For example, sizeof<int> returns 4. - - - Generate a System.Type representation for a type definition. If the - input type is a generic type instantiation then return the - generic type definition associated with all such instantiations. - - - An internal, library-only compiler intrinsic for compile-time - generation of a RuntimeMethodHandle. - - - Generate a System.Type runtime representation of a static type. - The static type is still maintained on the value returned. - - - Clean up resources associated with the input object after the completion of the given function. - Cleanup occurs even when an exception is raised by the protected - code. - The resource to be disposed after action is called. - The action that accepts the resource. - The resulting value. - - - Execute the function as a mutual-exclusion region using the input value as a lock. - The object to be locked. - The action to perform during the lock. - The resulting value. - - - The standard overloaded skip range operator, e.g. [n..skip..m] for lists, seq {n..skip..m} for sequences - The start value of the range. - The step value of the range. - The end value of the range. - The sequence spanning the range using the specified step size. - - - The standard overloaded range operator, e.g. [n..m] for lists, seq {n..m} for sequences - The start value of the range. - The end value of the range. - The sequence spanning the range. - - - Reads the value of the property System.Console.Out. - - - Reads the value of the property System.Console.Error. - - - Reads the value of the property System.Console.In. - - - Equivalent to System.Single.NaN - - - Equivalent to System.Single.PositiveInfinity - - - Equivalent to System.Double.NaN - - - Equivalent to System.Double.PositiveInfinity - - - Exit the current hardware isolated process, if security settings permit, - otherwise raise an exception. Calls System.Environment.Exit. - The exit code to use. - The result value. - - - Builds a sequence using sequence expression syntax - The input sequence. - The result sequence. - - - Negate a logical value. not true equals false and not false equals true - The value to negate. - The result of the negation. - - - Concatenate two lists. - The first list. - The second list. - The concatenation of the lists. - - - Increment a mutable reference cell containing an integer - The reference cell. - - - Decrement a mutable reference cell containing an integer - The reference cell. - - - Dereference a mutable reference cell - The cell to dereference. - The value contained in the cell. - - - Assign to a mutable reference cell - The cell to mutate. - The value to set inside the cell. - - - Create a mutable reference cell - The value to contain in the cell. - The created reference cell. - - - The identity function - The input value. - The same value. - - - Throw a System.InvalidOperationException exception - The exception message. - The result value. - - - Throw a System.ArgumentNullException exception - The argument name. - The result value. - - - Throw a System.ArgumentException exception with - the given argument name and message. - The argument name. - The exception message. - The result value. - - - Throw a System.Exception exception. - The exception message. - The result value. - - - Boxes a strongly typed value. - The value to box. - The boxed object. - - - Unboxes a strongly typed value. This is the inverse of box, unbox<t>(box<t> a) equals a. - The boxed value. - The unboxed result. - - - Ignore the passed value. This is often used to throw away results of a computation. - The value to ignore. - - - Minimum based on generic comparison - The first value. - The second value. - The minimum value. - - - Maximum based on generic comparison - The first value. - The second value. - The maximum value. - - - Generic comparison. - The first value. - The second value. - The result of the comparison. - - - Return the second element of a tuple, snd (a,b) = b. - The input tuple. - The second value. - - - Return the first element of a tuple, fst (a,b) = a. - The input tuple. - The first value. - - - Matches System.Exception objects whose runtime type is precisely System.Exception - The input exception. - A string option. - - - Builds a System.Exception object. - The message for the Exception. - A System.Exception. - - - Rethrows an exception. This should only be used when handling an exception - The result value. - - - Rethrows an exception. This should only be used when handling an exception - The result value. - - - Raises an exception - The exception to raise. - The result value. - - - Concatenate two strings. The operator '+' may also be used. - - - Used to specify a default value for an optional argument in the implementation of a function - An option representing the argument. - The default value of the argument. - The argument value. If it is None, the defaultValue is returned. - - - Apply a function to three values, the values being a triple on the right, the function on the left - The function. - The first argument. - The second argument. - The third argument. - The function result. - - - Apply a function to two values, the values being a pair on the right, the function on the left - The function. - The first argument. - The second argument. - The function result. - - - Apply a function to a value, the value being on the right, the function on the left - The function. - The argument. - The function result. - - - Apply a function to three values, the values being a triple on the left, the function on the right - The first argument. - The second argument. - The third argument. - The function. - The function result. - - - Apply a function to two values, the values being a pair on the left, the function on the right - The first argument. - The second argument. - The function. - The function result. - - - Apply a function to a value, the value being on the left, the function on the right - The argument. - The function. - The function result. - - - Compose two functions, the function on the right being applied first - The second function to apply. - The first function to apply. - The composition of the input functions. - - - Compose two functions, the function on the left being applied first - The first function to apply. - The second function to apply. - The composition of the input functions. - - - Structural inequality - The first parameter. - The second parameter. - The result of the comparison. - - - Structural equality - The first parameter. - The second parameter. - The result of the comparison. - - - Structural less-than-or-equal comparison - The first parameter. - The second parameter. - The result of the comparison. - - - Structural greater-than-or-equal - The first parameter. - The second parameter. - The result of the comparison. - - - Structural greater-than - The first parameter. - The second parameter. - The result of the comparison. - - - Structural less-than comparison - The first parameter. - The second parameter. - The result of the comparison. - - - Overloaded prefix-plus operator - The input value. - The result of the operation. - - - Overloaded bitwise-NOT operator - The input value. - The result of the operation. - - - Overloaded byte-shift right operator by a specified number of bits - The input value. - The amount to shift. - The result of the operation. - - - Overloaded byte-shift left operator by a specified number of bits - The input value. - The amount to shift. - The result of the operation. - - - Overloaded bitwise-XOR operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded bitwise-OR operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded bitwise-AND operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded modulo operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded division operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded multiplication operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded subtraction operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded addition operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded unary negation. - The value to negate. - The result of the operation. - - - Converts the argument to char. Numeric inputs are converted using a checked - conversion according to the UTF-16 encoding for characters. String inputs must - be exactly one character long. For other input types the operation requires an - appropriate static conversion method on the input type. - The input value. - The converted char - - - Converts the argument to unativeint. This is a direct, checked conversion for all - primitive numeric types. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted unativeint - - - Converts the argument to nativeint. This is a direct, checked conversion for all - primitive numeric types. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted nativeint - - - Converts the argument to uint64. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.UInt64.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint64 - - - Converts the argument to int64. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.Int64.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int64 - - - Converts the argument to uint32. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.UInt32.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint32 - - - Converts the argument to int32. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.Int32.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int32 - - - Converts the argument to int. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.Int32.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int - - - Converts the argument to uint16. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.UInt16.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint16 - - - Converts the argument to int16. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.Int16.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int16 - - - Converts the argument to sbyte. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.SByte.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted sbyte - - - Converts the argument to byte. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.Byte.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted byte - - - Overloaded multiplication operator (checks for overflow) - The first value. - The second value. - The product of the two input values. - - - Overloaded addition operator (checks for overflow) - The first value. - The second value. - The sum of the two input values. - - - Overloaded subtraction operator (checks for overflow) - The first value. - The second value. - The first value minus the second value. - - - Overloaded unary negation (checks for overflow) - The input value. - The negated value. - - - This module contains the basic arithmetic operations with overflow checks. - - - Perform generic hashing on a value where the type of the value is not - statically required to satisfy the 'equality' constraint. - The computed hash value. - - - Perform generic equality on two values where the type of the values is not - statically required to satisfy the 'equality' constraint. - The result of the comparison. - - - Perform generic comparison on two values where the type of the values is not - statically required to have the 'comparison' constraint. - The result of the comparison. - - - Generate a default value for any type. This is null for reference types, - For structs, this is struct value where all fields have the default value. - This function is unsafe in the sense that some F# values do not have proper null values. - - - Unboxes a strongly typed value. This is the inverse of box, unbox<t>(box<t> a) equals a. - The boxed value. - The unboxed result. - - - This module contains basic operations which do not apply runtime and/or static checks - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'decimal' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'float' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'float32' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'unativeint' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'nativeint' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'uint64' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'int64' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'uint32' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'int32' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'uint16' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'int16' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'sbyte' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'byte' - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - Generate a range of values using the given zero, add, start, step and stop values - - - Generate a range of values using the given zero, add, start, step and stop values - - - Generate a range of char values - - - Generate a range of byte values - - - Generate a range of sbyte values - - - Generate a range of uint16 values - - - Generate a range of int16 values - - - Generate a range of unativeint values - - - Generate a range of nativeint values - - - Generate a range of uint32 values - - - Generate a range of uint64 values - - - Generate a range of int64 values - - - Generate a range of float32 values - - - Generate a range of float values - - - Generate a range of integers - - - Gets a slice from a string - The source string. - The index of the first character of the slice. - The index of the last character of the slice. - The substring from the given indices. - - - Sets a slice of an array - The target array. - The start index of the first dimension. - The end index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The start index of the third dimension. - The end index of the third dimension. - The start index of the fourth dimension. - The end index of the fourth dimension. - The source array. - - - Gets a slice of an array - The source array. - The start index of the first dimension. - The end index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The start index of the third dimension. - The end index of the third dimension. - The start index of the fourth dimension. - The end index of the fourth dimension. - The four dimensional sub array from the given indices. - - - Sets a slice of an array - The target array. - The start index of the first dimension. - The end index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The start index of the third dimension. - The end index of the third dimension. - The source array. - - - Gets a slice of an array - The source array. - The start index of the first dimension. - The end index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The start index of the third dimension. - The end index of the third dimension. - The three dimensional sub array from the given indices. - - - Sets a vector slice of a 2D array. The index of the second dimension is fixed. - The target array. - The start index of the first dimension. - The end index of the first dimension. - The index of the second dimension. - The source array. - - - Sets a vector slice of a 2D array. The index of the first dimension is fixed. - The target array. - The index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The source array. - - - Sets a region slice of an array - The target array. - The start index of the first dimension. - The end index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The source array. - - - Gets a vector slice of a 2D array. The index of the second dimension is fixed. - The source array. - The start index of the first dimension. - The end index of the first dimension. - The fixed index of the second dimension. - The sub array from the input indices. - - - Gets a vector slice of a 2D array. The index of the first dimension is fixed. - The source array. - The index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The sub array from the input indices. - - - Gets a region slice of an array - The source array. - The start index of the first dimension. - The end index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The two dimensional sub array from the input indices. - - - Sets a slice of an array - The target array. - The start index. - The end index. - The source array. - - - Gets a slice of an array - The input array. - The start index. - The end index. - The sub array from the input indices. - - - A module of compiler intrinsic functions for efficient implementations of F# integer ranges - and dynamic invocations of other F# operators - - - Basic F# Operators. This module is automatically opened in all F# code. - - - Invoke an F# first class function value that accepts five curried arguments - without intervening execution - The first arg. - The second arg. - The third arg. - The fourth arg. - The fifth arg. - The function result. - - - Adapt an F# first class function value to be an optimized function value that can - accept five curried arguments without intervening execution. - The input function. - The optimized function. - - - Construct an optimized function value that can accept five curried - arguments without intervening execution. - The optimized function. - - - The CLI type used to represent F# function values that accept five curried arguments - without intervening execution. This type should not typically used directly from - either F# code or from other CLI languages. - - - Invoke an F# first class function value that accepts four curried arguments - without intervening execution - The first arg. - The second arg. - The third arg. - The fourth arg. - The function result. - - - Adapt an F# first class function value to be an optimized function value that can - accept four curried arguments without intervening execution. - The input function. - The optimized function. - - - Construct an optimized function value that can accept four curried - arguments without intervening execution. - The optimized function. - - - The CLI type used to represent F# function values that accept four curried arguments - without intervening execution. This type should not typically used directly from - either F# code or from other CLI languages. - - - Invoke an F# first class function value that accepts three curried arguments - without intervening execution - The first arg. - The second arg. - The third arg. - The function result. - - - Adapt an F# first class function value to be an optimized function value that can - accept three curried arguments without intervening execution. - The input function. - The adapted function. - - - Construct an optimized function value that can accept three curried - arguments without intervening execution. - The optimized function. - - - The CLI type used to represent F# function values that accept - three iterated (curried) arguments without intervening execution. This type should not - typically used directly from either F# code or from other CLI languages. - - - Invoke the optimized function value with two curried arguments - The first arg. - The second arg. - The function result. - - - Adapt an F# first class function value to be an optimized function value that can - accept two curried arguments without intervening execution. - The input function. - The adapted function. - - - Construct an optimized function value that can accept two curried - arguments without intervening execution. - The optimized function. - - - The CLI type used to represent F# function values that accept - two iterated (curried) arguments without intervening execution. This type should not - typically used directly from either F# code or from other CLI languages. - - - An implementation module used to hold some private implementations of function - value invocation. - - - Convert the option to a list of length 0 or 1. - The input option. - The result list. - - - Convert the option to an array of length 0 or 1. - The input option. - The result array. - - - bind f inp evaluates to match inp with None -> None | Some x -> f x - A function that takes the value of type T from an option and transforms it into - an option containing a value of type U. - The input option. - An option of the output type of the binder. - - - map f inp evaluates to match inp with None -> None | Some x -> Some (f x). - A function to apply to the option value. - The input option. - An option of the input value after applying the mapping function, or None if the input is None. - - - iter f inp executes match inp with None -> () | Some x -> f x. - A function to apply to the option value. - The input option. - Unit if the option is None, otherwise it returns the result of applying the predicate - to the option value. - - - forall p inp evaluates to match inp with None -> true | Some x -> p x. - A function that evaluates to a boolean when given a value from the option type. - The input option. - True if the option is None, otherwise it returns the result of applying the predicate - to the option value. - - - exists p inp evaluates to match inp with None -> false | Some x -> p x. - A function that evaluates to a boolean when given a value from the option type. - The input option. - False if the option is None, otherwise it returns the result of applying the predicate - to the option value. - - - fold f inp s evaluates to match inp with None -> s | Some x -> f x s. - A function to update the state data when given a value from an option. - The input option. - The initial state. - The original state if the option is None, otherwise it returns the updated state with the folder - and the option value. - - - fold f s inp evaluates to match inp with None -> s | Some x -> f s x. - A function to update the state data when given a value from an option. - The initial state. - The input option. - The original state if the option is None, otherwise it returns the updated state with the folder - and the option value. - - - count inp evaluates to match inp with None -> 0 | Some _ -> 1. - The input option. - A zero if the option is None, a one otherwise. - - - Gets the value associated with the option. - The input option. - The value within the option. - Thrown when the option is None. - - - Returns true if the option is None. - The input option. - True if the option is None. - - - Returns true if the option is not None. - The input option. - True if the option is not None. - - - Basic operations on options. - - - Represents a statically-analyzed format associated with writing to a System.IO.TextWriter. The type parameter indicates the - arguments and return type of the format operation. - - - Represents a statically-analyzed format when formatting builds a string. The type parameter indicates the - arguments and return type of the format operation. - - - Represents a statically-analyzed format associated with writing to a System.Text.StringBuilder. The type parameter indicates the - arguments and return type of the format operation. - - - Represents a statically-analyzed format associated with writing to a System.IO.TextWriter. The first type parameter indicates the - arguments of the format operation and the last the overall return type. - - - Represents a statically-analyzed format when formatting builds a string. The first type parameter indicates the - arguments of the format operation and the last the overall return type. - - - Represents a statically-analyzed format associated with writing to a System.Text.StringBuilder. The first type parameter indicates the - arguments of the format operation and the last the overall return type. - - - Print to a string buffer and raise an exception with the given - result. Helper printers must return strings. - The input formatter. - The arguments of the formatter. - - - sprintf, but call the given 'final' function to generate the result. - See kprintf. - The function called to generate a result from the formatted string. - The input formatter. - The arguments of the formatter. - - - printf, but call the given 'final' function to generate the result. - For example, these let the printing force a flush after all output has - been entered onto the channel, but not before. - The function called after formatting to generate the format result. - The input formatter. - The arguments of the formatter. - - - fprintf, but call the given 'final' function to generate the result. - See kprintf. - The function called after formatting to generate the format result. - The input TextWriter. - The input formatter. - The arguments of the formatter. - - - bprintf, but call the given 'final' function to generate the result. - See kprintf. - The function called after formatting to generate the format result. - The input StringBuilder. - The input formatter. - The arguments of the formatter. - - - Print to a string via an internal string buffer and return - the result as a string. Helper printers must return strings. - The input formatter. - The formatted string. - - - Formatted printing to stdout, adding a newline. - The input formatter. - The return type and arguments of the formatter. - - - Formatted printing to stdout - The input formatter. - The return type and arguments of the formatter. - - - Formatted printing to stderr, adding a newline - The input formatter. - The return type and arguments of the formatter. - - - Formatted printing to stderr - The input formatter. - The return type and arguments of the formatter. - - - Print to a text writer, adding a newline - The TextWriter to print to. - The input formatter. - The return type and arguments of the formatter. - - - Print to a text writer. - The TextWriter to print to. - The input formatter. - The return type and arguments of the formatter. - - - Print to a System.Text.StringBuilder - The StringBuilder to print to. - The input formatter. - The return type and arguments of the formatter. - - - Extensible printf-style formatting for numbers and other datatypes - - Format specifications are strings with "%" markers indicating format - placeholders. Format placeholders consist of: - - %[flags][width][.precision][type] - - where the type is interpreted as follows: - - %b: bool, formatted as "true" or "false" - %s: string, formatted as its unescaped contents - %c: character literal - %d, %i: any basic integer type formatted as a decimal integer, signed if the basic integer type is signed. - %u: any basic integer type formatted as an unsigned decimal integer - %x, %X, %o: any basic integer type formatted as an unsigned hexadecimal - (a-f)/Hexadecimal (A-F)/Octal integer - - %e, %E, %f, %F, %g, %G: - any basic floating point type (float,float32) formatted - using a C-style floating point format specifications, i.e - - %e, %E: Signed value having the form [-]d.dddde[sign]ddd where - d is a single decimal digit, dddd is one or more decimal - digits, ddd is exactly three decimal digits, and sign - is + or - - - %f: Signed value having the form [-]dddd.dddd, where dddd is one - or more decimal digits. The number of digits before the - decimal point depends on the magnitude of the number, and - the number of digits after the decimal point depends on - the requested precision. - - %g, %G: Signed value printed in f or e format, whichever is - more compact for the given value and precision. - - - %M: System.Decimal value - - %O: Any value, printed by boxing the object and using it's ToString method(s) - - %A: Any value, printed with the default layout settings - - %a: A general format specifier, requires two arguments: - (1) a function which accepts two arguments: - (a) a context parameter of the appropriate type for the - given formatting function (e.g. an #System.IO.TextWriter) - (b) a value to print - and which either outputs or returns appropriate text. - - (2) the particular value to print - - - %t: A general format specifier, requires one argument: - (1) a function which accepts a context parameter of the - appropriate type for the given formatting function (e.g. - an System.IO.TextWriter)and which either outputs or returns - appropriate text. - - Basic integer types are: - byte,sbyte,int16,uint16,int32,uint32,int64,uint64,nativeint,unativeint - Basic floating point types are: - float, float32 - - The optional width is an integer indicating the minimal width of the - result. For instance, %6d prints an integer, prefixing it with spaces - to fill at least 6 characters. If width is '*', then an extra integer - argument is taken to specify the corresponding width. - - any number - '*': - - Valid flags are: - - 0: add zeros instead of spaces to make up the required width - '-': left justify the result within the width specified - '+': add a '+' character if the number is positive (to match a '-' sign - for negatives) - ' ': add an extra space if the number is positive (to match a '-' - sign for negatives) - - The printf '#' flag is invalid and a compile-time error will be reported if it is used. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Returns the length of the string. - The input string. - The number of characters in the string. - - - Returns a string by concatenating count instances of str. - The number of copies of the input string will be copied. - The input string. - The concatenated string. - Thrown when count is negative. - - - Tests if any character of the string satisfies the given predicate. - The function to test each character of the string. - The input string. - True if any character returns true for the predicate and false otherwise. - - - Tests if all characters in the string satisfy the given predicate. - The function to test each character of the string. - The input string. - True if all characters return true for the predicate and false otherwise. - - - Builds a new string whose characters are the results of applying the function mapping - to each index from 0 to count-1 and concatenating the resulting - strings. - The number of strings to initialize. - The function to take an index and produce a string to - be concatenated with the others. - The constructed string. - Thrown when count is negative. - - - Builds a new string whose characters are the results of applying the function mapping - to each of the characters of the input string and concatenating the resulting - strings. - The function to produce a string from each character of the input string. - The input string. - The concatenated string. - - - Builds a new string whose characters are the results of applying the function mapping - to each character and index of the input string. - The function to apply to each character and index of the string. - The input string. - The resulting string. - - - Builds a new string whose characters are the results of applying the function mapping - to each of the characters of the input string. - The function to apply to the characters of the string. - The input string. - The resulting string. - - - Applies the function action to the index of each character in the string and the - character itself. - The function to apply to each character and index of the string. - The input string. - - - Applies the function action to each character in the string. - The function to be applied to each character of the string. - The input string. - - - Returns a new string made by concatenating the given strings - with separator sep, that is a1 + sep + ... + sep + aN. - The separator string to be inserted between the strings - of the input sequence. - The sequence of strings to be concatenated. - A new string consisting of the concatenated strings separated by - the separation string. - Thrown when strings is null. - - - Functional programming operators for string processing. Further string operations - are available via the member functions on strings and other functionality in - System.String - and System.Text.RegularExpressions types. - - - - The SI unit of catalytic activity - - - - - The SI unit of does equivalent - - - - - The SI unit of absorbed dose - - - - - The SI unit of activity referred to a radionuclide - - - - - The SI unit of illuminance - - - - - The SI unit of luminous flux - - - - - The SI unit of inductance - - - - - The SI unit of magnetic flux density - - - - - The SI unit of magnetic flux - - - - - The SI unit of electric conductance - - - - - The SI unit of electric resistance - - - - - The SI unit of capacitance - - - - - The SI unit of electric potential difference, electromotive force - - - - - The SI unit of electric charge, amount of electricity - - - - - The SI unit of power, radiant flux - - - - - The SI unit of energy, work, amount of heat - - - - - The SI unit of pressure, stress - - - - - The SI unit of force - - - - - The SI unit of frequency - - - - - The SI unit of luminous intensity - - - - - The SI unit of amount of substance - - - - - The SI unit of thermodynamic temperature - - - - - The SI unit of electric current - - - - - The SI unit of time - - - - - The SI unit of mass - - - - - The SI unit of length - - - - - The SI unit of length - - - - - A synonym for henry, the SI unit of inductance - - - - - A synonym for katal, the SI unit of catalytic activity - - - - - A synonym for sievert, the SI unit of does equivalent - - - - - A synonym for gray, the SI unit of absorbed dose - - - - - A synonym for becquerel, the SI unit of activity referred to a radionuclide - - - - - A synonym for lux, the SI unit of illuminance - - - - - A synonym for lumen, the SI unit of luminous flux - - - - - A synonym for tesla, the SI unit of magnetic flux density - - - - - A synonym for weber, the SI unit of magnetic flux - - - - - A synonym for UnitNames.ohm, the SI unit of electric resistance. - - - - - A synonym for siemens, the SI unit of electric conductance - - - - - A synonym for farad, the SI unit of capacitance - - - - - A synonym for volt, the SI unit of electric potential difference, electromotive force - - - - - A synonym for coulomb, the SI unit of electric charge, amount of electricity - - - - - A synonym for watt, the SI unit of power, radiant flux - - - - - A synonym for joule, the SI unit of energy, work, amount of heat - - - - - A synonym for pascal, the SI unit of pressure, stress - - - - - A synonym for newton, the SI unit of force - - - - - A synonym for hertz, the SI unit of frequency - - - - - A synonym for candela, the SI unit of luminous intensity - - - - - A synonym for mole, the SI unit of amount of substance - - - - - A synonym for kelvin, the SI unit of thermodynamic temperature - - - - - A synonym for ampere, the SI unit of electric current - - - - - A synonym for second, the SI unit of time - - - - - A synonym for kilogram, the SI unit of mass - - - - - A synonym for Metre, the SI unit of length - - - - - A method used to support the F# query syntax. Returns an empty sequence that has the specified type argument. - - - - - A method used to support the F# query syntax. Returns a sequence that contains the specified values. - - - - - A method used to support the F# query syntax. Returns a sequence of length one that contains the specified value. - - - - A query operator that selects those elements based on a specified predicate. - - - - A query operator that performs a subsequent ordering of the elements selected so far in descending order by the given nullable sorting key. - This operator may only be used immediately after a 'sortBy', 'sortByDescending', 'thenBy' or 'thenByDescending', or their nullable variants. - - - - A query operator that performs a subsequent ordering of the elements selected so far in ascending order by the given nullable sorting key. - This operator may only be used immediately after a 'sortBy', 'sortByDescending', 'thenBy' or 'thenByDescending', or their nullable variants. - - - - A query operator that performs a subsequent ordering of the elements selected so far in descending order by the given sorting key. - This operator may only be used immediately after a 'sortBy', 'sortByDescending', 'thenBy' or 'thenByDescending', or their nullable variants. - - - - A query operator that performs a subsequent ordering of the elements selected so far in ascending order by the given sorting key. - This operator may only be used immediately after a 'sortBy', 'sortByDescending', 'thenBy' or 'thenByDescending', or their nullable variants. - - - - A query operator that selects elements from a sequence as long as a specified condition is true, and then skips the remaining elements. - - - - A query operator that selects a specified number of contiguous elements from those selected so far. - - - - A query operator that selects a nullable value for each element selected so far and returns the sum of these values. - If any nullable does not have a value, it is ignored. - - - - A query operator that selects a value for each element selected so far and returns the sum of these values. - - - - - A method used to support the F# query syntax. Inputs to queries are implicitly wrapped by a call to one of the overloads of this method. - - - - - A method used to support the F# query syntax. Inputs to queries are implicitly wrapped by a call to one of the overloads of this method. - - - - A query operator that sorts the elements selected so far in descending order by the given nullable sorting key. - - - - A query operator that sorts the elements selected so far in ascending order by the given nullable sorting key. - - - - A query operator that sorts the elements selected so far in descending order by the given sorting key. - - - - A query operator that sorts the elements selected so far in ascending order by the given sorting key. - - - - A query operator that bypasses elements in a sequence as long as a specified condition is true and then selects the remaining elements. - - - - A query operator that bypasses a specified number of the elements selected so far and selects the remaining elements. - - - - A query operator that projects each of the elements selected so far. - - - - - - - - - - - - - - A method used to support the F# query syntax. Runs the given quotation as a query using LINQ IQueryable rules. - - - - - A method used to support the F# query syntax. Indicates that the query should be passed as a quotation to the Run method. - - - - A query operator that selects the element at a specified index amongst those selected so far. - - - - A query operator that selects a nullable value for each element selected so far and returns the minimum of these values. - If any nullable does not have a value, it is ignored. - - - - A query operator that selects a value for each element selected so far and returns the minimum resulting value. - - - - A query operator that selects a nullable value for each element selected so far and returns the maximum of these values. - If any nullable does not have a value, it is ignored. - - - - A query operator that selects a value for each element selected so far and returns the maximum resulting value. - - - - A query operator that correlates two sets of selected values based on matching keys and groups the results. - If any group is empty, a group with a single default value is used instead. - Normal usage is 'leftOuterJoin y in elements2 on (key1 = key2) into group'. - - - - A query operator that selects the last element of those selected so far, or a default value if no element is found. - - - - A query operator that selects the last element of those selected so far. - - - - A query operator that correlates two sets of selected values based on matching keys. - Normal usage is 'join y in elements2 on (key1 = key2)'. - - - - A query operator that selects the first element of those selected so far, or a default value if the sequence contains no elements. - - - - A query operator that selects the first element from those selected so far. - - - - A query operator that selects a value for each element selected so far and groups the elements by the given key. - - - - A query operator that correlates two sets of selected values based on matching keys and groups the results. - Normal usage is 'groupJoin y in elements2 on (key1 = key2) into group'. - - - - A query operator that groups the elements selected so far according to a specified key selector. - - - - - A method used to support the F# query syntax. Projects each element of a sequence to another sequence and combines the resulting sequences into one sequence. - - - - A query operator that selects the first element selected so far that satisfies a specified condition. - - - - A query operator that determines whether any element selected so far satisfies a condition. - - - - A query operator that selects the single, specific element of those selected so far, or a default value if that element is not found. - - - - A query operator that selects the single, specific element selected so far - - - - A query operator that selects distinct elements from the elements selected so far. - - - - A query operator that returns the number of selected elements. - - - - A query operator that determines whether the selected elements contains a specified element. - - - - A query operator that selects a nullable value for each element selected so far and returns the average of these values. - If any nullable does not have a value, it is ignored. - - - - A query operator that selects a value for each element selected so far and returns the average of these values. - - - - A query operator that determines whether all elements selected so far satisfies a condition. - - - - Create an instance of this builder. Use 'query { ... }' to use the query syntax. - - - - The type used to support the F# query syntax. Use 'query { ... }' to use the query syntax. - - - - - A property used to support the F# query syntax. - - - - - A method used to support the F# query syntax. - - - - - A partial input or result in an F# query. This type is used to support the F# query syntax. - - - - Converts the argument to character. Numeric inputs are converted according to the UTF-16 - encoding for characters. The operation requires an appropriate static conversion method on the input type. - The input value. - The converted char. - - - Converts the argument to System.Decimal using a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted decimal. - - - Converts the argument to unsigned native integer using a direct conversion for all - primitive numeric types. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted unativeint - - - Converts the argument to signed native integer. This is a direct conversion for all - primitive numeric types. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted nativeint - - - Converts the argument to 64-bit float. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted float - - - Converts the argument to 32-bit float. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted float32 - - - Converts the argument to unsigned 64-bit integer. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint64 - - - Converts the argument to signed 64-bit integer. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int64 - - - Converts the argument to unsigned 32-bit integer. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint32 - - - Converts the argument to signed 32-bit integer. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int32 - - - Converts the argument to a particular enum type. - The input value. - The converted enum type. - - - Converts the argument to signed 32-bit integer. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int - - - Converts the argument to unsigned 16-bit integer. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint16 - - - Converts the argument to signed 16-bit integer. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int16 - - - Converts the argument to signed byte. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted sbyte - - - Converts the argument to byte. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted byte - - - - Functions for converting nullable values - - - - - The division operator where a nullable value appears on both left and right sides - - - - - The division operator where a nullable value appears on the right - - - - - The division operator where a nullable value appears on the left - - - - - The modulus operator where a nullable value appears on both left and right sides - - - - - The modulus operator where a nullable value appears on the right - - - - - The modulus operator where a nullable value appears on the left - - - - - The multiplication operator where a nullable value appears on both left and right sides - - - - - The multiplication operator where a nullable value appears on the right - - - - - The multiplication operator where a nullable value appears on the left - - - - - The subtraction operator where a nullable value appears on both left and right sides - - - - - The subtraction operator where a nullable value appears on the right - - - - - The subtraction operator where a nullable value appears on the left - - - - - The addition operator where a nullable value appears on both left and right sides - - - - - The addition operator where a nullable value appears on the right - - - - - The addition operator where a nullable value appears on the left - - - - - The '<>' operator where a nullable value appears on both left and right sides - - - - - The '=' operator where a nullable value appears on both left and right sides - - - - - The '<' operator where a nullable value appears on both left and right sides - - - - - The '<=' operator where a nullable value appears on both left and right sides - - - - - The '>' operator where a nullable value appears on both left and right sides - - - - - The '>=' operator where a nullable value appears on both left and right sides - - - - - The '<>' operator where a nullable value appears on the right - - - - - The '=' operator where a nullable value appears on the right - - - - - The '<' operator where a nullable value appears on the right - - - - - The '<=' operator where a nullable value appears on the right - - - - - The '>' operator where a nullable value appears on the right - - - - - The '>=' operator where a nullable value appears on the right - - - - - The '<>' operator where a nullable value appears on the left - - - - - The '=' operator where a nullable value appears on the left - - - - - The '<' operator where a nullable value appears on the left - - - - - The '<=' operator where a nullable value appears on the left - - - - - The '>' operator where a nullable value appears on the left - - - - - The '>=' operator where a nullable value appears on the left - - - - - Operators for working with nullable values - - - - - A method used to support the F# query syntax. Runs the given quotation as a query using LINQ IEnumerable rules. - - - - - - - - A method used to support the F# query syntax. Runs the given quotation as a query using LINQ rules. - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - - - - A type used to reconstruct a grouping after applying a mutable->immutable mapping transformation - on a result of a query. - - - - - - - - - - - - - - - - - - - - The generic MethodInfo for Select function - Describes how we got from productions of immutable objects to productions of anonymous objects, with enough information - that we can invert the process in final query results. - - - - - - - - Given the expression part of a "yield" or "select" which produces a result in terms of immutable tuples or immutable records, - generate an equivalent expression yielding anonymous objects. Also return the conversion for the immutable-to-mutable correspondence - so we can reverse this later. - - - - - Simplify gets of tuples and gets of record fields. - - - - - Cleanup the use of property-set object constructions in leaf expressions that form parts of F# queries. - - - - - - - - Given an type involving immutable tuples and records, logically corresponding to the type produced at a - "yield" or "select", convert it to a type involving anonymous objects according to the conversion data. - - - - - - - - - - - - - - - - - - - - Recognize anonymous type construction written using 'new AnonymousObject(<e1>, <e2>, ...)' - - - - - - - - - - - - - - - - - Recognize object construction written using 'new O(Prop1 = <e>, Prop2 = <e>, ...)' - - - - - Tests whether a list consists only of assignments of properties of the - given variable, null values (ignored) and ends by returning the given variable - (pattern returns only property assignments) - - - - - Recognize sequential series written as (... ((<e>; <e>); <e>); ...) - - - - - - - - - - - - - - - - - - - - - - - A runtime helper used to evaluate nested quotation literals. - - - - - Evaluates a subset of F# quotations by first converting to a LINQ expression, for the subset of LINQ expressions represented by the - expression syntax in the C# language. - - - - - Converts a subset of F# quotations to a LINQ expression, for the subset of LINQ expressions represented by the - expression syntax in the C# language. - - - - - Converts a subset of F# quotations to a LINQ expression, for the subset of LINQ expressions represented by the - expression syntax in the C# language. - - - - - When used in a quotation, this function indicates a specific conversion - should be performed when converting the quotation to a LINQ expression. - - This function should not be called directly. - - - - - When used in a quotation, this function indicates a specific conversion - should be performed when converting the quotation to a LINQ expression. - - This function should not be called directly. - - - - - When used in a quotation, this function indicates a specific conversion - should be performed when converting the quotation to a LINQ expression. - - This function should not be called directly. - - - - - - - Allocates a region of memory on the stack. - The number of objects of type T to allocate. - A typed pointer to the allocated memory. - - - Assigns the value into the memory location referenced by the typed native - pointer computed by adding index * sizeof<'T> to the given input pointer. - The input pointer. - The index by which to offset the pointer. - The value to assign. - - - Assigns the value into the memory location referenced by the given typed native pointer. - The input pointer. - The value to assign. - - - Dereferences the given typed native pointer. - The input pointer. - The value at the pointer address. - - - Dereferences the typed native pointer computed by adding index * sizeof<'T> to the - given input pointer. - The input pointer. - The index by which to offset the pointer. - The value at the pointer address. - - - Returns a typed native pointer by adding index * sizeof<'T> to the - given input pointer. - The input pointer. - The index by which to offset the pointer. - A typed pointer. - - - Returns a machine address for a given typed native pointer. - The input pointer. - The machine address. - - - Returns a typed native pointer for a given machine address. - The pointer address. - A typed pointer. - - - Contains operations on native pointers. Use of these operators may - result in the generation of unverifiable code. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Gets the raw expression associated with this type-carrying expression - - - Type-carrying quoted expressions. Expressions are generated either - by quotations in source text or programatically - - - Returns type of an expression. - - - Returns the custom attributes of an expression. - - - Builds an expression that represents a while loop - The predicate to control the loop iteration. - The body of the while loop. - The resulting expression. - - - Builds an expression that represents setting a mutable variable - The input variable. - The value to set. - The resulting expression. - - - Builds an expression that represents a variable - The input variable. - The resulting expression. - - - Builds an expression that represents a constant value - The typed value. - The resulting expression. - - - Builds an expression that represents a constant value of a particular type - The untyped object. - The type of the object. - The resulting expression. - - - Builds an expression that represents a test of a value is of a particular union case - The expression to test. - The description of the union case. - The resulting expression. - - - Builds an expression that represents a type test. - The expression to test. - The target type. - The resulting expression. - - - Builds an expression that represents getting a field of a tuple - The input tuple. - The index of the tuple element to get. - The resulting expression. - - - Builds an expression that represents a try/with construct for exception filtering and catching. - The body of the try expression. - - - The variable to bind to a caught exception. - The expression evaluated when an exception is caught. - The resulting expression. - - - Try and find a stored reflection definition for the given method. Stored reflection - definitions are added to an F# assembly through the use of the [<ReflectedDefinition>] attribute. - The description of the method to find. - The reflection definition or None if a match could not be found. - - - Builds an expression that represents a try/finally construct - The body of the try expression. - The final part of the expression to be evaluated. - The resulting expression. - - - Format the expression as a string - Indicates if method, property, constructor and type objects should be printed in detail. If false, these are abbreviated to their name. - The formatted string. - - - Substitutes through the given expression using the given functions - to map variables to new values. The functions must give consistent results - at each application. Variable renaming may occur on the target expression - if variable capture occurs. - The function to map variables into expressions. - The expression with the given substitutions. - - - Builds an expression that represents the sequential execution of one expression followed by another - The first expression. - The second expression. - The resulting expression. - - - Permits interactive environments such as F# Interactive - to explicitly register new pickled resources that represent persisted - top level definitions. The string indicates a unique name for the resources - being added. The format for the bytes is the encoding generated by the F# compiler. - The assembly associated with the resource. - The unique name for the resources being added. - The serialized resource to register with the environment. - - - Builds an expression that represents a nested quotation literal - The expression being quoted. - The resulting expression. - - - Builds an expression that represents writing to a static property - The description of the property. - The value to set. - List of indices for the property if it is an indexed property. - The resulting expression. - - - Builds an expression that represents writing to a property of an object - The input object. - The description of the property. - The value to set. - List of indices for the property if it is an indexed property. - The resulting expression. - - - Builds an expression that represents reading a static property - The description of the property. - List of indices for the property if it is an indexed property. - The resulting expression. - - - Builds an expression that represents reading a property of an object - The input object. - The description of the property. - List of indices for the property if it is an indexed property. - The resulting expression. - - - Builds an expression that represents the creation of a union case value - The description of the union case. - The list of arguments for the case. - The resulting expression. - - - Builds an expression that represents the creation of an F# tuple value - The list of elements of the tuple. - The resulting expression. - - - Builds record-construction expressions - The type of record. - The list of elements of the record. - The resulting expression. - - - Builds an expression that represents the invocation of an object constructor - The description of the constructor. - The list of arguments to the constructor. - The resulting expression. - - - Builds an expression that represents the creation of a delegate value for the given type - The type of delegate. - The parameters for the delegate. - The body of the function. - The resulting expression. - - - Builds an expression that represents the creation of an array value initialized with the given elements - The type for the elements of the array. - The list of elements of the array. - The resulting expression. - - - Builds recursives expressions associated with 'let rec' constructs - The list of bindings for the let expression. - The sub-expression where the bindings are in scope. - The resulting expression. - - - Builds expressions associated with 'let' constructs - The variable in the let expression. - The expression bound to the variable. - The sub-expression where the binding is in scope. - The resulting expression. - - - Builds an expression that represents the constrution of an F# function value - The parameter to the function. - The body of the function. - The resulting expression. - - - Builds 'if ... then ... else' expressions. - The condition expression. - The then sub-expression. - The else sub-expression. - The resulting expression. - - - Fetches or creates a new variable with the given name and type from a global pool of shared variables - indexed by name and type. The type is given by the expicit or inferred type parameter - The variable name. - The created of fetched typed global variable. - - - Gets the free expression variables of an expression as a list. - A sequence of the free variables in the expression. - - - Builds a 'for i = ... to ... do ...' expression that represent loops over integer ranges - The sub-expression declaring the loop variable. - The sub-expression setting the initial value of the loop variable. - The sub-expression declaring the final value of the loop variable. - The sub-expression representing the body of the loop. - The resulting expression. - - - Builds an expression that represents writing to a field of an object - The input object. - The description of the field to write to. - The value to set to the field. - The resulting expression. - - - Builds an expression that represents writing to a static field - The description of the field to write to. - The value to the set to the field. - The resulting expression. - - - Builds an expression that represents the access of a field of an object - The input object. - The description of the field to access. - The resulting expression. - - - Builds an expression that represents the access of a static field - The description of the field to access. - The resulting expression. - - - - - - This function is called automatically when quotation syntax (<@ @>) and related typed-expression - quotations are used. The bytes are a pickled binary representation of an unlinked form of the quoted expression, - and the System.Type argument is any type in the assembly where the quoted - expression occurs, i.e. it helps scope the interpretation of the cross-assembly - references in the bytes. - A type in the assembly where the quotation occurs. - The list of spliced types. - The list of spliced expressions. - The serialized form of the quoted expression. - The resulting expression. - - - Builds an expression that represents the invocation of a default object constructor - The type on which the constructor is invoked. - The resulting expression. - - - Builds an expression that represents the coercion of an expression to a type - The expression to coerce. - The target type. - The resulting expression. - - - Returns a new typed expression given an underlying runtime-typed expression. - A type annotation is usually required to use this function, and - using an incorrect type annotation may result in a later runtime exception. - The expression to cast. - The resulting typed expression. - - - Builds an expression that represents a call to an instance method associated with an object - The input object. - The description of the method to call. - The list of arguments to the method. - The resulting expression. - - - Builds an expression that represents a call to an static method or module-bound function - The MethodInfo describing the method to call. - The list of arguments to the method. - The resulting expression. - - - Builds an expression that represents the application of a first class function value to multiple arguments - The function to apply. - The list of lists of arguments to the function. - The resulting expression. - - - Builds an expression that represents the application of a first class function value to a single argument. - The function to apply. - The argument to the function. - The resulting expression. - - - Builds an expression that represents setting the value held at a particular address. - The target expression. - The value to set at the address. - The resulting expression. - - - Builds an expression that represents getting the address of a value. - The target expression. - The resulting expression. - - - Quoted expressions annotated with System.Type values. - - - The type associated with the variable - - - The declared name of the variable - - - Indicates if the variable represents a mutable storage location - - - Fetches or create a new variable with the given name and type from a global pool of shared variables - indexed by name and type - The name of the variable. - The type associated with the variable. - The retrieved or created variable. - - - Creates a new variable with the given name, type and mutability - The declared name of the variable. - The type associated with the variable. - Indicates if the variable represents a mutable storage location. Default is false. - The created variable. - - - Information at the binding site of a variable - - - Re-build combination expressions. The first parameter should be an object - returned by the ShapeCombination case of the active pattern in this module. - The input shape. - The list of arguments. - The rebuilt expression. - - - An active pattern that performs a complete decomposition viewing the expression tree as a binding structure - The input expression. - The decomposed Var, Lambda, or ConstApp. - - - Active patterns for traversing, visiting, rebuilding and tranforming expressions in a generic way - - - An active pattern to recognize property setters that have an associated ReflectedDefinition - The description of the property. - The expression of the method definition if found, or None. - - - An active pattern to recognize property getters or values in modules that have an associated ReflectedDefinition - The description of the property. - The expression of the method definition if found, or None. - - - An active pattern to recognize methods that have an associated ReflectedDefinition - The description of the method. - The expression of the method definition if found, or None. - - - A parameterized active pattern to recognize calls to a specified function or method. - The returned elements are the optional target object (present if the target is an - instance method), the generic type instantation (non-empty if the target is a generic - instantiation), and the arguments to the function or method. - The input template expression to specify the method to call. - The optional target object (present if the target is an - instance method), the generic type instantation (non-empty if the target is a generic - instantiation), and the arguments to the function or method. - - - An active pattern to recognize constant unsigned int64 expressions - The input expression to match against. - uint64 option - - - An active pattern to recognize constant int64 expressions - The input expression to match against. - int64 option - - - An active pattern to recognize constant unsigned int32 expressions - The input expression to match against. - uint32 option - - - An active pattern to recognize constant int32 expressions - The input expression to match against. - int32 option - - - An active pattern to recognize constant unsigned int16 expressions - The input expression to match against. - uint16 option - - - An active pattern to recognize constant int16 expressions - The input expression to match against. - int16 option - - - An active pattern to recognize constant byte expressions - The input expression to match against. - byte option - - - An active pattern to recognize constant signed byte expressions - The input expression to match against. - sbyte option - - - An active pattern to recognize constant unicode character expressions - The input expression to match against. - char option - - - An active pattern to recognize constant 64-bit floating point number expressions - The input expression to match against. - float option - - - An active pattern to recognize constant 32-bit floating point number expressions - The input expression to match against. - float32 option - - - An active pattern to recognize constant string expressions - The input expression to match against. - string option - - - An active pattern to recognize constant boolean expressions - The input expression to match against. - bool option - - - An active pattern to recognize () constant expressions - The input expression to match against. - unit option - - - An active pattern to recognize expressions of the form a || b - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions of the form a && b - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions that represent the application of a (possibly curried or tupled) first class function value - The input expression to match against. - (Expr * Expr list list) option - - - An active pattern to recognize expressions that represent a (possibly curried or tupled) first class function value - The input expression to match against. - (Var list list * Expr) option - - - Contains a set of derived F# active patterns to analyze F# expression objects - - - An active pattern to recognize expressions that represent setting a mutable variable - The input expression to match against. - (Var * Expr) option - - - An active pattern to recognize expressions that represent a variable - The input expression to match against. - Var option - - - An active pattern to recognize expressions that represent a constant value - The input expression to match against. - (obj * Type) option - - - An active pattern to recognize expressions that represent a test if a value is of a particular union case - The input expression to match against. - (Expr * UnionCaseInfo) option - - - An active pattern to recognize expressions that represent a dynamic type test - The input expression to match against. - (Expr * Type) option - - - An active pattern to recognize expressions that represent getting a tuple field - The input expression to match against. - (Expr * int) option - - - An active pattern to recognize expressions that represent a try/finally construct - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions that represent a try/with construct for exception filtering and catching - The input expression to match against. - (Expr * Var * Expr * Var * Expr) option - - - An active pattern to recognize expressions that represent sequential exeuction of one expression followed by another - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions that represent a nested quotation literal - The input expression to match against. - Expr option - - - An active pattern to recognize expressions that represent setting a static or instance property, or a non-function value declared in a module - The input expression to match against. - (Expr option * PropertyInfo * Expr list * Expr) option - - - An active pattern to recognize expressions that represent the read of a static or instance property, or a non-function value declared in a module - The input expression to match against. - (Expr option * PropertyInfo * Expr list) option - - - An active pattern to recognize expressions that represent construction of tuple values - The input expression to match against. - (Expr list) option - - - An active pattern to recognize expressions that represent construction of particular union case values - The input expression to match against. - (UnionCaseInfo * Expr list) option - - - An active pattern to recognize expressions that represent construction of record values - The input expression to match against. - (Type * Expr list) option - - - An active pattern to recognize expressions that represent invocation of object constructors - The input expression to match against. - (ConstructorInfo * Expr list) option - - - An active pattern to recognize expressions that represent construction of delegate values - The input expression to match against. - (Type * Var list * Expr) option - - - An active pattern to recognize expressions that represent invocations of a default constructor of a struct - The input expression to match against. - Type option - - - An active pattern to recognize expressions that represent the construction of arrays - The input expression to match against. - (Type * Expr list) option - - - An active pattern to recognize expressions that represent recursive let bindings of one or more variables - The input expression to match against. - ((Var * Expr) list * Expr) option - - - An active pattern to recognize expressions that represent let bindings - The input expression to match against. - (Var * Expr * Expr) option - - - An active pattern to recognize expressions that represent first class function values - The input expression to match against. - (Var * Expr) option - - - An active pattern to recognize expressions that represent conditionals - The input expression to match against. - (Expr * Expr * Expr) option - - - An active pattern to recognize expressions that represent while loops - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions that represent loops over integer ranges - The input expression to match against. - (Var * Expr * Expr * Expr) option - - - An active pattern to recognize expressions that represent setting a static or instance field - The input expression to match against. - (Expr option * FieldInfo * Expr) option - - - An active pattern to recognize expressions that represent getting a static or instance field - The input expression to match against. - (Expr option * FieldInfo) option - - - An active pattern to recognize expressions that represent coercions from one type to another - The input expression to match against. - (Expr * Type) option - - - An active pattern to recognize expressions that represent calls to static and instance methods, and functions defined in modules - The input expression to match against. - (Expr option * MethodInfo * Expr list) option - - - An active pattern to recognize expressions that represent applications of first class function values - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions that represent setting the value held at an address - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions that represent getting the address of a value - The input expression to match against. - Expr option - - - Contains a set of primitive F# active patterns to analyze F# expression objects - - - Returns a System.Type representing an F# tuple type with the given element types - An array of types for the tuple elements. - The type representing the tuple containing the input elements. - - - Returns a System.Type representing the F# function type with the given domain and range - The input type of the function. - The output type of the function. - The function type with the given domain and range. - - - Returns true if the typ is a representation of an F# union type or the runtime type of a value of that type - The type to check. - Optional binding flags. - True if the type check succeeds. - - - Return true if the typ is a representation of an F# tuple type - The type to check. - True if the type check succeeds. - - - Return true if the typ is a representation of an F# record type - The type to check. - Optional binding flags. - True if the type check succeeds. - - - Return true if the typ is a System.Type value corresponding to the compiled form of an F# module - The type to check. - True if the type check succeeds. - - - Return true if the typ is a representation of an F# function type or the runtime type of a closure implementing an F# function type - The type to check. - True if the type check succeeds. - - - Returns true if the typ is a representation of an F# exception declaration - The type to check. - Optional binding flags. - True if the type check is an F# exception. - - - Gets the cases of a union type. - - Assumes the given type is a union type. If not, ArgumentException is raised during pre-computation. - The input union type. - Optional binding flags. - Thrown when the input type is not a union type. - An array of descriptions of the cases of the given union type. - - - Gets the tuple elements from the representation of an F# tuple type. - The input tuple type. - An array of the types contained in the given tuple type. - - - Reads all the fields from a record value, in declaration order - - Assumes the given input is a record value. If not, ArgumentException is raised. - The input record type. - Optional binding flags. - An array of descriptions of the properties of the record type. - - - Gets the domain and range types from an F# function type or from the runtime type of a closure implementing an F# type - The input function type. - A tuple of the domain and range types of the input function. - - - Reads all the fields from an F# exception declaration, in declaration order - - Assumes exceptionType is an exception representation type. If not, ArgumentException is raised. - The exception type to read. - Optional binding flags. - Thrown if the given type is not an exception. - An array containing the PropertyInfo of each field in the exception. - - - Contains operations associated with constructing and analyzing F# types such as records, unions and tuples - - - Assumes the given type is a union type. - If not, ArgumentException is raised during pre-computation. - - Using the computed function is more efficient than calling GetUnionCase - because the path executed by the computed function is optimized given the knowledge that it will be - used to read values of the given type. - The type of union to optimize reading. - Optional binding flags. - An optimized function to read the tags of the given union type. - - - Precompute a property or static method for reading an integer representing the case tag of a union type. - The type of union to read. - Optional binding flags. - The description of the union case reader. - - - Precomputes a function for reading all the fields for a particular discriminator case of a union type - - Using the computed function will typically be faster than executing a corresponding call to GetFields - The description of the union case to read. - Optional binding flags. - A function to for reading the fields of the given union case. - - - A method that constructs objects of the given case - The description of the union case. - Optional binding flags. - The description of the constructor of the given union case. - - - Precomputes a function for constructing a discriminated union value for a particular union case. - The description of the union case. - Optional binding flags. - A function for constructing values of the given union case. - - - Precomputes a function for reading the values of a particular tuple type - - Assumes the given type is a TupleType. - If not, ArgumentException is raised during pre-computation. - The tuple type to read. - Thrown when the given type is not a tuple type. - A function to read values of the given tuple type. - - - Gets information that indicates how to read a field of a tuple - The input tuple type. - The index of the tuple element to describe. - The description of the tuple element and an optional type and index if the tuple is big. - - - Gets a method that constructs objects of the given tuple type. - For small tuples, no additional type will be returned. - - For large tuples, an additional type is returned indicating that - a nested encoding has been used for the tuple type. In this case - the suffix portion of the tuple type has the given type and an - object of this type must be created and passed as the last argument - to the ConstructorInfo. A recursive call to PreComputeTupleConstructorInfo - can be used to determine the constructor for that the suffix type. - The input tuple type. - The description of the tuple type constructor and an optional extra type - for large tuples. - - - Precomputes a function for reading the values of a particular tuple type - - Assumes the given type is a TupleType. - If not, ArgumentException is raised during pre-computation. - The type of tuple to read. - Thrown when the given type is not a tuple type. - A function to read a particular tuple type. - - - Precompute a function for reading all the fields from a record. The fields are returned in the - same order as the fields reported by a call to Microsoft.FSharp.Reflection.Type.GetInfo for - this type. - - Assumes the given type is a RecordType. - If not, ArgumentException is raised during pre-computation. - - Using the computed function will typically be faster than executing a corresponding call to Value.GetInfo - because the path executed by the computed function is optimized given the knowledge that it will be - used to read values of the given type. - The type of record to read. - Optional binding flags. - Thrown when the input type is not a record type. - An optimized reader for the given record type. - - - Precompute a function for reading a particular field from a record. - Assumes the given type is a RecordType with a field of the given name. - If not, ArgumentException is raised during pre-computation. - - Using the computed function will typically be faster than executing a corresponding call to Value.GetInfo - because the path executed by the computed function is optimized given the knowledge that it will be - used to read values of the given type. - The PropertyInfo of the field to read. - Thrown when the input type is not a record type. - A function to read the specified field from the record. - - - Get a ConstructorInfo for a record type - The record type. - Optional binding flags. - A ConstructorInfo for the given record type. - - - Precompute a function for constructing a record value. - - Assumes the given type is a RecordType. - If not, ArgumentException is raised during pre-computation. - The type of record to construct. - Optional binding flags. - Thrown when the input type is not a record type. - A function to construct records of the given type. - - - Create a union case value. - The description of the union case to create. - The array of arguments to construct the given case. - Optional binding flags. - The constructed union case. - - - Creates an instance of a tuple type - - Assumes at least one element is given. If not, ArgumentException is raised. - The array of tuple fields. - The tuple type to create. - Thrown if no elements are given. - An instance of the tuple type with the given elements. - - - Creates an instance of a record type. - - Assumes the given input is a record type. - The type of record to make. - The array of values to initialize the record. - Optional binding flags for the record. - Thrown when the input type is not a record type. - The created record. - - - Builds a typed function from object from a dynamic function implementation - The function type of the implementation. - The untyped lambda of the function implementation. - A typed function from the given dynamic implementation. - - - Identify the union case and its fields for an object - - Assumes the given input is a union case value. If not, ArgumentException is raised. - - If the type is not given, then the runtime type of the input object is used to identify the - relevant union type. The type should always be given if the input object may be null. For example, - option values may be represented using the 'null'. - The input union case. - The union type containing the value. - Optional binding flags. - Thrown when the input type is not a union case value. - The description of the union case and its fields. - - - Reads all fields from a tuple. - - Assumes the given input is a tuple value. If not, ArgumentException is raised. - The input tuple. - Thrown when the input is not a tuple value. - An array of the fields from the given tuple. - - - Reads a field from a tuple value. - - Assumes the given input is a tuple value. If not, ArgumentException is raised. - The input tuple. - The index of the field to read. - The value of the field. - - - Reads all the fields from a record value. - - Assumes the given input is a record value. If not, ArgumentException is raised. - The record object. - Optional binding flags for the record. - Thrown when the input type is not a record type. - The array of fields from the record. - - - Reads a field from a record value. - - Assumes the given input is a record value. If not, ArgumentException is raised. - The record object. - The PropertyInfo describing the field to read. - Thrown when the input type is not a record type. - The field from the record. - - - Reads all the fields from a value built using an instance of an F# exception declaration - - Assumes the given input is an F# exception value. If not, ArgumentException is raised. - The exception instance. - Optional binding flags. - Thrown when the input type is not an F# exception. - The fields from the given exception. - - - Contains operations associated with constructing and analyzing values associated with F# types - such as records, unions and tuples. - - - The integer tag for the case. - - - The name of the case. - - - The type in which the case occurs. - - - The fields associated with the case, represented by a PropertyInfo. - The fields associated with the case. - - - Returns the custom attributes data associated with the case. - An list of custom attribute data items. - - - Returns the custom attributes associated with the case matching the given attribute type. - The type of attributes to return. - An array of custom attributes. - - - Returns the custom attributes associated with the case. - An array of custom attributes. - - - Represents a case of a discriminated union type - - - Returns true if the typ is a representation of an F# exception declaration - The type to check. - Optional flag that denotes accessibility of the private representation. - True if the type check is an F# exception. - - - Reads all the fields from an F# exception declaration, in declaration order - - Assumes exceptionType is an exception representation type. If not, ArgumentException is raised. - The exception type to read. - Optional flag that denotes accessibility of the private representation. - Thrown if the given type is not an exception. - An array containing the PropertyInfo of each field in the exception. - - - Returns true if the typ is a representation of an F# union type or the runtime type of a value of that type - The type to check. - Optional flag that denotes accessibility of the private representation. - True if the type check succeeds. - - - Return true if the typ is a representation of an F# record type - The type to check. - Optional flag that denotes accessibility of the private representation. - True if the type check succeeds. - - - Gets the cases of a union type. - - Assumes the given type is a union type. If not, ArgumentException is raised during pre-computation. - The input union type. - Optional flag that denotes accessibility of the private representation. - Thrown when the input type is not a union type. - An array of descriptions of the cases of the given union type. - - - Reads all the fields from a record value, in declaration order - - Assumes the given input is a record value. If not, ArgumentException is raised. - The input record type. - Optional flag that denotes accessibility of the private representation. - An array of descriptions of the properties of the record type. - - - Reads all the fields from a value built using an instance of an F# exception declaration - - Assumes the given input is an F# exception value. If not, ArgumentException is raised. - The exception instance. - Optional flag that denotes accessibility of the private representation. - Thrown when the input type is not an F# exception. - The fields from the given exception. - - - A method that constructs objects of the given case - The description of the union case. - Optional flag that denotes accessibility of the private representation. - The description of the constructor of the given union case. - - - Precomputes a function for constructing a discriminated union value for a particular union case. - The description of the union case. - Optional flag that denotes accessibility of the private representation. - A function for constructing values of the given union case. - - - Precomputes a function for reading all the fields for a particular discriminator case of a union type - - Using the computed function will typically be faster than executing a corresponding call to GetFields - The description of the union case to read. - Optional flag that denotes accessibility of the private representation. - A function to for reading the fields of the given union case. - - - Precompute a property or static method for reading an integer representing the case tag of a union type. - The type of union to read. - Optional flag that denotes accessibility of the private representation. - The description of the union case reader. - - - Assumes the given type is a union type. - If not, ArgumentException is raised during pre-computation. - - Using the computed function is more efficient than calling GetUnionCase - because the path executed by the computed function is optimized given the knowledge that it will be - used to read values of the given type. - The type of union to optimize reading. - Optional flag that denotes accessibility of the private representation. - An optimized function to read the tags of the given union type. - - - Identify the union case and its fields for an object - - Assumes the given input is a union case value. If not, ArgumentException is raised. - - If the type is not given, then the runtime type of the input object is used to identify the - relevant union type. The type should always be given if the input object may be null. For example, - option values may be represented using the 'null'. - The input union case. - The union type containing the value. - Optional flag that denotes accessibility of the private representation. - Thrown when the input type is not a union case value. - The description of the union case and its fields. - - - Create a union case value. - The description of the union case to create. - The array of arguments to construct the given case. - Optional flag that denotes accessibility of the private representation. - The constructed union case. - - - Get a ConstructorInfo for a record type - The record type. - Optional flag that denotes accessibility of the private representation. - A ConstructorInfo for the given record type. - - - Precompute a function for constructing a record value. - - Assumes the given type is a RecordType. - If not, ArgumentException is raised during pre-computation. - The type of record to construct. - Optional flag that denotes accessibility of the private representation. - Thrown when the input type is not a record type. - A function to construct records of the given type. - - - Precompute a function for reading all the fields from a record. The fields are returned in the - same order as the fields reported by a call to Microsoft.FSharp.Reflection.Type.GetInfo for - this type. - - Assumes the given type is a RecordType. - If not, ArgumentException is raised during pre-computation. - - Using the computed function will typically be faster than executing a corresponding call to Value.GetInfo - because the path executed by the computed function is optimized given the knowledge that it will be - used to read values of the given type. - The type of record to read. - Optional flag that denotes accessibility of the private representation. - Thrown when the input type is not a record type. - An optimized reader for the given record type. - - - Reads all the fields from a record value. - - Assumes the given input is a record value. If not, ArgumentException is raised. - The record object. - Optional flag that denotes accessibility of the private representation. - Thrown when the input type is not a record type. - The array of fields from the record. - - - Creates an instance of a record type. - - Assumes the given input is a record type. - The type of record to make. - The array of values to initialize the record. - Optional flags that denotes accessibility of the private representation. - Thrown when the input type is not a record type. - The created record. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - A record of options to control structural formatting. - For F# Interactive properties matching those of this value can be accessed via the 'fsi' - value. - - Floating Point format given in the same format accepted by System.Double.ToString, - e.g. f6 or g15. - - If ShowProperties is set the printing process will evaluate properties of the values being - displayed. This may cause additional computation. - - The ShowIEnumerable is set the printing process will force the evalution of IEnumerable objects - to a small, finite depth, as determined by the printing parameters. - This may lead to additional computation being performed during printing. - - <example> - From F# Interactive the default settings can be adjusted using, for example, - <pre> - open Microsoft.FSharp.Compiler.Interactive.Settings;; - setPrintWidth 120;; - </pre> - </example> - - - - - Data representing structured layouts of terms. - - - - - Convert any value to a layout using the given formatting options. The - layout can then be processed using formatting display engines such as - those in the LayoutOps module. any_to_string and output_any are - built using any_to_layout with default format options. - - - - - - - - Ouput any value to a channel using the same set of formatting rules - as any_to_string - - - - - Convert any value to a string using a standard formatter - Data is typically formatted in a structured format, e.g. - lists are formatted using the "[1;2]" notation. - The details of the format are not specified and may change - from version to version and according to the flags given - to the F# compiler. The format is intended to be human-readable, - not machine readable. If alternative generic formats are required - you should develop your own formatter, using the code in the - implementation of this file as a starting point. - - Data from other .NET languages is formatted using a virtual - call to Object.ToString() on the boxed version of the input. - - - - - - - - For limitting layout of list-like sequences (lists,arrays,etc). - unfold a list of items using (project and z) making layout list via itemL. - If reach maxLength (before exhausting) then truncate. - - - - - See tagL - - - - - Layout like an F# list. - - - - - Layout like an F# option. - - - - - Layout list vertically. - - - - - Layout two vertically. - - - - - Form tuple of layouts. - - - - - Wrap braces around layout. - - - - - Wrap square brackets around layout. - - - - - Wrap round brackets around Layout. - - - - - Join layouts into a list separated using the given Layout. - - - - - Join layouts into a semi-colon separated list. - - - - - Join layouts into a space separated list. - - - - - Join layouts into a comma separated list. - - - - - Join broken with ident=2 - - - - - Join broken with ident=1 - - - - - Join broken with ident=0 - - - - - Join, possible break with indent=2 - - - - - Join, possible break with indent=1 - - - - - Join, possible break with indent=0 - - - - - Join, unbreakable. - - - - - An string which is left parenthesis (no space on the right). - - - - - An string which is right parenthesis (no space on the left). - - - - - An string which requires no spaces either side. - - - - - An string leaf - - - - - An uninterpreted leaf, to be interpreted into a string - by the layout engine. This allows leaf layouts for numbers, strings and - other atoms to be customized according to culture. - - - - - Is it the empty layout? - - - - - The empty layout - - - - - A layout is a sequence of strings which have been joined together. - The strings are classified as words, separators and left and right parenthesis. - This classification determines where spaces are inserted. - A joint is either unbreakable, breakable or broken. - If a joint is broken the RHS layout occurs on the next line with optional indentation. - A layout can be squashed to for given width which forces breaks as required. - - - - diff --git a/packages/FSharp.Core/lib/portable-net45+monoandroid10+monotouch10+xamarinios10/FSharp.Core.dll b/packages/FSharp.Core/lib/portable-net45+monoandroid10+monotouch10+xamarinios10/FSharp.Core.dll deleted file mode 100644 index 73ef8584..00000000 Binary files a/packages/FSharp.Core/lib/portable-net45+monoandroid10+monotouch10+xamarinios10/FSharp.Core.dll and /dev/null differ diff --git a/packages/FSharp.Core/lib/portable-net45+monoandroid10+monotouch10+xamarinios10/FSharp.Core.optdata b/packages/FSharp.Core/lib/portable-net45+monoandroid10+monotouch10+xamarinios10/FSharp.Core.optdata deleted file mode 100644 index c8945ff4..00000000 Binary files a/packages/FSharp.Core/lib/portable-net45+monoandroid10+monotouch10+xamarinios10/FSharp.Core.optdata and /dev/null differ diff --git a/packages/FSharp.Core/lib/portable-net45+monoandroid10+monotouch10+xamarinios10/FSharp.Core.sigdata b/packages/FSharp.Core/lib/portable-net45+monoandroid10+monotouch10+xamarinios10/FSharp.Core.sigdata deleted file mode 100644 index 87960942..00000000 Binary files a/packages/FSharp.Core/lib/portable-net45+monoandroid10+monotouch10+xamarinios10/FSharp.Core.sigdata and /dev/null differ diff --git a/packages/FSharp.Core/lib/portable-net45+monoandroid10+monotouch10+xamarinios10/FSharp.Core.xml b/packages/FSharp.Core/lib/portable-net45+monoandroid10+monotouch10+xamarinios10/FSharp.Core.xml deleted file mode 100644 index cc7e94bd..00000000 --- a/packages/FSharp.Core/lib/portable-net45+monoandroid10+monotouch10+xamarinios10/FSharp.Core.xml +++ /dev/null @@ -1,11088 +0,0 @@ - - -FSharp.Core - - - - - - - - - Gets the tail of the list, which is a list containing all the elements of the list, excluding the first element - - - Gets the number of items contained in the list - - - Gets the element of the list at the given position. - Lists are represented as linked lists so this is an O(n) operation. - The index. - The value at the given index. - - - Gets a value indicating if the list contains no entries - - - Gets the first element of the list - - - Returns an empty list of a particular type - - - Returns a list with head as its first element and tail as its subsequent elements - A new head value for the list. - The existing list. - The list with head appended to the front of tail. - - - The type of immutable singly-linked lists. - - Use the constructors [] and :: (infix) to create values of this type, or - the notation [1;2;3]. Use the values in the List module to manipulate - values of this type, or pattern match against the values directly. - - - Lookup an element in the map. Raise KeyNotFoundException if no binding - exists in the map. - The input key. - Thrown when the key is not found. - The value mapped to the key. - - - Returns true if there are no bindings in the map. - - - The number of bindings in the map. - - - Lookup an element in the map, returning a Some value if the element is in the domain - of the map and None if not. - The input key. - The mapped value, or None if the key is not in the map. - - - Removes an element from the domain of the map. No exception is raised if the element is not present. - The input key. - The resulting map. - - - - - - Tests if an element is in the domain of the map. - The input key. - True if the map contains the given key. - - - Returns a new map with the binding added to the given map. - The input key. - The resulting map. - - - Builds a map that contains the bindings of the given IEnumerable. - The input sequence of key/value pairs. - The resulting map. - - - Immutable maps. Keys are ordered by F# generic comparison. - - Maps based on generic comparison are efficient for small keys. They are not a suitable choice if keys are recursive data structures - or if keys require bespoke comparison semantics. - - All members of this class are thread-safe and may be used concurrently from multiple threads. - - - An abbreviation for the CLI type System.Collections.Generic.List<_> - - - Returns a new set with the elements of the second set removed from the first. - The first input set. - The second input set. - A set containing elements of the first set that are not contained in the second set. - - - Compute the union of the two sets. - The first input set. - The second input set. - The union of the two input sets. - - - Returns the lowest element in the set according to the ordering being used for the set. - - - Returns the highest element in the set according to the ordering being used for the set. - - - A useful shortcut for Set.isEmpty. See the Set module for further operations on sets. - - - The number of elements in the set - - - A useful shortcut for Set.remove. Note this operation produces a new set - and does not mutate the original set. The new set will share many storage - nodes with the original. See the Set module for further operations on sets. - The value to remove from the set. - The result set. - - - Evaluates to "true" if all elements of the second set are in the first. - The set to test against. - True if this set is a superset of otherSet. - - - Evaluates to "true" if all elements of the first set are in the second. - The set to test against. - True if this set is a subset of otherSet. - - - Evaluates to "true" if all elements of the second set are in the first, and at least - one element of the first is not in the second. - The set to test against. - True if this set is a proper superset of otherSet. - - - Evaluates to "true" if all elements of the first set are in the second, and at least - one element of the second is not in the first. - The set to test against. - True if this set is a proper subset of otherSet. - - - - - - A useful shortcut for Set.contains. See the Set module for further operations on sets. - The value to check. - True if the set contains value. - - - A useful shortcut for Set.add. Note this operation produces a new set - and does not mutate the original set. The new set will share many storage - nodes with the original. See the Set module for further operations on sets. - The value to add to the set. - The result set. - - - Create a set containing elements drawn from the given sequence. - The input sequence. - The result set. - - - Immutable sets based on binary trees, where comparison is the - F# structural comparison function, potentially using implementations - of the IComparable interface on key values. - - See the Set module for further operations on sets. - - All members of this class are thread-safe and may be used concurrently from multiple threads. - - - An abbreviation for the type of immutable singly-linked lists. - - Use the constructors [] and :: (infix) to create values of this type, or - the notation [1;2;3]. Use the values in the List module to manipulate - values of this type, or pattern match against the values directly. - - - An abbreviation for the CLI type System.Collections.Generic.IEnumerable<_> - - - Fetches an element from a 2D array. You can also use the syntax array.[index1,index2]. - - The input array. - The index along the first dimension. - The index along the second dimension. - - The value of the array at the given index. - Thrown when the indices are negative or exceed the bounds of the array. - - - Sets the value of an element in an array. You can also use the syntax array.[index1,index2] <- value. - - The input array. - The index along the first dimension. - The index along the second dimension. - The value to set in the array. - Thrown when the indices are negative or exceed the bounds of the array. - - - Builds 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. - - The input array. - - The zero-based output array. - - - Builds 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 propagated to the output - array. - - A function that is applied to transform each element of the array. The two integers - provide the index of the element. - The input array. - - An array whose elements have been transformed by the given mapping. - - - Builds 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. - - A function that is applied to transform each item of the input array. - The input array. - - An array whose elements have been transformed by the given mapping. - - - Returns the length of an array in the second dimension. - - The input array. - - The length of the array in the second dimension. - - - Returns the length of an array in the first dimension. - - The input array. - - The length of the array in the first dimension. - - - Applies the given function to each element of the array. The integer indices passed to the - function indicates the index of element. - - A function to apply to each element of the array with the indices available as an argument. - The input array. - - - Applies the given function to each element of the array. - - A function to apply to each element of the array. - The input array. - - - Creates a based array where the entries are initially Unchecked.defaultof<'T>. - - The base for the first dimension of the array. - The base for the second dimension of the array. - The length of the first dimension of the array. - The length of the second dimension of the array. - - The created array. - Thrown when base1, base2, length1, or length2 is negative. - - - Creates a based array whose elements are all initially the given value. - - The base for the first dimension of the array. - The base for the second dimension of the array. - The length of the first dimension of the array. - The length of the second dimension of the array. - The value to populate the new array. - - The created array. - Thrown when base1, base2, length1, or length2 is negative. - - - Creates a based array given the dimensions and a generator function to compute the elements. - - The base for the first dimension of the array. - The base for the second dimension of the array. - The length of the first dimension of the array. - The length of the second dimension of the array. - A function to produce elements of the array given the two indices. - - The created array. - Thrown when base1, base2, length1, or length2 is negative. - - - Creates an array where the entries are initially Unchecked.defaultof<'T>. - - The length of the first dimension of the array. - The length of the second dimension of the array. - - The created array. - Thrown when length1 or length2 is negative. - - - Creates an array whose elements are all initially the given value. - - The length of the first dimension of the array. - The length of the second dimension of the array. - The value to populate the new array. - - The created array. - Thrown when length1 or length2 is negative. - - - Creates an array given the dimensions and a generator function to compute the elements. - - The length of the first dimension of the array. - The length of the second dimension of the array. - A function to produce elements of the array given the two indices. - - The generated array. - Thrown when either of the lengths is negative. - - - Reads a range of elements from the first array and write them into the second. - - The source array. - The first-dimension index to begin copying from in the source array. - The second-dimension index to begin copying from in the source array. - The target array. - The first-dimension index to begin copying into in the target array. - The second-dimension index to begin copying into in the target array. - The number of elements to copy across the first dimension of the arrays. - The number of elements to copy across the second dimension of the arrays. - Thrown when any of the indices are negative or if either of - the counts are larger than the dimensions of the array allow. - - - Builds 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. - - The input array. - - A copy of the input array. - - - Fetches the base-index for the second dimension of the array. - - The input array. - - The base-index of the second dimension of the array. - - - Fetches the base-index for the first dimension of the array. - - The input array. - - The base-index of the first dimension of the array. - - - Basic operations on 2-dimensional arrays. - - F# and CLI multi-dimensional arrays are typically zero-based. - However, CLI 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 propagated to a matching output - array on the Array2D.map and Array2D.mapi operations. - Non-zero-based arrays can also be created using Array2D.zeroCreateBased, - Array2D.createBased and Array2D.initBased. - - - Creates an array where the entries are initially the "default" value. - The length of the first dimension. - The length of the second dimension. - The length of the third dimension. - The created array. - - - Sets the value of an element in an array. You can also - use the syntax 'array.[index1,index2,index3] <- value'. - The input array. - The index along the first dimension. - The index along the second dimension. - The index along the third dimension. - The value to set at the given index. - - - Builds 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. - The function to transform the elements at each index in the array. - The input array. - The array created from the transformed elements. - - - Builds 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. - The function to transform each element of the array. - The input array. - The array created from the transformed elements. - - - Returns the length of an array in the third dimension. - The input array. - The length of the array in the third dimension. - - - Returns the length of an array in the second dimension. - The input array. - The length of the array in the second dimension. - - - Returns the length of an array in the first dimension - The input array. - The length of the array in the first dimension. - - - Applies the given function to each element of the array. The integer indicies passed to the - function indicates the index of element. - The function to apply to each element of the array. - The input array. - - - Applies the given function to each element of the array. - The function to apply to each element of the array. - The input array. - - - Fetches an element from a 3D array. You can also use the syntax 'array.[index1,index2,index3]' - The input array. - The index along the first dimension. - The index along the second dimension. - The index along the third dimension. - The value at the given index. - - - Creates an array given the dimensions and a generator function to compute the elements. - The length of the first dimension. - The length of the second dimension. - The length of the third dimension. - The function to create an initial value at each index into the array. - The created array. - - - Creates an array whose elements are all initially the given value. - The length of the first dimension. - The length of the second dimension. - The length of the third dimension. - The value of the array elements. - The created array. - - - Basic operations on rank 3 arrays. - - - Sets the value of an element in an array. You can also - use the syntax 'array.[index1,index2,index3,index4] <- value'. - The input array. - The index along the first dimension. - The index along the second dimension. - The index along the third dimension. - The index along the fourth dimension. - The value to set. - - - Fetches an element from a 4D array. You can also use the syntax 'array.[index1,index2,index3,index4]' - The input array. - The index along the first dimension. - The index along the second dimension. - The index along the third dimension. - The index along the fourth dimension. - The value at the given index. - - - Creates an array where the entries are initially the "default" value. - The length of the first dimension. - The length of the second dimension. - The length of the third dimension. - The length of the fourth dimension. - The created array. - - - Returns the length of an array in the fourth dimension. - The input array. - The length of the array in the fourth dimension. - - - Returns the length of an array in the third dimension. - The input array. - The length of the array in the third dimension. - - - Returns the length of an array in the second dimension. - The input array. - The length of the array in the second dimension. - - - Returns the length of an array in the first dimension - The input array. - The length of the array in the first dimension. - - - Creates an array given the dimensions and a generator function to compute the elements. - The length of the first dimension. - The length of the second dimension. - The length of the third dimension. - The length of the fourth dimension. - The function to create an initial value at each index in the array. - The created array. - - - Creates an array whose elements are all initially the given value - The length of the first dimension. - The length of the second dimension. - The length of the third dimension. - The length of the fourth dimension. - The initial value for each element of the array. - The created array. - - - Basic operations on rank 4 arrays. - - - Combines three arrays into an array of pairs. The three arrays must have equal lengths, otherwise an ArgumentException is - raised. - The first input array. - The second input array. - The third input array. - Thrown when the input arrays differ in length. - The array of tupled elements. - - - Combines the two arrays into an array of pairs. The two arrays must have equal lengths, otherwise an ArgumentException is - raised. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - The array of tupled elements. - - - Splits an array of triples into three arrays. - The input array. - The tuple of three arrays. - - - Splits an array of pairs into two arrays. - The input array. - The two arrays. - - - Returns the index of the first element in the array - that satisfies the given predicate. - The function to test the input elements. - The input array. - The index of the first element that satisfies the predicate, or None. - - - Returns the first element for which the given function returns true. - Return None if no such element exists. - The function to test the input elements. - The input array. - The first element that satisfies the predicate, or None. - - - Views the given array as a sequence. - The input array. - The sequence of array elements. - - - Builds a list from the given array. - The input array. - The list of array elements. - - - Returns the sum of the results generated by applying the function to each element of the array. - The function to transform the array elements into the type to be summed. - The input array. - The resulting sum. - - - Returns the sum of the elements in the array. - The input array. - The resulting sum. - - - Sorts the elements of an array by mutating the array in-place, using the given comparison function. - Elements are compared using Operators.compare. - The input array. - - - Sorts the elements of an array by mutating the array in-place, using the given comparison function as the order. - The function to compare pairs of array elements. - The input array. - - - Sorts the elements of an array by mutating the array in-place, using the given projection for the keys. - Elements are compared using Operators.compare. - - This is not a stable sort, i.e. the original order of equal elements is not necessarily preserved. - For a stable sort, consider using Seq.sort. - The function to transform array elements into the type that is compared. - The input array. - - - Sorts the elements of an array, using the given comparison function as the order, returning a new array. - - This is not a stable sort, i.e. the original order of equal elements is not necessarily preserved. - For a stable sort, consider using Seq.sort. - The function to compare pairs of array elements. - The input array. - The sorted array. - - - Sorts the elements of an array, using the given projection for the keys and returning a new array. - Elements are compared using Operators.compare. - - This is not a stable sort, i.e. the original order of equal elements is not necessarily preserved. - For a stable sort, consider using Seq.sort. - The function to transform array elements into the type that is compared. - The input array. - The sorted array. - - - Sorts the elements of an array, returning a new array. Elements are compared using Operators.compare. - - This is not a stable sort, i.e. the original order of equal elements is not necessarily preserved. - For a stable sort, consider using Seq.sort. - The input array. - The sorted array. - - - Builds a new array that contains the given subrange specified by - starting index and length. - The input array. - The index of the first element of the sub array. - The length of the sub array. - The created sub array. - - - Sets an element of an array. - The input array. - The input index. - The input value. - - - Like foldBack, but return both the intermediary and final results. - The function to update the state given the input elements. - The input array. - The initial state. - The array of state values. - - - Like fold, but return the intermediary and final results. - The function to update the state given the input elements. - The initial state. - The input array. - The array of state values. - - - Returns a new array with the elements in reverse order. - The input array. - The reversed array. - - - Applies 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. - The function to reduce a pair of elements to a single element. - The input array. - Thrown when the input array is empty. - The final result of the reductions. - - - Applies 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. - The function to reduce a pair of elements to a single element. - The input array. - Thrown when the input array is empty. - The final result of the redcutions. - - - Returns an array with all elements permuted according to the - specified permutation. - The function that maps input indices to output indices. - The input array. - The output array. - - - Splits the collection into two collections, containing the - elements for which the given predicate returns "true" and "false" - respectively. - The function to test the input elements. - The input array. - A pair of arrays. The first containing the elements the predicate evaluated to true, - and the second containing those evaluated to false. - - - Builds a new array from the given enumerable object. - The input sequence. - The array of elements from the sequence. - - - Builds an array from the given list. - The input list. - The array of elements from the list. - - - Returns the lowest of all elements of the array, compared via Operators.min on the function result. - - Throws ArgumentException for empty arrays. - The function to transform the elements into a type supporting comparison. - The input array. - Thrown when the input array is empty. - The minimum element. - - - Returns the lowest of all elements of the array, compared via Operators.min. - - Throws ArgumentException for empty arrays - The input array. - Thrown when the input array is empty. - The minimum element. - - - Returns the greatest of all elements of the array, compared via Operators.max on the function result. - - Throws ArgumentException for empty arrays. - The function to transform the elements into a type supporting comparison. - The input array. - Thrown when the input array is empty. - The maximum element. - - - Returns the greatest of all elements of the array, compared via Operators.max on the function result. - - Throws ArgumentException for empty arrays. - The input array. - Thrown when the input array is empty. - The maximum element. - - - Builds 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. - The function to transform elements and their indices. - The input array. - The array of transformed elements. - - - Builds 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. - The function to transform pairs of input elements and their indices. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - The array of transformed elements. - - - Builds 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. - The function to transform the pairs of the input elements. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - The array of transformed elements. - - - Builds a new array whose elements are the results of applying the given function - to each of the elements of the array. - The function to transform elements of the array. - The input array. - The array of transformed elements. - - - Returns the length of an array. You can also use property arr.Length. - The input array. - The length of the array. - - - Applies 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. - The function to apply to each index and pair of elements. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - - - Applies the given function to each element of the array. The integer passed to the - function indicates the index of element. - The function to apply to each index and element. - The input array. - - - Applies 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. - The function to apply. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - - - Applies the given function to each element of the array. - The function to apply. - The input array. - - - Returns true if the given array is empty, otherwise false. - The input array. - True if the array is empty. - - - Creates an array where the entries are initially the default value Unchecked.defaultof<'T>. - The length of the array to create. - The created array. - - - Creates an array given the dimension and a generator function to compute the elements. - The number of elements to initialize. - The function to generate the initial values for each index. - The created array. - - - Gets an element from an array. - The input array. - The input index. - The value of the array at the given index. - - - 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. - The function to update the state given the input elements. - The first input array. - The second input array. - The initial state. - Thrown when the input arrays differ in length. - The final state. - - - Applies 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. - The function to update the state given the input elements. - The initial state. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - The final state. - - - Applies 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)) - The function to update the state given the input elements. - The input array. - The initial state. - The final state. - - - Applies 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 - The function to update the state given the input elements. - The initial state. - The input array. - The final state. - - - Tests 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. - The function to test the input elements. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - True if all of the array elements satisfy the predicate. - - - Tests 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. - The function to test the input elements. - The input array. - True if all of the array elements satisfy the predicate. - - - Returns the index of the first element in the array - that satisfies the given predicate. Raise KeyNotFoundException if - none of the elements satisy the predicate. - The function to test the input elements. - The input array. - Thrown if predicate - never returns true. - The index of the first element in the array that satisfies the given predicate. - - - Returns the first element for which the given function returns 'true'. - Raise KeyNotFoundException if no such element exists. - The function to test the input elements. - The input array. - Thrown if predicate - never returns true. - The first element for which predicate returns true. - - - Returns a new collection containing only the elements of the collection - for which the given predicate returns "true". - The function to test the input elements. - The input array. - An array containing the elements for which the given predicate returns true. - - - Tests 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. - The function to test the input elements. - The first input array. - The second input array. - True if any result from predicate is true. - - - Tests 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. - The function to test the input elements. - The input array. - True if any result from predicate is true. - - - Returns an empty array of the given type. - - - Applies the given function to each element of the array. Returns - the array comprised of the results "x" for each element where - the function returns Some(x) - The function to generate options from the elements. - The input array. - The array of results. - - - Applies 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. - The function to generate options from the elements. - The input array. - Thrown if every result from - chooser is None. - The first result. - - - Fills a range of elements of the array with the given value. - The target array. - The index of the first element to set. - The number of elements to set. - The value to set. - - - Applies 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. - The function to transform the array elements into options. - The input array. - The first transformed element that is Some(x). - - - Creates an array whose elements are all initially the given value. - The length of the array to create. - The value for the elements. - The created array. - - - Builds a new array that contains the elements of the given array. - The input array. - A copy of the input array. - - - Builds a new array that contains the elements of each of the given sequence of arrays. - The input sequence of arrays. - The concatenation of the sequence of input arrays. - - - For each element of the array, applies the given function. Concatenates all the results and return the combined array. - The function to create sub-arrays from the input array elements. - The input array. - The concatenation of the sub-arrays. - - - Reads a range of elements from the first array and write them into the second. - The source array. - The starting index of the source array. - The target array. - The starting index of the target array. - The number of elements to copy. - - - Returns the average of the elements generated by applying the function to each element of the array. - The function to transform the array elements before averaging. - The input array. - Thrown when array is empty. - The computed average. - - - Returns the average of the elements in the array. - The input array. - Thrown when array is empty. - The average of the elements in the array. - - - Builds a new array that contains the elements of the first array followed by the elements of the second array. - The first input array. - The second input array. - The resulting array. - - - 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. - The function to test the input elements. - The input array. - 'T[] * 'T[] - - - 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. - - - 'T[] - - - 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. - - The input 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. - - The input 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. - - 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. - - The input 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. - - The input array. - 'U[] - - - 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. - - The input array. - '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). - - 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. - The function to generate options from the elements. - The input array. - 'U[] - - - Provides parallel operations on arrays - - - Basic operations on arrays. - - - Compare using the given comparer function. - A function to compare two values. - An object implementing IComparer using the supplied comparer. - - - Structural comparison. Compare using Operators.compare. - - - Common notions of comparison identity used with sorted data structures. - - - Hash using the given hashing and equality functions. - A function to generate a hash code from a value. - A function to test equality of two values. - An object implementing IEqualityComparer using the supplied functions. - - - Physical hashing (hash on reference identity of objects, and the contents of value types). - Hash using LanguagePrimitives.PhysicalEquality and LanguagePrimitives.PhysicalHash, - That is, for value types use GetHashCode and Object.Equals (if no other optimization available), - and for reference types use System.Runtime.CompilerServices.RuntimeHelpers.GetHashCode and - reference equality. - - - - - - Structural hashing. Hash using Operators.(=) and Operators.hash. - - - Common notions of value identity used with hash tables. - - - Combines the three lists into a list of triples. The lists must have equal lengths. - The first input list. - The second input list. - The third input list. - A single list containing triples of matching elements from the input lists. - - - Combines the two lists into a list of pairs. The two lists must have equal lengths. - The first input list. - The second input list. - A single list containing pairs of matching elements from the input lists. - - - Splits a list of triples into three lists. - The input list. - Three lists of split elements. - - - Splits a list of pairs into two lists. - The input list. - Two lists of split elements. - - - Returns the index of the first element in the list - that satisfies the given predicate. - Return None if no such element exists. - The function to test the input elements. - The input list. - The index of the first element for which the predicate returns true, or None if - every element evaluates to false. - - - Returns the first element for which the given function returns true.. - Return None if no such element exists. - The function to test the input elements. - The input list. - The first element for which the predicate returns true, or None if - every element evaluates to false. - - - Applies the given function to successive elements, returning Some(x) the first - result where function returns Some(x) for some x. If no such element - exists then return None. - The function to generate options from the elements. - The input list. - The first resulting value or None. - - - Views the given list as a sequence. - The input list. - The sequence of elements in the list. - - - Builds an array from the given list. - The input list. - The array containing the elements of the list. - - - Returns the list after removing the first element. - - The input list. - Thrown when the list is empty. - The list after removing the first element. - - - Returns the sum of the results generated by applying the function to each element of the list. - The function to transform the list elements into the type to be summed. - The input list. - The resulting sum. - - - Returns the sum of the elements in the list. - The input list. - The resulting sum. - - - Sorts the given list using Operators.compare. - - This is a stable sort, i.e. the original order of equal elements is preserved. - The input list. - The sorted list. - - - Sorts the given list using keys given by the given projection. Keys are compared using Operators.compare. - - This is a stable sort, i.e. the original order of equal elements is preserved. - The function to transform the list elements into the type to be compared. - The input list. - The sorted list. - - - Sorts the given list using the given comparison function. - - This is a stable sort, i.e. the original order of equal elements is preserved. - The function to compare the list elements. - The input list. - The sorted list. - - - Like foldBack, but returns both the intermediary and final results - The function to update the state given the input elements. - The input list. - The initial state. - The list of states. - - - Applies a function to each element of the collection, threading an accumulator argument - through the computation. Take the second argument, and apply the function to it - and the first element of the list. Then feed this result into the function along - with the second element and so on. Returns the list of intermediate results and the final result. - The function to update the state given the input elements. - The initial state. - The input list. - The list of states. - - - Returns a new list with the elements in reverse order. - The input list. - The reversed list. - - - Creates a list by calling the given generator on each index. - The number of elements to replicate. - The value to replicate - The generated list. - - - Applies 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 i0 (...(f iN-1 iN)). - - Raises System.ArgumentException if list is empty - The function to reduce two list elements to a single element. - The input list. - Thrown when the list is empty. - The final reduced value. - - - Apply a function to each element of the collection, threading an accumulator argument - through the computation. Apply the function to the first two elements of the list. - Then feed this result into the function along with the third element and so on. - Return the final result. If the input function is f and the elements are i0...iN then computes - f (... (f i0 i1) i2 ...) iN. - - Raises System.ArgumentException if list is empty - The function to reduce two list elements to a single element. - The input list. - Thrown when the list is empty. - The final reduced value. - - - Returns a list with all elements permuted according to the - specified permutation. - The function to map input indices to output indices. - The input list. - The permutated list. - - - Applies the given function to successive elements, returning the first - result where function returns Some(x) for some x. If no such - element exists then raise System.Collections.Generic.KeyNotFoundException - The function to generate options from the elements. - The input list. - Thrown when the list is empty. - The first resulting value. - - - Splits the collection into two collections, containing the - elements for which the given predicate returns true and false - respectively. Element order is preserved in both of the created lists. - The function to test the input elements. - The input list. - A list containing the elements for which the predicate evaluated to false and a list - containing the elements for which the predicate evaluated to true. - - - Builds a new list from the given enumerable object. - The input sequence. - The list of elements from the sequence. - - - Builds a list from the given array. - The input array. - The list of elements from the array. - - - Indexes into the list. The first element has index 0. - The input list. - The index to retrieve. - The value at the given index. - - - Returns the lowest of all elements of the list, compared via Operators.min on the function result - - Raises System.ArgumentException if list is empty. - The function to transform list elements into the type to be compared. - The input list. - Thrown when the list is empty. - The minimum value. - - - Returns the lowest of all elements of the list, compared via Operators.min. - - Raises System.ArgumentException if list is empty - The input list. - Thrown when the list is empty. - The minimum value. - - - Returns the greatest of all elements of the list, compared via Operators.max on the function result. - - Raises System.ArgumentException if list is empty. - The function to transform the list elements into the type to be compared. - The input list. - Thrown when the list is empty. - The maximum element. - - - Return the greatest of all elements of the list, compared via Operators.max. - - Raises System.ArgumentException if list is empty - The input list. - Thrown when the list is empty. - The maximum element. - - - Like mapi, but mapping corresponding elements from two lists of equal length. - The function to transform pairs of elements from the two lists and their index. - The first input list. - The second input list. - The list of transformed elements. - - - Builds a new collection whose elements are the results of applying the given function - to each of the elements of the collection. The integer index passed to the - function indicates the index (from 0) of element being transformed. - The function to transform elements and their indices. - The input list. - The list of transformed elements. - - - Builds a new collection whose elements are the results of applying the given function - to the corresponding elements of the three collections simultaneously. - The function to transform triples of elements from the input lists. - The first input list. - The second input list. - The third input list. - The list of transformed elements. - - - Builds a new collection whose elements are the results of applying the given function - to the corresponding elements of the two collections pairwise. - The function to transform pairs of elements from the input lists. - The first input list. - The second input list. - The list of transformed elements. - - - Builds a new collection whose elements are the results of applying the given function - to each of the elements of the collection. - The function to transform elements from the input list. - The input list. - The list of transformed elements. - - - Returns the length of the list. - The input list. - The length of the list. - - - Applies the given function to two collections simultaneously. The - collections must have identical size. The integer passed to the - function indicates the index of element. - The function to apply to a pair of elements from the input lists along with their index. - The first input list. - The second input list. - - - Applies the given function to each element of the collection. The integer passed to the - function indicates the index of element. - The function to apply to the elements of the list along with their index. - The input list. - - - Applies the given function to two collections simultaneously. The - collections must have identical size. - The function to apply to pairs of elements from the input lists. - The first input list. - The second input list. - - - Applies the given function to each element of the collection. - The function to apply to elements from the input list. - The input list. - - - Returns true if the list contains no elements, false otherwise. - The input list. - True if the list is empty. - - - Creates a list by calling the given generator on each index. - The length of the list to generate. - The function to generate an element from an index. - The list of generated elements. - - - Returns the first element of the list. - - The input list. - Thrown when the list is empty. - The first element of the list. - - - Tests if all corresponding elements of the collection 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 System.ArgumentException exception is raised. - Otherwise, true is returned. - The function to test the input elements. - The first input list. - The second input list. - Thrown when the input lists differ in length. - True if all of the pairs of elements satisfy the predicate. - - - Tests if all elements of the collection satisfy the given predicate. - - The predicate is applied to the elements of the input list. If any application - returns false then the overall result is false and no further elements are tested. - Otherwise, true is returned. - The function to test the input elements. - The input list. - True if all of the elements satisfy the predicate. - - - Applies a function to corresponding elements of two collections, threading an accumulator argument - through the computation. The collections must have identical sizes. - If the input function is f and the elements are i0...iN and j0...jN - then computes f i0 j0 (...(f iN jN s)). - The function to update the state given the input elements. - The first input list. - The second input list. - The initial state. - The final state value. - - - Applies 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 i0 (...(f iN s)). - The function to update the state given the input elements. - The input list. - The initial state. - The final state value. - - - Applies a function to corresponding elements of two collections, threading an accumulator argument - through the computation. The collections must have identical sizes. - If the input function is f and the elements are i0...iN and j0...jN - then computes f (... (f s i0 j0)...) iN jN. - The function to update the state given the input elements. - The initial state. - The first input list. - The second input list. - The final state value. - - - Applies a function to each element of the collection, threading an accumulator argument - through the computation. Take the second argument, and apply the function to it - and the first element of the list. Then feed this result into the function along - with the second element and so on. Return the final result. - If the input function is f and the elements are i0...iN then - computes f (... (f s i0) i1 ...) iN. - The function to update the state given the input elements. - The initial state. - The input list. - The final state value. - - - Returns a new collection containing only the elements of the collection - for which the given predicate returns "true" - The function to test the input elements. - The input list. - A list containing only the elements that satisfy the predicate. - - - Returns the index of the first element in the list - that satisfies the given predicate. - Raises KeyNotFoundException if no such element exists. - The function to test the input elements. - The input list. - Thrown if the predicate evaluates to false for all the - elements of the list. - The index of the first element that satisfies the predicate. - - - Returns the first element for which the given function returns true. - Raises KeyNotFoundException if no such element exists. - The function to test the input elements. - The input list. - Thrown if the predicate evaluates to false for - all the elements of the list. - The first element that satisfies the predicate. - - - Tests if any pair of corresponding elements of the lists 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 System.ArgumentException exception is raised. - Otherwise, false is returned. - The function to test the input elements. - The first input list. - The second input list. - Thrown when the input lists differ in length. - True if any pair of elements satisfy the predicate. - - - Tests if any element of the list satisfies the given predicate. - - The predicate is applied to the elements of the input list. If any application - returns true then the overall result is true and no further elements are tested. - Otherwise, false is returned. - The function to test the input elements. - The input list. - True if any element satisfies the predicate. - - - Returns an empty list of the given type. - - - Returns a new list that contains the elements of each the lists in order. - The input sequence of lists. - The resulting concatenated list. - - - For each element of the list, applies the given function. Concatenates all the results and return the combined list. - The function to transform each input element into a sublist to be concatenated. - The input list. - The concatenation of the transformed sublists. - - - Applies the given function to each element of the list. Returns - the list comprised of the results x for each element where - the function returns Some(x) - The function to generate options from the elements. - The input list. - The list comprising the values selected from the chooser function. - - - Returns the average of the elements generated by applying the function to each element of the list. - - Raises System.ArgumentException if list is empty. - The function to transform the list elements into the type to be averaged. - The input list. - Thrown when the list is empty. - The resulting average. - - - Returns the average of the elements in the list. - - Raises System.ArgumentException if list is empty. - The input list. - Thrown when the list is empty. - The resulting average. - - - Returns a new list that contains the elements of the first list - followed by elements of the second. - The first input list. - The second input list. - The resulting list. - - - Basic operations on lists. - - - Returns the key of the first mapping in the collection that satisfies the given predicate. - Returns 'None' if no such element exists. - The function to test the input elements. - The input map. - The first key for which the predicate returns true or None if the predicate evaluates to false for each key/value pair. - - - Evaluates the function on each mapping in the collection. Returns the key for the first mapping - where the function returns 'true'. Raise KeyNotFoundException if no such element exists. - The function to test the input elements. - The input map. - Thrown if the key does not exist in the map. - The first key for which the predicate evaluates true. - - - Lookup an element in the map, returning a Some value if the element is in the domain - of the map and None if not. - The input key. - The input map. - The found Some value or None. - - - Removes an element from the domain of the map. No exception is raised if the element is not present. - The input key. - The input map. - The resulting map. - - - Builds two new maps, one containing the bindings for which the given predicate returns 'true', - and the other the remaining bindings. - The function to test the input elements. - The input map. - A pair of maps in which the first contains the elements for which the predicate returned true - and the second containing the elements for which the predicated returned false. - - - Tests if an element is in the domain of the map. - The input key. - The input map. - True if the map contains the key. - - - Builds a new collection whose elements are the results of applying the given function - to each of the elements of the collection. The key passed to the - function indicates the key of element being transformed. - The function to transform the key/value pairs. - The input map. - The resulting map of keys and transformed values. - - - Returns true if the given predicate returns true for all of the - bindings in the map. - The function to test the input elements. - The input map. - True if the predicate evaluates to true for all of the bindings in the map. - - - Builds a new map containing only the bindings for which the given predicate returns 'true'. - The function to test the key/value pairs. - The input map. - The filtered map. - - - Returns true if the given predicate returns true for one of the - bindings in the map. - The function to test the input elements. - The input map. - True if the predicate returns true for one of the key/value pairs. - - - Applies the given function to each binding in the dictionary - The function to apply to each key/value pair. - The input map. - - - Folds over the bindings in the map - The function to update the state given the input key/value pairs. - The initial state. - The input map. - The final state value. - - - Folds over the bindings in the map. - The function to update the state given the input key/value pairs. - The input map. - The initial state. - The final state value. - - - Searches the map looking for the first element where the given function returns a Some value - The function to generate options from the key/value pairs. - The input map. - The first result. - - - Searches the map looking for the first element where the given function returns a Some value. - The function to generate options from the key/value pairs. - The input map. - The first result. - - - Lookup an element in the map, raising KeyNotFoundException if no binding - exists in the map. - The input key. - The input map. - Thrown when the key does not exist in the map. - The value mapped to the given key. - - - The empty map. - - - Is the map empty? - The input map. - True if the map is empty. - - - Returns an array of all key-value pairs in the mapping. - The array will be ordered by the keys of the map. - The input map. - The array of key/value pairs. - - - Returns a list of all key-value pairs in the mapping. - The list will be ordered by the keys of the map. - The input map. - The list of key/value pairs. - - - Views the collection as an enumerable sequence of pairs. - The sequence will be ordered by the keys of the map. - The input map. - The sequence of key/value pairs. - - - Returns a new map made from the given bindings. - The input sequence of key/value pairs. - The resulting map. - - - Returns a new map made from the given bindings. - The input array of key/value pairs. - The resulting map. - - - Returns a new map made from the given bindings. - The input list of key/value pairs. - The resulting map. - - - Returns a new map with the binding added to the given map. - The input key. - The input value. - The input map. - The resulting map. - - - Functional programming operators related to the Map<_,_> type. - - - Combines the three sequences into a list of triples. The sequences need not have equal lengths: - when one sequence is exhausted any remaining elements in the other - sequences are ignored. - - The first input sequence. - The second input sequence. - The third input sequence. - - The result sequence. - - Thrown when any of the input sequences is null. - - - Combines the two sequences into a list of pairs. The two sequences need not have equal lengths: - when one sequence is exhausted any remaining elements in the other - sequence are ignored. - - The first input sequence. - The second input sequence. - - The result sequence. - - Thrown when either of the input sequences is null. - - - Returns a sequence that yields sliding windows of containing elements drawn from the input - sequence. Each window is returned as a fresh array. - - The number of elements in each window. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - - - Returns a sequence that contains the elements generated by the given computation. - The given initial state argument is passed to the element generator. - For each IEnumerator elements in the stream are generated on-demand by applying the element - generator, until a None value is returned by the element generator. Each call to the element - generator returns a new residual state. - - The stream will be recomputed each time an IEnumerator is requested and iterated for the Seq. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - A function that takes in the current state and returns an option tuple of the next - element of the sequence and the next state value. - The initial state value. - - The result sequence. - - - Returns a sequence that when enumerated returns at most N elements. - - The maximum number of items to enumerate. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Applies the given function to successive elements, returning the first - result where the function returns "Some(x)". - - A function that transforms items from the input sequence into options. - The input sequence. - - The chosen element or None. - - Thrown when the input sequence is null. - - - Returns the index of the first element in the sequence - that satisfies the given predicate. Return None if no such element exists. - - A function that evaluates to a Boolean when given an item in the sequence. - The input sequence. - - The found index or None. - - Thrown when the input sequence is null. - - - Returns the first element for which the given function returns true. - Return None if no such element exists. - - A function that evaluates to a Boolean when given an item in the sequence. - The input sequence. - - The found element or None. - - Thrown when the input sequence is null. - - - Builds a list from the given collection. - - The input sequence. - - The result list. - - Thrown when the input sequence is null. - - - Builds an array from the given collection. - - The input sequence. - - The result array. - - Thrown when the input sequence is null. - - - Returns a sequence that, when iterated, yields elements of the underlying sequence while the - given predicate returns true, and then returns no further elements. - - A function that evaluates to false when no more items should be returned. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns the first N elements of the sequence. - Throws InvalidOperationException - if the count exceeds the number of elements in the sequence. Seq.truncate - returns as many items as the sequence contains instead of throwing an exception. - - The number of items to take. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - Thrown when count exceeds the number of elements - in the sequence. - - - Returns the sum of the results generated by applying the function to each element of the sequence. - The generated elements are summed using the + operator and Zero property associated with the generated type. - - A function to transform items from the input sequence into the type that will be summed. - The input sequence. - - The computed sum. - - - Returns the sum of the elements in the sequence. - - The elements are summed using the + operator and Zero property associated with the generated type. - - The input sequence. - - The computed sum. - - - Applies a key-generating function to each element of a sequence and yield a sequence ordered - by keys. The keys are compared using generic comparison as implemented by Operators.compare. - - This function returns a sequence that digests the whole initial sequence as soon as - that sequence is iterated. As a result this function should not be used with - large or infinite sequences. The function makes no assumption on the ordering of the original - sequence. - - This is a stable sort, that is the original order of equal elements is preserved. - - A function to transform items of the input sequence into comparable keys. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Yields a sequence ordered by keys. - - This function returns a sequence that digests the whole initial sequence as soon as - that sequence is iterated. As a result this function should not be used with - large or infinite sequences. The function makes no assumption on the ordering of the original - sequence. - - This is a stable sort, that is the original order of equal elements is preserved. - - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns a sequence that, when iterated, skips elements of the underlying sequence while the - given predicate returns true, and then yields the remaining elements of the sequence. - - A function that evaluates an element of the sequence to a boolean value. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns a sequence that skips N elements of the underlying sequence and then yields the - remaining elements of the sequence. - - The number of items to skip. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - Thrown when count exceeds the number of elements - in the sequence. - - - Returns a sequence that yields one item only. - - The input item. - - The result sequence of one item. - - - Like fold, but computes on-demand and returns the sequence of intermediary and final results. - - A function that updates the state with each element from the sequence. - The initial state. - The input sequence. - - The resulting sequence of computed states. - - Thrown when the input sequence is null. - - - Applies a function to each element of the sequence, threading an accumulator argument - through the computation. Begin by applying the function to the first two elements. - Then feed this result into the function along with the third element and so on. - Return the final result. - - A function that takes in the current accumulated result and the next - element of the sequence to produce the next accumulated result. - The input sequence. - - The final result of the reduction function. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - - - Builds a new sequence object that delegates to the given sequence object. This ensures - the original sequence cannot be rediscovered and mutated by a type cast. For example, - if given an array the returned sequence will return the elements of the array, but - you cannot cast the returned sequence object to an array. - - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Applies the given function to successive elements, returning the first - x where the function returns "Some(x)". - - A function to transform each item of the input sequence into an option of the output type. - The input sequence. - - The selected element. - - Thrown when the input sequence is null. - Thrown when every item of the sequence - evaluates to None when the given function is applied. - - - Returns a sequence of each element in the input sequence and its predecessor, with the - exception of the first element which is only returned as the predecessor of the second element. - - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Views the given list as a sequence. - - The input list. - - The result sequence. - - - Views the given array as a sequence. - - The input array. - - The result sequence. - - Thrown when the input sequence is null. - - - Computes the nth element in the collection. - - The index of element to retrieve. - The input sequence. - - The nth element of the sequence. - - Thrown when the input sequence is null. - - - Returns the lowest of all elements of the sequence, compared via Operators.min on the function result. - - A function to transform items from the input sequence into comparable keys. - The input sequence. - - The smallest element of the sequence. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - - - Returns the lowest of all elements of the sequence, compared via Operators.min. - - The input sequence. - - The smallest element of the sequence. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - - - Returns the greatest of all elements of the sequence, compared via Operators.max on the function result. - - A function to transform items from the input sequence into comparable keys. - The input sequence. - - The largest element of the sequence. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - - - Returns the greatest of all elements of the sequence, compared via Operators.max - - The input sequence. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - - The largest element of the sequence. - - - Builds a new collection whose elements are the results of applying the given function - to each of the elements of the collection. The integer index passed to the - function indicates the index (from 0) of element being transformed. - - A function to transform items from the input sequence that also supplies the current index. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Builds a new collection whose elements are the results of applying the given function - to the corresponding pairs of elements from the two sequences. If one input sequence is shorter than - the other then the remaining elements of the longer sequence are ignored. - - A function to transform pairs of items from the input sequences. - The first input sequence. - The second input sequence. - - The result sequence. - - Thrown when either of the input sequences is null. - - - Builds a new collection whose elements are the results of applying the given function - to each of the elements of the collection. The given function will be applied - as elements are demanded using the MoveNext method on enumerators retrieved from the - object. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - A function to transform items from the input sequence. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns the length of the sequence - - The input sequence. - - The length of the sequence. - - Thrown when the input sequence is null. - - - Applies the given function to two collections simultaneously. If one sequence is shorter than - the other then the remaining elements of the longer sequence are ignored. - - A function to apply to each pair of elements from the input sequences. - The first input sequence. - The second input sequence. - - Thrown when either of the input sequences is null. - - - Applies the given function to each element of the collection. The integer passed to the - function indicates the index of element. - - A function to apply to each element of the sequence that can also access the current index. - The input sequence. - - Thrown when the input sequence is null. - - - Applies the given function to each element of the collection. - - A function to apply to each element of the sequence. - The input sequence. - - Thrown when the input sequence is null. - - - Generates a new sequence which, when iterated, will return successive - elements by calling the given function. The results of calling the function - will not be saved, that is the function will be reapplied as necessary to - regenerate the elements. The function is passed the index of the item being - generated. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - Iteration can continue up to Int32.MaxValue. - - A function that generates an item in the sequence from a given index. - - The result sequence. - - - Generates a new sequence which, when iterated, will return successive - elements by calling the given function, up to the given count. Each element is saved after its - initialization. The function is passed the index of the item being - generated. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - The maximum number of items to generate for the sequence. - A function that generates an item in the sequence from a given index. - - The result sequence. - - Thrown when count is negative. - - - Returns true if the sequence contains no elements, false otherwise. - - The input sequence. - - True if the sequence is empty; false otherwise. - - Thrown when the input sequence is null. - - - Returns the only element of the sequence. - - The input sequence. - - The last element of the sequence. - - Thrown when the input sequence is null. - Thrown when the input does not have precisely one element. - - - Returns the last element of the sequence. - - The input sequence. - - The last element of the sequence. - - Thrown when the input sequence is null. - Thrown when the input does not have any elements. - - - Returns the first element of the sequence. - - The input sequence. - - The first element of the sequence. - - Thrown when the input sequence is null. - Thrown when the input does not have any elements. - - - Applies a key-generating function to each element of a sequence and yields a sequence of - unique keys. Each unique key contains a sequence of all elements that match - to this key. - - This function returns a sequence that digests the whole initial sequence as soon as - that sequence is iterated. As a result this function should not be used with - large or infinite sequences. The function makes no assumption on the ordering of the original - sequence. - - A function that transforms an element of the sequence into a comparable key. - The input sequence. - - The result sequence. - - - Tests the all pairs of elements drawn from the two sequences satisfy the - given predicate. If one sequence is shorter than - the other then the remaining elements of the longer sequence are ignored. - - A function to test pairs of elements from the input sequences. - The first input sequence. - The second input sequence. - - True if all pairs satisfy the predicate; false otherwise. - - Thrown when either of the input sequences is null. - - - Tests if all elements of the sequence satisfy the given predicate. - - The predicate is applied to the elements of the input sequence. If any application - returns false then the overall result is false and no further elements are tested. - Otherwise, true is returned. - - A function to test an element of the input sequence. - The input sequence. - - True if every element of the sequence satisfies the predicate; false otherwise. - - Thrown when the input sequence is null. - - - Applies 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 - - A function that updates the state with each element from the sequence. - The initial state. - The input sequence. - - The state object after the folding function is applied to each element of the sequence. - - Thrown when the input sequence is null. - - - Returns the index of the first element for which the given function returns true. - - A function to test whether the index of a particular element should be returned. - The input sequence. - - The index of the first element for which the predicate returns true. - - Thrown if no element returns true when - evaluated by the predicate - Thrown when the input sequence is null - - - Returns the first element for which the given function returns true. - - A function to test whether an item in the sequence should be returned. - The input sequence. - - The first element for which the predicate returns true. - - Thrown if no element returns true when - evaluated by the predicate - Thrown when the input sequence is null - - - Returns a new collection containing only the elements of the collection - for which the given predicate returns "true". - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - Remember sequence is lazy, effects are delayed until it is enumerated. - - A synonym for Seq.filter. - - A function to test whether each item in the input sequence should be included in the output. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns a new collection containing only the elements of the collection - for which the given predicate returns "true". This is a synonym for Seq.where. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - Remember sequence is lazy, effects are delayed until it is enumerated. - - A function to test whether each item in the input sequence should be included in the output. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Tests if any pair of corresponding elements of the input sequences satisfies the given predicate. - - The predicate is applied to matching elements in the two sequences 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, false is returned. If one sequence is shorter than - the other then the remaining elements of the longer sequence are ignored. - - A function to test each pair of items from the input sequences. - The first input sequence. - The second input sequence. - - True if any result from the predicate is true; false otherwise. - - Thrown when either of the two input sequences is null. - - - Tests if any element of the sequence satisfies the given predicate. - - The predicate is applied to the elements of the input sequence. If any application - returns true then the overall result is true and no further elements are tested. - Otherwise, false is returned. - - A function to test each item of the input sequence. - The input sequence. - - True if any result from the predicate is true; false otherwise. - - Thrown when the input sequence is null. - - - Creates an empty sequence. - - An empty sequence. - - - Returns a sequence that contains no duplicate entries according to the - generic hash and equality comparisons on the keys returned by the given key-generating function. - If an element occurs multiple times in the sequence then the later occurrences are discarded. - - A function transforming the sequence items into comparable keys. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns a sequence that contains no duplicate entries according to generic hash and - equality comparisons on the entries. - If an element occurs multiple times in the sequence then the later occurrences are discarded. - - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns a sequence that is built from the given delayed specification of a - sequence. - - The input function is evaluated each time an IEnumerator for the sequence - is requested. - - The generating function for the sequence. - - - Applies a key-generating function to each element of a sequence and return a sequence yielding unique - keys and their number of occurrences in the original sequence. - - Note that this function returns a sequence that digests the whole initial sequence as soon as - that sequence is iterated. As a result this function should not be used with - large or infinite sequences. The function makes no assumption on the ordering of the original - sequence. - - A function transforming each item of input sequence into a key to be - compared against the others. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Combines the given enumeration-of-enumerations as a single concatenated - enumeration. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - The input enumeration-of-enumerations. - - The result sequence. - - Thrown when the input sequence is null. - - - Compares two sequences using the given comparison function, element by element. - Returns the first non-zero result from the comparison function. If the end of a sequence - is reached it returns a -1 if the first sequence is shorter and a 1 if the second sequence - is shorter. - - A function that takes an element from each sequence and returns an int. - If it evaluates to a non-zero value iteration is stopped and that value is returned. - The first input sequence. - The second input sequence. - - The first non-zero value from the comparison function. - - Thrown when either of the input sequences - is null. - - - Applies the given function to each element of the sequence and concatenates all the - results. - - Remember sequence is lazy, effects are delayed until it is enumerated. - - A function to transform elements of the input sequence into the sequences - that will then be concatenated. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Applies the given function to each element of the list. Return - the list comprised of the results "x" for each element where - the function returns Some(x). - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not - be accessed concurrently. - - A function to transform items of type T into options of type U. - The input sequence of type T. - - The result sequence. - - Thrown when the input sequence is null. - - - Wraps a loosely-typed System.Collections sequence as a typed sequence. - - The use of this function usually requires a type annotation. - An incorrect type annotation may result in runtime type - errors. - Individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns a sequence that corresponds to a cached version of the input sequence. - This result sequence will have the same elements as the input sequence. The result - can be enumerated multiple times. The input sequence will be enumerated at most - once and only as far as is necessary. Caching a sequence is typically useful when repeatedly - evaluating items in the original sequence is computationally expensive or if - iterating the sequence causes side-effects that the user does not want to be - repeated multiple times. - - Enumeration of the result sequence is thread safe in the sense that multiple independent IEnumerator - values may be used simultaneously from different threads (accesses to - the internal lookaside table are thread safe). Each individual IEnumerator - is not typically thread safe and should not be accessed concurrently. - - Once enumeration of the input sequence has started, - it's enumerator will be kept live by this object until the enumeration has completed. - At that point, the enumerator will be disposed. - - The enumerator may be disposed and underlying cache storage released by - converting the returned sequence object to type IDisposable, and calling the Dispose method - on this object. The sequence object may then be re-enumerated and a fresh enumerator will - be used. - - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns the average of the results generated by applying the function to each element - of the sequence. - - The elements are averaged using the + operator, DivideByInt method and Zero property - associated with the generated type. - - A function applied to transform each element of the sequence. - The input sequence. - - The average. - - Thrown when the input sequence is null. - Thrown when the input sequence has zero elements. - - - Returns the average of the elements in the sequence. - - The elements are averaged using the + operator, DivideByInt method and Zero property - associated with the element type. - - The input sequence. - - The average. - - Thrown when the input sequence is null. - Thrown when the input sequence has zero elements. - - - Wraps the two given enumerations as a single concatenated - enumeration. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed - concurrently. - - The first sequence. - The second sequence. - - The result sequence. - - Thrown when either of the two provided sequences is - null. - - - Basic operations on IEnumerables. - - - Returns a new set with the elements of the second set removed from the first. - The first input set. - The set whose elements will be removed from set1. - The set with the elements of set2 removed from set1. - - - Builds a new collection from the given enumerable object. - The input sequence. - The set containing elements. - - - Returns an ordered view of the collection as an enumerable object. - The input set. - An ordered sequence of the elements of set. - - - Builds an array that contains the elements of the set in order. - The input set. - An ordered array of the elements of set. - - - Builds a set that contains the same elements as the given array. - The input array. - A set containing the elements of array. - - - Builds a list that contains the elements of the set in order. - The input set. - An ordered list of the elements of set. - - - Builds a set that contains the same elements as the given list. - The input list. - A set containing the elements form the input list. - - - Returns the highest element in the set according to the ordering being used for the set. - The input set. - The max value from the set. - - - Returns the lowest element in the set according to the ordering being used for the set. - The input set. - The min value from the set. - - - Returns a new set with the given element removed. No exception is raised if - the set doesn't contain the given element. - The element to remove. - The input set. - The input set with value removed. - - - Splits the set into two sets containing the elements for which the given predicate - returns true and false respectively. - The function to test set elements. - The input set. - A pair of sets with the first containing the elements for which predicate returns - true and the second containing the elements for which predicate returns false. - - - Applies the given function to each element of the set, in order according - to the comparison function. - The function to apply to each element. - The input set. - - - Returns "true" if the set is empty. - The input set. - True if set is empty. - - - Computes the union of a sequence of sets. - The sequence of sets to untion. - The union of the input sets. - - - Computes the union of the two sets. - The first input set. - The second input set. - The union of set1 and set2. - - - Computes the intersection of a sequence of sets. The sequence must be non-empty. - The sequence of sets to intersect. - The intersection of the input sets. - - - Computes the intersection of the two sets. - The first input set. - The second input set. - The intersection of set1 and set2. - - - Tests if all elements of the collection satisfy the given predicate. - If the input function is f and the elements are i0...iN and "j0...jN" - then computes p i0 && ... && p iN. - The function to test set elements. - The input set. - True if all elements of set satisfy predicate. - - - Applies the given accumulating function to all the elements of the set. - The accumulating function. - The input set. - The initial state. - The final state. - - - Applies the given accumulating function to all the elements of the set - The accumulating function. - The initial state. - The input set. - The final state. - - - Returns a new collection containing the results of applying the - given function to each element of the input set. - The function to transform elements of the input set. - The input set. - A set containing the transformed elements. - - - Returns a new collection containing only the elements of the collection - for which the given predicate returns true. - The function to test set elements. - The input set. - The set containing only the elements for which predicate returns true. - - - Tests if any element of the collection satisfies the given predicate. - If the input function is predicate and the elements are i0...iN - then computes p i0 or ... or p iN. - The function to test set elements. - The input set. - True if any element of set satisfies predicate. - - - Returns the number of elements in the set. Same as size. - The input set. - The number of elements in the set. - - - Evaluates to "true" if all elements of the second set are in the first, and at least - one element of the first is not in the second. - The potential superset. - The set to test against. - True if set1 is a proper superset of set2. - - - Evaluates to "true" if all elements of the second set are in the first. - The potential superset. - The set to test against. - True if set1 is a superset of set2. - - - Evaluates to "true" if all elements of the first set are in the second, and at least - one element of the second is not in the first. - The potential subset. - The set to test against. - True if set1 is a proper subset of set2. - - - Evaluates to "true" if all elements of the first set are in the second - The potential subset. - The set to test against. - True if set1 is a subset of set2. - - - Evaluates to "true" if the given element is in the given set. - The element to test. - The input set. - True if element is in set. - - - Returns a new set with an element added to the set. No exception is raised if - the set already contains the given element. - The value to add. - The input set. - A new set containing value. - - - The set containing the given element. - The value for the set to contain. - The set containing value. - - - The empty set for the type 'T. - - - Functional programming operators related to the Set<_> type. - - - Gets the default cancellation token for executing asynchronous computations. - The default CancellationToken. - - - Creates an asynchronous computation that returns the CancellationToken governing the execution - of the computation. - In async { let! token = Async.CancellationToken ...} token can be used to initiate other - asynchronous operations that will cancel cooperatively with this workflow. - An asynchronous computation capable of retrieving the CancellationToken from a computation - expression. - - - Creates an asynchronous computation that executes computation. - If this computation is cancelled before it completes then the computation generated by - running compensation is executed. - The input asynchronous computation. - The function to be run if the computation is cancelled. - An asynchronous computation that runs the compensation if the input computation - is cancelled. - - - Creates an asynchronous computation that queues a work item that runs - its continuation. - A computation that generates a new work item in the thread pool. - - - Creates an asynchronous computation that creates a new thread and runs - its continuation in that thread. - A computation that will execute on a new thread. - - - Creates an asynchronous computation that runs - its continuation using syncContext.Post. If syncContext is null - then the asynchronous computation is equivalent to SwitchToThreadPool(). - The synchronization context to accept the posted computation. - An asynchronous computation that uses the syncContext context to execute. - - - Runs an asynchronous computation, starting immediately on the current operating system - thread. Call one of the three continuations when the operation completes. - If no cancellation token is provided then the default cancellation token - is used. - The asynchronous computation to execute. - The function called on success. - The function called on exception. - The function called on cancellation. - The CancellationToken to associate with the computation. - The default is used if this parameter is not provided. - - - Runs an asynchronous computation, starting immediately on the current operating system - thread. - If no cancellation token is provided then the default cancellation token is used. - The asynchronous computation to execute. - The CancellationToken to associate with the computation. - The default is used if this parameter is not provided. - - - Creates an asynchronous computation which starts the given computation as a System.Threading.Tasks.Task - - - Starts a child computation within an asynchronous workflow. - This allows multiple asynchronous computations to be executed simultaneously. - - This method should normally be used as the immediate - right-hand-side of a let! binding in an F# asynchronous workflow, that is, - - async { ... - let! completor1 = childComputation1 |> Async.StartChild - let! completor2 = childComputation2 |> Async.StartChild - ... - let! result1 = completor1 - let! result2 = completor2 - ... } - - When used in this way, each use of StartChild starts an instance of childComputation - and returns a completor object representing a computation to wait for the completion of the operation. - When executed, the completor awaits the completion of childComputation. - The child computation. - The timeout value in milliseconds. If one is not provided - then the default value of -1 corresponding to System.Threading.Timeout.Infinite. - A new computation that waits for the input computation to finish. - - - Executes a computation in the thread pool. - If no cancellation token is provided then the default cancellation token is used. - A System.Threading.Tasks.Task that will be completed - in the corresponding state once the computation terminates (produces the result, throws exception or gets canceled) - - - - Starts the asynchronous computation in the thread pool. Do not await its result. - - If no cancellation token is provided then the default cancellation token is used. - The computation to run asynchronously. - The cancellation token to be associated with the computation. - If one is not supplied, the default cancellation token is used. - - - Creates an asynchronous computation that will sleep for the given time. This is scheduled - using a System.Threading.Timer object. The operation will not block operating system threads - for the duration of the wait. - The number of milliseconds to sleep. - An asynchronous computation that will sleep for the given time. - Thrown when the due time is negative - and not infinite. - - - Runs the asynchronous computation and await its result. - - If an exception occurs in the asynchronous computation then an exception is re-raised by this - function. - - If no cancellation token is provided then the default cancellation token is used. - - The timeout parameter is given in milliseconds. A value of -1 is equivalent to - System.Threading.Timeout.Infinite. - The computation to run. - The amount of time in milliseconds to wait for the result of the - computation before raising a System.TimeoutException. If no value is provided - for timeout then a default of -1 is used to correspond to System.Threading.Timeout.Infinite. - The cancellation token to be associated with the computation. - If one is not supplied, the default cancellation token is used. - The result of the computation. - - - Creates an asynchronous computation that executes all the given asynchronous computations, - initially queueing each as work items and using a fork/join pattern. - - If all child computations succeed, an array of results is passed to the success continuation. - - If any child computation raises an exception, then the overall computation will trigger an - exception, and cancel the others. - - The overall computation will respond to cancellation while executing the child computations. - If cancelled, the computation will cancel any remaining child computations but will still wait - for the other child computations to complete. - A sequence of distinct computations to be parallelized. - A computation that returns an array of values from the sequence of input computations. - - - Generates a scoped, cooperative cancellation handler for use within an asynchronous workflow. - - For example, - async { use! holder = Async.OnCancel interruption ... } - generates an asynchronous computation where, if a cancellation happens any time during - the execution of the asynchronous computation in the scope of holder, then action - interruption is executed on the thread that is performing the cancellation. This can - be used to arrange for a computation to be asynchronously notified that a cancellation - has occurred, e.g. by setting a flag, or deregistering a pending I/O action. - The function that is executed on the thread performing the - cancellation. - An asynchronous computation that triggers the interruption if it is cancelled - before being disposed. - - - Creates an asynchronous computation that runs the given computation and ignores - its result. - The input computation. - A computation that is equivalent to the input computation, but disregards the result. - - - Creates an asynchronous computation that captures the current - success, exception and cancellation continuations. The callback must - eventually call exactly one of the given continuations. - The function that accepts the current success, exception, and cancellation - continuations. - An asynchronous computation that provides the callback with the current continuations. - - - Creates an asynchronous computation in terms of a Begin/End pair of actions in - the style used in CLI APIs. This overlaod should be used if the operation is - qualified by three arguments. For example, - Async.FromBeginEnd(arg1,arg2,arg3,ws.BeginGetWeather,ws.EndGetWeather) - When the computation is run, beginFunc is executed, with - a callback which represents the continuation of the computation. - When the callback is invoked, the overall result is fetched using endFunc. - - The computation will respond to cancellation while waiting for the completion - of the operation. If a cancellation occurs, and cancelAction is specified, then it is - executed, and the computation continues to wait for the completion of the operation. - - If cancelAction is not specified, then cancellation causes the computation - to stop immediately, and subsequent invocations of the callback are ignored. - The first argument for the operation. - The second argument for the operation. - The third argument for the operation. - The function initiating a traditional CLI asynchronous operation. - The function completing a traditional CLI asynchronous operation. - An optional function to be executed when a cancellation is requested. - An asynchronous computation wrapping the given Begin/End functions. - - - Creates an asynchronous computation in terms of a Begin/End pair of actions in - the style used in CLI APIs. This overlaod should be used if the operation is - qualified by two arguments. For example, - Async.FromBeginEnd(arg1,arg2,ws.BeginGetWeather,ws.EndGetWeather) - When the computation is run, beginFunc is executed, with - a callback which represents the continuation of the computation. - When the callback is invoked, the overall result is fetched using endFunc. - - The computation will respond to cancellation while waiting for the completion - of the operation. If a cancellation occurs, and cancelAction is specified, then it is - executed, and the computation continues to wait for the completion of the operation. - - If cancelAction is not specified, then cancellation causes the computation - to stop immediately, and subsequent invocations of the callback are ignored. - The first argument for the operation. - The second argument for the operation. - The function initiating a traditional CLI asynchronous operation. - The function completing a traditional CLI asynchronous operation. - An optional function to be executed when a cancellation is requested. - An asynchronous computation wrapping the given Begin/End functions. - - - Creates an asynchronous computation in terms of a Begin/End pair of actions in - the style used in CLI APIs. This overlaod should be used if the operation is - qualified by one argument. For example, - Async.FromBeginEnd(place,ws.BeginGetWeather,ws.EndGetWeather) - When the computation is run, beginFunc is executed, with - a callback which represents the continuation of the computation. - When the callback is invoked, the overall result is fetched using endFunc. - - The computation will respond to cancellation while waiting for the completion - of the operation. If a cancellation occurs, and cancelAction is specified, then it is - executed, and the computation continues to wait for the completion of the operation. - - If cancelAction is not specified, then cancellation causes the computation - to stop immediately, and subsequent invocations of the callback are ignored. - The argument for the operation. - The function initiating a traditional CLI asynchronous operation. - The function completing a traditional CLI asynchronous operation. - An optional function to be executed when a cancellation is requested. - An asynchronous computation wrapping the given Begin/End functions. - - - Creates an asynchronous computation in terms of a Begin/End pair of actions in - the style used in CLI APIs. For example, - Async.FromBeginEnd(ws.BeginGetWeather,ws.EndGetWeather) - When the computation is run, beginFunc is executed, with - a callback which represents the continuation of the computation. - When the callback is invoked, the overall result is fetched using endFunc. - - The computation will respond to cancellation while waiting for the completion - of the operation. If a cancellation occurs, and cancelAction is specified, then it is - executed, and the computation continues to wait for the completion of the operation. - - If cancelAction is not specified, then cancellation causes the computation - to stop immediately, and subsequent invocations of the callback are ignored. - The function initiating a traditional CLI asynchronous operation. - The function completing a traditional CLI asynchronous operation. - An optional function to be executed when a cancellation is requested. - An asynchronous computation wrapping the given Begin/End functions. - - - Creates an asynchronous computation that executes computation. - If this computation completes successfully then return Choice1Of2 with the returned - value. If this computation raises an exception before it completes then return Choice2Of2 - with the raised exception. - The input computation that returns the type T. - A computation that returns a choice of type T or exception. - - - Raises the cancellation condition for the most recent set of asynchronous computations started - without any specific CancellationToken. Replaces the global CancellationTokenSource with a new - global token source for any asynchronous computations created after this point without any - specific CancellationToken. - - - Creates an asynchronous computation that will wait on the given WaitHandle. - - The computation returns true if the handle indicated a result within the given timeout. - The WaitHandle that can be signalled. - The timeout value in milliseconds. If one is not provided - then the default value of -1 corresponding to System.Threading.Timeout.Infinite. - An asynchronous computation that waits on the given WaitHandle. - - - - Return an asynchronous computation that will wait for the given task to complete and return - its result. - - - - Creates an asynchronous computation that will wait on the IAsyncResult. - - The computation returns true if the handle indicated a result within the given timeout. - The IAsyncResult to wait on. - The timeout value in milliseconds. If one is not provided - then the default value of -1 corresponding to System.Threading.Timeout.Infinite. - An asynchronous computation that waits on the given IAsyncResult. - - - Creates an asynchronous computation that waits for a single invocation of a CLI - event by adding a handler to the event. Once the computation completes or is - cancelled, the handler is removed from the event. - - The computation will respond to cancellation while waiting for the event. If a - cancellation occurs, and cancelAction is specified, then it is executed, and - the computation continues to wait for the event. - - If cancelAction is not specified, then cancellation causes the computation - to cancel immediately. - The event to handle once. - An optional function to execute instead of cancelling when a - cancellation is issued. - An asynchronous computation that waits for the event to be invoked. - - - Creates three functions that can be used to implement the .NET Asynchronous - Programming Model (APM) for a given asynchronous computation. - - The functions should normally be published as members with prefix Begin, - End and Cancel, and can be used within a type definition as follows: - - let beginAction,endAction,cancelAction = Async.AsBeginEnd (fun arg -> computation) - member x.BeginSomeOperation(arg,callback,state:obj) = beginAction(arg,callback,state) - member x.EndSomeOperation(iar) = endAction(iar) - member x.CancelSomeOperation(iar) = cancelAction(iar) - - - If the asynchronous computation takes no arguments, then AsBeginEnd is used as follows: - - let beginAction,endAction,cancelAction = Async.AsBeginEnd (fun () -> computation) - member x.BeginSomeOperation(callback,state:obj) = beginAction((),callback,state) - member x.EndSomeOperation(iar) = endAction(iar) - member x.CancelSomeOperation(iar) = cancelAction(iar) - - - - If the asynchronous computation takes two arguments, then AsBeginEnd is used as follows: - - let beginAction,endAction,cancelAction = Async.AsBeginEnd (fun arg1 arg2 -> computation) - member x.BeginSomeOperation(arg1,arg2,callback,state:obj) = beginAction((),callback,state) - member x.EndSomeOperation(iar) = endAction(iar) - member x.CancelSomeOperation(iar) = cancelAction(iar) - - - In each case, the resulting API will be familiar to programmers in other CLI languages and - is a useful way to publish asynchronous computations in CLI components. - A function generating the asynchronous computation to split into the traditional - .NET Asynchronous Programming Model. - A tuple of the begin, end, and cancel members. - - - This static class holds members for creating and manipulating asynchronous computations. - - - Creates an asynchronous computation that just returns (). - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of empty else branches in the - async { ... } computation expression syntax. - An asynchronous computation that returns (). - - - Creates an asynchronous computation that runs computation repeatedly - until guard() becomes false. - - A cancellation check is performed whenever the computation is executed. - - The existence of this method permits the use of while in the - async { ... } computation expression syntax. - The function to determine when to stop executing computation. - The function to be executed. Equivalent to the body - of a while expression. - An asynchronous computation that behaves similarly to a while loop when run. - - - Creates an asynchronous computation that runs binder(resource). - The action resource.Dispose() is executed as this computation yields its result - or if the asynchronous computation exits by an exception or by cancellation. - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of use and use! in the - async { ... } computation expression syntax. - The resource to be used and disposed. - The function that takes the resource and returns an asynchronous - computation. - An asynchronous computation that binds and eventually disposes resource. - - - Creates an asynchronous computation that runs computation and returns its result. - If an exception happens then catchHandler(exn) is called and the resulting computation executed instead. - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of try/with in the - async { ... } computation expression syntax. - The input computation. - The function to run when computation throws an exception. - An asynchronous computation that executes computation and calls catchHandler if an - exception is thrown. - - - Creates an asynchronous computation that runs computation. The action compensation is executed - after computation completes, whether computation exits normally or by an exception. If compensation raises an exception itself - the original exception is discarded and the new exception becomes the overall result of the computation. - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of try/finally in the - async { ... } computation expression syntax. - The input computation. - The action to be run after computation completes or raises an - exception (including cancellation). - An asynchronous computation that executes computation and compensation aftewards or - when an exception is raised. - - - Delegates to the input computation. - - The existence of this method permits the use of return! in the - async { ... } computation expression syntax. - The input computation. - The input computation. - - - Creates an asynchronous computation that returns the result v. - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of return in the - async { ... } computation expression syntax. - The value to return from the computation. - An asynchronous computation that returns value when executed. - - - Creates an asynchronous computation that enumerates the sequence seq - on demand and runs body for each element. - - A cancellation check is performed on each iteration of the loop. - - The existence of this method permits the use of for in the - async { ... } computation expression syntax. - The sequence to enumerate. - A function to take an item from the sequence and create - an asynchronous computation. Can be seen as the body of the for expression. - An asynchronous computation that will enumerate the sequence and run body - for each element. - - - Creates an asynchronous computation that runs generator. - - A cancellation check is performed when the computation is executed. - The function to run. - An asynchronous computation that runs generator. - - - Creates an asynchronous computation that first runs computation1 - and then runs computation2, returning the result of computation2. - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of expression sequencing in the - async { ... } computation expression syntax. - The first part of the sequenced computation. - The second part of the sequenced computation. - An asynchronous computation that runs both of the computations sequentially. - - - Creates an asynchronous computation that runs computation, and when - computation generates a result T, runs binder res. - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of let! in the - async { ... } computation expression syntax. - The computation to provide an unbound result. - The function to bind the result of computation. - An asynchronous computation that performs a monadic bind on the result - of computation. - - - - Generate an object used to build asynchronous computations using F# computation expressions. The value - 'async' is a pre-defined instance of this type. - - A cancellation check is performed when the computation is executed. - - - - The type of the async operator, used to build workflows for asynchronous computations. - - - Sends a reply to a PostAndReply message. - The value to send. - - - A handle to a capability to reply to a PostAndReply message. - - - A compositional asynchronous computation, which, when run, will eventually produce a value - of type T, or else raises an exception. - - Asynchronous computations are normally specified using an F# computation expression. - - When run, asynchronous computations have two modes: as a work item (executing synchronous - code), or as a wait item (waiting for an event or I/O completion). - - When run, asynchronous computations can be governed by CancellationToken. This can usually - be specified when the async computation is started. The associated CancellationTokenSource - may be used to cancel the asynchronous computation. Asynchronous computations built using - computation expressions can check the cancellation condition regularly. Synchronous - computations within an asynchronous computation do not automatically check this condition. - - - Publishes the event as a first class event value. - - - Triggers the event using the given parameters. - The parameters for the event. - - - Creates an event object suitable for implementing an arbitrary type of delegate. - The event object. - - - Event implementations for an arbitrary type of delegate. - - - Publishes an observation as a first class value. - - - Triggers an observation using the given parameters. - The event parameters. - - - Creates an observable object. - The created event. - - - Event implementations for the IEvent<_> type. - - - Publishes the event as a first class event value. - - - Triggers the event using the given sender object and parameters. The sender object may be null. - The object triggering the event. - The parameters for the event. - - - Creates an event object suitable for delegate types following the standard .NET Framework convention of a first 'sender' argument. - The created event. - - - Event implementations for a delegate types following the standard .NET Framework convention of a first 'sender' argument. - - - - - - A delegate type associated with the F# event type IEvent<_> - The object that fired the event. - The event arguments. - - - Remove a listener delegate from an event listener store. - The delegate to be removed from the event listener store. - - - Connect a handler delegate object to the event. A handler can - be later removed using RemoveHandler. The listener will - be invoked when the event is fired. - A delegate to be invoked when the event is fired. - - - First class event values for arbitrary delegate types. - - F# gives special status to member properties compatible with type IDelegateEvent and - tagged with the CLIEventAttribute. In this case the F# compiler generates approriate - CLI metadata to make the member appear to other CLI languages as a CLI event. - - - First-class listening points (i.e. objects that permit you to register a callback - activated when the event is triggered). - - - First class event values for CLI events conforming to CLI Framework standards. - - - The type of delayed computations. - - Use the values in the Lazy module to manipulate - values of this type, and the notation lazy expr to create values - of type . - - - Raises a timeout exception if a message not received in this amount of time. By default - no timeout is used. - - - Occurs when the execution of the agent results in an exception. - - - Occurs when the execution of the agent results in an exception. - - - Raises a timeout exception if a message not received in this amount of time. By default - no timeout is used. - - - Returns the number of unprocessed messages in the message queue of the agent. - - - Occurs when the execution of the agent results in an exception. - - - Scans for a message by looking through messages in arrival order until scanner - returns a Some value. Other messages remain in the queue. - - This method is for use within the body of the agent. For each agent, at most - one concurrent reader may be active, so no more than one concurrent call to - Receive, TryReceive, Scan and/or TryScan may be active. - The function to return None if the message is to be skipped - or Some if the message is to be processed and removed from the queue. - An optional timeout in milliseconds. Defaults to -1 which corresponds - to System.Threading.Timeout.Infinite. - An asynchronous computation that scanner built off the read message. - - - Waits for a message. This will consume the first message in arrival order. - - This method is for use within the body of the agent. - - Returns None if a timeout is given and the timeout is exceeded. - - This method is for use within the body of the agent. For each agent, at most - one concurrent reader may be active, so no more than one concurrent call to - Receive, TryReceive, Scan and/or TryScan may be active. - An optional timeout in milliseconds. Defaults to -1 which - corresponds to System.Threading.Timeout.Infinite. - An asynchronous computation that returns the received message or - None if the timeout is exceeded. - - - Like PostAndReply, but returns None if no reply within the timeout period. - The function to incorporate the AsyncReplyChannel into - the message to be sent. - An optional timeout parameter (in milliseconds) to wait for a reply message. - Defaults to -1 which corresponds to System.Threading.Timeout.Infinite. - The reply from the agent or None if the timeout expires. - - - Starts the agent. - - - Creates and starts an agent. The body function is used to generate the asynchronous - computation executed by the agent. - The function to produce an asynchronous computation that will be executed - as the read loop for the MailboxProcessor when Start is called. - An optional cancellation token for the body. - Defaults to Async.DefaultCancellationToken. - The created MailboxProcessor. - - - Scans for a message by looking through messages in arrival order until scanner - returns a Some value. Other messages remain in the queue. - - Returns None if a timeout is given and the timeout is exceeded. - - This method is for use within the body of the agent. For each agent, at most - one concurrent reader may be active, so no more than one concurrent call to - Receive, TryReceive, Scan and/or TryScan may be active. - The function to return None if the message is to be skipped - or Some if the message is to be processed and removed from the queue. - An optional timeout in milliseconds. Defaults to -1 which corresponds - to System.Threading.Timeout.Infinite. - An asynchronous computation that scanner built off the read message. - Thrown when the timeout is exceeded. - - - Waits for a message. This will consume the first message in arrival order. - - This method is for use within the body of the agent. - - This method is for use within the body of the agent. For each agent, at most - one concurrent reader may be active, so no more than one concurrent call to - Receive, TryReceive, Scan and/or TryScan may be active. - An optional timeout in milliseconds. Defaults to -1 which corresponds - to System.Threading.Timeout.Infinite. - An asynchronous computation that returns the received message. - Thrown when the timeout is exceeded. - - - Like AsyncPostAndReply, but returns None if no reply within the timeout period. - The function to incorporate the AsyncReplyChannel into - the message to be sent. - An optional timeout parameter (in milliseconds) to wait for a reply message. - Defaults to -1 which corresponds to System.Threading.Timeout.Infinite. - An asynchronous computation that will return the reply or None if the timeout expires. - - - Posts a message to an agent and await a reply on the channel, synchronously. - - The message is generated by applying buildMessage to a new reply channel - to be incorporated into the message. The receiving agent must process this - message and invoke the Reply method on this reply channel precisely once. - The function to incorporate the AsyncReplyChannel into - the message to be sent. - An optional timeout parameter (in milliseconds) to wait for a reply message. - Defaults to -1 which corresponds to System.Threading.Timeout.Infinite. - The reply from the agent. - - - Posts a message to an agent and await a reply on the channel, asynchronously. - - The message is generated by applying buildMessage to a new reply channel - to be incorporated into the message. The receiving agent must process this - message and invoke the Reply method on this reply channel precisely once. - The function to incorporate the AsyncReplyChannel into - the message to be sent. - An optional timeout parameter (in milliseconds) to wait for a reply message. - Defaults to -1 which corresponds to System.Threading.Timeout.Infinite. - An asychronous computation that will wait for the reply from the agent. - - - Posts a message to the message queue of the MailboxProcessor, asynchronously. - The message to post. - - - Creates an agent. The body function is used to generate the asynchronous - computation executed by the agent. This function is not executed until - Start is called. - The function to produce an asynchronous computation that will be executed - as the read loop for the MailboxProcessor when Start is called. - An optional cancellation token for the body. - Defaults to Async.DefaultCancellationToken. - The created MailboxProcessor. - - - A message-processing agent which executes an asynchronous computation. - - The agent encapsulates a message queue that supports multiple-writers and - a single reader agent. Writers send messages to the agent by using the Post - method and its variations. - - The agent may wait for messages using the Receive or TryReceive methods or - scan through all available messages using the Scan or TryScan method. - - - - - - Connects a listener function to the observable. The listener will - be invoked for each observation. The listener can be removed by - calling Dispose on the returned IDisposable object. - The function to be called for each observation. - An object that will remove the listener if disposed. - - - Permanently connects a listener function to the observable. The listener will - be invoked for each observation. - The function to be called for each observation. - - - Returns an asynchronous computation that will write the given bytes to the stream. - The buffer to write from. - An optional offset as a number of bytes in the stream. - An optional number of bytes to write to the stream. - An asynchronous computation that will write the given bytes to the stream. - Thrown when the sum of offset and count is longer than - the buffer length. - Thrown when offset or count is negative. - - - Returns an asynchronous computation that will read the given number of bytes from the stream. - The number of bytes to read. - An asynchronous computation that returns the read byte[] when run. - - - Returns an asynchronous computation that will read from the stream into the given buffer. - The buffer to read into. - An optional offset as a number of bytes in the stream. - An optional number of bytes to read from the stream. - An asynchronous computation that will read from the stream into the given buffer. - Thrown when the sum of offset and count is longer than - the buffer length. - Thrown when offset or count is negative. - - - A module of extension members providing asynchronous operations for some basic CLI types related to concurrency and I/O. - - - Returns a new event that triggers on the second and subsequent triggerings of the input event. - The Nth triggering of the input event passes the arguments from the N-1th and Nth triggering as - a pair. The argument passed to the N-1th triggering is held in hidden internal state until the - Nth triggering occurs. - The input event. - An event that triggers on pairs of consecutive values passed from the source event. - - - Runs the given function each time the given event is triggered. - The function to call when the event is triggered. - The input event. - - - Returns a new event consisting of the results of applying the given accumulating function - to successive values triggered on the input event. An item of internal state - records the current value of the state parameter. The internal state is not locked during the - execution of the accumulation function, so care should be taken that the - input IEvent not triggered by multiple threads simultaneously. - The function to update the state with each event value. - The initial state. - The input event. - An event that fires on the updated state values. - - - Returns a new event which fires on a selection of messages from the original event. - The selection function takes an original message to an optional new message. - The function to select and transform event values to pass on. - The input event. - An event that fires only when the chooser returns Some. - - - Returns a new event that listens to the original event and triggers the - first resulting event if the application of the function to the event arguments - returned a Choice1Of2, and the second event if it returns a Choice2Of2. - The function to transform event values into one of two types. - The input event. - A tuple of events. The first fires whenever splitter evaluates to Choice1of1 and - the second fires whenever splitter evaluates to Choice2of2. - - - Returns a new event that listens to the original event and triggers the - first resulting event if the application of the predicate to the event arguments - returned true, and the second event if it returned false. - The function to determine which output event to trigger. - The input event. - A tuple of events. The first is triggered when the predicate evaluates to true - and the second when the predicate evaluates to false. - - - Returns a new event that listens to the original event and triggers the resulting - event only when the argument to the event passes the given function. - The function to determine which triggers from the event to propagate. - The input event. - An event that only passes values that pass the predicate. - - - Returns a new event that passes values transformed by the given function. - The function to transform event values. - The input event. - An event that passes the transformed values. - - - Fires the output event when either of the input events fire. - The first input event. - The second input event. - An event that fires when either of the input events fire. - - - - - - Forces the execution of this value and return its result. Same as Value. Mutual exclusion is used to - prevent other threads also computing the value. - The value of the Lazy object. - - - Creates a lazy computation that evaluates to the given value when forced. - The input value. - The created Lazy object. - - - Creates a lazy computation that evaluates to the result of the given function when forced. - The function to provide the value when needed. - The created Lazy object. - - - Extensions related to Lazy values. - - - Returns a new observable that triggers on the second and subsequent triggerings of the input observable. - The Nth triggering of the input observable passes the arguments from the N-1th and Nth triggering as - a pair. The argument passed to the N-1th triggering is held in hidden internal state until the - Nth triggering occurs. - - For each observer, the registered intermediate observing object is not thread safe. - That is, observations arising from the source must not be triggered concurrently - on different threads. - The input Observable. - An Observable that triggers on successive pairs of observations from the input Observable. - - - Creates an observer which subscribes to the given observable and which calls - the given function for each observation. - The function to be called on each observation. - The input Observable. - An object that will remove the callback if disposed. - - - Creates an observer which permanently subscribes to the given observable and which calls - the given function for each observation. - The function to be called on each observation. - The input Observable. - - - Returns an observable which, for each observer, allocates an item of state - and applies the given accumulating function to successive values arising from - the input. The returned object will trigger observations for each computed - state value, excluding the initial value. The returned object propagates - all errors arising from the source and completes when the source completes. - - For each observer, the registered intermediate observing object is not thread safe. - That is, observations arising from the source must not be triggered concurrently - on different threads. - The function to update the state with each observation. - The initial state. - The input Observable. - An Observable that triggers on the updated state values. - - - Returns an observable which chooses a projection of observations from the source - using the given function. The returned object will trigger observations x - for which the splitter returns Some x. The returned object also propagates - all errors arising from the source and completes when the source completes. - The function that returns Some for observations to be propagated - and None for observations to ignore. - The input Observable. - An Observable that only propagates some of the observations from the source. - - - Returns two observables which split the observations of the source by the - given function. The first will trigger observations x for which the - splitter returns Choice1Of2 x. The second will trigger observations - y for which the splitter returns Choice2Of2 y The splitter is - executed once for each subscribed observer. Both also propagate error - observations arising from the source and each completes when the source - completes. - The function that takes an observation an transforms - it into one of the two output Choice types. - The input Observable. - A tuple of Observables. The first triggers when splitter returns Choice1of2 - and the second triggers when splitter returns Choice2of2. - - - Returns two observables which partition the observations of the source by - the given function. The first will trigger observations for those values - for which the predicate returns true. The second will trigger observations - for those values where the predicate returns false. The predicate is - executed once for each subscribed observer. Both also propagate all error - observations arising from the source and each completes when the source - completes. - The function to determine which output Observable will trigger - a particular observation. - The input Observable. - A tuple of Observables. The first triggers when the predicate returns true, and - the second triggers when the predicate returns false. - - - Returns an observable which filters the observations of the source - by the given function. The observable will see only those observations - for which the predicate returns true. The predicate is executed once for - each subscribed observer. The returned object also propagates error - observations arising from the source and completes when the source completes. - The function to apply to observations to determine if it should - be kept. - The input Observable. - An Observable that filters observations based on filter. - - - Returns an observable which transforms the observations of the source by the - given function. The transformation function is executed once for each - subscribed observer. The returned object also propagates error observations - arising from the source and completes when the source completes. - The function applied to observations from the source. - The input Observable. - An Observable of the type specified by mapping. - - - Returns an observable for the merged observations from the sources. - The returned object propagates success and error values arising - from either source and completes when both the sources have completed. - - For each observer, the registered intermediate observing object is not - thread safe. That is, observations arising from the sources must not - be triggered concurrently on different threads. - The first Observable. - The second Observable. - An Observable that propagates information from both sources. - - - Basic operations on first class event and other observable objects. - - - Returns an asynchronous computation that, when run, will wait for the download of the given URI. - The URI to retrieve. - An asynchronous computation that will wait for the download of the URI. - - - Returns an asynchronous computation that, when run, will wait for a response to the given WebRequest. - An asynchronous computation that waits for response to the WebRequest. - - - A module of extension members providing asynchronous operations for some basic Web operations. - - - Creates an instance of the attribute - AbstractClassAttribute - - - Adding this attribute to class definition makes it abstract, which means it need not - implement all its methods. Instances of abstract classes may not be constructed directly. - - - Creates an instance of the attribute - AllowNullLiteralAttribute - - - Adding this attribute to a type lets the 'null' literal be used for the type - within F# code. This attribute may only be added to F#-defined class or - interface types. - - - Indicates the namespace or module to be automatically opened when an assembly is referenced - or an enclosing module opened. - - - Creates an attribute used to mark a namespace or module path to be 'automatically opened' when an assembly is referenced - The namespace or module to be automatically opened when an assembly is referenced - or an enclosing module opened. - AutoOpenAttribute - - - Creates an attribute used to mark a module as 'automatically opened' when the enclosing namespace is opened - AutoOpenAttribute - - - This attribute is used for two purposes. When applied to an assembly, it must be given a string - argument, and this argument must indicate a valid module or namespace in that assembly. Source - code files compiled with a reference to this assembly are processed in an environment - where the given path is automatically opened. - - When applied to a module within an assembly, then the attribute must not be given any arguments. - When the enclosing namespace is opened in user source code, the module is also implicitly opened. - - - The value of the attribute, indicating whether the type is automatically marked serializable or not - - - Creates an instance of the attribute - Indicates whether the type should be serializable by default. - AutoSerializableAttribute - - - Adding this attribute to a type with value 'false' disables the behaviour where F# makes the - type Serializable by default. - - - Creates an instance of the attribute - CLIEventAttribute - - - Adding this attribute to a property with event type causes it to be compiled with as a CLI - metadata event, through a syntactic translation to a pair of 'add_EventName' and - 'remove_EventName' methods. - - - Creates an instance of the attribute - CLIMutableAttribute - - - Adding this attribute to a record type causes it to be compiled to a CLI representation - with a default constructor with property getters and setters. - - - Choice 2 of 2 choices - - - Choice 1 of 2 choices - - - Helper types for active patterns with 2 choices. - - - Choice 3 of 3 choices - - - Choice 2 of 3 choices - - - Choice 1 of 3 choices - - - Helper types for active patterns with 3 choices. - - - Choice 4 of 4 choices - - - Choice 3 of 4 choices - - - Choice 2 of 4 choices - - - Choice 1 of 4 choices - - - Helper types for active patterns with 4 choices. - - - Choice 5 of 5 choices - - - Choice 4 of 5 choices - - - Choice 3 of 5 choices - - - Choice 2 of 5 choices - - - Choice 1 of 5 choices - - - Helper types for active patterns with 5 choices. - - - Choice 6 of 6 choices - - - Choice 5 of 6 choices - - - Choice 4 of 6 choices - - - Choice 3 of 6 choices - - - Choice 2 of 6 choices - - - Choice 1 of 6 choices - - - Helper types for active patterns with 6 choices. - - - Choice 7 of 7 choices - - - Choice 6 of 7 choices - - - Choice 5 of 7 choices - - - Choice 4 of 7 choices - - - Choice 3 of 7 choices - - - Choice 2 of 7 choices - - - Choice 1 of 7 choices - - - Helper types for active patterns with 7 choices. - - - Creates an instance of the attribute - ClassAttribute - - - Adding this attribute to a type causes it to be represented using a CLI class. - - - Creates an instance of the attribute - ComparisonConditionalOnAttribute - - - This attribute is used to indicate a generic container type satisfies the F# 'comparison' - constraint only if a generic argument also satisfies this constraint. For example, adding - this attribute to parameter 'T on a type definition C<'T> means that a type C<X> only supports - comparison if the type X also supports comparison and all other conditions for C<X> to support - comparison are also met. The type C<'T> can still be used with other type arguments, but a type such - as C<(int -> int)> will not support comparison because the type (int -> int) is an F# function type - and does not support comparison. - - This attribute will be ignored if it is used on the generic parameters of functions or methods. - - - Indicates the number of arguments in each argument group - - - Creates an instance of the attribute - Indicates the number of arguments in each argument group. - CompilationArgumentCountsAttribute - - - This attribute is generated automatically by the F# compiler to tag functions and members - that accept a partial application of some of their arguments and return a residual function - - - Indicates the variant number of the entity, if any, in a linear sequence of elements with F# source code - - - Indicates the relationship between the compiled entity and F# source code - - - Indicates the sequence number of the entity, if any, in a linear sequence of elements with F# source code - - - Creates an instance of the attribute - Indicates the type of source construct. - CompilationMappingAttribute - - - Creates an instance of the attribute - Indicates the type of source construct. - CompilationMappingAttribute - - - Creates an instance of the attribute - Indicates the type of source construct. - CompilationMappingAttribute - - - This attribute is inserted automatically by the F# compiler to tag types - and methods in the generated CLI code with flags indicating the correspondence - with original source constructs. It is used by the functions in the - Microsoft.FSharp.Reflection namespace to reverse-map compiled constructs to - their original forms. It is not intended for use from user code. - - - Indicates one or more adjustments to the compiled representation of an F# type or member - - - Creates an instance of the attribute - Indicates adjustments to the compiled representation of the type or member. - CompilationRepresentationAttribute - - - This attribute is used to adjust the runtime representation for a type. - For example, it may be used to note that the null representation - may be used for a type. This affects how some constructs are compiled. - - - Compile a property as a CLI event. - - - Permit the use of null as a representation for nullary discriminators in a discriminated union. - - - append 'Module' to the end of a module whose name clashes with a type name in the same namespace. - - - Compile a member as 'instance' even if null is used as a representation for this type. - - - Compile an instance member as 'static' . - - - No special compilation representation. - - - - - - Indicates one or more adjustments to the compiled representation of an F# type or member. - - - Indicates the name of the entity in F# source code - - - Creates an instance of the attribute - The name of the method in source. - CompilationSourceNameAttribute - - - This attribute is inserted automatically by the F# compiler to tag - methods which are given the 'CompiledName' attribute. It is not intended - for use from user code. - - - The name of the value as it appears in compiled code - - - Creates an instance of the attribute - The name to use in compiled code. - CompiledNameAttribute - - - Adding this attribute to a value or function definition in an F# module changes the name used - for the value in compiled CLI code. - - - Indicates if the construct should always be hidden in an editing environment. - - - Indicates if the message should indicate a compiler error. Error numbers less than - 10000 are considered reserved for use by the F# compiler and libraries. - - - Indicates the number associated with the message. - - - Indicates the warning message to be emitted when F# source code uses this construct - - - Indicates if the construct should always be hidden in an editing environment. - - - Indicates if the message should indicate a compiler error. Error numbers less than - 10000 are considered reserved for use by the F# compiler and libraries. - - - Creates an instance of the attribute. - - - Indicates that a message should be emitted when F# source code uses this construct. - - - Creates an instance of the attribute - CustomComparisonAttribute - - - Adding this attribute to a type indicates it is a type with a user-defined implementation of comparison. - - - Creates an instance of the attribute - CustomEqualityAttribute - - - Adding this attribute to a type indicates it is a type with a user-defined implementation of equality. - - - Indicates if the custom operation maintains the variable space of the query of computation expression through the use of a bind operation - - - Indicates if the custom operation maintains the variable space of the query of computation expression - - - Indicates the name used for the 'on' part of the custom query operator for join-like operators - - - Indicates if the custom operation is an operation similar to a zip in a sequence computation, supporting two inputs - - - Indicates if the custom operation is an operation similar to a join in a sequence computation, supporting two inputs and a correlation constraint - - - Indicates if the custom operation is an operation similar to a group join in a sequence computation, supporting two inputs and a correlation constraint, and generating a group - - - Indicates if the custom operation supports the use of 'into' immediately after the use of the operation in a query or other computation expression to consume the results of the operation - - - Get the name of the custom operation when used in a query or other computation expression - - - Indicates if the custom operation maintains the variable space of the query of computation expression through the use of a bind operation - - - Indicates if the custom operation maintains the variable space of the query of computation expression - - - Indicates the name used for the 'on' part of the custom query operator for join-like operators - - - Indicates if the custom operation is an operation similar to a zip in a sequence computation, supporting two inputs - - - Indicates if the custom operation is an operation similar to a join in a sequence computation, supporting two inputs and a correlation constraint - - - Indicates if the custom operation is an operation similar to a group join in a sequence computation, supporting two inputs and a correlation constraint, and generating a group - - - Indicates if the custom operation supports the use of 'into' immediately after the use of the operation in a query or other computation expression to consume the results of the operation - - - Creates an instance of the attribute - CustomOperationAttribute - - - - Indicates that a member on a computation builder type is a custom query operator, - and indicates the name of that operator. - - - - The value of the attribute, indicating whether the type has a default augmentation or not - - - Creates an instance of the attribute - Indicates whether to generate helper members on the CLI class representing a discriminated - union. - DefaultAugmentationAttribute - - - Adding this attribute to a discriminated union with value false - turns off the generation of standard helper member tester, constructor - and accessor members for the generated CLI class for that type. - - - Indicates if a constraint is asserted that the field type supports 'null' - - - Creates an instance of the attribute - Indicates whether to assert that the field type supports null. - DefaultValueAttribute - - - Creates an instance of the attribute - DefaultValueAttribute - - - Adding this attribute to a field declaration means that the field is - not initialized. During type checking a constraint is asserted that the field type supports 'null'. - If the 'check' value is false then the constraint is not asserted. - - - Creates an instance of the attribute - EntryPointAttribute - - - Adding this attribute to a function indicates it is the entrypoint for an application. - If this attribute is not specified for an EXE then the initialization implicit in the - module bindings in the last file in the compilation sequence are used as the entrypoint. - - - Creates an instance of the attribute - EqualityConditionalOnAttribute - - - This attribute is used to indicate a generic container type satisfies the F# 'equality' - constraint only if a generic argument also satisfies this constraint. For example, adding - this attribute to parameter 'T on a type definition C<'T> means that a type C<X> only supports - equality if the type X also supports equality and all other conditions for C<X> to support - equality are also met. The type C<'T> can still be used with other type arguments, but a type such - as C<(int -> int)> will not support equality because the type (int -> int) is an F# function type - and does not support equality. - - This attribute will be ignored if it is used on the generic parameters of functions or methods. - - - Indicates the warning message to be emitted when F# source code uses this construct - - - Creates an instance of the attribute - The warning message to be emitted when code uses this construct. - ExperimentalAttribute - - - This attribute is used to tag values that are part of an experimental library - feature. - - - Convert an value of type System.Converter to a F# first class function value - The input System.Converter. - An F# function of the same type. - - - Convert an F# first class function value to a value of type System.Converter - The input function. - A System.Converter of the function type. - - - Convert an F# first class function value to a value of type System.Converter - The input function. - System.Converter<'T,'U> - - - Invoke an F# first class function value with two curried arguments. In some cases this - will result in a more efficient application than applying the arguments successively. - The input function. - The first arg. - The second arg. - The function result. - - - Invoke an F# first class function value with three curried arguments. In some cases this - will result in a more efficient application than applying the arguments successively. - The input function. - The first arg. - The second arg. - The third arg. - The function result. - - - Invoke an F# first class function value with four curried arguments. In some cases this - will result in a more efficient application than applying the arguments successively. - The input function. - The first arg. - The second arg. - The third arg. - The fourth arg. - The function result. - - - Invoke an F# first class function value with five curried arguments. In some cases this - will result in a more efficient application than applying the arguments successively. - The input function. - The first arg. - The second arg. - The third arg. - The fourth arg. - The fifth arg. - The function result. - - - Invoke an F# first class function value with one argument - - 'U - - - Convert an value of type System.Converter to a F# first class function value - The input System.Converter. - An F# function of the same type. - - - Construct an instance of an F# first class function value - The created F# function. - - - The CLI type used to represent F# function values. This type is not - typically used directly, though may be used from other CLI languages. - - - The release number of the F# version associated with the attribute - - - The minor version number of the F# version associated with the attribute - - - The major version number of the F# version associated with the attribute - - - Creates an instance of the attribute - The major version number. - The minor version number. - The release number. - FSharpInterfaceDataVersionAttribute - - - This attribute is added to generated assemblies to indicate the - version of the data schema used to encode additional F# - specific information in the resource attached to compiled F# libraries. - - - Specialize the type function at a given type - The specialized type. - - - Construct an instance of an F# first class type function value - FSharpTypeFunc - - - The CLI type used to represent F# first-class type function values. This type is for use - by compiled F# code. - - - Type of a formatting expression. - Function type generated by printf. - Type argument passed to %a formatters - Value generated by the overall printf action (e.g. sprint generates a string) - Value generated after post processing (e.g. failwithf generates a string internally then raises an exception) - - - Type of a formatting expression. - Function type generated by printf. - Type argument passed to %a formatters - Value generated by the overall printf action (e.g. sprint generates a string) - Value generated after post processing (e.g. failwithf generates a string internally then raises an exception) - Tuple of values generated by scan or match. - - - Convert the given Converter delegate object to an F# function value - The input Converter. - The F# function. - - - Convert the given Action delegate object to an F# function value - The input action. - The F# function. - - - A utility function to convert function values from tupled to curried form - The input tupled function. - The output curried function. - - - A utility function to convert function values from tupled to curried form - The input tupled function. - The output curried function. - - - A utility function to convert function values from tupled to curried form - The input tupled function. - The output curried function. - - - A utility function to convert function values from tupled to curried form - The input tupled function. - The output curried function. - - - Helper functions for converting F# first class function values to and from CLI representaions - of functions using delegates. - - - Creates an instance of the attribute - GeneralizableValueAttribute - - - Adding this attribute to a non-function value with generic parameters indicates that - uses of the construct can give rise to generic code through type inference. - - - Creates an instance of the attribute - InterfaceAttribute - - - Adding this attribute to a type causes it to be represented using a CLI interface. - - - Creates an instance of the attribute - LiteralAttribute - - - Adding this attribute to a value causes it to be compiled as a CLI constant literal. - - - Creates an instance of the attribute - MeasureAnnotatedAbbreviationAttribute - - - Adding this attribute to a type causes it to be interpreted as a refined type, currently limited to measure-parameterized types. - This may only be used under very limited conditions. - - - Creates an instance of the attribute - MeasureAttribute - - - Adding this attribute to a type causes it to be interpreted as a unit of measure. - This may only be used under very limited conditions. - - - Creates an instance of the attribute - NoComparisonAttribute - - - Adding this attribute to a type indicates it is a type where comparison is an abnormal operation. - This means that the type does not satisfy the F# 'comparison' constraint. Within the bounds of the - F# type system, this helps ensure that the F# generic comparison function is not instantiated directly - at this type. The attribute and checking does not constrain the use of comparison with base or child - types of this type. - - - Creates an instance of the attribute - NoDynamicInvocationAttribute - - - This attribute is used to tag values that may not be dynamically invoked at runtime. This is - typically added to inlined functions whose implementations include unverifiable code. It - causes the method body emitted for the inlined function to raise an exception if - dynamically invoked, rather than including the unverifiable code in the generated - assembly. - - - Creates an instance of the attribute - NoEqualityAttribute - - - Adding this attribute to a type indicates it is a type where equality is an abnormal operation. - This means that the type does not satisfy the F# 'equality' constraint. Within the bounds of the - F# type system, this helps ensure that the F# generic equality function is not instantiated directly - at this type. The attribute and checking does not constrain the use of comparison with base or child - types of this type. - - - The representation of "Value of type 'T" - The input value. - An option representing the value. - - - The representation of "No value" - - - Get the value of a 'Some' option. A NullReferenceException is raised if the option is 'None'. - - - Create an option value that is a 'None' value. - - - Return 'true' if the option is a 'Some' value. - - - Return 'true' if the option is a 'None' value. - - - Create an option value that is a 'Some' value. - The input value - An option representing the value. - - - The type of optional values. When used from other CLI languages the - empty option is the null value. - - Use the constructors Some and None to create values of this type. - Use the values in the Option module to manipulate values of this type, - or pattern match against the values directly. - - None values will appear as the value null to other CLI languages. - Instance methods on this type will appear as static methods to other CLI languages - due to the use of null as a value representation. - - - Creates an instance of the attribute - OptionalArgumentAttribute - - - This attribute is added automatically for all optional arguments. - - - The raw text of the format string. - - - Construct a format string - The input string. - The PrintfFormat containing the formatted result. - - - Type of a formatting expression. - Function type generated by printf. - Type argument passed to %a formatters - Value generated by the overall printf action (e.g. sprint generates a string) - Value generated after post processing (e.g. failwithf generates a string internally then raises an exception) - - - Construct a format string - The input string. - The created format string. - - - Type of a formatting expression. - Function type generated by printf. - Type argument passed to %a formatters - Value generated by the overall printf action (e.g. sprint generates a string) - Value generated after post processing (e.g. failwithf generates a string internally then raises an exception) - Tuple of values generated by scan or match. - - - Creates an instance of the attribute - ProjectionParameterAttribute - - - Indicates that, when a custom operator is used in a computation expression, - a parameter is automatically parameterized by the variable space of the computation expression - - - - The current value of the reference cell - - - - The current value of the reference cell - - - The current value of the reference cell - - - The type of mutable references. Use the functions [:=] and [!] to get and - set values of this type. - - - Creates an instance of the attribute - ReferenceEqualityAttribute - - - Adding this attribute to a record or union type disables the automatic generation - of overrides for 'System.Object.Equals(obj)', 'System.Object.GetHashCode()' - and 'System.IComparable' for the type. The type will by default use reference equality. - - - Creates an instance of the attribute - ReflectedDefinitionAttribute - - - Adding this attribute to the let-binding for the definition of a top-level - value makes the quotation expression that implements the value available - for use at runtime. - - - Creates an instance of the attribute - RequireQualifiedAccessAttribute - - - This attribute is used to indicate that references to the elements of a module, record or union - type require explicit qualified access. - - - Creates an instance of the attribute - RequiresExplicitTypeArgumentsAttribute - - - Adding this attribute to a type, value or member requires that - uses of the construct must explicitly instantiate any generic type parameters. - - - The value of the attribute, indicating whether the type is sealed or not. - - - Creates an instance of the attribute - Indicates whether the class is sealed. - SealedAttribute - - - Creates an instance of the attribute. - The created attribute. - - - Adding this attribute to class definition makes it sealed, which means it may not - be extended or implemented. - - - Indicates that the compiled entity had private or internal representation in F# source code. - - - The mask of values related to the kind of the compiled entity. - - - Indicates that the compiled entity is part of the representation of an F# value declaration. - - - Indicates that the compiled entity is part of the representation of an F# union case declaration. - - - Indicates that the compiled entity is part of the representation of an F# module declaration. - - - Indicates that the compiled entity is part of the representation of an F# closure. - - - Indicates that the compiled entity is part of the representation of an F# exception declaration. - - - Indicates that the compiled entity is part of the representation of an F# record or union case field declaration. - - - Indicates that the compiled entity is part of the representation of an F# class or other object type declaration. - - - Indicates that the compiled entity is part of the representation of an F# record type declaration. - - - Indicates that the compiled entity is part of the representation of an F# union type declaration. - - - Indicates that the compiled entity has no relationship to an element in F# source code. - - - - - - Indicates the relationship between a compiled entity in a CLI binary and an element in F# source code. - - - Creates an instance of the attribute - StructAttribute - - - Adding this attribute to a type causes it to be represented using a CLI struct. - - - Creates an instance of the attribute - StructuralComparisonAttribute - - - Adding this attribute to a record, union, exception, or struct type confirms the - automatic generation of implementations for 'System.IComparable' for the type. - - - Creates an instance of the attribute - StructuralEqualityAttribute - - - Adding this attribute to a record, union or struct type confirms the automatic - generation of overrides for 'System.Object.Equals(obj)' and - 'System.Object.GetHashCode()' for the type. - - - Indicates the text to display by default when objects of this type are displayed - using '%A' printf formatting patterns and other two-dimensional text-based display - layouts. - - - Creates an instance of the attribute - Indicates the text to display when using the '%A' printf formatting. - StructuredFormatDisplayAttribute - - - 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 this version of F# the only valid values are of the form PreText {PropertyName} PostText. - The property name indicates a property to evaluate and to display instead of the object itself. - - - The type 'unit', which has only one value "()". This value is special and - always uses the representation 'null'. - - - Creates an instance of the attribute - UnverifiableAttribute - - - This attribute is used to tag values whose use will result in the generation - of unverifiable code. These values are inevitably marked 'inline' to ensure that - the unverifiable constructs are not present in the actual code for the F# library, - but are rather copied to the source code of the caller. - - - Creates an instance of the attribute - VolatileFieldAttribute - - - Adding this attribute to an F# mutable binding causes the "volatile" - prefix to be used for all accesses to the field. - - - Thirty-two dimensional arrays, typically zero-based. Non-zero-based arrays - can be created using methods on the System.Array type. - - - Thirty-one dimensional arrays, typically zero-based. Non-zero-based arrays - can be created using methods on the System.Array type. - - - Thirty dimensional arrays, typically zero-based. Non-zero-based arrays - can be created using methods on the System.Array type. - - - Twenty-nine dimensional arrays, typically zero-based. Non-zero-based arrays - can be created using methods on the System.Array type. - - - Twenty-eight dimensional arrays, typically zero-based. Non-zero-based arrays - can be created using methods on the System.Array type. - - - Twenty-seven dimensional arrays, typically zero-based. Non-zero-based arrays - can be created using methods on the System.Array type. - - - Twenty-six dimensional arrays, typically zero-based. Non-zero-based arrays - can be created using methods on the System.Array type. - - - Twenty-five dimensional arrays, typically zero-based. Non-zero-based arrays - can be created using methods on the System.Array type. - - - Twenty-four dimensional arrays, typically zero-based. Non-zero-based arrays - can be created using methods on the System.Array type. - - - Twenty-three dimensional arrays, typically zero-based. Non-zero-based arrays - can be created using methods on the System.Array type. - - - Twenty-two dimensional arrays, typically zero-based. Non-zero-based arrays - can be created using methods on the System.Array type. - - - Twenty-one dimensional arrays, typically zero-based. Non-zero-based arrays - can be created using methods on the System.Array type. - - - Twenty dimensional arrays, typically zero-based. Non-zero-based arrays - can be created using methods on the System.Array type. - - - Nineteen dimensional arrays, typically zero-based. Non-zero-based arrays - can be created using methods on the System.Array type. - - - Eighteen dimensional arrays, typically zero-based. Non-zero-based arrays - can be created using methods on the System.Array type. - - - Seventeen dimensional arrays, typically zero-based. Non-zero-based arrays - can be created using methods on the System.Array type. - - - Sixteen dimensional arrays, typically zero-based. Non-zero-based arrays - can be created using methods on the System.Array type. - - - Fifteen dimensional arrays, typically zero-based. Non-zero-based arrays - can be created using methods on the System.Array type. - - - Fourteen dimensional arrays, typically zero-based. Non-zero-based arrays - can be created using methods on the System.Array type. - - - Thirteen dimensional arrays, typically zero-based. Non-zero-based arrays - can be created using methods on the System.Array type. - - - Twelve dimensional arrays, typically zero-based. Non-zero-based arrays - can be created using methods on the System.Array type. - - - Eleven dimensional arrays, typically zero-based. Non-zero-based arrays - can be created using methods on the System.Array type. - - - Ten dimensional arrays, typically zero-based. Non-zero-based arrays - can be created using methods on the System.Array type. - - - Nine dimensional arrays, typically zero-based. Non-zero-based arrays - can be created using methods on the System.Array type. - - - Eight dimensional arrays, typically zero-based. Non-zero-based arrays - can be created using methods on the System.Array type. - - - Seven dimensional arrays, typically zero-based. Non-zero-based arrays - can be created using methods on the System.Array type. - - - Six dimensional arrays, typically zero-based. Non-zero-based arrays - can be created using methods on the System.Array type. - - - Five dimensional arrays, typically zero-based. Non-zero-based arrays - can be created using methods on the System.Array type. - - - Four dimensional arrays, typically zero-based. Non-zero-based arrays - can be created using methods on the System.Array type. - - Use the values in the Array4D module - to manipulate values of this type, or the notation arr.[x1,x2,x3,x4] to get and set array - values. - - - Three dimensional arrays, typically zero-based. Non-zero-based arrays - can be created using methods on the System.Array type. - - Use the values in the Array3D module - to manipulate values of this type, or the notation arr.[x1,x2,x3] to get and set array - values. - - - Two dimensional arrays, typically zero-based. - - Use the values in the Array2D module - to manipulate values of this type, or the notation arr.[x,y] to get/set array - values. - - Non-zero-based arrays can also be created using methods on the System.Array type. - - - Single dimensional, zero-based arrays, written int[], string[] etc. - Use the values in the Array module to manipulate values - of this type, or the notation arr.[x] to get/set array - values. - - - Single dimensional, zero-based arrays, written int[], string[] etc. - - Use the values in the Array module to manipulate values - of this type, or the notation arr.[x] to get/set array - values. - - - - - - An abbreviation for the CLI type System.Boolean. - - - Represents a managed pointer in F# code. - - - An abbreviation for the CLI type System.Byte. - - - An abbreviation for the CLI type System.Char. - - - An abbreviation for the CLI type System.Decimal. - - - The type of decimal numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.Decimal. - - - An abbreviation for the CLI type System.Double. - - - An abbreviation for the CLI type System.Exception. - - - An abbreviation for the CLI type System.Double. - - - An abbreviation for the CLI type System.Single. - - - The type of floating point numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.Single. - - - The type of floating point numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.Double. - - - This type is for internal use by the F# code generator. - - - An abbreviation for the CLI type System.Int32. - - - An abbreviation for the CLI type System.Int16. - - - The type of 16-bit signed integer numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.Int16. - - - An abbreviation for the CLI type System.Int32. - - - An abbreviation for the CLI type System.Int64. - - - The type of 64-bit signed integer numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.Int64. - - - An abbreviation for the CLI type System.SByte. - - - The type of 32-bit signed integer numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.Int32. - - - An abbreviation for the CLI type System.IntPtr. - - - Represents an unmanaged pointer in F# code. - - This type should only be used when writing F# code that interoperates - with native code. Use of this type in F# code may result in - unverifiable code being generated. Conversions to and from the - nativeint type may be required. Values of this type can be generated - by the functions in the NativeInterop.NativePtr module. - - - An abbreviation for the CLI type System.Object. - - - The type of optional values. When used from other CLI languages the - empty option is the null value. - - Use the constructors Some and None to create values of this type. - Use the values in the Option module to manipulate values of this type, - or pattern match against the values directly. - - 'None' values will appear as the value null to other CLI languages. - Instance methods on this type will appear as static methods to other CLI languages - due to the use of null as a value representation. - - - The type of mutable references. Use the functions [:=] and [!] to get and - set values of this type. - - - An abbreviation for the CLI type System.SByte. - - - The type of 8-bit signed integer numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.SByte. - - - An abbreviation for the CLI type System.Single. - - - An abbreviation for the CLI type System.String. - - - An abbreviation for the CLI type System.UInt16. - - - An abbreviation for the CLI type System.UInt32. - - - An abbreviation for the CLI type System.UInt64. - - - An abbreviation for the CLI type System.Byte. - - - An abbreviation for the CLI type System.UIntPtr. - - - The type 'unit', which has only one value "()". This value is special and - always uses the representation 'null'. - - - - - - - - - - - - Non-exhaustive match failures will raise the MatchFailureException exception - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - A new enumerator for the sequence. - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - A reference to the sequence. - - A 0, 1, and 2 respectively indicate Stop, Yield, and Goto conditions for the sequence generator. - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - A new sequence generator for the expression. - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - - - Namespace name the provider injects types into. - - - - - Compilers call this method to query a type provider for a type name. - - Resolver should return a type called name in namespace NamespaceName or null if the type is unknown. - - - - - - The top-level types - - - - - - The sub-namespaces in this namespace. An optional member to prevent generation of namespaces until an outer namespace is explored. - - - - - - - - Triggered when an assumption changes that invalidates the resolutions so far reported by the provider - - - - - Triggered when an assumption changes that invalidates the resolutions so far reported by the provider - - - - - Triggered when an assumption changes that invalidates the resolutions so far reported by the provider - - - - - Get the static parameters for a provided type. - - A type returned by GetTypes or ResolveTypeName - - - - - Namespace name the this TypeProvider injects types into. - - - - - Called by the compiler to ask for an Expression tree to replace the given MethodBase with. - - MethodBase that was given to the compiler by a type returned by a GetType(s) call. - Expressions that represent the parameters to this call. - An expression that the compiler will use in place of the given method base. - - - - Get the physical contents of the given logical provided assembly. - - - - - Apply static arguments to a provided type that accepts static arguments. - - The provider must return a type with the given mangled name. - the provided type definition which has static parameters - the full path of the type, including encoded representations of static parameters - the static parameters, indexed by name - - - - - - - Represents the inverse of a measure expressions when returned as a generic argument of a provided type. - - - Represents the '1' measure expression when returned as a generic argument of a provided type. - - - Represents the product of two measure expressions when returned as a generic argument of a provided type. - - - - - - Creates an instance of the attribute - TypeProviderAssemblyAttribute - The name of the design-time assembly for this type provider. - - - Creates an instance of the attribute - TypeProviderAssemblyAttribute - - - Place attribute on runtime assembly to indicate that there is a corresponding design-time - assembly that contains a type provider. Runtime and designer assembly may be the same. - - - Creates an instance of the attribute - TypeProviderAttribute - - - Place on a class that implements ITypeProvider to extend the compiler - - - - Get the full path to use for temporary files for the type provider instance. - - - - - version of referenced system runtime assembly - - - - - Get the full path to referenced assembly that caused this type provider instance to be created. - - - - - Get the full path to use to resolve relative paths in any file name arguments given to the type provider instance. - - - - - Get the referenced assemblies for the type provider instance. - - - - - Indicates if the type provider host responds to invalidation events for type provider instances. - - - - - Indicates if the type provider instance is used in an environment which executes provided code such as F# Interactive. - - - - - Get the full path to use for temporary files for the type provider instance. - - - - - version of referenced system runtime assembly - - - - - Get the full path to referenced assembly that caused this type provider instance to be created. - - - - - Get the full path to use to resolve relative paths in any file name arguments given to the type provider instance. - - - - - Get the referenced assemblies for the type provider instance. - - - - - Indicates if the type provider host responds to invalidation events for type provider instances. - - - - - Indicates if the type provider instance is used in an environment which executes provided code such as F# Interactive. - - - - - Checks if given type exists in target system runtime library - - - - - - - - If the class that implements ITypeProvider has a constructor that accepts TypeProviderConfig - then it will be constructed with an instance of TypeProviderConfig. - - - - - - - - - - - - - - - - - - - - - - - - - - - - Creates an instance of the attribute - TypeProviderEditorHideMethodsAttribute - - - Indicates that a code editor should hide all System.Object methods from the intellisense menus for instances of a provided type - - - - - - - - - - - - Additional type attribute flags related to provided types - - - - - - Creates an instance of the attribute - TypeProviderXmlDocAttribute - - - - The TypeProviderXmlDocAttribute attribute can be added to types and members. - The language service will display the CommentText property from the attribute - in the appropriate place when the user hovers over a type or member. - - - - - - - - - - - - - - - - Creates an anonymous event with the given handlers. - - A function to handle adding a delegate for the event to trigger. - A function to handle removing a delegate that the event triggers. - A function to produce the delegate type the event can trigger. - - The initialized event. - - - The F# compiler emits calls to this function to implement the use operator for F# sequence - expressions. - - The resource to be used and disposed. - The input sequence. - - The result sequence. - - - The F# compiler emits calls to this function to implement the compiler-intrinsic - conversions from untyped System.Collections.IEnumerable sequences to typed sequences. - - An initializer function. - A function to iterate and test if end of sequence is reached. - A function to retrieve the current element. - - The resulting typed sequence. - - - The F# compiler emits calls to this function to - implement the try/finally operator for F# sequence expressions. - - The input sequence. - A computation to be included in an enumerator's Dispose method. - - The result sequence. - - - The F# compiler emits calls to this function to - implement the while operator for F# sequence expressions. - - A function that indicates whether iteration should continue. - The input sequence. - - The result sequence. - - - A group of functions used as part of the compiled representation of F# sequence expressions. - - - Builds a query using query syntax and operators. - - - An active pattern to force the execution of values of type Lazy<_>. - - - Special prefix operator for splicing untyped expressions into quotation holes. - - - Special prefix operator for splicing typed expressions into quotation holes. - - - Builds a 2D array from a sequence of sequences of elements. - - - Builds a read-only lookup table from a sequence of key/value pairs. The key objects are indexed using generic hashing and equality. - - - Converts the argument to signed byte. - This is a direct conversion for all - primitive numeric types. For strings, the input is converted using SByte.Parse() with InvariantCulture settings. - Otherwise the operation requires and invokes a ToSByte method on the input type. - - - Converts the argument to byte. - This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Byte.Parse() on strings and otherwise requires a ToByte method on the input type. - - - Converts the argument to 64-bit float. - This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Double.Parse() with InvariantCulture settings. Otherwise the operation requires and invokes a ToDouble method on the input type. - - - Converts the argument to 32-bit float. - This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Single.Parse() with InvariantCulture settings. Otherwise the operation requires and invokes a ToSingle method on the input type. - - - Builds an aysnchronous workflow using computation expression syntax. - - - Builds a set from a sequence of objects. The objects are indexed using generic comparison. - The input sequence of elements. - The created set. - - - Print to a file using the given format, and add a newline. - The file TextWriter. - The formatter. - The formatted result. - - - Print to a file using the given format. - The file TextWriter. - The formatter. - The formatted result. - - - Print to a string buffer and raise an exception with the given - result. Helper printers must return strings. - The formatter. - The formatted result. - - - Print to a string using the given format. - The formatter. - The formatted result. - - - Print to stderr using the given format, and add a newline. - The formatter. - The formatted result. - - - Print to stderr using the given format. - The formatter. - The formatted result. - - - Print to stdout using the given format, and add a newline. - The formatter. - The formatted result. - - - Print to stdout using the given format. - The formatter. - The formatted result. - - - - - - Divides a value by an integer. - The input value. - The input int. - The division result. - - - - - - Resolves to the value 'one' for any primitive numeric type or any type with a static member called 'One' - - - Resolves to the zero value for any primitive numeric type or any type with a static member called 'Zero' - - - A compiler intrinsic that implements dynamic invocations for the DivideByInt primitive. - - - A compiler intrinsic that implements dynamic invocations to the checked '*' operator. - - - A compiler intrinsic that implements dynamic invocations to the '*' operator. - - - A compiler intrinsic that implements dynamic invocations to the checked '+' operator. - - - A compiler intrinsic that implements dynamic invocations to the '+' operator. - - - Resolves to the value 'one' for any primitive numeric type or any type with a static member called 'One'. - - - Resolves to the zero value for any primitive numeric type or any type with a static member called 'Zero'. - - - Parse an uint64 according to the rules used by the overloaded 'uint64' conversion operator when applied to strings - The input string. - The parsed value. - - - Parse an int64 according to the rules used by the overloaded 'int64' conversion operator when applied to strings - The input string. - The parsed value. - - - Parse an uint32 according to the rules used by the overloaded 'uint32' conversion operator when applied to strings - The input string. - The parsed value. - - - Parse an int32 according to the rules used by the overloaded 'int32' conversion operator when applied to strings - The input string. - The parsed value. - - - Creates an sbyte value with units-of-measure - The input sbyte. - The sbyte with units-of-measure. - - - Creates an int16 value with units-of-measure - The input int16. - The int16 with units-of-measure. - - - Creates an int64 value with units-of-measure - The input int64. - The int64 with units of measure. - - - Creates an int32 value with units-of-measure - The input int. - The int with units of measure. - - - Creates a decimal value with units-of-measure - The input decimal. - The decimal with units of measure. - - - Creates a float32 value with units-of-measure - The input float. - The float with units-of-measure. - - - Creates a float value with units-of-measure - The input float. - The float with units-of-measure. - - - Get the underlying value for an enum value - The input enum. - The enumeration as a value. - - - Build an enum value from an underlying value - The input value. - The value as an enumeration. - - - Recursively hash a part of a value according to its structure. - The comparison function. - The input object. - The hashed value. - - - Hash a value according to its structure. Use the given limit to restrict the hash when hashing F# - records, lists and union types. - The limit on the number of nodes. - The input object. - The hashed value. - - - Hash a value according to its structure. This hash is not limited by an overall node count when hashing F# - records, lists and union types. - The input object. - The hashed value. - - - Make an F# hash/equality object for the given type using node-limited hashing when hashing F# - records, lists and union types. - The input limit on the number of nodes. - System.Collections.Generic.IEqualityComparer<'T> - - - Make an F# hash/equality object for the given type - - - Make an F# comparer object for the given type, where it can be null if System.Collections.Generic.Comparer<'T>.Default - - - Make an F# comparer object for the given type - - - A static F# comparer object - - - Return an F# comparer object suitable for hashing and equality. This hashing behaviour - of the returned comparer is not limited by an overall node count when hashing F# - records, lists and union types. This equality comparer has equivalence - relation semantics ([nan] = [nan]). - - - Return an F# comparer object suitable for hashing and equality. This hashing behaviour - of the returned comparer is not limited by an overall node count when hashing F# - records, lists and union types. - - - The physical hash. Hashes on the object identity, except for value types, - where we hash on the contents. - The input object. - The hashed value. - - - Reference/physical equality. - True if the inputs are reference-equal, false otherwise. - The first value. - The second value. - The result of the comparison. - - - Take the maximum of two values structurally according to the order given by GenericComparison - The first value. - The second value. - The maximum value. - - - Take the minimum of two values structurally according to the order given by GenericComparison - The first value. - The second value. - The minimum value. - - - Compare two values - The first value. - The second value. - The result of the comparison. - - - Compare two values - The first value. - The second value. - The result of the comparison. - - - Compare two values - The first value. - The second value. - The result of the comparison. - - - Compare two values - The first value. - The second value. - The result of the comparison. - - - Compare two values. May be called as a recursive case from an implementation of System.IComparable to - ensure consistent NaN comparison semantics. - The function to compare the values. - The first value. - The second value. - The result of the comparison. - - - Compare two values - The first value. - The second value. - The result of the comparison. - - - Compare two values for equality - - The first value. - The second value. - The result of the comparison. - - - Compare two values for equality using equivalence relation semantics ([nan] = [nan]) - The first value. - The second value. - The result of the comparison. - - - Compare two values for equality using partial equivalence relation semantics ([nan] <> [nan]) - The first value. - The second value. - The result of the comparison. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - The F# compiler emits calls to some of the functions in this module as part of the compiled form of some language constructs - - - - The standard overloaded associative (4-indexed) mutation operator - - - - The standard overloaded associative (3-indexed) mutation operator - - - The standard overloaded associative (2-indexed) mutation operator - - - The standard overloaded associative (indexed) mutation operator - - - The standard overloaded associative (4-indexed) lookup operator - - - The standard overloaded associative (3-indexed) lookup operator - - - The standard overloaded associative (2-indexed) lookup operator - - - The standard overloaded associative (indexed) lookup operator - - - A compiler intrinsic for checking initialization soundness of recursive bindings - - - A compiler intrinsic for checking initialization soundness of recursive static bindings - - - A compiler intrinsic for checking initialization soundness of recursive bindings - - - A compiler intrinsic for the efficient compilation of sequence expressions - - - This function implements parsing of decimal constants - - - This function implements calls to default constructors - acccessed by 'new' constraints. - - - Primitive used by pattern match compilation - - - A compiler intrinsic that implements the ':?' operator - - - A compiler intrinsic that implements the ':?' operator - - - A compiler intrinsic that implements the ':?>' operator - - - A compiler intrinsic that implements the ':?>' operator - - - The F# compiler emits calls to some of the functions in this module as part of the compiled form of some language constructs - - - Address-of. Uses of this value may result in the generation of unverifiable code. - The input object. - The unmanaged pointer. - - - Address-of. Uses of this value may result in the generation of unverifiable code. - The input object. - The managed pointer. - - - Binary 'or'. When used as a binary operator the right hand value is evaluated only on demand - The first value. - The second value. - The result of the operation. - - - Binary 'or'. When used as a binary operator the right hand value is evaluated only on demand. - - - Binary 'and'. When used as a binary operator the right hand value is evaluated only on demand - The first value. - The second value. - The result of the operation. - - - Binary 'and'. When used as a binary operator the right hand value is evaluated only on demand. - - - The F# compiler emits calls to some of the functions in this module as part of the compiled form of some language constructs - - - - - - - - - - - - - - - - - - For compiler use only - - - Language primitives associated with the F# language - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - An active pattern to match values of type System.Collections.Generic.KeyValuePair - The input key/value pair. - A tuple containing the key and value. - - - Converts the argument to character. Numeric inputs are converted according to the UTF-16 - encoding for characters. String inputs must be exactly one character long. For other - input types the operation requires an appropriate static conversion method on the input type. - The input value. - The converted char. - - - Converts the argument to System.Decimal using a direct conversion for all - primitive numeric types. For strings, the input is converted using UInt64.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted decimal. - - - Converts the argument to a string using ToString. - - For standard integer and floating point values the ToString conversion - uses CultureInfo.InvariantCulture. - The input value. - The converted string. - - - Converts the argument to unsigned native integer using a direct conversion for all - primitive numeric types. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted unativeint - - - Converts the argument to signed native integer. This is a direct conversion for all - primitive numeric types. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted nativeint - - - Converts the argument to 64-bit float. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Double.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted float - - - Converts the argument to 32-bit float. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Single.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted float32 - - - Converts the argument to unsigned 64-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using UInt64.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint64 - - - Converts the argument to signed 64-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Int64.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int64 - - - Converts the argument to unsigned 32-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using UInt32.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint32 - - - Converts the argument to signed 32-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Int32.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int32 - - - Converts the argument to a particular enum type. - The input value. - The converted enum type. - - - Converts the argument to signed 32-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Int32.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int - - - Converts the argument to unsigned 16-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using UInt16.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint16 - - - Converts the argument to signed 16-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Int16.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int16 - - - Converts the argument to signed byte. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using SByte.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted sbyte - - - Converts the argument to byte. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Byte.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted byte - - - Overloaded power operator. If n > 0 then equivalent to x*...*x for n occurrences of x. - The input base. - The input exponent. - The base raised to the exponent. - - - Overloaded power operator. - The input base. - The input exponent. - The base raised to the exponent. - - - Overloaded truncate operator. - The input value. - The truncated value. - - - Hyperbolic tangent of the given number - The input value. - The hyperbolic tangent of the input. - - - Tangent of the given number - The input value. - The tangent of the input. - - - Hyperbolic sine of the given number - The input value. - The hyperbolic sine of the input. - - - Sine of the given number - The input value. - The sine of the input. - - - Hyperbolic cosine of the given number - The input value. - The hyperbolic cosine of the input. - - - Cosine of the given number - The input value. - The cosine of the input. - - - Square root of the given number - The input value. - The square root of the input. - - - Logarithm to base 10 of the given number - The input value. - The logarithm to base 10 of the input. - - - Natural logarithm of the given number - The input value. - The natural logarithm of the input. - - - Round the given number - The input value. - The nearest integer to the input value. - - - Sign of the given number - The input value. - -1, 0, or 1 depending on the sign of the input. - - - Floor of the given number - The input value. - The floor of the input. - - - Exponential of the given number - The input value. - The exponential of the input. - - - Ceiling of the given number - The input value. - The ceiling of the input. - - - Inverse tangent of x/y where x and y are specified separately - The y input value. - The x input value. - The inverse tangent of the input ratio. - - - Inverse tangent of the given number - The input value. - The inverse tangent of the input. - - - Inverse sine of the given number - The input value. - The inverse sine of the input. - - - Inverse cosine of the given number - The input value. - The inverse cosine of the input. - - - Absolute value of the given number. - The input value. - The absolute value of the input. - - - A generic hash function. This function has the same behaviour as 'hash', - however the default structural hashing for F# union, record and tuple - types stops when the given limit of nodes is reached. The exact behaviour of - the function can be adjusted on a type-by-type basis by implementing - GetHashCode for each type. - The limit of nodes. - The input object. - The computed hash. - - - A generic hash function, designed to return equal hash values for items that are - equal according to the "=" operator. By default it will use structural hashing - for F# union, record and tuple types, hashing the complete contents of the - type. The exact behaviour of the function can be adjusted on a - type-by-type basis by implementing GetHashCode for each type. - The input object. - The computed hash. - - - Returns the internal size of a type in bytes. For example, sizeof<int> returns 4. - - - Generate a System.Type representation for a type definition. If the - input type is a generic type instantiation then return the - generic type definition associated with all such instantiations. - - - An internal, library-only compiler intrinsic for compile-time - generation of a RuntimeMethodHandle. - - - Generate a System.Type runtime representation of a static type. - The static type is still maintained on the value returned. - - - Clean up resources associated with the input object after the completion of the given function. - Cleanup occurs even when an exception is raised by the protected - code. - The resource to be disposed after action is called. - The action that accepts the resource. - The resulting value. - - - Execute the function as a mutual-exclusion region using the input value as a lock. - The object to be locked. - The action to perform during the lock. - The resulting value. - - - The standard overloaded skip range operator, e.g. [n..skip..m] for lists, seq {n..skip..m} for sequences - The start value of the range. - The step value of the range. - The end value of the range. - The sequence spanning the range using the specified step size. - - - The standard overloaded range operator, e.g. [n..m] for lists, seq {n..m} for sequences - The start value of the range. - The end value of the range. - The sequence spanning the range. - - - Reads the value of the property System.Console.Out. - - - Reads the value of the property System.Console.Error. - - - Reads the value of the property System.Console.In. - - - Equivalent to System.Single.NaN - - - Equivalent to System.Single.PositiveInfinity - - - Equivalent to System.Double.NaN - - - Equivalent to System.Double.PositiveInfinity - - - Exit the current hardware isolated process, if security settings permit, - otherwise raise an exception. Calls System.Environment.Exit. - The exit code to use. - The result value. - - - Builds a sequence using sequence expression syntax - The input sequence. - The result sequence. - - - Negate a logical value. not true equals false and not false equals true - The value to negate. - The result of the negation. - - - Concatenate two lists. - The first list. - The second list. - The concatenation of the lists. - - - Increment a mutable reference cell containing an integer - The reference cell. - - - Decrement a mutable reference cell containing an integer - The reference cell. - - - Dereference a mutable reference cell - The cell to dereference. - The value contained in the cell. - - - Assign to a mutable reference cell - The cell to mutate. - The value to set inside the cell. - - - Create a mutable reference cell - The value to contain in the cell. - The created reference cell. - - - The identity function - The input value. - The same value. - - - Throw a System.InvalidOperationException exception - The exception message. - The result value. - - - Throw a System.ArgumentNullException exception - The argument name. - The result value. - - - Throw a System.ArgumentException exception with - the given argument name and message. - The argument name. - The exception message. - The result value. - - - Throw a System.Exception exception. - The exception message. - The result value. - - - Boxes a strongly typed value. - The value to box. - The boxed object. - - - Unboxes a strongly typed value. This is the inverse of box, unbox<t>(box<t> a) equals a. - The boxed value. - The unboxed result. - - - Ignore the passed value. This is often used to throw away results of a computation. - The value to ignore. - - - Minimum based on generic comparison - The first value. - The second value. - The minimum value. - - - Maximum based on generic comparison - The first value. - The second value. - The maximum value. - - - Generic comparison. - The first value. - The second value. - The result of the comparison. - - - Return the second element of a tuple, snd (a,b) = b. - The input tuple. - The second value. - - - Return the first element of a tuple, fst (a,b) = a. - The input tuple. - The first value. - - - Matches System.Exception objects whose runtime type is precisely System.Exception - The input exception. - A string option. - - - Builds a System.Exception object. - The message for the Exception. - A System.Exception. - - - Rethrows an exception. This should only be used when handling an exception - The result value. - - - Rethrows an exception. This should only be used when handling an exception - The result value. - - - Raises an exception - The exception to raise. - The result value. - - - Concatenate two strings. The operator '+' may also be used. - - - Used to specify a default value for an optional argument in the implementation of a function - An option representing the argument. - The default value of the argument. - The argument value. If it is None, the defaultValue is returned. - - - Apply a function to three values, the values being a triple on the right, the function on the left - The function. - The first argument. - The second argument. - The third argument. - The function result. - - - Apply a function to two values, the values being a pair on the right, the function on the left - The function. - The first argument. - The second argument. - The function result. - - - Apply a function to a value, the value being on the right, the function on the left - The function. - The argument. - The function result. - - - Apply a function to three values, the values being a triple on the left, the function on the right - The first argument. - The second argument. - The third argument. - The function. - The function result. - - - Apply a function to two values, the values being a pair on the left, the function on the right - The first argument. - The second argument. - The function. - The function result. - - - Apply a function to a value, the value being on the left, the function on the right - The argument. - The function. - The function result. - - - Compose two functions, the function on the right being applied first - The second function to apply. - The first function to apply. - The composition of the input functions. - - - Compose two functions, the function on the left being applied first - The first function to apply. - The second function to apply. - The composition of the input functions. - - - Structural inequality - The first parameter. - The second parameter. - The result of the comparison. - - - Structural equality - The first parameter. - The second parameter. - The result of the comparison. - - - Structural less-than-or-equal comparison - The first parameter. - The second parameter. - The result of the comparison. - - - Structural greater-than-or-equal - The first parameter. - The second parameter. - The result of the comparison. - - - Structural greater-than - The first parameter. - The second parameter. - The result of the comparison. - - - Structural less-than comparison - The first parameter. - The second parameter. - The result of the comparison. - - - Overloaded prefix-plus operator - The input value. - The result of the operation. - - - Overloaded bitwise-NOT operator - The input value. - The result of the operation. - - - Overloaded byte-shift right operator by a specified number of bits - The input value. - The amount to shift. - The result of the operation. - - - Overloaded byte-shift left operator by a specified number of bits - The input value. - The amount to shift. - The result of the operation. - - - Overloaded bitwise-XOR operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded bitwise-OR operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded bitwise-AND operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded modulo operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded division operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded multiplication operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded subtraction operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded addition operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded unary negation. - The value to negate. - The result of the operation. - - - Converts the argument to char. Numeric inputs are converted using a checked - conversion according to the UTF-16 encoding for characters. String inputs must - be exactly one character long. For other input types the operation requires an - appropriate static conversion method on the input type. - The input value. - The converted char - - - Converts the argument to unativeint. This is a direct, checked conversion for all - primitive numeric types. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted unativeint - - - Converts the argument to nativeint. This is a direct, checked conversion for all - primitive numeric types. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted nativeint - - - Converts the argument to uint64. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.UInt64.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint64 - - - Converts the argument to int64. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.Int64.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int64 - - - Converts the argument to uint32. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.UInt32.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint32 - - - Converts the argument to int32. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.Int32.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int32 - - - Converts the argument to int. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.Int32.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int - - - Converts the argument to uint16. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.UInt16.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint16 - - - Converts the argument to int16. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.Int16.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int16 - - - Converts the argument to sbyte. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.SByte.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted sbyte - - - Converts the argument to byte. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.Byte.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted byte - - - Overloaded multiplication operator (checks for overflow) - The first value. - The second value. - The product of the two input values. - - - Overloaded addition operator (checks for overflow) - The first value. - The second value. - The sum of the two input values. - - - Overloaded subtraction operator (checks for overflow) - The first value. - The second value. - The first value minus the second value. - - - Overloaded unary negation (checks for overflow) - The input value. - The negated value. - - - This module contains the basic arithmetic operations with overflow checks. - - - Perform generic hashing on a value where the type of the value is not - statically required to satisfy the 'equality' constraint. - The computed hash value. - - - Perform generic equality on two values where the type of the values is not - statically required to satisfy the 'equality' constraint. - The result of the comparison. - - - Perform generic comparison on two values where the type of the values is not - statically required to have the 'comparison' constraint. - The result of the comparison. - - - Generate a default value for any type. This is null for reference types, - For structs, this is struct value where all fields have the default value. - This function is unsafe in the sense that some F# values do not have proper null values. - - - Unboxes a strongly typed value. This is the inverse of box, unbox<t>(box<t> a) equals a. - The boxed value. - The unboxed result. - - - This module contains basic operations which do not apply runtime and/or static checks - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'decimal' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'float' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'float32' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'unativeint' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'nativeint' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'uint64' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'int64' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'uint32' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'int32' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'uint16' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'int16' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'sbyte' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'byte' - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - Generate a range of values using the given zero, add, start, step and stop values - - - Generate a range of values using the given zero, add, start, step and stop values - - - Generate a range of char values - - - Generate a range of byte values - - - Generate a range of sbyte values - - - Generate a range of uint16 values - - - Generate a range of int16 values - - - Generate a range of unativeint values - - - Generate a range of nativeint values - - - Generate a range of uint32 values - - - Generate a range of uint64 values - - - Generate a range of int64 values - - - Generate a range of float32 values - - - Generate a range of float values - - - Generate a range of integers - - - Gets a slice from a string - The source string. - The index of the first character of the slice. - The index of the last character of the slice. - The substring from the given indices. - - - Sets a slice of an array - The target array. - The start index of the first dimension. - The end index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The start index of the third dimension. - The end index of the third dimension. - The start index of the fourth dimension. - The end index of the fourth dimension. - The source array. - - - Gets a slice of an array - The source array. - The start index of the first dimension. - The end index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The start index of the third dimension. - The end index of the third dimension. - The start index of the fourth dimension. - The end index of the fourth dimension. - The four dimensional sub array from the given indices. - - - Sets a slice of an array - The target array. - The start index of the first dimension. - The end index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The start index of the third dimension. - The end index of the third dimension. - The source array. - - - Gets a slice of an array - The source array. - The start index of the first dimension. - The end index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The start index of the third dimension. - The end index of the third dimension. - The three dimensional sub array from the given indices. - - - Sets a vector slice of a 2D array. The index of the second dimension is fixed. - The target array. - The start index of the first dimension. - The end index of the first dimension. - The index of the second dimension. - The source array. - - - Sets a vector slice of a 2D array. The index of the first dimension is fixed. - The target array. - The index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The source array. - - - Sets a region slice of an array - The target array. - The start index of the first dimension. - The end index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The source array. - - - Gets a vector slice of a 2D array. The index of the second dimension is fixed. - The source array. - The start index of the first dimension. - The end index of the first dimension. - The fixed index of the second dimension. - The sub array from the input indices. - - - Gets a vector slice of a 2D array. The index of the first dimension is fixed. - The source array. - The index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The sub array from the input indices. - - - Gets a region slice of an array - The source array. - The start index of the first dimension. - The end index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The two dimensional sub array from the input indices. - - - Sets a slice of an array - The target array. - The start index. - The end index. - The source array. - - - Gets a slice of an array - The input array. - The start index. - The end index. - The sub array from the input indices. - - - A module of compiler intrinsic functions for efficient implementations of F# integer ranges - and dynamic invocations of other F# operators - - - Basic F# Operators. This module is automatically opened in all F# code. - - - Invoke an F# first class function value that accepts five curried arguments - without intervening execution - The first arg. - The second arg. - The third arg. - The fourth arg. - The fifth arg. - The function result. - - - Adapt an F# first class function value to be an optimized function value that can - accept five curried arguments without intervening execution. - The input function. - The optimized function. - - - Construct an optimized function value that can accept five curried - arguments without intervening execution. - The optimized function. - - - The CLI type used to represent F# function values that accept five curried arguments - without intervening execution. This type should not typically used directly from - either F# code or from other CLI languages. - - - Invoke an F# first class function value that accepts four curried arguments - without intervening execution - The first arg. - The second arg. - The third arg. - The fourth arg. - The function result. - - - Adapt an F# first class function value to be an optimized function value that can - accept four curried arguments without intervening execution. - The input function. - The optimized function. - - - Construct an optimized function value that can accept four curried - arguments without intervening execution. - The optimized function. - - - The CLI type used to represent F# function values that accept four curried arguments - without intervening execution. This type should not typically used directly from - either F# code or from other CLI languages. - - - Invoke an F# first class function value that accepts three curried arguments - without intervening execution - The first arg. - The second arg. - The third arg. - The function result. - - - Adapt an F# first class function value to be an optimized function value that can - accept three curried arguments without intervening execution. - The input function. - The adapted function. - - - Construct an optimized function value that can accept three curried - arguments without intervening execution. - The optimized function. - - - The CLI type used to represent F# function values that accept - three iterated (curried) arguments without intervening execution. This type should not - typically used directly from either F# code or from other CLI languages. - - - Invoke the optimized function value with two curried arguments - The first arg. - The second arg. - The function result. - - - Adapt an F# first class function value to be an optimized function value that can - accept two curried arguments without intervening execution. - The input function. - The adapted function. - - - Construct an optimized function value that can accept two curried - arguments without intervening execution. - The optimized function. - - - The CLI type used to represent F# function values that accept - two iterated (curried) arguments without intervening execution. This type should not - typically used directly from either F# code or from other CLI languages. - - - An implementation module used to hold some private implementations of function - value invocation. - - - Convert the option to a list of length 0 or 1. - The input option. - The result list. - - - Convert the option to an array of length 0 or 1. - The input option. - The result array. - - - bind f inp evaluates to match inp with None -> None | Some x -> f x - A function that takes the value of type T from an option and transforms it into - an option containing a value of type U. - The input option. - An option of the output type of the binder. - - - map f inp evaluates to match inp with None -> None | Some x -> Some (f x). - A function to apply to the option value. - The input option. - An option of the input value after applying the mapping function, or None if the input is None. - - - iter f inp executes match inp with None -> () | Some x -> f x. - A function to apply to the option value. - The input option. - Unit if the option is None, otherwise it returns the result of applying the predicate - to the option value. - - - forall p inp evaluates to match inp with None -> true | Some x -> p x. - A function that evaluates to a boolean when given a value from the option type. - The input option. - True if the option is None, otherwise it returns the result of applying the predicate - to the option value. - - - exists p inp evaluates to match inp with None -> false | Some x -> p x. - A function that evaluates to a boolean when given a value from the option type. - The input option. - False if the option is None, otherwise it returns the result of applying the predicate - to the option value. - - - fold f inp s evaluates to match inp with None -> s | Some x -> f x s. - A function to update the state data when given a value from an option. - The input option. - The initial state. - The original state if the option is None, otherwise it returns the updated state with the folder - and the option value. - - - fold f s inp evaluates to match inp with None -> s | Some x -> f s x. - A function to update the state data when given a value from an option. - The initial state. - The input option. - The original state if the option is None, otherwise it returns the updated state with the folder - and the option value. - - - count inp evaluates to match inp with None -> 0 | Some _ -> 1. - The input option. - A zero if the option is None, a one otherwise. - - - Gets the value associated with the option. - The input option. - The value within the option. - Thrown when the option is None. - - - Returns true if the option is None. - The input option. - True if the option is None. - - - Returns true if the option is not None. - The input option. - True if the option is not None. - - - Basic operations on options. - - - Represents a statically-analyzed format associated with writing to a System.IO.TextWriter. The type parameter indicates the - arguments and return type of the format operation. - - - Represents a statically-analyzed format when formatting builds a string. The type parameter indicates the - arguments and return type of the format operation. - - - Represents a statically-analyzed format associated with writing to a System.Text.StringBuilder. The type parameter indicates the - arguments and return type of the format operation. - - - Represents a statically-analyzed format associated with writing to a System.IO.TextWriter. The first type parameter indicates the - arguments of the format operation and the last the overall return type. - - - Represents a statically-analyzed format when formatting builds a string. The first type parameter indicates the - arguments of the format operation and the last the overall return type. - - - Represents a statically-analyzed format associated with writing to a System.Text.StringBuilder. The first type parameter indicates the - arguments of the format operation and the last the overall return type. - - - Print to a string buffer and raise an exception with the given - result. Helper printers must return strings. - The input formatter. - The arguments of the formatter. - - - sprintf, but call the given 'final' function to generate the result. - See kprintf. - The function called to generate a result from the formatted string. - The input formatter. - The arguments of the formatter. - - - printf, but call the given 'final' function to generate the result. - For example, these let the printing force a flush after all output has - been entered onto the channel, but not before. - The function called after formatting to generate the format result. - The input formatter. - The arguments of the formatter. - - - fprintf, but call the given 'final' function to generate the result. - See kprintf. - The function called after formatting to generate the format result. - The input TextWriter. - The input formatter. - The arguments of the formatter. - - - bprintf, but call the given 'final' function to generate the result. - See kprintf. - The function called after formatting to generate the format result. - The input StringBuilder. - The input formatter. - The arguments of the formatter. - - - Print to a string via an internal string buffer and return - the result as a string. Helper printers must return strings. - The input formatter. - The formatted string. - - - Formatted printing to stdout, adding a newline. - The input formatter. - The return type and arguments of the formatter. - - - Formatted printing to stdout - The input formatter. - The return type and arguments of the formatter. - - - Formatted printing to stderr, adding a newline - The input formatter. - The return type and arguments of the formatter. - - - Formatted printing to stderr - The input formatter. - The return type and arguments of the formatter. - - - Print to a text writer, adding a newline - The TextWriter to print to. - The input formatter. - The return type and arguments of the formatter. - - - Print to a text writer. - The TextWriter to print to. - The input formatter. - The return type and arguments of the formatter. - - - Print to a System.Text.StringBuilder - The StringBuilder to print to. - The input formatter. - The return type and arguments of the formatter. - - - Extensible printf-style formatting for numbers and other datatypes - - Format specifications are strings with "%" markers indicating format - placeholders. Format placeholders consist of: - - %[flags][width][.precision][type] - - where the type is interpreted as follows: - - %b: bool, formatted as "true" or "false" - %s: string, formatted as its unescaped contents - %c: character literal - %d, %i: any basic integer type formatted as a decimal integer, signed if the basic integer type is signed. - %u: any basic integer type formatted as an unsigned decimal integer - %x, %X, %o: any basic integer type formatted as an unsigned hexadecimal - (a-f)/Hexadecimal (A-F)/Octal integer - - %e, %E, %f, %F, %g, %G: - any basic floating point type (float,float32) formatted - using a C-style floating point format specifications, i.e - - %e, %E: Signed value having the form [-]d.dddde[sign]ddd where - d is a single decimal digit, dddd is one or more decimal - digits, ddd is exactly three decimal digits, and sign - is + or - - - %f: Signed value having the form [-]dddd.dddd, where dddd is one - or more decimal digits. The number of digits before the - decimal point depends on the magnitude of the number, and - the number of digits after the decimal point depends on - the requested precision. - - %g, %G: Signed value printed in f or e format, whichever is - more compact for the given value and precision. - - - %M: System.Decimal value - - %O: Any value, printed by boxing the object and using it's ToString method(s) - - %A: Any value, printed with the default layout settings - - %a: A general format specifier, requires two arguments: - (1) a function which accepts two arguments: - (a) a context parameter of the appropriate type for the - given formatting function (e.g. an #System.IO.TextWriter) - (b) a value to print - and which either outputs or returns appropriate text. - - (2) the particular value to print - - - %t: A general format specifier, requires one argument: - (1) a function which accepts a context parameter of the - appropriate type for the given formatting function (e.g. - an System.IO.TextWriter)and which either outputs or returns - appropriate text. - - Basic integer types are: - byte,sbyte,int16,uint16,int32,uint32,int64,uint64,nativeint,unativeint - Basic floating point types are: - float, float32 - - The optional width is an integer indicating the minimal width of the - result. For instance, %6d prints an integer, prefixing it with spaces - to fill at least 6 characters. If width is '*', then an extra integer - argument is taken to specify the corresponding width. - - any number - '*': - - Valid flags are: - - 0: add zeros instead of spaces to make up the required width - '-': left justify the result within the width specified - '+': add a '+' character if the number is positive (to match a '-' sign - for negatives) - ' ': add an extra space if the number is positive (to match a '-' - sign for negatives) - - The printf '#' flag is invalid and a compile-time error will be reported if it is used. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Returns the length of the string. - The input string. - The number of characters in the string. - - - Returns a string by concatenating count instances of str. - The number of copies of the input string will be copied. - The input string. - The concatenated string. - Thrown when count is negative. - - - Tests if any character of the string satisfies the given predicate. - The function to test each character of the string. - The input string. - True if any character returns true for the predicate and false otherwise. - - - Tests if all characters in the string satisfy the given predicate. - The function to test each character of the string. - The input string. - True if all characters return true for the predicate and false otherwise. - - - Builds a new string whose characters are the results of applying the function mapping - to each index from 0 to count-1 and concatenating the resulting - strings. - The number of strings to initialize. - The function to take an index and produce a string to - be concatenated with the others. - The constructed string. - Thrown when count is negative. - - - Builds a new string whose characters are the results of applying the function mapping - to each of the characters of the input string and concatenating the resulting - strings. - The function to produce a string from each character of the input string. - The input string. - The concatenated string. - - - Builds a new string whose characters are the results of applying the function mapping - to each character and index of the input string. - The function to apply to each character and index of the string. - The input string. - The resulting string. - - - Builds a new string whose characters are the results of applying the function mapping - to each of the characters of the input string. - The function to apply to the characters of the string. - The input string. - The resulting string. - - - Applies the function action to the index of each character in the string and the - character itself. - The function to apply to each character and index of the string. - The input string. - - - Applies the function action to each character in the string. - The function to be applied to each character of the string. - The input string. - - - Returns a new string made by concatenating the given strings - with separator sep, that is a1 + sep + ... + sep + aN. - The separator string to be inserted between the strings - of the input sequence. - The sequence of strings to be concatenated. - A new string consisting of the concatenated strings separated by - the separation string. - Thrown when strings is null. - - - Functional programming operators for string processing. Further string operations - are available via the member functions on strings and other functionality in - System.String - and System.Text.RegularExpressions types. - - - - The SI unit of catalytic activity - - - - - The SI unit of does equivalent - - - - - The SI unit of absorbed dose - - - - - The SI unit of activity referred to a radionuclide - - - - - The SI unit of illuminance - - - - - The SI unit of luminous flux - - - - - The SI unit of inductance - - - - - The SI unit of magnetic flux density - - - - - The SI unit of magnetic flux - - - - - The SI unit of electric conductance - - - - - The SI unit of electric resistance - - - - - The SI unit of capacitance - - - - - The SI unit of electric potential difference, electromotive force - - - - - The SI unit of electric charge, amount of electricity - - - - - The SI unit of power, radiant flux - - - - - The SI unit of energy, work, amount of heat - - - - - The SI unit of pressure, stress - - - - - The SI unit of force - - - - - The SI unit of frequency - - - - - The SI unit of luminous intensity - - - - - The SI unit of amount of substance - - - - - The SI unit of thermodynamic temperature - - - - - The SI unit of electric current - - - - - The SI unit of time - - - - - The SI unit of mass - - - - - The SI unit of length - - - - - The SI unit of length - - - - - A synonym for henry, the SI unit of inductance - - - - - A synonym for katal, the SI unit of catalytic activity - - - - - A synonym for sievert, the SI unit of does equivalent - - - - - A synonym for gray, the SI unit of absorbed dose - - - - - A synonym for becquerel, the SI unit of activity referred to a radionuclide - - - - - A synonym for lux, the SI unit of illuminance - - - - - A synonym for lumen, the SI unit of luminous flux - - - - - A synonym for tesla, the SI unit of magnetic flux density - - - - - A synonym for weber, the SI unit of magnetic flux - - - - - A synonym for UnitNames.ohm, the SI unit of electric resistance. - - - - - A synonym for siemens, the SI unit of electric conductance - - - - - A synonym for farad, the SI unit of capacitance - - - - - A synonym for volt, the SI unit of electric potential difference, electromotive force - - - - - A synonym for coulomb, the SI unit of electric charge, amount of electricity - - - - - A synonym for watt, the SI unit of power, radiant flux - - - - - A synonym for joule, the SI unit of energy, work, amount of heat - - - - - A synonym for pascal, the SI unit of pressure, stress - - - - - A synonym for newton, the SI unit of force - - - - - A synonym for hertz, the SI unit of frequency - - - - - A synonym for candela, the SI unit of luminous intensity - - - - - A synonym for mole, the SI unit of amount of substance - - - - - A synonym for kelvin, the SI unit of thermodynamic temperature - - - - - A synonym for ampere, the SI unit of electric current - - - - - A synonym for second, the SI unit of time - - - - - A synonym for kilogram, the SI unit of mass - - - - - A synonym for Metre, the SI unit of length - - - - - A method used to support the F# query syntax. Returns an empty sequence that has the specified type argument. - - - - - A method used to support the F# query syntax. Returns a sequence that contains the specified values. - - - - - A method used to support the F# query syntax. Returns a sequence of length one that contains the specified value. - - - - A query operator that selects those elements based on a specified predicate. - - - - A query operator that performs a subsequent ordering of the elements selected so far in descending order by the given nullable sorting key. - This operator may only be used immediately after a 'sortBy', 'sortByDescending', 'thenBy' or 'thenByDescending', or their nullable variants. - - - - A query operator that performs a subsequent ordering of the elements selected so far in ascending order by the given nullable sorting key. - This operator may only be used immediately after a 'sortBy', 'sortByDescending', 'thenBy' or 'thenByDescending', or their nullable variants. - - - - A query operator that performs a subsequent ordering of the elements selected so far in descending order by the given sorting key. - This operator may only be used immediately after a 'sortBy', 'sortByDescending', 'thenBy' or 'thenByDescending', or their nullable variants. - - - - A query operator that performs a subsequent ordering of the elements selected so far in ascending order by the given sorting key. - This operator may only be used immediately after a 'sortBy', 'sortByDescending', 'thenBy' or 'thenByDescending', or their nullable variants. - - - - A query operator that selects elements from a sequence as long as a specified condition is true, and then skips the remaining elements. - - - - A query operator that selects a specified number of contiguous elements from those selected so far. - - - - A query operator that selects a nullable value for each element selected so far and returns the sum of these values. - If any nullable does not have a value, it is ignored. - - - - A query operator that selects a value for each element selected so far and returns the sum of these values. - - - - - A method used to support the F# query syntax. Inputs to queries are implicitly wrapped by a call to one of the overloads of this method. - - - - - A method used to support the F# query syntax. Inputs to queries are implicitly wrapped by a call to one of the overloads of this method. - - - - A query operator that sorts the elements selected so far in descending order by the given nullable sorting key. - - - - A query operator that sorts the elements selected so far in ascending order by the given nullable sorting key. - - - - A query operator that sorts the elements selected so far in descending order by the given sorting key. - - - - A query operator that sorts the elements selected so far in ascending order by the given sorting key. - - - - A query operator that bypasses elements in a sequence as long as a specified condition is true and then selects the remaining elements. - - - - A query operator that bypasses a specified number of the elements selected so far and selects the remaining elements. - - - - A query operator that projects each of the elements selected so far. - - - - - - - - - - - - - - A method used to support the F# query syntax. Runs the given quotation as a query using LINQ IQueryable rules. - - - - - A method used to support the F# query syntax. Indicates that the query should be passed as a quotation to the Run method. - - - - A query operator that selects the element at a specified index amongst those selected so far. - - - - A query operator that selects a nullable value for each element selected so far and returns the minimum of these values. - If any nullable does not have a value, it is ignored. - - - - A query operator that selects a value for each element selected so far and returns the minimum resulting value. - - - - A query operator that selects a nullable value for each element selected so far and returns the maximum of these values. - If any nullable does not have a value, it is ignored. - - - - A query operator that selects a value for each element selected so far and returns the maximum resulting value. - - - - A query operator that correlates two sets of selected values based on matching keys and groups the results. - If any group is empty, a group with a single default value is used instead. - Normal usage is 'leftOuterJoin y in elements2 on (key1 = key2) into group'. - - - - A query operator that selects the last element of those selected so far, or a default value if no element is found. - - - - A query operator that selects the last element of those selected so far. - - - - A query operator that correlates two sets of selected values based on matching keys. - Normal usage is 'join y in elements2 on (key1 = key2)'. - - - - A query operator that selects the first element of those selected so far, or a default value if the sequence contains no elements. - - - - A query operator that selects the first element from those selected so far. - - - - A query operator that selects a value for each element selected so far and groups the elements by the given key. - - - - A query operator that correlates two sets of selected values based on matching keys and groups the results. - Normal usage is 'groupJoin y in elements2 on (key1 = key2) into group'. - - - - A query operator that groups the elements selected so far according to a specified key selector. - - - - - A method used to support the F# query syntax. Projects each element of a sequence to another sequence and combines the resulting sequences into one sequence. - - - - A query operator that selects the first element selected so far that satisfies a specified condition. - - - - A query operator that determines whether any element selected so far satisfies a condition. - - - - A query operator that selects the single, specific element of those selected so far, or a default value if that element is not found. - - - - A query operator that selects the single, specific element selected so far - - - - A query operator that selects distinct elements from the elements selected so far. - - - - A query operator that returns the number of selected elements. - - - - A query operator that determines whether the selected elements contains a specified element. - - - - A query operator that selects a nullable value for each element selected so far and returns the average of these values. - If any nullable does not have a value, it is ignored. - - - - A query operator that selects a value for each element selected so far and returns the average of these values. - - - - A query operator that determines whether all elements selected so far satisfies a condition. - - - - Create an instance of this builder. Use 'query { ... }' to use the query syntax. - - - - The type used to support the F# query syntax. Use 'query { ... }' to use the query syntax. - - - - - A property used to support the F# query syntax. - - - - - A method used to support the F# query syntax. - - - - - A partial input or result in an F# query. This type is used to support the F# query syntax. - - - - Converts the argument to character. Numeric inputs are converted according to the UTF-16 - encoding for characters. The operation requires an appropriate static conversion method on the input type. - The input value. - The converted char. - - - Converts the argument to System.Decimal using a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted decimal. - - - Converts the argument to unsigned native integer using a direct conversion for all - primitive numeric types. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted unativeint - - - Converts the argument to signed native integer. This is a direct conversion for all - primitive numeric types. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted nativeint - - - Converts the argument to 64-bit float. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted float - - - Converts the argument to 32-bit float. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted float32 - - - Converts the argument to unsigned 64-bit integer. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint64 - - - Converts the argument to signed 64-bit integer. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int64 - - - Converts the argument to unsigned 32-bit integer. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint32 - - - Converts the argument to signed 32-bit integer. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int32 - - - Converts the argument to a particular enum type. - The input value. - The converted enum type. - - - Converts the argument to signed 32-bit integer. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int - - - Converts the argument to unsigned 16-bit integer. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint16 - - - Converts the argument to signed 16-bit integer. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int16 - - - Converts the argument to signed byte. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted sbyte - - - Converts the argument to byte. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted byte - - - - Functions for converting nullable values - - - - - The division operator where a nullable value appears on both left and right sides - - - - - The division operator where a nullable value appears on the right - - - - - The division operator where a nullable value appears on the left - - - - - The modulus operator where a nullable value appears on both left and right sides - - - - - The modulus operator where a nullable value appears on the right - - - - - The modulus operator where a nullable value appears on the left - - - - - The multiplication operator where a nullable value appears on both left and right sides - - - - - The multiplication operator where a nullable value appears on the right - - - - - The multiplication operator where a nullable value appears on the left - - - - - The subtraction operator where a nullable value appears on both left and right sides - - - - - The subtraction operator where a nullable value appears on the right - - - - - The subtraction operator where a nullable value appears on the left - - - - - The addition operator where a nullable value appears on both left and right sides - - - - - The addition operator where a nullable value appears on the right - - - - - The addition operator where a nullable value appears on the left - - - - - The '<>' operator where a nullable value appears on both left and right sides - - - - - The '=' operator where a nullable value appears on both left and right sides - - - - - The '<' operator where a nullable value appears on both left and right sides - - - - - The '<=' operator where a nullable value appears on both left and right sides - - - - - The '>' operator where a nullable value appears on both left and right sides - - - - - The '>=' operator where a nullable value appears on both left and right sides - - - - - The '<>' operator where a nullable value appears on the right - - - - - The '=' operator where a nullable value appears on the right - - - - - The '<' operator where a nullable value appears on the right - - - - - The '<=' operator where a nullable value appears on the right - - - - - The '>' operator where a nullable value appears on the right - - - - - The '>=' operator where a nullable value appears on the right - - - - - The '<>' operator where a nullable value appears on the left - - - - - The '=' operator where a nullable value appears on the left - - - - - The '<' operator where a nullable value appears on the left - - - - - The '<=' operator where a nullable value appears on the left - - - - - The '>' operator where a nullable value appears on the left - - - - - The '>=' operator where a nullable value appears on the left - - - - - Operators for working with nullable values - - - - - A method used to support the F# query syntax. Runs the given quotation as a query using LINQ IEnumerable rules. - - - - - - - - A method used to support the F# query syntax. Runs the given quotation as a query using LINQ rules. - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - - - - A type used to reconstruct a grouping after applying a mutable->immutable mapping transformation - on a result of a query. - - - - - - - - - - - - - - - - - - - - The generic MethodInfo for Select function - Describes how we got from productions of immutable objects to productions of anonymous objects, with enough information - that we can invert the process in final query results. - - - - - - - - Given the expression part of a "yield" or "select" which produces a result in terms of immutable tuples or immutable records, - generate an equivalent expression yielding anonymous objects. Also return the conversion for the immutable-to-mutable correspondence - so we can reverse this later. - - - - - Simplify gets of tuples and gets of record fields. - - - - - Cleanup the use of property-set object constructions in leaf expressions that form parts of F# queries. - - - - - - - - Given an type involving immutable tuples and records, logically corresponding to the type produced at a - "yield" or "select", convert it to a type involving anonymous objects according to the conversion data. - - - - - - - - - - - - - - - - - - - - Recognize anonymous type construction written using 'new AnonymousObject(<e1>, <e2>, ...)' - - - - - - - - - - - - - - - - - Recognize object construction written using 'new O(Prop1 = <e>, Prop2 = <e>, ...)' - - - - - Tests whether a list consists only of assignments of properties of the - given variable, null values (ignored) and ends by returning the given variable - (pattern returns only property assignments) - - - - - Recognize sequential series written as (... ((<e>; <e>); <e>); ...) - - - - - - - - - - - - - - - - - - - - - - - A runtime helper used to evaluate nested quotation literals. - - - - - Evaluates a subset of F# quotations by first converting to a LINQ expression, for the subset of LINQ expressions represented by the - expression syntax in the C# language. - - - - - Converts a subset of F# quotations to a LINQ expression, for the subset of LINQ expressions represented by the - expression syntax in the C# language. - - - - - Converts a subset of F# quotations to a LINQ expression, for the subset of LINQ expressions represented by the - expression syntax in the C# language. - - - - - When used in a quotation, this function indicates a specific conversion - should be performed when converting the quotation to a LINQ expression. - - This function should not be called directly. - - - - - When used in a quotation, this function indicates a specific conversion - should be performed when converting the quotation to a LINQ expression. - - This function should not be called directly. - - - - - When used in a quotation, this function indicates a specific conversion - should be performed when converting the quotation to a LINQ expression. - - This function should not be called directly. - - - - - - - - Abstract internal type - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Allocates a region of memory on the stack. - The number of objects of type T to allocate. - A typed pointer to the allocated memory. - - - Assigns the value into the memory location referenced by the typed native - pointer computed by adding index * sizeof<'T> to the given input pointer. - The input pointer. - The index by which to offset the pointer. - The value to assign. - - - Assigns the value into the memory location referenced by the given typed native pointer. - The input pointer. - The value to assign. - - - Dereferences the given typed native pointer. - The input pointer. - The value at the pointer address. - - - Dereferences the typed native pointer computed by adding index * sizeof<'T> to the - given input pointer. - The input pointer. - The index by which to offset the pointer. - The value at the pointer address. - - - Returns a typed native pointer by adding index * sizeof<'T> to the - given input pointer. - The input pointer. - The index by which to offset the pointer. - A typed pointer. - - - Returns a machine address for a given typed native pointer. - The input pointer. - The machine address. - - - Returns a typed native pointer for a given machine address. - The pointer address. - A typed pointer. - - - Contains operations on native pointers. Use of these operators may - result in the generation of unverifiable code. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Gets the raw expression associated with this type-carrying expression - - - Type-carrying quoted expressions. Expressions are generated either - by quotations in source text or programatically - - - Returns type of an expression. - - - Returns the custom attributes of an expression. - - - Builds an expression that represents a while loop - The predicate to control the loop iteration. - The body of the while loop. - The resulting expression. - - - Builds an expression that represents setting a mutable variable - The input variable. - The value to set. - The resulting expression. - - - Builds an expression that represents a variable - The input variable. - The resulting expression. - - - Builds an expression that represents a constant value - The typed value. - The resulting expression. - - - Builds an expression that represents a constant value of a particular type - The untyped object. - The type of the object. - The resulting expression. - - - Builds an expression that represents a test of a value is of a particular union case - The expression to test. - The description of the union case. - The resulting expression. - - - Builds an expression that represents a type test. - The expression to test. - The target type. - The resulting expression. - - - Builds an expression that represents getting a field of a tuple - The input tuple. - The index of the tuple element to get. - The resulting expression. - - - Builds an expression that represents a try/with construct for exception filtering and catching. - The body of the try expression. - - - The variable to bind to a caught exception. - The expression evaluated when an exception is caught. - The resulting expression. - - - Try and find a stored reflection definition for the given method. Stored reflection - definitions are added to an F# assembly through the use of the [<ReflectedDefinition>] attribute. - The description of the method to find. - The reflection definition or None if a match could not be found. - - - Builds an expression that represents a try/finally construct - The body of the try expression. - The final part of the expression to be evaluated. - The resulting expression. - - - Format the expression as a string - Indicates if method, property, constructor and type objects should be printed in detail. If false, these are abbreviated to their name. - The formatted string. - - - Substitutes through the given expression using the given functions - to map variables to new values. The functions must give consistent results - at each application. Variable renaming may occur on the target expression - if variable capture occurs. - The function to map variables into expressions. - The expression with the given substitutions. - - - Builds an expression that represents the sequential execution of one expression followed by another - The first expression. - The second expression. - The resulting expression. - - - Permits interactive environments such as F# Interactive - to explicitly register new pickled resources that represent persisted - top level definitions. The string indicates a unique name for the resources - being added. The format for the bytes is the encoding generated by the F# compiler. - The assembly associated with the resource. - The unique name for the resources being added. - The serialized resource to register with the environment. - - - Builds an expression that represents a nested quotation literal - The expression being quoted. - The resulting expression. - - - Builds an expression that represents writing to a static property - The description of the property. - The value to set. - List of indices for the property if it is an indexed property. - The resulting expression. - - - Builds an expression that represents writing to a property of an object - The input object. - The description of the property. - The value to set. - List of indices for the property if it is an indexed property. - The resulting expression. - - - Builds an expression that represents reading a static property - The description of the property. - List of indices for the property if it is an indexed property. - The resulting expression. - - - Builds an expression that represents reading a property of an object - The input object. - The description of the property. - List of indices for the property if it is an indexed property. - The resulting expression. - - - Builds an expression that represents the creation of a union case value - The description of the union case. - The list of arguments for the case. - The resulting expression. - - - Builds an expression that represents the creation of an F# tuple value - The list of elements of the tuple. - The resulting expression. - - - Builds record-construction expressions - The type of record. - The list of elements of the record. - The resulting expression. - - - Builds an expression that represents the invocation of an object constructor - The description of the constructor. - The list of arguments to the constructor. - The resulting expression. - - - Builds an expression that represents the creation of a delegate value for the given type - The type of delegate. - The parameters for the delegate. - The body of the function. - The resulting expression. - - - Builds an expression that represents the creation of an array value initialized with the given elements - The type for the elements of the array. - The list of elements of the array. - The resulting expression. - - - Builds recursives expressions associated with 'let rec' constructs - The list of bindings for the let expression. - The sub-expression where the bindings are in scope. - The resulting expression. - - - Builds expressions associated with 'let' constructs - The variable in the let expression. - The expression bound to the variable. - The sub-expression where the binding is in scope. - The resulting expression. - - - Builds an expression that represents the constrution of an F# function value - The parameter to the function. - The body of the function. - The resulting expression. - - - Builds 'if ... then ... else' expressions. - The condition expression. - The then sub-expression. - The else sub-expression. - The resulting expression. - - - Fetches or creates a new variable with the given name and type from a global pool of shared variables - indexed by name and type. The type is given by the expicit or inferred type parameter - The variable name. - The created of fetched typed global variable. - - - Gets the free expression variables of an expression as a list. - A sequence of the free variables in the expression. - - - Builds a 'for i = ... to ... do ...' expression that represent loops over integer ranges - The sub-expression declaring the loop variable. - The sub-expression setting the initial value of the loop variable. - The sub-expression declaring the final value of the loop variable. - The sub-expression representing the body of the loop. - The resulting expression. - - - Builds an expression that represents writing to a field of an object - The input object. - The description of the field to write to. - The value to set to the field. - The resulting expression. - - - Builds an expression that represents writing to a static field - The description of the field to write to. - The value to the set to the field. - The resulting expression. - - - Builds an expression that represents the access of a field of an object - The input object. - The description of the field to access. - The resulting expression. - - - Builds an expression that represents the access of a static field - The description of the field to access. - The resulting expression. - - - - - - This function is called automatically when quotation syntax (<@ @>) and related typed-expression - quotations are used. The bytes are a pickled binary representation of an unlinked form of the quoted expression, - and the System.Type argument is any type in the assembly where the quoted - expression occurs, i.e. it helps scope the interpretation of the cross-assembly - references in the bytes. - A type in the assembly where the quotation occurs. - The list of spliced types. - The list of spliced expressions. - The serialized form of the quoted expression. - The resulting expression. - - - Builds an expression that represents the invocation of a default object constructor - The type on which the constructor is invoked. - The resulting expression. - - - Builds an expression that represents the coercion of an expression to a type - The expression to coerce. - The target type. - The resulting expression. - - - Returns a new typed expression given an underlying runtime-typed expression. - A type annotation is usually required to use this function, and - using an incorrect type annotation may result in a later runtime exception. - The expression to cast. - The resulting typed expression. - - - Builds an expression that represents a call to an instance method associated with an object - The input object. - The description of the method to call. - The list of arguments to the method. - The resulting expression. - - - Builds an expression that represents a call to an static method or module-bound function - The MethodInfo describing the method to call. - The list of arguments to the method. - The resulting expression. - - - Builds an expression that represents the application of a first class function value to multiple arguments - The function to apply. - The list of lists of arguments to the function. - The resulting expression. - - - Builds an expression that represents the application of a first class function value to a single argument. - The function to apply. - The argument to the function. - The resulting expression. - - - Builds an expression that represents setting the value held at a particular address. - The target expression. - The value to set at the address. - The resulting expression. - - - Builds an expression that represents getting the address of a value. - The target expression. - The resulting expression. - - - Quoted expressions annotated with System.Type values. - - - The type associated with the variable - - - The declared name of the variable - - - Indicates if the variable represents a mutable storage location - - - Fetches or create a new variable with the given name and type from a global pool of shared variables - indexed by name and type - The name of the variable. - The type associated with the variable. - The retrieved or created variable. - - - Creates a new variable with the given name, type and mutability - The declared name of the variable. - The type associated with the variable. - Indicates if the variable represents a mutable storage location. Default is false. - The created variable. - - - Information at the binding site of a variable - - - Re-build combination expressions. The first parameter should be an object - returned by the ShapeCombination case of the active pattern in this module. - The input shape. - The list of arguments. - The rebuilt expression. - - - An active pattern that performs a complete decomposition viewing the expression tree as a binding structure - The input expression. - The decomposed Var, Lambda, or ConstApp. - - - Active patterns for traversing, visiting, rebuilding and tranforming expressions in a generic way - - - An active pattern to recognize property setters that have an associated ReflectedDefinition - The description of the property. - The expression of the method definition if found, or None. - - - An active pattern to recognize property getters or values in modules that have an associated ReflectedDefinition - The description of the property. - The expression of the method definition if found, or None. - - - An active pattern to recognize methods that have an associated ReflectedDefinition - The description of the method. - The expression of the method definition if found, or None. - - - A parameterized active pattern to recognize calls to a specified function or method. - The returned elements are the optional target object (present if the target is an - instance method), the generic type instantation (non-empty if the target is a generic - instantiation), and the arguments to the function or method. - The input template expression to specify the method to call. - The optional target object (present if the target is an - instance method), the generic type instantation (non-empty if the target is a generic - instantiation), and the arguments to the function or method. - - - An active pattern to recognize constant unsigned int64 expressions - The input expression to match against. - uint64 option - - - An active pattern to recognize constant int64 expressions - The input expression to match against. - int64 option - - - An active pattern to recognize constant unsigned int32 expressions - The input expression to match against. - uint32 option - - - An active pattern to recognize constant int32 expressions - The input expression to match against. - int32 option - - - An active pattern to recognize constant unsigned int16 expressions - The input expression to match against. - uint16 option - - - An active pattern to recognize constant int16 expressions - The input expression to match against. - int16 option - - - An active pattern to recognize constant byte expressions - The input expression to match against. - byte option - - - An active pattern to recognize constant signed byte expressions - The input expression to match against. - sbyte option - - - An active pattern to recognize constant unicode character expressions - The input expression to match against. - char option - - - An active pattern to recognize constant 64-bit floating point number expressions - The input expression to match against. - float option - - - An active pattern to recognize constant 32-bit floating point number expressions - The input expression to match against. - float32 option - - - An active pattern to recognize constant string expressions - The input expression to match against. - string option - - - An active pattern to recognize constant boolean expressions - The input expression to match against. - bool option - - - An active pattern to recognize () constant expressions - The input expression to match against. - unit option - - - An active pattern to recognize expressions of the form a || b - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions of the form a && b - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions that represent the application of a (possibly curried or tupled) first class function value - The input expression to match against. - (Expr * Expr list list) option - - - An active pattern to recognize expressions that represent a (possibly curried or tupled) first class function value - The input expression to match against. - (Var list list * Expr) option - - - Contains a set of derived F# active patterns to analyze F# expression objects - - - An active pattern to recognize expressions that represent setting a mutable variable - The input expression to match against. - (Var * Expr) option - - - An active pattern to recognize expressions that represent a variable - The input expression to match against. - Var option - - - An active pattern to recognize expressions that represent a constant value - The input expression to match against. - (obj * Type) option - - - An active pattern to recognize expressions that represent a test if a value is of a particular union case - The input expression to match against. - (Expr * UnionCaseInfo) option - - - An active pattern to recognize expressions that represent a dynamic type test - The input expression to match against. - (Expr * Type) option - - - An active pattern to recognize expressions that represent getting a tuple field - The input expression to match against. - (Expr * int) option - - - An active pattern to recognize expressions that represent a try/finally construct - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions that represent a try/with construct for exception filtering and catching - The input expression to match against. - (Expr * Var * Expr * Var * Expr) option - - - An active pattern to recognize expressions that represent sequential exeuction of one expression followed by another - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions that represent a nested quotation literal - The input expression to match against. - Expr option - - - An active pattern to recognize expressions that represent setting a static or instance property, or a non-function value declared in a module - The input expression to match against. - (Expr option * PropertyInfo * Expr list * Expr) option - - - An active pattern to recognize expressions that represent the read of a static or instance property, or a non-function value declared in a module - The input expression to match against. - (Expr option * PropertyInfo * Expr list) option - - - An active pattern to recognize expressions that represent construction of tuple values - The input expression to match against. - (Expr list) option - - - An active pattern to recognize expressions that represent construction of particular union case values - The input expression to match against. - (UnionCaseInfo * Expr list) option - - - An active pattern to recognize expressions that represent construction of record values - The input expression to match against. - (Type * Expr list) option - - - An active pattern to recognize expressions that represent invocation of object constructors - The input expression to match against. - (ConstructorInfo * Expr list) option - - - An active pattern to recognize expressions that represent construction of delegate values - The input expression to match against. - (Type * Var list * Expr) option - - - An active pattern to recognize expressions that represent invocations of a default constructor of a struct - The input expression to match against. - Type option - - - An active pattern to recognize expressions that represent the construction of arrays - The input expression to match against. - (Type * Expr list) option - - - An active pattern to recognize expressions that represent recursive let bindings of one or more variables - The input expression to match against. - ((Var * Expr) list * Expr) option - - - An active pattern to recognize expressions that represent let bindings - The input expression to match against. - (Var * Expr * Expr) option - - - An active pattern to recognize expressions that represent first class function values - The input expression to match against. - (Var * Expr) option - - - An active pattern to recognize expressions that represent conditionals - The input expression to match against. - (Expr * Expr * Expr) option - - - An active pattern to recognize expressions that represent while loops - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions that represent loops over integer ranges - The input expression to match against. - (Var * Expr * Expr * Expr) option - - - An active pattern to recognize expressions that represent setting a static or instance field - The input expression to match against. - (Expr option * FieldInfo * Expr) option - - - An active pattern to recognize expressions that represent getting a static or instance field - The input expression to match against. - (Expr option * FieldInfo) option - - - An active pattern to recognize expressions that represent coercions from one type to another - The input expression to match against. - (Expr * Type) option - - - An active pattern to recognize expressions that represent calls to static and instance methods, and functions defined in modules - The input expression to match against. - (Expr option * MethodInfo * Expr list) option - - - An active pattern to recognize expressions that represent applications of first class function values - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions that represent setting the value held at an address - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions that represent getting the address of a value - The input expression to match against. - Expr option - - - Contains a set of primitive F# active patterns to analyze F# expression objects - - - Returns a System.Type representing an F# tuple type with the given element types - An array of types for the tuple elements. - The type representing the tuple containing the input elements. - - - Returns a System.Type representing the F# function type with the given domain and range - The input type of the function. - The output type of the function. - The function type with the given domain and range. - - - Returns true if the typ is a representation of an F# union type or the runtime type of a value of that type - The type to check. - Optional binding flags. - True if the type check succeeds. - - - Return true if the typ is a representation of an F# tuple type - The type to check. - True if the type check succeeds. - - - Return true if the typ is a representation of an F# record type - The type to check. - Optional binding flags. - True if the type check succeeds. - - - Return true if the typ is a System.Type value corresponding to the compiled form of an F# module - The type to check. - True if the type check succeeds. - - - Return true if the typ is a representation of an F# function type or the runtime type of a closure implementing an F# function type - The type to check. - True if the type check succeeds. - - - Returns true if the typ is a representation of an F# exception declaration - The type to check. - Optional binding flags. - True if the type check is an F# exception. - - - Gets the cases of a union type. - - Assumes the given type is a union type. If not, ArgumentException is raised during pre-computation. - The input union type. - Optional binding flags. - Thrown when the input type is not a union type. - An array of descriptions of the cases of the given union type. - - - Gets the tuple elements from the representation of an F# tuple type. - The input tuple type. - An array of the types contained in the given tuple type. - - - Reads all the fields from a record value, in declaration order - - Assumes the given input is a record value. If not, ArgumentException is raised. - The input record type. - Optional binding flags. - An array of descriptions of the properties of the record type. - - - Gets the domain and range types from an F# function type or from the runtime type of a closure implementing an F# type - The input function type. - A tuple of the domain and range types of the input function. - - - Reads all the fields from an F# exception declaration, in declaration order - - Assumes exceptionType is an exception representation type. If not, ArgumentException is raised. - The exception type to read. - Optional binding flags. - Thrown if the given type is not an exception. - An array containing the PropertyInfo of each field in the exception. - - - Contains operations associated with constructing and analyzing F# types such as records, unions and tuples - - - Assumes the given type is a union type. - If not, ArgumentException is raised during pre-computation. - - Using the computed function is more efficient than calling GetUnionCase - because the path executed by the computed function is optimized given the knowledge that it will be - used to read values of the given type. - The type of union to optimize reading. - Optional binding flags. - An optimized function to read the tags of the given union type. - - - Precompute a property or static method for reading an integer representing the case tag of a union type. - The type of union to read. - Optional binding flags. - The description of the union case reader. - - - Precomputes a function for reading all the fields for a particular discriminator case of a union type - - Using the computed function will typically be faster than executing a corresponding call to GetFields - The description of the union case to read. - Optional binding flags. - A function to for reading the fields of the given union case. - - - A method that constructs objects of the given case - The description of the union case. - Optional binding flags. - The description of the constructor of the given union case. - - - Precomputes a function for constructing a discriminated union value for a particular union case. - The description of the union case. - Optional binding flags. - A function for constructing values of the given union case. - - - Precomputes a function for reading the values of a particular tuple type - - Assumes the given type is a TupleType. - If not, ArgumentException is raised during pre-computation. - The tuple type to read. - Thrown when the given type is not a tuple type. - A function to read values of the given tuple type. - - - Gets information that indicates how to read a field of a tuple - The input tuple type. - The index of the tuple element to describe. - The description of the tuple element and an optional type and index if the tuple is big. - - - Gets a method that constructs objects of the given tuple type. - For small tuples, no additional type will be returned. - - For large tuples, an additional type is returned indicating that - a nested encoding has been used for the tuple type. In this case - the suffix portion of the tuple type has the given type and an - object of this type must be created and passed as the last argument - to the ConstructorInfo. A recursive call to PreComputeTupleConstructorInfo - can be used to determine the constructor for that the suffix type. - The input tuple type. - The description of the tuple type constructor and an optional extra type - for large tuples. - - - Precomputes a function for reading the values of a particular tuple type - - Assumes the given type is a TupleType. - If not, ArgumentException is raised during pre-computation. - The type of tuple to read. - Thrown when the given type is not a tuple type. - A function to read a particular tuple type. - - - Precompute a function for reading all the fields from a record. The fields are returned in the - same order as the fields reported by a call to Microsoft.FSharp.Reflection.Type.GetInfo for - this type. - - Assumes the given type is a RecordType. - If not, ArgumentException is raised during pre-computation. - - Using the computed function will typically be faster than executing a corresponding call to Value.GetInfo - because the path executed by the computed function is optimized given the knowledge that it will be - used to read values of the given type. - The type of record to read. - Optional binding flags. - Thrown when the input type is not a record type. - An optimized reader for the given record type. - - - Precompute a function for reading a particular field from a record. - Assumes the given type is a RecordType with a field of the given name. - If not, ArgumentException is raised during pre-computation. - - Using the computed function will typically be faster than executing a corresponding call to Value.GetInfo - because the path executed by the computed function is optimized given the knowledge that it will be - used to read values of the given type. - The PropertyInfo of the field to read. - Thrown when the input type is not a record type. - A function to read the specified field from the record. - - - Get a ConstructorInfo for a record type - The record type. - Optional binding flags. - A ConstructorInfo for the given record type. - - - Precompute a function for constructing a record value. - - Assumes the given type is a RecordType. - If not, ArgumentException is raised during pre-computation. - The type of record to construct. - Optional binding flags. - Thrown when the input type is not a record type. - A function to construct records of the given type. - - - Create a union case value. - The description of the union case to create. - The array of arguments to construct the given case. - Optional binding flags. - The constructed union case. - - - Creates an instance of a tuple type - - Assumes at least one element is given. If not, ArgumentException is raised. - The array of tuple fields. - The tuple type to create. - Thrown if no elements are given. - An instance of the tuple type with the given elements. - - - Creates an instance of a record type. - - Assumes the given input is a record type. - The type of record to make. - The array of values to initialize the record. - Optional binding flags for the record. - Thrown when the input type is not a record type. - The created record. - - - Builds a typed function from object from a dynamic function implementation - The function type of the implementation. - The untyped lambda of the function implementation. - A typed function from the given dynamic implementation. - - - Identify the union case and its fields for an object - - Assumes the given input is a union case value. If not, ArgumentException is raised. - - If the type is not given, then the runtime type of the input object is used to identify the - relevant union type. The type should always be given if the input object may be null. For example, - option values may be represented using the 'null'. - The input union case. - The union type containing the value. - Optional binding flags. - Thrown when the input type is not a union case value. - The description of the union case and its fields. - - - Reads all fields from a tuple. - - Assumes the given input is a tuple value. If not, ArgumentException is raised. - The input tuple. - Thrown when the input is not a tuple value. - An array of the fields from the given tuple. - - - Reads a field from a tuple value. - - Assumes the given input is a tuple value. If not, ArgumentException is raised. - The input tuple. - The index of the field to read. - The value of the field. - - - Reads all the fields from a record value. - - Assumes the given input is a record value. If not, ArgumentException is raised. - The record object. - Optional binding flags for the record. - Thrown when the input type is not a record type. - The array of fields from the record. - - - Reads a field from a record value. - - Assumes the given input is a record value. If not, ArgumentException is raised. - The record object. - The PropertyInfo describing the field to read. - Thrown when the input type is not a record type. - The field from the record. - - - Reads all the fields from a value built using an instance of an F# exception declaration - - Assumes the given input is an F# exception value. If not, ArgumentException is raised. - The exception instance. - Optional binding flags. - Thrown when the input type is not an F# exception. - The fields from the given exception. - - - Contains operations associated with constructing and analyzing values associated with F# types - such as records, unions and tuples. - - - The integer tag for the case. - - - The name of the case. - - - The type in which the case occurs. - - - The fields associated with the case, represented by a PropertyInfo. - The fields associated with the case. - - - Returns the custom attributes data associated with the case. - An list of custom attribute data items. - - - Returns the custom attributes associated with the case matching the given attribute type. - The type of attributes to return. - An array of custom attributes. - - - Returns the custom attributes associated with the case. - An array of custom attributes. - - - Represents a case of a discriminated union type - - - Returns true if the typ is a representation of an F# exception declaration - The type to check. - Optional flag that denotes accessibility of the private representation. - True if the type check is an F# exception. - - - Reads all the fields from an F# exception declaration, in declaration order - - Assumes exceptionType is an exception representation type. If not, ArgumentException is raised. - The exception type to read. - Optional flag that denotes accessibility of the private representation. - Thrown if the given type is not an exception. - An array containing the PropertyInfo of each field in the exception. - - - Returns true if the typ is a representation of an F# union type or the runtime type of a value of that type - The type to check. - Optional flag that denotes accessibility of the private representation. - True if the type check succeeds. - - - Return true if the typ is a representation of an F# record type - The type to check. - Optional flag that denotes accessibility of the private representation. - True if the type check succeeds. - - - Gets the cases of a union type. - - Assumes the given type is a union type. If not, ArgumentException is raised during pre-computation. - The input union type. - Optional flag that denotes accessibility of the private representation. - Thrown when the input type is not a union type. - An array of descriptions of the cases of the given union type. - - - Reads all the fields from a record value, in declaration order - - Assumes the given input is a record value. If not, ArgumentException is raised. - The input record type. - Optional flag that denotes accessibility of the private representation. - An array of descriptions of the properties of the record type. - - - Reads all the fields from a value built using an instance of an F# exception declaration - - Assumes the given input is an F# exception value. If not, ArgumentException is raised. - The exception instance. - Optional flag that denotes accessibility of the private representation. - Thrown when the input type is not an F# exception. - The fields from the given exception. - - - A method that constructs objects of the given case - The description of the union case. - Optional flag that denotes accessibility of the private representation. - The description of the constructor of the given union case. - - - Precomputes a function for constructing a discriminated union value for a particular union case. - The description of the union case. - Optional flag that denotes accessibility of the private representation. - A function for constructing values of the given union case. - - - Precomputes a function for reading all the fields for a particular discriminator case of a union type - - Using the computed function will typically be faster than executing a corresponding call to GetFields - The description of the union case to read. - Optional flag that denotes accessibility of the private representation. - A function to for reading the fields of the given union case. - - - Precompute a property or static method for reading an integer representing the case tag of a union type. - The type of union to read. - Optional flag that denotes accessibility of the private representation. - The description of the union case reader. - - - Assumes the given type is a union type. - If not, ArgumentException is raised during pre-computation. - - Using the computed function is more efficient than calling GetUnionCase - because the path executed by the computed function is optimized given the knowledge that it will be - used to read values of the given type. - The type of union to optimize reading. - Optional flag that denotes accessibility of the private representation. - An optimized function to read the tags of the given union type. - - - Identify the union case and its fields for an object - - Assumes the given input is a union case value. If not, ArgumentException is raised. - - If the type is not given, then the runtime type of the input object is used to identify the - relevant union type. The type should always be given if the input object may be null. For example, - option values may be represented using the 'null'. - The input union case. - The union type containing the value. - Optional flag that denotes accessibility of the private representation. - Thrown when the input type is not a union case value. - The description of the union case and its fields. - - - Create a union case value. - The description of the union case to create. - The array of arguments to construct the given case. - Optional flag that denotes accessibility of the private representation. - The constructed union case. - - - Get a ConstructorInfo for a record type - The record type. - Optional flag that denotes accessibility of the private representation. - A ConstructorInfo for the given record type. - - - Precompute a function for constructing a record value. - - Assumes the given type is a RecordType. - If not, ArgumentException is raised during pre-computation. - The type of record to construct. - Optional flag that denotes accessibility of the private representation. - Thrown when the input type is not a record type. - A function to construct records of the given type. - - - Precompute a function for reading all the fields from a record. The fields are returned in the - same order as the fields reported by a call to Microsoft.FSharp.Reflection.Type.GetInfo for - this type. - - Assumes the given type is a RecordType. - If not, ArgumentException is raised during pre-computation. - - Using the computed function will typically be faster than executing a corresponding call to Value.GetInfo - because the path executed by the computed function is optimized given the knowledge that it will be - used to read values of the given type. - The type of record to read. - Optional flag that denotes accessibility of the private representation. - Thrown when the input type is not a record type. - An optimized reader for the given record type. - - - Reads all the fields from a record value. - - Assumes the given input is a record value. If not, ArgumentException is raised. - The record object. - Optional flag that denotes accessibility of the private representation. - Thrown when the input type is not a record type. - The array of fields from the record. - - - Creates an instance of a record type. - - Assumes the given input is a record type. - The type of record to make. - The array of values to initialize the record. - Optional flags that denotes accessibility of the private representation. - Thrown when the input type is not a record type. - The created record. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - A record of options to control structural formatting. - For F# Interactive properties matching those of this value can be accessed via the 'fsi' - value. - - Floating Point format given in the same format accepted by System.Double.ToString, - e.g. f6 or g15. - - If ShowProperties is set the printing process will evaluate properties of the values being - displayed. This may cause additional computation. - - The ShowIEnumerable is set the printing process will force the evalution of IEnumerable objects - to a small, finite depth, as determined by the printing parameters. - This may lead to additional computation being performed during printing. - - <example> - From F# Interactive the default settings can be adjusted using, for example, - <pre> - open Microsoft.FSharp.Compiler.Interactive.Settings;; - setPrintWidth 120;; - </pre> - </example> - - - - - Data representing structured layouts of terms. - - - - - Convert any value to a layout using the given formatting options. The - layout can then be processed using formatting display engines such as - those in the LayoutOps module. any_to_string and output_any are - built using any_to_layout with default format options. - - - - - - - - Ouput any value to a channel using the same set of formatting rules - as any_to_string - - - - - Convert any value to a string using a standard formatter - Data is typically formatted in a structured format, e.g. - lists are formatted using the "[1;2]" notation. - The details of the format are not specified and may change - from version to version and according to the flags given - to the F# compiler. The format is intended to be human-readable, - not machine readable. If alternative generic formats are required - you should develop your own formatter, using the code in the - implementation of this file as a starting point. - - Data from other .NET languages is formatted using a virtual - call to Object.ToString() on the boxed version of the input. - - - - - - - - For limitting layout of list-like sequences (lists,arrays,etc). - unfold a list of items using (project and z) making layout list via itemL. - If reach maxLength (before exhausting) then truncate. - - - - - See tagL - - - - - Layout like an F# list. - - - - - Layout like an F# option. - - - - - Layout list vertically. - - - - - Layout two vertically. - - - - - Form tuple of layouts. - - - - - Wrap braces around layout. - - - - - Wrap square brackets around layout. - - - - - Wrap round brackets around Layout. - - - - - Join layouts into a list separated using the given Layout. - - - - - Join layouts into a semi-colon separated list. - - - - - Join layouts into a space separated list. - - - - - Join layouts into a comma separated list. - - - - - Join broken with ident=2 - - - - - Join broken with ident=1 - - - - - Join broken with ident=0 - - - - - Join, possible break with indent=2 - - - - - Join, possible break with indent=1 - - - - - Join, possible break with indent=0 - - - - - Join, unbreakable. - - - - - An string which is left parenthesis (no space on the right). - - - - - An string which is right parenthesis (no space on the left). - - - - - An string which requires no spaces either side. - - - - - An string leaf - - - - - An uninterpreted leaf, to be interpreted into a string - by the layout engine. This allows leaf layouts for numbers, strings and - other atoms to be customized according to culture. - - - - - Is it the empty layout? - - - - - The empty layout - - - - - A layout is a sequence of strings which have been joined together. - The strings are classified as words, separators and left and right parenthesis. - This classification determines where spaces are inserted. - A joint is either unbreakable, breakable or broken. - If a joint is broken the RHS layout occurs on the next line with optional indentation. - A layout can be squashed to for given width which forces breaks as required. - - - - Determines whether the current object precedes, occurs in the same position as, - or follows another object in the sort order. - The object to compare with the current instance. - An object that performs comparisons. - An integer that indicates the relationship of the current object to the target object. - - - - - - Returns a hash code for the current instance. - An object that computes the hash code of the current object. - The hash code for the current instance. - - - Equality comparison against a target object with a given comparer. - The target for comparison. - Compares the two objects. - The result of the comparer. - - - - - - - Return the given big integer - - - - - Return the negation of a big integer - - - - - Return the difference of two big integers - - - - - Return the product of big integers - - - - - Return the modulus of big integers - - - - - This operator is for consistency when this type be used from other CLI languages - - - - - This operator is for consistency when this type be used from other CLI languages - - - - - This operator is for consistency when this type be used from other CLI languages - - - - - This operator is for consistency when this type be used from other CLI languages - - - - - This operator is for consistency when this type be used from other CLI languages - - - - - Convert a big integer to a 32-bit signed integer - - - - - Convert a big integer to a 64-bit signed integer - - - - - Convert a big integer to a floating point number - - - - - This operator is for consistency when this type be used from other CLI languages - - - - - Return the ratio of two big integers - - - - - Return the sum of two big integers - - - - - Get the big integer for zero - - - - - Return the sign of a big integer: 0, +1 or -1 - - - - - Get the big integer for one - - - - - Return true if a big integer is 'zero' - - - - - Return true if a big integer is 'one' - - - - - - - - Return n^m for two big integers - - - - - Parse a big integer from a string format - - - - - Return the greatest common divisor of two big integers - - - - - - - - - - - Compute the ratio and remainder of two big integers - - - - - Compute the absolute value of a big integer - - - - - Construct a BigInteger value for the given 64-bit integer - - - - - Construct a BigInteger value for the given integer - - - - - The type of arbitrary-sized integers - - - - diff --git a/packages/FSharp.Core/lib/portable-net45+netcore45+wp8/FSharp.Core.dll b/packages/FSharp.Core/lib/portable-net45+netcore45+wp8/FSharp.Core.dll deleted file mode 100644 index 95b04850..00000000 Binary files a/packages/FSharp.Core/lib/portable-net45+netcore45+wp8/FSharp.Core.dll and /dev/null differ diff --git a/packages/FSharp.Core/lib/portable-net45+netcore45+wp8/FSharp.Core.optdata b/packages/FSharp.Core/lib/portable-net45+netcore45+wp8/FSharp.Core.optdata deleted file mode 100644 index 7ad52838..00000000 Binary files a/packages/FSharp.Core/lib/portable-net45+netcore45+wp8/FSharp.Core.optdata and /dev/null differ diff --git a/packages/FSharp.Core/lib/portable-net45+netcore45+wp8/FSharp.Core.sigdata b/packages/FSharp.Core/lib/portable-net45+netcore45+wp8/FSharp.Core.sigdata deleted file mode 100644 index 01e16d9f..00000000 Binary files a/packages/FSharp.Core/lib/portable-net45+netcore45+wp8/FSharp.Core.sigdata and /dev/null differ diff --git a/packages/FSharp.Core/lib/portable-net45+netcore45+wp8/FSharp.Core.xml b/packages/FSharp.Core/lib/portable-net45+netcore45+wp8/FSharp.Core.xml deleted file mode 100644 index bb2757dd..00000000 --- a/packages/FSharp.Core/lib/portable-net45+netcore45+wp8/FSharp.Core.xml +++ /dev/null @@ -1,10842 +0,0 @@ - - -FSharp.Core - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Gets the tail of the list, which is a list containing all the elements of the list, excluding the first element - - - Gets the number of items contained in the list - - - Gets the element of the list at the given position. - Lists are represented as linked lists so this is an O(n) operation. - The index. - The value at the given index. - - - Gets a value indicating if the list contains no entries - - - Gets the first element of the list - - - Returns an empty list of a particular type - - - Returns a list with head as its first element and tail as its subsequent elements - A new head value for the list. - The existing list. - The list with head appended to the front of tail. - - - The type of immutable singly-linked lists. - - Use the constructors [] and :: (infix) to create values of this type, or - the notation [1;2;3]. Use the values in the List module to manipulate - values of this type, or pattern match against the values directly. - - - Lookup an element in the map. Raise KeyNotFoundException if no binding - exists in the map. - The input key. - Thrown when the key is not found. - The value mapped to the key. - - - Returns true if there are no bindings in the map. - - - The number of bindings in the map. - - - Lookup an element in the map, returning a Some value if the element is in the domain - of the map and None if not. - The input key. - The mapped value, or None if the key is not in the map. - - - Removes an element from the domain of the map. No exception is raised if the element is not present. - The input key. - The resulting map. - - - - - - Tests if an element is in the domain of the map. - The input key. - True if the map contains the given key. - - - Returns a new map with the binding added to the given map. - The input key. - The resulting map. - - - Builds a map that contains the bindings of the given IEnumerable. - The input sequence of key/value pairs. - The resulting map. - - - Immutable maps. Keys are ordered by F# generic comparison. - - Maps based on generic comparison are efficient for small keys. They are not a suitable choice if keys are recursive data structures - or if keys require bespoke comparison semantics. - - All members of this class are thread-safe and may be used concurrently from multiple threads. - - - An abbreviation for the CLI type System.Collections.Generic.List<_> - - - Returns a new set with the elements of the second set removed from the first. - The first input set. - The second input set. - A set containing elements of the first set that are not contained in the second set. - - - Compute the union of the two sets. - The first input set. - The second input set. - The union of the two input sets. - - - Returns the lowest element in the set according to the ordering being used for the set. - - - Returns the highest element in the set according to the ordering being used for the set. - - - A useful shortcut for Set.isEmpty. See the Set module for further operations on sets. - - - The number of elements in the set - - - A useful shortcut for Set.remove. Note this operation produces a new set - and does not mutate the original set. The new set will share many storage - nodes with the original. See the Set module for further operations on sets. - The value to remove from the set. - The result set. - - - Evaluates to "true" if all elements of the second set are in the first. - The set to test against. - True if this set is a superset of otherSet. - - - Evaluates to "true" if all elements of the first set are in the second. - The set to test against. - True if this set is a subset of otherSet. - - - Evaluates to "true" if all elements of the second set are in the first, and at least - one element of the first is not in the second. - The set to test against. - True if this set is a proper superset of otherSet. - - - Evaluates to "true" if all elements of the first set are in the second, and at least - one element of the second is not in the first. - The set to test against. - True if this set is a proper subset of otherSet. - - - - - - A useful shortcut for Set.contains. See the Set module for further operations on sets. - The value to check. - True if the set contains value. - - - A useful shortcut for Set.add. Note this operation produces a new set - and does not mutate the original set. The new set will share many storage - nodes with the original. See the Set module for further operations on sets. - The value to add to the set. - The result set. - - - Create a set containing elements drawn from the given sequence. - The input sequence. - The result set. - - - Immutable sets based on binary trees, where comparison is the - F# structural comparison function, potentially using implementations - of the IComparable interface on key values. - - See the Set module for further operations on sets. - - All members of this class are thread-safe and may be used concurrently from multiple threads. - - - An abbreviation for the type of immutable singly-linked lists. - - Use the constructors [] and :: (infix) to create values of this type, or - the notation [1;2;3]. Use the values in the List module to manipulate - values of this type, or pattern match against the values directly. - - - An abbreviation for the CLI type System.Collections.Generic.IEnumerable<_> - - - Fetches an element from a 2D array. You can also use the syntax array.[index1,index2]. - - The input array. - The index along the first dimension. - The index along the second dimension. - - The value of the array at the given index. - Thrown when the indices are negative or exceed the bounds of the array. - - - Sets the value of an element in an array. You can also use the syntax array.[index1,index2] <- value. - - The input array. - The index along the first dimension. - The index along the second dimension. - The value to set in the array. - Thrown when the indices are negative or exceed the bounds of the array. - - - Builds 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. - - The input array. - - The zero-based output array. - - - Builds 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 propagated to the output - array. - - A function that is applied to transform each element of the array. The two integers - provide the index of the element. - The input array. - - An array whose elements have been transformed by the given mapping. - - - Builds 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. - - A function that is applied to transform each item of the input array. - The input array. - - An array whose elements have been transformed by the given mapping. - - - Returns the length of an array in the second dimension. - - The input array. - - The length of the array in the second dimension. - - - Returns the length of an array in the first dimension. - - The input array. - - The length of the array in the first dimension. - - - Applies the given function to each element of the array. The integer indices passed to the - function indicates the index of element. - - A function to apply to each element of the array with the indices available as an argument. - The input array. - - - Applies the given function to each element of the array. - - A function to apply to each element of the array. - The input array. - - - Creates a based array where the entries are initially Unchecked.defaultof<'T>. - - The base for the first dimension of the array. - The base for the second dimension of the array. - The length of the first dimension of the array. - The length of the second dimension of the array. - - The created array. - Thrown when base1, base2, length1, or length2 is negative. - - - Creates a based array whose elements are all initially the given value. - - The base for the first dimension of the array. - The base for the second dimension of the array. - The length of the first dimension of the array. - The length of the second dimension of the array. - The value to populate the new array. - - The created array. - Thrown when base1, base2, length1, or length2 is negative. - - - Creates a based array given the dimensions and a generator function to compute the elements. - - The base for the first dimension of the array. - The base for the second dimension of the array. - The length of the first dimension of the array. - The length of the second dimension of the array. - A function to produce elements of the array given the two indices. - - The created array. - Thrown when base1, base2, length1, or length2 is negative. - - - Creates an array where the entries are initially Unchecked.defaultof<'T>. - - The length of the first dimension of the array. - The length of the second dimension of the array. - - The created array. - Thrown when length1 or length2 is negative. - - - Creates an array whose elements are all initially the given value. - - The length of the first dimension of the array. - The length of the second dimension of the array. - The value to populate the new array. - - The created array. - Thrown when length1 or length2 is negative. - - - Creates an array given the dimensions and a generator function to compute the elements. - - The length of the first dimension of the array. - The length of the second dimension of the array. - A function to produce elements of the array given the two indices. - - The generated array. - Thrown when either of the lengths is negative. - - - Reads a range of elements from the first array and write them into the second. - - The source array. - The first-dimension index to begin copying from in the source array. - The second-dimension index to begin copying from in the source array. - The target array. - The first-dimension index to begin copying into in the target array. - The second-dimension index to begin copying into in the target array. - The number of elements to copy across the first dimension of the arrays. - The number of elements to copy across the second dimension of the arrays. - Thrown when any of the indices are negative or if either of - the counts are larger than the dimensions of the array allow. - - - Builds 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. - - The input array. - - A copy of the input array. - - - Fetches the base-index for the second dimension of the array. - - The input array. - - The base-index of the second dimension of the array. - - - Fetches the base-index for the first dimension of the array. - - The input array. - - The base-index of the first dimension of the array. - - - Basic operations on 2-dimensional arrays. - - F# and CLI multi-dimensional arrays are typically zero-based. - However, CLI 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 propagated to a matching output - array on the Array2D.map and Array2D.mapi operations. - Non-zero-based arrays can also be created using Array2D.zeroCreateBased, - Array2D.createBased and Array2D.initBased. - - - Creates an array where the entries are initially the "default" value. - The length of the first dimension. - The length of the second dimension. - The length of the third dimension. - The created array. - - - Sets the value of an element in an array. You can also - use the syntax 'array.[index1,index2,index3] <- value'. - The input array. - The index along the first dimension. - The index along the second dimension. - The index along the third dimension. - The value to set at the given index. - - - Builds 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. - The function to transform the elements at each index in the array. - The input array. - The array created from the transformed elements. - - - Builds 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. - The function to transform each element of the array. - The input array. - The array created from the transformed elements. - - - Returns the length of an array in the third dimension. - The input array. - The length of the array in the third dimension. - - - Returns the length of an array in the second dimension. - The input array. - The length of the array in the second dimension. - - - Returns the length of an array in the first dimension - The input array. - The length of the array in the first dimension. - - - Applies the given function to each element of the array. The integer indicies passed to the - function indicates the index of element. - The function to apply to each element of the array. - The input array. - - - Applies the given function to each element of the array. - The function to apply to each element of the array. - The input array. - - - Fetches an element from a 3D array. You can also use the syntax 'array.[index1,index2,index3]' - The input array. - The index along the first dimension. - The index along the second dimension. - The index along the third dimension. - The value at the given index. - - - Creates an array given the dimensions and a generator function to compute the elements. - The length of the first dimension. - The length of the second dimension. - The length of the third dimension. - The function to create an initial value at each index into the array. - The created array. - - - Creates an array whose elements are all initially the given value. - The length of the first dimension. - The length of the second dimension. - The length of the third dimension. - The value of the array elements. - The created array. - - - Basic operations on rank 3 arrays. - - - Sets the value of an element in an array. You can also - use the syntax 'array.[index1,index2,index3,index4] <- value'. - The input array. - The index along the first dimension. - The index along the second dimension. - The index along the third dimension. - The index along the fourth dimension. - The value to set. - - - Fetches an element from a 4D array. You can also use the syntax 'array.[index1,index2,index3,index4]' - The input array. - The index along the first dimension. - The index along the second dimension. - The index along the third dimension. - The index along the fourth dimension. - The value at the given index. - - - Creates an array where the entries are initially the "default" value. - The length of the first dimension. - The length of the second dimension. - The length of the third dimension. - The length of the fourth dimension. - The created array. - - - Returns the length of an array in the fourth dimension. - The input array. - The length of the array in the fourth dimension. - - - Returns the length of an array in the third dimension. - The input array. - The length of the array in the third dimension. - - - Returns the length of an array in the second dimension. - The input array. - The length of the array in the second dimension. - - - Returns the length of an array in the first dimension - The input array. - The length of the array in the first dimension. - - - Creates an array given the dimensions and a generator function to compute the elements. - The length of the first dimension. - The length of the second dimension. - The length of the third dimension. - The length of the fourth dimension. - The function to create an initial value at each index in the array. - The created array. - - - Creates an array whose elements are all initially the given value - The length of the first dimension. - The length of the second dimension. - The length of the third dimension. - The length of the fourth dimension. - The initial value for each element of the array. - The created array. - - - Basic operations on rank 4 arrays. - - - Combines three arrays into an array of pairs. The three arrays must have equal lengths, otherwise an ArgumentException is - raised. - The first input array. - The second input array. - The third input array. - Thrown when the input arrays differ in length. - The array of tupled elements. - - - Combines the two arrays into an array of pairs. The two arrays must have equal lengths, otherwise an ArgumentException is - raised. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - The array of tupled elements. - - - Splits an array of triples into three arrays. - The input array. - The tuple of three arrays. - - - Splits an array of pairs into two arrays. - The input array. - The two arrays. - - - Returns the index of the first element in the array - that satisfies the given predicate. - The function to test the input elements. - The input array. - The index of the first element that satisfies the predicate, or None. - - - Returns the first element for which the given function returns true. - Return None if no such element exists. - The function to test the input elements. - The input array. - The first element that satisfies the predicate, or None. - - - Views the given array as a sequence. - The input array. - The sequence of array elements. - - - Builds a list from the given array. - The input array. - The list of array elements. - - - Returns the sum of the results generated by applying the function to each element of the array. - The function to transform the array elements into the type to be summed. - The input array. - The resulting sum. - - - Returns the sum of the elements in the array. - The input array. - The resulting sum. - - - Sorts the elements of an array by mutating the array in-place, using the given comparison function. - Elements are compared using Operators.compare. - The input array. - - - Sorts the elements of an array by mutating the array in-place, using the given comparison function as the order. - The function to compare pairs of array elements. - The input array. - - - Sorts the elements of an array by mutating the array in-place, using the given projection for the keys. - Elements are compared using Operators.compare. - - This is not a stable sort, i.e. the original order of equal elements is not necessarily preserved. - For a stable sort, consider using Seq.sort. - The function to transform array elements into the type that is compared. - The input array. - - - Sorts the elements of an array, using the given comparison function as the order, returning a new array. - - This is not a stable sort, i.e. the original order of equal elements is not necessarily preserved. - For a stable sort, consider using Seq.sort. - The function to compare pairs of array elements. - The input array. - The sorted array. - - - Sorts the elements of an array, using the given projection for the keys and returning a new array. - Elements are compared using Operators.compare. - - This is not a stable sort, i.e. the original order of equal elements is not necessarily preserved. - For a stable sort, consider using Seq.sort. - The function to transform array elements into the type that is compared. - The input array. - The sorted array. - - - Sorts the elements of an array, returning a new array. Elements are compared using Operators.compare. - - This is not a stable sort, i.e. the original order of equal elements is not necessarily preserved. - For a stable sort, consider using Seq.sort. - The input array. - The sorted array. - - - Builds a new array that contains the given subrange specified by - starting index and length. - The input array. - The index of the first element of the sub array. - The length of the sub array. - The created sub array. - - - Sets an element of an array. - The input array. - The input index. - The input value. - - - Like foldBack, but return both the intermediary and final results. - The function to update the state given the input elements. - The input array. - The initial state. - The array of state values. - - - Like fold, but return the intermediary and final results. - The function to update the state given the input elements. - The initial state. - The input array. - The array of state values. - - - Returns a new array with the elements in reverse order. - The input array. - The reversed array. - - - Applies 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. - The function to reduce a pair of elements to a single element. - The input array. - Thrown when the input array is empty. - The final result of the reductions. - - - Applies 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. - The function to reduce a pair of elements to a single element. - The input array. - Thrown when the input array is empty. - The final result of the redcutions. - - - Returns an array with all elements permuted according to the - specified permutation. - The function that maps input indices to output indices. - The input array. - The output array. - - - Splits the collection into two collections, containing the - elements for which the given predicate returns "true" and "false" - respectively. - The function to test the input elements. - The input array. - A pair of arrays. The first containing the elements the predicate evaluated to true, - and the second containing those evaluated to false. - - - Builds a new array from the given enumerable object. - The input sequence. - The array of elements from the sequence. - - - Builds an array from the given list. - The input list. - The array of elements from the list. - - - Returns the lowest of all elements of the array, compared via Operators.min on the function result. - - Throws ArgumentException for empty arrays. - The function to transform the elements into a type supporting comparison. - The input array. - Thrown when the input array is empty. - The minimum element. - - - Returns the lowest of all elements of the array, compared via Operators.min. - - Throws ArgumentException for empty arrays - The input array. - Thrown when the input array is empty. - The minimum element. - - - Returns the greatest of all elements of the array, compared via Operators.max on the function result. - - Throws ArgumentException for empty arrays. - The function to transform the elements into a type supporting comparison. - The input array. - Thrown when the input array is empty. - The maximum element. - - - Returns the greatest of all elements of the array, compared via Operators.max on the function result. - - Throws ArgumentException for empty arrays. - The input array. - Thrown when the input array is empty. - The maximum element. - - - Builds 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. - The function to transform elements and their indices. - The input array. - The array of transformed elements. - - - Builds 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. - The function to transform pairs of input elements and their indices. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - The array of transformed elements. - - - Builds 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. - The function to transform the pairs of the input elements. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - The array of transformed elements. - - - Builds a new array whose elements are the results of applying the given function - to each of the elements of the array. - The function to transform elements of the array. - The input array. - The array of transformed elements. - - - Returns the length of an array. You can also use property arr.Length. - The input array. - The length of the array. - - - Applies 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. - The function to apply to each index and pair of elements. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - - - Applies the given function to each element of the array. The integer passed to the - function indicates the index of element. - The function to apply to each index and element. - The input array. - - - Applies 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. - The function to apply. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - - - Applies the given function to each element of the array. - The function to apply. - The input array. - - - Returns true if the given array is empty, otherwise false. - The input array. - True if the array is empty. - - - Creates an array where the entries are initially the default value Unchecked.defaultof<'T>. - The length of the array to create. - The created array. - - - Creates an array given the dimension and a generator function to compute the elements. - The number of elements to initialize. - The function to generate the initial values for each index. - The created array. - - - Gets an element from an array. - The input array. - The input index. - The value of the array at the given index. - - - 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. - The function to update the state given the input elements. - The first input array. - The second input array. - The initial state. - Thrown when the input arrays differ in length. - The final state. - - - Applies 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. - The function to update the state given the input elements. - The initial state. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - The final state. - - - Applies 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)) - The function to update the state given the input elements. - The input array. - The initial state. - The final state. - - - Applies 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 - The function to update the state given the input elements. - The initial state. - The input array. - The final state. - - - Tests 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. - The function to test the input elements. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - True if all of the array elements satisfy the predicate. - - - Tests 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. - The function to test the input elements. - The input array. - True if all of the array elements satisfy the predicate. - - - Returns the index of the first element in the array - that satisfies the given predicate. Raise KeyNotFoundException if - none of the elements satisy the predicate. - The function to test the input elements. - The input array. - Thrown if predicate - never returns true. - The index of the first element in the array that satisfies the given predicate. - - - Returns the first element for which the given function returns 'true'. - Raise KeyNotFoundException if no such element exists. - The function to test the input elements. - The input array. - Thrown if predicate - never returns true. - The first element for which predicate returns true. - - - Returns a new collection containing only the elements of the collection - for which the given predicate returns "true". - The function to test the input elements. - The input array. - An array containing the elements for which the given predicate returns true. - - - Tests 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. - The function to test the input elements. - The first input array. - The second input array. - True if any result from predicate is true. - - - Tests 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. - The function to test the input elements. - The input array. - True if any result from predicate is true. - - - Returns an empty array of the given type. - - - Applies the given function to each element of the array. Returns - the array comprised of the results "x" for each element where - the function returns Some(x) - The function to generate options from the elements. - The input array. - The array of results. - - - Applies 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. - The function to generate options from the elements. - The input array. - Thrown if every result from - chooser is None. - The first result. - - - Fills a range of elements of the array with the given value. - The target array. - The index of the first element to set. - The number of elements to set. - The value to set. - - - Applies 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. - The function to transform the array elements into options. - The input array. - The first transformed element that is Some(x). - - - Creates an array whose elements are all initially the given value. - The length of the array to create. - The value for the elements. - The created array. - - - Builds a new array that contains the elements of the given array. - The input array. - A copy of the input array. - - - Builds a new array that contains the elements of each of the given sequence of arrays. - The input sequence of arrays. - The concatenation of the sequence of input arrays. - - - For each element of the array, applies the given function. Concatenates all the results and return the combined array. - The function to create sub-arrays from the input array elements. - The input array. - The concatenation of the sub-arrays. - - - Reads a range of elements from the first array and write them into the second. - The source array. - The starting index of the source array. - The target array. - The starting index of the target array. - The number of elements to copy. - - - Returns the average of the elements generated by applying the function to each element of the array. - The function to transform the array elements before averaging. - The input array. - Thrown when array is empty. - The computed average. - - - Returns the average of the elements in the array. - The input array. - Thrown when array is empty. - The average of the elements in the array. - - - Builds a new array that contains the elements of the first array followed by the elements of the second array. - The first input array. - The second input array. - The resulting array. - - - Basic operations on arrays. - - - Compare using the given comparer function. - A function to compare two values. - An object implementing IComparer using the supplied comparer. - - - Structural comparison. Compare using Operators.compare. - - - Common notions of comparison identity used with sorted data structures. - - - Hash using the given hashing and equality functions. - A function to generate a hash code from a value. - A function to test equality of two values. - An object implementing IEqualityComparer using the supplied functions. - - - Physical hashing (hash on reference identity of objects, and the contents of value types). - Hash using LanguagePrimitives.PhysicalEquality and LanguagePrimitives.PhysicalHash, - That is, for value types use GetHashCode and Object.Equals (if no other optimization available), - and for reference types use System.Runtime.CompilerServices.RuntimeHelpers.GetHashCode and - reference equality. - - - - - - Structural hashing. Hash using Operators.(=) and Operators.hash. - - - Common notions of value identity used with hash tables. - - - Combines the three lists into a list of triples. The lists must have equal lengths. - The first input list. - The second input list. - The third input list. - A single list containing triples of matching elements from the input lists. - - - Combines the two lists into a list of pairs. The two lists must have equal lengths. - The first input list. - The second input list. - A single list containing pairs of matching elements from the input lists. - - - Splits a list of triples into three lists. - The input list. - Three lists of split elements. - - - Splits a list of pairs into two lists. - The input list. - Two lists of split elements. - - - Returns the index of the first element in the list - that satisfies the given predicate. - Return None if no such element exists. - The function to test the input elements. - The input list. - The index of the first element for which the predicate returns true, or None if - every element evaluates to false. - - - Returns the first element for which the given function returns true.. - Return None if no such element exists. - The function to test the input elements. - The input list. - The first element for which the predicate returns true, or None if - every element evaluates to false. - - - Applies the given function to successive elements, returning Some(x) the first - result where function returns Some(x) for some x. If no such element - exists then return None. - The function to generate options from the elements. - The input list. - The first resulting value or None. - - - Views the given list as a sequence. - The input list. - The sequence of elements in the list. - - - Builds an array from the given list. - The input list. - The array containing the elements of the list. - - - Returns the list after removing the first element. - - The input list. - Thrown when the list is empty. - The list after removing the first element. - - - Returns the sum of the results generated by applying the function to each element of the list. - The function to transform the list elements into the type to be summed. - The input list. - The resulting sum. - - - Returns the sum of the elements in the list. - The input list. - The resulting sum. - - - Sorts the given list using Operators.compare. - - This is a stable sort, i.e. the original order of equal elements is preserved. - The input list. - The sorted list. - - - Sorts the given list using keys given by the given projection. Keys are compared using Operators.compare. - - This is a stable sort, i.e. the original order of equal elements is preserved. - The function to transform the list elements into the type to be compared. - The input list. - The sorted list. - - - Sorts the given list using the given comparison function. - - This is a stable sort, i.e. the original order of equal elements is preserved. - The function to compare the list elements. - The input list. - The sorted list. - - - Like foldBack, but returns both the intermediary and final results - The function to update the state given the input elements. - The input list. - The initial state. - The list of states. - - - Applies a function to each element of the collection, threading an accumulator argument - through the computation. Take the second argument, and apply the function to it - and the first element of the list. Then feed this result into the function along - with the second element and so on. Returns the list of intermediate results and the final result. - The function to update the state given the input elements. - The initial state. - The input list. - The list of states. - - - Returns a new list with the elements in reverse order. - The input list. - The reversed list. - - - Creates a list by calling the given generator on each index. - The number of elements to replicate. - The value to replicate - The generated list. - - - Applies 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 i0 (...(f iN-1 iN)). - - Raises System.ArgumentException if list is empty - The function to reduce two list elements to a single element. - The input list. - Thrown when the list is empty. - The final reduced value. - - - Apply a function to each element of the collection, threading an accumulator argument - through the computation. Apply the function to the first two elements of the list. - Then feed this result into the function along with the third element and so on. - Return the final result. If the input function is f and the elements are i0...iN then computes - f (... (f i0 i1) i2 ...) iN. - - Raises System.ArgumentException if list is empty - The function to reduce two list elements to a single element. - The input list. - Thrown when the list is empty. - The final reduced value. - - - Returns a list with all elements permuted according to the - specified permutation. - The function to map input indices to output indices. - The input list. - The permutated list. - - - Applies the given function to successive elements, returning the first - result where function returns Some(x) for some x. If no such - element exists then raise System.Collections.Generic.KeyNotFoundException - The function to generate options from the elements. - The input list. - Thrown when the list is empty. - The first resulting value. - - - Splits the collection into two collections, containing the - elements for which the given predicate returns true and false - respectively. Element order is preserved in both of the created lists. - The function to test the input elements. - The input list. - A list containing the elements for which the predicate evaluated to false and a list - containing the elements for which the predicate evaluated to true. - - - Builds a new list from the given enumerable object. - The input sequence. - The list of elements from the sequence. - - - Builds a list from the given array. - The input array. - The list of elements from the array. - - - Indexes into the list. The first element has index 0. - The input list. - The index to retrieve. - The value at the given index. - - - Returns the lowest of all elements of the list, compared via Operators.min on the function result - - Raises System.ArgumentException if list is empty. - The function to transform list elements into the type to be compared. - The input list. - Thrown when the list is empty. - The minimum value. - - - Returns the lowest of all elements of the list, compared via Operators.min. - - Raises System.ArgumentException if list is empty - The input list. - Thrown when the list is empty. - The minimum value. - - - Returns the greatest of all elements of the list, compared via Operators.max on the function result. - - Raises System.ArgumentException if list is empty. - The function to transform the list elements into the type to be compared. - The input list. - Thrown when the list is empty. - The maximum element. - - - Return the greatest of all elements of the list, compared via Operators.max. - - Raises System.ArgumentException if list is empty - The input list. - Thrown when the list is empty. - The maximum element. - - - Like mapi, but mapping corresponding elements from two lists of equal length. - The function to transform pairs of elements from the two lists and their index. - The first input list. - The second input list. - The list of transformed elements. - - - Builds a new collection whose elements are the results of applying the given function - to each of the elements of the collection. The integer index passed to the - function indicates the index (from 0) of element being transformed. - The function to transform elements and their indices. - The input list. - The list of transformed elements. - - - Builds a new collection whose elements are the results of applying the given function - to the corresponding elements of the three collections simultaneously. - The function to transform triples of elements from the input lists. - The first input list. - The second input list. - The third input list. - The list of transformed elements. - - - Builds a new collection whose elements are the results of applying the given function - to the corresponding elements of the two collections pairwise. - The function to transform pairs of elements from the input lists. - The first input list. - The second input list. - The list of transformed elements. - - - Builds a new collection whose elements are the results of applying the given function - to each of the elements of the collection. - The function to transform elements from the input list. - The input list. - The list of transformed elements. - - - Returns the length of the list. - The input list. - The length of the list. - - - Applies the given function to two collections simultaneously. The - collections must have identical size. The integer passed to the - function indicates the index of element. - The function to apply to a pair of elements from the input lists along with their index. - The first input list. - The second input list. - - - Applies the given function to each element of the collection. The integer passed to the - function indicates the index of element. - The function to apply to the elements of the list along with their index. - The input list. - - - Applies the given function to two collections simultaneously. The - collections must have identical size. - The function to apply to pairs of elements from the input lists. - The first input list. - The second input list. - - - Applies the given function to each element of the collection. - The function to apply to elements from the input list. - The input list. - - - Returns true if the list contains no elements, false otherwise. - The input list. - True if the list is empty. - - - Creates a list by calling the given generator on each index. - The length of the list to generate. - The function to generate an element from an index. - The list of generated elements. - - - Returns the first element of the list. - - The input list. - Thrown when the list is empty. - The first element of the list. - - - Tests if all corresponding elements of the collection 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 System.ArgumentException exception is raised. - Otherwise, true is returned. - The function to test the input elements. - The first input list. - The second input list. - Thrown when the input lists differ in length. - True if all of the pairs of elements satisfy the predicate. - - - Tests if all elements of the collection satisfy the given predicate. - - The predicate is applied to the elements of the input list. If any application - returns false then the overall result is false and no further elements are tested. - Otherwise, true is returned. - The function to test the input elements. - The input list. - True if all of the elements satisfy the predicate. - - - Applies a function to corresponding elements of two collections, threading an accumulator argument - through the computation. The collections must have identical sizes. - If the input function is f and the elements are i0...iN and j0...jN - then computes f i0 j0 (...(f iN jN s)). - The function to update the state given the input elements. - The first input list. - The second input list. - The initial state. - The final state value. - - - Applies 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 i0 (...(f iN s)). - The function to update the state given the input elements. - The input list. - The initial state. - The final state value. - - - Applies a function to corresponding elements of two collections, threading an accumulator argument - through the computation. The collections must have identical sizes. - If the input function is f and the elements are i0...iN and j0...jN - then computes f (... (f s i0 j0)...) iN jN. - The function to update the state given the input elements. - The initial state. - The first input list. - The second input list. - The final state value. - - - Applies a function to each element of the collection, threading an accumulator argument - through the computation. Take the second argument, and apply the function to it - and the first element of the list. Then feed this result into the function along - with the second element and so on. Return the final result. - If the input function is f and the elements are i0...iN then - computes f (... (f s i0) i1 ...) iN. - The function to update the state given the input elements. - The initial state. - The input list. - The final state value. - - - Returns a new collection containing only the elements of the collection - for which the given predicate returns "true" - The function to test the input elements. - The input list. - A list containing only the elements that satisfy the predicate. - - - Returns the index of the first element in the list - that satisfies the given predicate. - Raises KeyNotFoundException if no such element exists. - The function to test the input elements. - The input list. - Thrown if the predicate evaluates to false for all the - elements of the list. - The index of the first element that satisfies the predicate. - - - Returns the first element for which the given function returns true. - Raises KeyNotFoundException if no such element exists. - The function to test the input elements. - The input list. - Thrown if the predicate evaluates to false for - all the elements of the list. - The first element that satisfies the predicate. - - - Tests if any pair of corresponding elements of the lists 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 System.ArgumentException exception is raised. - Otherwise, false is returned. - The function to test the input elements. - The first input list. - The second input list. - Thrown when the input lists differ in length. - True if any pair of elements satisfy the predicate. - - - Tests if any element of the list satisfies the given predicate. - - The predicate is applied to the elements of the input list. If any application - returns true then the overall result is true and no further elements are tested. - Otherwise, false is returned. - The function to test the input elements. - The input list. - True if any element satisfies the predicate. - - - Returns an empty list of the given type. - - - Returns a new list that contains the elements of each the lists in order. - The input sequence of lists. - The resulting concatenated list. - - - For each element of the list, applies the given function. Concatenates all the results and return the combined list. - The function to transform each input element into a sublist to be concatenated. - The input list. - The concatenation of the transformed sublists. - - - Applies the given function to each element of the list. Returns - the list comprised of the results x for each element where - the function returns Some(x) - The function to generate options from the elements. - The input list. - The list comprising the values selected from the chooser function. - - - Returns the average of the elements generated by applying the function to each element of the list. - - Raises System.ArgumentException if list is empty. - The function to transform the list elements into the type to be averaged. - The input list. - Thrown when the list is empty. - The resulting average. - - - Returns the average of the elements in the list. - - Raises System.ArgumentException if list is empty. - The input list. - Thrown when the list is empty. - The resulting average. - - - Returns a new list that contains the elements of the first list - followed by elements of the second. - The first input list. - The second input list. - The resulting list. - - - Basic operations on lists. - - - Returns the key of the first mapping in the collection that satisfies the given predicate. - Returns 'None' if no such element exists. - The function to test the input elements. - The input map. - The first key for which the predicate returns true or None if the predicate evaluates to false for each key/value pair. - - - Evaluates the function on each mapping in the collection. Returns the key for the first mapping - where the function returns 'true'. Raise KeyNotFoundException if no such element exists. - The function to test the input elements. - The input map. - Thrown if the key does not exist in the map. - The first key for which the predicate evaluates true. - - - Lookup an element in the map, returning a Some value if the element is in the domain - of the map and None if not. - The input key. - The input map. - The found Some value or None. - - - Removes an element from the domain of the map. No exception is raised if the element is not present. - The input key. - The input map. - The resulting map. - - - Builds two new maps, one containing the bindings for which the given predicate returns 'true', - and the other the remaining bindings. - The function to test the input elements. - The input map. - A pair of maps in which the first contains the elements for which the predicate returned true - and the second containing the elements for which the predicated returned false. - - - Tests if an element is in the domain of the map. - The input key. - The input map. - True if the map contains the key. - - - Builds a new collection whose elements are the results of applying the given function - to each of the elements of the collection. The key passed to the - function indicates the key of element being transformed. - The function to transform the key/value pairs. - The input map. - The resulting map of keys and transformed values. - - - Returns true if the given predicate returns true for all of the - bindings in the map. - The function to test the input elements. - The input map. - True if the predicate evaluates to true for all of the bindings in the map. - - - Builds a new map containing only the bindings for which the given predicate returns 'true'. - The function to test the key/value pairs. - The input map. - The filtered map. - - - Returns true if the given predicate returns true for one of the - bindings in the map. - The function to test the input elements. - The input map. - True if the predicate returns true for one of the key/value pairs. - - - Applies the given function to each binding in the dictionary - The function to apply to each key/value pair. - The input map. - - - Folds over the bindings in the map - The function to update the state given the input key/value pairs. - The initial state. - The input map. - The final state value. - - - Folds over the bindings in the map. - The function to update the state given the input key/value pairs. - The input map. - The initial state. - The final state value. - - - Searches the map looking for the first element where the given function returns a Some value - The function to generate options from the key/value pairs. - The input map. - The first result. - - - Searches the map looking for the first element where the given function returns a Some value. - The function to generate options from the key/value pairs. - The input map. - The first result. - - - Lookup an element in the map, raising KeyNotFoundException if no binding - exists in the map. - The input key. - The input map. - Thrown when the key does not exist in the map. - The value mapped to the given key. - - - The empty map. - - - Is the map empty? - The input map. - True if the map is empty. - - - Returns an array of all key-value pairs in the mapping. - The array will be ordered by the keys of the map. - The input map. - The array of key/value pairs. - - - Returns a list of all key-value pairs in the mapping. - The list will be ordered by the keys of the map. - The input map. - The list of key/value pairs. - - - Views the collection as an enumerable sequence of pairs. - The sequence will be ordered by the keys of the map. - The input map. - The sequence of key/value pairs. - - - Returns a new map made from the given bindings. - The input sequence of key/value pairs. - The resulting map. - - - Returns a new map made from the given bindings. - The input array of key/value pairs. - The resulting map. - - - Returns a new map made from the given bindings. - The input list of key/value pairs. - The resulting map. - - - Returns a new map with the binding added to the given map. - The input key. - The input value. - The input map. - The resulting map. - - - Functional programming operators related to the Map<_,_> type. - - - Combines the three sequences into a list of triples. The sequences need not have equal lengths: - when one sequence is exhausted any remaining elements in the other - sequences are ignored. - - The first input sequence. - The second input sequence. - The third input sequence. - - The result sequence. - - Thrown when any of the input sequences is null. - - - Combines the two sequences into a list of pairs. The two sequences need not have equal lengths: - when one sequence is exhausted any remaining elements in the other - sequence are ignored. - - The first input sequence. - The second input sequence. - - The result sequence. - - Thrown when either of the input sequences is null. - - - Returns a sequence that yields sliding windows of containing elements drawn from the input - sequence. Each window is returned as a fresh array. - - The number of elements in each window. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - - - Returns a sequence that contains the elements generated by the given computation. - The given initial state argument is passed to the element generator. - For each IEnumerator elements in the stream are generated on-demand by applying the element - generator, until a None value is returned by the element generator. Each call to the element - generator returns a new residual state. - - The stream will be recomputed each time an IEnumerator is requested and iterated for the Seq. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - A function that takes in the current state and returns an option tuple of the next - element of the sequence and the next state value. - The initial state value. - - The result sequence. - - - Returns a sequence that when enumerated returns at most N elements. - - The maximum number of items to enumerate. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Applies the given function to successive elements, returning the first - result where the function returns "Some(x)". - - A function that transforms items from the input sequence into options. - The input sequence. - - The chosen element or None. - - Thrown when the input sequence is null. - - - Returns the index of the first element in the sequence - that satisfies the given predicate. Return None if no such element exists. - - A function that evaluates to a Boolean when given an item in the sequence. - The input sequence. - - The found index or None. - - Thrown when the input sequence is null. - - - Returns the first element for which the given function returns true. - Return None if no such element exists. - - A function that evaluates to a Boolean when given an item in the sequence. - The input sequence. - - The found element or None. - - Thrown when the input sequence is null. - - - Builds a list from the given collection. - - The input sequence. - - The result list. - - Thrown when the input sequence is null. - - - Builds an array from the given collection. - - The input sequence. - - The result array. - - Thrown when the input sequence is null. - - - Returns a sequence that, when iterated, yields elements of the underlying sequence while the - given predicate returns true, and then returns no further elements. - - A function that evaluates to false when no more items should be returned. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns the first N elements of the sequence. - Throws InvalidOperationException - if the count exceeds the number of elements in the sequence. Seq.truncate - returns as many items as the sequence contains instead of throwing an exception. - - The number of items to take. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - Thrown when count exceeds the number of elements - in the sequence. - - - Returns the sum of the results generated by applying the function to each element of the sequence. - The generated elements are summed using the + operator and Zero property associated with the generated type. - - A function to transform items from the input sequence into the type that will be summed. - The input sequence. - - The computed sum. - - - Returns the sum of the elements in the sequence. - - The elements are summed using the + operator and Zero property associated with the generated type. - - The input sequence. - - The computed sum. - - - Applies a key-generating function to each element of a sequence and yield a sequence ordered - by keys. The keys are compared using generic comparison as implemented by Operators.compare. - - This function returns a sequence that digests the whole initial sequence as soon as - that sequence is iterated. As a result this function should not be used with - large or infinite sequences. The function makes no assumption on the ordering of the original - sequence. - - This is a stable sort, that is the original order of equal elements is preserved. - - A function to transform items of the input sequence into comparable keys. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Yields a sequence ordered by keys. - - This function returns a sequence that digests the whole initial sequence as soon as - that sequence is iterated. As a result this function should not be used with - large or infinite sequences. The function makes no assumption on the ordering of the original - sequence. - - This is a stable sort, that is the original order of equal elements is preserved. - - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns a sequence that, when iterated, skips elements of the underlying sequence while the - given predicate returns true, and then yields the remaining elements of the sequence. - - A function that evaluates an element of the sequence to a boolean value. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns a sequence that skips N elements of the underlying sequence and then yields the - remaining elements of the sequence. - - The number of items to skip. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - Thrown when count exceeds the number of elements - in the sequence. - - - Returns a sequence that yields one item only. - - The input item. - - The result sequence of one item. - - - Like fold, but computes on-demand and returns the sequence of intermediary and final results. - - A function that updates the state with each element from the sequence. - The initial state. - The input sequence. - - The resulting sequence of computed states. - - Thrown when the input sequence is null. - - - Applies a function to each element of the sequence, threading an accumulator argument - through the computation. Begin by applying the function to the first two elements. - Then feed this result into the function along with the third element and so on. - Return the final result. - - A function that takes in the current accumulated result and the next - element of the sequence to produce the next accumulated result. - The input sequence. - - The final result of the reduction function. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - - - Builds a new sequence object that delegates to the given sequence object. This ensures - the original sequence cannot be rediscovered and mutated by a type cast. For example, - if given an array the returned sequence will return the elements of the array, but - you cannot cast the returned sequence object to an array. - - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Applies the given function to successive elements, returning the first - x where the function returns "Some(x)". - - A function to transform each item of the input sequence into an option of the output type. - The input sequence. - - The selected element. - - Thrown when the input sequence is null. - Thrown when every item of the sequence - evaluates to None when the given function is applied. - - - Returns a sequence of each element in the input sequence and its predecessor, with the - exception of the first element which is only returned as the predecessor of the second element. - - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Views the given list as a sequence. - - The input list. - - The result sequence. - - - Views the given array as a sequence. - - The input array. - - The result sequence. - - Thrown when the input sequence is null. - - - Computes the nth element in the collection. - - The index of element to retrieve. - The input sequence. - - The nth element of the sequence. - - Thrown when the input sequence is null. - - - Returns the lowest of all elements of the sequence, compared via Operators.min on the function result. - - A function to transform items from the input sequence into comparable keys. - The input sequence. - - The smallest element of the sequence. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - - - Returns the lowest of all elements of the sequence, compared via Operators.min. - - The input sequence. - - The smallest element of the sequence. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - - - Returns the greatest of all elements of the sequence, compared via Operators.max on the function result. - - A function to transform items from the input sequence into comparable keys. - The input sequence. - - The largest element of the sequence. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - - - Returns the greatest of all elements of the sequence, compared via Operators.max - - The input sequence. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - - The largest element of the sequence. - - - Builds a new collection whose elements are the results of applying the given function - to each of the elements of the collection. The integer index passed to the - function indicates the index (from 0) of element being transformed. - - A function to transform items from the input sequence that also supplies the current index. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Builds a new collection whose elements are the results of applying the given function - to the corresponding pairs of elements from the two sequences. If one input sequence is shorter than - the other then the remaining elements of the longer sequence are ignored. - - A function to transform pairs of items from the input sequences. - The first input sequence. - The second input sequence. - - The result sequence. - - Thrown when either of the input sequences is null. - - - Builds a new collection whose elements are the results of applying the given function - to each of the elements of the collection. The given function will be applied - as elements are demanded using the MoveNext method on enumerators retrieved from the - object. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - A function to transform items from the input sequence. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns the length of the sequence - - The input sequence. - - The length of the sequence. - - Thrown when the input sequence is null. - - - Applies the given function to two collections simultaneously. If one sequence is shorter than - the other then the remaining elements of the longer sequence are ignored. - - A function to apply to each pair of elements from the input sequences. - The first input sequence. - The second input sequence. - - Thrown when either of the input sequences is null. - - - Applies the given function to each element of the collection. The integer passed to the - function indicates the index of element. - - A function to apply to each element of the sequence that can also access the current index. - The input sequence. - - Thrown when the input sequence is null. - - - Applies the given function to each element of the collection. - - A function to apply to each element of the sequence. - The input sequence. - - Thrown when the input sequence is null. - - - Generates a new sequence which, when iterated, will return successive - elements by calling the given function. The results of calling the function - will not be saved, that is the function will be reapplied as necessary to - regenerate the elements. The function is passed the index of the item being - generated. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - Iteration can continue up to Int32.MaxValue. - - A function that generates an item in the sequence from a given index. - - The result sequence. - - - Generates a new sequence which, when iterated, will return successive - elements by calling the given function, up to the given count. Each element is saved after its - initialization. The function is passed the index of the item being - generated. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - The maximum number of items to generate for the sequence. - A function that generates an item in the sequence from a given index. - - The result sequence. - - Thrown when count is negative. - - - Returns true if the sequence contains no elements, false otherwise. - - The input sequence. - - True if the sequence is empty; false otherwise. - - Thrown when the input sequence is null. - - - Returns the only element of the sequence. - - The input sequence. - - The last element of the sequence. - - Thrown when the input sequence is null. - Thrown when the input does not have precisely one element. - - - Returns the last element of the sequence. - - The input sequence. - - The last element of the sequence. - - Thrown when the input sequence is null. - Thrown when the input does not have any elements. - - - Returns the first element of the sequence. - - The input sequence. - - The first element of the sequence. - - Thrown when the input sequence is null. - Thrown when the input does not have any elements. - - - Applies a key-generating function to each element of a sequence and yields a sequence of - unique keys. Each unique key contains a sequence of all elements that match - to this key. - - This function returns a sequence that digests the whole initial sequence as soon as - that sequence is iterated. As a result this function should not be used with - large or infinite sequences. The function makes no assumption on the ordering of the original - sequence. - - A function that transforms an element of the sequence into a comparable key. - The input sequence. - - The result sequence. - - - Tests the all pairs of elements drawn from the two sequences satisfy the - given predicate. If one sequence is shorter than - the other then the remaining elements of the longer sequence are ignored. - - A function to test pairs of elements from the input sequences. - The first input sequence. - The second input sequence. - - True if all pairs satisfy the predicate; false otherwise. - - Thrown when either of the input sequences is null. - - - Tests if all elements of the sequence satisfy the given predicate. - - The predicate is applied to the elements of the input sequence. If any application - returns false then the overall result is false and no further elements are tested. - Otherwise, true is returned. - - A function to test an element of the input sequence. - The input sequence. - - True if every element of the sequence satisfies the predicate; false otherwise. - - Thrown when the input sequence is null. - - - Applies 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 - - A function that updates the state with each element from the sequence. - The initial state. - The input sequence. - - The state object after the folding function is applied to each element of the sequence. - - Thrown when the input sequence is null. - - - Returns the index of the first element for which the given function returns true. - - A function to test whether the index of a particular element should be returned. - The input sequence. - - The index of the first element for which the predicate returns true. - - Thrown if no element returns true when - evaluated by the predicate - Thrown when the input sequence is null - - - Returns the first element for which the given function returns true. - - A function to test whether an item in the sequence should be returned. - The input sequence. - - The first element for which the predicate returns true. - - Thrown if no element returns true when - evaluated by the predicate - Thrown when the input sequence is null - - - Returns a new collection containing only the elements of the collection - for which the given predicate returns "true". - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - Remember sequence is lazy, effects are delayed until it is enumerated. - - A synonym for Seq.filter. - - A function to test whether each item in the input sequence should be included in the output. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns a new collection containing only the elements of the collection - for which the given predicate returns "true". This is a synonym for Seq.where. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - Remember sequence is lazy, effects are delayed until it is enumerated. - - A function to test whether each item in the input sequence should be included in the output. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Tests if any pair of corresponding elements of the input sequences satisfies the given predicate. - - The predicate is applied to matching elements in the two sequences 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, false is returned. If one sequence is shorter than - the other then the remaining elements of the longer sequence are ignored. - - A function to test each pair of items from the input sequences. - The first input sequence. - The second input sequence. - - True if any result from the predicate is true; false otherwise. - - Thrown when either of the two input sequences is null. - - - Tests if any element of the sequence satisfies the given predicate. - - The predicate is applied to the elements of the input sequence. If any application - returns true then the overall result is true and no further elements are tested. - Otherwise, false is returned. - - A function to test each item of the input sequence. - The input sequence. - - True if any result from the predicate is true; false otherwise. - - Thrown when the input sequence is null. - - - Creates an empty sequence. - - An empty sequence. - - - Returns a sequence that contains no duplicate entries according to the - generic hash and equality comparisons on the keys returned by the given key-generating function. - If an element occurs multiple times in the sequence then the later occurrences are discarded. - - A function transforming the sequence items into comparable keys. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns a sequence that contains no duplicate entries according to generic hash and - equality comparisons on the entries. - If an element occurs multiple times in the sequence then the later occurrences are discarded. - - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns a sequence that is built from the given delayed specification of a - sequence. - - The input function is evaluated each time an IEnumerator for the sequence - is requested. - - The generating function for the sequence. - - - Applies a key-generating function to each element of a sequence and return a sequence yielding unique - keys and their number of occurrences in the original sequence. - - Note that this function returns a sequence that digests the whole initial sequence as soon as - that sequence is iterated. As a result this function should not be used with - large or infinite sequences. The function makes no assumption on the ordering of the original - sequence. - - A function transforming each item of input sequence into a key to be - compared against the others. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Combines the given enumeration-of-enumerations as a single concatenated - enumeration. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - The input enumeration-of-enumerations. - - The result sequence. - - Thrown when the input sequence is null. - - - Compares two sequences using the given comparison function, element by element. - Returns the first non-zero result from the comparison function. If the end of a sequence - is reached it returns a -1 if the first sequence is shorter and a 1 if the second sequence - is shorter. - - A function that takes an element from each sequence and returns an int. - If it evaluates to a non-zero value iteration is stopped and that value is returned. - The first input sequence. - The second input sequence. - - The first non-zero value from the comparison function. - - Thrown when either of the input sequences - is null. - - - Applies the given function to each element of the sequence and concatenates all the - results. - - Remember sequence is lazy, effects are delayed until it is enumerated. - - A function to transform elements of the input sequence into the sequences - that will then be concatenated. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Applies the given function to each element of the list. Return - the list comprised of the results "x" for each element where - the function returns Some(x). - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not - be accessed concurrently. - - A function to transform items of type T into options of type U. - The input sequence of type T. - - The result sequence. - - Thrown when the input sequence is null. - - - Wraps a loosely-typed System.Collections sequence as a typed sequence. - - The use of this function usually requires a type annotation. - An incorrect type annotation may result in runtime type - errors. - Individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns a sequence that corresponds to a cached version of the input sequence. - This result sequence will have the same elements as the input sequence. The result - can be enumerated multiple times. The input sequence will be enumerated at most - once and only as far as is necessary. Caching a sequence is typically useful when repeatedly - evaluating items in the original sequence is computationally expensive or if - iterating the sequence causes side-effects that the user does not want to be - repeated multiple times. - - Enumeration of the result sequence is thread safe in the sense that multiple independent IEnumerator - values may be used simultaneously from different threads (accesses to - the internal lookaside table are thread safe). Each individual IEnumerator - is not typically thread safe and should not be accessed concurrently. - - Once enumeration of the input sequence has started, - it's enumerator will be kept live by this object until the enumeration has completed. - At that point, the enumerator will be disposed. - - The enumerator may be disposed and underlying cache storage released by - converting the returned sequence object to type IDisposable, and calling the Dispose method - on this object. The sequence object may then be re-enumerated and a fresh enumerator will - be used. - - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns the average of the results generated by applying the function to each element - of the sequence. - - The elements are averaged using the + operator, DivideByInt method and Zero property - associated with the generated type. - - A function applied to transform each element of the sequence. - The input sequence. - - The average. - - Thrown when the input sequence is null. - Thrown when the input sequence has zero elements. - - - Returns the average of the elements in the sequence. - - The elements are averaged using the + operator, DivideByInt method and Zero property - associated with the element type. - - The input sequence. - - The average. - - Thrown when the input sequence is null. - Thrown when the input sequence has zero elements. - - - Wraps the two given enumerations as a single concatenated - enumeration. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed - concurrently. - - The first sequence. - The second sequence. - - The result sequence. - - Thrown when either of the two provided sequences is - null. - - - Basic operations on IEnumerables. - - - Returns a new set with the elements of the second set removed from the first. - The first input set. - The set whose elements will be removed from set1. - The set with the elements of set2 removed from set1. - - - Builds a new collection from the given enumerable object. - The input sequence. - The set containing elements. - - - Returns an ordered view of the collection as an enumerable object. - The input set. - An ordered sequence of the elements of set. - - - Builds an array that contains the elements of the set in order. - The input set. - An ordered array of the elements of set. - - - Builds a set that contains the same elements as the given array. - The input array. - A set containing the elements of array. - - - Builds a list that contains the elements of the set in order. - The input set. - An ordered list of the elements of set. - - - Builds a set that contains the same elements as the given list. - The input list. - A set containing the elements form the input list. - - - Returns the highest element in the set according to the ordering being used for the set. - The input set. - The max value from the set. - - - Returns the lowest element in the set according to the ordering being used for the set. - The input set. - The min value from the set. - - - Returns a new set with the given element removed. No exception is raised if - the set doesn't contain the given element. - The element to remove. - The input set. - The input set with value removed. - - - Splits the set into two sets containing the elements for which the given predicate - returns true and false respectively. - The function to test set elements. - The input set. - A pair of sets with the first containing the elements for which predicate returns - true and the second containing the elements for which predicate returns false. - - - Applies the given function to each element of the set, in order according - to the comparison function. - The function to apply to each element. - The input set. - - - Returns "true" if the set is empty. - The input set. - True if set is empty. - - - Computes the union of a sequence of sets. - The sequence of sets to untion. - The union of the input sets. - - - Computes the union of the two sets. - The first input set. - The second input set. - The union of set1 and set2. - - - Computes the intersection of a sequence of sets. The sequence must be non-empty. - The sequence of sets to intersect. - The intersection of the input sets. - - - Computes the intersection of the two sets. - The first input set. - The second input set. - The intersection of set1 and set2. - - - Tests if all elements of the collection satisfy the given predicate. - If the input function is f and the elements are i0...iN and "j0...jN" - then computes p i0 && ... && p iN. - The function to test set elements. - The input set. - True if all elements of set satisfy predicate. - - - Applies the given accumulating function to all the elements of the set. - The accumulating function. - The input set. - The initial state. - The final state. - - - Applies the given accumulating function to all the elements of the set - The accumulating function. - The initial state. - The input set. - The final state. - - - Returns a new collection containing the results of applying the - given function to each element of the input set. - The function to transform elements of the input set. - The input set. - A set containing the transformed elements. - - - Returns a new collection containing only the elements of the collection - for which the given predicate returns true. - The function to test set elements. - The input set. - The set containing only the elements for which predicate returns true. - - - Tests if any element of the collection satisfies the given predicate. - If the input function is predicate and the elements are i0...iN - then computes p i0 or ... or p iN. - The function to test set elements. - The input set. - True if any element of set satisfies predicate. - - - Returns the number of elements in the set. Same as size. - The input set. - The number of elements in the set. - - - Evaluates to "true" if all elements of the second set are in the first, and at least - one element of the first is not in the second. - The potential superset. - The set to test against. - True if set1 is a proper superset of set2. - - - Evaluates to "true" if all elements of the second set are in the first. - The potential superset. - The set to test against. - True if set1 is a superset of set2. - - - Evaluates to "true" if all elements of the first set are in the second, and at least - one element of the second is not in the first. - The potential subset. - The set to test against. - True if set1 is a proper subset of set2. - - - Evaluates to "true" if all elements of the first set are in the second - The potential subset. - The set to test against. - True if set1 is a subset of set2. - - - Evaluates to "true" if the given element is in the given set. - The element to test. - The input set. - True if element is in set. - - - Returns a new set with an element added to the set. No exception is raised if - the set already contains the given element. - The value to add. - The input set. - A new set containing value. - - - The set containing the given element. - The value for the set to contain. - The set containing value. - - - The empty set for the type 'T. - - - Functional programming operators related to the Set<_> type. - - - Gets the default cancellation token for executing asynchronous computations. - The default CancellationToken. - - - Creates an asynchronous computation that returns the CancellationToken governing the execution - of the computation. - In async { let! token = Async.CancellationToken ...} token can be used to initiate other - asynchronous operations that will cancel cooperatively with this workflow. - An asynchronous computation capable of retrieving the CancellationToken from a computation - expression. - - - Creates an asynchronous computation that executes computation. - If this computation is cancelled before it completes then the computation generated by - running compensation is executed. - The input asynchronous computation. - The function to be run if the computation is cancelled. - An asynchronous computation that runs the compensation if the input computation - is cancelled. - - - Creates an asynchronous computation that queues a work item that runs - its continuation. - A computation that generates a new work item in the thread pool. - - - Creates an asynchronous computation that creates a new thread and runs - its continuation in that thread. - A computation that will execute on a new thread. - - - Creates an asynchronous computation that runs - its continuation using syncContext.Post. If syncContext is null - then the asynchronous computation is equivalent to SwitchToThreadPool(). - The synchronization context to accept the posted computation. - An asynchronous computation that uses the syncContext context to execute. - - - Runs an asynchronous computation, starting immediately on the current operating system - thread. Call one of the three continuations when the operation completes. - If no cancellation token is provided then the default cancellation token - is used. - The asynchronous computation to execute. - The function called on success. - The function called on exception. - The function called on cancellation. - The CancellationToken to associate with the computation. - The default is used if this parameter is not provided. - - - Runs an asynchronous computation, starting immediately on the current operating system - thread. - If no cancellation token is provided then the default cancellation token is used. - The asynchronous computation to execute. - The CancellationToken to associate with the computation. - The default is used if this parameter is not provided. - - - Creates an asynchronous computation which starts the given computation as a System.Threading.Tasks.Task - - - Starts a child computation within an asynchronous workflow. - This allows multiple asynchronous computations to be executed simultaneously. - - This method should normally be used as the immediate - right-hand-side of a let! binding in an F# asynchronous workflow, that is, - - async { ... - let! completor1 = childComputation1 |> Async.StartChild - let! completor2 = childComputation2 |> Async.StartChild - ... - let! result1 = completor1 - let! result2 = completor2 - ... } - - When used in this way, each use of StartChild starts an instance of childComputation - and returns a completor object representing a computation to wait for the completion of the operation. - When executed, the completor awaits the completion of childComputation. - The child computation. - The timeout value in milliseconds. If one is not provided - then the default value of -1 corresponding to System.Threading.Timeout.Infinite. - A new computation that waits for the input computation to finish. - - - Executes a computation in the thread pool. - If no cancellation token is provided then the default cancellation token is used. - A System.Threading.Tasks.Task that will be completed - in the corresponding state once the computation terminates (produces the result, throws exception or gets canceled) - - - - Starts the asynchronous computation in the thread pool. Do not await its result. - - If no cancellation token is provided then the default cancellation token is used. - The computation to run asynchronously. - The cancellation token to be associated with the computation. - If one is not supplied, the default cancellation token is used. - - - Creates an asynchronous computation that will sleep for the given time. This is scheduled - using a System.Threading.Timer object. The operation will not block operating system threads - for the duration of the wait. - The number of milliseconds to sleep. - An asynchronous computation that will sleep for the given time. - Thrown when the due time is negative - and not infinite. - - - Runs the asynchronous computation and await its result. - - If an exception occurs in the asynchronous computation then an exception is re-raised by this - function. - - If no cancellation token is provided then the default cancellation token is used. - - The timeout parameter is given in milliseconds. A value of -1 is equivalent to - System.Threading.Timeout.Infinite. - The computation to run. - The amount of time in milliseconds to wait for the result of the - computation before raising a System.TimeoutException. If no value is provided - for timeout then a default of -1 is used to correspond to System.Threading.Timeout.Infinite. - The cancellation token to be associated with the computation. - If one is not supplied, the default cancellation token is used. - The result of the computation. - - - Creates an asynchronous computation that executes all the given asynchronous computations, - initially queueing each as work items and using a fork/join pattern. - - If all child computations succeed, an array of results is passed to the success continuation. - - If any child computation raises an exception, then the overall computation will trigger an - exception, and cancel the others. - - The overall computation will respond to cancellation while executing the child computations. - If cancelled, the computation will cancel any remaining child computations but will still wait - for the other child computations to complete. - A sequence of distinct computations to be parallelized. - A computation that returns an array of values from the sequence of input computations. - - - Generates a scoped, cooperative cancellation handler for use within an asynchronous workflow. - - For example, - async { use! holder = Async.OnCancel interruption ... } - generates an asynchronous computation where, if a cancellation happens any time during - the execution of the asynchronous computation in the scope of holder, then action - interruption is executed on the thread that is performing the cancellation. This can - be used to arrange for a computation to be asynchronously notified that a cancellation - has occurred, e.g. by setting a flag, or deregistering a pending I/O action. - The function that is executed on the thread performing the - cancellation. - An asynchronous computation that triggers the interruption if it is cancelled - before being disposed. - - - Creates an asynchronous computation that runs the given computation and ignores - its result. - The input computation. - A computation that is equivalent to the input computation, but disregards the result. - - - Creates an asynchronous computation that captures the current - success, exception and cancellation continuations. The callback must - eventually call exactly one of the given continuations. - The function that accepts the current success, exception, and cancellation - continuations. - An asynchronous computation that provides the callback with the current continuations. - - - Creates an asynchronous computation in terms of a Begin/End pair of actions in - the style used in CLI APIs. This overlaod should be used if the operation is - qualified by three arguments. For example, - Async.FromBeginEnd(arg1,arg2,arg3,ws.BeginGetWeather,ws.EndGetWeather) - When the computation is run, beginFunc is executed, with - a callback which represents the continuation of the computation. - When the callback is invoked, the overall result is fetched using endFunc. - - The computation will respond to cancellation while waiting for the completion - of the operation. If a cancellation occurs, and cancelAction is specified, then it is - executed, and the computation continues to wait for the completion of the operation. - - If cancelAction is not specified, then cancellation causes the computation - to stop immediately, and subsequent invocations of the callback are ignored. - The first argument for the operation. - The second argument for the operation. - The third argument for the operation. - The function initiating a traditional CLI asynchronous operation. - The function completing a traditional CLI asynchronous operation. - An optional function to be executed when a cancellation is requested. - An asynchronous computation wrapping the given Begin/End functions. - - - Creates an asynchronous computation in terms of a Begin/End pair of actions in - the style used in CLI APIs. This overlaod should be used if the operation is - qualified by two arguments. For example, - Async.FromBeginEnd(arg1,arg2,ws.BeginGetWeather,ws.EndGetWeather) - When the computation is run, beginFunc is executed, with - a callback which represents the continuation of the computation. - When the callback is invoked, the overall result is fetched using endFunc. - - The computation will respond to cancellation while waiting for the completion - of the operation. If a cancellation occurs, and cancelAction is specified, then it is - executed, and the computation continues to wait for the completion of the operation. - - If cancelAction is not specified, then cancellation causes the computation - to stop immediately, and subsequent invocations of the callback are ignored. - The first argument for the operation. - The second argument for the operation. - The function initiating a traditional CLI asynchronous operation. - The function completing a traditional CLI asynchronous operation. - An optional function to be executed when a cancellation is requested. - An asynchronous computation wrapping the given Begin/End functions. - - - Creates an asynchronous computation in terms of a Begin/End pair of actions in - the style used in CLI APIs. This overlaod should be used if the operation is - qualified by one argument. For example, - Async.FromBeginEnd(place,ws.BeginGetWeather,ws.EndGetWeather) - When the computation is run, beginFunc is executed, with - a callback which represents the continuation of the computation. - When the callback is invoked, the overall result is fetched using endFunc. - - The computation will respond to cancellation while waiting for the completion - of the operation. If a cancellation occurs, and cancelAction is specified, then it is - executed, and the computation continues to wait for the completion of the operation. - - If cancelAction is not specified, then cancellation causes the computation - to stop immediately, and subsequent invocations of the callback are ignored. - The argument for the operation. - The function initiating a traditional CLI asynchronous operation. - The function completing a traditional CLI asynchronous operation. - An optional function to be executed when a cancellation is requested. - An asynchronous computation wrapping the given Begin/End functions. - - - Creates an asynchronous computation in terms of a Begin/End pair of actions in - the style used in CLI APIs. For example, - Async.FromBeginEnd(ws.BeginGetWeather,ws.EndGetWeather) - When the computation is run, beginFunc is executed, with - a callback which represents the continuation of the computation. - When the callback is invoked, the overall result is fetched using endFunc. - - The computation will respond to cancellation while waiting for the completion - of the operation. If a cancellation occurs, and cancelAction is specified, then it is - executed, and the computation continues to wait for the completion of the operation. - - If cancelAction is not specified, then cancellation causes the computation - to stop immediately, and subsequent invocations of the callback are ignored. - The function initiating a traditional CLI asynchronous operation. - The function completing a traditional CLI asynchronous operation. - An optional function to be executed when a cancellation is requested. - An asynchronous computation wrapping the given Begin/End functions. - - - Creates an asynchronous computation that executes computation. - If this computation completes successfully then return Choice1Of2 with the returned - value. If this computation raises an exception before it completes then return Choice2Of2 - with the raised exception. - The input computation that returns the type T. - A computation that returns a choice of type T or exception. - - - Raises the cancellation condition for the most recent set of asynchronous computations started - without any specific CancellationToken. Replaces the global CancellationTokenSource with a new - global token source for any asynchronous computations created after this point without any - specific CancellationToken. - - - Creates an asynchronous computation that will wait on the given WaitHandle. - - The computation returns true if the handle indicated a result within the given timeout. - The WaitHandle that can be signalled. - The timeout value in milliseconds. If one is not provided - then the default value of -1 corresponding to System.Threading.Timeout.Infinite. - An asynchronous computation that waits on the given WaitHandle. - - - - Return an asynchronous computation that will wait for the given task to complete and return - its result. - - - - Creates an asynchronous computation that will wait on the IAsyncResult. - - The computation returns true if the handle indicated a result within the given timeout. - The IAsyncResult to wait on. - The timeout value in milliseconds. If one is not provided - then the default value of -1 corresponding to System.Threading.Timeout.Infinite. - An asynchronous computation that waits on the given IAsyncResult. - - - Creates an asynchronous computation that waits for a single invocation of a CLI - event by adding a handler to the event. Once the computation completes or is - cancelled, the handler is removed from the event. - - The computation will respond to cancellation while waiting for the event. If a - cancellation occurs, and cancelAction is specified, then it is executed, and - the computation continues to wait for the event. - - If cancelAction is not specified, then cancellation causes the computation - to cancel immediately. - The event to handle once. - An optional function to execute instead of cancelling when a - cancellation is issued. - An asynchronous computation that waits for the event to be invoked. - - - Creates three functions that can be used to implement the .NET Asynchronous - Programming Model (APM) for a given asynchronous computation. - - The functions should normally be published as members with prefix Begin, - End and Cancel, and can be used within a type definition as follows: - - let beginAction,endAction,cancelAction = Async.AsBeginEnd (fun arg -> computation) - member x.BeginSomeOperation(arg,callback,state:obj) = beginAction(arg,callback,state) - member x.EndSomeOperation(iar) = endAction(iar) - member x.CancelSomeOperation(iar) = cancelAction(iar) - - - If the asynchronous computation takes no arguments, then AsBeginEnd is used as follows: - - let beginAction,endAction,cancelAction = Async.AsBeginEnd (fun () -> computation) - member x.BeginSomeOperation(callback,state:obj) = beginAction((),callback,state) - member x.EndSomeOperation(iar) = endAction(iar) - member x.CancelSomeOperation(iar) = cancelAction(iar) - - - - If the asynchronous computation takes two arguments, then AsBeginEnd is used as follows: - - let beginAction,endAction,cancelAction = Async.AsBeginEnd (fun arg1 arg2 -> computation) - member x.BeginSomeOperation(arg1,arg2,callback,state:obj) = beginAction((),callback,state) - member x.EndSomeOperation(iar) = endAction(iar) - member x.CancelSomeOperation(iar) = cancelAction(iar) - - - In each case, the resulting API will be familiar to programmers in other CLI languages and - is a useful way to publish asynchronous computations in CLI components. - A function generating the asynchronous computation to split into the traditional - .NET Asynchronous Programming Model. - A tuple of the begin, end, and cancel members. - - - This static class holds members for creating and manipulating asynchronous computations. - - - Creates an asynchronous computation that just returns (). - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of empty else branches in the - async { ... } computation expression syntax. - An asynchronous computation that returns (). - - - Creates an asynchronous computation that runs computation repeatedly - until guard() becomes false. - - A cancellation check is performed whenever the computation is executed. - - The existence of this method permits the use of while in the - async { ... } computation expression syntax. - The function to determine when to stop executing computation. - The function to be executed. Equivalent to the body - of a while expression. - An asynchronous computation that behaves similarly to a while loop when run. - - - Creates an asynchronous computation that runs binder(resource). - The action resource.Dispose() is executed as this computation yields its result - or if the asynchronous computation exits by an exception or by cancellation. - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of use and use! in the - async { ... } computation expression syntax. - The resource to be used and disposed. - The function that takes the resource and returns an asynchronous - computation. - An asynchronous computation that binds and eventually disposes resource. - - - Creates an asynchronous computation that runs computation and returns its result. - If an exception happens then catchHandler(exn) is called and the resulting computation executed instead. - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of try/with in the - async { ... } computation expression syntax. - The input computation. - The function to run when computation throws an exception. - An asynchronous computation that executes computation and calls catchHandler if an - exception is thrown. - - - Creates an asynchronous computation that runs computation. The action compensation is executed - after computation completes, whether computation exits normally or by an exception. If compensation raises an exception itself - the original exception is discarded and the new exception becomes the overall result of the computation. - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of try/finally in the - async { ... } computation expression syntax. - The input computation. - The action to be run after computation completes or raises an - exception (including cancellation). - An asynchronous computation that executes computation and compensation aftewards or - when an exception is raised. - - - Delegates to the input computation. - - The existence of this method permits the use of return! in the - async { ... } computation expression syntax. - The input computation. - The input computation. - - - Creates an asynchronous computation that returns the result v. - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of return in the - async { ... } computation expression syntax. - The value to return from the computation. - An asynchronous computation that returns value when executed. - - - Creates an asynchronous computation that enumerates the sequence seq - on demand and runs body for each element. - - A cancellation check is performed on each iteration of the loop. - - The existence of this method permits the use of for in the - async { ... } computation expression syntax. - The sequence to enumerate. - A function to take an item from the sequence and create - an asynchronous computation. Can be seen as the body of the for expression. - An asynchronous computation that will enumerate the sequence and run body - for each element. - - - Creates an asynchronous computation that runs generator. - - A cancellation check is performed when the computation is executed. - The function to run. - An asynchronous computation that runs generator. - - - Creates an asynchronous computation that first runs computation1 - and then runs computation2, returning the result of computation2. - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of expression sequencing in the - async { ... } computation expression syntax. - The first part of the sequenced computation. - The second part of the sequenced computation. - An asynchronous computation that runs both of the computations sequentially. - - - Creates an asynchronous computation that runs computation, and when - computation generates a result T, runs binder res. - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of let! in the - async { ... } computation expression syntax. - The computation to provide an unbound result. - The function to bind the result of computation. - An asynchronous computation that performs a monadic bind on the result - of computation. - - - - Generate an object used to build asynchronous computations using F# computation expressions. The value - 'async' is a pre-defined instance of this type. - - A cancellation check is performed when the computation is executed. - - - - The type of the async operator, used to build workflows for asynchronous computations. - - - Sends a reply to a PostAndReply message. - The value to send. - - - A handle to a capability to reply to a PostAndReply message. - - - A compositional asynchronous computation, which, when run, will eventually produce a value - of type T, or else raises an exception. - - Asynchronous computations are normally specified using an F# computation expression. - - When run, asynchronous computations have two modes: as a work item (executing synchronous - code), or as a wait item (waiting for an event or I/O completion). - - When run, asynchronous computations can be governed by CancellationToken. This can usually - be specified when the async computation is started. The associated CancellationTokenSource - may be used to cancel the asynchronous computation. Asynchronous computations built using - computation expressions can check the cancellation condition regularly. Synchronous - computations within an asynchronous computation do not automatically check this condition. - - - Publishes the event as a first class event value. - - - Triggers the event using the given parameters. - The parameters for the event. - - - Creates an event object suitable for implementing an arbitrary type of delegate. - The event object. - - - Event implementations for an arbitrary type of delegate. - - - Publishes an observation as a first class value. - - - Triggers an observation using the given parameters. - The event parameters. - - - Creates an observable object. - The created event. - - - Event implementations for the IEvent<_> type. - - - Publishes the event as a first class event value. - - - Triggers the event using the given sender object and parameters. The sender object may be null. - The object triggering the event. - The parameters for the event. - - - Creates an event object suitable for delegate types following the standard .NET Framework convention of a first 'sender' argument. - The created event. - - - Event implementations for a delegate types following the standard .NET Framework convention of a first 'sender' argument. - - - - - - A delegate type associated with the F# event type IEvent<_> - The object that fired the event. - The event arguments. - - - Remove a listener delegate from an event listener store. - The delegate to be removed from the event listener store. - - - Connect a handler delegate object to the event. A handler can - be later removed using RemoveHandler. The listener will - be invoked when the event is fired. - A delegate to be invoked when the event is fired. - - - First class event values for arbitrary delegate types. - - F# gives special status to member properties compatible with type IDelegateEvent and - tagged with the CLIEventAttribute. In this case the F# compiler generates approriate - CLI metadata to make the member appear to other CLI languages as a CLI event. - - - First-class listening points (i.e. objects that permit you to register a callback - activated when the event is triggered). - - - First class event values for CLI events conforming to CLI Framework standards. - - - The type of delayed computations. - - Use the values in the Lazy module to manipulate - values of this type, and the notation lazy expr to create values - of type . - - - Raises a timeout exception if a message not received in this amount of time. By default - no timeout is used. - - - Occurs when the execution of the agent results in an exception. - - - Occurs when the execution of the agent results in an exception. - - - Raises a timeout exception if a message not received in this amount of time. By default - no timeout is used. - - - Returns the number of unprocessed messages in the message queue of the agent. - - - Occurs when the execution of the agent results in an exception. - - - Scans for a message by looking through messages in arrival order until scanner - returns a Some value. Other messages remain in the queue. - - This method is for use within the body of the agent. For each agent, at most - one concurrent reader may be active, so no more than one concurrent call to - Receive, TryReceive, Scan and/or TryScan may be active. - The function to return None if the message is to be skipped - or Some if the message is to be processed and removed from the queue. - An optional timeout in milliseconds. Defaults to -1 which corresponds - to System.Threading.Timeout.Infinite. - An asynchronous computation that scanner built off the read message. - - - Waits for a message. This will consume the first message in arrival order. - - This method is for use within the body of the agent. - - Returns None if a timeout is given and the timeout is exceeded. - - This method is for use within the body of the agent. For each agent, at most - one concurrent reader may be active, so no more than one concurrent call to - Receive, TryReceive, Scan and/or TryScan may be active. - An optional timeout in milliseconds. Defaults to -1 which - corresponds to System.Threading.Timeout.Infinite. - An asynchronous computation that returns the received message or - None if the timeout is exceeded. - - - Like PostAndReply, but returns None if no reply within the timeout period. - The function to incorporate the AsyncReplyChannel into - the message to be sent. - An optional timeout parameter (in milliseconds) to wait for a reply message. - Defaults to -1 which corresponds to System.Threading.Timeout.Infinite. - The reply from the agent or None if the timeout expires. - - - Starts the agent. - - - Creates and starts an agent. The body function is used to generate the asynchronous - computation executed by the agent. - The function to produce an asynchronous computation that will be executed - as the read loop for the MailboxProcessor when Start is called. - An optional cancellation token for the body. - Defaults to Async.DefaultCancellationToken. - The created MailboxProcessor. - - - Scans for a message by looking through messages in arrival order until scanner - returns a Some value. Other messages remain in the queue. - - Returns None if a timeout is given and the timeout is exceeded. - - This method is for use within the body of the agent. For each agent, at most - one concurrent reader may be active, so no more than one concurrent call to - Receive, TryReceive, Scan and/or TryScan may be active. - The function to return None if the message is to be skipped - or Some if the message is to be processed and removed from the queue. - An optional timeout in milliseconds. Defaults to -1 which corresponds - to System.Threading.Timeout.Infinite. - An asynchronous computation that scanner built off the read message. - Thrown when the timeout is exceeded. - - - Waits for a message. This will consume the first message in arrival order. - - This method is for use within the body of the agent. - - This method is for use within the body of the agent. For each agent, at most - one concurrent reader may be active, so no more than one concurrent call to - Receive, TryReceive, Scan and/or TryScan may be active. - An optional timeout in milliseconds. Defaults to -1 which corresponds - to System.Threading.Timeout.Infinite. - An asynchronous computation that returns the received message. - Thrown when the timeout is exceeded. - - - Like AsyncPostAndReply, but returns None if no reply within the timeout period. - The function to incorporate the AsyncReplyChannel into - the message to be sent. - An optional timeout parameter (in milliseconds) to wait for a reply message. - Defaults to -1 which corresponds to System.Threading.Timeout.Infinite. - An asynchronous computation that will return the reply or None if the timeout expires. - - - Posts a message to an agent and await a reply on the channel, synchronously. - - The message is generated by applying buildMessage to a new reply channel - to be incorporated into the message. The receiving agent must process this - message and invoke the Reply method on this reply channel precisely once. - The function to incorporate the AsyncReplyChannel into - the message to be sent. - An optional timeout parameter (in milliseconds) to wait for a reply message. - Defaults to -1 which corresponds to System.Threading.Timeout.Infinite. - The reply from the agent. - - - Posts a message to an agent and await a reply on the channel, asynchronously. - - The message is generated by applying buildMessage to a new reply channel - to be incorporated into the message. The receiving agent must process this - message and invoke the Reply method on this reply channel precisely once. - The function to incorporate the AsyncReplyChannel into - the message to be sent. - An optional timeout parameter (in milliseconds) to wait for a reply message. - Defaults to -1 which corresponds to System.Threading.Timeout.Infinite. - An asychronous computation that will wait for the reply from the agent. - - - Posts a message to the message queue of the MailboxProcessor, asynchronously. - The message to post. - - - Creates an agent. The body function is used to generate the asynchronous - computation executed by the agent. This function is not executed until - Start is called. - The function to produce an asynchronous computation that will be executed - as the read loop for the MailboxProcessor when Start is called. - An optional cancellation token for the body. - Defaults to Async.DefaultCancellationToken. - The created MailboxProcessor. - - - A message-processing agent which executes an asynchronous computation. - - The agent encapsulates a message queue that supports multiple-writers and - a single reader agent. Writers send messages to the agent by using the Post - method and its variations. - - The agent may wait for messages using the Receive or TryReceive methods or - scan through all available messages using the Scan or TryScan method. - - - - - - Connects a listener function to the observable. The listener will - be invoked for each observation. The listener can be removed by - calling Dispose on the returned IDisposable object. - The function to be called for each observation. - An object that will remove the listener if disposed. - - - Permanently connects a listener function to the observable. The listener will - be invoked for each observation. - The function to be called for each observation. - - - Returns an asynchronous computation that will write the given bytes to the stream. - The buffer to write from. - An optional offset as a number of bytes in the stream. - An optional number of bytes to write to the stream. - An asynchronous computation that will write the given bytes to the stream. - Thrown when the sum of offset and count is longer than - the buffer length. - Thrown when offset or count is negative. - - - Returns an asynchronous computation that will read the given number of bytes from the stream. - The number of bytes to read. - An asynchronous computation that returns the read byte[] when run. - - - Returns an asynchronous computation that will read from the stream into the given buffer. - The buffer to read into. - An optional offset as a number of bytes in the stream. - An optional number of bytes to read from the stream. - An asynchronous computation that will read from the stream into the given buffer. - Thrown when the sum of offset and count is longer than - the buffer length. - Thrown when offset or count is negative. - - - A module of extension members providing asynchronous operations for some basic CLI types related to concurrency and I/O. - - - Returns a new event that triggers on the second and subsequent triggerings of the input event. - The Nth triggering of the input event passes the arguments from the N-1th and Nth triggering as - a pair. The argument passed to the N-1th triggering is held in hidden internal state until the - Nth triggering occurs. - The input event. - An event that triggers on pairs of consecutive values passed from the source event. - - - Runs the given function each time the given event is triggered. - The function to call when the event is triggered. - The input event. - - - Returns a new event consisting of the results of applying the given accumulating function - to successive values triggered on the input event. An item of internal state - records the current value of the state parameter. The internal state is not locked during the - execution of the accumulation function, so care should be taken that the - input IEvent not triggered by multiple threads simultaneously. - The function to update the state with each event value. - The initial state. - The input event. - An event that fires on the updated state values. - - - Returns a new event which fires on a selection of messages from the original event. - The selection function takes an original message to an optional new message. - The function to select and transform event values to pass on. - The input event. - An event that fires only when the chooser returns Some. - - - Returns a new event that listens to the original event and triggers the - first resulting event if the application of the function to the event arguments - returned a Choice1Of2, and the second event if it returns a Choice2Of2. - The function to transform event values into one of two types. - The input event. - A tuple of events. The first fires whenever splitter evaluates to Choice1of1 and - the second fires whenever splitter evaluates to Choice2of2. - - - Returns a new event that listens to the original event and triggers the - first resulting event if the application of the predicate to the event arguments - returned true, and the second event if it returned false. - The function to determine which output event to trigger. - The input event. - A tuple of events. The first is triggered when the predicate evaluates to true - and the second when the predicate evaluates to false. - - - Returns a new event that listens to the original event and triggers the resulting - event only when the argument to the event passes the given function. - The function to determine which triggers from the event to propagate. - The input event. - An event that only passes values that pass the predicate. - - - Returns a new event that passes values transformed by the given function. - The function to transform event values. - The input event. - An event that passes the transformed values. - - - Fires the output event when either of the input events fire. - The first input event. - The second input event. - An event that fires when either of the input events fire. - - - - - - Forces the execution of this value and return its result. Same as Value. Mutual exclusion is used to - prevent other threads also computing the value. - The value of the Lazy object. - - - Creates a lazy computation that evaluates to the given value when forced. - The input value. - The created Lazy object. - - - Creates a lazy computation that evaluates to the result of the given function when forced. - The function to provide the value when needed. - The created Lazy object. - - - Extensions related to Lazy values. - - - Returns a new observable that triggers on the second and subsequent triggerings of the input observable. - The Nth triggering of the input observable passes the arguments from the N-1th and Nth triggering as - a pair. The argument passed to the N-1th triggering is held in hidden internal state until the - Nth triggering occurs. - - For each observer, the registered intermediate observing object is not thread safe. - That is, observations arising from the source must not be triggered concurrently - on different threads. - The input Observable. - An Observable that triggers on successive pairs of observations from the input Observable. - - - Creates an observer which subscribes to the given observable and which calls - the given function for each observation. - The function to be called on each observation. - The input Observable. - An object that will remove the callback if disposed. - - - Creates an observer which permanently subscribes to the given observable and which calls - the given function for each observation. - The function to be called on each observation. - The input Observable. - - - Returns an observable which, for each observer, allocates an item of state - and applies the given accumulating function to successive values arising from - the input. The returned object will trigger observations for each computed - state value, excluding the initial value. The returned object propagates - all errors arising from the source and completes when the source completes. - - For each observer, the registered intermediate observing object is not thread safe. - That is, observations arising from the source must not be triggered concurrently - on different threads. - The function to update the state with each observation. - The initial state. - The input Observable. - An Observable that triggers on the updated state values. - - - Returns an observable which chooses a projection of observations from the source - using the given function. The returned object will trigger observations x - for which the splitter returns Some x. The returned object also propagates - all errors arising from the source and completes when the source completes. - The function that returns Some for observations to be propagated - and None for observations to ignore. - The input Observable. - An Observable that only propagates some of the observations from the source. - - - Returns two observables which split the observations of the source by the - given function. The first will trigger observations x for which the - splitter returns Choice1Of2 x. The second will trigger observations - y for which the splitter returns Choice2Of2 y The splitter is - executed once for each subscribed observer. Both also propagate error - observations arising from the source and each completes when the source - completes. - The function that takes an observation an transforms - it into one of the two output Choice types. - The input Observable. - A tuple of Observables. The first triggers when splitter returns Choice1of2 - and the second triggers when splitter returns Choice2of2. - - - Returns two observables which partition the observations of the source by - the given function. The first will trigger observations for those values - for which the predicate returns true. The second will trigger observations - for those values where the predicate returns false. The predicate is - executed once for each subscribed observer. Both also propagate all error - observations arising from the source and each completes when the source - completes. - The function to determine which output Observable will trigger - a particular observation. - The input Observable. - A tuple of Observables. The first triggers when the predicate returns true, and - the second triggers when the predicate returns false. - - - Returns an observable which filters the observations of the source - by the given function. The observable will see only those observations - for which the predicate returns true. The predicate is executed once for - each subscribed observer. The returned object also propagates error - observations arising from the source and completes when the source completes. - The function to apply to observations to determine if it should - be kept. - The input Observable. - An Observable that filters observations based on filter. - - - Returns an observable which transforms the observations of the source by the - given function. The transformation function is executed once for each - subscribed observer. The returned object also propagates error observations - arising from the source and completes when the source completes. - The function applied to observations from the source. - The input Observable. - An Observable of the type specified by mapping. - - - Returns an observable for the merged observations from the sources. - The returned object propagates success and error values arising - from either source and completes when both the sources have completed. - - For each observer, the registered intermediate observing object is not - thread safe. That is, observations arising from the sources must not - be triggered concurrently on different threads. - The first Observable. - The second Observable. - An Observable that propagates information from both sources. - - - Basic operations on first class event and other observable objects. - - - Returns an asynchronous computation that, when run, will wait for a response to the given WebRequest. - An asynchronous computation that waits for response to the WebRequest. - - - A module of extension members providing asynchronous operations for some basic Web operations. - - - Creates an instance of the attribute - AbstractClassAttribute - - - Adding this attribute to class definition makes it abstract, which means it need not - implement all its methods. Instances of abstract classes may not be constructed directly. - - - Creates an instance of the attribute - AllowNullLiteralAttribute - - - Adding this attribute to a type lets the 'null' literal be used for the type - within F# code. This attribute may only be added to F#-defined class or - interface types. - - - Indicates the namespace or module to be automatically opened when an assembly is referenced - or an enclosing module opened. - - - Creates an attribute used to mark a namespace or module path to be 'automatically opened' when an assembly is referenced - The namespace or module to be automatically opened when an assembly is referenced - or an enclosing module opened. - AutoOpenAttribute - - - Creates an attribute used to mark a module as 'automatically opened' when the enclosing namespace is opened - AutoOpenAttribute - - - This attribute is used for two purposes. When applied to an assembly, it must be given a string - argument, and this argument must indicate a valid module or namespace in that assembly. Source - code files compiled with a reference to this assembly are processed in an environment - where the given path is automatically opened. - - When applied to a module within an assembly, then the attribute must not be given any arguments. - When the enclosing namespace is opened in user source code, the module is also implicitly opened. - - - The value of the attribute, indicating whether the type is automatically marked serializable or not - - - Creates an instance of the attribute - Indicates whether the type should be serializable by default. - AutoSerializableAttribute - - - Adding this attribute to a type with value 'false' disables the behaviour where F# makes the - type Serializable by default. - - - Creates an instance of the attribute - CLIEventAttribute - - - Adding this attribute to a property with event type causes it to be compiled with as a CLI - metadata event, through a syntactic translation to a pair of 'add_EventName' and - 'remove_EventName' methods. - - - Creates an instance of the attribute - CLIMutableAttribute - - - Adding this attribute to a record type causes it to be compiled to a CLI representation - with a default constructor with property getters and setters. - - - Choice 2 of 2 choices - - - Choice 1 of 2 choices - - - Helper types for active patterns with 2 choices. - - - Choice 3 of 3 choices - - - Choice 2 of 3 choices - - - Choice 1 of 3 choices - - - Helper types for active patterns with 3 choices. - - - Choice 4 of 4 choices - - - Choice 3 of 4 choices - - - Choice 2 of 4 choices - - - Choice 1 of 4 choices - - - Helper types for active patterns with 4 choices. - - - Choice 5 of 5 choices - - - Choice 4 of 5 choices - - - Choice 3 of 5 choices - - - Choice 2 of 5 choices - - - Choice 1 of 5 choices - - - Helper types for active patterns with 5 choices. - - - Choice 6 of 6 choices - - - Choice 5 of 6 choices - - - Choice 4 of 6 choices - - - Choice 3 of 6 choices - - - Choice 2 of 6 choices - - - Choice 1 of 6 choices - - - Helper types for active patterns with 6 choices. - - - Choice 7 of 7 choices - - - Choice 6 of 7 choices - - - Choice 5 of 7 choices - - - Choice 4 of 7 choices - - - Choice 3 of 7 choices - - - Choice 2 of 7 choices - - - Choice 1 of 7 choices - - - Helper types for active patterns with 7 choices. - - - Creates an instance of the attribute - ClassAttribute - - - Adding this attribute to a type causes it to be represented using a CLI class. - - - Creates an instance of the attribute - ComparisonConditionalOnAttribute - - - This attribute is used to indicate a generic container type satisfies the F# 'comparison' - constraint only if a generic argument also satisfies this constraint. For example, adding - this attribute to parameter 'T on a type definition C<'T> means that a type C<X> only supports - comparison if the type X also supports comparison and all other conditions for C<X> to support - comparison are also met. The type C<'T> can still be used with other type arguments, but a type such - as C<(int -> int)> will not support comparison because the type (int -> int) is an F# function type - and does not support comparison. - - This attribute will be ignored if it is used on the generic parameters of functions or methods. - - - Indicates the number of arguments in each argument group - - - Creates an instance of the attribute - Indicates the number of arguments in each argument group. - CompilationArgumentCountsAttribute - - - This attribute is generated automatically by the F# compiler to tag functions and members - that accept a partial application of some of their arguments and return a residual function - - - Indicates the variant number of the entity, if any, in a linear sequence of elements with F# source code - - - Indicates the relationship between the compiled entity and F# source code - - - Indicates the sequence number of the entity, if any, in a linear sequence of elements with F# source code - - - Creates an instance of the attribute - Indicates the type of source construct. - CompilationMappingAttribute - - - Creates an instance of the attribute - Indicates the type of source construct. - CompilationMappingAttribute - - - Creates an instance of the attribute - Indicates the type of source construct. - CompilationMappingAttribute - - - This attribute is inserted automatically by the F# compiler to tag types - and methods in the generated CLI code with flags indicating the correspondence - with original source constructs. It is used by the functions in the - Microsoft.FSharp.Reflection namespace to reverse-map compiled constructs to - their original forms. It is not intended for use from user code. - - - Indicates one or more adjustments to the compiled representation of an F# type or member - - - Creates an instance of the attribute - Indicates adjustments to the compiled representation of the type or member. - CompilationRepresentationAttribute - - - This attribute is used to adjust the runtime representation for a type. - For example, it may be used to note that the null representation - may be used for a type. This affects how some constructs are compiled. - - - Compile a property as a CLI event. - - - Permit the use of null as a representation for nullary discriminators in a discriminated union. - - - append 'Module' to the end of a module whose name clashes with a type name in the same namespace. - - - Compile a member as 'instance' even if null is used as a representation for this type. - - - Compile an instance member as 'static' . - - - No special compilation representation. - - - - - - Indicates one or more adjustments to the compiled representation of an F# type or member. - - - Indicates the name of the entity in F# source code - - - Creates an instance of the attribute - The name of the method in source. - CompilationSourceNameAttribute - - - This attribute is inserted automatically by the F# compiler to tag - methods which are given the 'CompiledName' attribute. It is not intended - for use from user code. - - - The name of the value as it appears in compiled code - - - Creates an instance of the attribute - The name to use in compiled code. - CompiledNameAttribute - - - Adding this attribute to a value or function definition in an F# module changes the name used - for the value in compiled CLI code. - - - Indicates if the construct should always be hidden in an editing environment. - - - Indicates if the message should indicate a compiler error. Error numbers less than - 10000 are considered reserved for use by the F# compiler and libraries. - - - Indicates the number associated with the message. - - - Indicates the warning message to be emitted when F# source code uses this construct - - - Indicates if the construct should always be hidden in an editing environment. - - - Indicates if the message should indicate a compiler error. Error numbers less than - 10000 are considered reserved for use by the F# compiler and libraries. - - - Creates an instance of the attribute. - - - Indicates that a message should be emitted when F# source code uses this construct. - - - Creates an instance of the attribute - CustomComparisonAttribute - - - Adding this attribute to a type indicates it is a type with a user-defined implementation of comparison. - - - Creates an instance of the attribute - CustomEqualityAttribute - - - Adding this attribute to a type indicates it is a type with a user-defined implementation of equality. - - - Indicates if the custom operation maintains the variable space of the query of computation expression through the use of a bind operation - - - Indicates if the custom operation maintains the variable space of the query of computation expression - - - Indicates the name used for the 'on' part of the custom query operator for join-like operators - - - Indicates if the custom operation is an operation similar to a zip in a sequence computation, supporting two inputs - - - Indicates if the custom operation is an operation similar to a join in a sequence computation, supporting two inputs and a correlation constraint - - - Indicates if the custom operation is an operation similar to a group join in a sequence computation, supporting two inputs and a correlation constraint, and generating a group - - - Indicates if the custom operation supports the use of 'into' immediately after the use of the operation in a query or other computation expression to consume the results of the operation - - - Get the name of the custom operation when used in a query or other computation expression - - - Indicates if the custom operation maintains the variable space of the query of computation expression through the use of a bind operation - - - Indicates if the custom operation maintains the variable space of the query of computation expression - - - Indicates the name used for the 'on' part of the custom query operator for join-like operators - - - Indicates if the custom operation is an operation similar to a zip in a sequence computation, supporting two inputs - - - Indicates if the custom operation is an operation similar to a join in a sequence computation, supporting two inputs and a correlation constraint - - - Indicates if the custom operation is an operation similar to a group join in a sequence computation, supporting two inputs and a correlation constraint, and generating a group - - - Indicates if the custom operation supports the use of 'into' immediately after the use of the operation in a query or other computation expression to consume the results of the operation - - - Creates an instance of the attribute - CustomOperationAttribute - - - - Indicates that a member on a computation builder type is a custom query operator, - and indicates the name of that operator. - - - - The value of the attribute, indicating whether the type has a default augmentation or not - - - Creates an instance of the attribute - Indicates whether to generate helper members on the CLI class representing a discriminated - union. - DefaultAugmentationAttribute - - - Adding this attribute to a discriminated union with value false - turns off the generation of standard helper member tester, constructor - and accessor members for the generated CLI class for that type. - - - Indicates if a constraint is asserted that the field type supports 'null' - - - Creates an instance of the attribute - Indicates whether to assert that the field type supports null. - DefaultValueAttribute - - - Creates an instance of the attribute - DefaultValueAttribute - - - Adding this attribute to a field declaration means that the field is - not initialized. During type checking a constraint is asserted that the field type supports 'null'. - If the 'check' value is false then the constraint is not asserted. - - - Creates an instance of the attribute - EntryPointAttribute - - - Adding this attribute to a function indicates it is the entrypoint for an application. - If this attribute is not specified for an EXE then the initialization implicit in the - module bindings in the last file in the compilation sequence are used as the entrypoint. - - - Creates an instance of the attribute - EqualityConditionalOnAttribute - - - This attribute is used to indicate a generic container type satisfies the F# 'equality' - constraint only if a generic argument also satisfies this constraint. For example, adding - this attribute to parameter 'T on a type definition C<'T> means that a type C<X> only supports - equality if the type X also supports equality and all other conditions for C<X> to support - equality are also met. The type C<'T> can still be used with other type arguments, but a type such - as C<(int -> int)> will not support equality because the type (int -> int) is an F# function type - and does not support equality. - - This attribute will be ignored if it is used on the generic parameters of functions or methods. - - - Indicates the warning message to be emitted when F# source code uses this construct - - - Creates an instance of the attribute - The warning message to be emitted when code uses this construct. - ExperimentalAttribute - - - This attribute is used to tag values that are part of an experimental library - feature. - - - Invoke an F# first class function value with two curried arguments. In some cases this - will result in a more efficient application than applying the arguments successively. - The input function. - The first arg. - The second arg. - The function result. - - - Invoke an F# first class function value with three curried arguments. In some cases this - will result in a more efficient application than applying the arguments successively. - The input function. - The first arg. - The second arg. - The third arg. - The function result. - - - Invoke an F# first class function value with four curried arguments. In some cases this - will result in a more efficient application than applying the arguments successively. - The input function. - The first arg. - The second arg. - The third arg. - The fourth arg. - The function result. - - - Invoke an F# first class function value with five curried arguments. In some cases this - will result in a more efficient application than applying the arguments successively. - The input function. - The first arg. - The second arg. - The third arg. - The fourth arg. - The fifth arg. - The function result. - - - Invoke an F# first class function value with one argument - - 'U - - - Construct an instance of an F# first class function value - The created F# function. - - - The CLI type used to represent F# function values. This type is not - typically used directly, though may be used from other CLI languages. - - - The release number of the F# version associated with the attribute - - - The minor version number of the F# version associated with the attribute - - - The major version number of the F# version associated with the attribute - - - Creates an instance of the attribute - The major version number. - The minor version number. - The release number. - FSharpInterfaceDataVersionAttribute - - - This attribute is added to generated assemblies to indicate the - version of the data schema used to encode additional F# - specific information in the resource attached to compiled F# libraries. - - - Specialize the type function at a given type - The specialized type. - - - Construct an instance of an F# first class type function value - FSharpTypeFunc - - - The CLI type used to represent F# first-class type function values. This type is for use - by compiled F# code. - - - Type of a formatting expression. - Function type generated by printf. - Type argument passed to %a formatters - Value generated by the overall printf action (e.g. sprint generates a string) - Value generated after post processing (e.g. failwithf generates a string internally then raises an exception) - - - Type of a formatting expression. - Function type generated by printf. - Type argument passed to %a formatters - Value generated by the overall printf action (e.g. sprint generates a string) - Value generated after post processing (e.g. failwithf generates a string internally then raises an exception) - Tuple of values generated by scan or match. - - - Convert the given Action delegate object to an F# function value - The input action. - The F# function. - - - A utility function to convert function values from tupled to curried form - The input tupled function. - The output curried function. - - - A utility function to convert function values from tupled to curried form - The input tupled function. - The output curried function. - - - A utility function to convert function values from tupled to curried form - The input tupled function. - The output curried function. - - - A utility function to convert function values from tupled to curried form - The input tupled function. - The output curried function. - - - Helper functions for converting F# first class function values to and from CLI representaions - of functions using delegates. - - - Creates an instance of the attribute - GeneralizableValueAttribute - - - Adding this attribute to a non-function value with generic parameters indicates that - uses of the construct can give rise to generic code through type inference. - - - Creates an instance of the attribute - InterfaceAttribute - - - Adding this attribute to a type causes it to be represented using a CLI interface. - - - Creates an instance of the attribute - LiteralAttribute - - - Adding this attribute to a value causes it to be compiled as a CLI constant literal. - - - Creates an instance of the attribute - MeasureAnnotatedAbbreviationAttribute - - - Adding this attribute to a type causes it to be interpreted as a refined type, currently limited to measure-parameterized types. - This may only be used under very limited conditions. - - - Creates an instance of the attribute - MeasureAttribute - - - Adding this attribute to a type causes it to be interpreted as a unit of measure. - This may only be used under very limited conditions. - - - Creates an instance of the attribute - NoComparisonAttribute - - - Adding this attribute to a type indicates it is a type where comparison is an abnormal operation. - This means that the type does not satisfy the F# 'comparison' constraint. Within the bounds of the - F# type system, this helps ensure that the F# generic comparison function is not instantiated directly - at this type. The attribute and checking does not constrain the use of comparison with base or child - types of this type. - - - Creates an instance of the attribute - NoDynamicInvocationAttribute - - - This attribute is used to tag values that may not be dynamically invoked at runtime. This is - typically added to inlined functions whose implementations include unverifiable code. It - causes the method body emitted for the inlined function to raise an exception if - dynamically invoked, rather than including the unverifiable code in the generated - assembly. - - - Creates an instance of the attribute - NoEqualityAttribute - - - Adding this attribute to a type indicates it is a type where equality is an abnormal operation. - This means that the type does not satisfy the F# 'equality' constraint. Within the bounds of the - F# type system, this helps ensure that the F# generic equality function is not instantiated directly - at this type. The attribute and checking does not constrain the use of comparison with base or child - types of this type. - - - The representation of "Value of type 'T" - The input value. - An option representing the value. - - - The representation of "No value" - - - Get the value of a 'Some' option. A NullReferenceException is raised if the option is 'None'. - - - Create an option value that is a 'None' value. - - - Return 'true' if the option is a 'Some' value. - - - Return 'true' if the option is a 'None' value. - - - Create an option value that is a 'Some' value. - The input value - An option representing the value. - - - The type of optional values. When used from other CLI languages the - empty option is the null value. - - Use the constructors Some and None to create values of this type. - Use the values in the Option module to manipulate values of this type, - or pattern match against the values directly. - - None values will appear as the value null to other CLI languages. - Instance methods on this type will appear as static methods to other CLI languages - due to the use of null as a value representation. - - - Creates an instance of the attribute - OptionalArgumentAttribute - - - This attribute is added automatically for all optional arguments. - - - The raw text of the format string. - - - Construct a format string - The input string. - The PrintfFormat containing the formatted result. - - - Type of a formatting expression. - Function type generated by printf. - Type argument passed to %a formatters - Value generated by the overall printf action (e.g. sprint generates a string) - Value generated after post processing (e.g. failwithf generates a string internally then raises an exception) - - - Construct a format string - The input string. - The created format string. - - - Type of a formatting expression. - Function type generated by printf. - Type argument passed to %a formatters - Value generated by the overall printf action (e.g. sprint generates a string) - Value generated after post processing (e.g. failwithf generates a string internally then raises an exception) - Tuple of values generated by scan or match. - - - Creates an instance of the attribute - ProjectionParameterAttribute - - - Indicates that, when a custom operator is used in a computation expression, - a parameter is automatically parameterized by the variable space of the computation expression - - - - The current value of the reference cell - - - - The current value of the reference cell - - - The current value of the reference cell - - - The type of mutable references. Use the functions [:=] and [!] to get and - set values of this type. - - - Creates an instance of the attribute - ReferenceEqualityAttribute - - - Adding this attribute to a record or union type disables the automatic generation - of overrides for 'System.Object.Equals(obj)', 'System.Object.GetHashCode()' - and 'System.IComparable' for the type. The type will by default use reference equality. - - - Creates an instance of the attribute - ReflectedDefinitionAttribute - - - Adding this attribute to the let-binding for the definition of a top-level - value makes the quotation expression that implements the value available - for use at runtime. - - - Creates an instance of the attribute - RequireQualifiedAccessAttribute - - - This attribute is used to indicate that references to the elements of a module, record or union - type require explicit qualified access. - - - Creates an instance of the attribute - RequiresExplicitTypeArgumentsAttribute - - - Adding this attribute to a type, value or member requires that - uses of the construct must explicitly instantiate any generic type parameters. - - - The value of the attribute, indicating whether the type is sealed or not. - - - Creates an instance of the attribute - Indicates whether the class is sealed. - SealedAttribute - - - Creates an instance of the attribute. - The created attribute. - - - Adding this attribute to class definition makes it sealed, which means it may not - be extended or implemented. - - - Indicates that the compiled entity had private or internal representation in F# source code. - - - The mask of values related to the kind of the compiled entity. - - - Indicates that the compiled entity is part of the representation of an F# value declaration. - - - Indicates that the compiled entity is part of the representation of an F# union case declaration. - - - Indicates that the compiled entity is part of the representation of an F# module declaration. - - - Indicates that the compiled entity is part of the representation of an F# closure. - - - Indicates that the compiled entity is part of the representation of an F# exception declaration. - - - Indicates that the compiled entity is part of the representation of an F# record or union case field declaration. - - - Indicates that the compiled entity is part of the representation of an F# class or other object type declaration. - - - Indicates that the compiled entity is part of the representation of an F# record type declaration. - - - Indicates that the compiled entity is part of the representation of an F# union type declaration. - - - Indicates that the compiled entity has no relationship to an element in F# source code. - - - - - - Indicates the relationship between a compiled entity in a CLI binary and an element in F# source code. - - - Creates an instance of the attribute - StructAttribute - - - Adding this attribute to a type causes it to be represented using a CLI struct. - - - Creates an instance of the attribute - StructuralComparisonAttribute - - - Adding this attribute to a record, union, exception, or struct type confirms the - automatic generation of implementations for 'System.IComparable' for the type. - - - Creates an instance of the attribute - StructuralEqualityAttribute - - - Adding this attribute to a record, union or struct type confirms the automatic - generation of overrides for 'System.Object.Equals(obj)' and - 'System.Object.GetHashCode()' for the type. - - - Indicates the text to display by default when objects of this type are displayed - using '%A' printf formatting patterns and other two-dimensional text-based display - layouts. - - - Creates an instance of the attribute - Indicates the text to display when using the '%A' printf formatting. - StructuredFormatDisplayAttribute - - - 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 this version of F# the only valid values are of the form PreText {PropertyName} PostText. - The property name indicates a property to evaluate and to display instead of the object itself. - - - The type 'unit', which has only one value "()". This value is special and - always uses the representation 'null'. - - - Creates an instance of the attribute - UnverifiableAttribute - - - This attribute is used to tag values whose use will result in the generation - of unverifiable code. These values are inevitably marked 'inline' to ensure that - the unverifiable constructs are not present in the actual code for the F# library, - but are rather copied to the source code of the caller. - - - Creates an instance of the attribute - VolatileFieldAttribute - - - Adding this attribute to an F# mutable binding causes the "volatile" - prefix to be used for all accesses to the field. - - - Four dimensional arrays, typically zero-based. Non-zero-based arrays - can be created using methods on the System.Array type. - - Use the values in the Array4D module - to manipulate values of this type, or the notation arr.[x1,x2,x3,x4] to get and set array - values. - - - Three dimensional arrays, typically zero-based. Non-zero-based arrays - can be created using methods on the System.Array type. - - Use the values in the Array3D module - to manipulate values of this type, or the notation arr.[x1,x2,x3] to get and set array - values. - - - Two dimensional arrays, typically zero-based. - - Use the values in the Array2D module - to manipulate values of this type, or the notation arr.[x,y] to get/set array - values. - - Non-zero-based arrays can also be created using methods on the System.Array type. - - - Single dimensional, zero-based arrays, written int[], string[] etc. - Use the values in the Array module to manipulate values - of this type, or the notation arr.[x] to get/set array - values. - - - Single dimensional, zero-based arrays, written int[], string[] etc. - - Use the values in the Array module to manipulate values - of this type, or the notation arr.[x] to get/set array - values. - - - - - - An abbreviation for the CLI type System.Boolean. - - - Represents a managed pointer in F# code. - - - An abbreviation for the CLI type System.Byte. - - - An abbreviation for the CLI type System.Char. - - - An abbreviation for the CLI type System.Decimal. - - - The type of decimal numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.Decimal. - - - An abbreviation for the CLI type System.Double. - - - An abbreviation for the CLI type System.Exception. - - - An abbreviation for the CLI type System.Double. - - - An abbreviation for the CLI type System.Single. - - - The type of floating point numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.Single. - - - The type of floating point numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.Double. - - - This type is for internal use by the F# code generator. - - - An abbreviation for the CLI type System.Int32. - - - An abbreviation for the CLI type System.Int16. - - - The type of 16-bit signed integer numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.Int16. - - - An abbreviation for the CLI type System.Int32. - - - An abbreviation for the CLI type System.Int64. - - - The type of 64-bit signed integer numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.Int64. - - - An abbreviation for the CLI type System.SByte. - - - The type of 32-bit signed integer numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.Int32. - - - An abbreviation for the CLI type System.IntPtr. - - - Represents an unmanaged pointer in F# code. - - This type should only be used when writing F# code that interoperates - with native code. Use of this type in F# code may result in - unverifiable code being generated. Conversions to and from the - nativeint type may be required. Values of this type can be generated - by the functions in the NativeInterop.NativePtr module. - - - An abbreviation for the CLI type System.Object. - - - The type of optional values. When used from other CLI languages the - empty option is the null value. - - Use the constructors Some and None to create values of this type. - Use the values in the Option module to manipulate values of this type, - or pattern match against the values directly. - - 'None' values will appear as the value null to other CLI languages. - Instance methods on this type will appear as static methods to other CLI languages - due to the use of null as a value representation. - - - The type of mutable references. Use the functions [:=] and [!] to get and - set values of this type. - - - An abbreviation for the CLI type System.SByte. - - - The type of 8-bit signed integer numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.SByte. - - - An abbreviation for the CLI type System.Single. - - - An abbreviation for the CLI type System.String. - - - An abbreviation for the CLI type System.UInt16. - - - An abbreviation for the CLI type System.UInt32. - - - An abbreviation for the CLI type System.UInt64. - - - An abbreviation for the CLI type System.Byte. - - - An abbreviation for the CLI type System.UIntPtr. - - - The type 'unit', which has only one value "()". This value is special and - always uses the representation 'null'. - - - - - - - - - - - - Non-exhaustive match failures will raise the MatchFailureException exception - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - A new enumerator for the sequence. - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - A reference to the sequence. - - A 0, 1, and 2 respectively indicate Stop, Yield, and Goto conditions for the sequence generator. - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - A new sequence generator for the expression. - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - - - Namespace name the provider injects types into. - - - - - Compilers call this method to query a type provider for a type name. - - Resolver should return a type called name in namespace NamespaceName or null if the type is unknown. - - - - - - The top-level types - - - - - - The sub-namespaces in this namespace. An optional member to prevent generation of namespaces until an outer namespace is explored. - - - - - - - - Triggered when an assumption changes that invalidates the resolutions so far reported by the provider - - - - - Triggered when an assumption changes that invalidates the resolutions so far reported by the provider - - - - - Triggered when an assumption changes that invalidates the resolutions so far reported by the provider - - - - - Get the static parameters for a provided type. - - A type returned by GetTypes or ResolveTypeName - - - - - Namespace name the this TypeProvider injects types into. - - - - - Called by the compiler to ask for an Expression tree to replace the given MethodBase with. - - MethodBase that was given to the compiler by a type returned by a GetType(s) call. - Expressions that represent the parameters to this call. - An expression that the compiler will use in place of the given method base. - - - - Get the physical contents of the given logical provided assembly. - - - - - Apply static arguments to a provided type that accepts static arguments. - - The provider must return a type with the given mangled name. - the provided type definition which has static parameters - the full path of the type, including encoded representations of static parameters - the static parameters, indexed by name - - - - - - - Represents the inverse of a measure expressions when returned as a generic argument of a provided type. - - - Represents the '1' measure expression when returned as a generic argument of a provided type. - - - Represents the product of two measure expressions when returned as a generic argument of a provided type. - - - - - - Creates an instance of the attribute - TypeProviderAssemblyAttribute - The name of the design-time assembly for this type provider. - - - Creates an instance of the attribute - TypeProviderAssemblyAttribute - - - Place attribute on runtime assembly to indicate that there is a corresponding design-time - assembly that contains a type provider. Runtime and designer assembly may be the same. - - - Creates an instance of the attribute - TypeProviderAttribute - - - Place on a class that implements ITypeProvider to extend the compiler - - - - Get the full path to use for temporary files for the type provider instance. - - - - - version of referenced system runtime assembly - - - - - Get the full path to referenced assembly that caused this type provider instance to be created. - - - - - Get the full path to use to resolve relative paths in any file name arguments given to the type provider instance. - - - - - Get the referenced assemblies for the type provider instance. - - - - - Indicates if the type provider host responds to invalidation events for type provider instances. - - - - - Indicates if the type provider instance is used in an environment which executes provided code such as F# Interactive. - - - - - Get the full path to use for temporary files for the type provider instance. - - - - - version of referenced system runtime assembly - - - - - Get the full path to referenced assembly that caused this type provider instance to be created. - - - - - Get the full path to use to resolve relative paths in any file name arguments given to the type provider instance. - - - - - Get the referenced assemblies for the type provider instance. - - - - - Indicates if the type provider host responds to invalidation events for type provider instances. - - - - - Indicates if the type provider instance is used in an environment which executes provided code such as F# Interactive. - - - - - Checks if given type exists in target system runtime library - - - - - - - - If the class that implements ITypeProvider has a constructor that accepts TypeProviderConfig - then it will be constructed with an instance of TypeProviderConfig. - - - - - - - - - - - - - - - - - - - - - - - - - - - - Creates an instance of the attribute - TypeProviderEditorHideMethodsAttribute - - - Indicates that a code editor should hide all System.Object methods from the intellisense menus for instances of a provided type - - - - - - - - - - - - Additional type attribute flags related to provided types - - - - - - Creates an instance of the attribute - TypeProviderXmlDocAttribute - - - - The TypeProviderXmlDocAttribute attribute can be added to types and members. - The language service will display the CommentText property from the attribute - in the appropriate place when the user hovers over a type or member. - - - - - - - - - - - - - - - - Creates an anonymous event with the given handlers. - - A function to handle adding a delegate for the event to trigger. - A function to handle removing a delegate that the event triggers. - A function to produce the delegate type the event can trigger. - - The initialized event. - - - The F# compiler emits calls to this function to implement the use operator for F# sequence - expressions. - - The resource to be used and disposed. - The input sequence. - - The result sequence. - - - The F# compiler emits calls to this function to implement the compiler-intrinsic - conversions from untyped System.Collections.IEnumerable sequences to typed sequences. - - An initializer function. - A function to iterate and test if end of sequence is reached. - A function to retrieve the current element. - - The resulting typed sequence. - - - The F# compiler emits calls to this function to - implement the try/finally operator for F# sequence expressions. - - The input sequence. - A computation to be included in an enumerator's Dispose method. - - The result sequence. - - - The F# compiler emits calls to this function to - implement the while operator for F# sequence expressions. - - A function that indicates whether iteration should continue. - The input sequence. - - The result sequence. - - - A group of functions used as part of the compiled representation of F# sequence expressions. - - - Builds a query using query syntax and operators. - - - An active pattern to force the execution of values of type Lazy<_>. - - - Special prefix operator for splicing untyped expressions into quotation holes. - - - Special prefix operator for splicing typed expressions into quotation holes. - - - Builds a 2D array from a sequence of sequences of elements. - - - Builds a read-only lookup table from a sequence of key/value pairs. The key objects are indexed using generic hashing and equality. - - - Converts the argument to signed byte. - This is a direct conversion for all - primitive numeric types. For strings, the input is converted using SByte.Parse() with InvariantCulture settings. - Otherwise the operation requires and invokes a ToSByte method on the input type. - - - Converts the argument to byte. - This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Byte.Parse() on strings and otherwise requires a ToByte method on the input type. - - - Converts the argument to 64-bit float. - This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Double.Parse() with InvariantCulture settings. Otherwise the operation requires and invokes a ToDouble method on the input type. - - - Converts the argument to 32-bit float. - This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Single.Parse() with InvariantCulture settings. Otherwise the operation requires and invokes a ToSingle method on the input type. - - - Builds an aysnchronous workflow using computation expression syntax. - - - Builds a set from a sequence of objects. The objects are indexed using generic comparison. - The input sequence of elements. - The created set. - - - Print to a file using the given format, and add a newline. - The file TextWriter. - The formatter. - The formatted result. - - - Print to a file using the given format. - The file TextWriter. - The formatter. - The formatted result. - - - Print to a string buffer and raise an exception with the given - result. Helper printers must return strings. - The formatter. - The formatted result. - - - Print to a string using the given format. - The formatter. - The formatted result. - - - - - - Divides a value by an integer. - The input value. - The input int. - The division result. - - - - - - Resolves to the value 'one' for any primitive numeric type or any type with a static member called 'One' - - - Resolves to the zero value for any primitive numeric type or any type with a static member called 'Zero' - - - A compiler intrinsic that implements dynamic invocations for the DivideByInt primitive. - - - A compiler intrinsic that implements dynamic invocations to the checked '*' operator. - - - A compiler intrinsic that implements dynamic invocations to the '*' operator. - - - A compiler intrinsic that implements dynamic invocations to the checked '+' operator. - - - A compiler intrinsic that implements dynamic invocations to the '+' operator. - - - Resolves to the value 'one' for any primitive numeric type or any type with a static member called 'One'. - - - Resolves to the zero value for any primitive numeric type or any type with a static member called 'Zero'. - - - Parse an uint64 according to the rules used by the overloaded 'uint64' conversion operator when applied to strings - The input string. - The parsed value. - - - Parse an int64 according to the rules used by the overloaded 'int64' conversion operator when applied to strings - The input string. - The parsed value. - - - Parse an uint32 according to the rules used by the overloaded 'uint32' conversion operator when applied to strings - The input string. - The parsed value. - - - Parse an int32 according to the rules used by the overloaded 'int32' conversion operator when applied to strings - The input string. - The parsed value. - - - Creates an sbyte value with units-of-measure - The input sbyte. - The sbyte with units-of-measure. - - - Creates an int16 value with units-of-measure - The input int16. - The int16 with units-of-measure. - - - Creates an int64 value with units-of-measure - The input int64. - The int64 with units of measure. - - - Creates an int32 value with units-of-measure - The input int. - The int with units of measure. - - - Creates a decimal value with units-of-measure - The input decimal. - The decimal with units of measure. - - - Creates a float32 value with units-of-measure - The input float. - The float with units-of-measure. - - - Creates a float value with units-of-measure - The input float. - The float with units-of-measure. - - - Get the underlying value for an enum value - The input enum. - The enumeration as a value. - - - Build an enum value from an underlying value - The input value. - The value as an enumeration. - - - Recursively hash a part of a value according to its structure. - The comparison function. - The input object. - The hashed value. - - - Hash a value according to its structure. Use the given limit to restrict the hash when hashing F# - records, lists and union types. - The limit on the number of nodes. - The input object. - The hashed value. - - - Hash a value according to its structure. This hash is not limited by an overall node count when hashing F# - records, lists and union types. - The input object. - The hashed value. - - - Make an F# hash/equality object for the given type using node-limited hashing when hashing F# - records, lists and union types. - The input limit on the number of nodes. - System.Collections.Generic.IEqualityComparer<'T> - - - Make an F# hash/equality object for the given type - - - Make an F# comparer object for the given type, where it can be null if System.Collections.Generic.Comparer<'T>.Default - - - Make an F# comparer object for the given type - - - A static F# comparer object - - - Return an F# comparer object suitable for hashing and equality. This hashing behaviour - of the returned comparer is not limited by an overall node count when hashing F# - records, lists and union types. This equality comparer has equivalence - relation semantics ([nan] = [nan]). - - - Return an F# comparer object suitable for hashing and equality. This hashing behaviour - of the returned comparer is not limited by an overall node count when hashing F# - records, lists and union types. - - - The physical hash. Hashes on the object identity, except for value types, - where we hash on the contents. - The input object. - The hashed value. - - - Reference/physical equality. - True if the inputs are reference-equal, false otherwise. - The first value. - The second value. - The result of the comparison. - - - Take the maximum of two values structurally according to the order given by GenericComparison - The first value. - The second value. - The maximum value. - - - Take the minimum of two values structurally according to the order given by GenericComparison - The first value. - The second value. - The minimum value. - - - Compare two values - The first value. - The second value. - The result of the comparison. - - - Compare two values - The first value. - The second value. - The result of the comparison. - - - Compare two values - The first value. - The second value. - The result of the comparison. - - - Compare two values - The first value. - The second value. - The result of the comparison. - - - Compare two values. May be called as a recursive case from an implementation of System.IComparable to - ensure consistent NaN comparison semantics. - The function to compare the values. - The first value. - The second value. - The result of the comparison. - - - Compare two values - The first value. - The second value. - The result of the comparison. - - - Compare two values for equality - - The first value. - The second value. - The result of the comparison. - - - Compare two values for equality using equivalence relation semantics ([nan] = [nan]) - The first value. - The second value. - The result of the comparison. - - - Compare two values for equality using partial equivalence relation semantics ([nan] <> [nan]) - The first value. - The second value. - The result of the comparison. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - The F# compiler emits calls to some of the functions in this module as part of the compiled form of some language constructs - - - - The standard overloaded associative (4-indexed) mutation operator - - - - The standard overloaded associative (3-indexed) mutation operator - - - The standard overloaded associative (2-indexed) mutation operator - - - The standard overloaded associative (indexed) mutation operator - - - The standard overloaded associative (4-indexed) lookup operator - - - The standard overloaded associative (3-indexed) lookup operator - - - The standard overloaded associative (2-indexed) lookup operator - - - The standard overloaded associative (indexed) lookup operator - - - A compiler intrinsic for checking initialization soundness of recursive bindings - - - A compiler intrinsic for checking initialization soundness of recursive static bindings - - - A compiler intrinsic for checking initialization soundness of recursive bindings - - - A compiler intrinsic for the efficient compilation of sequence expressions - - - This function implements parsing of decimal constants - - - This function implements calls to default constructors - acccessed by 'new' constraints. - - - Primitive used by pattern match compilation - - - A compiler intrinsic that implements the ':?' operator - - - A compiler intrinsic that implements the ':?' operator - - - A compiler intrinsic that implements the ':?>' operator - - - A compiler intrinsic that implements the ':?>' operator - - - The F# compiler emits calls to some of the functions in this module as part of the compiled form of some language constructs - - - Address-of. Uses of this value may result in the generation of unverifiable code. - The input object. - The unmanaged pointer. - - - Address-of. Uses of this value may result in the generation of unverifiable code. - The input object. - The managed pointer. - - - Binary 'or'. When used as a binary operator the right hand value is evaluated only on demand - The first value. - The second value. - The result of the operation. - - - Binary 'or'. When used as a binary operator the right hand value is evaluated only on demand. - - - Binary 'and'. When used as a binary operator the right hand value is evaluated only on demand - The first value. - The second value. - The result of the operation. - - - Binary 'and'. When used as a binary operator the right hand value is evaluated only on demand. - - - The F# compiler emits calls to some of the functions in this module as part of the compiled form of some language constructs - - - - - - - - - - - - - - - - - - For internal use only - - - Language primitives associated with the F# language - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - An active pattern to match values of type System.Collections.Generic.KeyValuePair - The input key/value pair. - A tuple containing the key and value. - - - Converts the argument to character. Numeric inputs are converted according to the UTF-16 - encoding for characters. String inputs must be exactly one character long. For other - input types the operation requires an appropriate static conversion method on the input type. - The input value. - The converted char. - - - Converts the argument to System.Decimal using a direct conversion for all - primitive numeric types. For strings, the input is converted using UInt64.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted decimal. - - - Converts the argument to a string using ToString. - - For standard integer and floating point values the ToString conversion - uses CultureInfo.InvariantCulture. - The input value. - The converted string. - - - Converts the argument to unsigned native integer using a direct conversion for all - primitive numeric types. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted unativeint - - - Converts the argument to signed native integer. This is a direct conversion for all - primitive numeric types. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted nativeint - - - Converts the argument to 64-bit float. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Double.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted float - - - Converts the argument to 32-bit float. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Single.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted float32 - - - Converts the argument to unsigned 64-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using UInt64.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint64 - - - Converts the argument to signed 64-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Int64.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int64 - - - Converts the argument to unsigned 32-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using UInt32.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint32 - - - Converts the argument to signed 32-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Int32.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int32 - - - Converts the argument to a particular enum type. - The input value. - The converted enum type. - - - Converts the argument to signed 32-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Int32.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int - - - Converts the argument to unsigned 16-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using UInt16.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint16 - - - Converts the argument to signed 16-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Int16.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int16 - - - Converts the argument to signed byte. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using SByte.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted sbyte - - - Converts the argument to byte. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Byte.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted byte - - - Overloaded power operator. If n > 0 then equivalent to x*...*x for n occurrences of x. - The input base. - The input exponent. - The base raised to the exponent. - - - Overloaded power operator. - The input base. - The input exponent. - The base raised to the exponent. - - - Overloaded truncate operator. - The input value. - The truncated value. - - - Hyperbolic tangent of the given number - The input value. - The hyperbolic tangent of the input. - - - Tangent of the given number - The input value. - The tangent of the input. - - - Hyperbolic sine of the given number - The input value. - The hyperbolic sine of the input. - - - Sine of the given number - The input value. - The sine of the input. - - - Hyperbolic cosine of the given number - The input value. - The hyperbolic cosine of the input. - - - Cosine of the given number - The input value. - The cosine of the input. - - - Square root of the given number - The input value. - The square root of the input. - - - Logarithm to base 10 of the given number - The input value. - The logarithm to base 10 of the input. - - - Natural logarithm of the given number - The input value. - The natural logarithm of the input. - - - Round the given number - The input value. - The nearest integer to the input value. - - - Sign of the given number - The input value. - -1, 0, or 1 depending on the sign of the input. - - - Floor of the given number - The input value. - The floor of the input. - - - Exponential of the given number - The input value. - The exponential of the input. - - - Ceiling of the given number - The input value. - The ceiling of the input. - - - Inverse tangent of x/y where x and y are specified separately - The y input value. - The x input value. - The inverse tangent of the input ratio. - - - Inverse tangent of the given number - The input value. - The inverse tangent of the input. - - - Inverse sine of the given number - The input value. - The inverse sine of the input. - - - Inverse cosine of the given number - The input value. - The inverse cosine of the input. - - - Absolute value of the given number. - The input value. - The absolute value of the input. - - - A generic hash function. This function has the same behaviour as 'hash', - however the default structural hashing for F# union, record and tuple - types stops when the given limit of nodes is reached. The exact behaviour of - the function can be adjusted on a type-by-type basis by implementing - GetHashCode for each type. - The limit of nodes. - The input object. - The computed hash. - - - A generic hash function, designed to return equal hash values for items that are - equal according to the "=" operator. By default it will use structural hashing - for F# union, record and tuple types, hashing the complete contents of the - type. The exact behaviour of the function can be adjusted on a - type-by-type basis by implementing GetHashCode for each type. - The input object. - The computed hash. - - - Returns the internal size of a type in bytes. For example, sizeof<int> returns 4. - - - Generate a System.Type representation for a type definition. If the - input type is a generic type instantiation then return the - generic type definition associated with all such instantiations. - - - An internal, library-only compiler intrinsic for compile-time - generation of a RuntimeMethodHandle. - - - Generate a System.Type runtime representation of a static type. - The static type is still maintained on the value returned. - - - Clean up resources associated with the input object after the completion of the given function. - Cleanup occurs even when an exception is raised by the protected - code. - The resource to be disposed after action is called. - The action that accepts the resource. - The resulting value. - - - Execute the function as a mutual-exclusion region using the input value as a lock. - The object to be locked. - The action to perform during the lock. - The resulting value. - - - The standard overloaded skip range operator, e.g. [n..skip..m] for lists, seq {n..skip..m} for sequences - The start value of the range. - The step value of the range. - The end value of the range. - The sequence spanning the range using the specified step size. - - - The standard overloaded range operator, e.g. [n..m] for lists, seq {n..m} for sequences - The start value of the range. - The end value of the range. - The sequence spanning the range. - - - Equivalent to System.Single.NaN - - - Equivalent to System.Single.PositiveInfinity - - - Equivalent to System.Double.NaN - - - Equivalent to System.Double.PositiveInfinity - - - Builds a sequence using sequence expression syntax - The input sequence. - The result sequence. - - - Negate a logical value. not true equals false and not false equals true - The value to negate. - The result of the negation. - - - Concatenate two lists. - The first list. - The second list. - The concatenation of the lists. - - - Increment a mutable reference cell containing an integer - The reference cell. - - - Decrement a mutable reference cell containing an integer - The reference cell. - - - Dereference a mutable reference cell - The cell to dereference. - The value contained in the cell. - - - Assign to a mutable reference cell - The cell to mutate. - The value to set inside the cell. - - - Create a mutable reference cell - The value to contain in the cell. - The created reference cell. - - - The identity function - The input value. - The same value. - - - Throw a System.InvalidOperationException exception - The exception message. - The result value. - - - Throw a System.ArgumentNullException exception - The argument name. - The result value. - - - Throw a System.ArgumentException exception with - the given argument name and message. - The argument name. - The exception message. - The result value. - - - Throw a System.Exception exception. - The exception message. - The result value. - - - Boxes a strongly typed value. - The value to box. - The boxed object. - - - Unboxes a strongly typed value. This is the inverse of box, unbox<t>(box<t> a) equals a. - The boxed value. - The unboxed result. - - - Ignore the passed value. This is often used to throw away results of a computation. - The value to ignore. - - - Minimum based on generic comparison - The first value. - The second value. - The minimum value. - - - Maximum based on generic comparison - The first value. - The second value. - The maximum value. - - - Generic comparison. - The first value. - The second value. - The result of the comparison. - - - Return the second element of a tuple, snd (a,b) = b. - The input tuple. - The second value. - - - Return the first element of a tuple, fst (a,b) = a. - The input tuple. - The first value. - - - Matches System.Exception objects whose runtime type is precisely System.Exception - The input exception. - A string option. - - - Builds a System.Exception object. - The message for the Exception. - A System.Exception. - - - Rethrows an exception. This should only be used when handling an exception - The result value. - - - Rethrows an exception. This should only be used when handling an exception - The result value. - - - Raises an exception - The exception to raise. - The result value. - - - Concatenate two strings. The operator '+' may also be used. - - - Used to specify a default value for an optional argument in the implementation of a function - An option representing the argument. - The default value of the argument. - The argument value. If it is None, the defaultValue is returned. - - - Apply a function to three values, the values being a triple on the right, the function on the left - The function. - The first argument. - The second argument. - The third argument. - The function result. - - - Apply a function to two values, the values being a pair on the right, the function on the left - The function. - The first argument. - The second argument. - The function result. - - - Apply a function to a value, the value being on the right, the function on the left - The function. - The argument. - The function result. - - - Apply a function to three values, the values being a triple on the left, the function on the right - The first argument. - The second argument. - The third argument. - The function. - The function result. - - - Apply a function to two values, the values being a pair on the left, the function on the right - The first argument. - The second argument. - The function. - The function result. - - - Apply a function to a value, the value being on the left, the function on the right - The argument. - The function. - The function result. - - - Compose two functions, the function on the right being applied first - The second function to apply. - The first function to apply. - The composition of the input functions. - - - Compose two functions, the function on the left being applied first - The first function to apply. - The second function to apply. - The composition of the input functions. - - - Structural inequality - The first parameter. - The second parameter. - The result of the comparison. - - - Structural equality - The first parameter. - The second parameter. - The result of the comparison. - - - Structural less-than-or-equal comparison - The first parameter. - The second parameter. - The result of the comparison. - - - Structural greater-than-or-equal - The first parameter. - The second parameter. - The result of the comparison. - - - Structural greater-than - The first parameter. - The second parameter. - The result of the comparison. - - - Structural less-than comparison - The first parameter. - The second parameter. - The result of the comparison. - - - Overloaded prefix-plus operator - The input value. - The result of the operation. - - - Overloaded bitwise-NOT operator - The input value. - The result of the operation. - - - Overloaded byte-shift right operator by a specified number of bits - The input value. - The amount to shift. - The result of the operation. - - - Overloaded byte-shift left operator by a specified number of bits - The input value. - The amount to shift. - The result of the operation. - - - Overloaded bitwise-XOR operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded bitwise-OR operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded bitwise-AND operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded modulo operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded division operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded multiplication operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded subtraction operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded addition operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded unary negation. - The value to negate. - The result of the operation. - - - Converts the argument to char. Numeric inputs are converted using a checked - conversion according to the UTF-16 encoding for characters. String inputs must - be exactly one character long. For other input types the operation requires an - appropriate static conversion method on the input type. - The input value. - The converted char - - - Converts the argument to unativeint. This is a direct, checked conversion for all - primitive numeric types. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted unativeint - - - Converts the argument to nativeint. This is a direct, checked conversion for all - primitive numeric types. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted nativeint - - - Converts the argument to uint64. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.UInt64.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint64 - - - Converts the argument to int64. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.Int64.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int64 - - - Converts the argument to uint32. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.UInt32.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint32 - - - Converts the argument to int32. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.Int32.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int32 - - - Converts the argument to int. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.Int32.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int - - - Converts the argument to uint16. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.UInt16.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint16 - - - Converts the argument to int16. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.Int16.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int16 - - - Converts the argument to sbyte. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.SByte.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted sbyte - - - Converts the argument to byte. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.Byte.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted byte - - - Overloaded multiplication operator (checks for overflow) - The first value. - The second value. - The product of the two input values. - - - Overloaded addition operator (checks for overflow) - The first value. - The second value. - The sum of the two input values. - - - Overloaded subtraction operator (checks for overflow) - The first value. - The second value. - The first value minus the second value. - - - Overloaded unary negation (checks for overflow) - The input value. - The negated value. - - - This module contains the basic arithmetic operations with overflow checks. - - - Perform generic hashing on a value where the type of the value is not - statically required to satisfy the 'equality' constraint. - The computed hash value. - - - Perform generic equality on two values where the type of the values is not - statically required to satisfy the 'equality' constraint. - The result of the comparison. - - - Perform generic comparison on two values where the type of the values is not - statically required to have the 'comparison' constraint. - The result of the comparison. - - - Generate a default value for any type. This is null for reference types, - For structs, this is struct value where all fields have the default value. - This function is unsafe in the sense that some F# values do not have proper null values. - - - Unboxes a strongly typed value. This is the inverse of box, unbox<t>(box<t> a) equals a. - The boxed value. - The unboxed result. - - - This module contains basic operations which do not apply runtime and/or static checks - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'decimal' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'float' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'float32' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'unativeint' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'nativeint' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'uint64' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'int64' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'uint32' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'int32' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'uint16' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'int16' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'sbyte' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'byte' - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - Generate a range of values using the given zero, add, start, step and stop values - - - Generate a range of values using the given zero, add, start, step and stop values - - - Generate a range of char values - - - Generate a range of byte values - - - Generate a range of sbyte values - - - Generate a range of uint16 values - - - Generate a range of int16 values - - - Generate a range of unativeint values - - - Generate a range of nativeint values - - - Generate a range of uint32 values - - - Generate a range of uint64 values - - - Generate a range of int64 values - - - Generate a range of float32 values - - - Generate a range of float values - - - Generate a range of integers - - - Gets a slice from a string - The source string. - The index of the first character of the slice. - The index of the last character of the slice. - The substring from the given indices. - - - Sets a slice of an array - The target array. - The start index of the first dimension. - The end index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The start index of the third dimension. - The end index of the third dimension. - The start index of the fourth dimension. - The end index of the fourth dimension. - The source array. - - - Gets a slice of an array - The source array. - The start index of the first dimension. - The end index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The start index of the third dimension. - The end index of the third dimension. - The start index of the fourth dimension. - The end index of the fourth dimension. - The four dimensional sub array from the given indices. - - - Sets a slice of an array - The target array. - The start index of the first dimension. - The end index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The start index of the third dimension. - The end index of the third dimension. - The source array. - - - Gets a slice of an array - The source array. - The start index of the first dimension. - The end index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The start index of the third dimension. - The end index of the third dimension. - The three dimensional sub array from the given indices. - - - Sets a vector slice of a 2D array. The index of the second dimension is fixed. - The target array. - The start index of the first dimension. - The end index of the first dimension. - The index of the second dimension. - The source array. - - - Sets a vector slice of a 2D array. The index of the first dimension is fixed. - The target array. - The index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The source array. - - - Sets a region slice of an array - The target array. - The start index of the first dimension. - The end index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The source array. - - - Gets a vector slice of a 2D array. The index of the second dimension is fixed. - The source array. - The start index of the first dimension. - The end index of the first dimension. - The fixed index of the second dimension. - The sub array from the input indices. - - - Gets a vector slice of a 2D array. The index of the first dimension is fixed. - The source array. - The index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The sub array from the input indices. - - - Gets a region slice of an array - The source array. - The start index of the first dimension. - The end index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The two dimensional sub array from the input indices. - - - Sets a slice of an array - The target array. - The start index. - The end index. - The source array. - - - Gets a slice of an array - The input array. - The start index. - The end index. - The sub array from the input indices. - - - A module of compiler intrinsic functions for efficient implementations of F# integer ranges - and dynamic invocations of other F# operators - - - Basic F# Operators. This module is automatically opened in all F# code. - - - Invoke an F# first class function value that accepts five curried arguments - without intervening execution - The first arg. - The second arg. - The third arg. - The fourth arg. - The fifth arg. - The function result. - - - Adapt an F# first class function value to be an optimized function value that can - accept five curried arguments without intervening execution. - The input function. - The optimized function. - - - Construct an optimized function value that can accept five curried - arguments without intervening execution. - The optimized function. - - - The CLI type used to represent F# function values that accept five curried arguments - without intervening execution. This type should not typically used directly from - either F# code or from other CLI languages. - - - Invoke an F# first class function value that accepts four curried arguments - without intervening execution - The first arg. - The second arg. - The third arg. - The fourth arg. - The function result. - - - Adapt an F# first class function value to be an optimized function value that can - accept four curried arguments without intervening execution. - The input function. - The optimized function. - - - Construct an optimized function value that can accept four curried - arguments without intervening execution. - The optimized function. - - - The CLI type used to represent F# function values that accept four curried arguments - without intervening execution. This type should not typically used directly from - either F# code or from other CLI languages. - - - Invoke an F# first class function value that accepts three curried arguments - without intervening execution - The first arg. - The second arg. - The third arg. - The function result. - - - Adapt an F# first class function value to be an optimized function value that can - accept three curried arguments without intervening execution. - The input function. - The adapted function. - - - Construct an optimized function value that can accept three curried - arguments without intervening execution. - The optimized function. - - - The CLI type used to represent F# function values that accept - three iterated (curried) arguments without intervening execution. This type should not - typically used directly from either F# code or from other CLI languages. - - - Invoke the optimized function value with two curried arguments - The first arg. - The second arg. - The function result. - - - Adapt an F# first class function value to be an optimized function value that can - accept two curried arguments without intervening execution. - The input function. - The adapted function. - - - Construct an optimized function value that can accept two curried - arguments without intervening execution. - The optimized function. - - - The CLI type used to represent F# function values that accept - two iterated (curried) arguments without intervening execution. This type should not - typically used directly from either F# code or from other CLI languages. - - - An implementation module used to hold some private implementations of function - value invocation. - - - Convert the option to a list of length 0 or 1. - The input option. - The result list. - - - Convert the option to an array of length 0 or 1. - The input option. - The result array. - - - bind f inp evaluates to match inp with None -> None | Some x -> f x - A function that takes the value of type T from an option and transforms it into - an option containing a value of type U. - The input option. - An option of the output type of the binder. - - - map f inp evaluates to match inp with None -> None | Some x -> Some (f x). - A function to apply to the option value. - The input option. - An option of the input value after applying the mapping function, or None if the input is None. - - - iter f inp executes match inp with None -> () | Some x -> f x. - A function to apply to the option value. - The input option. - Unit if the option is None, otherwise it returns the result of applying the predicate - to the option value. - - - forall p inp evaluates to match inp with None -> true | Some x -> p x. - A function that evaluates to a boolean when given a value from the option type. - The input option. - True if the option is None, otherwise it returns the result of applying the predicate - to the option value. - - - exists p inp evaluates to match inp with None -> false | Some x -> p x. - A function that evaluates to a boolean when given a value from the option type. - The input option. - False if the option is None, otherwise it returns the result of applying the predicate - to the option value. - - - fold f inp s evaluates to match inp with None -> s | Some x -> f x s. - A function to update the state data when given a value from an option. - The input option. - The initial state. - The original state if the option is None, otherwise it returns the updated state with the folder - and the option value. - - - fold f s inp evaluates to match inp with None -> s | Some x -> f s x. - A function to update the state data when given a value from an option. - The initial state. - The input option. - The original state if the option is None, otherwise it returns the updated state with the folder - and the option value. - - - count inp evaluates to match inp with None -> 0 | Some _ -> 1. - The input option. - A zero if the option is None, a one otherwise. - - - Gets the value associated with the option. - The input option. - The value within the option. - Thrown when the option is None. - - - Returns true if the option is None. - The input option. - True if the option is None. - - - Returns true if the option is not None. - The input option. - True if the option is not None. - - - Basic operations on options. - - - - - - - - - - - - - - - - - - - - - - - - Represents a statically-analyzed format associated with writing to a System.IO.TextWriter. The type parameter indicates the - arguments and return type of the format operation. - - - Represents a statically-analyzed format when formatting builds a string. The type parameter indicates the - arguments and return type of the format operation. - - - Represents a statically-analyzed format associated with writing to a System.Text.StringBuilder. The type parameter indicates the - arguments and return type of the format operation. - - - Represents a statically-analyzed format associated with writing to a System.IO.TextWriter. The first type parameter indicates the - arguments of the format operation and the last the overall return type. - - - Represents a statically-analyzed format when formatting builds a string. The first type parameter indicates the - arguments of the format operation and the last the overall return type. - - - Represents a statically-analyzed format associated with writing to a System.Text.StringBuilder. The first type parameter indicates the - arguments of the format operation and the last the overall return type. - - - Print to a string buffer and raise an exception with the given - result. Helper printers must return strings. - The input formatter. - The arguments of the formatter. - - - sprintf, but call the given 'final' function to generate the result. - See kprintf. - The function called to generate a result from the formatted string. - The input formatter. - The arguments of the formatter. - - - printf, but call the given 'final' function to generate the result. - For example, these let the printing force a flush after all output has - been entered onto the channel, but not before. - The function called after formatting to generate the format result. - The input formatter. - The arguments of the formatter. - - - fprintf, but call the given 'final' function to generate the result. - See kprintf. - The function called after formatting to generate the format result. - The input TextWriter. - The input formatter. - The arguments of the formatter. - - - bprintf, but call the given 'final' function to generate the result. - See kprintf. - The function called after formatting to generate the format result. - The input StringBuilder. - The input formatter. - The arguments of the formatter. - - - Print to a string via an internal string buffer and return - the result as a string. Helper printers must return strings. - The input formatter. - The formatted string. - - - Print to a text writer, adding a newline - The TextWriter to print to. - The input formatter. - The return type and arguments of the formatter. - - - Print to a text writer. - The TextWriter to print to. - The input formatter. - The return type and arguments of the formatter. - - - Print to a System.Text.StringBuilder - The StringBuilder to print to. - The input formatter. - The return type and arguments of the formatter. - - - Extensible printf-style formatting for numbers and other datatypes - - Format specifications are strings with "%" markers indicating format - placeholders. Format placeholders consist of: - - %[flags][width][.precision][type] - - where the type is interpreted as follows: - - %b: bool, formatted as "true" or "false" - %s: string, formatted as its unescaped contents - %c: character literal - %d, %i: any basic integer type formatted as a decimal integer, signed if the basic integer type is signed. - %u: any basic integer type formatted as an unsigned decimal integer - %x, %X, %o: any basic integer type formatted as an unsigned hexadecimal - (a-f)/Hexadecimal (A-F)/Octal integer - - %e, %E, %f, %F, %g, %G: - any basic floating point type (float,float32) formatted - using a C-style floating point format specifications, i.e - - %e, %E: Signed value having the form [-]d.dddde[sign]ddd where - d is a single decimal digit, dddd is one or more decimal - digits, ddd is exactly three decimal digits, and sign - is + or - - - %f: Signed value having the form [-]dddd.dddd, where dddd is one - or more decimal digits. The number of digits before the - decimal point depends on the magnitude of the number, and - the number of digits after the decimal point depends on - the requested precision. - - %g, %G: Signed value printed in f or e format, whichever is - more compact for the given value and precision. - - - %M: System.Decimal value - - %O: Any value, printed by boxing the object and using it's ToString method(s) - - %A: Any value, printed with the default layout settings - - %a: A general format specifier, requires two arguments: - (1) a function which accepts two arguments: - (a) a context parameter of the appropriate type for the - given formatting function (e.g. an #System.IO.TextWriter) - (b) a value to print - and which either outputs or returns appropriate text. - - (2) the particular value to print - - - %t: A general format specifier, requires one argument: - (1) a function which accepts a context parameter of the - appropriate type for the given formatting function (e.g. - an System.IO.TextWriter)and which either outputs or returns - appropriate text. - - Basic integer types are: - byte,sbyte,int16,uint16,int32,uint32,int64,uint64,nativeint,unativeint - Basic floating point types are: - float, float32 - - The optional width is an integer indicating the minimal width of the - result. For instance, %6d prints an integer, prefixing it with spaces - to fill at least 6 characters. If width is '*', then an extra integer - argument is taken to specify the corresponding width. - - any number - '*': - - Valid flags are: - - 0: add zeros instead of spaces to make up the required width - '-': left justify the result within the width specified - '+': add a '+' character if the number is positive (to match a '-' sign - for negatives) - ' ': add an extra space if the number is positive (to match a '-' - sign for negatives) - - The printf '#' flag is invalid and a compile-time error will be reported if it is used. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Returns the length of the string. - The input string. - The number of characters in the string. - - - Returns a string by concatenating count instances of str. - The number of copies of the input string will be copied. - The input string. - The concatenated string. - Thrown when count is negative. - - - Tests if any character of the string satisfies the given predicate. - The function to test each character of the string. - The input string. - True if any character returns true for the predicate and false otherwise. - - - Tests if all characters in the string satisfy the given predicate. - The function to test each character of the string. - The input string. - True if all characters return true for the predicate and false otherwise. - - - Builds a new string whose characters are the results of applying the function mapping - to each index from 0 to count-1 and concatenating the resulting - strings. - The number of strings to initialize. - The function to take an index and produce a string to - be concatenated with the others. - The constructed string. - Thrown when count is negative. - - - Builds a new string whose characters are the results of applying the function mapping - to each of the characters of the input string and concatenating the resulting - strings. - The function to produce a string from each character of the input string. - The input string. - The concatenated string. - - - Builds a new string whose characters are the results of applying the function mapping - to each character and index of the input string. - The function to apply to each character and index of the string. - The input string. - The resulting string. - - - Builds a new string whose characters are the results of applying the function mapping - to each of the characters of the input string. - The function to apply to the characters of the string. - The input string. - The resulting string. - - - Applies the function action to the index of each character in the string and the - character itself. - The function to apply to each character and index of the string. - The input string. - - - Applies the function action to each character in the string. - The function to be applied to each character of the string. - The input string. - - - Returns a new string made by concatenating the given strings - with separator sep, that is a1 + sep + ... + sep + aN. - The separator string to be inserted between the strings - of the input sequence. - The sequence of strings to be concatenated. - A new string consisting of the concatenated strings separated by - the separation string. - Thrown when strings is null. - - - Functional programming operators for string processing. Further string operations - are available via the member functions on strings and other functionality in - System.String - and System.Text.RegularExpressions types. - - - - The SI unit of catalytic activity - - - - - The SI unit of does equivalent - - - - - The SI unit of absorbed dose - - - - - The SI unit of activity referred to a radionuclide - - - - - The SI unit of illuminance - - - - - The SI unit of luminous flux - - - - - The SI unit of inductance - - - - - The SI unit of magnetic flux density - - - - - The SI unit of magnetic flux - - - - - The SI unit of electric conductance - - - - - The SI unit of electric resistance - - - - - The SI unit of capacitance - - - - - The SI unit of electric potential difference, electromotive force - - - - - The SI unit of electric charge, amount of electricity - - - - - The SI unit of power, radiant flux - - - - - The SI unit of energy, work, amount of heat - - - - - The SI unit of pressure, stress - - - - - The SI unit of force - - - - - The SI unit of frequency - - - - - The SI unit of luminous intensity - - - - - The SI unit of amount of substance - - - - - The SI unit of thermodynamic temperature - - - - - The SI unit of electric current - - - - - The SI unit of time - - - - - The SI unit of mass - - - - - The SI unit of length - - - - - The SI unit of length - - - - - A synonym for henry, the SI unit of inductance - - - - - A synonym for katal, the SI unit of catalytic activity - - - - - A synonym for sievert, the SI unit of does equivalent - - - - - A synonym for gray, the SI unit of absorbed dose - - - - - A synonym for becquerel, the SI unit of activity referred to a radionuclide - - - - - A synonym for lux, the SI unit of illuminance - - - - - A synonym for lumen, the SI unit of luminous flux - - - - - A synonym for tesla, the SI unit of magnetic flux density - - - - - A synonym for weber, the SI unit of magnetic flux - - - - - A synonym for UnitNames.ohm, the SI unit of electric resistance. - - - - - A synonym for siemens, the SI unit of electric conductance - - - - - A synonym for farad, the SI unit of capacitance - - - - - A synonym for volt, the SI unit of electric potential difference, electromotive force - - - - - A synonym for coulomb, the SI unit of electric charge, amount of electricity - - - - - A synonym for watt, the SI unit of power, radiant flux - - - - - A synonym for joule, the SI unit of energy, work, amount of heat - - - - - A synonym for pascal, the SI unit of pressure, stress - - - - - A synonym for newton, the SI unit of force - - - - - A synonym for hertz, the SI unit of frequency - - - - - A synonym for candela, the SI unit of luminous intensity - - - - - A synonym for mole, the SI unit of amount of substance - - - - - A synonym for kelvin, the SI unit of thermodynamic temperature - - - - - A synonym for ampere, the SI unit of electric current - - - - - A synonym for second, the SI unit of time - - - - - A synonym for kilogram, the SI unit of mass - - - - - A synonym for Metre, the SI unit of length - - - - - A method used to support the F# query syntax. Returns an empty sequence that has the specified type argument. - - - - - A method used to support the F# query syntax. Returns a sequence that contains the specified values. - - - - - A method used to support the F# query syntax. Returns a sequence of length one that contains the specified value. - - - - A query operator that selects those elements based on a specified predicate. - - - - A query operator that performs a subsequent ordering of the elements selected so far in descending order by the given nullable sorting key. - This operator may only be used immediately after a 'sortBy', 'sortByDescending', 'thenBy' or 'thenByDescending', or their nullable variants. - - - - A query operator that performs a subsequent ordering of the elements selected so far in ascending order by the given nullable sorting key. - This operator may only be used immediately after a 'sortBy', 'sortByDescending', 'thenBy' or 'thenByDescending', or their nullable variants. - - - - A query operator that performs a subsequent ordering of the elements selected so far in descending order by the given sorting key. - This operator may only be used immediately after a 'sortBy', 'sortByDescending', 'thenBy' or 'thenByDescending', or their nullable variants. - - - - A query operator that performs a subsequent ordering of the elements selected so far in ascending order by the given sorting key. - This operator may only be used immediately after a 'sortBy', 'sortByDescending', 'thenBy' or 'thenByDescending', or their nullable variants. - - - - A query operator that selects elements from a sequence as long as a specified condition is true, and then skips the remaining elements. - - - - A query operator that selects a specified number of contiguous elements from those selected so far. - - - - A query operator that selects a nullable value for each element selected so far and returns the sum of these values. - If any nullable does not have a value, it is ignored. - - - - A query operator that selects a value for each element selected so far and returns the sum of these values. - - - - - A method used to support the F# query syntax. Inputs to queries are implicitly wrapped by a call to one of the overloads of this method. - - - - - A method used to support the F# query syntax. Inputs to queries are implicitly wrapped by a call to one of the overloads of this method. - - - - A query operator that sorts the elements selected so far in descending order by the given nullable sorting key. - - - - A query operator that sorts the elements selected so far in ascending order by the given nullable sorting key. - - - - A query operator that sorts the elements selected so far in descending order by the given sorting key. - - - - A query operator that sorts the elements selected so far in ascending order by the given sorting key. - - - - A query operator that bypasses elements in a sequence as long as a specified condition is true and then selects the remaining elements. - - - - A query operator that bypasses a specified number of the elements selected so far and selects the remaining elements. - - - - A query operator that projects each of the elements selected so far. - - - - - - - - - - - - - - A method used to support the F# query syntax. Runs the given quotation as a query using LINQ IQueryable rules. - - - - - A method used to support the F# query syntax. Indicates that the query should be passed as a quotation to the Run method. - - - - A query operator that selects the element at a specified index amongst those selected so far. - - - - A query operator that selects a nullable value for each element selected so far and returns the minimum of these values. - If any nullable does not have a value, it is ignored. - - - - A query operator that selects a value for each element selected so far and returns the minimum resulting value. - - - - A query operator that selects a nullable value for each element selected so far and returns the maximum of these values. - If any nullable does not have a value, it is ignored. - - - - A query operator that selects a value for each element selected so far and returns the maximum resulting value. - - - - A query operator that correlates two sets of selected values based on matching keys and groups the results. - If any group is empty, a group with a single default value is used instead. - Normal usage is 'leftOuterJoin y in elements2 on (key1 = key2) into group'. - - - - A query operator that selects the last element of those selected so far, or a default value if no element is found. - - - - A query operator that selects the last element of those selected so far. - - - - A query operator that correlates two sets of selected values based on matching keys. - Normal usage is 'join y in elements2 on (key1 = key2)'. - - - - A query operator that selects the first element of those selected so far, or a default value if the sequence contains no elements. - - - - A query operator that selects the first element from those selected so far. - - - - A query operator that selects a value for each element selected so far and groups the elements by the given key. - - - - A query operator that correlates two sets of selected values based on matching keys and groups the results. - Normal usage is 'groupJoin y in elements2 on (key1 = key2) into group'. - - - - A query operator that groups the elements selected so far according to a specified key selector. - - - - - A method used to support the F# query syntax. Projects each element of a sequence to another sequence and combines the resulting sequences into one sequence. - - - - A query operator that selects the first element selected so far that satisfies a specified condition. - - - - A query operator that determines whether any element selected so far satisfies a condition. - - - - A query operator that selects the single, specific element of those selected so far, or a default value if that element is not found. - - - - A query operator that selects the single, specific element selected so far - - - - A query operator that selects distinct elements from the elements selected so far. - - - - A query operator that returns the number of selected elements. - - - - A query operator that determines whether the selected elements contains a specified element. - - - - A query operator that selects a nullable value for each element selected so far and returns the average of these values. - If any nullable does not have a value, it is ignored. - - - - A query operator that selects a value for each element selected so far and returns the average of these values. - - - - A query operator that determines whether all elements selected so far satisfies a condition. - - - - Create an instance of this builder. Use 'query { ... }' to use the query syntax. - - - - The type used to support the F# query syntax. Use 'query { ... }' to use the query syntax. - - - - - A property used to support the F# query syntax. - - - - - A method used to support the F# query syntax. - - - - - A partial input or result in an F# query. This type is used to support the F# query syntax. - - - - Converts the argument to character. Numeric inputs are converted according to the UTF-16 - encoding for characters. The operation requires an appropriate static conversion method on the input type. - The input value. - The converted char. - - - Converts the argument to System.Decimal using a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted decimal. - - - Converts the argument to unsigned native integer using a direct conversion for all - primitive numeric types. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted unativeint - - - Converts the argument to signed native integer. This is a direct conversion for all - primitive numeric types. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted nativeint - - - Converts the argument to 64-bit float. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted float - - - Converts the argument to 32-bit float. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted float32 - - - Converts the argument to unsigned 64-bit integer. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint64 - - - Converts the argument to signed 64-bit integer. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int64 - - - Converts the argument to unsigned 32-bit integer. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint32 - - - Converts the argument to signed 32-bit integer. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int32 - - - Converts the argument to a particular enum type. - The input value. - The converted enum type. - - - Converts the argument to signed 32-bit integer. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int - - - Converts the argument to unsigned 16-bit integer. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint16 - - - Converts the argument to signed 16-bit integer. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int16 - - - Converts the argument to signed byte. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted sbyte - - - Converts the argument to byte. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted byte - - - - Functions for converting nullable values - - - - - The division operator where a nullable value appears on both left and right sides - - - - - The division operator where a nullable value appears on the right - - - - - The division operator where a nullable value appears on the left - - - - - The modulus operator where a nullable value appears on both left and right sides - - - - - The modulus operator where a nullable value appears on the right - - - - - The modulus operator where a nullable value appears on the left - - - - - The multiplication operator where a nullable value appears on both left and right sides - - - - - The multiplication operator where a nullable value appears on the right - - - - - The multiplication operator where a nullable value appears on the left - - - - - The subtraction operator where a nullable value appears on both left and right sides - - - - - The subtraction operator where a nullable value appears on the right - - - - - The subtraction operator where a nullable value appears on the left - - - - - The addition operator where a nullable value appears on both left and right sides - - - - - The addition operator where a nullable value appears on the right - - - - - The addition operator where a nullable value appears on the left - - - - - The '<>' operator where a nullable value appears on both left and right sides - - - - - The '=' operator where a nullable value appears on both left and right sides - - - - - The '<' operator where a nullable value appears on both left and right sides - - - - - The '<=' operator where a nullable value appears on both left and right sides - - - - - The '>' operator where a nullable value appears on both left and right sides - - - - - The '>=' operator where a nullable value appears on both left and right sides - - - - - The '<>' operator where a nullable value appears on the right - - - - - The '=' operator where a nullable value appears on the right - - - - - The '<' operator where a nullable value appears on the right - - - - - The '<=' operator where a nullable value appears on the right - - - - - The '>' operator where a nullable value appears on the right - - - - - The '>=' operator where a nullable value appears on the right - - - - - The '<>' operator where a nullable value appears on the left - - - - - The '=' operator where a nullable value appears on the left - - - - - The '<' operator where a nullable value appears on the left - - - - - The '<=' operator where a nullable value appears on the left - - - - - The '>' operator where a nullable value appears on the left - - - - - The '>=' operator where a nullable value appears on the left - - - - - Operators for working with nullable values - - - - - A method used to support the F# query syntax. Runs the given quotation as a query using LINQ IEnumerable rules. - - - - - - - - A method used to support the F# query syntax. Runs the given quotation as a query using LINQ rules. - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - - - - A type used to reconstruct a grouping after applying a mutable->immutable mapping transformation - on a result of a query. - - - - - - - - - - - - - - - - - - - - The generic MethodInfo for Select function - Describes how we got from productions of immutable objects to productions of anonymous objects, with enough information - that we can invert the process in final query results. - - - - - - - - Given the expression part of a "yield" or "select" which produces a result in terms of immutable tuples or immutable records, - generate an equivalent expression yielding anonymous objects. Also return the conversion for the immutable-to-mutable correspondence - so we can reverse this later. - - - - - Simplify gets of tuples and gets of record fields. - - - - - Cleanup the use of property-set object constructions in leaf expressions that form parts of F# queries. - - - - - - - - Given an type involving immutable tuples and records, logically corresponding to the type produced at a - "yield" or "select", convert it to a type involving anonymous objects according to the conversion data. - - - - - - - - - - - - - - - - - - - - Recognize anonymous type construction written using 'new AnonymousObject(<e1>, <e2>, ...)' - - - - - - - - - - - - - - - - - Recognize object construction written using 'new O(Prop1 = <e>, Prop2 = <e>, ...)' - - - - - Tests whether a list consists only of assignments of properties of the - given variable, null values (ignored) and ends by returning the given variable - (pattern returns only property assignments) - - - - - Recognize sequential series written as (... ((<e>; <e>); <e>); ...) - - - - - - - - - - - - - - - - - - - - - - - A runtime helper used to evaluate nested quotation literals. - - - - - Evaluates a subset of F# quotations by first converting to a LINQ expression, for the subset of LINQ expressions represented by the - expression syntax in the C# language. - - - - - Converts a subset of F# quotations to a LINQ expression, for the subset of LINQ expressions represented by the - expression syntax in the C# language. - - - - - Converts a subset of F# quotations to a LINQ expression, for the subset of LINQ expressions represented by the - expression syntax in the C# language. - - - - - When used in a quotation, this function indicates a specific conversion - should be performed when converting the quotation to a LINQ expression. - - This function should not be called directly. - - - - - When used in a quotation, this function indicates a specific conversion - should be performed when converting the quotation to a LINQ expression. - - This function should not be called directly. - - - - - When used in a quotation, this function indicates a specific conversion - should be performed when converting the quotation to a LINQ expression. - - This function should not be called directly. - - - - - - - - Abstract internal type - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Allocates a region of memory on the stack. - The number of objects of type T to allocate. - A typed pointer to the allocated memory. - - - Assigns the value into the memory location referenced by the typed native - pointer computed by adding index * sizeof<'T> to the given input pointer. - The input pointer. - The index by which to offset the pointer. - The value to assign. - - - Assigns the value into the memory location referenced by the given typed native pointer. - The input pointer. - The value to assign. - - - Dereferences the given typed native pointer. - The input pointer. - The value at the pointer address. - - - Dereferences the typed native pointer computed by adding index * sizeof<'T> to the - given input pointer. - The input pointer. - The index by which to offset the pointer. - The value at the pointer address. - - - Returns a typed native pointer by adding index * sizeof<'T> to the - given input pointer. - The input pointer. - The index by which to offset the pointer. - A typed pointer. - - - Returns a machine address for a given typed native pointer. - The input pointer. - The machine address. - - - Returns a typed native pointer for a given machine address. - The pointer address. - A typed pointer. - - - Contains operations on native pointers. Use of these operators may - result in the generation of unverifiable code. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Gets the raw expression associated with this type-carrying expression - - - Type-carrying quoted expressions. Expressions are generated either - by quotations in source text or programatically - - - Returns type of an expression. - - - Returns the custom attributes of an expression. - - - Builds an expression that represents a while loop - The predicate to control the loop iteration. - The body of the while loop. - The resulting expression. - - - Builds an expression that represents setting a mutable variable - The input variable. - The value to set. - The resulting expression. - - - Builds an expression that represents a variable - The input variable. - The resulting expression. - - - Builds an expression that represents a constant value - The typed value. - The resulting expression. - - - Builds an expression that represents a constant value of a particular type - The untyped object. - The type of the object. - The resulting expression. - - - Builds an expression that represents a test of a value is of a particular union case - The expression to test. - The description of the union case. - The resulting expression. - - - Builds an expression that represents a type test. - The expression to test. - The target type. - The resulting expression. - - - Builds an expression that represents getting a field of a tuple - The input tuple. - The index of the tuple element to get. - The resulting expression. - - - Builds an expression that represents a try/with construct for exception filtering and catching. - The body of the try expression. - - - The variable to bind to a caught exception. - The expression evaluated when an exception is caught. - The resulting expression. - - - Try and find a stored reflection definition for the given method. Stored reflection - definitions are added to an F# assembly through the use of the [<ReflectedDefinition>] attribute. - The description of the method to find. - The reflection definition or None if a match could not be found. - - - Builds an expression that represents a try/finally construct - The body of the try expression. - The final part of the expression to be evaluated. - The resulting expression. - - - Format the expression as a string - Indicates if method, property, constructor and type objects should be printed in detail. If false, these are abbreviated to their name. - The formatted string. - - - Substitutes through the given expression using the given functions - to map variables to new values. The functions must give consistent results - at each application. Variable renaming may occur on the target expression - if variable capture occurs. - The function to map variables into expressions. - The expression with the given substitutions. - - - Builds an expression that represents the sequential execution of one expression followed by another - The first expression. - The second expression. - The resulting expression. - - - Permits interactive environments such as F# Interactive - to explicitly register new pickled resources that represent persisted - top level definitions. The string indicates a unique name for the resources - being added. The format for the bytes is the encoding generated by the F# compiler. - The assembly associated with the resource. - The unique name for the resources being added. - The serialized resource to register with the environment. - - - Builds an expression that represents a nested quotation literal - The expression being quoted. - The resulting expression. - - - Builds an expression that represents writing to a static property - The description of the property. - The value to set. - List of indices for the property if it is an indexed property. - The resulting expression. - - - Builds an expression that represents writing to a property of an object - The input object. - The description of the property. - The value to set. - List of indices for the property if it is an indexed property. - The resulting expression. - - - Builds an expression that represents reading a static property - The description of the property. - List of indices for the property if it is an indexed property. - The resulting expression. - - - Builds an expression that represents reading a property of an object - The input object. - The description of the property. - List of indices for the property if it is an indexed property. - The resulting expression. - - - Builds an expression that represents the creation of a union case value - The description of the union case. - The list of arguments for the case. - The resulting expression. - - - Builds an expression that represents the creation of an F# tuple value - The list of elements of the tuple. - The resulting expression. - - - Builds record-construction expressions - The type of record. - The list of elements of the record. - The resulting expression. - - - Builds an expression that represents the invocation of an object constructor - The description of the constructor. - The list of arguments to the constructor. - The resulting expression. - - - Builds an expression that represents the creation of a delegate value for the given type - The type of delegate. - The parameters for the delegate. - The body of the function. - The resulting expression. - - - Builds an expression that represents the creation of an array value initialized with the given elements - The type for the elements of the array. - The list of elements of the array. - The resulting expression. - - - Builds recursives expressions associated with 'let rec' constructs - The list of bindings for the let expression. - The sub-expression where the bindings are in scope. - The resulting expression. - - - Builds expressions associated with 'let' constructs - The variable in the let expression. - The expression bound to the variable. - The sub-expression where the binding is in scope. - The resulting expression. - - - Builds an expression that represents the constrution of an F# function value - The parameter to the function. - The body of the function. - The resulting expression. - - - Builds 'if ... then ... else' expressions. - The condition expression. - The then sub-expression. - The else sub-expression. - The resulting expression. - - - Fetches or creates a new variable with the given name and type from a global pool of shared variables - indexed by name and type. The type is given by the expicit or inferred type parameter - The variable name. - The created of fetched typed global variable. - - - Gets the free expression variables of an expression as a list. - A sequence of the free variables in the expression. - - - Builds a 'for i = ... to ... do ...' expression that represent loops over integer ranges - The sub-expression declaring the loop variable. - The sub-expression setting the initial value of the loop variable. - The sub-expression declaring the final value of the loop variable. - The sub-expression representing the body of the loop. - The resulting expression. - - - Builds an expression that represents writing to a field of an object - The input object. - The description of the field to write to. - The value to set to the field. - The resulting expression. - - - Builds an expression that represents writing to a static field - The description of the field to write to. - The value to the set to the field. - The resulting expression. - - - Builds an expression that represents the access of a field of an object - The input object. - The description of the field to access. - The resulting expression. - - - Builds an expression that represents the access of a static field - The description of the field to access. - The resulting expression. - - - - - - This function is called automatically when quotation syntax (<@ @>) and related typed-expression - quotations are used. The bytes are a pickled binary representation of an unlinked form of the quoted expression, - and the System.Type argument is any type in the assembly where the quoted - expression occurs, i.e. it helps scope the interpretation of the cross-assembly - references in the bytes. - A type in the assembly where the quotation occurs. - The list of spliced types. - The list of spliced expressions. - The serialized form of the quoted expression. - The resulting expression. - - - Builds an expression that represents the invocation of a default object constructor - The type on which the constructor is invoked. - The resulting expression. - - - Builds an expression that represents the coercion of an expression to a type - The expression to coerce. - The target type. - The resulting expression. - - - Returns a new typed expression given an underlying runtime-typed expression. - A type annotation is usually required to use this function, and - using an incorrect type annotation may result in a later runtime exception. - The expression to cast. - The resulting typed expression. - - - Builds an expression that represents a call to an instance method associated with an object - The input object. - The description of the method to call. - The list of arguments to the method. - The resulting expression. - - - Builds an expression that represents a call to an static method or module-bound function - The MethodInfo describing the method to call. - The list of arguments to the method. - The resulting expression. - - - Builds an expression that represents the application of a first class function value to multiple arguments - The function to apply. - The list of lists of arguments to the function. - The resulting expression. - - - Builds an expression that represents the application of a first class function value to a single argument. - The function to apply. - The argument to the function. - The resulting expression. - - - Builds an expression that represents setting the value held at a particular address. - The target expression. - The value to set at the address. - The resulting expression. - - - Builds an expression that represents getting the address of a value. - The target expression. - The resulting expression. - - - Quoted expressions annotated with System.Type values. - - - The type associated with the variable - - - The declared name of the variable - - - Indicates if the variable represents a mutable storage location - - - Fetches or create a new variable with the given name and type from a global pool of shared variables - indexed by name and type - The name of the variable. - The type associated with the variable. - The retrieved or created variable. - - - Creates a new variable with the given name, type and mutability - The declared name of the variable. - The type associated with the variable. - Indicates if the variable represents a mutable storage location. Default is false. - The created variable. - - - Information at the binding site of a variable - - - Re-build combination expressions. The first parameter should be an object - returned by the ShapeCombination case of the active pattern in this module. - The input shape. - The list of arguments. - The rebuilt expression. - - - An active pattern that performs a complete decomposition viewing the expression tree as a binding structure - The input expression. - The decomposed Var, Lambda, or ConstApp. - - - Active patterns for traversing, visiting, rebuilding and tranforming expressions in a generic way - - - An active pattern to recognize property setters that have an associated ReflectedDefinition - The description of the property. - The expression of the method definition if found, or None. - - - An active pattern to recognize property getters or values in modules that have an associated ReflectedDefinition - The description of the property. - The expression of the method definition if found, or None. - - - An active pattern to recognize methods that have an associated ReflectedDefinition - The description of the method. - The expression of the method definition if found, or None. - - - A parameterized active pattern to recognize calls to a specified function or method. - The returned elements are the optional target object (present if the target is an - instance method), the generic type instantation (non-empty if the target is a generic - instantiation), and the arguments to the function or method. - The input template expression to specify the method to call. - The optional target object (present if the target is an - instance method), the generic type instantation (non-empty if the target is a generic - instantiation), and the arguments to the function or method. - - - An active pattern to recognize constant unsigned int64 expressions - The input expression to match against. - uint64 option - - - An active pattern to recognize constant int64 expressions - The input expression to match against. - int64 option - - - An active pattern to recognize constant unsigned int32 expressions - The input expression to match against. - uint32 option - - - An active pattern to recognize constant int32 expressions - The input expression to match against. - int32 option - - - An active pattern to recognize constant unsigned int16 expressions - The input expression to match against. - uint16 option - - - An active pattern to recognize constant int16 expressions - The input expression to match against. - int16 option - - - An active pattern to recognize constant byte expressions - The input expression to match against. - byte option - - - An active pattern to recognize constant signed byte expressions - The input expression to match against. - sbyte option - - - An active pattern to recognize constant unicode character expressions - The input expression to match against. - char option - - - An active pattern to recognize constant 64-bit floating point number expressions - The input expression to match against. - float option - - - An active pattern to recognize constant 32-bit floating point number expressions - The input expression to match against. - float32 option - - - An active pattern to recognize constant string expressions - The input expression to match against. - string option - - - An active pattern to recognize constant boolean expressions - The input expression to match against. - bool option - - - An active pattern to recognize () constant expressions - The input expression to match against. - unit option - - - An active pattern to recognize expressions of the form a || b - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions of the form a && b - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions that represent the application of a (possibly curried or tupled) first class function value - The input expression to match against. - (Expr * Expr list list) option - - - An active pattern to recognize expressions that represent a (possibly curried or tupled) first class function value - The input expression to match against. - (Var list list * Expr) option - - - Contains a set of derived F# active patterns to analyze F# expression objects - - - An active pattern to recognize expressions that represent setting a mutable variable - The input expression to match against. - (Var * Expr) option - - - An active pattern to recognize expressions that represent a variable - The input expression to match against. - Var option - - - An active pattern to recognize expressions that represent a constant value - The input expression to match against. - (obj * Type) option - - - An active pattern to recognize expressions that represent a test if a value is of a particular union case - The input expression to match against. - (Expr * UnionCaseInfo) option - - - An active pattern to recognize expressions that represent a dynamic type test - The input expression to match against. - (Expr * Type) option - - - An active pattern to recognize expressions that represent getting a tuple field - The input expression to match against. - (Expr * int) option - - - An active pattern to recognize expressions that represent a try/finally construct - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions that represent a try/with construct for exception filtering and catching - The input expression to match against. - (Expr * Var * Expr * Var * Expr) option - - - An active pattern to recognize expressions that represent sequential exeuction of one expression followed by another - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions that represent a nested quotation literal - The input expression to match against. - Expr option - - - An active pattern to recognize expressions that represent setting a static or instance property, or a non-function value declared in a module - The input expression to match against. - (Expr option * PropertyInfo * Expr list * Expr) option - - - An active pattern to recognize expressions that represent the read of a static or instance property, or a non-function value declared in a module - The input expression to match against. - (Expr option * PropertyInfo * Expr list) option - - - An active pattern to recognize expressions that represent construction of tuple values - The input expression to match against. - (Expr list) option - - - An active pattern to recognize expressions that represent construction of particular union case values - The input expression to match against. - (UnionCaseInfo * Expr list) option - - - An active pattern to recognize expressions that represent construction of record values - The input expression to match against. - (Type * Expr list) option - - - An active pattern to recognize expressions that represent invocation of object constructors - The input expression to match against. - (ConstructorInfo * Expr list) option - - - An active pattern to recognize expressions that represent construction of delegate values - The input expression to match against. - (Type * Var list * Expr) option - - - An active pattern to recognize expressions that represent invocations of a default constructor of a struct - The input expression to match against. - Type option - - - An active pattern to recognize expressions that represent the construction of arrays - The input expression to match against. - (Type * Expr list) option - - - An active pattern to recognize expressions that represent recursive let bindings of one or more variables - The input expression to match against. - ((Var * Expr) list * Expr) option - - - An active pattern to recognize expressions that represent let bindings - The input expression to match against. - (Var * Expr * Expr) option - - - An active pattern to recognize expressions that represent first class function values - The input expression to match against. - (Var * Expr) option - - - An active pattern to recognize expressions that represent conditionals - The input expression to match against. - (Expr * Expr * Expr) option - - - An active pattern to recognize expressions that represent while loops - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions that represent loops over integer ranges - The input expression to match against. - (Var * Expr * Expr * Expr) option - - - An active pattern to recognize expressions that represent setting a static or instance field - The input expression to match against. - (Expr option * FieldInfo * Expr) option - - - An active pattern to recognize expressions that represent getting a static or instance field - The input expression to match against. - (Expr option * FieldInfo) option - - - An active pattern to recognize expressions that represent coercions from one type to another - The input expression to match against. - (Expr * Type) option - - - An active pattern to recognize expressions that represent calls to static and instance methods, and functions defined in modules - The input expression to match against. - (Expr option * MethodInfo * Expr list) option - - - An active pattern to recognize expressions that represent applications of first class function values - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions that represent setting the value held at an address - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions that represent getting the address of a value - The input expression to match against. - Expr option - - - Contains a set of primitive F# active patterns to analyze F# expression objects - - - Returns a System.Type representing an F# tuple type with the given element types - An array of types for the tuple elements. - The type representing the tuple containing the input elements. - - - Returns a System.Type representing the F# function type with the given domain and range - The input type of the function. - The output type of the function. - The function type with the given domain and range. - - - Return true if the typ is a representation of an F# tuple type - The type to check. - True if the type check succeeds. - - - Return true if the typ is a System.Type value corresponding to the compiled form of an F# module - The type to check. - True if the type check succeeds. - - - Return true if the typ is a representation of an F# function type or the runtime type of a closure implementing an F# function type - The type to check. - True if the type check succeeds. - - - Gets the tuple elements from the representation of an F# tuple type. - The input tuple type. - An array of the types contained in the given tuple type. - - - Gets the domain and range types from an F# function type or from the runtime type of a closure implementing an F# type - The input function type. - A tuple of the domain and range types of the input function. - - - Contains operations associated with constructing and analyzing F# types such as records, unions and tuples - - - Precomputes a function for reading the values of a particular tuple type - - Assumes the given type is a TupleType. - If not, ArgumentException is raised during pre-computation. - The tuple type to read. - Thrown when the given type is not a tuple type. - A function to read values of the given tuple type. - - - Gets information that indicates how to read a field of a tuple - The input tuple type. - The index of the tuple element to describe. - The description of the tuple element and an optional type and index if the tuple is big. - - - Gets a method that constructs objects of the given tuple type. - For small tuples, no additional type will be returned. - - For large tuples, an additional type is returned indicating that - a nested encoding has been used for the tuple type. In this case - the suffix portion of the tuple type has the given type and an - object of this type must be created and passed as the last argument - to the ConstructorInfo. A recursive call to PreComputeTupleConstructorInfo - can be used to determine the constructor for that the suffix type. - The input tuple type. - The description of the tuple type constructor and an optional extra type - for large tuples. - - - Precomputes a function for reading the values of a particular tuple type - - Assumes the given type is a TupleType. - If not, ArgumentException is raised during pre-computation. - The type of tuple to read. - Thrown when the given type is not a tuple type. - A function to read a particular tuple type. - - - Precompute a function for reading a particular field from a record. - Assumes the given type is a RecordType with a field of the given name. - If not, ArgumentException is raised during pre-computation. - - Using the computed function will typically be faster than executing a corresponding call to Value.GetInfo - because the path executed by the computed function is optimized given the knowledge that it will be - used to read values of the given type. - The PropertyInfo of the field to read. - Thrown when the input type is not a record type. - A function to read the specified field from the record. - - - Creates an instance of a tuple type - - Assumes at least one element is given. If not, ArgumentException is raised. - The array of tuple fields. - The tuple type to create. - Thrown if no elements are given. - An instance of the tuple type with the given elements. - - - Builds a typed function from object from a dynamic function implementation - The function type of the implementation. - The untyped lambda of the function implementation. - A typed function from the given dynamic implementation. - - - Reads all fields from a tuple. - - Assumes the given input is a tuple value. If not, ArgumentException is raised. - The input tuple. - Thrown when the input is not a tuple value. - An array of the fields from the given tuple. - - - Reads a field from a tuple value. - - Assumes the given input is a tuple value. If not, ArgumentException is raised. - The input tuple. - The index of the field to read. - The value of the field. - - - Reads a field from a record value. - - Assumes the given input is a record value. If not, ArgumentException is raised. - The record object. - The PropertyInfo describing the field to read. - Thrown when the input type is not a record type. - The field from the record. - - - Contains operations associated with constructing and analyzing values associated with F# types - such as records, unions and tuples. - - - The integer tag for the case. - - - The name of the case. - - - The type in which the case occurs. - - - The fields associated with the case, represented by a PropertyInfo. - The fields associated with the case. - - - Returns the custom attributes associated with the case matching the given attribute type. - The type of attributes to return. - An array of custom attributes. - - - Returns the custom attributes associated with the case. - An array of custom attributes. - - - Represents a case of a discriminated union type - - - Returns true if the typ is a representation of an F# exception declaration - The type to check. - Optional flag that denotes accessibility of the private representation. - True if the type check is an F# exception. - - - Reads all the fields from an F# exception declaration, in declaration order - - Assumes exceptionType is an exception representation type. If not, ArgumentException is raised. - The exception type to read. - Optional flag that denotes accessibility of the private representation. - Thrown if the given type is not an exception. - An array containing the PropertyInfo of each field in the exception. - - - Returns true if the typ is a representation of an F# union type or the runtime type of a value of that type - The type to check. - Optional flag that denotes accessibility of the private representation. - True if the type check succeeds. - - - Return true if the typ is a representation of an F# record type - The type to check. - Optional flag that denotes accessibility of the private representation. - True if the type check succeeds. - - - Gets the cases of a union type. - - Assumes the given type is a union type. If not, ArgumentException is raised during pre-computation. - The input union type. - Optional flag that denotes accessibility of the private representation. - Thrown when the input type is not a union type. - An array of descriptions of the cases of the given union type. - - - Reads all the fields from a record value, in declaration order - - Assumes the given input is a record value. If not, ArgumentException is raised. - The input record type. - Optional flag that denotes accessibility of the private representation. - An array of descriptions of the properties of the record type. - - - Reads all the fields from a value built using an instance of an F# exception declaration - - Assumes the given input is an F# exception value. If not, ArgumentException is raised. - The exception instance. - Optional flag that denotes accessibility of the private representation. - Thrown when the input type is not an F# exception. - The fields from the given exception. - - - A method that constructs objects of the given case - The description of the union case. - Optional flag that denotes accessibility of the private representation. - The description of the constructor of the given union case. - - - Precomputes a function for constructing a discriminated union value for a particular union case. - The description of the union case. - Optional flag that denotes accessibility of the private representation. - A function for constructing values of the given union case. - - - Precomputes a function for reading all the fields for a particular discriminator case of a union type - - Using the computed function will typically be faster than executing a corresponding call to GetFields - The description of the union case to read. - Optional flag that denotes accessibility of the private representation. - A function to for reading the fields of the given union case. - - - Precompute a property or static method for reading an integer representing the case tag of a union type. - The type of union to read. - Optional flag that denotes accessibility of the private representation. - The description of the union case reader. - - - Assumes the given type is a union type. - If not, ArgumentException is raised during pre-computation. - - Using the computed function is more efficient than calling GetUnionCase - because the path executed by the computed function is optimized given the knowledge that it will be - used to read values of the given type. - The type of union to optimize reading. - Optional flag that denotes accessibility of the private representation. - An optimized function to read the tags of the given union type. - - - Identify the union case and its fields for an object - - Assumes the given input is a union case value. If not, ArgumentException is raised. - - If the type is not given, then the runtime type of the input object is used to identify the - relevant union type. The type should always be given if the input object may be null. For example, - option values may be represented using the 'null'. - The input union case. - The union type containing the value. - Optional flag that denotes accessibility of the private representation. - Thrown when the input type is not a union case value. - The description of the union case and its fields. - - - Create a union case value. - The description of the union case to create. - The array of arguments to construct the given case. - Optional flag that denotes accessibility of the private representation. - The constructed union case. - - - Get a ConstructorInfo for a record type - The record type. - Optional flag that denotes accessibility of the private representation. - A ConstructorInfo for the given record type. - - - Precompute a function for constructing a record value. - - Assumes the given type is a RecordType. - If not, ArgumentException is raised during pre-computation. - The type of record to construct. - Optional flag that denotes accessibility of the private representation. - Thrown when the input type is not a record type. - A function to construct records of the given type. - - - Precompute a function for reading all the fields from a record. The fields are returned in the - same order as the fields reported by a call to Microsoft.FSharp.Reflection.Type.GetInfo for - this type. - - Assumes the given type is a RecordType. - If not, ArgumentException is raised during pre-computation. - - Using the computed function will typically be faster than executing a corresponding call to Value.GetInfo - because the path executed by the computed function is optimized given the knowledge that it will be - used to read values of the given type. - The type of record to read. - Optional flag that denotes accessibility of the private representation. - Thrown when the input type is not a record type. - An optimized reader for the given record type. - - - Reads all the fields from a record value. - - Assumes the given input is a record value. If not, ArgumentException is raised. - The record object. - Optional flag that denotes accessibility of the private representation. - Thrown when the input type is not a record type. - The array of fields from the record. - - - Creates an instance of a record type. - - Assumes the given input is a record type. - The type of record to make. - The array of values to initialize the record. - Optional flags that denotes accessibility of the private representation. - Thrown when the input type is not a record type. - The created record. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - A record of options to control structural formatting. - For F# Interactive properties matching those of this value can be accessed via the 'fsi' - value. - - Floating Point format given in the same format accepted by System.Double.ToString, - e.g. f6 or g15. - - If ShowProperties is set the printing process will evaluate properties of the values being - displayed. This may cause additional computation. - - The ShowIEnumerable is set the printing process will force the evalution of IEnumerable objects - to a small, finite depth, as determined by the printing parameters. - This may lead to additional computation being performed during printing. - - <example> - From F# Interactive the default settings can be adjusted using, for example, - <pre> - open Microsoft.FSharp.Compiler.Interactive.Settings;; - setPrintWidth 120;; - </pre> - </example> - - - - - Data representing structured layouts of terms. - - - - - Convert any value to a layout using the given formatting options. The - layout can then be processed using formatting display engines such as - those in the LayoutOps module. any_to_string and output_any are - built using any_to_layout with default format options. - - - - - - - - Ouput any value to a channel using the same set of formatting rules - as any_to_string - - - - - Convert any value to a string using a standard formatter - Data is typically formatted in a structured format, e.g. - lists are formatted using the "[1;2]" notation. - The details of the format are not specified and may change - from version to version and according to the flags given - to the F# compiler. The format is intended to be human-readable, - not machine readable. If alternative generic formats are required - you should develop your own formatter, using the code in the - implementation of this file as a starting point. - - Data from other .NET languages is formatted using a virtual - call to Object.ToString() on the boxed version of the input. - - - - - - - - For limitting layout of list-like sequences (lists,arrays,etc). - unfold a list of items using (project and z) making layout list via itemL. - If reach maxLength (before exhausting) then truncate. - - - - - See tagL - - - - - Layout like an F# list. - - - - - Layout like an F# option. - - - - - Layout list vertically. - - - - - Layout two vertically. - - - - - Form tuple of layouts. - - - - - Wrap braces around layout. - - - - - Wrap square brackets around layout. - - - - - Wrap round brackets around Layout. - - - - - Join layouts into a list separated using the given Layout. - - - - - Join layouts into a semi-colon separated list. - - - - - Join layouts into a space separated list. - - - - - Join layouts into a comma separated list. - - - - - Join broken with ident=2 - - - - - Join broken with ident=1 - - - - - Join broken with ident=0 - - - - - Join, possible break with indent=2 - - - - - Join, possible break with indent=1 - - - - - Join, possible break with indent=0 - - - - - Join, unbreakable. - - - - - An string which is left parenthesis (no space on the right). - - - - - An string which is right parenthesis (no space on the left). - - - - - An string which requires no spaces either side. - - - - - An string leaf - - - - - An uninterpreted leaf, to be interpreted into a string - by the layout engine. This allows leaf layouts for numbers, strings and - other atoms to be customized according to culture. - - - - - Is it the empty layout? - - - - - The empty layout - - - - - A layout is a sequence of strings which have been joined together. - The strings are classified as words, separators and left and right parenthesis. - This classification determines where spaces are inserted. - A joint is either unbreakable, breakable or broken. - If a joint is broken the RHS layout occurs on the next line with optional indentation. - A layout can be squashed to for given width which forces breaks as required. - - - - - Return the given big integer - - - - - Return the negation of a big integer - - - - - Return the difference of two big integers - - - - - Return the product of big integers - - - - - Return the modulus of big integers - - - - - This operator is for consistency when this type be used from other CLI languages - - - - - This operator is for consistency when this type be used from other CLI languages - - - - - This operator is for consistency when this type be used from other CLI languages - - - - - This operator is for consistency when this type be used from other CLI languages - - - - - This operator is for consistency when this type be used from other CLI languages - - - - - Convert a big integer to a 32-bit signed integer - - - - - Convert a big integer to a 64-bit signed integer - - - - - Convert a big integer to a floating point number - - - - - This operator is for consistency when this type be used from other CLI languages - - - - - Return the ratio of two big integers - - - - - Return the sum of two big integers - - - - - Get the big integer for zero - - - - - Return the sign of a big integer: 0, +1 or -1 - - - - - Get the big integer for one - - - - - Return true if a big integer is 'zero' - - - - - Return true if a big integer is 'one' - - - - - - - - Return n^m for two big integers - - - - - Parse a big integer from a string format - - - - - Return the greatest common divisor of two big integers - - - - - - - - - - - Compute the ratio and remainder of two big integers - - - - - Compute the absolute value of a big integer - - - - - Construct a BigInteger value for the given 64-bit integer - - - - - Construct a BigInteger value for the given integer - - - - - The type of arbitrary-sized integers - - - - diff --git a/packages/FSharp.Core/lib/portable-net45+netcore45+wpa81+wp8/FSharp.Core.dll b/packages/FSharp.Core/lib/portable-net45+netcore45+wpa81+wp8/FSharp.Core.dll deleted file mode 100644 index 3a75b159..00000000 Binary files a/packages/FSharp.Core/lib/portable-net45+netcore45+wpa81+wp8/FSharp.Core.dll and /dev/null differ diff --git a/packages/FSharp.Core/lib/portable-net45+netcore45+wpa81+wp8/FSharp.Core.optdata b/packages/FSharp.Core/lib/portable-net45+netcore45+wpa81+wp8/FSharp.Core.optdata deleted file mode 100644 index e89acec2..00000000 Binary files a/packages/FSharp.Core/lib/portable-net45+netcore45+wpa81+wp8/FSharp.Core.optdata and /dev/null differ diff --git a/packages/FSharp.Core/lib/portable-net45+netcore45+wpa81+wp8/FSharp.Core.sigdata b/packages/FSharp.Core/lib/portable-net45+netcore45+wpa81+wp8/FSharp.Core.sigdata deleted file mode 100644 index 47041921..00000000 Binary files a/packages/FSharp.Core/lib/portable-net45+netcore45+wpa81+wp8/FSharp.Core.sigdata and /dev/null differ diff --git a/packages/FSharp.Core/lib/portable-net45+netcore45+wpa81+wp8/FSharp.Core.xml b/packages/FSharp.Core/lib/portable-net45+netcore45+wpa81+wp8/FSharp.Core.xml deleted file mode 100644 index bb2757dd..00000000 --- a/packages/FSharp.Core/lib/portable-net45+netcore45+wpa81+wp8/FSharp.Core.xml +++ /dev/null @@ -1,10842 +0,0 @@ - - -FSharp.Core - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Gets the tail of the list, which is a list containing all the elements of the list, excluding the first element - - - Gets the number of items contained in the list - - - Gets the element of the list at the given position. - Lists are represented as linked lists so this is an O(n) operation. - The index. - The value at the given index. - - - Gets a value indicating if the list contains no entries - - - Gets the first element of the list - - - Returns an empty list of a particular type - - - Returns a list with head as its first element and tail as its subsequent elements - A new head value for the list. - The existing list. - The list with head appended to the front of tail. - - - The type of immutable singly-linked lists. - - Use the constructors [] and :: (infix) to create values of this type, or - the notation [1;2;3]. Use the values in the List module to manipulate - values of this type, or pattern match against the values directly. - - - Lookup an element in the map. Raise KeyNotFoundException if no binding - exists in the map. - The input key. - Thrown when the key is not found. - The value mapped to the key. - - - Returns true if there are no bindings in the map. - - - The number of bindings in the map. - - - Lookup an element in the map, returning a Some value if the element is in the domain - of the map and None if not. - The input key. - The mapped value, or None if the key is not in the map. - - - Removes an element from the domain of the map. No exception is raised if the element is not present. - The input key. - The resulting map. - - - - - - Tests if an element is in the domain of the map. - The input key. - True if the map contains the given key. - - - Returns a new map with the binding added to the given map. - The input key. - The resulting map. - - - Builds a map that contains the bindings of the given IEnumerable. - The input sequence of key/value pairs. - The resulting map. - - - Immutable maps. Keys are ordered by F# generic comparison. - - Maps based on generic comparison are efficient for small keys. They are not a suitable choice if keys are recursive data structures - or if keys require bespoke comparison semantics. - - All members of this class are thread-safe and may be used concurrently from multiple threads. - - - An abbreviation for the CLI type System.Collections.Generic.List<_> - - - Returns a new set with the elements of the second set removed from the first. - The first input set. - The second input set. - A set containing elements of the first set that are not contained in the second set. - - - Compute the union of the two sets. - The first input set. - The second input set. - The union of the two input sets. - - - Returns the lowest element in the set according to the ordering being used for the set. - - - Returns the highest element in the set according to the ordering being used for the set. - - - A useful shortcut for Set.isEmpty. See the Set module for further operations on sets. - - - The number of elements in the set - - - A useful shortcut for Set.remove. Note this operation produces a new set - and does not mutate the original set. The new set will share many storage - nodes with the original. See the Set module for further operations on sets. - The value to remove from the set. - The result set. - - - Evaluates to "true" if all elements of the second set are in the first. - The set to test against. - True if this set is a superset of otherSet. - - - Evaluates to "true" if all elements of the first set are in the second. - The set to test against. - True if this set is a subset of otherSet. - - - Evaluates to "true" if all elements of the second set are in the first, and at least - one element of the first is not in the second. - The set to test against. - True if this set is a proper superset of otherSet. - - - Evaluates to "true" if all elements of the first set are in the second, and at least - one element of the second is not in the first. - The set to test against. - True if this set is a proper subset of otherSet. - - - - - - A useful shortcut for Set.contains. See the Set module for further operations on sets. - The value to check. - True if the set contains value. - - - A useful shortcut for Set.add. Note this operation produces a new set - and does not mutate the original set. The new set will share many storage - nodes with the original. See the Set module for further operations on sets. - The value to add to the set. - The result set. - - - Create a set containing elements drawn from the given sequence. - The input sequence. - The result set. - - - Immutable sets based on binary trees, where comparison is the - F# structural comparison function, potentially using implementations - of the IComparable interface on key values. - - See the Set module for further operations on sets. - - All members of this class are thread-safe and may be used concurrently from multiple threads. - - - An abbreviation for the type of immutable singly-linked lists. - - Use the constructors [] and :: (infix) to create values of this type, or - the notation [1;2;3]. Use the values in the List module to manipulate - values of this type, or pattern match against the values directly. - - - An abbreviation for the CLI type System.Collections.Generic.IEnumerable<_> - - - Fetches an element from a 2D array. You can also use the syntax array.[index1,index2]. - - The input array. - The index along the first dimension. - The index along the second dimension. - - The value of the array at the given index. - Thrown when the indices are negative or exceed the bounds of the array. - - - Sets the value of an element in an array. You can also use the syntax array.[index1,index2] <- value. - - The input array. - The index along the first dimension. - The index along the second dimension. - The value to set in the array. - Thrown when the indices are negative or exceed the bounds of the array. - - - Builds 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. - - The input array. - - The zero-based output array. - - - Builds 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 propagated to the output - array. - - A function that is applied to transform each element of the array. The two integers - provide the index of the element. - The input array. - - An array whose elements have been transformed by the given mapping. - - - Builds 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. - - A function that is applied to transform each item of the input array. - The input array. - - An array whose elements have been transformed by the given mapping. - - - Returns the length of an array in the second dimension. - - The input array. - - The length of the array in the second dimension. - - - Returns the length of an array in the first dimension. - - The input array. - - The length of the array in the first dimension. - - - Applies the given function to each element of the array. The integer indices passed to the - function indicates the index of element. - - A function to apply to each element of the array with the indices available as an argument. - The input array. - - - Applies the given function to each element of the array. - - A function to apply to each element of the array. - The input array. - - - Creates a based array where the entries are initially Unchecked.defaultof<'T>. - - The base for the first dimension of the array. - The base for the second dimension of the array. - The length of the first dimension of the array. - The length of the second dimension of the array. - - The created array. - Thrown when base1, base2, length1, or length2 is negative. - - - Creates a based array whose elements are all initially the given value. - - The base for the first dimension of the array. - The base for the second dimension of the array. - The length of the first dimension of the array. - The length of the second dimension of the array. - The value to populate the new array. - - The created array. - Thrown when base1, base2, length1, or length2 is negative. - - - Creates a based array given the dimensions and a generator function to compute the elements. - - The base for the first dimension of the array. - The base for the second dimension of the array. - The length of the first dimension of the array. - The length of the second dimension of the array. - A function to produce elements of the array given the two indices. - - The created array. - Thrown when base1, base2, length1, or length2 is negative. - - - Creates an array where the entries are initially Unchecked.defaultof<'T>. - - The length of the first dimension of the array. - The length of the second dimension of the array. - - The created array. - Thrown when length1 or length2 is negative. - - - Creates an array whose elements are all initially the given value. - - The length of the first dimension of the array. - The length of the second dimension of the array. - The value to populate the new array. - - The created array. - Thrown when length1 or length2 is negative. - - - Creates an array given the dimensions and a generator function to compute the elements. - - The length of the first dimension of the array. - The length of the second dimension of the array. - A function to produce elements of the array given the two indices. - - The generated array. - Thrown when either of the lengths is negative. - - - Reads a range of elements from the first array and write them into the second. - - The source array. - The first-dimension index to begin copying from in the source array. - The second-dimension index to begin copying from in the source array. - The target array. - The first-dimension index to begin copying into in the target array. - The second-dimension index to begin copying into in the target array. - The number of elements to copy across the first dimension of the arrays. - The number of elements to copy across the second dimension of the arrays. - Thrown when any of the indices are negative or if either of - the counts are larger than the dimensions of the array allow. - - - Builds 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. - - The input array. - - A copy of the input array. - - - Fetches the base-index for the second dimension of the array. - - The input array. - - The base-index of the second dimension of the array. - - - Fetches the base-index for the first dimension of the array. - - The input array. - - The base-index of the first dimension of the array. - - - Basic operations on 2-dimensional arrays. - - F# and CLI multi-dimensional arrays are typically zero-based. - However, CLI 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 propagated to a matching output - array on the Array2D.map and Array2D.mapi operations. - Non-zero-based arrays can also be created using Array2D.zeroCreateBased, - Array2D.createBased and Array2D.initBased. - - - Creates an array where the entries are initially the "default" value. - The length of the first dimension. - The length of the second dimension. - The length of the third dimension. - The created array. - - - Sets the value of an element in an array. You can also - use the syntax 'array.[index1,index2,index3] <- value'. - The input array. - The index along the first dimension. - The index along the second dimension. - The index along the third dimension. - The value to set at the given index. - - - Builds 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. - The function to transform the elements at each index in the array. - The input array. - The array created from the transformed elements. - - - Builds 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. - The function to transform each element of the array. - The input array. - The array created from the transformed elements. - - - Returns the length of an array in the third dimension. - The input array. - The length of the array in the third dimension. - - - Returns the length of an array in the second dimension. - The input array. - The length of the array in the second dimension. - - - Returns the length of an array in the first dimension - The input array. - The length of the array in the first dimension. - - - Applies the given function to each element of the array. The integer indicies passed to the - function indicates the index of element. - The function to apply to each element of the array. - The input array. - - - Applies the given function to each element of the array. - The function to apply to each element of the array. - The input array. - - - Fetches an element from a 3D array. You can also use the syntax 'array.[index1,index2,index3]' - The input array. - The index along the first dimension. - The index along the second dimension. - The index along the third dimension. - The value at the given index. - - - Creates an array given the dimensions and a generator function to compute the elements. - The length of the first dimension. - The length of the second dimension. - The length of the third dimension. - The function to create an initial value at each index into the array. - The created array. - - - Creates an array whose elements are all initially the given value. - The length of the first dimension. - The length of the second dimension. - The length of the third dimension. - The value of the array elements. - The created array. - - - Basic operations on rank 3 arrays. - - - Sets the value of an element in an array. You can also - use the syntax 'array.[index1,index2,index3,index4] <- value'. - The input array. - The index along the first dimension. - The index along the second dimension. - The index along the third dimension. - The index along the fourth dimension. - The value to set. - - - Fetches an element from a 4D array. You can also use the syntax 'array.[index1,index2,index3,index4]' - The input array. - The index along the first dimension. - The index along the second dimension. - The index along the third dimension. - The index along the fourth dimension. - The value at the given index. - - - Creates an array where the entries are initially the "default" value. - The length of the first dimension. - The length of the second dimension. - The length of the third dimension. - The length of the fourth dimension. - The created array. - - - Returns the length of an array in the fourth dimension. - The input array. - The length of the array in the fourth dimension. - - - Returns the length of an array in the third dimension. - The input array. - The length of the array in the third dimension. - - - Returns the length of an array in the second dimension. - The input array. - The length of the array in the second dimension. - - - Returns the length of an array in the first dimension - The input array. - The length of the array in the first dimension. - - - Creates an array given the dimensions and a generator function to compute the elements. - The length of the first dimension. - The length of the second dimension. - The length of the third dimension. - The length of the fourth dimension. - The function to create an initial value at each index in the array. - The created array. - - - Creates an array whose elements are all initially the given value - The length of the first dimension. - The length of the second dimension. - The length of the third dimension. - The length of the fourth dimension. - The initial value for each element of the array. - The created array. - - - Basic operations on rank 4 arrays. - - - Combines three arrays into an array of pairs. The three arrays must have equal lengths, otherwise an ArgumentException is - raised. - The first input array. - The second input array. - The third input array. - Thrown when the input arrays differ in length. - The array of tupled elements. - - - Combines the two arrays into an array of pairs. The two arrays must have equal lengths, otherwise an ArgumentException is - raised. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - The array of tupled elements. - - - Splits an array of triples into three arrays. - The input array. - The tuple of three arrays. - - - Splits an array of pairs into two arrays. - The input array. - The two arrays. - - - Returns the index of the first element in the array - that satisfies the given predicate. - The function to test the input elements. - The input array. - The index of the first element that satisfies the predicate, or None. - - - Returns the first element for which the given function returns true. - Return None if no such element exists. - The function to test the input elements. - The input array. - The first element that satisfies the predicate, or None. - - - Views the given array as a sequence. - The input array. - The sequence of array elements. - - - Builds a list from the given array. - The input array. - The list of array elements. - - - Returns the sum of the results generated by applying the function to each element of the array. - The function to transform the array elements into the type to be summed. - The input array. - The resulting sum. - - - Returns the sum of the elements in the array. - The input array. - The resulting sum. - - - Sorts the elements of an array by mutating the array in-place, using the given comparison function. - Elements are compared using Operators.compare. - The input array. - - - Sorts the elements of an array by mutating the array in-place, using the given comparison function as the order. - The function to compare pairs of array elements. - The input array. - - - Sorts the elements of an array by mutating the array in-place, using the given projection for the keys. - Elements are compared using Operators.compare. - - This is not a stable sort, i.e. the original order of equal elements is not necessarily preserved. - For a stable sort, consider using Seq.sort. - The function to transform array elements into the type that is compared. - The input array. - - - Sorts the elements of an array, using the given comparison function as the order, returning a new array. - - This is not a stable sort, i.e. the original order of equal elements is not necessarily preserved. - For a stable sort, consider using Seq.sort. - The function to compare pairs of array elements. - The input array. - The sorted array. - - - Sorts the elements of an array, using the given projection for the keys and returning a new array. - Elements are compared using Operators.compare. - - This is not a stable sort, i.e. the original order of equal elements is not necessarily preserved. - For a stable sort, consider using Seq.sort. - The function to transform array elements into the type that is compared. - The input array. - The sorted array. - - - Sorts the elements of an array, returning a new array. Elements are compared using Operators.compare. - - This is not a stable sort, i.e. the original order of equal elements is not necessarily preserved. - For a stable sort, consider using Seq.sort. - The input array. - The sorted array. - - - Builds a new array that contains the given subrange specified by - starting index and length. - The input array. - The index of the first element of the sub array. - The length of the sub array. - The created sub array. - - - Sets an element of an array. - The input array. - The input index. - The input value. - - - Like foldBack, but return both the intermediary and final results. - The function to update the state given the input elements. - The input array. - The initial state. - The array of state values. - - - Like fold, but return the intermediary and final results. - The function to update the state given the input elements. - The initial state. - The input array. - The array of state values. - - - Returns a new array with the elements in reverse order. - The input array. - The reversed array. - - - Applies 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. - The function to reduce a pair of elements to a single element. - The input array. - Thrown when the input array is empty. - The final result of the reductions. - - - Applies 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. - The function to reduce a pair of elements to a single element. - The input array. - Thrown when the input array is empty. - The final result of the redcutions. - - - Returns an array with all elements permuted according to the - specified permutation. - The function that maps input indices to output indices. - The input array. - The output array. - - - Splits the collection into two collections, containing the - elements for which the given predicate returns "true" and "false" - respectively. - The function to test the input elements. - The input array. - A pair of arrays. The first containing the elements the predicate evaluated to true, - and the second containing those evaluated to false. - - - Builds a new array from the given enumerable object. - The input sequence. - The array of elements from the sequence. - - - Builds an array from the given list. - The input list. - The array of elements from the list. - - - Returns the lowest of all elements of the array, compared via Operators.min on the function result. - - Throws ArgumentException for empty arrays. - The function to transform the elements into a type supporting comparison. - The input array. - Thrown when the input array is empty. - The minimum element. - - - Returns the lowest of all elements of the array, compared via Operators.min. - - Throws ArgumentException for empty arrays - The input array. - Thrown when the input array is empty. - The minimum element. - - - Returns the greatest of all elements of the array, compared via Operators.max on the function result. - - Throws ArgumentException for empty arrays. - The function to transform the elements into a type supporting comparison. - The input array. - Thrown when the input array is empty. - The maximum element. - - - Returns the greatest of all elements of the array, compared via Operators.max on the function result. - - Throws ArgumentException for empty arrays. - The input array. - Thrown when the input array is empty. - The maximum element. - - - Builds 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. - The function to transform elements and their indices. - The input array. - The array of transformed elements. - - - Builds 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. - The function to transform pairs of input elements and their indices. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - The array of transformed elements. - - - Builds 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. - The function to transform the pairs of the input elements. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - The array of transformed elements. - - - Builds a new array whose elements are the results of applying the given function - to each of the elements of the array. - The function to transform elements of the array. - The input array. - The array of transformed elements. - - - Returns the length of an array. You can also use property arr.Length. - The input array. - The length of the array. - - - Applies 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. - The function to apply to each index and pair of elements. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - - - Applies the given function to each element of the array. The integer passed to the - function indicates the index of element. - The function to apply to each index and element. - The input array. - - - Applies 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. - The function to apply. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - - - Applies the given function to each element of the array. - The function to apply. - The input array. - - - Returns true if the given array is empty, otherwise false. - The input array. - True if the array is empty. - - - Creates an array where the entries are initially the default value Unchecked.defaultof<'T>. - The length of the array to create. - The created array. - - - Creates an array given the dimension and a generator function to compute the elements. - The number of elements to initialize. - The function to generate the initial values for each index. - The created array. - - - Gets an element from an array. - The input array. - The input index. - The value of the array at the given index. - - - 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. - The function to update the state given the input elements. - The first input array. - The second input array. - The initial state. - Thrown when the input arrays differ in length. - The final state. - - - Applies 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. - The function to update the state given the input elements. - The initial state. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - The final state. - - - Applies 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)) - The function to update the state given the input elements. - The input array. - The initial state. - The final state. - - - Applies 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 - The function to update the state given the input elements. - The initial state. - The input array. - The final state. - - - Tests 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. - The function to test the input elements. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - True if all of the array elements satisfy the predicate. - - - Tests 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. - The function to test the input elements. - The input array. - True if all of the array elements satisfy the predicate. - - - Returns the index of the first element in the array - that satisfies the given predicate. Raise KeyNotFoundException if - none of the elements satisy the predicate. - The function to test the input elements. - The input array. - Thrown if predicate - never returns true. - The index of the first element in the array that satisfies the given predicate. - - - Returns the first element for which the given function returns 'true'. - Raise KeyNotFoundException if no such element exists. - The function to test the input elements. - The input array. - Thrown if predicate - never returns true. - The first element for which predicate returns true. - - - Returns a new collection containing only the elements of the collection - for which the given predicate returns "true". - The function to test the input elements. - The input array. - An array containing the elements for which the given predicate returns true. - - - Tests 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. - The function to test the input elements. - The first input array. - The second input array. - True if any result from predicate is true. - - - Tests 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. - The function to test the input elements. - The input array. - True if any result from predicate is true. - - - Returns an empty array of the given type. - - - Applies the given function to each element of the array. Returns - the array comprised of the results "x" for each element where - the function returns Some(x) - The function to generate options from the elements. - The input array. - The array of results. - - - Applies 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. - The function to generate options from the elements. - The input array. - Thrown if every result from - chooser is None. - The first result. - - - Fills a range of elements of the array with the given value. - The target array. - The index of the first element to set. - The number of elements to set. - The value to set. - - - Applies 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. - The function to transform the array elements into options. - The input array. - The first transformed element that is Some(x). - - - Creates an array whose elements are all initially the given value. - The length of the array to create. - The value for the elements. - The created array. - - - Builds a new array that contains the elements of the given array. - The input array. - A copy of the input array. - - - Builds a new array that contains the elements of each of the given sequence of arrays. - The input sequence of arrays. - The concatenation of the sequence of input arrays. - - - For each element of the array, applies the given function. Concatenates all the results and return the combined array. - The function to create sub-arrays from the input array elements. - The input array. - The concatenation of the sub-arrays. - - - Reads a range of elements from the first array and write them into the second. - The source array. - The starting index of the source array. - The target array. - The starting index of the target array. - The number of elements to copy. - - - Returns the average of the elements generated by applying the function to each element of the array. - The function to transform the array elements before averaging. - The input array. - Thrown when array is empty. - The computed average. - - - Returns the average of the elements in the array. - The input array. - Thrown when array is empty. - The average of the elements in the array. - - - Builds a new array that contains the elements of the first array followed by the elements of the second array. - The first input array. - The second input array. - The resulting array. - - - Basic operations on arrays. - - - Compare using the given comparer function. - A function to compare two values. - An object implementing IComparer using the supplied comparer. - - - Structural comparison. Compare using Operators.compare. - - - Common notions of comparison identity used with sorted data structures. - - - Hash using the given hashing and equality functions. - A function to generate a hash code from a value. - A function to test equality of two values. - An object implementing IEqualityComparer using the supplied functions. - - - Physical hashing (hash on reference identity of objects, and the contents of value types). - Hash using LanguagePrimitives.PhysicalEquality and LanguagePrimitives.PhysicalHash, - That is, for value types use GetHashCode and Object.Equals (if no other optimization available), - and for reference types use System.Runtime.CompilerServices.RuntimeHelpers.GetHashCode and - reference equality. - - - - - - Structural hashing. Hash using Operators.(=) and Operators.hash. - - - Common notions of value identity used with hash tables. - - - Combines the three lists into a list of triples. The lists must have equal lengths. - The first input list. - The second input list. - The third input list. - A single list containing triples of matching elements from the input lists. - - - Combines the two lists into a list of pairs. The two lists must have equal lengths. - The first input list. - The second input list. - A single list containing pairs of matching elements from the input lists. - - - Splits a list of triples into three lists. - The input list. - Three lists of split elements. - - - Splits a list of pairs into two lists. - The input list. - Two lists of split elements. - - - Returns the index of the first element in the list - that satisfies the given predicate. - Return None if no such element exists. - The function to test the input elements. - The input list. - The index of the first element for which the predicate returns true, or None if - every element evaluates to false. - - - Returns the first element for which the given function returns true.. - Return None if no such element exists. - The function to test the input elements. - The input list. - The first element for which the predicate returns true, or None if - every element evaluates to false. - - - Applies the given function to successive elements, returning Some(x) the first - result where function returns Some(x) for some x. If no such element - exists then return None. - The function to generate options from the elements. - The input list. - The first resulting value or None. - - - Views the given list as a sequence. - The input list. - The sequence of elements in the list. - - - Builds an array from the given list. - The input list. - The array containing the elements of the list. - - - Returns the list after removing the first element. - - The input list. - Thrown when the list is empty. - The list after removing the first element. - - - Returns the sum of the results generated by applying the function to each element of the list. - The function to transform the list elements into the type to be summed. - The input list. - The resulting sum. - - - Returns the sum of the elements in the list. - The input list. - The resulting sum. - - - Sorts the given list using Operators.compare. - - This is a stable sort, i.e. the original order of equal elements is preserved. - The input list. - The sorted list. - - - Sorts the given list using keys given by the given projection. Keys are compared using Operators.compare. - - This is a stable sort, i.e. the original order of equal elements is preserved. - The function to transform the list elements into the type to be compared. - The input list. - The sorted list. - - - Sorts the given list using the given comparison function. - - This is a stable sort, i.e. the original order of equal elements is preserved. - The function to compare the list elements. - The input list. - The sorted list. - - - Like foldBack, but returns both the intermediary and final results - The function to update the state given the input elements. - The input list. - The initial state. - The list of states. - - - Applies a function to each element of the collection, threading an accumulator argument - through the computation. Take the second argument, and apply the function to it - and the first element of the list. Then feed this result into the function along - with the second element and so on. Returns the list of intermediate results and the final result. - The function to update the state given the input elements. - The initial state. - The input list. - The list of states. - - - Returns a new list with the elements in reverse order. - The input list. - The reversed list. - - - Creates a list by calling the given generator on each index. - The number of elements to replicate. - The value to replicate - The generated list. - - - Applies 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 i0 (...(f iN-1 iN)). - - Raises System.ArgumentException if list is empty - The function to reduce two list elements to a single element. - The input list. - Thrown when the list is empty. - The final reduced value. - - - Apply a function to each element of the collection, threading an accumulator argument - through the computation. Apply the function to the first two elements of the list. - Then feed this result into the function along with the third element and so on. - Return the final result. If the input function is f and the elements are i0...iN then computes - f (... (f i0 i1) i2 ...) iN. - - Raises System.ArgumentException if list is empty - The function to reduce two list elements to a single element. - The input list. - Thrown when the list is empty. - The final reduced value. - - - Returns a list with all elements permuted according to the - specified permutation. - The function to map input indices to output indices. - The input list. - The permutated list. - - - Applies the given function to successive elements, returning the first - result where function returns Some(x) for some x. If no such - element exists then raise System.Collections.Generic.KeyNotFoundException - The function to generate options from the elements. - The input list. - Thrown when the list is empty. - The first resulting value. - - - Splits the collection into two collections, containing the - elements for which the given predicate returns true and false - respectively. Element order is preserved in both of the created lists. - The function to test the input elements. - The input list. - A list containing the elements for which the predicate evaluated to false and a list - containing the elements for which the predicate evaluated to true. - - - Builds a new list from the given enumerable object. - The input sequence. - The list of elements from the sequence. - - - Builds a list from the given array. - The input array. - The list of elements from the array. - - - Indexes into the list. The first element has index 0. - The input list. - The index to retrieve. - The value at the given index. - - - Returns the lowest of all elements of the list, compared via Operators.min on the function result - - Raises System.ArgumentException if list is empty. - The function to transform list elements into the type to be compared. - The input list. - Thrown when the list is empty. - The minimum value. - - - Returns the lowest of all elements of the list, compared via Operators.min. - - Raises System.ArgumentException if list is empty - The input list. - Thrown when the list is empty. - The minimum value. - - - Returns the greatest of all elements of the list, compared via Operators.max on the function result. - - Raises System.ArgumentException if list is empty. - The function to transform the list elements into the type to be compared. - The input list. - Thrown when the list is empty. - The maximum element. - - - Return the greatest of all elements of the list, compared via Operators.max. - - Raises System.ArgumentException if list is empty - The input list. - Thrown when the list is empty. - The maximum element. - - - Like mapi, but mapping corresponding elements from two lists of equal length. - The function to transform pairs of elements from the two lists and their index. - The first input list. - The second input list. - The list of transformed elements. - - - Builds a new collection whose elements are the results of applying the given function - to each of the elements of the collection. The integer index passed to the - function indicates the index (from 0) of element being transformed. - The function to transform elements and their indices. - The input list. - The list of transformed elements. - - - Builds a new collection whose elements are the results of applying the given function - to the corresponding elements of the three collections simultaneously. - The function to transform triples of elements from the input lists. - The first input list. - The second input list. - The third input list. - The list of transformed elements. - - - Builds a new collection whose elements are the results of applying the given function - to the corresponding elements of the two collections pairwise. - The function to transform pairs of elements from the input lists. - The first input list. - The second input list. - The list of transformed elements. - - - Builds a new collection whose elements are the results of applying the given function - to each of the elements of the collection. - The function to transform elements from the input list. - The input list. - The list of transformed elements. - - - Returns the length of the list. - The input list. - The length of the list. - - - Applies the given function to two collections simultaneously. The - collections must have identical size. The integer passed to the - function indicates the index of element. - The function to apply to a pair of elements from the input lists along with their index. - The first input list. - The second input list. - - - Applies the given function to each element of the collection. The integer passed to the - function indicates the index of element. - The function to apply to the elements of the list along with their index. - The input list. - - - Applies the given function to two collections simultaneously. The - collections must have identical size. - The function to apply to pairs of elements from the input lists. - The first input list. - The second input list. - - - Applies the given function to each element of the collection. - The function to apply to elements from the input list. - The input list. - - - Returns true if the list contains no elements, false otherwise. - The input list. - True if the list is empty. - - - Creates a list by calling the given generator on each index. - The length of the list to generate. - The function to generate an element from an index. - The list of generated elements. - - - Returns the first element of the list. - - The input list. - Thrown when the list is empty. - The first element of the list. - - - Tests if all corresponding elements of the collection 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 System.ArgumentException exception is raised. - Otherwise, true is returned. - The function to test the input elements. - The first input list. - The second input list. - Thrown when the input lists differ in length. - True if all of the pairs of elements satisfy the predicate. - - - Tests if all elements of the collection satisfy the given predicate. - - The predicate is applied to the elements of the input list. If any application - returns false then the overall result is false and no further elements are tested. - Otherwise, true is returned. - The function to test the input elements. - The input list. - True if all of the elements satisfy the predicate. - - - Applies a function to corresponding elements of two collections, threading an accumulator argument - through the computation. The collections must have identical sizes. - If the input function is f and the elements are i0...iN and j0...jN - then computes f i0 j0 (...(f iN jN s)). - The function to update the state given the input elements. - The first input list. - The second input list. - The initial state. - The final state value. - - - Applies 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 i0 (...(f iN s)). - The function to update the state given the input elements. - The input list. - The initial state. - The final state value. - - - Applies a function to corresponding elements of two collections, threading an accumulator argument - through the computation. The collections must have identical sizes. - If the input function is f and the elements are i0...iN and j0...jN - then computes f (... (f s i0 j0)...) iN jN. - The function to update the state given the input elements. - The initial state. - The first input list. - The second input list. - The final state value. - - - Applies a function to each element of the collection, threading an accumulator argument - through the computation. Take the second argument, and apply the function to it - and the first element of the list. Then feed this result into the function along - with the second element and so on. Return the final result. - If the input function is f and the elements are i0...iN then - computes f (... (f s i0) i1 ...) iN. - The function to update the state given the input elements. - The initial state. - The input list. - The final state value. - - - Returns a new collection containing only the elements of the collection - for which the given predicate returns "true" - The function to test the input elements. - The input list. - A list containing only the elements that satisfy the predicate. - - - Returns the index of the first element in the list - that satisfies the given predicate. - Raises KeyNotFoundException if no such element exists. - The function to test the input elements. - The input list. - Thrown if the predicate evaluates to false for all the - elements of the list. - The index of the first element that satisfies the predicate. - - - Returns the first element for which the given function returns true. - Raises KeyNotFoundException if no such element exists. - The function to test the input elements. - The input list. - Thrown if the predicate evaluates to false for - all the elements of the list. - The first element that satisfies the predicate. - - - Tests if any pair of corresponding elements of the lists 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 System.ArgumentException exception is raised. - Otherwise, false is returned. - The function to test the input elements. - The first input list. - The second input list. - Thrown when the input lists differ in length. - True if any pair of elements satisfy the predicate. - - - Tests if any element of the list satisfies the given predicate. - - The predicate is applied to the elements of the input list. If any application - returns true then the overall result is true and no further elements are tested. - Otherwise, false is returned. - The function to test the input elements. - The input list. - True if any element satisfies the predicate. - - - Returns an empty list of the given type. - - - Returns a new list that contains the elements of each the lists in order. - The input sequence of lists. - The resulting concatenated list. - - - For each element of the list, applies the given function. Concatenates all the results and return the combined list. - The function to transform each input element into a sublist to be concatenated. - The input list. - The concatenation of the transformed sublists. - - - Applies the given function to each element of the list. Returns - the list comprised of the results x for each element where - the function returns Some(x) - The function to generate options from the elements. - The input list. - The list comprising the values selected from the chooser function. - - - Returns the average of the elements generated by applying the function to each element of the list. - - Raises System.ArgumentException if list is empty. - The function to transform the list elements into the type to be averaged. - The input list. - Thrown when the list is empty. - The resulting average. - - - Returns the average of the elements in the list. - - Raises System.ArgumentException if list is empty. - The input list. - Thrown when the list is empty. - The resulting average. - - - Returns a new list that contains the elements of the first list - followed by elements of the second. - The first input list. - The second input list. - The resulting list. - - - Basic operations on lists. - - - Returns the key of the first mapping in the collection that satisfies the given predicate. - Returns 'None' if no such element exists. - The function to test the input elements. - The input map. - The first key for which the predicate returns true or None if the predicate evaluates to false for each key/value pair. - - - Evaluates the function on each mapping in the collection. Returns the key for the first mapping - where the function returns 'true'. Raise KeyNotFoundException if no such element exists. - The function to test the input elements. - The input map. - Thrown if the key does not exist in the map. - The first key for which the predicate evaluates true. - - - Lookup an element in the map, returning a Some value if the element is in the domain - of the map and None if not. - The input key. - The input map. - The found Some value or None. - - - Removes an element from the domain of the map. No exception is raised if the element is not present. - The input key. - The input map. - The resulting map. - - - Builds two new maps, one containing the bindings for which the given predicate returns 'true', - and the other the remaining bindings. - The function to test the input elements. - The input map. - A pair of maps in which the first contains the elements for which the predicate returned true - and the second containing the elements for which the predicated returned false. - - - Tests if an element is in the domain of the map. - The input key. - The input map. - True if the map contains the key. - - - Builds a new collection whose elements are the results of applying the given function - to each of the elements of the collection. The key passed to the - function indicates the key of element being transformed. - The function to transform the key/value pairs. - The input map. - The resulting map of keys and transformed values. - - - Returns true if the given predicate returns true for all of the - bindings in the map. - The function to test the input elements. - The input map. - True if the predicate evaluates to true for all of the bindings in the map. - - - Builds a new map containing only the bindings for which the given predicate returns 'true'. - The function to test the key/value pairs. - The input map. - The filtered map. - - - Returns true if the given predicate returns true for one of the - bindings in the map. - The function to test the input elements. - The input map. - True if the predicate returns true for one of the key/value pairs. - - - Applies the given function to each binding in the dictionary - The function to apply to each key/value pair. - The input map. - - - Folds over the bindings in the map - The function to update the state given the input key/value pairs. - The initial state. - The input map. - The final state value. - - - Folds over the bindings in the map. - The function to update the state given the input key/value pairs. - The input map. - The initial state. - The final state value. - - - Searches the map looking for the first element where the given function returns a Some value - The function to generate options from the key/value pairs. - The input map. - The first result. - - - Searches the map looking for the first element where the given function returns a Some value. - The function to generate options from the key/value pairs. - The input map. - The first result. - - - Lookup an element in the map, raising KeyNotFoundException if no binding - exists in the map. - The input key. - The input map. - Thrown when the key does not exist in the map. - The value mapped to the given key. - - - The empty map. - - - Is the map empty? - The input map. - True if the map is empty. - - - Returns an array of all key-value pairs in the mapping. - The array will be ordered by the keys of the map. - The input map. - The array of key/value pairs. - - - Returns a list of all key-value pairs in the mapping. - The list will be ordered by the keys of the map. - The input map. - The list of key/value pairs. - - - Views the collection as an enumerable sequence of pairs. - The sequence will be ordered by the keys of the map. - The input map. - The sequence of key/value pairs. - - - Returns a new map made from the given bindings. - The input sequence of key/value pairs. - The resulting map. - - - Returns a new map made from the given bindings. - The input array of key/value pairs. - The resulting map. - - - Returns a new map made from the given bindings. - The input list of key/value pairs. - The resulting map. - - - Returns a new map with the binding added to the given map. - The input key. - The input value. - The input map. - The resulting map. - - - Functional programming operators related to the Map<_,_> type. - - - Combines the three sequences into a list of triples. The sequences need not have equal lengths: - when one sequence is exhausted any remaining elements in the other - sequences are ignored. - - The first input sequence. - The second input sequence. - The third input sequence. - - The result sequence. - - Thrown when any of the input sequences is null. - - - Combines the two sequences into a list of pairs. The two sequences need not have equal lengths: - when one sequence is exhausted any remaining elements in the other - sequence are ignored. - - The first input sequence. - The second input sequence. - - The result sequence. - - Thrown when either of the input sequences is null. - - - Returns a sequence that yields sliding windows of containing elements drawn from the input - sequence. Each window is returned as a fresh array. - - The number of elements in each window. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - - - Returns a sequence that contains the elements generated by the given computation. - The given initial state argument is passed to the element generator. - For each IEnumerator elements in the stream are generated on-demand by applying the element - generator, until a None value is returned by the element generator. Each call to the element - generator returns a new residual state. - - The stream will be recomputed each time an IEnumerator is requested and iterated for the Seq. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - A function that takes in the current state and returns an option tuple of the next - element of the sequence and the next state value. - The initial state value. - - The result sequence. - - - Returns a sequence that when enumerated returns at most N elements. - - The maximum number of items to enumerate. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Applies the given function to successive elements, returning the first - result where the function returns "Some(x)". - - A function that transforms items from the input sequence into options. - The input sequence. - - The chosen element or None. - - Thrown when the input sequence is null. - - - Returns the index of the first element in the sequence - that satisfies the given predicate. Return None if no such element exists. - - A function that evaluates to a Boolean when given an item in the sequence. - The input sequence. - - The found index or None. - - Thrown when the input sequence is null. - - - Returns the first element for which the given function returns true. - Return None if no such element exists. - - A function that evaluates to a Boolean when given an item in the sequence. - The input sequence. - - The found element or None. - - Thrown when the input sequence is null. - - - Builds a list from the given collection. - - The input sequence. - - The result list. - - Thrown when the input sequence is null. - - - Builds an array from the given collection. - - The input sequence. - - The result array. - - Thrown when the input sequence is null. - - - Returns a sequence that, when iterated, yields elements of the underlying sequence while the - given predicate returns true, and then returns no further elements. - - A function that evaluates to false when no more items should be returned. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns the first N elements of the sequence. - Throws InvalidOperationException - if the count exceeds the number of elements in the sequence. Seq.truncate - returns as many items as the sequence contains instead of throwing an exception. - - The number of items to take. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - Thrown when count exceeds the number of elements - in the sequence. - - - Returns the sum of the results generated by applying the function to each element of the sequence. - The generated elements are summed using the + operator and Zero property associated with the generated type. - - A function to transform items from the input sequence into the type that will be summed. - The input sequence. - - The computed sum. - - - Returns the sum of the elements in the sequence. - - The elements are summed using the + operator and Zero property associated with the generated type. - - The input sequence. - - The computed sum. - - - Applies a key-generating function to each element of a sequence and yield a sequence ordered - by keys. The keys are compared using generic comparison as implemented by Operators.compare. - - This function returns a sequence that digests the whole initial sequence as soon as - that sequence is iterated. As a result this function should not be used with - large or infinite sequences. The function makes no assumption on the ordering of the original - sequence. - - This is a stable sort, that is the original order of equal elements is preserved. - - A function to transform items of the input sequence into comparable keys. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Yields a sequence ordered by keys. - - This function returns a sequence that digests the whole initial sequence as soon as - that sequence is iterated. As a result this function should not be used with - large or infinite sequences. The function makes no assumption on the ordering of the original - sequence. - - This is a stable sort, that is the original order of equal elements is preserved. - - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns a sequence that, when iterated, skips elements of the underlying sequence while the - given predicate returns true, and then yields the remaining elements of the sequence. - - A function that evaluates an element of the sequence to a boolean value. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns a sequence that skips N elements of the underlying sequence and then yields the - remaining elements of the sequence. - - The number of items to skip. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - Thrown when count exceeds the number of elements - in the sequence. - - - Returns a sequence that yields one item only. - - The input item. - - The result sequence of one item. - - - Like fold, but computes on-demand and returns the sequence of intermediary and final results. - - A function that updates the state with each element from the sequence. - The initial state. - The input sequence. - - The resulting sequence of computed states. - - Thrown when the input sequence is null. - - - Applies a function to each element of the sequence, threading an accumulator argument - through the computation. Begin by applying the function to the first two elements. - Then feed this result into the function along with the third element and so on. - Return the final result. - - A function that takes in the current accumulated result and the next - element of the sequence to produce the next accumulated result. - The input sequence. - - The final result of the reduction function. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - - - Builds a new sequence object that delegates to the given sequence object. This ensures - the original sequence cannot be rediscovered and mutated by a type cast. For example, - if given an array the returned sequence will return the elements of the array, but - you cannot cast the returned sequence object to an array. - - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Applies the given function to successive elements, returning the first - x where the function returns "Some(x)". - - A function to transform each item of the input sequence into an option of the output type. - The input sequence. - - The selected element. - - Thrown when the input sequence is null. - Thrown when every item of the sequence - evaluates to None when the given function is applied. - - - Returns a sequence of each element in the input sequence and its predecessor, with the - exception of the first element which is only returned as the predecessor of the second element. - - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Views the given list as a sequence. - - The input list. - - The result sequence. - - - Views the given array as a sequence. - - The input array. - - The result sequence. - - Thrown when the input sequence is null. - - - Computes the nth element in the collection. - - The index of element to retrieve. - The input sequence. - - The nth element of the sequence. - - Thrown when the input sequence is null. - - - Returns the lowest of all elements of the sequence, compared via Operators.min on the function result. - - A function to transform items from the input sequence into comparable keys. - The input sequence. - - The smallest element of the sequence. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - - - Returns the lowest of all elements of the sequence, compared via Operators.min. - - The input sequence. - - The smallest element of the sequence. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - - - Returns the greatest of all elements of the sequence, compared via Operators.max on the function result. - - A function to transform items from the input sequence into comparable keys. - The input sequence. - - The largest element of the sequence. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - - - Returns the greatest of all elements of the sequence, compared via Operators.max - - The input sequence. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - - The largest element of the sequence. - - - Builds a new collection whose elements are the results of applying the given function - to each of the elements of the collection. The integer index passed to the - function indicates the index (from 0) of element being transformed. - - A function to transform items from the input sequence that also supplies the current index. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Builds a new collection whose elements are the results of applying the given function - to the corresponding pairs of elements from the two sequences. If one input sequence is shorter than - the other then the remaining elements of the longer sequence are ignored. - - A function to transform pairs of items from the input sequences. - The first input sequence. - The second input sequence. - - The result sequence. - - Thrown when either of the input sequences is null. - - - Builds a new collection whose elements are the results of applying the given function - to each of the elements of the collection. The given function will be applied - as elements are demanded using the MoveNext method on enumerators retrieved from the - object. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - A function to transform items from the input sequence. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns the length of the sequence - - The input sequence. - - The length of the sequence. - - Thrown when the input sequence is null. - - - Applies the given function to two collections simultaneously. If one sequence is shorter than - the other then the remaining elements of the longer sequence are ignored. - - A function to apply to each pair of elements from the input sequences. - The first input sequence. - The second input sequence. - - Thrown when either of the input sequences is null. - - - Applies the given function to each element of the collection. The integer passed to the - function indicates the index of element. - - A function to apply to each element of the sequence that can also access the current index. - The input sequence. - - Thrown when the input sequence is null. - - - Applies the given function to each element of the collection. - - A function to apply to each element of the sequence. - The input sequence. - - Thrown when the input sequence is null. - - - Generates a new sequence which, when iterated, will return successive - elements by calling the given function. The results of calling the function - will not be saved, that is the function will be reapplied as necessary to - regenerate the elements. The function is passed the index of the item being - generated. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - Iteration can continue up to Int32.MaxValue. - - A function that generates an item in the sequence from a given index. - - The result sequence. - - - Generates a new sequence which, when iterated, will return successive - elements by calling the given function, up to the given count. Each element is saved after its - initialization. The function is passed the index of the item being - generated. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - The maximum number of items to generate for the sequence. - A function that generates an item in the sequence from a given index. - - The result sequence. - - Thrown when count is negative. - - - Returns true if the sequence contains no elements, false otherwise. - - The input sequence. - - True if the sequence is empty; false otherwise. - - Thrown when the input sequence is null. - - - Returns the only element of the sequence. - - The input sequence. - - The last element of the sequence. - - Thrown when the input sequence is null. - Thrown when the input does not have precisely one element. - - - Returns the last element of the sequence. - - The input sequence. - - The last element of the sequence. - - Thrown when the input sequence is null. - Thrown when the input does not have any elements. - - - Returns the first element of the sequence. - - The input sequence. - - The first element of the sequence. - - Thrown when the input sequence is null. - Thrown when the input does not have any elements. - - - Applies a key-generating function to each element of a sequence and yields a sequence of - unique keys. Each unique key contains a sequence of all elements that match - to this key. - - This function returns a sequence that digests the whole initial sequence as soon as - that sequence is iterated. As a result this function should not be used with - large or infinite sequences. The function makes no assumption on the ordering of the original - sequence. - - A function that transforms an element of the sequence into a comparable key. - The input sequence. - - The result sequence. - - - Tests the all pairs of elements drawn from the two sequences satisfy the - given predicate. If one sequence is shorter than - the other then the remaining elements of the longer sequence are ignored. - - A function to test pairs of elements from the input sequences. - The first input sequence. - The second input sequence. - - True if all pairs satisfy the predicate; false otherwise. - - Thrown when either of the input sequences is null. - - - Tests if all elements of the sequence satisfy the given predicate. - - The predicate is applied to the elements of the input sequence. If any application - returns false then the overall result is false and no further elements are tested. - Otherwise, true is returned. - - A function to test an element of the input sequence. - The input sequence. - - True if every element of the sequence satisfies the predicate; false otherwise. - - Thrown when the input sequence is null. - - - Applies 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 - - A function that updates the state with each element from the sequence. - The initial state. - The input sequence. - - The state object after the folding function is applied to each element of the sequence. - - Thrown when the input sequence is null. - - - Returns the index of the first element for which the given function returns true. - - A function to test whether the index of a particular element should be returned. - The input sequence. - - The index of the first element for which the predicate returns true. - - Thrown if no element returns true when - evaluated by the predicate - Thrown when the input sequence is null - - - Returns the first element for which the given function returns true. - - A function to test whether an item in the sequence should be returned. - The input sequence. - - The first element for which the predicate returns true. - - Thrown if no element returns true when - evaluated by the predicate - Thrown when the input sequence is null - - - Returns a new collection containing only the elements of the collection - for which the given predicate returns "true". - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - Remember sequence is lazy, effects are delayed until it is enumerated. - - A synonym for Seq.filter. - - A function to test whether each item in the input sequence should be included in the output. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns a new collection containing only the elements of the collection - for which the given predicate returns "true". This is a synonym for Seq.where. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - Remember sequence is lazy, effects are delayed until it is enumerated. - - A function to test whether each item in the input sequence should be included in the output. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Tests if any pair of corresponding elements of the input sequences satisfies the given predicate. - - The predicate is applied to matching elements in the two sequences 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, false is returned. If one sequence is shorter than - the other then the remaining elements of the longer sequence are ignored. - - A function to test each pair of items from the input sequences. - The first input sequence. - The second input sequence. - - True if any result from the predicate is true; false otherwise. - - Thrown when either of the two input sequences is null. - - - Tests if any element of the sequence satisfies the given predicate. - - The predicate is applied to the elements of the input sequence. If any application - returns true then the overall result is true and no further elements are tested. - Otherwise, false is returned. - - A function to test each item of the input sequence. - The input sequence. - - True if any result from the predicate is true; false otherwise. - - Thrown when the input sequence is null. - - - Creates an empty sequence. - - An empty sequence. - - - Returns a sequence that contains no duplicate entries according to the - generic hash and equality comparisons on the keys returned by the given key-generating function. - If an element occurs multiple times in the sequence then the later occurrences are discarded. - - A function transforming the sequence items into comparable keys. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns a sequence that contains no duplicate entries according to generic hash and - equality comparisons on the entries. - If an element occurs multiple times in the sequence then the later occurrences are discarded. - - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns a sequence that is built from the given delayed specification of a - sequence. - - The input function is evaluated each time an IEnumerator for the sequence - is requested. - - The generating function for the sequence. - - - Applies a key-generating function to each element of a sequence and return a sequence yielding unique - keys and their number of occurrences in the original sequence. - - Note that this function returns a sequence that digests the whole initial sequence as soon as - that sequence is iterated. As a result this function should not be used with - large or infinite sequences. The function makes no assumption on the ordering of the original - sequence. - - A function transforming each item of input sequence into a key to be - compared against the others. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Combines the given enumeration-of-enumerations as a single concatenated - enumeration. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - The input enumeration-of-enumerations. - - The result sequence. - - Thrown when the input sequence is null. - - - Compares two sequences using the given comparison function, element by element. - Returns the first non-zero result from the comparison function. If the end of a sequence - is reached it returns a -1 if the first sequence is shorter and a 1 if the second sequence - is shorter. - - A function that takes an element from each sequence and returns an int. - If it evaluates to a non-zero value iteration is stopped and that value is returned. - The first input sequence. - The second input sequence. - - The first non-zero value from the comparison function. - - Thrown when either of the input sequences - is null. - - - Applies the given function to each element of the sequence and concatenates all the - results. - - Remember sequence is lazy, effects are delayed until it is enumerated. - - A function to transform elements of the input sequence into the sequences - that will then be concatenated. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Applies the given function to each element of the list. Return - the list comprised of the results "x" for each element where - the function returns Some(x). - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not - be accessed concurrently. - - A function to transform items of type T into options of type U. - The input sequence of type T. - - The result sequence. - - Thrown when the input sequence is null. - - - Wraps a loosely-typed System.Collections sequence as a typed sequence. - - The use of this function usually requires a type annotation. - An incorrect type annotation may result in runtime type - errors. - Individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns a sequence that corresponds to a cached version of the input sequence. - This result sequence will have the same elements as the input sequence. The result - can be enumerated multiple times. The input sequence will be enumerated at most - once and only as far as is necessary. Caching a sequence is typically useful when repeatedly - evaluating items in the original sequence is computationally expensive or if - iterating the sequence causes side-effects that the user does not want to be - repeated multiple times. - - Enumeration of the result sequence is thread safe in the sense that multiple independent IEnumerator - values may be used simultaneously from different threads (accesses to - the internal lookaside table are thread safe). Each individual IEnumerator - is not typically thread safe and should not be accessed concurrently. - - Once enumeration of the input sequence has started, - it's enumerator will be kept live by this object until the enumeration has completed. - At that point, the enumerator will be disposed. - - The enumerator may be disposed and underlying cache storage released by - converting the returned sequence object to type IDisposable, and calling the Dispose method - on this object. The sequence object may then be re-enumerated and a fresh enumerator will - be used. - - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns the average of the results generated by applying the function to each element - of the sequence. - - The elements are averaged using the + operator, DivideByInt method and Zero property - associated with the generated type. - - A function applied to transform each element of the sequence. - The input sequence. - - The average. - - Thrown when the input sequence is null. - Thrown when the input sequence has zero elements. - - - Returns the average of the elements in the sequence. - - The elements are averaged using the + operator, DivideByInt method and Zero property - associated with the element type. - - The input sequence. - - The average. - - Thrown when the input sequence is null. - Thrown when the input sequence has zero elements. - - - Wraps the two given enumerations as a single concatenated - enumeration. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed - concurrently. - - The first sequence. - The second sequence. - - The result sequence. - - Thrown when either of the two provided sequences is - null. - - - Basic operations on IEnumerables. - - - Returns a new set with the elements of the second set removed from the first. - The first input set. - The set whose elements will be removed from set1. - The set with the elements of set2 removed from set1. - - - Builds a new collection from the given enumerable object. - The input sequence. - The set containing elements. - - - Returns an ordered view of the collection as an enumerable object. - The input set. - An ordered sequence of the elements of set. - - - Builds an array that contains the elements of the set in order. - The input set. - An ordered array of the elements of set. - - - Builds a set that contains the same elements as the given array. - The input array. - A set containing the elements of array. - - - Builds a list that contains the elements of the set in order. - The input set. - An ordered list of the elements of set. - - - Builds a set that contains the same elements as the given list. - The input list. - A set containing the elements form the input list. - - - Returns the highest element in the set according to the ordering being used for the set. - The input set. - The max value from the set. - - - Returns the lowest element in the set according to the ordering being used for the set. - The input set. - The min value from the set. - - - Returns a new set with the given element removed. No exception is raised if - the set doesn't contain the given element. - The element to remove. - The input set. - The input set with value removed. - - - Splits the set into two sets containing the elements for which the given predicate - returns true and false respectively. - The function to test set elements. - The input set. - A pair of sets with the first containing the elements for which predicate returns - true and the second containing the elements for which predicate returns false. - - - Applies the given function to each element of the set, in order according - to the comparison function. - The function to apply to each element. - The input set. - - - Returns "true" if the set is empty. - The input set. - True if set is empty. - - - Computes the union of a sequence of sets. - The sequence of sets to untion. - The union of the input sets. - - - Computes the union of the two sets. - The first input set. - The second input set. - The union of set1 and set2. - - - Computes the intersection of a sequence of sets. The sequence must be non-empty. - The sequence of sets to intersect. - The intersection of the input sets. - - - Computes the intersection of the two sets. - The first input set. - The second input set. - The intersection of set1 and set2. - - - Tests if all elements of the collection satisfy the given predicate. - If the input function is f and the elements are i0...iN and "j0...jN" - then computes p i0 && ... && p iN. - The function to test set elements. - The input set. - True if all elements of set satisfy predicate. - - - Applies the given accumulating function to all the elements of the set. - The accumulating function. - The input set. - The initial state. - The final state. - - - Applies the given accumulating function to all the elements of the set - The accumulating function. - The initial state. - The input set. - The final state. - - - Returns a new collection containing the results of applying the - given function to each element of the input set. - The function to transform elements of the input set. - The input set. - A set containing the transformed elements. - - - Returns a new collection containing only the elements of the collection - for which the given predicate returns true. - The function to test set elements. - The input set. - The set containing only the elements for which predicate returns true. - - - Tests if any element of the collection satisfies the given predicate. - If the input function is predicate and the elements are i0...iN - then computes p i0 or ... or p iN. - The function to test set elements. - The input set. - True if any element of set satisfies predicate. - - - Returns the number of elements in the set. Same as size. - The input set. - The number of elements in the set. - - - Evaluates to "true" if all elements of the second set are in the first, and at least - one element of the first is not in the second. - The potential superset. - The set to test against. - True if set1 is a proper superset of set2. - - - Evaluates to "true" if all elements of the second set are in the first. - The potential superset. - The set to test against. - True if set1 is a superset of set2. - - - Evaluates to "true" if all elements of the first set are in the second, and at least - one element of the second is not in the first. - The potential subset. - The set to test against. - True if set1 is a proper subset of set2. - - - Evaluates to "true" if all elements of the first set are in the second - The potential subset. - The set to test against. - True if set1 is a subset of set2. - - - Evaluates to "true" if the given element is in the given set. - The element to test. - The input set. - True if element is in set. - - - Returns a new set with an element added to the set. No exception is raised if - the set already contains the given element. - The value to add. - The input set. - A new set containing value. - - - The set containing the given element. - The value for the set to contain. - The set containing value. - - - The empty set for the type 'T. - - - Functional programming operators related to the Set<_> type. - - - Gets the default cancellation token for executing asynchronous computations. - The default CancellationToken. - - - Creates an asynchronous computation that returns the CancellationToken governing the execution - of the computation. - In async { let! token = Async.CancellationToken ...} token can be used to initiate other - asynchronous operations that will cancel cooperatively with this workflow. - An asynchronous computation capable of retrieving the CancellationToken from a computation - expression. - - - Creates an asynchronous computation that executes computation. - If this computation is cancelled before it completes then the computation generated by - running compensation is executed. - The input asynchronous computation. - The function to be run if the computation is cancelled. - An asynchronous computation that runs the compensation if the input computation - is cancelled. - - - Creates an asynchronous computation that queues a work item that runs - its continuation. - A computation that generates a new work item in the thread pool. - - - Creates an asynchronous computation that creates a new thread and runs - its continuation in that thread. - A computation that will execute on a new thread. - - - Creates an asynchronous computation that runs - its continuation using syncContext.Post. If syncContext is null - then the asynchronous computation is equivalent to SwitchToThreadPool(). - The synchronization context to accept the posted computation. - An asynchronous computation that uses the syncContext context to execute. - - - Runs an asynchronous computation, starting immediately on the current operating system - thread. Call one of the three continuations when the operation completes. - If no cancellation token is provided then the default cancellation token - is used. - The asynchronous computation to execute. - The function called on success. - The function called on exception. - The function called on cancellation. - The CancellationToken to associate with the computation. - The default is used if this parameter is not provided. - - - Runs an asynchronous computation, starting immediately on the current operating system - thread. - If no cancellation token is provided then the default cancellation token is used. - The asynchronous computation to execute. - The CancellationToken to associate with the computation. - The default is used if this parameter is not provided. - - - Creates an asynchronous computation which starts the given computation as a System.Threading.Tasks.Task - - - Starts a child computation within an asynchronous workflow. - This allows multiple asynchronous computations to be executed simultaneously. - - This method should normally be used as the immediate - right-hand-side of a let! binding in an F# asynchronous workflow, that is, - - async { ... - let! completor1 = childComputation1 |> Async.StartChild - let! completor2 = childComputation2 |> Async.StartChild - ... - let! result1 = completor1 - let! result2 = completor2 - ... } - - When used in this way, each use of StartChild starts an instance of childComputation - and returns a completor object representing a computation to wait for the completion of the operation. - When executed, the completor awaits the completion of childComputation. - The child computation. - The timeout value in milliseconds. If one is not provided - then the default value of -1 corresponding to System.Threading.Timeout.Infinite. - A new computation that waits for the input computation to finish. - - - Executes a computation in the thread pool. - If no cancellation token is provided then the default cancellation token is used. - A System.Threading.Tasks.Task that will be completed - in the corresponding state once the computation terminates (produces the result, throws exception or gets canceled) - - - - Starts the asynchronous computation in the thread pool. Do not await its result. - - If no cancellation token is provided then the default cancellation token is used. - The computation to run asynchronously. - The cancellation token to be associated with the computation. - If one is not supplied, the default cancellation token is used. - - - Creates an asynchronous computation that will sleep for the given time. This is scheduled - using a System.Threading.Timer object. The operation will not block operating system threads - for the duration of the wait. - The number of milliseconds to sleep. - An asynchronous computation that will sleep for the given time. - Thrown when the due time is negative - and not infinite. - - - Runs the asynchronous computation and await its result. - - If an exception occurs in the asynchronous computation then an exception is re-raised by this - function. - - If no cancellation token is provided then the default cancellation token is used. - - The timeout parameter is given in milliseconds. A value of -1 is equivalent to - System.Threading.Timeout.Infinite. - The computation to run. - The amount of time in milliseconds to wait for the result of the - computation before raising a System.TimeoutException. If no value is provided - for timeout then a default of -1 is used to correspond to System.Threading.Timeout.Infinite. - The cancellation token to be associated with the computation. - If one is not supplied, the default cancellation token is used. - The result of the computation. - - - Creates an asynchronous computation that executes all the given asynchronous computations, - initially queueing each as work items and using a fork/join pattern. - - If all child computations succeed, an array of results is passed to the success continuation. - - If any child computation raises an exception, then the overall computation will trigger an - exception, and cancel the others. - - The overall computation will respond to cancellation while executing the child computations. - If cancelled, the computation will cancel any remaining child computations but will still wait - for the other child computations to complete. - A sequence of distinct computations to be parallelized. - A computation that returns an array of values from the sequence of input computations. - - - Generates a scoped, cooperative cancellation handler for use within an asynchronous workflow. - - For example, - async { use! holder = Async.OnCancel interruption ... } - generates an asynchronous computation where, if a cancellation happens any time during - the execution of the asynchronous computation in the scope of holder, then action - interruption is executed on the thread that is performing the cancellation. This can - be used to arrange for a computation to be asynchronously notified that a cancellation - has occurred, e.g. by setting a flag, or deregistering a pending I/O action. - The function that is executed on the thread performing the - cancellation. - An asynchronous computation that triggers the interruption if it is cancelled - before being disposed. - - - Creates an asynchronous computation that runs the given computation and ignores - its result. - The input computation. - A computation that is equivalent to the input computation, but disregards the result. - - - Creates an asynchronous computation that captures the current - success, exception and cancellation continuations. The callback must - eventually call exactly one of the given continuations. - The function that accepts the current success, exception, and cancellation - continuations. - An asynchronous computation that provides the callback with the current continuations. - - - Creates an asynchronous computation in terms of a Begin/End pair of actions in - the style used in CLI APIs. This overlaod should be used if the operation is - qualified by three arguments. For example, - Async.FromBeginEnd(arg1,arg2,arg3,ws.BeginGetWeather,ws.EndGetWeather) - When the computation is run, beginFunc is executed, with - a callback which represents the continuation of the computation. - When the callback is invoked, the overall result is fetched using endFunc. - - The computation will respond to cancellation while waiting for the completion - of the operation. If a cancellation occurs, and cancelAction is specified, then it is - executed, and the computation continues to wait for the completion of the operation. - - If cancelAction is not specified, then cancellation causes the computation - to stop immediately, and subsequent invocations of the callback are ignored. - The first argument for the operation. - The second argument for the operation. - The third argument for the operation. - The function initiating a traditional CLI asynchronous operation. - The function completing a traditional CLI asynchronous operation. - An optional function to be executed when a cancellation is requested. - An asynchronous computation wrapping the given Begin/End functions. - - - Creates an asynchronous computation in terms of a Begin/End pair of actions in - the style used in CLI APIs. This overlaod should be used if the operation is - qualified by two arguments. For example, - Async.FromBeginEnd(arg1,arg2,ws.BeginGetWeather,ws.EndGetWeather) - When the computation is run, beginFunc is executed, with - a callback which represents the continuation of the computation. - When the callback is invoked, the overall result is fetched using endFunc. - - The computation will respond to cancellation while waiting for the completion - of the operation. If a cancellation occurs, and cancelAction is specified, then it is - executed, and the computation continues to wait for the completion of the operation. - - If cancelAction is not specified, then cancellation causes the computation - to stop immediately, and subsequent invocations of the callback are ignored. - The first argument for the operation. - The second argument for the operation. - The function initiating a traditional CLI asynchronous operation. - The function completing a traditional CLI asynchronous operation. - An optional function to be executed when a cancellation is requested. - An asynchronous computation wrapping the given Begin/End functions. - - - Creates an asynchronous computation in terms of a Begin/End pair of actions in - the style used in CLI APIs. This overlaod should be used if the operation is - qualified by one argument. For example, - Async.FromBeginEnd(place,ws.BeginGetWeather,ws.EndGetWeather) - When the computation is run, beginFunc is executed, with - a callback which represents the continuation of the computation. - When the callback is invoked, the overall result is fetched using endFunc. - - The computation will respond to cancellation while waiting for the completion - of the operation. If a cancellation occurs, and cancelAction is specified, then it is - executed, and the computation continues to wait for the completion of the operation. - - If cancelAction is not specified, then cancellation causes the computation - to stop immediately, and subsequent invocations of the callback are ignored. - The argument for the operation. - The function initiating a traditional CLI asynchronous operation. - The function completing a traditional CLI asynchronous operation. - An optional function to be executed when a cancellation is requested. - An asynchronous computation wrapping the given Begin/End functions. - - - Creates an asynchronous computation in terms of a Begin/End pair of actions in - the style used in CLI APIs. For example, - Async.FromBeginEnd(ws.BeginGetWeather,ws.EndGetWeather) - When the computation is run, beginFunc is executed, with - a callback which represents the continuation of the computation. - When the callback is invoked, the overall result is fetched using endFunc. - - The computation will respond to cancellation while waiting for the completion - of the operation. If a cancellation occurs, and cancelAction is specified, then it is - executed, and the computation continues to wait for the completion of the operation. - - If cancelAction is not specified, then cancellation causes the computation - to stop immediately, and subsequent invocations of the callback are ignored. - The function initiating a traditional CLI asynchronous operation. - The function completing a traditional CLI asynchronous operation. - An optional function to be executed when a cancellation is requested. - An asynchronous computation wrapping the given Begin/End functions. - - - Creates an asynchronous computation that executes computation. - If this computation completes successfully then return Choice1Of2 with the returned - value. If this computation raises an exception before it completes then return Choice2Of2 - with the raised exception. - The input computation that returns the type T. - A computation that returns a choice of type T or exception. - - - Raises the cancellation condition for the most recent set of asynchronous computations started - without any specific CancellationToken. Replaces the global CancellationTokenSource with a new - global token source for any asynchronous computations created after this point without any - specific CancellationToken. - - - Creates an asynchronous computation that will wait on the given WaitHandle. - - The computation returns true if the handle indicated a result within the given timeout. - The WaitHandle that can be signalled. - The timeout value in milliseconds. If one is not provided - then the default value of -1 corresponding to System.Threading.Timeout.Infinite. - An asynchronous computation that waits on the given WaitHandle. - - - - Return an asynchronous computation that will wait for the given task to complete and return - its result. - - - - Creates an asynchronous computation that will wait on the IAsyncResult. - - The computation returns true if the handle indicated a result within the given timeout. - The IAsyncResult to wait on. - The timeout value in milliseconds. If one is not provided - then the default value of -1 corresponding to System.Threading.Timeout.Infinite. - An asynchronous computation that waits on the given IAsyncResult. - - - Creates an asynchronous computation that waits for a single invocation of a CLI - event by adding a handler to the event. Once the computation completes or is - cancelled, the handler is removed from the event. - - The computation will respond to cancellation while waiting for the event. If a - cancellation occurs, and cancelAction is specified, then it is executed, and - the computation continues to wait for the event. - - If cancelAction is not specified, then cancellation causes the computation - to cancel immediately. - The event to handle once. - An optional function to execute instead of cancelling when a - cancellation is issued. - An asynchronous computation that waits for the event to be invoked. - - - Creates three functions that can be used to implement the .NET Asynchronous - Programming Model (APM) for a given asynchronous computation. - - The functions should normally be published as members with prefix Begin, - End and Cancel, and can be used within a type definition as follows: - - let beginAction,endAction,cancelAction = Async.AsBeginEnd (fun arg -> computation) - member x.BeginSomeOperation(arg,callback,state:obj) = beginAction(arg,callback,state) - member x.EndSomeOperation(iar) = endAction(iar) - member x.CancelSomeOperation(iar) = cancelAction(iar) - - - If the asynchronous computation takes no arguments, then AsBeginEnd is used as follows: - - let beginAction,endAction,cancelAction = Async.AsBeginEnd (fun () -> computation) - member x.BeginSomeOperation(callback,state:obj) = beginAction((),callback,state) - member x.EndSomeOperation(iar) = endAction(iar) - member x.CancelSomeOperation(iar) = cancelAction(iar) - - - - If the asynchronous computation takes two arguments, then AsBeginEnd is used as follows: - - let beginAction,endAction,cancelAction = Async.AsBeginEnd (fun arg1 arg2 -> computation) - member x.BeginSomeOperation(arg1,arg2,callback,state:obj) = beginAction((),callback,state) - member x.EndSomeOperation(iar) = endAction(iar) - member x.CancelSomeOperation(iar) = cancelAction(iar) - - - In each case, the resulting API will be familiar to programmers in other CLI languages and - is a useful way to publish asynchronous computations in CLI components. - A function generating the asynchronous computation to split into the traditional - .NET Asynchronous Programming Model. - A tuple of the begin, end, and cancel members. - - - This static class holds members for creating and manipulating asynchronous computations. - - - Creates an asynchronous computation that just returns (). - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of empty else branches in the - async { ... } computation expression syntax. - An asynchronous computation that returns (). - - - Creates an asynchronous computation that runs computation repeatedly - until guard() becomes false. - - A cancellation check is performed whenever the computation is executed. - - The existence of this method permits the use of while in the - async { ... } computation expression syntax. - The function to determine when to stop executing computation. - The function to be executed. Equivalent to the body - of a while expression. - An asynchronous computation that behaves similarly to a while loop when run. - - - Creates an asynchronous computation that runs binder(resource). - The action resource.Dispose() is executed as this computation yields its result - or if the asynchronous computation exits by an exception or by cancellation. - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of use and use! in the - async { ... } computation expression syntax. - The resource to be used and disposed. - The function that takes the resource and returns an asynchronous - computation. - An asynchronous computation that binds and eventually disposes resource. - - - Creates an asynchronous computation that runs computation and returns its result. - If an exception happens then catchHandler(exn) is called and the resulting computation executed instead. - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of try/with in the - async { ... } computation expression syntax. - The input computation. - The function to run when computation throws an exception. - An asynchronous computation that executes computation and calls catchHandler if an - exception is thrown. - - - Creates an asynchronous computation that runs computation. The action compensation is executed - after computation completes, whether computation exits normally or by an exception. If compensation raises an exception itself - the original exception is discarded and the new exception becomes the overall result of the computation. - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of try/finally in the - async { ... } computation expression syntax. - The input computation. - The action to be run after computation completes or raises an - exception (including cancellation). - An asynchronous computation that executes computation and compensation aftewards or - when an exception is raised. - - - Delegates to the input computation. - - The existence of this method permits the use of return! in the - async { ... } computation expression syntax. - The input computation. - The input computation. - - - Creates an asynchronous computation that returns the result v. - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of return in the - async { ... } computation expression syntax. - The value to return from the computation. - An asynchronous computation that returns value when executed. - - - Creates an asynchronous computation that enumerates the sequence seq - on demand and runs body for each element. - - A cancellation check is performed on each iteration of the loop. - - The existence of this method permits the use of for in the - async { ... } computation expression syntax. - The sequence to enumerate. - A function to take an item from the sequence and create - an asynchronous computation. Can be seen as the body of the for expression. - An asynchronous computation that will enumerate the sequence and run body - for each element. - - - Creates an asynchronous computation that runs generator. - - A cancellation check is performed when the computation is executed. - The function to run. - An asynchronous computation that runs generator. - - - Creates an asynchronous computation that first runs computation1 - and then runs computation2, returning the result of computation2. - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of expression sequencing in the - async { ... } computation expression syntax. - The first part of the sequenced computation. - The second part of the sequenced computation. - An asynchronous computation that runs both of the computations sequentially. - - - Creates an asynchronous computation that runs computation, and when - computation generates a result T, runs binder res. - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of let! in the - async { ... } computation expression syntax. - The computation to provide an unbound result. - The function to bind the result of computation. - An asynchronous computation that performs a monadic bind on the result - of computation. - - - - Generate an object used to build asynchronous computations using F# computation expressions. The value - 'async' is a pre-defined instance of this type. - - A cancellation check is performed when the computation is executed. - - - - The type of the async operator, used to build workflows for asynchronous computations. - - - Sends a reply to a PostAndReply message. - The value to send. - - - A handle to a capability to reply to a PostAndReply message. - - - A compositional asynchronous computation, which, when run, will eventually produce a value - of type T, or else raises an exception. - - Asynchronous computations are normally specified using an F# computation expression. - - When run, asynchronous computations have two modes: as a work item (executing synchronous - code), or as a wait item (waiting for an event or I/O completion). - - When run, asynchronous computations can be governed by CancellationToken. This can usually - be specified when the async computation is started. The associated CancellationTokenSource - may be used to cancel the asynchronous computation. Asynchronous computations built using - computation expressions can check the cancellation condition regularly. Synchronous - computations within an asynchronous computation do not automatically check this condition. - - - Publishes the event as a first class event value. - - - Triggers the event using the given parameters. - The parameters for the event. - - - Creates an event object suitable for implementing an arbitrary type of delegate. - The event object. - - - Event implementations for an arbitrary type of delegate. - - - Publishes an observation as a first class value. - - - Triggers an observation using the given parameters. - The event parameters. - - - Creates an observable object. - The created event. - - - Event implementations for the IEvent<_> type. - - - Publishes the event as a first class event value. - - - Triggers the event using the given sender object and parameters. The sender object may be null. - The object triggering the event. - The parameters for the event. - - - Creates an event object suitable for delegate types following the standard .NET Framework convention of a first 'sender' argument. - The created event. - - - Event implementations for a delegate types following the standard .NET Framework convention of a first 'sender' argument. - - - - - - A delegate type associated with the F# event type IEvent<_> - The object that fired the event. - The event arguments. - - - Remove a listener delegate from an event listener store. - The delegate to be removed from the event listener store. - - - Connect a handler delegate object to the event. A handler can - be later removed using RemoveHandler. The listener will - be invoked when the event is fired. - A delegate to be invoked when the event is fired. - - - First class event values for arbitrary delegate types. - - F# gives special status to member properties compatible with type IDelegateEvent and - tagged with the CLIEventAttribute. In this case the F# compiler generates approriate - CLI metadata to make the member appear to other CLI languages as a CLI event. - - - First-class listening points (i.e. objects that permit you to register a callback - activated when the event is triggered). - - - First class event values for CLI events conforming to CLI Framework standards. - - - The type of delayed computations. - - Use the values in the Lazy module to manipulate - values of this type, and the notation lazy expr to create values - of type . - - - Raises a timeout exception if a message not received in this amount of time. By default - no timeout is used. - - - Occurs when the execution of the agent results in an exception. - - - Occurs when the execution of the agent results in an exception. - - - Raises a timeout exception if a message not received in this amount of time. By default - no timeout is used. - - - Returns the number of unprocessed messages in the message queue of the agent. - - - Occurs when the execution of the agent results in an exception. - - - Scans for a message by looking through messages in arrival order until scanner - returns a Some value. Other messages remain in the queue. - - This method is for use within the body of the agent. For each agent, at most - one concurrent reader may be active, so no more than one concurrent call to - Receive, TryReceive, Scan and/or TryScan may be active. - The function to return None if the message is to be skipped - or Some if the message is to be processed and removed from the queue. - An optional timeout in milliseconds. Defaults to -1 which corresponds - to System.Threading.Timeout.Infinite. - An asynchronous computation that scanner built off the read message. - - - Waits for a message. This will consume the first message in arrival order. - - This method is for use within the body of the agent. - - Returns None if a timeout is given and the timeout is exceeded. - - This method is for use within the body of the agent. For each agent, at most - one concurrent reader may be active, so no more than one concurrent call to - Receive, TryReceive, Scan and/or TryScan may be active. - An optional timeout in milliseconds. Defaults to -1 which - corresponds to System.Threading.Timeout.Infinite. - An asynchronous computation that returns the received message or - None if the timeout is exceeded. - - - Like PostAndReply, but returns None if no reply within the timeout period. - The function to incorporate the AsyncReplyChannel into - the message to be sent. - An optional timeout parameter (in milliseconds) to wait for a reply message. - Defaults to -1 which corresponds to System.Threading.Timeout.Infinite. - The reply from the agent or None if the timeout expires. - - - Starts the agent. - - - Creates and starts an agent. The body function is used to generate the asynchronous - computation executed by the agent. - The function to produce an asynchronous computation that will be executed - as the read loop for the MailboxProcessor when Start is called. - An optional cancellation token for the body. - Defaults to Async.DefaultCancellationToken. - The created MailboxProcessor. - - - Scans for a message by looking through messages in arrival order until scanner - returns a Some value. Other messages remain in the queue. - - Returns None if a timeout is given and the timeout is exceeded. - - This method is for use within the body of the agent. For each agent, at most - one concurrent reader may be active, so no more than one concurrent call to - Receive, TryReceive, Scan and/or TryScan may be active. - The function to return None if the message is to be skipped - or Some if the message is to be processed and removed from the queue. - An optional timeout in milliseconds. Defaults to -1 which corresponds - to System.Threading.Timeout.Infinite. - An asynchronous computation that scanner built off the read message. - Thrown when the timeout is exceeded. - - - Waits for a message. This will consume the first message in arrival order. - - This method is for use within the body of the agent. - - This method is for use within the body of the agent. For each agent, at most - one concurrent reader may be active, so no more than one concurrent call to - Receive, TryReceive, Scan and/or TryScan may be active. - An optional timeout in milliseconds. Defaults to -1 which corresponds - to System.Threading.Timeout.Infinite. - An asynchronous computation that returns the received message. - Thrown when the timeout is exceeded. - - - Like AsyncPostAndReply, but returns None if no reply within the timeout period. - The function to incorporate the AsyncReplyChannel into - the message to be sent. - An optional timeout parameter (in milliseconds) to wait for a reply message. - Defaults to -1 which corresponds to System.Threading.Timeout.Infinite. - An asynchronous computation that will return the reply or None if the timeout expires. - - - Posts a message to an agent and await a reply on the channel, synchronously. - - The message is generated by applying buildMessage to a new reply channel - to be incorporated into the message. The receiving agent must process this - message and invoke the Reply method on this reply channel precisely once. - The function to incorporate the AsyncReplyChannel into - the message to be sent. - An optional timeout parameter (in milliseconds) to wait for a reply message. - Defaults to -1 which corresponds to System.Threading.Timeout.Infinite. - The reply from the agent. - - - Posts a message to an agent and await a reply on the channel, asynchronously. - - The message is generated by applying buildMessage to a new reply channel - to be incorporated into the message. The receiving agent must process this - message and invoke the Reply method on this reply channel precisely once. - The function to incorporate the AsyncReplyChannel into - the message to be sent. - An optional timeout parameter (in milliseconds) to wait for a reply message. - Defaults to -1 which corresponds to System.Threading.Timeout.Infinite. - An asychronous computation that will wait for the reply from the agent. - - - Posts a message to the message queue of the MailboxProcessor, asynchronously. - The message to post. - - - Creates an agent. The body function is used to generate the asynchronous - computation executed by the agent. This function is not executed until - Start is called. - The function to produce an asynchronous computation that will be executed - as the read loop for the MailboxProcessor when Start is called. - An optional cancellation token for the body. - Defaults to Async.DefaultCancellationToken. - The created MailboxProcessor. - - - A message-processing agent which executes an asynchronous computation. - - The agent encapsulates a message queue that supports multiple-writers and - a single reader agent. Writers send messages to the agent by using the Post - method and its variations. - - The agent may wait for messages using the Receive or TryReceive methods or - scan through all available messages using the Scan or TryScan method. - - - - - - Connects a listener function to the observable. The listener will - be invoked for each observation. The listener can be removed by - calling Dispose on the returned IDisposable object. - The function to be called for each observation. - An object that will remove the listener if disposed. - - - Permanently connects a listener function to the observable. The listener will - be invoked for each observation. - The function to be called for each observation. - - - Returns an asynchronous computation that will write the given bytes to the stream. - The buffer to write from. - An optional offset as a number of bytes in the stream. - An optional number of bytes to write to the stream. - An asynchronous computation that will write the given bytes to the stream. - Thrown when the sum of offset and count is longer than - the buffer length. - Thrown when offset or count is negative. - - - Returns an asynchronous computation that will read the given number of bytes from the stream. - The number of bytes to read. - An asynchronous computation that returns the read byte[] when run. - - - Returns an asynchronous computation that will read from the stream into the given buffer. - The buffer to read into. - An optional offset as a number of bytes in the stream. - An optional number of bytes to read from the stream. - An asynchronous computation that will read from the stream into the given buffer. - Thrown when the sum of offset and count is longer than - the buffer length. - Thrown when offset or count is negative. - - - A module of extension members providing asynchronous operations for some basic CLI types related to concurrency and I/O. - - - Returns a new event that triggers on the second and subsequent triggerings of the input event. - The Nth triggering of the input event passes the arguments from the N-1th and Nth triggering as - a pair. The argument passed to the N-1th triggering is held in hidden internal state until the - Nth triggering occurs. - The input event. - An event that triggers on pairs of consecutive values passed from the source event. - - - Runs the given function each time the given event is triggered. - The function to call when the event is triggered. - The input event. - - - Returns a new event consisting of the results of applying the given accumulating function - to successive values triggered on the input event. An item of internal state - records the current value of the state parameter. The internal state is not locked during the - execution of the accumulation function, so care should be taken that the - input IEvent not triggered by multiple threads simultaneously. - The function to update the state with each event value. - The initial state. - The input event. - An event that fires on the updated state values. - - - Returns a new event which fires on a selection of messages from the original event. - The selection function takes an original message to an optional new message. - The function to select and transform event values to pass on. - The input event. - An event that fires only when the chooser returns Some. - - - Returns a new event that listens to the original event and triggers the - first resulting event if the application of the function to the event arguments - returned a Choice1Of2, and the second event if it returns a Choice2Of2. - The function to transform event values into one of two types. - The input event. - A tuple of events. The first fires whenever splitter evaluates to Choice1of1 and - the second fires whenever splitter evaluates to Choice2of2. - - - Returns a new event that listens to the original event and triggers the - first resulting event if the application of the predicate to the event arguments - returned true, and the second event if it returned false. - The function to determine which output event to trigger. - The input event. - A tuple of events. The first is triggered when the predicate evaluates to true - and the second when the predicate evaluates to false. - - - Returns a new event that listens to the original event and triggers the resulting - event only when the argument to the event passes the given function. - The function to determine which triggers from the event to propagate. - The input event. - An event that only passes values that pass the predicate. - - - Returns a new event that passes values transformed by the given function. - The function to transform event values. - The input event. - An event that passes the transformed values. - - - Fires the output event when either of the input events fire. - The first input event. - The second input event. - An event that fires when either of the input events fire. - - - - - - Forces the execution of this value and return its result. Same as Value. Mutual exclusion is used to - prevent other threads also computing the value. - The value of the Lazy object. - - - Creates a lazy computation that evaluates to the given value when forced. - The input value. - The created Lazy object. - - - Creates a lazy computation that evaluates to the result of the given function when forced. - The function to provide the value when needed. - The created Lazy object. - - - Extensions related to Lazy values. - - - Returns a new observable that triggers on the second and subsequent triggerings of the input observable. - The Nth triggering of the input observable passes the arguments from the N-1th and Nth triggering as - a pair. The argument passed to the N-1th triggering is held in hidden internal state until the - Nth triggering occurs. - - For each observer, the registered intermediate observing object is not thread safe. - That is, observations arising from the source must not be triggered concurrently - on different threads. - The input Observable. - An Observable that triggers on successive pairs of observations from the input Observable. - - - Creates an observer which subscribes to the given observable and which calls - the given function for each observation. - The function to be called on each observation. - The input Observable. - An object that will remove the callback if disposed. - - - Creates an observer which permanently subscribes to the given observable and which calls - the given function for each observation. - The function to be called on each observation. - The input Observable. - - - Returns an observable which, for each observer, allocates an item of state - and applies the given accumulating function to successive values arising from - the input. The returned object will trigger observations for each computed - state value, excluding the initial value. The returned object propagates - all errors arising from the source and completes when the source completes. - - For each observer, the registered intermediate observing object is not thread safe. - That is, observations arising from the source must not be triggered concurrently - on different threads. - The function to update the state with each observation. - The initial state. - The input Observable. - An Observable that triggers on the updated state values. - - - Returns an observable which chooses a projection of observations from the source - using the given function. The returned object will trigger observations x - for which the splitter returns Some x. The returned object also propagates - all errors arising from the source and completes when the source completes. - The function that returns Some for observations to be propagated - and None for observations to ignore. - The input Observable. - An Observable that only propagates some of the observations from the source. - - - Returns two observables which split the observations of the source by the - given function. The first will trigger observations x for which the - splitter returns Choice1Of2 x. The second will trigger observations - y for which the splitter returns Choice2Of2 y The splitter is - executed once for each subscribed observer. Both also propagate error - observations arising from the source and each completes when the source - completes. - The function that takes an observation an transforms - it into one of the two output Choice types. - The input Observable. - A tuple of Observables. The first triggers when splitter returns Choice1of2 - and the second triggers when splitter returns Choice2of2. - - - Returns two observables which partition the observations of the source by - the given function. The first will trigger observations for those values - for which the predicate returns true. The second will trigger observations - for those values where the predicate returns false. The predicate is - executed once for each subscribed observer. Both also propagate all error - observations arising from the source and each completes when the source - completes. - The function to determine which output Observable will trigger - a particular observation. - The input Observable. - A tuple of Observables. The first triggers when the predicate returns true, and - the second triggers when the predicate returns false. - - - Returns an observable which filters the observations of the source - by the given function. The observable will see only those observations - for which the predicate returns true. The predicate is executed once for - each subscribed observer. The returned object also propagates error - observations arising from the source and completes when the source completes. - The function to apply to observations to determine if it should - be kept. - The input Observable. - An Observable that filters observations based on filter. - - - Returns an observable which transforms the observations of the source by the - given function. The transformation function is executed once for each - subscribed observer. The returned object also propagates error observations - arising from the source and completes when the source completes. - The function applied to observations from the source. - The input Observable. - An Observable of the type specified by mapping. - - - Returns an observable for the merged observations from the sources. - The returned object propagates success and error values arising - from either source and completes when both the sources have completed. - - For each observer, the registered intermediate observing object is not - thread safe. That is, observations arising from the sources must not - be triggered concurrently on different threads. - The first Observable. - The second Observable. - An Observable that propagates information from both sources. - - - Basic operations on first class event and other observable objects. - - - Returns an asynchronous computation that, when run, will wait for a response to the given WebRequest. - An asynchronous computation that waits for response to the WebRequest. - - - A module of extension members providing asynchronous operations for some basic Web operations. - - - Creates an instance of the attribute - AbstractClassAttribute - - - Adding this attribute to class definition makes it abstract, which means it need not - implement all its methods. Instances of abstract classes may not be constructed directly. - - - Creates an instance of the attribute - AllowNullLiteralAttribute - - - Adding this attribute to a type lets the 'null' literal be used for the type - within F# code. This attribute may only be added to F#-defined class or - interface types. - - - Indicates the namespace or module to be automatically opened when an assembly is referenced - or an enclosing module opened. - - - Creates an attribute used to mark a namespace or module path to be 'automatically opened' when an assembly is referenced - The namespace or module to be automatically opened when an assembly is referenced - or an enclosing module opened. - AutoOpenAttribute - - - Creates an attribute used to mark a module as 'automatically opened' when the enclosing namespace is opened - AutoOpenAttribute - - - This attribute is used for two purposes. When applied to an assembly, it must be given a string - argument, and this argument must indicate a valid module or namespace in that assembly. Source - code files compiled with a reference to this assembly are processed in an environment - where the given path is automatically opened. - - When applied to a module within an assembly, then the attribute must not be given any arguments. - When the enclosing namespace is opened in user source code, the module is also implicitly opened. - - - The value of the attribute, indicating whether the type is automatically marked serializable or not - - - Creates an instance of the attribute - Indicates whether the type should be serializable by default. - AutoSerializableAttribute - - - Adding this attribute to a type with value 'false' disables the behaviour where F# makes the - type Serializable by default. - - - Creates an instance of the attribute - CLIEventAttribute - - - Adding this attribute to a property with event type causes it to be compiled with as a CLI - metadata event, through a syntactic translation to a pair of 'add_EventName' and - 'remove_EventName' methods. - - - Creates an instance of the attribute - CLIMutableAttribute - - - Adding this attribute to a record type causes it to be compiled to a CLI representation - with a default constructor with property getters and setters. - - - Choice 2 of 2 choices - - - Choice 1 of 2 choices - - - Helper types for active patterns with 2 choices. - - - Choice 3 of 3 choices - - - Choice 2 of 3 choices - - - Choice 1 of 3 choices - - - Helper types for active patterns with 3 choices. - - - Choice 4 of 4 choices - - - Choice 3 of 4 choices - - - Choice 2 of 4 choices - - - Choice 1 of 4 choices - - - Helper types for active patterns with 4 choices. - - - Choice 5 of 5 choices - - - Choice 4 of 5 choices - - - Choice 3 of 5 choices - - - Choice 2 of 5 choices - - - Choice 1 of 5 choices - - - Helper types for active patterns with 5 choices. - - - Choice 6 of 6 choices - - - Choice 5 of 6 choices - - - Choice 4 of 6 choices - - - Choice 3 of 6 choices - - - Choice 2 of 6 choices - - - Choice 1 of 6 choices - - - Helper types for active patterns with 6 choices. - - - Choice 7 of 7 choices - - - Choice 6 of 7 choices - - - Choice 5 of 7 choices - - - Choice 4 of 7 choices - - - Choice 3 of 7 choices - - - Choice 2 of 7 choices - - - Choice 1 of 7 choices - - - Helper types for active patterns with 7 choices. - - - Creates an instance of the attribute - ClassAttribute - - - Adding this attribute to a type causes it to be represented using a CLI class. - - - Creates an instance of the attribute - ComparisonConditionalOnAttribute - - - This attribute is used to indicate a generic container type satisfies the F# 'comparison' - constraint only if a generic argument also satisfies this constraint. For example, adding - this attribute to parameter 'T on a type definition C<'T> means that a type C<X> only supports - comparison if the type X also supports comparison and all other conditions for C<X> to support - comparison are also met. The type C<'T> can still be used with other type arguments, but a type such - as C<(int -> int)> will not support comparison because the type (int -> int) is an F# function type - and does not support comparison. - - This attribute will be ignored if it is used on the generic parameters of functions or methods. - - - Indicates the number of arguments in each argument group - - - Creates an instance of the attribute - Indicates the number of arguments in each argument group. - CompilationArgumentCountsAttribute - - - This attribute is generated automatically by the F# compiler to tag functions and members - that accept a partial application of some of their arguments and return a residual function - - - Indicates the variant number of the entity, if any, in a linear sequence of elements with F# source code - - - Indicates the relationship between the compiled entity and F# source code - - - Indicates the sequence number of the entity, if any, in a linear sequence of elements with F# source code - - - Creates an instance of the attribute - Indicates the type of source construct. - CompilationMappingAttribute - - - Creates an instance of the attribute - Indicates the type of source construct. - CompilationMappingAttribute - - - Creates an instance of the attribute - Indicates the type of source construct. - CompilationMappingAttribute - - - This attribute is inserted automatically by the F# compiler to tag types - and methods in the generated CLI code with flags indicating the correspondence - with original source constructs. It is used by the functions in the - Microsoft.FSharp.Reflection namespace to reverse-map compiled constructs to - their original forms. It is not intended for use from user code. - - - Indicates one or more adjustments to the compiled representation of an F# type or member - - - Creates an instance of the attribute - Indicates adjustments to the compiled representation of the type or member. - CompilationRepresentationAttribute - - - This attribute is used to adjust the runtime representation for a type. - For example, it may be used to note that the null representation - may be used for a type. This affects how some constructs are compiled. - - - Compile a property as a CLI event. - - - Permit the use of null as a representation for nullary discriminators in a discriminated union. - - - append 'Module' to the end of a module whose name clashes with a type name in the same namespace. - - - Compile a member as 'instance' even if null is used as a representation for this type. - - - Compile an instance member as 'static' . - - - No special compilation representation. - - - - - - Indicates one or more adjustments to the compiled representation of an F# type or member. - - - Indicates the name of the entity in F# source code - - - Creates an instance of the attribute - The name of the method in source. - CompilationSourceNameAttribute - - - This attribute is inserted automatically by the F# compiler to tag - methods which are given the 'CompiledName' attribute. It is not intended - for use from user code. - - - The name of the value as it appears in compiled code - - - Creates an instance of the attribute - The name to use in compiled code. - CompiledNameAttribute - - - Adding this attribute to a value or function definition in an F# module changes the name used - for the value in compiled CLI code. - - - Indicates if the construct should always be hidden in an editing environment. - - - Indicates if the message should indicate a compiler error. Error numbers less than - 10000 are considered reserved for use by the F# compiler and libraries. - - - Indicates the number associated with the message. - - - Indicates the warning message to be emitted when F# source code uses this construct - - - Indicates if the construct should always be hidden in an editing environment. - - - Indicates if the message should indicate a compiler error. Error numbers less than - 10000 are considered reserved for use by the F# compiler and libraries. - - - Creates an instance of the attribute. - - - Indicates that a message should be emitted when F# source code uses this construct. - - - Creates an instance of the attribute - CustomComparisonAttribute - - - Adding this attribute to a type indicates it is a type with a user-defined implementation of comparison. - - - Creates an instance of the attribute - CustomEqualityAttribute - - - Adding this attribute to a type indicates it is a type with a user-defined implementation of equality. - - - Indicates if the custom operation maintains the variable space of the query of computation expression through the use of a bind operation - - - Indicates if the custom operation maintains the variable space of the query of computation expression - - - Indicates the name used for the 'on' part of the custom query operator for join-like operators - - - Indicates if the custom operation is an operation similar to a zip in a sequence computation, supporting two inputs - - - Indicates if the custom operation is an operation similar to a join in a sequence computation, supporting two inputs and a correlation constraint - - - Indicates if the custom operation is an operation similar to a group join in a sequence computation, supporting two inputs and a correlation constraint, and generating a group - - - Indicates if the custom operation supports the use of 'into' immediately after the use of the operation in a query or other computation expression to consume the results of the operation - - - Get the name of the custom operation when used in a query or other computation expression - - - Indicates if the custom operation maintains the variable space of the query of computation expression through the use of a bind operation - - - Indicates if the custom operation maintains the variable space of the query of computation expression - - - Indicates the name used for the 'on' part of the custom query operator for join-like operators - - - Indicates if the custom operation is an operation similar to a zip in a sequence computation, supporting two inputs - - - Indicates if the custom operation is an operation similar to a join in a sequence computation, supporting two inputs and a correlation constraint - - - Indicates if the custom operation is an operation similar to a group join in a sequence computation, supporting two inputs and a correlation constraint, and generating a group - - - Indicates if the custom operation supports the use of 'into' immediately after the use of the operation in a query or other computation expression to consume the results of the operation - - - Creates an instance of the attribute - CustomOperationAttribute - - - - Indicates that a member on a computation builder type is a custom query operator, - and indicates the name of that operator. - - - - The value of the attribute, indicating whether the type has a default augmentation or not - - - Creates an instance of the attribute - Indicates whether to generate helper members on the CLI class representing a discriminated - union. - DefaultAugmentationAttribute - - - Adding this attribute to a discriminated union with value false - turns off the generation of standard helper member tester, constructor - and accessor members for the generated CLI class for that type. - - - Indicates if a constraint is asserted that the field type supports 'null' - - - Creates an instance of the attribute - Indicates whether to assert that the field type supports null. - DefaultValueAttribute - - - Creates an instance of the attribute - DefaultValueAttribute - - - Adding this attribute to a field declaration means that the field is - not initialized. During type checking a constraint is asserted that the field type supports 'null'. - If the 'check' value is false then the constraint is not asserted. - - - Creates an instance of the attribute - EntryPointAttribute - - - Adding this attribute to a function indicates it is the entrypoint for an application. - If this attribute is not specified for an EXE then the initialization implicit in the - module bindings in the last file in the compilation sequence are used as the entrypoint. - - - Creates an instance of the attribute - EqualityConditionalOnAttribute - - - This attribute is used to indicate a generic container type satisfies the F# 'equality' - constraint only if a generic argument also satisfies this constraint. For example, adding - this attribute to parameter 'T on a type definition C<'T> means that a type C<X> only supports - equality if the type X also supports equality and all other conditions for C<X> to support - equality are also met. The type C<'T> can still be used with other type arguments, but a type such - as C<(int -> int)> will not support equality because the type (int -> int) is an F# function type - and does not support equality. - - This attribute will be ignored if it is used on the generic parameters of functions or methods. - - - Indicates the warning message to be emitted when F# source code uses this construct - - - Creates an instance of the attribute - The warning message to be emitted when code uses this construct. - ExperimentalAttribute - - - This attribute is used to tag values that are part of an experimental library - feature. - - - Invoke an F# first class function value with two curried arguments. In some cases this - will result in a more efficient application than applying the arguments successively. - The input function. - The first arg. - The second arg. - The function result. - - - Invoke an F# first class function value with three curried arguments. In some cases this - will result in a more efficient application than applying the arguments successively. - The input function. - The first arg. - The second arg. - The third arg. - The function result. - - - Invoke an F# first class function value with four curried arguments. In some cases this - will result in a more efficient application than applying the arguments successively. - The input function. - The first arg. - The second arg. - The third arg. - The fourth arg. - The function result. - - - Invoke an F# first class function value with five curried arguments. In some cases this - will result in a more efficient application than applying the arguments successively. - The input function. - The first arg. - The second arg. - The third arg. - The fourth arg. - The fifth arg. - The function result. - - - Invoke an F# first class function value with one argument - - 'U - - - Construct an instance of an F# first class function value - The created F# function. - - - The CLI type used to represent F# function values. This type is not - typically used directly, though may be used from other CLI languages. - - - The release number of the F# version associated with the attribute - - - The minor version number of the F# version associated with the attribute - - - The major version number of the F# version associated with the attribute - - - Creates an instance of the attribute - The major version number. - The minor version number. - The release number. - FSharpInterfaceDataVersionAttribute - - - This attribute is added to generated assemblies to indicate the - version of the data schema used to encode additional F# - specific information in the resource attached to compiled F# libraries. - - - Specialize the type function at a given type - The specialized type. - - - Construct an instance of an F# first class type function value - FSharpTypeFunc - - - The CLI type used to represent F# first-class type function values. This type is for use - by compiled F# code. - - - Type of a formatting expression. - Function type generated by printf. - Type argument passed to %a formatters - Value generated by the overall printf action (e.g. sprint generates a string) - Value generated after post processing (e.g. failwithf generates a string internally then raises an exception) - - - Type of a formatting expression. - Function type generated by printf. - Type argument passed to %a formatters - Value generated by the overall printf action (e.g. sprint generates a string) - Value generated after post processing (e.g. failwithf generates a string internally then raises an exception) - Tuple of values generated by scan or match. - - - Convert the given Action delegate object to an F# function value - The input action. - The F# function. - - - A utility function to convert function values from tupled to curried form - The input tupled function. - The output curried function. - - - A utility function to convert function values from tupled to curried form - The input tupled function. - The output curried function. - - - A utility function to convert function values from tupled to curried form - The input tupled function. - The output curried function. - - - A utility function to convert function values from tupled to curried form - The input tupled function. - The output curried function. - - - Helper functions for converting F# first class function values to and from CLI representaions - of functions using delegates. - - - Creates an instance of the attribute - GeneralizableValueAttribute - - - Adding this attribute to a non-function value with generic parameters indicates that - uses of the construct can give rise to generic code through type inference. - - - Creates an instance of the attribute - InterfaceAttribute - - - Adding this attribute to a type causes it to be represented using a CLI interface. - - - Creates an instance of the attribute - LiteralAttribute - - - Adding this attribute to a value causes it to be compiled as a CLI constant literal. - - - Creates an instance of the attribute - MeasureAnnotatedAbbreviationAttribute - - - Adding this attribute to a type causes it to be interpreted as a refined type, currently limited to measure-parameterized types. - This may only be used under very limited conditions. - - - Creates an instance of the attribute - MeasureAttribute - - - Adding this attribute to a type causes it to be interpreted as a unit of measure. - This may only be used under very limited conditions. - - - Creates an instance of the attribute - NoComparisonAttribute - - - Adding this attribute to a type indicates it is a type where comparison is an abnormal operation. - This means that the type does not satisfy the F# 'comparison' constraint. Within the bounds of the - F# type system, this helps ensure that the F# generic comparison function is not instantiated directly - at this type. The attribute and checking does not constrain the use of comparison with base or child - types of this type. - - - Creates an instance of the attribute - NoDynamicInvocationAttribute - - - This attribute is used to tag values that may not be dynamically invoked at runtime. This is - typically added to inlined functions whose implementations include unverifiable code. It - causes the method body emitted for the inlined function to raise an exception if - dynamically invoked, rather than including the unverifiable code in the generated - assembly. - - - Creates an instance of the attribute - NoEqualityAttribute - - - Adding this attribute to a type indicates it is a type where equality is an abnormal operation. - This means that the type does not satisfy the F# 'equality' constraint. Within the bounds of the - F# type system, this helps ensure that the F# generic equality function is not instantiated directly - at this type. The attribute and checking does not constrain the use of comparison with base or child - types of this type. - - - The representation of "Value of type 'T" - The input value. - An option representing the value. - - - The representation of "No value" - - - Get the value of a 'Some' option. A NullReferenceException is raised if the option is 'None'. - - - Create an option value that is a 'None' value. - - - Return 'true' if the option is a 'Some' value. - - - Return 'true' if the option is a 'None' value. - - - Create an option value that is a 'Some' value. - The input value - An option representing the value. - - - The type of optional values. When used from other CLI languages the - empty option is the null value. - - Use the constructors Some and None to create values of this type. - Use the values in the Option module to manipulate values of this type, - or pattern match against the values directly. - - None values will appear as the value null to other CLI languages. - Instance methods on this type will appear as static methods to other CLI languages - due to the use of null as a value representation. - - - Creates an instance of the attribute - OptionalArgumentAttribute - - - This attribute is added automatically for all optional arguments. - - - The raw text of the format string. - - - Construct a format string - The input string. - The PrintfFormat containing the formatted result. - - - Type of a formatting expression. - Function type generated by printf. - Type argument passed to %a formatters - Value generated by the overall printf action (e.g. sprint generates a string) - Value generated after post processing (e.g. failwithf generates a string internally then raises an exception) - - - Construct a format string - The input string. - The created format string. - - - Type of a formatting expression. - Function type generated by printf. - Type argument passed to %a formatters - Value generated by the overall printf action (e.g. sprint generates a string) - Value generated after post processing (e.g. failwithf generates a string internally then raises an exception) - Tuple of values generated by scan or match. - - - Creates an instance of the attribute - ProjectionParameterAttribute - - - Indicates that, when a custom operator is used in a computation expression, - a parameter is automatically parameterized by the variable space of the computation expression - - - - The current value of the reference cell - - - - The current value of the reference cell - - - The current value of the reference cell - - - The type of mutable references. Use the functions [:=] and [!] to get and - set values of this type. - - - Creates an instance of the attribute - ReferenceEqualityAttribute - - - Adding this attribute to a record or union type disables the automatic generation - of overrides for 'System.Object.Equals(obj)', 'System.Object.GetHashCode()' - and 'System.IComparable' for the type. The type will by default use reference equality. - - - Creates an instance of the attribute - ReflectedDefinitionAttribute - - - Adding this attribute to the let-binding for the definition of a top-level - value makes the quotation expression that implements the value available - for use at runtime. - - - Creates an instance of the attribute - RequireQualifiedAccessAttribute - - - This attribute is used to indicate that references to the elements of a module, record or union - type require explicit qualified access. - - - Creates an instance of the attribute - RequiresExplicitTypeArgumentsAttribute - - - Adding this attribute to a type, value or member requires that - uses of the construct must explicitly instantiate any generic type parameters. - - - The value of the attribute, indicating whether the type is sealed or not. - - - Creates an instance of the attribute - Indicates whether the class is sealed. - SealedAttribute - - - Creates an instance of the attribute. - The created attribute. - - - Adding this attribute to class definition makes it sealed, which means it may not - be extended or implemented. - - - Indicates that the compiled entity had private or internal representation in F# source code. - - - The mask of values related to the kind of the compiled entity. - - - Indicates that the compiled entity is part of the representation of an F# value declaration. - - - Indicates that the compiled entity is part of the representation of an F# union case declaration. - - - Indicates that the compiled entity is part of the representation of an F# module declaration. - - - Indicates that the compiled entity is part of the representation of an F# closure. - - - Indicates that the compiled entity is part of the representation of an F# exception declaration. - - - Indicates that the compiled entity is part of the representation of an F# record or union case field declaration. - - - Indicates that the compiled entity is part of the representation of an F# class or other object type declaration. - - - Indicates that the compiled entity is part of the representation of an F# record type declaration. - - - Indicates that the compiled entity is part of the representation of an F# union type declaration. - - - Indicates that the compiled entity has no relationship to an element in F# source code. - - - - - - Indicates the relationship between a compiled entity in a CLI binary and an element in F# source code. - - - Creates an instance of the attribute - StructAttribute - - - Adding this attribute to a type causes it to be represented using a CLI struct. - - - Creates an instance of the attribute - StructuralComparisonAttribute - - - Adding this attribute to a record, union, exception, or struct type confirms the - automatic generation of implementations for 'System.IComparable' for the type. - - - Creates an instance of the attribute - StructuralEqualityAttribute - - - Adding this attribute to a record, union or struct type confirms the automatic - generation of overrides for 'System.Object.Equals(obj)' and - 'System.Object.GetHashCode()' for the type. - - - Indicates the text to display by default when objects of this type are displayed - using '%A' printf formatting patterns and other two-dimensional text-based display - layouts. - - - Creates an instance of the attribute - Indicates the text to display when using the '%A' printf formatting. - StructuredFormatDisplayAttribute - - - 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 this version of F# the only valid values are of the form PreText {PropertyName} PostText. - The property name indicates a property to evaluate and to display instead of the object itself. - - - The type 'unit', which has only one value "()". This value is special and - always uses the representation 'null'. - - - Creates an instance of the attribute - UnverifiableAttribute - - - This attribute is used to tag values whose use will result in the generation - of unverifiable code. These values are inevitably marked 'inline' to ensure that - the unverifiable constructs are not present in the actual code for the F# library, - but are rather copied to the source code of the caller. - - - Creates an instance of the attribute - VolatileFieldAttribute - - - Adding this attribute to an F# mutable binding causes the "volatile" - prefix to be used for all accesses to the field. - - - Four dimensional arrays, typically zero-based. Non-zero-based arrays - can be created using methods on the System.Array type. - - Use the values in the Array4D module - to manipulate values of this type, or the notation arr.[x1,x2,x3,x4] to get and set array - values. - - - Three dimensional arrays, typically zero-based. Non-zero-based arrays - can be created using methods on the System.Array type. - - Use the values in the Array3D module - to manipulate values of this type, or the notation arr.[x1,x2,x3] to get and set array - values. - - - Two dimensional arrays, typically zero-based. - - Use the values in the Array2D module - to manipulate values of this type, or the notation arr.[x,y] to get/set array - values. - - Non-zero-based arrays can also be created using methods on the System.Array type. - - - Single dimensional, zero-based arrays, written int[], string[] etc. - Use the values in the Array module to manipulate values - of this type, or the notation arr.[x] to get/set array - values. - - - Single dimensional, zero-based arrays, written int[], string[] etc. - - Use the values in the Array module to manipulate values - of this type, or the notation arr.[x] to get/set array - values. - - - - - - An abbreviation for the CLI type System.Boolean. - - - Represents a managed pointer in F# code. - - - An abbreviation for the CLI type System.Byte. - - - An abbreviation for the CLI type System.Char. - - - An abbreviation for the CLI type System.Decimal. - - - The type of decimal numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.Decimal. - - - An abbreviation for the CLI type System.Double. - - - An abbreviation for the CLI type System.Exception. - - - An abbreviation for the CLI type System.Double. - - - An abbreviation for the CLI type System.Single. - - - The type of floating point numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.Single. - - - The type of floating point numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.Double. - - - This type is for internal use by the F# code generator. - - - An abbreviation for the CLI type System.Int32. - - - An abbreviation for the CLI type System.Int16. - - - The type of 16-bit signed integer numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.Int16. - - - An abbreviation for the CLI type System.Int32. - - - An abbreviation for the CLI type System.Int64. - - - The type of 64-bit signed integer numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.Int64. - - - An abbreviation for the CLI type System.SByte. - - - The type of 32-bit signed integer numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.Int32. - - - An abbreviation for the CLI type System.IntPtr. - - - Represents an unmanaged pointer in F# code. - - This type should only be used when writing F# code that interoperates - with native code. Use of this type in F# code may result in - unverifiable code being generated. Conversions to and from the - nativeint type may be required. Values of this type can be generated - by the functions in the NativeInterop.NativePtr module. - - - An abbreviation for the CLI type System.Object. - - - The type of optional values. When used from other CLI languages the - empty option is the null value. - - Use the constructors Some and None to create values of this type. - Use the values in the Option module to manipulate values of this type, - or pattern match against the values directly. - - 'None' values will appear as the value null to other CLI languages. - Instance methods on this type will appear as static methods to other CLI languages - due to the use of null as a value representation. - - - The type of mutable references. Use the functions [:=] and [!] to get and - set values of this type. - - - An abbreviation for the CLI type System.SByte. - - - The type of 8-bit signed integer numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.SByte. - - - An abbreviation for the CLI type System.Single. - - - An abbreviation for the CLI type System.String. - - - An abbreviation for the CLI type System.UInt16. - - - An abbreviation for the CLI type System.UInt32. - - - An abbreviation for the CLI type System.UInt64. - - - An abbreviation for the CLI type System.Byte. - - - An abbreviation for the CLI type System.UIntPtr. - - - The type 'unit', which has only one value "()". This value is special and - always uses the representation 'null'. - - - - - - - - - - - - Non-exhaustive match failures will raise the MatchFailureException exception - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - A new enumerator for the sequence. - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - A reference to the sequence. - - A 0, 1, and 2 respectively indicate Stop, Yield, and Goto conditions for the sequence generator. - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - A new sequence generator for the expression. - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - - - Namespace name the provider injects types into. - - - - - Compilers call this method to query a type provider for a type name. - - Resolver should return a type called name in namespace NamespaceName or null if the type is unknown. - - - - - - The top-level types - - - - - - The sub-namespaces in this namespace. An optional member to prevent generation of namespaces until an outer namespace is explored. - - - - - - - - Triggered when an assumption changes that invalidates the resolutions so far reported by the provider - - - - - Triggered when an assumption changes that invalidates the resolutions so far reported by the provider - - - - - Triggered when an assumption changes that invalidates the resolutions so far reported by the provider - - - - - Get the static parameters for a provided type. - - A type returned by GetTypes or ResolveTypeName - - - - - Namespace name the this TypeProvider injects types into. - - - - - Called by the compiler to ask for an Expression tree to replace the given MethodBase with. - - MethodBase that was given to the compiler by a type returned by a GetType(s) call. - Expressions that represent the parameters to this call. - An expression that the compiler will use in place of the given method base. - - - - Get the physical contents of the given logical provided assembly. - - - - - Apply static arguments to a provided type that accepts static arguments. - - The provider must return a type with the given mangled name. - the provided type definition which has static parameters - the full path of the type, including encoded representations of static parameters - the static parameters, indexed by name - - - - - - - Represents the inverse of a measure expressions when returned as a generic argument of a provided type. - - - Represents the '1' measure expression when returned as a generic argument of a provided type. - - - Represents the product of two measure expressions when returned as a generic argument of a provided type. - - - - - - Creates an instance of the attribute - TypeProviderAssemblyAttribute - The name of the design-time assembly for this type provider. - - - Creates an instance of the attribute - TypeProviderAssemblyAttribute - - - Place attribute on runtime assembly to indicate that there is a corresponding design-time - assembly that contains a type provider. Runtime and designer assembly may be the same. - - - Creates an instance of the attribute - TypeProviderAttribute - - - Place on a class that implements ITypeProvider to extend the compiler - - - - Get the full path to use for temporary files for the type provider instance. - - - - - version of referenced system runtime assembly - - - - - Get the full path to referenced assembly that caused this type provider instance to be created. - - - - - Get the full path to use to resolve relative paths in any file name arguments given to the type provider instance. - - - - - Get the referenced assemblies for the type provider instance. - - - - - Indicates if the type provider host responds to invalidation events for type provider instances. - - - - - Indicates if the type provider instance is used in an environment which executes provided code such as F# Interactive. - - - - - Get the full path to use for temporary files for the type provider instance. - - - - - version of referenced system runtime assembly - - - - - Get the full path to referenced assembly that caused this type provider instance to be created. - - - - - Get the full path to use to resolve relative paths in any file name arguments given to the type provider instance. - - - - - Get the referenced assemblies for the type provider instance. - - - - - Indicates if the type provider host responds to invalidation events for type provider instances. - - - - - Indicates if the type provider instance is used in an environment which executes provided code such as F# Interactive. - - - - - Checks if given type exists in target system runtime library - - - - - - - - If the class that implements ITypeProvider has a constructor that accepts TypeProviderConfig - then it will be constructed with an instance of TypeProviderConfig. - - - - - - - - - - - - - - - - - - - - - - - - - - - - Creates an instance of the attribute - TypeProviderEditorHideMethodsAttribute - - - Indicates that a code editor should hide all System.Object methods from the intellisense menus for instances of a provided type - - - - - - - - - - - - Additional type attribute flags related to provided types - - - - - - Creates an instance of the attribute - TypeProviderXmlDocAttribute - - - - The TypeProviderXmlDocAttribute attribute can be added to types and members. - The language service will display the CommentText property from the attribute - in the appropriate place when the user hovers over a type or member. - - - - - - - - - - - - - - - - Creates an anonymous event with the given handlers. - - A function to handle adding a delegate for the event to trigger. - A function to handle removing a delegate that the event triggers. - A function to produce the delegate type the event can trigger. - - The initialized event. - - - The F# compiler emits calls to this function to implement the use operator for F# sequence - expressions. - - The resource to be used and disposed. - The input sequence. - - The result sequence. - - - The F# compiler emits calls to this function to implement the compiler-intrinsic - conversions from untyped System.Collections.IEnumerable sequences to typed sequences. - - An initializer function. - A function to iterate and test if end of sequence is reached. - A function to retrieve the current element. - - The resulting typed sequence. - - - The F# compiler emits calls to this function to - implement the try/finally operator for F# sequence expressions. - - The input sequence. - A computation to be included in an enumerator's Dispose method. - - The result sequence. - - - The F# compiler emits calls to this function to - implement the while operator for F# sequence expressions. - - A function that indicates whether iteration should continue. - The input sequence. - - The result sequence. - - - A group of functions used as part of the compiled representation of F# sequence expressions. - - - Builds a query using query syntax and operators. - - - An active pattern to force the execution of values of type Lazy<_>. - - - Special prefix operator for splicing untyped expressions into quotation holes. - - - Special prefix operator for splicing typed expressions into quotation holes. - - - Builds a 2D array from a sequence of sequences of elements. - - - Builds a read-only lookup table from a sequence of key/value pairs. The key objects are indexed using generic hashing and equality. - - - Converts the argument to signed byte. - This is a direct conversion for all - primitive numeric types. For strings, the input is converted using SByte.Parse() with InvariantCulture settings. - Otherwise the operation requires and invokes a ToSByte method on the input type. - - - Converts the argument to byte. - This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Byte.Parse() on strings and otherwise requires a ToByte method on the input type. - - - Converts the argument to 64-bit float. - This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Double.Parse() with InvariantCulture settings. Otherwise the operation requires and invokes a ToDouble method on the input type. - - - Converts the argument to 32-bit float. - This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Single.Parse() with InvariantCulture settings. Otherwise the operation requires and invokes a ToSingle method on the input type. - - - Builds an aysnchronous workflow using computation expression syntax. - - - Builds a set from a sequence of objects. The objects are indexed using generic comparison. - The input sequence of elements. - The created set. - - - Print to a file using the given format, and add a newline. - The file TextWriter. - The formatter. - The formatted result. - - - Print to a file using the given format. - The file TextWriter. - The formatter. - The formatted result. - - - Print to a string buffer and raise an exception with the given - result. Helper printers must return strings. - The formatter. - The formatted result. - - - Print to a string using the given format. - The formatter. - The formatted result. - - - - - - Divides a value by an integer. - The input value. - The input int. - The division result. - - - - - - Resolves to the value 'one' for any primitive numeric type or any type with a static member called 'One' - - - Resolves to the zero value for any primitive numeric type or any type with a static member called 'Zero' - - - A compiler intrinsic that implements dynamic invocations for the DivideByInt primitive. - - - A compiler intrinsic that implements dynamic invocations to the checked '*' operator. - - - A compiler intrinsic that implements dynamic invocations to the '*' operator. - - - A compiler intrinsic that implements dynamic invocations to the checked '+' operator. - - - A compiler intrinsic that implements dynamic invocations to the '+' operator. - - - Resolves to the value 'one' for any primitive numeric type or any type with a static member called 'One'. - - - Resolves to the zero value for any primitive numeric type or any type with a static member called 'Zero'. - - - Parse an uint64 according to the rules used by the overloaded 'uint64' conversion operator when applied to strings - The input string. - The parsed value. - - - Parse an int64 according to the rules used by the overloaded 'int64' conversion operator when applied to strings - The input string. - The parsed value. - - - Parse an uint32 according to the rules used by the overloaded 'uint32' conversion operator when applied to strings - The input string. - The parsed value. - - - Parse an int32 according to the rules used by the overloaded 'int32' conversion operator when applied to strings - The input string. - The parsed value. - - - Creates an sbyte value with units-of-measure - The input sbyte. - The sbyte with units-of-measure. - - - Creates an int16 value with units-of-measure - The input int16. - The int16 with units-of-measure. - - - Creates an int64 value with units-of-measure - The input int64. - The int64 with units of measure. - - - Creates an int32 value with units-of-measure - The input int. - The int with units of measure. - - - Creates a decimal value with units-of-measure - The input decimal. - The decimal with units of measure. - - - Creates a float32 value with units-of-measure - The input float. - The float with units-of-measure. - - - Creates a float value with units-of-measure - The input float. - The float with units-of-measure. - - - Get the underlying value for an enum value - The input enum. - The enumeration as a value. - - - Build an enum value from an underlying value - The input value. - The value as an enumeration. - - - Recursively hash a part of a value according to its structure. - The comparison function. - The input object. - The hashed value. - - - Hash a value according to its structure. Use the given limit to restrict the hash when hashing F# - records, lists and union types. - The limit on the number of nodes. - The input object. - The hashed value. - - - Hash a value according to its structure. This hash is not limited by an overall node count when hashing F# - records, lists and union types. - The input object. - The hashed value. - - - Make an F# hash/equality object for the given type using node-limited hashing when hashing F# - records, lists and union types. - The input limit on the number of nodes. - System.Collections.Generic.IEqualityComparer<'T> - - - Make an F# hash/equality object for the given type - - - Make an F# comparer object for the given type, where it can be null if System.Collections.Generic.Comparer<'T>.Default - - - Make an F# comparer object for the given type - - - A static F# comparer object - - - Return an F# comparer object suitable for hashing and equality. This hashing behaviour - of the returned comparer is not limited by an overall node count when hashing F# - records, lists and union types. This equality comparer has equivalence - relation semantics ([nan] = [nan]). - - - Return an F# comparer object suitable for hashing and equality. This hashing behaviour - of the returned comparer is not limited by an overall node count when hashing F# - records, lists and union types. - - - The physical hash. Hashes on the object identity, except for value types, - where we hash on the contents. - The input object. - The hashed value. - - - Reference/physical equality. - True if the inputs are reference-equal, false otherwise. - The first value. - The second value. - The result of the comparison. - - - Take the maximum of two values structurally according to the order given by GenericComparison - The first value. - The second value. - The maximum value. - - - Take the minimum of two values structurally according to the order given by GenericComparison - The first value. - The second value. - The minimum value. - - - Compare two values - The first value. - The second value. - The result of the comparison. - - - Compare two values - The first value. - The second value. - The result of the comparison. - - - Compare two values - The first value. - The second value. - The result of the comparison. - - - Compare two values - The first value. - The second value. - The result of the comparison. - - - Compare two values. May be called as a recursive case from an implementation of System.IComparable to - ensure consistent NaN comparison semantics. - The function to compare the values. - The first value. - The second value. - The result of the comparison. - - - Compare two values - The first value. - The second value. - The result of the comparison. - - - Compare two values for equality - - The first value. - The second value. - The result of the comparison. - - - Compare two values for equality using equivalence relation semantics ([nan] = [nan]) - The first value. - The second value. - The result of the comparison. - - - Compare two values for equality using partial equivalence relation semantics ([nan] <> [nan]) - The first value. - The second value. - The result of the comparison. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - The F# compiler emits calls to some of the functions in this module as part of the compiled form of some language constructs - - - - The standard overloaded associative (4-indexed) mutation operator - - - - The standard overloaded associative (3-indexed) mutation operator - - - The standard overloaded associative (2-indexed) mutation operator - - - The standard overloaded associative (indexed) mutation operator - - - The standard overloaded associative (4-indexed) lookup operator - - - The standard overloaded associative (3-indexed) lookup operator - - - The standard overloaded associative (2-indexed) lookup operator - - - The standard overloaded associative (indexed) lookup operator - - - A compiler intrinsic for checking initialization soundness of recursive bindings - - - A compiler intrinsic for checking initialization soundness of recursive static bindings - - - A compiler intrinsic for checking initialization soundness of recursive bindings - - - A compiler intrinsic for the efficient compilation of sequence expressions - - - This function implements parsing of decimal constants - - - This function implements calls to default constructors - acccessed by 'new' constraints. - - - Primitive used by pattern match compilation - - - A compiler intrinsic that implements the ':?' operator - - - A compiler intrinsic that implements the ':?' operator - - - A compiler intrinsic that implements the ':?>' operator - - - A compiler intrinsic that implements the ':?>' operator - - - The F# compiler emits calls to some of the functions in this module as part of the compiled form of some language constructs - - - Address-of. Uses of this value may result in the generation of unverifiable code. - The input object. - The unmanaged pointer. - - - Address-of. Uses of this value may result in the generation of unverifiable code. - The input object. - The managed pointer. - - - Binary 'or'. When used as a binary operator the right hand value is evaluated only on demand - The first value. - The second value. - The result of the operation. - - - Binary 'or'. When used as a binary operator the right hand value is evaluated only on demand. - - - Binary 'and'. When used as a binary operator the right hand value is evaluated only on demand - The first value. - The second value. - The result of the operation. - - - Binary 'and'. When used as a binary operator the right hand value is evaluated only on demand. - - - The F# compiler emits calls to some of the functions in this module as part of the compiled form of some language constructs - - - - - - - - - - - - - - - - - - For internal use only - - - Language primitives associated with the F# language - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - An active pattern to match values of type System.Collections.Generic.KeyValuePair - The input key/value pair. - A tuple containing the key and value. - - - Converts the argument to character. Numeric inputs are converted according to the UTF-16 - encoding for characters. String inputs must be exactly one character long. For other - input types the operation requires an appropriate static conversion method on the input type. - The input value. - The converted char. - - - Converts the argument to System.Decimal using a direct conversion for all - primitive numeric types. For strings, the input is converted using UInt64.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted decimal. - - - Converts the argument to a string using ToString. - - For standard integer and floating point values the ToString conversion - uses CultureInfo.InvariantCulture. - The input value. - The converted string. - - - Converts the argument to unsigned native integer using a direct conversion for all - primitive numeric types. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted unativeint - - - Converts the argument to signed native integer. This is a direct conversion for all - primitive numeric types. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted nativeint - - - Converts the argument to 64-bit float. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Double.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted float - - - Converts the argument to 32-bit float. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Single.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted float32 - - - Converts the argument to unsigned 64-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using UInt64.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint64 - - - Converts the argument to signed 64-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Int64.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int64 - - - Converts the argument to unsigned 32-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using UInt32.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint32 - - - Converts the argument to signed 32-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Int32.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int32 - - - Converts the argument to a particular enum type. - The input value. - The converted enum type. - - - Converts the argument to signed 32-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Int32.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int - - - Converts the argument to unsigned 16-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using UInt16.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint16 - - - Converts the argument to signed 16-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Int16.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int16 - - - Converts the argument to signed byte. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using SByte.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted sbyte - - - Converts the argument to byte. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Byte.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted byte - - - Overloaded power operator. If n > 0 then equivalent to x*...*x for n occurrences of x. - The input base. - The input exponent. - The base raised to the exponent. - - - Overloaded power operator. - The input base. - The input exponent. - The base raised to the exponent. - - - Overloaded truncate operator. - The input value. - The truncated value. - - - Hyperbolic tangent of the given number - The input value. - The hyperbolic tangent of the input. - - - Tangent of the given number - The input value. - The tangent of the input. - - - Hyperbolic sine of the given number - The input value. - The hyperbolic sine of the input. - - - Sine of the given number - The input value. - The sine of the input. - - - Hyperbolic cosine of the given number - The input value. - The hyperbolic cosine of the input. - - - Cosine of the given number - The input value. - The cosine of the input. - - - Square root of the given number - The input value. - The square root of the input. - - - Logarithm to base 10 of the given number - The input value. - The logarithm to base 10 of the input. - - - Natural logarithm of the given number - The input value. - The natural logarithm of the input. - - - Round the given number - The input value. - The nearest integer to the input value. - - - Sign of the given number - The input value. - -1, 0, or 1 depending on the sign of the input. - - - Floor of the given number - The input value. - The floor of the input. - - - Exponential of the given number - The input value. - The exponential of the input. - - - Ceiling of the given number - The input value. - The ceiling of the input. - - - Inverse tangent of x/y where x and y are specified separately - The y input value. - The x input value. - The inverse tangent of the input ratio. - - - Inverse tangent of the given number - The input value. - The inverse tangent of the input. - - - Inverse sine of the given number - The input value. - The inverse sine of the input. - - - Inverse cosine of the given number - The input value. - The inverse cosine of the input. - - - Absolute value of the given number. - The input value. - The absolute value of the input. - - - A generic hash function. This function has the same behaviour as 'hash', - however the default structural hashing for F# union, record and tuple - types stops when the given limit of nodes is reached. The exact behaviour of - the function can be adjusted on a type-by-type basis by implementing - GetHashCode for each type. - The limit of nodes. - The input object. - The computed hash. - - - A generic hash function, designed to return equal hash values for items that are - equal according to the "=" operator. By default it will use structural hashing - for F# union, record and tuple types, hashing the complete contents of the - type. The exact behaviour of the function can be adjusted on a - type-by-type basis by implementing GetHashCode for each type. - The input object. - The computed hash. - - - Returns the internal size of a type in bytes. For example, sizeof<int> returns 4. - - - Generate a System.Type representation for a type definition. If the - input type is a generic type instantiation then return the - generic type definition associated with all such instantiations. - - - An internal, library-only compiler intrinsic for compile-time - generation of a RuntimeMethodHandle. - - - Generate a System.Type runtime representation of a static type. - The static type is still maintained on the value returned. - - - Clean up resources associated with the input object after the completion of the given function. - Cleanup occurs even when an exception is raised by the protected - code. - The resource to be disposed after action is called. - The action that accepts the resource. - The resulting value. - - - Execute the function as a mutual-exclusion region using the input value as a lock. - The object to be locked. - The action to perform during the lock. - The resulting value. - - - The standard overloaded skip range operator, e.g. [n..skip..m] for lists, seq {n..skip..m} for sequences - The start value of the range. - The step value of the range. - The end value of the range. - The sequence spanning the range using the specified step size. - - - The standard overloaded range operator, e.g. [n..m] for lists, seq {n..m} for sequences - The start value of the range. - The end value of the range. - The sequence spanning the range. - - - Equivalent to System.Single.NaN - - - Equivalent to System.Single.PositiveInfinity - - - Equivalent to System.Double.NaN - - - Equivalent to System.Double.PositiveInfinity - - - Builds a sequence using sequence expression syntax - The input sequence. - The result sequence. - - - Negate a logical value. not true equals false and not false equals true - The value to negate. - The result of the negation. - - - Concatenate two lists. - The first list. - The second list. - The concatenation of the lists. - - - Increment a mutable reference cell containing an integer - The reference cell. - - - Decrement a mutable reference cell containing an integer - The reference cell. - - - Dereference a mutable reference cell - The cell to dereference. - The value contained in the cell. - - - Assign to a mutable reference cell - The cell to mutate. - The value to set inside the cell. - - - Create a mutable reference cell - The value to contain in the cell. - The created reference cell. - - - The identity function - The input value. - The same value. - - - Throw a System.InvalidOperationException exception - The exception message. - The result value. - - - Throw a System.ArgumentNullException exception - The argument name. - The result value. - - - Throw a System.ArgumentException exception with - the given argument name and message. - The argument name. - The exception message. - The result value. - - - Throw a System.Exception exception. - The exception message. - The result value. - - - Boxes a strongly typed value. - The value to box. - The boxed object. - - - Unboxes a strongly typed value. This is the inverse of box, unbox<t>(box<t> a) equals a. - The boxed value. - The unboxed result. - - - Ignore the passed value. This is often used to throw away results of a computation. - The value to ignore. - - - Minimum based on generic comparison - The first value. - The second value. - The minimum value. - - - Maximum based on generic comparison - The first value. - The second value. - The maximum value. - - - Generic comparison. - The first value. - The second value. - The result of the comparison. - - - Return the second element of a tuple, snd (a,b) = b. - The input tuple. - The second value. - - - Return the first element of a tuple, fst (a,b) = a. - The input tuple. - The first value. - - - Matches System.Exception objects whose runtime type is precisely System.Exception - The input exception. - A string option. - - - Builds a System.Exception object. - The message for the Exception. - A System.Exception. - - - Rethrows an exception. This should only be used when handling an exception - The result value. - - - Rethrows an exception. This should only be used when handling an exception - The result value. - - - Raises an exception - The exception to raise. - The result value. - - - Concatenate two strings. The operator '+' may also be used. - - - Used to specify a default value for an optional argument in the implementation of a function - An option representing the argument. - The default value of the argument. - The argument value. If it is None, the defaultValue is returned. - - - Apply a function to three values, the values being a triple on the right, the function on the left - The function. - The first argument. - The second argument. - The third argument. - The function result. - - - Apply a function to two values, the values being a pair on the right, the function on the left - The function. - The first argument. - The second argument. - The function result. - - - Apply a function to a value, the value being on the right, the function on the left - The function. - The argument. - The function result. - - - Apply a function to three values, the values being a triple on the left, the function on the right - The first argument. - The second argument. - The third argument. - The function. - The function result. - - - Apply a function to two values, the values being a pair on the left, the function on the right - The first argument. - The second argument. - The function. - The function result. - - - Apply a function to a value, the value being on the left, the function on the right - The argument. - The function. - The function result. - - - Compose two functions, the function on the right being applied first - The second function to apply. - The first function to apply. - The composition of the input functions. - - - Compose two functions, the function on the left being applied first - The first function to apply. - The second function to apply. - The composition of the input functions. - - - Structural inequality - The first parameter. - The second parameter. - The result of the comparison. - - - Structural equality - The first parameter. - The second parameter. - The result of the comparison. - - - Structural less-than-or-equal comparison - The first parameter. - The second parameter. - The result of the comparison. - - - Structural greater-than-or-equal - The first parameter. - The second parameter. - The result of the comparison. - - - Structural greater-than - The first parameter. - The second parameter. - The result of the comparison. - - - Structural less-than comparison - The first parameter. - The second parameter. - The result of the comparison. - - - Overloaded prefix-plus operator - The input value. - The result of the operation. - - - Overloaded bitwise-NOT operator - The input value. - The result of the operation. - - - Overloaded byte-shift right operator by a specified number of bits - The input value. - The amount to shift. - The result of the operation. - - - Overloaded byte-shift left operator by a specified number of bits - The input value. - The amount to shift. - The result of the operation. - - - Overloaded bitwise-XOR operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded bitwise-OR operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded bitwise-AND operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded modulo operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded division operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded multiplication operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded subtraction operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded addition operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded unary negation. - The value to negate. - The result of the operation. - - - Converts the argument to char. Numeric inputs are converted using a checked - conversion according to the UTF-16 encoding for characters. String inputs must - be exactly one character long. For other input types the operation requires an - appropriate static conversion method on the input type. - The input value. - The converted char - - - Converts the argument to unativeint. This is a direct, checked conversion for all - primitive numeric types. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted unativeint - - - Converts the argument to nativeint. This is a direct, checked conversion for all - primitive numeric types. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted nativeint - - - Converts the argument to uint64. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.UInt64.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint64 - - - Converts the argument to int64. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.Int64.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int64 - - - Converts the argument to uint32. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.UInt32.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint32 - - - Converts the argument to int32. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.Int32.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int32 - - - Converts the argument to int. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.Int32.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int - - - Converts the argument to uint16. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.UInt16.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint16 - - - Converts the argument to int16. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.Int16.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int16 - - - Converts the argument to sbyte. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.SByte.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted sbyte - - - Converts the argument to byte. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.Byte.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted byte - - - Overloaded multiplication operator (checks for overflow) - The first value. - The second value. - The product of the two input values. - - - Overloaded addition operator (checks for overflow) - The first value. - The second value. - The sum of the two input values. - - - Overloaded subtraction operator (checks for overflow) - The first value. - The second value. - The first value minus the second value. - - - Overloaded unary negation (checks for overflow) - The input value. - The negated value. - - - This module contains the basic arithmetic operations with overflow checks. - - - Perform generic hashing on a value where the type of the value is not - statically required to satisfy the 'equality' constraint. - The computed hash value. - - - Perform generic equality on two values where the type of the values is not - statically required to satisfy the 'equality' constraint. - The result of the comparison. - - - Perform generic comparison on two values where the type of the values is not - statically required to have the 'comparison' constraint. - The result of the comparison. - - - Generate a default value for any type. This is null for reference types, - For structs, this is struct value where all fields have the default value. - This function is unsafe in the sense that some F# values do not have proper null values. - - - Unboxes a strongly typed value. This is the inverse of box, unbox<t>(box<t> a) equals a. - The boxed value. - The unboxed result. - - - This module contains basic operations which do not apply runtime and/or static checks - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'decimal' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'float' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'float32' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'unativeint' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'nativeint' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'uint64' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'int64' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'uint32' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'int32' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'uint16' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'int16' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'sbyte' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'byte' - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - Generate a range of values using the given zero, add, start, step and stop values - - - Generate a range of values using the given zero, add, start, step and stop values - - - Generate a range of char values - - - Generate a range of byte values - - - Generate a range of sbyte values - - - Generate a range of uint16 values - - - Generate a range of int16 values - - - Generate a range of unativeint values - - - Generate a range of nativeint values - - - Generate a range of uint32 values - - - Generate a range of uint64 values - - - Generate a range of int64 values - - - Generate a range of float32 values - - - Generate a range of float values - - - Generate a range of integers - - - Gets a slice from a string - The source string. - The index of the first character of the slice. - The index of the last character of the slice. - The substring from the given indices. - - - Sets a slice of an array - The target array. - The start index of the first dimension. - The end index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The start index of the third dimension. - The end index of the third dimension. - The start index of the fourth dimension. - The end index of the fourth dimension. - The source array. - - - Gets a slice of an array - The source array. - The start index of the first dimension. - The end index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The start index of the third dimension. - The end index of the third dimension. - The start index of the fourth dimension. - The end index of the fourth dimension. - The four dimensional sub array from the given indices. - - - Sets a slice of an array - The target array. - The start index of the first dimension. - The end index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The start index of the third dimension. - The end index of the third dimension. - The source array. - - - Gets a slice of an array - The source array. - The start index of the first dimension. - The end index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The start index of the third dimension. - The end index of the third dimension. - The three dimensional sub array from the given indices. - - - Sets a vector slice of a 2D array. The index of the second dimension is fixed. - The target array. - The start index of the first dimension. - The end index of the first dimension. - The index of the second dimension. - The source array. - - - Sets a vector slice of a 2D array. The index of the first dimension is fixed. - The target array. - The index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The source array. - - - Sets a region slice of an array - The target array. - The start index of the first dimension. - The end index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The source array. - - - Gets a vector slice of a 2D array. The index of the second dimension is fixed. - The source array. - The start index of the first dimension. - The end index of the first dimension. - The fixed index of the second dimension. - The sub array from the input indices. - - - Gets a vector slice of a 2D array. The index of the first dimension is fixed. - The source array. - The index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The sub array from the input indices. - - - Gets a region slice of an array - The source array. - The start index of the first dimension. - The end index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The two dimensional sub array from the input indices. - - - Sets a slice of an array - The target array. - The start index. - The end index. - The source array. - - - Gets a slice of an array - The input array. - The start index. - The end index. - The sub array from the input indices. - - - A module of compiler intrinsic functions for efficient implementations of F# integer ranges - and dynamic invocations of other F# operators - - - Basic F# Operators. This module is automatically opened in all F# code. - - - Invoke an F# first class function value that accepts five curried arguments - without intervening execution - The first arg. - The second arg. - The third arg. - The fourth arg. - The fifth arg. - The function result. - - - Adapt an F# first class function value to be an optimized function value that can - accept five curried arguments without intervening execution. - The input function. - The optimized function. - - - Construct an optimized function value that can accept five curried - arguments without intervening execution. - The optimized function. - - - The CLI type used to represent F# function values that accept five curried arguments - without intervening execution. This type should not typically used directly from - either F# code or from other CLI languages. - - - Invoke an F# first class function value that accepts four curried arguments - without intervening execution - The first arg. - The second arg. - The third arg. - The fourth arg. - The function result. - - - Adapt an F# first class function value to be an optimized function value that can - accept four curried arguments without intervening execution. - The input function. - The optimized function. - - - Construct an optimized function value that can accept four curried - arguments without intervening execution. - The optimized function. - - - The CLI type used to represent F# function values that accept four curried arguments - without intervening execution. This type should not typically used directly from - either F# code or from other CLI languages. - - - Invoke an F# first class function value that accepts three curried arguments - without intervening execution - The first arg. - The second arg. - The third arg. - The function result. - - - Adapt an F# first class function value to be an optimized function value that can - accept three curried arguments without intervening execution. - The input function. - The adapted function. - - - Construct an optimized function value that can accept three curried - arguments without intervening execution. - The optimized function. - - - The CLI type used to represent F# function values that accept - three iterated (curried) arguments without intervening execution. This type should not - typically used directly from either F# code or from other CLI languages. - - - Invoke the optimized function value with two curried arguments - The first arg. - The second arg. - The function result. - - - Adapt an F# first class function value to be an optimized function value that can - accept two curried arguments without intervening execution. - The input function. - The adapted function. - - - Construct an optimized function value that can accept two curried - arguments without intervening execution. - The optimized function. - - - The CLI type used to represent F# function values that accept - two iterated (curried) arguments without intervening execution. This type should not - typically used directly from either F# code or from other CLI languages. - - - An implementation module used to hold some private implementations of function - value invocation. - - - Convert the option to a list of length 0 or 1. - The input option. - The result list. - - - Convert the option to an array of length 0 or 1. - The input option. - The result array. - - - bind f inp evaluates to match inp with None -> None | Some x -> f x - A function that takes the value of type T from an option and transforms it into - an option containing a value of type U. - The input option. - An option of the output type of the binder. - - - map f inp evaluates to match inp with None -> None | Some x -> Some (f x). - A function to apply to the option value. - The input option. - An option of the input value after applying the mapping function, or None if the input is None. - - - iter f inp executes match inp with None -> () | Some x -> f x. - A function to apply to the option value. - The input option. - Unit if the option is None, otherwise it returns the result of applying the predicate - to the option value. - - - forall p inp evaluates to match inp with None -> true | Some x -> p x. - A function that evaluates to a boolean when given a value from the option type. - The input option. - True if the option is None, otherwise it returns the result of applying the predicate - to the option value. - - - exists p inp evaluates to match inp with None -> false | Some x -> p x. - A function that evaluates to a boolean when given a value from the option type. - The input option. - False if the option is None, otherwise it returns the result of applying the predicate - to the option value. - - - fold f inp s evaluates to match inp with None -> s | Some x -> f x s. - A function to update the state data when given a value from an option. - The input option. - The initial state. - The original state if the option is None, otherwise it returns the updated state with the folder - and the option value. - - - fold f s inp evaluates to match inp with None -> s | Some x -> f s x. - A function to update the state data when given a value from an option. - The initial state. - The input option. - The original state if the option is None, otherwise it returns the updated state with the folder - and the option value. - - - count inp evaluates to match inp with None -> 0 | Some _ -> 1. - The input option. - A zero if the option is None, a one otherwise. - - - Gets the value associated with the option. - The input option. - The value within the option. - Thrown when the option is None. - - - Returns true if the option is None. - The input option. - True if the option is None. - - - Returns true if the option is not None. - The input option. - True if the option is not None. - - - Basic operations on options. - - - - - - - - - - - - - - - - - - - - - - - - Represents a statically-analyzed format associated with writing to a System.IO.TextWriter. The type parameter indicates the - arguments and return type of the format operation. - - - Represents a statically-analyzed format when formatting builds a string. The type parameter indicates the - arguments and return type of the format operation. - - - Represents a statically-analyzed format associated with writing to a System.Text.StringBuilder. The type parameter indicates the - arguments and return type of the format operation. - - - Represents a statically-analyzed format associated with writing to a System.IO.TextWriter. The first type parameter indicates the - arguments of the format operation and the last the overall return type. - - - Represents a statically-analyzed format when formatting builds a string. The first type parameter indicates the - arguments of the format operation and the last the overall return type. - - - Represents a statically-analyzed format associated with writing to a System.Text.StringBuilder. The first type parameter indicates the - arguments of the format operation and the last the overall return type. - - - Print to a string buffer and raise an exception with the given - result. Helper printers must return strings. - The input formatter. - The arguments of the formatter. - - - sprintf, but call the given 'final' function to generate the result. - See kprintf. - The function called to generate a result from the formatted string. - The input formatter. - The arguments of the formatter. - - - printf, but call the given 'final' function to generate the result. - For example, these let the printing force a flush after all output has - been entered onto the channel, but not before. - The function called after formatting to generate the format result. - The input formatter. - The arguments of the formatter. - - - fprintf, but call the given 'final' function to generate the result. - See kprintf. - The function called after formatting to generate the format result. - The input TextWriter. - The input formatter. - The arguments of the formatter. - - - bprintf, but call the given 'final' function to generate the result. - See kprintf. - The function called after formatting to generate the format result. - The input StringBuilder. - The input formatter. - The arguments of the formatter. - - - Print to a string via an internal string buffer and return - the result as a string. Helper printers must return strings. - The input formatter. - The formatted string. - - - Print to a text writer, adding a newline - The TextWriter to print to. - The input formatter. - The return type and arguments of the formatter. - - - Print to a text writer. - The TextWriter to print to. - The input formatter. - The return type and arguments of the formatter. - - - Print to a System.Text.StringBuilder - The StringBuilder to print to. - The input formatter. - The return type and arguments of the formatter. - - - Extensible printf-style formatting for numbers and other datatypes - - Format specifications are strings with "%" markers indicating format - placeholders. Format placeholders consist of: - - %[flags][width][.precision][type] - - where the type is interpreted as follows: - - %b: bool, formatted as "true" or "false" - %s: string, formatted as its unescaped contents - %c: character literal - %d, %i: any basic integer type formatted as a decimal integer, signed if the basic integer type is signed. - %u: any basic integer type formatted as an unsigned decimal integer - %x, %X, %o: any basic integer type formatted as an unsigned hexadecimal - (a-f)/Hexadecimal (A-F)/Octal integer - - %e, %E, %f, %F, %g, %G: - any basic floating point type (float,float32) formatted - using a C-style floating point format specifications, i.e - - %e, %E: Signed value having the form [-]d.dddde[sign]ddd where - d is a single decimal digit, dddd is one or more decimal - digits, ddd is exactly three decimal digits, and sign - is + or - - - %f: Signed value having the form [-]dddd.dddd, where dddd is one - or more decimal digits. The number of digits before the - decimal point depends on the magnitude of the number, and - the number of digits after the decimal point depends on - the requested precision. - - %g, %G: Signed value printed in f or e format, whichever is - more compact for the given value and precision. - - - %M: System.Decimal value - - %O: Any value, printed by boxing the object and using it's ToString method(s) - - %A: Any value, printed with the default layout settings - - %a: A general format specifier, requires two arguments: - (1) a function which accepts two arguments: - (a) a context parameter of the appropriate type for the - given formatting function (e.g. an #System.IO.TextWriter) - (b) a value to print - and which either outputs or returns appropriate text. - - (2) the particular value to print - - - %t: A general format specifier, requires one argument: - (1) a function which accepts a context parameter of the - appropriate type for the given formatting function (e.g. - an System.IO.TextWriter)and which either outputs or returns - appropriate text. - - Basic integer types are: - byte,sbyte,int16,uint16,int32,uint32,int64,uint64,nativeint,unativeint - Basic floating point types are: - float, float32 - - The optional width is an integer indicating the minimal width of the - result. For instance, %6d prints an integer, prefixing it with spaces - to fill at least 6 characters. If width is '*', then an extra integer - argument is taken to specify the corresponding width. - - any number - '*': - - Valid flags are: - - 0: add zeros instead of spaces to make up the required width - '-': left justify the result within the width specified - '+': add a '+' character if the number is positive (to match a '-' sign - for negatives) - ' ': add an extra space if the number is positive (to match a '-' - sign for negatives) - - The printf '#' flag is invalid and a compile-time error will be reported if it is used. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Returns the length of the string. - The input string. - The number of characters in the string. - - - Returns a string by concatenating count instances of str. - The number of copies of the input string will be copied. - The input string. - The concatenated string. - Thrown when count is negative. - - - Tests if any character of the string satisfies the given predicate. - The function to test each character of the string. - The input string. - True if any character returns true for the predicate and false otherwise. - - - Tests if all characters in the string satisfy the given predicate. - The function to test each character of the string. - The input string. - True if all characters return true for the predicate and false otherwise. - - - Builds a new string whose characters are the results of applying the function mapping - to each index from 0 to count-1 and concatenating the resulting - strings. - The number of strings to initialize. - The function to take an index and produce a string to - be concatenated with the others. - The constructed string. - Thrown when count is negative. - - - Builds a new string whose characters are the results of applying the function mapping - to each of the characters of the input string and concatenating the resulting - strings. - The function to produce a string from each character of the input string. - The input string. - The concatenated string. - - - Builds a new string whose characters are the results of applying the function mapping - to each character and index of the input string. - The function to apply to each character and index of the string. - The input string. - The resulting string. - - - Builds a new string whose characters are the results of applying the function mapping - to each of the characters of the input string. - The function to apply to the characters of the string. - The input string. - The resulting string. - - - Applies the function action to the index of each character in the string and the - character itself. - The function to apply to each character and index of the string. - The input string. - - - Applies the function action to each character in the string. - The function to be applied to each character of the string. - The input string. - - - Returns a new string made by concatenating the given strings - with separator sep, that is a1 + sep + ... + sep + aN. - The separator string to be inserted between the strings - of the input sequence. - The sequence of strings to be concatenated. - A new string consisting of the concatenated strings separated by - the separation string. - Thrown when strings is null. - - - Functional programming operators for string processing. Further string operations - are available via the member functions on strings and other functionality in - System.String - and System.Text.RegularExpressions types. - - - - The SI unit of catalytic activity - - - - - The SI unit of does equivalent - - - - - The SI unit of absorbed dose - - - - - The SI unit of activity referred to a radionuclide - - - - - The SI unit of illuminance - - - - - The SI unit of luminous flux - - - - - The SI unit of inductance - - - - - The SI unit of magnetic flux density - - - - - The SI unit of magnetic flux - - - - - The SI unit of electric conductance - - - - - The SI unit of electric resistance - - - - - The SI unit of capacitance - - - - - The SI unit of electric potential difference, electromotive force - - - - - The SI unit of electric charge, amount of electricity - - - - - The SI unit of power, radiant flux - - - - - The SI unit of energy, work, amount of heat - - - - - The SI unit of pressure, stress - - - - - The SI unit of force - - - - - The SI unit of frequency - - - - - The SI unit of luminous intensity - - - - - The SI unit of amount of substance - - - - - The SI unit of thermodynamic temperature - - - - - The SI unit of electric current - - - - - The SI unit of time - - - - - The SI unit of mass - - - - - The SI unit of length - - - - - The SI unit of length - - - - - A synonym for henry, the SI unit of inductance - - - - - A synonym for katal, the SI unit of catalytic activity - - - - - A synonym for sievert, the SI unit of does equivalent - - - - - A synonym for gray, the SI unit of absorbed dose - - - - - A synonym for becquerel, the SI unit of activity referred to a radionuclide - - - - - A synonym for lux, the SI unit of illuminance - - - - - A synonym for lumen, the SI unit of luminous flux - - - - - A synonym for tesla, the SI unit of magnetic flux density - - - - - A synonym for weber, the SI unit of magnetic flux - - - - - A synonym for UnitNames.ohm, the SI unit of electric resistance. - - - - - A synonym for siemens, the SI unit of electric conductance - - - - - A synonym for farad, the SI unit of capacitance - - - - - A synonym for volt, the SI unit of electric potential difference, electromotive force - - - - - A synonym for coulomb, the SI unit of electric charge, amount of electricity - - - - - A synonym for watt, the SI unit of power, radiant flux - - - - - A synonym for joule, the SI unit of energy, work, amount of heat - - - - - A synonym for pascal, the SI unit of pressure, stress - - - - - A synonym for newton, the SI unit of force - - - - - A synonym for hertz, the SI unit of frequency - - - - - A synonym for candela, the SI unit of luminous intensity - - - - - A synonym for mole, the SI unit of amount of substance - - - - - A synonym for kelvin, the SI unit of thermodynamic temperature - - - - - A synonym for ampere, the SI unit of electric current - - - - - A synonym for second, the SI unit of time - - - - - A synonym for kilogram, the SI unit of mass - - - - - A synonym for Metre, the SI unit of length - - - - - A method used to support the F# query syntax. Returns an empty sequence that has the specified type argument. - - - - - A method used to support the F# query syntax. Returns a sequence that contains the specified values. - - - - - A method used to support the F# query syntax. Returns a sequence of length one that contains the specified value. - - - - A query operator that selects those elements based on a specified predicate. - - - - A query operator that performs a subsequent ordering of the elements selected so far in descending order by the given nullable sorting key. - This operator may only be used immediately after a 'sortBy', 'sortByDescending', 'thenBy' or 'thenByDescending', or their nullable variants. - - - - A query operator that performs a subsequent ordering of the elements selected so far in ascending order by the given nullable sorting key. - This operator may only be used immediately after a 'sortBy', 'sortByDescending', 'thenBy' or 'thenByDescending', or their nullable variants. - - - - A query operator that performs a subsequent ordering of the elements selected so far in descending order by the given sorting key. - This operator may only be used immediately after a 'sortBy', 'sortByDescending', 'thenBy' or 'thenByDescending', or their nullable variants. - - - - A query operator that performs a subsequent ordering of the elements selected so far in ascending order by the given sorting key. - This operator may only be used immediately after a 'sortBy', 'sortByDescending', 'thenBy' or 'thenByDescending', or their nullable variants. - - - - A query operator that selects elements from a sequence as long as a specified condition is true, and then skips the remaining elements. - - - - A query operator that selects a specified number of contiguous elements from those selected so far. - - - - A query operator that selects a nullable value for each element selected so far and returns the sum of these values. - If any nullable does not have a value, it is ignored. - - - - A query operator that selects a value for each element selected so far and returns the sum of these values. - - - - - A method used to support the F# query syntax. Inputs to queries are implicitly wrapped by a call to one of the overloads of this method. - - - - - A method used to support the F# query syntax. Inputs to queries are implicitly wrapped by a call to one of the overloads of this method. - - - - A query operator that sorts the elements selected so far in descending order by the given nullable sorting key. - - - - A query operator that sorts the elements selected so far in ascending order by the given nullable sorting key. - - - - A query operator that sorts the elements selected so far in descending order by the given sorting key. - - - - A query operator that sorts the elements selected so far in ascending order by the given sorting key. - - - - A query operator that bypasses elements in a sequence as long as a specified condition is true and then selects the remaining elements. - - - - A query operator that bypasses a specified number of the elements selected so far and selects the remaining elements. - - - - A query operator that projects each of the elements selected so far. - - - - - - - - - - - - - - A method used to support the F# query syntax. Runs the given quotation as a query using LINQ IQueryable rules. - - - - - A method used to support the F# query syntax. Indicates that the query should be passed as a quotation to the Run method. - - - - A query operator that selects the element at a specified index amongst those selected so far. - - - - A query operator that selects a nullable value for each element selected so far and returns the minimum of these values. - If any nullable does not have a value, it is ignored. - - - - A query operator that selects a value for each element selected so far and returns the minimum resulting value. - - - - A query operator that selects a nullable value for each element selected so far and returns the maximum of these values. - If any nullable does not have a value, it is ignored. - - - - A query operator that selects a value for each element selected so far and returns the maximum resulting value. - - - - A query operator that correlates two sets of selected values based on matching keys and groups the results. - If any group is empty, a group with a single default value is used instead. - Normal usage is 'leftOuterJoin y in elements2 on (key1 = key2) into group'. - - - - A query operator that selects the last element of those selected so far, or a default value if no element is found. - - - - A query operator that selects the last element of those selected so far. - - - - A query operator that correlates two sets of selected values based on matching keys. - Normal usage is 'join y in elements2 on (key1 = key2)'. - - - - A query operator that selects the first element of those selected so far, or a default value if the sequence contains no elements. - - - - A query operator that selects the first element from those selected so far. - - - - A query operator that selects a value for each element selected so far and groups the elements by the given key. - - - - A query operator that correlates two sets of selected values based on matching keys and groups the results. - Normal usage is 'groupJoin y in elements2 on (key1 = key2) into group'. - - - - A query operator that groups the elements selected so far according to a specified key selector. - - - - - A method used to support the F# query syntax. Projects each element of a sequence to another sequence and combines the resulting sequences into one sequence. - - - - A query operator that selects the first element selected so far that satisfies a specified condition. - - - - A query operator that determines whether any element selected so far satisfies a condition. - - - - A query operator that selects the single, specific element of those selected so far, or a default value if that element is not found. - - - - A query operator that selects the single, specific element selected so far - - - - A query operator that selects distinct elements from the elements selected so far. - - - - A query operator that returns the number of selected elements. - - - - A query operator that determines whether the selected elements contains a specified element. - - - - A query operator that selects a nullable value for each element selected so far and returns the average of these values. - If any nullable does not have a value, it is ignored. - - - - A query operator that selects a value for each element selected so far and returns the average of these values. - - - - A query operator that determines whether all elements selected so far satisfies a condition. - - - - Create an instance of this builder. Use 'query { ... }' to use the query syntax. - - - - The type used to support the F# query syntax. Use 'query { ... }' to use the query syntax. - - - - - A property used to support the F# query syntax. - - - - - A method used to support the F# query syntax. - - - - - A partial input or result in an F# query. This type is used to support the F# query syntax. - - - - Converts the argument to character. Numeric inputs are converted according to the UTF-16 - encoding for characters. The operation requires an appropriate static conversion method on the input type. - The input value. - The converted char. - - - Converts the argument to System.Decimal using a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted decimal. - - - Converts the argument to unsigned native integer using a direct conversion for all - primitive numeric types. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted unativeint - - - Converts the argument to signed native integer. This is a direct conversion for all - primitive numeric types. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted nativeint - - - Converts the argument to 64-bit float. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted float - - - Converts the argument to 32-bit float. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted float32 - - - Converts the argument to unsigned 64-bit integer. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint64 - - - Converts the argument to signed 64-bit integer. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int64 - - - Converts the argument to unsigned 32-bit integer. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint32 - - - Converts the argument to signed 32-bit integer. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int32 - - - Converts the argument to a particular enum type. - The input value. - The converted enum type. - - - Converts the argument to signed 32-bit integer. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int - - - Converts the argument to unsigned 16-bit integer. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint16 - - - Converts the argument to signed 16-bit integer. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int16 - - - Converts the argument to signed byte. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted sbyte - - - Converts the argument to byte. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted byte - - - - Functions for converting nullable values - - - - - The division operator where a nullable value appears on both left and right sides - - - - - The division operator where a nullable value appears on the right - - - - - The division operator where a nullable value appears on the left - - - - - The modulus operator where a nullable value appears on both left and right sides - - - - - The modulus operator where a nullable value appears on the right - - - - - The modulus operator where a nullable value appears on the left - - - - - The multiplication operator where a nullable value appears on both left and right sides - - - - - The multiplication operator where a nullable value appears on the right - - - - - The multiplication operator where a nullable value appears on the left - - - - - The subtraction operator where a nullable value appears on both left and right sides - - - - - The subtraction operator where a nullable value appears on the right - - - - - The subtraction operator where a nullable value appears on the left - - - - - The addition operator where a nullable value appears on both left and right sides - - - - - The addition operator where a nullable value appears on the right - - - - - The addition operator where a nullable value appears on the left - - - - - The '<>' operator where a nullable value appears on both left and right sides - - - - - The '=' operator where a nullable value appears on both left and right sides - - - - - The '<' operator where a nullable value appears on both left and right sides - - - - - The '<=' operator where a nullable value appears on both left and right sides - - - - - The '>' operator where a nullable value appears on both left and right sides - - - - - The '>=' operator where a nullable value appears on both left and right sides - - - - - The '<>' operator where a nullable value appears on the right - - - - - The '=' operator where a nullable value appears on the right - - - - - The '<' operator where a nullable value appears on the right - - - - - The '<=' operator where a nullable value appears on the right - - - - - The '>' operator where a nullable value appears on the right - - - - - The '>=' operator where a nullable value appears on the right - - - - - The '<>' operator where a nullable value appears on the left - - - - - The '=' operator where a nullable value appears on the left - - - - - The '<' operator where a nullable value appears on the left - - - - - The '<=' operator where a nullable value appears on the left - - - - - The '>' operator where a nullable value appears on the left - - - - - The '>=' operator where a nullable value appears on the left - - - - - Operators for working with nullable values - - - - - A method used to support the F# query syntax. Runs the given quotation as a query using LINQ IEnumerable rules. - - - - - - - - A method used to support the F# query syntax. Runs the given quotation as a query using LINQ rules. - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - - - - A type used to reconstruct a grouping after applying a mutable->immutable mapping transformation - on a result of a query. - - - - - - - - - - - - - - - - - - - - The generic MethodInfo for Select function - Describes how we got from productions of immutable objects to productions of anonymous objects, with enough information - that we can invert the process in final query results. - - - - - - - - Given the expression part of a "yield" or "select" which produces a result in terms of immutable tuples or immutable records, - generate an equivalent expression yielding anonymous objects. Also return the conversion for the immutable-to-mutable correspondence - so we can reverse this later. - - - - - Simplify gets of tuples and gets of record fields. - - - - - Cleanup the use of property-set object constructions in leaf expressions that form parts of F# queries. - - - - - - - - Given an type involving immutable tuples and records, logically corresponding to the type produced at a - "yield" or "select", convert it to a type involving anonymous objects according to the conversion data. - - - - - - - - - - - - - - - - - - - - Recognize anonymous type construction written using 'new AnonymousObject(<e1>, <e2>, ...)' - - - - - - - - - - - - - - - - - Recognize object construction written using 'new O(Prop1 = <e>, Prop2 = <e>, ...)' - - - - - Tests whether a list consists only of assignments of properties of the - given variable, null values (ignored) and ends by returning the given variable - (pattern returns only property assignments) - - - - - Recognize sequential series written as (... ((<e>; <e>); <e>); ...) - - - - - - - - - - - - - - - - - - - - - - - A runtime helper used to evaluate nested quotation literals. - - - - - Evaluates a subset of F# quotations by first converting to a LINQ expression, for the subset of LINQ expressions represented by the - expression syntax in the C# language. - - - - - Converts a subset of F# quotations to a LINQ expression, for the subset of LINQ expressions represented by the - expression syntax in the C# language. - - - - - Converts a subset of F# quotations to a LINQ expression, for the subset of LINQ expressions represented by the - expression syntax in the C# language. - - - - - When used in a quotation, this function indicates a specific conversion - should be performed when converting the quotation to a LINQ expression. - - This function should not be called directly. - - - - - When used in a quotation, this function indicates a specific conversion - should be performed when converting the quotation to a LINQ expression. - - This function should not be called directly. - - - - - When used in a quotation, this function indicates a specific conversion - should be performed when converting the quotation to a LINQ expression. - - This function should not be called directly. - - - - - - - - Abstract internal type - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Allocates a region of memory on the stack. - The number of objects of type T to allocate. - A typed pointer to the allocated memory. - - - Assigns the value into the memory location referenced by the typed native - pointer computed by adding index * sizeof<'T> to the given input pointer. - The input pointer. - The index by which to offset the pointer. - The value to assign. - - - Assigns the value into the memory location referenced by the given typed native pointer. - The input pointer. - The value to assign. - - - Dereferences the given typed native pointer. - The input pointer. - The value at the pointer address. - - - Dereferences the typed native pointer computed by adding index * sizeof<'T> to the - given input pointer. - The input pointer. - The index by which to offset the pointer. - The value at the pointer address. - - - Returns a typed native pointer by adding index * sizeof<'T> to the - given input pointer. - The input pointer. - The index by which to offset the pointer. - A typed pointer. - - - Returns a machine address for a given typed native pointer. - The input pointer. - The machine address. - - - Returns a typed native pointer for a given machine address. - The pointer address. - A typed pointer. - - - Contains operations on native pointers. Use of these operators may - result in the generation of unverifiable code. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Gets the raw expression associated with this type-carrying expression - - - Type-carrying quoted expressions. Expressions are generated either - by quotations in source text or programatically - - - Returns type of an expression. - - - Returns the custom attributes of an expression. - - - Builds an expression that represents a while loop - The predicate to control the loop iteration. - The body of the while loop. - The resulting expression. - - - Builds an expression that represents setting a mutable variable - The input variable. - The value to set. - The resulting expression. - - - Builds an expression that represents a variable - The input variable. - The resulting expression. - - - Builds an expression that represents a constant value - The typed value. - The resulting expression. - - - Builds an expression that represents a constant value of a particular type - The untyped object. - The type of the object. - The resulting expression. - - - Builds an expression that represents a test of a value is of a particular union case - The expression to test. - The description of the union case. - The resulting expression. - - - Builds an expression that represents a type test. - The expression to test. - The target type. - The resulting expression. - - - Builds an expression that represents getting a field of a tuple - The input tuple. - The index of the tuple element to get. - The resulting expression. - - - Builds an expression that represents a try/with construct for exception filtering and catching. - The body of the try expression. - - - The variable to bind to a caught exception. - The expression evaluated when an exception is caught. - The resulting expression. - - - Try and find a stored reflection definition for the given method. Stored reflection - definitions are added to an F# assembly through the use of the [<ReflectedDefinition>] attribute. - The description of the method to find. - The reflection definition or None if a match could not be found. - - - Builds an expression that represents a try/finally construct - The body of the try expression. - The final part of the expression to be evaluated. - The resulting expression. - - - Format the expression as a string - Indicates if method, property, constructor and type objects should be printed in detail. If false, these are abbreviated to their name. - The formatted string. - - - Substitutes through the given expression using the given functions - to map variables to new values. The functions must give consistent results - at each application. Variable renaming may occur on the target expression - if variable capture occurs. - The function to map variables into expressions. - The expression with the given substitutions. - - - Builds an expression that represents the sequential execution of one expression followed by another - The first expression. - The second expression. - The resulting expression. - - - Permits interactive environments such as F# Interactive - to explicitly register new pickled resources that represent persisted - top level definitions. The string indicates a unique name for the resources - being added. The format for the bytes is the encoding generated by the F# compiler. - The assembly associated with the resource. - The unique name for the resources being added. - The serialized resource to register with the environment. - - - Builds an expression that represents a nested quotation literal - The expression being quoted. - The resulting expression. - - - Builds an expression that represents writing to a static property - The description of the property. - The value to set. - List of indices for the property if it is an indexed property. - The resulting expression. - - - Builds an expression that represents writing to a property of an object - The input object. - The description of the property. - The value to set. - List of indices for the property if it is an indexed property. - The resulting expression. - - - Builds an expression that represents reading a static property - The description of the property. - List of indices for the property if it is an indexed property. - The resulting expression. - - - Builds an expression that represents reading a property of an object - The input object. - The description of the property. - List of indices for the property if it is an indexed property. - The resulting expression. - - - Builds an expression that represents the creation of a union case value - The description of the union case. - The list of arguments for the case. - The resulting expression. - - - Builds an expression that represents the creation of an F# tuple value - The list of elements of the tuple. - The resulting expression. - - - Builds record-construction expressions - The type of record. - The list of elements of the record. - The resulting expression. - - - Builds an expression that represents the invocation of an object constructor - The description of the constructor. - The list of arguments to the constructor. - The resulting expression. - - - Builds an expression that represents the creation of a delegate value for the given type - The type of delegate. - The parameters for the delegate. - The body of the function. - The resulting expression. - - - Builds an expression that represents the creation of an array value initialized with the given elements - The type for the elements of the array. - The list of elements of the array. - The resulting expression. - - - Builds recursives expressions associated with 'let rec' constructs - The list of bindings for the let expression. - The sub-expression where the bindings are in scope. - The resulting expression. - - - Builds expressions associated with 'let' constructs - The variable in the let expression. - The expression bound to the variable. - The sub-expression where the binding is in scope. - The resulting expression. - - - Builds an expression that represents the constrution of an F# function value - The parameter to the function. - The body of the function. - The resulting expression. - - - Builds 'if ... then ... else' expressions. - The condition expression. - The then sub-expression. - The else sub-expression. - The resulting expression. - - - Fetches or creates a new variable with the given name and type from a global pool of shared variables - indexed by name and type. The type is given by the expicit or inferred type parameter - The variable name. - The created of fetched typed global variable. - - - Gets the free expression variables of an expression as a list. - A sequence of the free variables in the expression. - - - Builds a 'for i = ... to ... do ...' expression that represent loops over integer ranges - The sub-expression declaring the loop variable. - The sub-expression setting the initial value of the loop variable. - The sub-expression declaring the final value of the loop variable. - The sub-expression representing the body of the loop. - The resulting expression. - - - Builds an expression that represents writing to a field of an object - The input object. - The description of the field to write to. - The value to set to the field. - The resulting expression. - - - Builds an expression that represents writing to a static field - The description of the field to write to. - The value to the set to the field. - The resulting expression. - - - Builds an expression that represents the access of a field of an object - The input object. - The description of the field to access. - The resulting expression. - - - Builds an expression that represents the access of a static field - The description of the field to access. - The resulting expression. - - - - - - This function is called automatically when quotation syntax (<@ @>) and related typed-expression - quotations are used. The bytes are a pickled binary representation of an unlinked form of the quoted expression, - and the System.Type argument is any type in the assembly where the quoted - expression occurs, i.e. it helps scope the interpretation of the cross-assembly - references in the bytes. - A type in the assembly where the quotation occurs. - The list of spliced types. - The list of spliced expressions. - The serialized form of the quoted expression. - The resulting expression. - - - Builds an expression that represents the invocation of a default object constructor - The type on which the constructor is invoked. - The resulting expression. - - - Builds an expression that represents the coercion of an expression to a type - The expression to coerce. - The target type. - The resulting expression. - - - Returns a new typed expression given an underlying runtime-typed expression. - A type annotation is usually required to use this function, and - using an incorrect type annotation may result in a later runtime exception. - The expression to cast. - The resulting typed expression. - - - Builds an expression that represents a call to an instance method associated with an object - The input object. - The description of the method to call. - The list of arguments to the method. - The resulting expression. - - - Builds an expression that represents a call to an static method or module-bound function - The MethodInfo describing the method to call. - The list of arguments to the method. - The resulting expression. - - - Builds an expression that represents the application of a first class function value to multiple arguments - The function to apply. - The list of lists of arguments to the function. - The resulting expression. - - - Builds an expression that represents the application of a first class function value to a single argument. - The function to apply. - The argument to the function. - The resulting expression. - - - Builds an expression that represents setting the value held at a particular address. - The target expression. - The value to set at the address. - The resulting expression. - - - Builds an expression that represents getting the address of a value. - The target expression. - The resulting expression. - - - Quoted expressions annotated with System.Type values. - - - The type associated with the variable - - - The declared name of the variable - - - Indicates if the variable represents a mutable storage location - - - Fetches or create a new variable with the given name and type from a global pool of shared variables - indexed by name and type - The name of the variable. - The type associated with the variable. - The retrieved or created variable. - - - Creates a new variable with the given name, type and mutability - The declared name of the variable. - The type associated with the variable. - Indicates if the variable represents a mutable storage location. Default is false. - The created variable. - - - Information at the binding site of a variable - - - Re-build combination expressions. The first parameter should be an object - returned by the ShapeCombination case of the active pattern in this module. - The input shape. - The list of arguments. - The rebuilt expression. - - - An active pattern that performs a complete decomposition viewing the expression tree as a binding structure - The input expression. - The decomposed Var, Lambda, or ConstApp. - - - Active patterns for traversing, visiting, rebuilding and tranforming expressions in a generic way - - - An active pattern to recognize property setters that have an associated ReflectedDefinition - The description of the property. - The expression of the method definition if found, or None. - - - An active pattern to recognize property getters or values in modules that have an associated ReflectedDefinition - The description of the property. - The expression of the method definition if found, or None. - - - An active pattern to recognize methods that have an associated ReflectedDefinition - The description of the method. - The expression of the method definition if found, or None. - - - A parameterized active pattern to recognize calls to a specified function or method. - The returned elements are the optional target object (present if the target is an - instance method), the generic type instantation (non-empty if the target is a generic - instantiation), and the arguments to the function or method. - The input template expression to specify the method to call. - The optional target object (present if the target is an - instance method), the generic type instantation (non-empty if the target is a generic - instantiation), and the arguments to the function or method. - - - An active pattern to recognize constant unsigned int64 expressions - The input expression to match against. - uint64 option - - - An active pattern to recognize constant int64 expressions - The input expression to match against. - int64 option - - - An active pattern to recognize constant unsigned int32 expressions - The input expression to match against. - uint32 option - - - An active pattern to recognize constant int32 expressions - The input expression to match against. - int32 option - - - An active pattern to recognize constant unsigned int16 expressions - The input expression to match against. - uint16 option - - - An active pattern to recognize constant int16 expressions - The input expression to match against. - int16 option - - - An active pattern to recognize constant byte expressions - The input expression to match against. - byte option - - - An active pattern to recognize constant signed byte expressions - The input expression to match against. - sbyte option - - - An active pattern to recognize constant unicode character expressions - The input expression to match against. - char option - - - An active pattern to recognize constant 64-bit floating point number expressions - The input expression to match against. - float option - - - An active pattern to recognize constant 32-bit floating point number expressions - The input expression to match against. - float32 option - - - An active pattern to recognize constant string expressions - The input expression to match against. - string option - - - An active pattern to recognize constant boolean expressions - The input expression to match against. - bool option - - - An active pattern to recognize () constant expressions - The input expression to match against. - unit option - - - An active pattern to recognize expressions of the form a || b - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions of the form a && b - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions that represent the application of a (possibly curried or tupled) first class function value - The input expression to match against. - (Expr * Expr list list) option - - - An active pattern to recognize expressions that represent a (possibly curried or tupled) first class function value - The input expression to match against. - (Var list list * Expr) option - - - Contains a set of derived F# active patterns to analyze F# expression objects - - - An active pattern to recognize expressions that represent setting a mutable variable - The input expression to match against. - (Var * Expr) option - - - An active pattern to recognize expressions that represent a variable - The input expression to match against. - Var option - - - An active pattern to recognize expressions that represent a constant value - The input expression to match against. - (obj * Type) option - - - An active pattern to recognize expressions that represent a test if a value is of a particular union case - The input expression to match against. - (Expr * UnionCaseInfo) option - - - An active pattern to recognize expressions that represent a dynamic type test - The input expression to match against. - (Expr * Type) option - - - An active pattern to recognize expressions that represent getting a tuple field - The input expression to match against. - (Expr * int) option - - - An active pattern to recognize expressions that represent a try/finally construct - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions that represent a try/with construct for exception filtering and catching - The input expression to match against. - (Expr * Var * Expr * Var * Expr) option - - - An active pattern to recognize expressions that represent sequential exeuction of one expression followed by another - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions that represent a nested quotation literal - The input expression to match against. - Expr option - - - An active pattern to recognize expressions that represent setting a static or instance property, or a non-function value declared in a module - The input expression to match against. - (Expr option * PropertyInfo * Expr list * Expr) option - - - An active pattern to recognize expressions that represent the read of a static or instance property, or a non-function value declared in a module - The input expression to match against. - (Expr option * PropertyInfo * Expr list) option - - - An active pattern to recognize expressions that represent construction of tuple values - The input expression to match against. - (Expr list) option - - - An active pattern to recognize expressions that represent construction of particular union case values - The input expression to match against. - (UnionCaseInfo * Expr list) option - - - An active pattern to recognize expressions that represent construction of record values - The input expression to match against. - (Type * Expr list) option - - - An active pattern to recognize expressions that represent invocation of object constructors - The input expression to match against. - (ConstructorInfo * Expr list) option - - - An active pattern to recognize expressions that represent construction of delegate values - The input expression to match against. - (Type * Var list * Expr) option - - - An active pattern to recognize expressions that represent invocations of a default constructor of a struct - The input expression to match against. - Type option - - - An active pattern to recognize expressions that represent the construction of arrays - The input expression to match against. - (Type * Expr list) option - - - An active pattern to recognize expressions that represent recursive let bindings of one or more variables - The input expression to match against. - ((Var * Expr) list * Expr) option - - - An active pattern to recognize expressions that represent let bindings - The input expression to match against. - (Var * Expr * Expr) option - - - An active pattern to recognize expressions that represent first class function values - The input expression to match against. - (Var * Expr) option - - - An active pattern to recognize expressions that represent conditionals - The input expression to match against. - (Expr * Expr * Expr) option - - - An active pattern to recognize expressions that represent while loops - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions that represent loops over integer ranges - The input expression to match against. - (Var * Expr * Expr * Expr) option - - - An active pattern to recognize expressions that represent setting a static or instance field - The input expression to match against. - (Expr option * FieldInfo * Expr) option - - - An active pattern to recognize expressions that represent getting a static or instance field - The input expression to match against. - (Expr option * FieldInfo) option - - - An active pattern to recognize expressions that represent coercions from one type to another - The input expression to match against. - (Expr * Type) option - - - An active pattern to recognize expressions that represent calls to static and instance methods, and functions defined in modules - The input expression to match against. - (Expr option * MethodInfo * Expr list) option - - - An active pattern to recognize expressions that represent applications of first class function values - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions that represent setting the value held at an address - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions that represent getting the address of a value - The input expression to match against. - Expr option - - - Contains a set of primitive F# active patterns to analyze F# expression objects - - - Returns a System.Type representing an F# tuple type with the given element types - An array of types for the tuple elements. - The type representing the tuple containing the input elements. - - - Returns a System.Type representing the F# function type with the given domain and range - The input type of the function. - The output type of the function. - The function type with the given domain and range. - - - Return true if the typ is a representation of an F# tuple type - The type to check. - True if the type check succeeds. - - - Return true if the typ is a System.Type value corresponding to the compiled form of an F# module - The type to check. - True if the type check succeeds. - - - Return true if the typ is a representation of an F# function type or the runtime type of a closure implementing an F# function type - The type to check. - True if the type check succeeds. - - - Gets the tuple elements from the representation of an F# tuple type. - The input tuple type. - An array of the types contained in the given tuple type. - - - Gets the domain and range types from an F# function type or from the runtime type of a closure implementing an F# type - The input function type. - A tuple of the domain and range types of the input function. - - - Contains operations associated with constructing and analyzing F# types such as records, unions and tuples - - - Precomputes a function for reading the values of a particular tuple type - - Assumes the given type is a TupleType. - If not, ArgumentException is raised during pre-computation. - The tuple type to read. - Thrown when the given type is not a tuple type. - A function to read values of the given tuple type. - - - Gets information that indicates how to read a field of a tuple - The input tuple type. - The index of the tuple element to describe. - The description of the tuple element and an optional type and index if the tuple is big. - - - Gets a method that constructs objects of the given tuple type. - For small tuples, no additional type will be returned. - - For large tuples, an additional type is returned indicating that - a nested encoding has been used for the tuple type. In this case - the suffix portion of the tuple type has the given type and an - object of this type must be created and passed as the last argument - to the ConstructorInfo. A recursive call to PreComputeTupleConstructorInfo - can be used to determine the constructor for that the suffix type. - The input tuple type. - The description of the tuple type constructor and an optional extra type - for large tuples. - - - Precomputes a function for reading the values of a particular tuple type - - Assumes the given type is a TupleType. - If not, ArgumentException is raised during pre-computation. - The type of tuple to read. - Thrown when the given type is not a tuple type. - A function to read a particular tuple type. - - - Precompute a function for reading a particular field from a record. - Assumes the given type is a RecordType with a field of the given name. - If not, ArgumentException is raised during pre-computation. - - Using the computed function will typically be faster than executing a corresponding call to Value.GetInfo - because the path executed by the computed function is optimized given the knowledge that it will be - used to read values of the given type. - The PropertyInfo of the field to read. - Thrown when the input type is not a record type. - A function to read the specified field from the record. - - - Creates an instance of a tuple type - - Assumes at least one element is given. If not, ArgumentException is raised. - The array of tuple fields. - The tuple type to create. - Thrown if no elements are given. - An instance of the tuple type with the given elements. - - - Builds a typed function from object from a dynamic function implementation - The function type of the implementation. - The untyped lambda of the function implementation. - A typed function from the given dynamic implementation. - - - Reads all fields from a tuple. - - Assumes the given input is a tuple value. If not, ArgumentException is raised. - The input tuple. - Thrown when the input is not a tuple value. - An array of the fields from the given tuple. - - - Reads a field from a tuple value. - - Assumes the given input is a tuple value. If not, ArgumentException is raised. - The input tuple. - The index of the field to read. - The value of the field. - - - Reads a field from a record value. - - Assumes the given input is a record value. If not, ArgumentException is raised. - The record object. - The PropertyInfo describing the field to read. - Thrown when the input type is not a record type. - The field from the record. - - - Contains operations associated with constructing and analyzing values associated with F# types - such as records, unions and tuples. - - - The integer tag for the case. - - - The name of the case. - - - The type in which the case occurs. - - - The fields associated with the case, represented by a PropertyInfo. - The fields associated with the case. - - - Returns the custom attributes associated with the case matching the given attribute type. - The type of attributes to return. - An array of custom attributes. - - - Returns the custom attributes associated with the case. - An array of custom attributes. - - - Represents a case of a discriminated union type - - - Returns true if the typ is a representation of an F# exception declaration - The type to check. - Optional flag that denotes accessibility of the private representation. - True if the type check is an F# exception. - - - Reads all the fields from an F# exception declaration, in declaration order - - Assumes exceptionType is an exception representation type. If not, ArgumentException is raised. - The exception type to read. - Optional flag that denotes accessibility of the private representation. - Thrown if the given type is not an exception. - An array containing the PropertyInfo of each field in the exception. - - - Returns true if the typ is a representation of an F# union type or the runtime type of a value of that type - The type to check. - Optional flag that denotes accessibility of the private representation. - True if the type check succeeds. - - - Return true if the typ is a representation of an F# record type - The type to check. - Optional flag that denotes accessibility of the private representation. - True if the type check succeeds. - - - Gets the cases of a union type. - - Assumes the given type is a union type. If not, ArgumentException is raised during pre-computation. - The input union type. - Optional flag that denotes accessibility of the private representation. - Thrown when the input type is not a union type. - An array of descriptions of the cases of the given union type. - - - Reads all the fields from a record value, in declaration order - - Assumes the given input is a record value. If not, ArgumentException is raised. - The input record type. - Optional flag that denotes accessibility of the private representation. - An array of descriptions of the properties of the record type. - - - Reads all the fields from a value built using an instance of an F# exception declaration - - Assumes the given input is an F# exception value. If not, ArgumentException is raised. - The exception instance. - Optional flag that denotes accessibility of the private representation. - Thrown when the input type is not an F# exception. - The fields from the given exception. - - - A method that constructs objects of the given case - The description of the union case. - Optional flag that denotes accessibility of the private representation. - The description of the constructor of the given union case. - - - Precomputes a function for constructing a discriminated union value for a particular union case. - The description of the union case. - Optional flag that denotes accessibility of the private representation. - A function for constructing values of the given union case. - - - Precomputes a function for reading all the fields for a particular discriminator case of a union type - - Using the computed function will typically be faster than executing a corresponding call to GetFields - The description of the union case to read. - Optional flag that denotes accessibility of the private representation. - A function to for reading the fields of the given union case. - - - Precompute a property or static method for reading an integer representing the case tag of a union type. - The type of union to read. - Optional flag that denotes accessibility of the private representation. - The description of the union case reader. - - - Assumes the given type is a union type. - If not, ArgumentException is raised during pre-computation. - - Using the computed function is more efficient than calling GetUnionCase - because the path executed by the computed function is optimized given the knowledge that it will be - used to read values of the given type. - The type of union to optimize reading. - Optional flag that denotes accessibility of the private representation. - An optimized function to read the tags of the given union type. - - - Identify the union case and its fields for an object - - Assumes the given input is a union case value. If not, ArgumentException is raised. - - If the type is not given, then the runtime type of the input object is used to identify the - relevant union type. The type should always be given if the input object may be null. For example, - option values may be represented using the 'null'. - The input union case. - The union type containing the value. - Optional flag that denotes accessibility of the private representation. - Thrown when the input type is not a union case value. - The description of the union case and its fields. - - - Create a union case value. - The description of the union case to create. - The array of arguments to construct the given case. - Optional flag that denotes accessibility of the private representation. - The constructed union case. - - - Get a ConstructorInfo for a record type - The record type. - Optional flag that denotes accessibility of the private representation. - A ConstructorInfo for the given record type. - - - Precompute a function for constructing a record value. - - Assumes the given type is a RecordType. - If not, ArgumentException is raised during pre-computation. - The type of record to construct. - Optional flag that denotes accessibility of the private representation. - Thrown when the input type is not a record type. - A function to construct records of the given type. - - - Precompute a function for reading all the fields from a record. The fields are returned in the - same order as the fields reported by a call to Microsoft.FSharp.Reflection.Type.GetInfo for - this type. - - Assumes the given type is a RecordType. - If not, ArgumentException is raised during pre-computation. - - Using the computed function will typically be faster than executing a corresponding call to Value.GetInfo - because the path executed by the computed function is optimized given the knowledge that it will be - used to read values of the given type. - The type of record to read. - Optional flag that denotes accessibility of the private representation. - Thrown when the input type is not a record type. - An optimized reader for the given record type. - - - Reads all the fields from a record value. - - Assumes the given input is a record value. If not, ArgumentException is raised. - The record object. - Optional flag that denotes accessibility of the private representation. - Thrown when the input type is not a record type. - The array of fields from the record. - - - Creates an instance of a record type. - - Assumes the given input is a record type. - The type of record to make. - The array of values to initialize the record. - Optional flags that denotes accessibility of the private representation. - Thrown when the input type is not a record type. - The created record. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - A record of options to control structural formatting. - For F# Interactive properties matching those of this value can be accessed via the 'fsi' - value. - - Floating Point format given in the same format accepted by System.Double.ToString, - e.g. f6 or g15. - - If ShowProperties is set the printing process will evaluate properties of the values being - displayed. This may cause additional computation. - - The ShowIEnumerable is set the printing process will force the evalution of IEnumerable objects - to a small, finite depth, as determined by the printing parameters. - This may lead to additional computation being performed during printing. - - <example> - From F# Interactive the default settings can be adjusted using, for example, - <pre> - open Microsoft.FSharp.Compiler.Interactive.Settings;; - setPrintWidth 120;; - </pre> - </example> - - - - - Data representing structured layouts of terms. - - - - - Convert any value to a layout using the given formatting options. The - layout can then be processed using formatting display engines such as - those in the LayoutOps module. any_to_string and output_any are - built using any_to_layout with default format options. - - - - - - - - Ouput any value to a channel using the same set of formatting rules - as any_to_string - - - - - Convert any value to a string using a standard formatter - Data is typically formatted in a structured format, e.g. - lists are formatted using the "[1;2]" notation. - The details of the format are not specified and may change - from version to version and according to the flags given - to the F# compiler. The format is intended to be human-readable, - not machine readable. If alternative generic formats are required - you should develop your own formatter, using the code in the - implementation of this file as a starting point. - - Data from other .NET languages is formatted using a virtual - call to Object.ToString() on the boxed version of the input. - - - - - - - - For limitting layout of list-like sequences (lists,arrays,etc). - unfold a list of items using (project and z) making layout list via itemL. - If reach maxLength (before exhausting) then truncate. - - - - - See tagL - - - - - Layout like an F# list. - - - - - Layout like an F# option. - - - - - Layout list vertically. - - - - - Layout two vertically. - - - - - Form tuple of layouts. - - - - - Wrap braces around layout. - - - - - Wrap square brackets around layout. - - - - - Wrap round brackets around Layout. - - - - - Join layouts into a list separated using the given Layout. - - - - - Join layouts into a semi-colon separated list. - - - - - Join layouts into a space separated list. - - - - - Join layouts into a comma separated list. - - - - - Join broken with ident=2 - - - - - Join broken with ident=1 - - - - - Join broken with ident=0 - - - - - Join, possible break with indent=2 - - - - - Join, possible break with indent=1 - - - - - Join, possible break with indent=0 - - - - - Join, unbreakable. - - - - - An string which is left parenthesis (no space on the right). - - - - - An string which is right parenthesis (no space on the left). - - - - - An string which requires no spaces either side. - - - - - An string leaf - - - - - An uninterpreted leaf, to be interpreted into a string - by the layout engine. This allows leaf layouts for numbers, strings and - other atoms to be customized according to culture. - - - - - Is it the empty layout? - - - - - The empty layout - - - - - A layout is a sequence of strings which have been joined together. - The strings are classified as words, separators and left and right parenthesis. - This classification determines where spaces are inserted. - A joint is either unbreakable, breakable or broken. - If a joint is broken the RHS layout occurs on the next line with optional indentation. - A layout can be squashed to for given width which forces breaks as required. - - - - - Return the given big integer - - - - - Return the negation of a big integer - - - - - Return the difference of two big integers - - - - - Return the product of big integers - - - - - Return the modulus of big integers - - - - - This operator is for consistency when this type be used from other CLI languages - - - - - This operator is for consistency when this type be used from other CLI languages - - - - - This operator is for consistency when this type be used from other CLI languages - - - - - This operator is for consistency when this type be used from other CLI languages - - - - - This operator is for consistency when this type be used from other CLI languages - - - - - Convert a big integer to a 32-bit signed integer - - - - - Convert a big integer to a 64-bit signed integer - - - - - Convert a big integer to a floating point number - - - - - This operator is for consistency when this type be used from other CLI languages - - - - - Return the ratio of two big integers - - - - - Return the sum of two big integers - - - - - Get the big integer for zero - - - - - Return the sign of a big integer: 0, +1 or -1 - - - - - Get the big integer for one - - - - - Return true if a big integer is 'zero' - - - - - Return true if a big integer is 'one' - - - - - - - - Return n^m for two big integers - - - - - Parse a big integer from a string format - - - - - Return the greatest common divisor of two big integers - - - - - - - - - - - Compute the ratio and remainder of two big integers - - - - - Compute the absolute value of a big integer - - - - - Construct a BigInteger value for the given 64-bit integer - - - - - Construct a BigInteger value for the given integer - - - - - The type of arbitrary-sized integers - - - - diff --git a/packages/FSharp.Core/lib/portable-net45+netcore45/FSharp.Core.dll b/packages/FSharp.Core/lib/portable-net45+netcore45/FSharp.Core.dll deleted file mode 100644 index c909293c..00000000 Binary files a/packages/FSharp.Core/lib/portable-net45+netcore45/FSharp.Core.dll and /dev/null differ diff --git a/packages/FSharp.Core/lib/portable-net45+netcore45/FSharp.Core.optdata b/packages/FSharp.Core/lib/portable-net45+netcore45/FSharp.Core.optdata deleted file mode 100644 index daf1206e..00000000 Binary files a/packages/FSharp.Core/lib/portable-net45+netcore45/FSharp.Core.optdata and /dev/null differ diff --git a/packages/FSharp.Core/lib/portable-net45+netcore45/FSharp.Core.sigdata b/packages/FSharp.Core/lib/portable-net45+netcore45/FSharp.Core.sigdata deleted file mode 100644 index ada7a6b2..00000000 Binary files a/packages/FSharp.Core/lib/portable-net45+netcore45/FSharp.Core.sigdata and /dev/null differ diff --git a/packages/FSharp.Core/lib/portable-net45+netcore45/FSharp.Core.xml b/packages/FSharp.Core/lib/portable-net45+netcore45/FSharp.Core.xml deleted file mode 100644 index 200b920e..00000000 --- a/packages/FSharp.Core/lib/portable-net45+netcore45/FSharp.Core.xml +++ /dev/null @@ -1,10653 +0,0 @@ - - -FSharp.Core - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Gets the tail of the list, which is a list containing all the elements of the list, excluding the first element - - - Gets the number of items contained in the list - - - Gets the element of the list at the given position. - Lists are represented as linked lists so this is an O(n) operation. - The index. - The value at the given index. - - - Gets a value indicating if the list contains no entries - - - Gets the first element of the list - - - Returns an empty list of a particular type - - - Returns a list with head as its first element and tail as its subsequent elements - A new head value for the list. - The existing list. - The list with head appended to the front of tail. - - - The type of immutable singly-linked lists. - - Use the constructors [] and :: (infix) to create values of this type, or - the notation [1;2;3]. Use the values in the List module to manipulate - values of this type, or pattern match against the values directly. - - - Lookup an element in the map. Raise KeyNotFoundException if no binding - exists in the map. - The input key. - Thrown when the key is not found. - The value mapped to the key. - - - Returns true if there are no bindings in the map. - - - The number of bindings in the map. - - - Lookup an element in the map, returning a Some value if the element is in the domain - of the map and None if not. - The input key. - The mapped value, or None if the key is not in the map. - - - Removes an element from the domain of the map. No exception is raised if the element is not present. - The input key. - The resulting map. - - - - - - Tests if an element is in the domain of the map. - The input key. - True if the map contains the given key. - - - Returns a new map with the binding added to the given map. - The input key. - The resulting map. - - - Builds a map that contains the bindings of the given IEnumerable. - The input sequence of key/value pairs. - The resulting map. - - - Immutable maps. Keys are ordered by F# generic comparison. - - Maps based on generic comparison are efficient for small keys. They are not a suitable choice if keys are recursive data structures - or if keys require bespoke comparison semantics. - - All members of this class are thread-safe and may be used concurrently from multiple threads. - - - An abbreviation for the CLI type System.Collections.Generic.List<_> - - - Returns a new set with the elements of the second set removed from the first. - The first input set. - The second input set. - A set containing elements of the first set that are not contained in the second set. - - - Compute the union of the two sets. - The first input set. - The second input set. - The union of the two input sets. - - - Returns the lowest element in the set according to the ordering being used for the set. - - - Returns the highest element in the set according to the ordering being used for the set. - - - A useful shortcut for Set.isEmpty. See the Set module for further operations on sets. - - - The number of elements in the set - - - A useful shortcut for Set.remove. Note this operation produces a new set - and does not mutate the original set. The new set will share many storage - nodes with the original. See the Set module for further operations on sets. - The value to remove from the set. - The result set. - - - Evaluates to "true" if all elements of the second set are in the first. - The set to test against. - True if this set is a superset of otherSet. - - - Evaluates to "true" if all elements of the first set are in the second. - The set to test against. - True if this set is a subset of otherSet. - - - Evaluates to "true" if all elements of the second set are in the first, and at least - one element of the first is not in the second. - The set to test against. - True if this set is a proper superset of otherSet. - - - Evaluates to "true" if all elements of the first set are in the second, and at least - one element of the second is not in the first. - The set to test against. - True if this set is a proper subset of otherSet. - - - - - - A useful shortcut for Set.contains. See the Set module for further operations on sets. - The value to check. - True if the set contains value. - - - A useful shortcut for Set.add. Note this operation produces a new set - and does not mutate the original set. The new set will share many storage - nodes with the original. See the Set module for further operations on sets. - The value to add to the set. - The result set. - - - Create a set containing elements drawn from the given sequence. - The input sequence. - The result set. - - - Immutable sets based on binary trees, where comparison is the - F# structural comparison function, potentially using implementations - of the IComparable interface on key values. - - See the Set module for further operations on sets. - - All members of this class are thread-safe and may be used concurrently from multiple threads. - - - An abbreviation for the type of immutable singly-linked lists. - - Use the constructors [] and :: (infix) to create values of this type, or - the notation [1;2;3]. Use the values in the List module to manipulate - values of this type, or pattern match against the values directly. - - - An abbreviation for the CLI type System.Collections.Generic.IEnumerable<_> - - - Fetches an element from a 2D array. You can also use the syntax array.[index1,index2]. - - The input array. - The index along the first dimension. - The index along the second dimension. - - The value of the array at the given index. - Thrown when the indices are negative or exceed the bounds of the array. - - - Sets the value of an element in an array. You can also use the syntax array.[index1,index2] <- value. - - The input array. - The index along the first dimension. - The index along the second dimension. - The value to set in the array. - Thrown when the indices are negative or exceed the bounds of the array. - - - Builds 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. - - The input array. - - The zero-based output array. - - - Builds 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 propagated to the output - array. - - A function that is applied to transform each element of the array. The two integers - provide the index of the element. - The input array. - - An array whose elements have been transformed by the given mapping. - - - Builds 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. - - A function that is applied to transform each item of the input array. - The input array. - - An array whose elements have been transformed by the given mapping. - - - Returns the length of an array in the second dimension. - - The input array. - - The length of the array in the second dimension. - - - Returns the length of an array in the first dimension. - - The input array. - - The length of the array in the first dimension. - - - Applies the given function to each element of the array. The integer indices passed to the - function indicates the index of element. - - A function to apply to each element of the array with the indices available as an argument. - The input array. - - - Applies the given function to each element of the array. - - A function to apply to each element of the array. - The input array. - - - Creates a based array where the entries are initially Unchecked.defaultof<'T>. - - The base for the first dimension of the array. - The base for the second dimension of the array. - The length of the first dimension of the array. - The length of the second dimension of the array. - - The created array. - Thrown when base1, base2, length1, or length2 is negative. - - - Creates a based array whose elements are all initially the given value. - - The base for the first dimension of the array. - The base for the second dimension of the array. - The length of the first dimension of the array. - The length of the second dimension of the array. - The value to populate the new array. - - The created array. - Thrown when base1, base2, length1, or length2 is negative. - - - Creates a based array given the dimensions and a generator function to compute the elements. - - The base for the first dimension of the array. - The base for the second dimension of the array. - The length of the first dimension of the array. - The length of the second dimension of the array. - A function to produce elements of the array given the two indices. - - The created array. - Thrown when base1, base2, length1, or length2 is negative. - - - Creates an array where the entries are initially Unchecked.defaultof<'T>. - - The length of the first dimension of the array. - The length of the second dimension of the array. - - The created array. - Thrown when length1 or length2 is negative. - - - Creates an array whose elements are all initially the given value. - - The length of the first dimension of the array. - The length of the second dimension of the array. - The value to populate the new array. - - The created array. - Thrown when length1 or length2 is negative. - - - Creates an array given the dimensions and a generator function to compute the elements. - - The length of the first dimension of the array. - The length of the second dimension of the array. - A function to produce elements of the array given the two indices. - - The generated array. - Thrown when either of the lengths is negative. - - - Reads a range of elements from the first array and write them into the second. - - The source array. - The first-dimension index to begin copying from in the source array. - The second-dimension index to begin copying from in the source array. - The target array. - The first-dimension index to begin copying into in the target array. - The second-dimension index to begin copying into in the target array. - The number of elements to copy across the first dimension of the arrays. - The number of elements to copy across the second dimension of the arrays. - Thrown when any of the indices are negative or if either of - the counts are larger than the dimensions of the array allow. - - - Builds 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. - - The input array. - - A copy of the input array. - - - Fetches the base-index for the second dimension of the array. - - The input array. - - The base-index of the second dimension of the array. - - - Fetches the base-index for the first dimension of the array. - - The input array. - - The base-index of the first dimension of the array. - - - Basic operations on 2-dimensional arrays. - - F# and CLI multi-dimensional arrays are typically zero-based. - However, CLI 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 propagated to a matching output - array on the Array2D.map and Array2D.mapi operations. - Non-zero-based arrays can also be created using Array2D.zeroCreateBased, - Array2D.createBased and Array2D.initBased. - - - Creates an array where the entries are initially the "default" value. - The length of the first dimension. - The length of the second dimension. - The length of the third dimension. - The created array. - - - Sets the value of an element in an array. You can also - use the syntax 'array.[index1,index2,index3] <- value'. - The input array. - The index along the first dimension. - The index along the second dimension. - The index along the third dimension. - The value to set at the given index. - - - Builds 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. - The function to transform the elements at each index in the array. - The input array. - The array created from the transformed elements. - - - Builds 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. - The function to transform each element of the array. - The input array. - The array created from the transformed elements. - - - Returns the length of an array in the third dimension. - The input array. - The length of the array in the third dimension. - - - Returns the length of an array in the second dimension. - The input array. - The length of the array in the second dimension. - - - Returns the length of an array in the first dimension - The input array. - The length of the array in the first dimension. - - - Applies the given function to each element of the array. The integer indicies passed to the - function indicates the index of element. - The function to apply to each element of the array. - The input array. - - - Applies the given function to each element of the array. - The function to apply to each element of the array. - The input array. - - - Fetches an element from a 3D array. You can also use the syntax 'array.[index1,index2,index3]' - The input array. - The index along the first dimension. - The index along the second dimension. - The index along the third dimension. - The value at the given index. - - - Creates an array given the dimensions and a generator function to compute the elements. - The length of the first dimension. - The length of the second dimension. - The length of the third dimension. - The function to create an initial value at each index into the array. - The created array. - - - Creates an array whose elements are all initially the given value. - The length of the first dimension. - The length of the second dimension. - The length of the third dimension. - The value of the array elements. - The created array. - - - Basic operations on rank 3 arrays. - - - Sets the value of an element in an array. You can also - use the syntax 'array.[index1,index2,index3,index4] <- value'. - The input array. - The index along the first dimension. - The index along the second dimension. - The index along the third dimension. - The index along the fourth dimension. - The value to set. - - - Fetches an element from a 4D array. You can also use the syntax 'array.[index1,index2,index3,index4]' - The input array. - The index along the first dimension. - The index along the second dimension. - The index along the third dimension. - The index along the fourth dimension. - The value at the given index. - - - Creates an array where the entries are initially the "default" value. - The length of the first dimension. - The length of the second dimension. - The length of the third dimension. - The length of the fourth dimension. - The created array. - - - Returns the length of an array in the fourth dimension. - The input array. - The length of the array in the fourth dimension. - - - Returns the length of an array in the third dimension. - The input array. - The length of the array in the third dimension. - - - Returns the length of an array in the second dimension. - The input array. - The length of the array in the second dimension. - - - Returns the length of an array in the first dimension - The input array. - The length of the array in the first dimension. - - - Creates an array given the dimensions and a generator function to compute the elements. - The length of the first dimension. - The length of the second dimension. - The length of the third dimension. - The length of the fourth dimension. - The function to create an initial value at each index in the array. - The created array. - - - Creates an array whose elements are all initially the given value - The length of the first dimension. - The length of the second dimension. - The length of the third dimension. - The length of the fourth dimension. - The initial value for each element of the array. - The created array. - - - Basic operations on rank 4 arrays. - - - Combines three arrays into an array of pairs. The three arrays must have equal lengths, otherwise an ArgumentException is - raised. - The first input array. - The second input array. - The third input array. - Thrown when the input arrays differ in length. - The array of tupled elements. - - - Combines the two arrays into an array of pairs. The two arrays must have equal lengths, otherwise an ArgumentException is - raised. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - The array of tupled elements. - - - Splits an array of triples into three arrays. - The input array. - The tuple of three arrays. - - - Splits an array of pairs into two arrays. - The input array. - The two arrays. - - - Returns the index of the first element in the array - that satisfies the given predicate. - The function to test the input elements. - The input array. - The index of the first element that satisfies the predicate, or None. - - - Returns the first element for which the given function returns true. - Return None if no such element exists. - The function to test the input elements. - The input array. - The first element that satisfies the predicate, or None. - - - Views the given array as a sequence. - The input array. - The sequence of array elements. - - - Builds a list from the given array. - The input array. - The list of array elements. - - - Returns the sum of the results generated by applying the function to each element of the array. - The function to transform the array elements into the type to be summed. - The input array. - The resulting sum. - - - Returns the sum of the elements in the array. - The input array. - The resulting sum. - - - Sorts the elements of an array by mutating the array in-place, using the given comparison function. - Elements are compared using Operators.compare. - The input array. - - - Sorts the elements of an array by mutating the array in-place, using the given comparison function as the order. - The function to compare pairs of array elements. - The input array. - - - Sorts the elements of an array by mutating the array in-place, using the given projection for the keys. - Elements are compared using Operators.compare. - - This is not a stable sort, i.e. the original order of equal elements is not necessarily preserved. - For a stable sort, consider using Seq.sort. - The function to transform array elements into the type that is compared. - The input array. - - - Sorts the elements of an array, using the given comparison function as the order, returning a new array. - - This is not a stable sort, i.e. the original order of equal elements is not necessarily preserved. - For a stable sort, consider using Seq.sort. - The function to compare pairs of array elements. - The input array. - The sorted array. - - - Sorts the elements of an array, using the given projection for the keys and returning a new array. - Elements are compared using Operators.compare. - - This is not a stable sort, i.e. the original order of equal elements is not necessarily preserved. - For a stable sort, consider using Seq.sort. - The function to transform array elements into the type that is compared. - The input array. - The sorted array. - - - Sorts the elements of an array, returning a new array. Elements are compared using Operators.compare. - - This is not a stable sort, i.e. the original order of equal elements is not necessarily preserved. - For a stable sort, consider using Seq.sort. - The input array. - The sorted array. - - - Builds a new array that contains the given subrange specified by - starting index and length. - The input array. - The index of the first element of the sub array. - The length of the sub array. - The created sub array. - - - Sets an element of an array. - The input array. - The input index. - The input value. - - - Like foldBack, but return both the intermediary and final results. - The function to update the state given the input elements. - The input array. - The initial state. - The array of state values. - - - Like fold, but return the intermediary and final results. - The function to update the state given the input elements. - The initial state. - The input array. - The array of state values. - - - Returns a new array with the elements in reverse order. - The input array. - The reversed array. - - - Applies 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. - The function to reduce a pair of elements to a single element. - The input array. - Thrown when the input array is empty. - The final result of the reductions. - - - Applies 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. - The function to reduce a pair of elements to a single element. - The input array. - Thrown when the input array is empty. - The final result of the redcutions. - - - Returns an array with all elements permuted according to the - specified permutation. - The function that maps input indices to output indices. - The input array. - The output array. - - - Splits the collection into two collections, containing the - elements for which the given predicate returns "true" and "false" - respectively. - The function to test the input elements. - The input array. - A pair of arrays. The first containing the elements the predicate evaluated to true, - and the second containing those evaluated to false. - - - Builds a new array from the given enumerable object. - The input sequence. - The array of elements from the sequence. - - - Builds an array from the given list. - The input list. - The array of elements from the list. - - - Returns the lowest of all elements of the array, compared via Operators.min on the function result. - - Throws ArgumentException for empty arrays. - The function to transform the elements into a type supporting comparison. - The input array. - Thrown when the input array is empty. - The minimum element. - - - Returns the lowest of all elements of the array, compared via Operators.min. - - Throws ArgumentException for empty arrays - The input array. - Thrown when the input array is empty. - The minimum element. - - - Returns the greatest of all elements of the array, compared via Operators.max on the function result. - - Throws ArgumentException for empty arrays. - The function to transform the elements into a type supporting comparison. - The input array. - Thrown when the input array is empty. - The maximum element. - - - Returns the greatest of all elements of the array, compared via Operators.max on the function result. - - Throws ArgumentException for empty arrays. - The input array. - Thrown when the input array is empty. - The maximum element. - - - Builds 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. - The function to transform elements and their indices. - The input array. - The array of transformed elements. - - - Builds 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. - The function to transform pairs of input elements and their indices. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - The array of transformed elements. - - - Builds 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. - The function to transform the pairs of the input elements. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - The array of transformed elements. - - - Builds a new array whose elements are the results of applying the given function - to each of the elements of the array. - The function to transform elements of the array. - The input array. - The array of transformed elements. - - - Returns the length of an array. You can also use property arr.Length. - The input array. - The length of the array. - - - Applies 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. - The function to apply to each index and pair of elements. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - - - Applies the given function to each element of the array. The integer passed to the - function indicates the index of element. - The function to apply to each index and element. - The input array. - - - Applies 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. - The function to apply. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - - - Applies the given function to each element of the array. - The function to apply. - The input array. - - - Returns true if the given array is empty, otherwise false. - The input array. - True if the array is empty. - - - Creates an array where the entries are initially the default value Unchecked.defaultof<'T>. - The length of the array to create. - The created array. - - - Creates an array given the dimension and a generator function to compute the elements. - The number of elements to initialize. - The function to generate the initial values for each index. - The created array. - - - Gets an element from an array. - The input array. - The input index. - The value of the array at the given index. - - - 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. - The function to update the state given the input elements. - The first input array. - The second input array. - The initial state. - Thrown when the input arrays differ in length. - The final state. - - - Applies 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. - The function to update the state given the input elements. - The initial state. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - The final state. - - - Applies 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)) - The function to update the state given the input elements. - The input array. - The initial state. - The final state. - - - Applies 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 - The function to update the state given the input elements. - The initial state. - The input array. - The final state. - - - Tests 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. - The function to test the input elements. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - True if all of the array elements satisfy the predicate. - - - Tests 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. - The function to test the input elements. - The input array. - True if all of the array elements satisfy the predicate. - - - Returns the index of the first element in the array - that satisfies the given predicate. Raise KeyNotFoundException if - none of the elements satisy the predicate. - The function to test the input elements. - The input array. - Thrown if predicate - never returns true. - The index of the first element in the array that satisfies the given predicate. - - - Returns the first element for which the given function returns 'true'. - Raise KeyNotFoundException if no such element exists. - The function to test the input elements. - The input array. - Thrown if predicate - never returns true. - The first element for which predicate returns true. - - - Returns a new collection containing only the elements of the collection - for which the given predicate returns "true". - The function to test the input elements. - The input array. - An array containing the elements for which the given predicate returns true. - - - Tests 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. - The function to test the input elements. - The first input array. - The second input array. - True if any result from predicate is true. - - - Tests 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. - The function to test the input elements. - The input array. - True if any result from predicate is true. - - - Returns an empty array of the given type. - - - Applies the given function to each element of the array. Returns - the array comprised of the results "x" for each element where - the function returns Some(x) - The function to generate options from the elements. - The input array. - The array of results. - - - Applies 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. - The function to generate options from the elements. - The input array. - Thrown if every result from - chooser is None. - The first result. - - - Fills a range of elements of the array with the given value. - The target array. - The index of the first element to set. - The number of elements to set. - The value to set. - - - Applies 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. - The function to transform the array elements into options. - The input array. - The first transformed element that is Some(x). - - - Creates an array whose elements are all initially the given value. - The length of the array to create. - The value for the elements. - The created array. - - - Builds a new array that contains the elements of the given array. - The input array. - A copy of the input array. - - - Builds a new array that contains the elements of each of the given sequence of arrays. - The input sequence of arrays. - The concatenation of the sequence of input arrays. - - - For each element of the array, applies the given function. Concatenates all the results and return the combined array. - The function to create sub-arrays from the input array elements. - The input array. - The concatenation of the sub-arrays. - - - Reads a range of elements from the first array and write them into the second. - The source array. - The starting index of the source array. - The target array. - The starting index of the target array. - The number of elements to copy. - - - Returns the average of the elements generated by applying the function to each element of the array. - The function to transform the array elements before averaging. - The input array. - Thrown when array is empty. - The computed average. - - - Returns the average of the elements in the array. - The input array. - Thrown when array is empty. - The average of the elements in the array. - - - Builds a new array that contains the elements of the first array followed by the elements of the second array. - The first input array. - The second input array. - The resulting array. - - - 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. - The function to test the input elements. - The input array. - 'T[] * 'T[] - - - 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. - - - 'T[] - - - 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. - - The input 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. - - The input 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. - - 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. - - The input 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. - - The input array. - 'U[] - - - 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. - - The input array. - '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). - - 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. - The function to generate options from the elements. - The input array. - 'U[] - - - Provides parallel operations on arrays - - - Basic operations on arrays. - - - Compare using the given comparer function. - A function to compare two values. - An object implementing IComparer using the supplied comparer. - - - Structural comparison. Compare using Operators.compare. - - - Common notions of comparison identity used with sorted data structures. - - - Hash using the given hashing and equality functions. - A function to generate a hash code from a value. - A function to test equality of two values. - An object implementing IEqualityComparer using the supplied functions. - - - Physical hashing (hash on reference identity of objects, and the contents of value types). - Hash using LanguagePrimitives.PhysicalEquality and LanguagePrimitives.PhysicalHash, - That is, for value types use GetHashCode and Object.Equals (if no other optimization available), - and for reference types use System.Runtime.CompilerServices.RuntimeHelpers.GetHashCode and - reference equality. - - - - - - Structural hashing. Hash using Operators.(=) and Operators.hash. - - - Common notions of value identity used with hash tables. - - - Combines the three lists into a list of triples. The lists must have equal lengths. - The first input list. - The second input list. - The third input list. - A single list containing triples of matching elements from the input lists. - - - Combines the two lists into a list of pairs. The two lists must have equal lengths. - The first input list. - The second input list. - A single list containing pairs of matching elements from the input lists. - - - Splits a list of triples into three lists. - The input list. - Three lists of split elements. - - - Splits a list of pairs into two lists. - The input list. - Two lists of split elements. - - - Returns the index of the first element in the list - that satisfies the given predicate. - Return None if no such element exists. - The function to test the input elements. - The input list. - The index of the first element for which the predicate returns true, or None if - every element evaluates to false. - - - Returns the first element for which the given function returns true.. - Return None if no such element exists. - The function to test the input elements. - The input list. - The first element for which the predicate returns true, or None if - every element evaluates to false. - - - Applies the given function to successive elements, returning Some(x) the first - result where function returns Some(x) for some x. If no such element - exists then return None. - The function to generate options from the elements. - The input list. - The first resulting value or None. - - - Views the given list as a sequence. - The input list. - The sequence of elements in the list. - - - Builds an array from the given list. - The input list. - The array containing the elements of the list. - - - Returns the list after removing the first element. - - The input list. - Thrown when the list is empty. - The list after removing the first element. - - - Returns the sum of the results generated by applying the function to each element of the list. - The function to transform the list elements into the type to be summed. - The input list. - The resulting sum. - - - Returns the sum of the elements in the list. - The input list. - The resulting sum. - - - Sorts the given list using Operators.compare. - - This is a stable sort, i.e. the original order of equal elements is preserved. - The input list. - The sorted list. - - - Sorts the given list using keys given by the given projection. Keys are compared using Operators.compare. - - This is a stable sort, i.e. the original order of equal elements is preserved. - The function to transform the list elements into the type to be compared. - The input list. - The sorted list. - - - Sorts the given list using the given comparison function. - - This is a stable sort, i.e. the original order of equal elements is preserved. - The function to compare the list elements. - The input list. - The sorted list. - - - Like foldBack, but returns both the intermediary and final results - The function to update the state given the input elements. - The input list. - The initial state. - The list of states. - - - Applies a function to each element of the collection, threading an accumulator argument - through the computation. Take the second argument, and apply the function to it - and the first element of the list. Then feed this result into the function along - with the second element and so on. Returns the list of intermediate results and the final result. - The function to update the state given the input elements. - The initial state. - The input list. - The list of states. - - - Returns a new list with the elements in reverse order. - The input list. - The reversed list. - - - Creates a list by calling the given generator on each index. - The number of elements to replicate. - The value to replicate - The generated list. - - - Applies 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 i0 (...(f iN-1 iN)). - - Raises System.ArgumentException if list is empty - The function to reduce two list elements to a single element. - The input list. - Thrown when the list is empty. - The final reduced value. - - - Apply a function to each element of the collection, threading an accumulator argument - through the computation. Apply the function to the first two elements of the list. - Then feed this result into the function along with the third element and so on. - Return the final result. If the input function is f and the elements are i0...iN then computes - f (... (f i0 i1) i2 ...) iN. - - Raises System.ArgumentException if list is empty - The function to reduce two list elements to a single element. - The input list. - Thrown when the list is empty. - The final reduced value. - - - Returns a list with all elements permuted according to the - specified permutation. - The function to map input indices to output indices. - The input list. - The permutated list. - - - Applies the given function to successive elements, returning the first - result where function returns Some(x) for some x. If no such - element exists then raise System.Collections.Generic.KeyNotFoundException - The function to generate options from the elements. - The input list. - Thrown when the list is empty. - The first resulting value. - - - Splits the collection into two collections, containing the - elements for which the given predicate returns true and false - respectively. Element order is preserved in both of the created lists. - The function to test the input elements. - The input list. - A list containing the elements for which the predicate evaluated to false and a list - containing the elements for which the predicate evaluated to true. - - - Builds a new list from the given enumerable object. - The input sequence. - The list of elements from the sequence. - - - Builds a list from the given array. - The input array. - The list of elements from the array. - - - Indexes into the list. The first element has index 0. - The input list. - The index to retrieve. - The value at the given index. - - - Returns the lowest of all elements of the list, compared via Operators.min on the function result - - Raises System.ArgumentException if list is empty. - The function to transform list elements into the type to be compared. - The input list. - Thrown when the list is empty. - The minimum value. - - - Returns the lowest of all elements of the list, compared via Operators.min. - - Raises System.ArgumentException if list is empty - The input list. - Thrown when the list is empty. - The minimum value. - - - Returns the greatest of all elements of the list, compared via Operators.max on the function result. - - Raises System.ArgumentException if list is empty. - The function to transform the list elements into the type to be compared. - The input list. - Thrown when the list is empty. - The maximum element. - - - Return the greatest of all elements of the list, compared via Operators.max. - - Raises System.ArgumentException if list is empty - The input list. - Thrown when the list is empty. - The maximum element. - - - Like mapi, but mapping corresponding elements from two lists of equal length. - The function to transform pairs of elements from the two lists and their index. - The first input list. - The second input list. - The list of transformed elements. - - - Builds a new collection whose elements are the results of applying the given function - to each of the elements of the collection. The integer index passed to the - function indicates the index (from 0) of element being transformed. - The function to transform elements and their indices. - The input list. - The list of transformed elements. - - - Builds a new collection whose elements are the results of applying the given function - to the corresponding elements of the three collections simultaneously. - The function to transform triples of elements from the input lists. - The first input list. - The second input list. - The third input list. - The list of transformed elements. - - - Builds a new collection whose elements are the results of applying the given function - to the corresponding elements of the two collections pairwise. - The function to transform pairs of elements from the input lists. - The first input list. - The second input list. - The list of transformed elements. - - - Builds a new collection whose elements are the results of applying the given function - to each of the elements of the collection. - The function to transform elements from the input list. - The input list. - The list of transformed elements. - - - Returns the length of the list. - The input list. - The length of the list. - - - Applies the given function to two collections simultaneously. The - collections must have identical size. The integer passed to the - function indicates the index of element. - The function to apply to a pair of elements from the input lists along with their index. - The first input list. - The second input list. - - - Applies the given function to each element of the collection. The integer passed to the - function indicates the index of element. - The function to apply to the elements of the list along with their index. - The input list. - - - Applies the given function to two collections simultaneously. The - collections must have identical size. - The function to apply to pairs of elements from the input lists. - The first input list. - The second input list. - - - Applies the given function to each element of the collection. - The function to apply to elements from the input list. - The input list. - - - Returns true if the list contains no elements, false otherwise. - The input list. - True if the list is empty. - - - Creates a list by calling the given generator on each index. - The length of the list to generate. - The function to generate an element from an index. - The list of generated elements. - - - Returns the first element of the list. - - The input list. - Thrown when the list is empty. - The first element of the list. - - - Tests if all corresponding elements of the collection 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 System.ArgumentException exception is raised. - Otherwise, true is returned. - The function to test the input elements. - The first input list. - The second input list. - Thrown when the input lists differ in length. - True if all of the pairs of elements satisfy the predicate. - - - Tests if all elements of the collection satisfy the given predicate. - - The predicate is applied to the elements of the input list. If any application - returns false then the overall result is false and no further elements are tested. - Otherwise, true is returned. - The function to test the input elements. - The input list. - True if all of the elements satisfy the predicate. - - - Applies a function to corresponding elements of two collections, threading an accumulator argument - through the computation. The collections must have identical sizes. - If the input function is f and the elements are i0...iN and j0...jN - then computes f i0 j0 (...(f iN jN s)). - The function to update the state given the input elements. - The first input list. - The second input list. - The initial state. - The final state value. - - - Applies 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 i0 (...(f iN s)). - The function to update the state given the input elements. - The input list. - The initial state. - The final state value. - - - Applies a function to corresponding elements of two collections, threading an accumulator argument - through the computation. The collections must have identical sizes. - If the input function is f and the elements are i0...iN and j0...jN - then computes f (... (f s i0 j0)...) iN jN. - The function to update the state given the input elements. - The initial state. - The first input list. - The second input list. - The final state value. - - - Applies a function to each element of the collection, threading an accumulator argument - through the computation. Take the second argument, and apply the function to it - and the first element of the list. Then feed this result into the function along - with the second element and so on. Return the final result. - If the input function is f and the elements are i0...iN then - computes f (... (f s i0) i1 ...) iN. - The function to update the state given the input elements. - The initial state. - The input list. - The final state value. - - - Returns a new collection containing only the elements of the collection - for which the given predicate returns "true" - The function to test the input elements. - The input list. - A list containing only the elements that satisfy the predicate. - - - Returns the index of the first element in the list - that satisfies the given predicate. - Raises KeyNotFoundException if no such element exists. - The function to test the input elements. - The input list. - Thrown if the predicate evaluates to false for all the - elements of the list. - The index of the first element that satisfies the predicate. - - - Returns the first element for which the given function returns true. - Raises KeyNotFoundException if no such element exists. - The function to test the input elements. - The input list. - Thrown if the predicate evaluates to false for - all the elements of the list. - The first element that satisfies the predicate. - - - Tests if any pair of corresponding elements of the lists 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 System.ArgumentException exception is raised. - Otherwise, false is returned. - The function to test the input elements. - The first input list. - The second input list. - Thrown when the input lists differ in length. - True if any pair of elements satisfy the predicate. - - - Tests if any element of the list satisfies the given predicate. - - The predicate is applied to the elements of the input list. If any application - returns true then the overall result is true and no further elements are tested. - Otherwise, false is returned. - The function to test the input elements. - The input list. - True if any element satisfies the predicate. - - - Returns an empty list of the given type. - - - Returns a new list that contains the elements of each the lists in order. - The input sequence of lists. - The resulting concatenated list. - - - For each element of the list, applies the given function. Concatenates all the results and return the combined list. - The function to transform each input element into a sublist to be concatenated. - The input list. - The concatenation of the transformed sublists. - - - Applies the given function to each element of the list. Returns - the list comprised of the results x for each element where - the function returns Some(x) - The function to generate options from the elements. - The input list. - The list comprising the values selected from the chooser function. - - - Returns the average of the elements generated by applying the function to each element of the list. - - Raises System.ArgumentException if list is empty. - The function to transform the list elements into the type to be averaged. - The input list. - Thrown when the list is empty. - The resulting average. - - - Returns the average of the elements in the list. - - Raises System.ArgumentException if list is empty. - The input list. - Thrown when the list is empty. - The resulting average. - - - Returns a new list that contains the elements of the first list - followed by elements of the second. - The first input list. - The second input list. - The resulting list. - - - Basic operations on lists. - - - Returns the key of the first mapping in the collection that satisfies the given predicate. - Returns 'None' if no such element exists. - The function to test the input elements. - The input map. - The first key for which the predicate returns true or None if the predicate evaluates to false for each key/value pair. - - - Evaluates the function on each mapping in the collection. Returns the key for the first mapping - where the function returns 'true'. Raise KeyNotFoundException if no such element exists. - The function to test the input elements. - The input map. - Thrown if the key does not exist in the map. - The first key for which the predicate evaluates true. - - - Lookup an element in the map, returning a Some value if the element is in the domain - of the map and None if not. - The input key. - The input map. - The found Some value or None. - - - Removes an element from the domain of the map. No exception is raised if the element is not present. - The input key. - The input map. - The resulting map. - - - Builds two new maps, one containing the bindings for which the given predicate returns 'true', - and the other the remaining bindings. - The function to test the input elements. - The input map. - A pair of maps in which the first contains the elements for which the predicate returned true - and the second containing the elements for which the predicated returned false. - - - Tests if an element is in the domain of the map. - The input key. - The input map. - True if the map contains the key. - - - Builds a new collection whose elements are the results of applying the given function - to each of the elements of the collection. The key passed to the - function indicates the key of element being transformed. - The function to transform the key/value pairs. - The input map. - The resulting map of keys and transformed values. - - - Returns true if the given predicate returns true for all of the - bindings in the map. - The function to test the input elements. - The input map. - True if the predicate evaluates to true for all of the bindings in the map. - - - Builds a new map containing only the bindings for which the given predicate returns 'true'. - The function to test the key/value pairs. - The input map. - The filtered map. - - - Returns true if the given predicate returns true for one of the - bindings in the map. - The function to test the input elements. - The input map. - True if the predicate returns true for one of the key/value pairs. - - - Applies the given function to each binding in the dictionary - The function to apply to each key/value pair. - The input map. - - - Folds over the bindings in the map - The function to update the state given the input key/value pairs. - The initial state. - The input map. - The final state value. - - - Folds over the bindings in the map. - The function to update the state given the input key/value pairs. - The input map. - The initial state. - The final state value. - - - Searches the map looking for the first element where the given function returns a Some value - The function to generate options from the key/value pairs. - The input map. - The first result. - - - Searches the map looking for the first element where the given function returns a Some value. - The function to generate options from the key/value pairs. - The input map. - The first result. - - - Lookup an element in the map, raising KeyNotFoundException if no binding - exists in the map. - The input key. - The input map. - Thrown when the key does not exist in the map. - The value mapped to the given key. - - - The empty map. - - - Is the map empty? - The input map. - True if the map is empty. - - - Returns an array of all key-value pairs in the mapping. - The array will be ordered by the keys of the map. - The input map. - The array of key/value pairs. - - - Returns a list of all key-value pairs in the mapping. - The list will be ordered by the keys of the map. - The input map. - The list of key/value pairs. - - - Views the collection as an enumerable sequence of pairs. - The sequence will be ordered by the keys of the map. - The input map. - The sequence of key/value pairs. - - - Returns a new map made from the given bindings. - The input sequence of key/value pairs. - The resulting map. - - - Returns a new map made from the given bindings. - The input array of key/value pairs. - The resulting map. - - - Returns a new map made from the given bindings. - The input list of key/value pairs. - The resulting map. - - - Returns a new map with the binding added to the given map. - The input key. - The input value. - The input map. - The resulting map. - - - Functional programming operators related to the Map<_,_> type. - - - Combines the three sequences into a list of triples. The sequences need not have equal lengths: - when one sequence is exhausted any remaining elements in the other - sequences are ignored. - - The first input sequence. - The second input sequence. - The third input sequence. - - The result sequence. - - Thrown when any of the input sequences is null. - - - Combines the two sequences into a list of pairs. The two sequences need not have equal lengths: - when one sequence is exhausted any remaining elements in the other - sequence are ignored. - - The first input sequence. - The second input sequence. - - The result sequence. - - Thrown when either of the input sequences is null. - - - Returns a sequence that yields sliding windows of containing elements drawn from the input - sequence. Each window is returned as a fresh array. - - The number of elements in each window. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - - - Returns a sequence that contains the elements generated by the given computation. - The given initial state argument is passed to the element generator. - For each IEnumerator elements in the stream are generated on-demand by applying the element - generator, until a None value is returned by the element generator. Each call to the element - generator returns a new residual state. - - The stream will be recomputed each time an IEnumerator is requested and iterated for the Seq. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - A function that takes in the current state and returns an option tuple of the next - element of the sequence and the next state value. - The initial state value. - - The result sequence. - - - Returns a sequence that when enumerated returns at most N elements. - - The maximum number of items to enumerate. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Applies the given function to successive elements, returning the first - result where the function returns "Some(x)". - - A function that transforms items from the input sequence into options. - The input sequence. - - The chosen element or None. - - Thrown when the input sequence is null. - - - Returns the index of the first element in the sequence - that satisfies the given predicate. Return None if no such element exists. - - A function that evaluates to a Boolean when given an item in the sequence. - The input sequence. - - The found index or None. - - Thrown when the input sequence is null. - - - Returns the first element for which the given function returns true. - Return None if no such element exists. - - A function that evaluates to a Boolean when given an item in the sequence. - The input sequence. - - The found element or None. - - Thrown when the input sequence is null. - - - Builds a list from the given collection. - - The input sequence. - - The result list. - - Thrown when the input sequence is null. - - - Builds an array from the given collection. - - The input sequence. - - The result array. - - Thrown when the input sequence is null. - - - Returns a sequence that, when iterated, yields elements of the underlying sequence while the - given predicate returns true, and then returns no further elements. - - A function that evaluates to false when no more items should be returned. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns the first N elements of the sequence. - Throws InvalidOperationException - if the count exceeds the number of elements in the sequence. Seq.truncate - returns as many items as the sequence contains instead of throwing an exception. - - The number of items to take. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - Thrown when count exceeds the number of elements - in the sequence. - - - Returns the sum of the results generated by applying the function to each element of the sequence. - The generated elements are summed using the + operator and Zero property associated with the generated type. - - A function to transform items from the input sequence into the type that will be summed. - The input sequence. - - The computed sum. - - - Returns the sum of the elements in the sequence. - - The elements are summed using the + operator and Zero property associated with the generated type. - - The input sequence. - - The computed sum. - - - Applies a key-generating function to each element of a sequence and yield a sequence ordered - by keys. The keys are compared using generic comparison as implemented by Operators.compare. - - This function returns a sequence that digests the whole initial sequence as soon as - that sequence is iterated. As a result this function should not be used with - large or infinite sequences. The function makes no assumption on the ordering of the original - sequence. - - This is a stable sort, that is the original order of equal elements is preserved. - - A function to transform items of the input sequence into comparable keys. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Yields a sequence ordered by keys. - - This function returns a sequence that digests the whole initial sequence as soon as - that sequence is iterated. As a result this function should not be used with - large or infinite sequences. The function makes no assumption on the ordering of the original - sequence. - - This is a stable sort, that is the original order of equal elements is preserved. - - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns a sequence that, when iterated, skips elements of the underlying sequence while the - given predicate returns true, and then yields the remaining elements of the sequence. - - A function that evaluates an element of the sequence to a boolean value. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns a sequence that skips N elements of the underlying sequence and then yields the - remaining elements of the sequence. - - The number of items to skip. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - Thrown when count exceeds the number of elements - in the sequence. - - - Returns a sequence that yields one item only. - - The input item. - - The result sequence of one item. - - - Like fold, but computes on-demand and returns the sequence of intermediary and final results. - - A function that updates the state with each element from the sequence. - The initial state. - The input sequence. - - The resulting sequence of computed states. - - Thrown when the input sequence is null. - - - Applies a function to each element of the sequence, threading an accumulator argument - through the computation. Begin by applying the function to the first two elements. - Then feed this result into the function along with the third element and so on. - Return the final result. - - A function that takes in the current accumulated result and the next - element of the sequence to produce the next accumulated result. - The input sequence. - - The final result of the reduction function. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - - - Builds a new sequence object that delegates to the given sequence object. This ensures - the original sequence cannot be rediscovered and mutated by a type cast. For example, - if given an array the returned sequence will return the elements of the array, but - you cannot cast the returned sequence object to an array. - - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Applies the given function to successive elements, returning the first - x where the function returns "Some(x)". - - A function to transform each item of the input sequence into an option of the output type. - The input sequence. - - The selected element. - - Thrown when the input sequence is null. - Thrown when every item of the sequence - evaluates to None when the given function is applied. - - - Returns a sequence of each element in the input sequence and its predecessor, with the - exception of the first element which is only returned as the predecessor of the second element. - - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Views the given list as a sequence. - - The input list. - - The result sequence. - - - Views the given array as a sequence. - - The input array. - - The result sequence. - - Thrown when the input sequence is null. - - - Computes the nth element in the collection. - - The index of element to retrieve. - The input sequence. - - The nth element of the sequence. - - Thrown when the input sequence is null. - - - Returns the lowest of all elements of the sequence, compared via Operators.min on the function result. - - A function to transform items from the input sequence into comparable keys. - The input sequence. - - The smallest element of the sequence. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - - - Returns the lowest of all elements of the sequence, compared via Operators.min. - - The input sequence. - - The smallest element of the sequence. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - - - Returns the greatest of all elements of the sequence, compared via Operators.max on the function result. - - A function to transform items from the input sequence into comparable keys. - The input sequence. - - The largest element of the sequence. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - - - Returns the greatest of all elements of the sequence, compared via Operators.max - - The input sequence. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - - The largest element of the sequence. - - - Builds a new collection whose elements are the results of applying the given function - to each of the elements of the collection. The integer index passed to the - function indicates the index (from 0) of element being transformed. - - A function to transform items from the input sequence that also supplies the current index. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Builds a new collection whose elements are the results of applying the given function - to the corresponding pairs of elements from the two sequences. If one input sequence is shorter than - the other then the remaining elements of the longer sequence are ignored. - - A function to transform pairs of items from the input sequences. - The first input sequence. - The second input sequence. - - The result sequence. - - Thrown when either of the input sequences is null. - - - Builds a new collection whose elements are the results of applying the given function - to each of the elements of the collection. The given function will be applied - as elements are demanded using the MoveNext method on enumerators retrieved from the - object. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - A function to transform items from the input sequence. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns the length of the sequence - - The input sequence. - - The length of the sequence. - - Thrown when the input sequence is null. - - - Applies the given function to two collections simultaneously. If one sequence is shorter than - the other then the remaining elements of the longer sequence are ignored. - - A function to apply to each pair of elements from the input sequences. - The first input sequence. - The second input sequence. - - Thrown when either of the input sequences is null. - - - Applies the given function to each element of the collection. The integer passed to the - function indicates the index of element. - - A function to apply to each element of the sequence that can also access the current index. - The input sequence. - - Thrown when the input sequence is null. - - - Applies the given function to each element of the collection. - - A function to apply to each element of the sequence. - The input sequence. - - Thrown when the input sequence is null. - - - Generates a new sequence which, when iterated, will return successive - elements by calling the given function. The results of calling the function - will not be saved, that is the function will be reapplied as necessary to - regenerate the elements. The function is passed the index of the item being - generated. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - Iteration can continue up to Int32.MaxValue. - - A function that generates an item in the sequence from a given index. - - The result sequence. - - - Generates a new sequence which, when iterated, will return successive - elements by calling the given function, up to the given count. Each element is saved after its - initialization. The function is passed the index of the item being - generated. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - The maximum number of items to generate for the sequence. - A function that generates an item in the sequence from a given index. - - The result sequence. - - Thrown when count is negative. - - - Returns true if the sequence contains no elements, false otherwise. - - The input sequence. - - True if the sequence is empty; false otherwise. - - Thrown when the input sequence is null. - - - Returns the only element of the sequence. - - The input sequence. - - The last element of the sequence. - - Thrown when the input sequence is null. - Thrown when the input does not have precisely one element. - - - Returns the last element of the sequence. - - The input sequence. - - The last element of the sequence. - - Thrown when the input sequence is null. - Thrown when the input does not have any elements. - - - Returns the first element of the sequence. - - The input sequence. - - The first element of the sequence. - - Thrown when the input sequence is null. - Thrown when the input does not have any elements. - - - Applies a key-generating function to each element of a sequence and yields a sequence of - unique keys. Each unique key contains a sequence of all elements that match - to this key. - - This function returns a sequence that digests the whole initial sequence as soon as - that sequence is iterated. As a result this function should not be used with - large or infinite sequences. The function makes no assumption on the ordering of the original - sequence. - - A function that transforms an element of the sequence into a comparable key. - The input sequence. - - The result sequence. - - - Tests the all pairs of elements drawn from the two sequences satisfy the - given predicate. If one sequence is shorter than - the other then the remaining elements of the longer sequence are ignored. - - A function to test pairs of elements from the input sequences. - The first input sequence. - The second input sequence. - - True if all pairs satisfy the predicate; false otherwise. - - Thrown when either of the input sequences is null. - - - Tests if all elements of the sequence satisfy the given predicate. - - The predicate is applied to the elements of the input sequence. If any application - returns false then the overall result is false and no further elements are tested. - Otherwise, true is returned. - - A function to test an element of the input sequence. - The input sequence. - - True if every element of the sequence satisfies the predicate; false otherwise. - - Thrown when the input sequence is null. - - - Applies 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 - - A function that updates the state with each element from the sequence. - The initial state. - The input sequence. - - The state object after the folding function is applied to each element of the sequence. - - Thrown when the input sequence is null. - - - Returns the index of the first element for which the given function returns true. - - A function to test whether the index of a particular element should be returned. - The input sequence. - - The index of the first element for which the predicate returns true. - - Thrown if no element returns true when - evaluated by the predicate - Thrown when the input sequence is null - - - Returns the first element for which the given function returns true. - - A function to test whether an item in the sequence should be returned. - The input sequence. - - The first element for which the predicate returns true. - - Thrown if no element returns true when - evaluated by the predicate - Thrown when the input sequence is null - - - Returns a new collection containing only the elements of the collection - for which the given predicate returns "true". - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - Remember sequence is lazy, effects are delayed until it is enumerated. - - A synonym for Seq.filter. - - A function to test whether each item in the input sequence should be included in the output. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns a new collection containing only the elements of the collection - for which the given predicate returns "true". This is a synonym for Seq.where. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - Remember sequence is lazy, effects are delayed until it is enumerated. - - A function to test whether each item in the input sequence should be included in the output. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Tests if any pair of corresponding elements of the input sequences satisfies the given predicate. - - The predicate is applied to matching elements in the two sequences 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, false is returned. If one sequence is shorter than - the other then the remaining elements of the longer sequence are ignored. - - A function to test each pair of items from the input sequences. - The first input sequence. - The second input sequence. - - True if any result from the predicate is true; false otherwise. - - Thrown when either of the two input sequences is null. - - - Tests if any element of the sequence satisfies the given predicate. - - The predicate is applied to the elements of the input sequence. If any application - returns true then the overall result is true and no further elements are tested. - Otherwise, false is returned. - - A function to test each item of the input sequence. - The input sequence. - - True if any result from the predicate is true; false otherwise. - - Thrown when the input sequence is null. - - - Creates an empty sequence. - - An empty sequence. - - - Returns a sequence that contains no duplicate entries according to the - generic hash and equality comparisons on the keys returned by the given key-generating function. - If an element occurs multiple times in the sequence then the later occurrences are discarded. - - A function transforming the sequence items into comparable keys. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns a sequence that contains no duplicate entries according to generic hash and - equality comparisons on the entries. - If an element occurs multiple times in the sequence then the later occurrences are discarded. - - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns a sequence that is built from the given delayed specification of a - sequence. - - The input function is evaluated each time an IEnumerator for the sequence - is requested. - - The generating function for the sequence. - - - Applies a key-generating function to each element of a sequence and return a sequence yielding unique - keys and their number of occurrences in the original sequence. - - Note that this function returns a sequence that digests the whole initial sequence as soon as - that sequence is iterated. As a result this function should not be used with - large or infinite sequences. The function makes no assumption on the ordering of the original - sequence. - - A function transforming each item of input sequence into a key to be - compared against the others. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Combines the given enumeration-of-enumerations as a single concatenated - enumeration. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - The input enumeration-of-enumerations. - - The result sequence. - - Thrown when the input sequence is null. - - - Compares two sequences using the given comparison function, element by element. - Returns the first non-zero result from the comparison function. If the end of a sequence - is reached it returns a -1 if the first sequence is shorter and a 1 if the second sequence - is shorter. - - A function that takes an element from each sequence and returns an int. - If it evaluates to a non-zero value iteration is stopped and that value is returned. - The first input sequence. - The second input sequence. - - The first non-zero value from the comparison function. - - Thrown when either of the input sequences - is null. - - - Applies the given function to each element of the sequence and concatenates all the - results. - - Remember sequence is lazy, effects are delayed until it is enumerated. - - A function to transform elements of the input sequence into the sequences - that will then be concatenated. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Applies the given function to each element of the list. Return - the list comprised of the results "x" for each element where - the function returns Some(x). - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not - be accessed concurrently. - - A function to transform items of type T into options of type U. - The input sequence of type T. - - The result sequence. - - Thrown when the input sequence is null. - - - Wraps a loosely-typed System.Collections sequence as a typed sequence. - - The use of this function usually requires a type annotation. - An incorrect type annotation may result in runtime type - errors. - Individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns a sequence that corresponds to a cached version of the input sequence. - This result sequence will have the same elements as the input sequence. The result - can be enumerated multiple times. The input sequence will be enumerated at most - once and only as far as is necessary. Caching a sequence is typically useful when repeatedly - evaluating items in the original sequence is computationally expensive or if - iterating the sequence causes side-effects that the user does not want to be - repeated multiple times. - - Enumeration of the result sequence is thread safe in the sense that multiple independent IEnumerator - values may be used simultaneously from different threads (accesses to - the internal lookaside table are thread safe). Each individual IEnumerator - is not typically thread safe and should not be accessed concurrently. - - Once enumeration of the input sequence has started, - it's enumerator will be kept live by this object until the enumeration has completed. - At that point, the enumerator will be disposed. - - The enumerator may be disposed and underlying cache storage released by - converting the returned sequence object to type IDisposable, and calling the Dispose method - on this object. The sequence object may then be re-enumerated and a fresh enumerator will - be used. - - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns the average of the results generated by applying the function to each element - of the sequence. - - The elements are averaged using the + operator, DivideByInt method and Zero property - associated with the generated type. - - A function applied to transform each element of the sequence. - The input sequence. - - The average. - - Thrown when the input sequence is null. - Thrown when the input sequence has zero elements. - - - Returns the average of the elements in the sequence. - - The elements are averaged using the + operator, DivideByInt method and Zero property - associated with the element type. - - The input sequence. - - The average. - - Thrown when the input sequence is null. - Thrown when the input sequence has zero elements. - - - Wraps the two given enumerations as a single concatenated - enumeration. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed - concurrently. - - The first sequence. - The second sequence. - - The result sequence. - - Thrown when either of the two provided sequences is - null. - - - Basic operations on IEnumerables. - - - Returns a new set with the elements of the second set removed from the first. - The first input set. - The set whose elements will be removed from set1. - The set with the elements of set2 removed from set1. - - - Builds a new collection from the given enumerable object. - The input sequence. - The set containing elements. - - - Returns an ordered view of the collection as an enumerable object. - The input set. - An ordered sequence of the elements of set. - - - Builds an array that contains the elements of the set in order. - The input set. - An ordered array of the elements of set. - - - Builds a set that contains the same elements as the given array. - The input array. - A set containing the elements of array. - - - Builds a list that contains the elements of the set in order. - The input set. - An ordered list of the elements of set. - - - Builds a set that contains the same elements as the given list. - The input list. - A set containing the elements form the input list. - - - Returns the highest element in the set according to the ordering being used for the set. - The input set. - The max value from the set. - - - Returns the lowest element in the set according to the ordering being used for the set. - The input set. - The min value from the set. - - - Returns a new set with the given element removed. No exception is raised if - the set doesn't contain the given element. - The element to remove. - The input set. - The input set with value removed. - - - Splits the set into two sets containing the elements for which the given predicate - returns true and false respectively. - The function to test set elements. - The input set. - A pair of sets with the first containing the elements for which predicate returns - true and the second containing the elements for which predicate returns false. - - - Applies the given function to each element of the set, in order according - to the comparison function. - The function to apply to each element. - The input set. - - - Returns "true" if the set is empty. - The input set. - True if set is empty. - - - Computes the union of a sequence of sets. - The sequence of sets to untion. - The union of the input sets. - - - Computes the union of the two sets. - The first input set. - The second input set. - The union of set1 and set2. - - - Computes the intersection of a sequence of sets. The sequence must be non-empty. - The sequence of sets to intersect. - The intersection of the input sets. - - - Computes the intersection of the two sets. - The first input set. - The second input set. - The intersection of set1 and set2. - - - Tests if all elements of the collection satisfy the given predicate. - If the input function is f and the elements are i0...iN and "j0...jN" - then computes p i0 && ... && p iN. - The function to test set elements. - The input set. - True if all elements of set satisfy predicate. - - - Applies the given accumulating function to all the elements of the set. - The accumulating function. - The input set. - The initial state. - The final state. - - - Applies the given accumulating function to all the elements of the set - The accumulating function. - The initial state. - The input set. - The final state. - - - Returns a new collection containing the results of applying the - given function to each element of the input set. - The function to transform elements of the input set. - The input set. - A set containing the transformed elements. - - - Returns a new collection containing only the elements of the collection - for which the given predicate returns true. - The function to test set elements. - The input set. - The set containing only the elements for which predicate returns true. - - - Tests if any element of the collection satisfies the given predicate. - If the input function is predicate and the elements are i0...iN - then computes p i0 or ... or p iN. - The function to test set elements. - The input set. - True if any element of set satisfies predicate. - - - Returns the number of elements in the set. Same as size. - The input set. - The number of elements in the set. - - - Evaluates to "true" if all elements of the second set are in the first, and at least - one element of the first is not in the second. - The potential superset. - The set to test against. - True if set1 is a proper superset of set2. - - - Evaluates to "true" if all elements of the second set are in the first. - The potential superset. - The set to test against. - True if set1 is a superset of set2. - - - Evaluates to "true" if all elements of the first set are in the second, and at least - one element of the second is not in the first. - The potential subset. - The set to test against. - True if set1 is a proper subset of set2. - - - Evaluates to "true" if all elements of the first set are in the second - The potential subset. - The set to test against. - True if set1 is a subset of set2. - - - Evaluates to "true" if the given element is in the given set. - The element to test. - The input set. - True if element is in set. - - - Returns a new set with an element added to the set. No exception is raised if - the set already contains the given element. - The value to add. - The input set. - A new set containing value. - - - The set containing the given element. - The value for the set to contain. - The set containing value. - - - The empty set for the type 'T. - - - Functional programming operators related to the Set<_> type. - - - Gets the default cancellation token for executing asynchronous computations. - The default CancellationToken. - - - Creates an asynchronous computation that returns the CancellationToken governing the execution - of the computation. - In async { let! token = Async.CancellationToken ...} token can be used to initiate other - asynchronous operations that will cancel cooperatively with this workflow. - An asynchronous computation capable of retrieving the CancellationToken from a computation - expression. - - - Creates an asynchronous computation that executes computation. - If this computation is cancelled before it completes then the computation generated by - running compensation is executed. - The input asynchronous computation. - The function to be run if the computation is cancelled. - An asynchronous computation that runs the compensation if the input computation - is cancelled. - - - Creates an asynchronous computation that queues a work item that runs - its continuation. - A computation that generates a new work item in the thread pool. - - - Creates an asynchronous computation that creates a new thread and runs - its continuation in that thread. - A computation that will execute on a new thread. - - - Creates an asynchronous computation that runs - its continuation using syncContext.Post. If syncContext is null - then the asynchronous computation is equivalent to SwitchToThreadPool(). - The synchronization context to accept the posted computation. - An asynchronous computation that uses the syncContext context to execute. - - - Runs an asynchronous computation, starting immediately on the current operating system - thread. Call one of the three continuations when the operation completes. - If no cancellation token is provided then the default cancellation token - is used. - The asynchronous computation to execute. - The function called on success. - The function called on exception. - The function called on cancellation. - The CancellationToken to associate with the computation. - The default is used if this parameter is not provided. - - - Runs an asynchronous computation, starting immediately on the current operating system - thread. - If no cancellation token is provided then the default cancellation token is used. - The asynchronous computation to execute. - The CancellationToken to associate with the computation. - The default is used if this parameter is not provided. - - - Creates an asynchronous computation which starts the given computation as a System.Threading.Tasks.Task - - - Starts a child computation within an asynchronous workflow. - This allows multiple asynchronous computations to be executed simultaneously. - - This method should normally be used as the immediate - right-hand-side of a let! binding in an F# asynchronous workflow, that is, - - async { ... - let! completor1 = childComputation1 |> Async.StartChild - let! completor2 = childComputation2 |> Async.StartChild - ... - let! result1 = completor1 - let! result2 = completor2 - ... } - - When used in this way, each use of StartChild starts an instance of childComputation - and returns a completor object representing a computation to wait for the completion of the operation. - When executed, the completor awaits the completion of childComputation. - The child computation. - The timeout value in milliseconds. If one is not provided - then the default value of -1 corresponding to System.Threading.Timeout.Infinite. - A new computation that waits for the input computation to finish. - - - Executes a computation in the thread pool. - If no cancellation token is provided then the default cancellation token is used. - A System.Threading.Tasks.Task that will be completed - in the corresponding state once the computation terminates (produces the result, throws exception or gets canceled) - - - - Starts the asynchronous computation in the thread pool. Do not await its result. - - If no cancellation token is provided then the default cancellation token is used. - The computation to run asynchronously. - The cancellation token to be associated with the computation. - If one is not supplied, the default cancellation token is used. - - - Creates an asynchronous computation that will sleep for the given time. This is scheduled - using a System.Threading.Timer object. The operation will not block operating system threads - for the duration of the wait. - The number of milliseconds to sleep. - An asynchronous computation that will sleep for the given time. - Thrown when the due time is negative - and not infinite. - - - Runs the asynchronous computation and await its result. - - If an exception occurs in the asynchronous computation then an exception is re-raised by this - function. - - If no cancellation token is provided then the default cancellation token is used. - - The timeout parameter is given in milliseconds. A value of -1 is equivalent to - System.Threading.Timeout.Infinite. - The computation to run. - The amount of time in milliseconds to wait for the result of the - computation before raising a System.TimeoutException. If no value is provided - for timeout then a default of -1 is used to correspond to System.Threading.Timeout.Infinite. - The cancellation token to be associated with the computation. - If one is not supplied, the default cancellation token is used. - The result of the computation. - - - Creates an asynchronous computation that executes all the given asynchronous computations, - initially queueing each as work items and using a fork/join pattern. - - If all child computations succeed, an array of results is passed to the success continuation. - - If any child computation raises an exception, then the overall computation will trigger an - exception, and cancel the others. - - The overall computation will respond to cancellation while executing the child computations. - If cancelled, the computation will cancel any remaining child computations but will still wait - for the other child computations to complete. - A sequence of distinct computations to be parallelized. - A computation that returns an array of values from the sequence of input computations. - - - Generates a scoped, cooperative cancellation handler for use within an asynchronous workflow. - - For example, - async { use! holder = Async.OnCancel interruption ... } - generates an asynchronous computation where, if a cancellation happens any time during - the execution of the asynchronous computation in the scope of holder, then action - interruption is executed on the thread that is performing the cancellation. This can - be used to arrange for a computation to be asynchronously notified that a cancellation - has occurred, e.g. by setting a flag, or deregistering a pending I/O action. - The function that is executed on the thread performing the - cancellation. - An asynchronous computation that triggers the interruption if it is cancelled - before being disposed. - - - Creates an asynchronous computation that runs the given computation and ignores - its result. - The input computation. - A computation that is equivalent to the input computation, but disregards the result. - - - Creates an asynchronous computation that captures the current - success, exception and cancellation continuations. The callback must - eventually call exactly one of the given continuations. - The function that accepts the current success, exception, and cancellation - continuations. - An asynchronous computation that provides the callback with the current continuations. - - - Creates an asynchronous computation in terms of a Begin/End pair of actions in - the style used in CLI APIs. This overlaod should be used if the operation is - qualified by three arguments. For example, - Async.FromBeginEnd(arg1,arg2,arg3,ws.BeginGetWeather,ws.EndGetWeather) - When the computation is run, beginFunc is executed, with - a callback which represents the continuation of the computation. - When the callback is invoked, the overall result is fetched using endFunc. - - The computation will respond to cancellation while waiting for the completion - of the operation. If a cancellation occurs, and cancelAction is specified, then it is - executed, and the computation continues to wait for the completion of the operation. - - If cancelAction is not specified, then cancellation causes the computation - to stop immediately, and subsequent invocations of the callback are ignored. - The first argument for the operation. - The second argument for the operation. - The third argument for the operation. - The function initiating a traditional CLI asynchronous operation. - The function completing a traditional CLI asynchronous operation. - An optional function to be executed when a cancellation is requested. - An asynchronous computation wrapping the given Begin/End functions. - - - Creates an asynchronous computation in terms of a Begin/End pair of actions in - the style used in CLI APIs. This overlaod should be used if the operation is - qualified by two arguments. For example, - Async.FromBeginEnd(arg1,arg2,ws.BeginGetWeather,ws.EndGetWeather) - When the computation is run, beginFunc is executed, with - a callback which represents the continuation of the computation. - When the callback is invoked, the overall result is fetched using endFunc. - - The computation will respond to cancellation while waiting for the completion - of the operation. If a cancellation occurs, and cancelAction is specified, then it is - executed, and the computation continues to wait for the completion of the operation. - - If cancelAction is not specified, then cancellation causes the computation - to stop immediately, and subsequent invocations of the callback are ignored. - The first argument for the operation. - The second argument for the operation. - The function initiating a traditional CLI asynchronous operation. - The function completing a traditional CLI asynchronous operation. - An optional function to be executed when a cancellation is requested. - An asynchronous computation wrapping the given Begin/End functions. - - - Creates an asynchronous computation in terms of a Begin/End pair of actions in - the style used in CLI APIs. This overlaod should be used if the operation is - qualified by one argument. For example, - Async.FromBeginEnd(place,ws.BeginGetWeather,ws.EndGetWeather) - When the computation is run, beginFunc is executed, with - a callback which represents the continuation of the computation. - When the callback is invoked, the overall result is fetched using endFunc. - - The computation will respond to cancellation while waiting for the completion - of the operation. If a cancellation occurs, and cancelAction is specified, then it is - executed, and the computation continues to wait for the completion of the operation. - - If cancelAction is not specified, then cancellation causes the computation - to stop immediately, and subsequent invocations of the callback are ignored. - The argument for the operation. - The function initiating a traditional CLI asynchronous operation. - The function completing a traditional CLI asynchronous operation. - An optional function to be executed when a cancellation is requested. - An asynchronous computation wrapping the given Begin/End functions. - - - Creates an asynchronous computation in terms of a Begin/End pair of actions in - the style used in CLI APIs. For example, - Async.FromBeginEnd(ws.BeginGetWeather,ws.EndGetWeather) - When the computation is run, beginFunc is executed, with - a callback which represents the continuation of the computation. - When the callback is invoked, the overall result is fetched using endFunc. - - The computation will respond to cancellation while waiting for the completion - of the operation. If a cancellation occurs, and cancelAction is specified, then it is - executed, and the computation continues to wait for the completion of the operation. - - If cancelAction is not specified, then cancellation causes the computation - to stop immediately, and subsequent invocations of the callback are ignored. - The function initiating a traditional CLI asynchronous operation. - The function completing a traditional CLI asynchronous operation. - An optional function to be executed when a cancellation is requested. - An asynchronous computation wrapping the given Begin/End functions. - - - Creates an asynchronous computation that executes computation. - If this computation completes successfully then return Choice1Of2 with the returned - value. If this computation raises an exception before it completes then return Choice2Of2 - with the raised exception. - The input computation that returns the type T. - A computation that returns a choice of type T or exception. - - - Raises the cancellation condition for the most recent set of asynchronous computations started - without any specific CancellationToken. Replaces the global CancellationTokenSource with a new - global token source for any asynchronous computations created after this point without any - specific CancellationToken. - - - Creates an asynchronous computation that will wait on the given WaitHandle. - - The computation returns true if the handle indicated a result within the given timeout. - The WaitHandle that can be signalled. - The timeout value in milliseconds. If one is not provided - then the default value of -1 corresponding to System.Threading.Timeout.Infinite. - An asynchronous computation that waits on the given WaitHandle. - - - - Return an asynchronous computation that will wait for the given task to complete and return - its result. - - - - Creates an asynchronous computation that will wait on the IAsyncResult. - - The computation returns true if the handle indicated a result within the given timeout. - The IAsyncResult to wait on. - The timeout value in milliseconds. If one is not provided - then the default value of -1 corresponding to System.Threading.Timeout.Infinite. - An asynchronous computation that waits on the given IAsyncResult. - - - Creates an asynchronous computation that waits for a single invocation of a CLI - event by adding a handler to the event. Once the computation completes or is - cancelled, the handler is removed from the event. - - The computation will respond to cancellation while waiting for the event. If a - cancellation occurs, and cancelAction is specified, then it is executed, and - the computation continues to wait for the event. - - If cancelAction is not specified, then cancellation causes the computation - to cancel immediately. - The event to handle once. - An optional function to execute instead of cancelling when a - cancellation is issued. - An asynchronous computation that waits for the event to be invoked. - - - Creates three functions that can be used to implement the .NET Asynchronous - Programming Model (APM) for a given asynchronous computation. - - The functions should normally be published as members with prefix Begin, - End and Cancel, and can be used within a type definition as follows: - - let beginAction,endAction,cancelAction = Async.AsBeginEnd (fun arg -> computation) - member x.BeginSomeOperation(arg,callback,state:obj) = beginAction(arg,callback,state) - member x.EndSomeOperation(iar) = endAction(iar) - member x.CancelSomeOperation(iar) = cancelAction(iar) - - - If the asynchronous computation takes no arguments, then AsBeginEnd is used as follows: - - let beginAction,endAction,cancelAction = Async.AsBeginEnd (fun () -> computation) - member x.BeginSomeOperation(callback,state:obj) = beginAction((),callback,state) - member x.EndSomeOperation(iar) = endAction(iar) - member x.CancelSomeOperation(iar) = cancelAction(iar) - - - - If the asynchronous computation takes two arguments, then AsBeginEnd is used as follows: - - let beginAction,endAction,cancelAction = Async.AsBeginEnd (fun arg1 arg2 -> computation) - member x.BeginSomeOperation(arg1,arg2,callback,state:obj) = beginAction((),callback,state) - member x.EndSomeOperation(iar) = endAction(iar) - member x.CancelSomeOperation(iar) = cancelAction(iar) - - - In each case, the resulting API will be familiar to programmers in other CLI languages and - is a useful way to publish asynchronous computations in CLI components. - A function generating the asynchronous computation to split into the traditional - .NET Asynchronous Programming Model. - A tuple of the begin, end, and cancel members. - - - This static class holds members for creating and manipulating asynchronous computations. - - - Creates an asynchronous computation that just returns (). - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of empty else branches in the - async { ... } computation expression syntax. - An asynchronous computation that returns (). - - - Creates an asynchronous computation that runs computation repeatedly - until guard() becomes false. - - A cancellation check is performed whenever the computation is executed. - - The existence of this method permits the use of while in the - async { ... } computation expression syntax. - The function to determine when to stop executing computation. - The function to be executed. Equivalent to the body - of a while expression. - An asynchronous computation that behaves similarly to a while loop when run. - - - Creates an asynchronous computation that runs binder(resource). - The action resource.Dispose() is executed as this computation yields its result - or if the asynchronous computation exits by an exception or by cancellation. - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of use and use! in the - async { ... } computation expression syntax. - The resource to be used and disposed. - The function that takes the resource and returns an asynchronous - computation. - An asynchronous computation that binds and eventually disposes resource. - - - Creates an asynchronous computation that runs computation and returns its result. - If an exception happens then catchHandler(exn) is called and the resulting computation executed instead. - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of try/with in the - async { ... } computation expression syntax. - The input computation. - The function to run when computation throws an exception. - An asynchronous computation that executes computation and calls catchHandler if an - exception is thrown. - - - Creates an asynchronous computation that runs computation. The action compensation is executed - after computation completes, whether computation exits normally or by an exception. If compensation raises an exception itself - the original exception is discarded and the new exception becomes the overall result of the computation. - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of try/finally in the - async { ... } computation expression syntax. - The input computation. - The action to be run after computation completes or raises an - exception (including cancellation). - An asynchronous computation that executes computation and compensation aftewards or - when an exception is raised. - - - Delegates to the input computation. - - The existence of this method permits the use of return! in the - async { ... } computation expression syntax. - The input computation. - The input computation. - - - Creates an asynchronous computation that returns the result v. - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of return in the - async { ... } computation expression syntax. - The value to return from the computation. - An asynchronous computation that returns value when executed. - - - Creates an asynchronous computation that enumerates the sequence seq - on demand and runs body for each element. - - A cancellation check is performed on each iteration of the loop. - - The existence of this method permits the use of for in the - async { ... } computation expression syntax. - The sequence to enumerate. - A function to take an item from the sequence and create - an asynchronous computation. Can be seen as the body of the for expression. - An asynchronous computation that will enumerate the sequence and run body - for each element. - - - Creates an asynchronous computation that runs generator. - - A cancellation check is performed when the computation is executed. - The function to run. - An asynchronous computation that runs generator. - - - Creates an asynchronous computation that first runs computation1 - and then runs computation2, returning the result of computation2. - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of expression sequencing in the - async { ... } computation expression syntax. - The first part of the sequenced computation. - The second part of the sequenced computation. - An asynchronous computation that runs both of the computations sequentially. - - - Creates an asynchronous computation that runs computation, and when - computation generates a result T, runs binder res. - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of let! in the - async { ... } computation expression syntax. - The computation to provide an unbound result. - The function to bind the result of computation. - An asynchronous computation that performs a monadic bind on the result - of computation. - - - - Generate an object used to build asynchronous computations using F# computation expressions. The value - 'async' is a pre-defined instance of this type. - - A cancellation check is performed when the computation is executed. - - - - The type of the async operator, used to build workflows for asynchronous computations. - - - Sends a reply to a PostAndReply message. - The value to send. - - - A handle to a capability to reply to a PostAndReply message. - - - A compositional asynchronous computation, which, when run, will eventually produce a value - of type T, or else raises an exception. - - Asynchronous computations are normally specified using an F# computation expression. - - When run, asynchronous computations have two modes: as a work item (executing synchronous - code), or as a wait item (waiting for an event or I/O completion). - - When run, asynchronous computations can be governed by CancellationToken. This can usually - be specified when the async computation is started. The associated CancellationTokenSource - may be used to cancel the asynchronous computation. Asynchronous computations built using - computation expressions can check the cancellation condition regularly. Synchronous - computations within an asynchronous computation do not automatically check this condition. - - - Publishes the event as a first class event value. - - - Triggers the event using the given parameters. - The parameters for the event. - - - Creates an event object suitable for implementing an arbitrary type of delegate. - The event object. - - - Event implementations for an arbitrary type of delegate. - - - Publishes an observation as a first class value. - - - Triggers an observation using the given parameters. - The event parameters. - - - Creates an observable object. - The created event. - - - Event implementations for the IEvent<_> type. - - - Publishes the event as a first class event value. - - - Triggers the event using the given sender object and parameters. The sender object may be null. - The object triggering the event. - The parameters for the event. - - - Creates an event object suitable for delegate types following the standard .NET Framework convention of a first 'sender' argument. - The created event. - - - Event implementations for a delegate types following the standard .NET Framework convention of a first 'sender' argument. - - - - - - A delegate type associated with the F# event type IEvent<_> - The object that fired the event. - The event arguments. - - - Remove a listener delegate from an event listener store. - The delegate to be removed from the event listener store. - - - Connect a handler delegate object to the event. A handler can - be later removed using RemoveHandler. The listener will - be invoked when the event is fired. - A delegate to be invoked when the event is fired. - - - First class event values for arbitrary delegate types. - - F# gives special status to member properties compatible with type IDelegateEvent and - tagged with the CLIEventAttribute. In this case the F# compiler generates approriate - CLI metadata to make the member appear to other CLI languages as a CLI event. - - - First-class listening points (i.e. objects that permit you to register a callback - activated when the event is triggered). - - - First class event values for CLI events conforming to CLI Framework standards. - - - The type of delayed computations. - - Use the values in the Lazy module to manipulate - values of this type, and the notation lazy expr to create values - of type . - - - Raises a timeout exception if a message not received in this amount of time. By default - no timeout is used. - - - Occurs when the execution of the agent results in an exception. - - - Occurs when the execution of the agent results in an exception. - - - Raises a timeout exception if a message not received in this amount of time. By default - no timeout is used. - - - Returns the number of unprocessed messages in the message queue of the agent. - - - Occurs when the execution of the agent results in an exception. - - - Scans for a message by looking through messages in arrival order until scanner - returns a Some value. Other messages remain in the queue. - - This method is for use within the body of the agent. For each agent, at most - one concurrent reader may be active, so no more than one concurrent call to - Receive, TryReceive, Scan and/or TryScan may be active. - The function to return None if the message is to be skipped - or Some if the message is to be processed and removed from the queue. - An optional timeout in milliseconds. Defaults to -1 which corresponds - to System.Threading.Timeout.Infinite. - An asynchronous computation that scanner built off the read message. - - - Waits for a message. This will consume the first message in arrival order. - - This method is for use within the body of the agent. - - Returns None if a timeout is given and the timeout is exceeded. - - This method is for use within the body of the agent. For each agent, at most - one concurrent reader may be active, so no more than one concurrent call to - Receive, TryReceive, Scan and/or TryScan may be active. - An optional timeout in milliseconds. Defaults to -1 which - corresponds to System.Threading.Timeout.Infinite. - An asynchronous computation that returns the received message or - None if the timeout is exceeded. - - - Like PostAndReply, but returns None if no reply within the timeout period. - The function to incorporate the AsyncReplyChannel into - the message to be sent. - An optional timeout parameter (in milliseconds) to wait for a reply message. - Defaults to -1 which corresponds to System.Threading.Timeout.Infinite. - The reply from the agent or None if the timeout expires. - - - Starts the agent. - - - Creates and starts an agent. The body function is used to generate the asynchronous - computation executed by the agent. - The function to produce an asynchronous computation that will be executed - as the read loop for the MailboxProcessor when Start is called. - An optional cancellation token for the body. - Defaults to Async.DefaultCancellationToken. - The created MailboxProcessor. - - - Scans for a message by looking through messages in arrival order until scanner - returns a Some value. Other messages remain in the queue. - - Returns None if a timeout is given and the timeout is exceeded. - - This method is for use within the body of the agent. For each agent, at most - one concurrent reader may be active, so no more than one concurrent call to - Receive, TryReceive, Scan and/or TryScan may be active. - The function to return None if the message is to be skipped - or Some if the message is to be processed and removed from the queue. - An optional timeout in milliseconds. Defaults to -1 which corresponds - to System.Threading.Timeout.Infinite. - An asynchronous computation that scanner built off the read message. - Thrown when the timeout is exceeded. - - - Waits for a message. This will consume the first message in arrival order. - - This method is for use within the body of the agent. - - This method is for use within the body of the agent. For each agent, at most - one concurrent reader may be active, so no more than one concurrent call to - Receive, TryReceive, Scan and/or TryScan may be active. - An optional timeout in milliseconds. Defaults to -1 which corresponds - to System.Threading.Timeout.Infinite. - An asynchronous computation that returns the received message. - Thrown when the timeout is exceeded. - - - Like AsyncPostAndReply, but returns None if no reply within the timeout period. - The function to incorporate the AsyncReplyChannel into - the message to be sent. - An optional timeout parameter (in milliseconds) to wait for a reply message. - Defaults to -1 which corresponds to System.Threading.Timeout.Infinite. - An asynchronous computation that will return the reply or None if the timeout expires. - - - Posts a message to an agent and await a reply on the channel, synchronously. - - The message is generated by applying buildMessage to a new reply channel - to be incorporated into the message. The receiving agent must process this - message and invoke the Reply method on this reply channel precisely once. - The function to incorporate the AsyncReplyChannel into - the message to be sent. - An optional timeout parameter (in milliseconds) to wait for a reply message. - Defaults to -1 which corresponds to System.Threading.Timeout.Infinite. - The reply from the agent. - - - Posts a message to an agent and await a reply on the channel, asynchronously. - - The message is generated by applying buildMessage to a new reply channel - to be incorporated into the message. The receiving agent must process this - message and invoke the Reply method on this reply channel precisely once. - The function to incorporate the AsyncReplyChannel into - the message to be sent. - An optional timeout parameter (in milliseconds) to wait for a reply message. - Defaults to -1 which corresponds to System.Threading.Timeout.Infinite. - An asychronous computation that will wait for the reply from the agent. - - - Posts a message to the message queue of the MailboxProcessor, asynchronously. - The message to post. - - - Creates an agent. The body function is used to generate the asynchronous - computation executed by the agent. This function is not executed until - Start is called. - The function to produce an asynchronous computation that will be executed - as the read loop for the MailboxProcessor when Start is called. - An optional cancellation token for the body. - Defaults to Async.DefaultCancellationToken. - The created MailboxProcessor. - - - A message-processing agent which executes an asynchronous computation. - - The agent encapsulates a message queue that supports multiple-writers and - a single reader agent. Writers send messages to the agent by using the Post - method and its variations. - - The agent may wait for messages using the Receive or TryReceive methods or - scan through all available messages using the Scan or TryScan method. - - - - - - Connects a listener function to the observable. The listener will - be invoked for each observation. The listener can be removed by - calling Dispose on the returned IDisposable object. - The function to be called for each observation. - An object that will remove the listener if disposed. - - - Permanently connects a listener function to the observable. The listener will - be invoked for each observation. - The function to be called for each observation. - - - Returns an asynchronous computation that will write the given bytes to the stream. - The buffer to write from. - An optional offset as a number of bytes in the stream. - An optional number of bytes to write to the stream. - An asynchronous computation that will write the given bytes to the stream. - Thrown when the sum of offset and count is longer than - the buffer length. - Thrown when offset or count is negative. - - - Returns an asynchronous computation that will read the given number of bytes from the stream. - The number of bytes to read. - An asynchronous computation that returns the read byte[] when run. - - - Returns an asynchronous computation that will read from the stream into the given buffer. - The buffer to read into. - An optional offset as a number of bytes in the stream. - An optional number of bytes to read from the stream. - An asynchronous computation that will read from the stream into the given buffer. - Thrown when the sum of offset and count is longer than - the buffer length. - Thrown when offset or count is negative. - - - A module of extension members providing asynchronous operations for some basic CLI types related to concurrency and I/O. - - - Returns a new event that triggers on the second and subsequent triggerings of the input event. - The Nth triggering of the input event passes the arguments from the N-1th and Nth triggering as - a pair. The argument passed to the N-1th triggering is held in hidden internal state until the - Nth triggering occurs. - The input event. - An event that triggers on pairs of consecutive values passed from the source event. - - - Runs the given function each time the given event is triggered. - The function to call when the event is triggered. - The input event. - - - Returns a new event consisting of the results of applying the given accumulating function - to successive values triggered on the input event. An item of internal state - records the current value of the state parameter. The internal state is not locked during the - execution of the accumulation function, so care should be taken that the - input IEvent not triggered by multiple threads simultaneously. - The function to update the state with each event value. - The initial state. - The input event. - An event that fires on the updated state values. - - - Returns a new event which fires on a selection of messages from the original event. - The selection function takes an original message to an optional new message. - The function to select and transform event values to pass on. - The input event. - An event that fires only when the chooser returns Some. - - - Returns a new event that listens to the original event and triggers the - first resulting event if the application of the function to the event arguments - returned a Choice1Of2, and the second event if it returns a Choice2Of2. - The function to transform event values into one of two types. - The input event. - A tuple of events. The first fires whenever splitter evaluates to Choice1of1 and - the second fires whenever splitter evaluates to Choice2of2. - - - Returns a new event that listens to the original event and triggers the - first resulting event if the application of the predicate to the event arguments - returned true, and the second event if it returned false. - The function to determine which output event to trigger. - The input event. - A tuple of events. The first is triggered when the predicate evaluates to true - and the second when the predicate evaluates to false. - - - Returns a new event that listens to the original event and triggers the resulting - event only when the argument to the event passes the given function. - The function to determine which triggers from the event to propagate. - The input event. - An event that only passes values that pass the predicate. - - - Returns a new event that passes values transformed by the given function. - The function to transform event values. - The input event. - An event that passes the transformed values. - - - Fires the output event when either of the input events fire. - The first input event. - The second input event. - An event that fires when either of the input events fire. - - - - - - Forces the execution of this value and return its result. Same as Value. Mutual exclusion is used to - prevent other threads also computing the value. - The value of the Lazy object. - - - Creates a lazy computation that evaluates to the given value when forced. - The input value. - The created Lazy object. - - - Creates a lazy computation that evaluates to the result of the given function when forced. - The function to provide the value when needed. - The created Lazy object. - - - Extensions related to Lazy values. - - - Returns a new observable that triggers on the second and subsequent triggerings of the input observable. - The Nth triggering of the input observable passes the arguments from the N-1th and Nth triggering as - a pair. The argument passed to the N-1th triggering is held in hidden internal state until the - Nth triggering occurs. - - For each observer, the registered intermediate observing object is not thread safe. - That is, observations arising from the source must not be triggered concurrently - on different threads. - The input Observable. - An Observable that triggers on successive pairs of observations from the input Observable. - - - Creates an observer which subscribes to the given observable and which calls - the given function for each observation. - The function to be called on each observation. - The input Observable. - An object that will remove the callback if disposed. - - - Creates an observer which permanently subscribes to the given observable and which calls - the given function for each observation. - The function to be called on each observation. - The input Observable. - - - Returns an observable which, for each observer, allocates an item of state - and applies the given accumulating function to successive values arising from - the input. The returned object will trigger observations for each computed - state value, excluding the initial value. The returned object propagates - all errors arising from the source and completes when the source completes. - - For each observer, the registered intermediate observing object is not thread safe. - That is, observations arising from the source must not be triggered concurrently - on different threads. - The function to update the state with each observation. - The initial state. - The input Observable. - An Observable that triggers on the updated state values. - - - Returns an observable which chooses a projection of observations from the source - using the given function. The returned object will trigger observations x - for which the splitter returns Some x. The returned object also propagates - all errors arising from the source and completes when the source completes. - The function that returns Some for observations to be propagated - and None for observations to ignore. - The input Observable. - An Observable that only propagates some of the observations from the source. - - - Returns two observables which split the observations of the source by the - given function. The first will trigger observations x for which the - splitter returns Choice1Of2 x. The second will trigger observations - y for which the splitter returns Choice2Of2 y The splitter is - executed once for each subscribed observer. Both also propagate error - observations arising from the source and each completes when the source - completes. - The function that takes an observation an transforms - it into one of the two output Choice types. - The input Observable. - A tuple of Observables. The first triggers when splitter returns Choice1of2 - and the second triggers when splitter returns Choice2of2. - - - Returns two observables which partition the observations of the source by - the given function. The first will trigger observations for those values - for which the predicate returns true. The second will trigger observations - for those values where the predicate returns false. The predicate is - executed once for each subscribed observer. Both also propagate all error - observations arising from the source and each completes when the source - completes. - The function to determine which output Observable will trigger - a particular observation. - The input Observable. - A tuple of Observables. The first triggers when the predicate returns true, and - the second triggers when the predicate returns false. - - - Returns an observable which filters the observations of the source - by the given function. The observable will see only those observations - for which the predicate returns true. The predicate is executed once for - each subscribed observer. The returned object also propagates error - observations arising from the source and completes when the source completes. - The function to apply to observations to determine if it should - be kept. - The input Observable. - An Observable that filters observations based on filter. - - - Returns an observable which transforms the observations of the source by the - given function. The transformation function is executed once for each - subscribed observer. The returned object also propagates error observations - arising from the source and completes when the source completes. - The function applied to observations from the source. - The input Observable. - An Observable of the type specified by mapping. - - - Returns an observable for the merged observations from the sources. - The returned object propagates success and error values arising - from either source and completes when both the sources have completed. - - For each observer, the registered intermediate observing object is not - thread safe. That is, observations arising from the sources must not - be triggered concurrently on different threads. - The first Observable. - The second Observable. - An Observable that propagates information from both sources. - - - Basic operations on first class event and other observable objects. - - - Returns an asynchronous computation that, when run, will wait for a response to the given WebRequest. - An asynchronous computation that waits for response to the WebRequest. - - - A module of extension members providing asynchronous operations for some basic Web operations. - - - Creates an instance of the attribute - AbstractClassAttribute - - - Adding this attribute to class definition makes it abstract, which means it need not - implement all its methods. Instances of abstract classes may not be constructed directly. - - - Creates an instance of the attribute - AllowNullLiteralAttribute - - - Adding this attribute to a type lets the 'null' literal be used for the type - within F# code. This attribute may only be added to F#-defined class or - interface types. - - - Indicates the namespace or module to be automatically opened when an assembly is referenced - or an enclosing module opened. - - - Creates an attribute used to mark a namespace or module path to be 'automatically opened' when an assembly is referenced - The namespace or module to be automatically opened when an assembly is referenced - or an enclosing module opened. - AutoOpenAttribute - - - Creates an attribute used to mark a module as 'automatically opened' when the enclosing namespace is opened - AutoOpenAttribute - - - This attribute is used for two purposes. When applied to an assembly, it must be given a string - argument, and this argument must indicate a valid module or namespace in that assembly. Source - code files compiled with a reference to this assembly are processed in an environment - where the given path is automatically opened. - - When applied to a module within an assembly, then the attribute must not be given any arguments. - When the enclosing namespace is opened in user source code, the module is also implicitly opened. - - - The value of the attribute, indicating whether the type is automatically marked serializable or not - - - Creates an instance of the attribute - Indicates whether the type should be serializable by default. - AutoSerializableAttribute - - - Adding this attribute to a type with value 'false' disables the behaviour where F# makes the - type Serializable by default. - - - Creates an instance of the attribute - CLIEventAttribute - - - Adding this attribute to a property with event type causes it to be compiled with as a CLI - metadata event, through a syntactic translation to a pair of 'add_EventName' and - 'remove_EventName' methods. - - - Creates an instance of the attribute - CLIMutableAttribute - - - Adding this attribute to a record type causes it to be compiled to a CLI representation - with a default constructor with property getters and setters. - - - Choice 2 of 2 choices - - - Choice 1 of 2 choices - - - Helper types for active patterns with 2 choices. - - - Choice 3 of 3 choices - - - Choice 2 of 3 choices - - - Choice 1 of 3 choices - - - Helper types for active patterns with 3 choices. - - - Choice 4 of 4 choices - - - Choice 3 of 4 choices - - - Choice 2 of 4 choices - - - Choice 1 of 4 choices - - - Helper types for active patterns with 4 choices. - - - Choice 5 of 5 choices - - - Choice 4 of 5 choices - - - Choice 3 of 5 choices - - - Choice 2 of 5 choices - - - Choice 1 of 5 choices - - - Helper types for active patterns with 5 choices. - - - Choice 6 of 6 choices - - - Choice 5 of 6 choices - - - Choice 4 of 6 choices - - - Choice 3 of 6 choices - - - Choice 2 of 6 choices - - - Choice 1 of 6 choices - - - Helper types for active patterns with 6 choices. - - - Choice 7 of 7 choices - - - Choice 6 of 7 choices - - - Choice 5 of 7 choices - - - Choice 4 of 7 choices - - - Choice 3 of 7 choices - - - Choice 2 of 7 choices - - - Choice 1 of 7 choices - - - Helper types for active patterns with 7 choices. - - - Creates an instance of the attribute - ClassAttribute - - - Adding this attribute to a type causes it to be represented using a CLI class. - - - Creates an instance of the attribute - ComparisonConditionalOnAttribute - - - This attribute is used to indicate a generic container type satisfies the F# 'comparison' - constraint only if a generic argument also satisfies this constraint. For example, adding - this attribute to parameter 'T on a type definition C<'T> means that a type C<X> only supports - comparison if the type X also supports comparison and all other conditions for C<X> to support - comparison are also met. The type C<'T> can still be used with other type arguments, but a type such - as C<(int -> int)> will not support comparison because the type (int -> int) is an F# function type - and does not support comparison. - - This attribute will be ignored if it is used on the generic parameters of functions or methods. - - - Indicates the number of arguments in each argument group - - - Creates an instance of the attribute - Indicates the number of arguments in each argument group. - CompilationArgumentCountsAttribute - - - This attribute is generated automatically by the F# compiler to tag functions and members - that accept a partial application of some of their arguments and return a residual function - - - Indicates the variant number of the entity, if any, in a linear sequence of elements with F# source code - - - Indicates the relationship between the compiled entity and F# source code - - - Indicates the sequence number of the entity, if any, in a linear sequence of elements with F# source code - - - Creates an instance of the attribute - Indicates the type of source construct. - CompilationMappingAttribute - - - Creates an instance of the attribute - Indicates the type of source construct. - CompilationMappingAttribute - - - Creates an instance of the attribute - Indicates the type of source construct. - CompilationMappingAttribute - - - This attribute is inserted automatically by the F# compiler to tag types - and methods in the generated CLI code with flags indicating the correspondence - with original source constructs. It is used by the functions in the - Microsoft.FSharp.Reflection namespace to reverse-map compiled constructs to - their original forms. It is not intended for use from user code. - - - Indicates one or more adjustments to the compiled representation of an F# type or member - - - Creates an instance of the attribute - Indicates adjustments to the compiled representation of the type or member. - CompilationRepresentationAttribute - - - This attribute is used to adjust the runtime representation for a type. - For example, it may be used to note that the null representation - may be used for a type. This affects how some constructs are compiled. - - - Compile a property as a CLI event. - - - Permit the use of null as a representation for nullary discriminators in a discriminated union. - - - append 'Module' to the end of a module whose name clashes with a type name in the same namespace. - - - Compile a member as 'instance' even if null is used as a representation for this type. - - - Compile an instance member as 'static' . - - - No special compilation representation. - - - - - - Indicates one or more adjustments to the compiled representation of an F# type or member. - - - Indicates the name of the entity in F# source code - - - Creates an instance of the attribute - The name of the method in source. - CompilationSourceNameAttribute - - - This attribute is inserted automatically by the F# compiler to tag - methods which are given the 'CompiledName' attribute. It is not intended - for use from user code. - - - The name of the value as it appears in compiled code - - - Creates an instance of the attribute - The name to use in compiled code. - CompiledNameAttribute - - - Adding this attribute to a value or function definition in an F# module changes the name used - for the value in compiled CLI code. - - - Indicates if the construct should always be hidden in an editing environment. - - - Indicates if the message should indicate a compiler error. Error numbers less than - 10000 are considered reserved for use by the F# compiler and libraries. - - - Indicates the number associated with the message. - - - Indicates the warning message to be emitted when F# source code uses this construct - - - Indicates if the construct should always be hidden in an editing environment. - - - Indicates if the message should indicate a compiler error. Error numbers less than - 10000 are considered reserved for use by the F# compiler and libraries. - - - Creates an instance of the attribute. - - - Indicates that a message should be emitted when F# source code uses this construct. - - - Creates an instance of the attribute - CustomComparisonAttribute - - - Adding this attribute to a type indicates it is a type with a user-defined implementation of comparison. - - - Creates an instance of the attribute - CustomEqualityAttribute - - - Adding this attribute to a type indicates it is a type with a user-defined implementation of equality. - - - Indicates if the custom operation maintains the variable space of the query of computation expression through the use of a bind operation - - - Indicates if the custom operation maintains the variable space of the query of computation expression - - - Indicates the name used for the 'on' part of the custom query operator for join-like operators - - - Indicates if the custom operation is an operation similar to a zip in a sequence computation, supporting two inputs - - - Indicates if the custom operation is an operation similar to a join in a sequence computation, supporting two inputs and a correlation constraint - - - Indicates if the custom operation is an operation similar to a group join in a sequence computation, supporting two inputs and a correlation constraint, and generating a group - - - Indicates if the custom operation supports the use of 'into' immediately after the use of the operation in a query or other computation expression to consume the results of the operation - - - Get the name of the custom operation when used in a query or other computation expression - - - Indicates if the custom operation maintains the variable space of the query of computation expression through the use of a bind operation - - - Indicates if the custom operation maintains the variable space of the query of computation expression - - - Indicates the name used for the 'on' part of the custom query operator for join-like operators - - - Indicates if the custom operation is an operation similar to a zip in a sequence computation, supporting two inputs - - - Indicates if the custom operation is an operation similar to a join in a sequence computation, supporting two inputs and a correlation constraint - - - Indicates if the custom operation is an operation similar to a group join in a sequence computation, supporting two inputs and a correlation constraint, and generating a group - - - Indicates if the custom operation supports the use of 'into' immediately after the use of the operation in a query or other computation expression to consume the results of the operation - - - Creates an instance of the attribute - CustomOperationAttribute - - - - Indicates that a member on a computation builder type is a custom query operator, - and indicates the name of that operator. - - - - The value of the attribute, indicating whether the type has a default augmentation or not - - - Creates an instance of the attribute - Indicates whether to generate helper members on the CLI class representing a discriminated - union. - DefaultAugmentationAttribute - - - Adding this attribute to a discriminated union with value false - turns off the generation of standard helper member tester, constructor - and accessor members for the generated CLI class for that type. - - - Indicates if a constraint is asserted that the field type supports 'null' - - - Creates an instance of the attribute - Indicates whether to assert that the field type supports null. - DefaultValueAttribute - - - Creates an instance of the attribute - DefaultValueAttribute - - - Adding this attribute to a field declaration means that the field is - not initialized. During type checking a constraint is asserted that the field type supports 'null'. - If the 'check' value is false then the constraint is not asserted. - - - Creates an instance of the attribute - EntryPointAttribute - - - Adding this attribute to a function indicates it is the entrypoint for an application. - If this attribute is not specified for an EXE then the initialization implicit in the - module bindings in the last file in the compilation sequence are used as the entrypoint. - - - Creates an instance of the attribute - EqualityConditionalOnAttribute - - - This attribute is used to indicate a generic container type satisfies the F# 'equality' - constraint only if a generic argument also satisfies this constraint. For example, adding - this attribute to parameter 'T on a type definition C<'T> means that a type C<X> only supports - equality if the type X also supports equality and all other conditions for C<X> to support - equality are also met. The type C<'T> can still be used with other type arguments, but a type such - as C<(int -> int)> will not support equality because the type (int -> int) is an F# function type - and does not support equality. - - This attribute will be ignored if it is used on the generic parameters of functions or methods. - - - Indicates the warning message to be emitted when F# source code uses this construct - - - Creates an instance of the attribute - The warning message to be emitted when code uses this construct. - ExperimentalAttribute - - - This attribute is used to tag values that are part of an experimental library - feature. - - - Invoke an F# first class function value with two curried arguments. In some cases this - will result in a more efficient application than applying the arguments successively. - The input function. - The first arg. - The second arg. - The function result. - - - Invoke an F# first class function value with three curried arguments. In some cases this - will result in a more efficient application than applying the arguments successively. - The input function. - The first arg. - The second arg. - The third arg. - The function result. - - - Invoke an F# first class function value with four curried arguments. In some cases this - will result in a more efficient application than applying the arguments successively. - The input function. - The first arg. - The second arg. - The third arg. - The fourth arg. - The function result. - - - Invoke an F# first class function value with five curried arguments. In some cases this - will result in a more efficient application than applying the arguments successively. - The input function. - The first arg. - The second arg. - The third arg. - The fourth arg. - The fifth arg. - The function result. - - - Invoke an F# first class function value with one argument - - 'U - - - Construct an instance of an F# first class function value - The created F# function. - - - The CLI type used to represent F# function values. This type is not - typically used directly, though may be used from other CLI languages. - - - The release number of the F# version associated with the attribute - - - The minor version number of the F# version associated with the attribute - - - The major version number of the F# version associated with the attribute - - - Creates an instance of the attribute - The major version number. - The minor version number. - The release number. - FSharpInterfaceDataVersionAttribute - - - This attribute is added to generated assemblies to indicate the - version of the data schema used to encode additional F# - specific information in the resource attached to compiled F# libraries. - - - Specialize the type function at a given type - The specialized type. - - - Construct an instance of an F# first class type function value - FSharpTypeFunc - - - The CLI type used to represent F# first-class type function values. This type is for use - by compiled F# code. - - - Type of a formatting expression. - Function type generated by printf. - Type argument passed to %a formatters - Value generated by the overall printf action (e.g. sprint generates a string) - Value generated after post processing (e.g. failwithf generates a string internally then raises an exception) - - - Type of a formatting expression. - Function type generated by printf. - Type argument passed to %a formatters - Value generated by the overall printf action (e.g. sprint generates a string) - Value generated after post processing (e.g. failwithf generates a string internally then raises an exception) - Tuple of values generated by scan or match. - - - Convert the given Action delegate object to an F# function value - The input action. - The F# function. - - - A utility function to convert function values from tupled to curried form - The input tupled function. - The output curried function. - - - A utility function to convert function values from tupled to curried form - The input tupled function. - The output curried function. - - - A utility function to convert function values from tupled to curried form - The input tupled function. - The output curried function. - - - A utility function to convert function values from tupled to curried form - The input tupled function. - The output curried function. - - - Helper functions for converting F# first class function values to and from CLI representaions - of functions using delegates. - - - Creates an instance of the attribute - GeneralizableValueAttribute - - - Adding this attribute to a non-function value with generic parameters indicates that - uses of the construct can give rise to generic code through type inference. - - - Creates an instance of the attribute - InterfaceAttribute - - - Adding this attribute to a type causes it to be represented using a CLI interface. - - - Creates an instance of the attribute - LiteralAttribute - - - Adding this attribute to a value causes it to be compiled as a CLI constant literal. - - - Creates an instance of the attribute - MeasureAnnotatedAbbreviationAttribute - - - Adding this attribute to a type causes it to be interpreted as a refined type, currently limited to measure-parameterized types. - This may only be used under very limited conditions. - - - Creates an instance of the attribute - MeasureAttribute - - - Adding this attribute to a type causes it to be interpreted as a unit of measure. - This may only be used under very limited conditions. - - - Creates an instance of the attribute - NoComparisonAttribute - - - Adding this attribute to a type indicates it is a type where comparison is an abnormal operation. - This means that the type does not satisfy the F# 'comparison' constraint. Within the bounds of the - F# type system, this helps ensure that the F# generic comparison function is not instantiated directly - at this type. The attribute and checking does not constrain the use of comparison with base or child - types of this type. - - - Creates an instance of the attribute - NoDynamicInvocationAttribute - - - This attribute is used to tag values that may not be dynamically invoked at runtime. This is - typically added to inlined functions whose implementations include unverifiable code. It - causes the method body emitted for the inlined function to raise an exception if - dynamically invoked, rather than including the unverifiable code in the generated - assembly. - - - Creates an instance of the attribute - NoEqualityAttribute - - - Adding this attribute to a type indicates it is a type where equality is an abnormal operation. - This means that the type does not satisfy the F# 'equality' constraint. Within the bounds of the - F# type system, this helps ensure that the F# generic equality function is not instantiated directly - at this type. The attribute and checking does not constrain the use of comparison with base or child - types of this type. - - - The representation of "Value of type 'T" - The input value. - An option representing the value. - - - The representation of "No value" - - - Get the value of a 'Some' option. A NullReferenceException is raised if the option is 'None'. - - - Create an option value that is a 'None' value. - - - Return 'true' if the option is a 'Some' value. - - - Return 'true' if the option is a 'None' value. - - - Create an option value that is a 'Some' value. - The input value - An option representing the value. - - - The type of optional values. When used from other CLI languages the - empty option is the null value. - - Use the constructors Some and None to create values of this type. - Use the values in the Option module to manipulate values of this type, - or pattern match against the values directly. - - None values will appear as the value null to other CLI languages. - Instance methods on this type will appear as static methods to other CLI languages - due to the use of null as a value representation. - - - Creates an instance of the attribute - OptionalArgumentAttribute - - - This attribute is added automatically for all optional arguments. - - - The raw text of the format string. - - - Construct a format string - The input string. - The PrintfFormat containing the formatted result. - - - Type of a formatting expression. - Function type generated by printf. - Type argument passed to %a formatters - Value generated by the overall printf action (e.g. sprint generates a string) - Value generated after post processing (e.g. failwithf generates a string internally then raises an exception) - - - Construct a format string - The input string. - The created format string. - - - Type of a formatting expression. - Function type generated by printf. - Type argument passed to %a formatters - Value generated by the overall printf action (e.g. sprint generates a string) - Value generated after post processing (e.g. failwithf generates a string internally then raises an exception) - Tuple of values generated by scan or match. - - - Creates an instance of the attribute - ProjectionParameterAttribute - - - Indicates that, when a custom operator is used in a computation expression, - a parameter is automatically parameterized by the variable space of the computation expression - - - - The current value of the reference cell - - - - The current value of the reference cell - - - The current value of the reference cell - - - The type of mutable references. Use the functions [:=] and [!] to get and - set values of this type. - - - Creates an instance of the attribute - ReferenceEqualityAttribute - - - Adding this attribute to a record or union type disables the automatic generation - of overrides for 'System.Object.Equals(obj)', 'System.Object.GetHashCode()' - and 'System.IComparable' for the type. The type will by default use reference equality. - - - Creates an instance of the attribute - ReflectedDefinitionAttribute - - - Adding this attribute to the let-binding for the definition of a top-level - value makes the quotation expression that implements the value available - for use at runtime. - - - Creates an instance of the attribute - RequireQualifiedAccessAttribute - - - This attribute is used to indicate that references to the elements of a module, record or union - type require explicit qualified access. - - - Creates an instance of the attribute - RequiresExplicitTypeArgumentsAttribute - - - Adding this attribute to a type, value or member requires that - uses of the construct must explicitly instantiate any generic type parameters. - - - The value of the attribute, indicating whether the type is sealed or not. - - - Creates an instance of the attribute - Indicates whether the class is sealed. - SealedAttribute - - - Creates an instance of the attribute. - The created attribute. - - - Adding this attribute to class definition makes it sealed, which means it may not - be extended or implemented. - - - Indicates that the compiled entity had private or internal representation in F# source code. - - - The mask of values related to the kind of the compiled entity. - - - Indicates that the compiled entity is part of the representation of an F# value declaration. - - - Indicates that the compiled entity is part of the representation of an F# union case declaration. - - - Indicates that the compiled entity is part of the representation of an F# module declaration. - - - Indicates that the compiled entity is part of the representation of an F# closure. - - - Indicates that the compiled entity is part of the representation of an F# exception declaration. - - - Indicates that the compiled entity is part of the representation of an F# record or union case field declaration. - - - Indicates that the compiled entity is part of the representation of an F# class or other object type declaration. - - - Indicates that the compiled entity is part of the representation of an F# record type declaration. - - - Indicates that the compiled entity is part of the representation of an F# union type declaration. - - - Indicates that the compiled entity has no relationship to an element in F# source code. - - - - - - Indicates the relationship between a compiled entity in a CLI binary and an element in F# source code. - - - Creates an instance of the attribute - StructAttribute - - - Adding this attribute to a type causes it to be represented using a CLI struct. - - - Creates an instance of the attribute - StructuralComparisonAttribute - - - Adding this attribute to a record, union, exception, or struct type confirms the - automatic generation of implementations for 'System.IComparable' for the type. - - - Creates an instance of the attribute - StructuralEqualityAttribute - - - Adding this attribute to a record, union or struct type confirms the automatic - generation of overrides for 'System.Object.Equals(obj)' and - 'System.Object.GetHashCode()' for the type. - - - Indicates the text to display by default when objects of this type are displayed - using '%A' printf formatting patterns and other two-dimensional text-based display - layouts. - - - Creates an instance of the attribute - Indicates the text to display when using the '%A' printf formatting. - StructuredFormatDisplayAttribute - - - 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 this version of F# the only valid values are of the form PreText {PropertyName} PostText. - The property name indicates a property to evaluate and to display instead of the object itself. - - - The type 'unit', which has only one value "()". This value is special and - always uses the representation 'null'. - - - Creates an instance of the attribute - UnverifiableAttribute - - - This attribute is used to tag values whose use will result in the generation - of unverifiable code. These values are inevitably marked 'inline' to ensure that - the unverifiable constructs are not present in the actual code for the F# library, - but are rather copied to the source code of the caller. - - - Creates an instance of the attribute - VolatileFieldAttribute - - - Adding this attribute to an F# mutable binding causes the "volatile" - prefix to be used for all accesses to the field. - - - Four dimensional arrays, typically zero-based. Non-zero-based arrays - can be created using methods on the System.Array type. - - Use the values in the Array4D module - to manipulate values of this type, or the notation arr.[x1,x2,x3,x4] to get and set array - values. - - - Three dimensional arrays, typically zero-based. Non-zero-based arrays - can be created using methods on the System.Array type. - - Use the values in the Array3D module - to manipulate values of this type, or the notation arr.[x1,x2,x3] to get and set array - values. - - - Two dimensional arrays, typically zero-based. - - Use the values in the Array2D module - to manipulate values of this type, or the notation arr.[x,y] to get/set array - values. - - Non-zero-based arrays can also be created using methods on the System.Array type. - - - Single dimensional, zero-based arrays, written int[], string[] etc. - Use the values in the Array module to manipulate values - of this type, or the notation arr.[x] to get/set array - values. - - - Single dimensional, zero-based arrays, written int[], string[] etc. - - Use the values in the Array module to manipulate values - of this type, or the notation arr.[x] to get/set array - values. - - - - - - An abbreviation for the CLI type System.Boolean. - - - Represents a managed pointer in F# code. - - - An abbreviation for the CLI type System.Byte. - - - An abbreviation for the CLI type System.Char. - - - An abbreviation for the CLI type System.Decimal. - - - The type of decimal numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.Decimal. - - - An abbreviation for the CLI type System.Double. - - - An abbreviation for the CLI type System.Exception. - - - An abbreviation for the CLI type System.Double. - - - An abbreviation for the CLI type System.Single. - - - The type of floating point numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.Single. - - - The type of floating point numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.Double. - - - This type is for internal use by the F# code generator. - - - An abbreviation for the CLI type System.Int32. - - - An abbreviation for the CLI type System.Int16. - - - The type of 16-bit signed integer numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.Int16. - - - An abbreviation for the CLI type System.Int32. - - - An abbreviation for the CLI type System.Int64. - - - The type of 64-bit signed integer numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.Int64. - - - An abbreviation for the CLI type System.SByte. - - - The type of 32-bit signed integer numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.Int32. - - - An abbreviation for the CLI type System.IntPtr. - - - Represents an unmanaged pointer in F# code. - - This type should only be used when writing F# code that interoperates - with native code. Use of this type in F# code may result in - unverifiable code being generated. Conversions to and from the - nativeint type may be required. Values of this type can be generated - by the functions in the NativeInterop.NativePtr module. - - - An abbreviation for the CLI type System.Object. - - - The type of optional values. When used from other CLI languages the - empty option is the null value. - - Use the constructors Some and None to create values of this type. - Use the values in the Option module to manipulate values of this type, - or pattern match against the values directly. - - 'None' values will appear as the value null to other CLI languages. - Instance methods on this type will appear as static methods to other CLI languages - due to the use of null as a value representation. - - - The type of mutable references. Use the functions [:=] and [!] to get and - set values of this type. - - - An abbreviation for the CLI type System.SByte. - - - The type of 8-bit signed integer numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.SByte. - - - An abbreviation for the CLI type System.Single. - - - An abbreviation for the CLI type System.String. - - - An abbreviation for the CLI type System.UInt16. - - - An abbreviation for the CLI type System.UInt32. - - - An abbreviation for the CLI type System.UInt64. - - - An abbreviation for the CLI type System.Byte. - - - An abbreviation for the CLI type System.UIntPtr. - - - The type 'unit', which has only one value "()". This value is special and - always uses the representation 'null'. - - - - - - - - - - - - Non-exhaustive match failures will raise the MatchFailureException exception - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - A new enumerator for the sequence. - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - A reference to the sequence. - - A 0, 1, and 2 respectively indicate Stop, Yield, and Goto conditions for the sequence generator. - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - A new sequence generator for the expression. - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - - - Namespace name the provider injects types into. - - - - - Compilers call this method to query a type provider for a type name. - - Resolver should return a type called name in namespace NamespaceName or null if the type is unknown. - - - - - - The top-level types - - - - - - The sub-namespaces in this namespace. An optional member to prevent generation of namespaces until an outer namespace is explored. - - - - - - - - Triggered when an assumption changes that invalidates the resolutions so far reported by the provider - - - - - Triggered when an assumption changes that invalidates the resolutions so far reported by the provider - - - - - Triggered when an assumption changes that invalidates the resolutions so far reported by the provider - - - - - Get the static parameters for a provided type. - - A type returned by GetTypes or ResolveTypeName - - - - - Namespace name the this TypeProvider injects types into. - - - - - Called by the compiler to ask for an Expression tree to replace the given MethodBase with. - - MethodBase that was given to the compiler by a type returned by a GetType(s) call. - Expressions that represent the parameters to this call. - An expression that the compiler will use in place of the given method base. - - - - Get the physical contents of the given logical provided assembly. - - - - - Apply static arguments to a provided type that accepts static arguments. - - The provider must return a type with the given mangled name. - the provided type definition which has static parameters - the full path of the type, including encoded representations of static parameters - the static parameters, indexed by name - - - - - - - Represents the inverse of a measure expressions when returned as a generic argument of a provided type. - - - Represents the '1' measure expression when returned as a generic argument of a provided type. - - - Represents the product of two measure expressions when returned as a generic argument of a provided type. - - - - - - Creates an instance of the attribute - TypeProviderAssemblyAttribute - The name of the design-time assembly for this type provider. - - - Creates an instance of the attribute - TypeProviderAssemblyAttribute - - - Place attribute on runtime assembly to indicate that there is a corresponding design-time - assembly that contains a type provider. Runtime and designer assembly may be the same. - - - Creates an instance of the attribute - TypeProviderAttribute - - - Place on a class that implements ITypeProvider to extend the compiler - - - - Get the full path to use for temporary files for the type provider instance. - - - - - version of referenced system runtime assembly - - - - - Get the full path to referenced assembly that caused this type provider instance to be created. - - - - - Get the full path to use to resolve relative paths in any file name arguments given to the type provider instance. - - - - - Get the referenced assemblies for the type provider instance. - - - - - Indicates if the type provider host responds to invalidation events for type provider instances. - - - - - Indicates if the type provider instance is used in an environment which executes provided code such as F# Interactive. - - - - - Get the full path to use for temporary files for the type provider instance. - - - - - version of referenced system runtime assembly - - - - - Get the full path to referenced assembly that caused this type provider instance to be created. - - - - - Get the full path to use to resolve relative paths in any file name arguments given to the type provider instance. - - - - - Get the referenced assemblies for the type provider instance. - - - - - Indicates if the type provider host responds to invalidation events for type provider instances. - - - - - Indicates if the type provider instance is used in an environment which executes provided code such as F# Interactive. - - - - - Checks if given type exists in target system runtime library - - - - - - - - If the class that implements ITypeProvider has a constructor that accepts TypeProviderConfig - then it will be constructed with an instance of TypeProviderConfig. - - - - - - - - - - - - - - - - - - - - - - - - - - - - Creates an instance of the attribute - TypeProviderEditorHideMethodsAttribute - - - Indicates that a code editor should hide all System.Object methods from the intellisense menus for instances of a provided type - - - - - - - - - - - - Additional type attribute flags related to provided types - - - - - - Creates an instance of the attribute - TypeProviderXmlDocAttribute - - - - The TypeProviderXmlDocAttribute attribute can be added to types and members. - The language service will display the CommentText property from the attribute - in the appropriate place when the user hovers over a type or member. - - - - - - - - - - - - - - - - Creates an anonymous event with the given handlers. - - A function to handle adding a delegate for the event to trigger. - A function to handle removing a delegate that the event triggers. - A function to produce the delegate type the event can trigger. - - The initialized event. - - - The F# compiler emits calls to this function to implement the use operator for F# sequence - expressions. - - The resource to be used and disposed. - The input sequence. - - The result sequence. - - - The F# compiler emits calls to this function to implement the compiler-intrinsic - conversions from untyped System.Collections.IEnumerable sequences to typed sequences. - - An initializer function. - A function to iterate and test if end of sequence is reached. - A function to retrieve the current element. - - The resulting typed sequence. - - - The F# compiler emits calls to this function to - implement the try/finally operator for F# sequence expressions. - - The input sequence. - A computation to be included in an enumerator's Dispose method. - - The result sequence. - - - The F# compiler emits calls to this function to - implement the while operator for F# sequence expressions. - - A function that indicates whether iteration should continue. - The input sequence. - - The result sequence. - - - A group of functions used as part of the compiled representation of F# sequence expressions. - - - Builds a query using query syntax and operators. - - - An active pattern to force the execution of values of type Lazy<_>. - - - Special prefix operator for splicing untyped expressions into quotation holes. - - - Special prefix operator for splicing typed expressions into quotation holes. - - - Builds a 2D array from a sequence of sequences of elements. - - - Builds a read-only lookup table from a sequence of key/value pairs. The key objects are indexed using generic hashing and equality. - - - Converts the argument to signed byte. - This is a direct conversion for all - primitive numeric types. For strings, the input is converted using SByte.Parse() with InvariantCulture settings. - Otherwise the operation requires and invokes a ToSByte method on the input type. - - - Converts the argument to byte. - This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Byte.Parse() on strings and otherwise requires a ToByte method on the input type. - - - Converts the argument to 64-bit float. - This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Double.Parse() with InvariantCulture settings. Otherwise the operation requires and invokes a ToDouble method on the input type. - - - Converts the argument to 32-bit float. - This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Single.Parse() with InvariantCulture settings. Otherwise the operation requires and invokes a ToSingle method on the input type. - - - Builds an aysnchronous workflow using computation expression syntax. - - - Builds a set from a sequence of objects. The objects are indexed using generic comparison. - The input sequence of elements. - The created set. - - - Print to a file using the given format, and add a newline. - The file TextWriter. - The formatter. - The formatted result. - - - Print to a file using the given format. - The file TextWriter. - The formatter. - The formatted result. - - - Print to a string buffer and raise an exception with the given - result. Helper printers must return strings. - The formatter. - The formatted result. - - - Print to a string using the given format. - The formatter. - The formatted result. - - - - - - Divides a value by an integer. - The input value. - The input int. - The division result. - - - - - - Resolves to the value 'one' for any primitive numeric type or any type with a static member called 'One' - - - Resolves to the zero value for any primitive numeric type or any type with a static member called 'Zero' - - - A compiler intrinsic that implements dynamic invocations for the DivideByInt primitive. - - - A compiler intrinsic that implements dynamic invocations to the checked '*' operator. - - - A compiler intrinsic that implements dynamic invocations to the '*' operator. - - - A compiler intrinsic that implements dynamic invocations to the checked '+' operator. - - - A compiler intrinsic that implements dynamic invocations to the '+' operator. - - - Resolves to the value 'one' for any primitive numeric type or any type with a static member called 'One'. - - - Resolves to the zero value for any primitive numeric type or any type with a static member called 'Zero'. - - - Parse an uint64 according to the rules used by the overloaded 'uint64' conversion operator when applied to strings - The input string. - The parsed value. - - - Parse an int64 according to the rules used by the overloaded 'int64' conversion operator when applied to strings - The input string. - The parsed value. - - - Parse an uint32 according to the rules used by the overloaded 'uint32' conversion operator when applied to strings - The input string. - The parsed value. - - - Parse an int32 according to the rules used by the overloaded 'int32' conversion operator when applied to strings - The input string. - The parsed value. - - - Creates an sbyte value with units-of-measure - The input sbyte. - The sbyte with units-of-measure. - - - Creates an int16 value with units-of-measure - The input int16. - The int16 with units-of-measure. - - - Creates an int64 value with units-of-measure - The input int64. - The int64 with units of measure. - - - Creates an int32 value with units-of-measure - The input int. - The int with units of measure. - - - Creates a decimal value with units-of-measure - The input decimal. - The decimal with units of measure. - - - Creates a float32 value with units-of-measure - The input float. - The float with units-of-measure. - - - Creates a float value with units-of-measure - The input float. - The float with units-of-measure. - - - Get the underlying value for an enum value - The input enum. - The enumeration as a value. - - - Build an enum value from an underlying value - The input value. - The value as an enumeration. - - - Recursively hash a part of a value according to its structure. - The comparison function. - The input object. - The hashed value. - - - Hash a value according to its structure. Use the given limit to restrict the hash when hashing F# - records, lists and union types. - The limit on the number of nodes. - The input object. - The hashed value. - - - Hash a value according to its structure. This hash is not limited by an overall node count when hashing F# - records, lists and union types. - The input object. - The hashed value. - - - Make an F# hash/equality object for the given type using node-limited hashing when hashing F# - records, lists and union types. - The input limit on the number of nodes. - System.Collections.Generic.IEqualityComparer<'T> - - - Make an F# hash/equality object for the given type - - - Make an F# comparer object for the given type, where it can be null if System.Collections.Generic.Comparer<'T>.Default - - - Make an F# comparer object for the given type - - - A static F# comparer object - - - Return an F# comparer object suitable for hashing and equality. This hashing behaviour - of the returned comparer is not limited by an overall node count when hashing F# - records, lists and union types. This equality comparer has equivalence - relation semantics ([nan] = [nan]). - - - Return an F# comparer object suitable for hashing and equality. This hashing behaviour - of the returned comparer is not limited by an overall node count when hashing F# - records, lists and union types. - - - The physical hash. Hashes on the object identity, except for value types, - where we hash on the contents. - The input object. - The hashed value. - - - Reference/physical equality. - True if the inputs are reference-equal, false otherwise. - The first value. - The second value. - The result of the comparison. - - - Take the maximum of two values structurally according to the order given by GenericComparison - The first value. - The second value. - The maximum value. - - - Take the minimum of two values structurally according to the order given by GenericComparison - The first value. - The second value. - The minimum value. - - - Compare two values - The first value. - The second value. - The result of the comparison. - - - Compare two values - The first value. - The second value. - The result of the comparison. - - - Compare two values - The first value. - The second value. - The result of the comparison. - - - Compare two values - The first value. - The second value. - The result of the comparison. - - - Compare two values. May be called as a recursive case from an implementation of System.IComparable to - ensure consistent NaN comparison semantics. - The function to compare the values. - The first value. - The second value. - The result of the comparison. - - - Compare two values - The first value. - The second value. - The result of the comparison. - - - Compare two values for equality - - The first value. - The second value. - The result of the comparison. - - - Compare two values for equality using equivalence relation semantics ([nan] = [nan]) - The first value. - The second value. - The result of the comparison. - - - Compare two values for equality using partial equivalence relation semantics ([nan] <> [nan]) - The first value. - The second value. - The result of the comparison. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - The F# compiler emits calls to some of the functions in this module as part of the compiled form of some language constructs - - - - The standard overloaded associative (4-indexed) mutation operator - - - - The standard overloaded associative (3-indexed) mutation operator - - - The standard overloaded associative (2-indexed) mutation operator - - - The standard overloaded associative (indexed) mutation operator - - - The standard overloaded associative (4-indexed) lookup operator - - - The standard overloaded associative (3-indexed) lookup operator - - - The standard overloaded associative (2-indexed) lookup operator - - - The standard overloaded associative (indexed) lookup operator - - - A compiler intrinsic for checking initialization soundness of recursive bindings - - - A compiler intrinsic for checking initialization soundness of recursive static bindings - - - A compiler intrinsic for checking initialization soundness of recursive bindings - - - A compiler intrinsic for the efficient compilation of sequence expressions - - - This function implements parsing of decimal constants - - - This function implements calls to default constructors - acccessed by 'new' constraints. - - - Primitive used by pattern match compilation - - - A compiler intrinsic that implements the ':?' operator - - - A compiler intrinsic that implements the ':?' operator - - - A compiler intrinsic that implements the ':?>' operator - - - A compiler intrinsic that implements the ':?>' operator - - - The F# compiler emits calls to some of the functions in this module as part of the compiled form of some language constructs - - - Address-of. Uses of this value may result in the generation of unverifiable code. - The input object. - The unmanaged pointer. - - - Address-of. Uses of this value may result in the generation of unverifiable code. - The input object. - The managed pointer. - - - Binary 'or'. When used as a binary operator the right hand value is evaluated only on demand - The first value. - The second value. - The result of the operation. - - - Binary 'or'. When used as a binary operator the right hand value is evaluated only on demand. - - - Binary 'and'. When used as a binary operator the right hand value is evaluated only on demand - The first value. - The second value. - The result of the operation. - - - Binary 'and'. When used as a binary operator the right hand value is evaluated only on demand. - - - The F# compiler emits calls to some of the functions in this module as part of the compiled form of some language constructs - - - - - - - - - - - - - - - - - - For internal use only - - - Language primitives associated with the F# language - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - An active pattern to match values of type System.Collections.Generic.KeyValuePair - The input key/value pair. - A tuple containing the key and value. - - - Converts the argument to character. Numeric inputs are converted according to the UTF-16 - encoding for characters. String inputs must be exactly one character long. For other - input types the operation requires an appropriate static conversion method on the input type. - The input value. - The converted char. - - - Converts the argument to System.Decimal using a direct conversion for all - primitive numeric types. For strings, the input is converted using UInt64.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted decimal. - - - Converts the argument to a string using ToString. - - For standard integer and floating point values the ToString conversion - uses CultureInfo.InvariantCulture. - The input value. - The converted string. - - - Converts the argument to unsigned native integer using a direct conversion for all - primitive numeric types. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted unativeint - - - Converts the argument to signed native integer. This is a direct conversion for all - primitive numeric types. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted nativeint - - - Converts the argument to 64-bit float. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Double.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted float - - - Converts the argument to 32-bit float. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Single.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted float32 - - - Converts the argument to unsigned 64-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using UInt64.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint64 - - - Converts the argument to signed 64-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Int64.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int64 - - - Converts the argument to unsigned 32-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using UInt32.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint32 - - - Converts the argument to signed 32-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Int32.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int32 - - - Converts the argument to a particular enum type. - The input value. - The converted enum type. - - - Converts the argument to signed 32-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Int32.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int - - - Converts the argument to unsigned 16-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using UInt16.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint16 - - - Converts the argument to signed 16-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Int16.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int16 - - - Converts the argument to signed byte. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using SByte.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted sbyte - - - Converts the argument to byte. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Byte.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted byte - - - Overloaded power operator. If n > 0 then equivalent to x*...*x for n occurrences of x. - The input base. - The input exponent. - The base raised to the exponent. - - - Overloaded power operator. - The input base. - The input exponent. - The base raised to the exponent. - - - Overloaded truncate operator. - The input value. - The truncated value. - - - Hyperbolic tangent of the given number - The input value. - The hyperbolic tangent of the input. - - - Tangent of the given number - The input value. - The tangent of the input. - - - Hyperbolic sine of the given number - The input value. - The hyperbolic sine of the input. - - - Sine of the given number - The input value. - The sine of the input. - - - Hyperbolic cosine of the given number - The input value. - The hyperbolic cosine of the input. - - - Cosine of the given number - The input value. - The cosine of the input. - - - Square root of the given number - The input value. - The square root of the input. - - - Logarithm to base 10 of the given number - The input value. - The logarithm to base 10 of the input. - - - Natural logarithm of the given number - The input value. - The natural logarithm of the input. - - - Round the given number - The input value. - The nearest integer to the input value. - - - Sign of the given number - The input value. - -1, 0, or 1 depending on the sign of the input. - - - Floor of the given number - The input value. - The floor of the input. - - - Exponential of the given number - The input value. - The exponential of the input. - - - Ceiling of the given number - The input value. - The ceiling of the input. - - - Inverse tangent of x/y where x and y are specified separately - The y input value. - The x input value. - The inverse tangent of the input ratio. - - - Inverse tangent of the given number - The input value. - The inverse tangent of the input. - - - Inverse sine of the given number - The input value. - The inverse sine of the input. - - - Inverse cosine of the given number - The input value. - The inverse cosine of the input. - - - Absolute value of the given number. - The input value. - The absolute value of the input. - - - A generic hash function. This function has the same behaviour as 'hash', - however the default structural hashing for F# union, record and tuple - types stops when the given limit of nodes is reached. The exact behaviour of - the function can be adjusted on a type-by-type basis by implementing - GetHashCode for each type. - The limit of nodes. - The input object. - The computed hash. - - - A generic hash function, designed to return equal hash values for items that are - equal according to the "=" operator. By default it will use structural hashing - for F# union, record and tuple types, hashing the complete contents of the - type. The exact behaviour of the function can be adjusted on a - type-by-type basis by implementing GetHashCode for each type. - The input object. - The computed hash. - - - Returns the internal size of a type in bytes. For example, sizeof<int> returns 4. - - - Generate a System.Type representation for a type definition. If the - input type is a generic type instantiation then return the - generic type definition associated with all such instantiations. - - - An internal, library-only compiler intrinsic for compile-time - generation of a RuntimeMethodHandle. - - - Generate a System.Type runtime representation of a static type. - The static type is still maintained on the value returned. - - - Clean up resources associated with the input object after the completion of the given function. - Cleanup occurs even when an exception is raised by the protected - code. - The resource to be disposed after action is called. - The action that accepts the resource. - The resulting value. - - - Execute the function as a mutual-exclusion region using the input value as a lock. - The object to be locked. - The action to perform during the lock. - The resulting value. - - - The standard overloaded skip range operator, e.g. [n..skip..m] for lists, seq {n..skip..m} for sequences - The start value of the range. - The step value of the range. - The end value of the range. - The sequence spanning the range using the specified step size. - - - The standard overloaded range operator, e.g. [n..m] for lists, seq {n..m} for sequences - The start value of the range. - The end value of the range. - The sequence spanning the range. - - - Equivalent to System.Single.NaN - - - Equivalent to System.Single.PositiveInfinity - - - Equivalent to System.Double.NaN - - - Equivalent to System.Double.PositiveInfinity - - - Builds a sequence using sequence expression syntax - The input sequence. - The result sequence. - - - Negate a logical value. not true equals false and not false equals true - The value to negate. - The result of the negation. - - - Concatenate two lists. - The first list. - The second list. - The concatenation of the lists. - - - Increment a mutable reference cell containing an integer - The reference cell. - - - Decrement a mutable reference cell containing an integer - The reference cell. - - - Dereference a mutable reference cell - The cell to dereference. - The value contained in the cell. - - - Assign to a mutable reference cell - The cell to mutate. - The value to set inside the cell. - - - Create a mutable reference cell - The value to contain in the cell. - The created reference cell. - - - The identity function - The input value. - The same value. - - - Throw a System.InvalidOperationException exception - The exception message. - The result value. - - - Throw a System.ArgumentNullException exception - The argument name. - The result value. - - - Throw a System.ArgumentException exception with - the given argument name and message. - The argument name. - The exception message. - The result value. - - - Throw a System.Exception exception. - The exception message. - The result value. - - - Boxes a strongly typed value. - The value to box. - The boxed object. - - - Unboxes a strongly typed value. This is the inverse of box, unbox<t>(box<t> a) equals a. - The boxed value. - The unboxed result. - - - Ignore the passed value. This is often used to throw away results of a computation. - The value to ignore. - - - Minimum based on generic comparison - The first value. - The second value. - The minimum value. - - - Maximum based on generic comparison - The first value. - The second value. - The maximum value. - - - Generic comparison. - The first value. - The second value. - The result of the comparison. - - - Return the second element of a tuple, snd (a,b) = b. - The input tuple. - The second value. - - - Return the first element of a tuple, fst (a,b) = a. - The input tuple. - The first value. - - - Matches System.Exception objects whose runtime type is precisely System.Exception - The input exception. - A string option. - - - Builds a System.Exception object. - The message for the Exception. - A System.Exception. - - - Rethrows an exception. This should only be used when handling an exception - The result value. - - - Rethrows an exception. This should only be used when handling an exception - The result value. - - - Raises an exception - The exception to raise. - The result value. - - - Concatenate two strings. The operator '+' may also be used. - - - Used to specify a default value for an optional argument in the implementation of a function - An option representing the argument. - The default value of the argument. - The argument value. If it is None, the defaultValue is returned. - - - Apply a function to three values, the values being a triple on the right, the function on the left - The function. - The first argument. - The second argument. - The third argument. - The function result. - - - Apply a function to two values, the values being a pair on the right, the function on the left - The function. - The first argument. - The second argument. - The function result. - - - Apply a function to a value, the value being on the right, the function on the left - The function. - The argument. - The function result. - - - Apply a function to three values, the values being a triple on the left, the function on the right - The first argument. - The second argument. - The third argument. - The function. - The function result. - - - Apply a function to two values, the values being a pair on the left, the function on the right - The first argument. - The second argument. - The function. - The function result. - - - Apply a function to a value, the value being on the left, the function on the right - The argument. - The function. - The function result. - - - Compose two functions, the function on the right being applied first - The second function to apply. - The first function to apply. - The composition of the input functions. - - - Compose two functions, the function on the left being applied first - The first function to apply. - The second function to apply. - The composition of the input functions. - - - Structural inequality - The first parameter. - The second parameter. - The result of the comparison. - - - Structural equality - The first parameter. - The second parameter. - The result of the comparison. - - - Structural less-than-or-equal comparison - The first parameter. - The second parameter. - The result of the comparison. - - - Structural greater-than-or-equal - The first parameter. - The second parameter. - The result of the comparison. - - - Structural greater-than - The first parameter. - The second parameter. - The result of the comparison. - - - Structural less-than comparison - The first parameter. - The second parameter. - The result of the comparison. - - - Overloaded prefix-plus operator - The input value. - The result of the operation. - - - Overloaded bitwise-NOT operator - The input value. - The result of the operation. - - - Overloaded byte-shift right operator by a specified number of bits - The input value. - The amount to shift. - The result of the operation. - - - Overloaded byte-shift left operator by a specified number of bits - The input value. - The amount to shift. - The result of the operation. - - - Overloaded bitwise-XOR operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded bitwise-OR operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded bitwise-AND operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded modulo operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded division operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded multiplication operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded subtraction operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded addition operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded unary negation. - The value to negate. - The result of the operation. - - - Converts the argument to char. Numeric inputs are converted using a checked - conversion according to the UTF-16 encoding for characters. String inputs must - be exactly one character long. For other input types the operation requires an - appropriate static conversion method on the input type. - The input value. - The converted char - - - Converts the argument to unativeint. This is a direct, checked conversion for all - primitive numeric types. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted unativeint - - - Converts the argument to nativeint. This is a direct, checked conversion for all - primitive numeric types. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted nativeint - - - Converts the argument to uint64. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.UInt64.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint64 - - - Converts the argument to int64. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.Int64.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int64 - - - Converts the argument to uint32. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.UInt32.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint32 - - - Converts the argument to int32. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.Int32.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int32 - - - Converts the argument to int. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.Int32.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int - - - Converts the argument to uint16. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.UInt16.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint16 - - - Converts the argument to int16. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.Int16.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int16 - - - Converts the argument to sbyte. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.SByte.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted sbyte - - - Converts the argument to byte. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.Byte.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted byte - - - Overloaded multiplication operator (checks for overflow) - The first value. - The second value. - The product of the two input values. - - - Overloaded addition operator (checks for overflow) - The first value. - The second value. - The sum of the two input values. - - - Overloaded subtraction operator (checks for overflow) - The first value. - The second value. - The first value minus the second value. - - - Overloaded unary negation (checks for overflow) - The input value. - The negated value. - - - This module contains the basic arithmetic operations with overflow checks. - - - Perform generic hashing on a value where the type of the value is not - statically required to satisfy the 'equality' constraint. - The computed hash value. - - - Perform generic equality on two values where the type of the values is not - statically required to satisfy the 'equality' constraint. - The result of the comparison. - - - Perform generic comparison on two values where the type of the values is not - statically required to have the 'comparison' constraint. - The result of the comparison. - - - Generate a default value for any type. This is null for reference types, - For structs, this is struct value where all fields have the default value. - This function is unsafe in the sense that some F# values do not have proper null values. - - - Unboxes a strongly typed value. This is the inverse of box, unbox<t>(box<t> a) equals a. - The boxed value. - The unboxed result. - - - This module contains basic operations which do not apply runtime and/or static checks - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'decimal' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'float' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'float32' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'unativeint' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'nativeint' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'uint64' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'int64' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'uint32' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'int32' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'uint16' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'int16' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'sbyte' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'byte' - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - Generate a range of values using the given zero, add, start, step and stop values - - - Generate a range of values using the given zero, add, start, step and stop values - - - Generate a range of char values - - - Generate a range of byte values - - - Generate a range of sbyte values - - - Generate a range of uint16 values - - - Generate a range of int16 values - - - Generate a range of unativeint values - - - Generate a range of nativeint values - - - Generate a range of uint32 values - - - Generate a range of uint64 values - - - Generate a range of int64 values - - - Generate a range of float32 values - - - Generate a range of float values - - - Generate a range of integers - - - Gets a slice from a string - The source string. - The index of the first character of the slice. - The index of the last character of the slice. - The substring from the given indices. - - - Sets a slice of an array - The target array. - The start index of the first dimension. - The end index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The start index of the third dimension. - The end index of the third dimension. - The start index of the fourth dimension. - The end index of the fourth dimension. - The source array. - - - Gets a slice of an array - The source array. - The start index of the first dimension. - The end index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The start index of the third dimension. - The end index of the third dimension. - The start index of the fourth dimension. - The end index of the fourth dimension. - The four dimensional sub array from the given indices. - - - Sets a slice of an array - The target array. - The start index of the first dimension. - The end index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The start index of the third dimension. - The end index of the third dimension. - The source array. - - - Gets a slice of an array - The source array. - The start index of the first dimension. - The end index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The start index of the third dimension. - The end index of the third dimension. - The three dimensional sub array from the given indices. - - - Sets a vector slice of a 2D array. The index of the second dimension is fixed. - The target array. - The start index of the first dimension. - The end index of the first dimension. - The index of the second dimension. - The source array. - - - Sets a vector slice of a 2D array. The index of the first dimension is fixed. - The target array. - The index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The source array. - - - Sets a region slice of an array - The target array. - The start index of the first dimension. - The end index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The source array. - - - Gets a vector slice of a 2D array. The index of the second dimension is fixed. - The source array. - The start index of the first dimension. - The end index of the first dimension. - The fixed index of the second dimension. - The sub array from the input indices. - - - Gets a vector slice of a 2D array. The index of the first dimension is fixed. - The source array. - The index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The sub array from the input indices. - - - Gets a region slice of an array - The source array. - The start index of the first dimension. - The end index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The two dimensional sub array from the input indices. - - - Sets a slice of an array - The target array. - The start index. - The end index. - The source array. - - - Gets a slice of an array - The input array. - The start index. - The end index. - The sub array from the input indices. - - - A module of compiler intrinsic functions for efficient implementations of F# integer ranges - and dynamic invocations of other F# operators - - - Basic F# Operators. This module is automatically opened in all F# code. - - - Invoke an F# first class function value that accepts five curried arguments - without intervening execution - The first arg. - The second arg. - The third arg. - The fourth arg. - The fifth arg. - The function result. - - - Adapt an F# first class function value to be an optimized function value that can - accept five curried arguments without intervening execution. - The input function. - The optimized function. - - - Construct an optimized function value that can accept five curried - arguments without intervening execution. - The optimized function. - - - The CLI type used to represent F# function values that accept five curried arguments - without intervening execution. This type should not typically used directly from - either F# code or from other CLI languages. - - - Invoke an F# first class function value that accepts four curried arguments - without intervening execution - The first arg. - The second arg. - The third arg. - The fourth arg. - The function result. - - - Adapt an F# first class function value to be an optimized function value that can - accept four curried arguments without intervening execution. - The input function. - The optimized function. - - - Construct an optimized function value that can accept four curried - arguments without intervening execution. - The optimized function. - - - The CLI type used to represent F# function values that accept four curried arguments - without intervening execution. This type should not typically used directly from - either F# code or from other CLI languages. - - - Invoke an F# first class function value that accepts three curried arguments - without intervening execution - The first arg. - The second arg. - The third arg. - The function result. - - - Adapt an F# first class function value to be an optimized function value that can - accept three curried arguments without intervening execution. - The input function. - The adapted function. - - - Construct an optimized function value that can accept three curried - arguments without intervening execution. - The optimized function. - - - The CLI type used to represent F# function values that accept - three iterated (curried) arguments without intervening execution. This type should not - typically used directly from either F# code or from other CLI languages. - - - Invoke the optimized function value with two curried arguments - The first arg. - The second arg. - The function result. - - - Adapt an F# first class function value to be an optimized function value that can - accept two curried arguments without intervening execution. - The input function. - The adapted function. - - - Construct an optimized function value that can accept two curried - arguments without intervening execution. - The optimized function. - - - The CLI type used to represent F# function values that accept - two iterated (curried) arguments without intervening execution. This type should not - typically used directly from either F# code or from other CLI languages. - - - An implementation module used to hold some private implementations of function - value invocation. - - - Convert the option to a list of length 0 or 1. - The input option. - The result list. - - - Convert the option to an array of length 0 or 1. - The input option. - The result array. - - - bind f inp evaluates to match inp with None -> None | Some x -> f x - A function that takes the value of type T from an option and transforms it into - an option containing a value of type U. - The input option. - An option of the output type of the binder. - - - map f inp evaluates to match inp with None -> None | Some x -> Some (f x). - A function to apply to the option value. - The input option. - An option of the input value after applying the mapping function, or None if the input is None. - - - iter f inp executes match inp with None -> () | Some x -> f x. - A function to apply to the option value. - The input option. - Unit if the option is None, otherwise it returns the result of applying the predicate - to the option value. - - - forall p inp evaluates to match inp with None -> true | Some x -> p x. - A function that evaluates to a boolean when given a value from the option type. - The input option. - True if the option is None, otherwise it returns the result of applying the predicate - to the option value. - - - exists p inp evaluates to match inp with None -> false | Some x -> p x. - A function that evaluates to a boolean when given a value from the option type. - The input option. - False if the option is None, otherwise it returns the result of applying the predicate - to the option value. - - - fold f inp s evaluates to match inp with None -> s | Some x -> f x s. - A function to update the state data when given a value from an option. - The input option. - The initial state. - The original state if the option is None, otherwise it returns the updated state with the folder - and the option value. - - - fold f s inp evaluates to match inp with None -> s | Some x -> f s x. - A function to update the state data when given a value from an option. - The initial state. - The input option. - The original state if the option is None, otherwise it returns the updated state with the folder - and the option value. - - - count inp evaluates to match inp with None -> 0 | Some _ -> 1. - The input option. - A zero if the option is None, a one otherwise. - - - Gets the value associated with the option. - The input option. - The value within the option. - Thrown when the option is None. - - - Returns true if the option is None. - The input option. - True if the option is None. - - - Returns true if the option is not None. - The input option. - True if the option is not None. - - - Basic operations on options. - - - - - - - - - - - - - - - - - - - - - - - - Represents a statically-analyzed format associated with writing to a System.IO.TextWriter. The type parameter indicates the - arguments and return type of the format operation. - - - Represents a statically-analyzed format when formatting builds a string. The type parameter indicates the - arguments and return type of the format operation. - - - Represents a statically-analyzed format associated with writing to a System.Text.StringBuilder. The type parameter indicates the - arguments and return type of the format operation. - - - Represents a statically-analyzed format associated with writing to a System.IO.TextWriter. The first type parameter indicates the - arguments of the format operation and the last the overall return type. - - - Represents a statically-analyzed format when formatting builds a string. The first type parameter indicates the - arguments of the format operation and the last the overall return type. - - - Represents a statically-analyzed format associated with writing to a System.Text.StringBuilder. The first type parameter indicates the - arguments of the format operation and the last the overall return type. - - - Print to a string buffer and raise an exception with the given - result. Helper printers must return strings. - The input formatter. - The arguments of the formatter. - - - sprintf, but call the given 'final' function to generate the result. - See kprintf. - The function called to generate a result from the formatted string. - The input formatter. - The arguments of the formatter. - - - printf, but call the given 'final' function to generate the result. - For example, these let the printing force a flush after all output has - been entered onto the channel, but not before. - The function called after formatting to generate the format result. - The input formatter. - The arguments of the formatter. - - - fprintf, but call the given 'final' function to generate the result. - See kprintf. - The function called after formatting to generate the format result. - The input TextWriter. - The input formatter. - The arguments of the formatter. - - - bprintf, but call the given 'final' function to generate the result. - See kprintf. - The function called after formatting to generate the format result. - The input StringBuilder. - The input formatter. - The arguments of the formatter. - - - Print to a string via an internal string buffer and return - the result as a string. Helper printers must return strings. - The input formatter. - The formatted string. - - - Print to a text writer, adding a newline - The TextWriter to print to. - The input formatter. - The return type and arguments of the formatter. - - - Print to a text writer. - The TextWriter to print to. - The input formatter. - The return type and arguments of the formatter. - - - Print to a System.Text.StringBuilder - The StringBuilder to print to. - The input formatter. - The return type and arguments of the formatter. - - - Extensible printf-style formatting for numbers and other datatypes - - Format specifications are strings with "%" markers indicating format - placeholders. Format placeholders consist of: - - %[flags][width][.precision][type] - - where the type is interpreted as follows: - - %b: bool, formatted as "true" or "false" - %s: string, formatted as its unescaped contents - %c: character literal - %d, %i: any basic integer type formatted as a decimal integer, signed if the basic integer type is signed. - %u: any basic integer type formatted as an unsigned decimal integer - %x, %X, %o: any basic integer type formatted as an unsigned hexadecimal - (a-f)/Hexadecimal (A-F)/Octal integer - - %e, %E, %f, %F, %g, %G: - any basic floating point type (float,float32) formatted - using a C-style floating point format specifications, i.e - - %e, %E: Signed value having the form [-]d.dddde[sign]ddd where - d is a single decimal digit, dddd is one or more decimal - digits, ddd is exactly three decimal digits, and sign - is + or - - - %f: Signed value having the form [-]dddd.dddd, where dddd is one - or more decimal digits. The number of digits before the - decimal point depends on the magnitude of the number, and - the number of digits after the decimal point depends on - the requested precision. - - %g, %G: Signed value printed in f or e format, whichever is - more compact for the given value and precision. - - - %M: System.Decimal value - - %O: Any value, printed by boxing the object and using it's ToString method(s) - - %A: Any value, printed with the default layout settings - - %a: A general format specifier, requires two arguments: - (1) a function which accepts two arguments: - (a) a context parameter of the appropriate type for the - given formatting function (e.g. an #System.IO.TextWriter) - (b) a value to print - and which either outputs or returns appropriate text. - - (2) the particular value to print - - - %t: A general format specifier, requires one argument: - (1) a function which accepts a context parameter of the - appropriate type for the given formatting function (e.g. - an System.IO.TextWriter)and which either outputs or returns - appropriate text. - - Basic integer types are: - byte,sbyte,int16,uint16,int32,uint32,int64,uint64,nativeint,unativeint - Basic floating point types are: - float, float32 - - The optional width is an integer indicating the minimal width of the - result. For instance, %6d prints an integer, prefixing it with spaces - to fill at least 6 characters. If width is '*', then an extra integer - argument is taken to specify the corresponding width. - - any number - '*': - - Valid flags are: - - 0: add zeros instead of spaces to make up the required width - '-': left justify the result within the width specified - '+': add a '+' character if the number is positive (to match a '-' sign - for negatives) - ' ': add an extra space if the number is positive (to match a '-' - sign for negatives) - - The printf '#' flag is invalid and a compile-time error will be reported if it is used. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Returns the length of the string. - The input string. - The number of characters in the string. - - - Returns a string by concatenating count instances of str. - The number of copies of the input string will be copied. - The input string. - The concatenated string. - Thrown when count is negative. - - - Tests if any character of the string satisfies the given predicate. - The function to test each character of the string. - The input string. - True if any character returns true for the predicate and false otherwise. - - - Tests if all characters in the string satisfy the given predicate. - The function to test each character of the string. - The input string. - True if all characters return true for the predicate and false otherwise. - - - Builds a new string whose characters are the results of applying the function mapping - to each index from 0 to count-1 and concatenating the resulting - strings. - The number of strings to initialize. - The function to take an index and produce a string to - be concatenated with the others. - The constructed string. - Thrown when count is negative. - - - Builds a new string whose characters are the results of applying the function mapping - to each of the characters of the input string and concatenating the resulting - strings. - The function to produce a string from each character of the input string. - The input string. - The concatenated string. - - - Builds a new string whose characters are the results of applying the function mapping - to each character and index of the input string. - The function to apply to each character and index of the string. - The input string. - The resulting string. - - - Builds a new string whose characters are the results of applying the function mapping - to each of the characters of the input string. - The function to apply to the characters of the string. - The input string. - The resulting string. - - - Applies the function action to the index of each character in the string and the - character itself. - The function to apply to each character and index of the string. - The input string. - - - Applies the function action to each character in the string. - The function to be applied to each character of the string. - The input string. - - - Returns a new string made by concatenating the given strings - with separator sep, that is a1 + sep + ... + sep + aN. - The separator string to be inserted between the strings - of the input sequence. - The sequence of strings to be concatenated. - A new string consisting of the concatenated strings separated by - the separation string. - Thrown when strings is null. - - - Functional programming operators for string processing. Further string operations - are available via the member functions on strings and other functionality in - System.String - and System.Text.RegularExpressions types. - - - - The SI unit of catalytic activity - - - - - The SI unit of does equivalent - - - - - The SI unit of absorbed dose - - - - - The SI unit of activity referred to a radionuclide - - - - - The SI unit of illuminance - - - - - The SI unit of luminous flux - - - - - The SI unit of inductance - - - - - The SI unit of magnetic flux density - - - - - The SI unit of magnetic flux - - - - - The SI unit of electric conductance - - - - - The SI unit of electric resistance - - - - - The SI unit of capacitance - - - - - The SI unit of electric potential difference, electromotive force - - - - - The SI unit of electric charge, amount of electricity - - - - - The SI unit of power, radiant flux - - - - - The SI unit of energy, work, amount of heat - - - - - The SI unit of pressure, stress - - - - - The SI unit of force - - - - - The SI unit of frequency - - - - - The SI unit of luminous intensity - - - - - The SI unit of amount of substance - - - - - The SI unit of thermodynamic temperature - - - - - The SI unit of electric current - - - - - The SI unit of time - - - - - The SI unit of mass - - - - - The SI unit of length - - - - - The SI unit of length - - - - - A synonym for henry, the SI unit of inductance - - - - - A synonym for katal, the SI unit of catalytic activity - - - - - A synonym for sievert, the SI unit of does equivalent - - - - - A synonym for gray, the SI unit of absorbed dose - - - - - A synonym for becquerel, the SI unit of activity referred to a radionuclide - - - - - A synonym for lux, the SI unit of illuminance - - - - - A synonym for lumen, the SI unit of luminous flux - - - - - A synonym for tesla, the SI unit of magnetic flux density - - - - - A synonym for weber, the SI unit of magnetic flux - - - - - A synonym for UnitNames.ohm, the SI unit of electric resistance. - - - - - A synonym for siemens, the SI unit of electric conductance - - - - - A synonym for farad, the SI unit of capacitance - - - - - A synonym for volt, the SI unit of electric potential difference, electromotive force - - - - - A synonym for coulomb, the SI unit of electric charge, amount of electricity - - - - - A synonym for watt, the SI unit of power, radiant flux - - - - - A synonym for joule, the SI unit of energy, work, amount of heat - - - - - A synonym for pascal, the SI unit of pressure, stress - - - - - A synonym for newton, the SI unit of force - - - - - A synonym for hertz, the SI unit of frequency - - - - - A synonym for candela, the SI unit of luminous intensity - - - - - A synonym for mole, the SI unit of amount of substance - - - - - A synonym for kelvin, the SI unit of thermodynamic temperature - - - - - A synonym for ampere, the SI unit of electric current - - - - - A synonym for second, the SI unit of time - - - - - A synonym for kilogram, the SI unit of mass - - - - - A synonym for Metre, the SI unit of length - - - - - A method used to support the F# query syntax. Returns an empty sequence that has the specified type argument. - - - - - A method used to support the F# query syntax. Returns a sequence that contains the specified values. - - - - - A method used to support the F# query syntax. Returns a sequence of length one that contains the specified value. - - - - A query operator that selects those elements based on a specified predicate. - - - - A query operator that performs a subsequent ordering of the elements selected so far in descending order by the given nullable sorting key. - This operator may only be used immediately after a 'sortBy', 'sortByDescending', 'thenBy' or 'thenByDescending', or their nullable variants. - - - - A query operator that performs a subsequent ordering of the elements selected so far in ascending order by the given nullable sorting key. - This operator may only be used immediately after a 'sortBy', 'sortByDescending', 'thenBy' or 'thenByDescending', or their nullable variants. - - - - A query operator that performs a subsequent ordering of the elements selected so far in descending order by the given sorting key. - This operator may only be used immediately after a 'sortBy', 'sortByDescending', 'thenBy' or 'thenByDescending', or their nullable variants. - - - - A query operator that performs a subsequent ordering of the elements selected so far in ascending order by the given sorting key. - This operator may only be used immediately after a 'sortBy', 'sortByDescending', 'thenBy' or 'thenByDescending', or their nullable variants. - - - - A query operator that selects elements from a sequence as long as a specified condition is true, and then skips the remaining elements. - - - - A query operator that selects a specified number of contiguous elements from those selected so far. - - - - A query operator that selects a nullable value for each element selected so far and returns the sum of these values. - If any nullable does not have a value, it is ignored. - - - - A query operator that selects a value for each element selected so far and returns the sum of these values. - - - - - A method used to support the F# query syntax. Inputs to queries are implicitly wrapped by a call to one of the overloads of this method. - - - - - A method used to support the F# query syntax. Inputs to queries are implicitly wrapped by a call to one of the overloads of this method. - - - - A query operator that sorts the elements selected so far in descending order by the given nullable sorting key. - - - - A query operator that sorts the elements selected so far in ascending order by the given nullable sorting key. - - - - A query operator that sorts the elements selected so far in descending order by the given sorting key. - - - - A query operator that sorts the elements selected so far in ascending order by the given sorting key. - - - - A query operator that bypasses elements in a sequence as long as a specified condition is true and then selects the remaining elements. - - - - A query operator that bypasses a specified number of the elements selected so far and selects the remaining elements. - - - - A query operator that projects each of the elements selected so far. - - - - - - - - - - - - - - A method used to support the F# query syntax. Runs the given quotation as a query using LINQ IQueryable rules. - - - - - A method used to support the F# query syntax. Indicates that the query should be passed as a quotation to the Run method. - - - - A query operator that selects the element at a specified index amongst those selected so far. - - - - A query operator that selects a nullable value for each element selected so far and returns the minimum of these values. - If any nullable does not have a value, it is ignored. - - - - A query operator that selects a value for each element selected so far and returns the minimum resulting value. - - - - A query operator that selects a nullable value for each element selected so far and returns the maximum of these values. - If any nullable does not have a value, it is ignored. - - - - A query operator that selects a value for each element selected so far and returns the maximum resulting value. - - - - A query operator that correlates two sets of selected values based on matching keys and groups the results. - If any group is empty, a group with a single default value is used instead. - Normal usage is 'leftOuterJoin y in elements2 on (key1 = key2) into group'. - - - - A query operator that selects the last element of those selected so far, or a default value if no element is found. - - - - A query operator that selects the last element of those selected so far. - - - - A query operator that correlates two sets of selected values based on matching keys. - Normal usage is 'join y in elements2 on (key1 = key2)'. - - - - A query operator that selects the first element of those selected so far, or a default value if the sequence contains no elements. - - - - A query operator that selects the first element from those selected so far. - - - - A query operator that selects a value for each element selected so far and groups the elements by the given key. - - - - A query operator that correlates two sets of selected values based on matching keys and groups the results. - Normal usage is 'groupJoin y in elements2 on (key1 = key2) into group'. - - - - A query operator that groups the elements selected so far according to a specified key selector. - - - - - A method used to support the F# query syntax. Projects each element of a sequence to another sequence and combines the resulting sequences into one sequence. - - - - A query operator that selects the first element selected so far that satisfies a specified condition. - - - - A query operator that determines whether any element selected so far satisfies a condition. - - - - A query operator that selects the single, specific element of those selected so far, or a default value if that element is not found. - - - - A query operator that selects the single, specific element selected so far - - - - A query operator that selects distinct elements from the elements selected so far. - - - - A query operator that returns the number of selected elements. - - - - A query operator that determines whether the selected elements contains a specified element. - - - - A query operator that selects a nullable value for each element selected so far and returns the average of these values. - If any nullable does not have a value, it is ignored. - - - - A query operator that selects a value for each element selected so far and returns the average of these values. - - - - A query operator that determines whether all elements selected so far satisfies a condition. - - - - Create an instance of this builder. Use 'query { ... }' to use the query syntax. - - - - The type used to support the F# query syntax. Use 'query { ... }' to use the query syntax. - - - - - A property used to support the F# query syntax. - - - - - A method used to support the F# query syntax. - - - - - A partial input or result in an F# query. This type is used to support the F# query syntax. - - - - Converts the argument to character. Numeric inputs are converted according to the UTF-16 - encoding for characters. The operation requires an appropriate static conversion method on the input type. - The input value. - The converted char. - - - Converts the argument to System.Decimal using a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted decimal. - - - Converts the argument to unsigned native integer using a direct conversion for all - primitive numeric types. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted unativeint - - - Converts the argument to signed native integer. This is a direct conversion for all - primitive numeric types. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted nativeint - - - Converts the argument to 64-bit float. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted float - - - Converts the argument to 32-bit float. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted float32 - - - Converts the argument to unsigned 64-bit integer. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint64 - - - Converts the argument to signed 64-bit integer. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int64 - - - Converts the argument to unsigned 32-bit integer. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint32 - - - Converts the argument to signed 32-bit integer. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int32 - - - Converts the argument to a particular enum type. - The input value. - The converted enum type. - - - Converts the argument to signed 32-bit integer. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int - - - Converts the argument to unsigned 16-bit integer. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint16 - - - Converts the argument to signed 16-bit integer. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int16 - - - Converts the argument to signed byte. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted sbyte - - - Converts the argument to byte. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted byte - - - - Functions for converting nullable values - - - - - The division operator where a nullable value appears on both left and right sides - - - - - The division operator where a nullable value appears on the right - - - - - The division operator where a nullable value appears on the left - - - - - The modulus operator where a nullable value appears on both left and right sides - - - - - The modulus operator where a nullable value appears on the right - - - - - The modulus operator where a nullable value appears on the left - - - - - The multiplication operator where a nullable value appears on both left and right sides - - - - - The multiplication operator where a nullable value appears on the right - - - - - The multiplication operator where a nullable value appears on the left - - - - - The subtraction operator where a nullable value appears on both left and right sides - - - - - The subtraction operator where a nullable value appears on the right - - - - - The subtraction operator where a nullable value appears on the left - - - - - The addition operator where a nullable value appears on both left and right sides - - - - - The addition operator where a nullable value appears on the right - - - - - The addition operator where a nullable value appears on the left - - - - - The '<>' operator where a nullable value appears on both left and right sides - - - - - The '=' operator where a nullable value appears on both left and right sides - - - - - The '<' operator where a nullable value appears on both left and right sides - - - - - The '<=' operator where a nullable value appears on both left and right sides - - - - - The '>' operator where a nullable value appears on both left and right sides - - - - - The '>=' operator where a nullable value appears on both left and right sides - - - - - The '<>' operator where a nullable value appears on the right - - - - - The '=' operator where a nullable value appears on the right - - - - - The '<' operator where a nullable value appears on the right - - - - - The '<=' operator where a nullable value appears on the right - - - - - The '>' operator where a nullable value appears on the right - - - - - The '>=' operator where a nullable value appears on the right - - - - - The '<>' operator where a nullable value appears on the left - - - - - The '=' operator where a nullable value appears on the left - - - - - The '<' operator where a nullable value appears on the left - - - - - The '<=' operator where a nullable value appears on the left - - - - - The '>' operator where a nullable value appears on the left - - - - - The '>=' operator where a nullable value appears on the left - - - - - Operators for working with nullable values - - - - - A method used to support the F# query syntax. Runs the given quotation as a query using LINQ IEnumerable rules. - - - - - - - - A method used to support the F# query syntax. Runs the given quotation as a query using LINQ rules. - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - - - - A type used to reconstruct a grouping after applying a mutable->immutable mapping transformation - on a result of a query. - - - - - - - - - - - - - - - - - - - - The generic MethodInfo for Select function - Describes how we got from productions of immutable objects to productions of anonymous objects, with enough information - that we can invert the process in final query results. - - - - - - - - Given the expression part of a "yield" or "select" which produces a result in terms of immutable tuples or immutable records, - generate an equivalent expression yielding anonymous objects. Also return the conversion for the immutable-to-mutable correspondence - so we can reverse this later. - - - - - Simplify gets of tuples and gets of record fields. - - - - - Cleanup the use of property-set object constructions in leaf expressions that form parts of F# queries. - - - - - - - - Given an type involving immutable tuples and records, logically corresponding to the type produced at a - "yield" or "select", convert it to a type involving anonymous objects according to the conversion data. - - - - - - - - - - - - - - - - - - - - Recognize anonymous type construction written using 'new AnonymousObject(<e1>, <e2>, ...)' - - - - - - - - - - - - - - - - - Recognize object construction written using 'new O(Prop1 = <e>, Prop2 = <e>, ...)' - - - - - Tests whether a list consists only of assignments of properties of the - given variable, null values (ignored) and ends by returning the given variable - (pattern returns only property assignments) - - - - - Recognize sequential series written as (... ((<e>; <e>); <e>); ...) - - - - - - - - - - - - - - - - - - - - - - - A runtime helper used to evaluate nested quotation literals. - - - - - Evaluates a subset of F# quotations by first converting to a LINQ expression, for the subset of LINQ expressions represented by the - expression syntax in the C# language. - - - - - Converts a subset of F# quotations to a LINQ expression, for the subset of LINQ expressions represented by the - expression syntax in the C# language. - - - - - Converts a subset of F# quotations to a LINQ expression, for the subset of LINQ expressions represented by the - expression syntax in the C# language. - - - - - When used in a quotation, this function indicates a specific conversion - should be performed when converting the quotation to a LINQ expression. - - This function should not be called directly. - - - - - When used in a quotation, this function indicates a specific conversion - should be performed when converting the quotation to a LINQ expression. - - This function should not be called directly. - - - - - When used in a quotation, this function indicates a specific conversion - should be performed when converting the quotation to a LINQ expression. - - This function should not be called directly. - - - - - - - Allocates a region of memory on the stack. - The number of objects of type T to allocate. - A typed pointer to the allocated memory. - - - Assigns the value into the memory location referenced by the typed native - pointer computed by adding index * sizeof<'T> to the given input pointer. - The input pointer. - The index by which to offset the pointer. - The value to assign. - - - Assigns the value into the memory location referenced by the given typed native pointer. - The input pointer. - The value to assign. - - - Dereferences the given typed native pointer. - The input pointer. - The value at the pointer address. - - - Dereferences the typed native pointer computed by adding index * sizeof<'T> to the - given input pointer. - The input pointer. - The index by which to offset the pointer. - The value at the pointer address. - - - Returns a typed native pointer by adding index * sizeof<'T> to the - given input pointer. - The input pointer. - The index by which to offset the pointer. - A typed pointer. - - - Returns a machine address for a given typed native pointer. - The input pointer. - The machine address. - - - Returns a typed native pointer for a given machine address. - The pointer address. - A typed pointer. - - - Contains operations on native pointers. Use of these operators may - result in the generation of unverifiable code. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Gets the raw expression associated with this type-carrying expression - - - Type-carrying quoted expressions. Expressions are generated either - by quotations in source text or programatically - - - Returns type of an expression. - - - Returns the custom attributes of an expression. - - - Builds an expression that represents a while loop - The predicate to control the loop iteration. - The body of the while loop. - The resulting expression. - - - Builds an expression that represents setting a mutable variable - The input variable. - The value to set. - The resulting expression. - - - Builds an expression that represents a variable - The input variable. - The resulting expression. - - - Builds an expression that represents a constant value - The typed value. - The resulting expression. - - - Builds an expression that represents a constant value of a particular type - The untyped object. - The type of the object. - The resulting expression. - - - Builds an expression that represents a test of a value is of a particular union case - The expression to test. - The description of the union case. - The resulting expression. - - - Builds an expression that represents a type test. - The expression to test. - The target type. - The resulting expression. - - - Builds an expression that represents getting a field of a tuple - The input tuple. - The index of the tuple element to get. - The resulting expression. - - - Builds an expression that represents a try/with construct for exception filtering and catching. - The body of the try expression. - - - The variable to bind to a caught exception. - The expression evaluated when an exception is caught. - The resulting expression. - - - Try and find a stored reflection definition for the given method. Stored reflection - definitions are added to an F# assembly through the use of the [<ReflectedDefinition>] attribute. - The description of the method to find. - The reflection definition or None if a match could not be found. - - - Builds an expression that represents a try/finally construct - The body of the try expression. - The final part of the expression to be evaluated. - The resulting expression. - - - Format the expression as a string - Indicates if method, property, constructor and type objects should be printed in detail. If false, these are abbreviated to their name. - The formatted string. - - - Substitutes through the given expression using the given functions - to map variables to new values. The functions must give consistent results - at each application. Variable renaming may occur on the target expression - if variable capture occurs. - The function to map variables into expressions. - The expression with the given substitutions. - - - Builds an expression that represents the sequential execution of one expression followed by another - The first expression. - The second expression. - The resulting expression. - - - Permits interactive environments such as F# Interactive - to explicitly register new pickled resources that represent persisted - top level definitions. The string indicates a unique name for the resources - being added. The format for the bytes is the encoding generated by the F# compiler. - The assembly associated with the resource. - The unique name for the resources being added. - The serialized resource to register with the environment. - - - Builds an expression that represents a nested quotation literal - The expression being quoted. - The resulting expression. - - - Builds an expression that represents writing to a static property - The description of the property. - The value to set. - List of indices for the property if it is an indexed property. - The resulting expression. - - - Builds an expression that represents writing to a property of an object - The input object. - The description of the property. - The value to set. - List of indices for the property if it is an indexed property. - The resulting expression. - - - Builds an expression that represents reading a static property - The description of the property. - List of indices for the property if it is an indexed property. - The resulting expression. - - - Builds an expression that represents reading a property of an object - The input object. - The description of the property. - List of indices for the property if it is an indexed property. - The resulting expression. - - - Builds an expression that represents the creation of a union case value - The description of the union case. - The list of arguments for the case. - The resulting expression. - - - Builds an expression that represents the creation of an F# tuple value - The list of elements of the tuple. - The resulting expression. - - - Builds record-construction expressions - The type of record. - The list of elements of the record. - The resulting expression. - - - Builds an expression that represents the invocation of an object constructor - The description of the constructor. - The list of arguments to the constructor. - The resulting expression. - - - Builds an expression that represents the creation of a delegate value for the given type - The type of delegate. - The parameters for the delegate. - The body of the function. - The resulting expression. - - - Builds an expression that represents the creation of an array value initialized with the given elements - The type for the elements of the array. - The list of elements of the array. - The resulting expression. - - - Builds recursives expressions associated with 'let rec' constructs - The list of bindings for the let expression. - The sub-expression where the bindings are in scope. - The resulting expression. - - - Builds expressions associated with 'let' constructs - The variable in the let expression. - The expression bound to the variable. - The sub-expression where the binding is in scope. - The resulting expression. - - - Builds an expression that represents the constrution of an F# function value - The parameter to the function. - The body of the function. - The resulting expression. - - - Builds 'if ... then ... else' expressions. - The condition expression. - The then sub-expression. - The else sub-expression. - The resulting expression. - - - Fetches or creates a new variable with the given name and type from a global pool of shared variables - indexed by name and type. The type is given by the expicit or inferred type parameter - The variable name. - The created of fetched typed global variable. - - - Gets the free expression variables of an expression as a list. - A sequence of the free variables in the expression. - - - Builds a 'for i = ... to ... do ...' expression that represent loops over integer ranges - The sub-expression declaring the loop variable. - The sub-expression setting the initial value of the loop variable. - The sub-expression declaring the final value of the loop variable. - The sub-expression representing the body of the loop. - The resulting expression. - - - Builds an expression that represents writing to a field of an object - The input object. - The description of the field to write to. - The value to set to the field. - The resulting expression. - - - Builds an expression that represents writing to a static field - The description of the field to write to. - The value to the set to the field. - The resulting expression. - - - Builds an expression that represents the access of a field of an object - The input object. - The description of the field to access. - The resulting expression. - - - Builds an expression that represents the access of a static field - The description of the field to access. - The resulting expression. - - - - - - This function is called automatically when quotation syntax (<@ @>) and related typed-expression - quotations are used. The bytes are a pickled binary representation of an unlinked form of the quoted expression, - and the System.Type argument is any type in the assembly where the quoted - expression occurs, i.e. it helps scope the interpretation of the cross-assembly - references in the bytes. - A type in the assembly where the quotation occurs. - The list of spliced types. - The list of spliced expressions. - The serialized form of the quoted expression. - The resulting expression. - - - Builds an expression that represents the invocation of a default object constructor - The type on which the constructor is invoked. - The resulting expression. - - - Builds an expression that represents the coercion of an expression to a type - The expression to coerce. - The target type. - The resulting expression. - - - Returns a new typed expression given an underlying runtime-typed expression. - A type annotation is usually required to use this function, and - using an incorrect type annotation may result in a later runtime exception. - The expression to cast. - The resulting typed expression. - - - Builds an expression that represents a call to an instance method associated with an object - The input object. - The description of the method to call. - The list of arguments to the method. - The resulting expression. - - - Builds an expression that represents a call to an static method or module-bound function - The MethodInfo describing the method to call. - The list of arguments to the method. - The resulting expression. - - - Builds an expression that represents the application of a first class function value to multiple arguments - The function to apply. - The list of lists of arguments to the function. - The resulting expression. - - - Builds an expression that represents the application of a first class function value to a single argument. - The function to apply. - The argument to the function. - The resulting expression. - - - Builds an expression that represents setting the value held at a particular address. - The target expression. - The value to set at the address. - The resulting expression. - - - Builds an expression that represents getting the address of a value. - The target expression. - The resulting expression. - - - Quoted expressions annotated with System.Type values. - - - The type associated with the variable - - - The declared name of the variable - - - Indicates if the variable represents a mutable storage location - - - Fetches or create a new variable with the given name and type from a global pool of shared variables - indexed by name and type - The name of the variable. - The type associated with the variable. - The retrieved or created variable. - - - Creates a new variable with the given name, type and mutability - The declared name of the variable. - The type associated with the variable. - Indicates if the variable represents a mutable storage location. Default is false. - The created variable. - - - Information at the binding site of a variable - - - Re-build combination expressions. The first parameter should be an object - returned by the ShapeCombination case of the active pattern in this module. - The input shape. - The list of arguments. - The rebuilt expression. - - - An active pattern that performs a complete decomposition viewing the expression tree as a binding structure - The input expression. - The decomposed Var, Lambda, or ConstApp. - - - Active patterns for traversing, visiting, rebuilding and tranforming expressions in a generic way - - - An active pattern to recognize property setters that have an associated ReflectedDefinition - The description of the property. - The expression of the method definition if found, or None. - - - An active pattern to recognize property getters or values in modules that have an associated ReflectedDefinition - The description of the property. - The expression of the method definition if found, or None. - - - An active pattern to recognize methods that have an associated ReflectedDefinition - The description of the method. - The expression of the method definition if found, or None. - - - A parameterized active pattern to recognize calls to a specified function or method. - The returned elements are the optional target object (present if the target is an - instance method), the generic type instantation (non-empty if the target is a generic - instantiation), and the arguments to the function or method. - The input template expression to specify the method to call. - The optional target object (present if the target is an - instance method), the generic type instantation (non-empty if the target is a generic - instantiation), and the arguments to the function or method. - - - An active pattern to recognize constant unsigned int64 expressions - The input expression to match against. - uint64 option - - - An active pattern to recognize constant int64 expressions - The input expression to match against. - int64 option - - - An active pattern to recognize constant unsigned int32 expressions - The input expression to match against. - uint32 option - - - An active pattern to recognize constant int32 expressions - The input expression to match against. - int32 option - - - An active pattern to recognize constant unsigned int16 expressions - The input expression to match against. - uint16 option - - - An active pattern to recognize constant int16 expressions - The input expression to match against. - int16 option - - - An active pattern to recognize constant byte expressions - The input expression to match against. - byte option - - - An active pattern to recognize constant signed byte expressions - The input expression to match against. - sbyte option - - - An active pattern to recognize constant unicode character expressions - The input expression to match against. - char option - - - An active pattern to recognize constant 64-bit floating point number expressions - The input expression to match against. - float option - - - An active pattern to recognize constant 32-bit floating point number expressions - The input expression to match against. - float32 option - - - An active pattern to recognize constant string expressions - The input expression to match against. - string option - - - An active pattern to recognize constant boolean expressions - The input expression to match against. - bool option - - - An active pattern to recognize () constant expressions - The input expression to match against. - unit option - - - An active pattern to recognize expressions of the form a || b - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions of the form a && b - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions that represent the application of a (possibly curried or tupled) first class function value - The input expression to match against. - (Expr * Expr list list) option - - - An active pattern to recognize expressions that represent a (possibly curried or tupled) first class function value - The input expression to match against. - (Var list list * Expr) option - - - Contains a set of derived F# active patterns to analyze F# expression objects - - - An active pattern to recognize expressions that represent setting a mutable variable - The input expression to match against. - (Var * Expr) option - - - An active pattern to recognize expressions that represent a variable - The input expression to match against. - Var option - - - An active pattern to recognize expressions that represent a constant value - The input expression to match against. - (obj * Type) option - - - An active pattern to recognize expressions that represent a test if a value is of a particular union case - The input expression to match against. - (Expr * UnionCaseInfo) option - - - An active pattern to recognize expressions that represent a dynamic type test - The input expression to match against. - (Expr * Type) option - - - An active pattern to recognize expressions that represent getting a tuple field - The input expression to match against. - (Expr * int) option - - - An active pattern to recognize expressions that represent a try/finally construct - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions that represent a try/with construct for exception filtering and catching - The input expression to match against. - (Expr * Var * Expr * Var * Expr) option - - - An active pattern to recognize expressions that represent sequential exeuction of one expression followed by another - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions that represent a nested quotation literal - The input expression to match against. - Expr option - - - An active pattern to recognize expressions that represent setting a static or instance property, or a non-function value declared in a module - The input expression to match against. - (Expr option * PropertyInfo * Expr list * Expr) option - - - An active pattern to recognize expressions that represent the read of a static or instance property, or a non-function value declared in a module - The input expression to match against. - (Expr option * PropertyInfo * Expr list) option - - - An active pattern to recognize expressions that represent construction of tuple values - The input expression to match against. - (Expr list) option - - - An active pattern to recognize expressions that represent construction of particular union case values - The input expression to match against. - (UnionCaseInfo * Expr list) option - - - An active pattern to recognize expressions that represent construction of record values - The input expression to match against. - (Type * Expr list) option - - - An active pattern to recognize expressions that represent invocation of object constructors - The input expression to match against. - (ConstructorInfo * Expr list) option - - - An active pattern to recognize expressions that represent construction of delegate values - The input expression to match against. - (Type * Var list * Expr) option - - - An active pattern to recognize expressions that represent invocations of a default constructor of a struct - The input expression to match against. - Type option - - - An active pattern to recognize expressions that represent the construction of arrays - The input expression to match against. - (Type * Expr list) option - - - An active pattern to recognize expressions that represent recursive let bindings of one or more variables - The input expression to match against. - ((Var * Expr) list * Expr) option - - - An active pattern to recognize expressions that represent let bindings - The input expression to match against. - (Var * Expr * Expr) option - - - An active pattern to recognize expressions that represent first class function values - The input expression to match against. - (Var * Expr) option - - - An active pattern to recognize expressions that represent conditionals - The input expression to match against. - (Expr * Expr * Expr) option - - - An active pattern to recognize expressions that represent while loops - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions that represent loops over integer ranges - The input expression to match against. - (Var * Expr * Expr * Expr) option - - - An active pattern to recognize expressions that represent setting a static or instance field - The input expression to match against. - (Expr option * FieldInfo * Expr) option - - - An active pattern to recognize expressions that represent getting a static or instance field - The input expression to match against. - (Expr option * FieldInfo) option - - - An active pattern to recognize expressions that represent coercions from one type to another - The input expression to match against. - (Expr * Type) option - - - An active pattern to recognize expressions that represent calls to static and instance methods, and functions defined in modules - The input expression to match against. - (Expr option * MethodInfo * Expr list) option - - - An active pattern to recognize expressions that represent applications of first class function values - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions that represent setting the value held at an address - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions that represent getting the address of a value - The input expression to match against. - Expr option - - - Contains a set of primitive F# active patterns to analyze F# expression objects - - - Returns a System.Type representing an F# tuple type with the given element types - An array of types for the tuple elements. - The type representing the tuple containing the input elements. - - - Returns a System.Type representing the F# function type with the given domain and range - The input type of the function. - The output type of the function. - The function type with the given domain and range. - - - Return true if the typ is a representation of an F# tuple type - The type to check. - True if the type check succeeds. - - - Return true if the typ is a System.Type value corresponding to the compiled form of an F# module - The type to check. - True if the type check succeeds. - - - Return true if the typ is a representation of an F# function type or the runtime type of a closure implementing an F# function type - The type to check. - True if the type check succeeds. - - - Gets the tuple elements from the representation of an F# tuple type. - The input tuple type. - An array of the types contained in the given tuple type. - - - Gets the domain and range types from an F# function type or from the runtime type of a closure implementing an F# type - The input function type. - A tuple of the domain and range types of the input function. - - - Contains operations associated with constructing and analyzing F# types such as records, unions and tuples - - - Precomputes a function for reading the values of a particular tuple type - - Assumes the given type is a TupleType. - If not, ArgumentException is raised during pre-computation. - The tuple type to read. - Thrown when the given type is not a tuple type. - A function to read values of the given tuple type. - - - Gets information that indicates how to read a field of a tuple - The input tuple type. - The index of the tuple element to describe. - The description of the tuple element and an optional type and index if the tuple is big. - - - Gets a method that constructs objects of the given tuple type. - For small tuples, no additional type will be returned. - - For large tuples, an additional type is returned indicating that - a nested encoding has been used for the tuple type. In this case - the suffix portion of the tuple type has the given type and an - object of this type must be created and passed as the last argument - to the ConstructorInfo. A recursive call to PreComputeTupleConstructorInfo - can be used to determine the constructor for that the suffix type. - The input tuple type. - The description of the tuple type constructor and an optional extra type - for large tuples. - - - Precomputes a function for reading the values of a particular tuple type - - Assumes the given type is a TupleType. - If not, ArgumentException is raised during pre-computation. - The type of tuple to read. - Thrown when the given type is not a tuple type. - A function to read a particular tuple type. - - - Precompute a function for reading a particular field from a record. - Assumes the given type is a RecordType with a field of the given name. - If not, ArgumentException is raised during pre-computation. - - Using the computed function will typically be faster than executing a corresponding call to Value.GetInfo - because the path executed by the computed function is optimized given the knowledge that it will be - used to read values of the given type. - The PropertyInfo of the field to read. - Thrown when the input type is not a record type. - A function to read the specified field from the record. - - - Creates an instance of a tuple type - - Assumes at least one element is given. If not, ArgumentException is raised. - The array of tuple fields. - The tuple type to create. - Thrown if no elements are given. - An instance of the tuple type with the given elements. - - - Builds a typed function from object from a dynamic function implementation - The function type of the implementation. - The untyped lambda of the function implementation. - A typed function from the given dynamic implementation. - - - Reads all fields from a tuple. - - Assumes the given input is a tuple value. If not, ArgumentException is raised. - The input tuple. - Thrown when the input is not a tuple value. - An array of the fields from the given tuple. - - - Reads a field from a tuple value. - - Assumes the given input is a tuple value. If not, ArgumentException is raised. - The input tuple. - The index of the field to read. - The value of the field. - - - Reads a field from a record value. - - Assumes the given input is a record value. If not, ArgumentException is raised. - The record object. - The PropertyInfo describing the field to read. - Thrown when the input type is not a record type. - The field from the record. - - - Contains operations associated with constructing and analyzing values associated with F# types - such as records, unions and tuples. - - - The integer tag for the case. - - - The name of the case. - - - The type in which the case occurs. - - - The fields associated with the case, represented by a PropertyInfo. - The fields associated with the case. - - - Returns the custom attributes associated with the case matching the given attribute type. - The type of attributes to return. - An array of custom attributes. - - - Returns the custom attributes associated with the case. - An array of custom attributes. - - - Represents a case of a discriminated union type - - - Returns true if the typ is a representation of an F# exception declaration - The type to check. - Optional flag that denotes accessibility of the private representation. - True if the type check is an F# exception. - - - Reads all the fields from an F# exception declaration, in declaration order - - Assumes exceptionType is an exception representation type. If not, ArgumentException is raised. - The exception type to read. - Optional flag that denotes accessibility of the private representation. - Thrown if the given type is not an exception. - An array containing the PropertyInfo of each field in the exception. - - - Returns true if the typ is a representation of an F# union type or the runtime type of a value of that type - The type to check. - Optional flag that denotes accessibility of the private representation. - True if the type check succeeds. - - - Return true if the typ is a representation of an F# record type - The type to check. - Optional flag that denotes accessibility of the private representation. - True if the type check succeeds. - - - Gets the cases of a union type. - - Assumes the given type is a union type. If not, ArgumentException is raised during pre-computation. - The input union type. - Optional flag that denotes accessibility of the private representation. - Thrown when the input type is not a union type. - An array of descriptions of the cases of the given union type. - - - Reads all the fields from a record value, in declaration order - - Assumes the given input is a record value. If not, ArgumentException is raised. - The input record type. - Optional flag that denotes accessibility of the private representation. - An array of descriptions of the properties of the record type. - - - Reads all the fields from a value built using an instance of an F# exception declaration - - Assumes the given input is an F# exception value. If not, ArgumentException is raised. - The exception instance. - Optional flag that denotes accessibility of the private representation. - Thrown when the input type is not an F# exception. - The fields from the given exception. - - - A method that constructs objects of the given case - The description of the union case. - Optional flag that denotes accessibility of the private representation. - The description of the constructor of the given union case. - - - Precomputes a function for constructing a discriminated union value for a particular union case. - The description of the union case. - Optional flag that denotes accessibility of the private representation. - A function for constructing values of the given union case. - - - Precomputes a function for reading all the fields for a particular discriminator case of a union type - - Using the computed function will typically be faster than executing a corresponding call to GetFields - The description of the union case to read. - Optional flag that denotes accessibility of the private representation. - A function to for reading the fields of the given union case. - - - Precompute a property or static method for reading an integer representing the case tag of a union type. - The type of union to read. - Optional flag that denotes accessibility of the private representation. - The description of the union case reader. - - - Assumes the given type is a union type. - If not, ArgumentException is raised during pre-computation. - - Using the computed function is more efficient than calling GetUnionCase - because the path executed by the computed function is optimized given the knowledge that it will be - used to read values of the given type. - The type of union to optimize reading. - Optional flag that denotes accessibility of the private representation. - An optimized function to read the tags of the given union type. - - - Identify the union case and its fields for an object - - Assumes the given input is a union case value. If not, ArgumentException is raised. - - If the type is not given, then the runtime type of the input object is used to identify the - relevant union type. The type should always be given if the input object may be null. For example, - option values may be represented using the 'null'. - The input union case. - The union type containing the value. - Optional flag that denotes accessibility of the private representation. - Thrown when the input type is not a union case value. - The description of the union case and its fields. - - - Create a union case value. - The description of the union case to create. - The array of arguments to construct the given case. - Optional flag that denotes accessibility of the private representation. - The constructed union case. - - - Get a ConstructorInfo for a record type - The record type. - Optional flag that denotes accessibility of the private representation. - A ConstructorInfo for the given record type. - - - Precompute a function for constructing a record value. - - Assumes the given type is a RecordType. - If not, ArgumentException is raised during pre-computation. - The type of record to construct. - Optional flag that denotes accessibility of the private representation. - Thrown when the input type is not a record type. - A function to construct records of the given type. - - - Precompute a function for reading all the fields from a record. The fields are returned in the - same order as the fields reported by a call to Microsoft.FSharp.Reflection.Type.GetInfo for - this type. - - Assumes the given type is a RecordType. - If not, ArgumentException is raised during pre-computation. - - Using the computed function will typically be faster than executing a corresponding call to Value.GetInfo - because the path executed by the computed function is optimized given the knowledge that it will be - used to read values of the given type. - The type of record to read. - Optional flag that denotes accessibility of the private representation. - Thrown when the input type is not a record type. - An optimized reader for the given record type. - - - Reads all the fields from a record value. - - Assumes the given input is a record value. If not, ArgumentException is raised. - The record object. - Optional flag that denotes accessibility of the private representation. - Thrown when the input type is not a record type. - The array of fields from the record. - - - Creates an instance of a record type. - - Assumes the given input is a record type. - The type of record to make. - The array of values to initialize the record. - Optional flags that denotes accessibility of the private representation. - Thrown when the input type is not a record type. - The created record. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - A record of options to control structural formatting. - For F# Interactive properties matching those of this value can be accessed via the 'fsi' - value. - - Floating Point format given in the same format accepted by System.Double.ToString, - e.g. f6 or g15. - - If ShowProperties is set the printing process will evaluate properties of the values being - displayed. This may cause additional computation. - - The ShowIEnumerable is set the printing process will force the evalution of IEnumerable objects - to a small, finite depth, as determined by the printing parameters. - This may lead to additional computation being performed during printing. - - <example> - From F# Interactive the default settings can be adjusted using, for example, - <pre> - open Microsoft.FSharp.Compiler.Interactive.Settings;; - setPrintWidth 120;; - </pre> - </example> - - - - - Data representing structured layouts of terms. - - - - - Convert any value to a layout using the given formatting options. The - layout can then be processed using formatting display engines such as - those in the LayoutOps module. any_to_string and output_any are - built using any_to_layout with default format options. - - - - - - - - Ouput any value to a channel using the same set of formatting rules - as any_to_string - - - - - Convert any value to a string using a standard formatter - Data is typically formatted in a structured format, e.g. - lists are formatted using the "[1;2]" notation. - The details of the format are not specified and may change - from version to version and according to the flags given - to the F# compiler. The format is intended to be human-readable, - not machine readable. If alternative generic formats are required - you should develop your own formatter, using the code in the - implementation of this file as a starting point. - - Data from other .NET languages is formatted using a virtual - call to Object.ToString() on the boxed version of the input. - - - - - - - - For limitting layout of list-like sequences (lists,arrays,etc). - unfold a list of items using (project and z) making layout list via itemL. - If reach maxLength (before exhausting) then truncate. - - - - - See tagL - - - - - Layout like an F# list. - - - - - Layout like an F# option. - - - - - Layout list vertically. - - - - - Layout two vertically. - - - - - Form tuple of layouts. - - - - - Wrap braces around layout. - - - - - Wrap square brackets around layout. - - - - - Wrap round brackets around Layout. - - - - - Join layouts into a list separated using the given Layout. - - - - - Join layouts into a semi-colon separated list. - - - - - Join layouts into a space separated list. - - - - - Join layouts into a comma separated list. - - - - - Join broken with ident=2 - - - - - Join broken with ident=1 - - - - - Join broken with ident=0 - - - - - Join, possible break with indent=2 - - - - - Join, possible break with indent=1 - - - - - Join, possible break with indent=0 - - - - - Join, unbreakable. - - - - - An string which is left parenthesis (no space on the right). - - - - - An string which is right parenthesis (no space on the left). - - - - - An string which requires no spaces either side. - - - - - An string leaf - - - - - An uninterpreted leaf, to be interpreted into a string - by the layout engine. This allows leaf layouts for numbers, strings and - other atoms to be customized according to culture. - - - - - Is it the empty layout? - - - - - The empty layout - - - - - A layout is a sequence of strings which have been joined together. - The strings are classified as words, separators and left and right parenthesis. - This classification determines where spaces are inserted. - A joint is either unbreakable, breakable or broken. - If a joint is broken the RHS layout occurs on the next line with optional indentation. - A layout can be squashed to for given width which forces breaks as required. - - - - diff --git a/packages/FSharp.Core/lib/portable-net45+sl5+netcore45/FSharp.Core.dll b/packages/FSharp.Core/lib/portable-net45+sl5+netcore45/FSharp.Core.dll deleted file mode 100644 index 18c8e7a0..00000000 Binary files a/packages/FSharp.Core/lib/portable-net45+sl5+netcore45/FSharp.Core.dll and /dev/null differ diff --git a/packages/FSharp.Core/lib/portable-net45+sl5+netcore45/FSharp.Core.optdata b/packages/FSharp.Core/lib/portable-net45+sl5+netcore45/FSharp.Core.optdata deleted file mode 100644 index 3f9c3962..00000000 Binary files a/packages/FSharp.Core/lib/portable-net45+sl5+netcore45/FSharp.Core.optdata and /dev/null differ diff --git a/packages/FSharp.Core/lib/portable-net45+sl5+netcore45/FSharp.Core.sigdata b/packages/FSharp.Core/lib/portable-net45+sl5+netcore45/FSharp.Core.sigdata deleted file mode 100644 index 4138f0f6..00000000 Binary files a/packages/FSharp.Core/lib/portable-net45+sl5+netcore45/FSharp.Core.sigdata and /dev/null differ diff --git a/packages/FSharp.Core/lib/portable-net45+sl5+netcore45/FSharp.Core.xml b/packages/FSharp.Core/lib/portable-net45+sl5+netcore45/FSharp.Core.xml deleted file mode 100644 index 636841c0..00000000 --- a/packages/FSharp.Core/lib/portable-net45+sl5+netcore45/FSharp.Core.xml +++ /dev/null @@ -1,10533 +0,0 @@ - - -FSharp.Core - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Gets the tail of the list, which is a list containing all the elements of the list, excluding the first element - - - Gets the number of items contained in the list - - - Gets the element of the list at the given position. - Lists are represented as linked lists so this is an O(n) operation. - The index. - The value at the given index. - - - Gets a value indicating if the list contains no entries - - - Gets the first element of the list - - - Returns an empty list of a particular type - - - Returns a list with head as its first element and tail as its subsequent elements - A new head value for the list. - The existing list. - The list with head appended to the front of tail. - - - The type of immutable singly-linked lists. - - Use the constructors [] and :: (infix) to create values of this type, or - the notation [1;2;3]. Use the values in the List module to manipulate - values of this type, or pattern match against the values directly. - - - Lookup an element in the map. Raise KeyNotFoundException if no binding - exists in the map. - The input key. - Thrown when the key is not found. - The value mapped to the key. - - - Returns true if there are no bindings in the map. - - - The number of bindings in the map. - - - Lookup an element in the map, returning a Some value if the element is in the domain - of the map and None if not. - The input key. - The mapped value, or None if the key is not in the map. - - - Removes an element from the domain of the map. No exception is raised if the element is not present. - The input key. - The resulting map. - - - - - - Tests if an element is in the domain of the map. - The input key. - True if the map contains the given key. - - - Returns a new map with the binding added to the given map. - The input key. - The resulting map. - - - Builds a map that contains the bindings of the given IEnumerable. - The input sequence of key/value pairs. - The resulting map. - - - Immutable maps. Keys are ordered by F# generic comparison. - - Maps based on generic comparison are efficient for small keys. They are not a suitable choice if keys are recursive data structures - or if keys require bespoke comparison semantics. - - All members of this class are thread-safe and may be used concurrently from multiple threads. - - - An abbreviation for the CLI type System.Collections.Generic.List<_> - - - Returns a new set with the elements of the second set removed from the first. - The first input set. - The second input set. - A set containing elements of the first set that are not contained in the second set. - - - Compute the union of the two sets. - The first input set. - The second input set. - The union of the two input sets. - - - Returns the lowest element in the set according to the ordering being used for the set. - - - Returns the highest element in the set according to the ordering being used for the set. - - - A useful shortcut for Set.isEmpty. See the Set module for further operations on sets. - - - The number of elements in the set - - - A useful shortcut for Set.remove. Note this operation produces a new set - and does not mutate the original set. The new set will share many storage - nodes with the original. See the Set module for further operations on sets. - The value to remove from the set. - The result set. - - - Evaluates to "true" if all elements of the second set are in the first. - The set to test against. - True if this set is a superset of otherSet. - - - Evaluates to "true" if all elements of the first set are in the second. - The set to test against. - True if this set is a subset of otherSet. - - - Evaluates to "true" if all elements of the second set are in the first, and at least - one element of the first is not in the second. - The set to test against. - True if this set is a proper superset of otherSet. - - - Evaluates to "true" if all elements of the first set are in the second, and at least - one element of the second is not in the first. - The set to test against. - True if this set is a proper subset of otherSet. - - - - - - A useful shortcut for Set.contains. See the Set module for further operations on sets. - The value to check. - True if the set contains value. - - - A useful shortcut for Set.add. Note this operation produces a new set - and does not mutate the original set. The new set will share many storage - nodes with the original. See the Set module for further operations on sets. - The value to add to the set. - The result set. - - - Create a set containing elements drawn from the given sequence. - The input sequence. - The result set. - - - Immutable sets based on binary trees, where comparison is the - F# structural comparison function, potentially using implementations - of the IComparable interface on key values. - - See the Set module for further operations on sets. - - All members of this class are thread-safe and may be used concurrently from multiple threads. - - - An abbreviation for the type of immutable singly-linked lists. - - Use the constructors [] and :: (infix) to create values of this type, or - the notation [1;2;3]. Use the values in the List module to manipulate - values of this type, or pattern match against the values directly. - - - An abbreviation for the CLI type System.Collections.Generic.IEnumerable<_> - - - Fetches an element from a 2D array. You can also use the syntax array.[index1,index2]. - - The input array. - The index along the first dimension. - The index along the second dimension. - - The value of the array at the given index. - Thrown when the indices are negative or exceed the bounds of the array. - - - Sets the value of an element in an array. You can also use the syntax array.[index1,index2] <- value. - - The input array. - The index along the first dimension. - The index along the second dimension. - The value to set in the array. - Thrown when the indices are negative or exceed the bounds of the array. - - - Builds 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. - - The input array. - - The zero-based output array. - - - Builds 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 propagated to the output - array. - - A function that is applied to transform each element of the array. The two integers - provide the index of the element. - The input array. - - An array whose elements have been transformed by the given mapping. - - - Builds 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. - - A function that is applied to transform each item of the input array. - The input array. - - An array whose elements have been transformed by the given mapping. - - - Returns the length of an array in the second dimension. - - The input array. - - The length of the array in the second dimension. - - - Returns the length of an array in the first dimension. - - The input array. - - The length of the array in the first dimension. - - - Applies the given function to each element of the array. The integer indices passed to the - function indicates the index of element. - - A function to apply to each element of the array with the indices available as an argument. - The input array. - - - Applies the given function to each element of the array. - - A function to apply to each element of the array. - The input array. - - - Creates an array where the entries are initially Unchecked.defaultof<'T>. - - The length of the first dimension of the array. - The length of the second dimension of the array. - - The created array. - Thrown when length1 or length2 is negative. - - - Creates an array whose elements are all initially the given value. - - The length of the first dimension of the array. - The length of the second dimension of the array. - The value to populate the new array. - - The created array. - Thrown when length1 or length2 is negative. - - - Creates an array given the dimensions and a generator function to compute the elements. - - The length of the first dimension of the array. - The length of the second dimension of the array. - A function to produce elements of the array given the two indices. - - The generated array. - Thrown when either of the lengths is negative. - - - Reads a range of elements from the first array and write them into the second. - - The source array. - The first-dimension index to begin copying from in the source array. - The second-dimension index to begin copying from in the source array. - The target array. - The first-dimension index to begin copying into in the target array. - The second-dimension index to begin copying into in the target array. - The number of elements to copy across the first dimension of the arrays. - The number of elements to copy across the second dimension of the arrays. - Thrown when any of the indices are negative or if either of - the counts are larger than the dimensions of the array allow. - - - Builds 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. - - The input array. - - A copy of the input array. - - - Fetches the base-index for the second dimension of the array. - - The input array. - - The base-index of the second dimension of the array. - - - Fetches the base-index for the first dimension of the array. - - The input array. - - The base-index of the first dimension of the array. - - - Basic operations on 2-dimensional arrays. - - F# and CLI multi-dimensional arrays are typically zero-based. - However, CLI 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 propagated to a matching output - array on the Array2D.map and Array2D.mapi operations. - Non-zero-based arrays can also be created using Array2D.zeroCreateBased, - Array2D.createBased and Array2D.initBased. - - - Creates an array where the entries are initially the "default" value. - The length of the first dimension. - The length of the second dimension. - The length of the third dimension. - The created array. - - - Sets the value of an element in an array. You can also - use the syntax 'array.[index1,index2,index3] <- value'. - The input array. - The index along the first dimension. - The index along the second dimension. - The index along the third dimension. - The value to set at the given index. - - - Builds 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. - The function to transform the elements at each index in the array. - The input array. - The array created from the transformed elements. - - - Builds 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. - The function to transform each element of the array. - The input array. - The array created from the transformed elements. - - - Returns the length of an array in the third dimension. - The input array. - The length of the array in the third dimension. - - - Returns the length of an array in the second dimension. - The input array. - The length of the array in the second dimension. - - - Returns the length of an array in the first dimension - The input array. - The length of the array in the first dimension. - - - Applies the given function to each element of the array. The integer indicies passed to the - function indicates the index of element. - The function to apply to each element of the array. - The input array. - - - Applies the given function to each element of the array. - The function to apply to each element of the array. - The input array. - - - Fetches an element from a 3D array. You can also use the syntax 'array.[index1,index2,index3]' - The input array. - The index along the first dimension. - The index along the second dimension. - The index along the third dimension. - The value at the given index. - - - Creates an array given the dimensions and a generator function to compute the elements. - The length of the first dimension. - The length of the second dimension. - The length of the third dimension. - The function to create an initial value at each index into the array. - The created array. - - - Creates an array whose elements are all initially the given value. - The length of the first dimension. - The length of the second dimension. - The length of the third dimension. - The value of the array elements. - The created array. - - - Basic operations on rank 3 arrays. - - - Sets the value of an element in an array. You can also - use the syntax 'array.[index1,index2,index3,index4] <- value'. - The input array. - The index along the first dimension. - The index along the second dimension. - The index along the third dimension. - The index along the fourth dimension. - The value to set. - - - Fetches an element from a 4D array. You can also use the syntax 'array.[index1,index2,index3,index4]' - The input array. - The index along the first dimension. - The index along the second dimension. - The index along the third dimension. - The index along the fourth dimension. - The value at the given index. - - - Creates an array where the entries are initially the "default" value. - The length of the first dimension. - The length of the second dimension. - The length of the third dimension. - The length of the fourth dimension. - The created array. - - - Returns the length of an array in the fourth dimension. - The input array. - The length of the array in the fourth dimension. - - - Returns the length of an array in the third dimension. - The input array. - The length of the array in the third dimension. - - - Returns the length of an array in the second dimension. - The input array. - The length of the array in the second dimension. - - - Returns the length of an array in the first dimension - The input array. - The length of the array in the first dimension. - - - Creates an array given the dimensions and a generator function to compute the elements. - The length of the first dimension. - The length of the second dimension. - The length of the third dimension. - The length of the fourth dimension. - The function to create an initial value at each index in the array. - The created array. - - - Creates an array whose elements are all initially the given value - The length of the first dimension. - The length of the second dimension. - The length of the third dimension. - The length of the fourth dimension. - The initial value for each element of the array. - The created array. - - - Basic operations on rank 4 arrays. - - - Combines three arrays into an array of pairs. The three arrays must have equal lengths, otherwise an ArgumentException is - raised. - The first input array. - The second input array. - The third input array. - Thrown when the input arrays differ in length. - The array of tupled elements. - - - Combines the two arrays into an array of pairs. The two arrays must have equal lengths, otherwise an ArgumentException is - raised. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - The array of tupled elements. - - - Splits an array of triples into three arrays. - The input array. - The tuple of three arrays. - - - Splits an array of pairs into two arrays. - The input array. - The two arrays. - - - Returns the index of the first element in the array - that satisfies the given predicate. - The function to test the input elements. - The input array. - The index of the first element that satisfies the predicate, or None. - - - Returns the first element for which the given function returns true. - Return None if no such element exists. - The function to test the input elements. - The input array. - The first element that satisfies the predicate, or None. - - - Views the given array as a sequence. - The input array. - The sequence of array elements. - - - Builds a list from the given array. - The input array. - The list of array elements. - - - Returns the sum of the results generated by applying the function to each element of the array. - The function to transform the array elements into the type to be summed. - The input array. - The resulting sum. - - - Returns the sum of the elements in the array. - The input array. - The resulting sum. - - - Sorts the elements of an array by mutating the array in-place, using the given comparison function. - Elements are compared using Operators.compare. - The input array. - - - Sorts the elements of an array by mutating the array in-place, using the given comparison function as the order. - The function to compare pairs of array elements. - The input array. - - - Sorts the elements of an array by mutating the array in-place, using the given projection for the keys. - Elements are compared using Operators.compare. - - This is not a stable sort, i.e. the original order of equal elements is not necessarily preserved. - For a stable sort, consider using Seq.sort. - The function to transform array elements into the type that is compared. - The input array. - - - Sorts the elements of an array, using the given comparison function as the order, returning a new array. - - This is not a stable sort, i.e. the original order of equal elements is not necessarily preserved. - For a stable sort, consider using Seq.sort. - The function to compare pairs of array elements. - The input array. - The sorted array. - - - Sorts the elements of an array, using the given projection for the keys and returning a new array. - Elements are compared using Operators.compare. - - This is not a stable sort, i.e. the original order of equal elements is not necessarily preserved. - For a stable sort, consider using Seq.sort. - The function to transform array elements into the type that is compared. - The input array. - The sorted array. - - - Sorts the elements of an array, returning a new array. Elements are compared using Operators.compare. - - This is not a stable sort, i.e. the original order of equal elements is not necessarily preserved. - For a stable sort, consider using Seq.sort. - The input array. - The sorted array. - - - Builds a new array that contains the given subrange specified by - starting index and length. - The input array. - The index of the first element of the sub array. - The length of the sub array. - The created sub array. - - - Sets an element of an array. - The input array. - The input index. - The input value. - - - Like foldBack, but return both the intermediary and final results. - The function to update the state given the input elements. - The input array. - The initial state. - The array of state values. - - - Like fold, but return the intermediary and final results. - The function to update the state given the input elements. - The initial state. - The input array. - The array of state values. - - - Returns a new array with the elements in reverse order. - The input array. - The reversed array. - - - Applies 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. - The function to reduce a pair of elements to a single element. - The input array. - Thrown when the input array is empty. - The final result of the reductions. - - - Applies 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. - The function to reduce a pair of elements to a single element. - The input array. - Thrown when the input array is empty. - The final result of the redcutions. - - - Returns an array with all elements permuted according to the - specified permutation. - The function that maps input indices to output indices. - The input array. - The output array. - - - Splits the collection into two collections, containing the - elements for which the given predicate returns "true" and "false" - respectively. - The function to test the input elements. - The input array. - A pair of arrays. The first containing the elements the predicate evaluated to true, - and the second containing those evaluated to false. - - - Builds a new array from the given enumerable object. - The input sequence. - The array of elements from the sequence. - - - Builds an array from the given list. - The input list. - The array of elements from the list. - - - Returns the lowest of all elements of the array, compared via Operators.min on the function result. - - Throws ArgumentException for empty arrays. - The function to transform the elements into a type supporting comparison. - The input array. - Thrown when the input array is empty. - The minimum element. - - - Returns the lowest of all elements of the array, compared via Operators.min. - - Throws ArgumentException for empty arrays - The input array. - Thrown when the input array is empty. - The minimum element. - - - Returns the greatest of all elements of the array, compared via Operators.max on the function result. - - Throws ArgumentException for empty arrays. - The function to transform the elements into a type supporting comparison. - The input array. - Thrown when the input array is empty. - The maximum element. - - - Returns the greatest of all elements of the array, compared via Operators.max on the function result. - - Throws ArgumentException for empty arrays. - The input array. - Thrown when the input array is empty. - The maximum element. - - - Builds 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. - The function to transform elements and their indices. - The input array. - The array of transformed elements. - - - Builds 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. - The function to transform pairs of input elements and their indices. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - The array of transformed elements. - - - Builds 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. - The function to transform the pairs of the input elements. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - The array of transformed elements. - - - Builds a new array whose elements are the results of applying the given function - to each of the elements of the array. - The function to transform elements of the array. - The input array. - The array of transformed elements. - - - Returns the length of an array. You can also use property arr.Length. - The input array. - The length of the array. - - - Applies 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. - The function to apply to each index and pair of elements. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - - - Applies the given function to each element of the array. The integer passed to the - function indicates the index of element. - The function to apply to each index and element. - The input array. - - - Applies 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. - The function to apply. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - - - Applies the given function to each element of the array. - The function to apply. - The input array. - - - Returns true if the given array is empty, otherwise false. - The input array. - True if the array is empty. - - - Creates an array where the entries are initially the default value Unchecked.defaultof<'T>. - The length of the array to create. - The created array. - - - Creates an array given the dimension and a generator function to compute the elements. - The number of elements to initialize. - The function to generate the initial values for each index. - The created array. - - - Gets an element from an array. - The input array. - The input index. - The value of the array at the given index. - - - 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. - The function to update the state given the input elements. - The first input array. - The second input array. - The initial state. - Thrown when the input arrays differ in length. - The final state. - - - Applies 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. - The function to update the state given the input elements. - The initial state. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - The final state. - - - Applies 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)) - The function to update the state given the input elements. - The input array. - The initial state. - The final state. - - - Applies 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 - The function to update the state given the input elements. - The initial state. - The input array. - The final state. - - - Tests 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. - The function to test the input elements. - The first input array. - The second input array. - Thrown when the input arrays differ in length. - True if all of the array elements satisfy the predicate. - - - Tests 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. - The function to test the input elements. - The input array. - True if all of the array elements satisfy the predicate. - - - Returns the index of the first element in the array - that satisfies the given predicate. Raise KeyNotFoundException if - none of the elements satisy the predicate. - The function to test the input elements. - The input array. - Thrown if predicate - never returns true. - The index of the first element in the array that satisfies the given predicate. - - - Returns the first element for which the given function returns 'true'. - Raise KeyNotFoundException if no such element exists. - The function to test the input elements. - The input array. - Thrown if predicate - never returns true. - The first element for which predicate returns true. - - - Returns a new collection containing only the elements of the collection - for which the given predicate returns "true". - The function to test the input elements. - The input array. - An array containing the elements for which the given predicate returns true. - - - Tests 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. - The function to test the input elements. - The first input array. - The second input array. - True if any result from predicate is true. - - - Tests 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. - The function to test the input elements. - The input array. - True if any result from predicate is true. - - - Returns an empty array of the given type. - - - Applies the given function to each element of the array. Returns - the array comprised of the results "x" for each element where - the function returns Some(x) - The function to generate options from the elements. - The input array. - The array of results. - - - Applies 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. - The function to generate options from the elements. - The input array. - Thrown if every result from - chooser is None. - The first result. - - - Fills a range of elements of the array with the given value. - The target array. - The index of the first element to set. - The number of elements to set. - The value to set. - - - Applies 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. - The function to transform the array elements into options. - The input array. - The first transformed element that is Some(x). - - - Creates an array whose elements are all initially the given value. - The length of the array to create. - The value for the elements. - The created array. - - - Builds a new array that contains the elements of the given array. - The input array. - A copy of the input array. - - - Builds a new array that contains the elements of each of the given sequence of arrays. - The input sequence of arrays. - The concatenation of the sequence of input arrays. - - - For each element of the array, applies the given function. Concatenates all the results and return the combined array. - The function to create sub-arrays from the input array elements. - The input array. - The concatenation of the sub-arrays. - - - Reads a range of elements from the first array and write them into the second. - The source array. - The starting index of the source array. - The target array. - The starting index of the target array. - The number of elements to copy. - - - Returns the average of the elements generated by applying the function to each element of the array. - The function to transform the array elements before averaging. - The input array. - Thrown when array is empty. - The computed average. - - - Returns the average of the elements in the array. - The input array. - Thrown when array is empty. - The average of the elements in the array. - - - Builds a new array that contains the elements of the first array followed by the elements of the second array. - The first input array. - The second input array. - The resulting array. - - - Basic operations on arrays. - - - Compare using the given comparer function. - A function to compare two values. - An object implementing IComparer using the supplied comparer. - - - Structural comparison. Compare using Operators.compare. - - - Common notions of comparison identity used with sorted data structures. - - - Hash using the given hashing and equality functions. - A function to generate a hash code from a value. - A function to test equality of two values. - An object implementing IEqualityComparer using the supplied functions. - - - Physical hashing (hash on reference identity of objects, and the contents of value types). - Hash using LanguagePrimitives.PhysicalEquality and LanguagePrimitives.PhysicalHash, - That is, for value types use GetHashCode and Object.Equals (if no other optimization available), - and for reference types use System.Runtime.CompilerServices.RuntimeHelpers.GetHashCode and - reference equality. - - - - - - Structural hashing. Hash using Operators.(=) and Operators.hash. - - - Common notions of value identity used with hash tables. - - - Combines the three lists into a list of triples. The lists must have equal lengths. - The first input list. - The second input list. - The third input list. - A single list containing triples of matching elements from the input lists. - - - Combines the two lists into a list of pairs. The two lists must have equal lengths. - The first input list. - The second input list. - A single list containing pairs of matching elements from the input lists. - - - Splits a list of triples into three lists. - The input list. - Three lists of split elements. - - - Splits a list of pairs into two lists. - The input list. - Two lists of split elements. - - - Returns the index of the first element in the list - that satisfies the given predicate. - Return None if no such element exists. - The function to test the input elements. - The input list. - The index of the first element for which the predicate returns true, or None if - every element evaluates to false. - - - Returns the first element for which the given function returns true.. - Return None if no such element exists. - The function to test the input elements. - The input list. - The first element for which the predicate returns true, or None if - every element evaluates to false. - - - Applies the given function to successive elements, returning Some(x) the first - result where function returns Some(x) for some x. If no such element - exists then return None. - The function to generate options from the elements. - The input list. - The first resulting value or None. - - - Views the given list as a sequence. - The input list. - The sequence of elements in the list. - - - Builds an array from the given list. - The input list. - The array containing the elements of the list. - - - Returns the list after removing the first element. - - The input list. - Thrown when the list is empty. - The list after removing the first element. - - - Returns the sum of the results generated by applying the function to each element of the list. - The function to transform the list elements into the type to be summed. - The input list. - The resulting sum. - - - Returns the sum of the elements in the list. - The input list. - The resulting sum. - - - Sorts the given list using Operators.compare. - - This is a stable sort, i.e. the original order of equal elements is preserved. - The input list. - The sorted list. - - - Sorts the given list using keys given by the given projection. Keys are compared using Operators.compare. - - This is a stable sort, i.e. the original order of equal elements is preserved. - The function to transform the list elements into the type to be compared. - The input list. - The sorted list. - - - Sorts the given list using the given comparison function. - - This is a stable sort, i.e. the original order of equal elements is preserved. - The function to compare the list elements. - The input list. - The sorted list. - - - Like foldBack, but returns both the intermediary and final results - The function to update the state given the input elements. - The input list. - The initial state. - The list of states. - - - Applies a function to each element of the collection, threading an accumulator argument - through the computation. Take the second argument, and apply the function to it - and the first element of the list. Then feed this result into the function along - with the second element and so on. Returns the list of intermediate results and the final result. - The function to update the state given the input elements. - The initial state. - The input list. - The list of states. - - - Returns a new list with the elements in reverse order. - The input list. - The reversed list. - - - Creates a list by calling the given generator on each index. - The number of elements to replicate. - The value to replicate - The generated list. - - - Applies 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 i0 (...(f iN-1 iN)). - - Raises System.ArgumentException if list is empty - The function to reduce two list elements to a single element. - The input list. - Thrown when the list is empty. - The final reduced value. - - - Apply a function to each element of the collection, threading an accumulator argument - through the computation. Apply the function to the first two elements of the list. - Then feed this result into the function along with the third element and so on. - Return the final result. If the input function is f and the elements are i0...iN then computes - f (... (f i0 i1) i2 ...) iN. - - Raises System.ArgumentException if list is empty - The function to reduce two list elements to a single element. - The input list. - Thrown when the list is empty. - The final reduced value. - - - Returns a list with all elements permuted according to the - specified permutation. - The function to map input indices to output indices. - The input list. - The permutated list. - - - Applies the given function to successive elements, returning the first - result where function returns Some(x) for some x. If no such - element exists then raise System.Collections.Generic.KeyNotFoundException - The function to generate options from the elements. - The input list. - Thrown when the list is empty. - The first resulting value. - - - Splits the collection into two collections, containing the - elements for which the given predicate returns true and false - respectively. Element order is preserved in both of the created lists. - The function to test the input elements. - The input list. - A list containing the elements for which the predicate evaluated to false and a list - containing the elements for which the predicate evaluated to true. - - - Builds a new list from the given enumerable object. - The input sequence. - The list of elements from the sequence. - - - Builds a list from the given array. - The input array. - The list of elements from the array. - - - Indexes into the list. The first element has index 0. - The input list. - The index to retrieve. - The value at the given index. - - - Returns the lowest of all elements of the list, compared via Operators.min on the function result - - Raises System.ArgumentException if list is empty. - The function to transform list elements into the type to be compared. - The input list. - Thrown when the list is empty. - The minimum value. - - - Returns the lowest of all elements of the list, compared via Operators.min. - - Raises System.ArgumentException if list is empty - The input list. - Thrown when the list is empty. - The minimum value. - - - Returns the greatest of all elements of the list, compared via Operators.max on the function result. - - Raises System.ArgumentException if list is empty. - The function to transform the list elements into the type to be compared. - The input list. - Thrown when the list is empty. - The maximum element. - - - Return the greatest of all elements of the list, compared via Operators.max. - - Raises System.ArgumentException if list is empty - The input list. - Thrown when the list is empty. - The maximum element. - - - Like mapi, but mapping corresponding elements from two lists of equal length. - The function to transform pairs of elements from the two lists and their index. - The first input list. - The second input list. - The list of transformed elements. - - - Builds a new collection whose elements are the results of applying the given function - to each of the elements of the collection. The integer index passed to the - function indicates the index (from 0) of element being transformed. - The function to transform elements and their indices. - The input list. - The list of transformed elements. - - - Builds a new collection whose elements are the results of applying the given function - to the corresponding elements of the three collections simultaneously. - The function to transform triples of elements from the input lists. - The first input list. - The second input list. - The third input list. - The list of transformed elements. - - - Builds a new collection whose elements are the results of applying the given function - to the corresponding elements of the two collections pairwise. - The function to transform pairs of elements from the input lists. - The first input list. - The second input list. - The list of transformed elements. - - - Builds a new collection whose elements are the results of applying the given function - to each of the elements of the collection. - The function to transform elements from the input list. - The input list. - The list of transformed elements. - - - Returns the length of the list. - The input list. - The length of the list. - - - Applies the given function to two collections simultaneously. The - collections must have identical size. The integer passed to the - function indicates the index of element. - The function to apply to a pair of elements from the input lists along with their index. - The first input list. - The second input list. - - - Applies the given function to each element of the collection. The integer passed to the - function indicates the index of element. - The function to apply to the elements of the list along with their index. - The input list. - - - Applies the given function to two collections simultaneously. The - collections must have identical size. - The function to apply to pairs of elements from the input lists. - The first input list. - The second input list. - - - Applies the given function to each element of the collection. - The function to apply to elements from the input list. - The input list. - - - Returns true if the list contains no elements, false otherwise. - The input list. - True if the list is empty. - - - Creates a list by calling the given generator on each index. - The length of the list to generate. - The function to generate an element from an index. - The list of generated elements. - - - Returns the first element of the list. - - The input list. - Thrown when the list is empty. - The first element of the list. - - - Tests if all corresponding elements of the collection 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 System.ArgumentException exception is raised. - Otherwise, true is returned. - The function to test the input elements. - The first input list. - The second input list. - Thrown when the input lists differ in length. - True if all of the pairs of elements satisfy the predicate. - - - Tests if all elements of the collection satisfy the given predicate. - - The predicate is applied to the elements of the input list. If any application - returns false then the overall result is false and no further elements are tested. - Otherwise, true is returned. - The function to test the input elements. - The input list. - True if all of the elements satisfy the predicate. - - - Applies a function to corresponding elements of two collections, threading an accumulator argument - through the computation. The collections must have identical sizes. - If the input function is f and the elements are i0...iN and j0...jN - then computes f i0 j0 (...(f iN jN s)). - The function to update the state given the input elements. - The first input list. - The second input list. - The initial state. - The final state value. - - - Applies 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 i0 (...(f iN s)). - The function to update the state given the input elements. - The input list. - The initial state. - The final state value. - - - Applies a function to corresponding elements of two collections, threading an accumulator argument - through the computation. The collections must have identical sizes. - If the input function is f and the elements are i0...iN and j0...jN - then computes f (... (f s i0 j0)...) iN jN. - The function to update the state given the input elements. - The initial state. - The first input list. - The second input list. - The final state value. - - - Applies a function to each element of the collection, threading an accumulator argument - through the computation. Take the second argument, and apply the function to it - and the first element of the list. Then feed this result into the function along - with the second element and so on. Return the final result. - If the input function is f and the elements are i0...iN then - computes f (... (f s i0) i1 ...) iN. - The function to update the state given the input elements. - The initial state. - The input list. - The final state value. - - - Returns a new collection containing only the elements of the collection - for which the given predicate returns "true" - The function to test the input elements. - The input list. - A list containing only the elements that satisfy the predicate. - - - Returns the index of the first element in the list - that satisfies the given predicate. - Raises KeyNotFoundException if no such element exists. - The function to test the input elements. - The input list. - Thrown if the predicate evaluates to false for all the - elements of the list. - The index of the first element that satisfies the predicate. - - - Returns the first element for which the given function returns true. - Raises KeyNotFoundException if no such element exists. - The function to test the input elements. - The input list. - Thrown if the predicate evaluates to false for - all the elements of the list. - The first element that satisfies the predicate. - - - Tests if any pair of corresponding elements of the lists 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 System.ArgumentException exception is raised. - Otherwise, false is returned. - The function to test the input elements. - The first input list. - The second input list. - Thrown when the input lists differ in length. - True if any pair of elements satisfy the predicate. - - - Tests if any element of the list satisfies the given predicate. - - The predicate is applied to the elements of the input list. If any application - returns true then the overall result is true and no further elements are tested. - Otherwise, false is returned. - The function to test the input elements. - The input list. - True if any element satisfies the predicate. - - - Returns an empty list of the given type. - - - Returns a new list that contains the elements of each the lists in order. - The input sequence of lists. - The resulting concatenated list. - - - For each element of the list, applies the given function. Concatenates all the results and return the combined list. - The function to transform each input element into a sublist to be concatenated. - The input list. - The concatenation of the transformed sublists. - - - Applies the given function to each element of the list. Returns - the list comprised of the results x for each element where - the function returns Some(x) - The function to generate options from the elements. - The input list. - The list comprising the values selected from the chooser function. - - - Returns the average of the elements generated by applying the function to each element of the list. - - Raises System.ArgumentException if list is empty. - The function to transform the list elements into the type to be averaged. - The input list. - Thrown when the list is empty. - The resulting average. - - - Returns the average of the elements in the list. - - Raises System.ArgumentException if list is empty. - The input list. - Thrown when the list is empty. - The resulting average. - - - Returns a new list that contains the elements of the first list - followed by elements of the second. - The first input list. - The second input list. - The resulting list. - - - Basic operations on lists. - - - Returns the key of the first mapping in the collection that satisfies the given predicate. - Returns 'None' if no such element exists. - The function to test the input elements. - The input map. - The first key for which the predicate returns true or None if the predicate evaluates to false for each key/value pair. - - - Evaluates the function on each mapping in the collection. Returns the key for the first mapping - where the function returns 'true'. Raise KeyNotFoundException if no such element exists. - The function to test the input elements. - The input map. - Thrown if the key does not exist in the map. - The first key for which the predicate evaluates true. - - - Lookup an element in the map, returning a Some value if the element is in the domain - of the map and None if not. - The input key. - The input map. - The found Some value or None. - - - Removes an element from the domain of the map. No exception is raised if the element is not present. - The input key. - The input map. - The resulting map. - - - Builds two new maps, one containing the bindings for which the given predicate returns 'true', - and the other the remaining bindings. - The function to test the input elements. - The input map. - A pair of maps in which the first contains the elements for which the predicate returned true - and the second containing the elements for which the predicated returned false. - - - Tests if an element is in the domain of the map. - The input key. - The input map. - True if the map contains the key. - - - Builds a new collection whose elements are the results of applying the given function - to each of the elements of the collection. The key passed to the - function indicates the key of element being transformed. - The function to transform the key/value pairs. - The input map. - The resulting map of keys and transformed values. - - - Returns true if the given predicate returns true for all of the - bindings in the map. - The function to test the input elements. - The input map. - True if the predicate evaluates to true for all of the bindings in the map. - - - Builds a new map containing only the bindings for which the given predicate returns 'true'. - The function to test the key/value pairs. - The input map. - The filtered map. - - - Returns true if the given predicate returns true for one of the - bindings in the map. - The function to test the input elements. - The input map. - True if the predicate returns true for one of the key/value pairs. - - - Applies the given function to each binding in the dictionary - The function to apply to each key/value pair. - The input map. - - - Folds over the bindings in the map - The function to update the state given the input key/value pairs. - The initial state. - The input map. - The final state value. - - - Folds over the bindings in the map. - The function to update the state given the input key/value pairs. - The input map. - The initial state. - The final state value. - - - Searches the map looking for the first element where the given function returns a Some value - The function to generate options from the key/value pairs. - The input map. - The first result. - - - Searches the map looking for the first element where the given function returns a Some value. - The function to generate options from the key/value pairs. - The input map. - The first result. - - - Lookup an element in the map, raising KeyNotFoundException if no binding - exists in the map. - The input key. - The input map. - Thrown when the key does not exist in the map. - The value mapped to the given key. - - - The empty map. - - - Is the map empty? - The input map. - True if the map is empty. - - - Returns an array of all key-value pairs in the mapping. - The array will be ordered by the keys of the map. - The input map. - The array of key/value pairs. - - - Returns a list of all key-value pairs in the mapping. - The list will be ordered by the keys of the map. - The input map. - The list of key/value pairs. - - - Views the collection as an enumerable sequence of pairs. - The sequence will be ordered by the keys of the map. - The input map. - The sequence of key/value pairs. - - - Returns a new map made from the given bindings. - The input sequence of key/value pairs. - The resulting map. - - - Returns a new map made from the given bindings. - The input array of key/value pairs. - The resulting map. - - - Returns a new map made from the given bindings. - The input list of key/value pairs. - The resulting map. - - - Returns a new map with the binding added to the given map. - The input key. - The input value. - The input map. - The resulting map. - - - Functional programming operators related to the Map<_,_> type. - - - Combines the three sequences into a list of triples. The sequences need not have equal lengths: - when one sequence is exhausted any remaining elements in the other - sequences are ignored. - - The first input sequence. - The second input sequence. - The third input sequence. - - The result sequence. - - Thrown when any of the input sequences is null. - - - Combines the two sequences into a list of pairs. The two sequences need not have equal lengths: - when one sequence is exhausted any remaining elements in the other - sequence are ignored. - - The first input sequence. - The second input sequence. - - The result sequence. - - Thrown when either of the input sequences is null. - - - Returns a sequence that yields sliding windows of containing elements drawn from the input - sequence. Each window is returned as a fresh array. - - The number of elements in each window. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - - - Returns a sequence that contains the elements generated by the given computation. - The given initial state argument is passed to the element generator. - For each IEnumerator elements in the stream are generated on-demand by applying the element - generator, until a None value is returned by the element generator. Each call to the element - generator returns a new residual state. - - The stream will be recomputed each time an IEnumerator is requested and iterated for the Seq. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - A function that takes in the current state and returns an option tuple of the next - element of the sequence and the next state value. - The initial state value. - - The result sequence. - - - Returns a sequence that when enumerated returns at most N elements. - - The maximum number of items to enumerate. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Applies the given function to successive elements, returning the first - result where the function returns "Some(x)". - - A function that transforms items from the input sequence into options. - The input sequence. - - The chosen element or None. - - Thrown when the input sequence is null. - - - Returns the index of the first element in the sequence - that satisfies the given predicate. Return None if no such element exists. - - A function that evaluates to a Boolean when given an item in the sequence. - The input sequence. - - The found index or None. - - Thrown when the input sequence is null. - - - Returns the first element for which the given function returns true. - Return None if no such element exists. - - A function that evaluates to a Boolean when given an item in the sequence. - The input sequence. - - The found element or None. - - Thrown when the input sequence is null. - - - Builds a list from the given collection. - - The input sequence. - - The result list. - - Thrown when the input sequence is null. - - - Builds an array from the given collection. - - The input sequence. - - The result array. - - Thrown when the input sequence is null. - - - Returns a sequence that, when iterated, yields elements of the underlying sequence while the - given predicate returns true, and then returns no further elements. - - A function that evaluates to false when no more items should be returned. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns the first N elements of the sequence. - Throws InvalidOperationException - if the count exceeds the number of elements in the sequence. Seq.truncate - returns as many items as the sequence contains instead of throwing an exception. - - The number of items to take. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - Thrown when count exceeds the number of elements - in the sequence. - - - Returns the sum of the results generated by applying the function to each element of the sequence. - The generated elements are summed using the + operator and Zero property associated with the generated type. - - A function to transform items from the input sequence into the type that will be summed. - The input sequence. - - The computed sum. - - - Returns the sum of the elements in the sequence. - - The elements are summed using the + operator and Zero property associated with the generated type. - - The input sequence. - - The computed sum. - - - Applies a key-generating function to each element of a sequence and yield a sequence ordered - by keys. The keys are compared using generic comparison as implemented by Operators.compare. - - This function returns a sequence that digests the whole initial sequence as soon as - that sequence is iterated. As a result this function should not be used with - large or infinite sequences. The function makes no assumption on the ordering of the original - sequence. - - This is a stable sort, that is the original order of equal elements is preserved. - - A function to transform items of the input sequence into comparable keys. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Yields a sequence ordered by keys. - - This function returns a sequence that digests the whole initial sequence as soon as - that sequence is iterated. As a result this function should not be used with - large or infinite sequences. The function makes no assumption on the ordering of the original - sequence. - - This is a stable sort, that is the original order of equal elements is preserved. - - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns a sequence that, when iterated, skips elements of the underlying sequence while the - given predicate returns true, and then yields the remaining elements of the sequence. - - A function that evaluates an element of the sequence to a boolean value. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns a sequence that skips N elements of the underlying sequence and then yields the - remaining elements of the sequence. - - The number of items to skip. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - Thrown when count exceeds the number of elements - in the sequence. - - - Returns a sequence that yields one item only. - - The input item. - - The result sequence of one item. - - - Like fold, but computes on-demand and returns the sequence of intermediary and final results. - - A function that updates the state with each element from the sequence. - The initial state. - The input sequence. - - The resulting sequence of computed states. - - Thrown when the input sequence is null. - - - Applies a function to each element of the sequence, threading an accumulator argument - through the computation. Begin by applying the function to the first two elements. - Then feed this result into the function along with the third element and so on. - Return the final result. - - A function that takes in the current accumulated result and the next - element of the sequence to produce the next accumulated result. - The input sequence. - - The final result of the reduction function. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - - - Builds a new sequence object that delegates to the given sequence object. This ensures - the original sequence cannot be rediscovered and mutated by a type cast. For example, - if given an array the returned sequence will return the elements of the array, but - you cannot cast the returned sequence object to an array. - - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Applies the given function to successive elements, returning the first - x where the function returns "Some(x)". - - A function to transform each item of the input sequence into an option of the output type. - The input sequence. - - The selected element. - - Thrown when the input sequence is null. - Thrown when every item of the sequence - evaluates to None when the given function is applied. - - - Returns a sequence of each element in the input sequence and its predecessor, with the - exception of the first element which is only returned as the predecessor of the second element. - - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Views the given list as a sequence. - - The input list. - - The result sequence. - - - Views the given array as a sequence. - - The input array. - - The result sequence. - - Thrown when the input sequence is null. - - - Computes the nth element in the collection. - - The index of element to retrieve. - The input sequence. - - The nth element of the sequence. - - Thrown when the input sequence is null. - - - Returns the lowest of all elements of the sequence, compared via Operators.min on the function result. - - A function to transform items from the input sequence into comparable keys. - The input sequence. - - The smallest element of the sequence. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - - - Returns the lowest of all elements of the sequence, compared via Operators.min. - - The input sequence. - - The smallest element of the sequence. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - - - Returns the greatest of all elements of the sequence, compared via Operators.max on the function result. - - A function to transform items from the input sequence into comparable keys. - The input sequence. - - The largest element of the sequence. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - - - Returns the greatest of all elements of the sequence, compared via Operators.max - - The input sequence. - - Thrown when the input sequence is null. - Thrown when the input sequence is empty. - - The largest element of the sequence. - - - Builds a new collection whose elements are the results of applying the given function - to each of the elements of the collection. The integer index passed to the - function indicates the index (from 0) of element being transformed. - - A function to transform items from the input sequence that also supplies the current index. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Builds a new collection whose elements are the results of applying the given function - to the corresponding pairs of elements from the two sequences. If one input sequence is shorter than - the other then the remaining elements of the longer sequence are ignored. - - A function to transform pairs of items from the input sequences. - The first input sequence. - The second input sequence. - - The result sequence. - - Thrown when either of the input sequences is null. - - - Builds a new collection whose elements are the results of applying the given function - to each of the elements of the collection. The given function will be applied - as elements are demanded using the MoveNext method on enumerators retrieved from the - object. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - A function to transform items from the input sequence. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns the length of the sequence - - The input sequence. - - The length of the sequence. - - Thrown when the input sequence is null. - - - Applies the given function to two collections simultaneously. If one sequence is shorter than - the other then the remaining elements of the longer sequence are ignored. - - A function to apply to each pair of elements from the input sequences. - The first input sequence. - The second input sequence. - - Thrown when either of the input sequences is null. - - - Applies the given function to each element of the collection. The integer passed to the - function indicates the index of element. - - A function to apply to each element of the sequence that can also access the current index. - The input sequence. - - Thrown when the input sequence is null. - - - Applies the given function to each element of the collection. - - A function to apply to each element of the sequence. - The input sequence. - - Thrown when the input sequence is null. - - - Generates a new sequence which, when iterated, will return successive - elements by calling the given function. The results of calling the function - will not be saved, that is the function will be reapplied as necessary to - regenerate the elements. The function is passed the index of the item being - generated. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - Iteration can continue up to Int32.MaxValue. - - A function that generates an item in the sequence from a given index. - - The result sequence. - - - Generates a new sequence which, when iterated, will return successive - elements by calling the given function, up to the given count. Each element is saved after its - initialization. The function is passed the index of the item being - generated. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - The maximum number of items to generate for the sequence. - A function that generates an item in the sequence from a given index. - - The result sequence. - - Thrown when count is negative. - - - Returns true if the sequence contains no elements, false otherwise. - - The input sequence. - - True if the sequence is empty; false otherwise. - - Thrown when the input sequence is null. - - - Returns the only element of the sequence. - - The input sequence. - - The last element of the sequence. - - Thrown when the input sequence is null. - Thrown when the input does not have precisely one element. - - - Returns the last element of the sequence. - - The input sequence. - - The last element of the sequence. - - Thrown when the input sequence is null. - Thrown when the input does not have any elements. - - - Returns the first element of the sequence. - - The input sequence. - - The first element of the sequence. - - Thrown when the input sequence is null. - Thrown when the input does not have any elements. - - - Applies a key-generating function to each element of a sequence and yields a sequence of - unique keys. Each unique key contains a sequence of all elements that match - to this key. - - This function returns a sequence that digests the whole initial sequence as soon as - that sequence is iterated. As a result this function should not be used with - large or infinite sequences. The function makes no assumption on the ordering of the original - sequence. - - A function that transforms an element of the sequence into a comparable key. - The input sequence. - - The result sequence. - - - Tests the all pairs of elements drawn from the two sequences satisfy the - given predicate. If one sequence is shorter than - the other then the remaining elements of the longer sequence are ignored. - - A function to test pairs of elements from the input sequences. - The first input sequence. - The second input sequence. - - True if all pairs satisfy the predicate; false otherwise. - - Thrown when either of the input sequences is null. - - - Tests if all elements of the sequence satisfy the given predicate. - - The predicate is applied to the elements of the input sequence. If any application - returns false then the overall result is false and no further elements are tested. - Otherwise, true is returned. - - A function to test an element of the input sequence. - The input sequence. - - True if every element of the sequence satisfies the predicate; false otherwise. - - Thrown when the input sequence is null. - - - Applies 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 - - A function that updates the state with each element from the sequence. - The initial state. - The input sequence. - - The state object after the folding function is applied to each element of the sequence. - - Thrown when the input sequence is null. - - - Returns the index of the first element for which the given function returns true. - - A function to test whether the index of a particular element should be returned. - The input sequence. - - The index of the first element for which the predicate returns true. - - Thrown if no element returns true when - evaluated by the predicate - Thrown when the input sequence is null - - - Returns the first element for which the given function returns true. - - A function to test whether an item in the sequence should be returned. - The input sequence. - - The first element for which the predicate returns true. - - Thrown if no element returns true when - evaluated by the predicate - Thrown when the input sequence is null - - - Returns a new collection containing only the elements of the collection - for which the given predicate returns "true". - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - Remember sequence is lazy, effects are delayed until it is enumerated. - - A synonym for Seq.filter. - - A function to test whether each item in the input sequence should be included in the output. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns a new collection containing only the elements of the collection - for which the given predicate returns "true". This is a synonym for Seq.where. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - Remember sequence is lazy, effects are delayed until it is enumerated. - - A function to test whether each item in the input sequence should be included in the output. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Tests if any pair of corresponding elements of the input sequences satisfies the given predicate. - - The predicate is applied to matching elements in the two sequences 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, false is returned. If one sequence is shorter than - the other then the remaining elements of the longer sequence are ignored. - - A function to test each pair of items from the input sequences. - The first input sequence. - The second input sequence. - - True if any result from the predicate is true; false otherwise. - - Thrown when either of the two input sequences is null. - - - Tests if any element of the sequence satisfies the given predicate. - - The predicate is applied to the elements of the input sequence. If any application - returns true then the overall result is true and no further elements are tested. - Otherwise, false is returned. - - A function to test each item of the input sequence. - The input sequence. - - True if any result from the predicate is true; false otherwise. - - Thrown when the input sequence is null. - - - Creates an empty sequence. - - An empty sequence. - - - Returns a sequence that contains no duplicate entries according to the - generic hash and equality comparisons on the keys returned by the given key-generating function. - If an element occurs multiple times in the sequence then the later occurrences are discarded. - - A function transforming the sequence items into comparable keys. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns a sequence that contains no duplicate entries according to generic hash and - equality comparisons on the entries. - If an element occurs multiple times in the sequence then the later occurrences are discarded. - - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns a sequence that is built from the given delayed specification of a - sequence. - - The input function is evaluated each time an IEnumerator for the sequence - is requested. - - The generating function for the sequence. - - - Applies a key-generating function to each element of a sequence and return a sequence yielding unique - keys and their number of occurrences in the original sequence. - - Note that this function returns a sequence that digests the whole initial sequence as soon as - that sequence is iterated. As a result this function should not be used with - large or infinite sequences. The function makes no assumption on the ordering of the original - sequence. - - A function transforming each item of input sequence into a key to be - compared against the others. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Combines the given enumeration-of-enumerations as a single concatenated - enumeration. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - The input enumeration-of-enumerations. - - The result sequence. - - Thrown when the input sequence is null. - - - Compares two sequences using the given comparison function, element by element. - Returns the first non-zero result from the comparison function. If the end of a sequence - is reached it returns a -1 if the first sequence is shorter and a 1 if the second sequence - is shorter. - - A function that takes an element from each sequence and returns an int. - If it evaluates to a non-zero value iteration is stopped and that value is returned. - The first input sequence. - The second input sequence. - - The first non-zero value from the comparison function. - - Thrown when either of the input sequences - is null. - - - Applies the given function to each element of the sequence and concatenates all the - results. - - Remember sequence is lazy, effects are delayed until it is enumerated. - - A function to transform elements of the input sequence into the sequences - that will then be concatenated. - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Applies the given function to each element of the list. Return - the list comprised of the results "x" for each element where - the function returns Some(x). - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not - be accessed concurrently. - - A function to transform items of type T into options of type U. - The input sequence of type T. - - The result sequence. - - Thrown when the input sequence is null. - - - Wraps a loosely-typed System.Collections sequence as a typed sequence. - - The use of this function usually requires a type annotation. - An incorrect type annotation may result in runtime type - errors. - Individual IEnumerator values generated from the returned sequence should not be accessed concurrently. - - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns a sequence that corresponds to a cached version of the input sequence. - This result sequence will have the same elements as the input sequence. The result - can be enumerated multiple times. The input sequence will be enumerated at most - once and only as far as is necessary. Caching a sequence is typically useful when repeatedly - evaluating items in the original sequence is computationally expensive or if - iterating the sequence causes side-effects that the user does not want to be - repeated multiple times. - - Enumeration of the result sequence is thread safe in the sense that multiple independent IEnumerator - values may be used simultaneously from different threads (accesses to - the internal lookaside table are thread safe). Each individual IEnumerator - is not typically thread safe and should not be accessed concurrently. - - Once enumeration of the input sequence has started, - it's enumerator will be kept live by this object until the enumeration has completed. - At that point, the enumerator will be disposed. - - The enumerator may be disposed and underlying cache storage released by - converting the returned sequence object to type IDisposable, and calling the Dispose method - on this object. The sequence object may then be re-enumerated and a fresh enumerator will - be used. - - The input sequence. - - The result sequence. - - Thrown when the input sequence is null. - - - Returns the average of the results generated by applying the function to each element - of the sequence. - - The elements are averaged using the + operator, DivideByInt method and Zero property - associated with the generated type. - - A function applied to transform each element of the sequence. - The input sequence. - - The average. - - Thrown when the input sequence is null. - Thrown when the input sequence has zero elements. - - - Returns the average of the elements in the sequence. - - The elements are averaged using the + operator, DivideByInt method and Zero property - associated with the element type. - - The input sequence. - - The average. - - Thrown when the input sequence is null. - Thrown when the input sequence has zero elements. - - - Wraps the two given enumerations as a single concatenated - enumeration. - - The returned sequence may be passed between threads safely. However, - individual IEnumerator values generated from the returned sequence should not be accessed - concurrently. - - The first sequence. - The second sequence. - - The result sequence. - - Thrown when either of the two provided sequences is - null. - - - Basic operations on IEnumerables. - - - Returns a new set with the elements of the second set removed from the first. - The first input set. - The set whose elements will be removed from set1. - The set with the elements of set2 removed from set1. - - - Builds a new collection from the given enumerable object. - The input sequence. - The set containing elements. - - - Returns an ordered view of the collection as an enumerable object. - The input set. - An ordered sequence of the elements of set. - - - Builds an array that contains the elements of the set in order. - The input set. - An ordered array of the elements of set. - - - Builds a set that contains the same elements as the given array. - The input array. - A set containing the elements of array. - - - Builds a list that contains the elements of the set in order. - The input set. - An ordered list of the elements of set. - - - Builds a set that contains the same elements as the given list. - The input list. - A set containing the elements form the input list. - - - Returns the highest element in the set according to the ordering being used for the set. - The input set. - The max value from the set. - - - Returns the lowest element in the set according to the ordering being used for the set. - The input set. - The min value from the set. - - - Returns a new set with the given element removed. No exception is raised if - the set doesn't contain the given element. - The element to remove. - The input set. - The input set with value removed. - - - Splits the set into two sets containing the elements for which the given predicate - returns true and false respectively. - The function to test set elements. - The input set. - A pair of sets with the first containing the elements for which predicate returns - true and the second containing the elements for which predicate returns false. - - - Applies the given function to each element of the set, in order according - to the comparison function. - The function to apply to each element. - The input set. - - - Returns "true" if the set is empty. - The input set. - True if set is empty. - - - Computes the union of a sequence of sets. - The sequence of sets to untion. - The union of the input sets. - - - Computes the union of the two sets. - The first input set. - The second input set. - The union of set1 and set2. - - - Computes the intersection of a sequence of sets. The sequence must be non-empty. - The sequence of sets to intersect. - The intersection of the input sets. - - - Computes the intersection of the two sets. - The first input set. - The second input set. - The intersection of set1 and set2. - - - Tests if all elements of the collection satisfy the given predicate. - If the input function is f and the elements are i0...iN and "j0...jN" - then computes p i0 && ... && p iN. - The function to test set elements. - The input set. - True if all elements of set satisfy predicate. - - - Applies the given accumulating function to all the elements of the set. - The accumulating function. - The input set. - The initial state. - The final state. - - - Applies the given accumulating function to all the elements of the set - The accumulating function. - The initial state. - The input set. - The final state. - - - Returns a new collection containing the results of applying the - given function to each element of the input set. - The function to transform elements of the input set. - The input set. - A set containing the transformed elements. - - - Returns a new collection containing only the elements of the collection - for which the given predicate returns true. - The function to test set elements. - The input set. - The set containing only the elements for which predicate returns true. - - - Tests if any element of the collection satisfies the given predicate. - If the input function is predicate and the elements are i0...iN - then computes p i0 or ... or p iN. - The function to test set elements. - The input set. - True if any element of set satisfies predicate. - - - Returns the number of elements in the set. Same as size. - The input set. - The number of elements in the set. - - - Evaluates to "true" if all elements of the second set are in the first, and at least - one element of the first is not in the second. - The potential superset. - The set to test against. - True if set1 is a proper superset of set2. - - - Evaluates to "true" if all elements of the second set are in the first. - The potential superset. - The set to test against. - True if set1 is a superset of set2. - - - Evaluates to "true" if all elements of the first set are in the second, and at least - one element of the second is not in the first. - The potential subset. - The set to test against. - True if set1 is a proper subset of set2. - - - Evaluates to "true" if all elements of the first set are in the second - The potential subset. - The set to test against. - True if set1 is a subset of set2. - - - Evaluates to "true" if the given element is in the given set. - The element to test. - The input set. - True if element is in set. - - - Returns a new set with an element added to the set. No exception is raised if - the set already contains the given element. - The value to add. - The input set. - A new set containing value. - - - The set containing the given element. - The value for the set to contain. - The set containing value. - - - The empty set for the type 'T. - - - Functional programming operators related to the Set<_> type. - - - Gets the default cancellation token for executing asynchronous computations. - The default CancellationToken. - - - Creates an asynchronous computation that returns the CancellationToken governing the execution - of the computation. - In async { let! token = Async.CancellationToken ...} token can be used to initiate other - asynchronous operations that will cancel cooperatively with this workflow. - An asynchronous computation capable of retrieving the CancellationToken from a computation - expression. - - - Creates an asynchronous computation that executes computation. - If this computation is cancelled before it completes then the computation generated by - running compensation is executed. - The input asynchronous computation. - The function to be run if the computation is cancelled. - An asynchronous computation that runs the compensation if the input computation - is cancelled. - - - Creates an asynchronous computation that queues a work item that runs - its continuation. - A computation that generates a new work item in the thread pool. - - - Creates an asynchronous computation that creates a new thread and runs - its continuation in that thread. - A computation that will execute on a new thread. - - - Creates an asynchronous computation that runs - its continuation using syncContext.Post. If syncContext is null - then the asynchronous computation is equivalent to SwitchToThreadPool(). - The synchronization context to accept the posted computation. - An asynchronous computation that uses the syncContext context to execute. - - - Runs an asynchronous computation, starting immediately on the current operating system - thread. Call one of the three continuations when the operation completes. - If no cancellation token is provided then the default cancellation token - is used. - The asynchronous computation to execute. - The function called on success. - The function called on exception. - The function called on cancellation. - The CancellationToken to associate with the computation. - The default is used if this parameter is not provided. - - - Runs an asynchronous computation, starting immediately on the current operating system - thread. - If no cancellation token is provided then the default cancellation token is used. - The asynchronous computation to execute. - The CancellationToken to associate with the computation. - The default is used if this parameter is not provided. - - - Creates an asynchronous computation which starts the given computation as a System.Threading.Tasks.Task - - - Starts a child computation within an asynchronous workflow. - This allows multiple asynchronous computations to be executed simultaneously. - - This method should normally be used as the immediate - right-hand-side of a let! binding in an F# asynchronous workflow, that is, - - async { ... - let! completor1 = childComputation1 |> Async.StartChild - let! completor2 = childComputation2 |> Async.StartChild - ... - let! result1 = completor1 - let! result2 = completor2 - ... } - - When used in this way, each use of StartChild starts an instance of childComputation - and returns a completor object representing a computation to wait for the completion of the operation. - When executed, the completor awaits the completion of childComputation. - The child computation. - The timeout value in milliseconds. If one is not provided - then the default value of -1 corresponding to System.Threading.Timeout.Infinite. - A new computation that waits for the input computation to finish. - - - Executes a computation in the thread pool. - If no cancellation token is provided then the default cancellation token is used. - A System.Threading.Tasks.Task that will be completed - in the corresponding state once the computation terminates (produces the result, throws exception or gets canceled) - - - - Starts the asynchronous computation in the thread pool. Do not await its result. - - If no cancellation token is provided then the default cancellation token is used. - The computation to run asynchronously. - The cancellation token to be associated with the computation. - If one is not supplied, the default cancellation token is used. - - - Creates an asynchronous computation that will sleep for the given time. This is scheduled - using a System.Threading.Timer object. The operation will not block operating system threads - for the duration of the wait. - The number of milliseconds to sleep. - An asynchronous computation that will sleep for the given time. - Thrown when the due time is negative - and not infinite. - - - Runs the asynchronous computation and await its result. - - If an exception occurs in the asynchronous computation then an exception is re-raised by this - function. - - If no cancellation token is provided then the default cancellation token is used. - - The timeout parameter is given in milliseconds. A value of -1 is equivalent to - System.Threading.Timeout.Infinite. - The computation to run. - The amount of time in milliseconds to wait for the result of the - computation before raising a System.TimeoutException. If no value is provided - for timeout then a default of -1 is used to correspond to System.Threading.Timeout.Infinite. - The cancellation token to be associated with the computation. - If one is not supplied, the default cancellation token is used. - The result of the computation. - - - Creates an asynchronous computation that executes all the given asynchronous computations, - initially queueing each as work items and using a fork/join pattern. - - If all child computations succeed, an array of results is passed to the success continuation. - - If any child computation raises an exception, then the overall computation will trigger an - exception, and cancel the others. - - The overall computation will respond to cancellation while executing the child computations. - If cancelled, the computation will cancel any remaining child computations but will still wait - for the other child computations to complete. - A sequence of distinct computations to be parallelized. - A computation that returns an array of values from the sequence of input computations. - - - Generates a scoped, cooperative cancellation handler for use within an asynchronous workflow. - - For example, - async { use! holder = Async.OnCancel interruption ... } - generates an asynchronous computation where, if a cancellation happens any time during - the execution of the asynchronous computation in the scope of holder, then action - interruption is executed on the thread that is performing the cancellation. This can - be used to arrange for a computation to be asynchronously notified that a cancellation - has occurred, e.g. by setting a flag, or deregistering a pending I/O action. - The function that is executed on the thread performing the - cancellation. - An asynchronous computation that triggers the interruption if it is cancelled - before being disposed. - - - Creates an asynchronous computation that runs the given computation and ignores - its result. - The input computation. - A computation that is equivalent to the input computation, but disregards the result. - - - Creates an asynchronous computation that captures the current - success, exception and cancellation continuations. The callback must - eventually call exactly one of the given continuations. - The function that accepts the current success, exception, and cancellation - continuations. - An asynchronous computation that provides the callback with the current continuations. - - - Creates an asynchronous computation in terms of a Begin/End pair of actions in - the style used in CLI APIs. This overlaod should be used if the operation is - qualified by three arguments. For example, - Async.FromBeginEnd(arg1,arg2,arg3,ws.BeginGetWeather,ws.EndGetWeather) - When the computation is run, beginFunc is executed, with - a callback which represents the continuation of the computation. - When the callback is invoked, the overall result is fetched using endFunc. - - The computation will respond to cancellation while waiting for the completion - of the operation. If a cancellation occurs, and cancelAction is specified, then it is - executed, and the computation continues to wait for the completion of the operation. - - If cancelAction is not specified, then cancellation causes the computation - to stop immediately, and subsequent invocations of the callback are ignored. - The first argument for the operation. - The second argument for the operation. - The third argument for the operation. - The function initiating a traditional CLI asynchronous operation. - The function completing a traditional CLI asynchronous operation. - An optional function to be executed when a cancellation is requested. - An asynchronous computation wrapping the given Begin/End functions. - - - Creates an asynchronous computation in terms of a Begin/End pair of actions in - the style used in CLI APIs. This overlaod should be used if the operation is - qualified by two arguments. For example, - Async.FromBeginEnd(arg1,arg2,ws.BeginGetWeather,ws.EndGetWeather) - When the computation is run, beginFunc is executed, with - a callback which represents the continuation of the computation. - When the callback is invoked, the overall result is fetched using endFunc. - - The computation will respond to cancellation while waiting for the completion - of the operation. If a cancellation occurs, and cancelAction is specified, then it is - executed, and the computation continues to wait for the completion of the operation. - - If cancelAction is not specified, then cancellation causes the computation - to stop immediately, and subsequent invocations of the callback are ignored. - The first argument for the operation. - The second argument for the operation. - The function initiating a traditional CLI asynchronous operation. - The function completing a traditional CLI asynchronous operation. - An optional function to be executed when a cancellation is requested. - An asynchronous computation wrapping the given Begin/End functions. - - - Creates an asynchronous computation in terms of a Begin/End pair of actions in - the style used in CLI APIs. This overlaod should be used if the operation is - qualified by one argument. For example, - Async.FromBeginEnd(place,ws.BeginGetWeather,ws.EndGetWeather) - When the computation is run, beginFunc is executed, with - a callback which represents the continuation of the computation. - When the callback is invoked, the overall result is fetched using endFunc. - - The computation will respond to cancellation while waiting for the completion - of the operation. If a cancellation occurs, and cancelAction is specified, then it is - executed, and the computation continues to wait for the completion of the operation. - - If cancelAction is not specified, then cancellation causes the computation - to stop immediately, and subsequent invocations of the callback are ignored. - The argument for the operation. - The function initiating a traditional CLI asynchronous operation. - The function completing a traditional CLI asynchronous operation. - An optional function to be executed when a cancellation is requested. - An asynchronous computation wrapping the given Begin/End functions. - - - Creates an asynchronous computation in terms of a Begin/End pair of actions in - the style used in CLI APIs. For example, - Async.FromBeginEnd(ws.BeginGetWeather,ws.EndGetWeather) - When the computation is run, beginFunc is executed, with - a callback which represents the continuation of the computation. - When the callback is invoked, the overall result is fetched using endFunc. - - The computation will respond to cancellation while waiting for the completion - of the operation. If a cancellation occurs, and cancelAction is specified, then it is - executed, and the computation continues to wait for the completion of the operation. - - If cancelAction is not specified, then cancellation causes the computation - to stop immediately, and subsequent invocations of the callback are ignored. - The function initiating a traditional CLI asynchronous operation. - The function completing a traditional CLI asynchronous operation. - An optional function to be executed when a cancellation is requested. - An asynchronous computation wrapping the given Begin/End functions. - - - Creates an asynchronous computation that executes computation. - If this computation completes successfully then return Choice1Of2 with the returned - value. If this computation raises an exception before it completes then return Choice2Of2 - with the raised exception. - The input computation that returns the type T. - A computation that returns a choice of type T or exception. - - - Raises the cancellation condition for the most recent set of asynchronous computations started - without any specific CancellationToken. Replaces the global CancellationTokenSource with a new - global token source for any asynchronous computations created after this point without any - specific CancellationToken. - - - Creates an asynchronous computation that will wait on the given WaitHandle. - - The computation returns true if the handle indicated a result within the given timeout. - The WaitHandle that can be signalled. - The timeout value in milliseconds. If one is not provided - then the default value of -1 corresponding to System.Threading.Timeout.Infinite. - An asynchronous computation that waits on the given WaitHandle. - - - - Return an asynchronous computation that will wait for the given task to complete and return - its result. - - - - Creates an asynchronous computation that will wait on the IAsyncResult. - - The computation returns true if the handle indicated a result within the given timeout. - The IAsyncResult to wait on. - The timeout value in milliseconds. If one is not provided - then the default value of -1 corresponding to System.Threading.Timeout.Infinite. - An asynchronous computation that waits on the given IAsyncResult. - - - Creates an asynchronous computation that waits for a single invocation of a CLI - event by adding a handler to the event. Once the computation completes or is - cancelled, the handler is removed from the event. - - The computation will respond to cancellation while waiting for the event. If a - cancellation occurs, and cancelAction is specified, then it is executed, and - the computation continues to wait for the event. - - If cancelAction is not specified, then cancellation causes the computation - to cancel immediately. - The event to handle once. - An optional function to execute instead of cancelling when a - cancellation is issued. - An asynchronous computation that waits for the event to be invoked. - - - Creates three functions that can be used to implement the .NET Asynchronous - Programming Model (APM) for a given asynchronous computation. - - The functions should normally be published as members with prefix Begin, - End and Cancel, and can be used within a type definition as follows: - - let beginAction,endAction,cancelAction = Async.AsBeginEnd (fun arg -> computation) - member x.BeginSomeOperation(arg,callback,state:obj) = beginAction(arg,callback,state) - member x.EndSomeOperation(iar) = endAction(iar) - member x.CancelSomeOperation(iar) = cancelAction(iar) - - - If the asynchronous computation takes no arguments, then AsBeginEnd is used as follows: - - let beginAction,endAction,cancelAction = Async.AsBeginEnd (fun () -> computation) - member x.BeginSomeOperation(callback,state:obj) = beginAction((),callback,state) - member x.EndSomeOperation(iar) = endAction(iar) - member x.CancelSomeOperation(iar) = cancelAction(iar) - - - - If the asynchronous computation takes two arguments, then AsBeginEnd is used as follows: - - let beginAction,endAction,cancelAction = Async.AsBeginEnd (fun arg1 arg2 -> computation) - member x.BeginSomeOperation(arg1,arg2,callback,state:obj) = beginAction((),callback,state) - member x.EndSomeOperation(iar) = endAction(iar) - member x.CancelSomeOperation(iar) = cancelAction(iar) - - - In each case, the resulting API will be familiar to programmers in other CLI languages and - is a useful way to publish asynchronous computations in CLI components. - A function generating the asynchronous computation to split into the traditional - .NET Asynchronous Programming Model. - A tuple of the begin, end, and cancel members. - - - This static class holds members for creating and manipulating asynchronous computations. - - - Creates an asynchronous computation that just returns (). - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of empty else branches in the - async { ... } computation expression syntax. - An asynchronous computation that returns (). - - - Creates an asynchronous computation that runs computation repeatedly - until guard() becomes false. - - A cancellation check is performed whenever the computation is executed. - - The existence of this method permits the use of while in the - async { ... } computation expression syntax. - The function to determine when to stop executing computation. - The function to be executed. Equivalent to the body - of a while expression. - An asynchronous computation that behaves similarly to a while loop when run. - - - Creates an asynchronous computation that runs binder(resource). - The action resource.Dispose() is executed as this computation yields its result - or if the asynchronous computation exits by an exception or by cancellation. - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of use and use! in the - async { ... } computation expression syntax. - The resource to be used and disposed. - The function that takes the resource and returns an asynchronous - computation. - An asynchronous computation that binds and eventually disposes resource. - - - Creates an asynchronous computation that runs computation and returns its result. - If an exception happens then catchHandler(exn) is called and the resulting computation executed instead. - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of try/with in the - async { ... } computation expression syntax. - The input computation. - The function to run when computation throws an exception. - An asynchronous computation that executes computation and calls catchHandler if an - exception is thrown. - - - Creates an asynchronous computation that runs computation. The action compensation is executed - after computation completes, whether computation exits normally or by an exception. If compensation raises an exception itself - the original exception is discarded and the new exception becomes the overall result of the computation. - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of try/finally in the - async { ... } computation expression syntax. - The input computation. - The action to be run after computation completes or raises an - exception (including cancellation). - An asynchronous computation that executes computation and compensation aftewards or - when an exception is raised. - - - Delegates to the input computation. - - The existence of this method permits the use of return! in the - async { ... } computation expression syntax. - The input computation. - The input computation. - - - Creates an asynchronous computation that returns the result v. - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of return in the - async { ... } computation expression syntax. - The value to return from the computation. - An asynchronous computation that returns value when executed. - - - Creates an asynchronous computation that enumerates the sequence seq - on demand and runs body for each element. - - A cancellation check is performed on each iteration of the loop. - - The existence of this method permits the use of for in the - async { ... } computation expression syntax. - The sequence to enumerate. - A function to take an item from the sequence and create - an asynchronous computation. Can be seen as the body of the for expression. - An asynchronous computation that will enumerate the sequence and run body - for each element. - - - Creates an asynchronous computation that runs generator. - - A cancellation check is performed when the computation is executed. - The function to run. - An asynchronous computation that runs generator. - - - Creates an asynchronous computation that first runs computation1 - and then runs computation2, returning the result of computation2. - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of expression sequencing in the - async { ... } computation expression syntax. - The first part of the sequenced computation. - The second part of the sequenced computation. - An asynchronous computation that runs both of the computations sequentially. - - - Creates an asynchronous computation that runs computation, and when - computation generates a result T, runs binder res. - - A cancellation check is performed when the computation is executed. - - The existence of this method permits the use of let! in the - async { ... } computation expression syntax. - The computation to provide an unbound result. - The function to bind the result of computation. - An asynchronous computation that performs a monadic bind on the result - of computation. - - - - Generate an object used to build asynchronous computations using F# computation expressions. The value - 'async' is a pre-defined instance of this type. - - A cancellation check is performed when the computation is executed. - - - - The type of the async operator, used to build workflows for asynchronous computations. - - - Sends a reply to a PostAndReply message. - The value to send. - - - A handle to a capability to reply to a PostAndReply message. - - - A compositional asynchronous computation, which, when run, will eventually produce a value - of type T, or else raises an exception. - - Asynchronous computations are normally specified using an F# computation expression. - - When run, asynchronous computations have two modes: as a work item (executing synchronous - code), or as a wait item (waiting for an event or I/O completion). - - When run, asynchronous computations can be governed by CancellationToken. This can usually - be specified when the async computation is started. The associated CancellationTokenSource - may be used to cancel the asynchronous computation. Asynchronous computations built using - computation expressions can check the cancellation condition regularly. Synchronous - computations within an asynchronous computation do not automatically check this condition. - - - Publishes the event as a first class event value. - - - Triggers the event using the given parameters. - The parameters for the event. - - - Creates an event object suitable for implementing an arbitrary type of delegate. - The event object. - - - Event implementations for an arbitrary type of delegate. - - - Publishes an observation as a first class value. - - - Triggers an observation using the given parameters. - The event parameters. - - - Creates an observable object. - The created event. - - - Event implementations for the IEvent<_> type. - - - Publishes the event as a first class event value. - - - Triggers the event using the given sender object and parameters. The sender object may be null. - The object triggering the event. - The parameters for the event. - - - Creates an event object suitable for delegate types following the standard .NET Framework convention of a first 'sender' argument. - The created event. - - - Event implementations for a delegate types following the standard .NET Framework convention of a first 'sender' argument. - - - - - - A delegate type associated with the F# event type IEvent<_> - The object that fired the event. - The event arguments. - - - Remove a listener delegate from an event listener store. - The delegate to be removed from the event listener store. - - - Connect a handler delegate object to the event. A handler can - be later removed using RemoveHandler. The listener will - be invoked when the event is fired. - A delegate to be invoked when the event is fired. - - - First class event values for arbitrary delegate types. - - F# gives special status to member properties compatible with type IDelegateEvent and - tagged with the CLIEventAttribute. In this case the F# compiler generates approriate - CLI metadata to make the member appear to other CLI languages as a CLI event. - - - First-class listening points (i.e. objects that permit you to register a callback - activated when the event is triggered). - - - First class event values for CLI events conforming to CLI Framework standards. - - - The type of delayed computations. - - Use the values in the Lazy module to manipulate - values of this type, and the notation lazy expr to create values - of type . - - - Raises a timeout exception if a message not received in this amount of time. By default - no timeout is used. - - - Occurs when the execution of the agent results in an exception. - - - Occurs when the execution of the agent results in an exception. - - - Raises a timeout exception if a message not received in this amount of time. By default - no timeout is used. - - - Returns the number of unprocessed messages in the message queue of the agent. - - - Occurs when the execution of the agent results in an exception. - - - Scans for a message by looking through messages in arrival order until scanner - returns a Some value. Other messages remain in the queue. - - This method is for use within the body of the agent. For each agent, at most - one concurrent reader may be active, so no more than one concurrent call to - Receive, TryReceive, Scan and/or TryScan may be active. - The function to return None if the message is to be skipped - or Some if the message is to be processed and removed from the queue. - An optional timeout in milliseconds. Defaults to -1 which corresponds - to System.Threading.Timeout.Infinite. - An asynchronous computation that scanner built off the read message. - - - Waits for a message. This will consume the first message in arrival order. - - This method is for use within the body of the agent. - - Returns None if a timeout is given and the timeout is exceeded. - - This method is for use within the body of the agent. For each agent, at most - one concurrent reader may be active, so no more than one concurrent call to - Receive, TryReceive, Scan and/or TryScan may be active. - An optional timeout in milliseconds. Defaults to -1 which - corresponds to System.Threading.Timeout.Infinite. - An asynchronous computation that returns the received message or - None if the timeout is exceeded. - - - Like PostAndReply, but returns None if no reply within the timeout period. - The function to incorporate the AsyncReplyChannel into - the message to be sent. - An optional timeout parameter (in milliseconds) to wait for a reply message. - Defaults to -1 which corresponds to System.Threading.Timeout.Infinite. - The reply from the agent or None if the timeout expires. - - - Starts the agent. - - - Creates and starts an agent. The body function is used to generate the asynchronous - computation executed by the agent. - The function to produce an asynchronous computation that will be executed - as the read loop for the MailboxProcessor when Start is called. - An optional cancellation token for the body. - Defaults to Async.DefaultCancellationToken. - The created MailboxProcessor. - - - Scans for a message by looking through messages in arrival order until scanner - returns a Some value. Other messages remain in the queue. - - Returns None if a timeout is given and the timeout is exceeded. - - This method is for use within the body of the agent. For each agent, at most - one concurrent reader may be active, so no more than one concurrent call to - Receive, TryReceive, Scan and/or TryScan may be active. - The function to return None if the message is to be skipped - or Some if the message is to be processed and removed from the queue. - An optional timeout in milliseconds. Defaults to -1 which corresponds - to System.Threading.Timeout.Infinite. - An asynchronous computation that scanner built off the read message. - Thrown when the timeout is exceeded. - - - Waits for a message. This will consume the first message in arrival order. - - This method is for use within the body of the agent. - - This method is for use within the body of the agent. For each agent, at most - one concurrent reader may be active, so no more than one concurrent call to - Receive, TryReceive, Scan and/or TryScan may be active. - An optional timeout in milliseconds. Defaults to -1 which corresponds - to System.Threading.Timeout.Infinite. - An asynchronous computation that returns the received message. - Thrown when the timeout is exceeded. - - - Like AsyncPostAndReply, but returns None if no reply within the timeout period. - The function to incorporate the AsyncReplyChannel into - the message to be sent. - An optional timeout parameter (in milliseconds) to wait for a reply message. - Defaults to -1 which corresponds to System.Threading.Timeout.Infinite. - An asynchronous computation that will return the reply or None if the timeout expires. - - - Posts a message to an agent and await a reply on the channel, synchronously. - - The message is generated by applying buildMessage to a new reply channel - to be incorporated into the message. The receiving agent must process this - message and invoke the Reply method on this reply channel precisely once. - The function to incorporate the AsyncReplyChannel into - the message to be sent. - An optional timeout parameter (in milliseconds) to wait for a reply message. - Defaults to -1 which corresponds to System.Threading.Timeout.Infinite. - The reply from the agent. - - - Posts a message to an agent and await a reply on the channel, asynchronously. - - The message is generated by applying buildMessage to a new reply channel - to be incorporated into the message. The receiving agent must process this - message and invoke the Reply method on this reply channel precisely once. - The function to incorporate the AsyncReplyChannel into - the message to be sent. - An optional timeout parameter (in milliseconds) to wait for a reply message. - Defaults to -1 which corresponds to System.Threading.Timeout.Infinite. - An asychronous computation that will wait for the reply from the agent. - - - Posts a message to the message queue of the MailboxProcessor, asynchronously. - The message to post. - - - Creates an agent. The body function is used to generate the asynchronous - computation executed by the agent. This function is not executed until - Start is called. - The function to produce an asynchronous computation that will be executed - as the read loop for the MailboxProcessor when Start is called. - An optional cancellation token for the body. - Defaults to Async.DefaultCancellationToken. - The created MailboxProcessor. - - - A message-processing agent which executes an asynchronous computation. - - The agent encapsulates a message queue that supports multiple-writers and - a single reader agent. Writers send messages to the agent by using the Post - method and its variations. - - The agent may wait for messages using the Receive or TryReceive methods or - scan through all available messages using the Scan or TryScan method. - - - - - - Connects a listener function to the observable. The listener will - be invoked for each observation. The listener can be removed by - calling Dispose on the returned IDisposable object. - The function to be called for each observation. - An object that will remove the listener if disposed. - - - Permanently connects a listener function to the observable. The listener will - be invoked for each observation. - The function to be called for each observation. - - - Returns an asynchronous computation that will write the given bytes to the stream. - The buffer to write from. - An optional offset as a number of bytes in the stream. - An optional number of bytes to write to the stream. - An asynchronous computation that will write the given bytes to the stream. - Thrown when the sum of offset and count is longer than - the buffer length. - Thrown when offset or count is negative. - - - Returns an asynchronous computation that will read the given number of bytes from the stream. - The number of bytes to read. - An asynchronous computation that returns the read byte[] when run. - - - Returns an asynchronous computation that will read from the stream into the given buffer. - The buffer to read into. - An optional offset as a number of bytes in the stream. - An optional number of bytes to read from the stream. - An asynchronous computation that will read from the stream into the given buffer. - Thrown when the sum of offset and count is longer than - the buffer length. - Thrown when offset or count is negative. - - - A module of extension members providing asynchronous operations for some basic CLI types related to concurrency and I/O. - - - Returns a new event that triggers on the second and subsequent triggerings of the input event. - The Nth triggering of the input event passes the arguments from the N-1th and Nth triggering as - a pair. The argument passed to the N-1th triggering is held in hidden internal state until the - Nth triggering occurs. - The input event. - An event that triggers on pairs of consecutive values passed from the source event. - - - Runs the given function each time the given event is triggered. - The function to call when the event is triggered. - The input event. - - - Returns a new event consisting of the results of applying the given accumulating function - to successive values triggered on the input event. An item of internal state - records the current value of the state parameter. The internal state is not locked during the - execution of the accumulation function, so care should be taken that the - input IEvent not triggered by multiple threads simultaneously. - The function to update the state with each event value. - The initial state. - The input event. - An event that fires on the updated state values. - - - Returns a new event which fires on a selection of messages from the original event. - The selection function takes an original message to an optional new message. - The function to select and transform event values to pass on. - The input event. - An event that fires only when the chooser returns Some. - - - Returns a new event that listens to the original event and triggers the - first resulting event if the application of the function to the event arguments - returned a Choice1Of2, and the second event if it returns a Choice2Of2. - The function to transform event values into one of two types. - The input event. - A tuple of events. The first fires whenever splitter evaluates to Choice1of1 and - the second fires whenever splitter evaluates to Choice2of2. - - - Returns a new event that listens to the original event and triggers the - first resulting event if the application of the predicate to the event arguments - returned true, and the second event if it returned false. - The function to determine which output event to trigger. - The input event. - A tuple of events. The first is triggered when the predicate evaluates to true - and the second when the predicate evaluates to false. - - - Returns a new event that listens to the original event and triggers the resulting - event only when the argument to the event passes the given function. - The function to determine which triggers from the event to propagate. - The input event. - An event that only passes values that pass the predicate. - - - Returns a new event that passes values transformed by the given function. - The function to transform event values. - The input event. - An event that passes the transformed values. - - - Fires the output event when either of the input events fire. - The first input event. - The second input event. - An event that fires when either of the input events fire. - - - - - - Forces the execution of this value and return its result. Same as Value. Mutual exclusion is used to - prevent other threads also computing the value. - The value of the Lazy object. - - - Creates a lazy computation that evaluates to the given value when forced. - The input value. - The created Lazy object. - - - Creates a lazy computation that evaluates to the result of the given function when forced. - The function to provide the value when needed. - The created Lazy object. - - - Extensions related to Lazy values. - - - Returns a new observable that triggers on the second and subsequent triggerings of the input observable. - The Nth triggering of the input observable passes the arguments from the N-1th and Nth triggering as - a pair. The argument passed to the N-1th triggering is held in hidden internal state until the - Nth triggering occurs. - - For each observer, the registered intermediate observing object is not thread safe. - That is, observations arising from the source must not be triggered concurrently - on different threads. - The input Observable. - An Observable that triggers on successive pairs of observations from the input Observable. - - - Creates an observer which subscribes to the given observable and which calls - the given function for each observation. - The function to be called on each observation. - The input Observable. - An object that will remove the callback if disposed. - - - Creates an observer which permanently subscribes to the given observable and which calls - the given function for each observation. - The function to be called on each observation. - The input Observable. - - - Returns an observable which, for each observer, allocates an item of state - and applies the given accumulating function to successive values arising from - the input. The returned object will trigger observations for each computed - state value, excluding the initial value. The returned object propagates - all errors arising from the source and completes when the source completes. - - For each observer, the registered intermediate observing object is not thread safe. - That is, observations arising from the source must not be triggered concurrently - on different threads. - The function to update the state with each observation. - The initial state. - The input Observable. - An Observable that triggers on the updated state values. - - - Returns an observable which chooses a projection of observations from the source - using the given function. The returned object will trigger observations x - for which the splitter returns Some x. The returned object also propagates - all errors arising from the source and completes when the source completes. - The function that returns Some for observations to be propagated - and None for observations to ignore. - The input Observable. - An Observable that only propagates some of the observations from the source. - - - Returns two observables which split the observations of the source by the - given function. The first will trigger observations x for which the - splitter returns Choice1Of2 x. The second will trigger observations - y for which the splitter returns Choice2Of2 y The splitter is - executed once for each subscribed observer. Both also propagate error - observations arising from the source and each completes when the source - completes. - The function that takes an observation an transforms - it into one of the two output Choice types. - The input Observable. - A tuple of Observables. The first triggers when splitter returns Choice1of2 - and the second triggers when splitter returns Choice2of2. - - - Returns two observables which partition the observations of the source by - the given function. The first will trigger observations for those values - for which the predicate returns true. The second will trigger observations - for those values where the predicate returns false. The predicate is - executed once for each subscribed observer. Both also propagate all error - observations arising from the source and each completes when the source - completes. - The function to determine which output Observable will trigger - a particular observation. - The input Observable. - A tuple of Observables. The first triggers when the predicate returns true, and - the second triggers when the predicate returns false. - - - Returns an observable which filters the observations of the source - by the given function. The observable will see only those observations - for which the predicate returns true. The predicate is executed once for - each subscribed observer. The returned object also propagates error - observations arising from the source and completes when the source completes. - The function to apply to observations to determine if it should - be kept. - The input Observable. - An Observable that filters observations based on filter. - - - Returns an observable which transforms the observations of the source by the - given function. The transformation function is executed once for each - subscribed observer. The returned object also propagates error observations - arising from the source and completes when the source completes. - The function applied to observations from the source. - The input Observable. - An Observable of the type specified by mapping. - - - Returns an observable for the merged observations from the sources. - The returned object propagates success and error values arising - from either source and completes when both the sources have completed. - - For each observer, the registered intermediate observing object is not - thread safe. That is, observations arising from the sources must not - be triggered concurrently on different threads. - The first Observable. - The second Observable. - An Observable that propagates information from both sources. - - - Basic operations on first class event and other observable objects. - - - Returns an asynchronous computation that, when run, will wait for a response to the given WebRequest. - An asynchronous computation that waits for response to the WebRequest. - - - A module of extension members providing asynchronous operations for some basic Web operations. - - - Creates an instance of the attribute - AbstractClassAttribute - - - Adding this attribute to class definition makes it abstract, which means it need not - implement all its methods. Instances of abstract classes may not be constructed directly. - - - Creates an instance of the attribute - AllowNullLiteralAttribute - - - Adding this attribute to a type lets the 'null' literal be used for the type - within F# code. This attribute may only be added to F#-defined class or - interface types. - - - Indicates the namespace or module to be automatically opened when an assembly is referenced - or an enclosing module opened. - - - Creates an attribute used to mark a namespace or module path to be 'automatically opened' when an assembly is referenced - The namespace or module to be automatically opened when an assembly is referenced - or an enclosing module opened. - AutoOpenAttribute - - - Creates an attribute used to mark a module as 'automatically opened' when the enclosing namespace is opened - AutoOpenAttribute - - - This attribute is used for two purposes. When applied to an assembly, it must be given a string - argument, and this argument must indicate a valid module or namespace in that assembly. Source - code files compiled with a reference to this assembly are processed in an environment - where the given path is automatically opened. - - When applied to a module within an assembly, then the attribute must not be given any arguments. - When the enclosing namespace is opened in user source code, the module is also implicitly opened. - - - The value of the attribute, indicating whether the type is automatically marked serializable or not - - - Creates an instance of the attribute - Indicates whether the type should be serializable by default. - AutoSerializableAttribute - - - Adding this attribute to a type with value 'false' disables the behaviour where F# makes the - type Serializable by default. - - - Creates an instance of the attribute - CLIEventAttribute - - - Adding this attribute to a property with event type causes it to be compiled with as a CLI - metadata event, through a syntactic translation to a pair of 'add_EventName' and - 'remove_EventName' methods. - - - Creates an instance of the attribute - CLIMutableAttribute - - - Adding this attribute to a record type causes it to be compiled to a CLI representation - with a default constructor with property getters and setters. - - - Choice 2 of 2 choices - - - Choice 1 of 2 choices - - - Helper types for active patterns with 2 choices. - - - Choice 3 of 3 choices - - - Choice 2 of 3 choices - - - Choice 1 of 3 choices - - - Helper types for active patterns with 3 choices. - - - Choice 4 of 4 choices - - - Choice 3 of 4 choices - - - Choice 2 of 4 choices - - - Choice 1 of 4 choices - - - Helper types for active patterns with 4 choices. - - - Choice 5 of 5 choices - - - Choice 4 of 5 choices - - - Choice 3 of 5 choices - - - Choice 2 of 5 choices - - - Choice 1 of 5 choices - - - Helper types for active patterns with 5 choices. - - - Choice 6 of 6 choices - - - Choice 5 of 6 choices - - - Choice 4 of 6 choices - - - Choice 3 of 6 choices - - - Choice 2 of 6 choices - - - Choice 1 of 6 choices - - - Helper types for active patterns with 6 choices. - - - Choice 7 of 7 choices - - - Choice 6 of 7 choices - - - Choice 5 of 7 choices - - - Choice 4 of 7 choices - - - Choice 3 of 7 choices - - - Choice 2 of 7 choices - - - Choice 1 of 7 choices - - - Helper types for active patterns with 7 choices. - - - Creates an instance of the attribute - ClassAttribute - - - Adding this attribute to a type causes it to be represented using a CLI class. - - - Creates an instance of the attribute - ComparisonConditionalOnAttribute - - - This attribute is used to indicate a generic container type satisfies the F# 'comparison' - constraint only if a generic argument also satisfies this constraint. For example, adding - this attribute to parameter 'T on a type definition C<'T> means that a type C<X> only supports - comparison if the type X also supports comparison and all other conditions for C<X> to support - comparison are also met. The type C<'T> can still be used with other type arguments, but a type such - as C<(int -> int)> will not support comparison because the type (int -> int) is an F# function type - and does not support comparison. - - This attribute will be ignored if it is used on the generic parameters of functions or methods. - - - Indicates the number of arguments in each argument group - - - Creates an instance of the attribute - Indicates the number of arguments in each argument group. - CompilationArgumentCountsAttribute - - - This attribute is generated automatically by the F# compiler to tag functions and members - that accept a partial application of some of their arguments and return a residual function - - - Indicates the variant number of the entity, if any, in a linear sequence of elements with F# source code - - - Indicates the relationship between the compiled entity and F# source code - - - Indicates the sequence number of the entity, if any, in a linear sequence of elements with F# source code - - - Creates an instance of the attribute - Indicates the type of source construct. - CompilationMappingAttribute - - - Creates an instance of the attribute - Indicates the type of source construct. - CompilationMappingAttribute - - - Creates an instance of the attribute - Indicates the type of source construct. - CompilationMappingAttribute - - - This attribute is inserted automatically by the F# compiler to tag types - and methods in the generated CLI code with flags indicating the correspondence - with original source constructs. It is used by the functions in the - Microsoft.FSharp.Reflection namespace to reverse-map compiled constructs to - their original forms. It is not intended for use from user code. - - - Indicates one or more adjustments to the compiled representation of an F# type or member - - - Creates an instance of the attribute - Indicates adjustments to the compiled representation of the type or member. - CompilationRepresentationAttribute - - - This attribute is used to adjust the runtime representation for a type. - For example, it may be used to note that the null representation - may be used for a type. This affects how some constructs are compiled. - - - Compile a property as a CLI event. - - - Permit the use of null as a representation for nullary discriminators in a discriminated union. - - - append 'Module' to the end of a module whose name clashes with a type name in the same namespace. - - - Compile a member as 'instance' even if null is used as a representation for this type. - - - Compile an instance member as 'static' . - - - No special compilation representation. - - - - - - Indicates one or more adjustments to the compiled representation of an F# type or member. - - - Indicates the name of the entity in F# source code - - - Creates an instance of the attribute - The name of the method in source. - CompilationSourceNameAttribute - - - This attribute is inserted automatically by the F# compiler to tag - methods which are given the 'CompiledName' attribute. It is not intended - for use from user code. - - - The name of the value as it appears in compiled code - - - Creates an instance of the attribute - The name to use in compiled code. - CompiledNameAttribute - - - Adding this attribute to a value or function definition in an F# module changes the name used - for the value in compiled CLI code. - - - Indicates if the construct should always be hidden in an editing environment. - - - Indicates if the message should indicate a compiler error. Error numbers less than - 10000 are considered reserved for use by the F# compiler and libraries. - - - Indicates the number associated with the message. - - - Indicates the warning message to be emitted when F# source code uses this construct - - - Indicates if the construct should always be hidden in an editing environment. - - - Indicates if the message should indicate a compiler error. Error numbers less than - 10000 are considered reserved for use by the F# compiler and libraries. - - - Creates an instance of the attribute. - - - Indicates that a message should be emitted when F# source code uses this construct. - - - Creates an instance of the attribute - CustomComparisonAttribute - - - Adding this attribute to a type indicates it is a type with a user-defined implementation of comparison. - - - Creates an instance of the attribute - CustomEqualityAttribute - - - Adding this attribute to a type indicates it is a type with a user-defined implementation of equality. - - - Indicates if the custom operation maintains the variable space of the query of computation expression through the use of a bind operation - - - Indicates if the custom operation maintains the variable space of the query of computation expression - - - Indicates the name used for the 'on' part of the custom query operator for join-like operators - - - Indicates if the custom operation is an operation similar to a zip in a sequence computation, supporting two inputs - - - Indicates if the custom operation is an operation similar to a join in a sequence computation, supporting two inputs and a correlation constraint - - - Indicates if the custom operation is an operation similar to a group join in a sequence computation, supporting two inputs and a correlation constraint, and generating a group - - - Indicates if the custom operation supports the use of 'into' immediately after the use of the operation in a query or other computation expression to consume the results of the operation - - - Get the name of the custom operation when used in a query or other computation expression - - - Indicates if the custom operation maintains the variable space of the query of computation expression through the use of a bind operation - - - Indicates if the custom operation maintains the variable space of the query of computation expression - - - Indicates the name used for the 'on' part of the custom query operator for join-like operators - - - Indicates if the custom operation is an operation similar to a zip in a sequence computation, supporting two inputs - - - Indicates if the custom operation is an operation similar to a join in a sequence computation, supporting two inputs and a correlation constraint - - - Indicates if the custom operation is an operation similar to a group join in a sequence computation, supporting two inputs and a correlation constraint, and generating a group - - - Indicates if the custom operation supports the use of 'into' immediately after the use of the operation in a query or other computation expression to consume the results of the operation - - - Creates an instance of the attribute - CustomOperationAttribute - - - - Indicates that a member on a computation builder type is a custom query operator, - and indicates the name of that operator. - - - - The value of the attribute, indicating whether the type has a default augmentation or not - - - Creates an instance of the attribute - Indicates whether to generate helper members on the CLI class representing a discriminated - union. - DefaultAugmentationAttribute - - - Adding this attribute to a discriminated union with value false - turns off the generation of standard helper member tester, constructor - and accessor members for the generated CLI class for that type. - - - Indicates if a constraint is asserted that the field type supports 'null' - - - Creates an instance of the attribute - Indicates whether to assert that the field type supports null. - DefaultValueAttribute - - - Creates an instance of the attribute - DefaultValueAttribute - - - Adding this attribute to a field declaration means that the field is - not initialized. During type checking a constraint is asserted that the field type supports 'null'. - If the 'check' value is false then the constraint is not asserted. - - - Creates an instance of the attribute - EntryPointAttribute - - - Adding this attribute to a function indicates it is the entrypoint for an application. - If this attribute is not specified for an EXE then the initialization implicit in the - module bindings in the last file in the compilation sequence are used as the entrypoint. - - - Creates an instance of the attribute - EqualityConditionalOnAttribute - - - This attribute is used to indicate a generic container type satisfies the F# 'equality' - constraint only if a generic argument also satisfies this constraint. For example, adding - this attribute to parameter 'T on a type definition C<'T> means that a type C<X> only supports - equality if the type X also supports equality and all other conditions for C<X> to support - equality are also met. The type C<'T> can still be used with other type arguments, but a type such - as C<(int -> int)> will not support equality because the type (int -> int) is an F# function type - and does not support equality. - - This attribute will be ignored if it is used on the generic parameters of functions or methods. - - - Indicates the warning message to be emitted when F# source code uses this construct - - - Creates an instance of the attribute - The warning message to be emitted when code uses this construct. - ExperimentalAttribute - - - This attribute is used to tag values that are part of an experimental library - feature. - - - Invoke an F# first class function value with two curried arguments. In some cases this - will result in a more efficient application than applying the arguments successively. - The input function. - The first arg. - The second arg. - The function result. - - - Invoke an F# first class function value with three curried arguments. In some cases this - will result in a more efficient application than applying the arguments successively. - The input function. - The first arg. - The second arg. - The third arg. - The function result. - - - Invoke an F# first class function value with four curried arguments. In some cases this - will result in a more efficient application than applying the arguments successively. - The input function. - The first arg. - The second arg. - The third arg. - The fourth arg. - The function result. - - - Invoke an F# first class function value with five curried arguments. In some cases this - will result in a more efficient application than applying the arguments successively. - The input function. - The first arg. - The second arg. - The third arg. - The fourth arg. - The fifth arg. - The function result. - - - Invoke an F# first class function value with one argument - - 'U - - - Construct an instance of an F# first class function value - The created F# function. - - - The CLI type used to represent F# function values. This type is not - typically used directly, though may be used from other CLI languages. - - - The release number of the F# version associated with the attribute - - - The minor version number of the F# version associated with the attribute - - - The major version number of the F# version associated with the attribute - - - Creates an instance of the attribute - The major version number. - The minor version number. - The release number. - FSharpInterfaceDataVersionAttribute - - - This attribute is added to generated assemblies to indicate the - version of the data schema used to encode additional F# - specific information in the resource attached to compiled F# libraries. - - - Specialize the type function at a given type - The specialized type. - - - Construct an instance of an F# first class type function value - FSharpTypeFunc - - - The CLI type used to represent F# first-class type function values. This type is for use - by compiled F# code. - - - Type of a formatting expression. - Function type generated by printf. - Type argument passed to %a formatters - Value generated by the overall printf action (e.g. sprint generates a string) - Value generated after post processing (e.g. failwithf generates a string internally then raises an exception) - - - Type of a formatting expression. - Function type generated by printf. - Type argument passed to %a formatters - Value generated by the overall printf action (e.g. sprint generates a string) - Value generated after post processing (e.g. failwithf generates a string internally then raises an exception) - Tuple of values generated by scan or match. - - - Convert the given Action delegate object to an F# function value - The input action. - The F# function. - - - A utility function to convert function values from tupled to curried form - The input tupled function. - The output curried function. - - - A utility function to convert function values from tupled to curried form - The input tupled function. - The output curried function. - - - A utility function to convert function values from tupled to curried form - The input tupled function. - The output curried function. - - - A utility function to convert function values from tupled to curried form - The input tupled function. - The output curried function. - - - Helper functions for converting F# first class function values to and from CLI representaions - of functions using delegates. - - - Creates an instance of the attribute - GeneralizableValueAttribute - - - Adding this attribute to a non-function value with generic parameters indicates that - uses of the construct can give rise to generic code through type inference. - - - Creates an instance of the attribute - InterfaceAttribute - - - Adding this attribute to a type causes it to be represented using a CLI interface. - - - Creates an instance of the attribute - LiteralAttribute - - - Adding this attribute to a value causes it to be compiled as a CLI constant literal. - - - Creates an instance of the attribute - MeasureAnnotatedAbbreviationAttribute - - - Adding this attribute to a type causes it to be interpreted as a refined type, currently limited to measure-parameterized types. - This may only be used under very limited conditions. - - - Creates an instance of the attribute - MeasureAttribute - - - Adding this attribute to a type causes it to be interpreted as a unit of measure. - This may only be used under very limited conditions. - - - Creates an instance of the attribute - NoComparisonAttribute - - - Adding this attribute to a type indicates it is a type where comparison is an abnormal operation. - This means that the type does not satisfy the F# 'comparison' constraint. Within the bounds of the - F# type system, this helps ensure that the F# generic comparison function is not instantiated directly - at this type. The attribute and checking does not constrain the use of comparison with base or child - types of this type. - - - Creates an instance of the attribute - NoDynamicInvocationAttribute - - - This attribute is used to tag values that may not be dynamically invoked at runtime. This is - typically added to inlined functions whose implementations include unverifiable code. It - causes the method body emitted for the inlined function to raise an exception if - dynamically invoked, rather than including the unverifiable code in the generated - assembly. - - - Creates an instance of the attribute - NoEqualityAttribute - - - Adding this attribute to a type indicates it is a type where equality is an abnormal operation. - This means that the type does not satisfy the F# 'equality' constraint. Within the bounds of the - F# type system, this helps ensure that the F# generic equality function is not instantiated directly - at this type. The attribute and checking does not constrain the use of comparison with base or child - types of this type. - - - The representation of "Value of type 'T" - The input value. - An option representing the value. - - - The representation of "No value" - - - Get the value of a 'Some' option. A NullReferenceException is raised if the option is 'None'. - - - Create an option value that is a 'None' value. - - - Return 'true' if the option is a 'Some' value. - - - Return 'true' if the option is a 'None' value. - - - Create an option value that is a 'Some' value. - The input value - An option representing the value. - - - The type of optional values. When used from other CLI languages the - empty option is the null value. - - Use the constructors Some and None to create values of this type. - Use the values in the Option module to manipulate values of this type, - or pattern match against the values directly. - - None values will appear as the value null to other CLI languages. - Instance methods on this type will appear as static methods to other CLI languages - due to the use of null as a value representation. - - - Creates an instance of the attribute - OptionalArgumentAttribute - - - This attribute is added automatically for all optional arguments. - - - The raw text of the format string. - - - Construct a format string - The input string. - The PrintfFormat containing the formatted result. - - - Type of a formatting expression. - Function type generated by printf. - Type argument passed to %a formatters - Value generated by the overall printf action (e.g. sprint generates a string) - Value generated after post processing (e.g. failwithf generates a string internally then raises an exception) - - - Construct a format string - The input string. - The created format string. - - - Type of a formatting expression. - Function type generated by printf. - Type argument passed to %a formatters - Value generated by the overall printf action (e.g. sprint generates a string) - Value generated after post processing (e.g. failwithf generates a string internally then raises an exception) - Tuple of values generated by scan or match. - - - Creates an instance of the attribute - ProjectionParameterAttribute - - - Indicates that, when a custom operator is used in a computation expression, - a parameter is automatically parameterized by the variable space of the computation expression - - - - The current value of the reference cell - - - - The current value of the reference cell - - - The current value of the reference cell - - - The type of mutable references. Use the functions [:=] and [!] to get and - set values of this type. - - - Creates an instance of the attribute - ReferenceEqualityAttribute - - - Adding this attribute to a record or union type disables the automatic generation - of overrides for 'System.Object.Equals(obj)', 'System.Object.GetHashCode()' - and 'System.IComparable' for the type. The type will by default use reference equality. - - - Creates an instance of the attribute - ReflectedDefinitionAttribute - - - Adding this attribute to the let-binding for the definition of a top-level - value makes the quotation expression that implements the value available - for use at runtime. - - - Creates an instance of the attribute - RequireQualifiedAccessAttribute - - - This attribute is used to indicate that references to the elements of a module, record or union - type require explicit qualified access. - - - Creates an instance of the attribute - RequiresExplicitTypeArgumentsAttribute - - - Adding this attribute to a type, value or member requires that - uses of the construct must explicitly instantiate any generic type parameters. - - - The value of the attribute, indicating whether the type is sealed or not. - - - Creates an instance of the attribute - Indicates whether the class is sealed. - SealedAttribute - - - Creates an instance of the attribute. - The created attribute. - - - Adding this attribute to class definition makes it sealed, which means it may not - be extended or implemented. - - - Indicates that the compiled entity had private or internal representation in F# source code. - - - The mask of values related to the kind of the compiled entity. - - - Indicates that the compiled entity is part of the representation of an F# value declaration. - - - Indicates that the compiled entity is part of the representation of an F# union case declaration. - - - Indicates that the compiled entity is part of the representation of an F# module declaration. - - - Indicates that the compiled entity is part of the representation of an F# closure. - - - Indicates that the compiled entity is part of the representation of an F# exception declaration. - - - Indicates that the compiled entity is part of the representation of an F# record or union case field declaration. - - - Indicates that the compiled entity is part of the representation of an F# class or other object type declaration. - - - Indicates that the compiled entity is part of the representation of an F# record type declaration. - - - Indicates that the compiled entity is part of the representation of an F# union type declaration. - - - Indicates that the compiled entity has no relationship to an element in F# source code. - - - - - - Indicates the relationship between a compiled entity in a CLI binary and an element in F# source code. - - - Creates an instance of the attribute - StructAttribute - - - Adding this attribute to a type causes it to be represented using a CLI struct. - - - Creates an instance of the attribute - StructuralComparisonAttribute - - - Adding this attribute to a record, union, exception, or struct type confirms the - automatic generation of implementations for 'System.IComparable' for the type. - - - Creates an instance of the attribute - StructuralEqualityAttribute - - - Adding this attribute to a record, union or struct type confirms the automatic - generation of overrides for 'System.Object.Equals(obj)' and - 'System.Object.GetHashCode()' for the type. - - - Indicates the text to display by default when objects of this type are displayed - using '%A' printf formatting patterns and other two-dimensional text-based display - layouts. - - - Creates an instance of the attribute - Indicates the text to display when using the '%A' printf formatting. - StructuredFormatDisplayAttribute - - - 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 this version of F# the only valid values are of the form PreText {PropertyName} PostText. - The property name indicates a property to evaluate and to display instead of the object itself. - - - The type 'unit', which has only one value "()". This value is special and - always uses the representation 'null'. - - - Creates an instance of the attribute - UnverifiableAttribute - - - This attribute is used to tag values whose use will result in the generation - of unverifiable code. These values are inevitably marked 'inline' to ensure that - the unverifiable constructs are not present in the actual code for the F# library, - but are rather copied to the source code of the caller. - - - Creates an instance of the attribute - VolatileFieldAttribute - - - Adding this attribute to an F# mutable binding causes the "volatile" - prefix to be used for all accesses to the field. - - - Four dimensional arrays, typically zero-based. Non-zero-based arrays - can be created using methods on the System.Array type. - - Use the values in the Array4D module - to manipulate values of this type, or the notation arr.[x1,x2,x3,x4] to get and set array - values. - - - Three dimensional arrays, typically zero-based. Non-zero-based arrays - can be created using methods on the System.Array type. - - Use the values in the Array3D module - to manipulate values of this type, or the notation arr.[x1,x2,x3] to get and set array - values. - - - Two dimensional arrays, typically zero-based. - - Use the values in the Array2D module - to manipulate values of this type, or the notation arr.[x,y] to get/set array - values. - - Non-zero-based arrays can also be created using methods on the System.Array type. - - - Single dimensional, zero-based arrays, written int[], string[] etc. - Use the values in the Array module to manipulate values - of this type, or the notation arr.[x] to get/set array - values. - - - Single dimensional, zero-based arrays, written int[], string[] etc. - - Use the values in the Array module to manipulate values - of this type, or the notation arr.[x] to get/set array - values. - - - - - - An abbreviation for the CLI type System.Boolean. - - - Represents a managed pointer in F# code. - - - An abbreviation for the CLI type System.Byte. - - - An abbreviation for the CLI type System.Char. - - - An abbreviation for the CLI type System.Decimal. - - - The type of decimal numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.Decimal. - - - An abbreviation for the CLI type System.Double. - - - An abbreviation for the CLI type System.Exception. - - - An abbreviation for the CLI type System.Double. - - - An abbreviation for the CLI type System.Single. - - - The type of floating point numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.Single. - - - The type of floating point numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.Double. - - - This type is for internal use by the F# code generator. - - - An abbreviation for the CLI type System.Int32. - - - An abbreviation for the CLI type System.Int16. - - - The type of 16-bit signed integer numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.Int16. - - - An abbreviation for the CLI type System.Int32. - - - An abbreviation for the CLI type System.Int64. - - - The type of 64-bit signed integer numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.Int64. - - - An abbreviation for the CLI type System.SByte. - - - The type of 32-bit signed integer numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.Int32. - - - An abbreviation for the CLI type System.IntPtr. - - - Represents an unmanaged pointer in F# code. - - This type should only be used when writing F# code that interoperates - with native code. Use of this type in F# code may result in - unverifiable code being generated. Conversions to and from the - nativeint type may be required. Values of this type can be generated - by the functions in the NativeInterop.NativePtr module. - - - An abbreviation for the CLI type System.Object. - - - The type of optional values. When used from other CLI languages the - empty option is the null value. - - Use the constructors Some and None to create values of this type. - Use the values in the Option module to manipulate values of this type, - or pattern match against the values directly. - - 'None' values will appear as the value null to other CLI languages. - Instance methods on this type will appear as static methods to other CLI languages - due to the use of null as a value representation. - - - The type of mutable references. Use the functions [:=] and [!] to get and - set values of this type. - - - An abbreviation for the CLI type System.SByte. - - - The type of 8-bit signed integer numbers, annotated with a unit of measure. The unit - of measure is erased in compiled code and when values of this type - are analyzed using reflection. The type is representationally equivalent to - System.SByte. - - - An abbreviation for the CLI type System.Single. - - - An abbreviation for the CLI type System.String. - - - An abbreviation for the CLI type System.UInt16. - - - An abbreviation for the CLI type System.UInt32. - - - An abbreviation for the CLI type System.UInt64. - - - An abbreviation for the CLI type System.Byte. - - - An abbreviation for the CLI type System.UIntPtr. - - - The type 'unit', which has only one value "()". This value is special and - always uses the representation 'null'. - - - - - - - - - - - - Non-exhaustive match failures will raise the MatchFailureException exception - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - A new enumerator for the sequence. - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - A reference to the sequence. - - A 0, 1, and 2 respectively indicate Stop, Yield, and Goto conditions for the sequence generator. - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - A new sequence generator for the expression. - - - The F# compiler emits implementations of this type for compiled sequence expressions. - - - - Namespace name the provider injects types into. - - - - - Compilers call this method to query a type provider for a type name. - - Resolver should return a type called name in namespace NamespaceName or null if the type is unknown. - - - - - - The top-level types - - - - - - The sub-namespaces in this namespace. An optional member to prevent generation of namespaces until an outer namespace is explored. - - - - - - - - Triggered when an assumption changes that invalidates the resolutions so far reported by the provider - - - - - Triggered when an assumption changes that invalidates the resolutions so far reported by the provider - - - - - Triggered when an assumption changes that invalidates the resolutions so far reported by the provider - - - - - Get the static parameters for a provided type. - - A type returned by GetTypes or ResolveTypeName - - - - - Namespace name the this TypeProvider injects types into. - - - - - Called by the compiler to ask for an Expression tree to replace the given MethodBase with. - - MethodBase that was given to the compiler by a type returned by a GetType(s) call. - Expressions that represent the parameters to this call. - An expression that the compiler will use in place of the given method base. - - - - Get the physical contents of the given logical provided assembly. - - - - - Apply static arguments to a provided type that accepts static arguments. - - The provider must return a type with the given mangled name. - the provided type definition which has static parameters - the full path of the type, including encoded representations of static parameters - the static parameters, indexed by name - - - - - - - Represents the inverse of a measure expressions when returned as a generic argument of a provided type. - - - Represents the '1' measure expression when returned as a generic argument of a provided type. - - - Represents the product of two measure expressions when returned as a generic argument of a provided type. - - - - - - Creates an instance of the attribute - TypeProviderAssemblyAttribute - The name of the design-time assembly for this type provider. - - - Creates an instance of the attribute - TypeProviderAssemblyAttribute - - - Place attribute on runtime assembly to indicate that there is a corresponding design-time - assembly that contains a type provider. Runtime and designer assembly may be the same. - - - Creates an instance of the attribute - TypeProviderAttribute - - - Place on a class that implements ITypeProvider to extend the compiler - - - - Get the full path to use for temporary files for the type provider instance. - - - - - version of referenced system runtime assembly - - - - - Get the full path to referenced assembly that caused this type provider instance to be created. - - - - - Get the full path to use to resolve relative paths in any file name arguments given to the type provider instance. - - - - - Get the referenced assemblies for the type provider instance. - - - - - Indicates if the type provider host responds to invalidation events for type provider instances. - - - - - Indicates if the type provider instance is used in an environment which executes provided code such as F# Interactive. - - - - - Get the full path to use for temporary files for the type provider instance. - - - - - version of referenced system runtime assembly - - - - - Get the full path to referenced assembly that caused this type provider instance to be created. - - - - - Get the full path to use to resolve relative paths in any file name arguments given to the type provider instance. - - - - - Get the referenced assemblies for the type provider instance. - - - - - Indicates if the type provider host responds to invalidation events for type provider instances. - - - - - Indicates if the type provider instance is used in an environment which executes provided code such as F# Interactive. - - - - - Checks if given type exists in target system runtime library - - - - - - - - If the class that implements ITypeProvider has a constructor that accepts TypeProviderConfig - then it will be constructed with an instance of TypeProviderConfig. - - - - - - - - - - - - - - - - - - - - - - - - - - - - Creates an instance of the attribute - TypeProviderEditorHideMethodsAttribute - - - Indicates that a code editor should hide all System.Object methods from the intellisense menus for instances of a provided type - - - - - - - - - - - - Additional type attribute flags related to provided types - - - - - - Creates an instance of the attribute - TypeProviderXmlDocAttribute - - - - The TypeProviderXmlDocAttribute attribute can be added to types and members. - The language service will display the CommentText property from the attribute - in the appropriate place when the user hovers over a type or member. - - - - - - - - - - - - - - - - Creates an anonymous event with the given handlers. - - A function to handle adding a delegate for the event to trigger. - A function to handle removing a delegate that the event triggers. - A function to produce the delegate type the event can trigger. - - The initialized event. - - - The F# compiler emits calls to this function to implement the use operator for F# sequence - expressions. - - The resource to be used and disposed. - The input sequence. - - The result sequence. - - - The F# compiler emits calls to this function to implement the compiler-intrinsic - conversions from untyped System.Collections.IEnumerable sequences to typed sequences. - - An initializer function. - A function to iterate and test if end of sequence is reached. - A function to retrieve the current element. - - The resulting typed sequence. - - - The F# compiler emits calls to this function to - implement the try/finally operator for F# sequence expressions. - - The input sequence. - A computation to be included in an enumerator's Dispose method. - - The result sequence. - - - The F# compiler emits calls to this function to - implement the while operator for F# sequence expressions. - - A function that indicates whether iteration should continue. - The input sequence. - - The result sequence. - - - A group of functions used as part of the compiled representation of F# sequence expressions. - - - Builds a query using query syntax and operators. - - - An active pattern to force the execution of values of type Lazy<_>. - - - Special prefix operator for splicing untyped expressions into quotation holes. - - - Special prefix operator for splicing typed expressions into quotation holes. - - - Builds a 2D array from a sequence of sequences of elements. - - - Builds a read-only lookup table from a sequence of key/value pairs. The key objects are indexed using generic hashing and equality. - - - Converts the argument to signed byte. - This is a direct conversion for all - primitive numeric types. For strings, the input is converted using SByte.Parse() with InvariantCulture settings. - Otherwise the operation requires and invokes a ToSByte method on the input type. - - - Converts the argument to byte. - This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Byte.Parse() on strings and otherwise requires a ToByte method on the input type. - - - Converts the argument to 64-bit float. - This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Double.Parse() with InvariantCulture settings. Otherwise the operation requires and invokes a ToDouble method on the input type. - - - Converts the argument to 32-bit float. - This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Single.Parse() with InvariantCulture settings. Otherwise the operation requires and invokes a ToSingle method on the input type. - - - Builds an aysnchronous workflow using computation expression syntax. - - - Builds a set from a sequence of objects. The objects are indexed using generic comparison. - The input sequence of elements. - The created set. - - - Print to a file using the given format, and add a newline. - The file TextWriter. - The formatter. - The formatted result. - - - Print to a file using the given format. - The file TextWriter. - The formatter. - The formatted result. - - - Print to a string buffer and raise an exception with the given - result. Helper printers must return strings. - The formatter. - The formatted result. - - - Print to a string using the given format. - The formatter. - The formatted result. - - - - - - - - - - - - Divides a value by an integer. - The input value. - The input int. - The division result. - - - - - - Resolves to the value 'one' for any primitive numeric type or any type with a static member called 'One' - - - Resolves to the zero value for any primitive numeric type or any type with a static member called 'Zero' - - - A compiler intrinsic that implements dynamic invocations for the DivideByInt primitive. - - - A compiler intrinsic that implements dynamic invocations to the checked '*' operator. - - - A compiler intrinsic that implements dynamic invocations to the '*' operator. - - - A compiler intrinsic that implements dynamic invocations to the checked '+' operator. - - - A compiler intrinsic that implements dynamic invocations to the '+' operator. - - - Resolves to the value 'one' for any primitive numeric type or any type with a static member called 'One'. - - - Resolves to the zero value for any primitive numeric type or any type with a static member called 'Zero'. - - - Parse an uint64 according to the rules used by the overloaded 'uint64' conversion operator when applied to strings - The input string. - The parsed value. - - - Parse an int64 according to the rules used by the overloaded 'int64' conversion operator when applied to strings - The input string. - The parsed value. - - - Parse an uint32 according to the rules used by the overloaded 'uint32' conversion operator when applied to strings - The input string. - The parsed value. - - - Parse an int32 according to the rules used by the overloaded 'int32' conversion operator when applied to strings - The input string. - The parsed value. - - - Creates an sbyte value with units-of-measure - The input sbyte. - The sbyte with units-of-measure. - - - Creates an int16 value with units-of-measure - The input int16. - The int16 with units-of-measure. - - - Creates an int64 value with units-of-measure - The input int64. - The int64 with units of measure. - - - Creates an int32 value with units-of-measure - The input int. - The int with units of measure. - - - Creates a decimal value with units-of-measure - The input decimal. - The decimal with units of measure. - - - Creates a float32 value with units-of-measure - The input float. - The float with units-of-measure. - - - Creates a float value with units-of-measure - The input float. - The float with units-of-measure. - - - Get the underlying value for an enum value - The input enum. - The enumeration as a value. - - - Build an enum value from an underlying value - The input value. - The value as an enumeration. - - - Recursively hash a part of a value according to its structure. - The comparison function. - The input object. - The hashed value. - - - Hash a value according to its structure. Use the given limit to restrict the hash when hashing F# - records, lists and union types. - The limit on the number of nodes. - The input object. - The hashed value. - - - Hash a value according to its structure. This hash is not limited by an overall node count when hashing F# - records, lists and union types. - The input object. - The hashed value. - - - Make an F# hash/equality object for the given type using node-limited hashing when hashing F# - records, lists and union types. - The input limit on the number of nodes. - System.Collections.Generic.IEqualityComparer<'T> - - - Make an F# hash/equality object for the given type - - - Make an F# comparer object for the given type, where it can be null if System.Collections.Generic.Comparer<'T>.Default - - - Make an F# comparer object for the given type - - - A static F# comparer object - - - Return an F# comparer object suitable for hashing and equality. This hashing behaviour - of the returned comparer is not limited by an overall node count when hashing F# - records, lists and union types. This equality comparer has equivalence - relation semantics ([nan] = [nan]). - - - Return an F# comparer object suitable for hashing and equality. This hashing behaviour - of the returned comparer is not limited by an overall node count when hashing F# - records, lists and union types. - - - The physical hash. Hashes on the object identity, except for value types, - where we hash on the contents. - The input object. - The hashed value. - - - Reference/physical equality. - True if the inputs are reference-equal, false otherwise. - The first value. - The second value. - The result of the comparison. - - - Take the maximum of two values structurally according to the order given by GenericComparison - The first value. - The second value. - The maximum value. - - - Take the minimum of two values structurally according to the order given by GenericComparison - The first value. - The second value. - The minimum value. - - - Compare two values - The first value. - The second value. - The result of the comparison. - - - Compare two values - The first value. - The second value. - The result of the comparison. - - - Compare two values - The first value. - The second value. - The result of the comparison. - - - Compare two values - The first value. - The second value. - The result of the comparison. - - - Compare two values. May be called as a recursive case from an implementation of System.IComparable to - ensure consistent NaN comparison semantics. - The function to compare the values. - The first value. - The second value. - The result of the comparison. - - - Compare two values - The first value. - The second value. - The result of the comparison. - - - Compare two values for equality - - The first value. - The second value. - The result of the comparison. - - - Compare two values for equality using equivalence relation semantics ([nan] = [nan]) - The first value. - The second value. - The result of the comparison. - - - Compare two values for equality using partial equivalence relation semantics ([nan] <> [nan]) - The first value. - The second value. - The result of the comparison. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - A primitive entry point used by the F# compiler for optimization purposes. - - - The F# compiler emits calls to some of the functions in this module as part of the compiled form of some language constructs - - - - The standard overloaded associative (4-indexed) mutation operator - - - - The standard overloaded associative (3-indexed) mutation operator - - - The standard overloaded associative (2-indexed) mutation operator - - - The standard overloaded associative (indexed) mutation operator - - - The standard overloaded associative (4-indexed) lookup operator - - - The standard overloaded associative (3-indexed) lookup operator - - - The standard overloaded associative (2-indexed) lookup operator - - - The standard overloaded associative (indexed) lookup operator - - - A compiler intrinsic for checking initialization soundness of recursive bindings - - - A compiler intrinsic for checking initialization soundness of recursive static bindings - - - A compiler intrinsic for checking initialization soundness of recursive bindings - - - A compiler intrinsic for the efficient compilation of sequence expressions - - - This function implements parsing of decimal constants - - - This function implements calls to default constructors - acccessed by 'new' constraints. - - - Primitive used by pattern match compilation - - - A compiler intrinsic that implements the ':?' operator - - - A compiler intrinsic that implements the ':?' operator - - - A compiler intrinsic that implements the ':?>' operator - - - A compiler intrinsic that implements the ':?>' operator - - - The F# compiler emits calls to some of the functions in this module as part of the compiled form of some language constructs - - - Address-of. Uses of this value may result in the generation of unverifiable code. - The input object. - The unmanaged pointer. - - - Address-of. Uses of this value may result in the generation of unverifiable code. - The input object. - The managed pointer. - - - Binary 'or'. When used as a binary operator the right hand value is evaluated only on demand - The first value. - The second value. - The result of the operation. - - - Binary 'or'. When used as a binary operator the right hand value is evaluated only on demand. - - - Binary 'and'. When used as a binary operator the right hand value is evaluated only on demand - The first value. - The second value. - The result of the operation. - - - Binary 'and'. When used as a binary operator the right hand value is evaluated only on demand. - - - The F# compiler emits calls to some of the functions in this module as part of the compiled form of some language constructs - - - - - - - - - - - - - - - - - - For internal use only - - - Language primitives associated with the F# language - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - - Provides a default implementations of F# numeric literal syntax for literals fo the form 'dddI' - - - - An active pattern to match values of type System.Collections.Generic.KeyValuePair - The input key/value pair. - A tuple containing the key and value. - - - Converts the argument to character. Numeric inputs are converted according to the UTF-16 - encoding for characters. String inputs must be exactly one character long. For other - input types the operation requires an appropriate static conversion method on the input type. - The input value. - The converted char. - - - Converts the argument to System.Decimal using a direct conversion for all - primitive numeric types. For strings, the input is converted using UInt64.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted decimal. - - - Converts the argument to a string using ToString. - - For standard integer and floating point values the ToString conversion - uses CultureInfo.InvariantCulture. - The input value. - The converted string. - - - Converts the argument to unsigned native integer using a direct conversion for all - primitive numeric types. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted unativeint - - - Converts the argument to signed native integer. This is a direct conversion for all - primitive numeric types. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted nativeint - - - Converts the argument to 64-bit float. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Double.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted float - - - Converts the argument to 32-bit float. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Single.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted float32 - - - Converts the argument to unsigned 64-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using UInt64.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint64 - - - Converts the argument to signed 64-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Int64.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int64 - - - Converts the argument to unsigned 32-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using UInt32.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint32 - - - Converts the argument to signed 32-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Int32.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int32 - - - Converts the argument to a particular enum type. - The input value. - The converted enum type. - - - Converts the argument to signed 32-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Int32.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int - - - Converts the argument to unsigned 16-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using UInt16.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint16 - - - Converts the argument to signed 16-bit integer. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Int16.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int16 - - - Converts the argument to signed byte. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using SByte.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted sbyte - - - Converts the argument to byte. This is a direct conversion for all - primitive numeric types. For strings, the input is converted using Byte.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted byte - - - Overloaded power operator. If n > 0 then equivalent to x*...*x for n occurrences of x. - The input base. - The input exponent. - The base raised to the exponent. - - - Overloaded power operator. - The input base. - The input exponent. - The base raised to the exponent. - - - Hyperbolic tangent of the given number - The input value. - The hyperbolic tangent of the input. - - - Tangent of the given number - The input value. - The tangent of the input. - - - Hyperbolic sine of the given number - The input value. - The hyperbolic sine of the input. - - - Sine of the given number - The input value. - The sine of the input. - - - Hyperbolic cosine of the given number - The input value. - The hyperbolic cosine of the input. - - - Cosine of the given number - The input value. - The cosine of the input. - - - Square root of the given number - The input value. - The square root of the input. - - - Logarithm to base 10 of the given number - The input value. - The logarithm to base 10 of the input. - - - Natural logarithm of the given number - The input value. - The natural logarithm of the input. - - - Round the given number - The input value. - The nearest integer to the input value. - - - Sign of the given number - The input value. - -1, 0, or 1 depending on the sign of the input. - - - Floor of the given number - The input value. - The floor of the input. - - - Exponential of the given number - The input value. - The exponential of the input. - - - Ceiling of the given number - The input value. - The ceiling of the input. - - - Inverse tangent of x/y where x and y are specified separately - The y input value. - The x input value. - The inverse tangent of the input ratio. - - - Inverse tangent of the given number - The input value. - The inverse tangent of the input. - - - Inverse sine of the given number - The input value. - The inverse sine of the input. - - - Inverse cosine of the given number - The input value. - The inverse cosine of the input. - - - Absolute value of the given number. - The input value. - The absolute value of the input. - - - A generic hash function. This function has the same behaviour as 'hash', - however the default structural hashing for F# union, record and tuple - types stops when the given limit of nodes is reached. The exact behaviour of - the function can be adjusted on a type-by-type basis by implementing - GetHashCode for each type. - The limit of nodes. - The input object. - The computed hash. - - - A generic hash function, designed to return equal hash values for items that are - equal according to the "=" operator. By default it will use structural hashing - for F# union, record and tuple types, hashing the complete contents of the - type. The exact behaviour of the function can be adjusted on a - type-by-type basis by implementing GetHashCode for each type. - The input object. - The computed hash. - - - Returns the internal size of a type in bytes. For example, sizeof<int> returns 4. - - - Generate a System.Type representation for a type definition. If the - input type is a generic type instantiation then return the - generic type definition associated with all such instantiations. - - - An internal, library-only compiler intrinsic for compile-time - generation of a RuntimeMethodHandle. - - - Generate a System.Type runtime representation of a static type. - The static type is still maintained on the value returned. - - - Clean up resources associated with the input object after the completion of the given function. - Cleanup occurs even when an exception is raised by the protected - code. - The resource to be disposed after action is called. - The action that accepts the resource. - The resulting value. - - - Execute the function as a mutual-exclusion region using the input value as a lock. - The object to be locked. - The action to perform during the lock. - The resulting value. - - - The standard overloaded skip range operator, e.g. [n..skip..m] for lists, seq {n..skip..m} for sequences - The start value of the range. - The step value of the range. - The end value of the range. - The sequence spanning the range using the specified step size. - - - The standard overloaded range operator, e.g. [n..m] for lists, seq {n..m} for sequences - The start value of the range. - The end value of the range. - The sequence spanning the range. - - - Equivalent to System.Single.NaN - - - Equivalent to System.Single.PositiveInfinity - - - Equivalent to System.Double.NaN - - - Equivalent to System.Double.PositiveInfinity - - - Builds a sequence using sequence expression syntax - The input sequence. - The result sequence. - - - Negate a logical value. not true equals false and not false equals true - The value to negate. - The result of the negation. - - - Concatenate two lists. - The first list. - The second list. - The concatenation of the lists. - - - Increment a mutable reference cell containing an integer - The reference cell. - - - Decrement a mutable reference cell containing an integer - The reference cell. - - - Dereference a mutable reference cell - The cell to dereference. - The value contained in the cell. - - - Assign to a mutable reference cell - The cell to mutate. - The value to set inside the cell. - - - Create a mutable reference cell - The value to contain in the cell. - The created reference cell. - - - The identity function - The input value. - The same value. - - - Throw a System.InvalidOperationException exception - The exception message. - The result value. - - - Throw a System.ArgumentNullException exception - The argument name. - The result value. - - - Throw a System.ArgumentException exception with - the given argument name and message. - The argument name. - The exception message. - The result value. - - - Throw a System.Exception exception. - The exception message. - The result value. - - - Boxes a strongly typed value. - The value to box. - The boxed object. - - - Unboxes a strongly typed value. This is the inverse of box, unbox<t>(box<t> a) equals a. - The boxed value. - The unboxed result. - - - Ignore the passed value. This is often used to throw away results of a computation. - The value to ignore. - - - Minimum based on generic comparison - The first value. - The second value. - The minimum value. - - - Maximum based on generic comparison - The first value. - The second value. - The maximum value. - - - Generic comparison. - The first value. - The second value. - The result of the comparison. - - - Return the second element of a tuple, snd (a,b) = b. - The input tuple. - The second value. - - - Return the first element of a tuple, fst (a,b) = a. - The input tuple. - The first value. - - - Matches System.Exception objects whose runtime type is precisely System.Exception - The input exception. - A string option. - - - Builds a System.Exception object. - The message for the Exception. - A System.Exception. - - - Rethrows an exception. This should only be used when handling an exception - The result value. - - - Rethrows an exception. This should only be used when handling an exception - The result value. - - - Raises an exception - The exception to raise. - The result value. - - - Concatenate two strings. The operator '+' may also be used. - - - Used to specify a default value for an optional argument in the implementation of a function - An option representing the argument. - The default value of the argument. - The argument value. If it is None, the defaultValue is returned. - - - Apply a function to three values, the values being a triple on the right, the function on the left - The function. - The first argument. - The second argument. - The third argument. - The function result. - - - Apply a function to two values, the values being a pair on the right, the function on the left - The function. - The first argument. - The second argument. - The function result. - - - Apply a function to a value, the value being on the right, the function on the left - The function. - The argument. - The function result. - - - Apply a function to three values, the values being a triple on the left, the function on the right - The first argument. - The second argument. - The third argument. - The function. - The function result. - - - Apply a function to two values, the values being a pair on the left, the function on the right - The first argument. - The second argument. - The function. - The function result. - - - Apply a function to a value, the value being on the left, the function on the right - The argument. - The function. - The function result. - - - Compose two functions, the function on the right being applied first - The second function to apply. - The first function to apply. - The composition of the input functions. - - - Compose two functions, the function on the left being applied first - The first function to apply. - The second function to apply. - The composition of the input functions. - - - Structural inequality - The first parameter. - The second parameter. - The result of the comparison. - - - Structural equality - The first parameter. - The second parameter. - The result of the comparison. - - - Structural less-than-or-equal comparison - The first parameter. - The second parameter. - The result of the comparison. - - - Structural greater-than-or-equal - The first parameter. - The second parameter. - The result of the comparison. - - - Structural greater-than - The first parameter. - The second parameter. - The result of the comparison. - - - Structural less-than comparison - The first parameter. - The second parameter. - The result of the comparison. - - - Overloaded prefix-plus operator - The input value. - The result of the operation. - - - Overloaded bitwise-NOT operator - The input value. - The result of the operation. - - - Overloaded byte-shift right operator by a specified number of bits - The input value. - The amount to shift. - The result of the operation. - - - Overloaded byte-shift left operator by a specified number of bits - The input value. - The amount to shift. - The result of the operation. - - - Overloaded bitwise-XOR operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded bitwise-OR operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded bitwise-AND operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded modulo operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded division operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded multiplication operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded subtraction operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded addition operator - The first parameter. - The second parameter. - The result of the operation. - - - Overloaded unary negation. - The value to negate. - The result of the operation. - - - Converts the argument to char. Numeric inputs are converted using a checked - conversion according to the UTF-16 encoding for characters. String inputs must - be exactly one character long. For other input types the operation requires an - appropriate static conversion method on the input type. - The input value. - The converted char - - - Converts the argument to unativeint. This is a direct, checked conversion for all - primitive numeric types. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted unativeint - - - Converts the argument to nativeint. This is a direct, checked conversion for all - primitive numeric types. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted nativeint - - - Converts the argument to uint64. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.UInt64.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint64 - - - Converts the argument to int64. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.Int64.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int64 - - - Converts the argument to uint32. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.UInt32.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint32 - - - Converts the argument to int32. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.Int32.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int32 - - - Converts the argument to int. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.Int32.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int - - - Converts the argument to uint16. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.UInt16.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint16 - - - Converts the argument to int16. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.Int16.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int16 - - - Converts the argument to sbyte. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.SByte.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted sbyte - - - Converts the argument to byte. This is a direct, checked conversion for all - primitive numeric types. For strings, the input is converted using System.Byte.Parse() - with InvariantCulture settings. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted byte - - - Overloaded multiplication operator (checks for overflow) - The first value. - The second value. - The product of the two input values. - - - Overloaded addition operator (checks for overflow) - The first value. - The second value. - The sum of the two input values. - - - Overloaded subtraction operator (checks for overflow) - The first value. - The second value. - The first value minus the second value. - - - Overloaded unary negation (checks for overflow) - The input value. - The negated value. - - - This module contains the basic arithmetic operations with overflow checks. - - - Perform generic hashing on a value where the type of the value is not - statically required to satisfy the 'equality' constraint. - The computed hash value. - - - Perform generic equality on two values where the type of the values is not - statically required to satisfy the 'equality' constraint. - The result of the comparison. - - - Perform generic comparison on two values where the type of the values is not - statically required to have the 'comparison' constraint. - The result of the comparison. - - - Generate a default value for any type. This is null for reference types, - For structs, this is struct value where all fields have the default value. - This function is unsafe in the sense that some F# values do not have proper null values. - - - Unboxes a strongly typed value. This is the inverse of box, unbox<t>(box<t> a) equals a. - The boxed value. - The unboxed result. - - - This module contains basic operations which do not apply runtime and/or static checks - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'decimal' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'float' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'float32' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'unativeint' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'nativeint' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'uint64' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'int64' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'uint32' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'int32' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'uint16' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'int16' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'sbyte' - - - This is a library intrinsic. Calls to this function may be generated by uses of the generic 'pown' operator on values of type 'byte' - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - This is a library intrinsic. Calls to this function may be generated by evaluating quotations. - - - Generate a range of values using the given zero, add, start, step and stop values - - - Generate a range of values using the given zero, add, start, step and stop values - - - Generate a range of char values - - - Generate a range of byte values - - - Generate a range of sbyte values - - - Generate a range of uint16 values - - - Generate a range of int16 values - - - Generate a range of unativeint values - - - Generate a range of nativeint values - - - Generate a range of uint32 values - - - Generate a range of uint64 values - - - Generate a range of int64 values - - - Generate a range of float32 values - - - Generate a range of float values - - - Generate a range of integers - - - Gets a slice from a string - The source string. - The index of the first character of the slice. - The index of the last character of the slice. - The substring from the given indices. - - - Sets a slice of an array - The target array. - The start index of the first dimension. - The end index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The start index of the third dimension. - The end index of the third dimension. - The start index of the fourth dimension. - The end index of the fourth dimension. - The source array. - - - Gets a slice of an array - The source array. - The start index of the first dimension. - The end index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The start index of the third dimension. - The end index of the third dimension. - The start index of the fourth dimension. - The end index of the fourth dimension. - The four dimensional sub array from the given indices. - - - Sets a slice of an array - The target array. - The start index of the first dimension. - The end index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The start index of the third dimension. - The end index of the third dimension. - The source array. - - - Gets a slice of an array - The source array. - The start index of the first dimension. - The end index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The start index of the third dimension. - The end index of the third dimension. - The three dimensional sub array from the given indices. - - - Sets a vector slice of a 2D array. The index of the second dimension is fixed. - The target array. - The start index of the first dimension. - The end index of the first dimension. - The index of the second dimension. - The source array. - - - Sets a vector slice of a 2D array. The index of the first dimension is fixed. - The target array. - The index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The source array. - - - Sets a region slice of an array - The target array. - The start index of the first dimension. - The end index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The source array. - - - Gets a vector slice of a 2D array. The index of the second dimension is fixed. - The source array. - The start index of the first dimension. - The end index of the first dimension. - The fixed index of the second dimension. - The sub array from the input indices. - - - Gets a vector slice of a 2D array. The index of the first dimension is fixed. - The source array. - The index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The sub array from the input indices. - - - Gets a region slice of an array - The source array. - The start index of the first dimension. - The end index of the first dimension. - The start index of the second dimension. - The end index of the second dimension. - The two dimensional sub array from the input indices. - - - Sets a slice of an array - The target array. - The start index. - The end index. - The source array. - - - Gets a slice of an array - The input array. - The start index. - The end index. - The sub array from the input indices. - - - A module of compiler intrinsic functions for efficient implementations of F# integer ranges - and dynamic invocations of other F# operators - - - Basic F# Operators. This module is automatically opened in all F# code. - - - Invoke an F# first class function value that accepts five curried arguments - without intervening execution - The first arg. - The second arg. - The third arg. - The fourth arg. - The fifth arg. - The function result. - - - Adapt an F# first class function value to be an optimized function value that can - accept five curried arguments without intervening execution. - The input function. - The optimized function. - - - Construct an optimized function value that can accept five curried - arguments without intervening execution. - The optimized function. - - - The CLI type used to represent F# function values that accept five curried arguments - without intervening execution. This type should not typically used directly from - either F# code or from other CLI languages. - - - Invoke an F# first class function value that accepts four curried arguments - without intervening execution - The first arg. - The second arg. - The third arg. - The fourth arg. - The function result. - - - Adapt an F# first class function value to be an optimized function value that can - accept four curried arguments without intervening execution. - The input function. - The optimized function. - - - Construct an optimized function value that can accept four curried - arguments without intervening execution. - The optimized function. - - - The CLI type used to represent F# function values that accept four curried arguments - without intervening execution. This type should not typically used directly from - either F# code or from other CLI languages. - - - Invoke an F# first class function value that accepts three curried arguments - without intervening execution - The first arg. - The second arg. - The third arg. - The function result. - - - Adapt an F# first class function value to be an optimized function value that can - accept three curried arguments without intervening execution. - The input function. - The adapted function. - - - Construct an optimized function value that can accept three curried - arguments without intervening execution. - The optimized function. - - - The CLI type used to represent F# function values that accept - three iterated (curried) arguments without intervening execution. This type should not - typically used directly from either F# code or from other CLI languages. - - - Invoke the optimized function value with two curried arguments - The first arg. - The second arg. - The function result. - - - Adapt an F# first class function value to be an optimized function value that can - accept two curried arguments without intervening execution. - The input function. - The adapted function. - - - Construct an optimized function value that can accept two curried - arguments without intervening execution. - The optimized function. - - - The CLI type used to represent F# function values that accept - two iterated (curried) arguments without intervening execution. This type should not - typically used directly from either F# code or from other CLI languages. - - - An implementation module used to hold some private implementations of function - value invocation. - - - Convert the option to a list of length 0 or 1. - The input option. - The result list. - - - Convert the option to an array of length 0 or 1. - The input option. - The result array. - - - bind f inp evaluates to match inp with None -> None | Some x -> f x - A function that takes the value of type T from an option and transforms it into - an option containing a value of type U. - The input option. - An option of the output type of the binder. - - - map f inp evaluates to match inp with None -> None | Some x -> Some (f x). - A function to apply to the option value. - The input option. - An option of the input value after applying the mapping function, or None if the input is None. - - - iter f inp executes match inp with None -> () | Some x -> f x. - A function to apply to the option value. - The input option. - Unit if the option is None, otherwise it returns the result of applying the predicate - to the option value. - - - forall p inp evaluates to match inp with None -> true | Some x -> p x. - A function that evaluates to a boolean when given a value from the option type. - The input option. - True if the option is None, otherwise it returns the result of applying the predicate - to the option value. - - - exists p inp evaluates to match inp with None -> false | Some x -> p x. - A function that evaluates to a boolean when given a value from the option type. - The input option. - False if the option is None, otherwise it returns the result of applying the predicate - to the option value. - - - fold f inp s evaluates to match inp with None -> s | Some x -> f x s. - A function to update the state data when given a value from an option. - The input option. - The initial state. - The original state if the option is None, otherwise it returns the updated state with the folder - and the option value. - - - fold f s inp evaluates to match inp with None -> s | Some x -> f s x. - A function to update the state data when given a value from an option. - The initial state. - The input option. - The original state if the option is None, otherwise it returns the updated state with the folder - and the option value. - - - count inp evaluates to match inp with None -> 0 | Some _ -> 1. - The input option. - A zero if the option is None, a one otherwise. - - - Gets the value associated with the option. - The input option. - The value within the option. - Thrown when the option is None. - - - Returns true if the option is None. - The input option. - True if the option is None. - - - Returns true if the option is not None. - The input option. - True if the option is not None. - - - Basic operations on options. - - - Represents a statically-analyzed format associated with writing to a System.IO.TextWriter. The type parameter indicates the - arguments and return type of the format operation. - - - Represents a statically-analyzed format when formatting builds a string. The type parameter indicates the - arguments and return type of the format operation. - - - Represents a statically-analyzed format associated with writing to a System.Text.StringBuilder. The type parameter indicates the - arguments and return type of the format operation. - - - Represents a statically-analyzed format associated with writing to a System.IO.TextWriter. The first type parameter indicates the - arguments of the format operation and the last the overall return type. - - - Represents a statically-analyzed format when formatting builds a string. The first type parameter indicates the - arguments of the format operation and the last the overall return type. - - - Represents a statically-analyzed format associated with writing to a System.Text.StringBuilder. The first type parameter indicates the - arguments of the format operation and the last the overall return type. - - - Print to a string buffer and raise an exception with the given - result. Helper printers must return strings. - The input formatter. - The arguments of the formatter. - - - sprintf, but call the given 'final' function to generate the result. - See kprintf. - The function called to generate a result from the formatted string. - The input formatter. - The arguments of the formatter. - - - printf, but call the given 'final' function to generate the result. - For example, these let the printing force a flush after all output has - been entered onto the channel, but not before. - The function called after formatting to generate the format result. - The input formatter. - The arguments of the formatter. - - - fprintf, but call the given 'final' function to generate the result. - See kprintf. - The function called after formatting to generate the format result. - The input TextWriter. - The input formatter. - The arguments of the formatter. - - - bprintf, but call the given 'final' function to generate the result. - See kprintf. - The function called after formatting to generate the format result. - The input StringBuilder. - The input formatter. - The arguments of the formatter. - - - Print to a string via an internal string buffer and return - the result as a string. Helper printers must return strings. - The input formatter. - The formatted string. - - - Print to a text writer, adding a newline - The TextWriter to print to. - The input formatter. - The return type and arguments of the formatter. - - - Print to a text writer. - The TextWriter to print to. - The input formatter. - The return type and arguments of the formatter. - - - Print to a System.Text.StringBuilder - The StringBuilder to print to. - The input formatter. - The return type and arguments of the formatter. - - - Extensible printf-style formatting for numbers and other datatypes - - Format specifications are strings with "%" markers indicating format - placeholders. Format placeholders consist of: - - %[flags][width][.precision][type] - - where the type is interpreted as follows: - - %b: bool, formatted as "true" or "false" - %s: string, formatted as its unescaped contents - %c: character literal - %d, %i: any basic integer type formatted as a decimal integer, signed if the basic integer type is signed. - %u: any basic integer type formatted as an unsigned decimal integer - %x, %X, %o: any basic integer type formatted as an unsigned hexadecimal - (a-f)/Hexadecimal (A-F)/Octal integer - - %e, %E, %f, %F, %g, %G: - any basic floating point type (float,float32) formatted - using a C-style floating point format specifications, i.e - - %e, %E: Signed value having the form [-]d.dddde[sign]ddd where - d is a single decimal digit, dddd is one or more decimal - digits, ddd is exactly three decimal digits, and sign - is + or - - - %f: Signed value having the form [-]dddd.dddd, where dddd is one - or more decimal digits. The number of digits before the - decimal point depends on the magnitude of the number, and - the number of digits after the decimal point depends on - the requested precision. - - %g, %G: Signed value printed in f or e format, whichever is - more compact for the given value and precision. - - - %M: System.Decimal value - - %O: Any value, printed by boxing the object and using it's ToString method(s) - - %A: Any value, printed with the default layout settings - - %a: A general format specifier, requires two arguments: - (1) a function which accepts two arguments: - (a) a context parameter of the appropriate type for the - given formatting function (e.g. an #System.IO.TextWriter) - (b) a value to print - and which either outputs or returns appropriate text. - - (2) the particular value to print - - - %t: A general format specifier, requires one argument: - (1) a function which accepts a context parameter of the - appropriate type for the given formatting function (e.g. - an System.IO.TextWriter)and which either outputs or returns - appropriate text. - - Basic integer types are: - byte,sbyte,int16,uint16,int32,uint32,int64,uint64,nativeint,unativeint - Basic floating point types are: - float, float32 - - The optional width is an integer indicating the minimal width of the - result. For instance, %6d prints an integer, prefixing it with spaces - to fill at least 6 characters. If width is '*', then an extra integer - argument is taken to specify the corresponding width. - - any number - '*': - - Valid flags are: - - 0: add zeros instead of spaces to make up the required width - '-': left justify the result within the width specified - '+': add a '+' character if the number is positive (to match a '-' sign - for negatives) - ' ': add an extra space if the number is positive (to match a '-' - sign for negatives) - - The printf '#' flag is invalid and a compile-time error will be reported if it is used. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Returns the length of the string. - The input string. - The number of characters in the string. - - - Returns a string by concatenating count instances of str. - The number of copies of the input string will be copied. - The input string. - The concatenated string. - Thrown when count is negative. - - - Tests if any character of the string satisfies the given predicate. - The function to test each character of the string. - The input string. - True if any character returns true for the predicate and false otherwise. - - - Tests if all characters in the string satisfy the given predicate. - The function to test each character of the string. - The input string. - True if all characters return true for the predicate and false otherwise. - - - Builds a new string whose characters are the results of applying the function mapping - to each index from 0 to count-1 and concatenating the resulting - strings. - The number of strings to initialize. - The function to take an index and produce a string to - be concatenated with the others. - The constructed string. - Thrown when count is negative. - - - Builds a new string whose characters are the results of applying the function mapping - to each of the characters of the input string and concatenating the resulting - strings. - The function to produce a string from each character of the input string. - The input string. - The concatenated string. - - - Builds a new string whose characters are the results of applying the function mapping - to each character and index of the input string. - The function to apply to each character and index of the string. - The input string. - The resulting string. - - - Builds a new string whose characters are the results of applying the function mapping - to each of the characters of the input string. - The function to apply to the characters of the string. - The input string. - The resulting string. - - - Applies the function action to the index of each character in the string and the - character itself. - The function to apply to each character and index of the string. - The input string. - - - Applies the function action to each character in the string. - The function to be applied to each character of the string. - The input string. - - - Returns a new string made by concatenating the given strings - with separator sep, that is a1 + sep + ... + sep + aN. - The separator string to be inserted between the strings - of the input sequence. - The sequence of strings to be concatenated. - A new string consisting of the concatenated strings separated by - the separation string. - Thrown when strings is null. - - - Functional programming operators for string processing. Further string operations - are available via the member functions on strings and other functionality in - System.String - and System.Text.RegularExpressions types. - - - - The SI unit of catalytic activity - - - - - The SI unit of does equivalent - - - - - The SI unit of absorbed dose - - - - - The SI unit of activity referred to a radionuclide - - - - - The SI unit of illuminance - - - - - The SI unit of luminous flux - - - - - The SI unit of inductance - - - - - The SI unit of magnetic flux density - - - - - The SI unit of magnetic flux - - - - - The SI unit of electric conductance - - - - - The SI unit of electric resistance - - - - - The SI unit of capacitance - - - - - The SI unit of electric potential difference, electromotive force - - - - - The SI unit of electric charge, amount of electricity - - - - - The SI unit of power, radiant flux - - - - - The SI unit of energy, work, amount of heat - - - - - The SI unit of pressure, stress - - - - - The SI unit of force - - - - - The SI unit of frequency - - - - - The SI unit of luminous intensity - - - - - The SI unit of amount of substance - - - - - The SI unit of thermodynamic temperature - - - - - The SI unit of electric current - - - - - The SI unit of time - - - - - The SI unit of mass - - - - - The SI unit of length - - - - - The SI unit of length - - - - - A synonym for henry, the SI unit of inductance - - - - - A synonym for katal, the SI unit of catalytic activity - - - - - A synonym for sievert, the SI unit of does equivalent - - - - - A synonym for gray, the SI unit of absorbed dose - - - - - A synonym for becquerel, the SI unit of activity referred to a radionuclide - - - - - A synonym for lux, the SI unit of illuminance - - - - - A synonym for lumen, the SI unit of luminous flux - - - - - A synonym for tesla, the SI unit of magnetic flux density - - - - - A synonym for weber, the SI unit of magnetic flux - - - - - A synonym for UnitNames.ohm, the SI unit of electric resistance. - - - - - A synonym for siemens, the SI unit of electric conductance - - - - - A synonym for farad, the SI unit of capacitance - - - - - A synonym for volt, the SI unit of electric potential difference, electromotive force - - - - - A synonym for coulomb, the SI unit of electric charge, amount of electricity - - - - - A synonym for watt, the SI unit of power, radiant flux - - - - - A synonym for joule, the SI unit of energy, work, amount of heat - - - - - A synonym for pascal, the SI unit of pressure, stress - - - - - A synonym for newton, the SI unit of force - - - - - A synonym for hertz, the SI unit of frequency - - - - - A synonym for candela, the SI unit of luminous intensity - - - - - A synonym for mole, the SI unit of amount of substance - - - - - A synonym for kelvin, the SI unit of thermodynamic temperature - - - - - A synonym for ampere, the SI unit of electric current - - - - - A synonym for second, the SI unit of time - - - - - A synonym for kilogram, the SI unit of mass - - - - - A synonym for Metre, the SI unit of length - - - - - A method used to support the F# query syntax. Returns an empty sequence that has the specified type argument. - - - - - A method used to support the F# query syntax. Returns a sequence that contains the specified values. - - - - - A method used to support the F# query syntax. Returns a sequence of length one that contains the specified value. - - - - A query operator that selects those elements based on a specified predicate. - - - - A query operator that performs a subsequent ordering of the elements selected so far in descending order by the given nullable sorting key. - This operator may only be used immediately after a 'sortBy', 'sortByDescending', 'thenBy' or 'thenByDescending', or their nullable variants. - - - - A query operator that performs a subsequent ordering of the elements selected so far in ascending order by the given nullable sorting key. - This operator may only be used immediately after a 'sortBy', 'sortByDescending', 'thenBy' or 'thenByDescending', or their nullable variants. - - - - A query operator that performs a subsequent ordering of the elements selected so far in descending order by the given sorting key. - This operator may only be used immediately after a 'sortBy', 'sortByDescending', 'thenBy' or 'thenByDescending', or their nullable variants. - - - - A query operator that performs a subsequent ordering of the elements selected so far in ascending order by the given sorting key. - This operator may only be used immediately after a 'sortBy', 'sortByDescending', 'thenBy' or 'thenByDescending', or their nullable variants. - - - - A query operator that selects elements from a sequence as long as a specified condition is true, and then skips the remaining elements. - - - - A query operator that selects a specified number of contiguous elements from those selected so far. - - - - A query operator that selects a nullable value for each element selected so far and returns the sum of these values. - If any nullable does not have a value, it is ignored. - - - - A query operator that selects a value for each element selected so far and returns the sum of these values. - - - - - A method used to support the F# query syntax. Inputs to queries are implicitly wrapped by a call to one of the overloads of this method. - - - - - A method used to support the F# query syntax. Inputs to queries are implicitly wrapped by a call to one of the overloads of this method. - - - - A query operator that sorts the elements selected so far in descending order by the given nullable sorting key. - - - - A query operator that sorts the elements selected so far in ascending order by the given nullable sorting key. - - - - A query operator that sorts the elements selected so far in descending order by the given sorting key. - - - - A query operator that sorts the elements selected so far in ascending order by the given sorting key. - - - - A query operator that bypasses elements in a sequence as long as a specified condition is true and then selects the remaining elements. - - - - A query operator that bypasses a specified number of the elements selected so far and selects the remaining elements. - - - - A query operator that projects each of the elements selected so far. - - - - - - - - - - - - - - A method used to support the F# query syntax. Runs the given quotation as a query using LINQ IQueryable rules. - - - - - A method used to support the F# query syntax. Indicates that the query should be passed as a quotation to the Run method. - - - - A query operator that selects the element at a specified index amongst those selected so far. - - - - A query operator that selects a nullable value for each element selected so far and returns the minimum of these values. - If any nullable does not have a value, it is ignored. - - - - A query operator that selects a value for each element selected so far and returns the minimum resulting value. - - - - A query operator that selects a nullable value for each element selected so far and returns the maximum of these values. - If any nullable does not have a value, it is ignored. - - - - A query operator that selects a value for each element selected so far and returns the maximum resulting value. - - - - A query operator that correlates two sets of selected values based on matching keys and groups the results. - If any group is empty, a group with a single default value is used instead. - Normal usage is 'leftOuterJoin y in elements2 on (key1 = key2) into group'. - - - - A query operator that selects the last element of those selected so far, or a default value if no element is found. - - - - A query operator that selects the last element of those selected so far. - - - - A query operator that correlates two sets of selected values based on matching keys. - Normal usage is 'join y in elements2 on (key1 = key2)'. - - - - A query operator that selects the first element of those selected so far, or a default value if the sequence contains no elements. - - - - A query operator that selects the first element from those selected so far. - - - - A query operator that selects a value for each element selected so far and groups the elements by the given key. - - - - A query operator that correlates two sets of selected values based on matching keys and groups the results. - Normal usage is 'groupJoin y in elements2 on (key1 = key2) into group'. - - - - A query operator that groups the elements selected so far according to a specified key selector. - - - - - A method used to support the F# query syntax. Projects each element of a sequence to another sequence and combines the resulting sequences into one sequence. - - - - A query operator that selects the first element selected so far that satisfies a specified condition. - - - - A query operator that determines whether any element selected so far satisfies a condition. - - - - A query operator that selects the single, specific element of those selected so far, or a default value if that element is not found. - - - - A query operator that selects the single, specific element selected so far - - - - A query operator that selects distinct elements from the elements selected so far. - - - - A query operator that returns the number of selected elements. - - - - A query operator that determines whether the selected elements contains a specified element. - - - - A query operator that selects a nullable value for each element selected so far and returns the average of these values. - If any nullable does not have a value, it is ignored. - - - - A query operator that selects a value for each element selected so far and returns the average of these values. - - - - A query operator that determines whether all elements selected so far satisfies a condition. - - - - Create an instance of this builder. Use 'query { ... }' to use the query syntax. - - - - The type used to support the F# query syntax. Use 'query { ... }' to use the query syntax. - - - - - A property used to support the F# query syntax. - - - - - A method used to support the F# query syntax. - - - - - A partial input or result in an F# query. This type is used to support the F# query syntax. - - - - Converts the argument to character. Numeric inputs are converted according to the UTF-16 - encoding for characters. The operation requires an appropriate static conversion method on the input type. - The input value. - The converted char. - - - Converts the argument to System.Decimal using a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted decimal. - - - Converts the argument to unsigned native integer using a direct conversion for all - primitive numeric types. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted unativeint - - - Converts the argument to signed native integer. This is a direct conversion for all - primitive numeric types. Otherwise the operation requires an appropriate - static conversion method on the input type. - The input value. - The converted nativeint - - - Converts the argument to 64-bit float. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted float - - - Converts the argument to 32-bit float. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted float32 - - - Converts the argument to unsigned 64-bit integer. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint64 - - - Converts the argument to signed 64-bit integer. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int64 - - - Converts the argument to unsigned 32-bit integer. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint32 - - - Converts the argument to signed 32-bit integer. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int32 - - - Converts the argument to a particular enum type. - The input value. - The converted enum type. - - - Converts the argument to signed 32-bit integer. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int - - - Converts the argument to unsigned 16-bit integer. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted uint16 - - - Converts the argument to signed 16-bit integer. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted int16 - - - Converts the argument to signed byte. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted sbyte - - - Converts the argument to byte. This is a direct conversion for all - primitive numeric types. The operation requires an appropriate - static conversion method on the input type. - The input value. - The converted byte - - - - Functions for converting nullable values - - - - - The division operator where a nullable value appears on both left and right sides - - - - - The division operator where a nullable value appears on the right - - - - - The division operator where a nullable value appears on the left - - - - - The modulus operator where a nullable value appears on both left and right sides - - - - - The modulus operator where a nullable value appears on the right - - - - - The modulus operator where a nullable value appears on the left - - - - - The multiplication operator where a nullable value appears on both left and right sides - - - - - The multiplication operator where a nullable value appears on the right - - - - - The multiplication operator where a nullable value appears on the left - - - - - The subtraction operator where a nullable value appears on both left and right sides - - - - - The subtraction operator where a nullable value appears on the right - - - - - The subtraction operator where a nullable value appears on the left - - - - - The addition operator where a nullable value appears on both left and right sides - - - - - The addition operator where a nullable value appears on the right - - - - - The addition operator where a nullable value appears on the left - - - - - The '<>' operator where a nullable value appears on both left and right sides - - - - - The '=' operator where a nullable value appears on both left and right sides - - - - - The '<' operator where a nullable value appears on both left and right sides - - - - - The '<=' operator where a nullable value appears on both left and right sides - - - - - The '>' operator where a nullable value appears on both left and right sides - - - - - The '>=' operator where a nullable value appears on both left and right sides - - - - - The '<>' operator where a nullable value appears on the right - - - - - The '=' operator where a nullable value appears on the right - - - - - The '<' operator where a nullable value appears on the right - - - - - The '<=' operator where a nullable value appears on the right - - - - - The '>' operator where a nullable value appears on the right - - - - - The '>=' operator where a nullable value appears on the right - - - - - The '<>' operator where a nullable value appears on the left - - - - - The '=' operator where a nullable value appears on the left - - - - - The '<' operator where a nullable value appears on the left - - - - - The '<=' operator where a nullable value appears on the left - - - - - The '>' operator where a nullable value appears on the left - - - - - The '>=' operator where a nullable value appears on the left - - - - - Operators for working with nullable values - - - - - A method used to support the F# query syntax. Runs the given quotation as a query using LINQ IEnumerable rules. - - - - - - - - A method used to support the F# query syntax. Runs the given quotation as a query using LINQ rules. - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - This type shouldn't be used directly from user code. - - - - - - - - - - - - - - - - - - - - - - - A type used to reconstruct a grouping after applying a mutable->immutable mapping transformation - on a result of a query. - - - - - - - - - - - - - - - - - - - - The generic MethodInfo for Select function - Describes how we got from productions of immutable objects to productions of anonymous objects, with enough information - that we can invert the process in final query results. - - - - - - - - Given the expression part of a "yield" or "select" which produces a result in terms of immutable tuples or immutable records, - generate an equivalent expression yielding anonymous objects. Also return the conversion for the immutable-to-mutable correspondence - so we can reverse this later. - - - - - Simplify gets of tuples and gets of record fields. - - - - - Cleanup the use of property-set object constructions in leaf expressions that form parts of F# queries. - - - - - - - - Given an type involving immutable tuples and records, logically corresponding to the type produced at a - "yield" or "select", convert it to a type involving anonymous objects according to the conversion data. - - - - - - - - - - - - - - - - - - - - Recognize anonymous type construction written using 'new AnonymousObject(<e1>, <e2>, ...)' - - - - - - - - - - - - - - - - - Recognize object construction written using 'new O(Prop1 = <e>, Prop2 = <e>, ...)' - - - - - Tests whether a list consists only of assignments of properties of the - given variable, null values (ignored) and ends by returning the given variable - (pattern returns only property assignments) - - - - - Recognize sequential series written as (... ((<e>; <e>); <e>); ...) - - - - - - - - - - - - - - - - - - - - - - - A runtime helper used to evaluate nested quotation literals. - - - - - Evaluates a subset of F# quotations by first converting to a LINQ expression, for the subset of LINQ expressions represented by the - expression syntax in the C# language. - - - - - Converts a subset of F# quotations to a LINQ expression, for the subset of LINQ expressions represented by the - expression syntax in the C# language. - - - - - Converts a subset of F# quotations to a LINQ expression, for the subset of LINQ expressions represented by the - expression syntax in the C# language. - - - - - When used in a quotation, this function indicates a specific conversion - should be performed when converting the quotation to a LINQ expression. - - This function should not be called directly. - - - - - When used in a quotation, this function indicates a specific conversion - should be performed when converting the quotation to a LINQ expression. - - This function should not be called directly. - - - - - When used in a quotation, this function indicates a specific conversion - should be performed when converting the quotation to a LINQ expression. - - This function should not be called directly. - - - - - - - Allocates a region of memory on the stack. - The number of objects of type T to allocate. - A typed pointer to the allocated memory. - - - Assigns the value into the memory location referenced by the typed native - pointer computed by adding index * sizeof<'T> to the given input pointer. - The input pointer. - The index by which to offset the pointer. - The value to assign. - - - Assigns the value into the memory location referenced by the given typed native pointer. - The input pointer. - The value to assign. - - - Dereferences the given typed native pointer. - The input pointer. - The value at the pointer address. - - - Dereferences the typed native pointer computed by adding index * sizeof<'T> to the - given input pointer. - The input pointer. - The index by which to offset the pointer. - The value at the pointer address. - - - Returns a typed native pointer by adding index * sizeof<'T> to the - given input pointer. - The input pointer. - The index by which to offset the pointer. - A typed pointer. - - - Returns a machine address for a given typed native pointer. - The input pointer. - The machine address. - - - Returns a typed native pointer for a given machine address. - The pointer address. - A typed pointer. - - - Contains operations on native pointers. Use of these operators may - result in the generation of unverifiable code. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Gets the raw expression associated with this type-carrying expression - - - Type-carrying quoted expressions. Expressions are generated either - by quotations in source text or programatically - - - Returns type of an expression. - - - Returns the custom attributes of an expression. - - - Builds an expression that represents a while loop - The predicate to control the loop iteration. - The body of the while loop. - The resulting expression. - - - Builds an expression that represents setting a mutable variable - The input variable. - The value to set. - The resulting expression. - - - Builds an expression that represents a variable - The input variable. - The resulting expression. - - - Builds an expression that represents a constant value - The typed value. - The resulting expression. - - - Builds an expression that represents a constant value of a particular type - The untyped object. - The type of the object. - The resulting expression. - - - Builds an expression that represents a test of a value is of a particular union case - The expression to test. - The description of the union case. - The resulting expression. - - - Builds an expression that represents a type test. - The expression to test. - The target type. - The resulting expression. - - - Builds an expression that represents getting a field of a tuple - The input tuple. - The index of the tuple element to get. - The resulting expression. - - - Builds an expression that represents a try/with construct for exception filtering and catching. - The body of the try expression. - - - The variable to bind to a caught exception. - The expression evaluated when an exception is caught. - The resulting expression. - - - Try and find a stored reflection definition for the given method. Stored reflection - definitions are added to an F# assembly through the use of the [<ReflectedDefinition>] attribute. - The description of the method to find. - The reflection definition or None if a match could not be found. - - - Builds an expression that represents a try/finally construct - The body of the try expression. - The final part of the expression to be evaluated. - The resulting expression. - - - Format the expression as a string - Indicates if method, property, constructor and type objects should be printed in detail. If false, these are abbreviated to their name. - The formatted string. - - - Substitutes through the given expression using the given functions - to map variables to new values. The functions must give consistent results - at each application. Variable renaming may occur on the target expression - if variable capture occurs. - The function to map variables into expressions. - The expression with the given substitutions. - - - Builds an expression that represents the sequential execution of one expression followed by another - The first expression. - The second expression. - The resulting expression. - - - Permits interactive environments such as F# Interactive - to explicitly register new pickled resources that represent persisted - top level definitions. The string indicates a unique name for the resources - being added. The format for the bytes is the encoding generated by the F# compiler. - The assembly associated with the resource. - The unique name for the resources being added. - The serialized resource to register with the environment. - - - Builds an expression that represents a nested quotation literal - The expression being quoted. - The resulting expression. - - - Builds an expression that represents writing to a static property - The description of the property. - The value to set. - List of indices for the property if it is an indexed property. - The resulting expression. - - - Builds an expression that represents writing to a property of an object - The input object. - The description of the property. - The value to set. - List of indices for the property if it is an indexed property. - The resulting expression. - - - Builds an expression that represents reading a static property - The description of the property. - List of indices for the property if it is an indexed property. - The resulting expression. - - - Builds an expression that represents reading a property of an object - The input object. - The description of the property. - List of indices for the property if it is an indexed property. - The resulting expression. - - - Builds an expression that represents the creation of a union case value - The description of the union case. - The list of arguments for the case. - The resulting expression. - - - Builds an expression that represents the creation of an F# tuple value - The list of elements of the tuple. - The resulting expression. - - - Builds record-construction expressions - The type of record. - The list of elements of the record. - The resulting expression. - - - Builds an expression that represents the invocation of an object constructor - The description of the constructor. - The list of arguments to the constructor. - The resulting expression. - - - Builds an expression that represents the creation of a delegate value for the given type - The type of delegate. - The parameters for the delegate. - The body of the function. - The resulting expression. - - - Builds an expression that represents the creation of an array value initialized with the given elements - The type for the elements of the array. - The list of elements of the array. - The resulting expression. - - - Builds recursives expressions associated with 'let rec' constructs - The list of bindings for the let expression. - The sub-expression where the bindings are in scope. - The resulting expression. - - - Builds expressions associated with 'let' constructs - The variable in the let expression. - The expression bound to the variable. - The sub-expression where the binding is in scope. - The resulting expression. - - - Builds an expression that represents the constrution of an F# function value - The parameter to the function. - The body of the function. - The resulting expression. - - - Builds 'if ... then ... else' expressions. - The condition expression. - The then sub-expression. - The else sub-expression. - The resulting expression. - - - Fetches or creates a new variable with the given name and type from a global pool of shared variables - indexed by name and type. The type is given by the expicit or inferred type parameter - The variable name. - The created of fetched typed global variable. - - - Gets the free expression variables of an expression as a list. - A sequence of the free variables in the expression. - - - Builds a 'for i = ... to ... do ...' expression that represent loops over integer ranges - The sub-expression declaring the loop variable. - The sub-expression setting the initial value of the loop variable. - The sub-expression declaring the final value of the loop variable. - The sub-expression representing the body of the loop. - The resulting expression. - - - Builds an expression that represents writing to a field of an object - The input object. - The description of the field to write to. - The value to set to the field. - The resulting expression. - - - Builds an expression that represents writing to a static field - The description of the field to write to. - The value to the set to the field. - The resulting expression. - - - Builds an expression that represents the access of a field of an object - The input object. - The description of the field to access. - The resulting expression. - - - Builds an expression that represents the access of a static field - The description of the field to access. - The resulting expression. - - - - - - This function is called automatically when quotation syntax (<@ @>) and related typed-expression - quotations are used. The bytes are a pickled binary representation of an unlinked form of the quoted expression, - and the System.Type argument is any type in the assembly where the quoted - expression occurs, i.e. it helps scope the interpretation of the cross-assembly - references in the bytes. - A type in the assembly where the quotation occurs. - The list of spliced types. - The list of spliced expressions. - The serialized form of the quoted expression. - The resulting expression. - - - Builds an expression that represents the invocation of a default object constructor - The type on which the constructor is invoked. - The resulting expression. - - - Builds an expression that represents the coercion of an expression to a type - The expression to coerce. - The target type. - The resulting expression. - - - Returns a new typed expression given an underlying runtime-typed expression. - A type annotation is usually required to use this function, and - using an incorrect type annotation may result in a later runtime exception. - The expression to cast. - The resulting typed expression. - - - Builds an expression that represents a call to an instance method associated with an object - The input object. - The description of the method to call. - The list of arguments to the method. - The resulting expression. - - - Builds an expression that represents a call to an static method or module-bound function - The MethodInfo describing the method to call. - The list of arguments to the method. - The resulting expression. - - - Builds an expression that represents the application of a first class function value to multiple arguments - The function to apply. - The list of lists of arguments to the function. - The resulting expression. - - - Builds an expression that represents the application of a first class function value to a single argument. - The function to apply. - The argument to the function. - The resulting expression. - - - Builds an expression that represents setting the value held at a particular address. - The target expression. - The value to set at the address. - The resulting expression. - - - Builds an expression that represents getting the address of a value. - The target expression. - The resulting expression. - - - Quoted expressions annotated with System.Type values. - - - The type associated with the variable - - - The declared name of the variable - - - Indicates if the variable represents a mutable storage location - - - Fetches or create a new variable with the given name and type from a global pool of shared variables - indexed by name and type - The name of the variable. - The type associated with the variable. - The retrieved or created variable. - - - Creates a new variable with the given name, type and mutability - The declared name of the variable. - The type associated with the variable. - Indicates if the variable represents a mutable storage location. Default is false. - The created variable. - - - Information at the binding site of a variable - - - Re-build combination expressions. The first parameter should be an object - returned by the ShapeCombination case of the active pattern in this module. - The input shape. - The list of arguments. - The rebuilt expression. - - - An active pattern that performs a complete decomposition viewing the expression tree as a binding structure - The input expression. - The decomposed Var, Lambda, or ConstApp. - - - Active patterns for traversing, visiting, rebuilding and tranforming expressions in a generic way - - - An active pattern to recognize property setters that have an associated ReflectedDefinition - The description of the property. - The expression of the method definition if found, or None. - - - An active pattern to recognize property getters or values in modules that have an associated ReflectedDefinition - The description of the property. - The expression of the method definition if found, or None. - - - An active pattern to recognize methods that have an associated ReflectedDefinition - The description of the method. - The expression of the method definition if found, or None. - - - A parameterized active pattern to recognize calls to a specified function or method. - The returned elements are the optional target object (present if the target is an - instance method), the generic type instantation (non-empty if the target is a generic - instantiation), and the arguments to the function or method. - The input template expression to specify the method to call. - The optional target object (present if the target is an - instance method), the generic type instantation (non-empty if the target is a generic - instantiation), and the arguments to the function or method. - - - An active pattern to recognize constant unsigned int64 expressions - The input expression to match against. - uint64 option - - - An active pattern to recognize constant int64 expressions - The input expression to match against. - int64 option - - - An active pattern to recognize constant unsigned int32 expressions - The input expression to match against. - uint32 option - - - An active pattern to recognize constant int32 expressions - The input expression to match against. - int32 option - - - An active pattern to recognize constant unsigned int16 expressions - The input expression to match against. - uint16 option - - - An active pattern to recognize constant int16 expressions - The input expression to match against. - int16 option - - - An active pattern to recognize constant byte expressions - The input expression to match against. - byte option - - - An active pattern to recognize constant signed byte expressions - The input expression to match against. - sbyte option - - - An active pattern to recognize constant unicode character expressions - The input expression to match against. - char option - - - An active pattern to recognize constant 64-bit floating point number expressions - The input expression to match against. - float option - - - An active pattern to recognize constant 32-bit floating point number expressions - The input expression to match against. - float32 option - - - An active pattern to recognize constant string expressions - The input expression to match against. - string option - - - An active pattern to recognize constant boolean expressions - The input expression to match against. - bool option - - - An active pattern to recognize () constant expressions - The input expression to match against. - unit option - - - An active pattern to recognize expressions of the form a || b - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions of the form a && b - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions that represent the application of a (possibly curried or tupled) first class function value - The input expression to match against. - (Expr * Expr list list) option - - - An active pattern to recognize expressions that represent a (possibly curried or tupled) first class function value - The input expression to match against. - (Var list list * Expr) option - - - Contains a set of derived F# active patterns to analyze F# expression objects - - - An active pattern to recognize expressions that represent setting a mutable variable - The input expression to match against. - (Var * Expr) option - - - An active pattern to recognize expressions that represent a variable - The input expression to match against. - Var option - - - An active pattern to recognize expressions that represent a constant value - The input expression to match against. - (obj * Type) option - - - An active pattern to recognize expressions that represent a test if a value is of a particular union case - The input expression to match against. - (Expr * UnionCaseInfo) option - - - An active pattern to recognize expressions that represent a dynamic type test - The input expression to match against. - (Expr * Type) option - - - An active pattern to recognize expressions that represent getting a tuple field - The input expression to match against. - (Expr * int) option - - - An active pattern to recognize expressions that represent a try/finally construct - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions that represent a try/with construct for exception filtering and catching - The input expression to match against. - (Expr * Var * Expr * Var * Expr) option - - - An active pattern to recognize expressions that represent sequential exeuction of one expression followed by another - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions that represent a nested quotation literal - The input expression to match against. - Expr option - - - An active pattern to recognize expressions that represent setting a static or instance property, or a non-function value declared in a module - The input expression to match against. - (Expr option * PropertyInfo * Expr list * Expr) option - - - An active pattern to recognize expressions that represent the read of a static or instance property, or a non-function value declared in a module - The input expression to match against. - (Expr option * PropertyInfo * Expr list) option - - - An active pattern to recognize expressions that represent construction of tuple values - The input expression to match against. - (Expr list) option - - - An active pattern to recognize expressions that represent construction of particular union case values - The input expression to match against. - (UnionCaseInfo * Expr list) option - - - An active pattern to recognize expressions that represent construction of record values - The input expression to match against. - (Type * Expr list) option - - - An active pattern to recognize expressions that represent invocation of object constructors - The input expression to match against. - (ConstructorInfo * Expr list) option - - - An active pattern to recognize expressions that represent construction of delegate values - The input expression to match against. - (Type * Var list * Expr) option - - - An active pattern to recognize expressions that represent invocations of a default constructor of a struct - The input expression to match against. - Type option - - - An active pattern to recognize expressions that represent the construction of arrays - The input expression to match against. - (Type * Expr list) option - - - An active pattern to recognize expressions that represent recursive let bindings of one or more variables - The input expression to match against. - ((Var * Expr) list * Expr) option - - - An active pattern to recognize expressions that represent let bindings - The input expression to match against. - (Var * Expr * Expr) option - - - An active pattern to recognize expressions that represent first class function values - The input expression to match against. - (Var * Expr) option - - - An active pattern to recognize expressions that represent conditionals - The input expression to match against. - (Expr * Expr * Expr) option - - - An active pattern to recognize expressions that represent while loops - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions that represent loops over integer ranges - The input expression to match against. - (Var * Expr * Expr * Expr) option - - - An active pattern to recognize expressions that represent setting a static or instance field - The input expression to match against. - (Expr option * FieldInfo * Expr) option - - - An active pattern to recognize expressions that represent getting a static or instance field - The input expression to match against. - (Expr option * FieldInfo) option - - - An active pattern to recognize expressions that represent coercions from one type to another - The input expression to match against. - (Expr * Type) option - - - An active pattern to recognize expressions that represent calls to static and instance methods, and functions defined in modules - The input expression to match against. - (Expr option * MethodInfo * Expr list) option - - - An active pattern to recognize expressions that represent applications of first class function values - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions that represent setting the value held at an address - The input expression to match against. - (Expr * Expr) option - - - An active pattern to recognize expressions that represent getting the address of a value - The input expression to match against. - Expr option - - - Contains a set of primitive F# active patterns to analyze F# expression objects - - - Returns a System.Type representing an F# tuple type with the given element types - An array of types for the tuple elements. - The type representing the tuple containing the input elements. - - - Returns a System.Type representing the F# function type with the given domain and range - The input type of the function. - The output type of the function. - The function type with the given domain and range. - - - Returns true if the typ is a representation of an F# union type or the runtime type of a value of that type - The type to check. - Optional binding flags. - True if the type check succeeds. - - - Return true if the typ is a representation of an F# tuple type - The type to check. - True if the type check succeeds. - - - Return true if the typ is a representation of an F# record type - The type to check. - Optional binding flags. - True if the type check succeeds. - - - Return true if the typ is a System.Type value corresponding to the compiled form of an F# module - The type to check. - True if the type check succeeds. - - - Return true if the typ is a representation of an F# function type or the runtime type of a closure implementing an F# function type - The type to check. - True if the type check succeeds. - - - Returns true if the typ is a representation of an F# exception declaration - The type to check. - Optional binding flags. - True if the type check is an F# exception. - - - Gets the cases of a union type. - - Assumes the given type is a union type. If not, ArgumentException is raised during pre-computation. - The input union type. - Optional binding flags. - Thrown when the input type is not a union type. - An array of descriptions of the cases of the given union type. - - - Gets the tuple elements from the representation of an F# tuple type. - The input tuple type. - An array of the types contained in the given tuple type. - - - Reads all the fields from a record value, in declaration order - - Assumes the given input is a record value. If not, ArgumentException is raised. - The input record type. - Optional binding flags. - An array of descriptions of the properties of the record type. - - - Gets the domain and range types from an F# function type or from the runtime type of a closure implementing an F# type - The input function type. - A tuple of the domain and range types of the input function. - - - Reads all the fields from an F# exception declaration, in declaration order - - Assumes exceptionType is an exception representation type. If not, ArgumentException is raised. - The exception type to read. - Optional binding flags. - Thrown if the given type is not an exception. - An array containing the PropertyInfo of each field in the exception. - - - Contains operations associated with constructing and analyzing F# types such as records, unions and tuples - - - Assumes the given type is a union type. - If not, ArgumentException is raised during pre-computation. - - Using the computed function is more efficient than calling GetUnionCase - because the path executed by the computed function is optimized given the knowledge that it will be - used to read values of the given type. - The type of union to optimize reading. - Optional binding flags. - An optimized function to read the tags of the given union type. - - - Precompute a property or static method for reading an integer representing the case tag of a union type. - The type of union to read. - Optional binding flags. - The description of the union case reader. - - - Precomputes a function for reading all the fields for a particular discriminator case of a union type - - Using the computed function will typically be faster than executing a corresponding call to GetFields - The description of the union case to read. - Optional binding flags. - A function to for reading the fields of the given union case. - - - A method that constructs objects of the given case - The description of the union case. - Optional binding flags. - The description of the constructor of the given union case. - - - Precomputes a function for constructing a discriminated union value for a particular union case. - The description of the union case. - Optional binding flags. - A function for constructing values of the given union case. - - - Precomputes a function for reading the values of a particular tuple type - - Assumes the given type is a TupleType. - If not, ArgumentException is raised during pre-computation. - The tuple type to read. - Thrown when the given type is not a tuple type. - A function to read values of the given tuple type. - - - Gets information that indicates how to read a field of a tuple - The input tuple type. - The index of the tuple element to describe. - The description of the tuple element and an optional type and index if the tuple is big. - - - Gets a method that constructs objects of the given tuple type. - For small tuples, no additional type will be returned. - - For large tuples, an additional type is returned indicating that - a nested encoding has been used for the tuple type. In this case - the suffix portion of the tuple type has the given type and an - object of this type must be created and passed as the last argument - to the ConstructorInfo. A recursive call to PreComputeTupleConstructorInfo - can be used to determine the constructor for that the suffix type. - The input tuple type. - The description of the tuple type constructor and an optional extra type - for large tuples. - - - Precomputes a function for reading the values of a particular tuple type - - Assumes the given type is a TupleType. - If not, ArgumentException is raised during pre-computation. - The type of tuple to read. - Thrown when the given type is not a tuple type. - A function to read a particular tuple type. - - - Precompute a function for reading all the fields from a record. The fields are returned in the - same order as the fields reported by a call to Microsoft.FSharp.Reflection.Type.GetInfo for - this type. - - Assumes the given type is a RecordType. - If not, ArgumentException is raised during pre-computation. - - Using the computed function will typically be faster than executing a corresponding call to Value.GetInfo - because the path executed by the computed function is optimized given the knowledge that it will be - used to read values of the given type. - The type of record to read. - Optional binding flags. - Thrown when the input type is not a record type. - An optimized reader for the given record type. - - - Precompute a function for reading a particular field from a record. - Assumes the given type is a RecordType with a field of the given name. - If not, ArgumentException is raised during pre-computation. - - Using the computed function will typically be faster than executing a corresponding call to Value.GetInfo - because the path executed by the computed function is optimized given the knowledge that it will be - used to read values of the given type. - The PropertyInfo of the field to read. - Thrown when the input type is not a record type. - A function to read the specified field from the record. - - - Get a ConstructorInfo for a record type - The record type. - Optional binding flags. - A ConstructorInfo for the given record type. - - - Precompute a function for constructing a record value. - - Assumes the given type is a RecordType. - If not, ArgumentException is raised during pre-computation. - The type of record to construct. - Optional binding flags. - Thrown when the input type is not a record type. - A function to construct records of the given type. - - - Create a union case value. - The description of the union case to create. - The array of arguments to construct the given case. - Optional binding flags. - The constructed union case. - - - Creates an instance of a tuple type - - Assumes at least one element is given. If not, ArgumentException is raised. - The array of tuple fields. - The tuple type to create. - Thrown if no elements are given. - An instance of the tuple type with the given elements. - - - Creates an instance of a record type. - - Assumes the given input is a record type. - The type of record to make. - The array of values to initialize the record. - Optional binding flags for the record. - Thrown when the input type is not a record type. - The created record. - - - Builds a typed function from object from a dynamic function implementation - The function type of the implementation. - The untyped lambda of the function implementation. - A typed function from the given dynamic implementation. - - - Identify the union case and its fields for an object - - Assumes the given input is a union case value. If not, ArgumentException is raised. - - If the type is not given, then the runtime type of the input object is used to identify the - relevant union type. The type should always be given if the input object may be null. For example, - option values may be represented using the 'null'. - The input union case. - The union type containing the value. - Optional binding flags. - Thrown when the input type is not a union case value. - The description of the union case and its fields. - - - Reads all fields from a tuple. - - Assumes the given input is a tuple value. If not, ArgumentException is raised. - The input tuple. - Thrown when the input is not a tuple value. - An array of the fields from the given tuple. - - - Reads a field from a tuple value. - - Assumes the given input is a tuple value. If not, ArgumentException is raised. - The input tuple. - The index of the field to read. - The value of the field. - - - Reads all the fields from a record value. - - Assumes the given input is a record value. If not, ArgumentException is raised. - The record object. - Optional binding flags for the record. - Thrown when the input type is not a record type. - The array of fields from the record. - - - Reads a field from a record value. - - Assumes the given input is a record value. If not, ArgumentException is raised. - The record object. - The PropertyInfo describing the field to read. - Thrown when the input type is not a record type. - The field from the record. - - - Reads all the fields from a value built using an instance of an F# exception declaration - - Assumes the given input is an F# exception value. If not, ArgumentException is raised. - The exception instance. - Optional binding flags. - Thrown when the input type is not an F# exception. - The fields from the given exception. - - - Contains operations associated with constructing and analyzing values associated with F# types - such as records, unions and tuples. - - - The integer tag for the case. - - - The name of the case. - - - The type in which the case occurs. - - - The fields associated with the case, represented by a PropertyInfo. - The fields associated with the case. - - - Returns the custom attributes associated with the case matching the given attribute type. - The type of attributes to return. - An array of custom attributes. - - - Returns the custom attributes associated with the case. - An array of custom attributes. - - - Represents a case of a discriminated union type - - - Returns true if the typ is a representation of an F# exception declaration - The type to check. - Optional flag that denotes accessibility of the private representation. - True if the type check is an F# exception. - - - Reads all the fields from an F# exception declaration, in declaration order - - Assumes exceptionType is an exception representation type. If not, ArgumentException is raised. - The exception type to read. - Optional flag that denotes accessibility of the private representation. - Thrown if the given type is not an exception. - An array containing the PropertyInfo of each field in the exception. - - - Returns true if the typ is a representation of an F# union type or the runtime type of a value of that type - The type to check. - Optional flag that denotes accessibility of the private representation. - True if the type check succeeds. - - - Return true if the typ is a representation of an F# record type - The type to check. - Optional flag that denotes accessibility of the private representation. - True if the type check succeeds. - - - Gets the cases of a union type. - - Assumes the given type is a union type. If not, ArgumentException is raised during pre-computation. - The input union type. - Optional flag that denotes accessibility of the private representation. - Thrown when the input type is not a union type. - An array of descriptions of the cases of the given union type. - - - Reads all the fields from a record value, in declaration order - - Assumes the given input is a record value. If not, ArgumentException is raised. - The input record type. - Optional flag that denotes accessibility of the private representation. - An array of descriptions of the properties of the record type. - - - Reads all the fields from a value built using an instance of an F# exception declaration - - Assumes the given input is an F# exception value. If not, ArgumentException is raised. - The exception instance. - Optional flag that denotes accessibility of the private representation. - Thrown when the input type is not an F# exception. - The fields from the given exception. - - - A method that constructs objects of the given case - The description of the union case. - Optional flag that denotes accessibility of the private representation. - The description of the constructor of the given union case. - - - Precomputes a function for constructing a discriminated union value for a particular union case. - The description of the union case. - Optional flag that denotes accessibility of the private representation. - A function for constructing values of the given union case. - - - Precomputes a function for reading all the fields for a particular discriminator case of a union type - - Using the computed function will typically be faster than executing a corresponding call to GetFields - The description of the union case to read. - Optional flag that denotes accessibility of the private representation. - A function to for reading the fields of the given union case. - - - Precompute a property or static method for reading an integer representing the case tag of a union type. - The type of union to read. - Optional flag that denotes accessibility of the private representation. - The description of the union case reader. - - - Assumes the given type is a union type. - If not, ArgumentException is raised during pre-computation. - - Using the computed function is more efficient than calling GetUnionCase - because the path executed by the computed function is optimized given the knowledge that it will be - used to read values of the given type. - The type of union to optimize reading. - Optional flag that denotes accessibility of the private representation. - An optimized function to read the tags of the given union type. - - - Identify the union case and its fields for an object - - Assumes the given input is a union case value. If not, ArgumentException is raised. - - If the type is not given, then the runtime type of the input object is used to identify the - relevant union type. The type should always be given if the input object may be null. For example, - option values may be represented using the 'null'. - The input union case. - The union type containing the value. - Optional flag that denotes accessibility of the private representation. - Thrown when the input type is not a union case value. - The description of the union case and its fields. - - - Create a union case value. - The description of the union case to create. - The array of arguments to construct the given case. - Optional flag that denotes accessibility of the private representation. - The constructed union case. - - - Get a ConstructorInfo for a record type - The record type. - Optional flag that denotes accessibility of the private representation. - A ConstructorInfo for the given record type. - - - Precompute a function for constructing a record value. - - Assumes the given type is a RecordType. - If not, ArgumentException is raised during pre-computation. - The type of record to construct. - Optional flag that denotes accessibility of the private representation. - Thrown when the input type is not a record type. - A function to construct records of the given type. - - - Precompute a function for reading all the fields from a record. The fields are returned in the - same order as the fields reported by a call to Microsoft.FSharp.Reflection.Type.GetInfo for - this type. - - Assumes the given type is a RecordType. - If not, ArgumentException is raised during pre-computation. - - Using the computed function will typically be faster than executing a corresponding call to Value.GetInfo - because the path executed by the computed function is optimized given the knowledge that it will be - used to read values of the given type. - The type of record to read. - Optional flag that denotes accessibility of the private representation. - Thrown when the input type is not a record type. - An optimized reader for the given record type. - - - Reads all the fields from a record value. - - Assumes the given input is a record value. If not, ArgumentException is raised. - The record object. - Optional flag that denotes accessibility of the private representation. - Thrown when the input type is not a record type. - The array of fields from the record. - - - Creates an instance of a record type. - - Assumes the given input is a record type. - The type of record to make. - The array of values to initialize the record. - Optional flags that denotes accessibility of the private representation. - Thrown when the input type is not a record type. - The created record. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - A record of options to control structural formatting. - For F# Interactive properties matching those of this value can be accessed via the 'fsi' - value. - - Floating Point format given in the same format accepted by System.Double.ToString, - e.g. f6 or g15. - - If ShowProperties is set the printing process will evaluate properties of the values being - displayed. This may cause additional computation. - - The ShowIEnumerable is set the printing process will force the evalution of IEnumerable objects - to a small, finite depth, as determined by the printing parameters. - This may lead to additional computation being performed during printing. - - <example> - From F# Interactive the default settings can be adjusted using, for example, - <pre> - open Microsoft.FSharp.Compiler.Interactive.Settings;; - setPrintWidth 120;; - </pre> - </example> - - - - - Data representing structured layouts of terms. - - - - - Convert any value to a layout using the given formatting options. The - layout can then be processed using formatting display engines such as - those in the LayoutOps module. any_to_string and output_any are - built using any_to_layout with default format options. - - - - - - - - Ouput any value to a channel using the same set of formatting rules - as any_to_string - - - - - Convert any value to a string using a standard formatter - Data is typically formatted in a structured format, e.g. - lists are formatted using the "[1;2]" notation. - The details of the format are not specified and may change - from version to version and according to the flags given - to the F# compiler. The format is intended to be human-readable, - not machine readable. If alternative generic formats are required - you should develop your own formatter, using the code in the - implementation of this file as a starting point. - - Data from other .NET languages is formatted using a virtual - call to Object.ToString() on the boxed version of the input. - - - - - - - - For limitting layout of list-like sequences (lists,arrays,etc). - unfold a list of items using (project and z) making layout list via itemL. - If reach maxLength (before exhausting) then truncate. - - - - - See tagL - - - - - Layout like an F# list. - - - - - Layout like an F# option. - - - - - Layout list vertically. - - - - - Layout two vertically. - - - - - Form tuple of layouts. - - - - - Wrap braces around layout. - - - - - Wrap square brackets around layout. - - - - - Wrap round brackets around Layout. - - - - - Join layouts into a list separated using the given Layout. - - - - - Join layouts into a semi-colon separated list. - - - - - Join layouts into a space separated list. - - - - - Join layouts into a comma separated list. - - - - - Join broken with ident=2 - - - - - Join broken with ident=1 - - - - - Join broken with ident=0 - - - - - Join, possible break with indent=2 - - - - - Join, possible break with indent=1 - - - - - Join, possible break with indent=0 - - - - - Join, unbreakable. - - - - - An string which is left parenthesis (no space on the right). - - - - - An string which is right parenthesis (no space on the left). - - - - - An string which requires no spaces either side. - - - - - An string leaf - - - - - An uninterpreted leaf, to be interpreted into a string - by the layout engine. This allows leaf layouts for numbers, strings and - other atoms to be customized according to culture. - - - - - Is it the empty layout? - - - - - The empty layout - - - - - A layout is a sequence of strings which have been joined together. - The strings are classified as words, separators and left and right parenthesis. - This classification determines where spaces are inserted. - A joint is either unbreakable, breakable or broken. - If a joint is broken the RHS layout occurs on the next line with optional indentation. - A layout can be squashed to for given width which forces breaks as required. - - - - Subscribe an observer to the source of results - The observer to be added to those that are notified. - An IDisposable to allow for unsubscription. - - - A source of observable results - - - Notify an observer of a new result - The value to notify observers. - - - Notify an observer of an error - The exception to notify observers. - - - Notify an observer that no more results will be produced. - - - A client that may be subscribed to observe the results from an IObservable. - - - diff --git a/packages/FSharp.Core/license.html b/packages/FSharp.Core/license.html deleted file mode 100644 index a029d82c..00000000 --- a/packages/FSharp.Core/license.html +++ /dev/null @@ -1,1541 +0,0 @@ - - - - - - - - - - - - - fsharp/LICENSE at master · fsharp/fsharp · GitHub - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Skip to content - - - - - - - - - - - - -
- -
-
- - -
-
-
- -
- -
- - - -

- - /fsharp - - - - - -

- -
-
-
- -
-
-
- - - -
- -
-

HTTPS clone URL

-
- - - - -
-
- - -
-

Subversion checkout URL

-
- - - - -
-
- - - -
You can clone with -
or
. - - - -
- - - - Download ZIP - -
-
-
- - - - - - - -
- -
- - Branch: - master - - - -
- -
- - - - -
- -
- fsharp/LICENSE -
-
- - -
-
- @shana - shana - -
- Clean source of the F# compiler r54075, based on the contents of the -
-
- -
-

- - 1 - contributor - -

- -
- -
- -
-
-
- -
- Raw - Blame - History -
- - - - -
- -
- 57 lines (29 sloc) - - 8.99 KB -
-
- - - -
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
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.
-
See FAQ for answers to frequently asked questions about this license.
-
- -
- -
- -Jump to Line - - -
-
-
-
-
- - -
- -
- -
- - - - - - - -
- - - Something went wrong with that request. Please try again. -
- - - - - - - - - - diff --git a/packages/FSharp.Core/package/services/metadata/core-properties/8f892edb52054d8cbb6b676af1a01d28.psmdcp b/packages/FSharp.Core/package/services/metadata/core-properties/8f892edb52054d8cbb6b676af1a01d28.psmdcp deleted file mode 100644 index 0078058e..00000000 --- a/packages/FSharp.Core/package/services/metadata/core-properties/8f892edb52054d8cbb6b676af1a01d28.psmdcp +++ /dev/null @@ -1,14 +0,0 @@ -F# Software FoundationFSharp.Core for F# 3.1 - - FSharp.Core redistributables from Visual F# 3.1.2 - - .NET 2.0 - .NET 4.0 - .NET Portable Profile 7 (portable-net45+netcore45) - .NET Portable Profile 47 (portable-net45+sl5+netcore45) - .NET Portable Profile 78 (portable-net45+netcore45+wp8) - .NET Portable Profile 259 (portable-net45+netcore45+wpa81+wp8) - - FSharp.Core built by F# Software Foundation - - MonoAndroid, MonoTouch, Xamarin.iOS (portable-net45+monoandroid10+monotouch10+xamarinios10)FSharp.Core3.1.2.5F#, FSharp, FSharp.CoreFSharp.Core for F# 3.1 \ No newline at end of file diff --git a/packages/TaskParallelLibrary/TaskParallelLibrary.1.0.2856.nupkg b/packages/TaskParallelLibrary/TaskParallelLibrary.1.0.2856.nupkg deleted file mode 100644 index bacb7313..00000000 Binary files a/packages/TaskParallelLibrary/TaskParallelLibrary.1.0.2856.nupkg and /dev/null differ diff --git a/packages/TaskParallelLibrary/TaskParallelLibrary.nuspec b/packages/TaskParallelLibrary/TaskParallelLibrary.nuspec deleted file mode 100644 index e3371758..00000000 --- a/packages/TaskParallelLibrary/TaskParallelLibrary.nuspec +++ /dev/null @@ -1,23 +0,0 @@ - - - - 1.0.2856.0 - Microsoft Corporation - Microsoft Corporation - http://go.microsoft.com/fwlink/?LinkID=186234 - http://msdn.microsoft.com/en-us/library/dd460717.aspx - http://i.msdn.microsoft.com/ee402630.NET_lg.png - TaskParallelLibrary - Task Parallel Library for .NET 3.5 - true - The package includes: -* Task<T> for executing asynchronous operations. -* Concurrent Collections such as ConcurrentStack, ConcurentQueue ad ConcurrentDictionary. -* PLINQ for writing parallel queries. -* additional Threading operations such as Barrier,SpinLock and SpinWait. - A complete and official Microsoft backport of the Task Parallel Library (TPL) for .NET 3.5. - This backport was shipped with the Reactive Extensions (Rx) library up until v1.0.2856.0. It can be downloaded from http://www.microsoft.com/download/en/details.aspx?id=24940 . - en-us - tpl plinq pfx task parallel extensions .net35 backport - - \ No newline at end of file diff --git a/packages/TaskParallelLibrary/[Content_Types].xml b/packages/TaskParallelLibrary/[Content_Types].xml deleted file mode 100644 index b29f4302..00000000 --- a/packages/TaskParallelLibrary/[Content_Types].xml +++ /dev/null @@ -1 +0,0 @@ - \ No newline at end of file diff --git a/packages/TaskParallelLibrary/_rels/.rels b/packages/TaskParallelLibrary/_rels/.rels deleted file mode 100644 index 699a239a..00000000 --- a/packages/TaskParallelLibrary/_rels/.rels +++ /dev/null @@ -1 +0,0 @@ - \ No newline at end of file diff --git a/packages/TaskParallelLibrary/lib/Net35/System.Threading.chm b/packages/TaskParallelLibrary/lib/Net35/System.Threading.chm deleted file mode 100644 index bdfbdef5..00000000 Binary files a/packages/TaskParallelLibrary/lib/Net35/System.Threading.chm and /dev/null differ diff --git a/packages/TaskParallelLibrary/lib/Net35/System.Threading.dll b/packages/TaskParallelLibrary/lib/Net35/System.Threading.dll deleted file mode 100644 index 0230d71d..00000000 Binary files a/packages/TaskParallelLibrary/lib/Net35/System.Threading.dll and /dev/null differ diff --git a/packages/TaskParallelLibrary/lib/Net35/System.Threading.xml b/packages/TaskParallelLibrary/lib/Net35/System.Threading.xml deleted file mode 100644 index 3aff7f63..00000000 --- a/packages/TaskParallelLibrary/lib/Net35/System.Threading.xml +++ /dev/null @@ -1,19811 +0,0 @@ - - - - System.Threading - - - - - A stub version of .NET 4.0 contracts. - - - - - A dummy class that implements GetResourceString. Environment.GetResourceString(string) is an internal - method in mscorlib.dll. - - - - - An interface similar to the one added in .NET 4.0. - - - - - .NET 4.0 Monitor class supports new overloads that return a boolean value - representing whether the lock was successfully taken or not. The return value - is meant to be accurate even in the presence of thread aborts. - - Monitor2 implements these methods as simple wrappers over the .NET 3.5 methods, - but without making the guarantees related to thread aborts. - - - - - This internal class from mscorlib.dll is used by ConcurrentDictionary. - - - - - OperationCanceledException is changing from .NET 3.5 to .NET 4.0. To make Parallel Extensions work, - we include the new version as OperationCanceledException2. - - - - - A convenience class for common platform-related logic. - - - - - Gets the number of available processors available to this process on the current machine. - - - - - A dummy replacement for the .NET 4.0 SecuritySafeCriticalAttribute. The dummy attribute makes the - code compile, but we are likely losing the ability to be called from a partial trust environment. - - - - - A dummy replacement for the .NET internal class StackCrawlMark. - - - - - Represents a thread-safe collection of keys and values. - - The type of the keys in the dictionary. - The type of the values in the dictionary. - - All public and protected members of are thread-safe and may be used - concurrently from multiple threads. - - - - - Initializes a new instance of the - class that is empty, has the default concurrency level, has the default initial capacity, and - uses the default comparer for the key type. - - - - - Initializes a new instance of the - class that is empty, has the specified concurrency level and capacity, and uses the default - comparer for the key type. - - The estimated number of threads that will update the - concurrently. - The initial number of elements that the - can contain. - is - less than 1. - is less than - 0. - - - - Initializes a new instance of the - class that contains elements copied from the specified , has the default concurrency - level, has the default initial capacity, and uses the default comparer for the key type. - - The whose elements are copied to - the new - . - is a null reference - (Nothing in Visual Basic). - contains one or more - duplicate keys. - - - - Initializes a new instance of the - class that is empty, has the specified concurrency level and capacity, and uses the specified - . - - The - implementation to use when comparing keys. - is a null reference - (Nothing in Visual Basic). - - - - Initializes a new instance of the - class that contains elements copied from the specified , has the default concurrency level, has the default - initial capacity, and uses the specified - . - - The whose elements are copied to - the new - . - The - implementation to use when comparing keys. - is a null reference - (Nothing in Visual Basic). -or- - is a null reference (Nothing in Visual Basic). - - - - - Initializes a new instance of the - class that contains elements copied from the specified , - has the specified concurrency level, has the specified initial capacity, and uses the specified - . - - The estimated number of threads that will update the - concurrently. - The whose elements are copied to the new - . - The implementation to use - when comparing keys. - - is a null reference (Nothing in Visual Basic). - -or- - is a null reference (Nothing in Visual Basic). - - - is less than 1. - - contains one or more duplicate keys. - - - - Initializes a new instance of the - class that is empty, has the specified concurrency level, has the specified initial capacity, and - uses the specified . - - The estimated number of threads that will update the - concurrently. - The initial number of elements that the - can contain. - The - implementation to use when comparing keys. - - is less than 1. -or- - is less than 0. - - is a null reference - (Nothing in Visual Basic). - - - - Attempts to add the specified key and value to the . - - The key of the element to add. - The value of the element to add. The value can be a null reference (Nothing - in Visual Basic) for reference types. - true if the key/value pair was added to the - successfully; otherwise, false. - is null reference - (Nothing in Visual Basic). - The - contains too many elements. - - - - Determines whether the contains the specified - key. - - The key to locate in the . - true if the contains an element with - the specified key; otherwise, false. - is a null reference - (Nothing in Visual Basic). - - - - Attempts to remove and return the the value with the specified key from the - . - - The key of the element to remove and return. - When this method returns, contains the object removed from the - or the default value of - if the operation failed. - true if an object was removed successfully; otherwise, false. - is a null reference - (Nothing in Visual Basic). - - - - Removes the specified key from the dictionary if it exists and returns its associated value. - If matchValue flag is set, the key will be removed only if is associated with a particular - value. - - The key to search for and remove if it exists. - The variable into which the removed value, if found, is stored. - Whether removal of the key is conditional on its value. - The conditional value to compare against if is true - - - - - Attempts to get the value associated with the specified key from the . - - The key of the value to get. - When this method returns, contains the object from - the - with the spedified key or the default value of - , if the operation failed. - true if the key was found in the ; - otherwise, false. - is a null reference - (Nothing in Visual Basic). - - - - Compares the existing value for the specified key with a specified value, and if they’re equal, - updates the key with a third value. - - The key whose value is compared with and - possibly replaced. - The value that replaces the value of the element with if the comparison results in equality. - The value that is compared to the value of the element with - . - true if the value with was equal to and replaced with ; otherwise, - false. - is a null - reference. - - - - Removes all keys and values from the . - - - - - Copies the elements of the to an array of - type , starting at the - specified array index. - - The one-dimensional array of type - that is the destination of the elements copied from the . The array must have zero-based indexing. - The zero-based index in at which copying - begins. - is a null reference - (Nothing in Visual Basic). - is less than - 0. - is equal to or greater than - the length of the . -or- The number of elements in the source - is greater than the available space from to the end of the destination - . - - - - Copies the key and value pairs stored in the to a - new array. - - A new array containing a snapshot of key and value pairs copied from the . - - - - Copy dictionary contents to an array - shared implementation between ToArray and CopyTo. - - Important: the caller must hold all locks in m_locks before calling CopyToPairs. - - - - - Copy dictionary contents to an array - shared implementation between ToArray and CopyTo. - - Important: the caller must hold all locks in m_locks before calling CopyToEntries. - - - - - Copy dictionary contents to an array - shared implementation between ToArray and CopyTo. - - Important: the caller must hold all locks in m_locks before calling CopyToObjects. - - - - Returns an enumerator that iterates through the . - An enumerator for the . - - The enumerator returned from the dictionary is safe to use concurrently with - reads and writes to the dictionary, however it does not represent a moment-in-time snapshot - of the dictionary. The contents exposed through the enumerator may contain modifications - made to the dictionary after was called. - - - - - Shared internal implementation for inserts and updates. - If key exists, we always return false; and if updateIfExists == true we force update with value; - If key doesn't exist, we always add value and return true; - - - - - Adds a key/value pair to the - if the key does not already exist. - - The key of the element to add. - The function used to generate a value for the key - is a null reference - (Nothing in Visual Basic). - is a null reference - (Nothing in Visual Basic). - The dictionary contains too many - elements. - The value for the key. This will be either the existing value for the key if the - key is already in the dictionary, or the new value for the key as returned by valueFactory - if the key was not in the dictionary. - - - - Adds a key/value pair to the - if the key does not already exist. - - The key of the element to add. - the value to be added, if the key does not already exist - is a null reference - (Nothing in Visual Basic). - The dictionary contains too many - elements. - The value for the key. This will be either the existing value for the key if the - key is already in the dictionary, or the new value if the key was not in the dictionary. - - - - Adds a key/value pair to the if the key does not already - exist, or updates a key/value pair in the if the key - already exists. - - The key to be added or whose value should be updated - The function used to generate a value for an absent key - The function used to generate a new value for an existing key - based on the key's existing value - is a null reference - (Nothing in Visual Basic). - is a null reference - (Nothing in Visual Basic). - is a null reference - (Nothing in Visual Basic). - The dictionary contains too many - elements. - The new value for the key. This will be either be the result of addValueFactory (if the key was - absent) or the result of updateValueFactory (if the key was present). - - - - Adds a key/value pair to the if the key does not already - exist, or updates a key/value pair in the if the key - already exists. - - The key to be added or whose value should be updated - The value to be added for an absent key - The function used to generate a new value for an existing key based on - the key's existing value - is a null reference - (Nothing in Visual Basic). - is a null reference - (Nothing in Visual Basic). - The dictionary contains too many - elements. - The new value for the key. This will be either be the result of addValueFactory (if the key was - absent) or the result of updateValueFactory (if the key was present). - - - - Adds the specified key and value to the . - - The object to use as the key of the element to add. - The object to use as the value of the element to add. - is a null reference - (Nothing in Visual Basic). - The dictionary contains too many - elements. - - An element with the same key already exists in the . - - - - Removes the element with the specified key from the . - - The key of the element to remove. - true if the element is successfully remove; otherwise false. This method also returns - false if - was not found in the original . - - is a null reference - (Nothing in Visual Basic). - - - - Adds the specified value to the - with the specified key. - - The - structure representing the key and value to add to the . - The of is null. - The - contains too many elements. - An element with the same key already exists in the - - - - - Determines whether the - contains a specific key and value. - - The - structure to locate in the . - true if the is found in the ; otherwise, false. - - - - Removes a key and value from the dictionary. - - The - structure representing the key and value to remove from the . - true if the key and value represented by is successfully - found and removed; otherwise, false. - The Key property of is a null reference (Nothing in Visual Basic). - - - Returns an enumerator that iterates through the . - An enumerator for the . - - The enumerator returned from the dictionary is safe to use concurrently with - reads and writes to the dictionary, however it does not represent a moment-in-time snapshot - of the dictionary. The contents exposed through the enumerator may contain modifications - made to the dictionary after was called. - - - - - Adds the specified key and value to the dictionary. - - The object to use as the key. - The object to use as the value. - is a null reference - (Nothing in Visual Basic). - The dictionary contains too many - elements. - - is of a type that is not assignable to the key type of the . -or- - is of a type that is not assignable to , - the type of values in the . - -or- A value with the same key already exists in the . - - - - - Gets whether the contains an - element with the specified key. - - The key to locate in the . - true if the contains - an element with the specified key; otherwise, false. - is a null reference - (Nothing in Visual Basic). - - - Provides an for the - . - An for the . - - - - Removes the element with the specified key from the . - - The key of the element to remove. - is a null reference - (Nothing in Visual Basic). - - - - Copies the elements of the to an array, starting - at the specified array index. - - The one-dimensional array that is the destination of the elements copied from - the . The array must have zero-based - indexing. - The zero-based index in at which copying - begins. - is a null reference - (Nothing in Visual Basic). - is less than - 0. - is equal to or greater than - the length of the . -or- The number of elements in the source - is greater than the available space from to the end of the destination - . - - - - Replaces the internal table with a larger one. To prevent multiple threads from resizing the - table as a result of races, the table of buckets that was deemed too small is passed in as - an argument to GrowTable(). GrowTable() obtains a lock, and then checks whether the bucket - table has been replaced in the meantime or not. - - Reference to the bucket table that was deemed too small. - - - - Computes the bucket and lock number for a particular key. - - - - - Acquires all locks for this hash table, and increments locksAcquired by the number - of locks that were successfully acquired. The locks are acquired in an increasing - order. - - - - - Acquires a contiguous range of locks for this hash table, and increments locksAcquired - by the number of locks that were successfully acquired. The locks are acquired in an - increasing order. - - - - - Releases a contiguous range of locks. - - - - - Gets a collection containing the keys in the dictionary. - - - - - Gets a collection containing the values in the dictionary. - - - - - A helper method for asserts. - - - - - A helper function to obtain the string for a particular resource key. - - - - - - - Get the data array to be serialized - - - - - Construct the dictionary from a previously seiralized one - - - - - Gets or sets the value associated with the specified key. - - The key of the value to get or set. - The value associated with the specified key. If the specified key is not found, a get - operation throws a - , and a set operation creates a new - element with the specified key. - is a null reference - (Nothing in Visual Basic). - The property is retrieved and - - does not exist in the collection. - - - - Gets the number of key/value pairs contained in the . - - The dictionary contains too many - elements. - The number of key/value paris contained in the . - Count has snapshot semantics and represents the number of items in the - at the moment when Count was accessed. - - - - Gets a value that indicates whether the is empty. - - true if the is empty; otherwise, - false. - - - - Gets a collection containing the keys in the . - - An containing the keys in the - . - - - - Gets a collection containing the values in the . - - An containing the values in - the - . - - - - Gets a value indicating whether the dictionary is read-only. - - true if the is - read-only; otherwise, false. For , this property always returns - false. - - - - Gets a value indicating whether the has a fixed size. - - true if the has a - fixed size; otherwise, false. For , this property always - returns false. - - - - Gets a value indicating whether the is read-only. - - true if the is - read-only; otherwise, false. For , this property always - returns false. - - - - Gets an containing the keys of the . - - An containing the keys of the . - - - - Gets an containing the values in the . - - An containing the values in the . - - - - Gets or sets the value associated with the specified key. - - The key of the value to get or set. - The value associated with the specified key, or a null reference (Nothing in Visual Basic) - if is not in the dictionary or is of a type that is - not assignable to the key type of the . - is a null reference - (Nothing in Visual Basic). - - A value is being assigned, and is of a type that is not assignable to the - key type of the . -or- A value is being - assigned, and is of a type that is not assignable to the value type - of the - - - - - Gets a value indicating whether access to the is - synchronized with the SyncRoot. - - true if access to the is synchronized - (thread safe); otherwise, false. For , this property always - returns false. - - - - Gets an object that can be used to synchronize access to the . This property is not supported. - - The SyncRoot property is not supported. - - - - The number of concurrent writes for which to optimize by default. - - - - - A node in a singly-linked list representing a particular hash table bucket. - - - - - A private class to represent enumeration over the dictionary that implements the - IDictionaryEnumerator interface. - - - - - Represents a thread-safe first-in, first-out collection of objects. - - Specifies the type of elements in the queue. - - All public and protected members of are thread-safe and may be used - concurrently from multiple threads. - - - - - Defines methods to manipulate thread-safe collections intended for producer/consumer usage. - - Specifies the type of elements in the collection. - - All implementations of this interface must enable all members of this interface - to be used concurrently from multiple threads. - - - - - Copies the elements of the to - an - , starting at a specified index. - - The one-dimensional that is the destination of - the elements copied from the . - The array must have zero-based indexing. - The zero-based index in at which copying - begins. - is a null reference (Nothing in - Visual Basic). - is less than - zero. - is equal to or greater than the - length of the - -or- The number of elements in the source is greater than the - available space from to the end of the destination . - - - - - Attempts to add an object to the . - - The object to add to the . - true if the object was added successfully; otherwise, false. - The was invalid for this collection. - - - - Attempts to remove and return an object from the . - - - When this method returns, if the object was removed and returned successfully, contains the removed object. If no object was available to be removed, the value is - unspecified. - - true if an object was removed and returned successfully; otherwise, false. - - - - Copies the elements contained in the to a new array. - - A new array containing the elements copied from the . - - - - Initializes a new instance of the class. - - - - - Initializes the contents of the queue from an existing collection. - - A collection from which to copy elements. - - - - Initializes a new instance of the - class that contains elements copied from the specified collection - - The collection whose elements are copied to the new . - The argument is - null. - - - - Get the data array to be serialized - - - - - Construct the queue from a previously seiralized one - - - - - Copies the elements of the to an , starting at a particular - index. - - The one-dimensional Array that is the - destination of the elements copied from the - . The Array must have zero-based indexing. - The zero-based index in at which copying - begins. - is a null reference (Nothing in - Visual Basic). - is less than - zero. - - is multidimensional. -or- - does not have zero-based indexing. -or- - is equal to or greater than the length of the - -or- The number of elements in the source is - greater than the available space from to the end of the destination - . -or- The type of the source cannot be cast automatically to the type of the - destination . - - - - - Returns an enumerator that iterates through a collection. - - An that can be used to iterate through the collection. - - - - Attempts to add an object to the . - - The object to add to the . The value can be a null - reference (Nothing in Visual Basic) for reference types. - - true if the object was added successfully; otherwise, false. - For , this operation will always add the object to the - end of the - and return true. - - - - Attempts to remove and return an object from the . - - - When this method returns, if the operation was successful, contains the - object removed. If no object was available to be removed, the value is unspecified. - - true if an element was removed and returned succesfully; otherwise, false. - For , this operation will attempt to remove the object - from the beginning of the . - - - - - Copies the elements stored in the to a new array. - - A new array containing a snapshot of elements copied from the . - - - - Copies the elements to a new . - - A new containing a snapshot of - elements copied from the . - - - - Store the position of the current head and tail positions. - - return the head segment - return the tail segment - return the head offset - return the tail offset - - - - Copies the elements to an existing one-dimensional Array, starting at the specified array index. - - The one-dimensional Array that is the - destination of the elements copied from the - . The Array must have zero-based - indexing. - The zero-based index in at which copying - begins. - is a null reference (Nothing in - Visual Basic). - is less than - zero. - is equal to or greater than the - length of the - -or- The number of elements in the source is greater than the - available space from to the end of the destination . - - - - - Returns an enumerator that iterates through the . - - An enumerator for the contents of the . - - The enumeration represents a moment-in-time snapshot of the contents - of the queue. It does not reflect any updates to the collection after - was called. The enumerator is safe to use - concurrently with reads from and writes to the queue. - - - - - Adds an object to the end of the . - - The object to add to the end of the . The value can be a null reference - (Nothing in Visual Basic) for reference types. - - - - - Attempts to remove and return the object at the beginning of the . - - - When this method returns, if the operation was successful, contains the - object removed. If no object was available to be removed, the value is unspecified. - - true if an element was removed and returned from the beggining of the - succesfully; otherwise, false. - - - - Attempts to return an object from the beginning of the - without removing it. - - When this method returns, contains an object from - the beginning of the or an - unspecified value if the operation failed. - true if and object was returned successfully; otherwise, false. - - - - Gets a value indicating whether access to the is - synchronized with the SyncRoot. - - true if access to the is synchronized - with the SyncRoot; otherwise, false. For , this property always - returns false. - - - - Gets an object that can be used to synchronize access to the . This property is not supported. - - The SyncRoot property is not supported. - - - - Gets a value that indicates whether the is empty. - - true if the is empty; otherwise, false. - - For determining whether the collection contains any items, use of this property is recommended - rather than retrieving the number of items from the property and comparing it - to 0. However, as this collection is intended to be accessed concurrently, it may be the case - that another thread will modify the collection after returns, thus invalidating - the result. - - - - - Gets the number of elements contained in the . - - The number of elements contained in the . - - For determining whether the collection contains any items, use of the - property is recommended rather than retrieving the number of items from the - property and comparing it to 0. - - - - - private class for ConcurrentQueue. - a queue is a linked list of small arrays, each node is called a segment. - A segment contains an array, a pointer to the next segment, and m_low, m_high indices recording - the first and last valid elements of the array. - - - - - Create and initialize a segment with the specified index. - - - - - Add an element to the tail of the current segment - exclusively called by ConcurrentQueue.InitializedFromCollection - InitializeFromCollection is responsible to guaratee that there is no index overflow, - and there is no contention - - - - - - Create a new segment and append to the current one - Does not update the m_tail pointer - exclusively called by ConcurrentQueue.InitializedFromCollection - InitializeFromCollection is responsible to guaratee that there is no index overflow, - and there is no contention - - the reference to the new Segment - - - - Create a new segment and append to the current one - Update the m_tail pointer - This method is called when there is no contention - - - - - Try to append an element at the end of this segment. - - the element to append - The tail. - true if the element is appended, false if the current segment is full - if appending the specified element succeeds, and after which the segment is full, - then grow the segment - - - - try to remove an element from the head of current segment - - The result. - The head. - return false only if the current segment is empty - - - - try to peek the current segment - - holds the return value of the element at the head position, - value set to default(T) if there is no such an element - true if there are elements in the current segment, false otherwise - - - - Convert part or all of the current segment into a List - - the start position - the end position - the result list - - - - return the next segment - - - - - return true if the current segment is empty (doesn't have any element available to dequeue, - false otherwise - - - - - return the position of the head of the current segment - - - - - return the logical position of the tail of the current segment - - - - - Represents a thread-safe last-in, first-out collection of objects. - - Specifies the type of elements in the stack. - - All public and protected members of are thread-safe and may be used - concurrently from multiple threads. - - - - - Initializes a new instance of the - class. - - - - - Initializes a new instance of the - class that contains elements copied from the specified collection - - The collection whose elements are copied to the new . - The argument is - null. - - - - Initializes the contents of the stack from an existing collection. - - A collection from which to copy elements. - - - - Get the data array to be serialized - - - - - Construct the stack from a previously seiralized one - - - - - Removes all objects from the . - - - - - Copies the elements of the to an , starting at a particular - index. - - The one-dimensional that is the destination of - the elements copied from the - . The must - have zero-based indexing. - The zero-based index in at which copying - begins. - is a null reference (Nothing in - Visual Basic). - is less than - zero. - - is multidimensional. -or- - does not have zero-based indexing. -or- - is equal to or greater than the length of the - -or- The number of elements in the source is - greater than the available space from to the end of the destination - . -or- The type of the source cannot be cast automatically to the type of the - destination . - - - - - Copies the elements to an existing one-dimensional , starting at the specified array index. - - The one-dimensional that is the destination of - the elements copied from the - . The must have zero-based - indexing. - The zero-based index in at which copying - begins. - is a null reference (Nothing in - Visual Basic). - is less than - zero. - is equal to or greater than the - length of the - -or- The number of elements in the source is greater than the - available space from to the end of the destination . - - - - - Inserts an object at the top of the . - - The object to push onto the . The value can be - a null reference (Nothing in Visual Basic) for reference types. - - - - - Inserts multiple objects at the top of the atomically. - - The objects to push onto the . - is a null reference - (Nothing in Visual Basic). - - When adding multiple items to the stack, using PushRange is a more efficient - mechanism than using one item at a time. Additionally, PushRange - guarantees that all of the elements will be added atomically, meaning that no other threads will - be able to inject elements between the elements being pushed. Items at lower indices in - the array will be pushed before items at higher indices. - - - - - Inserts multiple objects at the top of the atomically. - - The objects to push onto the . - The zero-based offset in at which to begin - inserting elements onto the top of the . - The number of elements to be inserted onto the top of the . - is a null reference - (Nothing in Visual Basic). - or is negative. Or is greater than or equal to the length - of . - + is - greater than the length of . - - When adding multiple items to the stack, using PushRange is a more efficient - mechanism than using one item at a time. Additionally, PushRange - guarantees that all of the elements will be added atomically, meaning that no other threads will - be able to inject elements between the elements being pushed. Items at lower indices in the - array will be pushed before items at higher indices. - - - - - Push one or many nodes into the stack, if head and tails are equal then push one node to the stack other wise push the list between head - and tail to the stack - - The head pointer to the new list - The tail pointer to the new list - - - - Local helper function to validate the Pop Push range methods input - - - - - Attempts to add an object to the . - - The object to add to the . The value can be a null - reference (Nothing in Visual Basic) for reference types. - - true if the object was added successfully; otherwise, false. - For , this operation - will always insert the object onto the top of the - and return true. - - - - Attempts to return an object from the top of the - without removing it. - - When this method returns, contains an object from - the top of the or an - unspecified value if the operation failed. - true if and object was returned successfully; otherwise, false. - - - - Attempts to pop and return the object at the top of the . - - - When this method returns, if the operation was successful, contains the - object removed. If no object was available to be removed, the value is unspecified. - - true if an element was removed and returned from the top of the - succesfully; otherwise, false. - - - - Attempts to pop and return multiple objects from the top of the - atomically. - - - The to which objects popped from the top of the will be added. - - The number of objects successfully popped from the top of the and inserted in - . - is a null argument (Nothing - in Visual Basic). - - When popping multiple items, if there is little contention on the stack, using - TryPopRange can be more efficient than using - once per item to be removed. Nodes fill the - with the first node to be popped at the startIndex, the second node to be popped - at startIndex + 1, and so on. - - - - - Attempts to pop and return multiple objects from the top of the - atomically. - - - The to which objects popped from the top of the will be added. - - The zero-based offset in at which to begin - inserting elements from the top of the . - The number of elements to be popped from top of the and inserted into . - is a null reference - (Nothing in Visual Basic). - or is negative. Or is greater than or equal to the length - of . - + is - greater than the length of . - - When popping multiple items, if there is little contention on the stack, using - TryPopRange can be more efficient than using - once per item to be removed. Nodes fill the - with the first node to be popped at the startIndex, the second node to be popped - at startIndex + 1, and so on. - - - - - Local helper function to Pop an item from the stack, slow path - - The popped item - True if succeeded, false otherwise - - - - Slow path helper for TryPop. This method assumes an initial attempt to pop an element - has already occurred and failed, so it begins spinning right away. - - The number of items to pop. - - When this method returns, if the pop succeeded, contains the removed object. If no object was - available to be removed, the value is unspecified. This parameter is passed uninitialized. - - True if an element was removed and returned; otherwise, false. - - - - Local helper function to copy the poped elements into a given collection - - The head of the list to be copied - The collection to place the popped items in - the beginning of index of where to place the popped items - The number of nodes. - - - - Attempts to remove and return an object from the . - - - When this method returns, if the operation was successful, contains the - object removed. If no object was available to be removed, the value is unspecified. - - true if an element was removed and returned succesfully; otherwise, false. - For , this operation will attempt to pope the object at - the top of the . - - - - - Copies the items stored in the to a new array. - - A new array containing a snapshot of elements copied from the . - - - - Returns an array containing a snapshot of the list's contents, using - the target list node as the head of a region in the list. - - An array of the list's contents. - - - - Returns an enumerator that iterates through the . - - An enumerator for the . - - The enumeration represents a moment-in-time snapshot of the contents - of the stack. It does not reflect any updates to the collection after - was called. The enumerator is safe to use - concurrently with reads from and writes to the stack. - - - - - Returns an enumerator that iterates through a collection. - - An that can be used to iterate through - the collection. - - The enumeration represents a moment-in-time snapshot of the contents of the stack. It does not - reflect any updates to the collection after - was called. The enumerator is safe to use concurrently with reads - from and writes to the stack. - - - - - Gets a value that indicates whether the is empty. - - true if the is empty; otherwise, false. - - For determining whether the collection contains any items, use of this property is recommended - rather than retrieving the number of items from the property and comparing it - to 0. However, as this collection is intended to be accessed concurrently, it may be the case - that another thread will modify the collection after returns, thus invalidating - the result. - - - - - Gets the number of elements contained in the . - - The number of elements contained in the . - - For determining whether the collection contains any items, use of the - property is recommended rather than retrieving the number of items from the - property and comparing it to 0. - - - - - Gets a value indicating whether access to the is - synchronized with the SyncRoot. - - true if access to the is synchronized - with the SyncRoot; otherwise, false. For , this property always - returns false. - - - - Gets an object that can be used to synchronize access to the . This property is not supported. - - The SyncRoot property is not supported - - - - A simple (internal) node type used to store elements of concurrent stacks and queues. - - - - - Constructs a new node with the specified value and no next node. - - The value of the node. - - - - A debugger view of the IProducerConsumerCollection that makes it simple to browse the - collection's contents at a point in time. - - The type of elements stored within. - - - - Constructs a new debugger view object for the provided collection object. - - A collection to browse in the debugger. - - - - Returns a snapshot of the underlying collection's elements. - - - - - Represents a particular manner of splitting an orderable data source into multiple partitions. - - Type of the elements in the collection. - - - Each element in each partition has an integer index associated with it, which determines the relative - order of that element against elements in other partitions. - - - Inheritors of must adhere to the following rules: -
    -
  1. All indices must be unique, such that there may not be duplicate indices. If all indices are not - unique, the output ordering may be scrambled.
    2. -
  2. All indices must be non-negative. If any indices are negative, consumers of the implementation - may throw exceptions.
    3. -
  3. and should throw a - if the requested partition count is less than or - equal to zero.
    4. -
  4. and should always return a number - of enumerables equal to the requested partition count. If the partitioner runs out of data and cannot - create as many partitions as requested, an empty enumerator should be returned for each of the - remaining partitions. If this rule is not followed, consumers of the implementation may throw a .
    5. -
  5. , , - , and - should never return null. If null is returned, a consumer of the implementation may throw a - .
    6. -
  6. , , - , and - should always return partitions that can fully and uniquely enumerate the input data source. All of - the data and only the data contained in the input source should be enumerated, with no duplication - that was not already in the input, unless specifically required by the particular partitioner's - design. If this is not followed, the output ordering may be scrambled.
    7. -
  7. If returns true, each partition must return elements - with increasing key indices.
    8. -
  8. If returns true, all the keys in partition numbered N - must be larger than all the keys in partition numbered N-1.
    9. -
  9. If returns true, all indices must be monotonically increasing from - 0, though not necessarily within a single partition.
    10. -
- - - - - - Represents a particular manner of splitting a data source into multiple partitions. - - Type of the elements in the collection. - - - Inheritors of must adhere to the following rules: -
    -
  1. should throw a - if the requested partition count is less than or - equal to zero.
    2. -
  2. should always return a number of enumerables equal to the requested - partition count. If the partitioner runs out of data and cannot create as many partitions as - requested, an empty enumerator should be returned for each of the remaining partitions. If this rule - is not followed, consumers of the implementation may throw a .
    3. -
  3. and - should never return null. If null is returned, a consumer of the implementation may throw a - .
    4. -
  4. and should always return - partitions that can fully and uniquely enumerate the input data source. All of the data and only the - data contained in the input source should be enumerated, with no duplication that was not already in - the input, unless specifically required by the particular partitioner's design. If this is not - followed, the output ordering may be scrambled.
    5. -
- - - - - - Partitions the underlying collection into the given number of partitions. - - The number of partitions to create. - A list containing enumerators. - - - - Creates an object that can partition the underlying collection into a variable number of - partitions. - - - - The returned object implements the interface. Calling GetEnumerator on the - object creates another partition over the sequence. - - - The method is only supported if the - property returns true. - - - An object that can create partitions over the underlying data source. - Dynamic partitioning is not supported by this - partitioner. - - - - Gets whether additional partitions can be created dynamically. - - - true if the can create partitions dynamically as they are - requested; false if the can only allocate - partitions statically. - - - - If a derived class does not override and implement , - should return false. The value of should not vary over the lifetime of this instance. - - - - - - Initializes a new instance of the class with the - specified constraints on the index keys. - - - Indicates whether the elements in each partition are yielded in the order of - increasing keys. - - - Indicates whether elements in an earlier partition always come before - elements in a later partition. If true, each element in partition 0 has a smaller order key than - any element in partition 1, each element in partition 1 has a smaller order key than any element - in partition 2, and so on. - - - Indicates whether keys are normalized. If true, all order keys are distinct - integers in the range [0 .. numberOfElements-1]. If false, order keys must still be dictinct, but - only their relative order is considered, not their absolute values. - - - - - Partitions the underlying collection into the specified number of orderable partitions. - - - Each partition is represented as an enumerator over key-value pairs. - The value of the pair is the element itself, and the key is an integer which determines - the relative ordering of this element against other elements in the data source. - - The number of partitions to create. - A list containing enumerators. - - - - Creates an object that can partition the underlying collection into a variable number of - partitions. - - - - The returned object implements the interface. Calling GetEnumerator on the - object creates another partition over the sequence. - - - Each partition is represented as an enumerator over key-value pairs. The value in the pair is the element - itself, and the key is an integer which determines the relative ordering of this element against - other elements. - - - The method is only supported if the SupportsDynamicPartitions - property returns true. - - - An object that can create partitions over the underlying data source. - Dynamic partitioning is not supported by this - partitioner. - - - - Partitions the underlying collection into the given number of ordered partitions. - - - The default implementation provides the same behavior as except - that the returned set of partitions does not provide the keys for the elements. - - The number of partitions to create. - A list containing enumerators. - - - - Creates an object that can partition the underlying collection into a variable number of - partitions. - - - - The returned object implements the interface. Calling GetEnumerator on the - object creates another partition over the sequence. - - - The default implementation provides the same behavior as except - that the returned set of partitions does not provide the keys for the elements. - - - The method is only supported if the - property returns true. - - - An object that can create partitions over the underlying data source. - Dynamic partitioning is not supported by this - partitioner. - - - - Gets whether elements in each partition are yielded in the order of increasing keys. - - - - - Gets whether elements in an earlier partition always come before elements in a later partition. - - - If returns true, each element in partition 0 has a - smaller order key than any element in partition 1, each element in partition 1 has a smaller - order key than any element in partition 2, and so on. - - - - - Gets whether order keys are normalized. - - - If returns true, all order keys are distinct integers in the range - [0 .. numberOfElements-1]. If the property returns false, order keys must still be dictinct, but - only their relative order is considered, not their absolute values. - - - - - Converts an enumerable over key-value pairs to an enumerable over values. - - - - - Provides common partitioning strategies for arrays, lists, and enumerables. - - - - The static methods on are all thread-safe and may be used concurrently - from multiple threads. However, while a created partitioner is in use, the underlying data source - should not be modified, whether from the same thread that's using a partitioner or from a separate - thread. - - - - - - Creates an orderable partitioner from an - instance. - - Type of the elements in source list. - The list to be partitioned. - - A Boolean value that indicates whether the created partitioner should dynamically - load balance between partitions rather than statically partition. - - - An orderable partitioner based on the input list. - - - - - Creates an orderable partitioner from a instance. - - Type of the elements in source array. - The array to be partitioned. - - A Boolean value that indicates whether the created partitioner should dynamically load balance - between partitions rather than statically partition. - - - An orderable partitioner based on the input array. - - - - - Creates an orderable partitioner from a instance. - - Type of the elements in source enumerable. - The enumerable to be partitioned. - - An orderable partitioner based on the input array. - - - The ordering used in the created partitioner is determined by the natural order of the elements - as retrieved from the source enumerable. - - - - - DynamicPartitionEnumerator_Abstract defines the enumerator for each partition for the dynamic load-balance - partitioning algorithm. - - Partition is an enumerator of KeyValuePairs, each corresponding to an item in the data source: - the key is the index in the source collection; the value is the item itself. - - a set of such partitions share a reader over data source. The type of the reader is specified by - TSourceReader. - - each partition requests a contiguous chunk of elements at a time from the source data. The chunk - size is initially 1, and doubles every time until it reaches the maximum chunk size. - The implementation for GrabNextChunk() method has two versions: one for data source of IndexRange - types (IList and the array), one for data source of IEnumerable. - - The method "Reset" is not supported for any partitioning algorithm. - - The implementation for MoveNext() method is same for all dynanmic partitioners, so we provide it - in this abstract class. - - Type of the elements in the data source - Type of the reader on the data source - - - - Abstract method to request a contiguous chunk of elements from the source collection - - specified number of elements requested - - true if we successfully reserved at least one element (up to #=requestedChunkSize) - false if all elements in the source collection have been reserved. - - - - - Dispose is abstract, and depends on the type of the source data: - - For source data type IList and Array, the type of the shared reader is just the dataitself. - We don't do anything in Dispose method for IList and Array. - - For source data type IEnumerable, the type of the shared reader is an enumerator we created. - Thus we need to dispose this shared reader enumerator, when there is no more active partitions - left. - - - - - Reset on partitions is not supported - - - - - Moves to the next element if any. - Try current chunk first, if the current chunk do not have any elements left, then we - attempt to grab a chunk from the source collection. - - - true if successfully moving to the next position; - false otherwise, if and only if there is no more elements left in the current chunk - AND the source collection is exhausted. - - - - - Abstract property, returns whether or not the shared reader has already read the last - element of the source data - - - - - Get the current element in the current partition. Property required by IEnumerator interface - This property is abstract because the implementation is different depending on the type - of the source data: IList, Array or IEnumerable - - - - - Get the current element in the current partition. Property required by IEnumerator interface - - - - - Inherits from DynamicPartitioners - Provides customized implementation of GetOrderableDynamicPartitions_Factory method, to return an instance - of EnumerableOfPartitionsForIEnumerator defined internally - - Type of elements in the source data - - - - Overrides OrderablePartitioner.GetOrderablePartitions. - Partitions the underlying collection into the given number of orderable partitions. - - number of partitions requested - A list containing enumerators. - - - - Overrides OrderablePartitioner.GetOrderableDyanmicPartitions - - a enumerable collection of orderable partitions - - - - Whether additional partitions can be created dynamically. - - - - - Provides customized implementation for source data of IEnumerable - Different from the counterpart for IList/Array, this enumerable maintains several additional fields - shared by the partitions it owns, including a boolean "m_hasNoElementsLef", a shared lock, and a - shared count "m_activePartitionCount" - - - - - Inherits from DynamicPartitionEnumerator_Abstract directly - Provides customized implementation for: GrabNextChunk, HasNoElementsLeft, Current, Dispose - - - - - Reserves a contiguous range of elements from source data - - specified number of elements requested - - true if we successfully reserved at least one element (up to #=requestedChunkSize) - false if all elements in the source collection have been reserved. - - - - - If the current partition is to be disposed, we decrement the number of active partitions - for the shared reader. - If the number of active partitions becomes 0, we need to dispose the shared reader we created - - - - - Returns whether or not the shared reader has already read the last - element of the source data - - - We cannot call m_sharedReader.MoveNext(), to see if it hits the last element - or not, because we can't undo MoveNext(). Thus we need to maintain a shared - boolean value m_hasNoElementsLeft across all partitions - - - - - Dynamic load-balance partitioner. This class is abstract and to be derived from by - the customized partitioner classes for IList, Array, and IEnumerable - - Type of the elements in the source data - Type of the source data collection - - - - Constructs a new orderable partitioner - - source data collection - - - - Partition the source data and create an enumerable over the resulting partitions. - - the source data collection - an enumerable of partitions of - - - - Overrides OrderablePartitioner.GetOrderablePartitions. - Partitions the underlying collection into the given number of orderable partitions. - - number of partitions requested - A list containing enumerators. - - - - Overrides OrderablePartitioner.GetOrderableDyanmicPartitions - - a enumerable collection of orderable partitions - - - - Whether additional partitions can be created dynamically. - - - - - Defines dynamic partition for source data of IList and Array. - This class inherits DynamicPartitionEnumerator_Abstract - - implements GrabNextChunk, HasNoElementsLeft, and Dispose methods for IList and Array - - Current property still remains abstract, implementation is different for IList and Array - - introduces another abstract method SourceCount, which returns the number of elements in - the source data. Implementation differs for IList and Array - - Type of the elements in the data source - Type of the reader on the source data - - - - Reserves a contiguous range of elements from source data - - specified number of elements requested - - true if we successfully reserved at least one element (up to #=requestedChunkSize) - false if all elements in the source collection have been reserved. - - - - - For source data type IList and Array, the type of the shared reader is just the data itself. - We don't do anything in Dispose method for IList and Array. - - - - - Get the number of elements from the source reader. - It calls IList.Count or Array.Length - - - - - Returns whether or not the shared reader has already read the last - element of the source data - - - - - Inherits from DynamicPartitioners - Provides customized implementation of GetOrderableDynamicPartitions_Factory method, to return an instance - of EnumerableOfPartitionsForIList defined internally - - Type of elements in the source data - - - - Inherits from PartitionList_Abstract - Provides customized implementation for source data of IList - - - - - Inherits from DynamicPartitionEnumeratorForIndexRange_Abstract - Provides customized implementation of SourceCount property and Current property for IList - - - - - return a KeyValuePair of the current element and its key - - - - - Inherits from DynamicPartitioners - Provides customized implementation of GetOrderableDynamicPartitions_Factory method, to return an instance - of EnumerableOfPartitionsForArray defined internally - - Type of elements in the source data - - - - Inherits from PartitionList_Abstract - Provides customized implementation for source data of Array - - - - - Inherits from DynamicPartitionEnumeratorForIndexRange_Abstract - Provides customized implementation of SourceCount property and Current property for Array - - - - - Static partitioning over IList. - - dynamic and load-balance - - Keys are ordered within each partition - - Keys are ordered across partitions - - Keys are normalized - - Number of partitions is fixed once specified, and the elements of the source data are - distributed to each partition as evenly as possible. - - type of the elements - Type of the source data collection - - - - Abstract method to create a partition that covers a range over source data, - starting from "startIndex", ending at "endIndex" - - start index of the current partition on the source data - end index of the current partition on the source data - a partition enumerator over the specified range - - - - Overrides OrderablePartitioner.GetOrderablePartitions - Return a list of partitions, each of which enumerate a fixed part of the source data - The elements of the source data are distributed to each partition as evenly as possible. - Specifically, if the total number of elements is N, and number of partitions is x, and N = a*x +b, - where a is the quotient, and b is the remainder. Then the first b partitions each has a + 1 elements, - and the last x-b partitions each has a elements. - For example, if N=10, x =3, then - partition 0 ranges [0,3], - partition 1 ranges [4,6], - partition 2 ranges [7,9]. - This also takes care of the situation of (x>N), the last x-N partitions are empty enumerators. - An empty enumerator is indicated by - (m_startIndex == list.Count && m_endIndex == list.Count -1) - - specified number of partitions - a list of partitions - - - - Abstract method to return the number of elements in the source data - - - - - Static Partition for IList/Array. - This class implements all methods required by IEnumerator interface, except for the Current property. - Current Property is different for IList and Array. Arrays calls 'ldelem' instructions for faster element - retrieval. - - - - - Constructs an instance of StaticIndexRangePartition - - the start index in the source collection for the current partition - the end index in the source collection for the current partition - - - - We don't dispose the source for IList and array - - - - - Moves to the next item - Before the first MoveNext is called: m_offset == m_startIndex-1; - - true if successful, false if there is no item left - - - - Current Property is different for IList and Array. Arrays calls 'ldelem' instructions for faster - element retrieval. - - - - - Inherits from StaticIndexRangePartitioner - Provides customized implementation of SourceCount and CreatePartition - - - - - - Inherits from StaticIndexRangePartition - Provides customized implementation of Current property - - - - - - Inherits from StaticIndexRangePartitioner - Provides customized implementation of SourceCount and CreatePartition for Array - - - - - Inherits from StaticIndexRangePartitioner - Provides customized implementation of SourceCount and CreatePartition - - - - - A very simple primitive that allows us to share a value across multiple threads. - - - - - Represents one or more errors that occur during application execution. - - is used to consolidate multiple failures into a single, throwable - exception object. - - - - - Initializes a new instance of the class. - - - - - Initializes a new instance of the class with - a specified error message. - - The error message that explains the reason for the exception. - - - - Initializes a new instance of the class with a specified error - message and a reference to the inner exception that is the cause of this exception. - - The error message that explains the reason for the exception. - The exception that is the cause of the current exception. - The argument - is null. - - - - Initializes a new instance of the class with - references to the inner exceptions that are the cause of this exception. - - The exceptions that are the cause of the current exception. - The argument - is null. - An element of is - null. - - - - Initializes a new instance of the class with - references to the inner exceptions that are the cause of this exception. - - The exceptions that are the cause of the current exception. - The argument - is null. - An element of is - null. - - - - Initializes a new instance of the class with a specified error - message and references to the inner exceptions that are the cause of this exception. - - The error message that explains the reason for the exception. - The exceptions that are the cause of the current exception. - The argument - is null. - An element of is - null. - - - - Initializes a new instance of the class with a specified error - message and references to the inner exceptions that are the cause of this exception. - - The error message that explains the reason for the exception. - The exceptions that are the cause of the current exception. - The argument - is null. - An element of is - null. - - - - Allocates a new aggregate exception with the specified message and list of inner exceptions. - - The error message that explains the reason for the exception. - The exceptions that are the cause of the current exception. - The argument - is null. - An element of is - null. - - - - Initializes a new instance of the class with serialized data. - - The that holds - the serialized object data about the exception being thrown. - The that - contains contextual information about the source or destination. - The argument is null. - The exception could not be deserialized correctly. - - - - Sets the with information about - the exception. - - The that holds - the serialized object data about the exception being thrown. - The that - contains contextual information about the source or destination. - The argument is null. - - - - Returns the that is the root cause of this exception. - - - - - Invokes a handler on each contained by this . - - The predicate to execute for each exception. The predicate accepts as an - argument the to be processed and returns a Boolean to indicate - whether the exception was handled. - - Each invocation of the returns true or false to indicate whether the - was handled. After all invocations, if any exceptions went - unhandled, all unhandled exceptions will be put into a new - which will be thrown. Otherwise, the method simply returns. If any - invocations of the throws an exception, it will halt the processing - of any more exceptions and immediately propagate the thrown exception as-is. - - An exception contained by this was not handled. - The argument is - null. - - - - Flattens an instances into a single, new instance. - - A new, flattened . - - If any inner exceptions are themselves instances of - , this method will recursively flatten all of them. The - inner exceptions returned in the new - will be the union of all of the the inner exceptions from exception tree rooted at the provided - instance. - - - - - Creates and returns a string representation of the current . - - A string representation of the current exception. - - - - Gets a read-only collection of the instances that caused the - current exception. - - - - - Encapsulates a method that has five parameters and returns a value of the type specified by the TResult parameter. - - - - - Propogates notification that operations should be canceled. - - - - A may be created directly in an unchangeable canceled or non-canceled state - using the CancellationToken's constructors. However, to have a CancellationToken that can change - from a non-canceled to a canceled state, - CancellationTokenSource must be used. - CancellationTokenSource exposes the associated CancellationToken that may be canceled by the source through its - Token property. - - - Once canceled, a token may not transition to a non-canceled state, and a token whose - is false will never change to one that can be canceled. - - - All members of this struct are thread-safe and may be used concurrently from multiple threads. - - - - - - Internal constructor only a CancellationTokenSource should create a CancellationToken - - - - - Initializes the CancellationToken. - - - The canceled state for the token. - - - Tokens created with this constructor will remain in the canceled state specified - by the parameter. If is false, - both and will be false. - If is true, - both and will be true. - - - - - Registers a delegate that will be called when this CancellationToken is canceled. - - - - If this token is already in the canceled state, the - delegate will be run immediately and synchronously. Any exception the delegate generates will be - propogated out of this method call. - - - The current ExecutionContext, if one exists, will be captured - along with the delegate and will be used when executing it. - - - The delegate to be executed when the CancellationToken is canceled. - The instance that can - be used to deregister the callback. - is null. - The associated CancellationTokenSource has been disposed. - - - - Registers a delegate that will be called when this - CancellationToken is canceled. - - - - If this token is already in the canceled state, the - delegate will be run immediately and synchronously. Any exception the delegate generates will be - propogated out of this method call. - - - The current ExecutionContext, if one exists, will be captured - along with the delegate and will be used when executing it. - - - The delegate to be executed when the CancellationToken is canceled. - A Boolean value that indicates whether to capture - the current SynchronizationContext and use it - when invoking the . - The instance that can - be used to deregister the callback. - is null. - The associated CancellationTokenSource has been disposed. - - - - Registers a delegate that will be called when this - CancellationToken is canceled. - - - - If this token is already in the canceled state, the - delegate will be run immediately and synchronously. Any exception the delegate generates will be - propogated out of this method call. - - - The current ExecutionContext, if one exists, will be captured - along with the delegate and will be used when executing it. - - - The delegate to be executed when the CancellationToken is canceled. - The state to pass to the when the delegate is invoked. This may be null. - The instance that can - be used to deregister the callback. - is null. - The associated CancellationTokenSource has been disposed. - - - - Registers a delegate that will be called when this - CancellationToken is canceled. - - - - If this token is already in the canceled state, the - delegate will be run immediately and synchronously. Any exception the delegate generates will be - propogated out of this method call. - - - The current ExecutionContext, if one exists, - will be captured along with the delegate and will be used when executing it. - - - The delegate to be executed when the CancellationToken is canceled. - The state to pass to the when the delegate is invoked. This may be null. - A Boolean value that indicates whether to capture - the current SynchronizationContext and use it - when invoking the . - The instance that can - be used to deregister the callback. - is null. - The associated CancellationTokenSource has been disposed. - - - - Determines whether the current CancellationToken instance is equal to the - specified token. - - The other CancellationToken to which to compare this - instance. - True if the instances are equal; otherwise, false. Two tokens are equal if they are associated - with the same CancellationTokenSource or if they were both constructed - from public CancellationToken constructors and their values are equal. - - - - Determines whether the current CancellationToken instance is equal to the - specified . - - The other object to which to compare this instance. - True if is a CancellationToken - and if the two instances are equal; otherwise, false. Two tokens are equal if they are associated - with the same CancellationTokenSource or if they were both constructed - from public CancellationToken constructors and their values are equal. - An associated CancellationTokenSource has been disposed. - - - - Serves as a hash function for a CancellationToken. - - A hash code for the current CancellationToken instance. - - - - Determines whether two CancellationToken instances are equal. - - The first instance. - The second instance. - True if the instances are equal; otherwise, false. - An associated CancellationTokenSource has been disposed. - - - - Determines whether two CancellationToken instances are not equal. - - The first instance. - The second instance. - True if the instances are not equal; otherwise, false. - An associated CancellationTokenSource has been disposed. - - - - Throws a OperationCanceledException if - this token has had cancellation requested. - - - This method provides functionality equivalent to: - - if (token.IsCancellationRequested) - throw new OperationCanceledException(token); - - - The token has had cancellation requested. - The associated CancellationTokenSource has been disposed. - - - - Returns an empty CancellationToken value. - - - The value returned by this property will be non-cancelable by default. - - - - - Gets whether cancellation has been requested for this token. - - Whether cancellation has been requested for this token. - - - This property indicates whether cancellation has been requested for this token, - either through the token initially being construted in a canceled state, or through - calling Cancel - on the token's associated . - - - If this property is true, it only guarantees that cancellation has been requested. - It does not guarantee that every registered handler - has finished executing, nor that cancellation requests have finished propagating - to all registered handlers. Additional synchronization may be required, - particularly in situations where related objects are being canceled concurrently. - - - - - - Gets whether this token is capable of being in the canceled state. - - - If CanBeCanceled returns false, it is guaranteed that the token will never transition - into a canceled state, meaning that will never - return true. - - - - - Gets a that is signaled when the token is canceled. - - Accessing this property causes a WaitHandle - to be instantiated. It is preferable to only use this property when necessary, and to then - dispose the associated instance at the earliest opportunity (disposing - the source will dispose of this allocated handle). The handle should not be closed or disposed directly. - - The associated CancellationTokenSource has been disposed. - - - - Represents a callback delegate that has been registered with a CancellationToken. - - - To unregister a callback, dispose the corresponding Registration instance. - - - - - Attempts to deregister the item. If it's already being run, this may fail. - Entails a full memory fence. - - True if the callback was found and deregistered, false otherwise. - - - - Disposes of the registration and unregisters the target callback from the associated - CancellationToken. - If the target callback is currently executing this method will wait until it completes, except - in the degenerate cases where a callback method deregisters itself. - - - - - Determines whether two CancellationTokenRegistration - instances are equal. - - The first instance. - The second instance. - True if the instances are equal; otherwise, false. - - - - Determines whether two CancellationTokenRegistration instances are not equal. - - The first instance. - The second instance. - True if the instances are not equal; otherwise, false. - - - - Determines whether the current CancellationTokenRegistration instance is equal to the - specified . - - The other object to which to compare this instance. - True, if both this and are equal. False, otherwise. - Two CancellationTokenRegistration instances are equal if - they both refer to the output of a single call to the same Register method of a - CancellationToken. - - - - - Determines whether the current CancellationToken instance is equal to the - specified . - - The other CancellationTokenRegistration to which to compare this instance. - True, if both this and are equal. False, otherwise. - Two CancellationTokenRegistration instances are equal if - they both refer to the output of a single call to the same Register method of a - CancellationToken. - - - - - Serves as a hash function for a CancellationTokenRegistration.. - - A hash code for the current CancellationTokenRegistration instance. - - - - Signals to a that it should be canceled. - - - - is used to instantiate a - (via the source's Token property) - that can be handed to operations that wish to be notified of cancellation or that can be used to - register asynchronous operations for cancellation. That token may have cancellation requested by - calling to the source's Cancel - method. - - - All members of this class, except Dispose, are thread-safe and may be used - concurrently from multiple threads. - - - - - The ID of the thread currently executing the main body of CTS.Cancel() - this helps us to know if a call to ctr.Dispose() is running 'within' a cancellation callback. - This is updated as we move between the main thread calling cts.Cancel() and any syncContexts that are used to - actually run the callbacks. - - - - Initializes the . - - - - - Communicates a request for cancellation. - - - - The associated will be - notified of the cancellation and will transition to a state where - IsCancellationRequested returns true. - Any callbacks or cancelable operations - registered with the will be executed. - - - Cancelable operations and callbacks registered with the token should not throw exceptions. - However, this overload of Cancel will aggregate any exceptions thrown into a , - such that one callback throwing an exception will not prevent other registered callbacks from being executed. - - - The that was captured when each callback was registered - will be reestablished when the callback is invoked. - - - An aggregate exception containing all the exceptions thrown - by the registered callbacks on the associated . - This has been disposed. - - - - Communicates a request for cancellation. - - - - The associated will be - notified of the cancellation and will transition to a state where - IsCancellationRequested returns true. - Any callbacks or cancelable operations - registered with the will be executed. - - - Cancelable operations and callbacks registered with the token should not throw exceptions. - If is true, an exception will immediately propagate out of the - call to Cancel, preventing the remaining callbacks and cancelable operations from being processed. - If is false, this overload will aggregate any - exceptions thrown into a , - such that one callback throwing an exception will not prevent other registered callbacks from being executed. - - - The that was captured when each callback was registered - will be reestablished when the callback is invoked. - - - Specifies whether exceptions should immediately propagate. - An aggregate exception containing all the exceptions thrown - by the registered callbacks on the associated . - This has been disposed. - - - - Releases the resources used by this . - - - This method is not thread-safe for any other concurrent calls. - - - - - Throws an exception if the source has been disposed. - - - - - InternalGetStaticSource() - - Whether the source should be set. - A static source to be shared among multiple tokens. - - - - Registers a callback object. If cancellation has already occurred, the - callback will have been run by the time this method returns. - - - - - - - - - - Invoke the Canceled event. - - - The handlers are invoked synchronously in LIFO order. - - - - - Creates a CancellationTokenSource that will be in the canceled state - when any of the source tokens are in the canceled state. - - The first CancellationToken to observe. - The second CancellationToken to observe. - A CancellationTokenSource that is linked - to the source tokens. - A CancellationTokenSource associated with - one of the source tokens has been disposed. - - - - Creates a CancellationTokenSource that will be in the canceled state - when any of the source tokens are in the canceled state. - - The CancellationToken instances to observe. - A CancellationTokenSource that is linked - to the source tokens. - is null. - A CancellationTokenSource associated with - one of the source tokens has been disposed. - - - - Gets whether cancellation has been requested for this CancellationTokenSource. - - Whether cancellation has been requested for this CancellationTokenSource. - - - This property indicates whether cancellation has been requested for this token source, such as - due to a call to its - Cancel method. - - - If this property returns true, it only guarantees that cancellation has been requested. It does not - guarantee that every handler registered with the corresponding token has finished executing, nor - that cancellation requests have finished propagating to all registered handlers. Additional - synchronization may be required, particularly in situations where related objects are being - canceled concurrently. - - - - - - A simple helper to determine whether cancellation has finished. - - - - - A simple helper to determine whether disposal has occured. - - - - - The ID of the thread that is running callbacks. - - - - - Gets the CancellationToken - associated with this . - - The CancellationToken - associated with this . - The token source has been - disposed. - - - - - - - - - - - - - - The currently executing callback - - - - - A helper class for collating the various bits of information required to execute - cancellation callbacks. - - - - - InternalExecuteCallbackSynchronously_GeneralPath - This will be called on the target synchronization context, however, we still need to restore the required execution context - - - - - A sparsely populated array. Elements can be sparse and some null, but this allows for - lock-free additions and growth, and also for constant time removal (by nulling out). - - The kind of elements contained within. - - - - Allocates a new array with the given initial size. - - How many array slots to pre-allocate. - - - - Adds an element in the first available slot, beginning the search from the tail-to-head. - If no slots are available, the array is grown. The method doesn't return until successful. - - The element to add. - Information about where the add happened, to enable O(1) deregistration. - - - - The head of the doubly linked list. - - - - - The tail of the doubly linked list. - - - - - A struct to hold a link to the exact spot in an array an element was inserted, enabling - constant time removal later on. - - - - - A fragment of a sparsely populated array, doubly linked. - - The kind of elements contained within. - - - - Represents a synchronization primitive that is signaled when its count reaches zero. - - - All public and protected members of are thread-safe and may be used - concurrently from multiple threads, with the exception of Dispose, which - must only be used when all other operations on the have - completed, and Reset, which should only be used when no other threads are - accessing the event. - - - - - Initializes a new instance of class with the - specified count. - - The number of signals required to set the . - is less - than 0. - - - - Releases all resources used by the current instance of . - - - Unlike most of the members of , is not - thread-safe and may not be used concurrently with other members of this instance. - - - - - When overridden in a derived class, releases the unmanaged resources used by the - , and optionally releases the managed resources. - - true to release both managed and unmanaged resources; false to release - only unmanaged resources. - - Unlike most of the members of , is not - thread-safe and may not be used concurrently with other members of this instance. - - - - - Registers a signal with the , decrementing its - count. - - true if the signal caused the count to reach zero and the event was set; otherwise, - false. - The current instance is already set. - - The current instance has already been - disposed. - - - - Registers multiple signals with the , - decrementing its count by the specified amount. - - The number of signals to register. - true if the signals caused the count to reach zero and the event was set; otherwise, - false. - - The current instance is already set. -or- Or is greater than . - - is less - than 1. - The current instance has already been - disposed. - - - - Increments the 's current count by one. - - The current instance is already - set. - is equal to . - - The current instance has already been disposed. - - - - - Attempts to increment the 's current count by one. - - true if the increment succeeded; otherwise, false. If is - already at zero. this will return false. - is equal to . - The current instance has already been - disposed. - - - - Increments the 's current count by a specified - value. - - The value by which to increase . - is less than - 0. - The current instance is already - set. - is equal to . - The current instance has already been - disposed. - - - - Attempts to increment the 's current count by a - specified value. - - The value by which to increase . - true if the increment succeeded; otherwise, false. If is - already at zero this will return false. - is less - than 0. - The current instance is already - set. - is equal to . - The current instance has already been - disposed. - - - - Resets the to the value of . - - - Unlike most of the members of , Reset is not - thread-safe and may not be used concurrently with other members of this instance. - - The current instance has already been - disposed.. - - - - Resets the to a specified value. - - The number of signals required to set the . - - Unlike most of the members of , Reset is not - thread-safe and may not be used concurrently with other members of this instance. - - is - less than 0. - The current instance has alread been disposed. - - - - Blocks the current thread until the is set. - - - The caller of this method blocks indefinitely until the current instance is set. The caller will - return immediately if the event is currently in a set state. - - The current instance has already been - disposed. - - - - Blocks the current thread until the is set, while - observing a . - - The to - observe. - - The caller of this method blocks indefinitely until the current instance is set. The caller will - return immediately if the event is currently in a set state. If the - CancellationToken being observed - is canceled during the wait operation, an - will be thrown. - - has been - canceled. - The current instance has already been - disposed. - - - - Blocks the current thread until the is set, using a - to measure the time interval. - - A that represents the number of - milliseconds to wait, or a that represents -1 milliseconds to - wait indefinitely. - true if the was set; otherwise, - false. - is a negative - number other than -1 milliseconds, which represents an infinite time-out -or- timeout is greater - than . - The current instance has already been - disposed. - - - - Blocks the current thread until the is set, using - a to measure the time interval, while observing a - . - - A that represents the number of - milliseconds to wait, or a that represents -1 milliseconds to - wait indefinitely. - The to - observe. - true if the was set; otherwise, - false. - is a negative - number other than -1 milliseconds, which represents an infinite time-out -or- timeout is greater - than . - The current instance has already been - disposed. - has - been canceled. - - - - Blocks the current thread until the is set, using a - 32-bit signed integer to measure the time interval. - - The number of milliseconds to wait, or (-1) to wait indefinitely. - true if the was set; otherwise, - false. - is a - negative number other than -1, which represents an infinite time-out. - The current instance has already been - disposed. - - - - Blocks the current thread until the is set, using a - 32-bit signed integer to measure the time interval, while observing a - . - - The number of milliseconds to wait, or (-1) to wait indefinitely. - The to - observe. - true if the was set; otherwise, - false. - is a - negative number other than -1, which represents an infinite time-out. - The current instance has already been - disposed. - has - been canceled. - - - - Throws an exception if the latch has been disposed. - - - - - Gets the number of remaining signals required to set the event. - - - The number of remaining signals required to set the event. - - - - - Gets the numbers of signals initially required to set the event. - - - The number of signals initially required to set the event. - - - - - Determines whether the event is set. - - true if the event is set; otherwise, false. - - - - Gets a that is used to wait for the event to be set. - - A that is used to wait for the event to be set. - The current instance has already been disposed. - - should only be used if it's needed for integration with code bases - that rely on having a WaitHandle. If all that's needed is to wait for the - to be set, the method should be preferred. - - - - - Provides a slimmed down version of . - - - All public and protected members of are thread-safe and may be used - concurrently from multiple threads, with the exception of Dispose, which - must only be used when all other operations on the have - completed, and Reset, which should only be used when no other threads are - accessing the event. - - - - - Initializes a new instance of the - class with an initial state of nonsignaled. - - - - - Initializes a new instance of the - class with a Boolen value indicating whether to set the intial state to signaled. - - true to set the initial state signaled; false to set the initial state - to nonsignaled. - - - - Initializes a new instance of the - class with a Boolen value indicating whether to set the intial state to signaled and a specified - spin count. - - true to set the initial state to signaled; false to set the initial state - to nonsignaled. - The number of spin waits that will occur before falling back to a true - wait. - is less than - 0 or greater than the maximum allowed value. - - - - Initializes the internal state of the event. - - Whether the event is set initially or not. - The spin count that decides when the event will block. - - - - Helper to ensure the lock object is created before first use. - - - - - This method lazily initializes the event object. It uses CAS to guarantee that - many threads racing to call this at once don't result in more than one event - being stored and used. The event will be signaled or unsignaled depending on - the state of the thin-event itself, with synchronization taken into account. - - True if a new event was created and stored, false otherwise. - - - - Sets the state of the event to signaled, which allows one or more threads waiting on the event to - proceed. - - - - - Private helper to actually perform the Set. - - Indicates whether we are calling Set() during cancellation. - The object has been canceled. - - - - Sets the state of the event to nonsignaled, which causes threads to block. - - - Unlike most of the members of , is not - thread-safe and may not be used concurrently with other members of this instance. - - - - - Blocks the current thread until the current is set. - - - The maximum number of waiters has been exceeded. - - - The caller of this method blocks indefinitely until the current instance is set. The caller will - return immediately if the event is currently in a set state. - - - - - Blocks the current thread until the current receives a signal, - while observing a . - - The to - observe. - - The maximum number of waiters has been exceeded. - - was - canceled. - - The caller of this method blocks indefinitely until the current instance is set. The caller will - return immediately if the event is currently in a set state. - - - - - Blocks the current thread until the current is set, using a - to measure the time interval. - - A that represents the number of milliseconds - to wait, or a that represents -1 milliseconds to wait indefinitely. - - true if the was set; otherwise, - false. - is a negative - number other than -1 milliseconds, which represents an infinite time-out -or- timeout is greater - than . - - The maximum number of waiters has been exceeded. - - - - - Blocks the current thread until the current is set, using a - to measure the time interval, while observing a . - - A that represents the number of milliseconds - to wait, or a that represents -1 milliseconds to wait indefinitely. - - The to - observe. - true if the was set; otherwise, - false. - is a negative - number other than -1 milliseconds, which represents an infinite time-out -or- timeout is greater - than . - was canceled. - - The maximum number of waiters has been exceeded. - - - - - Blocks the current thread until the current is set, using a - 32-bit signed integer to measure the time interval. - - The number of milliseconds to wait, or (-1) to wait indefinitely. - true if the was set; otherwise, - false. - is a - negative number other than -1, which represents an infinite time-out. - - The maximum number of waiters has been exceeded. - - - - - Blocks the current thread until the current is set, using a - 32-bit signed integer to measure the time interval, while observing a . - - The number of milliseconds to wait, or (-1) to wait indefinitely. - The to - observe. - true if the was set; otherwise, - false. - is a - negative number other than -1, which represents an infinite time-out. - - The maximum number of waiters has been exceeded. - - was canceled. - - - - Releases all resources used by the current instance of . - - - Unlike most of the members of , is not - thread-safe and may not be used concurrently with other members of this instance. - - - - - When overridden in a derived class, releases the unmanaged resources used by the - , and optionally releases the managed resources. - - true to release both managed and unmanaged resources; - false to release only unmanaged resources. - - Unlike most of the members of , is not - thread-safe and may not be used concurrently with other members of this instance. - - - - - Throw ObjectDisposedException if the MRES is disposed - - - - - Private helper method to wake up waiters when a cancellationToken gets canceled. - - - - - Private helper method for updating parts of a bit-string state value. - Mainly called from the IsSet and Waiters properties setters - - - Note: the parameter types must be int as CompareExchange cannot take a Uint - - The new value - The mask used to set the bits - - - - Private helper method - performs Mask and shift, particular helpful to extract a field from a packed word. - eg ExtractStatePortionAndShiftRight(0x12345678, 0xFF000000, 24) => 0x12, ie extracting the top 8-bits as a simple integer - - ?? is there a common place to put this rather than being private to MRES? - - - - - - - - - Performs a Mask operation, but does not perform the shift. - This is acceptable for boolean values for which the shift is unnecessary - eg (val & Mask) != 0 is an appropriate way to extract a boolean rather than using - ((val & Mask) >> shiftAmount) == 1 - - ?? is there a common place to put this rather than being private to MRES? - - - - - - - Helper function to measure and update the wait time - - The first time (in Ticks) observed when the wait started. - The orginal wait timeoutout in milliseconds. - The new wait time in milliseconds, -1 if the time expired, -2 if overflow in counters - has occurred. - - - - Gets the underlying object for this . - - The underlying event object fore this . - - Accessing this property forces initialization of an underlying event object if one hasn't - already been created. To simply wait on this , - the public Wait methods should be preferred. - - - - - Gets whether the event is set. - - true if the event has is set; otherwise, false. - - - - Gets the number of spin waits that will be occur before falling back to a true wait. - - - - - How many threads are waiting. - - - - - Provides support for lazy initialization. - - Specifies the type of element being laziliy initialized. - - - By default, all public and protected members of are thread-safe and may be used - concurrently from multiple threads. These thread-safety guarantees may be removed optionally and per instance - using parameters to the type's constructors. - - - - - - Initializes a new instance of the class that - uses 's default constructor for lazy initialization. - - - An instance created with this constructor may be used concurrently from multiple threads. - - - - - Initializes a new instance of the class that uses a - specified initialization function. - - - The invoked to produce the lazily-initialized value when it is - needed. - - is a null - reference (Nothing in Visual Basic). - - An instance created with this constructor may be used concurrently from multiple threads. - - - - - Initializes a new instance of the - class that uses 's default constructor and a specified thread-safety mode. - - true if this instance should be usable by multiple threads concurrently; false if the instance will only be used by one thread at a time. - - - - - Initializes a new instance of the - class that uses 's default constructor and a specified thread-safety mode. - - The lazy thread-safety mode mode - mode contains an invalid valuee - - - - Initializes a new instance of the class - that uses a specified initialization function and a specified thread-safety mode. - - - The invoked to produce the lazily-initialized value when it is needed. - - true if this instance should be usable by multiple threads concurrently; false if the instance will only be used by one thread at a time. - - is - a null reference (Nothing in Visual Basic). - - - - Initializes a new instance of the class - that uses a specified initialization function and a specified thread-safety mode. - - - The invoked to produce the lazily-initialized value when it is needed. - - The lazy thread-safety mode. - is - a null reference (Nothing in Visual Basic). - mode contains an invalid value. - - - - Static helper function that returns an object based on the given mode. it also throws an exception if the mode is invalid - - - - Forces initialization during serialization. - The StreamingContext for the serialization operation. - - - Creates and returns a string representation of this instance. - The result of calling on the . - - The is null. - - - - - local helper method to initialize the value - - The inititialized T value - - - Creates an instance of T using m_valueFactory in case its not null or use reflection to create a new T() - An instance of Boxed. - - - Gets the value of the Lazy<T> for debugging display purposes. - - - - Gets a value indicating whether this instance may be used concurrently from multiple threads. - - - - - Gets whether the value creation is faulted or not - - - - Gets a value indicating whether the has been initialized. - - true if the instance has been initialized; - otherwise, false. - - The initialization of a instance may result in either - a value being produced or an exception being thrown. If an exception goes unhandled during initialization, - will return false. - - - - - - wrapper class to box the initialized value, this is mainly created to avoid boxing/unboxing the value each time the value is called in case T is - a value type - - - - - Wrapper class to wrap the excpetion thrown by the value factory - - - - A debugger view of the Lazy<T> to surface additional debugging properties and - to ensure that the Lazy<T> does not become initialized if it was not already. - - - Constructs a new debugger view object for the provided Lazy object. - A Lazy object to browse in the debugger. - - - Returns whether the Lazy object is initialized or not. - - - Returns the value of the Lazy object. - - - Returns the execution mode of the Lazy object - - - Returns the execution mode of the Lazy object - - - - Specifies how a instance should synchronize access among multiple threads. - - - - - This mode makes no guarantees around the thread-safety of the instance. If used from multiple threads, the behavior of the is undefined. - This mode should be used when a is guaranteed to never be initialized from more than one thread simultaneously and high performance is crucial. - If valueFactory throws an exception when the is initialized, the exception will be cached and returned on subsequent accesses to Value. Also, if valueFactory recursively - accesses Value on this instance, a will be thrown. - - - - - When multiple threads attempt to simultaneously initialize a instance, this mode allows each thread to execute the - valueFactory but only the first thread to complete initialization will be allowed to set the final value of the . - Once initialized successfully, any future calls to Value will return the cached result. If valueFactory throws an exception on any thread, that exception will be - propagated out of Value. If any thread executes valueFactory without throwing an exception and, therefore, successfully sets the value, that value will be returned on - subsequent accesses to Value from any thread. If no thread succeeds in setting the value, IsValueCreated will remain false and subsequent accesses to Value will result in - the valueFactory delegate re-executing. Also, if valueFactory recursively accesses Value on this instance, an exception will NOT be thrown. - - - - - This mode uses locks to ensure that only a single thread can initialize a instance in a thread-safe manner. In general, - taken if this mode is used in conjunction with a valueFactory delegate that uses locks internally, a deadlock can occur if not - handled carefully. If valueFactory throws an exception when the is initialized, the exception will be cached and returned on - subsequent accesses to Value. Also, if valueFactory recursively accesses Value on this instance, a will be thrown. - - - - - Provides lazy initialization routines. - - - These routines avoid needing to allocate a dedicated, lazy-initialization instance, instead using - references to ensure targets have been initialized as they are accessed. - - - - - Initializes a target reference type with the type's default constructor if the target has not - already been initialized. - - The refence type of the reference to be initialized. - A reference of type to initialize if it has not - already been initialized. - The initialized reference of type . - Type does not have a default - constructor. - - Permissions to access the constructor of type were missing. - - - - This method may only be used on reference types. To ensure initialization of value - types, see other overloads of EnsureInitialized. - - - This method may be used concurrently by multiple threads to initialize . - In the event that multiple threads access this method concurrently, multiple instances of - may be created, but only one will be stored into . In such an occurrence, this method will not dispose of the - objects that were not stored. If such objects must be disposed, it is up to the caller to determine - if an object was not used and to then dispose of the object appropriately. - - - - - - Initializes a target reference type using the specified function if it has not already been - initialized. - - The reference type of the reference to be initialized. - The reference of type to initialize if it has not - already been initialized. - The invoked to initialize the - reference. - The initialized reference of type . - Type does not have a - default constructor. - returned - null. - - - This method may only be used on reference types, and may - not return a null reference (Nothing in Visual Basic). To ensure initialization of value types or - to allow null reference types, see other overloads of EnsureInitialized. - - - This method may be used concurrently by multiple threads to initialize . - In the event that multiple threads access this method concurrently, multiple instances of - may be created, but only one will be stored into . In such an occurrence, this method will not dispose of the - objects that were not stored. If such objects must be disposed, it is up to the caller to determine - if an object was not used and to then dispose of the object appropriately. - - - - - - Initialize the target using the given delegate (slow path). - - The reference type of the reference to be initialized. - The variable that need to be initialized - The delegate that will be executed to initialize the target - The initialized variable - - - - Initializes a target reference or value type with its default constructor if it has not already - been initialized. - - The type of the reference to be initialized. - A reference or value of type to initialize if it - has not already been initialized. - A reference to a boolean that determines whether the target has already - been initialized. - A reference to an object used as the mutually exclusive lock for initializing - . - The initialized value of type . - - - - Initializes a target reference or value type with a specified function if it has not already been - initialized. - - The type of the reference to be initialized. - A reference or value of type to initialize if it - has not already been initialized. - A reference to a boolean that determines whether the target has already - been initialized. - A reference to an object used as the mutually exclusive lock for initializing - . - The invoked to initialize the - reference or value. - The initialized value of type . - - - - Ensure the target is initialized and return the value (slow path). This overload permits nulls - and also works for value type targets. Uses the supplied function to create the value. - - The type of target. - A reference to the target to be initialized. - A reference to a location tracking whether the target has been initialized. - A reference to a location containing a mutual exclusive lock. - - The to invoke in order to produce the lazily-initialized value. - - The initialized object. - - - - A seprate non generic class that contains a global counter for fast path instances for all Ts that has been created, and adds an upper limit for all instances - that uses the fast path, if this limit has been reached, all new instances will use the slow path - - - - - Provides thread-local storage of data. - - Specifies the type of data stored per-thread. - - - With the exception of , all public and protected members of - are thread-safe and may be used - concurrently from multiple threads. - - - - - - Initializes the instance. - - - - - Initializes the instance with the - specified function. - - - The invoked to produce a lazily-initialized value when - an attempt is made to retrieve without it having been previously initialized. - - - is a null reference (Nothing in Visual Basic). - - - - - Releases the resources used by this instance. - - - - - Releases the resources used by this instance. - - - Unlike most of the members of , this method is not thread-safe. - - - - - Releases the resources used by this instance. - - - A Boolean value that indicates whether this method is being called due to a call to . - - - Unlike most of the members of , this method is not thread-safe. - - - - - Tries to get a unique index for the current instance of type T, it first tries to get it from the pool if it is not empty, otherwise it - increments the global counter if it is still below the maximum, otherwise it fails and returns -1 - - True if there is an index available, false otherwise - - - - Gets an array of types that will be used as generic parameters for the GenericHolder class - - The types array - - - Creates and returns a string representation of this instance for the current thread. - The result of calling on the . - - The for the current thread is a null reference (Nothing in Visual Basic). - - - The initialization function referenced in an improper manner. - - - The instance has been disposed. - - - Calling this method forces initialization for the current thread, as is the - case with accessing directly. - - - - - Private helper function to lazily create the value using the calueSelector if specified in the constructor or the default parameterless constructor - - Returns the boxed object - - - - Gets or sets the value of this instance for the current thread. - - - The initialization function referenced in an improper manner. - - - The instance has been disposed. - - - If this instance was not previously initialized for the current thread, - accessing will attempt to initialize it. If an initialization function was - supplied during the construction, that initialization will happen by invoking the function - to retrieve the initial value for . Otherwise, the default value of - will be used. - - - - - Gets whether is initialized on the current thread. - - - The instance has been disposed. - - - - Gets the value of the ThreadLocal<T> for debugging display purposes. It takes care of getting - the value for the current thread in the ThreadLocal mode. - - - - The base abstract class for the holder - - - - - The TLS holder representation - - - - - The generic holder representation - - Dummy param - Dummy param - Dummy param - - - - wrapper to the actual value - - - - A debugger view of the ThreadLocal<T> to surface additional debugging properties and - to ensure that the ThreadLocal<T> does not become initialized if it was not already. - - - Constructs a new debugger view object for the provided ThreadLocal object. - A ThreadLocal object to browse in the debugger. - - - Returns whether the ThreadLocal object is initialized or not. - - - Returns the value of the ThreadLocal object. - - - - Limits the number of threads that can access a resource or pool of resources concurrently. - - - - The provides a lightweight semaphore class that doesn't - use Windows kernel semaphores. - - - All public and protected members of are thread-safe and may be used - concurrently from multiple threads, with the exception of Dispose, which - must only be used when all other operations on the have - completed. - - - - - - Initializes a new instance of the class, specifying - the initial number of requests that can be granted concurrently. - - The initial number of requests for the semaphore that can be granted - concurrently. - - is less than 0. - - - - Initializes a new instance of the class, specifying - the initial and maximum number of requests that can be granted concurrently. - - The initial number of requests for the semaphore that can be granted - concurrently. - The maximum number of requests for the semaphore that can be granted - concurrently. - - is less than 0. -or- - is greater than . -or- - is less than 0. - - - - Blocks the current thread until it can enter the . - - The current instance has already been - disposed. - - - - Blocks the current thread until it can enter the , while observing a - . - - The token to - observe. - was - canceled. - The current instance has already been - disposed. - - - - Blocks the current thread until it can enter the , using a to measure the time interval. - - A that represents the number of milliseconds - to wait, or a that represents -1 milliseconds to wait indefinitely. - - true if the current thread successfully entered the ; - otherwise, false. - is a negative - number other than -1 milliseconds, which represents an infinite time-out -or- timeout is greater - than . - - - - Blocks the current thread until it can enter the , using a to measure the time interval, while observing a . - - A that represents the number of milliseconds - to wait, or a that represents -1 milliseconds to wait indefinitely. - - The to - observe. - true if the current thread successfully entered the ; - otherwise, false. - is a negative - number other than -1 milliseconds, which represents an infinite time-out -or- timeout is greater - than . - was canceled. - - - - Blocks the current thread until it can enter the , using a 32-bit - signed integer to measure the time interval. - - The number of milliseconds to wait, or (-1) to wait indefinitely. - true if the current thread successfully entered the ; - otherwise, false. - is a - negative number other than -1, which represents an infinite time-out. - - - - Blocks the current thread until it can enter the , - using a 32-bit signed integer to measure the time interval, - while observing a . - - The number of milliseconds to wait, or (-1) to - wait indefinitely. - The to observe. - true if the current thread successfully entered the ; otherwise, false. - is a negative number other than -1, - which represents an infinite time-out. - was canceled. - - - - Local helper function, waits on the monitor until the monitor recieves signal or the - timeout is expired - - The maximum timeout - The start ticks to calculate the elapsed time - The CancellationToken to observe. - true if the monitor recieved a signal, false if the timeout expired - - - - Exits the once. - - The previous count of the . - The current instance has already been - disposed. - - - - Exits the a specified number of times. - - The number of times to exit the semaphore. - The previous count of the . - is less - than 1. - The has - already reached its maximum size. - The current instance has already been - disposed. - - - - Releases all resources used by the current instance of . - - - Unlike most of the members of , is not - thread-safe and may not be used concurrently with other members of this instance. - - - - - When overridden in a derived class, releases the unmanaged resources used by the - , and optionally releases the managed resources. - - true to release both managed and unmanaged resources; - false to release only unmanaged resources. - - Unlike most of the members of , is not - thread-safe and may not be used concurrently with other members of this instance. - - - - - Helper function to measure and update the wait time - - The first time (in Ticks) observed when the wait started - The orginal wait timeoutout in milliseconds - The new wait time in milliseconds, -1 if the time expired - - - - Private helper method to wake up waiters when a cancellationToken gets canceled. - - - - - Checks the dispose status by checking the lock object, if it is null means that object - has been disposed and throw ObjectDisposedException - - - - - local helper function to retrieve the exception string message from the resource file - - The key string - - - - Gets the current count of the . - - The current count of the . - - - - Returns a that can be used to wait on the semaphore. - - A that can be used to wait on the - semaphore. - - A successful wait on the does not imply a successful wait on - the itself, nor does it decrement the semaphore's - count. exists to allow a thread to block waiting on multiple - semaphores, but such a wait should be followed by a true wait on the target semaphore. - - The has been disposed. - - - - Provides support for spin-based waiting. - - - - encapsulates common spinning logic. On single-processor machines, yields are - always used instead of busy waits, and on computers with Intel™ processors employing Hyper-Threading™ - technology, it helps to prevent hardware thread starvation. SpinWait encapsulates a good mixture of - spinning and true yielding. - - - is a value type, which means that low-level code can utilize SpinWait without - fear of unnecessary allocation overheads. SpinWait is not generally useful for ordinary applications. - In most cases, you should use the synchronization classes provided by the .NET Framework, such as - . For most purposes where spin waiting is required, however, - the type should be preferred over the method. - - - While SpinWait is designed to be used in concurrent applications, it is not designed to be - used from multiple threads concurrently. SpinWait's members are not thread-safe. If multiple - threads must spin, each should use its own instance of SpinWait. - - - - - - Performs a single spin. - - - This is typically called in a loop, and may change in behavior based on the number of times a - has been called thus far on this instance. - - - - - Resets the spin counter. - - - This makes and behave as though no calls - to had been issued on this instance. If a instance - is reused many times, it may be useful to reset it to avoid yielding too soon. - - - - - Spins until the specified condition is satisfied. - - A delegate to be executed over and over until it returns true. - The argument is null. - - - - Spins until the specified condition is satisfied or until the specified timeout is expired. - - A delegate to be executed over and over until it returns true. - - A that represents the number of milliseconds to wait, - or a TimeSpan that represents -1 milliseconds to wait indefinitely. - True if the condition is satisfied within the timeout; otherwise, false - The argument is null. - is a negative number - other than -1 milliseconds, which represents an infinite time-out -or- timeout is greater than - . - - - - Spins until the specified condition is satisfied or until the specified timeout is expired. - - A delegate to be executed over and over until it returns true. - The number of milliseconds to wait, or (-1) to wait indefinitely. - True if the condition is satisfied within the timeout; otherwise, false - The argument is null. - is a - negative number other than -1, which represents an infinite time-out. - - - - Gets the number of times has been called on this instance. - - - - - Gets whether the next call to will yield the processor, triggering a - forced context switch. - - Whether the next call to will yield the processor, triggering a - forced context switch. - - On a single-CPU machine, always yields the processor. On machines with - multiple CPUs, may yield after an unspecified number of calls. - - - - - A helper class to get the number of preocessors, it updates the numbers of processors every sampling interval - - - - - Gets the number of available processors - - - - - Gets whether the current machine has only a single processor. - - - - - Provides a mutual exclusion lock primitive where a thread trying to acquire the lock waits in a loop - repeatedly checking until the lock becomes available. - - - - Spin locks can be used for leaf-level locks where the object allocation implied by using a , in size or due to garbage collection pressure, is overly - expensive. Avoiding blocking is another reason that a spin lock can be useful, however if you expect - any significant amount of blocking, you are probably best not using spin locks due to excessive - spinning. Spinning can be beneficial when locks are fine grained and large in number (for example, a - lock per node in a linked list) as well as when lock hold times are always extremely short. In - general, while holding a spin lock, one should avoid blocking, calling anything that itself may - block, holding more than one spin lock at once, making dynamically dispatched calls (interface and - virtuals), making statically dispatched calls into any code one doesn't own, or allocating memory. - - - should only be used when it's been determined that doing so will improve an - application's performance. It's also important to note that is a value type, - for performance reasons. As such, one must be very careful not to accidentally copy a SpinLock - instance, as the two instances (the original and the copy) would then be completely independent of - one another, which would likely lead to erroneous behavior of the application. If a SpinLock instance - must be passed around, it should be passed by reference rather than by value. - - - Do not store instances in readonly fields. - - - All members of are thread-safe and may be used from multiple threads - concurrently. - - - - - - Initializes a new instance of the - structure with the option to track thread IDs to improve debugging. - - - The default constructor for tracks thread ownership. - - Whether to capture and use thread IDs for debugging - purposes. - - - - Initializes a new instance of the - structure with the option to track thread IDs to improve debugging. - - - The default constructor for tracks thread ownership. - - - Acquires the lock in a reliable manner, such that even if an exception occurs within the method - call, can be examined reliably to determine whether the lock was - acquired. - - - is a non-reentrant lock, meaning that if a thread holds the lock, it is - not allowed to enter the lock again. If thread ownership tracking is enabled (whether it's - enabled is available through ), an exception will be - thrown when a thread tries to re-enter a lock it already holds. However, if thread ownership - tracking is disabled, attempting to enter a lock already held will result in deadlock. - - True if the lock is acquired; otherwise, false. must be initialized to false prior to calling this method. - - Thread ownership tracking is enabled, and the current thread has already acquired this lock. - - - The argument must be initialized to false prior to calling Enter. - - - - - Attempts to acquire the lock in a reliable manner, such that even if an exception occurs within - the method call, can be examined reliably to determine whether the - lock was acquired. - - - Unlike , TryEnter will not block waiting for the lock to be available. If the - lock is not available when TryEnter is called, it will return immediately without any further - spinning. - - True if the lock is acquired; otherwise, false. must be initialized to false prior to calling this method. - - Thread ownership tracking is enabled, and the current thread has already acquired this lock. - - - The argument must be initialized to false prior to calling TryEnter. - - - - - Attempts to acquire the lock in a reliable manner, such that even if an exception occurs within - the method call, can be examined reliably to determine whether the - lock was acquired. - - - Unlike , TryEnter will not block indefinitely waiting for the lock to be - available. It will block until either the lock is available or until the - has expired. - - A that represents the number of milliseconds - to wait, or a that represents -1 milliseconds to wait indefinitely. - - True if the lock is acquired; otherwise, false. must be initialized to false prior to calling this method. - - Thread ownership tracking is enabled, and the current thread has already acquired this lock. - - - The argument must be initialized to false prior to calling TryEnter. - - is a negative - number other than -1 milliseconds, which represents an infinite time-out -or- timeout is greater - than milliseconds. - - - - - Attempts to acquire the lock in a reliable manner, such that even if an exception occurs within - the method call, can be examined reliably to determine whether the - lock was acquired. - - - Unlike , TryEnter will not block indefinitely waiting for the lock to be - available. It will block until either the lock is available or until the has expired. - - The number of milliseconds to wait, or (-1) to wait indefinitely. - True if the lock is acquired; otherwise, false. must be initialized to false prior to calling this method. - - Thread ownership tracking is enabled, and the current thread has already acquired this lock. - - - The argument must be initialized to false prior to calling TryEnter. - - is - a negative number other than -1, which represents an infinite time-out. - - - - Try acquire the lock with long path, this is usually called after the first path in Enter and - TryEnter failed The reason for short path is to make it inline in the run time which improves the - performance. This method assumed that the parameter are validated in Enter ir TryENter method - - The timeout milliseconds - The lockTaken param - - - - decrements the waiters, in case of the timeout is expired - - - - - ContinueTryEnter for the thread tracking mode enabled - - - - - Helper function to validate the timeout - - The start time in ticks - The orginal wait time - True if expired, false otherwise - - - - Releases the lock. - - - The default overload of provides the same behavior as if calling using true as the argument. - - - Thread ownership tracking is enabled, and the current thread is not the owner of this lock. - - - - - Releases the lock. - - - A Boolean value that indicates whether a memory fence should be issued in order to immediately - publish the exit operation to other threads. - - - Calling with the argument set to - true will improve the fairness of the lock at the expense of some performance. The default - overload behaves as if specifying true for . - - - Thread ownership tracking is enabled, and the current thread is not the owner of this lock. - - - - - Gets whether the lock is currently held by any thread. - - - - - Gets whether the lock is currently held by any thread. - - - Gets whether the lock is held by the current thread. - - - If the lock was initialized to track owner threads, this will return whether the lock is acquired - by the current thread. It is invalid to use this property when the lock was initialized to not - track thread ownership. - - - Thread ownership tracking is disabled. - - - - Gets whether thread ownership tracking is enabled for this instance. - - - - Internal class used by debug type proxy attribute to display the owner thread ID - - - - - SystemThreading_SpinLockDebugView constructor - - The SpinLock to be proxied. - - - - Checks if the lock is held by the current thread or not - - - - - Gets the current owner thread, zero if it is released - - - - - Gets whether the lock is currently held by any thread or not. - - - - - Stores options that configure the operation of methods on the - Parallel class. - - - By default, methods on the Parallel class attempt to utilize all available processors, are non-cancelable, and target - the default TaskScheduler (TaskScheduler.Default). enables - overriding these defaults. - - - - - Initializes a new instance of the class. - - - This constructor initializes the instance with default values. - is initialized to -1, signifying that there is no upper bound set on how much parallelism should - be employed. is initialized to a non-cancelable token, - and is initialized to the default scheduler (TaskScheduler.Default). - All of these defaults may be overwritten using the property set accessors on the instance. - - - - - Gets or sets the TaskScheduler - associated with this instance. Setting this property to null - indicates that the current scheduler should be used. - - - - - Gets or sets the maximum degree of parallelism enabled by this ParallelOptions instance. - - - The limits the number of concurrent operations run by Parallel method calls that are passed this - ParallelOptions instance to the set value, if it is positive. If is -1, then there is no limit placed on the number of concurrently - running operations. - - - The exception that is thrown when this is set to 0 or some - value less than -1. - - - - - Gets or sets the CancellationToken - associated with this instance. - - - Providing a CancellationToken - to a Parallel method enables the operation to be - exited early. Code external to the operation may cancel the token, and if the operation observes the - token being set, it may exit early by throwing an - . - - - - - Provides support for parallel loops and regions. - - - The class provides library-based data parallel replacements - for common operations such as for loops, for each loops, and execution of a set of statements. - - - - - Executes each of the provided actions, possibly in parallel. - - An array of Actions to execute. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null element. - The exception that is thrown when any - action in the array throws an exception. - - This method can be used to execute a set of operations, potentially in parallel. - No guarantees are made about the order in which the operations execute or whether - they execute in parallel. This method does not return until each of the - provided operations has completed, regardless of whether completion - occurs due to normal or exceptional termination. - - - - - Executes each of the provided actions, possibly in parallel. - - A ParallelOptions - instance that configures the behavior of this operation. - An array of Actions to execute. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null element. - The exception that is thrown when - the CancellationToken in the - is set. - The exception that is thrown when any - action in the array throws an exception. - The exception that is thrown when the - the CancellationTokenSource associated with the - the CancellationToken in the - has been disposed. - - This method can be used to execute a set of operations, potentially in parallel. - No guarantees are made about the order in which the operations execute or whether - the they execute in parallel. This method does not return until each of the - provided operations has completed, regardless of whether completion - occurs due to normal or exceptional termination. - - - - - Executes a for loop in which iterations may run in parallel. - - The start index, inclusive. - The end index, exclusive. - The delegate that is invoked once per iteration. - The exception that is thrown when the - argument is null. - The exception that is thrown to contain an exception - thrown from one of the specified delegates. - A ParallelLoopResult structure - that contains information on what portion of the loop completed. - - The delegate is invoked once for each value in the iteration range: - [fromInclusive, toExclusive). It is provided with the iteration count (an Int32) as a parameter. - - - - - Executes a for loop in which iterations may run in parallel. - - The start index, inclusive. - The end index, exclusive. - The delegate that is invoked once per iteration. - The exception that is thrown when the - argument is null. - The exception that is thrown to contain an exception - thrown from one of the specified delegates. - A ParallelLoopResult structure - that contains information on what portion of the loop completed. - - The delegate is invoked once for each value in the iteration range: - [fromInclusive, toExclusive). It is provided with the iteration count (an Int64) as a parameter. - - - - - Executes a for loop in which iterations may run in parallel. - - The start index, inclusive. - The end index, exclusive. - A ParallelOptions - instance that configures the behavior of this operation. - The delegate that is invoked once per iteration. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - CancellationToken in the - argument is set. - The exception that is thrown to contain an exception - thrown from one of the specified delegates. - The exception that is thrown when the - the CancellationTokenSource associated with the - the CancellationToken in the - has been disposed. - A ParallelLoopResult structure - that contains information on what portion of the loop completed. - - The delegate is invoked once for each value in the iteration range: - [fromInclusive, toExclusive). It is provided with the iteration count (an Int32) as a parameter. - - - - - Executes a for loop in which iterations may run in parallel. - - The start index, inclusive. - The end index, exclusive. - A ParallelOptions - instance that configures the behavior of this operation. - The delegate that is invoked once per iteration. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - CancellationToken in the - argument is set. - The exception that is thrown to contain an exception - thrown from one of the specified delegates. - The exception that is thrown when the - the CancellationTokenSource associated with the - the CancellationToken in the - has been disposed. - A ParallelLoopResult structure - that contains information on what portion of the loop completed. - - The delegate is invoked once for each value in the iteration range: - [fromInclusive, toExclusive). It is provided with the iteration count (an Int64) as a parameter. - - - - - Executes a for loop in which iterations may run in parallel. - - The start index, inclusive. - The end index, exclusive. - The delegate that is invoked once per iteration. - The exception that is thrown when the - argument is null. - The exception that is thrown to contain an exception - thrown from one of the specified delegates. - A ParallelLoopResult structure - that contains information on what portion of the loop completed. - - - The delegate is invoked once for each value in the iteration range: - [fromInclusive, toExclusive). It is provided with the following parameters: the iteration count (an Int32), - and a ParallelLoopState instance that may be - used to break out of the loop prematurely. - - - Calling ParallelLoopState.Break() - informs the For operation that iterations after the current one need not - execute. However, all iterations before the current one will still need to be executed if they have not already. - Therefore, calling Break is similar to using a break operation within a - conventional for loop in a language like C#, but it is not a perfect substitute: for example, there is no guarantee that iterations - after the current one will definitely not execute. - - - If executing all iterations before the current one is not necessary, - ParallelLoopState.Stop() - should be preferred to using Break. Calling Stop informs the For loop that it may abandon all remaining - iterations, regardless of whether they're for interations above or below the current, - since all required work has already been completed. As with Break, however, there are no guarantees regarding - which other iterations will not execute. - - - When a loop is ended prematurely, the that's returned will contain - relevant information about the loop's completion. - - - - - - Executes a for loop in which iterations may run in parallel. - - The start index, inclusive. - The end index, exclusive. - The delegate that is invoked once per iteration. - The exception that is thrown when the - argument is null. - The exception that is thrown to contain an exception - thrown from one of the specified delegates. - A ParallelLoopResult structure - that contains information on what portion of the loop completed. - - The delegate is invoked once for each value in the iteration range: - [fromInclusive, toExclusive). It is provided with the following parameters: the iteration count (an Int64), - and a ParallelLoopState instance that may be - used to break out of the loop prematurely. - - - - - Executes a for loop in which iterations may run in parallel. - - The start index, inclusive. - The end index, exclusive. - A ParallelOptions - instance that configures the behavior of this operation. - The delegate that is invoked once per iteration. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - CancellationToken in the - argument is set. - The exception that is thrown to contain an exception - thrown from one of the specified delegates. - The exception that is thrown when the - the CancellationTokenSource associated with the - the CancellationToken in the - has been disposed. - A ParallelLoopResult structure - that contains information on what portion of the loop completed. - - The delegate is invoked once for each value in the iteration range: - [fromInclusive, toExclusive). It is provided with the following parameters: the iteration count (an Int32), - and a ParallelLoopState instance that may be - used to break out of the loop prematurely. - - - - - Executes a for loop in which iterations may run in parallel. - - The start index, inclusive. - The end index, exclusive. - A ParallelOptions - instance that configures the behavior of this operation. - The delegate that is invoked once per iteration. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - CancellationToken in the - argument is set. - The exception that is thrown to contain an exception - thrown from one of the specified delegates. - The exception that is thrown when the - the CancellationTokenSource associated with the - the CancellationToken in the - has been disposed. - A ParallelLoopResult structure - that contains information on what portion of the loop completed. - - The delegate is invoked once for each value in the iteration range: - [fromInclusive, toExclusive). It is provided with the following parameters: the iteration count (an Int64), - and a ParallelLoopState instance that may be - used to break out of the loop prematurely. - - - - - Executes a for loop in which iterations may run in parallel. - - The type of the thread-local data. - The start index, inclusive. - The end index, exclusive. - The function delegate that returns the initial state of the local data - for each thread. - The delegate that is invoked once per iteration. - The delegate that performs a final action on the local state of each - thread. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown to contain an exception - thrown from one of the specified delegates. - A ParallelLoopResult structure - that contains information on what portion of the loop completed. - - - The delegate is invoked once for each value in the iteration range: - [fromInclusive, toExclusive). It is provided with the following parameters: the iteration count (an Int32), - a ParallelLoopState instance that may be - used to break out of the loop prematurely, and some local state that may be shared amongst iterations - that execute on the same thread. - - - The delegate is invoked once for each thread that participates in the loop's - execution and returns the initial local state for each of those threads. These initial states are passed to the first - invocations on each thread. Then, every subsequent body invocation returns a possibly - modified state value that is passed to the next body invocation. Finally, the last body invocation on each thread returns a state value - that is passed to the delegate. The localFinally delegate is invoked once per thread to perform a final - action on each thread's local state. - - - - - - Executes a for loop in which iterations may run in parallel. Supports 64-bit indices. - - The type of the thread-local data. - The start index, inclusive. - The end index, exclusive. - The function delegate that returns the initial state of the local data - for each thread. - The delegate that is invoked once per iteration. - The delegate that performs a final action on the local state of each - thread. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown to contain an exception - thrown from one of the specified delegates. - A ParallelLoopResult structure - that contains information on what portion of the loop completed. - - - The delegate is invoked once for each value in the iteration range: - [fromInclusive, toExclusive). It is provided with the following parameters: the iteration count (an Int64), - a ParallelLoopState instance that may be - used to break out of the loop prematurely, and some local state that may be shared amongst iterations - that execute on the same thread. - - - The delegate is invoked once for each thread that participates in the loop's - execution and returns the initial local state for each of those threads. These initial states are passed to the first - invocations on each thread. Then, every subsequent body invocation returns a possibly - modified state value that is passed to the next body invocation. Finally, the last body invocation on each thread returns a state value - that is passed to the delegate. The localFinally delegate is invoked once per thread to perform a final - action on each thread's local state. - - - - - - Executes a for loop in which iterations may run in parallel. - - The type of the thread-local data. - The start index, inclusive. - The end index, exclusive. - A ParallelOptions - instance that configures the behavior of this operation. - The function delegate that returns the initial state of the local data - for each thread. - The delegate that is invoked once per iteration. - The delegate that performs a final action on the local state of each - thread. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - CancellationToken in the - argument is set. - The exception that is thrown to contain an exception - thrown from one of the specified delegates. - The exception that is thrown when the - the CancellationTokenSource associated with the - the CancellationToken in the - has been disposed. - A ParallelLoopResult structure - that contains information on what portion of the loop completed. - - - The delegate is invoked once for each value in the iteration range: - [fromInclusive, toExclusive). It is provided with the following parameters: the iteration count (an Int32), - a ParallelLoopState instance that may be - used to break out of the loop prematurely, and some local state that may be shared amongst iterations - that execute on the same thread. - - - The delegate is invoked once for each thread that participates in the loop's - execution and returns the initial local state for each of those threads. These initial states are passed to the first - invocations on each thread. Then, every subsequent body invocation returns a possibly - modified state value that is passed to the next body invocation. Finally, the last body invocation on each thread returns a state value - that is passed to the delegate. The localFinally delegate is invoked once per thread to perform a final - action on each thread's local state. - - - - - - Executes a for loop in which iterations may run in parallel. - - The type of the thread-local data. - The start index, inclusive. - The end index, exclusive. - A ParallelOptions - instance that configures the behavior of this operation. - The function delegate that returns the initial state of the local data - for each thread. - The delegate that is invoked once per iteration. - The delegate that performs a final action on the local state of each - thread. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - CancellationToken in the - argument is set. - The exception that is thrown to contain an exception - thrown from one of the specified delegates. - The exception that is thrown when the - the CancellationTokenSource associated with the - the CancellationToken in the - has been disposed. - A ParallelLoopResult structure - that contains information on what portion of the loop completed. - - - The delegate is invoked once for each value in the iteration range: - [fromInclusive, toExclusive). It is provided with the following parameters: the iteration count (an Int64), - a ParallelLoopState instance that may be - used to break out of the loop prematurely, and some local state that may be shared amongst iterations - that execute on the same thread. - - - The delegate is invoked once for each thread that participates in the loop's - execution and returns the initial local state for each of those threads. These initial states are passed to the first - invocations on each thread. Then, every subsequent body invocation returns a possibly - modified state value that is passed to the next body invocation. Finally, the last body invocation on each thread returns a state value - that is passed to the delegate. The localFinally delegate is invoked once per thread to perform a final - action on each thread's local state. - - - - - - Performs the major work of the parallel for loop. It assumes that argument validation has already - been performed by the caller. This function's whole purpose in life is to enable as much reuse of - common implementation details for the various For overloads we offer. Without it, we'd end up - with lots of duplicate code. It handles: (1) simple for loops, (2) for loops that depend on - ParallelState, and (3) for loops with thread local data. - - @TODO: at some point in the future, we may want to manually inline the interesting bits into the - specific overloads above. There is some overhead associated with the extra arguments passed to - the function, and various if-checks in the code. It is also more difficult to follow what the - code does as-is because it has to handle the three flavors. - - The type of the local data. - The loop's start index, inclusive. - The loop's end index, exclusive. - A ParallelOptions instance. - The simple loop body. - The loop body for ParallelState overloads. - The loop body for thread local state overloads. - A selector function that returns new thread local state. - A cleanup function to destroy thread local state. - Only one of the body arguments may be supplied (i.e. they are exclusive). - A structure. - - - - Performs the major work of the 64-bit parallel for loop. It assumes that argument validation has already - been performed by the caller. This function's whole purpose in life is to enable as much reuse of - common implementation details for the various For overloads we offer. Without it, we'd end up - with lots of duplicate code. It handles: (1) simple for loops, (2) for loops that depend on - ParallelState, and (3) for loops with thread local data. - - @TODO: at some point in the future, we may want to manually inline the interesting bits into the - specific overloads above. There is some overhead associated with the extra arguments passed to - the function, and various if-checks in the code. It is also more difficult to follow what the - code does as-is because it has to handle the three flavors. - - The type of the local data. - The loop's start index, inclusive. - The loop's end index, exclusive. - A ParallelOptions instance. - The simple loop body. - The loop body for ParallelState overloads. - The loop body for thread local state overloads. - A selector function that returns new thread local state. - A cleanup function to destroy thread local state. - Only one of the body arguments may be supplied (i.e. they are exclusive). - A structure. - - - - Executes a for each operation on an - in which iterations may run in parallel. - - The type of the data in the source. - An enumerable data source. - The delegate that is invoked once per iteration. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown to contain an exception - thrown from one of the specified delegates. - A ParallelLoopResult structure - that contains information on what portion of the loop completed. - - The delegate is invoked once for each element in the - enumerable. It is provided with the current element as a parameter. - - - - - Executes a for each operation on an - in which iterations may run in parallel. - - The type of the data in the source. - An enumerable data source. - A ParallelOptions - instance that configures the behavior of this operation. - The delegate that is invoked once per iteration. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - CancellationToken in the - argument is set - The exception that is thrown to contain an exception - thrown from one of the specified delegates. - The exception that is thrown when the - the CancellationTokenSource associated with the - the CancellationToken in the - has been disposed. - A ParallelLoopResult structure - that contains information on what portion of the loop completed. - - The delegate is invoked once for each element in the - enumerable. It is provided with the current element as a parameter. - - - - - Executes a for each operation on an - in which iterations may run in parallel. - - The type of the data in the source. - An enumerable data source. - The delegate that is invoked once per iteration. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown to contain an exception - thrown from one of the specified delegates. - A ParallelLoopResult structure - that contains information on what portion of the loop completed. - - The delegate is invoked once for each element in the - enumerable. It is provided with the following parameters: the current element, - and a ParallelLoopState instance that may be - used to break out of the loop prematurely. - - - - - Executes a for each operation on an - in which iterations may run in parallel. - - The type of the data in the source. - An enumerable data source. - A ParallelOptions - instance that configures the behavior of this operation. - The delegate that is invoked once per iteration. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - CancellationToken in the - argument is set - The exception that is thrown to contain an exception - thrown from one of the specified delegates. - The exception that is thrown when the - the CancellationTokenSource associated with the - the CancellationToken in the - has been disposed. - A ParallelLoopResult structure - that contains information on what portion of the loop completed. - - The delegate is invoked once for each element in the - enumerable. It is provided with the following parameters: the current element, - and a ParallelLoopState instance that may be - used to break out of the loop prematurely. - - - - - Executes a for each operation on an - in which iterations may run in parallel. - - The type of the data in the source. - An enumerable data source. - The delegate that is invoked once per iteration. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown to contain an exception - thrown from one of the specified delegates. - A ParallelLoopResult structure - that contains information on what portion of the loop completed. - - The delegate is invoked once for each element in the - enumerable. It is provided with the following parameters: the current element, - a ParallelLoopState instance that may be - used to break out of the loop prematurely, and the current element's index (an Int64). - - - - - Executes a for each operation on an - in which iterations may run in parallel. - - The type of the data in the source. - An enumerable data source. - A ParallelOptions - instance that configures the behavior of this operation. - The delegate that is invoked once per iteration. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - CancellationToken in the - argument is set - The exception that is thrown to contain an exception - thrown from one of the specified delegates. - The exception that is thrown when the - the CancellationTokenSource associated with the - the CancellationToken in the - has been disposed. - A ParallelLoopResult structure - that contains information on what portion of the loop completed. - - The delegate is invoked once for each element in the - enumerable. It is provided with the following parameters: the current element, - a ParallelLoopState instance that may be - used to break out of the loop prematurely, and the current element's index (an Int64). - - - - - Executes a for each operation on an - in which iterations may run in parallel. - - The type of the data in the source. - The type of the thread-local data. - An enumerable data source. - The function delegate that returns the initial state of the local data - for each thread. - The delegate that is invoked once per iteration. - The delegate that performs a final action on the local state of each - thread. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown to contain an exception - thrown from one of the specified delegates. - A ParallelLoopResult structure - that contains information on what portion of the loop completed. - - - The delegate is invoked once for each element in the - enumerable. It is provided with the following parameters: the current element, - a ParallelLoopState instance that may be - used to break out of the loop prematurely, and some local state that may be shared amongst iterations - that execute on the same thread. - - - The delegate is invoked once for each thread that participates in the loop's - execution and returns the initial local state for each of those threads. These initial states are passed to the first - invocations on each thread. Then, every subsequent body invocation returns a possibly - modified state value that is passed to the next body invocation. Finally, the last body invocation on each thread returns a state value - that is passed to the delegate. The localFinally delegate is invoked once per thread to perform a final - action on each thread's local state. - - - - - - Executes a for each operation on an - in which iterations may run in parallel. - - The type of the data in the source. - The type of the thread-local data. - An enumerable data source. - A ParallelOptions - instance that configures the behavior of this operation. - The function delegate that returns the initial state of the local data - for each thread. - The delegate that is invoked once per iteration. - The delegate that performs a final action on the local state of each - thread. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - CancellationToken in the - argument is set - The exception that is thrown to contain an exception - thrown from one of the specified delegates. - The exception that is thrown when the - the CancellationTokenSource associated with the - the CancellationToken in the - has been disposed. - A ParallelLoopResult structure - that contains information on what portion of the loop completed. - - - The delegate is invoked once for each element in the - enumerable. It is provided with the following parameters: the current element, - a ParallelLoopState instance that may be - used to break out of the loop prematurely, and some local state that may be shared amongst iterations - that execute on the same thread. - - - The delegate is invoked once for each thread that participates in the loop's - execution and returns the initial local state for each of those threads. These initial states are passed to the first - invocations on each thread. Then, every subsequent body invocation returns a possibly - modified state value that is passed to the next body invocation. Finally, the last body invocation on each thread returns a state value - that is passed to the delegate. The localFinally delegate is invoked once per thread to perform a final - action on each thread's local state. - - - - - - Executes a for each operation on an - in which iterations may run in parallel. - - The type of the data in the source. - The type of the thread-local data. - An enumerable data source. - The function delegate that returns the initial state of the local data - for each thread. - The delegate that is invoked once per iteration. - The delegate that performs a final action on the local state of each - thread. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown to contain an exception - thrown from one of the specified delegates. - A ParallelLoopResult structure - that contains information on what portion of the loop completed. - - - The delegate is invoked once for each element in the - enumerable. It is provided with the following parameters: the current element, - a ParallelLoopState instance that may be - used to break out of the loop prematurely, the current element's index (an Int64), and some local - state that may be shared amongst iterations that execute on the same thread. - - - The delegate is invoked once for each thread that participates in the loop's - execution and returns the initial local state for each of those threads. These initial states are passed to the first - invocations on each thread. Then, every subsequent body invocation returns a possibly - modified state value that is passed to the next body invocation. Finally, the last body invocation on each thread returns a state value - that is passed to the delegate. The localFinally delegate is invoked once per thread to perform a final - action on each thread's local state. - - - - - - Executes a for each operation on an - in which iterations may run in parallel. - - The type of the data in the source. - The type of the thread-local data. - An enumerable data source. - A ParallelOptions - instance that configures the behavior of this operation. - The function delegate that returns the initial state of the local data - for each thread. - The delegate that is invoked once per iteration. - The delegate that performs a final action on the local state of each - thread. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - CancellationToken in the - argument is set - The exception that is thrown to contain an exception - thrown from one of the specified delegates. - The exception that is thrown when the - the CancellationTokenSource associated with the - the CancellationToken in the - has been disposed. - A ParallelLoopResult structure - that contains information on what portion of the loop completed. - - - The delegate is invoked once for each element in the - enumerable. It is provided with the following parameters: the current element, - a ParallelLoopState instance that may be - used to break out of the loop prematurely, the current element's index (an Int64), and some local - state that may be shared amongst iterations that execute on the same thread. - - - The delegate is invoked once for each thread that participates in the loop's - execution and returns the initial local state for each of those threads. These initial states are passed to the first - invocations on each thread. Then, every subsequent body invocation returns a possibly - modified state value that is passed to the next body invocation. Finally, the last body invocation on each thread returns a state value - that is passed to the delegate. The localFinally delegate is invoked once per thread to perform a final - action on each thread's local state. - - - - - - Performs the major work of the parallel foreach loop. It assumes that argument validation has - already been performed by the caller. This function's whole purpose in life is to enable as much - reuse of common implementation details for the various For overloads we offer. Without it, we'd - end up with lots of duplicate code. It handles: (1) simple foreach loops, (2) foreach loops that - depend on ParallelState, and (3) foreach loops that access indices, (4) foreach loops with thread - local data, and any necessary permutations thereof. - - @TODO: at some point in the future, we may want to manually inline the interesting bits into the - specific overloads above. There is some overhead associated with the extra arguments passed to - the function, and various if-checks in the code. It is also more difficult to follow what the - code does as-is because it has to handle the all flavors. - - The type of the source data. - The type of the local data. - An enumerable data source. - ParallelOptions instance to use with this ForEach-loop - The simple loop body. - The loop body for ParallelState overloads. - The loop body for ParallelState/indexed overloads. - The loop body for ParallelState/thread local state overloads. - The loop body for ParallelState/indexed/thread local state overloads. - A selector function that returns new thread local state. - A cleanup function to destroy thread local state. - Only one of the bodyXX arguments may be supplied (i.e. they are exclusive). - A structure. - - - - A fast path for the more general ForEachWorker method above. This uses ldelem instructions to - access the individual elements of the array, which will be faster. - - The type of the source data. - The type of the local data. - An array data source. - The options to use for execution. - The simple loop body. - The loop body for ParallelState overloads. - The loop body for indexed/ParallelLoopState overloads. - The loop body for local/ParallelLoopState overloads. - The loop body for the most generic overload. - A selector function that returns new thread local state. - A cleanup function to destroy thread local state. - A structure. - - - - A fast path for the more general ForEachWorker method above. This uses IList<T>'s indexer - capabilities to access the individual elements of the list rather than an enumerator. - - The type of the source data. - The type of the local data. - A list data source. - The options to use for execution. - The simple loop body. - The loop body for ParallelState overloads. - The loop body for indexed/ParallelLoopState overloads. - The loop body for local/ParallelLoopState overloads. - The loop body for the most generic overload. - A selector function that returns new thread local state. - A cleanup function to destroy thread local state. - A structure. - - - - Executes a for each operation on a - Partitioner in which iterations may run in parallel. - - The type of the elements in . - The Partitioner that contains the original data source. - The delegate that is invoked once per iteration. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - SupportsDynamicPartitions property in the Partitioner returns - false. - The exception that is thrown when any - methods in the Partitioner return null. - The exception that is thrown when the - GetPartitions() method in the Partitioner does not return - the correct number of partitions. - The exception that is thrown when the - GetPartitions() method in the Partitioner returns an IList - with at least one null value. - The exception that is thrown when the - GetDynamicPartitions() method in the Partitioner returns an - IEnumerable whose GetEnumerator() method returns null. - The exception that is thrown to contain an exception - thrown from one of the specified delegates. - A ParallelLoopResult structure - that contains information on what portion of the loop completed. - - - The Partitioner is used to retrieve - the elements to be processed, in place of the original data source. If the current element's - index is desired, the source must be an - OrderablePartitioner. - - - The delegate is invoked once for each element in the - Partitioner. It is provided with the current element as a parameter. - - - - - - Executes a for each operation on a - Partitioner in which iterations may run in parallel. - - The type of the elements in . - The Partitioner that contains the original data source. - The delegate that is invoked once per iteration. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - SupportsDynamicPartitions property in the Partitioner returns - false. - The exception that is thrown when any - methods in the Partitioner return null. - The exception that is thrown when the - GetPartitions() method in the Partitioner does not return - the correct number of partitions. - The exception that is thrown when the - GetPartitions() method in the Partitioner returns an IList - with at least one null value. - The exception that is thrown when the - GetDynamicPartitions() method in the Partitioner returns an - IEnumerable whose GetEnumerator() method returns null. - The exception that is thrown to contain an exception - thrown from one of the specified delegates. - A ParallelLoopResult structure - that contains information on what portion of the loop completed. - - - The Partitioner is used to retrieve - the elements to be processed, in place of the original data source. If the current element's - index is desired, the source must be an - OrderablePartitioner. - - - The delegate is invoked once for each element in the - Partitioner. It is provided with the following parameters: the current element, - and a ParallelLoopState instance that may be - used to break out of the loop prematurely. - - - - - - Executes a for each operation on a - OrderablePartitioner in which iterations may run in parallel. - - The type of the elements in . - The OrderablePartitioner that contains the original data source. - The delegate that is invoked once per iteration. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - SupportsDynamicPartitions property in the OrderablePartitioner returns - false. - The exception that is thrown when the - KeysNormalized property in the OrderablePartitioner returns - false. - The exception that is thrown when any - methods in the OrderablePartitioner return null. - The exception that is thrown when the - GetPartitions() or GetOrderablePartitions() methods in the - OrderablePartitioner do not return the correct number of partitions. - The exception that is thrown when the - GetPartitions() or GetOrderablePartitions() methods in the - OrderablePartitioner return an IList with at least one null value. - The exception that is thrown when the - GetDynamicPartitions() or GetDynamicOrderablePartitions() methods in the - OrderablePartitioner return an IEnumerable whose GetEnumerator() method returns null. - The exception that is thrown to contain an exception - thrown from one of the specified delegates. - A ParallelLoopResult structure - that contains information on what portion of the loop completed. - - - The Partitioner is used to retrieve - the elements to be processed, in place of the original data source. If the current element's - index is desired, the source must be an - OrderablePartitioner. - - - The delegate is invoked once for each element in the - Partitioner. It is provided with the following parameters: the current element, - a ParallelLoopState instance that may be - used to break out of the loop prematurely, and the current element's index (an Int64). - - - - - - Executes a for each operation on a - Partitioner in which iterations may run in parallel. - - The type of the elements in . - The type of the thread-local data. - The Partitioner that contains the original data source. - The function delegate that returns the initial state of the local data - for each thread. - The delegate that is invoked once per iteration. - The delegate that performs a final action on the local state of each - thread. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - SupportsDynamicPartitions property in the Partitioner returns - false. - The exception that is thrown when any - methods in the Partitioner return null. - The exception that is thrown when the - GetPartitions() method in the Partitioner does not return - the correct number of partitions. - The exception that is thrown when the - GetPartitions() method in the Partitioner returns an IList - with at least one null value. - The exception that is thrown when the - GetDynamicPartitions() method in the Partitioner returns an - IEnumerable whose GetEnumerator() method returns null. - The exception that is thrown to contain an exception - thrown from one of the specified delegates. - A ParallelLoopResult structure - that contains information on what portion of the loop completed. - - - The Partitioner is used to retrieve - the elements to be processed, in place of the original data source. If the current element's - index is desired, the source must be an - OrderablePartitioner. - - - The delegate is invoked once for each element in the - Partitioner. It is provided with the following parameters: the current element, - a ParallelLoopState instance that may be - used to break out of the loop prematurely, and some local state that may be shared amongst iterations - that execute on the same thread. - - - The delegate is invoked once for each thread that participates in the loop's - execution and returns the initial local state for each of those threads. These initial states are passed to the first - invocations on each thread. Then, every subsequent body invocation returns a possibly - modified state value that is passed to the next body invocation. Finally, the last body invocation on each thread returns a state value - that is passed to the delegate. The localFinally delegate is invoked once per thread to perform a final - action on each thread's local state. - - - - - - Executes a for each operation on a - OrderablePartitioner in which iterations may run in parallel. - - The type of the elements in . - The type of the thread-local data. - The OrderablePartitioner that contains the original data source. - The function delegate that returns the initial state of the local data - for each thread. - The delegate that is invoked once per iteration. - The delegate that performs a final action on the local state of each - thread. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - SupportsDynamicPartitions property in the OrderablePartitioner returns - false. - The exception that is thrown when the - KeysNormalized property in the OrderablePartitioner returns - false. - The exception that is thrown when any - methods in the OrderablePartitioner return null. - The exception that is thrown when the - GetPartitions() or GetOrderablePartitions() methods in the - OrderablePartitioner do not return the correct number of partitions. - The exception that is thrown when the - GetPartitions() or GetOrderablePartitions() methods in the - OrderablePartitioner return an IList with at least one null value. - The exception that is thrown when the - GetDynamicPartitions() or GetDynamicOrderablePartitions() methods in the - OrderablePartitioner return an IEnumerable whose GetEnumerator() method returns null. - The exception that is thrown to contain an exception - thrown from one of the specified delegates. - A ParallelLoopResult structure - that contains information on what portion of the loop completed. - - - The Partitioner is used to retrieve - the elements to be processed, in place of the original data source. If the current element's - index is desired, the source must be an - OrderablePartitioner. - - - The delegate is invoked once for each element in the - Partitioner. It is provided with the following parameters: the current element, - a ParallelLoopState instance that may be - used to break out of the loop prematurely, the current element's index (an Int64), and some local - state that may be shared amongst iterations that execute on the same thread. - - - The delegate is invoked once for each thread that participates in the loop's - execution and returns the initial local state for each of those threads. These initial states are passed to the first - invocations on each thread. Then, every subsequent body invocation returns a possibly - modified state value that is passed to the next body invocation. Finally, the last body invocation on each thread returns a state value - that is passed to the delegate. The localFinally delegate is invoked once per thread to perform a final - action on each thread's local state. - - - - - - Executes a for each operation on a - Partitioner in which iterations may run in parallel. - - The type of the elements in . - The Partitioner that contains the original data source. - A ParallelOptions - instance that configures the behavior of this operation. - The delegate that is invoked once per iteration. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - CancellationToken in the - argument is set - The exception that is thrown when the - SupportsDynamicPartitions property in the Partitioner returns - false. - The exception that is thrown when any - methods in the Partitioner return null. - The exception that is thrown when the - GetPartitions() method in the Partitioner does not return - the correct number of partitions. - The exception that is thrown when the - GetPartitions() method in the Partitioner returns an IList - with at least one null value. - The exception that is thrown when the - GetDynamicPartitions() method in the Partitioner returns an - IEnumerable whose GetEnumerator() method returns null. - The exception that is thrown to contain an exception - thrown from one of the specified delegates. - The exception that is thrown when the - the CancellationTokenSource associated with the - the CancellationToken in the - has been disposed. - A ParallelLoopResult structure - that contains information on what portion of the loop completed. - - - The Partitioner is used to retrieve - the elements to be processed, in place of the original data source. If the current element's - index is desired, the source must be an - OrderablePartitioner. - - - The delegate is invoked once for each element in the - Partitioner. It is provided with the current element as a parameter. - - - - - - Executes a for each operation on a - Partitioner in which iterations may run in parallel. - - The type of the elements in . - The Partitioner that contains the original data source. - A ParallelOptions - instance that configures the behavior of this operation. - The delegate that is invoked once per iteration. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - CancellationToken in the - argument is set - The exception that is thrown when the - SupportsDynamicPartitions property in the Partitioner returns - false. - The exception that is thrown when any - methods in the Partitioner return null. - The exception that is thrown when the - GetPartitions() method in the Partitioner does not return - the correct number of partitions. - The exception that is thrown when the - GetPartitions() method in the Partitioner returns an IList - with at least one null value. - The exception that is thrown when the - GetDynamicPartitions() method in the Partitioner returns an - IEnumerable whose GetEnumerator() method returns null. - The exception that is thrown to contain an exception - thrown from one of the specified delegates. - The exception that is thrown when the - the CancellationTokenSource associated with the - the CancellationToken in the - has been disposed. - A ParallelLoopResult structure - that contains information on what portion of the loop completed. - - - The Partitioner is used to retrieve - the elements to be processed, in place of the original data source. If the current element's - index is desired, the source must be an - OrderablePartitioner. - - - The delegate is invoked once for each element in the - Partitioner. It is provided with the following parameters: the current element, - and a ParallelLoopState instance that may be - used to break out of the loop prematurely. - - - - - - Executes a for each operation on a - OrderablePartitioner in which iterations may run in parallel. - - The type of the elements in . - The OrderablePartitioner that contains the original data source. - A ParallelOptions - instance that configures the behavior of this operation. - The delegate that is invoked once per iteration. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - CancellationToken in the - argument is set - The exception that is thrown when the - SupportsDynamicPartitions property in the OrderablePartitioner returns - false. - The exception that is thrown when the - KeysNormalized property in the OrderablePartitioner returns - false. - The exception that is thrown when any - methods in the OrderablePartitioner return null. - The exception that is thrown when the - GetPartitions() or GetOrderablePartitions() methods in the - OrderablePartitioner do not return the correct number of partitions. - The exception that is thrown when the - GetPartitions() or GetOrderablePartitions() methods in the - OrderablePartitioner return an IList with at least one null value. - The exception that is thrown when the - GetDynamicPartitions() or GetDynamicOrderablePartitions() methods in the - OrderablePartitioner return an IEnumerable whose GetEnumerator() method returns null. - The exception that is thrown to contain an exception - thrown from one of the specified delegates. - The exception that is thrown when the - the CancellationTokenSource associated with the - the CancellationToken in the - has been disposed. - A ParallelLoopResult structure - that contains information on what portion of the loop completed. - - - The Partitioner is used to retrieve - the elements to be processed, in place of the original data source. If the current element's - index is desired, the source must be an - OrderablePartitioner. - - - The delegate is invoked once for each element in the - Partitioner. It is provided with the following parameters: the current element, - a ParallelLoopState instance that may be - used to break out of the loop prematurely, and the current element's index (an Int64). - - - - - - Executes a for each operation on a - Partitioner in which iterations may run in parallel. - - The type of the elements in . - The type of the thread-local data. - The Partitioner that contains the original data source. - A ParallelOptions - instance that configures the behavior of this operation. - The function delegate that returns the initial state of the local data - for each thread. - The delegate that is invoked once per iteration. - The delegate that performs a final action on the local state of each - thread. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - CancellationToken in the - argument is set - The exception that is thrown when the - SupportsDynamicPartitions property in the Partitioner returns - false. - The exception that is thrown when any - methods in the Partitioner return null. - The exception that is thrown when the - GetPartitions() method in the Partitioner does not return - the correct number of partitions. - The exception that is thrown when the - GetPartitions() method in the Partitioner returns an IList - with at least one null value. - The exception that is thrown when the - GetDynamicPartitions() method in the Partitioner returns an - IEnumerable whose GetEnumerator() method returns null. - The exception that is thrown to contain an exception - thrown from one of the specified delegates. - The exception that is thrown when the - the CancellationTokenSource associated with the - the CancellationToken in the - has been disposed. - A ParallelLoopResult structure - that contains information on what portion of the loop completed. - - - The Partitioner is used to retrieve - the elements to be processed, in place of the original data source. If the current element's - index is desired, the source must be an - OrderablePartitioner. - - - The delegate is invoked once for each element in the - Partitioner. It is provided with the following parameters: the current element, - a ParallelLoopState instance that may be - used to break out of the loop prematurely, and some local state that may be shared amongst iterations - that execute on the same thread. - - - The delegate is invoked once for each thread that participates in the loop's - execution and returns the initial local state for each of those threads. These initial states are passed to the first - invocations on each thread. Then, every subsequent body invocation returns a possibly - modified state value that is passed to the next body invocation. Finally, the last body invocation on each thread returns a state value - that is passed to the delegate. The localFinally delegate is invoked once per thread to perform a final - action on each thread's local state. - - - - - - Executes a for each operation on a - OrderablePartitioner in which iterations may run in parallel. - - The type of the elements in . - The type of the thread-local data. - The OrderablePartitioner that contains the original data source. - A ParallelOptions - instance that configures the behavior of this operation. - The function delegate that returns the initial state of the local data - for each thread. - The delegate that is invoked once per iteration. - The delegate that performs a final action on the local state of each - thread. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - CancellationToken in the - argument is set - The exception that is thrown when the - SupportsDynamicPartitions property in the OrderablePartitioner returns - false. - The exception that is thrown when the - KeysNormalized property in the OrderablePartitioner returns - false. - The exception that is thrown when any - methods in the OrderablePartitioner return null. - The exception that is thrown when the - GetPartitions() or GetOrderablePartitions() methods in the - OrderablePartitioner do not return the correct number of partitions. - The exception that is thrown when the - GetPartitions() or GetOrderablePartitions() methods in the - OrderablePartitioner return an IList with at least one null value. - The exception that is thrown when the - GetDynamicPartitions() or GetDynamicOrderablePartitions() methods in the - OrderablePartitioner return an IEnumerable whose GetEnumerator() method returns null. - The exception that is thrown to contain an exception - thrown from one of the specified delegates. - The exception that is thrown when the - the CancellationTokenSource associated with the - the CancellationToken in the - has been disposed. - A ParallelLoopResult structure - that contains information on what portion of the loop completed. - - - The Partitioner is used to retrieve - the elements to be processed, in place of the original data source. If the current element's - index is desired, the source must be an - OrderablePartitioner. - - - The delegate is invoked once for each element in the - Partitioner. It is provided with the following parameters: the current element, - a ParallelLoopState instance that may be - used to break out of the loop prematurely, the current element's index (an Int64), and some local - state that may be shared amongst iterations that execute on the same thread. - - - The delegate is invoked once for each thread that participates in the loop's - execution and returns the initial local state for each of those threads. These initial states are passed to the first - invocations on each thread. Then, every subsequent body invocation returns a possibly - modified state value that is passed to the next body invocation. Finally, the last body invocation on each thread returns a state value - that is passed to the delegate. The localFinally delegate is invoked once per thread to perform a final - action on each thread's local state. - - - - - - Internal utility function that implements the OCE filtering behavior for all Parallel.* APIs. - Throws a single OperationCancelledException object with the token if the Exception collection only contains - OperationCancelledExceptions with the given CancellationToken. - - - The exception collection to filter - The CancellationToken expected on all inner exceptions - - - - - Enables iterations of loops to interact with - other iterations. - - - - - Communicates that the loop should cease execution at the system's earliest - convenience. - - - The method was previously called. and may not be used in combination by iterations of the same loop. - - - - may be used to communicate to the loop that no other iterations need be run. - For long-running iterations that may already be executing, causes - to return true for all other iterations of the loop, such that another iteration may check and exit early if it's observed to be true. - - - is typically employed in search-based algorithms, where once a result is found, - no other iterations need be executed. - - - - - - Communicates that the loop should cease execution at the system's earliest - convenience of iterations beyond the current iteration. - - - The method was previously called. and - may not be used in combination by iterations of the same loop. - - - - may be used to communicate to the loop that no other iterations after the - current iteration need be run. For example, if is called from the 100th - iteration of a for loop iterating in parallel from 0 to 1000, all iterations less than 100 should - still be run, but the iterations from 101 through to 1000 are not necessary. - - - For long-running iterations that may already be executing, causes - to be set to the current iteration's index if the current index is less than the current value of - . - - - is typically employed in search-based algorithms where an ordering is - present in the data source. - - - - - - Internal/virtual support for ShouldExitCurrentIteration. - - - - - Gets whether the current iteration of the loop should exit based - on requests made by this or other iterations. - - - When an iteration of a loop calls or , or - when one throws an exception, or when the loop is canceled, the class will proactively - attempt to prohibit additional iterations of the loop from starting execution. - However, there may be cases where it is unable to prevent additional iterations from starting. - It may also be the case that a long-running iteration has already begun execution. In such - cases, iterations may explicitly check the property and - cease execution if the property returns true. - - - - - Gets whether any iteration of the loop has called . - - - - - Gets whether any iteration of the loop has thrown an exception that went unhandled by that - iteration. - - - - - Internal/virtual support for LowestBreakIteration. - - - - - Gets the lowest iteration of the loop from which was called. - - - If no iteration of the loop called , this property will return null. - - - - - Internal constructor to ensure an instance isn't created by users. - - A flag shared among all threads participating - in the execution of a certain loop. - - - - Communicates that parallel tasks should stop when they reach a specified iteration element. - (which is CurrentIteration of the caller). - - Break() called after Stop(). - - This is shared with all other concurrent threads in the system which are participating in the - loop's execution. After calling Break(), no additional iterations will be executed on - the current thread, and other worker threads will execute once they get beyond the calling iteration. - - - - - Tracks the current loop iteration for the owning task. - This is used to compute whether or not the task should - terminate early due to a Break() call. - - - - - Returns true if we should be exiting from the current iteration - due to Stop(), Break() or exception. - - - - - Returns the lowest iteration at which Break() has been called, or - null if Break() has not yet been called. - - - - - Allows independent iterations of a parallel loop to interact with other iterations. - - - - - Internal constructor to ensure an instance isn't created by users. - - A flag shared among all threads participating - in the execution of a certain loop. - - - - Communicates that parallel tasks should stop when they reach a specified iteration element. - (which is CurrentIteration of the caller). - - Break() called after Stop(). - - Atomically sets shared StoppedBroken flag to BROKEN, then atomically sets shared - LowestBreakIteration to CurrentIteration, but only if CurrentIteration is less than - LowestBreakIteration. - - - - - Tracks the current loop iteration for the owning task. - This is used to compute whether or not the task should - terminate early due to a Break() call. - - - - - Returns true if we should be exiting from the current iteration - due to Stop(), Break() or exception. - - - - - Returns the lowest iteration at which Break() has been called, or - null if Break() has not yet been called. - - - - - State information that is common between ParallelStateFlags class - and ParallelStateFlags64 class. - - - - - An internal class used to share accounting information in 32-bit versions - of For()/ForEach() loops. - - - - - Lets the caller know whether or not to prematurely exit the For/ForEach loop. - If this returns true, then exit the loop. Otherwise, keep going. - - The caller's current iteration point - in the loop. - - The loop should exit on any one of the following conditions: - (1) Stop() has been called by one or more tasks. - (2) An exception has been raised by one or more tasks. - (3) Break() has been called by one or more tasks, and - CallerIteration exceeds the (lowest) iteration at which - Break() was called. - (4) The loop was canceled. - - - - - An internal class used to share accounting information in 64-bit versions - of For()/ForEach() loops. - - - - - Lets the caller know whether or not to prematurely exit the For/ForEach loop. - If this returns true, then exit the loop. Otherwise, keep going. - - The caller's current iteration point - in the loop. - - The loop should exit on any one of the following conditions: - (1) Stop() has been called by one or more tasks. - (2) An exception has been raised by one or more tasks. - (3) Break() has been called by one or more tasks, and - CallerIteration exceeds the (lowest) iteration at which - Break() was called. - (4) The loop has been canceled. - - - - - Provides completion status on the execution of a loop. - - - If returns true, then the loop ran to completion, such that all iterations - of the loop were executed. If returns false and returns null, a call to was used to end the loop prematurely. If returns false and returns a non-null integral - value, was used to end the loop prematurely. - - - - - Gets whether the loop ran to completion, such that all iterations of the loop were executed - and the loop didn't receive a request to end prematurely. - - - - - Gets the index of the lowest iteration from which - was called. - - - If was not employed, this property will - return null. - - - - - Utility class for allocating structs as heap variables - - - - - Represents an index range - - - - - The RangeWorker struct wraps the state needed by a task that services the parallel loop - - - - - Initializes a RangeWorker struct - - - - - Implements the core work search algorithm that will be used for this range worker. - - - Usage pattern is: - 1) the thread associated with this rangeworker calls FindNewWork - 2) if we return true, the worker uses the nFromInclusiveLocal and nToExclusiveLocal values - to execute the sequential loop - 3) if we return false it means there is no more work left. It's time to quit. - - - - - 32 bit integer version of FindNewWork. Assumes the ranges were initialized with 32 bit values. - - - - - Represents the entire loop operation, keeping track of workers and ranges. - - - The usage pattern is: - 1) The Parallel loop entry function (ForWorker) creates an instance of this class - 2) Every thread joining to service the parallel loop calls RegisterWorker to grab a - RangeWorker struct to wrap the state it will need to find and execute work, - and they keep interacting with that struct until the end of the loop - - - - Initializes a RangeManager with the given loop parameters, and the desired number of outer ranges - - - - - The function that needs to be called by each new worker thread servicing the parallel loop - in order to get a RangeWorker struct that wraps the state for finding and executing indices - - - - - Represents an asynchronous operation that produces a result at some time in the future. - - - The type of the result produced by this . - - - - instances may be created in a variety of ways. The most common approach is by - using the task's property to retrieve a instance that can be used to create tasks for several - purposes. For example, to create a that runs a function, the factory's StartNew - method may be used: - - // C# - var t = Task<int>.Factory.StartNew(() => GenerateResult()); - - or - - var t = Task.Factory.StartNew(() => GenerateResult()); - - ' Visual Basic - Dim t = Task<int>.Factory.StartNew(Function() GenerateResult()) - - or - - Dim t = Task.Factory.StartNew(Function() GenerateResult()) - - - - The class also provides constructors that initialize the task but that do not - schedule it for execution. For performance reasons, the StartNew method should be the - preferred mechanism for creating and scheduling computational tasks, but for scenarios where creation - and scheduling must be separated, the constructors may be used, and the task's - Start - method may then be used to schedule the task for execution at a later time. - - - All members of , except for - Dispose, are thread-safe - and may be used from multiple threads concurrently. - - - - - - Represents an asynchronous operation. - - - - instances may be created in a variety of ways. The most common approach is by - using the Task type's property to retrieve a instance that can be used to create tasks for several - purposes. For example, to create a that runs an action, the factory's StartNew - method may be used: - - // C# - var t = Task.Factory.StartNew(() => DoAction()); - - ' Visual Basic - Dim t = Task.Factory.StartNew(Function() DoAction()) - - - - The class also provides constructors that initialize the Task but that do not - schedule it for execution. For performance reasons, TaskFactory's StartNew method should be the - preferred mechanism for creating and scheduling computational tasks, but for scenarios where creation - and scheduling must be separated, the constructors may be used, and the task's - method may then be used to schedule the task for execution at a later time. - - - All members of , except for , are thread-safe - and may be used from multiple threads concurrently. - - - For operations that return values, the class - should be used. - - - For developers implementing custom debuggers, several internal and private members of Task may be - useful (these may change from release to release). The Int32 m_taskId field serves as the backing - store for the property, however accessing this field directly from a debugger may be - more efficient than accessing the same value through the property's getter method (the - s_taskIdCounter Int32 counter is used to retrieve the next available ID for a Task). Similarly, the - Int32 m_stateFlags field stores information about the current lifecycle stage of the Task, - information also accessible through the property. The m_action System.Object - field stores a reference to the Task's delegate, and the m_stateObject System.Object field stores the - async state passed to the Task by the developer. Finally, for debuggers that parse stack frames, the - InternalWait method serves a potential marker for when a Task is entering a wait operation. - - - - - - A type initializer that runs with the appropriate permissions. - - - - - Initializes a new with the specified action. - - The delegate that represents the code to execute in the Task. - The argument is null. - - - - Initializes a new with the specified action and CancellationToken. - - The delegate that represents the code to execute in the Task. - The CancellationToken - that will be assigned to the new Task. - The argument is null. - The provided CancellationToken - has already been disposed. - - - - - Initializes a new with the specified action and creation options. - - The delegate that represents the code to execute in the task. - - The TaskCreationOptions used to - customize the Task's behavior. - - - The argument is null. - - - The argument specifies an invalid value for . - - - - - Initializes a new with the specified action and creation options. - - The delegate that represents the code to execute in the task. - The that will be assigned to the new task. - - The TaskCreationOptions used to - customize the Task's behavior. - - - The argument is null. - - - The argument specifies an invalid value for . - - The provided CancellationToken - has already been disposed. - - - - - Initializes a new with the specified action and state. - - The delegate that represents the code to execute in the task. - An object representing data to be used by the action. - - The argument is null. - - - - - Initializes a new with the specified action, state, snd options. - - The delegate that represents the code to execute in the task. - An object representing data to be used by the action. - The that will be assigned to the new task. - - The argument is null. - - The provided CancellationToken - has already been disposed. - - - - - Initializes a new with the specified action, state, snd options. - - The delegate that represents the code to execute in the task. - An object representing data to be used by the action. - - The TaskCreationOptions used to - customize the Task's behavior. - - - The argument is null. - - - The argument specifies an invalid value for . - - - - - Initializes a new with the specified action, state, snd options. - - The delegate that represents the code to execute in the task. - An object representing data to be used by the action. - The that will be assigned to the new task. - - The TaskCreationOptions used to - customize the Task's behavior. - - - The argument is null. - - - The argument specifies an invalid value for . - - The provided CancellationToken - has already been disposed. - - - - - An internal constructor used by the factory methods on task and its descendent(s). - This variant does not capture the ExecutionContext; it is up to the caller to do that. - - An action to execute. - Optional state to pass to the action. - Parent of Task. - A CancellationToken for the task. - A task scheduler under which the task will run. - Options to control its execution. - Internal options to control its execution - - - - Common logic used by the following internal ctors: - Task() - Task(object action, object state, Task parent, TaskCreationOptions options, TaskScheduler taskScheduler) - - ASSUMES THAT m_creatingTask IS ALREADY SET. - - - Action for task to execute. - Object to which to pass to action (may be null) - Task scheduler on which to run thread (only used by continuation tasks). - A CancellationToken for the Task. - Options to customize behavior of Task. - Internal options to customize behavior of Task. - - - - Checks if we registered a CT callback during construction, and deregisters it. - This should be called when we know the registration isn't useful anymore. Specifically from Finish() if the task has completed - successfully or with an exception. - - - - - Captures the ExecutionContext so long as flow isn't suppressed. - - A stack crawl mark pointing to the frame of the caller. - - - - Internal function that will be called by a new child task to add itself to - the children list of the parent (this). - - Since a child task can only be created from the thread executing the action delegate - of this task, reentrancy is neither required nor supported. This should not be called from - anywhere other than the task construction/initialization codepaths. - - - - - Starts the , scheduling it for execution to the current TaskScheduler. - - - A task may only be started and run only once. Any attempts to schedule a task a second time - will result in an exception. - - - The is not in a valid state to be started. It may have already been started, - executed, or canceled, or it may have been created in a manner that doesn't support direct - scheduling. - - - The instance has been disposed. - - - - - Starts the , scheduling it for execution to the specified TaskScheduler. - - - A task may only be started and run only once. Any attempts to schedule a task a second time will - result in an exception. - - - The TaskScheduler with which to associate - and execute this task. - - - The argument is null. - - - The is not in a valid state to be started. It may have already been started, - executed, or canceled, or it may have been created in a manner that doesn't support direct - scheduling. - - - The instance has been disposed. - - - - - Runs the synchronously on the current TaskScheduler. - - - - A task may only be started and run only once. Any attempts to schedule a task a second time will - result in an exception. - - - Tasks executed with will be associated with the current TaskScheduler. - - - If the target scheduler does not support running this Task on the current thread, the Task will - be scheduled for execution on the scheduler, and the current thread will block until the - Task has completed execution. - - - - The is not in a valid state to be started. It may have already been started, - executed, or canceled, or it may have been created in a manner that doesn't support direct - scheduling. - - - The instance has been disposed. - - - - - Runs the synchronously on the scheduler provided. - - - - A task may only be started and run only once. Any attempts to schedule a task a second time will - result in an exception. - - - If the target scheduler does not support running this Task on the current thread, the Task will - be scheduled for execution on the scheduler, and the current thread will block until the - Task has completed execution. - - - - The is not in a valid state to be started. It may have already been started, - executed, or canceled, or it may have been created in a manner that doesn't support direct - scheduling. - - - The instance has been disposed. - - The parameter - is null. - The scheduler on which to attempt to run this task inline. - - - - Throws an exception if the task has been disposed, and hence can no longer be accessed. - - The task has been disposed. - - - - Sets the internal completion event. - - - - - Disposes the , releasing all of its unmanaged resources. - - - Unlike most of the members of , this method is not thread-safe. - Also, may only be called on a that is in one of - the final states: RanToCompletion, - Faulted, or - Canceled. - - - The exception that is thrown if the is not in - one of the final states: RanToCompletion, - Faulted, or - Canceled. - - - - - Disposes the , releasing all of its unmanaged resources. - - - A Boolean value that indicates whether this method is being called due to a call to . - - - Unlike most of the members of , this method is not thread-safe. - - - - - Schedules the task for execution. - - If true, TASK_STATE_STARTED bit is turned on in - an atomic fashion, making sure that TASK_STATE_CANCELED does not get set - underneath us. If false, TASK_STATE_STARTED bit is OR-ed right in. This - allows us to streamline things a bit for StartNew(), where competing cancellations - are not a problem. - - - - Adds an exception to the list of exceptions this task has thrown. - - An object representing either an Exception or a collection of Exceptions. - - - - Returns a list of exceptions by aggregating the holder's contents. Or null if - no exceptions have been thrown. - - Whether to include a TCE if cancelled. - An aggregate exception, or null if no exceptions have been caught. - - - - Throws an aggregate exception if the task contains exceptions. - - - - - Checks whether this is an attached task, and whether we are being called by the parent task. - And sets the TASK_STATE_EXCEPTIONOBSERVEDBYPARENT status flag based on that. - - This is meant to be used internally when throwing an exception, and when WaitAll is gathering - exceptions for tasks it waited on. If this flag gets set, the implicit wait on children - will skip exceptions to prevent duplication. - - This should only be called when this task has completed with an exception - - - - - - Signals completion of this particular task. - - The bUserDelegateExecuted parameter indicates whether this Finish() call comes following the - full execution of the user delegate. - - If bUserDelegateExecuted is false, it mean user delegate wasn't invoked at all (either due to - a cancellation request, or because this task is a promise style Task). In this case, the steps - involving child tasks (i.e. WaitForChildren) will be skipped. - - - - - - FinishStageTwo is to be executed as soon as we known there are no more children to complete. - It can happen i) either on the thread that originally executed this task (if no children were spawned, or they all completed by the time this task's delegate quit) - ii) or on the thread that executed the last child. - - - - - Final stage of the task completion code path. Notifies the parent (if any) that another of its childre are done, and runs continuations. - This function is only separated out from FinishStageTwo because these two operations are also needed to be called from CancellationCleanupLogic() - - - - - This is called by children of this task when they are completed. - - - - - This is to be called just before the task does its final state transition. - It traverses the list of exceptional children, and appends their aggregate exceptions into this one's exception list - - - - - Special purpose Finish() entry point to be used when the task delegate throws a ThreadAbortedException - This makes a note in the state flags so that we avoid any costly synchronous operations in the finish codepath - such as inlined continuations - - - Indicates whether the ThreadAbortException was added to this task's exception holder. - This should always be true except for the case of non-root self replicating task copies. - - Whether the delegate was executed. - - - - Executes the task. This method will only be called once, and handles bookeeping associated with - self-replicating tasks, in addition to performing necessary exception marshaling. - - The task has already been disposed. - - - - IThreadPoolWorkItem override, which is the entry function for this task when the TP scheduler decides to run it. - - - - - - The ThreadPool calls this if a ThreadAbortException is thrown while trying to execute this workitem. This may occur - before Task would otherwise be able to observe it. - - - - - Outermost entry function to execute this task. Handles all aspects of executing a task on the caller thread. - Currently this is called by IThreadPoolWorkItem.ExecuteWorkItem(), and TaskManager.TryExecuteInline. - - - Performs atomic updates to prevent double execution. Should only be set to true - in codepaths servicing user provided TaskSchedulers. The ConcRT or ThreadPool schedulers don't need this. - - - - The actual code which invokes the body of the task. This can be overriden in derived types. - - - - - Alternate InnerInvoke prototype to be called from ExecuteSelfReplicating() so that - the Parallel Debugger can discover the actual task being invoked. - Details: Here, InnerInvoke is actually being called on the rootTask object while we are actually executing the - childTask. And the debugger needs to discover the childTask, so we pass that down as an argument. - The NoOptimization and NoInlining flags ensure that the childTask pointer is retained, and that this - function appears on the callstack. - - - - - - Performs whatever handling is necessary for an unhandled exception. Normally - this just entails adding the exception to the holder object. - - The exception that went unhandled. - - - - Waits for the to complete execution. - - - The was canceled -or- an exception was thrown during - the execution of the . - - - The has been disposed. - - - - - Waits for the to complete execution. - - - A that represents the number of milliseconds to wait, or a that represents -1 milliseconds to wait indefinitely. - - - true if the completed execution within the allotted time; otherwise, false. - - - The was canceled -or- an exception was thrown during the execution of the . - - - is a negative number other than -1 milliseconds, which represents an - infinite time-out -or- timeout is greater than - . - - - The has been disposed. - - - - - Waits for the to complete execution. - - - A to observe while waiting for the task to complete. - - - The was canceled. - - - The was canceled -or- an exception was thrown during the execution of the . - - - The - has been disposed. - - - - - Waits for the to complete execution. - - - The number of milliseconds to wait, or (-1) to - wait indefinitely. - true if the completed execution within the allotted time; otherwise, - false. - - - is a negative number other than -1, which represents an - infinite time-out. - - - The was canceled -or- an exception was thrown during the execution of the . - - - The - has been disposed. - - - - - Waits for the to complete execution. - - - The number of milliseconds to wait, or (-1) to - wait indefinitely. - - - A to observe while waiting for the task to complete. - - - true if the completed execution within the allotted time; otherwise, false. - - - The was canceled -or- an exception was thrown during the execution of the . - - - The - has been disposed. - - - is a negative number other than -1, which represents an - infinite time-out. - - - The was canceled. - - - - - The core wait function, which is only accesible internally. It's meant to be used in places in TPL code where - the current context is known or cached. - - - - - Cancels the . - - Indiactes whether we should only cancel non-invoked tasks. - For the default scheduler this option will only be serviced through TryDequeue. - For custom schedulers we also attempt an atomic state transition. - true if the task was successfully canceled; otherwise, false. - The - has been disposed. - - - - Sets the task's cancellation acknowledged flag. - - - - - Runs all of the continuations, as appropriate. - - - - - Helper function to determine whether the current task is in the state desired by the - continuation kind under evaluation. Three possibilities exist: the task failed with - an unhandled exception (OnFailed), the task was canceled before running (OnAborted), - or the task completed successfully (OnCompletedSuccessfully). Note that the last - one includes completing due to cancellation. - - The continuation options under evaluation. - True if the continuation should be run given the task's current state. - - - - Creates a continuation that executes when the target completes. - - - An action to run when the completes. When run, the delegate will be - passed the completed task as an argument. - - A new continuation . - - The returned will not be scheduled for execution until the current task has - completed, whether it completes due to running to completion successfully, faulting due to an - unhandled exception, or exiting out early due to being canceled. - - - The argument is null. - - - The has been disposed. - - - - - Creates a continuation that executes when the target completes. - - - An action to run when the completes. When run, the delegate will be - passed the completed task as an argument. - - The that will be assigned to the new continuation task. - A new continuation . - - The returned will not be scheduled for execution until the current task has - completed, whether it completes due to running to completion successfully, faulting due to an - unhandled exception, or exiting out early due to being canceled. - - - The argument is null. - - - The has been disposed. - - The provided CancellationToken - has already been disposed. - - - - - Creates a continuation that executes when the target completes. - - - An action to run when the completes. When run, the delegate will be - passed the completed task as an argument. - - - The to associate with the continuation task and to use for its execution. - - A new continuation . - - The returned will not be scheduled for execution until the current task has - completed, whether it completes due to running to completion successfully, faulting due to an - unhandled exception, or exiting out early due to being canceled. - - - The argument is null. - - - The argument is null. - - - The has been disposed. - - - - - Creates a continuation that executes when the target completes. - - - An action to run when the completes. When run, the delegate will be - passed the completed task as an argument. - - - Options for when the continuation is scheduled and how it behaves. This includes criteria, such - as OnlyOnCanceled, as - well as execution options, such as ExecuteSynchronously. - - A new continuation . - - The returned will not be scheduled for execution until the current task has - completed. If the continuation criteria specified through the parameter are not met, the continuation task will be canceled - instead of scheduled. - - - The argument is null. - - - The argument specifies an invalid value for TaskContinuationOptions. - - - The has been disposed. - - - - - Creates a continuation that executes when the target completes. - - - An action to run when the completes. When run, the delegate will be - passed the completed task as an argument. - - - Options for when the continuation is scheduled and how it behaves. This includes criteria, such - as OnlyOnCanceled, as - well as execution options, such as ExecuteSynchronously. - - The that will be assigned to the new continuation task. - - The to associate with the continuation task and to use for its - execution. - - A new continuation . - - The returned will not be scheduled for execution until the current task has - completed. If the criteria specified through the parameter - are not met, the continuation task will be canceled instead of scheduled. - - - The argument is null. - - - The argument specifies an invalid value for TaskContinuationOptions. - - - The argument is null. - - - The has been disposed. - - The provided CancellationToken - has already been disposed. - - - - - Creates a continuation that executes when the target completes. - - - The type of the result produced by the continuation. - - - A function to run when the completes. When run, the delegate will be - passed the completed task as an argument. - - A new continuation . - - The returned will not be scheduled for execution until the current task has - completed, whether it completes due to running to completion successfully, faulting due to an - unhandled exception, or exiting out early due to being canceled. - - - The argument is null. - - - The has been disposed. - - - - - Creates a continuation that executes when the target completes. - - - The type of the result produced by the continuation. - - - A function to run when the completes. When run, the delegate will be - passed the completed task as an argument. - - The that will be assigned to the new continuation task. - A new continuation . - - The returned will not be scheduled for execution until the current task has - completed, whether it completes due to running to completion successfully, faulting due to an - unhandled exception, or exiting out early due to being canceled. - - - The argument is null. - - - The has been disposed. - - The provided CancellationToken - has already been disposed. - - - - - Creates a continuation that executes when the target completes. - - - The type of the result produced by the continuation. - - - A function to run when the completes. When run, the delegate will be - passed the completed task as an argument. - - - The to associate with the continuation task and to use for its execution. - - A new continuation . - - The returned will not be scheduled for execution until the current task has - completed, whether it completes due to running to completion successfully, faulting due to an - unhandled exception, or exiting out early due to being canceled. - - - The argument is null. - - - The argument is null. - - - The has been disposed. - - - - - Creates a continuation that executes when the target completes. - - - The type of the result produced by the continuation. - - - A function to run when the completes. When run, the delegate will be - passed the completed task as an argument. - - - Options for when the continuation is scheduled and how it behaves. This includes criteria, such - as OnlyOnCanceled, as - well as execution options, such as ExecuteSynchronously. - - A new continuation . - - The returned will not be scheduled for execution until the current task has - completed. If the continuation criteria specified through the parameter are not met, the continuation task will be canceled - instead of scheduled. - - - The argument is null. - - - The argument specifies an invalid value for TaskContinuationOptions. - - - The has been disposed. - - - - - Creates a continuation that executes when the target completes. - - - The type of the result produced by the continuation. - - - A function to run when the completes. When run, the delegate will be - passed the completed task as an argument. - - The that will be assigned to the new continuation task. - - Options for when the continuation is scheduled and how it behaves. This includes criteria, such - as OnlyOnCanceled, as - well as execution options, such as ExecuteSynchronously. - - - The to associate with the continuation task and to use for its - execution. - - A new continuation . - - The returned will not be scheduled for execution until the current task has - completed. If the criteria specified through the parameter - are not met, the continuation task will be canceled instead of scheduled. - - - The argument is null. - - - The argument specifies an invalid value for TaskContinuationOptions. - - - The argument is null. - - - The has been disposed. - - The provided CancellationToken - has already been disposed. - - - - - Converts TaskContinuationOptions to TaskCreationOptions, and also does - some validity checking along the way. - - Incoming TaskContinuationOptions - Outgoing TaskCreationOptions - Outgoing InternalTaskOptions - - - - Registers the continuation and possibly runs it (if the task is already finished). - - The continuation task itself. - TaskScheduler with which to associate continuation task. - Restrictions on when the continuation becomes active. - - - - Waits for all of the provided objects to complete execution. - - - An array of instances on which to wait. - - - The argument is null. - - - The argument contains a null element. - - - At least one of the instances was canceled -or- an exception was thrown during - the execution of at least one of the instances. - - - The has been disposed. - - - - - Waits for all of the provided objects to complete execution. - - - true if all of the instances completed execution within the allotted time; - otherwise, false. - - - An array of instances on which to wait. - - - A that represents the number of milliseconds to wait, or a that represents -1 milliseconds to wait indefinitely. - - - The argument is null. - - - The argument contains a null element. - - - At least one of the instances was canceled -or- an exception was thrown during - the execution of at least one of the instances. - - - is a negative number other than -1 milliseconds, which represents an - infinite time-out -or- timeout is greater than - . - - - The has been disposed. - - - - - Waits for all of the provided objects to complete execution. - - - true if all of the instances completed execution within the allotted time; - otherwise, false. - - - The number of milliseconds to wait, or (-1) to - wait indefinitely. - An array of instances on which to wait. - - - The argument is null. - - - The argument contains a null element. - - - At least one of the instances was canceled -or- an exception was thrown during - the execution of at least one of the instances. - - - The has been disposed. - - - is a negative number other than -1, which represents an - infinite time-out. - - - - - Waits for all of the provided objects to complete execution. - - - true if all of the instances completed execution within the allotted time; - otherwise, false. - - - An array of instances on which to wait. - - - A to observe while waiting for the tasks to complete. - - - The argument is null. - - - The argument contains a null element. - - - At least one of the instances was canceled -or- an exception was thrown during - the execution of at least one of the instances. - - - The was canceled. - - - The has been disposed. - - - - - Waits for all of the provided objects to complete execution. - - - true if all of the instances completed execution within the allotted time; - otherwise, false. - - - An array of instances on which to wait. - - - The number of milliseconds to wait, or (-1) to - wait indefinitely. - - - A to observe while waiting for the tasks to complete. - - - The argument is null. - - - The argument contains a null element. - - - At least one of the instances was canceled -or- an exception was thrown during - the execution of at least one of the instances. - - - The has been disposed. - - - is a negative number other than -1, which represents an - infinite time-out. - - - The was canceled. - - - - - Waits for a set of handles in a STA-aware way. In other words, it will wait for each - of the events individually if we're on a STA thread, because MsgWaitForMultipleObjectsEx - can't do a true wait-all due to its hidden message queue event. This is not atomic, - of course, but we only wait on one-way (MRE) events anyway so this is OK. - - An array of wait handles to wait on. - The timeout to use during waits. - The cancellationToken that enables a wait to be canceled. - True if all waits succeeded, false if a timeout occurred. - - - - Internal WaitAll implementation which is meant to be used with small number of tasks, - optimized for Parallel.Invoke and other structured primitives. - - - - - This internal function is only meant to be called by WaitAll() - If the completed task is canceled or it has other exceptions, here we will add those - into the passed in exception list (which will be lazily initialized here). - - - - - Waits for any of the provided objects to complete execution. - - - An array of instances on which to wait. - - The index of the completed task in the array argument. - - The argument is null. - - - The argument contains a null element. - - - The has been disposed. - - - - - Waits for any of the provided objects to complete execution. - - - An array of instances on which to wait. - - - A that represents the number of milliseconds to wait, or a that represents -1 milliseconds to wait indefinitely. - - - The index of the completed task in the array argument, or -1 if the - timeout occurred. - - - The argument is null. - - - The argument contains a null element. - - - The has been disposed. - - - is a negative number other than -1 milliseconds, which represents an - infinite time-out -or- timeout is greater than - . - - - - - Waits for any of the provided objects to complete execution. - - - An array of instances on which to wait. - - - A to observe while waiting for a task to complete. - - - The index of the completed task in the array argument. - - - The argument is null. - - - The argument contains a null element. - - - The has been disposed. - - - The was canceled. - - - - - Waits for any of the provided objects to complete execution. - - - An array of instances on which to wait. - - - The number of milliseconds to wait, or (-1) to - wait indefinitely. - - - The index of the completed task in the array argument, or -1 if the - timeout occurred. - - - The argument is null. - - - The argument contains a null element. - - - The has been disposed. - - - is a negative number other than -1, which represents an - infinite time-out. - - - - - Waits for any of the provided objects to complete execution. - - - An array of instances on which to wait. - - - The number of milliseconds to wait, or (-1) to - wait indefinitely. - - - A to observe while waiting for a task to complete. - - - The index of the completed task in the array argument, or -1 if the - timeout occurred. - - - The argument is null. - - - The argument contains a null element. - - - The has been disposed. - - - is a negative number other than -1, which represents an - infinite time-out. - - - The was canceled. - - - - - Gets a unique ID for this Task instance. - - - Task IDs are assigned on-demand and do not necessarily represent the order in the which Task - instances were created. - - - - - Returns the unique ID of the currently executing Task. - - - - - Gets the Task instance currently executing, or - null if none exists. - - - - - Gets the StackGuard object assigned to the current thread. - - - - - Gets the Exception that caused the Task to end prematurely. If the Task completed successfully or has not yet thrown any - exceptions, this will return null. - - - Tasks that throw unhandled exceptions store the resulting exception and propagate it wrapped in a - in calls to Wait - or in accesses to the property. Any exceptions not observed by the time - the Task instance is garbage collected will be propagated on the finalizer thread. - - - The Task - has been disposed. - - - - - Gets the TaskStatus of this Task. - - - - - Gets whether this Task instance has completed - execution due to being canceled. - - - A Task will complete in Canceled state either if its CancellationToken - was marked for cancellation before the task started executing, or if the task acknowledged the cancellation request on - its already signaled CancellationToken by throwing an - OperationCanceledException that bears the same - CancellationToken. - - - - - Returns true if this task has a cancellation token and it was signaled. - To be used internally in execute entry codepaths. - - - - - This internal property provides access to the CancellationToken that was set on the task - when it was constructed. - - - - - Gets whether this threw an OperationCanceledException while its CancellationToken was signaled. - - - - - Gets whether this Task has completed. - - - will return true when the Task is in one of the three - final states: RanToCompletion, - Faulted, or - Canceled. - - - - - Checks whether this task has been disposed. - - - - - Gets the TaskCreationOptions used - to create this task. - - - - - Gets a that can be used to wait for the task to - complete. - - - Using the wait functionality provided by - should be preferred over using for similar - functionality. - - - The has been disposed. - - - - - Gets the state object supplied when the Task was created, - or null if none was supplied. - - - - - Gets an indication of whether the asynchronous operation completed synchronously. - - true if the asynchronous operation completed synchronously; otherwise, false. - - - - Provides access to the TaskScheduler responsible for executing this Task. - - - - - Provides access to factory methods for creating and instances. - - - The factory returned from is a default instance - of , as would result from using - the default constructor on TaskFactory. - - - - - Provides an event that can be used to wait for completion. - Only called by Wait*(), which means that we really do need to instantiate a completion event. - - - - - Determines whether this is the root task of a self replicating group. - - - - - Determines whether the task is a replica itself. - - - - - The property formerly known as IsFaulted. - - - - - Gets whether the completed due to an unhandled exception. - - - If is true, the Task's will be equal to - TaskStatus.Faulted, and its - property will be non-null. - - - - - Checks whether the TASK_STATE_EXCEPTIONOBSERVEDBYPARENT status flag is set, - This will only be used by the implicit wait to prevent double throws - - - - - - Checks whether the body was ever invoked. Used by task scheduler code to verify custom schedulers actually ran the task. - - - - - A structure to hold continuation information. - - - - - Constructs a new continuation structure. - - The task to be activated. - The continuation options. - The scheduler to use for the continuation. - - - - Invokes the continuation for the target completion task. - - The completed task. - Whether the continuation can be inlined. - - - - Initializes a new with the specified function. - - - The delegate that represents the code to execute in the task. When the function has completed, - the task's property will be set to return the result value of the function. - - - The argument is null. - - - - - Initializes a new with the specified function. - - - The delegate that represents the code to execute in the task. When the function has completed, - the task's property will be set to return the result value of the function. - - The to be assigned to this task. - - The argument is null. - - The provided CancellationToken - has already been disposed. - - - - - Initializes a new with the specified function and creation options. - - - The delegate that represents the code to execute in the task. When the function has completed, - the task's property will be set to return the result value of the function. - - - The TaskCreationOptions used to - customize the task's behavior. - - - The argument is null. - - - The argument specifies an invalid value for . - - - - - Initializes a new with the specified function and creation options. - - - The delegate that represents the code to execute in the task. When the function has completed, - the task's property will be set to return the result value of the function. - - The that will be assigned to the new task. - - The TaskCreationOptions used to - customize the task's behavior. - - - The argument is null. - - - The argument specifies an invalid value for . - - The provided CancellationToken - has already been disposed. - - - - - Initializes a new with the specified function and state. - - - The delegate that represents the code to execute in the task. When the function has completed, - the task's property will be set to return the result value of the function. - - An object representing data to be used by the action. - - The argument is null. - - - - - Initializes a new with the specified action, state, and options. - - - The delegate that represents the code to execute in the task. When the function has completed, - the task's property will be set to return the result value of the function. - - An object representing data to be used by the function. - The to be assigned to the new task. - - The argument is null. - - The provided CancellationToken - has already been disposed. - - - - - Initializes a new with the specified action, state, and options. - - - The delegate that represents the code to execute in the task. When the function has completed, - the task's property will be set to return the result value of the function. - - An object representing data to be used by the function. - - The TaskCreationOptions used to - customize the task's behavior. - - - The argument is null. - - - The argument specifies an invalid value for . - - - - - Initializes a new with the specified action, state, and options. - - - The delegate that represents the code to execute in the task. When the function has completed, - the task's property will be set to return the result value of the function. - - An object representing data to be used by the function. - The to be assigned to the new task. - - The TaskCreationOptions used to - customize the task's behavior. - - - The argument is null. - - - The argument specifies an invalid value for . - - The provided CancellationToken - has already been disposed. - - - - - Creates a new future object. - - The parent task for this future. - A function that yields the future value. - The task scheduler which will be used to execute the future. - The CancellationToken for the task. - Options to control the future's behavior. - Internal options to control the future's behavior. - The argument specifies - a SelfReplicating , which is illegal."/>. - - - - Creates a new future object. - - The parent task for this future. - An object containing data to be used by the action; may be null. - A function that yields the future value. - The CancellationToken for the task. - The task scheduler which will be used to execute the future. - Options to control the future's behavior. - Internal options to control the future's behavior. - The argument specifies - a SelfReplicating , which is illegal."/>. - - - - Evaluates the value selector of the Task which is passed in as an object and stores the result. - - - - - Creates a continuation that executes when the target completes. - - - An action to run when the completes. When run, the delegate will be - passed the completed task as an argument. - - A new continuation . - - The returned will not be scheduled for execution until the current task has - completed, whether it completes due to running to completion successfully, faulting due to an - unhandled exception, or exiting out early due to being canceled. - - - The argument is null. - - - The has been disposed. - - - - - Creates a continuation that executes when the target completes. - - - An action to run when the completes. When run, the delegate will be - passed the completed task as an argument. - - The that will be assigned to the new continuation task. - A new continuation . - - The returned will not be scheduled for execution until the current task has - completed, whether it completes due to running to completion successfully, faulting due to an - unhandled exception, or exiting out early due to being canceled. - - - The argument is null. - - - The has been disposed. - - The provided CancellationToken - has already been disposed. - - - - - Creates a continuation that executes when the target completes. - - - An action to run when the completes. When run, the delegate will be - passed the completed task as an argument. - - - The to associate with the continuation task and to use for its execution. - - A new continuation . - - The returned will not be scheduled for execution until the current task has - completed, whether it completes due to running to completion successfully, faulting due to an - unhandled exception, or exiting out early due to being canceled. - - - The argument is null. - - - The argument is null. - - - The has been disposed. - - - - - Creates a continuation that executes when the target completes. - - - An action to run when the completes. When run, the delegate will be - passed the completed task as an argument. - - - Options for when the continuation is scheduled and how it behaves. This includes criteria, such - as OnlyOnCanceled, as - well as execution options, such as ExecuteSynchronously. - - A new continuation . - - The returned will not be scheduled for execution until the current task has - completed. If the continuation criteria specified through the parameter are not met, the continuation task will be canceled - instead of scheduled. - - - The argument is null. - - - The argument specifies an invalid value for TaskContinuationOptions. - - - The has been disposed. - - - - - Creates a continuation that executes when the target completes. - - - An action to run when the completes. When run, the delegate will be - passed the completed task as an argument. - - The that will be assigned to the new continuation task. - - Options for when the continuation is scheduled and how it behaves. This includes criteria, such - as OnlyOnCanceled, as - well as execution options, such as ExecuteSynchronously. - - - The to associate with the continuation task and to use for its - execution. - - A new continuation . - - The returned will not be scheduled for execution until the current task has - completed. If the criteria specified through the parameter - are not met, the continuation task will be canceled instead of scheduled. - - - The argument is null. - - - The argument specifies an invalid value for TaskContinuationOptions. - - - The argument is null. - - - The has been disposed. - - The provided CancellationToken - has already been disposed. - - - - - Creates a continuation that executes when the target completes. - - - The type of the result produced by the continuation. - - - A function to run when the completes. When run, the delegate will be - passed the completed task as an argument. - - A new continuation . - - The returned will not be scheduled for execution until the current - task has completed, whether it completes due to running to completion successfully, faulting due - to an unhandled exception, or exiting out early due to being canceled. - - - The argument is null. - - - The has been disposed. - - - - - Creates a continuation that executes when the target completes. - - - The type of the result produced by the continuation. - - - A function to run when the completes. When run, the delegate will be - passed the completed task as an argument. - - The that will be assigned to the new task. - A new continuation . - - The returned will not be scheduled for execution until the current - task has completed, whether it completes due to running to completion successfully, faulting due - to an unhandled exception, or exiting out early due to being canceled. - - - The argument is null. - - - The has been disposed. - - The provided CancellationToken - has already been disposed. - - - - - Creates a continuation that executes when the target completes. - - - The type of the result produced by the continuation. - - - A function to run when the completes. When run, the delegate will be - passed the completed task as an argument. - - - The to associate with the continuation task and to use for its execution. - - A new continuation . - - The returned will not be scheduled for execution until the current task has - completed, whether it completes due to running to completion successfully, faulting due to an - unhandled exception, or exiting out early due to being canceled. - - - The argument is null. - - - The argument is null. - - - The has been disposed. - - - - - Creates a continuation that executes when the target completes. - - - The type of the result produced by the continuation. - - - A function to run when the completes. When run, the delegate will be - passed the completed task as an argument. - - - Options for when the continuation is scheduled and how it behaves. This includes criteria, such - as OnlyOnCanceled, as - well as execution options, such as ExecuteSynchronously. - - A new continuation . - - - The returned will not be scheduled for execution until the current - task has completed, whether it completes due to running to completion successfully, faulting due - to an unhandled exception, or exiting out early due to being canceled. - - - The , when executed, should return a . This task's completion state will be transferred to the task returned - from the ContinueWith call. - - - - The argument is null. - - - The argument specifies an invalid value for TaskContinuationOptions. - - - The has been disposed. - - - - - Creates a continuation that executes when the target completes. - - - The type of the result produced by the continuation. - - - A function to run when the completes. When run, the delegate will be passed as - an argument this completed task. - - The that will be assigned to the new task. - - Options for when the continuation is scheduled and how it behaves. This includes criteria, such - as OnlyOnCanceled, as - well as execution options, such as ExecuteSynchronously. - - - The to associate with the continuation task and to use for its - execution. - - A new continuation . - - - The returned will not be scheduled for execution until the current task has - completed, whether it completes due to running to completion successfully, faulting due to an - unhandled exception, or exiting out early due to being canceled. - - - The , when executed, should return a . - This task's completion state will be transferred to the task returned from the - ContinueWith call. - - - - The argument is null. - - - The argument specifies an invalid value for TaskContinuationOptions. - - - The argument is null. - - - The has been disposed. - - The provided CancellationToken - has already been disposed. - - - - - Gets the result value of this . - - - The get accessor for this property ensures that the asynchronous operation is complete before - returning. Once the result of the computation is available, it is stored and will be returned - immediately on later calls to . - - - - - Provides access to factory methods for creating instances. - - - The factory returned from is a default instance - of , as would result from using - the default constructor on the factory type. - - - - - Provides support for creating and scheduling - Task{TResult} objects. - - The type of the results that are available though - the Task{TResult} objects that are associated with - the methods in this class. - - - There are many common patterns for which tasks are relevant. The - class encodes some of these patterns into methods that pick up default settings, which are - configurable through its constructors. - - - A default instance of is available through the - Task{TResult}.Factory property. - - - - - - Initializes a instance with the default configuration. - - - This constructor creates a instance with a default configuration. The - property is initialized to - TaskCreationOptions.None, the - property is initialized to TaskContinuationOptions.None, - and the TaskScheduler property is - initialized to the current scheduler (see TaskScheduler.Current). - - - - - Initializes a instance with the default configuration. - - The default that will be assigned - to tasks created by this unless another CancellationToken is explicitly specified - while calling the factory methods. - - This constructor creates a instance with a default configuration. The - property is initialized to - TaskCreationOptions.None, the - property is initialized to TaskContinuationOptions.None, - and the TaskScheduler property is - initialized to the current scheduler (see TaskScheduler.Current). - - - - - Initializes a instance with the specified configuration. - - - The - TaskScheduler to use to schedule any tasks created with this TaskFactory{TResult}. A null value - indicates that the current TaskScheduler should be used. - - - With this constructor, the - property is initialized to - TaskCreationOptions.None, the - property is initialized to TaskContinuationOptions.None, - and the TaskScheduler property is - initialized to , unless it's null, in which case the property is - initialized to the current scheduler (see TaskScheduler.Current). - - - - - Initializes a instance with the specified configuration. - - - The default - TaskCreationOptions to use when creating tasks with this TaskFactory{TResult}. - - - The default - TaskContinuationOptions to use when creating continuation tasks with this TaskFactory{TResult}. - - - The exception that is thrown when the - argument or the - argument specifies an invalid value. - - - With this constructor, the - property is initialized to , - the - property is initialized to , and the TaskScheduler property is initialized to the - current scheduler (see TaskScheduler.Current). - - - - - Initializes a instance with the specified configuration. - - The default that will be assigned - to tasks created by this unless another CancellationToken is explicitly specified - while calling the factory methods. - - The default - TaskCreationOptions to use when creating tasks with this TaskFactory{TResult}. - - - The default - TaskContinuationOptions to use when creating continuation tasks with this TaskFactory{TResult}. - - - The default - TaskScheduler to use to schedule any Tasks created with this TaskFactory{TResult}. A null value - indicates that TaskScheduler.Current should be used. - - - The exception that is thrown when the - argument or the - argumentspecifies an invalid value. - - - With this constructor, the - property is initialized to , - the - property is initialized to , and the TaskScheduler property is initialized to - , unless it's null, in which case the property is initialized to the - current scheduler (see TaskScheduler.Current). - - - - - Creates and starts a . - - A function delegate that returns the future result to be available through - the . - The started . - The exception that is thrown when the - argument is null. - - Calling StartNew is functionally equivalent to creating a using one - of its constructors and then calling - Start to schedule it for execution. - However, unless creation and scheduling must be separated, StartNew is the recommended approach - for both simplicity and performance. - - - - - Creates and starts a . - - A function delegate that returns the future result to be available through - the . - The that will be assigned to the new task. - The started . - The exception that is thrown when the - argument is null. - The provided CancellationToken - has already been disposed. - - - Calling StartNew is functionally equivalent to creating a using one - of its constructors and then calling - Start to schedule it for execution. - However, unless creation and scheduling must be separated, StartNew is the recommended approach - for both simplicity and performance. - - - - - Creates and starts a . - - A function delegate that returns the future result to be available through - the . - A TaskCreationOptions value that controls the behavior of the - created - . - The started . - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument specifies an invalid TaskCreationOptions - value. - - Calling StartNew is functionally equivalent to creating a using one - of its constructors and then calling - Start to schedule it for execution. - However, unless creation and scheduling must be separated, StartNew is the recommended approach - for both simplicity and performance. - - - - - Creates and starts a . - - A function delegate that returns the future result to be available through - the . - A TaskCreationOptions value that controls the behavior of the - created - . - The that will be assigned to the new task. - The TaskScheduler - that is used to schedule the created - Task{TResult}. - The started . - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument specifies an invalid TaskCreationOptions - value. - The provided CancellationToken - has already been disposed. - - - Calling StartNew is functionally equivalent to creating a using one - of its constructors and then calling - Start to schedule it for execution. - However, unless creation and scheduling must be separated, StartNew is the recommended approach - for both simplicity and performance. - - - - - Creates and starts a . - - A function delegate that returns the future result to be available through - the . - An object containing data to be used by the - delegate. - The started . - The exception that is thrown when the - argument is null. - - Calling StartNew is functionally equivalent to creating a using one - of its constructors and then calling - Start to schedule it for execution. - However, unless creation and scheduling must be separated, StartNew is the recommended approach - for both simplicity and performance. - - - - - Creates and starts a . - - A function delegate that returns the future result to be available through - the . - An object containing data to be used by the - delegate. - The that will be assigned to the new task. - The started . - The exception that is thrown when the - argument is null. - The provided CancellationToken - has already been disposed. - - - Calling StartNew is functionally equivalent to creating a using one - of its constructors and then calling - Start to schedule it for execution. - However, unless creation and scheduling must be separated, StartNew is the recommended approach - for both simplicity and performance. - - - - - Creates and starts a . - - A function delegate that returns the future result to be available through - the . - An object containing data to be used by the - delegate. - A TaskCreationOptions value that controls the behavior of the - created - . - The started . - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument specifies an invalid TaskCreationOptions - value. - - Calling StartNew is functionally equivalent to creating a using one - of its constructors and then calling - Start to schedule it for execution. - However, unless creation and scheduling must be separated, StartNew is the recommended approach - for both simplicity and performance. - - - - - Creates and starts a . - - A function delegate that returns the future result to be available through - the . - An object containing data to be used by the - delegate. - The that will be assigned to the new task. - A TaskCreationOptions value that controls the behavior of the - created - . - The TaskScheduler - that is used to schedule the created - Task{TResult}. - The started . - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument specifies an invalid TaskCreationOptions - value. - The provided CancellationToken - has already been disposed. - - - Calling StartNew is functionally equivalent to creating a using one - of its constructors and then calling - Start to schedule it for execution. - However, unless creation and scheduling must be separated, StartNew is the recommended approach - for both simplicity and performance. - - - - - Creates a Task that executes an end - method function when a specified IAsyncResult completes. - - The IAsyncResult whose completion should trigger the processing of the - . - The function delegate that processes the completed . - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - A Task that represents the - asynchronous operation. - - - - Creates a Task that executes an end - method function when a specified IAsyncResult completes. - - The IAsyncResult whose completion should trigger the processing of the - . - The function delegate that processes the completed . - The TaskCreationOptions value that controls the behavior of the - created Task. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument specifies an invalid TaskCreationOptions - value. - A Task that represents the - asynchronous operation. - - - - Creates a Task that executes an end - method function when a specified IAsyncResult completes. - - The IAsyncResult whose completion should trigger the processing of the - . - The function delegate that processes the completed . - The TaskScheduler - that is used to schedule the task that executes the end method. - The TaskCreationOptions value that controls the behavior of the - created Task. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument specifies an invalid TaskCreationOptions - value. - A Task that represents the - asynchronous operation. - - - - Creates a Task that represents a pair of - begin and end methods that conform to the Asynchronous Programming Model pattern. - - The delegate that begins the asynchronous operation. - The delegate that ends the asynchronous operation. - An object containing data to be used by the - delegate. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The created Task that - represents the asynchronous operation. - - This method throws any exceptions thrown by the . - - - - - Creates a Task that represents a pair of - begin and end methods that conform to the Asynchronous Programming Model pattern. - - The delegate that begins the asynchronous operation. - The delegate that ends the asynchronous operation. - The TaskCreationOptions value that controls the behavior of the - created Task. - An object containing data to be used by the - delegate. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument specifies an invalid TaskCreationOptions - value. - The created Task that - represents the asynchronous operation. - - This method throws any exceptions thrown by the . - - - - - Creates a Task that represents a pair of - begin and end methods that conform to the Asynchronous Programming Model pattern. - - The type of the first argument passed to the delegate. - The delegate that begins the asynchronous operation. - The delegate that ends the asynchronous operation. - The first argument passed to the - delegate. - An object containing data to be used by the - delegate. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The created Task that - represents the asynchronous operation. - - This method throws any exceptions thrown by the . - - - - - Creates a Task that represents a pair of - begin and end methods that conform to the Asynchronous Programming Model pattern. - - The type of the first argument passed to the delegate. - The delegate that begins the asynchronous operation. - The delegate that ends the asynchronous operation. - The first argument passed to the - delegate. - The TaskCreationOptions value that controls the behavior of the - created Task. - An object containing data to be used by the - delegate. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument specifies an invalid TaskCreationOptions - value. - The created Task that - represents the asynchronous operation. - - This method throws any exceptions thrown by the . - - - - - Creates a Task that represents a pair of - begin and end methods that conform to the Asynchronous Programming Model pattern. - - The type of the first argument passed to the delegate. - The type of the second argument passed to - delegate. - The delegate that begins the asynchronous operation. - The delegate that ends the asynchronous operation. - The first argument passed to the - delegate. - The second argument passed to the - delegate. - An object containing data to be used by the - delegate. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The created Task that - represents the asynchronous operation. - - This method throws any exceptions thrown by the . - - - - - Creates a Task that represents a pair of - begin and end methods that conform to the Asynchronous Programming Model pattern. - - The type of the first argument passed to the delegate. - The type of the second argument passed to - delegate. - The delegate that begins the asynchronous operation. - The delegate that ends the asynchronous operation. - The first argument passed to the - delegate. - The second argument passed to the - delegate. - The TaskCreationOptions value that controls the behavior of the - created Task. - An object containing data to be used by the - delegate. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument specifies an invalid TaskCreationOptions - value. - The created Task that - represents the asynchronous operation. - - This method throws any exceptions thrown by the . - - - - - Creates a Task that represents a pair of - begin and end methods that conform to the Asynchronous Programming Model pattern. - - The type of the first argument passed to the delegate. - The type of the second argument passed to - delegate. - The type of the third argument passed to - delegate. - The delegate that begins the asynchronous operation. - The delegate that ends the asynchronous operation. - The first argument passed to the - delegate. - The second argument passed to the - delegate. - The third argument passed to the - delegate. - An object containing data to be used by the - delegate. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The created Task that - represents the asynchronous operation. - - This method throws any exceptions thrown by the . - - - - - Creates a Task that represents a pair of - begin and end methods that conform to the Asynchronous Programming Model pattern. - - The type of the first argument passed to the delegate. - The type of the second argument passed to - delegate. - The type of the third argument passed to - delegate. - The delegate that begins the asynchronous operation. - The delegate that ends the asynchronous operation. - The first argument passed to the - delegate. - The second argument passed to the - delegate. - The third argument passed to the - delegate. - The TaskCreationOptions value that controls the behavior of the - created Task. - An object containing data to be used by the - delegate. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument specifies an invalid TaskCreationOptions - value. - The created Task that - represents the asynchronous operation. - - This method throws any exceptions thrown by the . - - - - - Creates a continuation Task - that will be started upon the completion of a set of provided Tasks. - - The array of tasks from which to continue. - The function delegate to execute when all tasks in - the array have completed. - The new continuation Task. - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when one - of the elements in the array has been disposed. - - - - Creates a continuation Task - that will be started upon the completion of a set of provided Tasks. - - The array of tasks from which to continue. - The function delegate to execute when all tasks in - the array have completed. - The CancellationToken - that will be assigned to the new continuation task. - The new continuation Task. - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when one - of the elements in the array has been disposed. - The provided CancellationToken - has already been disposed. - - - - - Creates a continuation Task - that will be started upon the completion of a set of provided Tasks. - - The array of tasks from which to continue. - The function delegate to execute when all tasks in the array have completed. - The - TaskContinuationOptions value that controls the behavior of - the created continuation Task. - The new continuation Task. - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when the - argument specifies an invalid TaskContinuationOptions - value. - The exception that is thrown when one - of the elements in the array has been disposed. - - The NotOn* and OnlyOn* TaskContinuationOptions, - which constrain for which TaskStatus states a continuation - will be executed, are illegal with ContinueWhenAll. - - - - - Creates a continuation Task - that will be started upon the completion of a set of provided Tasks. - - The array of tasks from which to continue. - The function delegate to execute when all tasks in the array have completed. - The CancellationToken - that will be assigned to the new continuation task. - The - TaskContinuationOptions value that controls the behavior of - the created continuation Task. - The TaskScheduler - that is used to schedule the created continuation Task. - The new continuation Task. - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when the - argument specifies an invalid TaskContinuationOptions - value. - The exception that is thrown when one - of the elements in the array has been disposed. - The provided CancellationToken - has already been disposed. - - - The NotOn* and OnlyOn* TaskContinuationOptions, - which constrain for which TaskStatus states a continuation - will be executed, are illegal with ContinueWhenAll. - - - - - Creates a continuation Task - that will be started upon the completion of a set of provided Tasks. - - The type of the result of the antecedent . - The array of tasks from which to continue. - The function delegate to execute when all tasks in the - array have completed. - The new continuation . - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when one - of the elements in the array has been disposed. - - - - Creates a continuation Task - that will be started upon the completion of a set of provided Tasks. - - The type of the result of the antecedent . - The array of tasks from which to continue. - The function delegate to execute when all tasks in the - array have completed. - The CancellationToken - that will be assigned to the new continuation task. - The new continuation . - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when one - of the elements in the array has been disposed. - The provided CancellationToken - has already been disposed. - - - - - Creates a continuation Task - that will be started upon the completion of a set of provided Tasks. - - The type of the result of the antecedent . - The array of tasks from which to continue. - The function delegate to execute when all tasks in the - array have completed. - The - TaskContinuationOptions value that controls the behavior of - the created continuation Task. - The new continuation . - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when the - argument specifies an invalid TaskContinuationOptions - value. - The exception that is thrown when one - of the elements in the array has been disposed. - - The NotOn* and OnlyOn* TaskContinuationOptions, - which constrain for which TaskStatus states a continuation - will be executed, are illegal with ContinueWhenAll. - - - - - Creates a continuation Task - that will be started upon the completion of a set of provided Tasks. - - The type of the result of the antecedent . - The array of tasks from which to continue. - The function delegate to execute when all tasks in the - array have completed. - The CancellationToken - that will be assigned to the new continuation task. - The - TaskContinuationOptions value that controls the behavior of - the created continuation Task. - The TaskScheduler - that is used to schedule the created continuation . - The new continuation . - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when the - argument specifies an invalid TaskContinuationOptions - value. - The exception that is thrown when one - of the elements in the array has been disposed. - The provided CancellationToken - has already been disposed. - - - The NotOn* and OnlyOn* TaskContinuationOptions, - which constrain for which TaskStatus states a continuation - will be executed, are illegal with ContinueWhenAll. - - - - - Creates a continuation Task - that will be started upon the completion of any Task in the provided set. - - The array of tasks from which to continue when one task completes. - The function delegate to execute when one task in the array completes. - The new continuation Task. - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when one - of the elements in the array has been disposed. - - - - Creates a continuation Task - that will be started upon the completion of any Task in the provided set. - - The array of tasks from which to continue when one task completes. - The function delegate to execute when one task in the array completes. - The CancellationToken - that will be assigned to the new continuation task. - The new continuation Task. - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when one - of the elements in the array has been disposed. - The provided CancellationToken - has already been disposed. - - - - - Creates a continuation Task - that will be started upon the completion of any Task in the provided set. - - The array of tasks from which to continue when one task completes. - The function delegate to execute when one task in the array completes. - The - TaskContinuationOptions value that controls the behavior of - the created continuation Task. - The new continuation Task. - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when the - argument specifies an invalid TaskContinuationOptions - value. - The exception that is thrown when one - of the elements in the array has been disposed. - - The NotOn* and OnlyOn* TaskContinuationOptions, - which constrain for which TaskStatus states a continuation - will be executed, are illegal with ContinueWhenAny. - - - - - Creates a continuation Task - that will be started upon the completion of any Task in the provided set. - - The array of tasks from which to continue when one task completes. - The function delegate to execute when one task in the array completes. - The CancellationToken - that will be assigned to the new continuation task. - The - TaskContinuationOptions value that controls the behavior of - the created continuation Task. - The TaskScheduler - that is used to schedule the created continuation Task. - The new continuation Task. - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when the - argument specifies an invalid TaskContinuationOptions - value. - The exception that is thrown when one - of the elements in the array has been disposed. - The provided CancellationToken - has already been disposed. - - - The NotOn* and OnlyOn* TaskContinuationOptions, - which constrain for which TaskStatus states a continuation - will be executed, are illegal with ContinueWhenAny. - - - - - Creates a continuation Task - that will be started upon the completion of any Task in the provided set. - - The type of the result of the antecedent . - The array of tasks from which to continue when one task completes. - The function delegate to execute when one task in the - array completes. - The new continuation . - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when one - of the elements in the array has been disposed. - - - - Creates a continuation Task - that will be started upon the completion of any Task in the provided set. - - The type of the result of the antecedent . - The array of tasks from which to continue when one task completes. - The function delegate to execute when one task in the - array completes. - The CancellationToken - that will be assigned to the new continuation task. - The new continuation . - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when one - of the elements in the array has been disposed. - The provided CancellationToken - has already been disposed. - - - - - Creates a continuation Task - that will be started upon the completion of any Task in the provided set. - - The type of the result of the antecedent . - The array of tasks from which to continue when one task completes. - The function delegate to execute when one task in the - array completes. - The - TaskContinuationOptions value that controls the behavior of - the created continuation Task. - The new continuation . - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when the - argument specifies an invalid TaskContinuationOptions - value. - The exception that is thrown when one - of the elements in the array has been disposed. - - The NotOn* and OnlyOn* TaskContinuationOptions, - which constrain for which TaskStatus states a continuation - will be executed, are illegal with ContinueWhenAny. - - - - - Creates a continuation Task - that will be started upon the completion of any Task in the provided set. - - The type of the result of the antecedent . - The array of tasks from which to continue when one task completes. - The function delegate to execute when one task in the - array completes. - The CancellationToken - that will be assigned to the new continuation task. - The - TaskContinuationOptions value that controls the behavior of - the created continuation Task. - The TaskScheduler - that is used to schedule the created continuation . - The new continuation . - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when the - argument specifies an invalid TaskContinuationOptions - value. - The exception that is thrown when one - of the elements in the array has been disposed. - The provided CancellationToken - has already been disposed. - - - The NotOn* and OnlyOn* TaskContinuationOptions, - which constrain for which TaskStatus states a continuation - will be executed, are illegal with ContinueWhenAny. - - - - - Gets the default CancellationToken of this - TaskFactory. - - - This property returns the default that will be assigned to all - tasks created by this factory unless another CancellationToken value is explicitly specified - during the call to the factory methods. - - - - - Gets the TaskScheduler of this - TaskFactory{TResult}. - - - This property returns the default scheduler for this factory. It will be used to schedule all - tasks unless another scheduler is explicitly specified during calls to this factory's methods. - If null, TaskScheduler.Current - will be used. - - - - - Gets the TaskCreationOptions - value of this TaskFactory{TResult}. - - - This property returns the default creation options for this factory. They will be used to create all - tasks unless other options are explicitly specified during calls to this factory's methods. - - - - - Gets the TaskContinuationOptions - value of this TaskFactory{TResult}. - - - This property returns the default continuation options for this factory. They will be used to create - all continuation tasks unless other options are explicitly specified during calls to this factory's methods. - - - - - Represents the current stage in the lifecycle of a . - - - - - The task has been initialized but has not yet been scheduled. - - - - - The task is waiting to be activated and scheduled internally by the .NET Framework infrastructure. - - - - - The task has been scheduled for execution but has not yet begun executing. - - - - - The task is running but has not yet completed. - - - - - The task has finished executing and is implicitly waiting for - attached child tasks to complete. - - - - - The task completed execution successfully. - - - - - The task acknowledged cancellation by throwing an OperationCanceledException with its own CancellationToken - while the token was in signaled state, or the task's CancellationToken was already signaled before the - task started executing. - - - - - The task completed due to an unhandled exception. - - - - - In some cases a replica will want to quit prematurely (ie. before finishing a chunk of work it may have grabbed) - yet they will need the next replica to pick things up from where they left. This API is used to save such state. - - Calling it is also the only way to record a premature exit. - - - - - - Specifies flags that control optional behavior for the creation and execution of tasks. - - - - - Specifies that the default behavior should be used. - - - - - A hint to a TaskScheduler to schedule a - task in as fair a manner as possible, meaning that tasks scheduled sooner will be more likely to - be run sooner, and tasks scheduled later will be more likely to be run later. - - - - - Specifies that a task will be a long-running, course-grained operation. It provides a hint to the - TaskScheduler that oversubscription may be - warranted. - - - - - Specifies that a task is attached to a parent in the task hierarchy. - - - - - Task creation flags which are only used internally. - - - - Specifies "No internal task options" - - - Used to filter out internal vs. public task creation options. - - - Specifies that the task will be queued by the runtime before handing it over to the user. - This flag will be used to skip the cancellationtoken registration step, which is only meant for unstarted tasks. - - - - Specifies flags that control optional behavior for the creation and execution of continuation tasks. - - - - - Default = "Continue on any, no task options, run asynchronously" - Specifies that the default behavior should be used. Continuations, by default, will - be scheduled when the antecedent task completes, regardless of the task's final TaskStatus. - - - - - A hint to a TaskScheduler to schedule a - task in as fair a manner as possible, meaning that tasks scheduled sooner will be more likely to - be run sooner, and tasks scheduled later will be more likely to be run later. - - - - - Specifies that a task will be a long-running, course-grained operation. It provides - a hint to the TaskScheduler that - oversubscription may be warranted. - - - - - Specifies that a task is attached to a parent in the task hierarchy. - - - - - Specifies that the continuation task should not be scheduled if its antecedent ran to completion. - This option is not valid for multi-task continuations. - - - - - Specifies that the continuation task should not be scheduled if its antecedent threw an unhandled - exception. This option is not valid for multi-task continuations. - - - - - Specifies that the continuation task should not be scheduled if its antecedent was canceled. This - option is not valid for multi-task continuations. - - - - - Specifies that the continuation task should be scheduled only if its antecedent ran to - completion. This option is not valid for multi-task continuations. - - - - - Specifies that the continuation task should be scheduled only if its antecedent threw an - unhandled exception. This option is not valid for multi-task continuations. - - - - - Specifies that the continuation task should be scheduled only if its antecedent was canceled. - This option is not valid for multi-task continuations. - - - - - Specifies that the continuation task should be executed synchronously. With this option - specified, the continuation will be run on the same thread that causes the antecedent task to - transition into its final state. If the antecedent is already complete when the continuation is - created, the continuation will run on the thread creating the continuation. Only very - short-running continuations should be executed synchronously. - - - - - Internal helper class to keep track of stack depth and decide whether we should inline or not. - - - - - This method needs to be called before attempting inline execution on the current thread. - If false is returned, it means we are too close to the end of the stack and should give up inlining. - Each call to TryBeginInliningScope() that returns true must be matched with a - call to EndInliningScope() regardless of whether inlining actually took place. - - - - - This needs to be called once for each previous successful TryBeginInliningScope() call after - inlining related logic runs. - - - - - Represents an exception used to communicate task cancellation. - - - - - Initializes a new instance of the class. - - - - - Initializes a new instance of the - class with a specified error message. - - The error message that explains the reason for the exception. - - - - Initializes a new instance of the - class with a specified error message and a reference to the inner exception that is the cause of - this exception. - - The error message that explains the reason for the exception. - The exception that is the cause of the current exception. - - - - Initializes a new instance of the class - with a reference to the that has been canceled. - - A task that has been canceled. - - - - Initializes a new instance of the - class with serialized data. - - The that holds the serialized object data about the exception being thrown. - The that contains contextual information about the source or destination. - - - - Gets the task associated with this exception. - - - It is permissible for no Task to be associated with a - , in which case - this property will return null. - - - - - An exception holder manages a list of exceptions for one particular task. - It offers the ability to aggregate, but more importantly, also offers intrinsic - support for propagating unhandled exceptions that are never observed. It does - this by aggregating and throwing if the holder is ever GC'd without the holder's - contents ever having been requested (e.g. by a Task.Wait, Task.get_Exception, etc). - - - - - Creates a new holder; it will be registered for finalization. - - The task this holder belongs to. - - - - A finalizer that repropagates unhandled exceptions. - - - - - Add an exception to the internal list. This will ensure the holder is - in the proper state (handled/unhandled) depending on the list's contents. - - An exception object (either an Exception or an - IEnumerable{Exception}) to add to the list. - - - - A private helper method that ensures the holder is considered - unhandled, i.e. it is registered for finalization. - - - - - A private helper method that ensures the holder is considered - handled, i.e. it is not registered for finalization. - - Whether this is called from the finalizer thread. - - - - Allocates a new aggregate exception and adds the contents of the list to - it. By calling this method, the holder assumes exceptions to have been - "observed", such that the finalization check will be subsequently skipped. - - Whether this is being called from a finalizer. - An extra exception to be included (optionally). - The aggregate exception to throw. - - - - Provides support for creating and scheduling - Tasks. - - - - There are many common patterns for which tasks are relevant. The - class encodes some of these patterns into methods that pick up default settings, which are - configurable through its constructors. - - - A default instance of is available through the - Task.Factory property. - - - - - - Initializes a instance with the default configuration. - - - This constructor creates a instance with a default configuration. The - property is initialized to - TaskCreationOptions.None, the - property is initialized to TaskContinuationOptions.None, - and the TaskScheduler property is - initialized to the current scheduler (see TaskScheduler.Current). - - - - - Initializes a instance with the specified configuration. - - The default that will be assigned - to tasks created by this unless another CancellationToken is explicitly specified - while calling the factory methods. - - This constructor creates a instance with a default configuration. The - property is initialized to - TaskCreationOptions.None, the - property is initialized to TaskContinuationOptions.None, - and the TaskScheduler property is - initialized to the current scheduler (see TaskScheduler.Current). - - - - - Initializes a instance with the specified configuration. - - - The - TaskScheduler to use to schedule any tasks created with this TaskFactory. A null value - indicates that the current TaskScheduler should be used. - - - With this constructor, the - property is initialized to - TaskCreationOptions.None, the - property is initialized to TaskContinuationOptions.None, - and the TaskScheduler property is - initialized to , unless it's null, in which case the property is - initialized to the current scheduler (see TaskScheduler.Current). - - - - - Initializes a instance with the specified configuration. - - - The default - TaskCreationOptions to use when creating tasks with this TaskFactory. - - - The default - TaskContinuationOptions to use when creating continuation tasks with this TaskFactory. - - - The exception that is thrown when the - argument or the - argument specifies an invalid value. - - - With this constructor, the - property is initialized to , - the - property is initialized to , and the TaskScheduler property is initialized to the - current scheduler (see TaskScheduler.Current). - - - - - Initializes a instance with the specified configuration. - - The default that will be assigned - to tasks created by this unless another CancellationToken is explicitly specified - while calling the factory methods. - - The default - TaskCreationOptions to use when creating tasks with this TaskFactory. - - - The default - TaskContinuationOptions to use when creating continuation tasks with this TaskFactory. - - - The default - TaskScheduler to use to schedule any Tasks created with this TaskFactory. A null value - indicates that TaskScheduler.Current should be used. - - - The exception that is thrown when the - argument or the - argumentspecifies an invalid value. - - - With this constructor, the - property is initialized to , - the - property is initialized to , and the TaskScheduler property is initialized to - , unless it's null, in which case the property is initialized to the - current scheduler (see TaskScheduler.Current). - - - - - Creates and starts a Task. - - The action delegate to execute asynchronously. - The started Task. - The exception that is thrown when the - argument is null. - - Calling StartNew is functionally equivalent to creating a Task using one of its constructors - and then calling - Start to schedule it for execution. However, - unless creation and scheduling must be separated, StartNew is the recommended - approach for both simplicity and performance. - - - - - Creates and starts a Task. - - The action delegate to execute asynchronously. - The that will be assigned to the new task. - The started Task. - The exception that is thrown when the - argument is null. - The provided CancellationToken - has already been disposed. - - - Calling StartNew is functionally equivalent to creating a Task using one of its constructors - and then calling - Start to schedule it for execution. However, - unless creation and scheduling must be separated, StartNew is the recommended - approach for both simplicity and performance. - - - - - Creates and starts a Task. - - The action delegate to execute asynchronously. - A TaskCreationOptions value that controls the behavior of the - created - Task. - The started Task. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument specifies an invalid TaskCreationOptions - value. - - Calling StartNew is functionally equivalent to creating a Task using one of its constructors and - then calling - Start to schedule it for execution. - However, unless creation and scheduling must be separated, StartNew is the recommended approach - for both simplicity and performance. - - - - - Creates and starts a Task. - - The action delegate to execute asynchronously. - The that will be assigned to the new - A TaskCreationOptions value that controls the behavior of the - created - Task. - The TaskScheduler - that is used to schedule the created Task. - The started Task. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument specifies an invalid TaskCreationOptions - value. - The provided CancellationToken - has already been disposed. - - - Calling StartNew is functionally equivalent to creating a Task using one of its constructors and - then calling - Start to schedule it for execution. - However, unless creation and scheduling must be separated, StartNew is the recommended approach - for both simplicity and performance. - - - - - Creates and starts a Task. - - The action delegate to execute asynchronously. - An object containing data to be used by the - delegate. - The started Task. - The exception that is thrown when the - argument is null. - - Calling StartNew is functionally equivalent to creating a Task using one of its constructors and - then calling - Start to schedule it for execution. - However, unless creation and scheduling must be separated, StartNew is the recommended approach - for both simplicity and performance. - - - - - Creates and starts a Task. - - The action delegate to execute asynchronously. - An object containing data to be used by the - delegate. - The that will be assigned to the new - The started Task. - The exception that is thrown when the - argument is null. - The provided CancellationToken - has already been disposed. - - - Calling StartNew is functionally equivalent to creating a Task using one of its constructors and - then calling - Start to schedule it for execution. - However, unless creation and scheduling must be separated, StartNew is the recommended approach - for both simplicity and performance. - - - - - Creates and starts a Task. - - The action delegate to execute asynchronously. - An object containing data to be used by the - delegate. - A TaskCreationOptions value that controls the behavior of the - created - Task. - The started Task. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument specifies an invalid TaskCreationOptions - value. - - Calling StartNew is functionally equivalent to creating a Task using one of its constructors and - then calling - Start to schedule it for execution. - However, unless creation and scheduling must be separated, StartNew is the recommended approach - for both simplicity and performance. - - - - - Creates and starts a Task. - - The action delegate to execute asynchronously. - An object containing data to be used by the - delegate. - The that will be assigned to the new task. - A TaskCreationOptions value that controls the behavior of the - created - Task. - The TaskScheduler - that is used to schedule the created Task. - The started Task. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument specifies an invalid TaskCreationOptions - value. - The provided CancellationToken - has already been disposed. - - - Calling StartNew is functionally equivalent to creating a Task using one of its constructors and - then calling - Start to schedule it for execution. - However, unless creation and scheduling must be separated, StartNew is the recommended approach - for both simplicity and performance. - - - - - Creates and starts a . - - The type of the result available through the - Task. - - A function delegate that returns the future result to be available through - the . - The started . - The exception that is thrown when the - argument is null. - - Calling StartNew is functionally equivalent to creating a using one - of its constructors and then calling - Start to schedule it for execution. - However, unless creation and scheduling must be separated, StartNew is the recommended approach - for both simplicity and performance. - - - - - Creates and starts a . - - The type of the result available through the - Task. - - A function delegate that returns the future result to be available through - the . - The that will be assigned to the new - The started . - The exception that is thrown when the - argument is null. - The provided CancellationToken - has already been disposed. - - - Calling StartNew is functionally equivalent to creating a using one - of its constructors and then calling - Start to schedule it for execution. - However, unless creation and scheduling must be separated, StartNew is the recommended approach - for both simplicity and performance. - - - - - Creates and starts a . - - The type of the result available through the - Task. - - A function delegate that returns the future result to be available through - the . - A TaskCreationOptions value that controls the behavior of the - created - . - The started . - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument specifies an invalid TaskCreationOptions - value. - - Calling StartNew is functionally equivalent to creating a using one - of its constructors and then calling - Start to schedule it for execution. - However, unless creation and scheduling must be separated, StartNew is the recommended approach - for both simplicity and performance. - - - - - Creates and starts a . - - The type of the result available through the - Task. - - A function delegate that returns the future result to be available through - the . - The that will be assigned to the new task. - A TaskCreationOptions value that controls the behavior of the - created - . - The TaskScheduler - that is used to schedule the created - Task{TResult}. - The started . - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument specifies an invalid TaskCreationOptions - value. - The provided CancellationToken - has already been disposed. - - - Calling StartNew is functionally equivalent to creating a using one - of its constructors and then calling - Start to schedule it for execution. - However, unless creation and scheduling must be separated, StartNew is the recommended approach - for both simplicity and performance. - - - - - Creates and starts a . - - The type of the result available through the - Task. - - A function delegate that returns the future result to be available through - the . - An object containing data to be used by the - delegate. - The started . - The exception that is thrown when the - argument is null. - - Calling StartNew is functionally equivalent to creating a using one - of its constructors and then calling - Start to schedule it for execution. - However, unless creation and scheduling must be separated, StartNew is the recommended approach - for both simplicity and performance. - - - - - Creates and starts a . - - The type of the result available through the - Task. - - A function delegate that returns the future result to be available through - the . - An object containing data to be used by the - delegate. - The that will be assigned to the new - The started . - The exception that is thrown when the - argument is null. - The provided CancellationToken - has already been disposed. - - - Calling StartNew is functionally equivalent to creating a using one - of its constructors and then calling - Start to schedule it for execution. - However, unless creation and scheduling must be separated, StartNew is the recommended approach - for both simplicity and performance. - - - - - Creates and starts a . - - The type of the result available through the - Task. - - A function delegate that returns the future result to be available through - the . - An object containing data to be used by the - delegate. - A TaskCreationOptions value that controls the behavior of the - created - . - The started . - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument specifies an invalid TaskCreationOptions - value. - - Calling StartNew is functionally equivalent to creating a using one - of its constructors and then calling - Start to schedule it for execution. - However, unless creation and scheduling must be separated, StartNew is the recommended approach - for both simplicity and performance. - - - - - Creates and starts a . - - The type of the result available through the - Task. - - A function delegate that returns the future result to be available through - the . - An object containing data to be used by the - delegate. - The that will be assigned to the new task. - A TaskCreationOptions value that controls the behavior of the - created - . - The TaskScheduler - that is used to schedule the created - Task{TResult}. - The started . - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument specifies an invalid TaskCreationOptions - value. - The provided CancellationToken - has already been disposed. - - - Calling StartNew is functionally equivalent to creating a using one - of its constructors and then calling - Start to schedule it for execution. - However, unless creation and scheduling must be separated, StartNew is the recommended approach - for both simplicity and performance. - - - - - Creates a Task that executes an end method action - when a specified IAsyncResult completes. - - The IAsyncResult whose completion should trigger the processing of the - . - The action delegate that processes the completed . - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - A Task that represents the asynchronous - operation. - - - - Creates a Task that executes an end method action - when a specified IAsyncResult completes. - - The IAsyncResult whose completion should trigger the processing of the - . - The action delegate that processes the completed . - The TaskCreationOptions value that controls the behavior of the - created Task. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument specifies an invalid TaskCreationOptions - value. - A Task that represents the asynchronous - operation. - - - - Creates a Task that executes an end method action - when a specified IAsyncResult completes. - - The IAsyncResult whose completion should trigger the processing of the - . - The action delegate that processes the completed . - The TaskScheduler - that is used to schedule the task that executes the end method. - The TaskCreationOptions value that controls the behavior of the - created Task. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument specifies an invalid TaskCreationOptions - value. - A Task that represents the asynchronous - operation. - - - - Creates a Task that represents a pair of begin - and end methods that conform to the Asynchronous Programming Model pattern. - - The delegate that begins the asynchronous operation. - The delegate that ends the asynchronous operation. - An object containing data to be used by the - delegate. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The created Task that represents the - asynchronous operation. - - This method throws any exceptions thrown by the . - - - - - Creates a Task that represents a pair of begin - and end methods that conform to the Asynchronous Programming Model pattern. - - The delegate that begins the asynchronous operation. - The delegate that ends the asynchronous operation. - The TaskCreationOptions value that controls the behavior of the - created Task. - An object containing data to be used by the - delegate. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument specifies an invalid TaskCreationOptions - value. - The created Task that represents the - asynchronous operation. - - This method throws any exceptions thrown by the . - - - - - Creates a Task that represents a pair of begin - and end methods that conform to the Asynchronous Programming Model pattern. - - The type of the first argument passed to the - delegate. - The delegate that begins the asynchronous operation. - The delegate that ends the asynchronous operation. - The first argument passed to the - delegate. - An object containing data to be used by the - delegate. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The created Task that represents the - asynchronous operation. - - This method throws any exceptions thrown by the . - - - - - Creates a Task that represents a pair of begin - and end methods that conform to the Asynchronous Programming Model pattern. - - The type of the first argument passed to the - delegate. - The delegate that begins the asynchronous operation. - The delegate that ends the asynchronous operation. - The first argument passed to the - delegate. - The TaskCreationOptions value that controls the behavior of the - created Task. - An object containing data to be used by the - delegate. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument specifies an invalid TaskCreationOptions - value. - The created Task that represents the - asynchronous operation. - - This method throws any exceptions thrown by the . - - - - - Creates a Task that represents a pair of begin - and end methods that conform to the Asynchronous Programming Model pattern. - - The type of the first argument passed to the - delegate. - The type of the second argument passed to - delegate. - The delegate that begins the asynchronous operation. - The delegate that ends the asynchronous operation. - The first argument passed to the - delegate. - The second argument passed to the - delegate. - An object containing data to be used by the - delegate. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The created Task that represents the - asynchronous operation. - - This method throws any exceptions thrown by the . - - - - - Creates a Task that represents a pair of begin - and end methods that conform to the Asynchronous Programming Model pattern. - - The type of the first argument passed to the - delegate. - The type of the second argument passed to - delegate. - The delegate that begins the asynchronous operation. - The delegate that ends the asynchronous operation. - The first argument passed to the - delegate. - The second argument passed to the - delegate. - The TaskCreationOptions value that controls the behavior of the - created Task. - An object containing data to be used by the - delegate. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument specifies an invalid TaskCreationOptions - value. - The created Task that represents the - asynchronous operation. - - This method throws any exceptions thrown by the . - - - - - Creates a Task that represents a pair of begin - and end methods that conform to the Asynchronous Programming Model pattern. - - The type of the first argument passed to the - delegate. - The type of the second argument passed to - delegate. - The type of the third argument passed to - delegate. - The delegate that begins the asynchronous operation. - The delegate that ends the asynchronous operation. - The first argument passed to the - delegate. - The second argument passed to the - delegate. - The third argument passed to the - delegate. - An object containing data to be used by the - delegate. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The created Task that represents the - asynchronous operation. - - This method throws any exceptions thrown by the . - - - - - Creates a Task that represents a pair of begin - and end methods that conform to the Asynchronous Programming Model pattern. - - The type of the first argument passed to the - delegate. - The type of the second argument passed to - delegate. - The type of the third argument passed to - delegate. - The delegate that begins the asynchronous operation. - The delegate that ends the asynchronous operation. - The first argument passed to the - delegate. - The second argument passed to the - delegate. - The third argument passed to the - delegate. - The TaskCreationOptions value that controls the behavior of the - created Task. - An object containing data to be used by the - delegate. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument specifies an invalid TaskCreationOptions - value. - The created Task that represents the - asynchronous operation. - - This method throws any exceptions thrown by the . - - - - - Creates a Task that executes an end - method function when a specified IAsyncResult completes. - - The type of the result available through the - Task. - - The IAsyncResult whose completion should trigger the processing of the - . - The function delegate that processes the completed . - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - A Task that represents the - asynchronous operation. - - - - Creates a Task that executes an end - method function when a specified IAsyncResult completes. - - The type of the result available through the - Task. - - The IAsyncResult whose completion should trigger the processing of the - . - The function delegate that processes the completed . - The TaskCreationOptions value that controls the behavior of the - created Task. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument specifies an invalid TaskCreationOptions - value. - A Task that represents the - asynchronous operation. - - - - Creates a Task that executes an end - method function when a specified IAsyncResult completes. - - The type of the result available through the - Task. - - The IAsyncResult whose completion should trigger the processing of the - . - The function delegate that processes the completed . - The TaskScheduler - that is used to schedule the task that executes the end method. - The TaskCreationOptions value that controls the behavior of the - created Task. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument specifies an invalid TaskCreationOptions - value. - A Task that represents the - asynchronous operation. - - - - Creates a Task that represents a pair of - begin and end methods that conform to the Asynchronous Programming Model pattern. - - The type of the result available through the - Task. - - The delegate that begins the asynchronous operation. - The delegate that ends the asynchronous operation. - An object containing data to be used by the - delegate. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The created Task that - represents the asynchronous operation. - - This method throws any exceptions thrown by the . - - - - - Creates a Task that represents a pair of - begin and end methods that conform to the Asynchronous Programming Model pattern. - - The type of the result available through the - Task. - - The delegate that begins the asynchronous operation. - The delegate that ends the asynchronous operation. - The TaskCreationOptions value that controls the behavior of the - created Task. - An object containing data to be used by the - delegate. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument specifies an invalid TaskCreationOptions - value. - The created Task that - represents the asynchronous operation. - - This method throws any exceptions thrown by the . - - - - - Creates a Task that represents a pair of - begin and end methods that conform to the Asynchronous Programming Model pattern. - - The type of the first argument passed to the delegate. - The type of the result available through the - Task. - - The delegate that begins the asynchronous operation. - The delegate that ends the asynchronous operation. - The first argument passed to the - delegate. - An object containing data to be used by the - delegate. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The created Task that - represents the asynchronous operation. - - This method throws any exceptions thrown by the . - - - - - Creates a Task that represents a pair of - begin and end methods that conform to the Asynchronous Programming Model pattern. - - The type of the first argument passed to the delegate. - The type of the result available through the - Task. - - The delegate that begins the asynchronous operation. - The delegate that ends the asynchronous operation. - The first argument passed to the - delegate. - The TaskCreationOptions value that controls the behavior of the - created Task. - An object containing data to be used by the - delegate. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument specifies an invalid TaskCreationOptions - value. - The created Task that - represents the asynchronous operation. - - This method throws any exceptions thrown by the . - - - - - Creates a Task that represents a pair of - begin and end methods that conform to the Asynchronous Programming Model pattern. - - The type of the first argument passed to the delegate. - The type of the second argument passed to - delegate. - The type of the result available through the - Task. - - The delegate that begins the asynchronous operation. - The delegate that ends the asynchronous operation. - The first argument passed to the - delegate. - The second argument passed to the - delegate. - An object containing data to be used by the - delegate. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The created Task that - represents the asynchronous operation. - - This method throws any exceptions thrown by the . - - - - - Creates a Task that represents a pair of - begin and end methods that conform to the Asynchronous Programming Model pattern. - - The type of the first argument passed to the delegate. - The type of the second argument passed to - delegate. - The type of the result available through the - Task. - - The delegate that begins the asynchronous operation. - The delegate that ends the asynchronous operation. - The first argument passed to the - delegate. - The second argument passed to the - delegate. - The TaskCreationOptions value that controls the behavior of the - created Task. - An object containing data to be used by the - delegate. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument specifies an invalid TaskCreationOptions - value. - The created Task that - represents the asynchronous operation. - - This method throws any exceptions thrown by the . - - - - - Creates a Task that represents a pair of - begin and end methods that conform to the Asynchronous Programming Model pattern. - - The type of the first argument passed to the delegate. - The type of the second argument passed to - delegate. - The type of the third argument passed to - delegate. - The type of the result available through the - Task. - - The delegate that begins the asynchronous operation. - The delegate that ends the asynchronous operation. - The first argument passed to the - delegate. - The second argument passed to the - delegate. - The third argument passed to the - delegate. - An object containing data to be used by the - delegate. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The created Task that - represents the asynchronous operation. - - This method throws any exceptions thrown by the . - - - - - Creates a Task that represents a pair of - begin and end methods that conform to the Asynchronous Programming Model pattern. - - The type of the first argument passed to the delegate. - The type of the second argument passed to - delegate. - The type of the third argument passed to - delegate. - The type of the result available through the - Task. - - The delegate that begins the asynchronous operation. - The delegate that ends the asynchronous operation. - The first argument passed to the - delegate. - The second argument passed to the - delegate. - The third argument passed to the - delegate. - The TaskCreationOptions value that controls the behavior of the - created Task. - An object containing data to be used by the - delegate. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument specifies an invalid TaskCreationOptions - value. - The created Task that - represents the asynchronous operation. - - This method throws any exceptions thrown by the . - - - - - Check validity of options passed to FromAsync method - - The options to be validated. - determines type of FromAsync method that called this method - - - - Creates a continuation Task - that will be started upon the completion of a set of provided Tasks. - - The array of tasks from which to continue. - The action delegate to execute when all tasks in - the array have completed. - The new continuation Task. - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when one - of the elements in the array has been disposed. - - - - Creates a continuation Task - that will be started upon the completion of a set of provided Tasks. - - The array of tasks from which to continue. - The action delegate to execute when all tasks in - the array have completed. - The CancellationToken - that will be assigned to the new continuation task. - The new continuation Task. - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when one - of the elements in the array has been disposed. - The provided CancellationToken - has already been disposed. - - - - - Creates a continuation Task - that will be started upon the completion of a set of provided Tasks. - - The array of tasks from which to continue. - The action delegate to execute when all tasks in the array have completed. - The - TaskContinuationOptions value that controls the behavior of - the created continuation Task. - The new continuation Task. - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when the - argument specifies an invalid TaskContinuationOptions - value. - The exception that is thrown when one - of the elements in the array has been disposed. - - The NotOn* and OnlyOn* TaskContinuationOptions, - which constrain for which TaskStatus states a continuation - will be executed, are illegal with ContinueWhenAll. - - - - - Creates a continuation Task - that will be started upon the completion of a set of provided Tasks. - - The array of tasks from which to continue. - The action delegate to execute when all tasks in the array have completed. - The CancellationToken - that will be assigned to the new continuation task. - The - TaskContinuationOptions value that controls the behavior of - the created continuation Task. - The TaskScheduler - that is used to schedule the created continuation Task. - The new continuation Task. - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when the - argument specifies an invalid TaskContinuationOptions - value. - The exception that is thrown when one - of the elements in the array has been disposed. - The provided CancellationToken - has already been disposed. - - - The NotOn* and OnlyOn* TaskContinuationOptions, - which constrain for which TaskStatus states a continuation - will be executed, are illegal with ContinueWhenAll. - - - - - Creates a continuation Task - that will be started upon the completion of a set of provided Tasks. - - The type of the result of the antecedent . - The array of tasks from which to continue. - The action delegate to execute when all tasks in - the array have completed. - The new continuation Task. - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when one - of the elements in the array has been disposed. - - - - Creates a continuation Task - that will be started upon the completion of a set of provided Tasks. - - The type of the result of the antecedent . - The array of tasks from which to continue. - The action delegate to execute when all tasks in - the array have completed. - The CancellationToken - that will be assigned to the new continuation task. - The new continuation Task. - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when one - of the elements in the array has been disposed. - The provided CancellationToken - has already been disposed. - - - - - Creates a continuation Task - that will be started upon the completion of a set of provided Tasks. - - The type of the result of the antecedent . - The array of tasks from which to continue. - The action delegate to execute when all tasks in the array have completed. - The - TaskContinuationOptions value that controls the behavior of - the created continuation Task. - The new continuation Task. - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when the - argument specifies an invalid TaskContinuationOptions - value. - The exception that is thrown when one - of the elements in the array has been disposed. - - The NotOn* and OnlyOn* TaskContinuationOptions, - which constrain for which TaskStatus states a continuation - will be executed, are illegal with ContinueWhenAll. - - - - - Creates a continuation Task - that will be started upon the completion of a set of provided Tasks. - - The type of the result of the antecedent . - The array of tasks from which to continue. - The action delegate to execute when all tasks in the array have completed. - The CancellationToken - that will be assigned to the new continuation task. - The - TaskContinuationOptions value that controls the behavior of - the created continuation Task. - The TaskScheduler - that is used to schedule the created continuation Task. - The new continuation Task. - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when the - argument specifies an invalid TaskContinuationOptions - value. - The exception that is thrown when one - of the elements in the array has been disposed. - The provided CancellationToken - has already been disposed. - - - The NotOn* and OnlyOn* TaskContinuationOptions, - which constrain for which TaskStatus states a continuation - will be executed, are illegal with ContinueWhenAll. - - - - - Creates a continuation Task - that will be started upon the completion of a set of provided Tasks. - - The type of the result that is returned by the - delegate and associated with the created . - The array of tasks from which to continue. - The function delegate to execute when all tasks in the - array have completed. - The new continuation . - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when one - of the elements in the array has been disposed. - - - - Creates a continuation Task - that will be started upon the completion of a set of provided Tasks. - - The type of the result that is returned by the - delegate and associated with the created . - The array of tasks from which to continue. - The function delegate to execute when all tasks in the - array have completed. - The CancellationToken - that will be assigned to the new continuation task. - The new continuation . - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when one - of the elements in the array has been disposed. - The provided CancellationToken - has already been disposed. - - - - - Creates a continuation Task - that will be started upon the completion of a set of provided Tasks. - - The type of the result that is returned by the - delegate and associated with the created . - The array of tasks from which to continue. - The function delegate to execute when all tasks in the - array have completed. - The - TaskContinuationOptions value that controls the behavior of - the created continuation Task. - The new continuation . - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when the - argument specifies an invalid TaskContinuationOptions - value. - The exception that is thrown when one - of the elements in the array has been disposed. - - The NotOn* and OnlyOn* TaskContinuationOptions, - which constrain for which TaskStatus states a continuation - will be executed, are illegal with ContinueWhenAll. - - - - - Creates a continuation Task - that will be started upon the completion of a set of provided Tasks. - - The type of the result that is returned by the - delegate and associated with the created . - The array of tasks from which to continue. - The function delegate to execute when all tasks in the - array have completed. - The CancellationToken - that will be assigned to the new continuation task. - The - TaskContinuationOptions value that controls the behavior of - the created continuation Task. - The TaskScheduler - that is used to schedule the created continuation . - The new continuation . - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when the - argument specifies an invalid TaskContinuationOptions - value. - The exception that is thrown when one - of the elements in the array has been disposed. - The provided CancellationToken - has already been disposed. - - - The NotOn* and OnlyOn* TaskContinuationOptions, - which constrain for which TaskStatus states a continuation - will be executed, are illegal with ContinueWhenAll. - - - - - Creates a continuation Task - that will be started upon the completion of a set of provided Tasks. - - The type of the result that is returned by the - delegate and associated with the created . - The type of the result of the antecedent . - The array of tasks from which to continue. - The function delegate to execute when all tasks in the - array have completed. - The new continuation . - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when one - of the elements in the array has been disposed. - - - - Creates a continuation Task - that will be started upon the completion of a set of provided Tasks. - - The type of the result that is returned by the - delegate and associated with the created . - The type of the result of the antecedent . - The array of tasks from which to continue. - The function delegate to execute when all tasks in the - array have completed. - The CancellationToken - that will be assigned to the new continuation task. - The new continuation . - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when one - of the elements in the array has been disposed. - The provided CancellationToken - has already been disposed. - - - - - Creates a continuation Task - that will be started upon the completion of a set of provided Tasks. - - The type of the result that is returned by the - delegate and associated with the created . - The type of the result of the antecedent . - The array of tasks from which to continue. - The function delegate to execute when all tasks in the - array have completed. - The - TaskContinuationOptions value that controls the behavior of - the created continuation Task. - The new continuation . - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when the - argument specifies an invalid TaskContinuationOptions - value. - The exception that is thrown when one - of the elements in the array has been disposed. - - The NotOn* and OnlyOn* TaskContinuationOptions, - which constrain for which TaskStatus states a continuation - will be executed, are illegal with ContinueWhenAll. - - - - - Creates a continuation Task - that will be started upon the completion of a set of provided Tasks. - - The type of the result that is returned by the - delegate and associated with the created . - The type of the result of the antecedent . - The array of tasks from which to continue. - The function delegate to execute when all tasks in the - array have completed. - The CancellationToken - that will be assigned to the new continuation task. - The - TaskContinuationOptions value that controls the behavior of - the created continuation Task. - The TaskScheduler - that is used to schedule the created continuation . - The new continuation . - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when the - argument specifies an invalid TaskContinuationOptions - value. - The exception that is thrown when one - of the elements in the array has been disposed. - The provided CancellationToken - has already been disposed. - - - The NotOn* and OnlyOn* TaskContinuationOptions, - which constrain for which TaskStatus states a continuation - will be executed, are illegal with ContinueWhenAll. - - - - - Creates a continuation Task - that will be started upon the completion of any Task in the provided set. - - The array of tasks from which to continue when one task completes. - The action delegate to execute when one task in the array completes. - The new continuation Task. - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when one - of the elements in the array has been disposed. - - - - Creates a continuation Task - that will be started upon the completion of any Task in the provided set. - - The array of tasks from which to continue when one task completes. - The action delegate to execute when one task in the array completes. - The CancellationToken - that will be assigned to the new continuation task. - The new continuation Task. - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when one - of the elements in the array has been disposed. - The provided CancellationToken - has already been disposed. - - - - - Creates a continuation Task - that will be started upon the completion of any Task in the provided set. - - The array of tasks from which to continue when one task completes. - The action delegate to execute when one task in the array completes. - The - TaskContinuationOptions value that controls the behavior of - the created continuation Task. - The new continuation Task. - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when the - argument specifies an invalid TaskContinuationOptions - value. - The exception that is thrown when one - of the elements in the array has been disposed. - - The NotOn* and OnlyOn* TaskContinuationOptions, - which constrain for which TaskStatus states a continuation - will be executed, are illegal with ContinueWhenAny. - - - - - Creates a continuation Task - that will be started upon the completion of any Task in the provided set. - - The array of tasks from which to continue when one task completes. - The action delegate to execute when one task in the array completes. - The CancellationToken - that will be assigned to the new continuation task. - The - TaskContinuationOptions value that controls the behavior of - the created continuation Task. - The TaskScheduler - that is used to schedule the created continuation Task. - The new continuation Task. - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when the - argument specifies an invalid TaskContinuationOptions - value. - The exception that is thrown when one - of the elements in the array has been disposed. - The provided CancellationToken - has already been disposed. - - - The NotOn* and OnlyOn* TaskContinuationOptions, - which constrain for which TaskStatus states a continuation - will be executed, are illegal with ContinueWhenAny. - - - - - Creates a continuation Task - that will be started upon the completion of any Task in the provided set. - - The type of the result that is returned by the - delegate and associated with the created . - The array of tasks from which to continue when one task completes. - The function delegate to execute when one task in the - array completes. - The new continuation . - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when one - of the elements in the array has been disposed. - - - - Creates a continuation Task - that will be started upon the completion of any Task in the provided set. - - The type of the result that is returned by the - delegate and associated with the created . - The array of tasks from which to continue when one task completes. - The function delegate to execute when one task in the - array completes. - The CancellationToken - that will be assigned to the new continuation task. - The new continuation . - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when one - of the elements in the array has been disposed. - The provided CancellationToken - has already been disposed. - - - - - Creates a continuation Task - that will be started upon the completion of any Task in the provided set. - - The type of the result that is returned by the - delegate and associated with the created . - The array of tasks from which to continue when one task completes. - The function delegate to execute when one task in the - array completes. - The - TaskContinuationOptions value that controls the behavior of - the created continuation Task. - The new continuation . - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when the - argument specifies an invalid TaskContinuationOptions - value. - The exception that is thrown when one - of the elements in the array has been disposed. - - The NotOn* and OnlyOn* TaskContinuationOptions, - which constrain for which TaskStatus states a continuation - will be executed, are illegal with ContinueWhenAny. - - - - - Creates a continuation Task - that will be started upon the completion of any Task in the provided set. - - The type of the result that is returned by the - delegate and associated with the created . - The array of tasks from which to continue when one task completes. - The function delegate to execute when one task in the - array completes. - The CancellationToken - that will be assigned to the new continuation task. - The - TaskContinuationOptions value that controls the behavior of - the created continuation Task. - The TaskScheduler - that is used to schedule the created continuation . - The new continuation . - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when the - argument specifies an invalid TaskContinuationOptions - value. - The exception that is thrown when one - of the elements in the array has been disposed. - The provided CancellationToken - has already been disposed. - - - The NotOn* and OnlyOn* TaskContinuationOptions, - which constrain for which TaskStatus states a continuation - will be executed, are illegal with ContinueWhenAny. - - - - - Creates a continuation Task - that will be started upon the completion of any Task in the provided set. - - The type of the result that is returned by the - delegate and associated with the created . - The type of the result of the antecedent . - The array of tasks from which to continue when one task completes. - The function delegate to execute when one task in the - array completes. - The new continuation . - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when one - of the elements in the array has been disposed. - - - - Creates a continuation Task - that will be started upon the completion of any Task in the provided set. - - The type of the result that is returned by the - delegate and associated with the created . - The type of the result of the antecedent . - The array of tasks from which to continue when one task completes. - The function delegate to execute when one task in the - array completes. - The CancellationToken - that will be assigned to the new continuation task. - The new continuation . - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when one - of the elements in the array has been disposed. - The provided CancellationToken - has already been disposed. - - - - - Creates a continuation Task - that will be started upon the completion of any Task in the provided set. - - The type of the result that is returned by the - delegate and associated with the created . - The type of the result of the antecedent . - The array of tasks from which to continue when one task completes. - The function delegate to execute when one task in the - array completes. - The - TaskContinuationOptions value that controls the behavior of - the created continuation Task. - The new continuation . - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when the - argument specifies an invalid TaskContinuationOptions - value. - The exception that is thrown when one - of the elements in the array has been disposed. - - The NotOn* and OnlyOn* TaskContinuationOptions, - which constrain for which TaskStatus states a continuation - will be executed, are illegal with ContinueWhenAny. - - - - - Creates a continuation Task - that will be started upon the completion of any Task in the provided set. - - The type of the result that is returned by the - delegate and associated with the created . - The type of the result of the antecedent . - The array of tasks from which to continue when one task completes. - The function delegate to execute when one task in the - array completes. - The CancellationToken - that will be assigned to the new continuation task. - The - TaskContinuationOptions value that controls the behavior of - the created continuation Task. - The TaskScheduler - that is used to schedule the created continuation . - The new continuation . - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when the - argument specifies an invalid TaskContinuationOptions - value. - The exception that is thrown when one - of the elements in the array has been disposed. - The provided CancellationToken - has already been disposed. - - - The NotOn* and OnlyOn* TaskContinuationOptions, - which constrain for which TaskStatus states a continuation - will be executed, are illegal with ContinueWhenAny. - - - - - Creates a continuation Task - that will be started upon the completion of any Task in the provided set. - - The type of the result of the antecedent . - The array of tasks from which to continue when one task completes. - The action delegate to execute when one task in the - array completes. - The new continuation . - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when one - of the elements in the array has been disposed. - - - - Creates a continuation Task - that will be started upon the completion of any Task in the provided set. - - The type of the result of the antecedent . - The array of tasks from which to continue when one task completes. - The action delegate to execute when one task in the - array completes. - The CancellationToken - that will be assigned to the new continuation task. - The new continuation . - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when one - of the elements in the array has been disposed. - The provided CancellationToken - has already been disposed. - - - - - Creates a continuation Task - that will be started upon the completion of any Task in the provided set. - - The type of the result of the antecedent . - The array of tasks from which to continue when one task completes. - The action delegate to execute when one task in the - array completes. - The - TaskContinuationOptions value that controls the behavior of - the created continuation Task. - The new continuation . - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when the - argument specifies an invalid TaskContinuationOptions - value. - The exception that is thrown when one - of the elements in the array has been disposed. - - The NotOn* and OnlyOn* TaskContinuationOptions, - which constrain for which TaskStatus states a continuation - will be executed, are illegal with ContinueWhenAny. - - - - - Creates a continuation Task - that will be started upon the completion of any Task in the provided set. - - The type of the result of the antecedent . - The array of tasks from which to continue when one task completes. - The action delegate to execute when one task in the - array completes. - The CancellationToken - that will be assigned to the new continuation task. - The - TaskContinuationOptions value that controls the behavior of - the created continuation Task. - The TaskScheduler - that is used to schedule the created continuation . - The new continuation . - The exception that is thrown when the - array is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - argument is null. - The exception that is thrown when the - array contains a null value. - The exception that is thrown when the - array is empty. - The exception that is thrown when the - argument specifies an invalid TaskContinuationOptions - value. - The exception that is thrown when one - of the elements in the array has been disposed. - The provided CancellationToken - has already been disposed. - - - The NotOn* and OnlyOn* TaskContinuationOptions, - which constrain for which TaskStatus states a continuation - will be executed, are illegal with ContinueWhenAny. - - - - - Gets the default CancellationToken of this - TaskFactory. - - - This property returns the default that will be assigned to all - tasks created by this factory unless another CancellationToken value is explicitly specified - during the call to the factory methods. - - - - - Gets the TaskScheduler of this - TaskFactory. - - - This property returns the default scheduler for this factory. It will be used to schedule all - tasks unless another scheduler is explicitly specified during calls to this factory's methods. - If null, TaskScheduler.Current - will be used. - - - - - Gets the TaskCreationOptions - value of this TaskFactory. - - - This property returns the default creation options for this factory. They will be used to create all - tasks unless other options are explicitly specified during calls to this factory's methods. - - - - - Gets the TaskContinuationOptions - value of this TaskFactory. - - - This property returns the default continuation options for this factory. They will be used to create - all continuation tasks unless other options are explicitly specified during calls to this factory's methods. - - - - - Represents the producer side of a unbound to a - delegate, providing access to the consumer side through the property. - - - - It is often the case that a is desired to - represent another asynchronous operation. - TaskCompletionSource is provided for this purpose. It enables - the creation of a task that can be handed out to consumers, and those consumers can use the members - of the task as they would any other. However, unlike most tasks, the state of a task created by a - TaskCompletionSource is controlled explicitly by the methods on TaskCompletionSource. This enables the - completion of the external asynchronous operation to be propagated to the underlying Task. The - separation also ensures that consumers are not able to transition the state without access to the - corresponding TaskCompletionSource. - - - All members of are thread-safe - and may be used from multiple threads concurrently. - - - The type of the result value assocatied with this . - - - - Creates a . - - - - - Creates a - with the specified options. - - - The created - by this instance and accessible through its property - will be instantiated using the specified . - - The options to use when creating the underlying - . - - The represent options invalid for use - with a . - - - - - Creates a - with the specified state. - - The state to use as the underlying - 's AsyncState. - - - - Creates a with - the specified state and options. - - The options to use when creating the underlying - . - The state to use as the underlying - 's AsyncState. - - The represent options invalid for use - with a . - - - - - Attempts to transition the underlying - into the - Faulted - state. - - The exception to bind to this . - True if the operation was successful; otherwise, false. - This operation will return false if the - is already in one - of the three final states: - RanToCompletion, - Faulted, or - Canceled. - - The argument is null. - The was disposed. - - - - Attempts to transition the underlying - into the - Faulted - state. - - The collection of exceptions to bind to this . - True if the operation was successful; otherwise, false. - This operation will return false if the - is already in one - of the three final states: - RanToCompletion, - Faulted, or - Canceled. - - The argument is null. - There are one or more null elements in . - The collection is empty. - The was disposed. - - - - Transitions the underlying - into the - Faulted - state. - - The exception to bind to this . - The argument is null. - - The underlying is already in one - of the three final states: - RanToCompletion, - Faulted, or - Canceled. - - The was disposed. - - - - Transitions the underlying - into the - Faulted - state. - - The collection of exceptions to bind to this . - The argument is null. - There are one or more null elements in . - - The underlying is already in one - of the three final states: - RanToCompletion, - Faulted, or - Canceled. - - The was disposed. - - - - Attempts to transition the underlying - into the - RanToCompletion - state. - - The result value to bind to this . - True if the operation was successful; otherwise, false. - This operation will return false if the - is already in one - of the three final states: - RanToCompletion, - Faulted, or - Canceled. - - The was disposed. - - - - Transitions the underlying - into the - RanToCompletion - state. - - The result value to bind to this . - - The underlying is already in one - of the three final states: - RanToCompletion, - Faulted, or - Canceled. - - The was disposed. - - - - Transitions the underlying - into the - Canceled - state. - - - The underlying is already in one - of the three final states: - RanToCompletion, - Faulted, or - Canceled. - - The was disposed. - - - - Attempts to transition the underlying - into the - Canceled - state. - - True if the operation was successful; otherwise, false. - This operation will return false if the - is already in one - of the three final states: - RanToCompletion, - Faulted, or - Canceled. - - The was disposed. - - - - Gets the created - by this . - - - This property enables a consumer access to the that is controlled by this instance. - The , , - , and - methods (and their "Try" variants) on this instance all result in the relevant state - transitions on this underlying Task. - - - - - Represents an abstract scheduler for tasks. - - - - TaskScheduler acts as the extension point for all - pluggable scheduling logic. This includes mechanisms such as how to schedule a task for execution, and - how scheduled tasks should be exposed to debuggers. - - - All members of the abstract type are thread-safe - and may be used from multiple threads concurrently. - - - - - - Queues a Task to the scheduler. - - - - A class derived from TaskScheduler - implements this method to accept tasks being scheduled on the scheduler. - A typical implementation would store the task in an internal data structure, which would - be serviced by threads that would execute those tasks at some time in the future. - - - This method is only meant to be called by the .NET Framework and - should not be called directly by the derived class. This is necessary - for maintaining the consistency of the system. - - - The Task to be queued. - The argument is null. - - - - Determines whether the provided Task - can be executed synchronously in this call, and if it can, executes it. - - - - A class derived from TaskScheduler implements this function to - support inline execution of a task on a thread that initiates a wait on that task object. Inline - execution is optional, and the request may be rejected by returning false. However, better - scalability typically results the more tasks that can be inlined, and in fact a scheduler that - inlines too little may be prone to deadlocks. A proper implementation should ensure that a - request executing under the policies guaranteed by the scheduler can successfully inline. For - example, if a scheduler uses a dedicated thread to execute tasks, any inlining requests from that - thread should succeed. - - - If a scheduler decides to perform the inline execution, it should do so by calling to the base - TaskScheduler's - TryExecuteTask method with the provided task object, propagating - the return value. It may also be appropriate for the scheduler to remove an inlined task from its - internal data structures if it decides to honor the inlining request. Note, however, that under - some circumstances a scheduler may be asked to inline a task that was not previously provided to - it with the method. - - - The derived scheduler is responsible for making sure that the calling thread is suitable for - executing the given task as far as its own scheduling and execution policies are concerned. - - - The Task to be - executed. - A Boolean denoting whether or not task has previously been - queued. If this parameter is True, then the task may have been previously queued (scheduled); if - False, then the task is known not to have been queued, and this call is being made in order to - execute the task inline without queueing it. - A Boolean value indicating whether the task was executed inline. - The argument is - null. - The was already - executed. - - - - Generates an enumerable of Task instances - currently queued to the scheduler waiting to be executed. - - - - A class derived from implements this method in order to support - integration with debuggers. This method will only be invoked by the .NET Framework when the - debugger requests access to the data. The enumerable returned will be traversed by debugging - utilities to access the tasks currently queued to this scheduler, enabling the debugger to - provide a representation of this information in the user interface. - - - It is important to note that, when this method is called, all other threads in the process will - be frozen. Therefore, it's important to avoid synchronization with other threads that may lead to - blocking. If synchronization is necessary, the method should prefer to throw a - than to block, which could cause a debugger to experience delays. Additionally, this method and - the enumerable returned must not modify any globally visible state. - - - The returned enumerable should never be null. If there are currently no queued tasks, an empty - enumerable should be returned instead. - - - For developers implementing a custom debugger, this method shouldn't be called directly, but - rather this functionality should be accessed through the internal wrapper method - GetScheduledTasksForDebugger: - internal Task[] GetScheduledTasksForDebugger(). This method returns an array of tasks, - rather than an enumerable. In order to retrieve a list of active schedulers, a debugger may use - another internal method: internal static TaskScheduler[] GetTaskSchedulersForDebugger(). - This static method returns an array of all active TaskScheduler instances. - GetScheduledTasksForDebugger then may be used on each of these scheduler instances to retrieve - the list of scheduled tasks for each. - - - An enumerable that allows traversal of tasks currently queued to this scheduler. - - - This scheduler is unable to generate a list of queued tasks at this time. - - - - - Retrieves some thread static state that can be cached and passed to multiple - TryRunInline calls, avoiding superflous TLS fetches. - - A bag of TLS state (or null if none exists). - - - - Attempts to execute the target task synchronously. - - The task to run. - True if the task may have been previously queued, - false if the task was absolutely not previously queued. - The state retrieved from GetThreadStatics - True if it ran, false otherwise. - - - - Attempts to dequeue a Task that was previously queued to - this scheduler. - - The Task to be dequeued. - A Boolean denoting whether the argument was successfully dequeued. - The argument is null. - - - - Notifies the scheduler that a work item has made progress. - - - - - Initializes the . - - - - - Frees all resources associated with this scheduler. - - - - - Creates a - associated with the current . - - - All Task instances queued to - the returned scheduler will be executed through a call to the - Post method - on that context. - - - A associated with - the current SynchronizationContext, as - determined by SynchronizationContext.Current. - - - The current SynchronizationContext may not be used as a TaskScheduler. - - - - - Attempts to execute the provided Task - on this scheduler. - - - - Scheduler implementations are provided with Task - instances to be executed through either the method or the - method. When the scheduler deems it appropriate to run the - provided task, should be used to do so. TryExecuteTask handles all - aspects of executing a task, including action invocation, exception handling, state management, - and lifecycle control. - - - must only be used for tasks provided to this scheduler by the .NET - Framework infrastructure. It should not be used to execute arbitrary tasks obtained through - custom mechanisms. - - - - A Task object to be executed. - - The is not associated with this scheduler. - - A Boolean that is true if was successfully executed, false if it - was not. A common reason for execution failure is that the task had previously been executed or - is in the process of being executed by another thread. - - - - Provides an array of all queued Task instances - for the debugger. - - - The returned array is populated through a call to . - Note that this function is only meant to be invoked by a debugger remotely. - It should not be called by any other codepaths. - - An array of Task instances. - - This scheduler is unable to generate a list of queued tasks at this time. - - - - - Provides an array of all active TaskScheduler - instances for the debugger. - - - This function is only meant to be invoked by a debugger remotely. - It should not be called by any other codepaths. - - An array of TaskScheduler instances. - - - - Registers a new TaskScheduler instance in the global collection of schedulers. - - - - - Removes a TaskScheduler instance from the global collection of schedulers. - - - - - Indicates the maximum concurrency level this - is able to support. - - - - - Indicates whether this is a custom scheduler, in which case the safe code paths will be taken upon task entry - using a CAS to transition from queued state to executing. - - - - - Gets the default TaskScheduler instance. - - - - - Gets the TaskScheduler - associated with the currently executing task. - - - When not called from within a task, will return the scheduler. - - - - - Gets the unique ID for this . - - - - - Occurs when a faulted 's unobserved exception is about to trigger exception escalation - policy, which, by default, would terminate the process. - - - This AppDomain-wide event provides a mechanism to prevent exception - escalation policy (which, by default, terminates the process) from triggering. - Each handler is passed a - instance, which may be used to examine the exception and to mark it as observed. - - - - - Nested class that provides debugger view for TaskScheduler - - - - - A TaskScheduler implementation that executes all tasks queued to it through a call to - on the - that its associated with. The default constructor for this class binds to the current - - - - - Constructs a SynchronizationContextTaskScheduler associated with - - This constructor expects to be set. - - - - Implemetation of for this scheduler class. - - Simply posts the tasks to be executed on the associated . - - - - - - Implementation of for this scheduler class. - - The task will be executed inline only if the call happens within - the associated . - - - - - - - Implementes the property for - this scheduler class. - - By default it returns 1, because a based - scheduler only supports execution on a single thread. - - - - - Provides data for the event that is raised when a faulted 's - exception goes unobserved. - - - The Exception property is used to examine the exception without marking it - as observed, whereas the method is used to mark the exception - as observed. Marking the exception as observed prevents it from triggering exception escalation policy - which, by default, terminates the process. - - - - - Initializes a new instance of the class - with the unobserved exception. - - The Exception that has gone unobserved. - - - - Marks the as "observed," thus preventing it - from triggering exception escalation policy which, by default, terminates the process. - - - - - Gets whether this exception has been marked as "observed." - - - - - The Exception that went unobserved. - - - - - An implementation of TaskScheduler that uses the ThreadPool scheduler - - - - - Constructs a new ThreadPool task scheduler object - - - - - Schedules a task to the ThreadPool. - - The task to schedule. - - - - This internal function will do this: - (1) If the task had previously been queued, attempt to pop it and return false if that fails. - (2) Propagate the return value from Task.ExecuteEntry() back to the caller. - - IMPORTANT NOTE: TryExecuteTaskInline will NOT throw task exceptions itself. Any wait code path using this function needs - to account for exceptions that need to be propagated, and throw themselves accordingly. - - - - - Notifies the scheduler that work is progressing (no-op). - - - - - This is the only scheduler that returns false for this property, indicating that the task entry codepath is unsafe (CAS free) - since we know that the underlying scheduler already takes care of atomic transitions from queued to non-queued. - - - - - Represents an exception used to communicate an invalid operation by a - . - - - - - Initializes a new instance of the class. - - - - - Initializes a new instance of the - class with a specified error message. - - The error message that explains the reason for the exception. - - - - Initializes a new instance of the - class using the default error message and a reference to the inner exception that is the cause of - this exception. - - The exception that is the cause of the current exception. - - - - Initializes a new instance of the - class with a specified error message and a reference to the inner exception that is the cause of - this exception. - - The error message that explains the reason for the exception. - The exception that is the cause of the current exception. - - - - Initializes a new instance of the - class with serialized data. - - The that holds - the serialized object data about the exception being thrown. - The that - contains contextual information about the source or destination. - - - - The exception that is thrown when the post-phase action of a fails. - - - - - Initializes a new instance of the class. - - - - - Initializes a new instance of the class with the specified inner exception. - - The exception that is the cause of the current exception. - - - - Initializes a new instance of the class with a specified error message. - - A string that describes the exception. - - - - Initializes a new instance of the class with a specified error message and inner exception. - - A string that describes the exception. - The exception that is the cause of the current exception. - - - - Initializes a new instance of the class with serialized data. - - The object that holds the serialized object data. - An object that describes the source or destination of the serialized data. - - - - Enables multiple tasks to cooperatively work on an algorithm in parallel through multiple phases. - - - - A group of tasks cooperate by moving through a series of phases, where each in the group signals it - has arrived at the in a given phase and implicitly waits for all others to - arrive. The same can be used for multiple phases. - - - All public and protected members of are thread-safe and may be used - concurrently from multiple threads, with the exception of Dispose, which - must only be used when all other operations on the have - completed. - - - - - - Initializes a new instance of the class. - - The number of participating threads. - is less than 0 - or greater than . - - - - Initializes a new instance of the class. - - The number of participating threads. - The to be executed after each - phase. - is less than 0 - or greater than . - - The delegate will be executed after - all participants have arrived at the barrier in one phase. The participants - will not be released to the next phase until the postPhaseAction delegate - has completed execution. - - - - - Extract the three variables current, total and sense from a given big variable - - The integer variable that contains the other three variables - The current cparticipant count - The total participants count - The sense flag - - - - Write the three variables current. total and the sense to the m_currentTotal - - The old current total to compare - The current cparticipant count - The total participants count - The sense flag - True if the CAS succeeded, false otherwise - - - - Notifies the that there will be an additional participant. - - The phase number of the barrier in which the new participants will first - participate. - - Adding a participant would cause the barrier's participant count to - exceed . - - - The method was invoked from within a post-phase action. - - The current instance has already been - disposed. - - - - Notifies the that there will be additional participants. - - The number of additional participants to add to the - barrier. - The phase number of the barrier in which the new participants will first - participate. - is less than - 0. - Adding participants would cause the - barrier's participant count to exceed . - - The method was invoked from within a post-phase action. - - The current instance has already been - disposed. - - - - Notifies the that there will be one less participant. - - The barrier already has 0 - participants. - - The method was invoked from within a post-phase action. - - The current instance has already been - disposed. - - - - Notifies the that there will be fewer participants. - - The number of additional participants to remove from the barrier. - is less than - 0. - The barrier already has 0 participants. - - The method was invoked from within a post-phase action. - - The current instance has already been - disposed. - - - - Signals that a participant has reached the and waits for all other - participants to reach the barrier as well. - - - The method was invoked from within a post-phase action, the barrier currently has 0 participants, - or the barrier is being used by more threads than are registered as participants. - - The current instance has already been - disposed. - - - - Signals that a participant has reached the and waits for all other - participants to reach the barrier, while observing a . - - The to - observe. - - The method was invoked from within a post-phase action, the barrier currently has 0 participants, - or the barrier is being used by more threads than are registered as participants. - - has been - canceled. - The current instance has already been - disposed. - - - - Signals that a participant has reached the and waits for all other - participants to reach the barrier as well, using a - to measure the time interval. - - A that represents the number of - milliseconds to wait, or a that represents -1 milliseconds to - wait indefinitely. - true if all other participants reached the barrier; otherwise, false. - is a negative number - other than -1 milliseconds, which represents an infinite time-out, or it is greater than - . - - The method was invoked from within a post-phase action, the barrier currently has 0 participants, - or the barrier is being used by more threads than are registered as participants. - - The current instance has already been - disposed. - - - - Signals that a participant has reached the and waits for all other - participants to reach the barrier as well, using a - to measure the time interval, while observing a . - - A that represents the number of - milliseconds to wait, or a that represents -1 milliseconds to - wait indefinitely. - The to - observe. - true if all other participants reached the barrier; otherwise, false. - is a negative number - other than -1 milliseconds, which represents an infinite time-out. - - The method was invoked from within a post-phase action, the barrier currently has 0 participants, - or the barrier is being used by more threads than are registered as participants. - - has been - canceled. - The current instance has already been - disposed. - - - - Signals that a participant has reached the and waits for all other - participants to reach the barrier as well, using a - 32-bit signed integer to measure the time interval. - - The number of milliseconds to wait, or (-1) to wait indefinitely. - true if all other participants reached the barrier; otherwise, false. - is a - negative number other than -1, which represents an infinite time-out. - - The method was invoked from within a post-phase action, the barrier currently has 0 participants, - or the barrier is being used by more threads than are registered as participants. - - The current instance has already been - disposed. - - - - Signals that a participant has reached the barrier and waits for all other participants to reach - the barrier as well, using a - 32-bit signed integer to measure the time interval, while observing a . - - The number of milliseconds to wait, or (-1) to wait indefinitely. - The to - observe. - true if all other participants reached the barrier; otherwise, false. - is a - negative number other than -1, which represents an infinite time-out. - - The method was invoked from within a post-phase action, the barrier currently has 0 participants, - or the barrier is being used by more threads than are registered as participants. - - has been - canceled. - The current instance has already been - disposed. - - - - Finish the phase by invoking the post phase action, and setting the event, this must be called by the - last arrival thread - - The current phase sense - - - - Sets the current phase event and reset the next phase event - - The current phase sense - - - - Releases all resources used by the current instance of . - - - The method was invoked from within a post-phase action. - - - Unlike most of the members of , Dispose is not thread-safe and may not be - used concurrently with other members of this instance. - - - - - When overridden in a derived class, releases the unmanaged resources used by the - , and optionally releases the managed resources. - - true to release both managed and unmanaged resources; false to release - only unmanaged resources. - - Unlike most of the members of , Dispose is not thread-safe and may not be - used concurrently with other members of this instance. - - - - - Throw ObjectDisposedException if the barrier is disposed - - - - - Gets the number of participants in the barrier that haven’t yet signaled - in the current phase. - - - This could be 0 during a post-phase action delegate execution or if the - ParticipantCount is 0. - - - - - Gets the total number of participants in the barrier. - - - - - Gets the number of the barrier's current phase. - - - - - Provides blocking and bounding capabilities for thread-safe collections that - implement . - - - represents a collection - that allows for thread-safe adding and removing of data. - is used as a wrapper - for an instance, allowing - removal attempts from the collection to block until data is available to be removed. Similarly, - a can be created to enforce - an upper-bound on the number of data elements allowed in the - ; addition attempts to the - collection may then block until space is available to store the added items. In this manner, - is similar to a traditional - blocking queue data structure, except that the underlying data storage mechanism is abstracted - away as an . - - Specifies the type of elements in the collection. - - - Initializes a new instance of the - - class without an upper-bound. - - - The default underlying collection is a ConcurrentQueue<T>. - - - - Initializes a new instance of the - class with the specified upper-bound. - - The bounded size of the collection. - The is - not a positive value. - - The default underlying collection is a ConcurrentQueue<T>. - - - - Initializes a new instance of the - class with the specified upper-bound and using the provided - as its underlying data store. - The collection to use as the underlying data store. - The bounded size of the collection. - The argument is - null. - The is not a positive value. - The supplied contains more values - than is permitted by . - - - Initializes a new instance of the - class without an upper-bound and using the provided - as its underlying data store. - The collection to use as the underlying data store. - The argument is - null. - - - Initializes the BlockingCollection instance. - The collection to use as the underlying data store. - The bounded size of the collection. - The number of items currently in the underlying collection. - - - - Adds the item to the . - - The item to be added to the collection. The value can be a null reference. - The has been marked - as complete with regards to additions. - The has been disposed. - The underlying collection didn't accept the item. - - If a bounded capacity was specified when this instance of - was initialized, - a call to Add may block until space is available to store the provided item. - - - - - Adds the item to the . - A is thrown if the is - canceled. - - The item to be added to the collection. The value can be a null reference. - A cancellation token to observe. - If the is canceled. - The has been marked - as complete with regards to additions. - The has been disposed. - The underlying collection didn't accept the item. - - If a bounded capacity was specified when this instance of - was initialized, - a call to may block until space is available to store the provided item. - - - - - Attempts to add the specified item to the . - - The item to be added to the collection. - true if the could be added; otherwise, false. - The has been marked - as complete with regards to additions. - The has been disposed. - The underlying collection didn't accept the item. - - - - Attempts to add the specified item to the . - - The item to be added to the collection. - A that represents the number of milliseconds - to wait, or a that represents -1 milliseconds to wait indefinitely. - - true if the could be added to the collection within - the alloted time; otherwise, false. - The has been marked - as complete with regards to additions. - The has been disposed. - is a negative number - other than -1 milliseconds, which represents an infinite time-out -or- timeout is greater than - . - The underlying collection didn't accept the item. - - - - Attempts to add the specified item to the . - - The item to be added to the collection. - The number of milliseconds to wait, or (-1) to wait indefinitely. - true if the could be added to the collection within - the alloted time; otherwise, false. - The has been marked - as complete with regards to additions. - The has been disposed. - is a - negative number other than -1, which represents an infinite time-out. - The underlying collection didn't accept the item. - - - - Attempts to add the specified item to the . - A is thrown if the is - canceled. - - The item to be added to the collection. - The number of milliseconds to wait, or (-1) to wait indefinitely. - A cancellation token to observe. - true if the could be added to the collection within - the alloted time; otherwise, false. - If the is canceled. - The has been marked - as complete with regards to additions. - The has been disposed. - is a - negative number other than -1, which represents an infinite time-out. - The underlying collection didn't accept the item. - - - Adds an item into the underlying data store using its IProducerConsumerCollection<T>.Add - method. If a bounded capacity was specified and the collection was full, - this method will wait for, at most, the timeout period trying to add the item. - If the timeout period was exhaused before successfully adding the item this method will - return false. - The item to be added to the collection. - The number of milliseconds to wait for the collection to accept the item, - or Timeout.Infinite to wait indefinitely. - A cancellation token to observe. - False if the collection remained full till the timeout period was exhausted.True otherwise. - If the is canceled. - the collection has already been marked - as complete with regards to additions. - If the collection has been disposed. - The underlying collection didn't accept the item. - - - Takes an item from the . - The item removed from the collection. - The is empty and has been marked - as complete with regards to additions. - The has been disposed. - The underlying collection was modified - outside of this instance. - A call to may block until an item is available to be removed. - - - Takes an item from the . - The item removed from the collection. - If the is - canceled or the is empty and has been marked - as complete with regards to additions. - The has been disposed. - The underlying collection was modified - outside of this instance. - A call to may block until an item is available to be removed. - - - - Attempts to remove an item from the . - - The item removed from the collection. - true if an item could be removed; otherwise, false. - The has been disposed. - The underlying collection was modified - outside of this instance. - - - - Attempts to remove an item from the . - - The item removed from the collection. - A that represents the number of milliseconds - to wait, or a that represents -1 milliseconds to wait indefinitely. - - true if an item could be removed from the collection within - the alloted time; otherwise, false. - The has been disposed. - is a negative number - other than -1 milliseconds, which represents an infinite time-out -or- timeout is greater than - . - The underlying collection was modified - outside of this instance. - - - - Attempts to remove an item from the . - - The item removed from the collection. - The number of milliseconds to wait, or (-1) to wait indefinitely. - true if an item could be removed from the collection within - the alloted time; otherwise, false. - The has been disposed. - is a - negative number other than -1, which represents an infinite time-out. - The underlying collection was modified - outside of this instance. - - - - Attempts to remove an item from the . - A is thrown if the is - canceled. - - The item removed from the collection. - The number of milliseconds to wait, or (-1) to wait indefinitely. - A cancellation token to observe. - true if an item could be removed from the collection within - the alloted time; otherwise, false. - If the is canceled. - The has been disposed. - is a - negative number other than -1, which represents an infinite time-out. - The underlying collection was modified - outside of this instance. - - - Takes an item from the underlying data store using its IProducerConsumerCollection<T>.Take - method. If the collection was empty, this method will wait for, at most, the timeout period (if AddingIsCompleted is false) - trying to remove an item. If the timeout period was exhaused before successfully removing an item - this method will return false. - A is thrown if the is - canceled. - - The item removed from the collection. - The number of milliseconds to wait for the collection to have an item available - for removal, or Timeout.Infinite to wait indefinitely. - A cancellation token to observe. - A combined cancellation token if created, it is only created by GetConsumingEnumerable to avoid creating the linked token - multiple times. - False if the collection remained empty till the timeout period was exhausted. True otherwise. - If the is canceled. - If the collection has been disposed. - - - - Adds the specified item to any one of the specified - instances. - - The array of collections. - The item to be added to one of the collections. - The index of the collection in the array to which the item was added. - The argument is - null. - The argument is - a 0-length array or contains a null element, or at least one of collections has been - marked as complete for adding. - At least one of the instances has been disposed. - At least one underlying collection didn't accept the item. - The count of is greater than the maximum size of - 62 for STA and 63 for MTA. - - If a bounded capacity was specified when all of the - instances were initialized, - a call to AddToAny may block until space is available in one of the collections - to store the provided item. - - - - - Adds the specified item to any one of the specified - instances. - A is thrown if the is - canceled. - - The array of collections. - The item to be added to one of the collections. - A cancellation token to observe. - The index of the collection in the array to which the item was added. - If the is canceled. - The argument is - null. - The argument is - a 0-length array or contains a null element, or at least one of collections has been - marked as complete for adding. - At least one of the instances has been disposed. - At least one underlying collection didn't accept the item. - The count of is greater than the maximum size of - 62 for STA and 63 for MTA. - - If a bounded capacity was specified when all of the - instances were initialized, - a call to AddToAny may block until space is available in one of the collections - to store the provided item. - - - - - Attempts to add the specified item to any one of the specified - instances. - - The array of collections. - The item to be added to one of the collections. - The index of the collection in the - array to which the item was added, or -1 if the item could not be added. - The argument is - null. - The argument is - a 0-length array or contains a null element, or at least one of collections has been - marked as complete for adding. - At least one of the instances has been disposed. - At least one underlying collection didn't accept the item. - The count of is greater than the maximum size of - 62 for STA and 63 for MTA. - - - - Attempts to add the specified item to any one of the specified - instances. - - The array of collections. - The item to be added to one of the collections. - A that represents the number of milliseconds - to wait, or a that represents -1 milliseconds to wait indefinitely. - - The index of the collection in the - array to which the item was added, or -1 if the item could not be added. - The argument is - null. - The argument is - a 0-length array or contains a null element, or at least one of collections has been - marked as complete for adding. - At least one of the instances has been disposed. - is a negative number - other than -1 milliseconds, which represents an infinite time-out -or- timeout is greater than - . - At least one underlying collection didn't accept the item. - The count of is greater than the maximum size of - 62 for STA and 63 for MTA. - - - - Attempts to add the specified item to any one of the specified - instances. - - The array of collections. - The item to be added to one of the collections. - The number of milliseconds to wait, or (-1) to wait indefinitely. /// The index of the collection in the - array to which the item was added, or -1 if the item could not be added. - The argument is - null. - The argument is - a 0-length array or contains a null element, or at least one of collections has been - marked as complete for adding. - At least one of the instances has been disposed. - is a - negative number other than -1, which represents an infinite time-out. - At least one underlying collection didn't accept the item. - The count of is greater than the maximum size of - 62 for STA and 63 for MTA. - - - - Attempts to add the specified item to any one of the specified - instances. - A is thrown if the is - canceled. - - The array of collections. - The item to be added to one of the collections. - The number of milliseconds to wait, or (-1) to wait indefinitely. /// The index of the collection in the - array to which the item was added, or -1 if the item could not be added. - A cancellation token to observe. - If the is canceled. - The argument is - null. - The argument is - a 0-length array or contains a null element, or at least one of collections has been - marked as complete for adding. - At least one of the instances has been disposed. - is a - negative number other than -1, which represents an infinite time-out. - At least one underlying collection didn't accept the item. - The count of is greater than the maximum size of - 62 for STA and 63 for MTA. - - - Adds/Takes an item to/from anyone of the specified collections. - A is thrown if the is - canceled. - - The collections into which the item can be added. - The item to be added or the item removed and returned to the caller. - The number of milliseconds to wait for a collection to accept the - operation, or -1 to wait indefinitely. - Indicates whether this method is called to Add or Take. - A cancellation token to observe. - The index into collections for the collection which accepted the - adding/removal of the item; -1 if the item could not be added/removed. - If the is canceled. - If the collections argument is null. - If the collections argument is a 0-length array or contains a - null element. Also, if atleast one of the collections has been marked complete for adds. - If atleast one of the collections has been disposed. - - - - Local static method, used by TryAddTakeAny to get the wait handles for the collection, with exclude option to exclude the Compeleted collections - - The blocking collections - Add or Take operation - The original CancellationToken - True to exclude the compeleted collections - Complete list of cancellationTokens to observe - The collections wait handles - - - - Helper to perform WaitHandle.WaitAny(.., CancellationToken) - this should eventually appear on the WaitHandle class. - - - - - - - - - - Helper function to measure and update the wait time - - The first time (in Ticks) observed when the wait started - The orginal wait timeoutout in milliseconds - The new wait time in milliseconds, -1 if the time expired - - - - Takes an item from any one of the specified - instances. - - The array of collections. - The item removed from one of the collections. - The index of the collection in the array from which - the item was removed, or -1 if an item could not be removed. - The argument is - null. - The argument is - a 0-length array or contains a null element. - At least one of the instances has been disposed. - At least one of the underlying collections was modified - outside of its instance. - The count of is greater than the maximum size of - 62 for STA and 63 for MTA. - A call to TakeFromAny may block until an item is available to be removed. - - - - Takes an item from any one of the specified - instances. - A is thrown if the is - canceled. - - The array of collections. - The item removed from one of the collections. - A cancellation token to observe. - The index of the collection in the array from which - the item was removed, or -1 if an item could not be removed. - The argument is - null. - If the is canceled. - The argument is - a 0-length array or contains a null element. - At least one of the instances has been disposed. - At least one of the underlying collections was modified - outside of its instance. - The count of is greater than the maximum size of - 62 for STA and 63 for MTA. - A call to TakeFromAny may block until an item is available to be removed. - - - - Attempts to remove an item from any one of the specified - instances. - - The array of collections. - The item removed from one of the collections. - The index of the collection in the array from which - the item was removed, or -1 if an item could not be removed. - The argument is - null. - The argument is - a 0-length array or contains a null element. - At least one of the instances has been disposed. - At least one of the underlying collections was modified - outside of its instance. - The count of is greater than the maximum size of - 62 for STA and 63 for MTA. - A call to TryTakeFromAny may block until an item is available to be removed. - - - - Attempts to remove an item from any one of the specified - instances. - - The array of collections. - The item removed from one of the collections. - A that represents the number of milliseconds - to wait, or a that represents -1 milliseconds to wait indefinitely. - - The index of the collection in the array from which - the item was removed, or -1 if an item could not be removed. - The argument is - null. - The argument is - a 0-length array or contains a null element. - At least one of the instances has been disposed. - is a negative number - other than -1 milliseconds, which represents an infinite time-out -or- timeout is greater than - . - At least one of the underlying collections was modified - outside of its instance. - The count of is greater than the maximum size of - 62 for STA and 63 for MTA. - A call to TryTakeFromAny may block until an item is available to be removed. - - - - Attempts to remove an item from any one of the specified - instances. - - The array of collections. - The item removed from one of the collections. - The number of milliseconds to wait, or (-1) to wait indefinitely. - The index of the collection in the array from which - the item was removed, or -1 if an item could not be removed. - The argument is - null. - The argument is - a 0-length array or contains a null element. - At least one of the instances has been disposed. - is a - negative number other than -1, which represents an infinite time-out. - At least one of the underlying collections was modified - outside of its instance. - The count of is greater than the maximum size of - 62 for STA and 63 for MTA. - A call to TryTakeFromAny may block until an item is available to be removed. - - - - Attempts to remove an item from any one of the specified - instances. - A is thrown if the is - canceled. - - The array of collections. - The item removed from one of the collections. - The number of milliseconds to wait, or (-1) to wait indefinitely. - A cancellation token to observe. - The index of the collection in the array from which - the item was removed, or -1 if an item could not be removed. - If the is canceled. - The argument is - null. - The argument is - a 0-length array or contains a null element. - At least one of the instances has been disposed. - is a - negative number other than -1, which represents an infinite time-out. - At least one of the underlying collections was modified - outside of its instance. - The count of is greater than the maximum size of - 62 for STA and 63 for MTA. - A call to TryTakeFromAny may block until an item is available to be removed. - - - - Marks the instances - as not accepting any more additions. - - - After a collection has been marked as complete for adding, adding to the collection is not permitted - and attempts to remove from the collection will not wait when the collection is empty. - - The has been disposed. - - - Cancels the semaphores. - - - - Releases resources used by the instance. - - - - - Releases resources used by the instance. - - Whether being disposed explicitly (true) or due to a finalizer (false). - - - Copies the items from the instance into a new array. - An array containing copies of the elements of the collection. - The has been disposed. - - The copied elements are not removed from the collection. - - - - Copies all of the items in the instance - to a compatible one-dimensional array, starting at the specified index of the target array. - - The one-dimensional array that is the destination of the elements copied from - the instance. The array must have zero-based indexing. - The zero-based index in at which copying begins. - The argument is - null. - The argument is less than zero. - The argument is equal to or greater - than the length of the . - The has been disposed. - - - Copies all of the items in the instance - to a compatible one-dimensional array, starting at the specified index of the target array. - - The one-dimensional array that is the destination of the elements copied from - the instance. The array must have zero-based indexing. - The zero-based index in at which copying begins. - The argument is - null. - The argument is less than zero. - The argument is equal to or greater - than the length of the , the array is multidimensional, or the type parameter for the collection - cannot be cast automatically to the type of the destination array. - The has been disposed. - - - Provides a consuming for items in the collection. - An that removes and returns items from the collection. - The has been disposed. - - - Provides a consuming for items in the collection. - Calling MoveNext on the returned enumerable will block if there is no data available, or will - throw an if the is canceled. - - A cancellation token to observe. - An that removes and returns items from the collection. - The has been disposed. - If the is canceled. - - - Provides an for items in the collection. - An for the items in the collection. - The has been disposed. - - - Provides an for items in the collection. - An for the items in the collection. - The has been disposed. - - - Centralizes the logic for validating the BlockingCollections array passed to TryAddToAny() - and TryTakeFromAny(). - The collections to/from which an item should be added/removed. - Indicates whether this method is called to Add or Take. - A copy of the collections array that acts as a defense to prevent an “outsider” from changing - elements of the array after we have done the validation on them. - If the collections argument is null. - If the collections argument is a 0-length array or contains a - null element. Also, if atleast one of the collections has been marked complete for adds. - If atleast one of the collections has been disposed. - - - Centeralizes the logic of validating the timeout input argument. - The TimeSpan to wait for to successfully complete an operation on the collection. - If the number of millseconds represented by the timeout - TimeSpan is less than 0 or is larger than Int32.MaxValue and not Timeout.Infinite - - - Centralizes the logic of validating the millisecondsTimeout input argument. - The number of milliseconds to wait for to successfully complete an - operation on the collection. - If the number of millseconds is less than 0 and not - equal to Timeout.Infinite. - - - Throws a System.ObjectDisposedException if the collection was disposed - If the collection has been disposed. - - - Gets the bounded capacity of this instance. - The bounded capacity of this collection, or int.MaxValue if no bound was supplied. - The has been disposed. - - - Gets whether this has been marked as complete for adding. - Whether this collection has been marked as complete for adding. - The has been disposed. - - - Gets whether this has been marked as complete for adding and is empty. - Whether this collection has been marked as complete for adding and is empty. - The has been disposed. - - - Gets the number of items contained in the . - The number of items contained in the . - The has been disposed. - - - Gets a value indicating whether access to the is synchronized. - The has been disposed. - - - - Gets an object that can be used to synchronize access to the . This property is not supported. - - The SyncRoot property is not supported. - - - An enumerated data type used internal to the class to specify to a generic method - the current mode of operation. - - - A debugger view of the blocking collection that makes it simple to browse the - collection's contents at a point in time. - The type of element that the BlockingCollection will hold. - - - Constructs a new debugger view object for the provided blocking collection object. - A blocking collection to browse in the debugger. - - - Returns a snapshot of the underlying collection's elements. - - - - Represents an thread-safe, unordered collection of objects. - - Specifies the type of elements in the bag. - - - Bags are useful for storing objects when ordering doesn't matter, and unlike sets, bags support - duplicates. is a thread-safe bag implementation, optimized for - scenarios where the same thread will be both producing and consuming data stored in the bag. - - - accepts null reference (Nothing in Visual Basic) as a valid - value for reference types. - - - All public and protected members of are thread-safe and may be used - concurrently from multiple threads. - - - - - - Initializes a new instance of the - class. - - - - - Initializes a new instance of the - class that contains elements copied from the specified collection. - - The collection whose elements are copied to the new . - is a null reference - (Nothing in Visual Basic). - - - - Local helper function to initalize a new bag object - - An enumeration containing items with which to initialize this bag. - - - - Adds an object to the . - - The object to be added to the - . The value can be a null reference - (Nothing in Visual Basic) for reference types. - - - - - - - - - - Attempts to add an object to the . - - The object to be added to the - . The value can be a null reference - (Nothing in Visual Basic) for reference types. - Always returns true - - - - Attempts to remove and return an object from the . - - When this method returns, contains the object - removed from the or the default value - of if the operation failed. - true if an object was removed successfully; otherwise, false. - - - - Attempts to return an object from the - without removing it. - - When this method returns, contains an object from - the or the default value of - if the operation failed. - true if and object was returned successfully; otherwise, false. - - - - Local helper function to Take or Peek an item from the bag - - To receive the item retrieved from the bag - True means Take operation, false means Peek operation - True if succeeded, false otherwise - - - - Local helper function to retrieve a thread local list by a thread object - - Create a new list if the thread does ot exist - The local list object - - - - Try to reuse an unowned list if exist - unowned lists are the lists that their owner threads are aborted or terminated - this is workaround to avoid memory leaks. - - The list object, null if all lists are owned - - - - Local helper method to steal an item from any other non empty thread - It enumerate all other threads in two passes first pass acquire the lock with TryEnter if succeeded - it steals the item, otherwise it enumerate them again in 2nd pass and acquire the lock using Enter - - To receive the item retrieved from the bag - Whether to remove or peek. - True if succeeded, false otherwise. - - - - local helper function tries to steal an item from given local list - - - - - Local helper function to check the list if it became empty after acquiring the lock - and wait if there is unsynchronized Add/Take operation in the list to be done - - The list to steal - True if can steal, false otherwise - - - - Copies the elements to an existing - one-dimensional Array, starting at the specified array - index. - - The one-dimensional Array that is the - destination of the elements copied from the - . The Array must have zero-based indexing. - The zero-based index in at which copying - begins. - is a null reference (Nothing in - Visual Basic). - is less than - zero. - is equal to or greater than the - length of the - -or- the number of elements in the source is greater than the available space from - to the end of the destination . - - - - Copies the elements of the to an , starting at a particular - index. - - The one-dimensional Array that is the - destination of the elements copied from the - . The Array must have zero-based indexing. - The zero-based index in at which copying - begins. - is a null reference (Nothing in - Visual Basic). - is less than - zero. - - is multidimensional. -or- - does not have zero-based indexing. -or- - is equal to or greater than the length of the - -or- The number of elements in the source is - greater than the available space from to the end of the destination - . -or- The type of the source cannot be cast automatically to the type of the - destination . - - - - - Copies the elements to a new array. - - A new array containing a snapshot of elements copied from the . - - - - Returns an enumerator that iterates through the . - - An enumerator for the contents of the . - - The enumeration represents a moment-in-time snapshot of the contents - of the bag. It does not reflect any updates to the collection after - was called. The enumerator is safe to use - concurrently with reads from and writes to the bag. - - - - - Returns an enumerator that iterates through the . - - An enumerator for the contents of the . - - The items enumerated represent a moment-in-time snapshot of the contents - of the bag. It does not reflect any update to the collection after - was called. - - - - - Get the data array to be serialized - - - - - Construct the stack from a previously seiralized one - - - - - Local helper method to freeze all bag operations, it - 1- Acquire the global lock to prevent any other thread to freeze the bag, and also new new thread can be added - to the dictionary - 2- Then Acquire all local lists locks to prevent steal and synchronized operations - 3- Wait for all un-synchronized operations to be done - - Retrieve the lock taken result for the global lock, to be passed to Unfreeze method - - - - Local helper method to unfreeze the bag from a frozen state - - The lock taken result from the Freeze method - - - - local helper method to acquire all local lists locks - - - - - Local helper method to release all local lists locks - - - - - Local helper function to wait all unsynchronized operations - - - - - Local helper function to get the bag count, the caller should call it from Freeze/Unfreeze block - - The current bag count - - - - Local helper function to return the bag item in a list, this is mainly used by CopyTo and ToArray - This is not thread safe, should be called in Freeze/UnFreeze bag block - - List the contains the bag items - - - - Gets the number of elements contained in the . - - The number of elements contained in the . - - The count returned represents a moment-in-time snapshot of the contents - of the bag. It does not reflect any updates to the collection after - was called. - - - - - Gets a value that indicates whether the is empty. - - true if the is empty; otherwise, false. - - - - Gets a value indicating whether access to the is - synchronized with the SyncRoot. - - true if access to the is synchronized - with the SyncRoot; otherwise, false. For , this property always - returns false. - - - - Gets an object that can be used to synchronize access to the . This property is not supported. - - The SyncRoot property is not supported. - - - - A class that represents a node in the lock thread list - - - - - A class that represents the lock thread list - - - - - ThreadLocalList constructor - - The owner thread for this list - - - - Add new item to head of the list - - The item to add. - Whether to update the count. - - - - Remove an item from the head of the list - - The removed item - - - - Peek an item from the head of the list - - the peeked item - True if succeeded, false otherwise - - - - Steal an item from the tail of the list - - the removed item - remove or peek flag - - - - Gets the total list count, it's not thread safe, may provide incorrect count if it is called concurrently - - - - - List operations - - - - - A simple class for the debugger view window - - - - - Provides a set of methods for querying objects that implement - ParallelQuery{TSource}. This is the parallel equivalent of - . - - - - - Enables parallelization of a query. - - The type of elements of . - An - to convert to a . - The source as a to bind to - ParallelEnumerable extension methods. - - is a null reference (Nothing in Visual Basic). - - - - - Enables parallelization of a query, as sourced by a partitioner - responsible for splitting the input sequence into partitions. - - The type of elements of . - A partitioner over the input sequence. - The as a ParallelQuery to bind to ParallelEnumerable extension methods. - - The source partitioner's GetOrderedPartitions method is used when ordering is enabled, - whereas the partitioner's GetPartitions is used if ordering is not enabled (the default). - The source partitioner's GetDynamicPartitions and GetDynamicOrderedPartitions are not used. - - - is a null reference (Nothing in Visual Basic). - - - - - Enables treatment of a data source as if it was ordered, overriding the default of unordered. - AsOrdered may only be invoked on sequences returned by AsParallel, ParallelEnumerable.Range, - and ParallelEnumerable.Repeat. - - The type of elements of . - The input sequence. - - Thrown if is not one of AsParallel, ParallelEnumerable.Range, or ParallelEnumerable.Repeat. - - - is a null reference (Nothing in Visual Basic). - - - A natural tension exists between performance and preserving order in parallel processing. By default, - a parallelized query behaves as if the ordering of the results is arbitrary - unless AsOrdered is applied or there is an explicit OrderBy operator in the query. - - The source sequence which will maintain ordering in the query. - - - - Enables treatment of a data source as if it was ordered, overriding the default of unordered. - AsOrdered may only be invoked on sequences returned by AsParallel, ParallelEnumerable.Range, - and ParallelEnumerable.Repeat. - - The input sequence. - - Thrown if the is not one of AsParallel, ParallelEnumerable.Range, or ParallelEnumerable.Repeat. - - - is a null reference (Nothing in Visual Basic). - - - A natural tension exists between performance and preserving order in parallel processing. By default, - a parallelized query behaves as if the ordering of the results is arbitrary unless AsOrdered - is applied or there is an explicit OrderBy operator in the query. - - The source sequence which will maintain ordering in the query. - - - - Allows an intermediate query to be treated as if no ordering is implied among the elements. - - - AsUnordered may provide - performance benefits when ordering is not required in a portion of a query. - - The type of elements of . - The input sequence. - The source sequence with arbitrary order. - - is a null reference (Nothing in Visual Basic). - - - - - Enables parallelization of a query. - - An to convert - to a . - - The source as a ParallelQuery to bind to - ParallelEnumerable extension methods. - - - is a null reference (Nothing in Visual Basic). - - - - - Converts a into an - to force sequential - evaluation of the query. - - The type of elements of . - A to convert to an . - The source as an - to bind to sequential extension methods. - - is a null reference (Nothing in Visual Basic). - - - - - Sets the task scheduler to execute the query. - - The type of elements of . - A ParallelQuery on which to set the task scheduler option. - Task scheduler to execute the query. - ParallelQuery representing the same query as source, but with the task scheduler option set. - - or is a null reference (Nothing in Visual Basic). - - - WithTaskScheduler is used multiple times in the query. - - - - - Sets the degree of parallelism to use in a query. Degree of parallelism is the maximum number of concurrently - executing tasks that will be used to process the query. - - The type of elements of . - A ParallelQuery on which to set the limit on the degrees of parallelism. - The degree of parallelism for the query. - ParallelQuery representing the same query as source, with the limit on the degrees of parallelism set. - - is a null reference (Nothing in Visual Basic). - - - WithDegreeOfParallelism is used multiple times in the query. - - - is less than 1 or greater than 63. - - - - - Sets the to associate with the query. - - The type of elements of . - A ParallelQuery on which to set the option. - A cancellation token. - ParallelQuery representing the same query as source, but with the - registered. - - is a null reference (Nothing in Visual Basic). - - - WithCancellation is used multiple times in the query. - - - The associated with the has been disposed. - - - - - Sets the execution mode of the query. - - The type of elements of . - A ParallelQuery on which to set the option. - The mode in which to execute the query. - ParallelQuery representing the same query as source, but with the - registered. - - is a null reference (Nothing in Visual Basic). - - - is not a valid value. - - - WithExecutionMode is used multiple times in the query. - - - - - Sets the merge options for this query, which specify how the query will buffer output. - - The type of elements of . - A ParallelQuery on which to set the option. - The merge optiosn to set for this query. - ParallelQuery representing the same query as source, but with the - registered. - - is a null reference (Nothing in Visual Basic). - - - is not a valid value. - - - WithMergeOptions is used multiple times in the query. - - - - - Generates a parallel sequence of integral numbers within a specified range. - - The value of the first integer in the sequence. - The number of sequential integers to generate. - An IEnumerable<Int32> in C# or IEnumerable(Of Int32) in - Visual Basic that contains a range of sequential integral numbers. - - is less than 0 - -or- - + - 1 is larger than . - - - - - Generates a parallel sequence that contains one repeated value. - - The type of the value to be repeated in the result sequence. - The value to be repeated. - The number of times to repeat the value in the generated sequence. - A sequence that contains a repeated value. - - is less than 0. - - - - - Returns an empty ParallelQuery{TResult} that has the specified type argument. - - The type to assign to the type parameter of the returned - generic sequence. - An empty sequence whose type argument is . - - - - Invokes in parallel the specified action for each element in the . - - - This is an efficient way to process the output from a parallelized query because it does - not require a merge step at the end. However, order of execution is non-deterministic. - - The type of elements of . - The whose elements will be processed by - . - An Action to invoke on each element. - - or is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Filters in parallel a sequence of values based on a predicate. - - The type of the elements of source. - A sequence to filter. - A function to test each element for a condition. - A sequence that contains elements from the input sequence that satisfy - the condition. - - or is a null reference (Nothing in Visual Basic). - - - - - Filters in parallel a sequence of values based on a predicate. Each element's index is used in the logic of the predicate function. - - The type of the elements of source. - A sequence to filter. - A function to test each element for a condition. - A sequence that contains elements from the input sequence that satisfy the condition. - - or is a null reference (Nothing in Visual Basic). - - - - - Projects in parallel each element of a sequence into a new form. - - The type of the elements of . - The type of elements resturned by selector. - A sequence of values to invoke a transform function on. - A transform function to apply to each element. - A sequence whose elements are the result of invoking the transform function on each - element of . - - or is a null reference (Nothing in Visual Basic). - - - - - Projects in parallel each element of a sequence into a new form by incorporating the element's index. - - The type of the elements of . - The type of elements resturned by selector. - A sequence of values to invoke a transform function on. - A transform function to apply to each element. - A sequence whose elements are the result of invoking the transform function on each - element of . - - or is a null reference (Nothing in Visual Basic). - - - - - Merges in parallel two sequences by using the specified predicate function. - - The type of the elements of the first sequence. - The type of the elements of the second sequence. - The type of the return elements. - The first sequence to zip. - The second sequence to zip. - A function to create a result element from two matching elements. - - A sequence that has elements of type that are obtained by performing - resultSelector pairwise on two sequences. If the sequence lengths are unequal, this truncates - to the length of the shorter sequence. - - - or or is a null reference (Nothing in Visual Basic). - - - - - This Zip overload should never be called. - This method is marked as obsolete and always throws - when invoked. - - This type parameter is not used. - This type parameter is not used. - This type parameter is not used. - This parameter is not used. - This parameter is not used. - This parameter is not used. - This overload always throws a . - The exception that occurs when this method is called. - - This overload exists to disallow usage of Zip with a left data source of type - and a right data source of type . - Otherwise, the Zip operator would appear to be bind to the parallel implementation, but would in reality bind to the sequential implementation. - - - - - Correlates in parallel the elements of two sequences based on matching keys. - The default equality comparer is used to compare keys. - - The type of the elements of the first sequence. - The type of the elements of the second sequence. - The type of the keys returned by the key selector functions. - The type of the result elements. - The first sequence to join. - The sequence to join to the first sequence. - A function to extract the join key from each element of - the first sequence. - A function to extract the join key from each element of - the second sequence. - A function to create a result element from two matching elements. - A sequence that has elements of type that are obtained by performing - an inner join on two sequences. - - or or or - or is a null reference (Nothing in Visual Basic). - - - - - This Join overload should never be called. - This method is marked as obsolete and always throws when invoked. - - This type parameter is not used. - This type parameter is not used. - This type parameter is not used. - This type parameter is not used. - This parameter is not used. - This parameter is not used. - This parameter is not used. - This parameter is not used. - This parameter is not used. - This overload always throws a . - The exception that occurs when this method is called. - - This overload exists to disallow usage Join with a left data source of type - and a right data source of type . - Otherwise, the Join operator would appear to be binding to the parallel implementation, but would in reality bind to the sequential implementation. - - - - - Correlates in parallel the elements of two sequences based on matching keys. - A specified IEqualityComparer{T} is used to compare keys. - - The type of the elements of the first sequence. - The type of the elements of the second sequence. - The type of the keys returned by the key selector functions. - The type of the result elements. - The first sequence to join. - The sequence to join to the first sequence. - A function to extract the join key from each element - of the first sequence. - A function to extract the join key from each element - of the second sequence. - A function to create a result element from two matching elements. - An IEqualityComparer<(Of <(T>)>) to hash and compare keys. - A sequence that has elements of type that are obtained by performing - an inner join on two sequences. - - or or or - or is a null reference (Nothing in Visual Basic). - - - - - This Join overload should never be called. - This method is marked as obsolete and always throws when invoked. - - This type parameter is not used. - This type parameter is not used. - This type parameter is not used. - This type parameter is not used. - This parameter is not used. - This parameter is not used. - This parameter is not used. - This parameter is not used. - This parameter is not used. - This parameter is not used. - This overload always throws a . - The exception that occurs when this method is called. - - This overload exists to disallow usage of Join with a left data source of type - and a right data source of type . - Otherwise, the Join operator would appear to be binding to the parallel implementation, but would in reality bind to the sequential implementation. - - - - - Correlates in parallel the elements of two sequences based on equality of keys and groups the results. - The default equality comparer is used to compare keys. - - The type of the elements of the first sequence. - The type of the elements of the second sequence. - The type of the keys returned by the key selector functions. - The type of the result elements. - The first sequence to join. - The sequence to join to the first sequence. - A function to extract the join key from each element - of the first sequence. - A function to extract the join key from each element - of the second sequence. - A function to create a result element from an element from - the first sequence and a collection of matching elements from the second sequence. - A sequence that has elements of type that are obtained by performing - a grouped join on two sequences. - - or or or - or is a null reference (Nothing in Visual Basic). - - - - - This GroupJoin overload should never be called. - This method is marked as obsolete and always throws when called. - - This type parameter is not used. - This type parameter is not used. - This type parameter is not used. - This type parameter is not used. - This parameter is not used. - This parameter is not used. - This parameter is not used. - This parameter is not used. - This parameter is not used. - This overload always throws a . - The exception that occurs when this method is called. - - This overload exists to disallow usage of GroupJoin with a left data source of type - and a right data source of type . - Otherwise, the GroupJoin operator would appear to be binding to the parallel implementation, - but would in reality bind to the sequential implementation. - - - - - Correlates in parallel the elements of two sequences based on key equality and groups the results. - A specified IEqualityComparer{T} is used to compare keys. - - The type of the elements of the first sequence. - The type of the elements of the second sequence. - The type of the keys returned by the key selector functions. - The type of the result elements. - The first sequence to join. - The sequence to join to the first sequence. - A function to extract the join key from each element - of the first sequence. - A function to extract the join key from each element - of the second sequence. - A function to create a result element from an element from - the first sequence and a collection of matching elements from the second sequence. - An IEqualityComparer<(Of <(T>)>) to hash and compare keys. - A sequence that has elements of type that are obtained by performing - a grouped join on two sequences. - - or or or - or is a null reference (Nothing in Visual Basic). - - - - - This GroupJoin overload should never be called. - This method is marked as obsolete and always throws when called. - - This type parameter is not used. - This type parameter is not used. - This type parameter is not used. - This type parameter is not used. - This parameter is not used. - This parameter is not used. - This parameter is not used. - This parameter is not used. - This parameter is not used. - This parameter is not used. - This overload always throws a . - The exception that occurs when this method is called. - - This overload exists to disallow usage of GroupJoin with a left data source of type - and a right data source of type . - Otherwise, the GroupJoin operator would appear to be binding to the parallel implementation, - but would in reality bind to the sequential implementation. - - - - - Projects in parallel each element of a sequence to an IEnumerable{T} - and flattens the resulting sequences into one sequence. - - The type of elements of . - The type of the elements of the sequence returned by selector. - A sequence of values to project. - A transform function to apply to each element. - A sequence whose elements are the result of invoking the one-to-many transform - function on each element of the input sequence. - - or is a null reference (Nothing in Visual Basic). - - - - - Projects in parallel each element of a sequence to an IEnumerable{T}, and flattens the resulting - sequences into one sequence. The index of each source element is used in the projected form of - that element. - - The type of elements of . - The type of the elements of the sequence returned by selector. - A sequence of values to project. - A transform function to apply to each element. - A sequence whose elements are the result of invoking the one-to-many transform - function on each element of the input sequence. - - or is a null reference (Nothing in Visual Basic). - - - - - Projects each element of a sequence to an IEnumerable{T}, - flattens the resulting sequences into one sequence, and invokes a result selector - function on each element therein. - - The type of elements of . - The type of the intermediate elements collected by . - - A sequence of values to project. - A transform function to apply to each source element; - the second parameter of the function represents the index of the source element. - A function to create a result element from an element from - the first sequence and a collection of matching elements from the second sequence. - A sequence whose elements are the result of invoking the one-to-many transform - function on each element of and then mapping - each of those sequence elements and their corresponding source element to a result element. - - or or - is a null reference (Nothing in Visual Basic). - - - - - Projects each element of a sequence to an IEnumerable{T}, flattens the resulting - sequences into one sequence, and invokes a result selector function on each element - therein. The index of each source element is used in the intermediate projected - form of that element. - - The type of elements of . - The type of the intermediate elements collected by - . - The type of elements to return. - A sequence of values to project. - A transform function to apply to each source element; - the second parameter of the function represents the index of the source element. - A function to create a result element from an element from - the first sequence and a collection of matching elements from the second sequence. - - A sequence whose elements are the result of invoking the one-to-many transform - function on each element of and then mapping - each of those sequence elements and their corresponding source element to a - result element. - - - or or - is a null reference (Nothing in Visual Basic). - - - - - Sorts in parallel the elements of a sequence in ascending order according to a key. - - - In contrast to the sequential implementation, this is not a stable sort. - To achieve a stable sort, change a query of the form: - var ordered = source.OrderBy((e) => e.k); - to instead be formed as: - var ordered = source.Select((e,i) => new { E=e, I=i }).OrderBy((v) => v.i).Select((v) => v.e); - - The type of elements of . - The type of the key returned by . - A sequence of values to order. - A function to extract a key from an element. - An OrderedParallelQuery{TSource} whose elements are sorted - according to a key. - - or is a null reference (Nothing in Visual Basic). - - - - - Sorts in parallel the elements of a sequence in ascending order by using a specified comparer. - - - In contrast to the sequential implementation, this is not a stable sort. - See the remarks for OrderBy(ParallelQuery{TSource}, Func{TSource,TKey}) for - an approach to implementing a stable sort. - - The type of elements of . - The type of the key returned by . - A sequence of values to order. - A function to extract a key from an element. - An IComparer{TKey} to compare keys. - An OrderedParallelQuery{TSource} whose elements are sorted according - to a key. - - or is a null reference (Nothing in Visual Basic). - - - - - Sorts in parallel the elements of a sequence in descending order according to a key. - - - In contrast to the sequential implementation, this is not a stable sort. - See the remarks for OrderBy(ParallelQuery{TSource}, Func{TSource,TKey}) for - an approach to implementing a stable sort. - - The type of elements of . - The type of the key returned by . - A sequence of values to order. - A function to extract a key from an element. - An OrderedParallelQuery{TSource} whose elements are sorted - descending according to a key. - - or is a null reference (Nothing in Visual Basic). - - - - - Sorts the elements of a sequence in descending order by using a specified comparer. - - - In contrast to the sequential implementation, this is not a stable sort. - See the remarks for OrderBy(ParallelQuery{TSource}, Func{TSource,TKey}) for - an approach to implementing a stable sort. - - The type of elements of . - The type of the key returned by . - A sequence of values to order. - A function to extract a key from an element. - An IComparer{TKey} to compare keys. - An OrderedParallelQuery{TSource} whose elements are sorted descending - according to a key. - - or is a null reference (Nothing in Visual Basic). - - - - - Performs in parallel a subsequent ordering of the elements in a sequence - in ascending order according to a key. - - - In contrast to the sequential implementation, this is not a stable sort. - See the remarks for OrderBy(ParallelQuery{TSource}, Func{TSource,TKey}) for - an approach to implementing a stable sort. - - The type of elements of . - The type of the key returned by . - An OrderedParallelQuery{TSource} than - contains elements to sort. - A function to extract a key from an element. - An OrderedParallelQuery{TSource} whose elements are - sorted according to a key. - - or is a null reference (Nothing in Visual Basic). - - - - - Performs in parallel a subsequent ordering of the elements in a sequence in - ascending order by using a specified comparer. - - - In contrast to the sequential implementation, this is not a stable sort. - See the remarks for OrderBy(ParallelQuery{TSource}, Func{TSource,TKey}) for - an approach to implementing a stable sort. - - The type of elements of . - The type of the key returned by . - An OrderedParallelQuery{TSource} that contains - elements to sort. - A function to extract a key from an element. - An IComparer{TKey} to compare keys. - An OrderedParallelQuery{TSource} whose elements are sorted - according to a key. - - or is a null reference (Nothing in Visual Basic). - - - - - Performs in parallel a subsequent ordering of the elements in a sequence in - descending order, according to a key. - - - In contrast to the sequential implementation, this is not a stable sort. - See the remarks for OrderBy(ParallelQuery{TSource}, Func{TSource,TKey}) for - an approach to implementing a stable sort. - - The type of elements of . - The type of the key returned by . - An OrderedParallelQuery{TSource} than contains - elements to sort. - A function to extract a key from an element. - An OrderedParallelQuery{TSource} whose elements are sorted - descending according to a key. - - or is a null reference (Nothing in Visual Basic). - - - - - Performs in parallel a subsequent ordering of the elements in a sequence in descending - order by using a specified comparer. - - - In contrast to the sequential implementation, this is not a stable sort. - See the remarks for OrderBy(ParallelQuery{TSource}, Func{TSource,TKey}) for - an approach to implementing a stable sort. - - The type of elements of . - The type of the key returned by . - An OrderedParallelQuery{TSource} than contains - elements to sort. - A function to extract a key from an element. - An IComparer{TKey} to compare keys. - An OrderedParallelQuery{TSource} whose elements are sorted - descending according to a key. - - or is a null reference (Nothing in Visual Basic). - - - - - Groups in parallel the elements of a sequence according to a specified key selector function. - - The type of elements of . - The type of the key returned by . - An OrderedParallelQuery{TSource}than contains - elements to sort. - A function to extract a key from an element. - An OrderedParallelQuery{TSource}whose elements are sorted - descending according to a key. - - - - Groups in parallel the elements of a sequence according to a specified key selector function and compares the keys by using a specified comparer. - - The type of elements of . - The type of the key returned by >. - An OrderedParallelQuery{TSource} than contains - elements to sort. - A function to extract a key from an element. - An IComparer{TSource} to compare keys. - An OrderedParallelQuery{TSource} whose elements are sorted - descending according to a key. - - or is a null reference (Nothing in Visual Basic). - - - - - Groups in parallel the elements of a sequence according to a specified key selector function and - projects the elements for each group by using a specified function. - - The type of elements of . - The type of the key returned by . - The type of the elements in the IGrouping - An OrderedParallelQuery<(Of <(TElement>)>) than contains - elements to sort. - A function to extract a key from an element. - A function to map each source element to an element in an IGrouping. - A ParallelQuery<IGrouping<TKey, TElement>> in C# or - ParallelQuery(Of IGrouping(Of TKey, TElement)) in Visual Basic where each IGrouping - generic object contains a collection of objects of type and a key. - - or or - is a null reference (Nothing in Visual Basic). - - - - - Groups in parallel the elements of a sequence according to a key selector function. - The keys are compared by using a comparer and each group's elements are projected by - using a specified function. - - The type of elements of . - The type of the key returned by . - The type of the elements in the IGrouping - An OrderedParallelQuery{TSource}than contains elements to sort. - A function to extract a key from an element. - A function to map each source element to an element in an IGrouping. - An IComparer{TSource} to compare keys. - - A ParallelQuery{IGrouping{TKey, TElement}} in C# or - ParallelQuery(Of IGrouping(Of TKey, TElement)) in Visual Basic where each IGrouping - generic object contains a collection of objects of type and a key. - - - or or - is a null reference (Nothing in Visual Basic). - - - - - Groups in parallel the elements of a sequence according to a specified - key selector function and creates a result value from each group and its key. - - The type of the elements of . - The type of the key returned by . - The type of the result value returned by . - A sequence whose elements to group. - A function to extract the key for each element. - A function to create a result value from each group. - A collection of elements of type where each element represents a - projection over a group and its key. - - or or - is a null reference (Nothing in Visual Basic). - - - - - Groups in parallel the elements of a sequence according to a specified key selector function - and creates a result value from each group and its key. The keys are compared - by using a specified comparer. - - The type of the elements of . - The type of the key returned by . - The type of the result value returned by . - A sequence whose elements to group. - A function to extract the key for each element. - A function to create a result value from each group. - An IEqualityComparer{TKey} to compare keys. - - An ParallelQuery<IGrouping<TKey, TResult>> in C# or - ParallelQuery(Of IGrouping(Of TKey, TResult)) in Visual Basic where each - IGrouping<(Of <(TKey, TResult>)>) object contains a collection of objects - of type and a key. - - - or or - is a null reference (Nothing in Visual Basic). - - - - - Groups in parallel the elements of a sequence according to a specified key - selector function and creates a result value from each group and its key. - The elements of each group are projected by using a specified function. - - The type of the elements of . - The type of the key returned by . - The type of the elements in each - IGrouping{TKey, TElement}. - The type of the result value returned by . - A sequence whose elements to group. - A function to extract the key for each element. - A function to map each source element to an element in an - IGrouping<TKey, TElement>. - A function to create a result value from each group. - A collection of elements of type where each element represents a - projection over a group and its key. - - or or - or is a null reference (Nothing in Visual Basic). - - - - - Groups the elements of a sequence according to a specified key selector function and - creates a result value from each group and its key. Key values are compared by using a - specified comparer, and the elements of each group are projected by using a specified function. - - The type of the elements of . - The type of the key returned by . - The type of the elements in each - IGrouping{TKey, TElement}. - The type of the result value returned by . - A sequence whose elements to group. - A function to extract the key for each element. - A function to map each source element to an element in an - IGrouping{Key, TElement}. - A function to create a result value from each group. - An IEqualityComparer{TKey} to compare keys. - A collection of elements of type where each element represents a - projection over a group and its key. - - or or - or is a null reference (Nothing in Visual Basic). - - - - - Run an aggregation sequentially. If the user-provided reduction function throws an exception, wrap - it with an AggregateException. - - - - - if true, use the seed provided in the method argument - if false, use the first element of the sequence as the seed instead - - - - - - Applies in parallel an accumulator function over a sequence. - - The type of the elements of . - A sequence to aggregate over. - An accumulator function to be invoked on each element. - The final accumulator value. - - or is a null reference (Nothing in Visual Basic). - - - contains no elements. - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Applies in parallel an accumulator function over a sequence. - The specified seed value is used as the initial accumulator value. - - The type of the elements of . - The type of the accumulator value. - A sequence to aggregate over. - The initial accumulator value. - An accumulator function to be invoked on each element. - The final accumulator value. - - or is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Applies in parallel an accumulator function over a sequence. The specified - seed value is used as the initial accumulator value, and the specified - function is used to select the result value. - - The type of the elements of . - The type of the accumulator value. - The type of the resulting value. - A sequence to aggregate over. - The initial accumulator value. - An accumulator function to be invoked on each element. - A function to transform the final accumulator value - into the result value. - The transformed final accumulator value. - - or or is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Applies in parallel an accumulator function over a sequence. This overload is not - available in the sequential implementation. - - - This overload is specific to processing a parallelized query. A parallelized query may - partition the data source sequence into several sub-sequences (partitions). - The is invoked on each element within partitions. - Each partition then yields a single accumulated result. The - is then invoked on the results of each partition to yield a single element. This element is then - transformed by the function. - - The type of the elements of . - The type of the accumulator value. - The type of the resulting value. - A sequence to aggregate over. - The initial accumulator value. - - An accumulator function to be invoked on each element in a partition. - - - An accumulator function to be invoked on the yielded element from each partition. - - - A function to transform the final accumulator value into the result value. - - The transformed final accumulator value. - - or - or or is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Applies in parallel an accumulator function over a sequence. This overload is not - available in the sequential implementation. - - - This overload is specific to parallelized queries. A parallelized query may partition the data source sequence - into several sub-sequences (partitions). The is invoked - on each element within partitions. Each partition then yields a single accumulated result. - The - is then invoked on the results of each partition to yield a single element. This element is then - transformed by the function. - - The type of the elements of . - The type of the accumulator value. - The type of the resulting value. - A sequence to aggregate over. - - A function that returns the initial accumulator value. - - - An accumulator function to be invoked on each element in a partition. - - - An accumulator function to be invoked on the yielded element from each partition. - - - A function to transform the final accumulator value into the result value. - - The transformed final accumulator value. - - or or - or or is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Returns the number of elements in a parallel sequence. - - The type of the elements of . - A sequence that contains elements to be counted. - The number of elements in the input sequence. - - is a null reference (Nothing in Visual Basic). - - - The number of elements in source is larger than . - -or- - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Returns a number that represents how many elements in the specified - parallel sequence satisfy a condition. - - The type of the elements of . - A sequence that contains elements to be counted. - A function to test each element for a condition. - - A number that represents how many elements in the sequence satisfy the condition - in the predicate function. - - - or is a null reference (Nothing in Visual Basic). - - - The number of elements in source is larger than . - -or- - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Returns an Int64 that represents the total number of elements in a parallel sequence. - - The type of the elements of . - A sequence that contains elements to be counted. - The number of elements in the input sequence. - - is a null reference (Nothing in Visual Basic). - - - The number of elements in source is larger than . - -or- - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Returns an Int64 that represents how many elements in a parallel sequence satisfy a condition. - - The type of the elements of . - A sequence that contains elements to be counted. - A function to test each element for a condition. - - A number that represents how many elements in the sequence satisfy the condition - in the predicate function. - - - or is a null reference (Nothing in Visual Basic). - - - The number of elements in source is larger than . - -or- - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Computes in parallel the sum of a sequence of values. - - A sequence of values to calculate the sum of. - The sum of the values in the sequence. - - is a null reference (Nothing in Visual Basic). - - - The sum is larger than . - -or- - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Computes in parallel the sum of a sequence of values. - - A sequence of values to calculate the sum of. - The sum of the values in the sequence. - - is a null reference (Nothing in Visual Basic). - - - The sum is larger than . - -or- - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Computes in parallel the sum of a sequence of values. - - A sequence of values to calculate the sum of. - The sum of the values in the sequence. - - is a null reference (Nothing in Visual Basic). - - - The sum is larger than . - -or- - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Computes in parallel the sum of a sequence of values. - - A sequence of values to calculate the sum of. - The sum of the values in the sequence. - - is a null reference (Nothing in Visual Basic). - - - The sum is larger than . - -or- - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Computes in parallel the sum of a sequence of values. - - A sequence of values to calculate the sum of. - The sum of the values in the sequence. - - is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Computes in parallel the sum of a sequence of values. - - A sequence of values to calculate the sum of. - The sum of the values in the sequence. - - is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Computes in parallel the sum of a sequence of values. - - A sequence of values to calculate the sum of. - The sum of the values in the sequence. - - is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Computes in parallel the sum of a sequence of values. - - A sequence of values to calculate the sum of. - The sum of the values in the sequence. - - is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Computes in parallel the sum of a sequence of values. - - A sequence of values to calculate the sum of. - The sum of the values in the sequence. - - is a null reference (Nothing in Visual Basic). - - - The sum is larger than . - -or- - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Computes in parallel the sum of a sequence of values. - - A sequence of values to calculate the sum of. - The sum of the values in the sequence. - - is a null reference (Nothing in Visual Basic). - - - The sum is larger than . - -or- - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Computes in parallel the sum of the sequence of values that are obtained - by invoking a transform function on each element of the input sequence. - - A sequence of values to calculate the sum of. - A transform function to apply to each element. - The sum of the values in the sequence. - - or is a null reference (Nothing in Visual Basic). - - - The sum is larger than . - -or- - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Computes in parallel the sum of the sequence of values that are obtained - by invoking a transform function on each element of the input sequence. - - The type of elements of . - A sequence of values to calculate the sum of. - A transform function to apply to each element. - The sum of the values in the sequence. - - or is a null reference (Nothing in Visual Basic). - - - The sum is larger than . - -or- - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Computes in parallel the sum of the sequence of values that are obtained - by invoking a transform function on each element of the input sequence. - - The type of elements of . - A sequence of values to calculate the sum of. - A transform function to apply to each element. - The sum of the values in the sequence. - - or is a null reference (Nothing in Visual Basic). - - - The sum is larger than . - -or- - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Computes in parallel the sum of the sequence of values that are obtained - by invoking a transform function on each element of the input sequence. - - The type of elements of . - A sequence of values to calculate the sum of. - A transform function to apply to each element. - The sum of the values in the sequence. - - or is a null reference (Nothing in Visual Basic). - - - The sum is larger than . - -or- - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Computes in parallel the sum of the sequence of values that are obtained - by invoking a transform function on each element of the input sequence. - - The type of elements of . - A sequence of values to calculate the sum of. - A transform function to apply to each element. - The sum of the values in the sequence. - - or is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Computes in parallel the sum of the sequence of values that are obtained - by invoking a transform function on each element of the input sequence. - - The type of elements of . - A sequence of values to calculate the sum of. - A transform function to apply to each element. - The sum of the values in the sequence. - - or is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Computes in parallel the sum of the sequence of values that are obtained - by invoking a transform function on each element of the input sequence. - - The type of elements of . - A sequence of values to calculate the sum of. - A transform function to apply to each element. - The sum of the values in the sequence. - - or is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Computes in parallel the sum of the sequence of values that are obtained - by invoking a transform function on each element of the input sequence. - - The type of elements of . - A sequence of values to calculate the sum of. - A transform function to apply to each element. - The sum of the values in the sequence. - - or is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Computes in parallel the sum of the sequence of values that are obtained - by invoking a transform function on each element of the input sequence. - - The type of elements of . - A sequence of values to calculate the sum of. - A transform function to apply to each element. - The sum of the values in the sequence. - - or is a null reference (Nothing in Visual Basic). - - - The sum is larger than . - -or- - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Computes in parallel the sum of the sequence of values that are obtained - by invoking a transform function on each element of the input sequence. - - The type of elements of . - A sequence of values to calculate the sum of. - A transform function to apply to each element. - The sum of the values in the sequence. - - or is a null reference (Nothing in Visual Basic). - - - The sum is larger than . - -or- - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Returns the minimum value in a parallel sequence of values. - - A sequence of values to determine the minimum value of. - The minimum value in the sequence. - - is a null reference (Nothing in Visual Basic). - - - contains no elements. - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Returns the minimum value in a parallel sequence of values. - - A sequence of values to determine the minimum value of. - The minimum value in the sequence. - - is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Returns the minimum value in a parallel sequence of values. - - A sequence of values to determine the minimum value of. - The minimum value in the sequence. - - is a null reference (Nothing in Visual Basic). - - - contains no elements. - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Returns the minimum value in a parallel sequence of values. - - A sequence of values to determine the minimum value of. - The minimum value in the sequence. - - is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Returns the minimum value in a parallel sequence of values. - - A sequence of values to determine the minimum value of. - The minimum value in the sequence. - - is a null reference (Nothing in Visual Basic). - - - contains no elements. - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Returns the minimum value in a parallel sequence of values. - - A sequence of values to determine the minimum value of. - The minimum value in the sequence. - - is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Returns the minimum value in a parallel sequence of values. - - A sequence of values to determine the minimum value of. - The minimum value in the sequence. - - is a null reference (Nothing in Visual Basic). - - - contains no elements. - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Returns the minimum value in a parallel sequence of values. - - A sequence of values to determine the minimum value of. - The minimum value in the sequence. - - is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Returns the minimum value in a parallel sequence of values. - - A sequence of values to determine the minimum value of. - The minimum value in the sequence. - - is a null reference (Nothing in Visual Basic). - - - contains no elements. - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Returns the minimum value in a parallel sequence of values. - - A sequence of values to determine the minimum value of. - The minimum value in the sequence. - - is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Returns the minimum value in a parallel sequence of values. - - The type of elements of . - A sequence of values to determine the minimum value of. - The minimum value in the sequence. - - is a null reference (Nothing in Visual Basic). - - - contains no elements and is a non-nullable value type. - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Invokes in parallel a transform function on each element of a - sequence and returns the minimum value. - - The type of elements of . - A sequence of values to determine the minimum value of. - A transform function to apply to each element. - The minimum value in the sequence. - - or is a null reference (Nothing in Visual Basic). - - - contains no elements. - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Invokes in parallel a transform function on each element of a - sequence and returns the minimum value. - - The type of elements of . - A sequence of values to determine the minimum value of. - A transform function to apply to each element. - The minimum value in the sequence. - - or is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Invokes in parallel a transform function on each element of a - sequence and returns the minimum value. - - The type of elements of . - A sequence of values to determine the minimum value of. - A transform function to apply to each element. - The minimum value in the sequence. - - or is a null reference (Nothing in Visual Basic). - - - contains no elements. - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Invokes in parallel a transform function on each element of a - sequence and returns the minimum value. - - The type of elements of . - A sequence of values to determine the minimum value of. - A transform function to apply to each element. - The minimum value in the sequence. - - or is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Invokes in parallel a transform function on each element of a - sequence and returns the minimum value. - - The type of elements of . - A sequence of values to determine the minimum value of. - A transform function to apply to each element. - The minimum value in the sequence. - - or is a null reference (Nothing in Visual Basic). - - - contains no elements. - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Invokes in parallel a transform function on each element of a - sequence and returns the minimum value. - - The type of elements of . - A sequence of values to determine the minimum value of. - A transform function to apply to each element. - The minimum value in the sequence. - - or is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Invokes in parallel a transform function on each element of a - sequence and returns the minimum value. - - The type of elements of . - A sequence of values to determine the minimum value of. - A transform function to apply to each element. - The minimum value in the sequence. - - or is a null reference (Nothing in Visual Basic). - - - contains no elements. - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Invokes in parallel a transform function on each element of a - sequence and returns the minimum value. - - The type of elements of . - A sequence of values to determine the minimum value of. - A transform function to apply to each element. - The minimum value in the sequence. - - or is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Invokes in parallel a transform function on each element of a - sequence and returns the minimum value. - - The type of elements of . - A sequence of values to determine the minimum value of. - A transform function to apply to each element. - The minimum value in the sequence. - - or is a null reference (Nothing in Visual Basic). - - - contains no elements. - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Invokes in parallel a transform function on each element of a - sequence and returns the minimum value. - - The type of elements of . - A sequence of values to determine the minimum value of. - A transform function to apply to each element. - The minimum value in the sequence. - - or is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Invokes in parallel a transform function on each element of a - sequence and returns the minimum value. - - The type of elements of . - The type of the value returned by . - A sequence of values to determine the minimum value of. - A transform function to apply to each element. - The minimum value in the sequence. - - or is a null reference (Nothing in Visual Basic). - - - contains no elements and is a non-nullable value type. - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Returns the maximum value in a parallel sequence of values. - - A sequence of values to determine the maximum value of. - The maximum value in the sequence. - - is a null reference (Nothing in Visual Basic). - - - contains no elements. - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Returns the maximum value in a parallel sequence of values. - - A sequence of values to determine the maximum value of. - The maximum value in the sequence. - - is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Returns the maximum value in a parallel sequence of values. - - A sequence of values to determine the maximum value of. - The maximum value in the sequence. - - is a null reference (Nothing in Visual Basic). - - - contains no elements. - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Returns the maximum value in a parallel sequence of values. - - A sequence of values to determine the maximum value of. - The maximum value in the sequence. - - is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Returns the maximum value in a parallel sequence of values. - - A sequence of values to determine the maximum value of. - The maximum value in the sequence. - - is a null reference (Nothing in Visual Basic). - - - contains no elements. - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Returns the maximum value in a parallel sequence of values. - - A sequence of values to determine the maximum value of. - The maximum value in the sequence. - - is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Returns the maximum value in a parallel sequence of values. - - A sequence of values to determine the maximum value of. - The maximum value in the sequence. - - is a null reference (Nothing in Visual Basic). - - - contains no elements. - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Returns the maximum value in a parallel sequence of values. - - A sequence of values to determine the maximum value of. - The maximum value in the sequence. - - is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Returns the maximum value in a parallel sequence of values. - - A sequence of values to determine the maximum value of. - The maximum value in the sequence. - - is a null reference (Nothing in Visual Basic). - - - contains no elements. - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Returns the maximum value in a parallel sequence of values. - - A sequence of values to determine the maximum value of. - The maximum value in the sequence. - - is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Returns the maximum value in a parallel sequence of values. - - A sequence of values to determine the maximum value of. - The maximum value in the sequence. - - is a null reference (Nothing in Visual Basic). - - - contains no elements and is a non-nullable value type. - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Invokes in parallel a transform function on each element of a - sequence and returns the maximum value. - - The type of elements of . - A sequence of values to determine the maximum value of. - A transform function to apply to each element. - The maximum value in the sequence. - - or is a null reference (Nothing in Visual Basic). - - - contains no elements. - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Invokes in parallel a transform function on each element of a - sequence and returns the maximum value. - - The type of elements of . - A sequence of values to determine the maximum value of. - A transform function to apply to each element. - The maximum value in the sequence. - - or is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Invokes in parallel a transform function on each element of a - sequence and returns the maximum value. - - The type of elements of . - A sequence of values to determine the maximum value of. - A transform function to apply to each element. - The maximum value in the sequence. - - or is a null reference (Nothing in Visual Basic). - - - contains no elements. - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Invokes in parallel a transform function on each element of a - sequence and returns the maximum value. - - The type of elements of . - A sequence of values to determine the maximum value of. - A transform function to apply to each element. - The maximum value in the sequence. - - or is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Invokes in parallel a transform function on each element of a - sequence and returns the maximum value. - - The type of elements of . - A sequence of values to determine the maximum value of. - A transform function to apply to each element. - The maximum value in the sequence. - - or is a null reference (Nothing in Visual Basic). - - - contains no elements. - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Invokes in parallel a transform function on each element of a - sequence and returns the maximum value. - - The type of elements of . - A sequence of values to determine the maximum value of. - A transform function to apply to each element. - The maximum value in the sequence. - - or is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Invokes in parallel a transform function on each element of a - sequence and returns the maximum value. - - The type of elements of . - A sequence of values to determine the maximum value of. - A transform function to apply to each element. - The maximum value in the sequence. - - or is a null reference (Nothing in Visual Basic). - - - contains no elements. - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Invokes in parallel a transform function on each element of a - sequence and returns the maximum value. - - The type of elements of . - A sequence of values to determine the maximum value of. - A transform function to apply to each element. - The maximum value in the sequence. - - or is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Invokes in parallel a transform function on each element of a - sequence and returns the maximum value. - - The type of elements of . - A sequence of values to determine the maximum value of. - A transform function to apply to each element. - The maximum value in the sequence. - - or is a null reference (Nothing in Visual Basic). - - - contains no elements. - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Invokes in parallel a transform function on each element of a - sequence and returns the maximum value. - - The type of elements of . - A sequence of values to determine the maximum value of. - A transform function to apply to each element. - The maximum value in the sequence. - - or is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Invokes in parallel a transform function on each element of a - sequence and returns the maximum value. - - The type of elements of . - The type of the value returned by . - A sequence of values to determine the maximum value of. - A transform function to apply to each element. - The maximum value in the sequence. - - or is a null reference (Nothing in Visual Basic). - - - contains no elements and is a non-nullable value type. - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Computes in parallel the average of a sequence of values. - - A sequence of values that are used to calculate an average. - The average of the sequence of values. - - is a null reference (Nothing in Visual Basic). - - - contains no elements. - - - The sum or count of the elements in the sequence is larger than . - -or- - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Computes in parallel the average of a sequence of values. - - A sequence of values that are used to calculate an average. - The average of the sequence of values. - - is a null reference (Nothing in Visual Basic). - - - The sum or count of the elements in the sequence is larger than . - -or- - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Computes in parallel the average of a sequence of values. - - A sequence of values that are used to calculate an average. - The average of the sequence of values. - - is a null reference (Nothing in Visual Basic). - - - contains no elements. - - - The sum or count of the elements in the sequence is larger than . - -or- - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Computes in parallel the average of a sequence of values. - - A sequence of values that are used to calculate an average. - The average of the sequence of values. - - is a null reference (Nothing in Visual Basic). - - - The sum or count of the elements in the sequence is larger than . - -or- - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Computes in parallel the average of a sequence of values. - - A sequence of values that are used to calculate an average. - The average of the sequence of values. - - is a null reference (Nothing in Visual Basic). - - - contains no elements. - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Computes in parallel the average of a sequence of values. - - A sequence of values that are used to calculate an average. - The average of the sequence of values. - - is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Computes in parallel the average of a sequence of values. - - A sequence of values that are used to calculate an average. - The average of the sequence of values. - - is a null reference (Nothing in Visual Basic). - - - contains no elements. - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Computes in parallel the average of a sequence of values. - - - A sequence of values that are used to calculate an average. - The average of the sequence of values. - is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Computes in parallel the average of a sequence of values. - - A sequence of values that are used to calculate an average. - The average of the sequence of values. - - is a null reference (Nothing in Visual Basic). - - - contains no elements. - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Computes in parallel the average of a sequence of values. - - A sequence of values that are used to calculate an average. - The average of the sequence of values. - - is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Computes in parallel the average of a sequence of values that are obtained - by invoking a transform function on each element of the input sequence. - - The type of elements of . - A sequence of values that are used to calculate an average. - A transform function to apply to each element. - The average of the sequence of values. - - or is a null reference (Nothing in Visual Basic). - - - contains no elements. - - - The sum or count of the elements in the sequence is larger than . - -or- - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Computes in parallel the average of a sequence of values that are obtained - by invoking a transform function on each element of the input sequence. - - The type of elements of . - A sequence of values that are used to calculate an average. - A transform function to apply to each element. - The average of the sequence of values. - - or is a null reference (Nothing in Visual Basic). - - - The sum or count of the elements in the sequence is larger than . - -or- - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Computes in parallel the average of a sequence of values that are obtained - by invoking a transform function on each element of the input sequence. - - The type of elements of . - A sequence of values that are used to calculate an average. - A transform function to apply to each element. - The average of the sequence of values. - - or is a null reference (Nothing in Visual Basic). - - - contains no elements. - - - The sum or count of the elements in the sequence is larger than . - -or- - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Computes in parallel the average of a sequence of values that are obtained - by invoking a transform function on each element of the input sequence. - - The type of elements of . - A sequence of values that are used to calculate an average. - A transform function to apply to each element. - The average of the sequence of values. - - or is a null reference (Nothing in Visual Basic). - - - The sum or count of the elements in the sequence is larger than . - -or- - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Computes in parallel the average of a sequence of values that are obtained - by invoking a transform function on each element of the input sequence. - - The type of elements of . - A sequence of values that are used to calculate an average. - A transform function to apply to each element. - The average of the sequence of values. - - or is a null reference (Nothing in Visual Basic). - - - contains no elements. - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Computes in parallel the average of a sequence of values that are obtained - by invoking a transform function on each element of the input sequence. - - The type of elements of . - A sequence of values that are used to calculate an average. - A transform function to apply to each element. - The average of the sequence of values. - - or is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Computes in parallel the average of a sequence of values that are obtained - by invoking a transform function on each element of the input sequence. - - The type of elements of . - A sequence of values that are used to calculate an average. - A transform function to apply to each element. - The average of the sequence of values. - - or is a null reference (Nothing in Visual Basic). - - - contains no elements. - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Computes in parallel the average of a sequence of values that are obtained - by invoking a transform function on each element of the input sequence. - - The type of elements of . - A sequence of values that are used to calculate an average. - A transform function to apply to each element. - The average of the sequence of values. - - or is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Computes in parallel the average of a sequence of values that are obtained - by invoking a transform function on each element of the input sequence. - - The type of elements of . - A sequence of values that are used to calculate an average. - A transform function to apply to each element. - The average of the sequence of values. - - or is a null reference (Nothing in Visual Basic). - - - contains no elements. - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Computes in parallel the average of a sequence of values that are obtained - by invoking a transform function on each element of the input sequence. - - The type of elements of . - A sequence of values that are used to calculate an average. - A transform function to apply to each element. - The average of the sequence of values. - - or is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Determines in parallel whether any element of a sequence satisfies a condition. - - The type of elements of . - An IEnumerable whose elements to apply the predicate to. - A function to test each element for a condition. - - true if any elements in the source sequence pass the test in the specified predicate; otherwise, false. - - - or is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Determines whether a parallel sequence contains any elements. - - The type of elements of . - The IEnumerable to check for emptiness. - true if the source sequence contains any elements; otherwise, false. - - is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Determines in parallel whether all elements of a sequence satisfy a condition. - - The type of elements of . - A sequence whose elements to apply the predicate to. - A function to test each element for a condition. - - true if all elements in the source sequence pass the test in the specified predicate; otherwise, false. - - - or is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Determines in parallel whether a sequence contains a specified element - by using the default equality comparer. - - The type of elements of . - A sequence in which to locate a value. - The value to locate in the sequence. - - true if the source sequence contains an element that has the specified value; otherwise, false. - - - is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Determines in parallel whether a sequence contains a specified element by using a - specified IEqualityComparer{T}. - - The type of elements of . - A sequence in which to locate a value. - The value to locate in the sequence. - An equality comparer to compare values. - - true if the source sequence contains an element that has the specified value; otherwise, false. - - - is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Returns a specified number of contiguous elements from the start of a parallel sequence. - - The type of elements of . - The sequence to return elements from. - The number of elements to return. - - A sequence that contains the specified number of elements from the start of the input sequence. - - - is a null reference (Nothing in Visual Basic). - - - - - Returns elements from a parallel sequence as long as a specified condition is true. - - The type of elements of . - The sequence to return elements from. - A function to test each element for a condition. - - A sequence that contains the elements from the input sequence that occur before - the element at which the test no longer passes. - - - or is a null reference (Nothing in Visual Basic). - - - - - Returns elements from a parallel sequence as long as a specified condition is true. - The element's index is used in the logic of the predicate function. - - The type of elements of . - The sequence to return elements from. - - A function to test each source element for a condition; the second parameter of the - function represents the index of the source element. - - - A sequence that contains elements from the input sequence that occur before - the element at which the test no longer passes. - - - or is a null reference (Nothing in Visual Basic). - - - - - Bypasses a specified number of elements in a parallel sequence and then returns the remaining elements. - - The type of elements of . - The sequence to return elements from. - The number of elements to skip before returning the remaining elements. - - A sequence that contains the elements that occur after the specified index in the input sequence. - - - is a null reference (Nothing in Visual Basic). - - - - - Bypasses elements in a parallel sequence as long as a specified - condition is true and then returns the remaining elements. - - The type of elements of . - The sequence to return elements from. - A function to test each element for a condition. - A sequence that contains the elements from the input sequence starting at - the first element in the linear series that does not pass the test specified by - predicate. - - or is a null reference (Nothing in Visual Basic). - - - - - Bypasses elements in a parallel sequence as long as a specified condition is true and - then returns the remaining elements. The element's index is used in the logic of - the predicate function. - - The type of elements of . - The sequence to return elements from. - - A function to test each source element for a condition; the - second parameter of the function represents the index of the source element. - - - A sequence that contains the elements from the input sequence starting at the - first element in the linear series that does not pass the test specified by - predicate. - - - or is a null reference (Nothing in Visual Basic). - - - - - Concatenates two parallel sequences. - - The type of the elements of the input sequences. - The first sequence to concatenate. - The sequence to concatenate to the first sequence. - A sequence that contains the concatenated elements of the two input sequences. - - or is a null reference (Nothing in Visual Basic). - - - - - This Concat overload should never be called. - This method is marked as obsolete and always throws when called. - - This type parameter is not used. - This parameter is not used. - This parameter is not used. - This overload always throws a . - The exception that occurs when this method is called. - - This overload exists to disallow usage of Concat with a left data source of type - and a right data source of type . - Otherwise, the Concat operator would appear to be binding to the parallel implementation, - but would in reality bind to the sequential implementation. - - - - - Determines whether two parallel sequences are equal by comparing the elements by using - the default equality comparer for their type. - - The type of the elements of the input sequences. - A sequence to compare to second. - A sequence to compare to the first input sequence. - - true if the two source sequences are of equal length and their corresponding elements - are equal according to the default equality comparer for their type; otherwise, false. - - - or is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - This SequenceEqual overload should never be called. - This method is marked as obsolete and always throws when called. - - This type parameter is not used. - This parameter is not used. - This parameter is not used. - This overload always throws a . - Thrown every time this method is called. - - This overload exists to disallow usage of SequenceEqual with a left data source of type - and a right data source of type . - Otherwise, the SequenceEqual operator would appear to be binding to the parallel implementation, - but would in reality bind to the sequential implementation. - - - - - Determines whether two parallel sequences are equal by comparing their elements by - using a specified IEqualityComparer{T}. - - The type of the elements of the input sequences. - A sequence to compare to . - A sequence to compare to the first input sequence. - An IEqualityComparer<(Of <(T>)>) to use to compare elements. - - true if the two source sequences are of equal length and their corresponding - elements are equal according to the default equality comparer for their type; otherwise, false. - - - or is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - A helper method for SequenceEqual to dispose an enumerator. If an exception is thrown by the disposal, - it gets wrapped into an AggregateException, unless it is an OCE with the query's CancellationToken. - - - - - This SequenceEqual overload should never be called. - This method is marked as obsolete and always throws when called. - - This type parameter is not used. - This parameter is not used. - This parameter is not used. - This parameter is not used. - This overload always throws a . - Thrown every time this method is called. - - This overload exists to disallow usage of SequenceEqual with a left data source of type - and a right data source of type . - Otherwise, the SequenceEqual operator would appear to be binding to the parallel implementation, - but would in reality bind to sequential implementation. - - - - - Returns distinct elements from a parallel sequence by using the - default equality comparer to compare values. - - The type of the elements of . - The sequence to remove duplicate elements from. - A sequence that contains distinct elements from the source sequence. - - is a null reference (Nothing in Visual Basic). - - - - - Returns distinct elements from a parallel sequence by using a specified - IEqualityComparer{T} to compare values. - - The type of the elements of . - The sequence to remove duplicate elements from. - An IEqualityComparer<(Of <(T>)>) to compare values. - A sequence that contains distinct elements from the source sequence. - - is a null reference (Nothing in Visual Basic). - - - - - Produces the set union of two parallel sequences by using the default equality comparer. - - The type of the elements of the input sequences. - A sequence whose distinct elements form the first set for the union. - A sequence whose distinct elements form the second set for the union. - A sequence that contains the elements from both input sequences, excluding duplicates. - - or is a null reference (Nothing in Visual Basic). - - - - - This Union overload should never be called. - This method is marked as obsolete and always throws when called. - - This type parameter is not used. - This parameter is not used. - This parameter is not used. - This overload always throws a . - The exception that occurs when this method is called. - - This overload exists to disallow usage of Union with a left data source of type - and a right data source of type . - Otherwise, the Union operator would appear to be binding to the parallel implementation, - but would in reality bind to sequential implementation. - - - - - Produces the set union of two parallel sequences by using a specified IEqualityComparer{T}. - - The type of the elements of the input sequences. - A sequence whose distinct elements form the first set for the union. - A sequence whose distinct elements form the second set for the union. - An IEqualityComparer<(Of <(T>)>) to compare values. - A sequence that contains the elements from both input sequences, excluding duplicates. - - or is a null reference (Nothing in Visual Basic). - - - - - This Union overload should never be called. - This method is marked as obsolete and always throws when called. - - This type parameter is not used. - This parameter is not used. - This parameter is not used. - This parameter is not used. - This overload always throws a . - The exception that occurs when this method is called. - - This overload exists to disallow usage of Union with a left data source of type - and a right data source of type . - Otherwise, the Union operator would appear to be binding to the parallel implementation, - but would in reality bind to the sequential implementation. - - - - - Produces the set intersection of two parallel sequences by using the - default equality comparer to compare values. - - The type of the elements of the input sequences. - A sequence whose distinct elements that also appear in will be returned. - - - A sequence whose distinct elements that also appear in the first sequence will be returned. - - A sequence that contains the elements that form the set intersection of two sequences. - - or is a null reference (Nothing in Visual Basic). - - - - - This Intersect overload should never be called. - This method is marked as obsolete and always throws when called. - - This type parameter is not used. - This parameter is not used. - This parameter is not used. - This overload always throws a . - The exception that occurs when this method is called. - - This overload exists to disallow usage of Intersect with a left data source of type - and a right data source of type . - Otherwise, the Intersect operator would appear to be binding to the parallel implementation, - but would in reality bind to the sequential implementation. - - - - - Produces the set intersection of two parallel sequences by using - the specified IEqualityComparer{T} to compare values. - - The type of the elements of the input sequences. - - A sequence whose distinct elements that also appear in will be returned. - - - A sequence whose distinct elements that also appear in the first sequence will be returned. - - An IEqualityComparer<(Of <(T>)>) to compare values. - A sequence that contains the elements that form the set intersection of two sequences. - - or is a null reference (Nothing in Visual Basic). - - - - - This Intersect overload should never be called. - This method is marked as obsolete and always throws when called. - - This type parameter is not used. - This parameter is not used. - This parameter is not used. - This parameter is not used. - This overload always throws a . - The exception that occurs when this method is called. - - This overload exists to disallow usage of Intersect with a left data source of type - and a right data source of type . - Otherwise, the Intersect operator would appear to be binding to the parallel implementation, - but would in reality bind to the sequential implementation. - - - - - Produces the set difference of two parallel sequences by using - the default equality comparer to compare values. - - The type of the elements of the input sequences. - - A sequence whose elements that are not also in will be returned. - - - A sequence whose elements that also occur in the first sequence will cause those - elements to be removed from the returned sequence. - - A sequence that contains the set difference of the elements of two sequences. - - or is a null reference (Nothing in Visual Basic). - - - - - This Except overload should never be called. - This method is marked as obsolete and always throws when called. - - This type parameter is not used. - This parameter is not used. - This parameter is not used. - This overload always throws a . - The exception that occurs when this method is called. - - This overload exists to disallow usage of Except with a left data source of type - and a right data source of type . - Otherwise, the Except operator would appear to be binding to the parallel implementation, - but would in reality bind to the sequential implementation. - - - - - Produces the set difference of two parallel sequences by using the - specified IEqualityComparer{T} to compare values. - - The type of the elements of the input sequences. - A sequence whose elements that are not also in will be returned. - - A sequence whose elements that also occur in the first sequence will cause those elements - to be removed from the returned sequence. - - An IEqualityComparer<(Of <(T>)>) to compare values. - A sequence that contains the set difference of the elements of two sequences. - - or is a null reference (Nothing in Visual Basic). - - - - - This Except overload should never be called. - This method is marked as obsolete and always throws when called. - - This type parameter is not used. - This parameter is not used. - This parameter is not used. - This parameter is not used. - This overload always throws a . - The exception that occurs when this method is called. - - This overload exists to disallow usage of Except with a left data source of type - and a right data source of type . - Otherwise, the Except operator would appear to be binding to the parallel implementation, - but would in reality bind to the sequential implementation. - - - - - Converts a into an - to force sequential - evaluation of the query. - - The type of the elements of . - The sequence to type as . - The input sequence types as . - - is a null reference (Nothing in Visual Basic). - - - - - Creates an array from a ParallelQuery{T}. - - The type of the elements of . - A sequence to create an array from. - An array that contains the elements from the input sequence. - - is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Creates a List{T} from an ParallelQuery{T}. - - The type of the elements of . - A sequence to create a List<(Of <(T>)>) from. - A List<(Of <(T>)>) that contains elements from the input sequence. - - is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Creates a Dictionary{TKey,TValue} from a ParallelQuery{T} according to - a specified key selector function. - - The type of the elements of . - The type of the key returned by . - A sequence to create a Dictionary<(Of <(TKey, TValue>)>) from. - A function to extract a key from each element. - A Dictionary<(Of <(TKey, TValue>)>) that contains keys and values. - - or is a null reference (Nothing in Visual Basic). - - - produces a key that is a null reference (Nothing in Visual Basic). - -or- - produces duplicate keys for two elements. - -or- - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Creates a Dictionary{TKey,TValue} from a ParallelQuery{T} according to a - specified key selector function and key comparer. - - The type of the elements of . - The type of the key returned by . - A sequence to create a Dictionary<(Of <(TKey, TValue>)>) from. - A function to extract a key from each element. - An IEqualityComparer<(Of <(T>)>) to compare keys. - A Dictionary<(Of <(TKey, TValue>)>) that contains keys and values. - - or is a null reference (Nothing in Visual Basic). - - - produces a key that is a null reference (Nothing in Visual Basic). - -or- - produces duplicate keys for two elements. - -or- - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Creates a Dictionary{TKey,TValue} from a ParallelQuery{T} according to specified - key selector and element selector functions. - - The type of the elements of . - The type of the key returned by . - The type of the value returned by . - A sequence to create a Dictionary<(Of <(TKey, TValue>)>) from. - A function to extract a key from each element. - - A transform function to produce a result element value from each element. - - - A Dictionary<(Of <(TKey, TValue>)>) that contains values of type - selected from the input sequence - - - or or is a null reference (Nothing in Visual Basic). - - - produces a key that is a null reference (Nothing in Visual Basic). - -or- - produces duplicate keys for two elements. - -or- - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Creates a Dictionary{TKey,TValue from a ParallelQuery{T} according to a - specified key selector function, a comparer, and an element selector function. - - The type of the elements of . - The type of the key returned by . - The type of the value returned by . - A sequence to create a Dictionary<(Of <(TKey, TValue>)>) from. - A function to extract a key from each element. - A transform function to produce a result element - value from each element. - An IEqualityComparer<(Of <(T>)>) to compare keys. - - A Dictionary<(Of <(TKey, TValue>)>) that contains values of type - selected from the input sequence - - - or or is a null reference (Nothing in Visual Basic). - - - produces a key that is a null reference (Nothing in Visual Basic). - -or- - produces duplicate keys for two elements. - -or- - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Creates an ILookup{TKey,T} from a ParallelQuery{T} according to a specified key selector function. - - The type of elements of . - The type of the key returned by . - The sequence to create a Lookup<(Of <(TKey, TElement>)>) from. - A function to extract a key from each element. - A Lookup<(Of <(TKey, TElement>)>) that contains keys and values. - - or is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Creates an ILookup{TKey,T} from a ParallelQuery{T} according to a specified - key selector function and key comparer. - - The type of elements of . - The type of the key returned by . - The sequence to create a Lookup<(Of <(TKey, TElement>)>) from. - A function to extract a key from each element. - An IEqualityComparer<(Of <(T>)>) to compare keys. - A Lookup<(Of <(TKey, TElement>)>) that contains keys and values. - - or or is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Creates an ILookup{TKey,TElement} from a ParallelQuery{T} according to specified - key selector and element selector functions. - - The type of elements of . - The type of the key returned by . - The type of the value returned by . - The sequence to create a Lookup<(Of <(TKey, TElement>)>) from. - A function to extract a key from each element. - - A transform function to produce a result element value from each element. - - - A Lookup<(Of <(TKey, TElement>)>) that contains values of type TElement - selected from the input sequence. - - - or or is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Creates an ILookup{TKey,TElement} from a ParallelQuery{T} according to - a specified key selector function, a comparer and an element selector function. - - The type of elements of . - The type of the key returned by . - The type of the value returned by . - The sequence to create a Lookup<(Of <(TKey, TElement>)>) from. - A function to extract a key from each element. - - A transform function to produce a result element value from each element. - - An IEqualityComparer<(Of <(T>)>) to compare keys. - - A Lookup<(Of <(TKey, TElement>)>) that contains values of type TElement selected - from the input sequence. - - - or or is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Inverts the order of the elements in a parallel sequence. - - The type of the elements of . - A sequence of values to reverse. - A sequence whose elements correspond to those of the input sequence in reverse order. - - is a null reference (Nothing in Visual Basic). - - - - - Filters the elements of a ParallelQuery based on a specified type. - - The type to filter the elements of the sequence on. - The sequence whose elements to filter. - A sequence that contains elements from the input sequence of type . - - is a null reference (Nothing in Visual Basic). - - - - - Converts the elements of a ParallelQuery to the specified type. - - The type to convert the elements of to. - The sequence that contains the elements to be converted. - - A sequence that contains each element of the source sequence converted to the specified type. - - - is a null reference (Nothing in Visual Basic). - - - - - Returns the first element of a parallel sequence. - The type of the elements of . - The sequence to return the first element of. - The first element in the specified sequence. - - is a null reference (Nothing in Visual Basic). - - - contains no elements. - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Returns the first element in a parallel sequence that satisfies a specified condition. - - There's a temporary difference from LINQ to Objects, this does not throw - ArgumentNullException when the predicate is null. - The type of the elements of . - The sequence to return an element from. - A function to test each element for a condition. - The first element in the sequence that passes the test in the specified predicate function. - - or is a null reference (Nothing in Visual Basic). - - - No element in satisfies the condition in . - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Returns the first element of a parallel sequence, or a default value if the - sequence contains no elements. - - The type of the elements of . - The sequence to return the first element of. - - default(TSource) if is empty; otherwise, the first element in . - - - is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Returns the first element of the parallel sequence that satisfies a condition or a - default value if no such element is found. - - There's a temporary difference from LINQ to Objects, this does not throw - ArgumentNullException when the predicate is null. - The type of the elements of . - The sequence to return an element from. - A function to test each element for a condition. - - default(TSource) if is empty or if no element passes the test - specified by predicate; otherwise, the first element in that - passes the test specified by predicate. - - - or is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Returns the last element of a parallel sequence. - The type of the elements of . - The sequence to return the last element from. - The value at the last position in the source sequence. - - is a null reference (Nothing in Visual Basic). - - - contains no elements. - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Returns the last element of a parallel sequence that satisfies a specified condition. - - The type of the elements of . - The sequence to return an element from. - A function to test each element for a condition. - - The last element in the sequence that passes the test in the specified predicate function. - - - or is a null reference (Nothing in Visual Basic). - - - No element in satisfies the condition in . - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Returns the last element of a parallel sequence, or a default value if the - sequence contains no elements. - - The type of the elements of . - The sequence to return an element from. - - default() if the source sequence is empty; otherwise, the last element in the sequence. - - - is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Returns the last element of a parallel sequence that satisfies a condition, or - a default value if no such element is found. - - The type of the elements of . - The sequence to return an element from. - A function to test each element for a condition. - - default() if the sequence is empty or if no elements pass the test in the - predicate function; otherwise, the last element that passes the test in the predicate function. - - - or is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Returns the only element of a parallel sequence, and throws an exception if there is not - exactly one element in the sequence. - - The type of the elements of . - The sequence to return the single element of. - The single element of the input sequence. - - is a null reference (Nothing in Visual Basic). - - - The input sequence contains more than one element. -or- The input sequence is empty. - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Returns the only element of a parallel sequence that satisfies a specified condition, - and throws an exception if more than one such element exists. - - The type of the elements of . - The sequence to return the single element of. - A function to test an element for a condition. - The single element of the input sequence that satisfies a condition. - - or is a null reference (Nothing in Visual Basic). - - - No element satisfies the condition in . -or- More than one element satisfies the condition in . - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Returns the only element of a parallel sequence, or a default value if the sequence is - empty; this method throws an exception if there is more than one element in the sequence. - - The type of the elements of . - The sequence to return the single element of. - - The single element of the input sequence, or default() if the - sequence contains no elements. - - - is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Returns the only element of a parallel sequence that satisfies a specified condition - or a default value if no such element exists; this method throws an exception - if more than one element satisfies the condition. - - The type of the elements of . - The sequence to return the single element of. - A function to test an element for a condition. - - The single element of the input sequence that satisfies the condition, or - default() if no such element is found. - - - or is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Returns the elements of the specified parallel sequence or the type parameter's - default value in a singleton collection if the sequence is empty. - - The type of the elements of . - The sequence to return a default value for if it is empty. - - A sequence that contains default(TSource) if is empty; otherwise, . - - - is a null reference (Nothing in Visual Basic). - - - - - Returns the elements of the specified parallel sequence or the specified value - in a singleton collection if the sequence is empty. - - The type of the elements of . - The sequence to return the specified value for if it is empty. - The value to return if the sequence is empty. - - A sequence that contains defaultValue if is empty; otherwise, . - - - is a null reference (Nothing in Visual Basic). - - - - - Returns the element at a specified index in a parallel sequence. - - The type of the elements of . - A sequence to return an element from. - The zero-based index of the element to retrieve. - The element at the specified position in the source sequence. - - is a null reference (Nothing in Visual Basic). - - - is less than 0 or greater than or equal to the number of elements in . - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Returns the element at a specified index in a parallel sequence or a default value if the - index is out of range. - - The type of the elements of . - A sequence to return an element from. - The zero-based index of the element to retrieve. - - default(TSource) if the index is outside the bounds of the source sequence; - otherwise, the element at the specified position in the source sequence. - - - is a null reference (Nothing in Visual Basic). - - - One or more exceptions occurred during the evaluation of the query. - - - The query was canceled. - - - - - Specifies the preferred type of output merge to use in a query. This is a hint only, and may not be - respected by the system when parallelizing all queries. - - - - Use NotBuffered for queries that will be consumed and output as streams, this has the lowest latency - between beginning query execution and elements being yielded. For some queries, such as those involving a - sort (OrderBy, OrderByDescending), buffering is essential and a hint of NotBuffered or AutoBuffered will - be ignored. - - - Use AutoBuffered for most cases; this is the default. It strikes a balance between latency and - overall performance. - - - Use FullyBuffered for queries when the entire output can be processed before the information is - needed. This option offers the best performance when all of the output can be accumulated before yielding - any information, though it is not suitable for stream processing or showing partial results mid-query. - - - - - - Use the default merge type, which is AutoBuffered. - - - - - Use a merge without output buffers. As soon as result elements have been computed, - make that element available to the consumer of the query. - - - - - Use a merge with output buffers of a size chosen by the system. Results - will accumulate into an output buffer before they are available to the consumer of - the query. - - - - - Use a merge with full output buffers. The system will accumulate all of the - results before making any of them available to the consumer of the query. - - - - - This is a bounded channel meant for single-producer/single-consumer scenarios. - - Specifies the type of data in the channel. - - - - The simplest channel is one that has no synchronization. This is used for stop- - and-go productions where we are guaranteed the consumer is not running - concurrently. It just wraps a FIFO queue internally. - - Assumptions: - Producers and consumers never try to enqueue/dequeue concurrently. - - - - - - We occassionally need a no-op enumerator to stand-in when we don't have data left - within a partition's data stream. These are simple enumerable and enumerator - implementations that always and consistently yield no elements. - - - - - - Represents a parallel sequence. - - - - - Represents a parallel sequence. - - - - - Returns an enumerator that iterates through the sequence. - - An enumerator that iterates through the sequence. - - - - Returns an enumerator that iterates through the sequence. - - An enumerator that iterates through the sequence. - - - - A common enumerator type that unifies all query operator enumerators. - - - - - - - A simple implementation of the IEnumerable{object} interface which wraps - a weakly typed IEnumerable object, allowing it to be accessed as a strongly typed - IEnumerable{object}. - - - - - - An interface that allows developers to specify their own partitioning routines. - - - - - - - A simple implementation of the ParallelQuery{object} interface which wraps an - underlying IEnumerable, such that it can be used in parallel queries. - - - - - A simple implementation of the ParallelQuery{T} interface which wraps an - underlying IEnumerable{T}, such that it can be used in parallel queries. - - - - - - An enum to specify whether an aggregate operator is associative, commutative, - neither, or both. This influences query analysis and execution: associative - aggregations can run in parallel, whereas non-associative cannot; non-commutative - aggregations must be run over data in input-order. - - - - - A simple enumerable type that implements the range algorithm. It also supports - partitioning of the indices by implementing an interface that PLINQ recognizes. - - - - - A simple enumerable type that implements the repeat algorithm. It also supports - partitioning of the count space by implementing an interface that PLINQ recognizes. - - - - - - A special merge helper for indexible queries. Given an indexible query, we know how many elements - we'll have in the result set, so we can allocate the array ahead of time. Then, as each result element - is produced, we can directly insert it into the appropriate position in the output array, paying - no extra cost for ordering. - - - - - - Used as a stand-in for replaceable merge algorithms. Alternative implementations - are chosen based on the style of merge required. - - - - - - Instantiates the array merge helper. - - The query settings - The query results - - - - A method used as a delegate passed into the ForAll operator - - - - - Schedules execution of the merge itself. - - - - - Gets the enumerator over the results. - - We never expect this method to be called. ArrayMergeHelper is intended to be used when we want - to consume the results using GetResultsAsArray(). - - - - - Returns the merged results as an array. - - - - - - An enumerator that merges multiple one-to-one channels into a single output - stream, including any necessary blocking and synchronization. This is an - asynchronous enumerator, i.e. the producers may be inserting items into the - channels concurrently with the consumer taking items out of them. Therefore, - enumerating this object can cause the current thread to block. - - We use a biased choice algorithm to choose from our consumer channels. I.e. we - will prefer to process elements in a fair round-robin fashion, but will - occassionally bypass this if a channel is empty. - - - - - - - Convenience class used by enumerators that merge many partitions into one. - - - - - - WaitAny simulates a Win32-style WaitAny on the set of thin-events. - - An array of thin-events (null elements permitted) - The index of the specific event in events that caused us to wake up. - - - - The default merge helper uses a set of straightforward algorithms for output - merging. Namely, for synchronous merges, the input data is yielded from the - input data streams in "depth first" left-to-right order. For asynchronous merges, - on the other hand, we use a biased choice algorithm to favor input channels in - a "fair" way. No order preservation is carried out by this helper. - - - - - - - Drives execution of an actual merge operation, including creating channel data - structures and scheduling parallel work as appropriate. The algorithms used - internally are parameterized based on the type of data in the partitions; e.g. - if an order preserved stream is found, the merge will automatically use an - order preserving merge, and so forth. - - - - - - The order preserving merge helper guarantees the output stream is in a specific order. This is done - by comparing keys from a set of already-sorted input partitions, and coalescing output data using - incremental key comparisons. - - - - - - - A merge helper that yields results in a streaming fashion, while still ensuring correct output - ordering. This merge only works if each producer task generates outputs in the correct order, - i.e. with an Increasing (or Correct) order index. - - The merge creates DOP producer tasks, each of which will be writing results into a separate - buffer. - - The consumer always waits until each producer buffer contains at least one element. If we don't - have one element from each producer, we cannot yield the next element. (If the order index is - Correct, or in some special cases with the Increasing order, we could yield sooner. The - current algorithm does not take advantage of this.) - - The consumer maintains a producer heap, and uses it to decide which producer should yield the next output - result. After yielding an element from a particular producer, the consumer will take another element - from the same producer. However, if the producer buffer exceeded a particular threshold, the consumer - will take the entire buffer, and give the producer an empty buffer to fill. - - Finally, if the producer notices that its buffer has exceeded an even greater threshold, it will - go to sleep and wait until the consumer takes the entire buffer. - - - - - The initial capacity of the buffer queue. The value was chosen experimentally. - - - - - If the consumer notices that the queue reached this limit, it will take the entire buffer from - the producer, instead of just popping off one result. The value was chosen experimentally. - - - - - If the producer notices that the queue reached this limit, it will go to sleep until woken up - by the consumer. Chosen experimentally. - - - - - Whether the producer is allowed to buffer up elements before handing a chunk to the consumer. - If false, the producer will make each result available to the consumer immediately after it is - produced. - - - - - Buffers for the results. Each buffer has elements added by one producer, and removed - by the consumer. - - - - - Whether each producer is done producing. Set to true by individual producers, read by consumer. - - - - - Whether a particular producer is waiting on the consumer. Read by the consumer, set to true - by producers, set to false by the consumer. - - - - - Whether the consumer is waiting on a particular producer. Read by producers, set to true - by consumer, set to false by producer. - - - - - Each object is a lock protecting the corresponding elements in m_buffers, m_producerDone, - m_producerWaiting and m_consumerWaiting. - - - - - A singleton instance of the comparer used by the producer heap. Eager allocation is OK - because if the static constructor runs, we will be using this merge. - - - - - A structure to represent a producer in the producer heap. - - - - - A comparer used by FixedMaxHeap(Of Producer) - - This comparer will be used by max-heap. We want the producer with the smallest MaxKey to - end up in the root of the heap. - - x.MaxKey GREATER_THAN y.MaxKey => x LESS_THAN y => return - - x.MaxKey EQUALS y.MaxKey => x EQUALS y => return 0 - x.MaxKey LESS_THAN y.MaxKey => x GREATER_THAN y => return + - - - - - Enumerator over the results of an order-preserving pipelining merge. - - - - - Merge helper associated with this enumerator - - - - - Heap used to efficiently locate the producer whose result should be consumed next. - For each producer, stores the order index for the next element to be yielded. - - Read and written by the consumer only. - - - - - Stores the next element to be yielded from each producer. We use a separate array - rather than storing this information in the producer heap to keep the Producer struct - small. - - Read and written by the consumer only. - - - - - A private buffer for the consumer. When the size of a producer buffer exceeds a threshold - (STEAL_BUFFER_SIZE), the consumer will take ownership of the entire buffer, and give the - producer a new empty buffer to place results into. - - Read and written by the consumer only. - - - - - Tracks whether MoveNext() has already been called previously. - - - - - Constructor - - - - - Moves the enumerator to the next result, or returns false if there are no more results to yield. - - - - - If the cancellation of the query has been initiated (because one or more producers - encountered exceptions, or because external cancellation token has been set), the method - will tear down the query and rethrow the exception. - - - - - Wait until a producer's buffer is non-empty, or until that producer is done. - - false if there is no element to yield because the producer is done, true otherwise - - - - Looks for an element from a particular producer in the consumer's private buffer. - - - - - Returns the current result - - - - - This enumerator merges multiple input channels into a single output stream. The merging process just - goes from left-to-right, enumerating each channel in succession in its entirety. - Assumptions: - Before enumerating this object, all producers for all channels must have finished enqueueing new - elements. - - - - - - This enumerator handles the actual coordination among partitions required to - accomplish the repartitioning operation, as explained above. - - The kind of elements. - The key used to distribute elements. - The kind of keys found in the source (ignored). - - - - A repartitioning stream must take input data that has already been partitioned and - redistribute its contents based on a new partitioning algorithm. This is accomplished - by making each partition p responsible for redistributing its input data to the - correct destination partition. Some input elements may remain in p, but many will now - belong to a different partition and will need to move. This requires a great deal of - synchronization, but allows threads to repartition data incrementally and in parallel. - Each partition will "pull" data on-demand instead of partitions "pushing" data, which - allows us to reduce some amount of synchronization overhead. - - We currently only offer one form of reparitioning via hashing. This used to be an - abstract base class, but we have eliminated that to get rid of some virtual calls on - hot code paths. Uses a key selection algorithm with mod'ding to determine destination. - - @TODO: @BUG#519: consider adding a bound to the buffers. Unfortunately this can quite easily - lead to deadlock when multiple repartitions are involved. Need a solution. - @TODO: @BUG#504: consider amortizing synchronization overhead by enqueueing/dequeueing in chunks - rather than single elements. Also need to be careful not to introduce deadlock. - - - - - - - - A partitioned stream just partitions some data source using an extensible - partitioning algorithm and exposes a set of N enumerators that are consumed by - their ordinal index [0..N). It is used to build up a set of streaming computations. - At instantiation time, the actual data source to be partitioned is supplied; and - then the caller will layer on top additional enumerators to represent phases in the - computation. Eventually, a merge can then schedule enumeration of all of the - individual partitions in parallel by obtaining references to the individual - partition streams. - - This type has a set of subclasses which implement different partitioning algorithms, - allowing us to easily plug in different partitioning techniques as needed. The type - supports wrapping IEnumerables and IEnumerators alike, with some preference for the - former as many partitioning algorithms are more intelligent for certain data types. - - - - - - - IPartitionedStreamRecipient is essentially a generic action on a partitioned stream, - whose generic type parameter is the type of the order keys in the partitioned stream. - - - - - - This enumerator handles the actual coordination among partitions required to - accomplish the repartitioning operation, as explained above. In addition to that, - it tracks order keys so that order preservation can flow through the enumerator. - - The kind of elements. - The key used to distribute elements. - The kind of keys found in the source. - - - - Contiguous range chunk partitioning attempts to improve data locality by keeping - data close together in the incoming data stream together in the outgoing partitions. - There are really three types of partitions that are used internally: - - 1. If the data source is indexable--like an array or List_T--we can actually - just compute the range indexes and avoid doing any copying whatsoever. Each - "partition" is just an enumerator that will walk some subset of the data. - 2. If the data source has an index (different than being indexable!), we can - turn this into a range scan of the index. We can roughly estimate distribution - and ensure an evenly balanced set of partitions. - @TODO: @BUG#516: we don't have indexes today. We are considering it for the future. - 3. If we can't use 1 or 2, we instead partition "on demand" by chunking the contents - of the source enumerator as they are requested. The unfortunate thing is that - this requires synchronization, since consumers may be running in parallel. We - amortize the cost of this by giving chunks of items when requested instead of - one element at a time. Note that this approach also works for infinite streams. - - In all cases, the caller can request that enumerators walk elements in striped - contiguous chunks. If striping is requested, then each partition j will yield elements - in the data source for which ((i / s)%p) == j, where i is the element's index, s is - a chunk size calculated by the system with the intent of aligning on cache lines, and - p is the number of partitions. If striping is not requested, we use the same algorith, - only, instead of aligning on cache lines, we use a chunk size of l / p, where l - is the length of the input and p is the number of partitions. - - Notes: - This is used as the default partitioning strategy by much of the PLINQ infrastructure. - - - - - - The aggregation operator is a little unique, in that the enumerators it returns - yield intermediate results instead of the final results. That's because there is - one last Aggregate operation that must occur in order to perform the final reduction - over the intermediate streams. In other words, the intermediate enumerators produced - by this operator are never seen by other query operators or consumers directly. - - An aggregation performs parallel prefixing internally. Given a binary operator O, - it will generate intermediate results by folding O across partitions; then it - performs a final reduction by folding O accross the intermediate results. The - analysis engine knows about associativity and commutativity, and will ensure the - style of partitioning inserted into the tree is compatable with the operator. - - For instance, say O is + (meaning it is AC), our input is {1,2,...,8}, and we - use 4 partitions to calculate the aggregation. Sequentially this would look - like this O(O(O(1,2),...),8), in other words ((1+2)+...)+8. The parallel prefix - of this (w/ 4 partitions) instead calculates the intermediate aggregations, i.e.: - t1 = O(1,2), t2 = O(3,4), ... t4 = O(7,8), aka t1 = 1+2, t2 = 3+4, t4 = 7+8. - The final step is to aggregate O over these intermediaries, i.e. - O(O(O(t1,t2),t3),t4), or ((t1+t2)+t3)+t4. This generalizes to any binary operator. - - Beause some aggregations use a different input, intermediate, and output types, - we support an even more generalized aggregation type. In this model, we have - three operators, an intermediate (used for the incremental aggregations), a - final (used for the final summary of intermediate results), and a result selector - (used to perform whatever transformation is needed on the final summary). - - - - - - - - The base class from which all binary query operators derive, that is, those that - have two child operators. This introduces some convenience methods for those - classes, as well as any state common to all subclasses. - - - - - - - This is the abstract base class for all query operators in the system. It - implements the ParallelQuery{T} type so that it can be bound as the source - of parallel queries and so that it can be returned as the result of parallel query - operations. Not much is in here, although it does serve as the "entry point" for - opening all query operators: it will lazily analyze and cache a plan the first - time the tree is opened, and will open the tree upon calls to GetEnumerator. - - Notes: - This class implements ParallelQuery so that any parallel query operator - can bind to the parallel query provider overloads. This allows us to string - together operators w/out the user always specifying AsParallel, e.g. - Select(Where(..., ...), ...), and so forth. - - - - - - The QueryResults{T} is a class representing the results of the query. There may - be different ways the query results can be manipulated. Currently, two ways are - supported: - - 1. Open the query results as a partitioned stream by calling GivePartitionedStream - and pass a generic action as an argument. - - 2. Access individual elements of the results list by calling GetElement(index) and - ElementsCount. This method of accessing the query results is available only if - IsIndexible return true. - - - - - - A QueryOperator that represents the output of the query partitioner.AsParallel(). - - - - - Determines the OrdinalIndexState for a partitioner - - - - - QueryResults for a PartitionerQueryOperator - - - - - Enumerator that converts an enumerator over key-value pairs exposed by a partitioner - to a QueryOperatorEnumerator used by PLINQ internally. - - - - - Enumerator that converts an enumerator over key-value pairs exposed by a partitioner - to a QueryOperatorEnumerator used by PLINQ internally. - - - - - A scan is just a simple operator that is positioned directly on top of some - real data source. It's really just a place holder used during execution and - analysis -- it should never actually get opened. - - - - - - Operator that yields the elements from the first data source that aren't in the second. - This is known as the set relative complement, i.e. left - right. - - - - - - The base class from which all binary query operators derive, that is, those that - have two child operators. This introduces some convenience methods for those - classes, as well as any state common to all subclasses. - - - - - - - - A group join operator takes a left query tree and a right query tree, and then yields - the matching elements between the two. This can be used for outer joins, i.e. those - where an outer element has no matching inner elements -- the result is just an empty - list. As with the join algorithm above, we currently use a hash join algorithm. - - - - - - - - - This enumerator implements the hash-join algorithm as noted earlier. - - Assumptions: - This enumerator type won't work properly at all if the analysis engine didn't - ensure a proper hash-partition. We expect inner and outer elements with equal - keys are ALWAYS in the same partition. If they aren't (e.g. if the analysis is - busted) we'll silently drop items on the floor. :( - - - This is the enumerator class for two operators: - - Join - - GroupJoin - - - - - - - - - - Operator that yields the intersection of two data sources. - - - - - - A join operator takes a left query tree and a right query tree, and then yields the - matching pairs between the two. LINQ supports equi-key-based joins. Hence, a key- - selection function for the left and right data types will yield keys of the same - type for both. We then merely have to match elements from the left with elements from - the right that have the same exact key. Note that this is an inner join. In other - words, outer elements with no matching inner elements do not appear in the output. - - @TODO: @BUG#528: Currently we implement only a hash-join algorithm. Furthermore, we always - choose the inner data source for the hash-table creation. There is room for - optimization and different algorithm choices eventually. - - Hash-joins work in two phases: - - (1) Building - we build a hash-table from one of the data sources. In the case - of this specific operator, the table is built from the hash-codes of - keys selected via the key selector function. Because elements may share - the same key, the table must support one-key-to-many-values. - (2) Probing - for each element in the data source not used for building, we - use its key to look into the hash-table. If we find elements under this - key, we just enumerate all of them, yielding them as join matches. - - Because hash-tables exhibit on average O(1) lookup, we turn what would have been - an O(n*m) algorithm -- in the case of nested loops joins -- into an O(n) algorithm. - We of course require some additional storage to do so, but in general this pays. - - - - - - - - - Operator that yields the union of two data sources. - - - - - - A Zip operator combines two input data sources into a single output stream, - using a pairwise element matching algorithm. For example, the result of zipping - two vectors a = {0, 1, 2, 3} and b = {9, 8, 7, 6} is the vector of pairs, - c = {(0,9), (1,8), (2,7), (3,6)}. Because the expectation is that each element - is matched with the element in the other data source at the same ordinal - position, the zip operator requires order preservation. - - - - - - - - Partitioned stream recipient that will merge the results. - - - - - A wrapper enumerator that just opens the query operator when MoveNext() is called for the - first time. We use QueryOpeningEnumerator to call QueryOperator.GetOpenedEnumerator() - lazily because once GetOpenedEnumerator() is called, PLINQ starts precomputing the - results of the query. - - - - - Opens the query and initializes m_openedQueryEnumerator and m_querySettings. - Called from the first MoveNext call. - - - - - An inlined count aggregation and its enumerator. - - - - - - This class is common to all of the "inlined" versions of various aggregations. The - inlined operators ensure that real MSIL instructions are used to perform elementary - operations versus general purpose delegate-based binary operators. For obvious reasons - this is a quite bit more efficient, although it does lead to a fair bit of unfortunate - code duplication. - - - - - - - - A class with some shared implementation between all aggregation enumerators. - - - - - - An inlined average aggregation operator and its enumerator, for decimals. - - - - - An inlined min/max aggregation and its enumerator, for decimals. - - - - - An inlined sum aggregation and its enumerator, for decimals. - - - - - An inlined average aggregation operator and its enumerator, for doubles. - - - - - An inlined min/max aggregation and its enumerator, for doubles. - - Notes: - Note that normally double.NaN < anything is false, as is anything < NaN. This would - lead to some strangeness in Min and Max, e.g. Min({ NaN, 5.0 } == NaN, yet - Min({ 5.0, NaN }) == 5.0! We impose a total ordering so that NaN is smaller than - everything, including -infinity, which is consistent with Comparer_T. - - - - - An inlined sum aggregation and its enumerator, for doubles. - - - - - An inlined average aggregation operator and its enumerator, for floats. - - - - - An inlined min/max aggregation and its enumerator, for floats. - - - - - An inlined sum aggregation and its enumerator, for floats. - - - - - An inlined average aggregation operator and its enumerator, for ints. - - - - - An inlined min/max aggregation and its enumerator, for ints. - - - - - Inlined aggregations for summing up primitives (int, long, float, double, decimal), as - well as the nullable versions of each (int?, long?, float?, double?, decimal?). - - - - - An inlined average aggregation operator and its enumerator, for longs. - - - - - An inlined count aggregation and its enumerator. - - - - - - An inlined min/max aggregation and its enumerator, for longs. - - - - - An inlined sum aggregation and its enumerator, for longs. - - - - - An inlined average aggregation operator and its enumerator, for Nullable decimals. - - - - - An inlined min/max aggregation and its enumerator, for Nullable decimals. - - - - - An inlined sum aggregation and its enumerator, for nullable decimals. - - - - - An inlined average aggregation operator and its enumerator, for Nullable doubles. - - - - - An inlined min/max aggregation and its enumerator, for Nullable{Double}s. - - Notes: - Note that normally double.NaN < anything is false, as is anything < NaN. This would - lead to some strangeness in Min and Max, e.g. Min({ NaN, 5.0 } == NaN, yet - Min({ 5.0, NaN }) == 5.0! We impose a total ordering so that NaN is smaller than - everything, including -infinity, which is consistent with Comparer_T. - - - - - An inlined sum aggregation and its enumerator, for nullable doubles. - - - - - An inlined average aggregation operator and its enumerator, for Nullable floats. - - - - - An inlined min/max aggregation and its enumerator, for Nullable floats. - - Notes: - Note that normally float.NaN < anything is false, as is anything < NaN. This would - lead to some strangeness in Min and Max, e.g. Min({ NaN, 5.0 } == NaN, yet - Min({ 5.0, NaN }) == 5.0! We impose a total ordering so that NaN is smaller than - everything, including -infinity, which is consistent with Comparer_T. - - - - - An inlined sum aggregation and its enumerator, for Nullable floats. - - - - - An inlined average aggregation operator and its enumerator, for Nullable ints. - - - - - An inlined min/max aggregation and its enumerator, for Nullable ints. - - - - - An inlined sum aggregation and its enumerator, for Nullable ints. - - - - - An inlined average aggregation operator and its enumerator, for Nullable longs. - - - - - An inlined min/max aggregation and its enumerator, for Nullable{Int64}s. - - - - - An inlined sum aggregation and its enumerator, for Nullable longs. - - - - - Class to represent an IList{T} as QueryResults{T} - - - - - - Describes the state of order preservation index associated with an enumerator. - - - - - This type contains query execution options specified by the user. - QuerySettings are used as follows: - - in the query construction phase, some settings may be uninitialized. - - at the start of the query opening phase, the WithDefaults method - is used to initialize all uninitialized settings. - - in the rest of the query opening phase, we assume that all settings - have been initialized. - - - - - Represents operators AsOrdered and AsUnordered. In the current implementation, it - simply turns on preservation globally in the query. - - - - - - Represents operators that set various query execution options. - - - - - - The any/all operators work the same way. They search for the occurrence of a predicate - value in the data source, and upon the first occurrence of such a value, yield a - particular value. Specifically: - - - Any returns true if the predicate for any element evaluates to true. - - All returns false if the predicate for any element evaluates to false. - - This uniformity is used to apply a general purpose algorithm. Both sentences above - take the form of "returns XXX if the predicate for any element evaluates to XXX." - Therefore, we just parameterize on XXX, called the qualifciation below, and if we - ever find an occurrence of XXX in the input data source, we also return XXX. Otherwise, - we return !XXX. Obviously, XXX in this case is a bool. - - This is a search algorithm. So once any single partition finds an element, it will - return so that execution can stop. This is done with a "cancelation" flag that is - polled by all parallel workers. The first worker to find an answer sets it, and all - other workers notice it and quit as quickly as possible. - - - - - - Concatenates one data source with another. Order preservation is used to ensure - the output is actually a concatenation -- i.e. one after the other. The only - special synchronization required is to find the largest index N in the first data - source so that the indices of elements in the second data source can be offset - by adding N+1. This makes it appear to the order preservation infrastructure as - though all elements in the second came after all elements in the first, which is - precisely what we want. - - - - - - Contains is quite similar to the any/all operator above. Each partition searches a - subset of elements for a match, and the first one to find a match signals to the rest - of the partititons to stop searching. - - - - - - This operator just exposes elements directly from the underlying data source, if - it's not empty, or yields a single default element if the data source is empty. - There is a minimal amount of synchronization at the beginning, until all partitions - have registered whether their stream is empty or not. Once the 0th partition knows - that at least one other partition is non-empty, it may proceed. Otherwise, it is - the 0th partition which yields the default value. - - - - - - This operator yields all of the distinct elements in a single data set. It works quite - like the above set operations, with the obvious difference being that it only accepts - a single data source as input. - - - - - - ElementAt just retrieves an element at a specific index. There is some cross-partition - coordination to force partitions to stop looking once a partition has found the - sought-after element. - - - - - - Executes the query, either sequentially or in parallel, depending on the query execution mode and - whether a premature merge was inserted by this ElementAt operator. - - result - withDefaultValue - whether an element with this index exists - - - - First tries to discover the first element in the source, optionally matching a - predicate. All partitions search in parallel, publish the lowest index for a - candidate match, and reach a barrier. Only the partition that "wins" the race, - i.e. who found the candidate with the smallest index, will yield an element. - - - - - - A forall operator just enables an action to be placed at the "top" of a query tree - instead of yielding an enumerator that some consumer can walk. We execute the - query for effect instead of yielding a data result. - - - - - - The operator type for GroupBy statements. This operator groups the input based on - a key-selection routine, yielding one-to-many values of key-to-elements. The - implementation is very much like the hash join operator, in which we first build - a big hashtable of the input; then we just iterate over each unique key in the - hashtable, yielding it plus all of the elements with the same key. - - - - - - - - An ordered version of the grouping data structure. Represents an ordered group of elements that - have the same grouping key. - - - - - Constructs a new grouping - - - - - Add an element - - - - - No more elements will be added, so we can sort the group now. - - - - - The key this grouping represents. - - - - - A variant of the Select operator that supplies element index while performing the - projection operation. This requires cooperation with partitioning and merging to - guarantee ordering is preserved. - - @TODO: @PERF: @BUG#527: as an optimization, we strictly don't need order to be preserved - all the way until the merge. If ordering is only kept for THIS operator, we - can subsequently get rid of order preservation after executing. - - - - - - - A variant of the Where operator that supplies element index while performing the - filtering operation. This requires cooperation with partitioning and merging to - guarantee ordering is preserved. - - @TODO: @PERF: @BUG#527: as an optimization, we strictly don't need order to be preserved - all the way until the merge. If ordering is only kept for THIS operator, we - can subsequently get rid of order preservation after executing. - - - - - - Last tries to discover the last element in the source, optionally matching a - predicate. All partitions search in parallel, publish the greatest index for a - candidate match, and reach a barrier. Only the partition that "wins" the race, - i.e. who found the candidate with the largest index, will yield an element. - - @TODO: @PERF: @BUG#414: this traverses the data source in forward-order. In the future, we - will want to traverse in reverse order, since this allows partitions to stop - the search sooner (by watching if the current index passes below the current best). - - - - - - - Reverse imposes ordinal order preservation. There are normally two phases to this - operator's execution. Each partition first builds a buffer containing all of its - elements, and then proceeds to yielding the elements in reverse. There is a - 'barrier' (but not a blocking barrier) in between these two steps, at which point the largest index becomes - known. This is necessary so that when elements from the buffer are yielded, the - CurrentIndex can be reported as the largest index minus the original index (thereby - reversing the indices as well as the elements themselves). If the largest index is - known a priori, because we have an array for example, we can avoid the barrier in - between the steps. - - - - - - SelectMany is effectively a nested loops join. It is given two data sources, an - outer and an inner -- actually, the inner is sometimes calculated by invoking a - function for each outer element -- and we walk the outer, walking the entire - inner enumerator for each outer element. There is an optional result selector - function which can transform the output before yielding it as a result element. - - Notes: - Although select many takes two enumerable objects as input, it appears to the - query analysis infrastructure as a unary operator. That's because it works a - little differently than the other binary operators: it has to re-open the right - child every time an outer element is walked. The right child is NOT partitioned. - - - - - - - - A helper method for WrapPartitionedStream. We use the helper to reuse a block of code twice, but with - a different order key type. (If premature merge occured, the order key type will be "int". Otherwise, - it will be the same type as "TLeftKey" in WrapPartitionedStream.) - - - - - Similar helper method to WrapPartitionedStreamNotIndexed, except that this one is for the indexed variant - of SelectMany (i.e., the SelectMany that passes indices into the user sequence-generating delegate) - - - - - The operator type for Select statements. This operator transforms elements as it - enumerates them through the use of a selector delegate. - - - - - - - Single searches the input to find the sole element that satisfies the (optional) - predicate. If multiple such elements are found, the caller is responsible for - producing an error. There is some degree of cross-partition synchronization to - proactively hault the search if we ever determine there are multiple elements - satisfying the search in the input. - - - - - - The query operator for OrderBy and ThenBy. - - - - - - - Take and Skip either take or skip a specified number of elements, captured in the - count argument. These will work a little bit like TakeWhile and SkipWhile: there - are two phases, (1) Search and (2) Yield. In the search phase, our goal is to - find the 'count'th index from the input. We do this in parallel by sharing a count- - sized array. Each thread races to populate the array with indices in ascending - order. This requires synchronization for inserts. We use a simple heap, for decent - worst case performance. After a thread has scanned ‘count’ elements, or its current - index is greater than or equal to the maximum index in the array (and the array is - fully populated), the thread can stop searching. All threads issue a barrier before - moving to the Yield phase. When the Yield phase is entered, the count-1th element - of the array contains: in the case of Take, the maximum index (exclusive) to be - returned; or in the case of Skip, the minimum index (inclusive) to be returned. The - Yield phase simply consists of yielding these elements as output. - - - - - - Determines the order index state for the output operator - - - - - Take- and SkipWhile work similarly. Execution is broken into two phases: Search - and Yield. - - During the Search phase, many partitions at once search for the first occurrence - of a false element. As they search, any time a partition finds a false element - whose index is lesser than the current lowest-known false element, the new index - will be published, so other partitions can stop the search. The search stops - as soon as (1) a partition exhausts its input, (2) the predicate yields false for - one of the partition's elements, or (3) its input index passes the current lowest- - known index (sufficient since a given partition's indices are always strictly - incrementing -- asserted below). Elements are buffered during this process. - - Partitions use a barrier after Search and before moving on to Yield. Once all - have passed the barrier, Yielding begins. At this point, the lowest-known false - index will be accurate for the entire set, since all partitions have finished - scanning. This is where TakeWhile and SkipWhile differ. TakeWhile will start at - the beginning of its buffer and yield all elements whose indices are less than - the lowest-known false index. SkipWhile, on the other hand, will skipp any such - elements in the buffer, yielding those whose index is greater than or equal to - the lowest-known false index, and then finish yielding any remaining elements in - its data source (since it may have stopped prematurely due to (3) above). - - - - - - Determines the order index state for the output operator - - - - - The operator type for Where statements. This operator filters out elements that - don't match a filter function (supplied at instantiation time). - - - - - - Poll frequency (number of loops per cancellation check) for situations where per-1-loop testing is too high an overhead. - - - - - Throws an OCE if the merged token has been canceled. - - A token to check for cancelation. - - - - A spooling task handles marshaling data from a producer to a consumer. It simply - takes data from a producer and hands it off to a consumer. This class is the base - class from which other concrete spooling tasks derive, encapsulating some common - logic (such as capturing exceptions). - - - - - Simple abstract task representation, allowing either synchronous and asynchronous - execution. Subclasses override the Work API to implement the logic. - - - - - The number of elements to accumulate on the producer before copying the elements to the - producer-consumer buffer. This constant is only used in the AutoBuffered mode. - - Experimentally, 16 appears to be sufficient buffer size to compensate for the synchronization - cost. - - - - - Whether the producer is allowed to buffer up elements before handing a chunk to the consumer. - If false, the producer will make each result available to the consumer immediately after it is - produced. - - - - - Constructor - - - - - This method is responsible for enumerating results and enqueueing them to - the output buffer as appropriate. Each base class implements its own. - - - - - Creates and begins execution of a new set of spooling tasks. - - - - - Dispose the underlying enumerator and wake up the consumer if necessary. - - - - - A spooling task handles marshaling data from a producer to a consumer. It's given - a single enumerator object that contains all of the production algorithms, a single - destination channel from which consumers draw results, and (optionally) a - synchronization primitive using which to notify asynchronous consumers. This - particular task variant preserves sort order in the final data. - - - - - - - A collection of tasks used by a single query instance. This type also offers some - convenient methods for tracing significant ETW events, waiting on tasks, propagating - exceptions, and performing cancellation activities. - - - - - A factory class to execute spooling logic. - - - - - A spooling task handles marshaling data from a producer to a consumer. It's given - a single enumerator object that contains all of the production algorithms, a single - destination channel from which consumers draw results, and (optionally) a - synchronization primitive using which to notify asynchronous consumers. - - - - - - - A spooling task handles marshaling data from a producer to a consumer. It's given - a single enumerator object that contains all of the production algorithms, a single - destination channel from which consumers draw results, and (optionally) a - synchronization primitive using which to notify asynchronous consumers. - - - - - - - A spooling task handles marshaling data from a producer to a consumer. It's given - a single enumerator object that contains all of the production algorithms, a single - destination channel from which consumers draw results, and (optionally) a - synchronization primitive using which to notify asynchronous consumers. - - - - - - - Wraps an enumerable with a cancellation checker. The enumerator handed out by the source enumerable - will be wrapped by an object that periodically checks whether a particular cancellation token has - been cancelled. If so, the next call to MoveNext() will throw an OperationCancelledException. - - - - - WrapEnumerable.ExceptionAggregator wraps the enumerable with another enumerator that will - catch exceptions, and wrap each with an AggregateException. - - If PLINQ decides to execute a query sequentially, we will reuse LINQ-to-objects - implementations for the different operators. However, we still need to throw - AggregateException in the cases when parallel execution would have thrown an - AggregateException. Thus, we introduce a wrapper enumerator that catches exceptions - and wraps them with an AggregateException. - - - - - A variant of WrapEnumerable that accepts a QueryOperatorEnumerator{,} instead of an IEnumerable{}. - The code duplication is necessary to avoid extra virtual method calls that would otherwise be needed to - convert the QueryOperatorEnumerator{,} to an IEnumerator{}. - - - - - Accepts an exception, wraps it as if it was crossing the parallel->sequential boundary, and throws the - wrapped exception. In sequential fallback cases, we use this method to throw exceptions that are consistent - with exceptions thrown by PLINQ when the query is executed by worker tasks. - - The exception will be wrapped into an AggregateException, except for the case when the query is being - legitimately cancelled, in which case we will propagate the CancellationException with the appropriate - token. - - - - - Wraps a function with a try/catch that morphs all exceptions into AggregateException. - - The input argument type. - The return value type. - A function to use internally. - The cancellation state to use. - A new function containing exception wrapping logic. - - - - ExchangeUtilities is a static class that contains helper functions to partition and merge - streams. - - - - - Used during hash partitioning, when the keys being memoized are not used for anything. - - - - - Very simple heap data structure, of fixed size. - - - - - - A growing array. Unlike List{T}, it makes the internal array available to its user. - - - - - - A simple hash map data structure, derived from the LINQ set we also use. - - The kind of keys contained within. - The kind of values contained within. - - - - A linked list of array chunks. Allows direct access to its arrays. - - The elements held within. - - - - Allocates a new root chunk of a particular size. - - - - - Adds an element to this chunk. Only ever called on the root. - - The new element. - - - - Fetches an enumerator to walk the elements in all chunks rooted from this one. - - - - - The next chunk in the linked chain. - - - - - The number of elements contained within this particular chunk. - - - - - Lookup class implements the ILookup interface. Lookup is very similar to a dictionary - except multiple values are allowed to map to the same key, and null keys are supported. - - Support for null keys adds an issue because the Dictionary class Lookup uses for - storage does not support null keys. So, we need to treat null keys separately. - Unfortunately, since TKey may be a value type, we cannot test whether the key is null - using the user-specified equality comparer. - - C# does allow us to compare the key against null using the == operator, but there is a - possibility that the user's equality comparer considers null to be equal to other values. - Now, MSDN documentation specifies that if IEqualityComparer.Equals(x,y) returns true, it - must be the case that x and y have the same hash code, and null has no hash code. Despite - that, we might as well support the use case, even if it is bad practice. - - The solution the Lookup class uses is to treat the key default(TKey) as a special case, - and hold its associated grouping - if any - in a special field instead of inserting it - into a dictionary. - - - - - - - A pair just wraps two bits of data into a single addressable unit. This is a - value type to ensure it remains very lightweight, since it is frequently used - with other primitive data types as well. - - - - - - - PairComparer compares pairs by the first element, and breaks ties by the second - element. - - - - - - - Comparer that wraps another comparer, and flips the result of each comparison to the - opposite answer. - - - - - - A set for various operations. Shamelessly stolen from LINQ's source code. - @TODO: can the Linq one be used directly now that we are in System.Core - - The kind of elements contained within. - - - - A very simple primitive that allows us to share a value across multiple threads. - - - - - - Common miscellaneous utility methods used throughout the code-base. - - - - - A struct to wrap any arbitrary object reference or struct. Used for situations - where we can't tolerate null values (like keys for hashtables). - - - - - - Compares two wrapped structs of the same underlying type for equality. Simply - wraps the actual comparer for the type being wrapped. - - - - - - Represents a sorted, parallel sequence. - - - - - Returns an enumerator that iterates through the sequence. - - An enumerator that iterates through the sequence. - - - - The query execution mode is a hint that specifies how the system should handle - performance trade-offs when parallelizing queries. - - - - - By default, the system will use algorithms for queries - that are ripe for parallelism and will avoid algorithms with high - overheads that will likely result in slow downs for parallel execution. - - - - - Parallelize the entire query, even if that means using high-overhead algorithms. - - - - - Provides a set of static (Shared in Visual Basic) methods for working with specific kinds of - instances. - - - - - Creates a proxy Task that represents the - asynchronous operation of a Task{Task}. - - - It is often useful to be able to return a Task from a - Task{TResult}, where the inner Task represents work done as part of the outer Task{TResult}. However, - doing so results in a Task{Task}, which, if not dealt with carefully, could produce unexpected behavior. Unwrap - solves this problem by creating a proxy Task that represents the entire asynchronous operation of such a Task{Task}. - - The Task{Task} to unwrap. - The exception that is thrown if the - argument is null. - A Task that represents the asynchronous operation of the provided Task{Task}. - - - - Creates a proxy Task{TResult} that represents the - asynchronous operation of a Task{Task{TResult}}. - - - It is often useful to be able to return a Task{TResult} from a Task{TResult}, where the inner Task{TResult} - represents work done as part of the outer Task{TResult}. However, doing so results in a Task{Task{TResult}}, - which, if not dealt with carefully, could produce unexpected behavior. Unwrap solves this problem by - creating a proxy Task{TResult} that represents the entire asynchronous operation of such a Task{Task{TResult}}. - - The Task{Task{TResult}} to unwrap. - The exception that is thrown if the - argument is null. - A Task{TResult} that represents the asynchronous operation of the provided Task{Task{TResult}}. /// Unwraps a Task that returns another Task. - - - diff --git a/packages/TaskParallelLibrary/lib/Net35/redist.txt b/packages/TaskParallelLibrary/lib/Net35/redist.txt deleted file mode 100644 index c7972d81..00000000 --- a/packages/TaskParallelLibrary/lib/Net35/redist.txt +++ /dev/null @@ -1,11 +0,0 @@ -The files below can be distributed as described in the MICROSOFT REACTIVE EXTENSTIONS FOR JAVASCRIPT AND .NET LIBRARIES License. - -System.Observable.dll -System.CoreEx.dll -System.Reactive.dll -System.Interactive.dll -System.Threading.dll -System.Linq.Async.dll -System.Reactive.Testing.dll -System.Reactive.ClientProfile.dll -System.Reactive.ExtendedProfile.dll diff --git a/packages/TaskParallelLibrary/license.html b/packages/TaskParallelLibrary/license.html deleted file mode 100644 index 88bcaa49..00000000 --- a/packages/TaskParallelLibrary/license.html +++ /dev/null @@ -1,622 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Reactive Extensions Eula - - - - -
- - - - - - - -
- - -
- - - -
-
-
-
- - - -
- Developer Network - Developer Network - Developer -
-
-
- - - - - -Sign in
- - - - -
- - -
-
-
- -
-
-
-
-
-
-
-
-
-
-
-
- - -
-
- - - -
-
-
-
- -
-
-
-
- -
- -
- - - - -
-
-
-
-
-
-
-
-
- -
-
Reactive Extensions Eula - -
- -

To download the file you must agree to the following license:

MICROSOFT SOFTWARE LICENSE TERMS

MICROSOFT REACTIVE EXTENSIONS FOR JAVASCRIPT AND .NET LIBRARIES

These license terms are an agreement between Microsoft Corporation (or based on where you live, one of its affiliates) and you. Please read them. They apply to the software named above, which includes the media on which you received it, if any. The terms also apply to any Microsoft

  • updates,
  • supplements,
  • Internet-based services, and
  • support services

for this software, unless other terms accompany those items. If so, those terms apply.

BY USING THE SOFTWARE, YOU ACCEPT THESE TERMS. IF YOU DO NOT ACCEPT THEM, DO NOT USE THE SOFTWARE.

If you comply with these license terms, you have the rights below.

  1. INSTALLATION AND USE RIGHTS. You may install and use any number of copies of the software on your devices to design, develop and test your programs. 
  2. ADDITIONAL LICENSING REQUIREMENTS AND/OR USE RIGHTS.
    1. Distributable Code.The software contains code that you are permitted to distribute in programs you develop if you comply with the terms below.
      1. Right to Use and Distribute. The code and text files listed in the software REDIST.TXT files are "Distributable Code."
        • - -REDIST.TXT Files. You may copy and distribute the object code form of the Distributable Code. You may also combine the object code form of the Distributable Code with your programs to develop a unified web solution and permit others via online methods to access and use that unified web solution, provided that the Distributable Code is only used as part of and in conjunction with your programs.
        • Third Party Distribution. You may permit distributors of your programs to copy and distribute the Distributable Code as part of those programs.
      2. Distributable Code Requirements. For any Distributable Code, you must
        • add significant primary functionality to it in your programs;
        • require distributors and external end users to agree to terms that protect it at least as much as this agreement;
        • display your valid copyright notice on your programs; and
        • indemnify, defend, and hold harmless Microsoft from any claims, including attorneys’ fees, related to the distribution or use of your programs.
      3. Distributable Code Restrictions. You may not
        • alter any copyright, trademark or patent notice in the Distributable Code;
        • use Microsoft’s trademarks in your programs’ names or in a way that suggests your programs come from or are endorsed by Microsoft;
        • include Distributable Code in malicious, deceptive or unlawful programs; or
        • modify or distribute the source code of any Distributable Code so that any part of it becomes subject to an Excluded License. An Excluded License is one that requires, as a condition of use, modification or distribution, that
          • the code be disclosed or distributed in source code form; or
          • others have the right to modify it.
  3. SCOPE OF LICENSE. The software is licensed, not sold. This agreement only gives you some rights to use the software. Microsoft reserves all other rights. Unless applicable law gives you more rights despite this limitation, you may use the software only as expressly permitted in this agreement. In doing so, you must comply with any technical limitations in the software that only allow you to use it in certain ways. You may not
    • work around any technical limitations in the software;
    • reverse engineer, decompile or disassemble the software, except and only to the extent that applicable law expressly permits, despite this limitation;
    • make more copies of the software than specified in this agreement or allowed by applicable law, despite this limitation;
    • publish the software for others to copy;
    • rent, lease or lend the software; or
    • transfer the software or this agreement to any third party.
  4. BACKUP COPY. You may make one backup copy of the software. You may use it only to reinstall the software.
  5. DOCUMENTATION. Any person that has valid access to your computer or internal network may copy and use the documentation for your internal, reference purposes.
  6. EXPORT RESTRICTIONS. The software is subject to United States export laws and regulations. You must comply with all domestic and international export laws and regulations that apply to the software. These laws include restrictions on destinations, end users and end use. For additional information, see - -www.microsoft.com/exporting.
  7. SUPPORT SERVICES. Because this software is “as is,” we may not provide support services for it.
  8. ENTIRE AGREEMENT. This agreement, and the terms for supplements, updates, Internet-based services and support services that you use, are the entire agreement for the software and support services.
  9. APPLICABLE LAW.
    1. United States. If you acquired the software in the United States, Washington state law governs the interpretation of this agreement and applies to claims for breach of it, regardless of conflict of laws principles. The laws of the state where you live govern all other claims, including claims under state consumer protection laws, unfair competition laws, and in tort.
    2. Outside the United States. If you acquired the software in any other country, the laws of that country apply.
  10. LEGAL EFFECT. This agreement describes certain legal rights. You may have other rights under the laws of your country. You may also have rights with respect to the party from whom you acquired the software. This agreement does not change your rights under the laws of your country if the laws of your country do not permit it to do so.
  11. DISCLAIMER OF WARRANTY. THE SOFTWARE IS LICENSED “AS-IS.” YOU BEAR THE RISK OF USING IT. MICROSOFT GIVES NO EXPRESS WARRANTIES, GUARANTEES OR CONDITIONS. YOU MAY HAVE ADDITIONAL CONSUMER RIGHTS UNDER YOUR LOCAL LAWS WHICH THIS AGREEMENT CANNOT CHANGE. TO THE EXTENT PERMITTED UNDER YOUR LOCAL LAWS, MICROSOFT EXCLUDES THE IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
  12. LIMITATION ON AND EXCLUSION OF REMEDIES AND DAMAGES. YOU CAN RECOVER FROM MICROSOFT AND ITS SUPPLIERS ONLY DIRECT DAMAGES UP TO U.S. $5.00. YOU CANNOT RECOVER ANY OTHER DAMAGES, INCLUDING CONSEQUENTIAL, LOST PROFITS, SPECIAL, INDIRECT OR INCIDENTAL DAMAGES.

This limitation applies to

  • anything related to the software, services, content (including code) on third party Internet sites, or third party programs; and
  • claims for breach of contract, breach of warranty, guarantee or condition, strict liability, negligence, or other tort to the extent permitted by applicable law.

It also applies even if Microsoft knew or should have known about the possibility of the damages. The above limitation or exclusion may not apply to you because your country may not allow the exclusion or limitation of incidental, consequential or other damages.

- -
-

-
- -
-
-
-
-
-
-
-
-
- - - - - - - - - -
- - - - - - - - - - - - - - - diff --git a/packages/TaskParallelLibrary/package/services/metadata/core-properties/afb2a006c6df4e3d9c1193b2bb601a42.psmdcp b/packages/TaskParallelLibrary/package/services/metadata/core-properties/afb2a006c6df4e3d9c1193b2bb601a42.psmdcp deleted file mode 100644 index 2e493659..00000000 --- a/packages/TaskParallelLibrary/package/services/metadata/core-properties/afb2a006c6df4e3d9c1193b2bb601a42.psmdcp +++ /dev/null @@ -1,5 +0,0 @@ -Microsoft CorporationThe package includes: -* Task<T> for executing asynchronous operations. -* Concurrent Collections such as ConcurrentStack, ConcurentQueue ad ConcurrentDictionary. -* PLINQ for writing parallel queries. -* additional Threading operations such as Barrier,SpinLock and SpinWait.TaskParallelLibrary1.0.2856.0en-ustpl plinq pfx task parallel extensions .net35 backport \ No newline at end of file diff --git a/paket.dependencies b/paket.dependencies index 4c66a7cc..b36368c4 100644 --- a/paket.dependencies +++ b/paket.dependencies @@ -2,16 +2,18 @@ source http://www.nuget.org/api/v2 nuget FSharp.Core ~> 3.1.2 nuget TaskParallelLibrary 1.0.2856 +github fsprojects/FsUnit src/FsUnit.NUnit/FsUnit.fs +github fsprojects/FsUnit src/FsUnit.NUnit/FsUnitTyped.fs + group Test source http://www.nuget.org/api/v2 nuget FSharp.Core - nuget NUnit ~> 2.6 - nuget FsUnit ~> 1.3.1 + nuget NUnit ~> 3.0 group Build source http://www.nuget.org/api/v2 nuget FAKE ~> 4.1 - nuget NUnit.Runners ~> 2.6 + nuget NUnit.Runners ~> 3.0 nuget FSharp.Formatting !~> 2.4 nuget NuGet.CommandLine diff --git a/paket.lock b/paket.lock index a756992a..29ebd595 100644 --- a/paket.lock +++ b/paket.lock @@ -3,7 +3,11 @@ NUGET specs: FSharp.Core (3.1.2.5) TaskParallelLibrary (1.0.2856) - +GITHUB + remote: fsprojects/FsUnit + specs: + src/FsUnit.NUnit/FsUnit.fs (db5644485efee6a228fe3d3f85903a3524b5f32c) + src/FsUnit.NUnit/FsUnitTyped.fs (db5644485efee6a228fe3d3f85903a3524b5f32c) GROUP Benchmark NUGET remote: http://www.nuget.org/api/v2 @@ -23,7 +27,17 @@ NUGET FSharpVSPowerTools.Core (2.3.0) FSharp.Compiler.Service (>= 2.0.0.3) NuGet.CommandLine (3.3.0) - NUnit.Runners (2.6.4) + NUnit.ConsoleRunner (3.2.0) + NUnit.Extension.NUnitProjectLoader (3.2.0) + NUnit.Extension.NUnitV2Driver (3.2.0) + NUnit.Extension.NUnitV2ResultWriter (3.2.0) + NUnit.Extension.VSProjectLoader (3.2.0) + NUnit.Runners (3.2.0) + NUnit.ConsoleRunner (3.2.0) + NUnit.Extension.NUnitProjectLoader (3.2.0) + NUnit.Extension.NUnitV2Driver (3.2.0) + NUnit.Extension.NUnitV2ResultWriter (3.2.0) + NUnit.Extension.VSProjectLoader (3.2.0) GROUP Data NUGET @@ -36,6 +50,4 @@ NUGET remote: http://www.nuget.org/api/v2 specs: FSharp.Core (4.0.0.1) - FsUnit (1.3.1) - NUnit (2.6.4) - NUnit (2.6.4) + NUnit (3.2.0) diff --git a/src/DataUnitTests/UnitTests.csproj b/src/DataUnitTests/UnitTests.csproj index 720abc0d..52adf795 100644 --- a/src/DataUnitTests/UnitTests.csproj +++ b/src/DataUnitTests/UnitTests.csproj @@ -114,11 +114,42 @@ - - - ..\..\packages\test\NUnit\lib\nunit.framework.dll - True - True - - + + + + + ..\..\packages\test\NUnit\lib\net20\nunit.framework.dll + True + True + + + + + + + ..\..\packages\test\NUnit\lib\net40\nunit.framework.dll + True + True + + + + + + + ..\..\packages\test\NUnit\lib\net45\nunit.framework.dll + True + True + + + + + + + ..\..\packages\test\NUnit\lib\portable-net45+win8+wp8+wpa81+Xamarin.Mac+MonoAndroid10+MonoTouch10+Xamarin.iOS10\nunit.framework.dll + True + True + + + + \ No newline at end of file diff --git a/src/FSharpUnitTests/DenseMatrixTests.fs b/src/FSharpUnitTests/DenseMatrixTests.fs index 21243e3b..46ca9f9c 100644 --- a/src/FSharpUnitTests/DenseMatrixTests.fs +++ b/src/FSharpUnitTests/DenseMatrixTests.fs @@ -2,6 +2,8 @@ open NUnit.Framework open FsUnit +open FsUnitTyped + open MathNet.Numerics.LinearAlgebra open MathNet.Numerics.Distributions open MathNet.Numerics.Statistics @@ -19,94 +21,94 @@ module DenseMatrixTests = [] let ``DenseMatrix.zero`` () = - (DenseMatrix.zero 100 120) + largeM |> should equal largeM + (DenseMatrix.zero 100 120) + largeM |> shouldEqual largeM [] let ``DenseMatrix.random`` () = let m = DenseMatrix.random 100 120 (Normal.WithMeanStdDev(100.0,0.1)) (m :?> Double.DenseMatrix).Values |> ArrayStatistics.Mean |> should (equalWithin 10.0) 100.0 - m.RowCount |> should equal 100 - m.ColumnCount |> should equal 120 + m.RowCount |> shouldEqual 100 + m.ColumnCount |> shouldEqual 120 [] let ``DenseMatrix.create`` () = - DenseMatrix.create 3 2 0.3 |> should equal smallM + DenseMatrix.create 3 2 0.3 |> shouldEqual smallM [] let ``DenseMatrix.init`` () = - DenseMatrix.init 3 2 (fun i j -> 0.3) |> should equal smallM - DenseMatrix.init 100 120 (fun i j -> float i * 100.0 + float j) |> should equal largeM + DenseMatrix.init 3 2 (fun i j -> 0.3) |> shouldEqual smallM + DenseMatrix.init 100 120 (fun i j -> float i * 100.0 + float j) |> shouldEqual largeM [] let ``DenseMatrix.ofArray2`` () = - DenseMatrix.ofArray2 (array2D [[0.3;0.3];[0.3;0.3];[0.3;0.3]]) |> should equal smallM - DenseMatrix.ofArray2 (Array2D.create 3 2 0.3) |> should equal smallM - DenseMatrix.ofArray2 (Array2D.init 100 120 (fun i j -> float i * 100.0 + float j)) |> should equal largeM + DenseMatrix.ofArray2 (array2D [[0.3;0.3];[0.3;0.3];[0.3;0.3]]) |> shouldEqual smallM + DenseMatrix.ofArray2 (Array2D.create 3 2 0.3) |> shouldEqual smallM + DenseMatrix.ofArray2 (Array2D.init 100 120 (fun i j -> float i * 100.0 + float j)) |> shouldEqual largeM [] let ``DenseMatrix.ofMatrixArray2`` () = let a = DenseMatrix.ofMatrixArray2 (array2D [[smallM;smallM];[smallM;smallM];[smallM;smallM]]) - a.[0..2,0..1] |> should equal smallM - a.[3..5,2..3] |> should equal smallM - a.[6..8,0..1] |> should equal smallM + a.[0..2,0..1] |> shouldEqual smallM + a.[3..5,2..3] |> shouldEqual smallM + a.[6..8,0..1] |> shouldEqual smallM [] let ``DenseMatrix.ofMatrixList2`` () = let a = DenseMatrix.ofMatrixList2 [[smallM; smallM]; [smallM; smallM]; [smallM; smallM]] - a.[0..2,0..1] |> should equal smallM - a.[3..5,2..3] |> should equal smallM - a.[6..8,0..1] |> should equal smallM + a.[0..2,0..1] |> shouldEqual smallM + a.[3..5,2..3] |> shouldEqual smallM + a.[6..8,0..1] |> shouldEqual smallM [] let ``DenseMatrix.ofRowSeq`` () = - DenseMatrix.ofRowSeq (Seq.ofList [[0.3;0.3];[0.3;0.3];[0.3;0.3]]) |> should equal smallM + DenseMatrix.ofRowSeq (Seq.ofList [[0.3;0.3];[0.3;0.3];[0.3;0.3]]) |> shouldEqual smallM [] let ``DenseMatrix.ofRowList`` () = - DenseMatrix.ofRowList [[0.3;0.3];[0.3;0.3];[0.3;0.3]] |> should equal smallM + DenseMatrix.ofRowList [[0.3;0.3];[0.3;0.3];[0.3;0.3]] |> shouldEqual smallM [] let ``DenseMatrix.ofRows`` () = - DenseMatrix.ofRows [vector [0.3;0.3]; vector [0.3;0.3]; vector [0.3;0.3]] |> should equal smallM + DenseMatrix.ofRows [vector [0.3;0.3]; vector [0.3;0.3]; vector [0.3;0.3]] |> shouldEqual smallM [] let ``DenseMatrix.ofColumnSeq`` () = - DenseMatrix.ofColumnSeq (Seq.ofList [[0.3;0.3;0.3];[0.3;0.3;0.3]]) |> should equal smallM + DenseMatrix.ofColumnSeq (Seq.ofList [[0.3;0.3;0.3];[0.3;0.3;0.3]]) |> shouldEqual smallM [] let ``DenseMatrix.ofColumnList`` () = - DenseMatrix.ofColumnList [[0.3;0.3;0.3];[0.3;0.3;0.3]] |> should equal smallM + DenseMatrix.ofColumnList [[0.3;0.3;0.3];[0.3;0.3;0.3]] |> shouldEqual smallM [] let ``DenseMatrix.ofColumns`` () = - DenseMatrix.ofColumns [vector [0.3;0.3;0.3]; vector [0.3;0.3;0.3]] |> should equal smallM + DenseMatrix.ofColumns [vector [0.3;0.3;0.3]; vector [0.3;0.3;0.3]] |> shouldEqual smallM [] let ``DenseMatrix.ofSeqi`` () = seq { for i in 0 .. 99 do for j in 0 .. 119 -> (i,j, float i * 100.0 + float j)} - |> DenseMatrix.ofSeqi 100 120 |> should equal largeM + |> DenseMatrix.ofSeqi 100 120 |> shouldEqual largeM [] let ``DenseMatrix.ofListi`` () = [ for i in 0 .. 99 do for j in 0 .. 119 -> (i,j, float i * 100.0 + float j) ] - |> DenseMatrix.ofListi 100 120 |> should equal largeM + |> DenseMatrix.ofListi 100 120 |> shouldEqual largeM [] let ``DenseMatrix.diag`` () = - DenseMatrix.diag 100 2.0 |> should equal (2.0 * (DenseMatrix.identity 100)) + DenseMatrix.diag 100 2.0 |> shouldEqual (2.0 * (DenseMatrix.identity 100)) [] let ``DenseMatrix.diag2`` () = - DenseMatrix.diag2 100 120 2.0 |> should equal (2.0 * (DenseMatrix.identity2 100 120)) + DenseMatrix.diag2 100 120 2.0 |> shouldEqual (2.0 * (DenseMatrix.identity2 100 120)) [] let ``DenseMatrix.ofDiag`` () = - DenseMatrix.ofDiag (DenseVector.init 100 (fun i -> 2.0)) |> should equal (2.0 * (DenseMatrix.identity 100)) + DenseMatrix.ofDiag (DenseVector.init 100 (fun i -> 2.0)) |> shouldEqual (2.0 * (DenseMatrix.identity 100)) [] let ``DenseMatrix.initRow`` () = - DenseMatrix.initRows 100 (fun i -> (DenseVector.init 120 (fun j -> float i * 100.0 + float j))) |> should equal largeM + DenseMatrix.initRows 100 (fun i -> (DenseVector.init 120 (fun j -> float i * 100.0 + float j))) |> shouldEqual largeM [] let ``DenseMatrix.initCol`` () = - DenseMatrix.initColumns 120 (fun j -> (DenseVector.init 100 (fun i -> float i * 100.0 + float j))) |> should equal largeM + DenseMatrix.initColumns 120 (fun j -> (DenseVector.init 100 (fun i -> float i * 100.0 + float j))) |> shouldEqual largeM diff --git a/src/FSharpUnitTests/DenseVectorTests.fs b/src/FSharpUnitTests/DenseVectorTests.fs index 9951a70d..c33f474a 100644 --- a/src/FSharpUnitTests/DenseVectorTests.fs +++ b/src/FSharpUnitTests/DenseVectorTests.fs @@ -2,6 +2,8 @@ open NUnit.Framework open FsUnit +open FsUnitTyped + open MathNet.Numerics.LinearAlgebra open MathNet.Numerics.Distributions open MathNet.Numerics.Statistics @@ -10,50 +12,50 @@ open MathNet.Numerics.Statistics module DenseVectorTests = /// A small uniform vector. - let smallv = Double.DenseVector.Create(5, fun i -> 0.3) + let smallv = Double.DenseVector.Create(5, fun i -> 0.3) :> Vector /// A large vector with increasingly large entries - let largev = new Double.DenseVector( Array.init 100 (fun i -> float i / 100.0) ) + let largev = new Double.DenseVector( Array.init 100 (fun i -> float i / 100.0) ) :> Vector [] let ``DenseVector.zero`` () = - (DenseVector.zero 100) + largev |> should equal largev + (DenseVector.zero 100) + largev |> shouldEqual largev [] let ``DenseVector.random`` () = let m = DenseVector.random 100 (Normal.WithMeanStdDev(100.0,0.1)) (m :?> Double.DenseVector).Values |> ArrayStatistics.Mean |> should (equalWithin 10.0) 100.0 - m.Count |> should equal 100 + m.Count |> shouldEqual 100 [] let ``DenseVector.create`` () = - DenseVector.create 5 0.3 |> should equal smallv + DenseVector.create 5 0.3 |> shouldEqual smallv [] let ``DenseVector.init`` () = - DenseVector.init 5 (fun i -> 0.3) |> should equal smallv - DenseVector.init 100 (fun i -> float i / 100.0) |> should equal largev + DenseVector.init 5 (fun i -> 0.3) |> shouldEqual smallv + DenseVector.init 100 (fun i -> float i / 100.0) |> shouldEqual largev [] let ``DenseVector.ofList`` () = - DenseVector.ofList [ for i in 0 .. 99 -> float i / 100.0 ] |> should equal largev + DenseVector.ofList [ for i in 0 .. 99 -> float i / 100.0 ] |> shouldEqual largev [] let ``DenseVector.ofListi`` () = - DenseVector.ofListi 100 [ for i in 0 .. 99 -> i, float i / 100.0 ] |> should equal largev + DenseVector.ofListi 100 [ for i in 0 .. 99 -> i, float i / 100.0 ] |> shouldEqual largev [] let ``DenseVector.ofSeq`` () = - DenseVector.ofSeq (seq { for i in 0 .. 99 -> float i / 100.0 }) |> should equal largev + DenseVector.ofSeq (seq { for i in 0 .. 99 -> float i / 100.0 }) |> shouldEqual largev [] let ``DenseVector.ofSeqi`` () = - DenseVector.ofSeqi 100 (seq { for i in 99 .. -1 .. 0 -> i, float i / 100.0 }) |> should equal largev + DenseVector.ofSeqi 100 (seq { for i in 99 .. -1 .. 0 -> i, float i / 100.0 }) |> shouldEqual largev [] let ``DenseVector.rangef`` () = - DenseVector.rangef 0.0 0.01 0.99 |> should equal (DenseVector.raw [| for i in 0 .. 99 -> 0.01 * float i |]) + DenseVector.rangef 0.0 0.01 0.99 |> shouldEqual (DenseVector.raw [| for i in 0 .. 99 -> 0.01 * float i |]) [] let ``DenseVector.range`` () = - DenseVector.range 0 1 99 |> should equal (DenseVector.raw [| for i in 0 .. 99 -> float i |]) + DenseVector.range 0 1 99 |> shouldEqual (DenseVector.raw [| for i in 0 .. 99 -> float i |]) diff --git a/src/FSharpUnitTests/FSharpUnitTests-Net35.fsproj b/src/FSharpUnitTests/FSharpUnitTests-Net35.fsproj index a306b49b..7578ad04 100644 --- a/src/FSharpUnitTests/FSharpUnitTests-Net35.fsproj +++ b/src/FSharpUnitTests/FSharpUnitTests-Net35.fsproj @@ -56,6 +56,14 @@ + + True + paket-files/FsUnit.fs + + + True + paket-files/FsUnitTyped.fs + @@ -170,23 +178,42 @@ - - - ..\..\packages\test\FsUnit\lib\FsUnit.CustomMatchers.dll - True - True - - - ..\..\packages\test\FsUnit\lib\FsUnit.NUnit.dll - True - True - - - - - ..\..\packages\test\NUnit\lib\nunit.framework.dll - True - True - - + + + + + ..\..\packages\test\NUnit\lib\net20\nunit.framework.dll + True + True + + + + + + + ..\..\packages\test\NUnit\lib\net40\nunit.framework.dll + True + True + + + + + + + ..\..\packages\test\NUnit\lib\net45\nunit.framework.dll + True + True + + + + + + + ..\..\packages\test\NUnit\lib\portable-net45+win8+wp8+wpa81+Xamarin.Mac+MonoAndroid10+MonoTouch10+Xamarin.iOS10\nunit.framework.dll + True + True + + + + \ No newline at end of file diff --git a/src/FSharpUnitTests/FSharpUnitTests-Net35.fsproj.paket.references b/src/FSharpUnitTests/FSharpUnitTests-Net35.fsproj.paket.references index d2c47ee0..daf85901 100644 --- a/src/FSharpUnitTests/FSharpUnitTests-Net35.fsproj.paket.references +++ b/src/FSharpUnitTests/FSharpUnitTests-Net35.fsproj.paket.references @@ -1,5 +1,7 @@ TaskParallelLibrary +File:FsUnit.fs +File:FsUnitTyped.fs group Test - FsUnit + NUnit FSharp.Core diff --git a/src/FSharpUnitTests/FSharpUnitTests-Portable47.fsproj b/src/FSharpUnitTests/FSharpUnitTests-Portable47.fsproj index c7b0dd11..5ff93c97 100644 --- a/src/FSharpUnitTests/FSharpUnitTests-Portable47.fsproj +++ b/src/FSharpUnitTests/FSharpUnitTests-Portable47.fsproj @@ -42,6 +42,14 @@ + + True + paket-files/FsUnit.fs + + + True + paket-files/FsUnitTyped.fs + @@ -151,23 +159,42 @@ - - - ..\..\packages\test\FsUnit\lib\FsUnit.CustomMatchers.dll - True - True - - - ..\..\packages\test\FsUnit\lib\FsUnit.NUnit.dll - True - True - - - - - ..\..\packages\test\NUnit\lib\nunit.framework.dll - True - True - - + + + + + ..\..\packages\test\NUnit\lib\net20\nunit.framework.dll + True + True + + + + + + + ..\..\packages\test\NUnit\lib\net40\nunit.framework.dll + True + True + + + + + + + ..\..\packages\test\NUnit\lib\net45\nunit.framework.dll + True + True + + + + + + + ..\..\packages\test\NUnit\lib\portable-net45+win8+wp8+wpa81+Xamarin.Mac+MonoAndroid10+MonoTouch10+Xamarin.iOS10\nunit.framework.dll + True + True + + + + \ No newline at end of file diff --git a/src/FSharpUnitTests/FSharpUnitTests.fsproj b/src/FSharpUnitTests/FSharpUnitTests.fsproj index 3a93e721..2473f75e 100644 --- a/src/FSharpUnitTests/FSharpUnitTests.fsproj +++ b/src/FSharpUnitTests/FSharpUnitTests.fsproj @@ -51,6 +51,14 @@ $(DefineConstants);NOFSSLICESET1D + + True + paket-files/FsUnit.fs + + + True + paket-files/FsUnitTyped.fs + @@ -161,23 +169,42 @@ - - - ..\..\packages\test\FsUnit\lib\FsUnit.CustomMatchers.dll - True - True - - - ..\..\packages\test\FsUnit\lib\FsUnit.NUnit.dll - True - True - - - - - ..\..\packages\test\NUnit\lib\nunit.framework.dll - True - True - - + + + + + ..\..\packages\test\NUnit\lib\net20\nunit.framework.dll + True + True + + + + + + + ..\..\packages\test\NUnit\lib\net40\nunit.framework.dll + True + True + + + + + + + ..\..\packages\test\NUnit\lib\net45\nunit.framework.dll + True + True + + + + + + + ..\..\packages\test\NUnit\lib\portable-net45+win8+wp8+wpa81+Xamarin.Mac+MonoAndroid10+MonoTouch10+Xamarin.iOS10\nunit.framework.dll + True + True + + + + \ No newline at end of file diff --git a/src/FSharpUnitTests/FindRootsTests.fs b/src/FSharpUnitTests/FindRootsTests.fs index 9f0bc087..7226e59c 100644 --- a/src/FSharpUnitTests/FindRootsTests.fs +++ b/src/FSharpUnitTests/FindRootsTests.fs @@ -1,9 +1,11 @@ namespace MathNet.Numerics.Tests -open System -open MathNet.Numerics open NUnit.Framework open FsUnit +open FsUnitTyped + +open System +open MathNet.Numerics module FindRootsTests = @@ -19,33 +21,33 @@ module FindRootsTests = [] let ``Bisection should find both roots of (x - 3) * (x - 4)``() = - f |> FindRoots.bisection 100 1e-14 -5.0 3.5 |> should equal (Some 3.0) - f |> FindRoots.bisection 100 1e-14 3.2 5.0 |> should equal (Some 4.0) + f |> FindRoots.bisection 100 1e-14 -5.0 3.5 |> shouldEqual (Some 3.0) + f |> FindRoots.bisection 100 1e-14 3.2 5.0 |> shouldEqual (Some 4.0) [] let ``Brent should find both roots of (x - 3) * (x - 4)``() = - f |> FindRoots.brent 100 1e-14 -5.0 3.5 |> should equal (Some 3.0) - f |> FindRoots.brent 100 1e-14 3.2 5.0 |> should equal (Some 4.0) + f |> FindRoots.brent 100 1e-14 -5.0 3.5 |> shouldEqual (Some 3.0) + f |> FindRoots.brent 100 1e-14 3.2 5.0 |> shouldEqual (Some 4.0) [] let ``Newton-Raphson should find both roots of (x - 3) * (x - 4)``() = - (f, df) ||> FindRoots.newtonRaphson 100 1e-14 -5.0 3.5 |> should equal (Some 3.0) - (f, df) ||> FindRoots.newtonRaphson 100 1e-14 3.2 5.0 |> should equal (Some 4.0) + (f, df) ||> FindRoots.newtonRaphson 100 1e-14 -5.0 3.5 |> shouldEqual (Some 3.0) + (f, df) ||> FindRoots.newtonRaphson 100 1e-14 3.2 5.0 |> shouldEqual (Some 4.0) [] let ``Newton-Raphson by Guess should find both roots of (x - 3) * (x - 4)``() = - (f, df) ||> FindRoots.newtonRaphsonGuess 100 1e-14 2.8 |> should equal (Some 3.0) - (f, df) ||> FindRoots.newtonRaphsonGuess 100 1e-14 3.7 |> should equal (Some 4.0) + (f, df) ||> FindRoots.newtonRaphsonGuess 100 1e-14 2.8 |> shouldEqual (Some 3.0) + (f, df) ||> FindRoots.newtonRaphsonGuess 100 1e-14 3.7 |> shouldEqual (Some 4.0) [] let ``Robust Newton-Raphson should find both roots of (x - 3) * (x - 4)``() = - (f, df) ||> FindRoots.newtonRaphsonRobust 100 20 1e-14 -5.0 3.5 |> should equal (Some 3.0) - (f, df) ||> FindRoots.newtonRaphsonRobust 100 20 1e-14 3.2 5.0 |> should equal (Some 4.0) + (f, df) ||> FindRoots.newtonRaphsonRobust 100 20 1e-14 -5.0 3.5 |> shouldEqual (Some 3.0) + (f, df) ||> FindRoots.newtonRaphsonRobust 100 20 1e-14 3.2 5.0 |> shouldEqual (Some 4.0) [] let ``Bryoden should find both roots of (x - 3) * (x - 4) and Twoeq2``() = - f |> (fun g (x:float[]) -> [|g x.[0]|]) |> FindRoots.broyden 100 1e-14 [|1.0;|] |> should equal (Some [|3.0|]) - f |> (fun g (x:float[]) -> [|g x.[0]|]) |> FindRoots.broyden 100 1e-14 [|9.0;|] |> should equal (Some [|4.0|]) + f |> (fun g (x:float[]) -> [|g x.[0]|]) |> FindRoots.broyden 100 1e-14 [|1.0;|] |> shouldEqual (Some [|3.0|]) + f |> (fun g (x:float[]) -> [|g x.[0]|]) |> FindRoots.broyden 100 1e-14 [|9.0;|] |> shouldEqual (Some [|4.0|]) g |> FindRoots.broyden 100 1e-6 [|1.0; 400.0;|] |> (fun x -> match x with | Some x -> should (equalWithin 1e-1) [|0.9638680512795; 346.16369814640|] diff --git a/src/FSharpUnitTests/FitTests.fs b/src/FSharpUnitTests/FitTests.fs index 7bff82c8..80243139 100644 --- a/src/FSharpUnitTests/FitTests.fs +++ b/src/FSharpUnitTests/FitTests.fs @@ -1,9 +1,11 @@ namespace MathNet.Numerics.Tests -open System -open MathNet.Numerics open NUnit.Framework open FsUnit +open FsUnitTyped + +open System +open MathNet.Numerics module FitTests = diff --git a/src/FSharpUnitTests/MatrixTests.fs b/src/FSharpUnitTests/MatrixTests.fs index e78bdbbd..a2afd8c6 100644 --- a/src/FSharpUnitTests/MatrixTests.fs +++ b/src/FSharpUnitTests/MatrixTests.fs @@ -2,6 +2,8 @@ open NUnit.Framework open FsUnit +open FsUnitTyped + open MathNet.Numerics.LinearAlgebra /// Unit tests for the matrix type. @@ -21,85 +23,85 @@ module MatrixTests = [] let ``Matrix.GetSlice`` () = - largeM.[*,*] |> should equal largeM - largeM.[0..99,0..99] |> should equal largeM - largeM.[1..2,1..2] |> should equal (DenseMatrix.raw 2 2 [|101.;201.;102.;202.|]) - largeM.[98..,98..] |> should equal (DenseMatrix.raw 2 2 [|9898.;9998.;9899.;9999.|]) - largeM.[..1,..1] |> should equal (DenseMatrix.raw 2 2 [|0.;100.;1.;101.|]) + largeM.[*,*] |> shouldEqual largeM + largeM.[0..99,0..99] |> shouldEqual largeM + largeM.[1..2,1..2] |> shouldEqual (DenseMatrix.raw 2 2 [|101.;201.;102.;202.|]) + largeM.[98..,98..] |> shouldEqual (DenseMatrix.raw 2 2 [|9898.;9998.;9899.;9999.|]) + largeM.[..1,..1] |> shouldEqual (DenseMatrix.raw 2 2 [|0.;100.;1.;101.|]) [] let ``Matrix.SetSlice`` () = let m = DenseMatrix.init 2 2 (fun i j -> float i * 100.0 + float j) in m.[*,*] <- matrix [[5.;7.];[6.;8.]]; - m |> should equal (DenseMatrix.raw 2 2 [|5.;6.;7.;8.|]) + m |> shouldEqual (DenseMatrix.raw 2 2 [|5.;6.;7.;8.|]) let m = DenseMatrix.init 2 2 (fun i j -> float i * 100.0 + float j) in m.[0..1,0..1] <-matrix [[5.;7.];[6.;8.]]; - m |> should equal (DenseMatrix.raw 2 2 [|5.;6.;7.;8.|]) + m |> shouldEqual (DenseMatrix.raw 2 2 [|5.;6.;7.;8.|]) let m = DenseMatrix.init 4 4 (fun i j -> float i * 100.0 + float j) in m.[1..2,1..2] <- matrix [[5.;7.];[6.;8.]]; - m |> should equal (DenseMatrix.raw 4 4 [|0.;100.;200.;300.;1.;5.;6.;301.;2.;7.;8.;302.;3.;103.;203.;303.|]) + m |> shouldEqual (DenseMatrix.raw 4 4 [|0.;100.;200.;300.;1.;5.;6.;301.;2.;7.;8.;302.;3.;103.;203.;303.|]) let m = DenseMatrix.init 4 4 (fun i j -> float i * 100.0 + float j) in m.[2..,..1] <- matrix [[5.;7.];[6.;8.]]; - m |> should equal (DenseMatrix.raw 4 4 [|0.;100.;5.;6.;1.;101.;7.;8.;2.;102.;202.;302.;3.;103.;203.;303.|]) + m |> shouldEqual (DenseMatrix.raw 4 4 [|0.;100.;5.;6.;1.;101.;7.;8.;2.;102.;202.;302.;3.;103.;203.;303.|]) let m = DenseMatrix.init 4 4 (fun i j -> float i * 100.0 + float j) in m.[..1,2..] <- matrix [[5.;7.];[6.;8.]]; - m |> should equal (DenseMatrix.raw 4 4 [|0.;100.;200.;300.;1.;101.;201.;301.;5.;6.;202.;302.;7.;8.;203.;303.|]) + m |> shouldEqual (DenseMatrix.raw 4 4 [|0.;100.;200.;300.;1.;101.;201.;301.;5.;6.;202.;302.;7.;8.;203.;303.|]) [] let ``Matrix.toArray2`` () = - Matrix.toArray2 smallM |> should equal (Array2D.create 2 2 0.3) + Matrix.toArray2 smallM |> shouldEqual (Array2D.create 2 2 0.3) [] let ``Matrix.mapInPlace.Dense`` () = let M = largeM.Clone() M |> Matrix.mapInPlace (fun x -> 3.0 * x) - M |> should equal (3.0 * largeM) + M |> shouldEqual (3.0 * largeM) [] let ``Matrix.mapInPlace.Sparse`` () = let M = sparseM.Clone() M |> Matrix.mapInPlace (fun x -> 3.0 * x) - M |> should equal (3.0 * sparseM) + M |> shouldEqual (3.0 * sparseM) [] let ``Matrix.mapSkipZerosInPlace.Sparse`` () = let M = sparseM.Clone() M |> Matrix.mapSkipZerosInPlace (fun x -> 3.0 * x) - M |> should equal (3.0 * sparseM) + M |> shouldEqual (3.0 * sparseM) [] let ``Matrix.mapiInPlace.Dense`` () = let M = largeM.Clone() M |> Matrix.mapiInPlace (fun i j x -> 2.0 * (float i * 100.0 + float j) + x) - M |> should equal (3.0 * largeM) + M |> shouldEqual (3.0 * largeM) [] let ``Matrix.mapiInPlace.Sparse`` () = let M = sparseM.Clone() M |> Matrix.mapiInPlace (fun i j x -> if i=j then 2.0*x+1.0 else 2.0*x) - M |> should equal (2.0 * sparseM + SparseMatrix.init 2 3 (fun i j -> if i=j then 1.0 else 0.0)) + M |> shouldEqual (2.0 * sparseM + SparseMatrix.init 2 3 (fun i j -> if i=j then 1.0 else 0.0)) [] let ``Matrix.mapiSkipZerosInPlace.Sparse`` () = let M = sparseM.Clone() M |> Matrix.mapiSkipZerosInPlace (fun i j x -> 2.0*x) - M |> should equal (2.0 * sparseM) + M |> shouldEqual (2.0 * sparseM) [] let ``Matrix.map`` () = - Matrix.map (fun x -> 2.0 * x) smallM |> should equal (2.0 * smallM) + Matrix.map (fun x -> 2.0 * x) smallM |> shouldEqual (2.0 * smallM) [] let ``Matrix.mapSkipZeros`` () = - Matrix.mapSkipZeros (fun x -> 2.0 * x) smallM |> should equal (2.0 * smallM) + Matrix.mapSkipZeros (fun x -> 2.0 * x) smallM |> shouldEqual (2.0 * smallM) [] let ``Matrix.mapi`` () = - Matrix.mapi (fun i j x -> float i * 100.0 + float j + x) largeM |> should equal (2.0 * largeM) + Matrix.mapi (fun i j x -> float i * 100.0 + float j + x) largeM |> shouldEqual (2.0 * largeM) [] let ``Matrix.mapiSkipZeros`` () = - Matrix.mapiSkipZeros (fun i j x -> float i * 100.0 + float j + x) largeM |> should equal (2.0 * largeM) + Matrix.mapiSkipZeros (fun i j x -> float i * 100.0 + float j + x) largeM |> shouldEqual (2.0 * largeM) [] let ``Matrix.mapCols`` () = @@ -111,80 +113,80 @@ module MatrixTests = [] let ``Matrix.fold`` () = - Matrix.fold (fun a b -> a - b) 0.0 smallM |> should equal -1.2 + Matrix.fold (fun a b -> a - b) 0.0 smallM |> shouldEqual -1.2 [] let ``Matrix.foldBack`` () = - Matrix.foldBack (fun a b -> a - b) 0.0 smallM |> should equal 0.0 + Matrix.foldBack (fun a b -> a - b) 0.0 smallM |> shouldEqual 0.0 [] let ``Matrix.foldBackSummation`` () = - Matrix.foldBack( fun a b -> a + b) 0.0 failingFoldBackM |> should equal 6.0 + Matrix.foldBack( fun a b -> a + b) 0.0 failingFoldBackM |> shouldEqual 6.0 [] let ``Matrix.foldi`` () = - Matrix.foldi (fun i j acc x -> acc + x + float (i+j)) 0.0 smallM |> should equal 5.2 + Matrix.foldi (fun i j acc x -> acc + x + float (i+j)) 0.0 smallM |> shouldEqual 5.2 [] let ``Matrix.forall`` () = - Matrix.forall (fun x -> x = 0.3) smallM |> should equal true + Matrix.forall (fun x -> x = 0.3) smallM |> shouldEqual true [] let ``Matrix.exists`` () = - Matrix.exists (fun x -> x = 0.5) smallM |> should equal false + Matrix.exists (fun x -> x = 0.5) smallM |> shouldEqual false [] let ``Matrix.foralli`` () = - Matrix.foralli (fun i j x -> x = float i * 100.0 + float j) largeM |> should equal true + Matrix.foralli (fun i j x -> x = float i * 100.0 + float j) largeM |> shouldEqual true [] let ``Matrix.existsi`` () = - Matrix.existsi (fun i j x -> x = float i * 100.0 + float j) largeM |> should equal true + Matrix.existsi (fun i j x -> x = float i * 100.0 + float j) largeM |> shouldEqual true [] let ``Matrix.inplaceAssign`` () = let N = smallM.Clone() N |> Matrix.inplaceAssign (fun i j -> 0.0) - N |> should equal (0.0 * smallM) + N |> shouldEqual (0.0 * smallM) [] let ``Matrix.toSeqSkipZeros`` () = - Seq.length (Matrix.toSeqSkipZeros smallM) |> should equal 4 + Seq.length (Matrix.toSeqSkipZeros smallM) |> shouldEqual 4 [] let ``Matrix.sum`` () = - Matrix.sum smallM |> should equal 1.2 + Matrix.sum smallM |> shouldEqual 1.2 [] let ``Matrix.sumColsBy`` () = - Matrix.sumColsBy (fun j col -> col.[0] * col.[1]) (matrix [[1.0; 2.0]; [3.0; 4.0]]) |> should equal 11.0 + Matrix.sumColsBy (fun j col -> col.[0] * col.[1]) (matrix [[1.0; 2.0]; [3.0; 4.0]]) |> shouldEqual 11.0 [] let ``Matrix.sumRowsBy`` () = - Matrix.sumRowsBy (fun i row -> row.[0] * row.[1]) (matrix [[1.0; 2.0]; [3.0; 4.0]]) |> should equal 14.0 + Matrix.sumRowsBy (fun i row -> row.[0] * row.[1]) (matrix [[1.0; 2.0]; [3.0; 4.0]]) |> shouldEqual 14.0 [] let ``Matrix.foldCol`` () = - Matrix.foldCol (+) 0.0 largeM 0 |> should equal 495000.0 + Matrix.foldCol (+) 0.0 largeM 0 |> shouldEqual 495000.0 [] let ``Matrix.foldRow`` () = - Matrix.foldRow (+) 0.0 largeM 0 |> should equal 4950.0 + Matrix.foldRow (+) 0.0 largeM 0 |> shouldEqual 4950.0 [] let ``Matrix.foldByCol`` () = - Matrix.foldByCol (+) 0.0 smallM |> should equal (DenseVector.ofList [0.6;0.6]) + Matrix.foldByCol (+) 0.0 smallM |> shouldEqual (DenseVector.ofList [0.6;0.6]) [] let ``Matrix.foldByRow`` () = - Matrix.foldByRow (+) 0.0 smallM |> should equal (DenseVector.ofList [0.6;0.6]) + Matrix.foldByRow (+) 0.0 smallM |> shouldEqual (DenseVector.ofList [0.6;0.6]) [] let ``Pointwise Multiplication using .* Operator`` () = let z = largeM .* largeM - z |> should equal (DenseMatrix.init 100 100 (fun i j -> (float i * 100.0 + float j) ** 2.0)) + z |> shouldEqual (DenseMatrix.init 100 100 (fun i j -> (float i * 100.0 + float j) ** 2.0)) [] let ``Pointwise Division using ./ Operator`` () = let z = largeM ./ DenseMatrix.create 100 100 2.0 - z |> should equal (largeM * 0.5) + z |> shouldEqual (largeM * 0.5) diff --git a/src/FSharpUnitTests/PokerTests.fs b/src/FSharpUnitTests/PokerTests.fs index 90aa5880..3fd15cbc 100644 --- a/src/FSharpUnitTests/PokerTests.fs +++ b/src/FSharpUnitTests/PokerTests.fs @@ -5,10 +5,11 @@ #nowarn "25" +open NUnit.Framework +open FsUnitTyped + open MathNet.Numerics open MathNet.Numerics.Probability -open NUnit.Framework -open FsUnit type Rank = int type Suit = | Spades | Hearts | Diamonds | Clubs @@ -39,7 +40,7 @@ let ``When drawing from a full deck, then the probability for an Ace should equa |> RandomVariable.map fst |> RandomVariable.filter (fun card -> value card = A) |> RandomVariable.probability - |> should equal (4N/52N) + |> shouldEqual (4N/52N) [] let ``When drawing from a full deck, then the probability should equal 1/52``() = @@ -48,7 +49,7 @@ let ``When drawing from a full deck, then the probability should equal 1/52``() |> RandomVariable.map fst |> RandomVariable.filter ((=) (A,Spades)) |> RandomVariable.probability - |> should equal (1N/52N) + |> shouldEqual (1N/52N) [] let ``When drawing from a full deck, then the probability for the Ace of Clubs and Ace of Spaces (in order) should equal 1/52 * 1/51``() = @@ -56,7 +57,7 @@ let ``When drawing from a full deck, then the probability for the Ace of Clubs a |> RandomVariable.select 2 |> RandomVariable.filter ((=) [A,Clubs; A,Spades]) |> RandomVariable.probability - |> should equal (1N/52N * 1N/51N) + |> shouldEqual (1N/52N * 1N/51N) [] let ``When drawing from a full deck, then the probability for the Ace of Clubs and Ace of Spaces (in any order) should equal (1/52 * 1/51) * 2``() = @@ -64,7 +65,7 @@ let ``When drawing from a full deck, then the probability for the Ace of Clubs a |> RandomVariable.select 2 |> RandomVariable.filterInAnyOrder [A,Clubs; A,Spades] |> RandomVariable.probability - |> should equal ((1N/52N * 1N/51N) * 2N) + |> shouldEqual ((1N/52N * 1N/51N) * 2N) [] let ``When drawing the Ace of Spades and the Ace of Clubs, then the probability for drawing another Ace should equal 2/50``() = @@ -73,7 +74,7 @@ let ``When drawing the Ace of Spades and the Ace of Clubs, then the probability |> RandomVariable.toUniformDistribution |> RandomVariable.filter (fun card -> value card = A) |> RandomVariable.probability - |> should equal (2N/50N) + |> shouldEqual (2N/50N) [] @@ -82,7 +83,7 @@ let ``When drawing from the full deck, then the probability for drawing a Pair p |> RandomVariable.select 2 |> RandomVariable.filter (fun (c1::c2::_) -> isPair c1 c2) |> RandomVariable.probability - |> should equal (1N/17N) + |> shouldEqual (1N/17N) [] let ``When drawing from the full deck, then the probability for drawing Suited Connectors should equal 1/25``() = @@ -90,7 +91,7 @@ let ``When drawing from the full deck, then the probability for drawing Suited C |> RandomVariable.select 2 |> RandomVariable.filter (fun (c1::c2::_) -> isSuited c1 c2 && isConnected c1 c2) |> RandomVariable.probability - |> should equal (2N/51N) + |> shouldEqual (2N/51N) [] let ``When holding 3 Spades after the flop, than the probability for drawing a flush should equal 10/47*9/46``() = @@ -100,6 +101,6 @@ let ``When holding 3 Spades after the flop, than the probability for drawing a f |> RandomVariable.select 2 |> RandomVariable.filter (fun (c1::c2::_) -> suit c1 = Spades && suit c2 = Spades) |> RandomVariable.probability - |> should equal (10N/47N*9N/46N) + |> shouldEqual (10N/47N*9N/46N) #endif diff --git a/src/FSharpUnitTests/QuaternionTests.fs b/src/FSharpUnitTests/QuaternionTests.fs index 52f64bf4..7841f08f 100644 --- a/src/FSharpUnitTests/QuaternionTests.fs +++ b/src/FSharpUnitTests/QuaternionTests.fs @@ -1,8 +1,9 @@ namespace MathNet.Numerics.Tests -open System open NUnit.Framework -open FsUnit +open FsUnitTyped + +open System open MathNet.Numerics module QuaternionTests = @@ -18,52 +19,52 @@ module QuaternionTests = let ``Quaternion.create`` () = let fourtyFiveDegreesInRadians = 45.0 * Math.PI / 180.0 Quaternion.create fourtyFiveDegreesInRadians 1.0 0.0 0.0 |> - should equal {w = 0.92387953251128674; x = 0.38268343236508978; y = 0.0; z = 0.0;} + shouldEqual {w = 0.92387953251128674; x = 0.38268343236508978; y = 0.0; z = 0.0;} [] let ``Quaternion.create normalizes input vector`` () = let fourtyFiveDegreesInRadians = 45.0 * Math.PI / 180.0 Quaternion.create fourtyFiveDegreesInRadians 100.0 0.0 0.0 |> - should equal <| + shouldEqual <| Quaternion.create fourtyFiveDegreesInRadians 1.0 0.0 0.0 [] let ``Quaternion.+`` () = - n + n' |> should equal {w= 1.5;x= -0.5;y= 1.5;z= 0.0} + n + n' |> shouldEqual {w= 1.5;x= -0.5;y= 1.5;z= 0.0} [] let ``Quaternion.-`` () = - n - n' |> should equal {w= 0.5;x= 0.5;y= 0.5;z= 0.0} + n - n' |> shouldEqual {w= 0.5;x= 0.5;y= 0.5;z= 0.0} [] let ``Quaternion.* r*q'`` () = - r * q |> should equal {w = -8.0; x = -16.0; y = -24.0; z = -2.0;} + r * q |> shouldEqual {w = -8.0; x = -16.0; y = -24.0; z = -2.0;} [] let ``Quaternion.* q*r`` () = - q * r |> should equal {w = -8.0; x = 6.0; y = -4.0; z = -28.0;} + q * r |> shouldEqual {w = -8.0; x = 6.0; y = -4.0; z = -28.0;} //http://www.mathworks.com/help/aerotbx/ug/quatnorm.html [] let ``Quaternion.NormSquared`` () = - Quaternion.normSquared n' |> should equal 0.75 + Quaternion.normSquared n' |> shouldEqual 0.75 //http://www.mathworks.com/help/aerotbx/ug/quatnormalize.html [] let ``Quaternion.Normalize`` () = - Quaternion.normalize n |> should equal {w= 0.70710678118654746; x= 0.0; y= 0.70710678118654746; z= 0.0} + Quaternion.normalize n |> shouldEqual {w= 0.70710678118654746; x= 0.0; y= 0.70710678118654746; z= 0.0} //http://www.mathworks.com/help/aerotbx/ug/quatinv.html [] let ``Quaternion.Inverse`` () = - Quaternion.inverse n |> should equal {w= 0.5;x= 0.0;y= -0.5;z= 0.0} + Quaternion.inverse n |> shouldEqual {w= 0.5;x= 0.0;y= -0.5;z= 0.0} //http://www.mathworks.com/help/aerotbx/ug/quatconj.html [] let ``Quaternion.Conjugate`` () = - Quaternion.conjugate n |> should equal {w= 1.0;x= 0.0;y= -1.0;z= 0.0} + Quaternion.conjugate n |> shouldEqual {w= 1.0;x= 0.0;y= -1.0;z= 0.0} //http://www.mathworks.com/help/aerotbx/ug/quatrotate.html [] let ``Quaternion.Rotate`` () = - Quaternion.rotate n 1.0 1.0 1.0 |> should equal {w= 0.0;x= -1.0;y= 1.0;z= 1.0} + Quaternion.rotate n 1.0 1.0 1.0 |> shouldEqual {w= 0.0;x= -1.0;y= 1.0;z= 1.0} diff --git a/src/FSharpUnitTests/RandomVariableTests.fs b/src/FSharpUnitTests/RandomVariableTests.fs index b2130220..84707eb5 100644 --- a/src/FSharpUnitTests/RandomVariableTests.fs +++ b/src/FSharpUnitTests/RandomVariableTests.fs @@ -3,15 +3,16 @@ #if NOSYSNUMERICS #else +open NUnit.Framework +open FsUnitTyped + open MathNet.Numerics open MathNet.Numerics.Probability -open NUnit.Framework -open FsUnit [] let ``When creating a empty randomVariable, then the probability should be 1``() = let actual = randomVariable { return () } - RandomVariable.probability actual |> should equal (1N/1N) + RandomVariable.probability actual |> shouldEqual (1N/1N) let sumOfTwoFairDices = randomVariable { let! d1 = RandomVariable.fairDice 6 @@ -23,7 +24,7 @@ let ``When creating two fair dices, then P(Sum of 2 dices = 7) should be 1/6``() sumOfTwoFairDices |> RandomVariable.filter ((=) 7) |> RandomVariable.probability - |> should equal (1N/6N) + |> shouldEqual (1N/6N) let fairCoinAndDice = randomVariable { let! d = RandomVariable.fairDice 6 @@ -35,14 +36,14 @@ let ``When creating a fair coin and a fair dice, then P(Heads) should be 1/2``() fairCoinAndDice |> RandomVariable.filter (fun (_,c) -> c = Heads) |> RandomVariable.probability - |> should equal (1N/2N) + |> shouldEqual (1N/2N) [] let ``When creating a fair coin and a fair dice, then P(Heads and dice > 3) should be 1/4``() = fairCoinAndDice |> RandomVariable.filter (fun (d,c) -> c = Heads && d > 3) |> RandomVariable.probability - |> should equal (1N/4N) + |> shouldEqual (1N/4N) // MontyHall Problem // See Martin Erwig and Steve Kollmansberger's paper @@ -68,7 +69,7 @@ let ``When making the first choice in a MontyHall situation, the chances to win firstChoice |> RandomVariable.filter ((=) Car) |> RandomVariable.probability - |> should equal (1N/3N) + |> shouldEqual (1N/3N) let montyHallWithSwitch = randomVariable { let! firstDoor = firstChoice @@ -79,6 +80,6 @@ let ``When switching in a MontyHall situation, the chances to win should be 2/3` montyHallWithSwitch |> RandomVariable.filter ((=) Car) |> RandomVariable.probability - |> should equal (2N/3N) + |> shouldEqual (2N/3N) #endif diff --git a/src/FSharpUnitTests/SparseMatrixTests.fs b/src/FSharpUnitTests/SparseMatrixTests.fs index 054424c8..e12068d0 100644 --- a/src/FSharpUnitTests/SparseMatrixTests.fs +++ b/src/FSharpUnitTests/SparseMatrixTests.fs @@ -1,7 +1,8 @@ namespace MathNet.Numerics.Tests open NUnit.Framework -open FsUnit +open FsUnitTyped + open MathNet.Numerics.LinearAlgebra /// Unit tests for the sparse matrix type. @@ -12,71 +13,71 @@ module SparseMatrixTests = [] let ``SparseMatrix.zero`` () = - (SparseMatrix.zero 4 6) + smallM |> should equal smallM + (SparseMatrix.zero 4 6) + smallM |> shouldEqual smallM [] let ``SparseMatrix.init`` () = - SparseMatrix.init 4 6 (fun i j -> if i = 1 && j = 2 then 1.0 else 0.0) |> should equal smallM + SparseMatrix.init 4 6 (fun i j -> if i = 1 && j = 2 then 1.0 else 0.0) |> shouldEqual smallM [] let ``SparseMatrix.ofArray2`` () = - SparseMatrix.ofArray2 (array2D [[0.;0.;0.;0.;0.;0.];[0.;0.;1.;0.;0.;0.];[0.;0.;0.;0.;0.;0.];[0.;0.;0.;0.;0.;0.]]) |> should equal smallM - SparseMatrix.ofArray2 (Array2D.init 4 6 (fun i j -> if i = 1 && j = 2 then 1.0 else 0.0)) |> should equal smallM + SparseMatrix.ofArray2 (array2D [[0.;0.;0.;0.;0.;0.];[0.;0.;1.;0.;0.;0.];[0.;0.;0.;0.;0.;0.];[0.;0.;0.;0.;0.;0.]]) |> shouldEqual smallM + SparseMatrix.ofArray2 (Array2D.init 4 6 (fun i j -> if i = 1 && j = 2 then 1.0 else 0.0)) |> shouldEqual smallM [] let ``SparseMatrix.ofMatrixArray2`` () = let a = SparseMatrix.ofMatrixArray2 (array2D [[smallM;smallM];[smallM;smallM];[smallM;smallM]]) - a.[0..3,0..5] |> should equal smallM - a.[4..7,6..11] |> should equal smallM - a.[8..11,0..5] |> should equal smallM + a.[0..3,0..5] |> shouldEqual smallM + a.[4..7,6..11] |> shouldEqual smallM + a.[8..11,0..5] |> shouldEqual smallM [] let ``SparseMatrix.ofMatrixList2`` () = let a = SparseMatrix.ofMatrixList2 [[smallM; smallM]; [smallM; smallM]; [smallM; smallM]] - a.[0..3,0..5] |> should equal smallM - a.[4..7,6..11] |> should equal smallM - a.[8..11,0..5] |> should equal smallM + a.[0..3,0..5] |> shouldEqual smallM + a.[4..7,6..11] |> shouldEqual smallM + a.[8..11,0..5] |> shouldEqual smallM [] let ``SparseMatrix.ofRowSeq`` () = - SparseMatrix.ofRowSeq (Seq.ofList [[0.;0.;0.;0.;0.;0.];[0.;0.;1.;0.;0.;0.];[0.;0.;0.;0.;0.;0.];[0.;0.;0.;0.;0.;0.]]) |> should equal smallM + SparseMatrix.ofRowSeq (Seq.ofList [[0.;0.;0.;0.;0.;0.];[0.;0.;1.;0.;0.;0.];[0.;0.;0.;0.;0.;0.];[0.;0.;0.;0.;0.;0.]]) |> shouldEqual smallM [] let ``SparseMatrix.ofRowList`` () = - SparseMatrix.ofRowList [[0.;0.;0.;0.;0.;0.];[0.;0.;1.;0.;0.;0.];[0.;0.;0.;0.;0.;0.];[0.;0.;0.;0.;0.;0.]] |> should equal smallM + SparseMatrix.ofRowList [[0.;0.;0.;0.;0.;0.];[0.;0.;1.;0.;0.;0.];[0.;0.;0.;0.;0.;0.];[0.;0.;0.;0.;0.;0.]] |> shouldEqual smallM [] let ``SparseMatrix.ofColumnSeq`` () = - SparseMatrix.ofColumnSeq (Seq.ofList [[0.;0.;0.;0.];[0.;0.;0.;0.];[0.;1.;0.;0.];[0.;0.;0.;0.];[0.;0.;0.;0.];[0.;0.;0.;0.]]) |> should equal smallM + SparseMatrix.ofColumnSeq (Seq.ofList [[0.;0.;0.;0.];[0.;0.;0.;0.];[0.;1.;0.;0.];[0.;0.;0.;0.];[0.;0.;0.;0.];[0.;0.;0.;0.]]) |> shouldEqual smallM [] let ``SparseMatrix.ofColumnList`` () = - SparseMatrix.ofColumnList [[0.;0.;0.;0.];[0.;0.;0.;0.];[0.;1.;0.;0.];[0.;0.;0.;0.];[0.;0.;0.;0.];[0.;0.;0.;0.]] |> should equal smallM + SparseMatrix.ofColumnList [[0.;0.;0.;0.];[0.;0.;0.;0.];[0.;1.;0.;0.];[0.;0.;0.;0.];[0.;0.;0.;0.];[0.;0.;0.;0.]] |> shouldEqual smallM [] let ``SparseMatrix.ofSeqi`` () = - SparseMatrix.ofSeqi 4 6 (Seq.ofList [(1,2,1.0)]) |> should equal smallM + SparseMatrix.ofSeqi 4 6 (Seq.ofList [(1,2,1.0)]) |> shouldEqual smallM [] let ``SparseMatrix.ofListi`` () = - SparseMatrix.ofListi 4 6 [(1,2,1.0)] |> should equal smallM + SparseMatrix.ofListi 4 6 [(1,2,1.0)] |> shouldEqual smallM [] let ``SparseMatrix.diag`` () = - SparseMatrix.diag 100 2.0 |> should equal (2.0 * (SparseMatrix.identity 100)) + SparseMatrix.diag 100 2.0 |> shouldEqual (2.0 * (SparseMatrix.identity 100)) [] let ``SparseMatrix.diag2`` () = - SparseMatrix.diag2 100 120 2.0 |> should equal (2.0 * (SparseMatrix.identity2 100 120)) + SparseMatrix.diag2 100 120 2.0 |> shouldEqual (2.0 * (SparseMatrix.identity2 100 120)) [] let ``SparseMatrix.ofDiag`` () = - SparseMatrix.ofDiag (DenseVector.init 100 (fun i -> 2.0)) |> should equal (2.0 * (SparseMatrix.identity 100)) + SparseMatrix.ofDiag (DenseVector.init 100 (fun i -> 2.0)) |> shouldEqual (2.0 * (SparseMatrix.identity 100)) [] let ``SparseMatrix.init_row`` () = - SparseMatrix.initRows 4 (fun i -> if i=1 then DenseVector.raw [|0.;0.;1.;0.;0.;0.|] else DenseVector.zero 6) |> should equal smallM + SparseMatrix.initRows 4 (fun i -> if i=1 then DenseVector.raw [|0.;0.;1.;0.;0.;0.|] else DenseVector.zero 6) |> shouldEqual smallM [] let ``SparseMatrix.init_col`` () = - SparseMatrix.initColumns 6 (fun j -> if j=2 then DenseVector.raw [|0.;1.;0.;0.|] else DenseVector.zero 4) |> should equal smallM + SparseMatrix.initColumns 6 (fun j -> if j=2 then DenseVector.raw [|0.;1.;0.;0.|] else DenseVector.zero 4) |> shouldEqual smallM diff --git a/src/FSharpUnitTests/SparseVectorTests.fs b/src/FSharpUnitTests/SparseVectorTests.fs index f50bb88d..9bebd841 100644 --- a/src/FSharpUnitTests/SparseVectorTests.fs +++ b/src/FSharpUnitTests/SparseVectorTests.fs @@ -1,7 +1,8 @@ namespace MathNet.Numerics.Tests open NUnit.Framework -open FsUnit +open FsUnitTyped + open MathNet.Numerics.LinearAlgebra /// Unit tests for the sparse vector type. @@ -11,7 +12,7 @@ module SparseVectorTests = let smallv = DenseVector.raw [|0.0;0.3;0.0;0.0;0.0|] [] - let ``SparseVector.ofListi`` () = SparseVector.ofListi 5 [ (1,0.3) ] |> should equal smallv + let ``SparseVector.ofListi`` () = SparseVector.ofListi 5 [ (1,0.3) ] |> shouldEqual smallv [] - let ``SparseVector.ofSeqi`` () = SparseVector.ofSeqi 5 (List.toSeq [ (1,0.3) ]) |> should equal smallv + let ``SparseVector.ofSeqi`` () = SparseVector.ofSeqi 5 (List.toSeq [ (1,0.3) ]) |> shouldEqual smallv diff --git a/src/FSharpUnitTests/Utilities.fs b/src/FSharpUnitTests/Utilities.fs index 9b1337f1..647e57e5 100644 --- a/src/FSharpUnitTests/Utilities.fs +++ b/src/FSharpUnitTests/Utilities.fs @@ -8,7 +8,7 @@ open System.Collections.Generic [] module Utilities = - let test msg b = Assert.IsTrue(b, "MiniTest '" + msg + "'") + let test msg (b:bool) = Assert.IsTrue(b, "MiniTest '" + msg + "'") let logMessage msg = () // System.Console.WriteLine("LOG:" + msg) // System.Diagnostics.Trace.WriteLine("LOG:" + msg) diff --git a/src/FSharpUnitTests/VectorTests.fs b/src/FSharpUnitTests/VectorTests.fs index 5470a763..6c55127b 100644 --- a/src/FSharpUnitTests/VectorTests.fs +++ b/src/FSharpUnitTests/VectorTests.fs @@ -2,6 +2,8 @@ open NUnit.Framework open FsUnit +open FsUnitTyped + open MathNet.Numerics.LinearAlgebra /// Unit tests for the vector type. @@ -20,11 +22,11 @@ module VectorTests = [] let ``Vector.GetSlice`` () = - largev.[*] |> should equal largev - largev.[0..99] |> should equal largev - largev.[1..3] |> should equal (DenseVector.raw [|0.01;0.02;0.03|]) - largev.[97..] |> should equal (DenseVector.raw [|0.97;0.98;0.99|]) - largev.[..4] |> should equal (DenseVector.raw [|0.00;0.01;0.02;0.03;0.04|]) + largev.[*] |> shouldEqual largev + largev.[0..99] |> shouldEqual largev + largev.[1..3] |> shouldEqual (DenseVector.raw [|0.01;0.02;0.03|]) + largev.[97..] |> shouldEqual (DenseVector.raw [|0.97;0.98;0.99|]) + largev.[..4] |> shouldEqual (DenseVector.raw [|0.00;0.01;0.02;0.03;0.04|]) #if NOFSSLICESET1D #else @@ -33,120 +35,120 @@ module VectorTests = let ``Vector.SetSlice`` () = let v = smallv.Clone() in v.[*] <- vector [0.1;0.2;0.3;0.4;0.5]; - v |> should equal (DenseVector.raw [|0.1;0.2;0.3;0.4;0.5|]) + v |> shouldEqual (DenseVector.raw [|0.1;0.2;0.3;0.4;0.5|]) let v = smallv.Clone() in v.[0..4] <- vector [0.1;0.2;0.3;0.4;0.5]; - v |> should equal (DenseVector.raw [|0.1;0.2;0.3;0.4;0.5|]) + v |> shouldEqual (DenseVector.raw [|0.1;0.2;0.3;0.4;0.5|]) let v = smallv.Clone() in v.[1..3] <- vector [7.0;8.0;9.0]; - v |> should equal (DenseVector.raw [|0.3;7.0;8.0;9.0;0.3|]) + v |> shouldEqual (DenseVector.raw [|0.3;7.0;8.0;9.0;0.3|]) let v = smallv.Clone() in v.[2..] <- vector [7.0;8.0;9.0]; - v |> should equal (DenseVector.raw [|0.3;0.3;7.0;8.0;9.0|]) + v |> shouldEqual (DenseVector.raw [|0.3;0.3;7.0;8.0;9.0|]) let v = smallv.Clone() in v.[..2] <- vector [7.0;8.0;9.0]; - v |> should equal (DenseVector.raw [|7.0;8.0;9.0;0.3;0.3|]) + v |> shouldEqual (DenseVector.raw [|7.0;8.0;9.0;0.3;0.3|]) #endif [] let ``Vector.toArray`` () = - Vector.toArray smallv |> should equal [|0.3;0.3;0.3;0.3;0.3|] + Vector.toArray smallv |> shouldEqual [|0.3;0.3;0.3;0.3;0.3|] [] let ``Vector.toList`` () = - Vector.toList smallv |> should equal [0.3;0.3;0.3;0.3;0.3] + Vector.toList smallv |> shouldEqual [0.3;0.3;0.3;0.3;0.3] [] let ``Vector.mapInPlace.Dense`` () = let w = smallv.Clone() w |> Vector.mapInPlace (fun x -> 2.0 * x) - w |> should equal (2.0 * smallv) + w |> shouldEqual (2.0 * smallv) [] let ``Vector.mapInPlace.Sparse`` () = let w = sparsev.Clone() w |> Vector.mapInPlace (fun x -> 2.0 * x) - w |> should equal (2.0 * sparsev) + w |> shouldEqual (2.0 * sparsev) [] let ``Vector.mapSkipZerosInPlace.Sparse`` () = let w = sparsev.Clone() w |> Vector.mapSkipZerosInPlace (fun x -> 2.0 * x) - w |> should equal (2.0 * sparsev) + w |> shouldEqual (2.0 * sparsev) [] let ``Vector.mapiInPlace.Dense`` () = let w = largev.Clone() w |> Vector.mapiInPlace (fun i x -> float i / 100.0) - w |> should equal (largev) + w |> shouldEqual (largev) [] let ``Vector.mapiInPlace.Sparse`` () = let w = sparsev.Clone() w |> Vector.mapiInPlace (fun i x -> 2.0 * float i * x) - w |> should equal (2.0 * sparsev) + w |> shouldEqual (2.0 * sparsev) [] let ``Vector.mapiSkipZerosInPlace.Sparse`` () = let w = sparsev.Clone() w |> Vector.mapiSkipZerosInPlace (fun i x -> 2.0 * float i * x) - w |> should equal (2.0 * sparsev) + w |> shouldEqual (2.0 * sparsev) [] let ``Vector.addInPlace`` () = let w = largev.Clone() Vector.addInPlace w largev - w |> should equal (2.0 * largev) + w |> shouldEqual (2.0 * largev) [] let ``Vector.subInPlace`` () = let w = largev.Clone() Vector.subInPlace w largev - w |> should equal (0.0 * largev) + w |> shouldEqual (0.0 * largev) [] let ``Vector.map`` () = - Vector.map (fun x -> 2.0 * x) largev |> should equal (2.0 * largev) + Vector.map (fun x -> 2.0 * x) largev |> shouldEqual (2.0 * largev) [] let ``Vector.mapSkipZeros`` () = - Vector.mapSkipZeros (fun x -> 2.0 * x) largev |> should equal (2.0 * largev) + Vector.mapSkipZeros (fun x -> 2.0 * x) largev |> shouldEqual (2.0 * largev) [] let ``Vector.mapi`` () = - Vector.mapi (fun i x -> float i / 100.0) largev |> should equal largev + Vector.mapi (fun i x -> float i / 100.0) largev |> shouldEqual largev [] let ``Vector.mapiSkipZeros`` () = - Vector.mapiSkipZeros (fun i x -> float i / 100.0) largev |> should equal largev + Vector.mapiSkipZeros (fun i x -> float i / 100.0) largev |> shouldEqual largev [] let ``Vector.fold`` () = - Vector.fold (fun a b -> a - b) 0.0 smallv |> should equal -1.5 + Vector.fold (fun a b -> a - b) 0.0 smallv |> shouldEqual -1.5 [] let ``Vector.foldBack`` () = - Vector.foldBack (fun a b -> a - b) 0.0 smallv |> should equal 0.0 + Vector.foldBack (fun a b -> a - b) 0.0 smallv |> shouldEqual 0.0 [] let ``Vector.foldi`` () = - Vector.foldi (fun i a b -> a + b) 0.0 smallv |> should equal 1.5 + Vector.foldi (fun i a b -> a + b) 0.0 smallv |> shouldEqual 1.5 [] let ``Vector.forall`` () = - Vector.forall (fun x -> x = 0.3) smallv |> should equal true + Vector.forall (fun x -> x = 0.3) smallv |> shouldEqual true [] let ``Vector.exists`` () = - Vector.exists (fun x -> x = 0.3) smallv |> should equal true + Vector.exists (fun x -> x = 0.3) smallv |> shouldEqual true [] let ``Vector.foralli`` () = - Vector.foralli (fun i x -> x = 0.3 && i < 5) smallv |> should equal true + Vector.foralli (fun i x -> x = 0.3 && i < 5) smallv |> shouldEqual true [] let ``Vector.existsi`` () = - Vector.existsi (fun i x -> x = 0.3 && i = 2) smallv |> should equal true + Vector.existsi (fun i x -> x = 0.3 && i = 2) smallv |> shouldEqual true [] let ``Vector.scan`` () = diff --git a/src/FSharpUnitTests/paket.references b/src/FSharpUnitTests/paket.references index 6be00a71..eeeffdf9 100644 --- a/src/FSharpUnitTests/paket.references +++ b/src/FSharpUnitTests/paket.references @@ -1,3 +1,6 @@ +File:FsUnit.fs +File:FsUnitTyped.fs + group Test - FsUnit + NUnit FSharp.Core diff --git a/src/UnitTests/ArrayHelpers.cs b/src/UnitTests/ArrayHelpers.cs index 1e599ae4..53e8a427 100644 --- a/src/UnitTests/ArrayHelpers.cs +++ b/src/UnitTests/ArrayHelpers.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 diff --git a/src/UnitTests/AssertHelpers.cs b/src/UnitTests/AssertHelpers.cs index 7467c09e..af4f10e1 100644 --- a/src/UnitTests/AssertHelpers.cs +++ b/src/UnitTests/AssertHelpers.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,9 +27,11 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System.Collections.Generic; using MathNet.Numerics.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests { diff --git a/src/UnitTests/CombinatoricsTests/CombinatoricsCountingTest.cs b/src/UnitTests/CombinatoricsTests/CombinatoricsCountingTest.cs index f9daadd8..6600df87 100644 --- a/src/UnitTests/CombinatoricsTests/CombinatoricsCountingTest.cs +++ b/src/UnitTests/CombinatoricsTests/CombinatoricsCountingTest.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,9 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + +using NUnitFramework.NUnit.Framework; + namespace MathNet.Numerics.UnitTests.CombinatoricsTests { - using NUnit.Framework; /// /// Combinatorics counting tests. diff --git a/src/UnitTests/ComplexTests/Complex32Test.TextHandling.cs b/src/UnitTests/ComplexTests/Complex32Test.TextHandling.cs index eb9f8ab5..88882f9b 100644 --- a/src/UnitTests/ComplexTests/Complex32Test.TextHandling.cs +++ b/src/UnitTests/ComplexTests/Complex32Test.TextHandling.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,12 +27,14 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + +using System; +using System.Globalization; +using NUnitFramework.NUnit.Framework; + namespace MathNet.Numerics.UnitTests.ComplexTests { - using System; - using System.Globalization; - using NUnit.Framework; - /// /// Complex32 text handling tests. /// diff --git a/src/UnitTests/ComplexTests/Complex32Test.cs b/src/UnitTests/ComplexTests/Complex32Test.cs index 2a06dd48..2c500554 100644 --- a/src/UnitTests/ComplexTests/Complex32Test.cs +++ b/src/UnitTests/ComplexTests/Complex32Test.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,14 +27,16 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.ComplexTests { #if NOSYSNUMERICS using Complex = Numerics.Complex; -#else +#else using Complex = System.Numerics.Complex; #endif @@ -418,7 +424,7 @@ namespace MathNet.Numerics.UnitTests.ComplexTests } /// /// Can divide without overflow. - /// + /// [Test] public void CanDodgeOverflowDivision() { diff --git a/src/UnitTests/ComplexTests/ComplexTest.TextHandling.cs b/src/UnitTests/ComplexTests/ComplexTest.TextHandling.cs index 06d9722f..2093f8a2 100644 --- a/src/UnitTests/ComplexTests/ComplexTest.TextHandling.cs +++ b/src/UnitTests/ComplexTests/ComplexTest.TextHandling.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,9 +27,11 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Globalization; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.ComplexTests { diff --git a/src/UnitTests/ComplexTests/ComplexTest.cs b/src/UnitTests/ComplexTests/ComplexTest.cs index cc01a1ef..dcacdc48 100644 --- a/src/UnitTests/ComplexTests/ComplexTest.cs +++ b/src/UnitTests/ComplexTests/ComplexTest.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,7 +27,9 @@ // OTHER DEALINGS IN THE SOFTWARE. // -using NUnit.Framework; +extern alias NUnitFramework; + +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.ComplexTests { diff --git a/src/UnitTests/DifferentiationTests/FiniteDifferenceCoefficientsTests.cs b/src/UnitTests/DifferentiationTests/FiniteDifferenceCoefficientsTests.cs index cfdc2099..58becaa2 100644 --- a/src/UnitTests/DifferentiationTests/FiniteDifferenceCoefficientsTests.cs +++ b/src/UnitTests/DifferentiationTests/FiniteDifferenceCoefficientsTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2015 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + +using MathNet.Numerics.Differentiation; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.DifferentiationTests { - using Differentiation; - using NUnit.Framework; [TestFixture, Category("Differentiation")] public class FiniteDifferenceCoefficientsTests @@ -54,7 +60,7 @@ namespace MathNet.Numerics.UnitTests.DifferentiationTests [Test] public void ForwardDifferenceThirdOrderEightPointsTest() { - double[] results = { (double)-967 / 120, (double)638 / 15, (double)-3929 / 40, (double)389 / 3, + double[] results = { (double)-967 / 120, (double)638 / 15, (double)-3929 / 40, (double)389 / 3, (double)-2545 / 24, (double)268 / 5, (double)-1849 / 120, (double)29 / 15 }; var finite = new FiniteDifferenceCoefficients(8); var coeff = finite.GetCoefficients(0, 3); diff --git a/src/UnitTests/DifferentiationTests/NumericalDerivativeTests.cs b/src/UnitTests/DifferentiationTests/NumericalDerivativeTests.cs index 3373ef36..59cae6e1 100644 --- a/src/UnitTests/DifferentiationTests/NumericalDerivativeTests.cs +++ b/src/UnitTests/DifferentiationTests/NumericalDerivativeTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2015 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,11 +27,14 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + +using System; +using MathNet.Numerics.Differentiation; +using NUnitFramework.NUnit.Framework; + namespace MathNet.Numerics.UnitTests.DifferentiationTests { - using System; - using Differentiation; - using NUnit.Framework; [TestFixture, Category("Differentiation")] class NumericalDerivativeTests @@ -88,7 +95,7 @@ namespace MathNet.Numerics.UnitTests.DifferentiationTests Assert.AreEqual(12, df2(0)); - // Original delegate not changed + // Original delegate not changed Assert.AreEqual(18, df(0)); } @@ -131,7 +138,7 @@ namespace MathNet.Numerics.UnitTests.DifferentiationTests //Analytical partial dfdy Func dfdy = (x) => Math.Cos(x[0] * x[1]) * x[0] + 1 / x[0]; - // Current value + // Current value var x1 = new double[] { 3, 3 }; var current = f(x1); @@ -166,7 +173,7 @@ namespace MathNet.Numerics.UnitTests.DifferentiationTests [Test] public void VectorFunction1PartialDerivativeTest() { - Func[] f = + Func[] f = { (x) => Math.Pow(x[0],2) - 3*x[1], (x) => x[1]*x[1] + 2*x[0]*x[1] @@ -184,7 +191,7 @@ namespace MathNet.Numerics.UnitTests.DifferentiationTests [Test] public void VectorFunctionMixedPartialDerivativeTest() { - Func[] f = + Func[] f = { (x) => Math.Pow(x[0],2) - 3*x[1], (x) => x[1]*x[1] + 2*x[0]*x[1] diff --git a/src/UnitTests/DifferentiationTests/NumericalHessianTests.cs b/src/UnitTests/DifferentiationTests/NumericalHessianTests.cs index ff993090..a147ecd2 100644 --- a/src/UnitTests/DifferentiationTests/NumericalHessianTests.cs +++ b/src/UnitTests/DifferentiationTests/NumericalHessianTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2015 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,11 +27,14 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + +using System; +using MathNet.Numerics.Differentiation; +using NUnitFramework.NUnit.Framework; + namespace MathNet.Numerics.UnitTests.DifferentiationTests { - using System; - using Differentiation; - using NUnit.Framework; [TestFixture, Category("Differentiation")] class NumericalHessianTests diff --git a/src/UnitTests/DifferentiationTests/NumericalJacobianTests.cs b/src/UnitTests/DifferentiationTests/NumericalJacobianTests.cs index dacfa507..bd4a84ec 100644 --- a/src/UnitTests/DifferentiationTests/NumericalJacobianTests.cs +++ b/src/UnitTests/DifferentiationTests/NumericalJacobianTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2015 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,11 +27,14 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + +using System; +using MathNet.Numerics.Differentiation; +using NUnitFramework.NUnit.Framework; + namespace MathNet.Numerics.UnitTests.DifferentiationTests { - using System; - using Differentiation; - using NUnit.Framework; [TestFixture, Category("Differentiation")] class NumericalJacobianTests @@ -57,9 +64,9 @@ namespace MathNet.Numerics.UnitTests.DifferentiationTests [Test] public void VectorFunctionJacobianTest() { - Func[] f = + Func[] f = { - (x) => Math.Pow(x[0], 2)*x[1], + (x) => Math.Pow(x[0], 2)*x[1], (x) => 5*x[0] + Math.Sin(x[1]) }; var j = new NumericalJacobian(); diff --git a/src/UnitTests/DistanceTests.cs b/src/UnitTests/DistanceTests.cs index 95745134..ecdf440e 100644 --- a/src/UnitTests/DistanceTests.cs +++ b/src/UnitTests/DistanceTests.cs @@ -1,4 +1,35 @@ -using NUnit.Framework; +// +// Math.NET Numerics, part of the Math.NET Project +// http://numerics.mathdotnet.com +// http://github.com/mathnet/mathnet-numerics +// +// Copyright (c) 2009-2016 Math.NET +// +// 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. +// + +extern alias NUnitFramework; + +using NUnitFramework.NUnit.Framework; using System; namespace MathNet.Numerics.UnitTests diff --git a/src/UnitTests/DistributionTests/CommonDistributionTests.cs b/src/UnitTests/DistributionTests/CommonDistributionTests.cs index 87b9a707..cb7b98eb 100644 --- a/src/UnitTests/DistributionTests/CommonDistributionTests.cs +++ b/src/UnitTests/DistributionTests/CommonDistributionTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2015 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,13 +27,15 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Collections.Generic; using System.Linq; using MathNet.Numerics.Distributions; using MathNet.Numerics.Random; using MathNet.Numerics.Statistics; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.DistributionTests { diff --git a/src/UnitTests/DistributionTests/Continuous/BetaScaledTests.cs b/src/UnitTests/DistributionTests/Continuous/BetaScaledTests.cs index 5cd62ed9..41c3486d 100644 --- a/src/UnitTests/DistributionTests/Continuous/BetaScaledTests.cs +++ b/src/UnitTests/DistributionTests/Continuous/BetaScaledTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2015 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Linq; using MathNet.Numerics.Distributions; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.DistributionTests.Continuous { diff --git a/src/UnitTests/DistributionTests/Continuous/BetaTests.cs b/src/UnitTests/DistributionTests/Continuous/BetaTests.cs index 3e1a7a4a..1f365530 100644 --- a/src/UnitTests/DistributionTests/Continuous/BetaTests.cs +++ b/src/UnitTests/DistributionTests/Continuous/BetaTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Linq; using MathNet.Numerics.Distributions; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.DistributionTests.Continuous { @@ -355,7 +357,7 @@ namespace MathNet.Numerics.UnitTests.DistributionTests.Continuous AssertHelpers.AlmostEqualRelative(pdfln, n.DensityLn(x), 13); AssertHelpers.AlmostEqualRelative(pdfln, Beta.PDFLn(a, b, x), 13); } - + [TestCase(0.0, 0.0, 0.0, 0.5)] [TestCase(0.0, 0.0, 0.5, 0.5)] [TestCase(0.0, 0.0, 1.0, 1.0)] diff --git a/src/UnitTests/DistributionTests/Continuous/CauchyTests.cs b/src/UnitTests/DistributionTests/Continuous/CauchyTests.cs index 8d4cd9b9..3d06c6ce 100644 --- a/src/UnitTests/DistributionTests/Continuous/CauchyTests.cs +++ b/src/UnitTests/DistributionTests/Continuous/CauchyTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Linq; using MathNet.Numerics.Distributions; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.DistributionTests.Continuous { diff --git a/src/UnitTests/DistributionTests/Continuous/ChiSquareTests.cs b/src/UnitTests/DistributionTests/Continuous/ChiSquareTests.cs index 749c794b..82894099 100644 --- a/src/UnitTests/DistributionTests/Continuous/ChiSquareTests.cs +++ b/src/UnitTests/DistributionTests/Continuous/ChiSquareTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Linq; using MathNet.Numerics.Distributions; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.DistributionTests.Continuous { diff --git a/src/UnitTests/DistributionTests/Continuous/ChiTests.cs b/src/UnitTests/DistributionTests/Continuous/ChiTests.cs index 87fb33f5..c9c7830e 100644 --- a/src/UnitTests/DistributionTests/Continuous/ChiTests.cs +++ b/src/UnitTests/DistributionTests/Continuous/ChiTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Linq; using MathNet.Numerics.Distributions; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.DistributionTests.Continuous { diff --git a/src/UnitTests/DistributionTests/Continuous/ContinuousUniformTests.cs b/src/UnitTests/DistributionTests/Continuous/ContinuousUniformTests.cs index 8620e83b..a3e466c4 100644 --- a/src/UnitTests/DistributionTests/Continuous/ContinuousUniformTests.cs +++ b/src/UnitTests/DistributionTests/Continuous/ContinuousUniformTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Linq; using MathNet.Numerics.Distributions; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.DistributionTests.Continuous { diff --git a/src/UnitTests/DistributionTests/Continuous/ErlangTests.cs b/src/UnitTests/DistributionTests/Continuous/ErlangTests.cs index b01dffca..e0d8a6a1 100644 --- a/src/UnitTests/DistributionTests/Continuous/ErlangTests.cs +++ b/src/UnitTests/DistributionTests/Continuous/ErlangTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Linq; using MathNet.Numerics.Distributions; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.DistributionTests.Continuous { diff --git a/src/UnitTests/DistributionTests/Continuous/ExponentialTests.cs b/src/UnitTests/DistributionTests/Continuous/ExponentialTests.cs index 02470fc4..a01b1fc8 100644 --- a/src/UnitTests/DistributionTests/Continuous/ExponentialTests.cs +++ b/src/UnitTests/DistributionTests/Continuous/ExponentialTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Linq; using MathNet.Numerics.Distributions; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.DistributionTests.Continuous { diff --git a/src/UnitTests/DistributionTests/Continuous/FisherSnedecorTests.cs b/src/UnitTests/DistributionTests/Continuous/FisherSnedecorTests.cs index 411b3b1d..0ba3ad06 100644 --- a/src/UnitTests/DistributionTests/Continuous/FisherSnedecorTests.cs +++ b/src/UnitTests/DistributionTests/Continuous/FisherSnedecorTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Linq; using MathNet.Numerics.Distributions; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.DistributionTests.Continuous { diff --git a/src/UnitTests/DistributionTests/Continuous/GammaTests.cs b/src/UnitTests/DistributionTests/Continuous/GammaTests.cs index 2a351a12..a2af70e8 100644 --- a/src/UnitTests/DistributionTests/Continuous/GammaTests.cs +++ b/src/UnitTests/DistributionTests/Continuous/GammaTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Linq; using MathNet.Numerics.Distributions; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.DistributionTests.Continuous { diff --git a/src/UnitTests/DistributionTests/Continuous/InverseGammaTests.cs b/src/UnitTests/DistributionTests/Continuous/InverseGammaTests.cs index 1adc4363..1b716d7e 100644 --- a/src/UnitTests/DistributionTests/Continuous/InverseGammaTests.cs +++ b/src/UnitTests/DistributionTests/Continuous/InverseGammaTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Linq; using MathNet.Numerics.Distributions; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.DistributionTests.Continuous { diff --git a/src/UnitTests/DistributionTests/Continuous/LaplaceTests.cs b/src/UnitTests/DistributionTests/Continuous/LaplaceTests.cs index cfd74405..60987f49 100644 --- a/src/UnitTests/DistributionTests/Continuous/LaplaceTests.cs +++ b/src/UnitTests/DistributionTests/Continuous/LaplaceTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Linq; using MathNet.Numerics.Distributions; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.DistributionTests.Continuous { diff --git a/src/UnitTests/DistributionTests/Continuous/LogNormalTests.cs b/src/UnitTests/DistributionTests/Continuous/LogNormalTests.cs index ddcd8011..a99e6399 100644 --- a/src/UnitTests/DistributionTests/Continuous/LogNormalTests.cs +++ b/src/UnitTests/DistributionTests/Continuous/LogNormalTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Linq; using MathNet.Numerics.Distributions; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.DistributionTests.Continuous { diff --git a/src/UnitTests/DistributionTests/Continuous/NormalTests.cs b/src/UnitTests/DistributionTests/Continuous/NormalTests.cs index 25e83717..0546c04d 100644 --- a/src/UnitTests/DistributionTests/Continuous/NormalTests.cs +++ b/src/UnitTests/DistributionTests/Continuous/NormalTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Linq; using MathNet.Numerics.Distributions; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.DistributionTests.Continuous { diff --git a/src/UnitTests/DistributionTests/Continuous/ParetoTests.cs b/src/UnitTests/DistributionTests/Continuous/ParetoTests.cs index 710cb569..59f2cce2 100644 --- a/src/UnitTests/DistributionTests/Continuous/ParetoTests.cs +++ b/src/UnitTests/DistributionTests/Continuous/ParetoTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Linq; using MathNet.Numerics.Distributions; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.DistributionTests.Continuous { diff --git a/src/UnitTests/DistributionTests/Continuous/RayleighTests.cs b/src/UnitTests/DistributionTests/Continuous/RayleighTests.cs index 614a86da..c7049e37 100644 --- a/src/UnitTests/DistributionTests/Continuous/RayleighTests.cs +++ b/src/UnitTests/DistributionTests/Continuous/RayleighTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Linq; using MathNet.Numerics.Distributions; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.DistributionTests.Continuous { diff --git a/src/UnitTests/DistributionTests/Continuous/StableTests.cs b/src/UnitTests/DistributionTests/Continuous/StableTests.cs index 7d5b6859..55b6ebde 100644 --- a/src/UnitTests/DistributionTests/Continuous/StableTests.cs +++ b/src/UnitTests/DistributionTests/Continuous/StableTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Linq; using MathNet.Numerics.Distributions; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.DistributionTests.Continuous { diff --git a/src/UnitTests/DistributionTests/Continuous/StudentTTests.cs b/src/UnitTests/DistributionTests/Continuous/StudentTTests.cs index 6f284b62..3b278d0d 100644 --- a/src/UnitTests/DistributionTests/Continuous/StudentTTests.cs +++ b/src/UnitTests/DistributionTests/Continuous/StudentTTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Linq; using MathNet.Numerics.Distributions; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.DistributionTests.Continuous { diff --git a/src/UnitTests/DistributionTests/Continuous/TriangularTests.cs b/src/UnitTests/DistributionTests/Continuous/TriangularTests.cs index 9f32ac5a..23299d19 100644 --- a/src/UnitTests/DistributionTests/Continuous/TriangularTests.cs +++ b/src/UnitTests/DistributionTests/Continuous/TriangularTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Linq; using MathNet.Numerics.Distributions; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.DistributionTests.Continuous { @@ -91,11 +93,11 @@ namespace MathNet.Numerics.UnitTests.DistributionTests.Continuous var n = new Triangular(0d, 2d, 1d); Assert.AreEqual("Triangular(Lower = 0, Upper = 2, Mode = 1)", n.ToString()); } - + // Todo: Add tests for: - // - Mean, - // - Entropy, - // - Skewness, + // - Mean, + // - Entropy, + // - Skewness, // - Mode (note: Mode is an input parameter for this distribution), // - Median // - Minimum (should be the same as LowerBound) diff --git a/src/UnitTests/DistributionTests/Continuous/WeibullTests.cs b/src/UnitTests/DistributionTests/Continuous/WeibullTests.cs index be3b7656..d3d490b4 100644 --- a/src/UnitTests/DistributionTests/Continuous/WeibullTests.cs +++ b/src/UnitTests/DistributionTests/Continuous/WeibullTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Linq; using MathNet.Numerics.Distributions; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.DistributionTests.Continuous { diff --git a/src/UnitTests/DistributionTests/Discrete/BernoulliTests.cs b/src/UnitTests/DistributionTests/Discrete/BernoulliTests.cs index 555ea70e..98ead648 100644 --- a/src/UnitTests/DistributionTests/Discrete/BernoulliTests.cs +++ b/src/UnitTests/DistributionTests/Discrete/BernoulliTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,13 +27,15 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + +using System; +using System.Linq; +using MathNet.Numerics.Distributions; +using NUnitFramework.NUnit.Framework; + namespace MathNet.Numerics.UnitTests.DistributionTests.Discrete { - using System; - using System.Linq; - using Distributions; - using NUnit.Framework; - /// /// Bernoulli distribution tests. /// @@ -199,7 +201,7 @@ namespace MathNet.Numerics.UnitTests.DistributionTests.Discrete [Test] public void CanSampleStatic() { - Bernoulli.Sample(new Random(0), 0.3); + Bernoulli.Sample(new System.Random(0), 0.3); } /// @@ -208,7 +210,7 @@ namespace MathNet.Numerics.UnitTests.DistributionTests.Discrete [Test] public void CanSampleSequenceStatic() { - var ied = Bernoulli.Samples(new Random(0), 0.3); + var ied = Bernoulli.Samples(new System.Random(0), 0.3); GC.KeepAlive(ied.Take(5).ToArray()); } @@ -218,7 +220,7 @@ namespace MathNet.Numerics.UnitTests.DistributionTests.Discrete [Test] public void FailSampleStatic() { - Assert.That(() => Bernoulli.Sample(new Random(0), -1.0), Throws.ArgumentException); + Assert.That(() => Bernoulli.Sample(new System.Random(0), -1.0), Throws.ArgumentException); } /// @@ -227,7 +229,7 @@ namespace MathNet.Numerics.UnitTests.DistributionTests.Discrete [Test] public void FailSampleSequenceStatic() { - Assert.That(() => Bernoulli.Samples(new Random(0), -1.0).First(), Throws.ArgumentException); + Assert.That(() => Bernoulli.Samples(new System.Random(0), -1.0).First(), Throws.ArgumentException); } /// diff --git a/src/UnitTests/DistributionTests/Discrete/BinomialTests.cs b/src/UnitTests/DistributionTests/Discrete/BinomialTests.cs index aa4b940b..c1e93c12 100644 --- a/src/UnitTests/DistributionTests/Discrete/BinomialTests.cs +++ b/src/UnitTests/DistributionTests/Discrete/BinomialTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,12 +27,15 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + +using System; +using System.Linq; +using MathNet.Numerics.Distributions; +using NUnitFramework.NUnit.Framework; + namespace MathNet.Numerics.UnitTests.DistributionTests.Discrete { - using System; - using System.Linq; - using Distributions; - using NUnit.Framework; /// /// Binomial distribution tests. @@ -222,7 +225,7 @@ namespace MathNet.Numerics.UnitTests.DistributionTests.Discrete [Test] public void CanSampleStatic() { - Binomial.Sample(new Random(0), 0.3, 5); + Binomial.Sample(new System.Random(0), 0.3, 5); } /// @@ -231,7 +234,7 @@ namespace MathNet.Numerics.UnitTests.DistributionTests.Discrete [Test] public void CanSampleSequenceStatic() { - var ied = Binomial.Samples(new Random(0), 0.3, 5); + var ied = Binomial.Samples(new System.Random(0), 0.3, 5); GC.KeepAlive(ied.Take(5).ToArray()); } @@ -241,7 +244,7 @@ namespace MathNet.Numerics.UnitTests.DistributionTests.Discrete [Test] public void FailSampleStatic() { - Assert.That(() => Binomial.Sample(new Random(0), -1.0, 5), Throws.ArgumentException); + Assert.That(() => Binomial.Sample(new System.Random(0), -1.0, 5), Throws.ArgumentException); } /// @@ -250,7 +253,7 @@ namespace MathNet.Numerics.UnitTests.DistributionTests.Discrete [Test] public void FailSampleSequenceStatic() { - Assert.That(() => Binomial.Samples(new Random(0), -1.0, 5).First(), Throws.ArgumentException); + Assert.That(() => Binomial.Samples(new System.Random(0), -1.0, 5).First(), Throws.ArgumentException); } /// diff --git a/src/UnitTests/DistributionTests/Discrete/CategoricalTests.cs b/src/UnitTests/DistributionTests/Discrete/CategoricalTests.cs index 15bc433e..0bbc64d5 100644 --- a/src/UnitTests/DistributionTests/Discrete/CategoricalTests.cs +++ b/src/UnitTests/DistributionTests/Discrete/CategoricalTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,13 +27,15 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + +using System; +using MathNet.Numerics.Distributions; +using MathNet.Numerics.Statistics; +using NUnitFramework.NUnit.Framework; + namespace MathNet.Numerics.UnitTests.DistributionTests.Discrete { - using System; - using Distributions; - using NUnit.Framework; - using Statistics; - /// /// Categorical distribution tests. /// @@ -209,7 +211,7 @@ namespace MathNet.Numerics.UnitTests.DistributionTests.Discrete [Test] public void CanSampleStatic() { - Categorical.Sample(new Random(0), _largeP); + Categorical.Sample(new System.Random(0), _largeP); } /// @@ -218,7 +220,7 @@ namespace MathNet.Numerics.UnitTests.DistributionTests.Discrete [Test] public void FailSampleStatic() { - Assert.That(() => Categorical.Sample(new Random(0), _badP), Throws.ArgumentException); + Assert.That(() => Categorical.Sample(new System.Random(0), _badP), Throws.ArgumentException); } /// diff --git a/src/UnitTests/DistributionTests/Discrete/ConwayMaxwellPoissonTests.cs b/src/UnitTests/DistributionTests/Discrete/ConwayMaxwellPoissonTests.cs index cbe063a5..cca68842 100644 --- a/src/UnitTests/DistributionTests/Discrete/ConwayMaxwellPoissonTests.cs +++ b/src/UnitTests/DistributionTests/Discrete/ConwayMaxwellPoissonTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,13 +27,15 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + +using System; +using System.Linq; +using MathNet.Numerics.Distributions; +using NUnitFramework.NUnit.Framework; + namespace MathNet.Numerics.UnitTests.DistributionTests.Discrete { - using System; - using System.Linq; - using Distributions; - using NUnit.Framework; - /// /// Conway-Maxwell-Poisson tests. /// diff --git a/src/UnitTests/DistributionTests/Discrete/DiscreteUniformTests.cs b/src/UnitTests/DistributionTests/Discrete/DiscreteUniformTests.cs index c8694aef..5270198e 100644 --- a/src/UnitTests/DistributionTests/Discrete/DiscreteUniformTests.cs +++ b/src/UnitTests/DistributionTests/Discrete/DiscreteUniformTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,12 +27,15 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + +using System; +using System.Linq; +using MathNet.Numerics.Distributions; +using NUnitFramework.NUnit.Framework; + namespace MathNet.Numerics.UnitTests.DistributionTests.Discrete { - using System; - using System.Linq; - using Distributions; - using NUnit.Framework; /// /// Discrete uniform tests. @@ -219,7 +222,7 @@ namespace MathNet.Numerics.UnitTests.DistributionTests.Discrete [Test] public void CanSampleStatic() { - DiscreteUniform.Sample(new Random(0), 0, 10); + DiscreteUniform.Sample(new System.Random(0), 0, 10); } /// @@ -228,7 +231,7 @@ namespace MathNet.Numerics.UnitTests.DistributionTests.Discrete [Test] public void CanSampleSequenceStatic() { - var ied = DiscreteUniform.Samples(new Random(0), 0, 10); + var ied = DiscreteUniform.Samples(new System.Random(0), 0, 10); GC.KeepAlive(ied.Take(5).ToArray()); } @@ -238,7 +241,7 @@ namespace MathNet.Numerics.UnitTests.DistributionTests.Discrete [Test] public void FailSampleStatic() { - Assert.That(() => DiscreteUniform.Sample(new Random(0), 20, 10), Throws.ArgumentException); + Assert.That(() => DiscreteUniform.Sample(new System.Random(0), 20, 10), Throws.ArgumentException); } /// @@ -247,7 +250,7 @@ namespace MathNet.Numerics.UnitTests.DistributionTests.Discrete [Test] public void FailSampleSequenceStatic() { - Assert.That(() => DiscreteUniform.Samples(new Random(0), 20, 10).First(), Throws.ArgumentException); + Assert.That(() => DiscreteUniform.Samples(new System.Random(0), 20, 10).First(), Throws.ArgumentException); } /// diff --git a/src/UnitTests/DistributionTests/Discrete/GeometricTests.cs b/src/UnitTests/DistributionTests/Discrete/GeometricTests.cs index 5af8c9fd..1c936fb1 100644 --- a/src/UnitTests/DistributionTests/Discrete/GeometricTests.cs +++ b/src/UnitTests/DistributionTests/Discrete/GeometricTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,12 +27,15 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + +using System; +using System.Linq; +using MathNet.Numerics.Distributions; +using NUnitFramework.NUnit.Framework; + namespace MathNet.Numerics.UnitTests.DistributionTests.Discrete { - using System; - using System.Linq; - using Distributions; - using NUnit.Framework; /// /// Geometric distribution tests. diff --git a/src/UnitTests/DistributionTests/Discrete/HypergeometricTests.cs b/src/UnitTests/DistributionTests/Discrete/HypergeometricTests.cs index 399fe769..36a52950 100644 --- a/src/UnitTests/DistributionTests/Discrete/HypergeometricTests.cs +++ b/src/UnitTests/DistributionTests/Discrete/HypergeometricTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,12 +27,15 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + +using System; +using System.Linq; +using MathNet.Numerics.Distributions; +using NUnitFramework.NUnit.Framework; + namespace MathNet.Numerics.UnitTests.DistributionTests.Discrete { - using System; - using System.Linq; - using Distributions; - using NUnit.Framework; /// /// Hypergeometric tests. diff --git a/src/UnitTests/DistributionTests/Discrete/NegativeBinomialTests.cs b/src/UnitTests/DistributionTests/Discrete/NegativeBinomialTests.cs index ebb4117a..22d39abf 100644 --- a/src/UnitTests/DistributionTests/Discrete/NegativeBinomialTests.cs +++ b/src/UnitTests/DistributionTests/Discrete/NegativeBinomialTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,13 +27,15 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + +using System; +using System.Linq; +using MathNet.Numerics.Distributions; +using NUnitFramework.NUnit.Framework; + namespace MathNet.Numerics.UnitTests.DistributionTests.Discrete { - using System; - using System.Linq; - using Distributions; - using NUnit.Framework; - /// /// Negative Binomial distribution tests. /// diff --git a/src/UnitTests/DistributionTests/Discrete/PoissonTests.cs b/src/UnitTests/DistributionTests/Discrete/PoissonTests.cs index d50b357e..b2674c47 100644 --- a/src/UnitTests/DistributionTests/Discrete/PoissonTests.cs +++ b/src/UnitTests/DistributionTests/Discrete/PoissonTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,13 +27,15 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + +using System; +using System.Linq; +using MathNet.Numerics.Distributions; +using NUnitFramework.NUnit.Framework; + namespace MathNet.Numerics.UnitTests.DistributionTests.Discrete { - using System; - using System.Linq; - using Distributions; - using NUnit.Framework; - /// /// Poisson distribution tests. /// diff --git a/src/UnitTests/DistributionTests/Discrete/ZipfTests.cs b/src/UnitTests/DistributionTests/Discrete/ZipfTests.cs index 03ee974a..70eadcc4 100644 --- a/src/UnitTests/DistributionTests/Discrete/ZipfTests.cs +++ b/src/UnitTests/DistributionTests/Discrete/ZipfTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,13 +27,15 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + +using System; +using System.Linq; +using MathNet.Numerics.Distributions; +using NUnitFramework.NUnit.Framework; + namespace MathNet.Numerics.UnitTests.DistributionTests.Discrete { - using System; - using System.Linq; - using Distributions; - using NUnit.Framework; - /// /// Zipf law tests. /// diff --git a/src/UnitTests/DistributionTests/Multivariate/DirichletTests.cs b/src/UnitTests/DistributionTests/Multivariate/DirichletTests.cs index c1c656a3..3c49009a 100644 --- a/src/UnitTests/DistributionTests/Multivariate/DirichletTests.cs +++ b/src/UnitTests/DistributionTests/Multivariate/DirichletTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Linq; using MathNet.Numerics.Distributions; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.DistributionTests.Multivariate { diff --git a/src/UnitTests/DistributionTests/Multivariate/InverseWishartTests.cs b/src/UnitTests/DistributionTests/Multivariate/InverseWishartTests.cs index 718e0b22..c5b13f93 100644 --- a/src/UnitTests/DistributionTests/Multivariate/InverseWishartTests.cs +++ b/src/UnitTests/DistributionTests/Multivariate/InverseWishartTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,11 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.Distributions; using MathNet.Numerics.LinearAlgebra; -using MathNet.Numerics.LinearAlgebra.Double; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.DistributionTests.Multivariate { diff --git a/src/UnitTests/DistributionTests/Multivariate/MatrixNormalTests.cs b/src/UnitTests/DistributionTests/Multivariate/MatrixNormalTests.cs index 88ffdd31..43156ea4 100644 --- a/src/UnitTests/DistributionTests/Multivariate/MatrixNormalTests.cs +++ b/src/UnitTests/DistributionTests/Multivariate/MatrixNormalTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,11 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.Distributions; using MathNet.Numerics.LinearAlgebra; -using MathNet.Numerics.LinearAlgebra.Double; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.DistributionTests.Multivariate { diff --git a/src/UnitTests/DistributionTests/Multivariate/MultinomialTests.cs b/src/UnitTests/DistributionTests/Multivariate/MultinomialTests.cs index 642e8f3b..275e9684 100644 --- a/src/UnitTests/DistributionTests/Multivariate/MultinomialTests.cs +++ b/src/UnitTests/DistributionTests/Multivariate/MultinomialTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,14 +27,16 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + +using System; +using System.Linq; +using MathNet.Numerics.Distributions; +using MathNet.Numerics.Statistics; +using NUnitFramework.NUnit.Framework; + namespace MathNet.Numerics.UnitTests.DistributionTests.Multivariate { - using System; - using System.Linq; - using Distributions; - using NUnit.Framework; - using Statistics; - /// /// Multinomial distribution tests. /// @@ -224,7 +230,7 @@ namespace MathNet.Numerics.UnitTests.DistributionTests.Multivariate [Test] public void CanSampleStatic() { - Multinomial.Sample(new Random(0), _largeP, 4); + Multinomial.Sample(new System.Random(0), _largeP, 4); } /// @@ -233,7 +239,7 @@ namespace MathNet.Numerics.UnitTests.DistributionTests.Multivariate [Test] public void FailSampleStatic() { - Assert.That(() => Multinomial.Sample(new Random(0), _badP, 4), Throws.ArgumentException); + Assert.That(() => Multinomial.Sample(new System.Random(0), _badP, 4), Throws.ArgumentException); } /// diff --git a/src/UnitTests/DistributionTests/Multivariate/NormalGammaTests.cs b/src/UnitTests/DistributionTests/Multivariate/NormalGammaTests.cs index 6fb470cb..61c9e530 100644 --- a/src/UnitTests/DistributionTests/Multivariate/NormalGammaTests.cs +++ b/src/UnitTests/DistributionTests/Multivariate/NormalGammaTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,13 +27,15 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + +using System; +using System.Linq; +using MathNet.Numerics.Distributions; +using NUnitFramework.NUnit.Framework; + namespace MathNet.Numerics.UnitTests.DistributionTests.Multivariate { - using System; - using System.Linq; - using Distributions; - using NUnit.Framework; - /// /// NormalGamma distribution tests. /// @@ -218,7 +224,7 @@ namespace MathNet.Numerics.UnitTests.DistributionTests.Multivariate { GC.KeepAlive(new NormalGamma(0.0, 1.0, 1.0, 1.0) { - RandomSource = new Random(0) + RandomSource = new System.Random(0) }); } diff --git a/src/UnitTests/DistributionTests/Multivariate/WishartTests.cs b/src/UnitTests/DistributionTests/Multivariate/WishartTests.cs index 34b1043c..68e39cef 100644 --- a/src/UnitTests/DistributionTests/Multivariate/WishartTests.cs +++ b/src/UnitTests/DistributionTests/Multivariate/WishartTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,11 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.Distributions; using MathNet.Numerics.LinearAlgebra; -using MathNet.Numerics.LinearAlgebra.Double; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.DistributionTests.Multivariate { diff --git a/src/UnitTests/EuclidTests/GcdRelatedTest.cs b/src/UnitTests/EuclidTests/GcdRelatedTest.cs index 8f718442..183d34a1 100644 --- a/src/UnitTests/EuclidTests/GcdRelatedTest.cs +++ b/src/UnitTests/EuclidTests/GcdRelatedTest.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.EuclidTests { diff --git a/src/UnitTests/EuclidTests/GcdRelatedTestBigInteger.cs b/src/UnitTests/EuclidTests/GcdRelatedTestBigInteger.cs index 8854c72a..8d820d45 100644 --- a/src/UnitTests/EuclidTests/GcdRelatedTestBigInteger.cs +++ b/src/UnitTests/EuclidTests/GcdRelatedTestBigInteger.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + #if !NOSYSNUMERICS using System; using System.Numerics; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.EuclidTests { diff --git a/src/UnitTests/EuclidTests/IntegerTheoryTest.cs b/src/UnitTests/EuclidTests/IntegerTheoryTest.cs index b81cb3d6..d1078d1c 100644 --- a/src/UnitTests/EuclidTests/IntegerTheoryTest.cs +++ b/src/UnitTests/EuclidTests/IntegerTheoryTest.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,9 +27,11 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Globalization; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.EuclidTests { diff --git a/src/UnitTests/ExcelTests.cs b/src/UnitTests/ExcelTests.cs index de61c7ed..6e785a5e 100644 --- a/src/UnitTests/ExcelTests.cs +++ b/src/UnitTests/ExcelTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; // ReSharper disable InconsistentNaming diff --git a/src/UnitTests/FinancialTests/CompoundReturnTests.cs b/src/UnitTests/FinancialTests/CompoundReturnTests.cs index 47ec3aa8..a3d04444 100644 --- a/src/UnitTests/FinancialTests/CompoundReturnTests.cs +++ b/src/UnitTests/FinancialTests/CompoundReturnTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2015 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Collections.Generic; using MathNet.Numerics.Financial; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.FinancialTests { @@ -38,14 +40,13 @@ namespace MathNet.Numerics.UnitTests.FinancialTests public class CompoundReturnTests { [Test] - [ExpectedException(typeof(ArgumentNullException))] //assert public void throws_when_input_data_is_null() { //arrange List inputData = null; //act // ReSharper disable ExpressionIsAlwaysNull - inputData.CompoundReturn(); + Assert.Throws(() => AbsoluteReturnMeasures.CompoundReturn(inputData)); // ReSharper restore ExpressionIsAlwaysNull } diff --git a/src/UnitTests/FinancialTests/DownsideDeviationTests.cs b/src/UnitTests/FinancialTests/DownsideDeviationTests.cs index 2b8b1f75..5f008c53 100644 --- a/src/UnitTests/FinancialTests/DownsideDeviationTests.cs +++ b/src/UnitTests/FinancialTests/DownsideDeviationTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,12 +27,14 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Collections.Generic; using System.Linq; using MathNet.Numerics.Financial; using MathNet.Numerics.Statistics; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.FinancialTests { @@ -102,7 +104,6 @@ namespace MathNet.Numerics.UnitTests.FinancialTests } [Test] - [ExpectedException(typeof(ArgumentNullException))] //assert public void throws_when_input_data_is_null() { //arrange @@ -110,7 +111,7 @@ namespace MathNet.Numerics.UnitTests.FinancialTests List inputData = null; //act // ReSharper disable ExpressionIsAlwaysNull - inputData.DownsideDeviation(minimumAcceptableReturn); + Assert.Throws(() => AbsoluteRiskMeasures.DownsideDeviation(inputData, minimumAcceptableReturn)); // ReSharper restore ExpressionIsAlwaysNull } diff --git a/src/UnitTests/FinancialTests/GainLossRatioTests.cs b/src/UnitTests/FinancialTests/GainLossRatioTests.cs index a028ad75..d63aa514 100644 --- a/src/UnitTests/FinancialTests/GainLossRatioTests.cs +++ b/src/UnitTests/FinancialTests/GainLossRatioTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,12 +27,14 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Collections.Generic; using System.Linq; using MathNet.Numerics.Financial; using MathNet.Numerics.Statistics; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.FinancialTests { @@ -40,14 +42,13 @@ namespace MathNet.Numerics.UnitTests.FinancialTests public class GainLossRatioTests { [Test] - [ExpectedException(typeof(ArgumentNullException))] //assert public void throws_when_input_data_is_null() { //arrange List inputData = null; //act // ReSharper disable ExpressionIsAlwaysNull - inputData.GainLossRatio(); + Assert.Throws(() => AbsoluteRiskMeasures.GainLossRatio(inputData)); // ReSharper restore ExpressionIsAlwaysNull } @@ -105,7 +106,7 @@ namespace MathNet.Numerics.UnitTests.FinancialTests //arrange var inputData = new[] { 0.0, -1.0 }; //act - var gainLossRatio = inputData.GainLossRatio(); + var gainLossRatio = inputData.GainLossRatio(); //assert Assert.AreEqual(0.0, gainLossRatio); //0.0 / -1.0 => 0.0 } diff --git a/src/UnitTests/FinancialTests/GainMeanTests.cs b/src/UnitTests/FinancialTests/GainMeanTests.cs index 143219a9..8aebb8a6 100644 --- a/src/UnitTests/FinancialTests/GainMeanTests.cs +++ b/src/UnitTests/FinancialTests/GainMeanTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Collections.Generic; using MathNet.Numerics.Financial; using MathNet.Numerics.Statistics; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.FinancialTests { @@ -83,14 +85,13 @@ namespace MathNet.Numerics.UnitTests.FinancialTests } [Test] - [ExpectedException(typeof(ArgumentNullException))] public void throws_when_input_data_is_null() //assert { //arrange double[] inputData = null; //act // ReSharper disable ExpressionIsAlwaysNull - inputData.GainMean(); + Assert.Throws(() => AbsoluteReturnMeasures.GainMean(inputData)); // ReSharper restore ExpressionIsAlwaysNull } diff --git a/src/UnitTests/FinancialTests/GainStandardDeviationTests.cs b/src/UnitTests/FinancialTests/GainStandardDeviationTests.cs index 73f06e4e..4ec09a0a 100644 --- a/src/UnitTests/FinancialTests/GainStandardDeviationTests.cs +++ b/src/UnitTests/FinancialTests/GainStandardDeviationTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,12 +27,14 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Collections.Generic; using System.Linq; using MathNet.Numerics.Financial; using MathNet.Numerics.Statistics; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.FinancialTests { @@ -108,14 +110,13 @@ namespace MathNet.Numerics.UnitTests.FinancialTests } [Test] - [ExpectedException(typeof(ArgumentNullException))] //assert public void throws_when_input_data_is_null() { //arrange List inputData = null; //act // ReSharper disable ExpressionIsAlwaysNull - inputData.GainStandardDeviation(); + Assert.Throws(() => AbsoluteRiskMeasures.GainStandardDeviation(inputData)); // ReSharper restore ExpressionIsAlwaysNull } } diff --git a/src/UnitTests/FinancialTests/LossMeanTests.cs b/src/UnitTests/FinancialTests/LossMeanTests.cs index 2d6b49e0..e767222a 100644 --- a/src/UnitTests/FinancialTests/LossMeanTests.cs +++ b/src/UnitTests/FinancialTests/LossMeanTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Collections.Generic; using MathNet.Numerics.Financial; using MathNet.Numerics.Statistics; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.FinancialTests { @@ -83,16 +85,14 @@ namespace MathNet.Numerics.UnitTests.FinancialTests Assert.AreEqual(-1.0, lossMean); } - [Test] - [ExpectedException(typeof(ArgumentNullException))] //assert - public void throws_when_input_data_is_null() + public void throws_when_input_data_is_null() { //arrange List inputData = null; //act // ReSharper disable ExpressionIsAlwaysNull - inputData.LossMean(); + Assert.Throws(() => AbsoluteReturnMeasures.LossMean(inputData)); // ReSharper restore ExpressionIsAlwaysNull } diff --git a/src/UnitTests/FinancialTests/LossStandardDeviationTests.cs b/src/UnitTests/FinancialTests/LossStandardDeviationTests.cs index 5700a5c5..d1e585cd 100644 --- a/src/UnitTests/FinancialTests/LossStandardDeviationTests.cs +++ b/src/UnitTests/FinancialTests/LossStandardDeviationTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,12 +27,14 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Collections.Generic; using System.Linq; using MathNet.Numerics.Financial; using MathNet.Numerics.Statistics; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.FinancialTests { @@ -108,14 +110,13 @@ namespace MathNet.Numerics.UnitTests.FinancialTests } [Test] - [ExpectedException(typeof(ArgumentNullException))] //assert public void throws_when_input_data_is_null() { //arrange List inputData = null; //act // ReSharper disable ExpressionIsAlwaysNull - inputData.LossStandardDeviation(); + Assert.Throws(() => AbsoluteRiskMeasures.LossStandardDeviation(inputData)); // ReSharper restore ExpressionIsAlwaysNull } } diff --git a/src/UnitTests/FinancialTests/SemiDeviationTests.cs b/src/UnitTests/FinancialTests/SemiDeviationTests.cs index 241bff58..b1f0a804 100644 --- a/src/UnitTests/FinancialTests/SemiDeviationTests.cs +++ b/src/UnitTests/FinancialTests/SemiDeviationTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,12 +27,14 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Collections.Generic; using System.Linq; using MathNet.Numerics.Financial; using MathNet.Numerics.Statistics; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.FinancialTests { @@ -99,14 +101,13 @@ namespace MathNet.Numerics.UnitTests.FinancialTests } [Test] - [ExpectedException(typeof(ArgumentNullException))] //assert - public void throws_when_input_data_is_null() + public void throws_when_input_data_is_null() { //arrange List inputData = null; //act // ReSharper disable ExpressionIsAlwaysNull - inputData.SemiDeviation(); + Assert.Throws(() => AbsoluteRiskMeasures.SemiDeviation(inputData)); // ReSharper restore ExpressionIsAlwaysNull } } diff --git a/src/UnitTests/FitTests.cs b/src/UnitTests/FitTests.cs index 2d4e0e30..c5e181c0 100644 --- a/src/UnitTests/FitTests.cs +++ b/src/UnitTests/FitTests.cs @@ -2,9 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// -// Copyright (c) 2009-2013 Math.NET -// +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -13,10 +13,10 @@ // 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 @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Linq; using MathNet.Numerics.Statistics; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests { diff --git a/src/UnitTests/GenerateTests.cs b/src/UnitTests/GenerateTests.cs index 5eaeb64e..d4e73fef 100644 --- a/src/UnitTests/GenerateTests.cs +++ b/src/UnitTests/GenerateTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,9 +27,11 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Linq; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests { diff --git a/src/UnitTests/GoodnessOfFit/RSquaredTest.cs b/src/UnitTests/GoodnessOfFit/RSquaredTest.cs index 20fa378f..132d3f84 100644 --- a/src/UnitTests/GoodnessOfFit/RSquaredTest.cs +++ b/src/UnitTests/GoodnessOfFit/RSquaredTest.cs @@ -1,6 +1,37 @@ -using System; +// +// Math.NET Numerics, part of the Math.NET Project +// http://numerics.mathdotnet.com +// http://github.com/mathnet/mathnet-numerics +// +// Copyright (c) 2009-2016 Math.NET +// +// 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. +// + +extern alias NUnitFramework; + +using System; using System.Collections.Generic; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.GoodnessOfFit { @@ -23,15 +54,12 @@ namespace MathNet.Numerics.UnitTests.GoodnessOfFit } [Test] - [ExpectedException(typeof (ArgumentOutOfRangeException))] public void WhenGivenTwoDatasetsOfDifferentSizeThenThrowsArgumentException() { var observedData = new List { 23, 9, 5, 7, 10, 5, 4, 1, 2, 1 }; var modelledData = new List { 8, 9, 10 }; - Numerics.GoodnessOfFit.RSquared(modelledData, observedData); - - Assert.Fail("Expected ArgumentException exception wasn't thrown"); + Assert.Throws(() => Numerics.GoodnessOfFit.RSquared(modelledData, observedData)); } [Test] diff --git a/src/UnitTests/IntegralTransformsTests/FourierTest.cs b/src/UnitTests/IntegralTransformsTests/FourierTest.cs index 811a2497..26b52181 100644 --- a/src/UnitTests/IntegralTransformsTests/FourierTest.cs +++ b/src/UnitTests/IntegralTransformsTests/FourierTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.Distributions; using MathNet.Numerics.IntegralTransforms; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.IntegralTransformsTests { diff --git a/src/UnitTests/IntegralTransformsTests/HartleyTest.cs b/src/UnitTests/IntegralTransformsTests/HartleyTest.cs index 71d1835a..dc311132 100644 --- a/src/UnitTests/IntegralTransformsTests/HartleyTest.cs +++ b/src/UnitTests/IntegralTransformsTests/HartleyTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.Distributions; using MathNet.Numerics.IntegralTransforms; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.IntegralTransformsTests { diff --git a/src/UnitTests/IntegralTransformsTests/InverseTransformTest.cs b/src/UnitTests/IntegralTransformsTests/InverseTransformTest.cs index 2b401986..b2d586e0 100644 --- a/src/UnitTests/IntegralTransformsTests/InverseTransformTest.cs +++ b/src/UnitTests/IntegralTransformsTests/InverseTransformTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,9 +27,11 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.Distributions; using MathNet.Numerics.IntegralTransforms; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.IntegralTransformsTests { diff --git a/src/UnitTests/IntegralTransformsTests/MatchingNaiveTransformTest.cs b/src/UnitTests/IntegralTransformsTests/MatchingNaiveTransformTest.cs index 490f6fd1..791b5b9a 100644 --- a/src/UnitTests/IntegralTransformsTests/MatchingNaiveTransformTest.cs +++ b/src/UnitTests/IntegralTransformsTests/MatchingNaiveTransformTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.Distributions; using MathNet.Numerics.IntegralTransforms; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.IntegralTransformsTests { diff --git a/src/UnitTests/IntegralTransformsTests/ParsevalTheoremTest.cs b/src/UnitTests/IntegralTransformsTests/ParsevalTheoremTest.cs index 4f44e377..e2adac85 100644 --- a/src/UnitTests/IntegralTransformsTests/ParsevalTheoremTest.cs +++ b/src/UnitTests/IntegralTransformsTests/ParsevalTheoremTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System.Linq; using MathNet.Numerics.Distributions; using MathNet.Numerics.IntegralTransforms; using MathNet.Numerics.Statistics; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.IntegralTransformsTests { diff --git a/src/UnitTests/IntegrationTests/IntegrationTest.cs b/src/UnitTests/IntegrationTests/IntegrationTest.cs index 640070e1..5b03b0b9 100644 --- a/src/UnitTests/IntegrationTests/IntegrationTest.cs +++ b/src/UnitTests/IntegrationTests/IntegrationTest.cs @@ -27,12 +27,14 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + +using System; +using MathNet.Numerics.Integration; +using NUnitFramework.NUnit.Framework; + namespace MathNet.Numerics.UnitTests.IntegrationTests { - using System; - using Integration; - using NUnit.Framework; - /// /// Integration tests. /// diff --git a/src/UnitTests/InterpolationTests/AkimaSplineTest.cs b/src/UnitTests/InterpolationTests/AkimaSplineTest.cs index c8f02bd9..49a2e3b2 100644 --- a/src/UnitTests/InterpolationTests/AkimaSplineTest.cs +++ b/src/UnitTests/InterpolationTests/AkimaSplineTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2002-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.Interpolation; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.InterpolationTests { diff --git a/src/UnitTests/InterpolationTests/BulirschStoerRationalTest.cs b/src/UnitTests/InterpolationTests/BulirschStoerRationalTest.cs index fff7da3e..ecbca9f5 100644 --- a/src/UnitTests/InterpolationTests/BulirschStoerRationalTest.cs +++ b/src/UnitTests/InterpolationTests/BulirschStoerRationalTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2002-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.Interpolation; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.InterpolationTests { diff --git a/src/UnitTests/InterpolationTests/CubicSplineTest.cs b/src/UnitTests/InterpolationTests/CubicSplineTest.cs index 5dee9c86..7ef08d68 100644 --- a/src/UnitTests/InterpolationTests/CubicSplineTest.cs +++ b/src/UnitTests/InterpolationTests/CubicSplineTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2002-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Linq; using MathNet.Numerics.Interpolation; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.InterpolationTests { diff --git a/src/UnitTests/InterpolationTests/EquidistantPolynomialTest.cs b/src/UnitTests/InterpolationTests/EquidistantPolynomialTest.cs index 1cc2437a..f4321aef 100644 --- a/src/UnitTests/InterpolationTests/EquidistantPolynomialTest.cs +++ b/src/UnitTests/InterpolationTests/EquidistantPolynomialTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2002-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.Interpolation; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.InterpolationTests { diff --git a/src/UnitTests/InterpolationTests/FloaterHormannRationalTest.cs b/src/UnitTests/InterpolationTests/FloaterHormannRationalTest.cs index 4997480f..5483e295 100644 --- a/src/UnitTests/InterpolationTests/FloaterHormannRationalTest.cs +++ b/src/UnitTests/InterpolationTests/FloaterHormannRationalTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2002-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.Interpolation; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.InterpolationTests { diff --git a/src/UnitTests/InterpolationTests/LinearInterpolationCase.cs b/src/UnitTests/InterpolationTests/LinearInterpolationCase.cs index c240249e..1215b1f3 100644 --- a/src/UnitTests/InterpolationTests/LinearInterpolationCase.cs +++ b/src/UnitTests/InterpolationTests/LinearInterpolationCase.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2002-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation diff --git a/src/UnitTests/InterpolationTests/LinearSplineTest.cs b/src/UnitTests/InterpolationTests/LinearSplineTest.cs index 9c074f0b..e86fcbca 100644 --- a/src/UnitTests/InterpolationTests/LinearSplineTest.cs +++ b/src/UnitTests/InterpolationTests/LinearSplineTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2002-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.Interpolation; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.InterpolationTests { diff --git a/src/UnitTests/InterpolationTests/NevillePolynomialTest.cs b/src/UnitTests/InterpolationTests/NevillePolynomialTest.cs index 708ea3ba..9e8d88b3 100644 --- a/src/UnitTests/InterpolationTests/NevillePolynomialTest.cs +++ b/src/UnitTests/InterpolationTests/NevillePolynomialTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2002-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,12 +27,14 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Globalization; using System.Linq; using MathNet.Numerics.Interpolation; using MathNet.Numerics.TestData; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.InterpolationTests { @@ -113,12 +115,11 @@ namespace MathNet.Numerics.UnitTests.InterpolationTests /// Verifies that all sample points must be unique. /// [Test] - [ExpectedException(typeof (ArgumentException))] public void Constructor_SamplePointsNotUnique_Throws() { var x = new[] { -1.0, 0.0, 1.5, 1.5, 2.5, 4.0 }; var y = new[] { 1.0, 0.3, -0.7, -0.6, -0.1, 0.4 }; - var interpolation = new NevillePolynomialInterpolation(x, y); + Assert.Throws(() => new NevillePolynomialInterpolation(x, y)); } /// @@ -128,7 +129,7 @@ namespace MathNet.Numerics.UnitTests.InterpolationTests /// Value for which interpolation is requested. /// Columns 3 and 4 of the .csv file contain the logarithms of energy and mass attenuation /// coefficients, respectively. - [Test, Sequential, Ignore] + [Test, Sequential, Ignore("")] public void Interpolate_LogLogAttenuationData_InterpolationShouldNotYieldNaN( [Values(0.0025, 0.035, 0.45, 5.5, 18.5, 35.0)] double value) { diff --git a/src/UnitTests/InterpolationTests/StepInterpolationTest.cs b/src/UnitTests/InterpolationTests/StepInterpolationTest.cs index 5cd0eb72..685754e9 100644 --- a/src/UnitTests/InterpolationTests/StepInterpolationTest.cs +++ b/src/UnitTests/InterpolationTests/StepInterpolationTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2002-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,9 +27,11 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.Interpolation; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.InterpolationTests { diff --git a/src/UnitTests/LinearAlgebraProviderTests/Complex/LinearAlgebraProviderTests.cs b/src/UnitTests/LinearAlgebraProviderTests/Complex/LinearAlgebraProviderTests.cs index c38e2620..56870c41 100644 --- a/src/UnitTests/LinearAlgebraProviderTests/Complex/LinearAlgebraProviderTests.cs +++ b/src/UnitTests/LinearAlgebraProviderTests/Complex/LinearAlgebraProviderTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2015 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,6 +27,8 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Collections.Generic; using MathNet.Numerics.Distributions; @@ -34,7 +36,7 @@ using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex; using MathNet.Numerics.LinearAlgebra.Factorization; using MathNet.Numerics.Providers.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraProviderTests.Complex { diff --git a/src/UnitTests/LinearAlgebraProviderTests/Complex32/LinearAlgebraProviderTests.cs b/src/UnitTests/LinearAlgebraProviderTests/Complex32/LinearAlgebraProviderTests.cs index f635af43..08eaf984 100644 --- a/src/UnitTests/LinearAlgebraProviderTests/Complex32/LinearAlgebraProviderTests.cs +++ b/src/UnitTests/LinearAlgebraProviderTests/Complex32/LinearAlgebraProviderTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2015 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,6 +27,8 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Collections.Generic; using MathNet.Numerics.Distributions; @@ -34,7 +36,7 @@ using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex32; using MathNet.Numerics.LinearAlgebra.Factorization; using MathNet.Numerics.Providers.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraProviderTests.Complex32 { diff --git a/src/UnitTests/LinearAlgebraProviderTests/Double/LinearAlgebraProviderTests.cs b/src/UnitTests/LinearAlgebraProviderTests/Double/LinearAlgebraProviderTests.cs index 30244473..5decd15a 100644 --- a/src/UnitTests/LinearAlgebraProviderTests/Double/LinearAlgebraProviderTests.cs +++ b/src/UnitTests/LinearAlgebraProviderTests/Double/LinearAlgebraProviderTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2015 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,6 +27,8 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Collections.Generic; using MathNet.Numerics.Distributions; @@ -34,7 +36,7 @@ using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Double; using MathNet.Numerics.LinearAlgebra.Factorization; using MathNet.Numerics.Providers.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraProviderTests.Double { diff --git a/src/UnitTests/LinearAlgebraProviderTests/Single/LinearAlgebraProviderTests.cs b/src/UnitTests/LinearAlgebraProviderTests/Single/LinearAlgebraProviderTests.cs index e8335983..72db5a70 100644 --- a/src/UnitTests/LinearAlgebraProviderTests/Single/LinearAlgebraProviderTests.cs +++ b/src/UnitTests/LinearAlgebraProviderTests/Single/LinearAlgebraProviderTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2015 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,6 +27,8 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Collections.Generic; using MathNet.Numerics.Distributions; @@ -34,7 +36,7 @@ using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Factorization; using MathNet.Numerics.LinearAlgebra.Single; using MathNet.Numerics.Providers.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraProviderTests.Single { diff --git a/src/UnitTests/LinearAlgebraTests/Complex/DenseMatrixTests.cs b/src/UnitTests/LinearAlgebraTests/Complex/DenseMatrixTests.cs index 6b7f6724..5c139c5c 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex/DenseMatrixTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex/DenseMatrixTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Collections.Generic; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex { diff --git a/src/UnitTests/LinearAlgebraTests/Complex/DenseVectorTests.cs b/src/UnitTests/LinearAlgebraTests/Complex/DenseVectorTests.cs index 7f0c7e2c..9e28ddda 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex/DenseVectorTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex/DenseVectorTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,9 +27,11 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; using System; using System.Collections.Generic; diff --git a/src/UnitTests/LinearAlgebraTests/Complex/DiagonalMatrixTests.cs b/src/UnitTests/LinearAlgebraTests/Complex/DiagonalMatrixTests.cs index 8030a093..226e40bf 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex/DiagonalMatrixTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex/DiagonalMatrixTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,13 +27,15 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Collections.Generic; using MathNet.Numerics.Distributions; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex; using MathNet.Numerics.Random; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex { diff --git a/src/UnitTests/LinearAlgebraTests/Complex/Factorization/CholeskyTests.cs b/src/UnitTests/LinearAlgebraTests/Complex/Factorization/CholeskyTests.cs index 895aa734..e0bb3813 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex/Factorization/CholeskyTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex/Factorization/CholeskyTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,9 +27,11 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex.Factorization { diff --git a/src/UnitTests/LinearAlgebraTests/Complex/Factorization/EvdTests.cs b/src/UnitTests/LinearAlgebraTests/Complex/Factorization/EvdTests.cs index 977162f0..c95e0f36 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex/Factorization/EvdTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex/Factorization/EvdTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex.Factorization { diff --git a/src/UnitTests/LinearAlgebraTests/Complex/Factorization/GramSchmidtTests.cs b/src/UnitTests/LinearAlgebraTests/Complex/Factorization/GramSchmidtTests.cs index 8744e6b1..61536c4f 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex/Factorization/GramSchmidtTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex/Factorization/GramSchmidtTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex; using MathNet.Numerics.LinearAlgebra.Complex.Factorization; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex.Factorization { diff --git a/src/UnitTests/LinearAlgebraTests/Complex/Factorization/LUTests.cs b/src/UnitTests/LinearAlgebraTests/Complex/Factorization/LUTests.cs index 8a618c26..2682e016 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex/Factorization/LUTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex/Factorization/LUTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,9 +27,11 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex.Factorization { diff --git a/src/UnitTests/LinearAlgebraTests/Complex/Factorization/QRTests.cs b/src/UnitTests/LinearAlgebraTests/Complex/Factorization/QRTests.cs index ef67e0d8..650ad6f6 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex/Factorization/QRTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex/Factorization/QRTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex; using MathNet.Numerics.LinearAlgebra.Complex.Factorization; using MathNet.Numerics.LinearAlgebra.Factorization; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex.Factorization { diff --git a/src/UnitTests/LinearAlgebraTests/Complex/Factorization/SvdTests.cs b/src/UnitTests/LinearAlgebraTests/Complex/Factorization/SvdTests.cs index 3c5b6d20..1d38b370 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex/Factorization/SvdTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex/Factorization/SvdTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex.Factorization { diff --git a/src/UnitTests/LinearAlgebraTests/Complex/Factorization/UserCholeskyTests.cs b/src/UnitTests/LinearAlgebraTests/Complex/Factorization/UserCholeskyTests.cs index 4ac55e48..c382daef 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex/Factorization/UserCholeskyTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex/Factorization/UserCholeskyTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex.Factorization { diff --git a/src/UnitTests/LinearAlgebraTests/Complex/Factorization/UserEvdTests.cs b/src/UnitTests/LinearAlgebraTests/Complex/Factorization/UserEvdTests.cs index 07053643..e555366f 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex/Factorization/UserEvdTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex/Factorization/UserEvdTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex.Factorization { @@ -90,7 +96,7 @@ namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex.Factorization Assert.AreEqual(order, d.RowCount); Assert.AreEqual(order, d.ColumnCount); - // Make sure the A*V = λ*V + // Make sure the A*V = λ*V var matrixAv = matrixA * eigenVectors; var matrixLv = eigenVectors * d; @@ -126,7 +132,7 @@ namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex.Factorization Assert.AreEqual(order, d.RowCount); Assert.AreEqual(order, d.ColumnCount); - // Make sure the A = V*λ*VT + // Make sure the A = V*λ*VT var matrix = eigenVectors * d * eigenVectors.ConjugateTranspose(); for (var i = 0; i < matrix.RowCount; i++) diff --git a/src/UnitTests/LinearAlgebraTests/Complex/Factorization/UserGramSchmidtTests.cs b/src/UnitTests/LinearAlgebraTests/Complex/Factorization/UserGramSchmidtTests.cs index 89dc009d..fe5a4494 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex/Factorization/UserGramSchmidtTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex/Factorization/UserGramSchmidtTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,9 +27,11 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex.Factorization; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex.Factorization { diff --git a/src/UnitTests/LinearAlgebraTests/Complex/Factorization/UserLUTests.cs b/src/UnitTests/LinearAlgebraTests/Complex/Factorization/UserLUTests.cs index c416584d..667b79d4 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex/Factorization/UserLUTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex/Factorization/UserLUTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex.Factorization { diff --git a/src/UnitTests/LinearAlgebraTests/Complex/Factorization/UserQRTests.cs b/src/UnitTests/LinearAlgebraTests/Complex/Factorization/UserQRTests.cs index 73d1423f..5319db59 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex/Factorization/UserQRTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex/Factorization/UserQRTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex.Factorization; using MathNet.Numerics.LinearAlgebra.Factorization; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex.Factorization { diff --git a/src/UnitTests/LinearAlgebraTests/Complex/Factorization/UserSvdTests.cs b/src/UnitTests/LinearAlgebraTests/Complex/Factorization/UserSvdTests.cs index d796baf7..76c169bc 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex/Factorization/UserSvdTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex/Factorization/UserSvdTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,9 +27,11 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex.Factorization { diff --git a/src/UnitTests/LinearAlgebraTests/Complex/MatrixLoader.cs b/src/UnitTests/LinearAlgebraTests/Complex/MatrixLoader.cs index 3a82ee8c..ca7a5ae7 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex/MatrixLoader.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex/MatrixLoader.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,9 +27,11 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System.Collections.Generic; using MathNet.Numerics.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex { diff --git a/src/UnitTests/LinearAlgebraTests/Complex/MatrixStructureTheory.cs b/src/UnitTests/LinearAlgebraTests/Complex/MatrixStructureTheory.cs index 13bf2c35..f5e717ff 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex/MatrixStructureTheory.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex/MatrixStructureTheory.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2015 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex { diff --git a/src/UnitTests/LinearAlgebraTests/Complex/MatrixTests.Arithmetic.cs b/src/UnitTests/LinearAlgebraTests/Complex/MatrixTests.Arithmetic.cs index 999310b6..649ca8b5 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex/MatrixTests.Arithmetic.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex/MatrixTests.Arithmetic.cs @@ -1,8 +1,9 @@ -// // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +12,10 @@ // 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 @@ -23,11 +26,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.Distributions; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex { diff --git a/src/UnitTests/LinearAlgebraTests/Complex/MatrixTests.cs b/src/UnitTests/LinearAlgebraTests/Complex/MatrixTests.cs index 96a53c23..fcc40477 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex/MatrixTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex/MatrixTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,7 +27,9 @@ // OTHER DEALINGS IN THE SOFTWARE. // -using NUnit.Framework; +extern alias NUnitFramework; + +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex { diff --git a/src/UnitTests/LinearAlgebraTests/Complex/ReturnTypeTests.cs b/src/UnitTests/LinearAlgebraTests/Complex/ReturnTypeTests.cs index 9d9058ba..9f8f7f4c 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex/ReturnTypeTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex/ReturnTypeTests.cs @@ -1,6 +1,37 @@ -using MathNet.Numerics.LinearAlgebra; +// +// Math.NET Numerics, part of the Math.NET Project +// http://numerics.mathdotnet.com +// http://github.com/mathnet/mathnet-numerics +// +// Copyright (c) 2009-2016 Math.NET +// +// 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. +// + +extern alias NUnitFramework; + +using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex { diff --git a/src/UnitTests/LinearAlgebraTests/Complex/Solvers/Iterative/BiCgStabTest.cs b/src/UnitTests/LinearAlgebraTests/Complex/Solvers/Iterative/BiCgStabTest.cs index 7b6fcbb3..b784e58f 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex/Solvers/Iterative/BiCgStabTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex/Solvers/Iterative/BiCgStabTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,12 +27,14 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex; using MathNet.Numerics.LinearAlgebra.Complex.Solvers; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex.Solvers.Iterative { diff --git a/src/UnitTests/LinearAlgebraTests/Complex/Solvers/Iterative/GpBiCgTest.cs b/src/UnitTests/LinearAlgebraTests/Complex/Solvers/Iterative/GpBiCgTest.cs index 2616043f..76d4046e 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex/Solvers/Iterative/GpBiCgTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex/Solvers/Iterative/GpBiCgTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,12 +27,14 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex; using MathNet.Numerics.LinearAlgebra.Complex.Solvers; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex.Solvers.Iterative { diff --git a/src/UnitTests/LinearAlgebraTests/Complex/Solvers/Iterative/MlkBiCgStabTest.cs b/src/UnitTests/LinearAlgebraTests/Complex/Solvers/Iterative/MlkBiCgStabTest.cs index f48c8f67..16700f3b 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex/Solvers/Iterative/MlkBiCgStabTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex/Solvers/Iterative/MlkBiCgStabTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,12 +27,14 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex; using MathNet.Numerics.LinearAlgebra.Complex.Solvers; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex.Solvers.Iterative { diff --git a/src/UnitTests/LinearAlgebraTests/Complex/Solvers/Iterative/TFQMRTest.cs b/src/UnitTests/LinearAlgebraTests/Complex/Solvers/Iterative/TFQMRTest.cs index a2b194f9..7ee4d4a8 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex/Solvers/Iterative/TFQMRTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex/Solvers/Iterative/TFQMRTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,12 +27,14 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex; using MathNet.Numerics.LinearAlgebra.Complex.Solvers; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex.Solvers.Iterative { diff --git a/src/UnitTests/LinearAlgebraTests/Complex/Solvers/IteratorTest.cs b/src/UnitTests/LinearAlgebraTests/Complex/Solvers/IteratorTest.cs index a512bb85..efcdfd91 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex/Solvers/IteratorTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex/Solvers/IteratorTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Collections.Generic; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex.Solvers { diff --git a/src/UnitTests/LinearAlgebraTests/Complex/Solvers/Preconditioners/DiagonalTest.cs b/src/UnitTests/LinearAlgebraTests/Complex/Solvers/Preconditioners/DiagonalTest.cs index 79cdcb42..d8ae1073 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex/Solvers/Preconditioners/DiagonalTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex/Solvers/Preconditioners/DiagonalTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex; using MathNet.Numerics.LinearAlgebra.Complex.Solvers; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex.Solvers.Preconditioners { diff --git a/src/UnitTests/LinearAlgebraTests/Complex/Solvers/Preconditioners/IluptElementSorterTest.cs b/src/UnitTests/LinearAlgebraTests/Complex/Solvers/Preconditioners/IluptElementSorterTest.cs index 4bcec029..f373e397 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex/Solvers/Preconditioners/IluptElementSorterTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex/Solvers/Preconditioners/IluptElementSorterTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex; using MathNet.Numerics.LinearAlgebra.Complex.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex.Solvers.Preconditioners { diff --git a/src/UnitTests/LinearAlgebraTests/Complex/Solvers/Preconditioners/IlutpTest.cs b/src/UnitTests/LinearAlgebraTests/Complex/Solvers/Preconditioners/IlutpTest.cs index 4421d4e4..d840755c 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex/Solvers/Preconditioners/IlutpTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex/Solvers/Preconditioners/IlutpTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,13 +27,15 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Reflection; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex; using MathNet.Numerics.LinearAlgebra.Complex.Solvers; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex.Solvers.Preconditioners { diff --git a/src/UnitTests/LinearAlgebraTests/Complex/Solvers/Preconditioners/IncompleteLUTest.cs b/src/UnitTests/LinearAlgebraTests/Complex/Solvers/Preconditioners/IncompleteLUTest.cs index 8873e86b..1d857984 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex/Solvers/Preconditioners/IncompleteLUTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex/Solvers/Preconditioners/IncompleteLUTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,13 +27,15 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Reflection; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex; using MathNet.Numerics.LinearAlgebra.Complex.Solvers; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex.Solvers.Preconditioners { diff --git a/src/UnitTests/LinearAlgebraTests/Complex/Solvers/Preconditioners/PreConditionerTest.cs b/src/UnitTests/LinearAlgebraTests/Complex/Solvers/Preconditioners/PreConditionerTest.cs index af0b6e70..aa587035 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex/Solvers/Preconditioners/PreConditionerTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex/Solvers/Preconditioners/PreConditionerTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex.Solvers.Preconditioners { diff --git a/src/UnitTests/LinearAlgebraTests/Complex/Solvers/Preconditioners/UnitPreconditionerTest.cs b/src/UnitTests/LinearAlgebraTests/Complex/Solvers/Preconditioners/UnitPreconditionerTest.cs index 5f413389..ca11bf87 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex/Solvers/Preconditioners/UnitPreconditionerTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex/Solvers/Preconditioners/UnitPreconditionerTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex.Solvers.Preconditioners { diff --git a/src/UnitTests/LinearAlgebraTests/Complex/Solvers/StopCriterion/DivergenceStopCriteriumTest.cs b/src/UnitTests/LinearAlgebraTests/Complex/Solvers/StopCriterion/DivergenceStopCriteriumTest.cs index c231ff42..2eec12c8 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex/Solvers/StopCriterion/DivergenceStopCriteriumTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex/Solvers/StopCriterion/DivergenceStopCriteriumTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex.Solvers.StopCriterion { diff --git a/src/UnitTests/LinearAlgebraTests/Complex/Solvers/StopCriterion/FailureStopCriteriumTest.cs b/src/UnitTests/LinearAlgebraTests/Complex/Solvers/StopCriterion/FailureStopCriteriumTest.cs index a51c3f33..6190cc76 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex/Solvers/StopCriterion/FailureStopCriteriumTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex/Solvers/StopCriterion/FailureStopCriteriumTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex.Solvers.StopCriterion { @@ -39,7 +41,7 @@ namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex.Solvers.StopCrit using Complex = Numerics.Complex; #else using Complex = System.Numerics.Complex; - + #endif /// diff --git a/src/UnitTests/LinearAlgebraTests/Complex/Solvers/StopCriterion/IterationCountStopCriteriumTest.cs b/src/UnitTests/LinearAlgebraTests/Complex/Solvers/StopCriterion/IterationCountStopCriteriumTest.cs index 366169b8..6d4956ae 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex/Solvers/StopCriterion/IterationCountStopCriteriumTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex/Solvers/StopCriterion/IterationCountStopCriteriumTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex.Solvers.StopCriterion { diff --git a/src/UnitTests/LinearAlgebraTests/Complex/Solvers/StopCriterion/ResidualStopCriteriumTest.cs b/src/UnitTests/LinearAlgebraTests/Complex/Solvers/StopCriterion/ResidualStopCriteriumTest.cs index 78a239c3..a5daa30d 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex/Solvers/StopCriterion/ResidualStopCriteriumTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex/Solvers/StopCriterion/ResidualStopCriteriumTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex.Solvers.StopCriterion { @@ -39,7 +41,7 @@ namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex.Solvers.StopCrit using Complex = Numerics.Complex; #else using Complex = System.Numerics.Complex; - + #endif /// diff --git a/src/UnitTests/LinearAlgebraTests/Complex/SparseMatrixTests.cs b/src/UnitTests/LinearAlgebraTests/Complex/SparseMatrixTests.cs index e08720cb..cd0a3047 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex/SparseMatrixTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex/SparseMatrixTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Collections.Generic; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex { @@ -94,7 +96,7 @@ namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex [Test] public void MatrixFrom1DArrayIsCopy() { - // Sparse Matrix copies values from Complex[], but no remember reference. + // Sparse Matrix copies values from Complex[], but no remember reference. var data = new[] {new Complex(1.0, 1), new Complex(1.0, 1), new Complex(1.0, 1), new Complex(1.0, 1), new Complex(1.0, 1), new Complex(1.0, 1), new Complex(2.0, 1), new Complex(2.0, 1), new Complex(2.0, 1)}; var matrix = SparseMatrix.OfColumnMajor(3, 3, data); matrix[0, 0] = new Complex(10.0, 1); diff --git a/src/UnitTests/LinearAlgebraTests/Complex/SparseVectorTest.cs b/src/UnitTests/LinearAlgebraTests/Complex/SparseVectorTest.cs index 1cb093a3..77d14440 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex/SparseVectorTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex/SparseVectorTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex; using MathNet.Numerics.LinearAlgebra.Storage; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; using System; using System.Collections.Generic; diff --git a/src/UnitTests/LinearAlgebraTests/Complex/UserDefinedVectorTests.cs b/src/UnitTests/LinearAlgebraTests/Complex/UserDefinedVectorTests.cs index 31ce3b96..b1542ea1 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex/UserDefinedVectorTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex/UserDefinedVectorTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; using System.Collections.Generic; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex diff --git a/src/UnitTests/LinearAlgebraTests/Complex/VectorArithmeticTheory.cs b/src/UnitTests/LinearAlgebraTests/Complex/VectorArithmeticTheory.cs index 6050daa5..654fbc64 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex/VectorArithmeticTheory.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex/VectorArithmeticTheory.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2015 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex { diff --git a/src/UnitTests/LinearAlgebraTests/Complex/VectorTests.Arithmetic.cs b/src/UnitTests/LinearAlgebraTests/Complex/VectorTests.Arithmetic.cs index 9e8d3524..825758cc 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex/VectorTests.Arithmetic.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex/VectorTests.Arithmetic.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,9 +27,11 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex { diff --git a/src/UnitTests/LinearAlgebraTests/Complex/VectorTests.Norm.cs b/src/UnitTests/LinearAlgebraTests/Complex/VectorTests.Norm.cs index 29eb0dc5..21b8c81e 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex/VectorTests.Norm.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex/VectorTests.Norm.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,7 +27,9 @@ // OTHER DEALINGS IN THE SOFTWARE. // -using NUnit.Framework; +extern alias NUnitFramework; + +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex { diff --git a/src/UnitTests/LinearAlgebraTests/Complex/VectorTests.cs b/src/UnitTests/LinearAlgebraTests/Complex/VectorTests.cs index ae3cc6b3..5d032637 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex/VectorTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex/VectorTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,6 +27,8 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Collections; using System.Collections.Generic; @@ -34,7 +36,7 @@ using System.Linq; using MathNet.Numerics.Distributions; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex { diff --git a/src/UnitTests/LinearAlgebraTests/Complex32/DenseMatrixTests.cs b/src/UnitTests/LinearAlgebraTests/Complex32/DenseMatrixTests.cs index 22320227..402a1512 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex32/DenseMatrixTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex32/DenseMatrixTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Collections.Generic; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex32; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32 { diff --git a/src/UnitTests/LinearAlgebraTests/Complex32/DenseVectorTests.cs b/src/UnitTests/LinearAlgebraTests/Complex32/DenseVectorTests.cs index dd8be28b..54a2ab2b 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex32/DenseVectorTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex32/DenseVectorTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,9 +27,11 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex32; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; using System; using System.Collections.Generic; diff --git a/src/UnitTests/LinearAlgebraTests/Complex32/DiagonalMatrixTests.cs b/src/UnitTests/LinearAlgebraTests/Complex32/DiagonalMatrixTests.cs index 57a72f2a..ce617c69 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex32/DiagonalMatrixTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex32/DiagonalMatrixTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,13 +27,15 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Collections.Generic; using MathNet.Numerics.Distributions; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex32; using MathNet.Numerics.Random; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32 { diff --git a/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/CholeskyTests.cs b/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/CholeskyTests.cs index 50e915c4..4a972936 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/CholeskyTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/CholeskyTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,9 +27,11 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex32; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32.Factorization { diff --git a/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/EvdTests.cs b/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/EvdTests.cs index 35f41bfd..9d6c7f6b 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/EvdTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/EvdTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,9 +27,11 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex32; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32.Factorization { diff --git a/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/GramSchmidtTests.cs b/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/GramSchmidtTests.cs index a62387ee..51223714 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/GramSchmidtTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/GramSchmidtTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex32; using MathNet.Numerics.LinearAlgebra.Complex32.Factorization; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32.Factorization { diff --git a/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/LUTests.cs b/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/LUTests.cs index b5c41dc0..686b54ef 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/LUTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/LUTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,9 +27,11 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex32; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32.Factorization { diff --git a/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/QRTests.cs b/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/QRTests.cs index 36b2a526..863815f3 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/QRTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/QRTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex32; using MathNet.Numerics.LinearAlgebra.Complex32.Factorization; using MathNet.Numerics.LinearAlgebra.Factorization; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32.Factorization { diff --git a/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/SvdTests.cs b/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/SvdTests.cs index b68c2505..28dbcb1e 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/SvdTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/SvdTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex32; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32.Factorization { diff --git a/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/UserCholeskyTests.cs b/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/UserCholeskyTests.cs index 70308bff..6775e627 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/UserCholeskyTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/UserCholeskyTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32.Factorization { diff --git a/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/UserEvdTests.cs b/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/UserEvdTests.cs index afcb1d2e..d859af4b 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/UserEvdTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/UserEvdTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32.Factorization { @@ -92,7 +98,7 @@ namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32.Factorization Assert.AreEqual(order, d.RowCount); Assert.AreEqual(order, d.ColumnCount); - // Make sure the A*V = λ*V + // Make sure the A*V = λ*V var matrixAv = matrixA * eigenVectors; var matrixLv = eigenVectors * d; @@ -110,7 +116,7 @@ namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32.Factorization /// Can factorize a symmetric random square matrix. /// /// Matrix order. - [Test, Ignore] + [Test, Ignore("")] public void CanFactorizeRandomSymmetricMatrix([Values(1, 2, 5, 10, 50, 100)] int order) { var matrixA = new UserDefinedMatrix(Matrix.Build.RandomPositiveDefinite(order, 1).ToArray()); @@ -124,7 +130,7 @@ namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32.Factorization Assert.AreEqual(order, d.RowCount); Assert.AreEqual(order, d.ColumnCount); - // Make sure the A = V*λ*VT + // Make sure the A = V*λ*VT var matrix = eigenVectors * d * eigenVectors.ConjugateTranspose(); for (var i = 0; i < matrix.RowCount; i++) diff --git a/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/UserGramSchmidtTests.cs b/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/UserGramSchmidtTests.cs index 67b93d89..68ede0f6 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/UserGramSchmidtTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/UserGramSchmidtTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,9 +27,11 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex32.Factorization; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32.Factorization { diff --git a/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/UserLUTests.cs b/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/UserLUTests.cs index 328d3f4c..6f59ec7c 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/UserLUTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/UserLUTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32.Factorization { diff --git a/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/UserQRTests.cs b/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/UserQRTests.cs index 4d9120ca..da25a8f5 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/UserQRTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/UserQRTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex32.Factorization; using MathNet.Numerics.LinearAlgebra.Factorization; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32.Factorization { diff --git a/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/UserSvdTests.cs b/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/UserSvdTests.cs index f78e8376..a27d9172 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/UserSvdTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex32/Factorization/UserSvdTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,9 +27,11 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32.Factorization { diff --git a/src/UnitTests/LinearAlgebraTests/Complex32/MatrixLoader.cs b/src/UnitTests/LinearAlgebraTests/Complex32/MatrixLoader.cs index 976f8489..a5300053 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex32/MatrixLoader.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex32/MatrixLoader.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,9 +27,11 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System.Collections.Generic; using MathNet.Numerics.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32 { diff --git a/src/UnitTests/LinearAlgebraTests/Complex32/MatrixStructureTheory.cs b/src/UnitTests/LinearAlgebraTests/Complex32/MatrixStructureTheory.cs index 642bc7a4..524503cc 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex32/MatrixStructureTheory.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex32/MatrixStructureTheory.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2015 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32 { diff --git a/src/UnitTests/LinearAlgebraTests/Complex32/MatrixTests.Arithmetic.cs b/src/UnitTests/LinearAlgebraTests/Complex32/MatrixTests.Arithmetic.cs index 46923654..14cbf42d 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex32/MatrixTests.Arithmetic.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex32/MatrixTests.Arithmetic.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.Distributions; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex32; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32 { diff --git a/src/UnitTests/LinearAlgebraTests/Complex32/MatrixTests.cs b/src/UnitTests/LinearAlgebraTests/Complex32/MatrixTests.cs index 4a08f61d..2ff01efd 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex32/MatrixTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex32/MatrixTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + +using NUnitFramework.NUnit.Framework; + namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32 { - using NUnit.Framework; - /// /// Abstract class with the common set of matrix tests /// diff --git a/src/UnitTests/LinearAlgebraTests/Complex32/ReturnTypeTests.cs b/src/UnitTests/LinearAlgebraTests/Complex32/ReturnTypeTests.cs index 0dda7e98..27f266d1 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex32/ReturnTypeTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex32/ReturnTypeTests.cs @@ -1,6 +1,37 @@ -using MathNet.Numerics.LinearAlgebra; +// +// Math.NET Numerics, part of the Math.NET Project +// http://numerics.mathdotnet.com +// http://github.com/mathnet/mathnet-numerics +// +// Copyright (c) 2009-2016 Math.NET +// +// 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. +// + +extern alias NUnitFramework; + +using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex32; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32 { diff --git a/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/Iterative/BiCgStabTest.cs b/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/Iterative/BiCgStabTest.cs index b5a58f48..7b101dd6 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/Iterative/BiCgStabTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/Iterative/BiCgStabTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,12 +27,14 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex32; using MathNet.Numerics.LinearAlgebra.Complex32.Solvers; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32.Solvers.Iterative { diff --git a/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/Iterative/GpBiCgTest.cs b/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/Iterative/GpBiCgTest.cs index 9cfd50b6..2e4280f2 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/Iterative/GpBiCgTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/Iterative/GpBiCgTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,12 +27,14 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex32; using MathNet.Numerics.LinearAlgebra.Complex32.Solvers; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32.Solvers.Iterative { diff --git a/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/Iterative/MlkBiCgStabTest.cs b/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/Iterative/MlkBiCgStabTest.cs index 247c0846..63a1c650 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/Iterative/MlkBiCgStabTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/Iterative/MlkBiCgStabTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,12 +27,14 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex32; using MathNet.Numerics.LinearAlgebra.Complex32.Solvers; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32.Solvers.Iterative { diff --git a/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/Iterative/TFQMRTest.cs b/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/Iterative/TFQMRTest.cs index 2072a286..26200330 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/Iterative/TFQMRTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/Iterative/TFQMRTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,12 +27,14 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex32; using MathNet.Numerics.LinearAlgebra.Complex32.Solvers; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32.Solvers.Iterative { diff --git a/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/IteratorTest.cs b/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/IteratorTest.cs index 70521792..dcf400d1 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/IteratorTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/IteratorTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Collections.Generic; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32.Solvers { diff --git a/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/Preconditioners/DiagonalTest.cs b/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/Preconditioners/DiagonalTest.cs index 005bae39..f616d1e6 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/Preconditioners/DiagonalTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/Preconditioners/DiagonalTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex32; using MathNet.Numerics.LinearAlgebra.Complex32.Solvers; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32.Solvers.Preconditioners { diff --git a/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/Preconditioners/IluptElementSorterTest.cs b/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/Preconditioners/IluptElementSorterTest.cs index 3d4881ac..938a1563 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/Preconditioners/IluptElementSorterTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/Preconditioners/IluptElementSorterTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,9 +27,11 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra.Complex32; using MathNet.Numerics.LinearAlgebra.Complex32.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32.Solvers.Preconditioners { diff --git a/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/Preconditioners/IlutpTest.cs b/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/Preconditioners/IlutpTest.cs index dac63281..30a5d55d 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/Preconditioners/IlutpTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/Preconditioners/IlutpTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,13 +27,15 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Reflection; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex32; using MathNet.Numerics.LinearAlgebra.Complex32.Solvers; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32.Solvers.Preconditioners { diff --git a/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/Preconditioners/IncompleteLUTest.cs b/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/Preconditioners/IncompleteLUTest.cs index 213d90d4..afda8cc1 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/Preconditioners/IncompleteLUTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/Preconditioners/IncompleteLUTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,13 +27,15 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Reflection; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex32; using MathNet.Numerics.LinearAlgebra.Complex32.Solvers; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32.Solvers.Preconditioners { diff --git a/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/Preconditioners/PreConditionerTest.cs b/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/Preconditioners/PreConditionerTest.cs index f8118a6a..23903b9c 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/Preconditioners/PreConditionerTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/Preconditioners/PreConditionerTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex32; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32.Solvers.Preconditioners { diff --git a/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/Preconditioners/UnitPreconditionerTest.cs b/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/Preconditioners/UnitPreconditionerTest.cs index 92f145cd..31c2d207 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/Preconditioners/UnitPreconditionerTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/Preconditioners/UnitPreconditionerTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex32; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32.Solvers.Preconditioners { diff --git a/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/StopCriterion/DivergenceStopCriteriumTest.cs b/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/StopCriterion/DivergenceStopCriteriumTest.cs index 62b81296..c919dbc1 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/StopCriterion/DivergenceStopCriteriumTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/StopCriterion/DivergenceStopCriteriumTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex32; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32.Solvers.StopCriterion { diff --git a/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/StopCriterion/FailureStopCriteriumTest.cs b/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/StopCriterion/FailureStopCriteriumTest.cs index 70b831f2..cc2363d7 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/StopCriterion/FailureStopCriteriumTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/StopCriterion/FailureStopCriteriumTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex32; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32.Solvers.StopCriterion { diff --git a/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/StopCriterion/IterationCountStopCriteriumTest.cs b/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/StopCriterion/IterationCountStopCriteriumTest.cs index ec21e854..2fa7741e 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/StopCriterion/IterationCountStopCriteriumTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/StopCriterion/IterationCountStopCriteriumTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32.Solvers.StopCriterion { diff --git a/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/StopCriterion/ResidualStopCriteriumTest.cs b/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/StopCriterion/ResidualStopCriteriumTest.cs index 95096e0f..47b2de7d 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/StopCriterion/ResidualStopCriteriumTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex32/Solvers/StopCriterion/ResidualStopCriteriumTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex32; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32.Solvers.StopCriterion { diff --git a/src/UnitTests/LinearAlgebraTests/Complex32/SparseMatrixTests.cs b/src/UnitTests/LinearAlgebraTests/Complex32/SparseMatrixTests.cs index 9b715e93..a4ac8ef4 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex32/SparseMatrixTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex32/SparseMatrixTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Collections.Generic; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex32; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32 { @@ -90,7 +92,7 @@ namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32 [Test] public void MatrixFrom1DArrayIsCopy() { - // Sparse Matrix copies values from Complex32[], but no remember reference. + // Sparse Matrix copies values from Complex32[], but no remember reference. var data = new[] {new Complex32(1.0f, 1), new Complex32(1.0f, 1), new Complex32(1.0f, 1), new Complex32(1.0f, 1), new Complex32(1.0f, 1), new Complex32(1.0f, 1), new Complex32(2.0f, 1), new Complex32(2.0f, 1), new Complex32(2.0f, 1)}; var matrix = SparseMatrix.OfColumnMajor(3, 3, data); matrix[0, 0] = new Complex32(10.0f, 1); diff --git a/src/UnitTests/LinearAlgebraTests/Complex32/SparseVectorTest.cs b/src/UnitTests/LinearAlgebraTests/Complex32/SparseVectorTest.cs index 7150b5d7..689d1ae1 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex32/SparseVectorTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex32/SparseVectorTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex32; using MathNet.Numerics.LinearAlgebra.Storage; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; using System; using System.Collections.Generic; diff --git a/src/UnitTests/LinearAlgebraTests/Complex32/UserDefinedVectorTests.cs b/src/UnitTests/LinearAlgebraTests/Complex32/UserDefinedVectorTests.cs index 7c0ea041..480ef5ef 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex32/UserDefinedVectorTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex32/UserDefinedVectorTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; using System.Collections.Generic; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32 diff --git a/src/UnitTests/LinearAlgebraTests/Complex32/VectorArithmeticTheory.cs b/src/UnitTests/LinearAlgebraTests/Complex32/VectorArithmeticTheory.cs index a2ce978d..2d70da7a 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex32/VectorArithmeticTheory.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex32/VectorArithmeticTheory.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2015 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32 { diff --git a/src/UnitTests/LinearAlgebraTests/Complex32/VectorTests.Arithmetic.cs b/src/UnitTests/LinearAlgebraTests/Complex32/VectorTests.Arithmetic.cs index a72bc168..aee6069b 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex32/VectorTests.Arithmetic.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex32/VectorTests.Arithmetic.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; using System; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32 diff --git a/src/UnitTests/LinearAlgebraTests/Complex32/VectorTests.Norm.cs b/src/UnitTests/LinearAlgebraTests/Complex32/VectorTests.Norm.cs index c650d1ed..33fb5504 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex32/VectorTests.Norm.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex32/VectorTests.Norm.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + +using NUnitFramework.NUnit.Framework; + namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32 { - using System; - using NUnit.Framework; using Complex32 = Numerics.Complex32; /// @@ -90,7 +96,7 @@ namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32 { var vector = CreateVector(Data); AssertHelpers.AlmostEqualRelative(5.0990195, vector.InfinityNorm(), 6); - AssertHelpers.AlmostEqualRelative(5.0990195, vector.Norm(Single.PositiveInfinity), 6); + AssertHelpers.AlmostEqualRelative(5.0990195, vector.Norm(float.PositiveInfinity), 6); } /// diff --git a/src/UnitTests/LinearAlgebraTests/Complex32/VectorTests.cs b/src/UnitTests/LinearAlgebraTests/Complex32/VectorTests.cs index 57108d09..0faa11a7 100644 --- a/src/UnitTests/LinearAlgebraTests/Complex32/VectorTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Complex32/VectorTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,6 +27,8 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Collections; using System.Collections.Generic; @@ -34,7 +36,7 @@ using System.Linq; using MathNet.Numerics.Distributions; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Complex32; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Complex32 { diff --git a/src/UnitTests/LinearAlgebraTests/Double/DenseMatrixTests.cs b/src/UnitTests/LinearAlgebraTests/Double/DenseMatrixTests.cs index 9414b271..fb8c5d8e 100644 --- a/src/UnitTests/LinearAlgebraTests/Double/DenseMatrixTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Double/DenseMatrixTests.cs @@ -1,9 +1,9 @@ -//// +// // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Collections.Generic; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Double; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double { diff --git a/src/UnitTests/LinearAlgebraTests/Double/DenseVectorTests.cs b/src/UnitTests/LinearAlgebraTests/Double/DenseVectorTests.cs index 36bfb270..8b81cf6b 100644 --- a/src/UnitTests/LinearAlgebraTests/Double/DenseVectorTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Double/DenseVectorTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,9 +27,11 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Double; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; using System; using System.Collections.Generic; diff --git a/src/UnitTests/LinearAlgebraTests/Double/DiagonalMatrixTests.cs b/src/UnitTests/LinearAlgebraTests/Double/DiagonalMatrixTests.cs index 223a8c2d..1c2b7e0c 100644 --- a/src/UnitTests/LinearAlgebraTests/Double/DiagonalMatrixTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Double/DiagonalMatrixTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,13 +27,15 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Collections.Generic; using MathNet.Numerics.Distributions; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Double; using MathNet.Numerics.Random; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double { diff --git a/src/UnitTests/LinearAlgebraTests/Double/Factorization/CholeskyTests.cs b/src/UnitTests/LinearAlgebraTests/Double/Factorization/CholeskyTests.cs index 7c5bfc46..fe87cf1b 100644 --- a/src/UnitTests/LinearAlgebraTests/Double/Factorization/CholeskyTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Double/Factorization/CholeskyTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,9 +27,11 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Double; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double.Factorization { diff --git a/src/UnitTests/LinearAlgebraTests/Double/Factorization/EvdTests.cs b/src/UnitTests/LinearAlgebraTests/Double/Factorization/EvdTests.cs index 04f5f78c..cc49d274 100644 --- a/src/UnitTests/LinearAlgebraTests/Double/Factorization/EvdTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Double/Factorization/EvdTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,9 +27,11 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Double; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double.Factorization { @@ -93,7 +95,7 @@ namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double.Factorization var factorEvd = A.Evd(); var V = factorEvd.EigenVectors; var λ = factorEvd.D; - + Assert.AreEqual(order, V.RowCount); Assert.AreEqual(order, V.ColumnCount); Assert.AreEqual(order, λ.RowCount); @@ -167,7 +169,7 @@ namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double.Factorization AssertHelpers.AlmostEqual(bCopy, b, 14); } - //private + //private /// /// Can solve a system of linear equations for a random matrix and symmetric matrix (AX=B). /// diff --git a/src/UnitTests/LinearAlgebraTests/Double/Factorization/GramSchmidtTests.cs b/src/UnitTests/LinearAlgebraTests/Double/Factorization/GramSchmidtTests.cs index 7429284c..6df85aa8 100644 --- a/src/UnitTests/LinearAlgebraTests/Double/Factorization/GramSchmidtTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Double/Factorization/GramSchmidtTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Double; using MathNet.Numerics.LinearAlgebra.Double.Factorization; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double.Factorization { diff --git a/src/UnitTests/LinearAlgebraTests/Double/Factorization/LUTests.cs b/src/UnitTests/LinearAlgebraTests/Double/Factorization/LUTests.cs index b223c72f..84c38a8e 100644 --- a/src/UnitTests/LinearAlgebraTests/Double/Factorization/LUTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Double/Factorization/LUTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,9 +27,11 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Double; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double.Factorization { diff --git a/src/UnitTests/LinearAlgebraTests/Double/Factorization/QRTests.cs b/src/UnitTests/LinearAlgebraTests/Double/Factorization/QRTests.cs index 07db3263..14f7dcdf 100644 --- a/src/UnitTests/LinearAlgebraTests/Double/Factorization/QRTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Double/Factorization/QRTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,12 +27,14 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Double; using MathNet.Numerics.LinearAlgebra.Double.Factorization; using MathNet.Numerics.LinearAlgebra.Factorization; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double.Factorization { @@ -173,7 +179,7 @@ namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double.Factorization } } - // Make sure the Q is unitary --> (Q*)x(Q) = + // Make sure the Q is unitary --> (Q*)x(Q) = var matrixQtQ = q.Transpose() * q; for (var i = 0; i < matrixQtQ.RowCount; i++) { @@ -232,7 +238,7 @@ namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double.Factorization } } - // Make sure the Q is unitary --> (Q*)x(Q) = + // Make sure the Q is unitary --> (Q*)x(Q) = var matrixQtQ = q.Transpose() * q; for (var i = 0; i < matrixQtQ.RowCount; i++) { @@ -661,7 +667,7 @@ namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double.Factorization } } } - + /// /// Can solve when using a tall matrix. /// diff --git a/src/UnitTests/LinearAlgebraTests/Double/Factorization/SvdTests.cs b/src/UnitTests/LinearAlgebraTests/Double/Factorization/SvdTests.cs index d04d58ce..f885dc2e 100644 --- a/src/UnitTests/LinearAlgebraTests/Double/Factorization/SvdTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Double/Factorization/SvdTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Double; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double.Factorization { diff --git a/src/UnitTests/LinearAlgebraTests/Double/Factorization/UserCholeskyTests.cs b/src/UnitTests/LinearAlgebraTests/Double/Factorization/UserCholeskyTests.cs index 71196abb..434d6843 100644 --- a/src/UnitTests/LinearAlgebraTests/Double/Factorization/UserCholeskyTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Double/Factorization/UserCholeskyTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double.Factorization { diff --git a/src/UnitTests/LinearAlgebraTests/Double/Factorization/UserEvdTests.cs b/src/UnitTests/LinearAlgebraTests/Double/Factorization/UserEvdTests.cs index 37c7bc05..60baa24d 100644 --- a/src/UnitTests/LinearAlgebraTests/Double/Factorization/UserEvdTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Double/Factorization/UserEvdTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double.Factorization { @@ -90,7 +96,7 @@ namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double.Factorization Assert.AreEqual(order, d.RowCount); Assert.AreEqual(order, d.ColumnCount); - // Make sure the A*V = λ*V + // Make sure the A*V = λ*V var matrixAv = matrixA * eigenVectors; var matrixLv = eigenVectors * d; @@ -126,7 +132,7 @@ namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double.Factorization Assert.AreEqual(order, d.RowCount); Assert.AreEqual(order, d.ColumnCount); - // Make sure the A = V*λ*VT + // Make sure the A = V*λ*VT var matrix = eigenVectors * d * eigenVectors.Transpose(); for (var i = 0; i < matrix.RowCount; i++) diff --git a/src/UnitTests/LinearAlgebraTests/Double/Factorization/UserGramSchmidtTests.cs b/src/UnitTests/LinearAlgebraTests/Double/Factorization/UserGramSchmidtTests.cs index 7d565ada..5e2fe99c 100644 --- a/src/UnitTests/LinearAlgebraTests/Double/Factorization/UserGramSchmidtTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Double/Factorization/UserGramSchmidtTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,9 +27,11 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Double.Factorization; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double.Factorization { diff --git a/src/UnitTests/LinearAlgebraTests/Double/Factorization/UserLUTests.cs b/src/UnitTests/LinearAlgebraTests/Double/Factorization/UserLUTests.cs index 053bf667..7b1d91a3 100644 --- a/src/UnitTests/LinearAlgebraTests/Double/Factorization/UserLUTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Double/Factorization/UserLUTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double.Factorization { diff --git a/src/UnitTests/LinearAlgebraTests/Double/Factorization/UserQRTests.cs b/src/UnitTests/LinearAlgebraTests/Double/Factorization/UserQRTests.cs index 039bb09f..4057b63f 100644 --- a/src/UnitTests/LinearAlgebraTests/Double/Factorization/UserQRTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Double/Factorization/UserQRTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Double.Factorization; using MathNet.Numerics.LinearAlgebra.Factorization; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double.Factorization { diff --git a/src/UnitTests/LinearAlgebraTests/Double/Factorization/UserSvdTests.cs b/src/UnitTests/LinearAlgebraTests/Double/Factorization/UserSvdTests.cs index cbd2f508..08d02d16 100644 --- a/src/UnitTests/LinearAlgebraTests/Double/Factorization/UserSvdTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Double/Factorization/UserSvdTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,9 +27,11 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double.Factorization { diff --git a/src/UnitTests/LinearAlgebraTests/Double/MatrixLoader.cs b/src/UnitTests/LinearAlgebraTests/Double/MatrixLoader.cs index b6922968..5b57374a 100644 --- a/src/UnitTests/LinearAlgebraTests/Double/MatrixLoader.cs +++ b/src/UnitTests/LinearAlgebraTests/Double/MatrixLoader.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,9 +27,11 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System.Collections.Generic; using MathNet.Numerics.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double { diff --git a/src/UnitTests/LinearAlgebraTests/Double/MatrixStructureTheory.cs b/src/UnitTests/LinearAlgebraTests/Double/MatrixStructureTheory.cs index 28c08c81..518e7344 100644 --- a/src/UnitTests/LinearAlgebraTests/Double/MatrixStructureTheory.cs +++ b/src/UnitTests/LinearAlgebraTests/Double/MatrixStructureTheory.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2015 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double { diff --git a/src/UnitTests/LinearAlgebraTests/Double/MatrixTests.Arithmetic.cs b/src/UnitTests/LinearAlgebraTests/Double/MatrixTests.Arithmetic.cs index 404f9154..15382812 100644 --- a/src/UnitTests/LinearAlgebraTests/Double/MatrixTests.Arithmetic.cs +++ b/src/UnitTests/LinearAlgebraTests/Double/MatrixTests.Arithmetic.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.Distributions; using MathNet.Numerics.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double { diff --git a/src/UnitTests/LinearAlgebraTests/Double/MatrixTests.cs b/src/UnitTests/LinearAlgebraTests/Double/MatrixTests.cs index 5226e60f..d7229160 100644 --- a/src/UnitTests/LinearAlgebraTests/Double/MatrixTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Double/MatrixTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + +using NUnitFramework.NUnit.Framework; + namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double { - using NUnit.Framework; - /// /// Abstract class with the common set of matrix tests /// diff --git a/src/UnitTests/LinearAlgebraTests/Double/ReturnTypeTests.cs b/src/UnitTests/LinearAlgebraTests/Double/ReturnTypeTests.cs index 95ab6fc7..83cdfa11 100644 --- a/src/UnitTests/LinearAlgebraTests/Double/ReturnTypeTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Double/ReturnTypeTests.cs @@ -1,6 +1,37 @@ -using MathNet.Numerics.LinearAlgebra; +// +// Math.NET Numerics, part of the Math.NET Project +// http://numerics.mathdotnet.com +// http://github.com/mathnet/mathnet-numerics +// +// Copyright (c) 2009-2016 Math.NET +// +// 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. +// + +extern alias NUnitFramework; + +using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Double; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double { diff --git a/src/UnitTests/LinearAlgebraTests/Double/Solvers/Iterative/BiCgStabTest.cs b/src/UnitTests/LinearAlgebraTests/Double/Solvers/Iterative/BiCgStabTest.cs index 676e62fd..3ea6f8e7 100644 --- a/src/UnitTests/LinearAlgebraTests/Double/Solvers/Iterative/BiCgStabTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Double/Solvers/Iterative/BiCgStabTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,12 +27,14 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Double; using MathNet.Numerics.LinearAlgebra.Double.Solvers; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double.Solvers.Iterative { diff --git a/src/UnitTests/LinearAlgebraTests/Double/Solvers/Iterative/GpBiCgTest.cs b/src/UnitTests/LinearAlgebraTests/Double/Solvers/Iterative/GpBiCgTest.cs index d77d2f3a..7ea3e513 100644 --- a/src/UnitTests/LinearAlgebraTests/Double/Solvers/Iterative/GpBiCgTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Double/Solvers/Iterative/GpBiCgTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,12 +27,14 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Double; using MathNet.Numerics.LinearAlgebra.Double.Solvers; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double.Solvers.Iterative { diff --git a/src/UnitTests/LinearAlgebraTests/Double/Solvers/Iterative/MlkBiCgStabTest.cs b/src/UnitTests/LinearAlgebraTests/Double/Solvers/Iterative/MlkBiCgStabTest.cs index f78b85fd..7545d0cf 100644 --- a/src/UnitTests/LinearAlgebraTests/Double/Solvers/Iterative/MlkBiCgStabTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Double/Solvers/Iterative/MlkBiCgStabTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,12 +27,14 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Double; using MathNet.Numerics.LinearAlgebra.Double.Solvers; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double.Solvers.Iterative { diff --git a/src/UnitTests/LinearAlgebraTests/Double/Solvers/Iterative/TFQMRTest.cs b/src/UnitTests/LinearAlgebraTests/Double/Solvers/Iterative/TFQMRTest.cs index 527efb38..c561c85c 100644 --- a/src/UnitTests/LinearAlgebraTests/Double/Solvers/Iterative/TFQMRTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Double/Solvers/Iterative/TFQMRTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,12 +27,14 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Double; using MathNet.Numerics.LinearAlgebra.Double.Solvers; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double.Solvers.Iterative { diff --git a/src/UnitTests/LinearAlgebraTests/Double/Solvers/IteratorTest.cs b/src/UnitTests/LinearAlgebraTests/Double/Solvers/IteratorTest.cs index 59fc7fd6..d2a0bfb6 100644 --- a/src/UnitTests/LinearAlgebraTests/Double/Solvers/IteratorTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Double/Solvers/IteratorTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Collections.Generic; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double.Solvers { diff --git a/src/UnitTests/LinearAlgebraTests/Double/Solvers/Preconditioners/DiagonalTest.cs b/src/UnitTests/LinearAlgebraTests/Double/Solvers/Preconditioners/DiagonalTest.cs index f9b98610..a3227285 100644 --- a/src/UnitTests/LinearAlgebraTests/Double/Solvers/Preconditioners/DiagonalTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Double/Solvers/Preconditioners/DiagonalTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Double; using MathNet.Numerics.LinearAlgebra.Double.Solvers; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double.Solvers.Preconditioners { diff --git a/src/UnitTests/LinearAlgebraTests/Double/Solvers/Preconditioners/IluptElementSorterTest.cs b/src/UnitTests/LinearAlgebraTests/Double/Solvers/Preconditioners/IluptElementSorterTest.cs index fa0ffcab..ef3e9d7f 100644 --- a/src/UnitTests/LinearAlgebraTests/Double/Solvers/Preconditioners/IluptElementSorterTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Double/Solvers/Preconditioners/IluptElementSorterTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,9 +27,11 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra.Double; using MathNet.Numerics.LinearAlgebra.Double.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double.Solvers.Preconditioners { diff --git a/src/UnitTests/LinearAlgebraTests/Double/Solvers/Preconditioners/IlutpTest.cs b/src/UnitTests/LinearAlgebraTests/Double/Solvers/Preconditioners/IlutpTest.cs index ced53f7b..a3330ba6 100644 --- a/src/UnitTests/LinearAlgebraTests/Double/Solvers/Preconditioners/IlutpTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Double/Solvers/Preconditioners/IlutpTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,13 +27,15 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Reflection; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Double; using MathNet.Numerics.LinearAlgebra.Double.Solvers; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double.Solvers.Preconditioners { diff --git a/src/UnitTests/LinearAlgebraTests/Double/Solvers/Preconditioners/IncompleteLUTest.cs b/src/UnitTests/LinearAlgebraTests/Double/Solvers/Preconditioners/IncompleteLUTest.cs index 1ee510f2..19cba856 100644 --- a/src/UnitTests/LinearAlgebraTests/Double/Solvers/Preconditioners/IncompleteLUTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Double/Solvers/Preconditioners/IncompleteLUTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,13 +27,15 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Reflection; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Double; using MathNet.Numerics.LinearAlgebra.Double.Solvers; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double.Solvers.Preconditioners { diff --git a/src/UnitTests/LinearAlgebraTests/Double/Solvers/Preconditioners/PreConditionerTest.cs b/src/UnitTests/LinearAlgebraTests/Double/Solvers/Preconditioners/PreConditionerTest.cs index efbc050e..3b14d6c8 100644 --- a/src/UnitTests/LinearAlgebraTests/Double/Solvers/Preconditioners/PreConditionerTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Double/Solvers/Preconditioners/PreConditionerTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Double; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double.Solvers.Preconditioners { diff --git a/src/UnitTests/LinearAlgebraTests/Double/Solvers/Preconditioners/UnitPreconditionerTest.cs b/src/UnitTests/LinearAlgebraTests/Double/Solvers/Preconditioners/UnitPreconditionerTest.cs index 5652fe8a..7c48654b 100644 --- a/src/UnitTests/LinearAlgebraTests/Double/Solvers/Preconditioners/UnitPreconditionerTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Double/Solvers/Preconditioners/UnitPreconditionerTest.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Double; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double.Solvers.Preconditioners { diff --git a/src/UnitTests/LinearAlgebraTests/Double/Solvers/StopCriterion/DivergenceStopCriteriumTest.cs b/src/UnitTests/LinearAlgebraTests/Double/Solvers/StopCriterion/DivergenceStopCriteriumTest.cs index 51689b19..2a80cbc9 100644 --- a/src/UnitTests/LinearAlgebraTests/Double/Solvers/StopCriterion/DivergenceStopCriteriumTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Double/Solvers/StopCriterion/DivergenceStopCriteriumTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Double; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double.Solvers.StopCriterion { diff --git a/src/UnitTests/LinearAlgebraTests/Double/Solvers/StopCriterion/FailureStopCriteriumTest.cs b/src/UnitTests/LinearAlgebraTests/Double/Solvers/StopCriterion/FailureStopCriteriumTest.cs index f2e6d5c2..2f1553e5 100644 --- a/src/UnitTests/LinearAlgebraTests/Double/Solvers/StopCriterion/FailureStopCriteriumTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Double/Solvers/StopCriterion/FailureStopCriteriumTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Double; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double.Solvers.StopCriterion { diff --git a/src/UnitTests/LinearAlgebraTests/Double/Solvers/StopCriterion/IterationCountStopCriteriumTest.cs b/src/UnitTests/LinearAlgebraTests/Double/Solvers/StopCriterion/IterationCountStopCriteriumTest.cs index dee8e277..46f95f56 100644 --- a/src/UnitTests/LinearAlgebraTests/Double/Solvers/StopCriterion/IterationCountStopCriteriumTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Double/Solvers/StopCriterion/IterationCountStopCriteriumTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double.Solvers.StopCriterion { diff --git a/src/UnitTests/LinearAlgebraTests/Double/Solvers/StopCriterion/ResidualStopCriteriumTest.cs b/src/UnitTests/LinearAlgebraTests/Double/Solvers/StopCriterion/ResidualStopCriteriumTest.cs index 915da3a8..28a4e950 100644 --- a/src/UnitTests/LinearAlgebraTests/Double/Solvers/StopCriterion/ResidualStopCriteriumTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Double/Solvers/StopCriterion/ResidualStopCriteriumTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double.Solvers.StopCriterion { diff --git a/src/UnitTests/LinearAlgebraTests/Double/SparseMatrixTests.cs b/src/UnitTests/LinearAlgebraTests/Double/SparseMatrixTests.cs index 8a964f6a..4f316ff4 100644 --- a/src/UnitTests/LinearAlgebraTests/Double/SparseMatrixTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Double/SparseMatrixTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Collections.Generic; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Double; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double { @@ -88,7 +90,7 @@ namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double [Test] public void MatrixFrom1DArrayIsCopy() { - // Sparse Matrix copies values from double[], but no remember reference. + // Sparse Matrix copies values from double[], but no remember reference. var data = new double[] {1, 1, 1, 1, 1, 1, 2, 2, 2}; var matrix = Matrix.Build.SparseOfColumnMajor(3, 3, data); matrix[0, 0] = 10.0; diff --git a/src/UnitTests/LinearAlgebraTests/Double/SparseVectorTest.cs b/src/UnitTests/LinearAlgebraTests/Double/SparseVectorTest.cs index de1a90ae..4ce7c23f 100644 --- a/src/UnitTests/LinearAlgebraTests/Double/SparseVectorTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Double/SparseVectorTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Double; using MathNet.Numerics.LinearAlgebra.Storage; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; using System; using System.Collections.Generic; diff --git a/src/UnitTests/LinearAlgebraTests/Double/UserDefinedVectorTests.cs b/src/UnitTests/LinearAlgebraTests/Double/UserDefinedVectorTests.cs index cf89112d..c143ead7 100644 --- a/src/UnitTests/LinearAlgebraTests/Double/UserDefinedVectorTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Double/UserDefinedVectorTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; using System.Collections.Generic; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double diff --git a/src/UnitTests/LinearAlgebraTests/Double/VectorArithmeticTheory.cs b/src/UnitTests/LinearAlgebraTests/Double/VectorArithmeticTheory.cs index b052ed09..5d215d19 100644 --- a/src/UnitTests/LinearAlgebraTests/Double/VectorArithmeticTheory.cs +++ b/src/UnitTests/LinearAlgebraTests/Double/VectorArithmeticTheory.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2015 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double { diff --git a/src/UnitTests/LinearAlgebraTests/Double/VectorTests.Arithmetic.cs b/src/UnitTests/LinearAlgebraTests/Double/VectorTests.Arithmetic.cs index 73520dcd..67e6bd37 100644 --- a/src/UnitTests/LinearAlgebraTests/Double/VectorTests.Arithmetic.cs +++ b/src/UnitTests/LinearAlgebraTests/Double/VectorTests.Arithmetic.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; using System; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double diff --git a/src/UnitTests/LinearAlgebraTests/Double/VectorTests.Norm.cs b/src/UnitTests/LinearAlgebraTests/Double/VectorTests.Norm.cs index 1f6fe9ad..eb31f114 100644 --- a/src/UnitTests/LinearAlgebraTests/Double/VectorTests.Norm.cs +++ b/src/UnitTests/LinearAlgebraTests/Double/VectorTests.Norm.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,11 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + +using NUnitFramework.NUnit.Framework; + namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double { - using System; - using NUnit.Framework; - /// /// Abstract class with the norms set of vector tests. /// @@ -89,7 +94,7 @@ namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double { var vector = CreateVector(Data); AssertHelpers.AlmostEqualRelative(5.0, vector.InfinityNorm(), 14); - AssertHelpers.AlmostEqualRelative(5.0, vector.Norm(Double.PositiveInfinity), 14); + AssertHelpers.AlmostEqualRelative(5.0, vector.Norm(double.PositiveInfinity), 14); } /// diff --git a/src/UnitTests/LinearAlgebraTests/Double/VectorTests.cs b/src/UnitTests/LinearAlgebraTests/Double/VectorTests.cs index 5ef4afbf..2afda102 100644 --- a/src/UnitTests/LinearAlgebraTests/Double/VectorTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Double/VectorTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,12 +27,14 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Collections; using System.Collections.Generic; using MathNet.Numerics.Distributions; using MathNet.Numerics.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Double { diff --git a/src/UnitTests/LinearAlgebraTests/MatrixHelpers.cs b/src/UnitTests/LinearAlgebraTests/MatrixHelpers.cs index 0b5215a5..1c58a272 100644 --- a/src/UnitTests/LinearAlgebraTests/MatrixHelpers.cs +++ b/src/UnitTests/LinearAlgebraTests/MatrixHelpers.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 diff --git a/src/UnitTests/LinearAlgebraTests/MatrixStorageCombinatorsTests.cs b/src/UnitTests/LinearAlgebraTests/MatrixStorageCombinatorsTests.cs index 9c0b88c7..99222f8d 100644 --- a/src/UnitTests/LinearAlgebraTests/MatrixStorageCombinatorsTests.cs +++ b/src/UnitTests/LinearAlgebraTests/MatrixStorageCombinatorsTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System.Threading; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Storage; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests { diff --git a/src/UnitTests/LinearAlgebraTests/MatrixStorageSerializationTests.cs b/src/UnitTests/LinearAlgebraTests/MatrixStorageSerializationTests.cs index 69e02baa..c3f88f0d 100644 --- a/src/UnitTests/LinearAlgebraTests/MatrixStorageSerializationTests.cs +++ b/src/UnitTests/LinearAlgebraTests/MatrixStorageSerializationTests.cs @@ -1,9 +1,40 @@ -using System; +// +// Math.NET Numerics, part of the Math.NET Project +// http://numerics.mathdotnet.com +// http://github.com/mathnet/mathnet-numerics +// +// Copyright (c) 2009-2016 Math.NET +// +// 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. +// + +extern alias NUnitFramework; + +using System; using System.IO; using System.Runtime.Serialization; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Storage; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests { diff --git a/src/UnitTests/LinearAlgebraTests/MatrixStructureTheory.Access.cs b/src/UnitTests/LinearAlgebraTests/MatrixStructureTheory.Access.cs index 7a9fc6a8..c73065b0 100644 --- a/src/UnitTests/LinearAlgebraTests/MatrixStructureTheory.Access.cs +++ b/src/UnitTests/LinearAlgebraTests/MatrixStructureTheory.Access.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; using System; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests diff --git a/src/UnitTests/LinearAlgebraTests/MatrixStructureTheory.Functional.cs b/src/UnitTests/LinearAlgebraTests/MatrixStructureTheory.Functional.cs index 193d0ce4..90512d0d 100644 --- a/src/UnitTests/LinearAlgebraTests/MatrixStructureTheory.Functional.cs +++ b/src/UnitTests/LinearAlgebraTests/MatrixStructureTheory.Functional.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,9 +27,11 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System.Linq; using MathNet.Numerics.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests { diff --git a/src/UnitTests/LinearAlgebraTests/MatrixStructureTheory.Reform.cs b/src/UnitTests/LinearAlgebraTests/MatrixStructureTheory.Reform.cs index ec119e9d..b2adf406 100644 --- a/src/UnitTests/LinearAlgebraTests/MatrixStructureTheory.Reform.cs +++ b/src/UnitTests/LinearAlgebraTests/MatrixStructureTheory.Reform.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Linq; using MathNet.Numerics.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests { diff --git a/src/UnitTests/LinearAlgebraTests/MatrixStructureTheory.cs b/src/UnitTests/LinearAlgebraTests/MatrixStructureTheory.cs index c2e694dc..62f26e58 100644 --- a/src/UnitTests/LinearAlgebraTests/MatrixStructureTheory.cs +++ b/src/UnitTests/LinearAlgebraTests/MatrixStructureTheory.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2015 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Linq; using MathNet.Numerics.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests { diff --git a/src/UnitTests/LinearAlgebraTests/Single/DenseMatrixTests.cs b/src/UnitTests/LinearAlgebraTests/Single/DenseMatrixTests.cs index 83fce669..8edf11db 100644 --- a/src/UnitTests/LinearAlgebraTests/Single/DenseMatrixTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Single/DenseMatrixTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Collections.Generic; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Single; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single { diff --git a/src/UnitTests/LinearAlgebraTests/Single/DenseVectorTests.cs b/src/UnitTests/LinearAlgebraTests/Single/DenseVectorTests.cs index 6b77cdbe..8c547d58 100644 --- a/src/UnitTests/LinearAlgebraTests/Single/DenseVectorTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Single/DenseVectorTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,14 +27,16 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + +using MathNet.Numerics.LinearAlgebra; +using MathNet.Numerics.LinearAlgebra.Single; +using NUnitFramework.NUnit.Framework; +using System; +using System.Collections.Generic; + namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single { - using LinearAlgebra; - using LinearAlgebra.Single; - using NUnit.Framework; - using System; - using System.Collections.Generic; - /// /// Dense vector tests. /// diff --git a/src/UnitTests/LinearAlgebraTests/Single/DiagonalMatrixTests.cs b/src/UnitTests/LinearAlgebraTests/Single/DiagonalMatrixTests.cs index 12b30545..2e3aefaa 100644 --- a/src/UnitTests/LinearAlgebraTests/Single/DiagonalMatrixTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Single/DiagonalMatrixTests.cs @@ -1,9 +1,8 @@ -// // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,13 +26,15 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Collections.Generic; using MathNet.Numerics.Distributions; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Single; using MathNet.Numerics.Random; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single { diff --git a/src/UnitTests/LinearAlgebraTests/Single/Factorization/CholeskyTests.cs b/src/UnitTests/LinearAlgebraTests/Single/Factorization/CholeskyTests.cs index ac2e8dc3..c8dc685e 100644 --- a/src/UnitTests/LinearAlgebraTests/Single/Factorization/CholeskyTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Single/Factorization/CholeskyTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,9 +27,11 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Single; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Factorization { diff --git a/src/UnitTests/LinearAlgebraTests/Single/Factorization/EvdTests.cs b/src/UnitTests/LinearAlgebraTests/Single/Factorization/EvdTests.cs index 00418deb..2e5250fa 100644 --- a/src/UnitTests/LinearAlgebraTests/Single/Factorization/EvdTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Single/Factorization/EvdTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,9 +27,11 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Single; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Factorization { diff --git a/src/UnitTests/LinearAlgebraTests/Single/Factorization/GramSchmidtTests.cs b/src/UnitTests/LinearAlgebraTests/Single/Factorization/GramSchmidtTests.cs index 0f0ecbd0..e3313538 100644 --- a/src/UnitTests/LinearAlgebraTests/Single/Factorization/GramSchmidtTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Single/Factorization/GramSchmidtTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Single; using MathNet.Numerics.LinearAlgebra.Single.Factorization; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Factorization { diff --git a/src/UnitTests/LinearAlgebraTests/Single/Factorization/LUTests.cs b/src/UnitTests/LinearAlgebraTests/Single/Factorization/LUTests.cs index c02cb79c..18e4ccf5 100644 --- a/src/UnitTests/LinearAlgebraTests/Single/Factorization/LUTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Single/Factorization/LUTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,9 +27,11 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Single; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Factorization { diff --git a/src/UnitTests/LinearAlgebraTests/Single/Factorization/QRTests.cs b/src/UnitTests/LinearAlgebraTests/Single/Factorization/QRTests.cs index 98f49f7a..b1e6644e 100644 --- a/src/UnitTests/LinearAlgebraTests/Single/Factorization/QRTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Single/Factorization/QRTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,12 +27,14 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Factorization; using MathNet.Numerics.LinearAlgebra.Single; using MathNet.Numerics.LinearAlgebra.Single.Factorization; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Factorization { diff --git a/src/UnitTests/LinearAlgebraTests/Single/Factorization/SvdTests.cs b/src/UnitTests/LinearAlgebraTests/Single/Factorization/SvdTests.cs index de291df6..262d323d 100644 --- a/src/UnitTests/LinearAlgebraTests/Single/Factorization/SvdTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Single/Factorization/SvdTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Single; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Factorization { diff --git a/src/UnitTests/LinearAlgebraTests/Single/Factorization/UserCholeskyTests.cs b/src/UnitTests/LinearAlgebraTests/Single/Factorization/UserCholeskyTests.cs index 7f5de1e0..8bdfc1b8 100644 --- a/src/UnitTests/LinearAlgebraTests/Single/Factorization/UserCholeskyTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Single/Factorization/UserCholeskyTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,8 +27,9 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; using MathNet.Numerics.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Factorization { diff --git a/src/UnitTests/LinearAlgebraTests/Single/Factorization/UserEvdTests.cs b/src/UnitTests/LinearAlgebraTests/Single/Factorization/UserEvdTests.cs index 9a5d2b3b..7e9e2979 100644 --- a/src/UnitTests/LinearAlgebraTests/Single/Factorization/UserEvdTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Single/Factorization/UserEvdTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Factorization { @@ -90,7 +96,7 @@ namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Factorization Assert.AreEqual(order, d.RowCount); Assert.AreEqual(order, d.ColumnCount); - // Make sure the A*V = λ*V + // Make sure the A*V = λ*V var matrixAv = matrixA * eigenVectors; var matrixLv = eigenVectors * d; @@ -107,7 +113,7 @@ namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Factorization /// Can factorize a symmetric random square matrix. /// /// Matrix order. - [Test, Ignore] + [Test, Ignore("")] public void CanFactorizeRandomSymmetricMatrix([Values(1, 2, 5, 10, 50, 100)] int order) { var matrixA = new UserDefinedMatrix(Matrix.Build.RandomPositiveDefinite(order, 1).ToArray()); @@ -121,7 +127,7 @@ namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Factorization Assert.AreEqual(order, d.RowCount); Assert.AreEqual(order, d.ColumnCount); - // Make sure the A = V*λ*VT + // Make sure the A = V*λ*VT var matrix = eigenVectors * d * eigenVectors.Transpose(); for (var i = 0; i < matrix.RowCount; i++) diff --git a/src/UnitTests/LinearAlgebraTests/Single/Factorization/UserGramSchmidtTests.cs b/src/UnitTests/LinearAlgebraTests/Single/Factorization/UserGramSchmidtTests.cs index 84b8be18..2bca2598 100644 --- a/src/UnitTests/LinearAlgebraTests/Single/Factorization/UserGramSchmidtTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Single/Factorization/UserGramSchmidtTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,9 +27,11 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Single.Factorization; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Factorization { diff --git a/src/UnitTests/LinearAlgebraTests/Single/Factorization/UserLUTests.cs b/src/UnitTests/LinearAlgebraTests/Single/Factorization/UserLUTests.cs index ddfd9567..926657cb 100644 --- a/src/UnitTests/LinearAlgebraTests/Single/Factorization/UserLUTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Single/Factorization/UserLUTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Factorization { diff --git a/src/UnitTests/LinearAlgebraTests/Single/Factorization/UserQRTests.cs b/src/UnitTests/LinearAlgebraTests/Single/Factorization/UserQRTests.cs index 9ede2193..131c1b0a 100644 --- a/src/UnitTests/LinearAlgebraTests/Single/Factorization/UserQRTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Single/Factorization/UserQRTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Factorization; using MathNet.Numerics.LinearAlgebra.Single.Factorization; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Factorization { diff --git a/src/UnitTests/LinearAlgebraTests/Single/Factorization/UserSvdTests.cs b/src/UnitTests/LinearAlgebraTests/Single/Factorization/UserSvdTests.cs index b8cd9357..805a2af4 100644 --- a/src/UnitTests/LinearAlgebraTests/Single/Factorization/UserSvdTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Single/Factorization/UserSvdTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,9 +27,11 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Factorization { diff --git a/src/UnitTests/LinearAlgebraTests/Single/MatrixLoader.cs b/src/UnitTests/LinearAlgebraTests/Single/MatrixLoader.cs index 8294fa45..fe4bfe9b 100644 --- a/src/UnitTests/LinearAlgebraTests/Single/MatrixLoader.cs +++ b/src/UnitTests/LinearAlgebraTests/Single/MatrixLoader.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,9 +27,11 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System.Collections.Generic; using MathNet.Numerics.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single { diff --git a/src/UnitTests/LinearAlgebraTests/Single/MatrixStructureTheory.cs b/src/UnitTests/LinearAlgebraTests/Single/MatrixStructureTheory.cs index 2e61d7f8..27e628be 100644 --- a/src/UnitTests/LinearAlgebraTests/Single/MatrixStructureTheory.cs +++ b/src/UnitTests/LinearAlgebraTests/Single/MatrixStructureTheory.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2015 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single { diff --git a/src/UnitTests/LinearAlgebraTests/Single/MatrixTests.Arithmetic.cs b/src/UnitTests/LinearAlgebraTests/Single/MatrixTests.Arithmetic.cs index 6a781376..d49c20a3 100644 --- a/src/UnitTests/LinearAlgebraTests/Single/MatrixTests.Arithmetic.cs +++ b/src/UnitTests/LinearAlgebraTests/Single/MatrixTests.Arithmetic.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.Distributions; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Single; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single { diff --git a/src/UnitTests/LinearAlgebraTests/Single/MatrixTests.cs b/src/UnitTests/LinearAlgebraTests/Single/MatrixTests.cs index 8a29e8df..f2d227b8 100644 --- a/src/UnitTests/LinearAlgebraTests/Single/MatrixTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Single/MatrixTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,9 +27,11 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single { - using NUnit.Framework; + using NUnitFramework.NUnit.Framework; /// /// Abstract class with the common set of matrix tests diff --git a/src/UnitTests/LinearAlgebraTests/Single/ReturnTypeTests.cs b/src/UnitTests/LinearAlgebraTests/Single/ReturnTypeTests.cs index 4506a068..8af6fec5 100644 --- a/src/UnitTests/LinearAlgebraTests/Single/ReturnTypeTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Single/ReturnTypeTests.cs @@ -1,6 +1,37 @@ -using MathNet.Numerics.LinearAlgebra; +// +// Math.NET Numerics, part of the Math.NET Project +// http://numerics.mathdotnet.com +// http://github.com/mathnet/mathnet-numerics +// +// Copyright (c) 2009-2016 Math.NET +// +// 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. +// + +extern alias NUnitFramework; + +using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Single; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single { diff --git a/src/UnitTests/LinearAlgebraTests/Single/Solvers/Iterative/BiCgStabTest.cs b/src/UnitTests/LinearAlgebraTests/Single/Solvers/Iterative/BiCgStabTest.cs index 743ddbd9..eeaf2077 100644 --- a/src/UnitTests/LinearAlgebraTests/Single/Solvers/Iterative/BiCgStabTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Single/Solvers/Iterative/BiCgStabTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,12 +27,14 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Single; using MathNet.Numerics.LinearAlgebra.Single.Solvers; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Solvers.Iterative { diff --git a/src/UnitTests/LinearAlgebraTests/Single/Solvers/Iterative/GpBiCgTest.cs b/src/UnitTests/LinearAlgebraTests/Single/Solvers/Iterative/GpBiCgTest.cs index 5351a04b..df3a2911 100644 --- a/src/UnitTests/LinearAlgebraTests/Single/Solvers/Iterative/GpBiCgTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Single/Solvers/Iterative/GpBiCgTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,12 +27,14 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Single; using MathNet.Numerics.LinearAlgebra.Single.Solvers; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Solvers.Iterative { diff --git a/src/UnitTests/LinearAlgebraTests/Single/Solvers/Iterative/MlkBiCgStabTest.cs b/src/UnitTests/LinearAlgebraTests/Single/Solvers/Iterative/MlkBiCgStabTest.cs index 970a59fc..f998a640 100644 --- a/src/UnitTests/LinearAlgebraTests/Single/Solvers/Iterative/MlkBiCgStabTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Single/Solvers/Iterative/MlkBiCgStabTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,12 +27,14 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Single; using MathNet.Numerics.LinearAlgebra.Single.Solvers; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Solvers.Iterative { diff --git a/src/UnitTests/LinearAlgebraTests/Single/Solvers/Iterative/TFQMRTest.cs b/src/UnitTests/LinearAlgebraTests/Single/Solvers/Iterative/TFQMRTest.cs index e881fb5f..971bed18 100644 --- a/src/UnitTests/LinearAlgebraTests/Single/Solvers/Iterative/TFQMRTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Single/Solvers/Iterative/TFQMRTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,12 +27,14 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Single; using MathNet.Numerics.LinearAlgebra.Single.Solvers; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Solvers.Iterative { diff --git a/src/UnitTests/LinearAlgebraTests/Single/Solvers/IteratorTest.cs b/src/UnitTests/LinearAlgebraTests/Single/Solvers/IteratorTest.cs index 9f173a5a..43f745a9 100644 --- a/src/UnitTests/LinearAlgebraTests/Single/Solvers/IteratorTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Single/Solvers/IteratorTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Collections.Generic; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Solvers { diff --git a/src/UnitTests/LinearAlgebraTests/Single/Solvers/Preconditioners/DiagonalTest.cs b/src/UnitTests/LinearAlgebraTests/Single/Solvers/Preconditioners/DiagonalTest.cs index cbc2fa0f..483f1b0d 100644 --- a/src/UnitTests/LinearAlgebraTests/Single/Solvers/Preconditioners/DiagonalTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Single/Solvers/Preconditioners/DiagonalTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Single; using MathNet.Numerics.LinearAlgebra.Single.Solvers; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Solvers.Preconditioners { diff --git a/src/UnitTests/LinearAlgebraTests/Single/Solvers/Preconditioners/IluptElementSorterTest.cs b/src/UnitTests/LinearAlgebraTests/Single/Solvers/Preconditioners/IluptElementSorterTest.cs index 3e0c604f..e90968f5 100644 --- a/src/UnitTests/LinearAlgebraTests/Single/Solvers/Preconditioners/IluptElementSorterTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Single/Solvers/Preconditioners/IluptElementSorterTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,9 +27,11 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra.Single; using MathNet.Numerics.LinearAlgebra.Single.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Solvers.Preconditioners { diff --git a/src/UnitTests/LinearAlgebraTests/Single/Solvers/Preconditioners/IlutpTest.cs b/src/UnitTests/LinearAlgebraTests/Single/Solvers/Preconditioners/IlutpTest.cs index 5f49f6de..5e5a2dea 100644 --- a/src/UnitTests/LinearAlgebraTests/Single/Solvers/Preconditioners/IlutpTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Single/Solvers/Preconditioners/IlutpTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,13 +27,15 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Reflection; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Single; using MathNet.Numerics.LinearAlgebra.Single.Solvers; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Solvers.Preconditioners { diff --git a/src/UnitTests/LinearAlgebraTests/Single/Solvers/Preconditioners/IncompleteLUTest.cs b/src/UnitTests/LinearAlgebraTests/Single/Solvers/Preconditioners/IncompleteLUTest.cs index d5856c5b..ba03aa18 100644 --- a/src/UnitTests/LinearAlgebraTests/Single/Solvers/Preconditioners/IncompleteLUTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Single/Solvers/Preconditioners/IncompleteLUTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,13 +27,15 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Reflection; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Single; using MathNet.Numerics.LinearAlgebra.Single.Solvers; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Solvers.Preconditioners { diff --git a/src/UnitTests/LinearAlgebraTests/Single/Solvers/Preconditioners/PreConditionerTest.cs b/src/UnitTests/LinearAlgebraTests/Single/Solvers/Preconditioners/PreConditionerTest.cs index 01aaf584..057ac5bb 100644 --- a/src/UnitTests/LinearAlgebraTests/Single/Solvers/Preconditioners/PreConditionerTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Single/Solvers/Preconditioners/PreConditionerTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Single; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Solvers.Preconditioners { diff --git a/src/UnitTests/LinearAlgebraTests/Single/Solvers/Preconditioners/UnitPreconditionerTest.cs b/src/UnitTests/LinearAlgebraTests/Single/Solvers/Preconditioners/UnitPreconditionerTest.cs index 665e2e3b..17ee1990 100644 --- a/src/UnitTests/LinearAlgebraTests/Single/Solvers/Preconditioners/UnitPreconditionerTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Single/Solvers/Preconditioners/UnitPreconditionerTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Single; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Solvers.Preconditioners { diff --git a/src/UnitTests/LinearAlgebraTests/Single/Solvers/StopCriterion/DivergenceStopCriteriumTest.cs b/src/UnitTests/LinearAlgebraTests/Single/Solvers/StopCriterion/DivergenceStopCriteriumTest.cs index 722918bf..3f2d896f 100644 --- a/src/UnitTests/LinearAlgebraTests/Single/Solvers/StopCriterion/DivergenceStopCriteriumTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Single/Solvers/StopCriterion/DivergenceStopCriteriumTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Single; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Solvers.StopCriterion { diff --git a/src/UnitTests/LinearAlgebraTests/Single/Solvers/StopCriterion/FailureStopCriteriumTest.cs b/src/UnitTests/LinearAlgebraTests/Single/Solvers/StopCriterion/FailureStopCriteriumTest.cs index b2b48087..c3e6827b 100644 --- a/src/UnitTests/LinearAlgebraTests/Single/Solvers/StopCriterion/FailureStopCriteriumTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Single/Solvers/StopCriterion/FailureStopCriteriumTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Single; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Solvers.StopCriterion { diff --git a/src/UnitTests/LinearAlgebraTests/Single/Solvers/StopCriterion/IterationCountStopCriteriumTest.cs b/src/UnitTests/LinearAlgebraTests/Single/Solvers/StopCriterion/IterationCountStopCriteriumTest.cs index 94f93be2..a86c0339 100644 --- a/src/UnitTests/LinearAlgebraTests/Single/Solvers/StopCriterion/IterationCountStopCriteriumTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Single/Solvers/StopCriterion/IterationCountStopCriteriumTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Solvers.StopCriterion { diff --git a/src/UnitTests/LinearAlgebraTests/Single/Solvers/StopCriterion/ResidualStopCriteriumTest.cs b/src/UnitTests/LinearAlgebraTests/Single/Solvers/StopCriterion/ResidualStopCriteriumTest.cs index ad355ccd..76c2ede3 100644 --- a/src/UnitTests/LinearAlgebraTests/Single/Solvers/StopCriterion/ResidualStopCriteriumTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Single/Solvers/StopCriterion/ResidualStopCriteriumTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Single; using MathNet.Numerics.LinearAlgebra.Solvers; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single.Solvers.StopCriterion { diff --git a/src/UnitTests/LinearAlgebraTests/Single/SparseMatrixTests.cs b/src/UnitTests/LinearAlgebraTests/Single/SparseMatrixTests.cs index 266aa140..eba63147 100644 --- a/src/UnitTests/LinearAlgebraTests/Single/SparseMatrixTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Single/SparseMatrixTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Collections.Generic; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Single; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single { @@ -88,7 +90,7 @@ namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single [Test] public void MatrixFrom1DArrayIsCopy() { - // Sparse Matrix copies values from float[], but no remember reference. + // Sparse Matrix copies values from float[], but no remember reference. var data = new float[] {1, 1, 1, 1, 1, 1, 2, 2, 2}; var matrix = SparseMatrix.OfColumnMajor(3, 3, data); matrix[0, 0] = 10.0f; diff --git a/src/UnitTests/LinearAlgebraTests/Single/SparseVectorTest.cs b/src/UnitTests/LinearAlgebraTests/Single/SparseVectorTest.cs index c2262644..2141e480 100644 --- a/src/UnitTests/LinearAlgebraTests/Single/SparseVectorTest.cs +++ b/src/UnitTests/LinearAlgebraTests/Single/SparseVectorTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,12 +27,14 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single { using LinearAlgebra; using LinearAlgebra.Single; using LinearAlgebra.Storage; - using NUnit.Framework; + using NUnitFramework.NUnit.Framework; using System; using System.Collections.Generic; diff --git a/src/UnitTests/LinearAlgebraTests/Single/UserDefinedVectorTests.cs b/src/UnitTests/LinearAlgebraTests/Single/UserDefinedVectorTests.cs index e3afae27..498407d7 100644 --- a/src/UnitTests/LinearAlgebraTests/Single/UserDefinedVectorTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Single/UserDefinedVectorTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; using System.Collections.Generic; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single diff --git a/src/UnitTests/LinearAlgebraTests/Single/VectorArithmeticTheory.cs b/src/UnitTests/LinearAlgebraTests/Single/VectorArithmeticTheory.cs index 2561181a..482b446d 100644 --- a/src/UnitTests/LinearAlgebraTests/Single/VectorArithmeticTheory.cs +++ b/src/UnitTests/LinearAlgebraTests/Single/VectorArithmeticTheory.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2015 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single { diff --git a/src/UnitTests/LinearAlgebraTests/Single/VectorTests.Arithmetic.cs b/src/UnitTests/LinearAlgebraTests/Single/VectorTests.Arithmetic.cs index 39e9b7f7..3d678394 100644 --- a/src/UnitTests/LinearAlgebraTests/Single/VectorTests.Arithmetic.cs +++ b/src/UnitTests/LinearAlgebraTests/Single/VectorTests.Arithmetic.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; using System; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single diff --git a/src/UnitTests/LinearAlgebraTests/Single/VectorTests.Norm.cs b/src/UnitTests/LinearAlgebraTests/Single/VectorTests.Norm.cs index 865d6450..91b0e8e5 100644 --- a/src/UnitTests/LinearAlgebraTests/Single/VectorTests.Norm.cs +++ b/src/UnitTests/LinearAlgebraTests/Single/VectorTests.Norm.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single { using System; - using NUnit.Framework; + using NUnitFramework.NUnit.Framework; /// /// Abstract class with the norms set of vector tests. diff --git a/src/UnitTests/LinearAlgebraTests/Single/VectorTests.cs b/src/UnitTests/LinearAlgebraTests/Single/VectorTests.cs index d071ec5c..c0959e0c 100644 --- a/src/UnitTests/LinearAlgebraTests/Single/VectorTests.cs +++ b/src/UnitTests/LinearAlgebraTests/Single/VectorTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,13 +27,15 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Collections; using System.Collections.Generic; using MathNet.Numerics.Distributions; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Single; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests.Single { diff --git a/src/UnitTests/LinearAlgebraTests/TestData.cs b/src/UnitTests/LinearAlgebraTests/TestData.cs index 090578ba..27bfe5bc 100644 --- a/src/UnitTests/LinearAlgebraTests/TestData.cs +++ b/src/UnitTests/LinearAlgebraTests/TestData.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2015 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation diff --git a/src/UnitTests/LinearAlgebraTests/VectorArithmeticTheory.cs b/src/UnitTests/LinearAlgebraTests/VectorArithmeticTheory.cs index 5adc74d2..24188d6b 100644 --- a/src/UnitTests/LinearAlgebraTests/VectorArithmeticTheory.cs +++ b/src/UnitTests/LinearAlgebraTests/VectorArithmeticTheory.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2015 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,9 +27,11 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.LinearAlgebra; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests { diff --git a/src/UnitTests/LinearAlgebraTests/VectorStorageCombinatorsTests.cs b/src/UnitTests/LinearAlgebraTests/VectorStorageCombinatorsTests.cs index 82778af1..8a9bac60 100644 --- a/src/UnitTests/LinearAlgebraTests/VectorStorageCombinatorsTests.cs +++ b/src/UnitTests/LinearAlgebraTests/VectorStorageCombinatorsTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System.Threading; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Storage; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests { diff --git a/src/UnitTests/LinearAlgebraTests/VectorStorageSerializationTests.cs b/src/UnitTests/LinearAlgebraTests/VectorStorageSerializationTests.cs index ea6c192f..30c7782a 100644 --- a/src/UnitTests/LinearAlgebraTests/VectorStorageSerializationTests.cs +++ b/src/UnitTests/LinearAlgebraTests/VectorStorageSerializationTests.cs @@ -1,9 +1,40 @@ -using System; +// +// Math.NET Numerics, part of the Math.NET Project +// http://numerics.mathdotnet.com +// http://github.com/mathnet/mathnet-numerics +// +// Copyright (c) 2009-2016 Math.NET +// +// 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. +// + +extern alias NUnitFramework; + +using System; using System.IO; using System.Runtime.Serialization; using MathNet.Numerics.LinearAlgebra; using MathNet.Numerics.LinearAlgebra.Storage; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.LinearAlgebraTests { diff --git a/src/UnitTests/PermutationTest.cs b/src/UnitTests/PermutationTest.cs index 4fda56bc..41aa97dc 100644 --- a/src/UnitTests/PermutationTest.cs +++ b/src/UnitTests/PermutationTest.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,10 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + +using System; +using NUnitFramework.NUnit.Framework; + namespace MathNet.Numerics.UnitTests { - using System; - using NUnit.Framework; /// /// Permutation tests. diff --git a/src/UnitTests/PrecisionTest.cs b/src/UnitTests/PrecisionTest.cs index 0e9ed2bc..5a8be355 100644 --- a/src/UnitTests/PrecisionTest.cs +++ b/src/UnitTests/PrecisionTest.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + +using System; +using NUnitFramework.NUnit.Framework; + namespace MathNet.Numerics.UnitTests { - using System; - using NUnit.Framework; - /// /// Precision tests. /// diff --git a/src/UnitTests/Random/CryptoRandomSourceTests.cs b/src/UnitTests/Random/CryptoRandomSourceTests.cs index 6487d97f..d904f690 100644 --- a/src/UnitTests/Random/CryptoRandomSourceTests.cs +++ b/src/UnitTests/Random/CryptoRandomSourceTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + #if !PORTABLE using MathNet.Numerics.Random; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.Random { diff --git a/src/UnitTests/Random/Mcg31m1Tests.cs b/src/UnitTests/Random/Mcg31m1Tests.cs index 25d56a19..deb8f7f1 100644 --- a/src/UnitTests/Random/Mcg31m1Tests.cs +++ b/src/UnitTests/Random/Mcg31m1Tests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.Random; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.Random { diff --git a/src/UnitTests/Random/Mcg59Tests.cs b/src/UnitTests/Random/Mcg59Tests.cs index a6ec066a..1a892d05 100644 --- a/src/UnitTests/Random/Mcg59Tests.cs +++ b/src/UnitTests/Random/Mcg59Tests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.Random; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.Random { diff --git a/src/UnitTests/Random/MersenneTwisterTests.cs b/src/UnitTests/Random/MersenneTwisterTests.cs index ced52c6b..25ba5f4f 100644 --- a/src/UnitTests/Random/MersenneTwisterTests.cs +++ b/src/UnitTests/Random/MersenneTwisterTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.Random; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.Random { diff --git a/src/UnitTests/Random/Mrg32k3aTests.cs b/src/UnitTests/Random/Mrg32k3aTests.cs index b67c86de..dc649f12 100644 --- a/src/UnitTests/Random/Mrg32k3aTests.cs +++ b/src/UnitTests/Random/Mrg32k3aTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.Random; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.Random { diff --git a/src/UnitTests/Random/PalfTests.cs b/src/UnitTests/Random/PalfTests.cs index bcaabb43..13effa1b 100644 --- a/src/UnitTests/Random/PalfTests.cs +++ b/src/UnitTests/Random/PalfTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.Random; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.Random { diff --git a/src/UnitTests/Random/RandomExtensionTests.cs b/src/UnitTests/Random/RandomExtensionTests.cs index 9991b12b..095f4e70 100644 --- a/src/UnitTests/Random/RandomExtensionTests.cs +++ b/src/UnitTests/Random/RandomExtensionTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.Random; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.Random { diff --git a/src/UnitTests/Random/RandomTests.cs b/src/UnitTests/Random/RandomTests.cs index f8b80fb0..e664f439 100644 --- a/src/UnitTests/Random/RandomTests.cs +++ b/src/UnitTests/Random/RandomTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Threading; using MathNet.Numerics.Random; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.Random { diff --git a/src/UnitTests/Random/SystemRandomSourceTests.cs b/src/UnitTests/Random/SystemRandomSourceTests.cs index 185cb632..6c11a35d 100644 --- a/src/UnitTests/Random/SystemRandomSourceTests.cs +++ b/src/UnitTests/Random/SystemRandomSourceTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.Random; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.Random { diff --git a/src/UnitTests/Random/WH1982Tests.cs b/src/UnitTests/Random/WH1982Tests.cs index ed807c4b..4513172a 100644 --- a/src/UnitTests/Random/WH1982Tests.cs +++ b/src/UnitTests/Random/WH1982Tests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.Random; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.Random { diff --git a/src/UnitTests/Random/WH2006Tests.cs b/src/UnitTests/Random/WH2006Tests.cs index 5190c576..0ab05fe7 100644 --- a/src/UnitTests/Random/WH2006Tests.cs +++ b/src/UnitTests/Random/WH2006Tests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.Random; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.Random { diff --git a/src/UnitTests/Random/XorshiftTests.cs b/src/UnitTests/Random/XorshiftTests.cs index d0b7e78d..7f14f246 100644 --- a/src/UnitTests/Random/XorshiftTests.cs +++ b/src/UnitTests/Random/XorshiftTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.Random; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.Random { diff --git a/src/UnitTests/RootFindingTests/BisectionTest.cs b/src/UnitTests/RootFindingTests/BisectionTest.cs index 98e9370f..b7c3f2b1 100644 --- a/src/UnitTests/RootFindingTests/BisectionTest.cs +++ b/src/UnitTests/RootFindingTests/BisectionTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,9 +27,11 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.RootFinding; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.RootFindingTests { diff --git a/src/UnitTests/RootFindingTests/BrentTest.cs b/src/UnitTests/RootFindingTests/BrentTest.cs index 328aeaec..3e815747 100644 --- a/src/UnitTests/RootFindingTests/BrentTest.cs +++ b/src/UnitTests/RootFindingTests/BrentTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,9 +27,11 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.RootFinding; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.RootFindingTests { @@ -341,7 +343,7 @@ namespace MathNet.Numerics.UnitTests.RootFindingTests double r = Brent.FindRoot(f1, 0.01, 0.45, 1e-14); Assert.AreEqual(0.058654571042804, r, 1e-5); Assert.AreEqual(0, f1(r), 1e-14); - // Could not test the following root, since Math.Pow(y,1/3) does not work for y<0 + // Could not test the following root, since Math.Pow(y,1/3) does not work for y<0 // r = Brent.FindRoot(f1, 0.55, 0.7); // Assert.AreEqual(0.600323117488527, r, 1e-5); // Assert.AreEqual(0, f1(r), 1e-14); diff --git a/src/UnitTests/RootFindingTests/BroydenTest.cs b/src/UnitTests/RootFindingTests/BroydenTest.cs index caef85fb..b0a08980 100644 --- a/src/UnitTests/RootFindingTests/BroydenTest.cs +++ b/src/UnitTests/RootFindingTests/BroydenTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using MathNet.Numerics.RootFinding; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; using System; namespace MathNet.Numerics.UnitTests.RootFindingTests @@ -1457,7 +1459,7 @@ namespace MathNet.Numerics.UnitTests.RootFindingTests Assert.AreEqual(0, fa1(r)[4], 1e-12); } - [Test, Ignore("Know to be unreliable on Mono")] + [Test, Ignore("Known convergence problem on Mono")] public void Sixeq1() { // Test case from http://www.polymath-software.com/library/nle/Sixeq1.htm diff --git a/src/UnitTests/RootFindingTests/CubicTest.cs b/src/UnitTests/RootFindingTests/CubicTest.cs index 5268b0d7..21592741 100644 --- a/src/UnitTests/RootFindingTests/CubicTest.cs +++ b/src/UnitTests/RootFindingTests/CubicTest.cs @@ -1,5 +1,36 @@ -using MathNet.Numerics.RootFinding; -using NUnit.Framework; +// +// Math.NET Numerics, part of the Math.NET Project +// http://numerics.mathdotnet.com +// http://github.com/mathnet/mathnet-numerics +// +// Copyright (c) 2009-2016 Math.NET +// +// 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. +// + +extern alias NUnitFramework; + +using MathNet.Numerics.RootFinding; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.RootFindingTests { @@ -31,7 +62,7 @@ namespace MathNet.Numerics.UnitTests.RootFindingTests Assert.That(roots.Item2, Is.EqualTo(1).Within(1e-14)); Assert.AreEqual(double.NaN, roots.Item3); } - + [Test] public void RealRoots_DoubleReal2() { diff --git a/src/UnitTests/RootFindingTests/FindRootsTest.cs b/src/UnitTests/RootFindingTests/FindRootsTest.cs index d33da7ae..28564136 100644 --- a/src/UnitTests/RootFindingTests/FindRootsTest.cs +++ b/src/UnitTests/RootFindingTests/FindRootsTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.RootFindingTests { diff --git a/src/UnitTests/RootFindingTests/NewtonRaphsonTest.cs b/src/UnitTests/RootFindingTests/NewtonRaphsonTest.cs index 1574bb8e..7d4982be 100644 --- a/src/UnitTests/RootFindingTests/NewtonRaphsonTest.cs +++ b/src/UnitTests/RootFindingTests/NewtonRaphsonTest.cs @@ -2,9 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// -// Copyright (c) 2009-2013 Math.NET -// +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -13,10 +13,10 @@ // 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 @@ -27,9 +27,11 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.RootFinding; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.RootFindingTests { diff --git a/src/UnitTests/RootFindingTests/RobustNewtonRaphsonTest.cs b/src/UnitTests/RootFindingTests/RobustNewtonRaphsonTest.cs index 2bfdf37d..b43a682b 100644 --- a/src/UnitTests/RootFindingTests/RobustNewtonRaphsonTest.cs +++ b/src/UnitTests/RootFindingTests/RobustNewtonRaphsonTest.cs @@ -2,9 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// -// Copyright (c) 2009-2013 Math.NET -// +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -13,10 +13,10 @@ // 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 @@ -27,9 +27,11 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.RootFinding; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.RootFindingTests { diff --git a/src/UnitTests/RootFindingTests/SecantTest.cs b/src/UnitTests/RootFindingTests/SecantTest.cs index 8f1b86c9..38b8a45a 100644 --- a/src/UnitTests/RootFindingTests/SecantTest.cs +++ b/src/UnitTests/RootFindingTests/SecantTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,9 +27,11 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.RootFinding; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.RootFindingTests { diff --git a/src/UnitTests/SortingTests.cs b/src/UnitTests/SortingTests.cs index a76cb0dc..9a530bc1 100644 --- a/src/UnitTests/SortingTests.cs +++ b/src/UnitTests/SortingTests.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,11 +27,14 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + +using System; +using System.Collections.Generic; +using NUnitFramework.NUnit.Framework; + namespace MathNet.Numerics.UnitTests { - using System; - using System.Collections.Generic; - using NUnit.Framework; /// /// Sorting tests. diff --git a/src/UnitTests/SpecialFunctionsTests/ErfTests.cs b/src/UnitTests/SpecialFunctionsTests/ErfTests.cs index d3f6fd88..781a828b 100644 --- a/src/UnitTests/SpecialFunctionsTests/ErfTests.cs +++ b/src/UnitTests/SpecialFunctionsTests/ErfTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2010 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + +using NUnitFramework.NUnit.Framework; + namespace MathNet.Numerics.UnitTests.SpecialFunctionsTests { - using NUnit.Framework; - /// /// Error functions tests. /// diff --git a/src/UnitTests/SpecialFunctionsTests/ExponentialIntegralTests.cs b/src/UnitTests/SpecialFunctionsTests/ExponentialIntegralTests.cs index 6c37940b..0727d47b 100644 --- a/src/UnitTests/SpecialFunctionsTests/ExponentialIntegralTests.cs +++ b/src/UnitTests/SpecialFunctionsTests/ExponentialIntegralTests.cs @@ -1,9 +1,39 @@ - +// +// Math.NET Numerics, part of the Math.NET Project +// http://numerics.mathdotnet.com +// http://github.com/mathnet/mathnet-numerics +// +// Copyright (c) 2009-2016 Math.NET +// +// 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. +// + +extern alias NUnitFramework; + +using System; +using NUnitFramework.NUnit.Framework; + namespace MathNet.Numerics.UnitTests.SpecialFunctionsTests { - using System; - using NUnit.Framework; - /// /// Exponential Integral tests. /// diff --git a/src/UnitTests/SpecialFunctionsTests/FactorialTest.cs b/src/UnitTests/SpecialFunctionsTests/FactorialTest.cs index 1e80f335..277d8e7f 100644 --- a/src/UnitTests/SpecialFunctionsTests/FactorialTest.cs +++ b/src/UnitTests/SpecialFunctionsTests/FactorialTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2010 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + +using System; +using NUnitFramework.NUnit.Framework; + namespace MathNet.Numerics.UnitTests.SpecialFunctionsTests { - using System; - using NUnit.Framework; - /// /// Factorial tests. /// diff --git a/src/UnitTests/SpecialFunctionsTests/GammaTests.cs b/src/UnitTests/SpecialFunctionsTests/GammaTests.cs index 83fe33b7..91927f25 100644 --- a/src/UnitTests/SpecialFunctionsTests/GammaTests.cs +++ b/src/UnitTests/SpecialFunctionsTests/GammaTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2015 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + +using System; +using NUnitFramework.NUnit.Framework; + namespace MathNet.Numerics.UnitTests.SpecialFunctionsTests { - using System; - using NUnit.Framework; - /// /// Gamma functions tests. /// diff --git a/src/UnitTests/SpecialFunctionsTests/ModifiedBesselTests.cs b/src/UnitTests/SpecialFunctionsTests/ModifiedBesselTests.cs index ff880ba4..a09a17f0 100644 --- a/src/UnitTests/SpecialFunctionsTests/ModifiedBesselTests.cs +++ b/src/UnitTests/SpecialFunctionsTests/ModifiedBesselTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2012 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.SpecialFunctionsTests { diff --git a/src/UnitTests/SpecialFunctionsTests/ModifiedStruveTests.cs b/src/UnitTests/SpecialFunctionsTests/ModifiedStruveTests.cs index fd62c08c..b13a41e9 100644 --- a/src/UnitTests/SpecialFunctionsTests/ModifiedStruveTests.cs +++ b/src/UnitTests/SpecialFunctionsTests/ModifiedStruveTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2012 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,10 +27,12 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + +using NUnitFramework.NUnit.Framework; + namespace MathNet.Numerics.UnitTests.SpecialFunctionsTests { - using NUnit.Framework; - /// /// Modified Struve functions tests. /// diff --git a/src/UnitTests/SpecialFunctionsTests/SpecialFunctionsTests.cs b/src/UnitTests/SpecialFunctionsTests/SpecialFunctionsTests.cs index 49e277b4..0a796d6d 100644 --- a/src/UnitTests/SpecialFunctionsTests/SpecialFunctionsTests.cs +++ b/src/UnitTests/SpecialFunctionsTests/SpecialFunctionsTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2010 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + +using System; +using NUnitFramework.NUnit.Framework; + namespace MathNet.Numerics.UnitTests.SpecialFunctionsTests { - using System; - using NUnit.Framework; - /// /// Special functions tests. /// diff --git a/src/UnitTests/StatisticsTests/CorrelationTests.cs b/src/UnitTests/StatisticsTests/CorrelationTests.cs index 97a9f99d..fc1ebef8 100644 --- a/src/UnitTests/StatisticsTests/CorrelationTests.cs +++ b/src/UnitTests/StatisticsTests/CorrelationTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,15 +27,17 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + +using System; +using System.Collections.Generic; +using System.Linq; +using NUnitFramework.NUnit.Framework; +using MathNet.Numerics.Statistics; + namespace MathNet.Numerics.UnitTests.StatisticsTests { #if !PORTABLE - using System; - using System.Collections.Generic; - using System.Linq; - using NUnit.Framework; - using Statistics; - /// /// Correlation tests /// diff --git a/src/UnitTests/StatisticsTests/DescriptiveStatisticsTests.cs b/src/UnitTests/StatisticsTests/DescriptiveStatisticsTests.cs index 81a891d3..f381e8c0 100644 --- a/src/UnitTests/StatisticsTests/DescriptiveStatisticsTests.cs +++ b/src/UnitTests/StatisticsTests/DescriptiveStatisticsTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,18 +27,20 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + +using System; +using System.Collections.Generic; +using NUnitFramework.NUnit.Framework; +using MathNet.Numerics.Statistics; + namespace MathNet.Numerics.UnitTests.StatisticsTests { #if !PORTABLE - using System; - using System.Collections.Generic; - using NUnit.Framework; - using Statistics; - /// /// Descriptive statistics tests. /// - /// NOTE: this class is not included into Silverlight version, because it uses data from local files. + /// NOTE: this class is not included into Silverlight version, because it uses data from local files. /// In Silverlight access to local files is forbidden, except several cases. [TestFixture, Category("Statistics")] public class DescriptiveStatisticsTests diff --git a/src/UnitTests/StatisticsTests/HistogramTests.cs b/src/UnitTests/StatisticsTests/HistogramTests.cs index 3280480d..15baf682 100644 --- a/src/UnitTests/StatisticsTests/HistogramTests.cs +++ b/src/UnitTests/StatisticsTests/HistogramTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,15 +27,15 @@ // OTHER DEALINGS IN THE SOFTWARE. // -using System.Linq; +extern alias NUnitFramework; + +using System; +using System.Collections.Generic; +using NUnitFramework.NUnit.Framework; +using MathNet.Numerics.Statistics; namespace MathNet.Numerics.UnitTests.StatisticsTests { - using System; - using System.Collections.Generic; - using NUnit.Framework; - using Statistics; - /// /// Histogram tests. /// @@ -51,13 +51,13 @@ namespace MathNet.Numerics.UnitTests.StatisticsTests /// Datatset array with small absolute values /// /// - /// These values are chosen to precisely match the upper bounds of 9 buckets, + /// These values are chosen to precisely match the upper bounds of 9 buckets, /// from 0.5e-22 to 9.5E-22 /// - readonly double[] _smallValueDataset = + readonly double[] _smallValueDataset = { 0.5e-22, 1.5E-22, 2.5E-22, 3.4999999999999996E-22, 4.4999999999999989E-22, - 5.4999999999999983E-22, 6.4999999999999986E-22, 7.4999999999999988E-22, + 5.4999999999999983E-22, 6.4999999999999986E-22, 7.4999999999999988E-22, 8.4999999999999982E-22, 9.5E-22 }; @@ -355,7 +355,7 @@ namespace MathNet.Numerics.UnitTests.StatisticsTests { var h = new Histogram(new[] { 1.0, 5.0, 10.0 }, 3, 0.0, 10.0); Assert.DoesNotThrow(() => h.AddData(0.0)); - + Assert.AreEqual(2, h[0].Count); } diff --git a/src/UnitTests/StatisticsTests/MCMCTests/HybridMCTest.cs b/src/UnitTests/StatisticsTests/MCMCTests/HybridMCTest.cs index c1028ac8..8f30db35 100644 --- a/src/UnitTests/StatisticsTests/MCMCTests/HybridMCTest.cs +++ b/src/UnitTests/StatisticsTests/MCMCTests/HybridMCTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2010 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,12 +27,14 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Globalization; using MathNet.Numerics.Distributions; using MathNet.Numerics.Statistics; using MathNet.Numerics.Statistics.Mcmc; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.StatisticsTests.McmcTests { diff --git a/src/UnitTests/StatisticsTests/MCMCTests/MCMCDiagnosticsTest.cs b/src/UnitTests/StatisticsTests/MCMCTests/MCMCDiagnosticsTest.cs index d42a9d75..3473511d 100644 --- a/src/UnitTests/StatisticsTests/MCMCTests/MCMCDiagnosticsTest.cs +++ b/src/UnitTests/StatisticsTests/MCMCTests/MCMCDiagnosticsTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2010 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.Distributions; using MathNet.Numerics.Statistics; using MathNet.Numerics.Statistics.Mcmc; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.StatisticsTests.McmcTests { diff --git a/src/UnitTests/StatisticsTests/MCMCTests/MetropolisHastingsSamplerTests.cs b/src/UnitTests/StatisticsTests/MCMCTests/MetropolisHastingsSamplerTests.cs index 0e1da4a7..c057ff3a 100644 --- a/src/UnitTests/StatisticsTests/MCMCTests/MetropolisHastingsSamplerTests.cs +++ b/src/UnitTests/StatisticsTests/MCMCTests/MetropolisHastingsSamplerTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2010 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.Distributions; using MathNet.Numerics.Random; using MathNet.Numerics.Statistics.Mcmc; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.StatisticsTests.McmcTests { diff --git a/src/UnitTests/StatisticsTests/MCMCTests/MetropolisSamplerTests.cs b/src/UnitTests/StatisticsTests/MCMCTests/MetropolisSamplerTests.cs index 1dbcf820..9af69ed5 100644 --- a/src/UnitTests/StatisticsTests/MCMCTests/MetropolisSamplerTests.cs +++ b/src/UnitTests/StatisticsTests/MCMCTests/MetropolisSamplerTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2010 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.Distributions; using MathNet.Numerics.Random; using MathNet.Numerics.Statistics.Mcmc; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.StatisticsTests.McmcTests { diff --git a/src/UnitTests/StatisticsTests/MCMCTests/RejectionSamplerTests.cs b/src/UnitTests/StatisticsTests/MCMCTests/RejectionSamplerTests.cs index 3be26134..44547c06 100644 --- a/src/UnitTests/StatisticsTests/MCMCTests/RejectionSamplerTests.cs +++ b/src/UnitTests/StatisticsTests/MCMCTests/RejectionSamplerTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2010 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.Distributions; using MathNet.Numerics.Random; using MathNet.Numerics.Statistics.Mcmc; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.StatisticsTests.McmcTests { diff --git a/src/UnitTests/StatisticsTests/MCMCTests/UnivariateHybridMCTest.cs b/src/UnitTests/StatisticsTests/MCMCTests/UnivariateHybridMCTest.cs index f5f0829d..1d5a9757 100644 --- a/src/UnitTests/StatisticsTests/MCMCTests/UnivariateHybridMCTest.cs +++ b/src/UnitTests/StatisticsTests/MCMCTests/UnivariateHybridMCTest.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2010 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using MathNet.Numerics.Distributions; using MathNet.Numerics.Statistics; using MathNet.Numerics.Statistics.Mcmc; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.StatisticsTests.McmcTests { diff --git a/src/UnitTests/StatisticsTests/MCMCTests/UnivariateSliceSamplerTests.cs b/src/UnitTests/StatisticsTests/MCMCTests/UnivariateSliceSamplerTests.cs index 45b87790..de242cf7 100644 --- a/src/UnitTests/StatisticsTests/MCMCTests/UnivariateSliceSamplerTests.cs +++ b/src/UnitTests/StatisticsTests/MCMCTests/UnivariateSliceSamplerTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2010 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,12 +27,14 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + +using System; +using NUnitFramework.NUnit.Framework; +using MathNet.Numerics.Statistics.Mcmc; + namespace MathNet.Numerics.UnitTests.StatisticsTests.McmcTests { - using System; - using NUnit.Framework; - using Statistics.Mcmc; - /// /// Univariate slice sampler tests. /// @@ -77,7 +79,7 @@ namespace MathNet.Numerics.UnitTests.StatisticsTests.McmcTests var ss = new UnivariateSliceSampler(0.1, x => -0.5*x*x, 5, 1.0); Assert.IsNotNull(ss.RandomSource); - ss.RandomSource = new Random(0); + ss.RandomSource = new System.Random(0); Assert.IsNotNull(ss.RandomSource); } diff --git a/src/UnitTests/StatisticsTests/MovingStatisticsTests.cs b/src/UnitTests/StatisticsTests/MovingStatisticsTests.cs index d2c1926e..7dd71cfb 100644 --- a/src/UnitTests/StatisticsTests/MovingStatisticsTests.cs +++ b/src/UnitTests/StatisticsTests/MovingStatisticsTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2015 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,12 +27,14 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Linq; using MathNet.Numerics.Distributions; using MathNet.Numerics.Random; using MathNet.Numerics.Statistics; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.StatisticsTests { diff --git a/src/UnitTests/StatisticsTests/PercentileTests.cs b/src/UnitTests/StatisticsTests/PercentileTests.cs index a7cfd4c3..511dc5a4 100644 --- a/src/UnitTests/StatisticsTests/PercentileTests.cs +++ b/src/UnitTests/StatisticsTests/PercentileTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,11 +27,13 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + +using NUnitFramework.NUnit.Framework; +using MathNet.Numerics.Statistics; + namespace MathNet.Numerics.UnitTests.StatisticsTests { - using NUnit.Framework; - using Statistics; - /// /// Percentile tests. /// diff --git a/src/UnitTests/StatisticsTests/RunningStatisticsTests.cs b/src/UnitTests/StatisticsTests/RunningStatisticsTests.cs index 2d6eb98e..70c012db 100644 --- a/src/UnitTests/StatisticsTests/RunningStatisticsTests.cs +++ b/src/UnitTests/StatisticsTests/RunningStatisticsTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2014 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,16 +27,17 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System.Linq; +using System.Collections.Generic; using MathNet.Numerics.Distributions; using MathNet.Numerics.Random; +using MathNet.Numerics.Statistics; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.StatisticsTests { - using System.Collections.Generic; - using NUnit.Framework; - using Statistics; - /// /// Running statistics tests. /// diff --git a/src/UnitTests/StatisticsTests/StatTestData.cs b/src/UnitTests/StatisticsTests/StatTestData.cs index 7a5bda3e..0fd7a80e 100644 --- a/src/UnitTests/StatisticsTests/StatTestData.cs +++ b/src/UnitTests/StatisticsTests/StatTestData.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2013 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -30,7 +30,6 @@ using System; using System.Globalization; using System.Collections.Generic; -using System.IO; using System.Linq; namespace MathNet.Numerics.UnitTests.StatisticsTests diff --git a/src/UnitTests/StatisticsTests/StatisticsSerializationTests.cs b/src/UnitTests/StatisticsTests/StatisticsSerializationTests.cs index 908401de..581b0db6 100644 --- a/src/UnitTests/StatisticsTests/StatisticsSerializationTests.cs +++ b/src/UnitTests/StatisticsTests/StatisticsSerializationTests.cs @@ -1,7 +1,38 @@ -using System.IO; +// +// Math.NET Numerics, part of the Math.NET Project +// http://numerics.mathdotnet.com +// http://github.com/mathnet/mathnet-numerics +// +// Copyright (c) 2009-2016 Math.NET +// +// 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. +// + +extern alias NUnitFramework; + +using System.IO; using System.Runtime.Serialization; using MathNet.Numerics.Statistics; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests.StatisticsTests { diff --git a/src/UnitTests/StatisticsTests/StatisticsTests.cs b/src/UnitTests/StatisticsTests/StatisticsTests.cs index 03a7b430..bd8518a1 100644 --- a/src/UnitTests/StatisticsTests/StatisticsTests.cs +++ b/src/UnitTests/StatisticsTests/StatisticsTests.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2015 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,13 +27,15 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; using System.Collections.Generic; using System.Linq; using MathNet.Numerics.Distributions; using MathNet.Numerics.Random; using MathNet.Numerics.TestData; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; // ReSharper disable InvokeAsExtensionMethod diff --git a/src/UnitTests/TrigonometryTest.cs b/src/UnitTests/TrigonometryTest.cs index a450bf75..72ea9c5f 100644 --- a/src/UnitTests/TrigonometryTest.cs +++ b/src/UnitTests/TrigonometryTest.cs @@ -2,7 +2,9 @@ // Math.NET Numerics, part of the Math.NET Project // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics -// Copyright (c) 2009-2010 Math.NET +// +// Copyright (c) 2009-2016 Math.NET +// // 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 @@ -11,8 +13,10 @@ // 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 @@ -23,8 +27,10 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; namespace MathNet.Numerics.UnitTests { diff --git a/src/UnitTests/UnitTests-CUDA.csproj b/src/UnitTests/UnitTests-CUDA.csproj index 59cd8c8d..ab5bf367 100644 --- a/src/UnitTests/UnitTests-CUDA.csproj +++ b/src/UnitTests/UnitTests-CUDA.csproj @@ -72,11 +72,42 @@ - - - ..\..\packages\test\NUnit\lib\nunit.framework.dll - True - True - - + + + + + ..\..\packages\test\NUnit\lib\net20\nunit.framework.dll + True + True + + + + + + + ..\..\packages\test\NUnit\lib\net40\nunit.framework.dll + True + True + + + + + + + ..\..\packages\test\NUnit\lib\net45\nunit.framework.dll + True + True + + + + + + + ..\..\packages\test\NUnit\lib\portable-net45+win8+wp8+wpa81+Xamarin.Mac+MonoAndroid10+MonoTouch10+Xamarin.iOS10\nunit.framework.dll + True + True + + + + \ No newline at end of file diff --git a/src/UnitTests/UnitTests-MKL.csproj b/src/UnitTests/UnitTests-MKL.csproj index c4c27ef0..6607d34f 100644 --- a/src/UnitTests/UnitTests-MKL.csproj +++ b/src/UnitTests/UnitTests-MKL.csproj @@ -72,11 +72,46 @@ - - - ..\..\packages\test\NUnit\lib\nunit.framework.dll - True - True - - + + + + + ..\..\packages\test\NUnit\lib\net20\nunit.framework.dll + True + True + NUnitFramework + + + + + + + ..\..\packages\test\NUnit\lib\net40\nunit.framework.dll + True + True + NUnitFramework + + + + + + + ..\..\packages\test\NUnit\lib\net45\nunit.framework.dll + True + True + NUnitFramework + + + + + + + ..\..\packages\test\NUnit\lib\portable-net45+win8+wp8+wpa81+Xamarin.Mac+MonoAndroid10+MonoTouch10+Xamarin.iOS10\nunit.framework.dll + True + True + NUnitFramework + + + + \ No newline at end of file diff --git a/src/UnitTests/UnitTests-Net35.csproj b/src/UnitTests/UnitTests-Net35.csproj index 05e4e553..b1747a02 100644 --- a/src/UnitTests/UnitTests-Net35.csproj +++ b/src/UnitTests/UnitTests-Net35.csproj @@ -58,7 +58,7 @@ - + @@ -94,11 +94,46 @@ - - - ..\..\packages\test\NUnit\lib\nunit.framework.dll - True - True - - + + + + + ..\..\packages\test\NUnit\lib\net20\nunit.framework.dll + True + True + NUnitFramework + + + + + + + ..\..\packages\test\NUnit\lib\net40\nunit.framework.dll + True + True + NUnitFramework + + + + + + + ..\..\packages\test\NUnit\lib\net45\nunit.framework.dll + True + True + NUnitFramework + + + + + + + ..\..\packages\test\NUnit\lib\portable-net45+win8+wp8+wpa81+Xamarin.Mac+MonoAndroid10+MonoTouch10+Xamarin.iOS10\nunit.framework.dll + True + True + NUnitFramework + + + + \ No newline at end of file diff --git a/src/UnitTests/UnitTests-OpenBLAS.csproj b/src/UnitTests/UnitTests-OpenBLAS.csproj index 6242962a..5501a782 100644 --- a/src/UnitTests/UnitTests-OpenBLAS.csproj +++ b/src/UnitTests/UnitTests-OpenBLAS.csproj @@ -72,11 +72,46 @@ - - - ..\..\packages\test\NUnit\lib\nunit.framework.dll - True - True - - + + + + + ..\..\packages\test\NUnit\lib\net20\nunit.framework.dll + True + True + NUnitFramework + + + + + + + ..\..\packages\test\NUnit\lib\net40\nunit.framework.dll + True + True + NUnitFramework + + + + + + + ..\..\packages\test\NUnit\lib\net45\nunit.framework.dll + True + True + NUnitFramework + + + + + + + ..\..\packages\test\NUnit\lib\portable-net45+win8+wp8+wpa81+Xamarin.Mac+MonoAndroid10+MonoTouch10+Xamarin.iOS10\nunit.framework.dll + True + True + NUnitFramework + + + + \ No newline at end of file diff --git a/src/UnitTests/UnitTests-Portable259.csproj b/src/UnitTests/UnitTests-Portable259.csproj index 6f51042b..fa345ff5 100644 --- a/src/UnitTests/UnitTests-Portable259.csproj +++ b/src/UnitTests/UnitTests-Portable259.csproj @@ -67,11 +67,46 @@ - - - ..\..\packages\test\NUnit\lib\nunit.framework.dll - True - True - - + + + + + ..\..\packages\test\NUnit\lib\net20\nunit.framework.dll + True + True + NUnitFramework + + + + + + + ..\..\packages\test\NUnit\lib\net40\nunit.framework.dll + True + True + NUnitFramework + + + + + + + ..\..\packages\test\NUnit\lib\net45\nunit.framework.dll + True + True + NUnitFramework + + + + + + + ..\..\packages\test\NUnit\lib\portable-net45+win8+wp8+wpa81+Xamarin.Mac+MonoAndroid10+MonoTouch10+Xamarin.iOS10\nunit.framework.dll + True + True + NUnitFramework + + + + \ No newline at end of file diff --git a/src/UnitTests/UnitTests-Portable328.csproj b/src/UnitTests/UnitTests-Portable328.csproj index d189322d..c18df400 100644 --- a/src/UnitTests/UnitTests-Portable328.csproj +++ b/src/UnitTests/UnitTests-Portable328.csproj @@ -67,11 +67,46 @@ - - - ..\..\packages\test\NUnit\lib\nunit.framework.dll - True - True - - + + + + + ..\..\packages\test\NUnit\lib\net20\nunit.framework.dll + True + True + NUnitFramework + + + + + + + ..\..\packages\test\NUnit\lib\net40\nunit.framework.dll + True + True + NUnitFramework + + + + + + + ..\..\packages\test\NUnit\lib\net45\nunit.framework.dll + True + True + NUnitFramework + + + + + + + ..\..\packages\test\NUnit\lib\portable-net45+win8+wp8+wpa81+Xamarin.Mac+MonoAndroid10+MonoTouch10+Xamarin.iOS10\nunit.framework.dll + True + True + NUnitFramework + + + + \ No newline at end of file diff --git a/src/UnitTests/UnitTests-Portable47.csproj b/src/UnitTests/UnitTests-Portable47.csproj index ec427c35..f118fc35 100644 --- a/src/UnitTests/UnitTests-Portable47.csproj +++ b/src/UnitTests/UnitTests-Portable47.csproj @@ -67,11 +67,46 @@ - - - ..\..\packages\test\NUnit\lib\nunit.framework.dll - True - True - - + + + + + ..\..\packages\test\NUnit\lib\net20\nunit.framework.dll + True + True + NUnitFramework + + + + + + + ..\..\packages\test\NUnit\lib\net40\nunit.framework.dll + True + True + NUnitFramework + + + + + + + ..\..\packages\test\NUnit\lib\net45\nunit.framework.dll + True + True + NUnitFramework + + + + + + + ..\..\packages\test\NUnit\lib\portable-net45+win8+wp8+wpa81+Xamarin.Mac+MonoAndroid10+MonoTouch10+Xamarin.iOS10\nunit.framework.dll + True + True + NUnitFramework + + + + \ No newline at end of file diff --git a/src/UnitTests/UnitTests-Portable7.csproj b/src/UnitTests/UnitTests-Portable7.csproj index 8a72510f..203c53b3 100644 --- a/src/UnitTests/UnitTests-Portable7.csproj +++ b/src/UnitTests/UnitTests-Portable7.csproj @@ -67,11 +67,46 @@ - - - ..\..\packages\test\NUnit\lib\nunit.framework.dll - True - True - - + + + + + ..\..\packages\test\NUnit\lib\net20\nunit.framework.dll + True + True + NUnitFramework + + + + + + + ..\..\packages\test\NUnit\lib\net40\nunit.framework.dll + True + True + NUnitFramework + + + + + + + ..\..\packages\test\NUnit\lib\net45\nunit.framework.dll + True + True + NUnitFramework + + + + + + + ..\..\packages\test\NUnit\lib\portable-net45+win8+wp8+wpa81+Xamarin.Mac+MonoAndroid10+MonoTouch10+Xamarin.iOS10\nunit.framework.dll + True + True + NUnitFramework + + + + \ No newline at end of file diff --git a/src/UnitTests/UnitTests-Portable78.csproj b/src/UnitTests/UnitTests-Portable78.csproj index 2ac82451..fd5cd4cf 100644 --- a/src/UnitTests/UnitTests-Portable78.csproj +++ b/src/UnitTests/UnitTests-Portable78.csproj @@ -67,11 +67,46 @@ - - - ..\..\packages\test\NUnit\lib\nunit.framework.dll - True - True - - + + + + + ..\..\packages\test\NUnit\lib\net20\nunit.framework.dll + True + True + NUnitFramework + + + + + + + ..\..\packages\test\NUnit\lib\net40\nunit.framework.dll + True + True + NUnitFramework + + + + + + + ..\..\packages\test\NUnit\lib\net45\nunit.framework.dll + True + True + NUnitFramework + + + + + + + ..\..\packages\test\NUnit\lib\portable-net45+win8+wp8+wpa81+Xamarin.Mac+MonoAndroid10+MonoTouch10+Xamarin.iOS10\nunit.framework.dll + True + True + NUnitFramework + + + + \ No newline at end of file diff --git a/src/UnitTests/UnitTests.csproj b/src/UnitTests/UnitTests.csproj index 114a4b63..c4b98410 100644 --- a/src/UnitTests/UnitTests.csproj +++ b/src/UnitTests/UnitTests.csproj @@ -416,11 +416,46 @@ - - - ..\..\packages\test\NUnit\lib\nunit.framework.dll - True - True - - + + + + + ..\..\packages\test\NUnit\lib\net20\nunit.framework.dll + True + True + NUnitFramework + + + + + + + ..\..\packages\test\NUnit\lib\net40\nunit.framework.dll + True + True + NUnitFramework + + + + + + + ..\..\packages\test\NUnit\lib\net45\nunit.framework.dll + True + True + NUnitFramework + + + + + + + ..\..\packages\test\NUnit\lib\portable-net45+win8+wp8+wpa81+Xamarin.Mac+MonoAndroid10+MonoTouch10+Xamarin.iOS10\nunit.framework.dll + True + True + NUnitFramework + + + + \ No newline at end of file diff --git a/src/UnitTests/UseLinearAlgebraProvider.cs b/src/UnitTests/UseLinearAlgebraProvider.cs index 2763aab3..c9969793 100644 --- a/src/UnitTests/UseLinearAlgebraProvider.cs +++ b/src/UnitTests/UseLinearAlgebraProvider.cs @@ -3,7 +3,7 @@ // http://numerics.mathdotnet.com // http://github.com/mathnet/mathnet-numerics // -// Copyright (c) 2009-2012 Math.NET +// Copyright (c) 2009-2016 Math.NET // // Permission is hereby granted, free of charge, to any person // obtaining a copy of this software and associated documentation @@ -27,15 +27,18 @@ // OTHER DEALINGS IN THE SOFTWARE. // +extern alias NUnitFramework; + using System; -using NUnit.Framework; +using NUnitFramework.NUnit.Framework; +using NUnitFramework.NUnit.Framework.Interfaces; namespace MathNet.Numerics.UnitTests { [AttributeUsage(AttributeTargets.Assembly)] public class UseLinearAlgebraProvider : Attribute, ITestAction { - public void BeforeTest(TestDetails testDetails) + public void BeforeTest(ITest testDetails) { #if !NET35 && NATIVE #if MKL @@ -48,7 +51,7 @@ namespace MathNet.Numerics.UnitTests #endif } - public void AfterTest(TestDetails details) + public void AfterTest(ITest details) { }