MRelay:主机到主机网络加速和加密-开源

<?xml version="1.0" encoding="utf-8"?> <doc> <assembly><name>FSharp.Core</name></assembly> <members> <member name=""> </member> <member name=""> </member> <member name=""> </member> <member name=""> </member> <member name=""> </member> <member name=""> </member> <member name="T:Microsoft.BuildSettings.BuildDetails"> </member> <member name=""> </member> <member name=""> </member> <member name=""> </member> <member name=""> </member> <member name=""> </member> <member name="T:Microsoft.BuildSettings.Version"> </member> <member name=""> </member> <member name=""> </member> <member name="P:Microsoft.FSharp.Collections.FSharpList`1.Tail"> <summary>Gets the tail of the list, which is a list containing all the elements of the list, excluding the first element </summary> </member> <member name="P:Microsoft.FSharp.Collections.FSharpList`1.Length"> <summary>Gets the number of items contained in the list</summary> </member> <member name="P:Microsoft.FSharp.Collections.FSharpList`1.Item(System.Int32)"> <summary>Gets the element of the list at the given position.</summary> <remarks>Lists are represented as linked lists so this is an O(n) operation.</remarks> <param name="index">The index.</param> <returns>The value at the given index.</returns> </member> <member name="P:Microsoft.FSharp.Collections.FSharpList`1.IsEmpty"> <summary>Gets a value indicating if the list contains no entries</summary> </member> <member name="P:Microsoft.FSharp.Collections.FSharpList`1.Head"> <summary>Gets the first element of the list</summary> </member> <member name="P:Microsoft.FSharp.Collections.FSharpList`1.Empty"> <summary>Returns an empty list of a particular type</summary> </member> <member name="M:Microsoft.FSharp.Collections.FSharpList`1.Cons(`0,Microsoft.FSharp.Collections.FSharpList{`0})"> <summary>Returns a list with <c>head</c> as its first element and <c>tail</c> as its subsequent elements</summary> <param name="head">A new head value for the list.</param> <param name="tail">The existing list.</param> <returns>The list with head appended to the front of tail.</returns> </member> <member name="T:Microsoft.FSharp.Collections.FSharpList`1"> <summary>The type of immutable singly-linked lists.</summary> <remarks>Use the constructors <c>[]</c> and <c>::</c> (infix) to create values of this type, or the notation <c>[1;2;3]</c>. Use the values in the <c>List</c> module to manipulate values of this type, or pattern match against the values directly.</remarks> </member> <member name="P:Microsoft.FSharp.Collections.FSharpMap`2.Item(`0)"> <summary>Lookup an element in the map. Raise <c>KeyNotFoundException</c> if no binding exists in the map.</summary> <param name="key">The input key.</param> <exception cref="System.Collections.Generic.KeyNotFoundException">Thrown when the key is not found.</exception> <returns>The value mapped to the key.</returns> </member> <member name="P:Microsoft.FSharp.Collections.FSharpMap`2.IsEmpty"> <summary>Returns true if there are no bindings in the map.</summary> </member> <member name="P:Microsoft.FSharp.Collections.FSharpMap`2.Count"> <summary>The number of bindings in the map.</summary> </member> <member name="M:Microsoft.FSharp.Collections.FSharpMap`2.TryFind(`0)"> <summary>Lookup an element in the map, returning a <c>Some</c> value if the element is in the domain of the map and <c>None</c> if not.</summary> <param name="key">The input key.</param> <returns>The mapped value, or None if the key is not in the map.</returns> </member> <member name="M:Microsoft.FSharp.Collections.FSharpMap`2.Remove(`0)"> <summary>Removes an element from the domain of the map. No exception is raised if the element is not present.</summary> <param name="key">The input key.</param> <returns>The resulting map.</returns> </member> <member name=""> </member> <member name="M:Microsoft.FSharp.Collections.FSharpMap`2.ContainsKey(`0)"> <summary>Tests if an element is in the domain of the map.</summary> <param name="key">The input key.</param> <returns>True if the map contains the given key.</returns> </member> <member name="M:Microsoft.FSharp.Collections.FSharpMap`2.Add(`0,`1)"> <summary>Returns a new map with the binding added to the given map.</summary> <param name="key">The input key.</param> <returns>The resulting map.</returns> </member> <member name="M:Microsoft.FSharp.Collections.FSharpMap`2.#ctor(System.Collections.Generic.IEnumerable{System.Tuple{`0,`1}})"> <summary>Builds a map that contains the bindings of the given IEnumerable.</summary> <param name="elements">The input sequence of key/value pairs.</param> <returns>The resulting map.</returns> </member> <member name="T:Microsoft.FSharp.Collections.FSharpMap`2"> <summary>Immutable maps. Keys are ordered by F# generic comparison.</summary> <remarks>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.</remarks> </member> <member name="T:Microsoft.FSharp.Collections.ResizeArray`1"> <summary>An abbreviation for the CLI type <c>System.Collections.Generic.List&lt;_&gt;</c></summary> </member> <member name="M:Microsoft.FSharp.Collections.FSharpSet`1.op_Subtraction(Microsoft.FSharp.Collections.FSharpSet{`0},Microsoft.FSharp.Collections.FSharpSet{`0})"> <summary>Returns a new set with the elements of the second set removed from the first.</summary> <param name="set1">The first input set.</param> <param name="set2">The second input set.</param> <returns>A set containing elements of the first set that are not contained in the second set.</returns> </member> <member name="M:Microsoft.FSharp.Collections.FSharpSet`1.op_Addition(Microsoft.FSharp.Collections.FSharpSet{`0},Microsoft.FSharp.Collections.FSharpSet{`0})"> <summary>Compute the union of the two sets.</summary> <param name="set1">The first input set.</param> <param name="set2">The second input set.</param> <returns>The union of the two input sets.</returns> </member> <member name="P:Microsoft.FSharp.Collections.FSharpSet`1.MinimumElement"> <summary>Returns the lowest element in the set according to the ordering being used for the set.</summary> </member> <member name="P:Microsoft.FSharp.Collections.FSharpSet`1.MaximumElement"> <summary>Returns the highest element in the set according to the ordering being used for the set.</summary> </member> <member name="P:Microsoft.FSharp.Collections.FSharpSet`1.IsEmpty"> <summary>A useful shortcut for Set.isEmpty. See the Set module for further operations on sets.</summary> </member> <member name="P:Microsoft.FSharp.Collections.FSharpSet`1.Count"> <summary>The number of elements in the set</summary> </member> <member name="M:Microsoft.FSharp.Collections.FSharpSet`1.Remove(`0)"> <summary>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.</summary> <param name="value">The value to remove from the set.</param> <returns>The result set.</returns> </member> <member name="M:Microsoft.FSharp.Collections.FSharpSet`1.IsSupersetOf(Microsoft.FSharp.Collections.FSharpSet{`0})"> <summary>Evaluates to "true" if all elements of the second set are in the first.</summary> <param name="otherSet">The set to test against.</param> <returns>True if this set is a superset of <c>otherSet</c>.</returns> </member> <member name="M:Microsoft.FSharp.Collections.FSharpSet`1.IsSubsetOf(Microsoft.FSharp.Collections.FSharpSet{`0})"> <summary>Evaluates to "true" if all elements of the first set are in the second.</summary> <para