diff --git a/xml/Microsoft.Extensions.DependencyInjection/ISupportRequiredService.xml b/xml/Microsoft.Extensions.DependencyInjection/ISupportRequiredService.xml index 7fb1f497d84..6b99840f6ef 100644 --- a/xml/Microsoft.Extensions.DependencyInjection/ISupportRequiredService.xml +++ b/xml/Microsoft.Extensions.DependencyInjection/ISupportRequiredService.xml @@ -56,8 +56,6 @@ A service object of type . Throws an exception if the cannot create the object. To be added. - - has already been disposed. diff --git a/xml/System.Buffers.Text/Base64Url.xml b/xml/System.Buffers.Text/Base64Url.xml index cb17c1fdf9c..b3578410f4f 100644 --- a/xml/System.Buffers.Text/Base64Url.xml +++ b/xml/System.Buffers.Text/Base64Url.xml @@ -378,7 +378,7 @@ The input span which contains binary data that needs to be encoded. The output span which contains the result of the operation, i.e. the ASCII chars in Base64Url. - Encodes the span of binary data into unicode ASCII chars represented as Base64Url. + Encodes the span of binary data into Unicode ASCII chars represented as Base64Url. The number of bytes written into the destination span. This can be used to slice the output for subsequent calls, if necessary. This implementation of the base64url encoding omits the optional padding characters. The buffer in is too small to hold the encoded output. @@ -791,7 +791,7 @@ The input span which contains ASCII chars in Base64Url that needs to be decoded. The output span which contains the result of the operation, i.e. the decoded binary data. When this method returns, contains the number of bytes written into the output span. This can be used to slice the output for subsequent calls, if necessary. This parameter is treated as uninitialized. - Decodes the span of unicode ASCII chars represented as Base64Url into binary data. + Decodes the span of Unicode ASCII chars represented as Base64Url into binary data. if bytes decoded successfully; if is too small. To be added. @@ -869,7 +869,7 @@ The input span which contains binary data that needs to be encoded. The output span which contains the result of the operation, i.e. the ASCII chars in Base64Url. When this method returns, contains the number of chars written into the output span. This can be used to slice the output for subsequent calls, if necessary. This parameter is treated as uninitialized. - Encodes the span of binary data into unicode ASCII chars represented as Base64Url. + Encodes the span of binary data into Unicode ASCII chars represented as Base64Url. if chars encoded successfully; if is too small. This implementation of the base64url encoding omits the optional padding characters. @@ -948,7 +948,7 @@ The encoded text output is larger than the binary data contained in the input (the operation inflates the data). - if bytes encoded successfully; if is too small. + if bytes encoded successfully; if is too small to fit the result. This implementation of the base64url encoding omits the optional padding characters. diff --git a/xml/System.Buffers/BuffersExtensions.xml b/xml/System.Buffers/BuffersExtensions.xml index fbd634b8676..d49a2a66d0b 100644 --- a/xml/System.Buffers/BuffersExtensions.xml +++ b/xml/System.Buffers/BuffersExtensions.xml @@ -158,8 +158,8 @@ The type of the items in the . The source . The item to find in the . - Returns the position of the first occurrence of in the . - An object whose method returns the position of the first occurrence of , or an object whose property is . + Returns the position of the first occurrence of in the . + An object whose method returns the position of the first occurrence of , or an object whose property is . To be added. diff --git a/xml/System.Collections.Concurrent/BlockingCollection`1.xml b/xml/System.Collections.Concurrent/BlockingCollection`1.xml index 35148988b45..fbfdc06f8be 100644 --- a/xml/System.Collections.Concurrent/BlockingCollection`1.xml +++ b/xml/System.Collections.Concurrent/BlockingCollection`1.xml @@ -2170,7 +2170,7 @@ This member is an explicit interface member implementation. It can be used only ]]> - At least one of the instances or the that created has been disposed. + At least one of the instances has been disposed. The argument is null. is a negative number other than -1 milliseconds, which represents an infinite time-out. diff --git a/xml/System.Collections.Concurrent/ConcurrentDictionary`2.xml b/xml/System.Collections.Concurrent/ConcurrentDictionary`2.xml index 827429ad799..31cc5031057 100644 --- a/xml/System.Collections.Concurrent/ConcurrentDictionary`2.xml +++ b/xml/System.Collections.Concurrent/ConcurrentDictionary`2.xml @@ -1663,7 +1663,7 @@ The number of elements in the source The to remove. Removes the specified key/value pair from the collection. - if the element is successfully removed; otherwise, . This method also returns false if was not found in the original . + if the element is successfully removed; otherwise, . This method also returns false if the key was not found in the original . To be added. Thread-Safe Collections How to: Add and Remove Items from a ConcurrentDictionary diff --git a/xml/System.Collections.Generic/Comparer`1.xml b/xml/System.Collections.Generic/Comparer`1.xml index 38ee8107a2b..ec541de744f 100644 --- a/xml/System.Collections.Generic/Comparer`1.xml +++ b/xml/System.Collections.Generic/Comparer`1.xml @@ -235,8 +235,6 @@ ## Remarks Implement this method to provide a customized sort order comparison for type `T`. - - ## Examples The following example defines a comparer of `Box` objects that can be used instead of the default comparer. This example is part of a larger example provided for the class. @@ -246,7 +244,7 @@ ]]> - Type does not implement either the generic interface or the interface. + Type T does not implement either the generic interface or the interface. Comparing with any reference type is allowed and does not generate an exception. A null reference is considered to be less than any reference that is not null. @@ -345,16 +343,14 @@ System.Collections.Generic.Comparer<T> - Returns a default sort order comparer for the type specified by the generic argument. - An object that inherits and serves as a sort order comparer for type . + Returns a default sort-order comparer for the type specified by the generic argument. + An object that inherits and serves as a sort-order comparer for type T. returned by this property uses the generic interface (`IComparable` in C#, `IComparable(Of T)` in Visual Basic) to compare two objects. If type `T` does not implement the generic interface, this property returns a that uses the interface. - - ## Examples The following example shows how to use the property to get an object that performs the default comparison. This example is part of a larger example provided for the class. @@ -448,8 +444,6 @@ Comparing `null` with any reference type is allowed and does not generate an exception. When sorting, `null` is considered to be less than any other object. - - ## Examples The following example shows how to use the method to compare two objects. This example is part of a larger example provided for the class. @@ -460,7 +454,7 @@ ]]> - or is of a type that cannot be cast to type . + or is of a type that cannot be cast to type T. -or- diff --git a/xml/System.Collections.Generic/Dictionary`2.xml b/xml/System.Collections.Generic/Dictionary`2.xml index ed01c459cef..1464e0c93f9 100644 --- a/xml/System.Collections.Generic/Dictionary`2.xml +++ b/xml/System.Collections.Generic/Dictionary`2.xml @@ -2533,13 +2533,13 @@ finally { property to add new elements by setting the value of a key that does not exist in the dictionary; for example, `myCollection["myNonexistentKey"] = myValue`. However, if the specified key already exists in the dictionary, setting the property overwrites the old value. In contrast, the method throws an exception if the specified key already exists. If is less than the capacity, this method approaches an O(1) operation. If the capacity needs to be increased to accommodate the new element, this method becomes an O(`n`) operation, where `n` is . - - ## Examples + The following code example shows how to access the class through the interface. The code example creates an empty of strings with string keys and uses the method to add some elements. The example demonstrates that the method throws an when attempting to add a duplicate key, or when a key or value of the wrong data type is supplied. The code example demonstrates the use of several other members of the interface. @@ -2907,8 +2907,6 @@ finally { Getting or setting the value of this property approaches an O(1) operation. - - ## Examples The following code example shows how to use the property (the indexer in C#) of the interface with a , and ways the property differs from the property. @@ -2936,7 +2934,7 @@ finally { -or- - A value is being assigned, and is of a type that is not assignable to the value type of the . + A value is being assigned and is of a type that isn't assignable to the value type of the . diff --git a/xml/System.Collections.Generic/HashSet`1.xml b/xml/System.Collections.Generic/HashSet`1.xml index fae2391a39d..1217bd75060 100644 --- a/xml/System.Collections.Generic/HashSet`1.xml +++ b/xml/System.Collections.Generic/HashSet`1.xml @@ -1033,7 +1033,7 @@ The following example demonstrates how to merge two disparate sets. This example -or- - is greater than the available space from the to the end of the destination . + is greater than the available space from to the end of the destination . diff --git a/xml/System.Collections.Generic/List`1.xml b/xml/System.Collections.Generic/List`1.xml index 834b50754aa..6d0f3316ad3 100644 --- a/xml/System.Collections.Generic/List`1.xml +++ b/xml/System.Collections.Generic/List`1.xml @@ -5027,7 +5027,7 @@ finally is not a valid index in the . - The property is set and is of a type that is not assignable to the . + The property is set and the value is of a type that isn't assignable to the . diff --git a/xml/System.Collections.Generic/OrderedDictionary`2+KeyCollection.xml b/xml/System.Collections.Generic/OrderedDictionary`2+KeyCollection.xml index f8801f78fdb..5e342d81b86 100644 --- a/xml/System.Collections.Generic/OrderedDictionary`2+KeyCollection.xml +++ b/xml/System.Collections.Generic/OrderedDictionary`2+KeyCollection.xml @@ -88,7 +88,7 @@ They key to the location in the collection. Determines whether the contains a specific value. - if is found in the ; otherwise, . + if is found in the ; otherwise, . To be added. diff --git a/xml/System.Collections.Generic/SortedDictionary`2.xml b/xml/System.Collections.Generic/SortedDictionary`2.xml index da35c286feb..bed450986d0 100644 --- a/xml/System.Collections.Generic/SortedDictionary`2.xml +++ b/xml/System.Collections.Generic/SortedDictionary`2.xml @@ -111,51 +111,51 @@ The type of the values in the dictionary. Represents a collection of key/value pairs that are sorted on the key. - generic class is a binary search tree with O(log n) retrieval, where n is the number of elements in the dictionary. In this respect, it is similar to the generic class. The two classes have similar object models, and both have O(log n) retrieval. Where the two classes differ is in memory use and speed of insertion and removal: - -- uses less memory than . - -- has faster insertion and removal operations for unsorted data: O(log n) as opposed to O(n) for . - -- If the list is populated all at once from sorted data, is faster than . - - Each key/value pair can be retrieved as a structure, or as a through the nongeneric interface. - - Keys must be immutable as long as they are used as keys in the . Every key in a must be unique. A key cannot be `null`, but a value can be, if the value type `TValue` is a reference type. - - requires a comparer implementation to perform key comparisons. You can specify an implementation of the generic interface by using a constructor that accepts a `comparer` parameter; if you do not specify an implementation, the default generic comparer is used. If type `TKey` implements the generic interface, the default comparer uses that implementation. - - The `foreach` statement of the C# language (`for each` in C++, `For Each` in Visual Basic) returns an object of the type of the elements in the collection. Since each element of the is a key/value pair, the element type is not the type of the key or the type of the value. Instead, the element type is . The following code shows C#, C++, and Visual Basic syntax. - + generic class is a binary search tree with O(log n) retrieval, where n is the number of elements in the dictionary. In this respect, it is similar to the generic class. The two classes have similar object models, and both have O(log n) retrieval. Where the two classes differ is in memory use and speed of insertion and removal: + +- uses less memory than . + +- has faster insertion and removal operations for unsorted data: O(log n) as opposed to O(n) for . + +- If the list is populated all at once from sorted data, is faster than . + + Each key/value pair can be retrieved as a structure, or as a through the nongeneric interface. + + Keys must be immutable as long as they are used as keys in the . Every key in a must be unique. A key cannot be `null`, but a value can be, if the value type `TValue` is a reference type. + + requires a comparer implementation to perform key comparisons. You can specify an implementation of the generic interface by using a constructor that accepts a `comparer` parameter; if you do not specify an implementation, the default generic comparer is used. If type `TKey` implements the generic interface, the default comparer uses that implementation. + + The `foreach` statement of the C# language (`for each` in C++, `For Each` in Visual Basic) returns an object of the type of the elements in the collection. Since each element of the is a key/value pair, the element type is not the type of the key or the type of the value. Instead, the element type is . The following code shows C#, C++, and Visual Basic syntax. + :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR/Generic.Dictionary/cpp/source2.cpp" id="Snippet11"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/DictionaryTKey,TValue/Overview/source2.cs" id="Snippet11"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.Dictionary/VB/source2.vb" id="Snippet11"::: - - The `foreach` statement is a wrapper around the enumerator, which allows only reading from the collection, not writing to it. - - - -## Examples - The following code example creates an empty of strings with string keys and uses the method to add some elements. The example demonstrates that the method throws an when attempting to add a duplicate key. - - The example uses the property (the indexer in C#) to retrieve values, demonstrating that a is thrown when a requested key is not present, and showing that the value associated with a key can be replaced. - - The example shows how to use the method as a more efficient way to retrieve values if a program often must try key values that are not in the dictionary, and it shows how to use the method to test whether a key exists before calling the method. - - The example shows how to enumerate the keys and values in the dictionary and how to enumerate the keys and values alone using the property and the property. - - Finally, the example demonstrates the method. - + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.Dictionary/VB/source2.vb" id="Snippet11"::: + + The `foreach` statement is a wrapper around the enumerator, which allows only reading from the collection, not writing to it. + + + +## Examples + The following code example creates an empty of strings with string keys and uses the method to add some elements. The example demonstrates that the method throws an when attempting to add a duplicate key. + + The example uses the property (the indexer in C#) to retrieve values, demonstrating that a is thrown when a requested key is not present, and showing that the value associated with a key can be replaced. + + The example shows how to use the method as a more efficient way to retrieve values if a program often must try key values that are not in the dictionary, and it shows how to use the method to test whether a key exists before calling the method. + + The example shows how to enumerate the keys and values in the dictionary and how to enumerate the keys and values alone using the property and the property. + + Finally, the example demonstrates the method. + :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedDictionaryTKey,TValue/Overview/source.cs" id="Snippet1"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary/VB/source.vb" id="Snippet1"::: - +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary/VB/source.vb" id="Snippet1"::: + ]]> - Public static ( in Visual Basic) members of this type are thread safe. Any instance members are not guaranteed to be thread safe. - + Public static ( in Visual Basic) members of this type are thread safe. Any instance members are not guaranteed to be thread safe. + A can support multiple readers concurrently, as long as the collection is not modified. Even so, enumerating through a collection is intrinsically not a thread-safe procedure. To guarantee thread safety during enumeration, you can lock the collection during the entire enumeration. To allow the collection to be accessed by multiple threads for reading and writing, you must implement your own synchronization. @@ -213,25 +213,25 @@ Initializes a new instance of the class that is empty and uses the default implementation for the key type. - must be unique according to the default comparer. - - requires a comparer implementation to perform key comparisons. This constructor uses the default generic equality comparer . If type `TKey` implements the generic interface, the default comparer uses that implementation. Alternatively, you can specify an implementation of the generic interface by using a constructor that accepts a `comparer` parameter. - - This constructor is an O(1) operation. - - - -## Examples - The following code example creates an empty of strings with string keys and uses the method to add some elements. The example demonstrates that the method throws an when attempting to add a duplicate key. - - This code example is part of a larger example provided for the class. - + must be unique according to the default comparer. + + requires a comparer implementation to perform key comparisons. This constructor uses the default generic equality comparer . If type `TKey` implements the generic interface, the default comparer uses that implementation. Alternatively, you can specify an implementation of the generic interface by using a constructor that accepts a `comparer` parameter. + + This constructor is an O(1) operation. + + + +## Examples + The following code example creates an empty of strings with string keys and uses the method to add some elements. The example demonstrates that the method throws an when attempting to add a duplicate key. + + This code example is part of a larger example provided for the class. + :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedDictionaryTKey,TValue/Overview/source.cs" interactive="try-dotnet-method" id="Snippet2"::: :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary/VB/source.vb" id="Snippet2"::: - + ]]> @@ -286,23 +286,23 @@ The implementation to use when comparing keys, or to use the default for the type of the key. Initializes a new instance of the class that is empty and uses the specified implementation to compare keys. - must be unique according to the specified comparer. - - requires a comparer implementation to perform key comparisons. If `comparer` is `null`, this constructor uses the default generic equality comparer, . If type `TKey` implements the generic interface, the default comparer uses that implementation. - - This constructor is an O(1) operation. - - - -## Examples - The following code example creates a with a case-insensitive comparer for the current culture. The example adds four elements, some with lower-case keys and some with upper-case keys. The example then attempts to add an element with a key that differs from an existing key only by case, catches the resulting exception, and displays an error message. Finally, the example displays the elements in case-insensitive sort order. - + must be unique according to the specified comparer. + + requires a comparer implementation to perform key comparisons. If `comparer` is `null`, this constructor uses the default generic equality comparer, . If type `TKey` implements the generic interface, the default comparer uses that implementation. + + This constructor is an O(1) operation. + + + +## Examples + The following code example creates a with a case-insensitive comparer for the current culture. The example adds four elements, some with lower-case keys and some with upper-case keys. The example then attempts to add an element with a key that differs from an existing key only by case, catches the resulting exception, and displays an error message. Finally, the example displays the elements in case-insensitive sort order. + :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedDictionaryTKey,TValue/.ctor/source.cs" interactive="try-dotnet" id="Snippet1"::: :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.ctor_IComp/VB/source.vb" id="Snippet1"::: - + ]]> @@ -356,23 +356,23 @@ The whose elements are copied to the new . Initializes a new instance of the class that contains elements copied from the specified and uses the default implementation for the key type. - must be unique according to the default comparer; therefore, every key in the source `dictionary` must also be unique according to the default comparer. - - requires a comparer implementation to perform key comparisons. This constructor uses the default generic equality comparer, . If type `TKey` implements the generic interface, the default comparer uses that implementation. Alternatively, you can specify an implementation of the generic interface by using a constructor that accepts a `comparer` parameter. - - This constructor is an O(`n` log `n`) operation, where `n` is the number of elements in `dictionary`. - - - -## Examples - The following code example shows how to use to create a sorted copy of the information in a , by passing the to the constructor. - + must be unique according to the default comparer; therefore, every key in the source `dictionary` must also be unique according to the default comparer. + + requires a comparer implementation to perform key comparisons. This constructor uses the default generic equality comparer, . If type `TKey` implements the generic interface, the default comparer uses that implementation. Alternatively, you can specify an implementation of the generic interface by using a constructor that accepts a `comparer` parameter. + + This constructor is an O(`n` log `n`) operation, where `n` is the number of elements in `dictionary`. + + + +## Examples + The following code example shows how to use to create a sorted copy of the information in a , by passing the to the constructor. + :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedDictionaryTKey,TValue/.ctor/source1.cs" interactive="try-dotnet" id="Snippet1"::: :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.ctor_IDic/VB/source.vb" id="Snippet1"::: - + ]]> @@ -434,23 +434,23 @@ The implementation to use when comparing keys, or to use the default for the type of the key. Initializes a new instance of the class that contains elements copied from the specified and uses the specified implementation to compare keys. - must be unique according to the specified comparer; therefore, every key in the source `dictionary` must also be unique according to the specified comparer. - - requires a comparer implementation to perform key comparisons. If `comparer` is `null`, this constructor uses the default generic equality comparer, . If type `TKey` implements the generic interface, the default comparer uses that implementation. - - This constructor is an O(`n` log `n`) operation, where `n` is the number of elements in `dictionary`. - - - -## Examples - The following code example shows how to use to create a case-insensitive sorted copy of the information in a case-insensitive , by passing the to the constructor. In this example, the case-insensitive comparers are for the current culture. - + must be unique according to the specified comparer; therefore, every key in the source `dictionary` must also be unique according to the specified comparer. + + requires a comparer implementation to perform key comparisons. If `comparer` is `null`, this constructor uses the default generic equality comparer, . If type `TKey` implements the generic interface, the default comparer uses that implementation. + + This constructor is an O(`n` log `n`) operation, where `n` is the number of elements in `dictionary`. + + + +## Examples + The following code example shows how to use to create a case-insensitive sorted copy of the information in a case-insensitive , by passing the to the constructor. In this example, the case-insensitive comparers are for the current culture. + :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedDictionaryTKey,TValue/.ctor/source2.cs" interactive="try-dotnet" id="Snippet1"::: :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.ctor_IDicIComp/VB/source.vb" id="Snippet1"::: - + ]]> @@ -511,25 +511,25 @@ The value of the element to add. The value can be for reference types. Adds an element with the specified key and value into the . - property to add new elements by setting the value of a key that does not exist in the ; for example, `myCollection["myNonexistentKey"] = myValue` (in Visual Basic, `myCollection("myNonexistantKey") = myValue`). However, if the specified key already exists in the , setting the property overwrites the old value. In contrast, the method throws an exception if an element with the specified key already exists. - - A key cannot be `null`, but a value can be, if the value type `TValue` is a reference type. - - This method is an O(log `n`) operation, where `n` is . - - - -## Examples - The following code example creates an empty of strings with string keys and uses the method to add some elements. The example demonstrates that the method throws an when attempting to add a duplicate key. - - This code example is part of a larger example provided for the class. - + property to add new elements by setting the value of a key that does not exist in the ; for example, `myCollection["myNonexistentKey"] = myValue` (in Visual Basic, `myCollection("myNonexistantKey") = myValue`). However, if the specified key already exists in the , setting the property overwrites the old value. In contrast, the method throws an exception if an element with the specified key already exists. + + A key cannot be `null`, but a value can be, if the value type `TValue` is a reference type. + + This method is an O(log `n`) operation, where `n` is . + + + +## Examples + The following code example creates an empty of strings with string keys and uses the method to add some elements. The example demonstrates that the method throws an when attempting to add a duplicate key. + + This code example is part of a larger example provided for the class. + :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedDictionaryTKey,TValue/Overview/source.cs" interactive="try-dotnet-method" id="Snippet2"::: :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary/VB/source.vb" id="Snippet2"::: - + ]]> @@ -583,13 +583,13 @@ Removes all elements from the . - property is set to 0, and references to other objects from elements of the collection are also released. - - This method is an O(1) operation, since the root of the internal data structures is simply released for garbage collection. - + property is set to 0, and references to other objects from elements of the collection are also released. + + This method is an O(1) operation, since the root of the internal data structures is simply released for garbage collection. + ]]> @@ -633,13 +633,13 @@ Gets the used to order the elements of the . The used to order the elements of the - requires a comparer implementation to perform key comparisons. You can specify an implementation of the generic interface by using a constructor that accepts a `comparer` parameter. If you do not, the default generic equality comparer, , is used. If type `TKey` implements the generic interface, the default comparer uses that implementation. - - Getting the value of this property is an O(1) operation. - + requires a comparer implementation to perform key comparisons. You can specify an implementation of the generic interface by using a constructor that accepts a `comparer` parameter. If you do not, the default generic equality comparer, , is used. If type `TKey` implements the generic interface, the default comparer uses that implementation. + + Getting the value of this property is an O(1) operation. + ]]> @@ -693,25 +693,25 @@ if the contains an element with the specified key; otherwise, . - method to test whether a key exists prior to calling the method. It also shows how to use the method to retrieve values, which is an efficient way to retrieve values when a program frequently tries keys that are not in the dictionary. Finally, it shows the least efficient way to test whether keys exist, by using the property (the indexer in C#). - - This code example is part of a larger example provided for the class. - + method to test whether a key exists prior to calling the method. It also shows how to use the method to retrieve values, which is an efficient way to retrieve values when a program frequently tries keys that are not in the dictionary. Finally, it shows the least efficient way to test whether keys exist, by using the property (the indexer in C#). + + This code example is part of a larger example provided for the class. + :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedDictionaryTKey,TValue/Overview/source.cs" id="Snippet6"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary/VB/source.vb" id="Snippet6"::: + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary/VB/source.vb" id="Snippet6"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedDictionaryTKey,TValue/Overview/source.cs" id="Snippet5"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary/VB/source.vb" id="Snippet5"::: +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary/VB/source.vb" id="Snippet5"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedDictionaryTKey,TValue/Overview/source.cs" id="Snippet4"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary/VB/source.vb" id="Snippet4"::: - +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary/VB/source.vb" id="Snippet4"::: + ]]> @@ -763,13 +763,13 @@ if the contains an element with the specified value; otherwise, . - for the value type `TValue`. - - This method performs a linear search; therefore, the average execution time is proportional to the property. That is, this method is an O(`n`) operation, where `n` is . - + for the value type `TValue`. + + This method performs a linear search; therefore, the average execution time is proportional to the property. That is, this method is an O(`n`) operation, where `n` is . + ]]> @@ -830,15 +830,15 @@ The zero-based index in at which copying begins. Copies the elements of the to the specified array of structures, starting at the specified index. - [!NOTE] -> If the type of the source cannot be cast automatically to the type of the destination `array`, the nongeneric implementations of throw , whereas the generic implementations throw . - - This method is an O(`n`) operation, where `n` is . - +> If the type of the source cannot be cast automatically to the type of the destination `array`, the nongeneric implementations of throw , whereas the generic implementations throw . + + This method is an O(`n`) operation, where `n` is . + ]]> @@ -892,11 +892,11 @@ Gets the number of key/value pairs contained in the . The number of key/value pairs contained in the . - @@ -941,31 +941,31 @@ Returns an enumerator that iterates through the . A for the . - structure representing a value and its key. - - The `foreach` statement of the C# language (`for each` in C++, `For Each` in Visual Basic) hides the complexity of enumerators. Therefore, using `foreach` is recommended, instead of directly manipulating the enumerator. - - Enumerators can be used to read the data in the collection, but they cannot be used to modify the underlying collection. - - The dictionary is maintained in a sorted order using an internal tree. Every new element is positioned at the correct sort position, and the tree is adjusted to maintain the sort order whenever an element is removed. While enumerating, the sort order is maintained. - - Initially, the enumerator is positioned before the first element in the collection. At this position, the property is undefined. Therefore, you must call the method to advance the enumerator to the first element of the collection before reading the value of . - - The property returns the same element until the method is called. sets to the next element. - - If passes the end of the collection, the enumerator is positioned after the last element in the collection and returns `false`. When the enumerator is at this position, subsequent calls to also return `false`. If the last call to returned `false`, is undefined. You cannot set to the first element of the collection again; you must create a new enumerator instance instead. - - An enumerator remains valid as long as the collection remains unchanged. If changes are made to the collection, such as adding, modifying, or deleting elements, the enumerator is irrecoverably invalidated and the next call to or throws an . - - The enumerator does not have exclusive access to the collection; therefore, enumerating through a collection is intrinsically not a thread-safe procedure. To guarantee thread safety during enumeration, you can lock the collection during the entire enumeration. To allow the collection to be accessed by multiple threads for reading and writing, you must implement your own synchronization. - - Default implementations of collections in the namespace are not synchronized. - - This method is an O(log n) operation, where n is count. - + structure representing a value and its key. + + The `foreach` statement of the C# language (`for each` in C++, `For Each` in Visual Basic) hides the complexity of enumerators. Therefore, using `foreach` is recommended, instead of directly manipulating the enumerator. + + Enumerators can be used to read the data in the collection, but they cannot be used to modify the underlying collection. + + The dictionary is maintained in a sorted order using an internal tree. Every new element is positioned at the correct sort position, and the tree is adjusted to maintain the sort order whenever an element is removed. While enumerating, the sort order is maintained. + + Initially, the enumerator is positioned before the first element in the collection. At this position, the property is undefined. Therefore, you must call the method to advance the enumerator to the first element of the collection before reading the value of . + + The property returns the same element until the method is called. sets to the next element. + + If passes the end of the collection, the enumerator is positioned after the last element in the collection and returns `false`. When the enumerator is at this position, subsequent calls to also return `false`. If the last call to returned `false`, is undefined. You cannot set to the first element of the collection again; you must create a new enumerator instance instead. + + An enumerator remains valid as long as the collection remains unchanged. If changes are made to the collection, such as adding, modifying, or deleting elements, the enumerator is irrecoverably invalidated and the next call to or throws an . + + The enumerator does not have exclusive access to the collection; therefore, enumerating through a collection is intrinsically not a thread-safe procedure. To guarantee thread safety during enumeration, you can lock the collection during the entire enumeration. To allow the collection to be accessed by multiple threads for reading and writing, you must implement your own synchronization. + + Default implementations of collections in the namespace are not synchronized. + + This method is an O(log n) operation, where n is count. + ]]> @@ -1018,35 +1018,35 @@ Gets or sets the value associated with the specified key. 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. - property to add new elements by setting the value of a key that does not exist in the ; for example, `myCollection["myNonexistentKey"] = myValue`. However, if the specified key already exists in the , setting the property overwrites the old value. In contrast, the method does not modify existing elements. - - A key cannot be `null`, but a value can be, if the value type `TValue` is a reference type. - - The C# language uses the [this](/dotnet/csharp/language-reference/keywords/this) keyword to define the indexers instead of implementing the property. Visual Basic implements as a default property, which provides the same indexing functionality. - - Getting the value of this property is an O(log `n`) operation; setting the property is also an O(log `n`) operation. - - - -## Examples - The following code example uses the property (the indexer in C#) to retrieve values, demonstrating that a is thrown when a requested key is not present, and showing that the value associated with a key can be replaced. - - The example also shows how to use the method as a more efficient way to retrieve values if a program often must try key values that are not in the dictionary. - - This code example is part of a larger example provided for the class. - + property to add new elements by setting the value of a key that does not exist in the ; for example, `myCollection["myNonexistentKey"] = myValue`. However, if the specified key already exists in the , setting the property overwrites the old value. In contrast, the method does not modify existing elements. + + A key cannot be `null`, but a value can be, if the value type `TValue` is a reference type. + + The C# language uses the [this](/dotnet/csharp/language-reference/keywords/this) keyword to define the indexers instead of implementing the property. Visual Basic implements as a default property, which provides the same indexing functionality. + + Getting the value of this property is an O(log `n`) operation; setting the property is also an O(log `n`) operation. + + + +## Examples + The following code example uses the property (the indexer in C#) to retrieve values, demonstrating that a is thrown when a requested key is not present, and showing that the value associated with a key can be replaced. + + The example also shows how to use the method as a more efficient way to retrieve values if a program often must try key values that are not in the dictionary. + + This code example is part of a larger example provided for the class. + :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedDictionaryTKey,TValue/Overview/source.cs" id="Snippet3"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary/VB/source.vb" id="Snippet3"::: + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary/VB/source.vb" id="Snippet3"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedDictionaryTKey,TValue/Overview/source.cs" id="Snippet4"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary/VB/source.vb" id="Snippet4"::: +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary/VB/source.vb" id="Snippet4"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedDictionaryTKey,TValue/Overview/source.cs" id="Snippet5"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary/VB/source.vb" id="Snippet5"::: - +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary/VB/source.vb" id="Snippet5"::: + ]]> @@ -1094,27 +1094,27 @@ Gets a collection containing the keys in the . A containing the keys in the . - are sorted according to the property and are in the same order as the associated values in the returned by the property. - - The returned is not a static copy; instead, the refers back to the keys in the original . Therefore, changes to the continue to be reflected in the . - - Getting the value of this property is an O(1) operation. - - - -## Examples - The following code example shows how to enumerate the keys in the dictionary using the property, and how to enumerate the keys and values in the dictionary. - - This code is part of a larger example that can be compiled and executed. See . - + are sorted according to the property and are in the same order as the associated values in the returned by the property. + + The returned is not a static copy; instead, the refers back to the keys in the original . Therefore, changes to the continue to be reflected in the . + + Getting the value of this property is an O(1) operation. + + + +## Examples + The following code example shows how to enumerate the keys in the dictionary using the property, and how to enumerate the keys and values in the dictionary. + + This code is part of a larger example that can be compiled and executed. See . + :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedDictionaryTKey,TValue/Overview/source.cs" id="Snippet9"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary/VB/source.vb" id="Snippet9"::: + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary/VB/source.vb" id="Snippet9"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedDictionaryTKey,TValue/Overview/source.cs" id="Snippet7"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary/VB/source.vb" id="Snippet7"::: - +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary/VB/source.vb" id="Snippet7"::: + ]]> @@ -1168,23 +1168,23 @@ if the element is successfully removed; otherwise, . This method also returns if is not found in the . - does not contain an element with the specified key, the remains unchanged. No exception is thrown. - - This method is an O(log `n`) operation. - - - -## Examples - The following code example shows how to remove a key/value pair from the dictionary using the method. - - This code example is part of a larger example provided for the class. - + does not contain an element with the specified key, the remains unchanged. No exception is thrown. + + This method is an O(log `n`) operation. + + + +## Examples + The following code example shows how to remove a key/value pair from the dictionary using the method. + + This code example is part of a larger example provided for the class. + :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedDictionaryTKey,TValue/Overview/source.cs" id="Snippet10"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary/VB/source.vb" id="Snippet10"::: - + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary/VB/source.vb" id="Snippet10"::: + ]]> @@ -1663,15 +1663,15 @@ The zero-based index in at which copying begins. Copies the elements of the to an array, starting at the specified array index. - [!NOTE] -> If the type of the source cannot be cast automatically to the type of the destination `array`, the nongeneric implementations of throw an , whereas the generic implementations throw an . - - This method is an O(`n`) operation, where `n` is . - +> If the type of the source cannot be cast automatically to the type of the destination `array`, the nongeneric implementations of throw an , whereas the generic implementations throw an . + + This method is an O(`n`) operation, where `n` is . + ]]> @@ -1679,18 +1679,18 @@ is less than 0. - is multidimensional. - - -or- - - does not have zero-based indexing. - - -or- - - The number of elements in the source is greater than the available space from to the end of the destination . - - -or- - + is multidimensional. + + -or- + + does not have zero-based indexing. + + -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 . @@ -1737,17 +1737,17 @@ if access to the is synchronized (thread safe); otherwise, . In the default implementation of , this property always returns . - namespace are not synchronized. - - Enumerating through a collection is intrinsically not a thread-safe procedure. Even when a collection is synchronized, other threads can still modify the collection, which can cause the enumerator to throw an exception. To guarantee thread safety during enumeration, you can either lock the collection during the entire enumeration or catch the exceptions resulting from changes made by other threads. - - The property returns an object that can be used to synchronize access to the . Synchronization is effective only if all threads lock the object before accessing the collection. - - Getting the value of this property is an O(1) operation. - + namespace are not synchronized. + + Enumerating through a collection is intrinsically not a thread-safe procedure. Even when a collection is synchronized, other threads can still modify the collection, which can cause the enumerator to throw an exception. To guarantee thread safety during enumeration, you can either lock the collection during the entire enumeration or catch the exceptions resulting from changes made by other threads. + + The property returns an object that can be used to synchronize access to the . Synchronization is effective only if all threads lock the object before accessing the collection. + + Getting the value of this property is an O(1) operation. + ]]> @@ -1795,45 +1795,45 @@ Gets an object that can be used to synchronize access to the . An object that can be used to synchronize access to the . - namespace are not synchronized. - - Enumerating through a collection is intrinsically not a thread-safe procedure. To guarantee thread safety during enumeration, you can lock the collection during the entire enumeration. To allow the collection to be accessed by multiple threads for reading and writing, you must implement your own synchronization. - - The property returns an object that can be used to synchronize access to the . Synchronization is effective only if all threads lock the object before accessing the collection. The following code shows the use of the property for C#, C++, and Visual Basic. - -```csharp -ICollection ic = ...; -lock (ic.SyncRoot) -{ - // Access the collection. -} -``` - -```vb -Dim ic As ICollection = ... -SyncLock ic.SyncRoot - ' Access the collection. -End SyncLock -``` - -```cpp -ICollection^ ic = ...; -try -{ - Monitor::Enter(ic->SyncRoot); - // Access the collection. -} -finally -{ - Monitor::Exit(ic->SyncRoot); -} -``` - - Getting the value of this property is an O(1) operation. - + namespace are not synchronized. + + Enumerating through a collection is intrinsically not a thread-safe procedure. To guarantee thread safety during enumeration, you can lock the collection during the entire enumeration. To allow the collection to be accessed by multiple threads for reading and writing, you must implement your own synchronization. + + The property returns an object that can be used to synchronize access to the . Synchronization is effective only if all threads lock the object before accessing the collection. The following code shows the use of the property for C#, C++, and Visual Basic. + +```csharp +ICollection ic = ...; +lock (ic.SyncRoot) +{ + // Access the collection. +} +``` + +```vb +Dim ic As ICollection = ... +SyncLock ic.SyncRoot + ' Access the collection. +End SyncLock +``` + +```cpp +ICollection^ ic = ...; +try +{ + Monitor::Enter(ic->SyncRoot); + // Access the collection. +} +finally +{ + Monitor::Exit(ic->SyncRoot); +} +``` + + Getting the value of this property is an O(1) operation. + ]]> @@ -1886,36 +1886,36 @@ finally The object to use as the value of the element to add. Adds an element with the provided key and value to the . - property to add new elements by setting the value of a key that does not exist in the dictionary; for example, `myCollection["myNonexistentKey"] = myValue`. However, if the specified key already exists in the dictionary, setting the property overwrites the old value. In contrast, the method does not modify existing elements. - - This method is an O(log `n`) operation, where `n` is . - - - -## Examples - The following code example shows how to access the class through the interface. The code example creates an empty of strings with string keys and uses the method to add some elements. The example demonstrates that the method throws an when attempting to add a duplicate key, or when a key or value of the wrong data type is supplied. - - The code example demonstrates the use of several other members of the interface. - + property to add new elements by setting the value of a key that does not exist in the dictionary; for example, `myCollection["myNonexistentKey"] = myValue`. However, if the specified key already exists in the dictionary, setting the property overwrites the old value. In contrast, the method does not modify existing elements. + + This method is an O(log `n`) operation, where `n` is . + + + +## Examples + The following code example shows how to access the class through the interface. The code example creates an empty of strings with string keys and uses the method to add some elements. The example demonstrates that the method throws an when attempting to add a duplicate key, or when a key or value of the wrong data type is supplied. + + The code example demonstrates the use of several other members of the interface. + :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedDictionaryTKey,TValue/System.Collections.IDictionary.Add/source.cs" id="Snippet1"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.IDictionary/VB/source.vb" id="Snippet1"::: - + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.IDictionary/VB/source.vb" id="Snippet1"::: + ]]> is . - 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 value type of the . - - -or- - + 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 value type of the . + + -or- + An element with the same key already exists in the . @@ -1967,27 +1967,27 @@ finally if the contains an element with the key; otherwise, . - . - - This method is an O(log `n`) operation, where `n` is . - - - -## Examples - The following code example shows how to use the method of the interface with a . The example demonstrates that the method returns `false` if a key of the wrong data type is supplied. - - The code example is part of a larger example, including output, provided for the method. - + . + + This method is an O(log `n`) operation, where `n` is . + + + +## Examples + The following code example shows how to use the method of the interface with a . The example demonstrates that the method returns `false` if a key of the wrong data type is supplied. + + The code example is part of a larger example, including output, provided for the method. + :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedDictionaryTKey,TValue/System.Collections.IDictionary.Add/source.cs" id="Snippet31"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.IDictionary/VB/source.vb" id="Snippet31"::: + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.IDictionary/VB/source.vb" id="Snippet31"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedDictionaryTKey,TValue/System.Collections.IDictionary.Add/source.cs" id="Snippet6"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.IDictionary/VB/source.vb" id="Snippet6"::: +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.IDictionary/VB/source.vb" id="Snippet6"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedDictionaryTKey,TValue/System.Collections.IDictionary.Add/source.cs" id="Snippet32"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.IDictionary/VB/source.vb" id="Snippet32"::: - +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.IDictionary/VB/source.vb" id="Snippet32"::: + ]]> @@ -2037,43 +2037,43 @@ finally Returns an for the . An for the . - structure. - - The `foreach` statement of the C# language (`for each` in C++, `For Each` in Visual Basic) hides the complexity of enumerators. Therefore, using `foreach` is recommended, instead of directly manipulating the enumerator. - - Enumerators can be used to read the data in the collection, but they cannot be used to modify the underlying collection. - - Initially, the enumerator is positioned before the first element in the collection. The method also brings the enumerator back to this position. At this position, is undefined. Therefore, you must call the method to advance the enumerator to the first element of the collection before reading the value of . - - The property returns the same object until either or is called. sets to the next element. - - If passes the end of the collection, the enumerator is positioned after the last element in the collection and returns `false`. When the enumerator is at this position, subsequent calls to also return `false`. If the last call to returned `false`, is undefined. To set to the first element of the collection again, you can call followed by . - - An enumerator remains valid as long as the collection remains unchanged. If changes are made to the collection, such as adding, modifying, or deleting elements, the enumerator is irrecoverably invalidated and the next call to or throws an . - - The enumerator does not have exclusive access to the collection; therefore, enumerating through a collection is intrinsically not a thread-safe procedure. To guarantee thread safety during enumeration, you can lock the collection during the entire enumeration. To allow the collection to be accessed by multiple threads for reading and writing, you must implement your own synchronization. - - Default implementations of collections in the namespace are not synchronized. - + structure. + + The `foreach` statement of the C# language (`for each` in C++, `For Each` in Visual Basic) hides the complexity of enumerators. Therefore, using `foreach` is recommended, instead of directly manipulating the enumerator. + + Enumerators can be used to read the data in the collection, but they cannot be used to modify the underlying collection. + + Initially, the enumerator is positioned before the first element in the collection. The method also brings the enumerator back to this position. At this position, is undefined. Therefore, you must call the method to advance the enumerator to the first element of the collection before reading the value of . + + The property returns the same object until either or is called. sets to the next element. + + If passes the end of the collection, the enumerator is positioned after the last element in the collection and returns `false`. When the enumerator is at this position, subsequent calls to also return `false`. If the last call to returned `false`, is undefined. To set to the first element of the collection again, you can call followed by . + + An enumerator remains valid as long as the collection remains unchanged. If changes are made to the collection, such as adding, modifying, or deleting elements, the enumerator is irrecoverably invalidated and the next call to or throws an . + + The enumerator does not have exclusive access to the collection; therefore, enumerating through a collection is intrinsically not a thread-safe procedure. To guarantee thread safety during enumeration, you can lock the collection during the entire enumeration. To allow the collection to be accessed by multiple threads for reading and writing, you must implement your own synchronization. + + Default implementations of collections in the namespace are not synchronized. + This method is an O(log n) operation where n is a number of elements in a collection. - - - -## Examples - The following code example shows how to enumerate the key/value pairs in the dictionary by using the `foreach` statement (`For Each` in Visual Basic, `for each` in C++), which hides the use of the enumerator. In particular, note that the enumerator for the interface returns objects rather than objects. - - The code example is part of a larger example, including output, provided for the method. - + + + +## Examples + The following code example shows how to enumerate the key/value pairs in the dictionary by using the `foreach` statement (`For Each` in Visual Basic, `for each` in C++), which hides the use of the enumerator. In particular, note that the enumerator for the interface returns objects rather than objects. + + The code example is part of a larger example, including output, provided for the method. + :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedDictionaryTKey,TValue/System.Collections.IDictionary.Add/source.cs" id="Snippet31"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.IDictionary/VB/source.vb" id="Snippet31"::: + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.IDictionary/VB/source.vb" id="Snippet31"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedDictionaryTKey,TValue/System.Collections.IDictionary.Add/source.cs" id="Snippet7"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.IDictionary/VB/source.vb" id="Snippet7"::: +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.IDictionary/VB/source.vb" id="Snippet7"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedDictionaryTKey,TValue/System.Collections.IDictionary.Add/source.cs" id="Snippet32"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.IDictionary/VB/source.vb" id="Snippet32"::: - +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.IDictionary/VB/source.vb" id="Snippet32"::: + ]]> @@ -2123,15 +2123,15 @@ finally if the has a fixed size; otherwise, . In the default implementation of , this property always returns . - @@ -2179,15 +2179,15 @@ finally if the is read-only; otherwise, . In the default implementation of , this property always returns . - @@ -2245,44 +2245,44 @@ finally Gets or sets the element with the specified key. The element with the specified key, or if is not in the dictionary or is of a type that is not assignable to the key type of the . - property to add new elements by setting the value of a key that does not exist in the dictionary; for example, `myCollection["myNonexistentKey"] = myValue`. However, if the specified key already exists in the dictionary, setting the property overwrites the old value. In contrast, the method does not modify existing elements. - - The C# language uses the [this](/dotnet/csharp/language-reference/keywords/this) keyword to define the indexers instead of implementing the property. Visual Basic implements as a default property, which provides the same indexing functionality. - - Getting the value of this property is an O(log `n`) operation; setting the property is also an O(log `n`) operation. - - - -## Examples - The following code example shows how to use the property (the indexer in C#) of the interface with a , and ways the property differs from the property. - - The example shows that, like the property, the property can change the value associated with an existing key and can be used to add a new key/value pair if the specified key is not in the dictionary. The example also shows that unlike the property, the property does not throw an exception if `key` is not in the dictionary, returning a null reference instead. Finally, the example demonstrates that getting the property returns a null reference if `key` is not the correct data type, and that setting the property throws an exception if `key` is not the correct data type. - - The code example is part of a larger example, including output, provided for the method. - + property to add new elements by setting the value of a key that does not exist in the dictionary; for example, `myCollection["myNonexistentKey"] = myValue`. However, if the specified key already exists in the dictionary, setting the property overwrites the old value. In contrast, the method does not modify existing elements. + + The C# language uses the [this](/dotnet/csharp/language-reference/keywords/this) keyword to define the indexers instead of implementing the property. Visual Basic implements as a default property, which provides the same indexing functionality. + + Getting the value of this property is an O(log `n`) operation; setting the property is also an O(log `n`) operation. + + + +## Examples + The following code example shows how to use the property (the indexer in C#) of the interface with a , and ways the property differs from the property. + + The example shows that, like the property, the property can change the value associated with an existing key and can be used to add a new key/value pair if the specified key is not in the dictionary. The example also shows that unlike the property, the property does not throw an exception if `key` is not in the dictionary, returning a null reference instead. Finally, the example demonstrates that getting the property returns a null reference if `key` is not the correct data type, and that setting the property throws an exception if `key` is not the correct data type. + + The code example is part of a larger example, including output, provided for the method. + :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedDictionaryTKey,TValue/System.Collections.IDictionary.Add/source.cs" id="Snippet31"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.IDictionary/VB/source.vb" id="Snippet31"::: + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.IDictionary/VB/source.vb" id="Snippet31"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedDictionaryTKey,TValue/System.Collections.IDictionary.Add/source.cs" id="Snippet3"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.IDictionary/VB/source.vb" id="Snippet3"::: +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.IDictionary/VB/source.vb" id="Snippet3"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedDictionaryTKey,TValue/System.Collections.IDictionary.Add/source.cs" id="Snippet4"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.IDictionary/VB/source.vb" id="Snippet4"::: +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.IDictionary/VB/source.vb" id="Snippet4"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedDictionaryTKey,TValue/System.Collections.IDictionary.Add/source.cs" id="Snippet32"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.IDictionary/VB/source.vb" id="Snippet32"::: - +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.IDictionary/VB/source.vb" id="Snippet32"::: + ]]> is . - 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 . + 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 isn't assignable to the value type of the . @@ -2334,29 +2334,29 @@ finally Gets an containing the keys of the . An containing the keys of the . - are sorted according to the property and are guaranteed to be in the same order as the corresponding values in the returned by the property. - - Getting the value of this property is an O(1) operation. - - - -## Examples - The following code example shows how to use the property of the interface with a , to list the keys in the dictionary. The example also shows how to enumerate the key/value pairs in the dictionary; note that the enumerator for the interface returns objects rather than objects. - - The code example is part of a larger example, including output, provided for the method. - + are sorted according to the property and are guaranteed to be in the same order as the corresponding values in the returned by the property. + + Getting the value of this property is an O(1) operation. + + + +## Examples + The following code example shows how to use the property of the interface with a , to list the keys in the dictionary. The example also shows how to enumerate the key/value pairs in the dictionary; note that the enumerator for the interface returns objects rather than objects. + + The code example is part of a larger example, including output, provided for the method. + :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedDictionaryTKey,TValue/System.Collections.IDictionary.Add/source.cs" id="Snippet31"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.IDictionary/VB/source.vb" id="Snippet31"::: + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.IDictionary/VB/source.vb" id="Snippet31"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedDictionaryTKey,TValue/System.Collections.IDictionary.Add/source.cs" id="Snippet9"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.IDictionary/VB/source.vb" id="Snippet9"::: +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.IDictionary/VB/source.vb" id="Snippet9"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedDictionaryTKey,TValue/System.Collections.IDictionary.Add/source.cs" id="Snippet7"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.IDictionary/VB/source.vb" id="Snippet7"::: +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.IDictionary/VB/source.vb" id="Snippet7"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedDictionaryTKey,TValue/System.Collections.IDictionary.Add/source.cs" id="Snippet32"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.IDictionary/VB/source.vb" id="Snippet32"::: - +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.IDictionary/VB/source.vb" id="Snippet32"::: + ]]> @@ -2407,25 +2407,25 @@ finally The key of the element to remove. Removes the element with the specified key from the . - of the interface with a . - - The code example is part of a larger example, including output, provided for the method. - + of the interface with a . + + The code example is part of a larger example, including output, provided for the method. + :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedDictionaryTKey,TValue/System.Collections.IDictionary.Add/source.cs" id="Snippet31"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.IDictionary/VB/source.vb" id="Snippet31"::: + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.IDictionary/VB/source.vb" id="Snippet31"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedDictionaryTKey,TValue/System.Collections.IDictionary.Add/source.cs" id="Snippet10"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.IDictionary/VB/source.vb" id="Snippet10"::: +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.IDictionary/VB/source.vb" id="Snippet10"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedDictionaryTKey,TValue/System.Collections.IDictionary.Add/source.cs" id="Snippet32"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.IDictionary/VB/source.vb" id="Snippet32"::: - +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.IDictionary/VB/source.vb" id="Snippet32"::: + ]]> @@ -2480,29 +2480,29 @@ finally Gets an containing the values in the . An containing the values in the . - are sorted according to the property, and are guaranteed to be in the same order as the corresponding keys in the returned by the property. - - Getting the value of this property is an O(1) operation. - - - -## Examples - The following code example shows how to use the property of the interface with a , to list the values in the dictionary. The example also shows how to enumerate the key/value pairs in the dictionary; note that the enumerator for the interface returns objects rather than objects. - - The code example is part of a larger example, including output, provided for the method. - + are sorted according to the property, and are guaranteed to be in the same order as the corresponding keys in the returned by the property. + + Getting the value of this property is an O(1) operation. + + + +## Examples + The following code example shows how to use the property of the interface with a , to list the values in the dictionary. The example also shows how to enumerate the key/value pairs in the dictionary; note that the enumerator for the interface returns objects rather than objects. + + The code example is part of a larger example, including output, provided for the method. + :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedDictionaryTKey,TValue/System.Collections.IDictionary.Add/source.cs" id="Snippet31"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.IDictionary/VB/source.vb" id="Snippet31"::: + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.IDictionary/VB/source.vb" id="Snippet31"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedDictionaryTKey,TValue/System.Collections.IDictionary.Add/source.cs" id="Snippet8"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.IDictionary/VB/source.vb" id="Snippet8"::: +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.IDictionary/VB/source.vb" id="Snippet8"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedDictionaryTKey,TValue/System.Collections.IDictionary.Add/source.cs" id="Snippet7"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.IDictionary/VB/source.vb" id="Snippet7"::: +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.IDictionary/VB/source.vb" id="Snippet7"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedDictionaryTKey,TValue/System.Collections.IDictionary.Add/source.cs" id="Snippet32"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.IDictionary/VB/source.vb" id="Snippet32"::: - +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary.IDictionary/VB/source.vb" id="Snippet32"::: + ]]> @@ -2551,28 +2551,28 @@ finally Returns an enumerator that iterates through the collection. An that can be used to iterate through the collection. - property is undefined. Therefore, you must call the method to advance the enumerator to the first element of the collection before reading the value of . - - The property returns the same element until the method is called. sets to the next element. - - If passes the end of the collection, the enumerator is positioned after the last element in the collection and returns `false`. When the enumerator is at this position, subsequent calls to also return `false`. If the last call to returned `false`, is undefined. You cannot set to the first element of the collection again; you must create a new enumerator instance instead. - - An enumerator remains valid as long as the collection remains unchanged. If changes are made to the collection, such as adding, modifying, or deleting elements, the enumerator is irrecoverably invalidated and the next call to or throws an . - - The enumerator does not have exclusive access to the collection; therefore, enumerating through a collection is intrinsically not a thread-safe procedure. To guarantee thread safety during enumeration, you can lock the collection during the entire enumeration. To allow the collection to be accessed by multiple threads for reading and writing, you must implement your own synchronization. - - Default implementations of collections in the namespace are not synchronized. - + property is undefined. Therefore, you must call the method to advance the enumerator to the first element of the collection before reading the value of . + + The property returns the same element until the method is called. sets to the next element. + + If passes the end of the collection, the enumerator is positioned after the last element in the collection and returns `false`. When the enumerator is at this position, subsequent calls to also return `false`. If the last call to returned `false`, is undefined. You cannot set to the first element of the collection again; you must create a new enumerator instance instead. + + An enumerator remains valid as long as the collection remains unchanged. If changes are made to the collection, such as adding, modifying, or deleting elements, the enumerator is irrecoverably invalidated and the next call to or throws an . + + The enumerator does not have exclusive access to the collection; therefore, enumerating through a collection is intrinsically not a thread-safe procedure. To guarantee thread safety during enumeration, you can lock the collection during the entire enumeration. To allow the collection to be accessed by multiple threads for reading and writing, you must implement your own synchronization. + + Default implementations of collections in the namespace are not synchronized. + This method is an O(log n) operation where n is a number of elements in a collection. - + ]]> @@ -2636,27 +2636,27 @@ finally if the contains an element with the specified key; otherwise, . - method and the property. - - If the key is not found, then the `value` parameter gets the appropriate default value for the value type `TValue`; for example, 0 (zero) for integer types, `false` for Boolean types, and `null` for reference types. - - This method is an O(log `n`) operation. - - - -## Examples - The example shows how to use the method as a more efficient way to retrieve values in a program that frequently tries keys that are not in the dictionary. For contrast, the example also shows how the property (the indexer in C#) throws exceptions when attempting to retrieve nonexistent keys. - - This code example is part of a larger example provided for the class. - + method and the property. + + If the key is not found, then the `value` parameter gets the appropriate default value for the value type `TValue`; for example, 0 (zero) for integer types, `false` for Boolean types, and `null` for reference types. + + This method is an O(log `n`) operation. + + + +## Examples + The example shows how to use the method as a more efficient way to retrieve values in a program that frequently tries keys that are not in the dictionary. For contrast, the example also shows how the property (the indexer in C#) throws exceptions when attempting to retrieve nonexistent keys. + + This code example is part of a larger example provided for the class. + :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedDictionaryTKey,TValue/Overview/source.cs" id="Snippet5"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary/VB/source.vb" id="Snippet5"::: + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary/VB/source.vb" id="Snippet5"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedDictionaryTKey,TValue/Overview/source.cs" id="Snippet4"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary/VB/source.vb" id="Snippet4"::: - +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary/VB/source.vb" id="Snippet4"::: + ]]> @@ -2704,27 +2704,27 @@ finally Gets a collection containing the values in the . A containing the values in the . - are sorted according to the property, and are in the same order as the associated keys in the returned by the property. - - The returned is not a static copy; instead, the refers back to the values in the original . Therefore, changes to the continue to be reflected in the . - - Getting the value of this property is an O(1) operation. - - - -## Examples - This code example shows how to enumerate the values in the dictionary using the property, and how to enumerate the keys and values in the dictionary. - - This code example is part of a larger example provided for the class. - + are sorted according to the property, and are in the same order as the associated keys in the returned by the property. + + The returned is not a static copy; instead, the refers back to the values in the original . Therefore, changes to the continue to be reflected in the . + + Getting the value of this property is an O(1) operation. + + + +## Examples + This code example shows how to enumerate the values in the dictionary using the property, and how to enumerate the keys and values in the dictionary. + + This code example is part of a larger example provided for the class. + :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedDictionaryTKey,TValue/Overview/source.cs" id="Snippet8"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary/VB/source.vb" id="Snippet8"::: + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary/VB/source.vb" id="Snippet8"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedDictionaryTKey,TValue/Overview/source.cs" id="Snippet7"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary/VB/source.vb" id="Snippet7"::: - +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedDictionary/VB/source.vb" id="Snippet7"::: + ]]> diff --git a/xml/System.Collections.Generic/SortedList`2.xml b/xml/System.Collections.Generic/SortedList`2.xml index e0f9f3cc4f2..228317ac31d 100644 --- a/xml/System.Collections.Generic/SortedList`2.xml +++ b/xml/System.Collections.Generic/SortedList`2.xml @@ -112,65 +112,65 @@ The type of values in the collection. Represents a collection of key/value pairs that are sorted by key based on the associated implementation. - generic class is an array of key/value pairs with O(log `n`) retrieval, where n is the number of elements in the dictionary. In this, it is similar to the generic class. The two classes have similar object models, and both have O(log `n`) retrieval. Where the two classes differ is in memory use and speed of insertion and removal: - -- uses less memory than . - -- has faster insertion and removal operations for unsorted data, O(log `n`) as opposed to O(`n`) for . - -- If the list is populated all at once from sorted data, is faster than . - - Another difference between the and classes is that supports efficient indexed retrieval of keys and values through the collections returned by the and properties. It is not necessary to regenerate the lists when the properties are accessed, because the lists are just wrappers for the internal arrays of keys and values. The following code shows the use of the property for indexed retrieval of values from a sorted list of strings: - + generic class is an array of key/value pairs with O(log `n`) retrieval, where n is the number of elements in the dictionary. In this, it is similar to the generic class. The two classes have similar object models, and both have O(log `n`) retrieval. Where the two classes differ is in memory use and speed of insertion and removal: + +- uses less memory than . + +- has faster insertion and removal operations for unsorted data, O(log `n`) as opposed to O(`n`) for . + +- If the list is populated all at once from sorted data, is faster than . + + Another difference between the and classes is that supports efficient indexed retrieval of keys and values through the collections returned by the and properties. It is not necessary to regenerate the lists when the properties are accessed, because the lists are just wrappers for the internal arrays of keys and values. The following code shows the use of the property for indexed retrieval of values from a sorted list of strings: + :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR/Generic.SortedList/cpp/remarks.cpp" id="Snippet11"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/Overview/remarks.cs" id="Snippet11"::: :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList/VB/remarks.vb" id="Snippet11"::: - :::code language="fsharp" source="~/snippets/fsharp/System.Collections.Generic/SortedListTKey,TValue/Overview/remarks.fs" id="Snippet11"::: - - is implemented as an array of key/value pairs, sorted by the key. Each element can be retrieved as a object. - - Key objects must be immutable as long as they are used as keys in the . Every key in a must be unique. A key cannot be `null`, but a value can be, if the type of values in the list, `TValue`, is a reference type. - - requires a comparer implementation to sort and to perform comparisons. The default comparer checks whether the key type `TKey` implements and uses that implementation, if available. If not, checks whether the key type `TKey` implements . If the key type `TKey` does not implement either interface, you can specify a implementation in a constructor overload that accepts a `comparer` parameter. - - The capacity of a is the number of elements the can hold. As elements are added to a , the capacity is automatically increased as required by reallocating the internal array. The capacity can be decreased by calling or by setting the property explicitly. Decreasing the capacity reallocates memory and copies all the elements in the . - - **.NET Framework only:** For very large objects, you can increase the maximum capacity to 2 billion elements on a 64-bit system by setting the `enabled` attribute of the [``](/dotnet/framework/configure-apps/file-schema/runtime/gcallowverylargeobjects-element) configuration element to `true` in the run-time environment. - - The `foreach` statement of the C# language (`for each` in C++, `For Each` in Visual Basic) returns an object of the type of the elements in the collection. Since the elements of the are key/value pairs, the element type is not the type of the key or the type of the value. Instead, the element type is . For example: - + :::code language="fsharp" source="~/snippets/fsharp/System.Collections.Generic/SortedListTKey,TValue/Overview/remarks.fs" id="Snippet11"::: + + is implemented as an array of key/value pairs, sorted by the key. Each element can be retrieved as a object. + + Key objects must be immutable as long as they are used as keys in the . Every key in a must be unique. A key cannot be `null`, but a value can be, if the type of values in the list, `TValue`, is a reference type. + + requires a comparer implementation to sort and to perform comparisons. The default comparer checks whether the key type `TKey` implements and uses that implementation, if available. If not, checks whether the key type `TKey` implements . If the key type `TKey` does not implement either interface, you can specify a implementation in a constructor overload that accepts a `comparer` parameter. + + The capacity of a is the number of elements the can hold. As elements are added to a , the capacity is automatically increased as required by reallocating the internal array. The capacity can be decreased by calling or by setting the property explicitly. Decreasing the capacity reallocates memory and copies all the elements in the . + + **.NET Framework only:** For very large objects, you can increase the maximum capacity to 2 billion elements on a 64-bit system by setting the `enabled` attribute of the [``](/dotnet/framework/configure-apps/file-schema/runtime/gcallowverylargeobjects-element) configuration element to `true` in the run-time environment. + + The `foreach` statement of the C# language (`for each` in C++, `For Each` in Visual Basic) returns an object of the type of the elements in the collection. Since the elements of the are key/value pairs, the element type is not the type of the key or the type of the value. Instead, the element type is . For example: + :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR/Generic.SortedList/cpp/remarks.cpp" id="Snippet12"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/Overview/remarks.cs" id="Snippet12"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList/VB/remarks.vb" id="Snippet12"::: + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList/VB/remarks.vb" id="Snippet12"::: :::code language="fsharp" source="~/snippets/fsharp/System.Collections.Generic/SortedListTKey,TValue/Overview/remarks.fs" id="Snippet12"::: - - The `foreach` statement is a wrapper around the enumerator, which only allows reading from, not writing to, the collection. - - - -## Examples - The following code example creates an empty of strings with string keys and uses the method to add some elements. The example demonstrates that the method throws an when attempting to add a duplicate key. - - The example uses the property (the indexer in C#) to retrieve values, demonstrating that a is thrown when a requested key is not present, and showing that the value associated with a key can be replaced. - - The example shows how to use the method as a more efficient way to retrieve values if a program often must try key values that are not in the sorted list, and it shows how to use the method to test whether a key exists before calling the method. - - The example shows how to enumerate the keys and values in the sorted list and how to enumerate the keys and values alone using the property and the property. - - Finally, the example demonstrates the method. - + + The `foreach` statement is a wrapper around the enumerator, which only allows reading from, not writing to, the collection. + + + +## Examples + The following code example creates an empty of strings with string keys and uses the method to add some elements. The example demonstrates that the method throws an when attempting to add a duplicate key. + + The example uses the property (the indexer in C#) to retrieve values, demonstrating that a is thrown when a requested key is not present, and showing that the value associated with a key can be replaced. + + The example shows how to use the method as a more efficient way to retrieve values if a program often must try key values that are not in the sorted list, and it shows how to use the method to test whether a key exists before calling the method. + + The example shows how to enumerate the keys and values in the sorted list and how to enumerate the keys and values alone using the property and the property. + + Finally, the example demonstrates the method. + :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR/Generic.SortedList/cpp/source.cpp" id="Snippet1"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/Overview/source.cs" id="Snippet1"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList/VB/source.vb" id="Snippet1"::: + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList/VB/source.vb" id="Snippet1"::: :::code language="fsharp" source="~/snippets/fsharp/System.Collections.Generic/SortedListTKey,TValue/Overview/source.fs" id="Snippet1"::: - + ]]> - Public static ( in Visual Basic) members of this type are thread safe. Any instance members are not guaranteed to be thread safe. - + Public static ( in Visual Basic) members of this type are thread safe. Any instance members are not guaranteed to be thread safe. + A can support multiple readers concurrently, as long as the collection is not modified. Even so, enumerating through a collection is intrinsically not a thread-safe procedure. To guarantee thread safety during enumeration, you can lock the collection during the entire enumeration. To allow the collection to be accessed by multiple threads for reading and writing, you must implement your own synchronization. @@ -223,29 +223,29 @@ Initializes a new instance of the class that is empty, has the default initial capacity, and uses the default . - must be unique according to the default comparer. - - This constructor uses the default value for the initial capacity of the . To set the initial capacity, use the constructor. If the final size of the collection can be estimated, specifying the initial capacity eliminates the need to perform a number of resizing operations while adding elements to the . - - This constructor uses the default comparer for `TKey`. To specify a comparer, use the constructor. The default comparer checks whether the key type `TKey` implements and uses that implementation, if available. If not, checks whether the key type `TKey` implements . If the key type `TKey` does not implement either interface, you can specify a implementation in a constructor overload that accepts a `comparer` parameter. - - This constructor is an O(1) operation. - - - -## Examples - The following code example creates an empty of strings with string keys and uses the method to add some elements. The example demonstrates that the method throws an when attempting to add a duplicate key. - - This code example is part of a larger example provided for the class. - + must be unique according to the default comparer. + + This constructor uses the default value for the initial capacity of the . To set the initial capacity, use the constructor. If the final size of the collection can be estimated, specifying the initial capacity eliminates the need to perform a number of resizing operations while adding elements to the . + + This constructor uses the default comparer for `TKey`. To specify a comparer, use the constructor. The default comparer checks whether the key type `TKey` implements and uses that implementation, if available. If not, checks whether the key type `TKey` implements . If the key type `TKey` does not implement either interface, you can specify a implementation in a constructor overload that accepts a `comparer` parameter. + + This constructor is an O(1) operation. + + + +## Examples + The following code example creates an empty of strings with string keys and uses the method to add some elements. The example demonstrates that the method throws an when attempting to add a duplicate key. + + This code example is part of a larger example provided for the class. + :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR/Generic.SortedList/cpp/source.cpp" id="Snippet2"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/Overview/source.cs" interactive="try-dotnet-method" id="Snippet2"::: :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList/VB/source.vb" id="Snippet2"::: :::code language="fsharp" source="~/snippets/fsharp/System.Collections.Generic/SortedListTKey,TValue/Overview/source.fs" id="Snippet2"::: - + ]]> @@ -296,30 +296,30 @@ - The implementation to use when comparing keys. - - -or- - + The implementation to use when comparing keys. + + -or- + to use the default for the type of the key. Initializes a new instance of the class that is empty, has the default initial capacity, and uses the specified . - must be unique according to the specified comparer. - - This constructor uses the default value for the initial capacity of the . To set the initial capacity, use the constructor. If the final size of the collection can be estimated, specifying the initial capacity eliminates the need to perform a number of resizing operations while adding elements to the . - - This constructor is an O(1) operation. - - - -## Examples - The following code example creates a sorted list with a case-insensitive comparer for the current culture. The example adds four elements, some with lower-case keys and some with upper-case keys. The example then attempts to add an element with a key that differs from an existing key only by case, catches the resulting exception, and displays an error message. Finally, the example displays the elements in case-insensitive sort order. - + must be unique according to the specified comparer. + + This constructor uses the default value for the initial capacity of the . To set the initial capacity, use the constructor. If the final size of the collection can be estimated, specifying the initial capacity eliminates the need to perform a number of resizing operations while adding elements to the . + + This constructor is an O(1) operation. + + + +## Examples + The following code example creates a sorted list with a case-insensitive comparer for the current culture. The example adds four elements, some with lower-case keys and some with upper-case keys. The example then attempts to add an element with a key that differs from an existing key only by case, catches the resulting exception, and displays an error message. Finally, the example displays the elements in case-insensitive sort order. + :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/.ctor/source.cs" interactive="try-dotnet" id="Snippet1"::: :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.ctor_IComp/VB/source.vb" id="Snippet1"::: - + ]]> @@ -372,22 +372,22 @@ The whose elements are copied to the new . Initializes a new instance of the class that contains elements copied from the specified , has sufficient capacity to accommodate the number of elements copied, and uses the default . - must be unique according to the default comparer; likewise, every key in the source `dictionary` must also be unique according to the default comparer. - - The capacity of the new is set to the number of elements in `dictionary`, so no resizing takes place while the list is being populated. - - This constructor uses the default comparer for `TKey`. To specify a comparer, use the constructor. The default comparer checks whether the key type `TKey` implements and uses that implementation, if available. If not, checks whether the key type `TKey` implements . If the key type `TKey` does not implement either interface, you can specify a implementation in a constructor overload that accepts a `comparer` parameter. - - The keys in `dictionary` are copied to the new and sorted once, which makes this constructor an O(`n` log `n`) operation. - - - -## Examples - The following code example shows how to use to create a sorted copy of the information in a , by passing the to the constructor. - + must be unique according to the default comparer; likewise, every key in the source `dictionary` must also be unique according to the default comparer. + + The capacity of the new is set to the number of elements in `dictionary`, so no resizing takes place while the list is being populated. + + This constructor uses the default comparer for `TKey`. To specify a comparer, use the constructor. The default comparer checks whether the key type `TKey` implements and uses that implementation, if available. If not, checks whether the key type `TKey` implements . If the key type `TKey` does not implement either interface, you can specify a implementation in a constructor overload that accepts a `comparer` parameter. + + The keys in `dictionary` are copied to the new and sorted once, which makes this constructor an O(`n` log `n`) operation. + + + +## Examples + The following code example shows how to use to create a sorted copy of the information in a , by passing the to the constructor. + :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/.ctor/source1.cs" interactive="try-dotnet" id="Snippet1"::: :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.ctor_IDic/VB/source.vb" id="Snippet1"::: @@ -441,29 +441,29 @@ The initial number of elements that the can contain. Initializes a new instance of the class that is empty, has the specified initial capacity, and uses the default . - must be unique according to the default comparer. - - The capacity of a is the number of elements that the can hold before resizing. As elements are added to a , the capacity is automatically increased as required by reallocating the internal array. - - If the size of the collection can be estimated, specifying the initial capacity eliminates the need to perform a number of resizing operations while adding elements to the . - - The capacity can be decreased by calling or by setting the property explicitly. Decreasing the capacity reallocates memory and copies all the elements in the . - - This constructor uses the default comparer for `TKey`. To specify a comparer, use the constructor. The default comparer checks whether the key type `TKey` implements and uses that implementation, if available. If not, checks whether the key type `TKey` implements . If the key type `TKey` does not implement either interface, you can specify a implementation in a constructor overload that accepts a `comparer` parameter. - - This constructor is an O(`n`) operation, where `n` is `capacity`. - - - -## Examples - The following code example creates a sorted list with an initial capacity of 4 and populates it with 4 entries. - + must be unique according to the default comparer. + + The capacity of a is the number of elements that the can hold before resizing. As elements are added to a , the capacity is automatically increased as required by reallocating the internal array. + + If the size of the collection can be estimated, specifying the initial capacity eliminates the need to perform a number of resizing operations while adding elements to the . + + The capacity can be decreased by calling or by setting the property explicitly. Decreasing the capacity reallocates memory and copies all the elements in the . + + This constructor uses the default comparer for `TKey`. To specify a comparer, use the constructor. The default comparer checks whether the key type `TKey` implements and uses that implementation, if available. If not, checks whether the key type `TKey` implements . If the key type `TKey` does not implement either interface, you can specify a implementation in a constructor overload that accepts a `comparer` parameter. + + This constructor is an O(`n`) operation, where `n` is `capacity`. + + + +## Examples + The following code example creates a sorted list with an initial capacity of 4 and populates it with 4 entries. + :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/.ctor/source3.cs" interactive="try-dotnet" id="Snippet1"::: :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.ctor_Int32/VB/source.vb" id="Snippet1"::: - + ]]> @@ -519,30 +519,30 @@ The whose elements are copied to the new . - The implementation to use when comparing keys. - - -or- - + The implementation to use when comparing keys. + + -or- + to use the default for the type of the key. Initializes a new instance of the class that contains elements copied from the specified , has sufficient capacity to accommodate the number of elements copied, and uses the specified . - must be unique according to the specified comparer; likewise, every key in the source `dictionary` must also be unique according to the specified comparer. - - The capacity of the new is set to the number of elements in `dictionary`, so no resizing takes place while the list is being populated. - - The keys in `dictionary` are copied to the new and sorted once, which makes this constructor an O(`n` log `n`) operation. - - - -## Examples - The following code example shows how to use to create a case-insensitive sorted copy of the information in a case-insensitive , by passing the to the constructor. In this example, the case-insensitive comparers are for the current culture. - + must be unique according to the specified comparer; likewise, every key in the source `dictionary` must also be unique according to the specified comparer. + + The capacity of the new is set to the number of elements in `dictionary`, so no resizing takes place while the list is being populated. + + The keys in `dictionary` are copied to the new and sorted once, which makes this constructor an O(`n` log `n`) operation. + + + +## Examples + The following code example shows how to use to create a case-insensitive sorted copy of the information in a case-insensitive , by passing the to the constructor. In this example, the case-insensitive comparers are for the current culture. + :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/.ctor/source2.cs" interactive="try-dotnet" id="Snippet1"::: :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.ctor_IDicIComp/VB/source.vb" id="Snippet1"::: - + ]]> @@ -601,34 +601,34 @@ The initial number of elements that the can contain. - The implementation to use when comparing keys. - - -or- - + The implementation to use when comparing keys. + + -or- + to use the default for the type of the key. Initializes a new instance of the class that is empty, has the specified initial capacity, and uses the specified . - must be unique according to the specified comparer. - - The capacity of a is the number of elements that the can hold before resizing. As elements are added to a , the capacity is automatically increased as required by reallocating the internal array. - - If the size of the collection can be estimated, specifying the initial capacity eliminates the need to perform a number of resizing operations while adding elements to the . - - The capacity can be decreased by calling or by setting the property explicitly. Decreasing the capacity reallocates memory and copies all the elements in the . - - This constructor is an O(`n`) operation, where `n` is `capacity`. - - - -## Examples - The following code example creates a sorted list with an initial capacity of 5 and a case-insensitive comparer for the current culture. The example adds four elements, some with lower-case keys and some with upper-case keys. The example then attempts to add an element with a key that differs from an existing key only by case, catches the resulting exception, and displays an error message. Finally, the example displays the elements in case-insensitive sort order. + must be unique according to the specified comparer. + + The capacity of a is the number of elements that the can hold before resizing. As elements are added to a , the capacity is automatically increased as required by reallocating the internal array. + + If the size of the collection can be estimated, specifying the initial capacity eliminates the need to perform a number of resizing operations while adding elements to the . + + The capacity can be decreased by calling or by setting the property explicitly. Decreasing the capacity reallocates memory and copies all the elements in the . + + This constructor is an O(`n`) operation, where `n` is `capacity`. + + + +## Examples + The following code example creates a sorted list with an initial capacity of 5 and a case-insensitive comparer for the current culture. The example adds four elements, some with lower-case keys and some with upper-case keys. The example then attempts to add an element with a key that differs from an existing key only by case, catches the resulting exception, and displays an error message. Finally, the example displays the elements in case-insensitive sort order. :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/.ctor/source4.cs" interactive="try-dotnet" id="Snippet1"::: :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.ctor_Int32IComp/VB/source.vb" id="Snippet1"::: - + ]]> @@ -686,24 +686,24 @@ The value of the element to add. The value can be for reference types. Adds an element with the specified key and value into the . - property to add new elements by setting the value of a key that does not exist in the ; for example, `myCollection["myNonexistentKey"] = myValue`. However, if the specified key already exists in the , setting the property overwrites the old value. In contrast, the method does not modify existing elements. - - If already equals , the capacity of the is increased by automatically reallocating the internal array, and the existing elements are copied to the new array before the new element is added. - - This method is an O(`n`) operation for unsorted data, where `n` is . It is an O(log `n`) operation if the new element is added at the end of the list. If insertion causes a resize, the operation is O(`n`). - - - -## Examples - The following code example creates an empty of strings with string keys and uses the method to add some elements. The example demonstrates that the method throws an when attempting to add a duplicate key. - - This code example is part of a larger example provided for the class. - + property to add new elements by setting the value of a key that does not exist in the ; for example, `myCollection["myNonexistentKey"] = myValue`. However, if the specified key already exists in the , setting the property overwrites the old value. In contrast, the method does not modify existing elements. + + If already equals , the capacity of the is increased by automatically reallocating the internal array, and the existing elements are copied to the new array before the new element is added. + + This method is an O(`n`) operation for unsorted data, where `n` is . It is an O(log `n`) operation if the new element is added at the end of the list. If insertion causes a resize, the operation is O(`n`). + + + +## Examples + The following code example creates an empty of strings with string keys and uses the method to add some elements. The example demonstrates that the method throws an when attempting to add a duplicate key. + + This code example is part of a larger example provided for the class. + :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR/Generic.SortedList/cpp/source.cpp" id="Snippet2"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/Overview/source.cs" interactive="try-dotnet-method" id="Snippet2"::: :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList/VB/source.vb" id="Snippet2"::: @@ -757,17 +757,17 @@ Gets or sets the number of elements that the can contain. The number of elements that the can contain. - is the number of elements that the can store. is the number of elements that are actually in the . - - is always greater than or equal to . If exceeds while adding elements, the capacity is increased by automatically reallocating the internal array before copying the old elements and adding the new elements. - - The capacity can be decreased by calling or by setting the property explicitly. When the value of is set explicitly, the internal array is also reallocated to accommodate the specified capacity. - - Retrieving the value of this property is an O(1) operation; setting the property is an O(`n`) operation, where `n` is the new capacity. - + is the number of elements that the can store. is the number of elements that are actually in the . + + is always greater than or equal to . If exceeds while adding elements, the capacity is increased by automatically reallocating the internal array before copying the old elements and adding the new elements. + + The capacity can be decreased by calling or by setting the property explicitly. When the value of is set explicitly, the internal array is also reallocated to accommodate the specified capacity. + + Retrieving the value of this property is an O(1) operation; setting the property is an O(`n`) operation, where `n` is the new capacity. + ]]> @@ -819,15 +819,15 @@ Removes all elements from the . - is set to zero, and references to other objects from elements of the collection are also released. - - remains unchanged. To reset the capacity of the , call or set the property directly. Trimming an empty sets the capacity of the to the default capacity. - - This method is an O(`n`) operation, where `n` is . - + is set to zero, and references to other objects from elements of the collection are also released. + + remains unchanged. To reset the capacity of the , call or set the property directly. Trimming an empty sets the capacity of the to the default capacity. + + This method is an O(`n`) operation, where `n` is . + ]]> @@ -879,11 +879,11 @@ Gets the for the sorted list. The for the current . - @@ -935,31 +935,31 @@ if the contains an element with the specified key; otherwise, . - . - - - -## Examples - The following code example shows how to use the method to test whether a key exists prior to calling the method. It also shows how to use the method to retrieve values, which is an efficient way to retrieve values when a program frequently tries keys that are not in the sorted list. Finally, it shows the least efficient way to test whether keys exist, by using the property (the indexer in C#). - - This code example is part of a larger example provided for the class. - + . + + + +## Examples + The following code example shows how to use the method to test whether a key exists prior to calling the method. It also shows how to use the method to retrieve values, which is an efficient way to retrieve values when a program frequently tries keys that are not in the sorted list. Finally, it shows the least efficient way to test whether keys exist, by using the property (the indexer in C#). + + This code example is part of a larger example provided for the class. + :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR/Generic.SortedList/cpp/source.cpp" id="Snippet6"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/Overview/source.cs" id="Snippet6"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList/VB/source.vb" id="Snippet6"::: - :::code language="fsharp" source="~/snippets/fsharp/System.Collections.Generic/SortedListTKey,TValue/Overview/source.fs" id="Snippet6"::: + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList/VB/source.vb" id="Snippet6"::: + :::code language="fsharp" source="~/snippets/fsharp/System.Collections.Generic/SortedListTKey,TValue/Overview/source.fs" id="Snippet6"::: :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR/Generic.SortedList/cpp/source.cpp" id="Snippet5"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/Overview/source.cs" id="Snippet5"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList/VB/source.vb" id="Snippet5"::: -:::code language="fsharp" source="~/snippets/fsharp/System.Collections.Generic/SortedListTKey,TValue/Overview/source.fs" id="Snippet5"::: +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList/VB/source.vb" id="Snippet5"::: +:::code language="fsharp" source="~/snippets/fsharp/System.Collections.Generic/SortedListTKey,TValue/Overview/source.fs" id="Snippet5"::: :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR/Generic.SortedList/cpp/source.cpp" id="Snippet4"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/Overview/source.cs" id="Snippet4"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList/VB/source.vb" id="Snippet4"::: +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList/VB/source.vb" id="Snippet4"::: :::code language="fsharp" source="~/snippets/fsharp/System.Collections.Generic/SortedListTKey,TValue/Overview/source.fs" id="Snippet4"::: - + ]]> @@ -1011,13 +1011,13 @@ if the contains an element with the specified value; otherwise, . - for the value type `TValue`. checks whether the value type `TValue` implements and uses that implementation, if available. If not, checks whether the value type `TValue` implements . If the value type `TValue` does not implement either interface, this method uses . - - This method performs a linear search; therefore, the average execution time is proportional to . That is, this method is an O(`n`) operation, where `n` is . - + for the value type `TValue`. checks whether the value type `TValue` implements and uses that implementation, if available. If not, checks whether the value type `TValue` implements . If the value type `TValue` does not implement either interface, this method uses . + + This method performs a linear search; therefore, the average execution time is proportional to . That is, this method is an O(`n`) operation, where `n` is . + ]]> @@ -1073,15 +1073,15 @@ Gets the number of key/value pairs contained in the . The number of key/value pairs contained in the . - is the number of elements that the can store. is the number of elements that are actually in the . - - is always greater than or equal to . If exceeds while adding elements, the capacity is increased by automatically reallocating the internal array before copying the old elements and adding the new elements. - - Retrieving the value of this property is an O(1) operation. - + is the number of elements that the can store. is the number of elements that are actually in the . + + is always greater than or equal to . If exceeds while adding elements, the capacity is increased by automatically reallocating the internal array before copying the old elements and adding the new elements. + + Retrieving the value of this property is an O(1) operation. + ]]> @@ -1129,29 +1129,29 @@ Returns an enumerator that iterates through the . An of type for the . - is undefined. Therefore, you must call to advance the enumerator to the first element of the collection before reading the value of . - - returns the same object until is called. sets to the next element. - - If passes the end of the collection, the enumerator is positioned after the last element in the collection and returns `false`. When the enumerator is at this position, subsequent calls to return `false`. If the last call to returned `false`, is undefined. You cannot set to the first element of the collection again; you must create a new enumerator instance instead. - - An enumerator remains valid as long as the collection remains unchanged. If changes are made to the collection, such as adding, modifying, or deleting elements, the enumerator is irrecoverably invalidated and the next call to or throws an . - - The enumerator does not have exclusive access to the collection; therefore, enumerating through a collection is intrinsically not a thread-safe procedure. To guarantee thread safety during enumeration, you can lock the collection during the entire enumeration. To allow the collection to be accessed by multiple threads for reading and writing, you must implement your own synchronization. - - Default implementations of collections in are not synchronized. - - This method is an O(1) operation. - + is undefined. Therefore, you must call to advance the enumerator to the first element of the collection before reading the value of . + + returns the same object until is called. sets to the next element. + + If passes the end of the collection, the enumerator is positioned after the last element in the collection and returns `false`. When the enumerator is at this position, subsequent calls to return `false`. If the last call to returned `false`, is undefined. You cannot set to the first element of the collection again; you must create a new enumerator instance instead. + + An enumerator remains valid as long as the collection remains unchanged. If changes are made to the collection, such as adding, modifying, or deleting elements, the enumerator is irrecoverably invalidated and the next call to or throws an . + + The enumerator does not have exclusive access to the collection; therefore, enumerating through a collection is intrinsically not a thread-safe procedure. To guarantee thread safety during enumeration, you can lock the collection during the entire enumeration. To allow the collection to be accessed by multiple threads for reading and writing, you must implement your own synchronization. + + Default implementations of collections in are not synchronized. + + This method is an O(1) operation. + ]]> @@ -1261,11 +1261,11 @@ Searches for the specified key and returns the zero-based index within the entire . The zero-based index of within the entire , if found; otherwise, -1. - . - + . + ]]> @@ -1316,13 +1316,13 @@ Searches for the specified value and returns the zero-based index of the first occurrence within the entire . The zero-based index of the first occurrence of within the entire , if found; otherwise, -1. - for the value type `TValue`. checks whether the value type `TValue` implements and uses that implementation, if available. If not, checks whether the value type `TValue` implements . If the value type `TValue` does not implement either interface, this method uses . - - This method performs a linear search; therefore, the average execution time is proportional to . That is, this method is an O(`n`) operation, where `n` is . - + for the value type `TValue`. checks whether the value type `TValue` implements and uses that implementation, if available. If not, checks whether the value type `TValue` implements . If the value type `TValue` does not implement either interface, this method uses . + + This method performs a linear search; therefore, the average execution time is proportional to . That is, this method is an O(`n`) operation, where `n` is . + ]]> @@ -1374,43 +1374,43 @@ Gets or sets the value associated with the specified key. 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 using the specified key. - is thrown. If the key is not found when a value is being set, the key and value are added. - - You can also use the property to add new elements by setting the value of a key that does not exist in the ; for example, `myCollection["myNonexistentKey"] = myValue`. However, if the specified key already exists in the , setting the property overwrites the old value. In contrast, the method does not modify existing elements. - - The C# language uses the [`this`](/dotnet/csharp/language-reference/keywords/this) keyword to define the indexers instead of implementing the property. Visual Basic implements as a default property, which provides the same indexing functionality. - - Retrieving the value of this property is an O(log `n`) operation, where n is . Setting the property is an O(log `n`) operation if the key is already in the . If the key is not in the list, setting the property is an O(`n`) operation for unsorted data, or O(log `n`) if the new element is added at the end of the list. If insertion causes a resize, the operation is O(`n`). - - - -## Examples - The following code example uses the property (the indexer in C#) to retrieve values, demonstrating that a is thrown when a requested key is not present, and showing that the value associated with a key can be replaced. - - The example also shows how to use the method as a more efficient way to retrieve values if a program often must try key values that are not in the sorted list. - - This code example is part of a larger example provided for the class. - + is thrown. If the key is not found when a value is being set, the key and value are added. + + You can also use the property to add new elements by setting the value of a key that does not exist in the ; for example, `myCollection["myNonexistentKey"] = myValue`. However, if the specified key already exists in the , setting the property overwrites the old value. In contrast, the method does not modify existing elements. + + The C# language uses the [`this`](/dotnet/csharp/language-reference/keywords/this) keyword to define the indexers instead of implementing the property. Visual Basic implements as a default property, which provides the same indexing functionality. + + Retrieving the value of this property is an O(log `n`) operation, where n is . Setting the property is an O(log `n`) operation if the key is already in the . If the key is not in the list, setting the property is an O(`n`) operation for unsorted data, or O(log `n`) if the new element is added at the end of the list. If insertion causes a resize, the operation is O(`n`). + + + +## Examples + The following code example uses the property (the indexer in C#) to retrieve values, demonstrating that a is thrown when a requested key is not present, and showing that the value associated with a key can be replaced. + + The example also shows how to use the method as a more efficient way to retrieve values if a program often must try key values that are not in the sorted list. + + This code example is part of a larger example provided for the class. + :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR/Generic.SortedList/cpp/source.cpp" id="Snippet3"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/Overview/source.cs" id="Snippet3"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList/VB/source.vb" id="Snippet3"::: - :::code language="fsharp" source="~/snippets/fsharp/System.Collections.Generic/SortedListTKey,TValue/Overview/source.fs" id="Snippet3"::: + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList/VB/source.vb" id="Snippet3"::: + :::code language="fsharp" source="~/snippets/fsharp/System.Collections.Generic/SortedListTKey,TValue/Overview/source.fs" id="Snippet3"::: :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR/Generic.SortedList/cpp/source.cpp" id="Snippet4"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/Overview/source.cs" id="Snippet4"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList/VB/source.vb" id="Snippet4"::: -:::code language="fsharp" source="~/snippets/fsharp/System.Collections.Generic/SortedListTKey,TValue/Overview/source.fs" id="Snippet4"::: +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList/VB/source.vb" id="Snippet4"::: +:::code language="fsharp" source="~/snippets/fsharp/System.Collections.Generic/SortedListTKey,TValue/Overview/source.fs" id="Snippet4"::: :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR/Generic.SortedList/cpp/source.cpp" id="Snippet5"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/Overview/source.cs" id="Snippet5"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList/VB/source.vb" id="Snippet5"::: +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList/VB/source.vb" id="Snippet5"::: :::code language="fsharp" source="~/snippets/fsharp/System.Collections.Generic/SortedListTKey,TValue/Overview/source.fs" id="Snippet5"::: - + ]]> @@ -1463,40 +1463,40 @@ Gets a collection containing the keys in the , in sorted order. A containing the keys in the . - is the same as the order in the . - - The returned is not a static copy; instead, the refers back to the keys in the original . Therefore, changes to the continue to be reflected in the . - - The collection returned by the property provides an efficient way to retrieve keys by index. It is not necessary to regenerate the list when the property is accessed, because the list is just a wrapper for the internal array of keys. The following code shows the use of the property for indexed retrieval of keys from a sorted list of elements with string keys: - + is the same as the order in the . + + The returned is not a static copy; instead, the refers back to the keys in the original . Therefore, changes to the continue to be reflected in the . + + The collection returned by the property provides an efficient way to retrieve keys by index. It is not necessary to regenerate the list when the property is accessed, because the list is just a wrapper for the internal array of keys. The following code shows the use of the property for indexed retrieval of keys from a sorted list of elements with string keys: + :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR/Generic.SortedList/cpp/remarks.cpp" id="Snippet11"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/Overview/remarks.cs" id="Snippet11"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList/VB/remarks.vb" id="Snippet11"::: + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList/VB/remarks.vb" id="Snippet11"::: :::code language="fsharp" source="~/snippets/fsharp/System.Collections.Generic/SortedListTKey,TValue/Overview/remarks.fs" id="Snippet11"::: - - Retrieving the value of this property is an O(1) operation. - - - -## Examples - The following code example shows how to enumerate the keys in the sorted list using the property, and how to enumerate the keys and values in the sorted list. - - The example also shows how to use the property for efficient indexed retrieval of keys. - - This code is part of a larger example that can be compiled and executed. See . - + + Retrieving the value of this property is an O(1) operation. + + + +## Examples + The following code example shows how to enumerate the keys in the sorted list using the property, and how to enumerate the keys and values in the sorted list. + + The example also shows how to use the property for efficient indexed retrieval of keys. + + This code is part of a larger example that can be compiled and executed. See . + :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR/Generic.SortedList/cpp/source.cpp" id="Snippet9"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/Overview/source.cs" id="Snippet9"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList/VB/source.vb" id="Snippet9"::: - :::code language="fsharp" source="~/snippets/fsharp/System.Collections.Generic/SortedListTKey,TValue/Overview/source.fs" id="Snippet9"::: + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList/VB/source.vb" id="Snippet9"::: + :::code language="fsharp" source="~/snippets/fsharp/System.Collections.Generic/SortedListTKey,TValue/Overview/source.fs" id="Snippet9"::: :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR/Generic.SortedList/cpp/source.cpp" id="Snippet7"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/Overview/source.cs" id="Snippet7"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList/VB/source.vb" id="Snippet7"::: +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList/VB/source.vb" id="Snippet7"::: :::code language="fsharp" source="~/snippets/fsharp/System.Collections.Generic/SortedListTKey,TValue/Overview/source.fs" id="Snippet7"::: - + ]]> @@ -1549,23 +1549,23 @@ if the element is successfully removed; otherwise, . This method also returns if was not found in the original . - . - - - -## Examples - The following code example shows how to remove a key/value pair from the sorted list using the method. - - This code example is part of a larger example provided for the class. - + . + + + +## Examples + The following code example shows how to remove a key/value pair from the sorted list using the method. + + This code example is part of a larger example provided for the class. + :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR/Generic.SortedList/cpp/source.cpp" id="Snippet10"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/Overview/source.cs" id="Snippet10"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList/VB/source.vb" id="Snippet10"::: + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList/VB/source.vb" id="Snippet10"::: :::code language="fsharp" source="~/snippets/fsharp/System.Collections.Generic/SortedListTKey,TValue/Overview/source.fs" id="Snippet10"::: - + ]]> @@ -1616,18 +1616,18 @@ The zero-based index of the element to remove. Removes the element at the specified index of the . - . - + . + ]]> - is less than zero. - - -or- - + is less than zero. + + -or- + is equal to or greater than . @@ -2184,15 +2184,15 @@ The zero-based index in at which copying begins. Copies the elements of the to an , starting at a particular index. - [!NOTE] -> If the type of the source cannot be cast automatically to the type of the destination `array`, the non-generic implementations of throw , whereas the generic implementations throw . - - This method is an O(`n`) operation, where `n` is . - +> If the type of the source cannot be cast automatically to the type of the destination `array`, the non-generic implementations of throw , whereas the generic implementations throw . + + This method is an O(`n`) operation, where `n` is . + ]]> @@ -2200,18 +2200,18 @@ is less than zero. - is multidimensional. - - -or- - - does not have zero-based indexing. - - -or- - - The number of elements in the source is greater than the available space from to the end of the destination . - - -or- - + is multidimensional. + + -or- + + does not have zero-based indexing. + + -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 . @@ -2258,17 +2258,17 @@ if access to the is synchronized (thread safe); otherwise, . In the default implementation of , this property always returns . - are not synchronized. - - Enumerating through a collection is intrinsically not a thread-safe procedure. To guarantee thread safety during enumeration, you can lock the collection during the entire enumeration. To allow the collection to be accessed by multiple threads for reading and writing, you must implement your own synchronization. - - The property returns an object that can be used to synchronize access to the . Synchronization is effective only if all threads lock this object before accessing the collection. - - Retrieving the value of this property is an O(1) operation. - + are not synchronized. + + Enumerating through a collection is intrinsically not a thread-safe procedure. To guarantee thread safety during enumeration, you can lock the collection during the entire enumeration. To allow the collection to be accessed by multiple threads for reading and writing, you must implement your own synchronization. + + The property returns an object that can be used to synchronize access to the . Synchronization is effective only if all threads lock this object before accessing the collection. + + Retrieving the value of this property is an O(1) operation. + ]]> @@ -2315,42 +2315,42 @@ Gets an object that can be used to synchronize access to the . An object that can be used to synchronize access to the . In the default implementation of , this property always returns the current instance. - are not synchronized. - - Enumerating through a collection is intrinsically not a thread-safe procedure. To guarantee thread safety during enumeration, you can lock the collection during the entire enumeration. To allow the collection to be accessed by multiple threads for reading and writing, you must implement your own synchronization. - - The property returns an object that can be used to synchronize access to the . Synchronization is effective only if all threads lock this object before accessing the collection. The following code shows the use of the property for C#, C++, and Visual Basic. - -```csharp -ICollection ic = ...; -lock (ic.SyncRoot) { - // Access the collection. -} -``` - -```vb -Dim ic As ICollection = ... -SyncLock ic.SyncRoot - ' Access the collection. -End SyncLock -``` - -```cpp -ICollection^ ic = ...; -try { - Monitor::Enter(ic->SyncRoot); - // Access the collection. -} -finally { - Monitor::Exit(ic->SyncRoot); -} -``` - - Retrieving the value of this property is an O(1) operation. - + are not synchronized. + + Enumerating through a collection is intrinsically not a thread-safe procedure. To guarantee thread safety during enumeration, you can lock the collection during the entire enumeration. To allow the collection to be accessed by multiple threads for reading and writing, you must implement your own synchronization. + + The property returns an object that can be used to synchronize access to the . Synchronization is effective only if all threads lock this object before accessing the collection. The following code shows the use of the property for C#, C++, and Visual Basic. + +```csharp +ICollection ic = ...; +lock (ic.SyncRoot) { + // Access the collection. +} +``` + +```vb +Dim ic As ICollection = ... +SyncLock ic.SyncRoot + ' Access the collection. +End SyncLock +``` + +```cpp +ICollection^ ic = ...; +try { + Monitor::Enter(ic->SyncRoot); + // Access the collection. +} +finally { + Monitor::Exit(ic->SyncRoot); +} +``` + + Retrieving the value of this property is an O(1) operation. + ]]> @@ -2402,36 +2402,36 @@ finally { The to use as the value of the element to add. Adds an element with the provided key and value to the . - property to add new elements by setting the value of a key that does not exist in the dictionary; for example, `myCollection["myNonexistentKey"] = myValue`. However, if the specified key already exists in the dictionary, setting the property overwrites the old value. In contrast, the method does not modify existing elements. - - This method is an O(`n`) operation for unsorted data, where `n` is . It is an O(log `n`) operation if the new element is added at the end of the list. If insertion causes a resize, the operation is O(`n`). - - - -## Examples - The following code example shows how to access the class through the interface. The code example creates an empty of strings with string keys and uses the method to add some elements. The example demonstrates that the method throws an when attempting to add a duplicate key, or when a key or value of the wrong data type is supplied. - - The code example demonstrates the use of several other members of the interface. - + property to add new elements by setting the value of a key that does not exist in the dictionary; for example, `myCollection["myNonexistentKey"] = myValue`. However, if the specified key already exists in the dictionary, setting the property overwrites the old value. In contrast, the method does not modify existing elements. + + This method is an O(`n`) operation for unsorted data, where `n` is . It is an O(log `n`) operation if the new element is added at the end of the list. If insertion causes a resize, the operation is O(`n`). + + + +## Examples + The following code example shows how to access the class through the interface. The code example creates an empty of strings with string keys and uses the method to add some elements. The example demonstrates that the method throws an when attempting to add a duplicate key, or when a key or value of the wrong data type is supplied. + + The code example demonstrates the use of several other members of the interface. + :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/System.Collections.IDictionary.Add/source.cs" id="Snippet1"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.IDictionary/VB/source.vb" id="Snippet1"::: - + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.IDictionary/VB/source.vb" id="Snippet1"::: + ]]> is . - 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 value type of the . - - -or- - + 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 value type of the . + + -or- + An element with the same key already exists in the . @@ -2482,27 +2482,27 @@ finally { if the contains an element with the key; otherwise, . - . - - This method is an O(log `n`) operation, where `n` is . - - - -## Examples - The following code example shows how to use the method of the interface with a . The example demonstrates that the method returns `false` if a key of the wrong data type is supplied. - - The code example is part of a larger example, including output, provided for the method. - + . + + This method is an O(log `n`) operation, where `n` is . + + + +## Examples + The following code example shows how to use the method of the interface with a . The example demonstrates that the method returns `false` if a key of the wrong data type is supplied. + + The code example is part of a larger example, including output, provided for the method. + :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/System.Collections.IDictionary.Add/source.cs" id="Snippet31"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.IDictionary/VB/source.vb" id="Snippet31"::: + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.IDictionary/VB/source.vb" id="Snippet31"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/System.Collections.IDictionary.Add/source.cs" id="Snippet6"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.IDictionary/VB/source.vb" id="Snippet6"::: +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.IDictionary/VB/source.vb" id="Snippet6"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/System.Collections.IDictionary.Add/source.cs" id="Snippet32"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.IDictionary/VB/source.vb" id="Snippet32"::: - +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.IDictionary/VB/source.vb" id="Snippet32"::: + ]]> @@ -2553,41 +2553,41 @@ finally { Returns an for the . An for the . - also brings the enumerator back to this position. At this position, is undefined. Therefore, you must call to advance the enumerator to the first element of the collection before reading the value of . - - returns the same object until either or is called. sets to the next element. - - If passes the end of the collection, the enumerator is positioned after the last element in the collection and returns `false`. When the enumerator is at this position, subsequent calls to also return `false`. If the last call to returned `false`, is undefined. To set to the first element of the collection again, you can call followed by . - - An enumerator remains valid as long as the collection remains unchanged. If changes are made to the collection, such as adding, modifying, or deleting elements, the enumerator is irrecoverably invalidated and the next call to or throws an . - - The enumerator does not have exclusive access to the collection; therefore, enumerating through a collection is intrinsically not a thread-safe procedure. To guarantee thread safety during enumeration, you can lock the collection during the entire enumeration. To allow the collection to be accessed by multiple threads for reading and writing, you must implement your own synchronization. - - Default implementations of collections in are not synchronized. - - This method is an O(1) operation. - - - -## Examples - The following code example shows how to enumerate the key/value pairs in the sorted list by using the `foreach` statement (`For Each` in Visual Basic, `for each` in C++), which hides the use of the enumerator. In particular, note that the enumerator for the interface returns objects rather than objects. - - The code example is part of a larger example, including output, provided for the method. - + also brings the enumerator back to this position. At this position, is undefined. Therefore, you must call to advance the enumerator to the first element of the collection before reading the value of . + + returns the same object until either or is called. sets to the next element. + + If passes the end of the collection, the enumerator is positioned after the last element in the collection and returns `false`. When the enumerator is at this position, subsequent calls to also return `false`. If the last call to returned `false`, is undefined. To set to the first element of the collection again, you can call followed by . + + An enumerator remains valid as long as the collection remains unchanged. If changes are made to the collection, such as adding, modifying, or deleting elements, the enumerator is irrecoverably invalidated and the next call to or throws an . + + The enumerator does not have exclusive access to the collection; therefore, enumerating through a collection is intrinsically not a thread-safe procedure. To guarantee thread safety during enumeration, you can lock the collection during the entire enumeration. To allow the collection to be accessed by multiple threads for reading and writing, you must implement your own synchronization. + + Default implementations of collections in are not synchronized. + + This method is an O(1) operation. + + + +## Examples + The following code example shows how to enumerate the key/value pairs in the sorted list by using the `foreach` statement (`For Each` in Visual Basic, `for each` in C++), which hides the use of the enumerator. In particular, note that the enumerator for the interface returns objects rather than objects. + + The code example is part of a larger example, including output, provided for the method. + :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/System.Collections.IDictionary.Add/source.cs" id="Snippet31"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.IDictionary/VB/source.vb" id="Snippet31"::: + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.IDictionary/VB/source.vb" id="Snippet31"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/System.Collections.IDictionary.Add/source.cs" id="Snippet7"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.IDictionary/VB/source.vb" id="Snippet7"::: +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.IDictionary/VB/source.vb" id="Snippet7"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/System.Collections.IDictionary.Add/source.cs" id="Snippet32"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.IDictionary/VB/source.vb" id="Snippet32"::: - +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.IDictionary/VB/source.vb" id="Snippet32"::: + ]]> @@ -2636,15 +2636,15 @@ finally { if the has a fixed size; otherwise, . In the default implementation of , this property always returns . - @@ -2693,15 +2693,15 @@ finally { if the is read-only; otherwise, . In the default implementation of , this property always returns . - @@ -2760,46 +2760,46 @@ finally { Gets or sets the element with the specified key. The element with the specified key, or if is not in the dictionary or is of a type that is not assignable to the key type of the . - . - - This property provides the ability to access a specific element in the collection by using the following syntax: `myCollection[key]`. - - You can also use the property to add new elements by setting the value of a key that does not exist in the dictionary; for example, `myCollection["myNonexistentKey"] = myValue`. However, if the specified key already exists in the dictionary, setting the property overwrites the old value. In contrast, the method does not modify existing elements. - - The C# language uses the [this](/dotnet/csharp/language-reference/keywords/this) keyword to define the indexers instead of implementing the property. Visual Basic implements as a default property, which provides the same indexing functionality. - - Retrieving the value of this property is an O(log `n`) operation, where n is . Setting the property is an O(log `n`) operation if the key is already in the . If the key is not in the list, setting the property is an O(`n`) operation for unsorted data, or O(log `n`) if the new element is added at the end of the list. If insertion causes a resize, the operation is O(`n`). - - - -## Examples - The following code example shows how to use the property (the indexer in C#) of the interface with a , and ways the property differs from the property. - - The example shows that, like the property, the property can change the value associated with an existing key and can be used to add a new key/value pair if the specified key is not in the sorted list. The example also shows that unlike the property, the property does not throw an exception if `key` is not in the sorted list, returning a null reference instead. Finally, the example demonstrates that getting the property returns a null reference if `key` is not the correct data type, and that setting the property throws an exception if `key` is not the correct data type. - - The code example is part of a larger example, including output, provided for the method. - + . + + This property provides the ability to access a specific element in the collection by using the following syntax: `myCollection[key]`. + + You can also use the property to add new elements by setting the value of a key that does not exist in the dictionary; for example, `myCollection["myNonexistentKey"] = myValue`. However, if the specified key already exists in the dictionary, setting the property overwrites the old value. In contrast, the method does not modify existing elements. + + The C# language uses the [this](/dotnet/csharp/language-reference/keywords/this) keyword to define the indexers instead of implementing the property. Visual Basic implements as a default property, which provides the same indexing functionality. + + Retrieving the value of this property is an O(log `n`) operation, where n is . Setting the property is an O(log `n`) operation if the key is already in the . If the key is not in the list, setting the property is an O(`n`) operation for unsorted data, or O(log `n`) if the new element is added at the end of the list. If insertion causes a resize, the operation is O(`n`). + + + +## Examples + The following code example shows how to use the property (the indexer in C#) of the interface with a , and ways the property differs from the property. + + The example shows that, like the property, the property can change the value associated with an existing key and can be used to add a new key/value pair if the specified key is not in the sorted list. The example also shows that unlike the property, the property does not throw an exception if `key` is not in the sorted list, returning a null reference instead. Finally, the example demonstrates that getting the property returns a null reference if `key` is not the correct data type, and that setting the property throws an exception if `key` is not the correct data type. + + The code example is part of a larger example, including output, provided for the method. + :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/System.Collections.IDictionary.Add/source.cs" id="Snippet31"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.IDictionary/VB/source.vb" id="Snippet31"::: + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.IDictionary/VB/source.vb" id="Snippet31"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/System.Collections.IDictionary.Add/source.cs" id="Snippet3"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.IDictionary/VB/source.vb" id="Snippet3"::: +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.IDictionary/VB/source.vb" id="Snippet3"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/System.Collections.IDictionary.Add/source.cs" id="Snippet4"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.IDictionary/VB/source.vb" id="Snippet4"::: +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.IDictionary/VB/source.vb" id="Snippet4"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/System.Collections.IDictionary.Add/source.cs" id="Snippet32"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.IDictionary/VB/source.vb" id="Snippet32"::: - +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.IDictionary/VB/source.vb" id="Snippet32"::: + ]]> is . - 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 . + 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 isn't assignable to the value type of the . @@ -2851,29 +2851,29 @@ finally { Gets an containing the keys of the . An containing the keys of the . - is the same as the order in the . - - Retrieving the value of this property is an O(1) operation. - - - -## Examples - The following code example shows how to use the property of the interface with a , to list the keys in the dictionary. The example also shows how to enumerate the key/value pairs in the sorted list; note that the enumerator for the interface returns objects rather than objects. - - The code example is part of a larger example, including output, provided for the method. - + is the same as the order in the . + + Retrieving the value of this property is an O(1) operation. + + + +## Examples + The following code example shows how to use the property of the interface with a , to list the keys in the dictionary. The example also shows how to enumerate the key/value pairs in the sorted list; note that the enumerator for the interface returns objects rather than objects. + + The code example is part of a larger example, including output, provided for the method. + :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/System.Collections.IDictionary.Add/source.cs" id="Snippet31"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.IDictionary/VB/source.vb" id="Snippet31"::: + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.IDictionary/VB/source.vb" id="Snippet31"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/System.Collections.IDictionary.Add/source.cs" id="Snippet9"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.IDictionary/VB/source.vb" id="Snippet9"::: +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.IDictionary/VB/source.vb" id="Snippet9"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/System.Collections.IDictionary.Add/source.cs" id="Snippet7"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.IDictionary/VB/source.vb" id="Snippet7"::: +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.IDictionary/VB/source.vb" id="Snippet7"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/System.Collections.IDictionary.Add/source.cs" id="Snippet32"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.IDictionary/VB/source.vb" id="Snippet32"::: - +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.IDictionary/VB/source.vb" id="Snippet32"::: + ]]> @@ -2925,25 +2925,25 @@ finally { The key of the element to remove. Removes the element with the specified key from the . - . - - - -## Examples - The following code example shows how to use the of the interface with a . - - The code example is part of a larger example, including output, provided for the method. - + . + + + +## Examples + The following code example shows how to use the of the interface with a . + + The code example is part of a larger example, including output, provided for the method. + :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/System.Collections.IDictionary.Add/source.cs" id="Snippet31"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.IDictionary/VB/source.vb" id="Snippet31"::: + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.IDictionary/VB/source.vb" id="Snippet31"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/System.Collections.IDictionary.Add/source.cs" id="Snippet10"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.IDictionary/VB/source.vb" id="Snippet10"::: +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.IDictionary/VB/source.vb" id="Snippet10"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/System.Collections.IDictionary.Add/source.cs" id="Snippet32"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.IDictionary/VB/source.vb" id="Snippet32"::: - +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.IDictionary/VB/source.vb" id="Snippet32"::: + ]]> @@ -2999,29 +2999,29 @@ finally { Gets an containing the values in the . An containing the values in the . - is the same as the order in the . - - Retrieving the value of this property is an O(1) operation. - - - -## Examples - The following code example shows how to use the property of the interface with a , to list the values in the sorted list. The example also shows how to enumerate the key/value pairs in the sorted list; note that the enumerator for the interface returns objects rather than objects. - - The code example is part of a larger example, including output, provided for the method. - + is the same as the order in the . + + Retrieving the value of this property is an O(1) operation. + + + +## Examples + The following code example shows how to use the property of the interface with a , to list the values in the sorted list. The example also shows how to enumerate the key/value pairs in the sorted list; note that the enumerator for the interface returns objects rather than objects. + + The code example is part of a larger example, including output, provided for the method. + :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/System.Collections.IDictionary.Add/source.cs" id="Snippet31"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.IDictionary/VB/source.vb" id="Snippet31"::: + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.IDictionary/VB/source.vb" id="Snippet31"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/System.Collections.IDictionary.Add/source.cs" id="Snippet8"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.IDictionary/VB/source.vb" id="Snippet8"::: +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.IDictionary/VB/source.vb" id="Snippet8"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/System.Collections.IDictionary.Add/source.cs" id="Snippet7"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.IDictionary/VB/source.vb" id="Snippet7"::: +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.IDictionary/VB/source.vb" id="Snippet7"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/System.Collections.IDictionary.Add/source.cs" id="Snippet32"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.IDictionary/VB/source.vb" id="Snippet32"::: - +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList.IDictionary/VB/source.vb" id="Snippet32"::: + ]]> @@ -3071,27 +3071,27 @@ finally { Returns an enumerator that iterates through a collection. An that can be used to iterate through the collection. - also brings the enumerator back to this position. At this position, is undefined. Therefore, you must call to advance the enumerator to the first element of the collection before reading the value of . - - returns the same object until either or is called. sets to the next element. - - If passes the end of the collection, the enumerator is positioned after the last element in the collection and returns `false`. When the enumerator is at this position, subsequent calls to also return `false`. If the last call to returned `false`, is undefined. To set to the first element of the collection again, you can call followed by . - - An enumerator remains valid as long as the collection remains unchanged. If changes are made to the collection, such as adding, modifying, or deleting elements, the enumerator is irrecoverably invalidated and the next call to or throws an . - - The enumerator does not have exclusive access to the collection; therefore, enumerating through a collection is intrinsically not a thread-safe procedure. To guarantee thread safety during enumeration, you can lock the collection during the entire enumeration. To allow the collection to be accessed by multiple threads for reading and writing, you must implement your own synchronization. - - Default implementations of collections in are not synchronized. - - This method is an O(1) operation. - + also brings the enumerator back to this position. At this position, is undefined. Therefore, you must call to advance the enumerator to the first element of the collection before reading the value of . + + returns the same object until either or is called. sets to the next element. + + If passes the end of the collection, the enumerator is positioned after the last element in the collection and returns `false`. When the enumerator is at this position, subsequent calls to also return `false`. If the last call to returned `false`, is undefined. To set to the first element of the collection again, you can call followed by . + + An enumerator remains valid as long as the collection remains unchanged. If changes are made to the collection, such as adding, modifying, or deleting elements, the enumerator is irrecoverably invalidated and the next call to or throws an . + + The enumerator does not have exclusive access to the collection; therefore, enumerating through a collection is intrinsically not a thread-safe procedure. To guarantee thread safety during enumeration, you can lock the collection during the entire enumeration. To allow the collection to be accessed by multiple threads for reading and writing, you must implement your own synchronization. + + Default implementations of collections in are not synchronized. + + This method is an O(1) operation. + ]]> @@ -3136,17 +3136,17 @@ finally { Sets the capacity to the actual number of elements in the , if that number is less than 90 percent of current capacity. - can be considerable, however, so the method does nothing if the list is at more than 90 percent of capacity. This avoids incurring a large reallocation cost for a relatively small gain. - - This method is an O(`n`) operation, where `n` is . - - To reset a to its initial state, call the method before calling method. Trimming an empty sets the capacity of the to the default capacity. - - The capacity can also be set using the property. - + can be considerable, however, so the method does nothing if the list is at more than 90 percent of capacity. This avoids incurring a large reallocation cost for a relatively small gain. + + This method is an O(`n`) operation, where `n` is . + + To reset a to its initial state, call the method before calling method. Trimming an empty sets the capacity of the to the default capacity. + + The capacity can also be set using the property. + ]]> @@ -3210,31 +3210,31 @@ finally { if the contains an element with the specified key; otherwise, . - method and the property. - - If the key is not found, then the `value` parameter gets the appropriate default value for the value type `TValue`; for example, zero (0) for integer types, `false` for Boolean types, and `null` for reference types. - - This method performs a binary search; therefore, this method is an O(log `n`) operation, where `n` is . - - - -## Examples - The example shows how to use the method as a more efficient way to retrieve values in a program that frequently tries keys that are not in the sorted list. For contrast, the example also shows how the property (the indexer in C#) throws exceptions when attempting to retrieve nonexistent keys. - - This code example is part of a larger example provided for the class. - + method and the property. + + If the key is not found, then the `value` parameter gets the appropriate default value for the value type `TValue`; for example, zero (0) for integer types, `false` for Boolean types, and `null` for reference types. + + This method performs a binary search; therefore, this method is an O(log `n`) operation, where `n` is . + + + +## Examples + The example shows how to use the method as a more efficient way to retrieve values in a program that frequently tries keys that are not in the sorted list. For contrast, the example also shows how the property (the indexer in C#) throws exceptions when attempting to retrieve nonexistent keys. + + This code example is part of a larger example provided for the class. + :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR/Generic.SortedList/cpp/source.cpp" id="Snippet5"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/Overview/source.cs" id="Snippet5"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList/VB/source.vb" id="Snippet5"::: - :::code language="fsharp" source="~/snippets/fsharp/System.Collections.Generic/SortedListTKey,TValue/Overview/source.fs" id="Snippet5"::: + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList/VB/source.vb" id="Snippet5"::: + :::code language="fsharp" source="~/snippets/fsharp/System.Collections.Generic/SortedListTKey,TValue/Overview/source.fs" id="Snippet5"::: :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR/Generic.SortedList/cpp/source.cpp" id="Snippet4"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/Overview/source.cs" id="Snippet4"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList/VB/source.vb" id="Snippet4"::: -:::code language="fsharp" source="~/snippets/fsharp/System.Collections.Generic/SortedListTKey,TValue/Overview/source.fs" id="Snippet4"::: - +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList/VB/source.vb" id="Snippet4"::: +:::code language="fsharp" source="~/snippets/fsharp/System.Collections.Generic/SortedListTKey,TValue/Overview/source.fs" id="Snippet4"::: + ]]> @@ -3289,40 +3289,40 @@ finally { Gets a collection containing the values in the . A containing the values in the . - is the same as the order in the . - - The returned is not a static copy; instead, the refers back to the values in the original . Therefore, changes to the continue to be reflected in the . - - The collection returned by the property provides an efficient way to retrieve values by index. It is not necessary to regenerate the list when the property is accessed, because the list is just a wrapper for the internal array of values. The following code shows the use of the property for indexed retrieval of values from a sorted list of strings: - + is the same as the order in the . + + The returned is not a static copy; instead, the refers back to the values in the original . Therefore, changes to the continue to be reflected in the . + + The collection returned by the property provides an efficient way to retrieve values by index. It is not necessary to regenerate the list when the property is accessed, because the list is just a wrapper for the internal array of values. The following code shows the use of the property for indexed retrieval of values from a sorted list of strings: + :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR/Generic.SortedList/cpp/remarks.cpp" id="Snippet11"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/Overview/remarks.cs" id="Snippet11"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList/VB/remarks.vb" id="Snippet11"::: + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList/VB/remarks.vb" id="Snippet11"::: :::code language="fsharp" source="~/snippets/fsharp/System.Collections.Generic/SortedListTKey,TValue/Overview/remarks.fs" id="Snippet11"::: - - Retrieving the value of this property is an O(1) operation. - - - -## Examples - This code example shows how to enumerate the values in the sorted list using the property, and how to enumerate the keys and values in the sorted list. - - The example also shows how to use the property for efficient indexed retrieval of values. - - This code example is part of a larger example provided for the class. - + + Retrieving the value of this property is an O(1) operation. + + + +## Examples + This code example shows how to enumerate the values in the sorted list using the property, and how to enumerate the keys and values in the sorted list. + + The example also shows how to use the property for efficient indexed retrieval of values. + + This code example is part of a larger example provided for the class. + :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR/Generic.SortedList/cpp/source.cpp" id="Snippet8"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/Overview/source.cs" id="Snippet8"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList/VB/source.vb" id="Snippet8"::: - :::code language="fsharp" source="~/snippets/fsharp/System.Collections.Generic/SortedListTKey,TValue/Overview/source.fs" id="Snippet8"::: + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList/VB/source.vb" id="Snippet8"::: + :::code language="fsharp" source="~/snippets/fsharp/System.Collections.Generic/SortedListTKey,TValue/Overview/source.fs" id="Snippet8"::: :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR/Generic.SortedList/cpp/source.cpp" id="Snippet7"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Generic/SortedListTKey,TValue/Overview/source.cs" id="Snippet7"::: -:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList/VB/source.vb" id="Snippet7"::: -:::code language="fsharp" source="~/snippets/fsharp/System.Collections.Generic/SortedListTKey,TValue/Overview/source.fs" id="Snippet7"::: - +:::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/Generic.SortedList/VB/source.vb" id="Snippet7"::: +:::code language="fsharp" source="~/snippets/fsharp/System.Collections.Generic/SortedListTKey,TValue/Overview/source.fs" id="Snippet7"::: + ]]> diff --git a/xml/System.Collections.Generic/SynchronizedKeyedCollection`2.xml b/xml/System.Collections.Generic/SynchronizedKeyedCollection`2.xml index 1bc29c00cf9..642235d3292 100644 --- a/xml/System.Collections.Generic/SynchronizedKeyedCollection`2.xml +++ b/xml/System.Collections.Generic/SynchronizedKeyedCollection`2.xml @@ -43,11 +43,11 @@ The type of items contained in the thread-safe, keyed collection. Provides a thread-safe collection that contains objects of a type specified by a generic parameter and that are grouped by keys. - for use hosting. - + for use hosting. + ]]> @@ -116,11 +116,11 @@ The object used to synchronize access to the thread-safe collection. Initializes a new instance of the class with access synchronized by an explicitly specified object. - are created using the same `syncRoot`, then access is protected across all instances. - + are created using the same `syncRoot`, then access is protected across all instances. + ]]> @@ -157,11 +157,11 @@ The of type used to compare key objects of type for equality. Initializes a new instance of the class with access synchronized by an explicitly specified object and with keys compared in a specified way. - input parameter is the first generic parameter for this class. This allows us to compare keys for equality in a customized way that can be used, for example, to optimize on the most critical aspects of the comparison. - + input parameter is the first generic parameter for this class. This allows us to compare keys for equality in a customized way that can be used, for example, to optimize on the most critical aspects of the comparison. + ]]> @@ -200,11 +200,11 @@ The number of items required to create a dictionary for the collection. Initializes a new instance of the class with access synchronized by an explicitly specified object and with keys compared in a specified way. - (2,147,483,647; hexadecimal 0x7FFFFFFF) to it. - + (2,147,483,647; hexadecimal 0x7FFFFFFF) to it. + ]]> @@ -377,9 +377,9 @@ - The item of type whose key is being retrieved. + The item of type T whose key is being retrieved. When overridden in a derived class, gets the key for a specified item. - The key of type K for the specified of type . + The key of type K for the specified of type T. To be added. @@ -413,7 +413,7 @@ The zero-based index that specifies the insertion location for the item in the collection. - The item of type to be inserted into the collection. + The item of type T to be inserted into the collection. Inserts an item into the collection at a specified location. To be added. @@ -550,7 +550,7 @@ The zero-based index that specifies the insertion location for the item in the collection. - The item of type to be inserted into the collection. + The item of type T to be inserted into the collection. Replaces an item at a specified location of the collection with a new item. To be added. diff --git a/xml/System.Collections.Immutable/IImmutableList`1.xml b/xml/System.Collections.Immutable/IImmutableList`1.xml index 8780434e6b6..39a70e3a9d4 100644 --- a/xml/System.Collections.Immutable/IImmutableList`1.xml +++ b/xml/System.Collections.Immutable/IImmutableList`1.xml @@ -55,18 +55,18 @@ The type of elements in the list. - Represents a list of elements that cannot be modified. - + Represents a list of elements that cannot be modified. + **NuGet package**: System.Collections.Immutable (about immutable collections and how to install) - , a copy of the original list is created, with the changes applied. Incremental changes to a list share as much memory as possible with earlier versions of a list and enable garbage collection to clean up any unique list data that is no longer being referenced. + +For information on creating an `IImmutableList` implementation, see . -When you add or remove items from an , a copy of the original list is created, with the changes applied. Incremental changes to a list share as much memory as possible with earlier versions of a list and enable garbage collection to clean up any unique list data that is no longer being referenced. - -For information on creating an `IImmutableList` implementation, see . - ]]> @@ -598,7 +598,7 @@ For information on creating an `IImmutableList` implementation, see The element to replace the first occurrence of with. The equality comparer to use for matching . Returns a new list with the first matching element in the list replaced with the specified element. - A new list that contains , even if is the same as . + A new list that contains , even if is the same as . To be added. does not exist in the list. diff --git a/xml/System.Collections.Immutable/ImmutableArray`1.xml b/xml/System.Collections.Immutable/ImmutableArray`1.xml index 6dd4f5b43c8..ea760a76a6b 100644 --- a/xml/System.Collections.Immutable/ImmutableArray`1.xml +++ b/xml/System.Collections.Immutable/ImmutableArray`1.xml @@ -973,7 +973,7 @@ This example shows how to create an immutable array using The array to copy to. - The index in where copying begins. + The index in where copying begins. Copies the contents of this array to the specified array starting at the specified destination index. To be added. @@ -1013,7 +1013,7 @@ This example shows how to create an immutable array using The index of this array where copying begins. The array to copy to. - The index in where copying begins. + The index in where copying begins. The number of elements to copy from this array. Copies the specified items in this array to the specified array at the specified starting index. To be added. @@ -4738,7 +4738,7 @@ This member is an explicit interface member implementation. It can be used only The index of the item to replace. The value to add to the list. Replaces the item at the specified index with the specified item. - The new array that contains at the specified index. + The new array that contains at the specified index. - Contains interlocked exchange mechanisms for immutable collections. - + Contains interlocked exchange mechanisms for immutable collections. + **NuGet package**: System.Collections.Immutable (about immutable collections and how to install) To be added. This type is thread safe. @@ -296,9 +296,9 @@ The type of the values contained in the collection. The variable or field to atomically update if the specified key is not in the dictionary. The key for the value to get or add. - The value to add to the dictionary the key is not found. + The value to add to the dictionary if the key isn't found. Gets the value for the specified key from the dictionary, or if the key was not found, adds a new value to the dictionary. - The value at the specified key or if the key was not present. + The value at the specified key, if present. To be added. diff --git a/xml/System.Collections.Immutable/ImmutableList`1+Builder.xml b/xml/System.Collections.Immutable/ImmutableList`1+Builder.xml index face941854d..0f3d3bff7af 100644 --- a/xml/System.Collections.Immutable/ImmutableList`1+Builder.xml +++ b/xml/System.Collections.Immutable/ImmutableList`1+Builder.xml @@ -75,15 +75,15 @@ - Represents a list that mutates with little or no memory allocations and that can produce or build on immutable list instances very efficiently. - + Represents a list that mutates with little or no memory allocations and that can produce or build on immutable list instances very efficiently. + **NuGet package**: System.Collections.Immutable (about immutable collections and how to install) - and other methods already provide fast bulk change operations on the list, the class allows multiple combinations of changes to be made to a list with equal efficiency. - + and other methods already provide fast bulk change operations on the list, the class allows multiple combinations of changes to be made to a list with equal efficiency. + ]]> @@ -198,11 +198,11 @@ Searches the entire for an element using the default comparer and returns the zero-based index of the element. The zero-based index of item in the , if item is found; otherwise, a negative number that is the bitwise complement of the index of the next element that is larger than . - does not contain the specified value, the method returns a negative integer. You can apply the bitwise complement operation (~) to this negative integer to get the index of the first element that is larger than the search value. When inserting the value into the , this index should be used as the insertion point to maintain the sort order. - + does not contain the specified value, the method returns a negative integer. You can apply the bitwise complement operation (~) to this negative integer to get the index of the first element that is larger than the search value. When inserting the value into the , this index should be used as the insertion point to maintain the sort order. + ]]> The default comparer cannot find an implementation of the generic interface or the interface for type T. @@ -255,11 +255,11 @@ Searches the entire for an element using the specified comparer and returns the zero-based index of the element. The zero-based index of item in the , if item is found; otherwise, a negative number that is the bitwise complement of the index of the next element that is larger than . - does not contain the specified value, the method returns a negative integer. You can apply the bitwise complement operation (~) to this negative integer to get the index of the first element that is larger than the search value. When inserting the value into the , this index should be used as the insertion point to maintain the sort order. - + does not contain the specified value, the method returns a negative integer. You can apply the bitwise complement operation (~) to this negative integer to get the index of the first element that is larger than the search value. When inserting the value into the , this index should be used as the insertion point to maintain the sort order. + ]]> @@ -318,11 +318,11 @@ Searches the specified range of the for an element using the specified comparer and returns the zero-based index of the element. The zero-based index of item in the , if item is found; otherwise, a negative number that is the bitwise complement of the index of the next element that is larger than . - does not contain the specified value, the method returns a negative integer. You can apply the bitwise complement operation (~) to this negative integer to get the index of the first element that is larger than the search value. When inserting the value into the , this index should be used as the insertion point to maintain the sort order. - + does not contain the specified value, the method returns a negative integer. You can apply the bitwise complement operation (~) to this negative integer to get the index of the first element that is larger than the search value. When inserting the value into the , this index should be used as the insertion point to maintain the sort order. + ]]> @@ -1528,7 +1528,7 @@ The object to locate in the immutable list. The value can be for reference types. The zero-based starting index of the backward search. Searches for the specified object and returns the zero-based index of the last occurrence within the range of elements in the immutable list that extends from the first element to the specified index. - The zero-based index of the last occurrence of within the range of elements in the immutable list that extends from the first element to , if found; otherwise, -1. + The zero-based index of the last occurrence of within the range of elements in the immutable list that extends from the first element to , if found; otherwise, -1. To be added. @@ -1568,7 +1568,7 @@ The zero-based starting index of the backward search. The number of elements in the section to search. Searches for the specified object and returns the zero-based index of the last occurrence within the range of elements in the immutable list that contains the specified number of elements and ends at the specified index. - The zero-based index of the last occurrence of within the range of elements in the immutable list that contains number of elements and ends at , if found; otherwise, -1. + The zero-based index of the last occurrence of within the range of elements in the immutable list that contains number of elements and ends at , if found; otherwise, -1. To be added. @@ -1618,7 +1618,7 @@ The number of elements to search. The value comparer to use for comparing elements for equality. Searches for the specified object and returns the zero-based index of the last occurrence within the range of elements in the immutable list that contains the specified number of elements and ends at the specified index. - The zero-based index of the first occurrence of item within the range of elements in the immutable list that starts at and contains number of elements, if found; otherwise, -1 + The zero-based index of the first occurrence of item within the range of elements in the immutable list that starts at and contains number of elements, if found; otherwise, -1 To be added. @@ -2229,11 +2229,11 @@ Returns an enumerator that iterates through the collection. An enumerator that can be used to iterate through the collection. - instance is cast to an interface. - + instance is cast to an interface. + ]]> @@ -2276,11 +2276,11 @@ The zero-based index in at which copying begins. Copies the elements of the list to an array, starting at a particular array index. - instance is cast to an interface. - + instance is cast to an interface. + ]]> @@ -2419,11 +2419,11 @@ This member is an explicit interface member implementation. It can be used only Returns an enumerator that iterates through the collection. An enumerator that can be used to iterate through the collection. - instance is cast to an interface. - + instance is cast to an interface. + ]]> @@ -2465,11 +2465,11 @@ This member is an explicit interface member implementation. It can be used only Adds an item to the list. The position into which the new element was inserted, or -1 to indicate that the item was not inserted into the collection. - instance is cast to an interface. - + instance is cast to an interface. + ]]> @@ -2508,11 +2508,11 @@ This member is an explicit interface member implementation. It can be used only Removes all items from the list. - instance is cast to an interface. - + instance is cast to an interface. + ]]> @@ -2556,11 +2556,11 @@ This member is an explicit interface member implementation. It can be used only if the is found in the list; otherwise, . - instance is cast to an interface. - + instance is cast to an interface. + ]]> @@ -2603,11 +2603,11 @@ This member is an explicit interface member implementation. It can be used only Determines the index of a specific item in the list. The index of if found in the list; otherwise, -1. - instance is cast to an interface. - + instance is cast to an interface. + ]]> @@ -2651,11 +2651,11 @@ This member is an explicit interface member implementation. It can be used only The object to insert into the list. Inserts an item to the list at the specified index. - instance is cast to an interface. - + instance is cast to an interface. + ]]> @@ -2831,11 +2831,11 @@ This member is an explicit interface member implementation. It can be used only The object to remove from the list. Removes the first occurrence of a specific object from the list. - instance is cast to an interface. - + instance is cast to an interface. + ]]> @@ -2872,11 +2872,11 @@ This member is an explicit interface member implementation. It can be used only Creates an immutable list based on the contents of this instance. An immutable list. - diff --git a/xml/System.Collections.ObjectModel/Collection`1.xml b/xml/System.Collections.ObjectModel/Collection`1.xml index 560107ffe73..7b4b600a742 100644 --- a/xml/System.Collections.ObjectModel/Collection`1.xml +++ b/xml/System.Collections.ObjectModel/Collection`1.xml @@ -123,7 +123,7 @@ Most objects can be modified. However, a object that is initialized with a read-only object cannot be modified. See for a read-only version of this class. - Elements in this collection can be accessed using an integer index. Indexes in this collection are zero-based. + Elements in this collection can be accessed using an integer index. Indexes in this collection are zero-based. accepts `null` as a valid value for reference types and allows duplicate elements. @@ -155,7 +155,7 @@ Public static ( in Visual Basic) members of this type are thread safe. Any instance members are not guaranteed to be thread safe. - A can support multiple readers concurrently, as long as the collection is not modified. Even so, enumerating through a collection is intrinsically not a thread-safe procedure. To guarantee thread safety during enumeration, you can lock the collection during the entire enumeration. To allow the collection to be accessed by multiple threads for reading and writing, you must implement your own synchronization. + A can support multiple readers concurrently, as long as the collection is not modified. Even so, enumerating through a collection is intrinsically not a thread-safe procedure. To guarantee thread safety during enumeration, you can lock the collection during the entire enumeration. To allow the collection to be accessed by multiple threads for reading and writing, you must implement your own synchronization. This base class is provided to make it easier for implementers to create a custom collection. Implementers are encouraged to extend this base class instead of creating their own. @@ -774,7 +774,7 @@ are not synchronized. @@ -1221,7 +1221,7 @@ The object to remove from the . The value can be for reference types. Removes the first occurrence of a specific object from the . - if is successfully removed; otherwise, . This method also returns if was not found in the original . + if is successfully removed; otherwise, . This method also returns if was not found in the original . Gets a value indicating whether the is read-only. - if the is read-only; otherwise, . In the default implementation of , this property always returns . + if the is read-only; otherwise, . In the default implementation of , this property always returns . Gets a value indicating whether access to the is synchronized (thread safe). - if access to the is synchronized (thread safe); otherwise, . In the default implementation of , this property always returns . + if access to the is synchronized (thread safe); otherwise, . In the default implementation of , this property always returns . Gets an object that can be used to synchronize access to the . - An object that can be used to synchronize access to the . In the default implementation of , this property always returns the current instance. + An object that can be used to synchronize access to the . In the default implementation of , this property always returns the current instance. are not synchronized. - Enumerating through a collection is intrinsically not a thread-safe procedure. To guarantee thread safety during enumeration, you can lock the collection during the entire enumeration. To allow the collection to be accessed by multiple threads for reading and writing, you must implement your own synchronization. + Enumerating through a collection is intrinsically not a thread-safe procedure. To guarantee thread safety during enumeration, you can lock the collection during the entire enumeration. To allow the collection to be accessed by multiple threads for reading and writing, you must implement your own synchronization. returns an object that can be used to synchronize access to the . Synchronization is effective only if all threads lock this object before accessing the collection. The following code shows the use of the property for C#, C++, and Visual Basic. @@ -1813,11 +1813,11 @@ finally { also brings the enumerator back to this position. At this position, is undefined. Therefore, you must call to advance the enumerator to the first element of the collection before reading the value of . + Initially, the enumerator is positioned before the first element in the collection. also brings the enumerator back to this position. At this position, is undefined. Therefore, you must call to advance the enumerator to the first element of the collection before reading the value of . returns the same object until either or is called. sets to the next element. @@ -1825,7 +1825,7 @@ finally { An enumerator remains valid as long as the collection remains unchanged. If changes are made to the collection, such as adding, modifying, or deleting elements, the enumerator is irrecoverably invalidated and its behavior is undefined. - The enumerator does not have exclusive access to the collection; therefore, enumerating through a collection is intrinsically not a thread-safe procedure. To guarantee thread safety during enumeration, you can lock the collection during the entire enumeration. To allow the collection to be accessed by multiple threads for reading and writing, you must implement your own synchronization. + The enumerator does not have exclusive access to the collection; therefore, enumerating through a collection is intrinsically not a thread-safe procedure. To guarantee thread safety during enumeration, you can lock the collection during the entire enumeration. To allow the collection to be accessed by multiple threads for reading and writing, you must implement your own synchronization. Default implementations of collections in are not synchronized. @@ -2008,7 +2008,7 @@ finally { . checks whether type `T` implements and uses that implementation, if available. If not, checks whether type `T` implements . If type `T` does not implement either interface, this method uses . + This method determines equality using the default comparer . checks whether type `T` implements and uses that implementation, if available. If not, checks whether type `T` implements . If type `T` does not implement either interface, this method uses . This method is an O(`n`) operation, where `n` is . @@ -2125,7 +2125,7 @@ finally { Gets a value indicating whether the has a fixed size. - if the has a fixed size; otherwise, . In the default implementation of , this property always returns . + if the has a fixed size; otherwise, . In the default implementation of , this property always returns . Gets a value indicating whether the is read-only. - if the is read-only; otherwise, . In the default implementation of , this property always returns . + if the is read-only; otherwise, . In the default implementation of , this property always returns . is not a valid index in the . - The property is set and is of a type that is not assignable to the . + The property is set and the value is of a type that is not assignable to the . @@ -2319,7 +2319,7 @@ finally { . checks whether type `T` implements and uses that implementation, if available. If not, checks whether type `T` implements . If type `T` does not implement either interface, this method uses . + This method determines equality using the default comparer . checks whether type `T` implements and uses that implementation, if available. If not, checks whether type `T` implements . If type `T` does not implement either interface, this method uses . This method is an O(`n`) operation, where `n` is . diff --git a/xml/System.Collections.ObjectModel/KeyedCollection`2.xml b/xml/System.Collections.ObjectModel/KeyedCollection`2.xml index 060a8c476b9..433d4ae0d18 100644 --- a/xml/System.Collections.ObjectModel/KeyedCollection`2.xml +++ b/xml/System.Collections.ObjectModel/KeyedCollection`2.xml @@ -415,13 +415,13 @@ In order to maintain the connection between a `MutableKey` object and the `Mutab -or- - is . + is . is not found. -or- - already exists in the . + already exists in the . diff --git a/xml/System.Collections.ObjectModel/ReadOnlyCollection`1.xml b/xml/System.Collections.ObjectModel/ReadOnlyCollection`1.xml index afc64600c11..29f4f5fcd3d 100644 --- a/xml/System.Collections.ObjectModel/ReadOnlyCollection`1.xml +++ b/xml/System.Collections.ObjectModel/ReadOnlyCollection`1.xml @@ -114,28 +114,28 @@ The type of elements in the collection. Provides the base class for a generic read-only collection. - generic class is always read-only. A collection that is read-only is simply a collection with a wrapper that prevents modifying the collection; therefore, if changes are made to the underlying collection, the read-only collection reflects those changes. See for a modifiable version of this class. - - - -## Examples - The following code example demonstrates several members of the class. The code example creates a of strings and adds four dinosaur names to it. The code example then wraps the list in a . - - After demonstrating the , , , and members, the code example shows that the is just a wrapper for the original by adding a new item to the and displaying the contents of the . - - Finally, the code example creates an array larger than the collection and uses the method to insert the elements of the collection into the middle of the array. - - :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR/generic.ReadOnlyCollection/cpp/source.cpp" id="Snippet1"::: - :::code language="csharp" source="~/snippets/csharp/System.Collections.ObjectModel/ReadOnlyCollectionT/Overview/source.cs" id="Snippet1"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/generic.ReadOnlyCollection/vb/source.vb" id="Snippet1"::: - + generic class is always read-only. A collection that is read-only is simply a collection with a wrapper that prevents modifying the collection; therefore, if changes are made to the underlying collection, the read-only collection reflects those changes. See for a modifiable version of this class. + + + +## Examples + The following code example demonstrates several members of the class. The code example creates a of strings and adds four dinosaur names to it. The code example then wraps the list in a . + + After demonstrating the , , , and members, the code example shows that the is just a wrapper for the original by adding a new item to the and displaying the contents of the . + + Finally, the code example creates an array larger than the collection and uses the method to insert the elements of the collection into the middle of the array. + + :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR/generic.ReadOnlyCollection/cpp/source.cpp" id="Snippet1"::: + :::code language="csharp" source="~/snippets/csharp/System.Collections.ObjectModel/ReadOnlyCollectionT/Overview/source.cs" id="Snippet1"::: + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/generic.ReadOnlyCollection/vb/source.vb" id="Snippet1"::: + ]]> - Public static ( in Visual Basic) members of this type are thread safe. Any instance members are not guaranteed to be thread safe. - + Public static ( in Visual Basic) members of this type are thread safe. Any instance members are not guaranteed to be thread safe. + A can support multiple readers concurrently, as long as the collection is not modified. Even so, enumerating through a collection is intrinsically not a thread-safe procedure. To guarantee thread safety during enumeration, you can lock the collection during the entire enumeration. To allow the collection to be accessed by multiple threads for reading and writing, you must implement your own synchronization. This base class is provided to make it easier for implementers to create a generic read-only custom collection. Implementers are encouraged to extend this base class instead of creating their own. @@ -184,30 +184,30 @@ The list to wrap. Initializes a new instance of the class that is a read-only wrapper around the specified list. - class. - - The code example creates a of strings and adds four dinosaur names to it. The code example then wraps the list in a by passing it to the constructor. - - After demonstrating the , , , and members, the code example shows that the is just a wrapper for the original by adding a new item to the and displaying the contents of the . - - Finally, the code example creates an array larger than the collection and uses the method to insert the elements of the collection into the middle of the array. - - :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR/generic.ReadOnlyCollection/cpp/source.cpp" id="Snippet1"::: - :::code language="csharp" source="~/snippets/csharp/System.Collections.ObjectModel/ReadOnlyCollectionT/Overview/source.cs" id="Snippet1"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/generic.ReadOnlyCollection/vb/source.vb" id="Snippet1"::: - + class. + + The code example creates a of strings and adds four dinosaur names to it. The code example then wraps the list in a by passing it to the constructor. + + After demonstrating the , , , and members, the code example shows that the is just a wrapper for the original by adding a new item to the and displaying the contents of the . + + Finally, the code example creates an array larger than the collection and uses the method to insert the elements of the collection into the middle of the array. + + :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR/generic.ReadOnlyCollection/cpp/source.cpp" id="Snippet1"::: + :::code language="csharp" source="~/snippets/csharp/System.Collections.ObjectModel/ReadOnlyCollectionT/Overview/source.cs" id="Snippet1"::: + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/generic.ReadOnlyCollection/vb/source.vb" id="Snippet1"::: + ]]> @@ -270,26 +270,26 @@ if is found in the ; otherwise, . - . - - This method performs a linear search; therefore, this method is an O(`n`) operation, where `n` is . - - - -## Examples - The following code example demonstrates several members of the class. The code example creates a of strings and adds four dinosaur names to it. The code example then wraps the list in a . - - After demonstrating the , , , and members, the code example shows that the is just a wrapper for the original by adding a new item to the and displaying the contents of the . - - Finally, the code example creates an array larger than the collection and uses the method to insert the elements of the collection into the middle of the array. - - :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR/generic.ReadOnlyCollection/cpp/source.cpp" id="Snippet1"::: - :::code language="csharp" source="~/snippets/csharp/System.Collections.ObjectModel/ReadOnlyCollectionT/Overview/source.cs" id="Snippet1"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/generic.ReadOnlyCollection/vb/source.vb" id="Snippet1"::: - + . + + This method performs a linear search; therefore, this method is an O(`n`) operation, where `n` is . + + + +## Examples + The following code example demonstrates several members of the class. The code example creates a of strings and adds four dinosaur names to it. The code example then wraps the list in a . + + After demonstrating the , , , and members, the code example shows that the is just a wrapper for the original by adding a new item to the and displaying the contents of the . + + Finally, the code example creates an array larger than the collection and uses the method to insert the elements of the collection into the middle of the array. + + :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR/generic.ReadOnlyCollection/cpp/source.cpp" id="Snippet1"::: + :::code language="csharp" source="~/snippets/csharp/System.Collections.ObjectModel/ReadOnlyCollectionT/Overview/source.cs" id="Snippet1"::: + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/generic.ReadOnlyCollection/vb/source.vb" id="Snippet1"::: + ]]> @@ -345,28 +345,28 @@ The zero-based index in at which copying begins. Copies the entire to a compatible one-dimensional , starting at the specified index of the target array. - to copy the elements. - - The elements are copied to the in the same order that the enumerator iterates through the . - - This method is an O(`n`) operation, where `n` is . - - - -## Examples - The following code example demonstrates several members of the class. The code example creates a of strings and adds four dinosaur names to it. The code example then wraps the list in a . - - After demonstrating the , , , and members, the code example shows that the is just a wrapper for the original by adding a new item to the and displaying the contents of the . - - Finally, the code example creates an array larger than the collection and uses the method to insert the elements of the collection into the middle of the array. - - :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR/generic.ReadOnlyCollection/cpp/source.cpp" id="Snippet1"::: - :::code language="csharp" source="~/snippets/csharp/System.Collections.ObjectModel/ReadOnlyCollectionT/Overview/source.cs" id="Snippet1"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/generic.ReadOnlyCollection/vb/source.vb" id="Snippet1"::: - + to copy the elements. + + The elements are copied to the in the same order that the enumerator iterates through the . + + This method is an O(`n`) operation, where `n` is . + + + +## Examples + The following code example demonstrates several members of the class. The code example creates a of strings and adds four dinosaur names to it. The code example then wraps the list in a . + + After demonstrating the , , , and members, the code example shows that the is just a wrapper for the original by adding a new item to the and displaying the contents of the . + + Finally, the code example creates an array larger than the collection and uses the method to insert the elements of the collection into the middle of the array. + + :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR/generic.ReadOnlyCollection/cpp/source.cpp" id="Snippet1"::: + :::code language="csharp" source="~/snippets/csharp/System.Collections.ObjectModel/ReadOnlyCollectionT/Overview/source.cs" id="Snippet1"::: + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/generic.ReadOnlyCollection/vb/source.vb" id="Snippet1"::: + ]]> @@ -428,24 +428,24 @@ Gets the number of elements contained in the instance. The number of elements contained in the instance. - class. The code example creates a of strings and adds four dinosaur names to it. The code example then wraps the list in a . - - After demonstrating the , , , and members, the code example shows that the is just a wrapper for the original by adding a new item to the and displaying the contents of the . - - Finally, the code example creates an array larger than the collection and uses the method to insert the elements of the collection into the middle of the array. - - :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR/generic.ReadOnlyCollection/cpp/source.cpp" id="Snippet1"::: - :::code language="csharp" source="~/snippets/csharp/System.Collections.ObjectModel/ReadOnlyCollectionT/Overview/source.cs" id="Snippet1"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/generic.ReadOnlyCollection/vb/source.vb" id="Snippet1"::: - + class. The code example creates a of strings and adds four dinosaur names to it. The code example then wraps the list in a . + + After demonstrating the , , , and members, the code example shows that the is just a wrapper for the original by adding a new item to the and displaying the contents of the . + + Finally, the code example creates an array larger than the collection and uses the method to insert the elements of the collection into the middle of the array. + + :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR/generic.ReadOnlyCollection/cpp/source.cpp" id="Snippet1"::: + :::code language="csharp" source="~/snippets/csharp/System.Collections.ObjectModel/ReadOnlyCollectionT/Overview/source.cs" id="Snippet1"::: + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/generic.ReadOnlyCollection/vb/source.vb" id="Snippet1"::: + ]]> @@ -529,36 +529,36 @@ Returns an enumerator that iterates through the . An for the . - is undefined. Therefore, you must call to advance the enumerator to the first element of the collection before reading the value of . - - returns the same object until is called. sets to the next element. - - If passes the end of the collection, the enumerator is positioned after the last element in the collection and returns `false`. When the enumerator is at this position, subsequent calls to also return `false`. If the last call to returned `false`, is undefined. You cannot set to the first element of the collection again; you must create a new enumerator instance instead. - - An enumerator remains valid as long as the collection remains unchanged. If changes are made to the collection, such as adding, modifying, or deleting elements, the enumerator is irrecoverably invalidated and its behavior is undefined. - - The enumerator does not have exclusive access to the collection; therefore, enumerating through a collection is intrinsically not a thread-safe procedure. To guarantee thread safety during enumeration, you can lock the collection during the entire enumeration. To allow the collection to be accessed by multiple threads for reading and writing, you must implement your own synchronization. - - Default implementations of collections in are not synchronized. - - This method is an O(1) operation. - - - -## Examples - The following code example uses the enumerator to display the contents of a that wraps a . The enumerator is concealed by the `foreach` statement (`For Each` in Visual Basic, `for each` in C++). - - :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR/generic.ReadOnlyCollection/cpp/source.cpp" id="Snippet1"::: - :::code language="csharp" source="~/snippets/csharp/System.Collections.ObjectModel/ReadOnlyCollectionT/Overview/source.cs" id="Snippet1"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/generic.ReadOnlyCollection/vb/source.vb" id="Snippet1"::: - + is undefined. Therefore, you must call to advance the enumerator to the first element of the collection before reading the value of . + + returns the same object until is called. sets to the next element. + + If passes the end of the collection, the enumerator is positioned after the last element in the collection and returns `false`. When the enumerator is at this position, subsequent calls to also return `false`. If the last call to returned `false`, is undefined. You cannot set to the first element of the collection again; you must create a new enumerator instance instead. + + An enumerator remains valid as long as the collection remains unchanged. If changes are made to the collection, such as adding, modifying, or deleting elements, the enumerator is irrecoverably invalidated and its behavior is undefined. + + The enumerator does not have exclusive access to the collection; therefore, enumerating through a collection is intrinsically not a thread-safe procedure. To guarantee thread safety during enumeration, you can lock the collection during the entire enumeration. To allow the collection to be accessed by multiple threads for reading and writing, you must implement your own synchronization. + + Default implementations of collections in are not synchronized. + + This method is an O(1) operation. + + + +## Examples + The following code example uses the enumerator to display the contents of a that wraps a . The enumerator is concealed by the `foreach` statement (`For Each` in Visual Basic, `for each` in C++). + + :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR/generic.ReadOnlyCollection/cpp/source.cpp" id="Snippet1"::: + :::code language="csharp" source="~/snippets/csharp/System.Collections.ObjectModel/ReadOnlyCollectionT/Overview/source.cs" id="Snippet1"::: + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/generic.ReadOnlyCollection/vb/source.vb" id="Snippet1"::: + ]]> @@ -610,17 +610,17 @@ The object to locate in the . The value can be for reference types. Searches for the specified object and returns the zero-based index of the first occurrence within the entire . - The zero-based index of the first occurrence of within the entire , if found; otherwise, -1. + The zero-based index of the first occurrence of within the entire , if found; otherwise, -1. - is searched forward starting at the first element and ending at the last element. - - This method determines equality using the default comparer . - - This method performs a linear search; therefore, this method is an O(`n`) operation, where `n` is . - + is searched forward starting at the first element and ending at the last element. + + This method determines equality using the default comparer . + + This method performs a linear search; therefore, this method is an O(`n`) operation, where `n` is . + ]]> @@ -681,35 +681,35 @@ Gets the element at the specified index. The element at the specified index. - property. Visual Basic implements as a default property, which provides the same indexing functionality. - - Retrieving the value of this property is an O(1) operation. - - - -## Examples - The following code example demonstrates several members of the class. The code example creates a of strings and adds four dinosaur names to it. The code example then wraps the list in a . - - After demonstrating the , , , and members, the code example shows that the is just a wrapper for the original by adding a new item to the and displaying the contents of the . - - Finally, the code example creates an array larger than the collection and uses the method to insert the elements of the collection into the middle of the array. - - :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR/generic.ReadOnlyCollection/cpp/source.cpp" id="Snippet1"::: - :::code language="csharp" source="~/snippets/csharp/System.Collections.ObjectModel/ReadOnlyCollectionT/Overview/source.cs" id="Snippet1"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/generic.ReadOnlyCollection/vb/source.vb" id="Snippet1"::: - + property. Visual Basic implements as a default property, which provides the same indexing functionality. + + Retrieving the value of this property is an O(1) operation. + + + +## Examples + The following code example demonstrates several members of the class. The code example creates a of strings and adds four dinosaur names to it. The code example then wraps the list in a . + + After demonstrating the , , , and members, the code example shows that the is just a wrapper for the original by adding a new item to the and displaying the contents of the . + + Finally, the code example creates an array larger than the collection and uses the method to insert the elements of the collection into the middle of the array. + + :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR/generic.ReadOnlyCollection/cpp/source.cpp" id="Snippet1"::: + :::code language="csharp" source="~/snippets/csharp/System.Collections.ObjectModel/ReadOnlyCollectionT/Overview/source.cs" id="Snippet1"::: + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/generic.ReadOnlyCollection/vb/source.vb" id="Snippet1"::: + ]]> - is less than zero. - - -or- - + is less than zero. + + -or- + is equal to or greater than . @@ -755,24 +755,24 @@ Returns the that the wraps. The that the wraps. - class. The code example creates a of strings and adds four dinosaur names to it. The code example then wraps the list in a . - - After demonstrating the , , , and members, the code example shows that the is just a wrapper for the original by adding a new item to the and displaying the contents of the . - - Finally, the code example creates an array larger than the collection and uses the method to insert the elements of the collection into the middle of the array. - - :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR/generic.ReadOnlyCollection/cpp/source.cpp" id="Snippet1"::: - :::code language="csharp" source="~/snippets/csharp/System.Collections.ObjectModel/ReadOnlyCollectionT/Overview/source.cs" id="Snippet1"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/generic.ReadOnlyCollection/vb/source.vb" id="Snippet1"::: - + class. The code example creates a of strings and adds four dinosaur names to it. The code example then wraps the list in a . + + After demonstrating the , , , and members, the code example shows that the is just a wrapper for the original by adding a new item to the and displaying the contents of the . + + Finally, the code example creates an array larger than the collection and uses the method to insert the elements of the collection into the middle of the array. + + :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR/generic.ReadOnlyCollection/cpp/source.cpp" id="Snippet1"::: + :::code language="csharp" source="~/snippets/csharp/System.Collections.ObjectModel/ReadOnlyCollectionT/Overview/source.cs" id="Snippet1"::: + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR/generic.ReadOnlyCollection/vb/source.vb" id="Snippet1"::: + ]]> @@ -827,11 +827,11 @@ The object to add to the . Adds an item to the . This implementation always throws . - instance is cast to an interface. - + instance is cast to an interface. + ]]> Always thrown. @@ -881,11 +881,11 @@ Removes all items from the . This implementation always throws . - instance is cast to an interface. - + instance is cast to an interface. + ]]> Always thrown. @@ -936,17 +936,17 @@ if the is read-only; otherwise, . In the default implementation of , this property always returns . - instance is cast to an interface. - + instance is cast to an interface. + ]]> @@ -1000,11 +1000,11 @@ if was successfully removed from the ; otherwise, . - instance is cast to an interface. - + instance is cast to an interface. + ]]> Always thrown. @@ -1059,11 +1059,11 @@ The object to insert into the . Inserts an item to the at the specified index. This implementation always throws . - instance is cast to an interface. - + instance is cast to an interface. + ]]> Always thrown. @@ -1117,11 +1117,11 @@ Gets the element at the specified index. An occurs if you try to set the item at the specified index. The element at the specified index. - instance is cast to an interface. - + instance is cast to an interface. + ]]> Always thrown if the property is set. @@ -1174,11 +1174,11 @@ The zero-based index of the item to remove. Removes the item at the specified index. This implementation always throws . - instance is cast to an interface. - + instance is cast to an interface. + ]]> Always thrown. @@ -1233,17 +1233,17 @@ The zero-based index in at which copying begins. Copies the elements of the to an , starting at a particular index. - [!NOTE] -> If the type of the source cannot be cast automatically to the type of the destination `array`, the non-generic implementations of throw , whereas the generic implementations throw . - - This method is an O(`n`) operation, where `n` is . - - This member is an explicit interface member implementation. It can be used only when the instance is cast to an interface. - + [!NOTE] +> If the type of the source cannot be cast automatically to the type of the destination `array`, the non-generic implementations of throw , whereas the generic implementations throw . + + This method is an O(`n`) operation, where `n` is . + + This member is an explicit interface member implementation. It can be used only when the instance is cast to an interface. + ]]> @@ -1251,18 +1251,18 @@ is less than zero. - is multidimensional. - - -or- - - does not have zero-based indexing. - - -or- - - The number of elements in the source is greater than the available space from to the end of the destination . - - -or- - + is multidimensional. + + -or- + + does not have zero-based indexing. + + -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 . @@ -1311,19 +1311,19 @@ if access to the is synchronized (thread safe); otherwise, . In the default implementation of , this property always returns . - are not synchronized. - - Enumerating through a collection is intrinsically not a thread-safe procedure. To guarantee thread safety during enumeration, you can lock the collection during the entire enumeration. To allow the collection to be accessed by multiple threads for reading and writing, you must implement your own synchronization. - - returns an object that can be used to synchronize access to the . - - Retrieving the value of this property is an O(1) operation. - - This member is an explicit interface member implementation. It can be used only when the instance is cast to an interface. - + are not synchronized. + + Enumerating through a collection is intrinsically not a thread-safe procedure. To guarantee thread safety during enumeration, you can lock the collection during the entire enumeration. To allow the collection to be accessed by multiple threads for reading and writing, you must implement your own synchronization. + + returns an object that can be used to synchronize access to the . + + Retrieving the value of this property is an O(1) operation. + + This member is an explicit interface member implementation. It can be used only when the instance is cast to an interface. + ]]> @@ -1373,44 +1373,44 @@ Gets an object that can be used to synchronize access to the . An object that can be used to synchronize access to the . In the default implementation of , this property always returns the current instance. - are not synchronized. - - Enumerating through a collection is intrinsically not a thread-safe procedure. To guarantee thread safety during enumeration, you can lock the collection during the entire enumeration. To allow the collection to be accessed by multiple threads for reading and writing, you must implement your own synchronization. - - returns an object that can be used to synchronize access to the . Synchronization is effective only if all threads lock this object before accessing the collection. The following code shows the use of the property for C#, Visual C++, and Visual Basic. - -```csharp -ICollection ic = ...; -lock (ic.SyncRoot) { - // Access the collection. -} -``` - -```vb -Dim ic As ICollection = ... -SyncLock ic.SyncRoot - ' Access the collection. -End SyncLock -``` - -```cpp -ICollection^ ic = ...; -try { - Monitor::Enter(ic->SyncRoot); - // Access the collection. -} -finally { - Monitor::Exit(ic->SyncRoot); -} -``` - - Retrieving the value of this property is an O(1) operation. - - This member is an explicit interface member implementation. It can be used only when the instance is cast to an interface. - + are not synchronized. + + Enumerating through a collection is intrinsically not a thread-safe procedure. To guarantee thread safety during enumeration, you can lock the collection during the entire enumeration. To allow the collection to be accessed by multiple threads for reading and writing, you must implement your own synchronization. + + returns an object that can be used to synchronize access to the . Synchronization is effective only if all threads lock this object before accessing the collection. The following code shows the use of the property for C#, Visual C++, and Visual Basic. + +```csharp +ICollection ic = ...; +lock (ic.SyncRoot) { + // Access the collection. +} +``` + +```vb +Dim ic As ICollection = ... +SyncLock ic.SyncRoot + ' Access the collection. +End SyncLock +``` + +```cpp +ICollection^ ic = ...; +try { + Monitor::Enter(ic->SyncRoot); + // Access the collection. +} +finally { + Monitor::Exit(ic->SyncRoot); +} +``` + + Retrieving the value of this property is an O(1) operation. + + This member is an explicit interface member implementation. It can be used only when the instance is cast to an interface. + ]]> @@ -1461,29 +1461,29 @@ finally { Returns an enumerator that iterates through a collection. An that can be used to iterate through the collection. - also brings the enumerator back to this position. At this position, is undefined. Therefore, you must call to advance the enumerator to the first element of the collection before reading the value of . - - returns the same object until either or is called. sets to the next element. - - If passes the end of the collection, the enumerator is positioned after the last element in the collection and returns `false`. When the enumerator is at this position, subsequent calls to also return `false`. If the last call to returned `false`, is undefined. To set to the first element of the collection again, you can call followed by . - - An enumerator remains valid as long as the collection remains unchanged. If changes are made to the collection, such as adding, modifying, or deleting elements, the enumerator is irrecoverably invalidated and its behavior is undefined. - - The enumerator does not have exclusive access to the collection; therefore, enumerating through a collection is intrinsically not a thread-safe procedure. To guarantee thread safety during enumeration, you can lock the collection during the entire enumeration. To allow the collection to be accessed by multiple threads for reading and writing, you must implement your own synchronization. - - Default implementations of collections in are not synchronized. - - This method is an O(1) operation. - - This member is an explicit interface member implementation. It can be used only when the instance is cast to an interface. - + also brings the enumerator back to this position. At this position, is undefined. Therefore, you must call to advance the enumerator to the first element of the collection before reading the value of . + + returns the same object until either or is called. sets to the next element. + + If passes the end of the collection, the enumerator is positioned after the last element in the collection and returns `false`. When the enumerator is at this position, subsequent calls to also return `false`. If the last call to returned `false`, is undefined. To set to the first element of the collection again, you can call followed by . + + An enumerator remains valid as long as the collection remains unchanged. If changes are made to the collection, such as adding, modifying, or deleting elements, the enumerator is irrecoverably invalidated and its behavior is undefined. + + The enumerator does not have exclusive access to the collection; therefore, enumerating through a collection is intrinsically not a thread-safe procedure. To guarantee thread safety during enumeration, you can lock the collection during the entire enumeration. To allow the collection to be accessed by multiple threads for reading and writing, you must implement your own synchronization. + + Default implementations of collections in are not synchronized. + + This method is an O(1) operation. + + This member is an explicit interface member implementation. It can be used only when the instance is cast to an interface. + ]]> @@ -1537,11 +1537,11 @@ finally { Adds an item to the . This implementation always throws . The position into which the new element was inserted. - instance is cast to an interface. - + instance is cast to an interface. + ]]> Always thrown. @@ -1591,11 +1591,11 @@ finally { Removes all items from the . This implementation always throws . - instance is cast to an interface. - + instance is cast to an interface. + ]]> Always thrown. @@ -1650,15 +1650,15 @@ finally { if the is found in the ; otherwise, . - . - - This method performs a linear search; therefore, this method is an O(`n`) operation, where `n` is . - - This member is an explicit interface member implementation. It can be used only when the instance is cast to an interface. - + . + + This method performs a linear search; therefore, this method is an O(`n`) operation, where `n` is . + + This member is an explicit interface member implementation. It can be used only when the instance is cast to an interface. + ]]> @@ -1713,15 +1713,15 @@ finally { Determines the index of a specific item in the . The index of if found in the list; otherwise, -1. - . - - This method performs a linear search; therefore, this method is an O(`n`) operation, where `n` is . - - This member is an explicit interface member implementation. It can be used only when the instance is cast to an interface. - + . + + This method performs a linear search; therefore, this method is an O(`n`) operation, where `n` is . + + This member is an explicit interface member implementation. It can be used only when the instance is cast to an interface. + ]]> @@ -1777,11 +1777,11 @@ finally { The to insert into the . Inserts an item to the at the specified index. This implementation always throws . - instance is cast to an interface. - + instance is cast to an interface. + ]]> Always thrown. @@ -1832,17 +1832,17 @@ finally { if the has a fixed size; otherwise, . In the default implementation of , this property always returns . - instance is cast to an interface. - + instance is cast to an interface. + ]]> @@ -1892,17 +1892,17 @@ finally { if the is read-only; otherwise, . In the default implementation of , this property always returns . - instance is cast to an interface. - + instance is cast to an interface. + ]]> @@ -1966,17 +1966,17 @@ finally { Gets the element at the specified index. A occurs if you try to set the item at the specified index. The element at the specified index. - property. Visual Basic implements as a default property, which provides the same indexing functionality. - - Retrieving the value of this property is an O(1) operation. - - This member is an explicit interface member implementation. It can be used only when the instance is cast to an interface. - + property. Visual Basic implements as a default property, which provides the same indexing functionality. + + Retrieving the value of this property is an O(1) operation. + + This member is an explicit interface member implementation. It can be used only when the instance is cast to an interface. + ]]> @@ -2031,11 +2031,11 @@ finally { The to remove from the . Removes the first occurrence of a specific object from the . This implementation always throws . - instance is cast to an interface. - + instance is cast to an interface. + ]]> Always thrown. @@ -2088,11 +2088,11 @@ finally { The zero-based index of the item to remove. Removes the item at the specified index. This implementation always throws . - instance is cast to an interface. - + instance is cast to an interface. + ]]> Always thrown. diff --git a/xml/System.Collections.Specialized/HybridDictionary.xml b/xml/System.Collections.Specialized/HybridDictionary.xml index 32f8308491b..320ce717bac 100644 --- a/xml/System.Collections.Specialized/HybridDictionary.xml +++ b/xml/System.Collections.Specialized/HybridDictionary.xml @@ -66,40 +66,40 @@ Implements by using a while the collection is small, and then switching to a when the collection gets large. - with small collections, and offers the flexibility of switching to a which handles larger collections better than . - - If the initial size of the collection is greater than the optimal size for a , the collection is stored in a to avoid the overhead of copying elements from the to a . - - The constructor accepts a Boolean parameter that allows the user to specify whether the collection ignores the case when comparing strings. If the collection is case-sensitive, it uses the key's implementations of and . If the collection is case-insensitive, it performs a simple ordinal case-insensitive comparison, which obeys the casing rules of the invariant culture only. By default, the collection is case-sensitive. For more information on the invariant culture, see . - - A key cannot be null, but a value can. - - The `foreach` statement of the C# language (`For Each` in Visual Basic) returns an object of the type of the elements in the collection. Since each element of the is a key/value pair, the element type is not the type of the key or the type of the value. Instead, the element type is . For example: - + with small collections, and offers the flexibility of switching to a which handles larger collections better than . + + If the initial size of the collection is greater than the optimal size for a , the collection is stored in a to avoid the overhead of copying elements from the to a . + + The constructor accepts a Boolean parameter that allows the user to specify whether the collection ignores the case when comparing strings. If the collection is case-sensitive, it uses the key's implementations of and . If the collection is case-insensitive, it performs a simple ordinal case-insensitive comparison, which obeys the casing rules of the invariant culture only. By default, the collection is case-sensitive. For more information on the invariant culture, see . + + A key cannot be null, but a value can. + + The `foreach` statement of the C# language (`For Each` in Visual Basic) returns an object of the type of the elements in the collection. Since each element of the is a key/value pair, the element type is not the type of the key or the type of the value. Instead, the element type is . For example: + :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR_System/system.Collections.Specialized.HybridDictionary2/CPP/source2.cpp" id="Snippet2"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Specialized/HybridDictionary/Overview/source2.cs" id="Snippet2"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR_System/system.Collections.Specialized.HybridDictionary2/VB/source2.vb" id="Snippet2"::: - - The `foreach` statement is a wrapper around the enumerator, which only allows reading from, not writing to, the collection. - - - -## Examples - The following code example demonstrates several of the properties and methods of . - + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR_System/system.Collections.Specialized.HybridDictionary2/VB/source2.vb" id="Snippet2"::: + + The `foreach` statement is a wrapper around the enumerator, which only allows reading from, not writing to, the collection. + + + +## Examples + The following code example demonstrates several of the properties and methods of . + :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR_System/system.Collections.Specialized.HybridDictionary2/CPP/hybriddictionary.cpp" id="Snippet1"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Specialized/HybridDictionary/Overview/hybriddictionary.cs" interactive="try-dotnet" id="Snippet1"::: :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR_System/system.Collections.Specialized.HybridDictionary2/VB/hybriddictionary.vb" id="Snippet1"::: - + ]]> - Public static ( in Visual Basic) members of this type are thread safe. Any instance members are not guaranteed to be thread safe. - - This implementation does not provide a synchronized (thread safe) wrapper for a , but derived classes can create their own synchronized versions of the using the property. - + Public static ( in Visual Basic) members of this type are thread safe. Any instance members are not guaranteed to be thread safe. + + This implementation does not provide a synchronized (thread safe) wrapper for a , but derived classes can create their own synchronized versions of the using the property. + Enumerating through a collection is intrinsically not a thread-safe procedure. Even when a collection is synchronized, other threads can still modify the collection, which causes the enumerator to throw an exception. To guarantee thread safety during enumeration, you can either lock the collection during the entire enumeration or catch the exceptions resulting from changes made by other threads. @@ -162,24 +162,24 @@ Creates an empty case-sensitive . - as the hash code provider and the key's implementation of as the comparer. - - The comparer determines whether two keys are equal. Every key in a must be unique. - - This constructor is an O(1) operation. - - - -## Examples - The following code example demonstrates several of the properties and methods of . - + as the hash code provider and the key's implementation of as the comparer. + + The comparer determines whether two keys are equal. Every key in a must be unique. + + This constructor is an O(1) operation. + + + +## Examples + The following code example demonstrates several of the properties and methods of . + :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR_System/system.Collections.Specialized.HybridDictionary2/CPP/hybriddictionary.cpp" id="Snippet1"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Specialized/HybridDictionary/Overview/hybriddictionary.cs" interactive="try-dotnet" id="Snippet1"::: :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR_System/system.Collections.Specialized.HybridDictionary2/VB/hybriddictionary.vb" id="Snippet1"::: - + ]]> Performing Culture-Insensitive String Operations @@ -231,13 +231,13 @@ A Boolean that denotes whether the is case-insensitive. Creates an empty with the specified case sensitivity. - and . If `caseInsensitive` is `true`, the collection performs a simple ordinal case-insensitive comparison, which obeys the casing rules of the invariant culture only. For more information on the invariant culture, see . - - This constructor is an O(1) operation. - + and . If `caseInsensitive` is `true`, the collection performs a simple ordinal case-insensitive comparison, which obeys the casing rules of the invariant culture only. For more information on the invariant culture, see . + + This constructor is an O(1) operation. + ]]> Performing Culture-Insensitive String Operations @@ -289,17 +289,17 @@ The approximate number of entries that the can initially contain. Creates a case-sensitive with the specified initial size. - , the collection is stored in a to avoid the overhead of copying elements from the to the . - - By default, the collection is case-sensitive and uses the key's implementation of as the hash code provider and the key's implementation of as the comparer. - - The comparer determines whether two keys are equal. Every key in a must be unique. - - This constructor is an O(`n`) operation, where `n` is `initialSize`. - + , the collection is stored in a to avoid the overhead of copying elements from the to the . + + By default, the collection is case-sensitive and uses the key's implementation of as the hash code provider and the key's implementation of as the comparer. + + The comparer determines whether two keys are equal. Every key in a must be unique. + + This constructor is an O(`n`) operation, where `n` is `initialSize`. + ]]> @@ -349,15 +349,15 @@ A Boolean that denotes whether the is case-insensitive. Creates a with the specified initial size and case sensitivity. - , the collection is stored in a to avoid the overhead of copying elements from the to the . - - If `caseInsensitive` is `false`, the collection uses the key's implementations of and . If `caseInsensitive` is `true`, the collection performs a simple ordinal case-insensitive comparison, which obeys the casing rules of the invariant culture only. For more information on the invariant culture, see . - - This constructor is an O(`n`) operation, where `n` is `initialSize`. - + , the collection is stored in a to avoid the overhead of copying elements from the to the . + + If `caseInsensitive` is `false`, the collection uses the key's implementations of and . If `caseInsensitive` is `true`, the collection performs a simple ordinal case-insensitive comparison, which obeys the casing rules of the invariant culture only. For more information on the invariant culture, see . + + This constructor is an O(`n`) operation, where `n` is `initialSize`. + ]]> Performing Culture-Insensitive String Operations @@ -419,28 +419,28 @@ The value of the entry to add. The value can be . Adds an entry with the specified key and value into the . - property to add new elements by setting the value of a key that does not exist in the ; for example, `myCollection["myNonexistentKey"] = myValue`. However, if the specified key already exists in the , setting the property overwrites the old value. In contrast, the method does not modify existing elements. - - When the number of elements becomes greater than the optimal size for a , the elements are copied from the to a . However, this only happens once. If the collection is already stored in a and the number of elements falls below the optimal size for a , the collection remains in the . - - This method is an O(1) operation. - - - -## Examples - The following code example adds to and removes elements from a . - + property to add new elements by setting the value of a key that does not exist in the ; for example, `myCollection["myNonexistentKey"] = myValue`. However, if the specified key already exists in the , setting the property overwrites the old value. In contrast, the method does not modify existing elements. + + When the number of elements becomes greater than the optimal size for a , the elements are copied from the to a . However, this only happens once. If the collection is already stored in a and the number of elements falls below the optimal size for a , the collection remains in the . + + This method is an O(1) operation. + + + +## Examples + The following code example adds to and removes elements from a . + :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR_System/system.Collections.Specialized.HybridDictionary_AddRemove/CPP/hybriddictionary_addremove.cpp" id="Snippet1"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Specialized/HybridDictionary/Add/hybriddictionary_addremove.cs" interactive="try-dotnet" id="Snippet1"::: :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR_System/system.Collections.Specialized.HybridDictionary_AddRemove/VB/hybriddictionary_addremove.vb" id="Snippet1"::: - + ]]> @@ -494,20 +494,20 @@ Removes all entries from the . - is set to zero, and references to other objects from elements of the collection are also released. - - If the collection is already stored in a , the collection remains in the . - - This method is an O(`n`) operation, where `n` is . - - - -## Examples - The following code example adds to and removes elements from a . - + is set to zero, and references to other objects from elements of the collection are also released. + + If the collection is already stored in a , the collection remains in the . + + This method is an O(`n`) operation, where `n` is . + + + +## Examples + The following code example adds to and removes elements from a . + :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR_System/system.Collections.Specialized.HybridDictionary_AddRemove/CPP/hybriddictionary_addremove.cpp" id="Snippet1"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Specialized/HybridDictionary/Add/hybriddictionary_addremove.cs" interactive="try-dotnet" id="Snippet1"::: :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR_System/system.Collections.Specialized.HybridDictionary_AddRemove/VB/hybriddictionary_addremove.vb" id="Snippet1"::: @@ -565,21 +565,21 @@ if the contains an entry with the specified key; otherwise, . - and methods on `key` to determine whether `item` exists. In the earlier versions of the .NET Framework, this determination was made by using the and methods of the `item` parameter on the objects in the collection. - - - -## Examples - The following code example searches for an element in a . - + and methods on `key` to determine whether `item` exists. In the earlier versions of the .NET Framework, this determination was made by using the and methods of the `item` parameter on the objects in the collection. + + + +## Examples + The following code example searches for an element in a . + :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR_System/system.Collections.Specialized.HybridDictionary_Contains/CPP/hybriddictionary_contains.cpp" id="Snippet1"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Specialized/HybridDictionary/Contains/hybriddictionary_contains.cs" interactive="try-dotnet" id="Snippet1"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR_System/system.Collections.Specialized.HybridDictionary_Contains/VB/hybriddictionary_contains.vb" id="Snippet1"::: + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR_System/system.Collections.Specialized.HybridDictionary_Contains/VB/hybriddictionary_contains.vb" id="Snippet1"::: ]]> @@ -637,22 +637,20 @@ The zero-based index in at which copying begins. Copies the entries to a one-dimensional instance at the specified index. - in the same order in which the enumerator iterates through the . - - To copy only the keys in the , use `HybridDictionary.Keys.CopyTo`. - - To copy only the values in the , use `HybridDictionary.Values.CopyTo`. - - This method is an O(`n`) operation, where `n` is . - - - -## Examples - The following code example copies the elements of a to an array. - + in the same order in which the enumerator iterates through the . + + To copy only the keys in the , use `HybridDictionary.Keys.CopyTo`. + + To copy only the values in the , use `HybridDictionary.Values.CopyTo`. + + This method is an O(`n`) operation, where `n` is . + +## Examples + The following code example copies the elements of a to an array. + :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR_System/system.Collections.Specialized.HybridDictionary_CopyTo/CPP/hybriddictionary_copyto.cpp" id="Snippet1"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Specialized/HybridDictionary/CopyTo/hybriddictionary_copyto.cs" interactive="try-dotnet" id="Snippet1"::: :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR_System/system.Collections.Specialized.HybridDictionary_CopyTo/VB/hybriddictionary_copyto.vb" id="Snippet1"::: @@ -664,11 +662,11 @@ is less than zero. - is multidimensional. - - -or- - - The number of elements in the source is greater than the available space from to the end of the destination . + is multidimensional. + + -or- + + The number of elements in the source is greater than the available space from to the end of the destination . The type of the source cannot be cast automatically to the type of the destination . @@ -716,19 +714,19 @@ Gets the number of key/value pairs contained in the . - The number of key/value pairs contained in the . - + The number of key/value pairs contained in the . + Retrieving the value of this property is an O(1) operation. - . - + . + :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR_System/system.Collections.Specialized.HybridDictionary_Enumerator/CPP/hybriddictionary_enumerator.cpp" id="Snippet1"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Specialized/HybridDictionary/Count/hybriddictionary_enumerator.cs" id="Snippet1"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR_System/system.Collections.Specialized.HybridDictionary_Enumerator/VB/hybriddictionary_enumerator.vb" id="Snippet1"::: - + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR_System/system.Collections.Specialized.HybridDictionary_Enumerator/VB/hybriddictionary_enumerator.vb" id="Snippet1"::: + ]]> @@ -777,34 +775,34 @@ Returns an that iterates through the . An for the . - also brings the enumerator back to this position. At this position, is undefined. Therefore, you must call to advance the enumerator to the first element of the collection before reading the value of . - - returns the same object until either or is called. sets to the next element. - - If passes the end of the collection, the enumerator is positioned after the last element in the collection and returns `false`. When the enumerator is at this position, subsequent calls to also return `false`. If the last call to returned `false`, is undefined. To set to the first element of the collection again, you can call followed by . - - An enumerator remains valid as long as the collection remains unchanged. If changes are made to the collection, such as adding, modifying, or deleting elements, the enumerator is irrecoverably invalidated and its behavior is undefined. - - The enumerator does not have exclusive access to the collection; therefore, enumerating through a collection is intrinsically not a thread-safe procedure. To guarantee thread safety during enumeration, you can lock the collection during the entire enumeration. To allow the collection to be accessed by multiple threads for reading and writing, you must implement your own synchronization. - - This method is an O(1) operation. - - - -## Examples - The following code example enumerates the elements of a . - + also brings the enumerator back to this position. At this position, is undefined. Therefore, you must call to advance the enumerator to the first element of the collection before reading the value of . + + returns the same object until either or is called. sets to the next element. + + If passes the end of the collection, the enumerator is positioned after the last element in the collection and returns `false`. When the enumerator is at this position, subsequent calls to also return `false`. If the last call to returned `false`, is undefined. To set to the first element of the collection again, you can call followed by . + + An enumerator remains valid as long as the collection remains unchanged. If changes are made to the collection, such as adding, modifying, or deleting elements, the enumerator is irrecoverably invalidated and its behavior is undefined. + + The enumerator does not have exclusive access to the collection; therefore, enumerating through a collection is intrinsically not a thread-safe procedure. To guarantee thread safety during enumeration, you can lock the collection during the entire enumeration. To allow the collection to be accessed by multiple threads for reading and writing, you must implement your own synchronization. + + This method is an O(1) operation. + + + +## Examples + The following code example enumerates the elements of a . + :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR_System/system.Collections.Specialized.HybridDictionary_Enumerator/CPP/hybriddictionary_enumerator.cpp" id="Snippet1"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Specialized/HybridDictionary/Count/hybriddictionary_enumerator.cs" interactive="try-dotnet" id="Snippet1"::: :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR_System/system.Collections.Specialized.HybridDictionary_Enumerator/VB/hybriddictionary_enumerator.vb" id="Snippet1"::: - + ]]> @@ -854,17 +852,17 @@ Gets a value indicating whether the has a fixed size. This property always returns . - implements the property because it is required by the interface. - - A collection with a fixed size does not allow the addition or removal of elements after the collection is created, but it allows the modification of existing elements. - - A collection with a fixed size is simply a collection with a wrapper that prevents adding and removing elements; therefore, if changes are made to the underlying collection, including the addition or removal of elements, the fixed-size collection reflects those changes. - - Retrieving the value of this property is an O(1) operation. - + implements the property because it is required by the interface. + + A collection with a fixed size does not allow the addition or removal of elements after the collection is created, but it allows the modification of existing elements. + + A collection with a fixed size is simply a collection with a wrapper that prevents adding and removing elements; therefore, if changes are made to the underlying collection, including the addition or removal of elements, the fixed-size collection reflects those changes. + + Retrieving the value of this property is an O(1) operation. + ]]> @@ -912,17 +910,17 @@ Gets a value indicating whether the is read-only. This property always returns . - implements the property because it is required by the interface. - - A collection that is read-only does not allow the addition, removal, or modification of elements after the collection is created. - - A collection that is read-only is simply a collection with a wrapper that prevents modifying the collection; therefore, if changes are made to the underlying collection, the read-only collection reflects those changes. - - Retrieving the value of this property is an O(1) operation. - + implements the property because it is required by the interface. + + A collection that is read-only does not allow the addition, removal, or modification of elements after the collection is created. + + A collection that is read-only is simply a collection with a wrapper that prevents modifying the collection; therefore, if changes are made to the underlying collection, the read-only collection reflects those changes. + + Retrieving the value of this property is an O(1) operation. + ]]> @@ -970,26 +968,26 @@ Gets a value indicating whether the is synchronized (thread safe). This property always returns . - implements the property because it is required by the interface. - - Derived classes can provide a synchronized version of the using the property. - - Enumerating through a collection is intrinsically not a thread-safe procedure. Even when a collection is synchronized, other threads can still modify the collection, which causes the enumerator to throw an exception. To guarantee thread safety during enumeration, you can either lock the collection during the entire enumeration or catch the exceptions resulting from changes made by other threads. - - - -## Examples - The following code example shows how to lock the collection using the during the entire enumeration. - + implements the property because it is required by the interface. + + Derived classes can provide a synchronized version of the using the property. + + Enumerating through a collection is intrinsically not a thread-safe procedure. Even when a collection is synchronized, other threads can still modify the collection, which causes the enumerator to throw an exception. To guarantee thread safety during enumeration, you can either lock the collection during the entire enumeration or catch the exceptions resulting from changes made by other threads. + + + +## Examples + The following code example shows how to lock the collection using the during the entire enumeration. + :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR_System/system.Collections.Specialized.HybridDictionary2/CPP/source2.cpp" id="Snippet3"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Specialized/HybridDictionary/Overview/source2.cs" id="Snippet3"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR_System/system.Collections.Specialized.HybridDictionary2/VB/source2.vb" id="Snippet3"::: - - Retrieving the value of this property is an O(1) operation. - + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR_System/system.Collections.Specialized.HybridDictionary2/VB/source2.vb" id="Snippet3"::: + + Retrieving the value of this property is an O(1) operation. + ]]> @@ -1049,28 +1047,28 @@ Gets or sets the value associated with the specified key. The value associated with the specified key. If the specified key is not found, attempting to get it returns , and attempting to set it creates a new entry using the specified key. - property to add new elements by setting the value of a key that does not exist in the ; for example, `myCollection["myNonexistentKey"] = myValue`. However, if the specified key already exists in the , setting the property overwrites the old value. In contrast, the method does not modify existing elements. - - A key cannot be `null`, but a value can. To distinguish between `null` that is returned because the specified key is not found and `null` that is returned because the value of the specified key is `null`, use the method to determine if the key exists in the list. - - The C# language uses the [this](/dotnet/csharp/language-reference/keywords/this) keyword to define the indexers instead of implementing the property. Visual Basic implements as a default property, which provides the same indexing functionality. - - Retrieving the value of this property is an O(1) operation; setting the property is also an O(1) operation. - - - -## Examples - The following code example enumerates the elements of a . - + property to add new elements by setting the value of a key that does not exist in the ; for example, `myCollection["myNonexistentKey"] = myValue`. However, if the specified key already exists in the , setting the property overwrites the old value. In contrast, the method does not modify existing elements. + + A key cannot be `null`, but a value can. To distinguish between `null` that is returned because the specified key is not found and `null` that is returned because the value of the specified key is `null`, use the method to determine if the key exists in the list. + + The C# language uses the [this](/dotnet/csharp/language-reference/keywords/this) keyword to define the indexers instead of implementing the property. Visual Basic implements as a default property, which provides the same indexing functionality. + + Retrieving the value of this property is an O(1) operation; setting the property is also an O(1) operation. + + + +## Examples + The following code example enumerates the elements of a . + :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR_System/system.Collections.Specialized.HybridDictionary_Enumerator/CPP/hybriddictionary_enumerator.cpp" id="Snippet1"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Specialized/HybridDictionary/Count/hybriddictionary_enumerator.cs" interactive="try-dotnet" id="Snippet1"::: :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR_System/system.Collections.Specialized.HybridDictionary_Enumerator/VB/hybriddictionary_enumerator.vb" id="Snippet1"::: - + ]]> @@ -1122,20 +1120,20 @@ Gets an containing the keys in the . An containing the keys in the . - is unspecified, but it is the same order as the associated values in the returned by the method. - - The returned is not a static copy; instead, the refers back to the keys in the original . Therefore, changes to the continue to be reflected in the . - - Retrieving the value of this property is an O(1) operation. - - - -## Examples - The following code example enumerates the elements of a . - + is unspecified, but it is the same order as the associated values in the returned by the method. + + The returned is not a static copy; instead, the refers back to the keys in the original . Therefore, changes to the continue to be reflected in the . + + Retrieving the value of this property is an O(1) operation. + + + +## Examples + The following code example enumerates the elements of a . + :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR_System/system.Collections.Specialized.HybridDictionary_Enumerator/CPP/hybriddictionary_enumerator.cpp" id="Snippet1"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Specialized/HybridDictionary/Count/hybriddictionary_enumerator.cs" interactive="try-dotnet" id="Snippet1"::: :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR_System/system.Collections.Specialized.HybridDictionary_Enumerator/VB/hybriddictionary_enumerator.vb" id="Snippet1"::: @@ -1192,24 +1190,24 @@ The key of the entry to remove. Removes the entry with the specified key from the . - does not contain an element with the specified key, the remains unchanged. No exception is thrown. - - If the collection is already stored in a and the number of elements falls below the optimal size for a , the collection remains in the to avoid the overhead of copying elements from the back to a . - - This method is an O(1) operation. - - - -## Examples - The following code example adds to and removes elements from a . - + does not contain an element with the specified key, the remains unchanged. No exception is thrown. + + If the collection is already stored in a and the number of elements falls below the optimal size for a , the collection remains in the to avoid the overhead of copying elements from the back to a . + + This method is an O(1) operation. + + + +## Examples + The following code example adds to and removes elements from a . + :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR_System/system.Collections.Specialized.HybridDictionary_AddRemove/CPP/hybriddictionary_addremove.cpp" id="Snippet1"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Specialized/HybridDictionary/Add/hybriddictionary_addremove.cs" interactive="try-dotnet" id="Snippet1"::: :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR_System/system.Collections.Specialized.HybridDictionary_AddRemove/VB/hybriddictionary_addremove.vb" id="Snippet1"::: - + ]]> @@ -1262,24 +1260,24 @@ Gets an object that can be used to synchronize access to the . An object that can be used to synchronize access to the . - using the property. The synchronizing code must perform operations on the of the , not directly on the . This ensures proper operation of collections that are derived from other objects. Specifically, it maintains proper synchronization with other threads that might be simultaneously modifying the object. - - Enumerating through a collection is intrinsically not a thread-safe procedure. Even when a collection is synchronized, other threads can still modify the collection, which causes the enumerator to throw an exception. To guarantee thread safety during enumeration, you can either lock the collection during the entire enumeration or catch the exceptions resulting from changes made by other threads. - - - -## Examples - The following code example shows how to lock the collection using the during the entire enumeration. - + using the property. The synchronizing code must perform operations on the of the , not directly on the . This ensures proper operation of collections that are derived from other objects. Specifically, it maintains proper synchronization with other threads that might be simultaneously modifying the object. + + Enumerating through a collection is intrinsically not a thread-safe procedure. Even when a collection is synchronized, other threads can still modify the collection, which causes the enumerator to throw an exception. To guarantee thread safety during enumeration, you can either lock the collection during the entire enumeration or catch the exceptions resulting from changes made by other threads. + + + +## Examples + The following code example shows how to lock the collection using the during the entire enumeration. + :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR_System/system.Collections.Specialized.HybridDictionary2/CPP/source2.cpp" id="Snippet3"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Specialized/HybridDictionary/Overview/source2.cs" id="Snippet3"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR_System/system.Collections.Specialized.HybridDictionary2/VB/source2.vb" id="Snippet3"::: - - Retrieving the value of this property is an O(1) operation. - + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR_System/system.Collections.Specialized.HybridDictionary2/VB/source2.vb" id="Snippet3"::: + + Retrieving the value of this property is an O(1) operation. + ]]> @@ -1329,34 +1327,34 @@ Returns an that iterates through the . An for the . - also brings the enumerator back to this position. At this position, calling throws an exception. Therefore, you must call to advance the enumerator to the first element of the collection before reading the value of . - - returns the same object until either or is called. sets to the next element. - - If passes the end of the collection, the enumerator is positioned after the last element in the collection and returns `false`. When the enumerator is at this position, subsequent calls to also return `false`. If the last call to returned `false`, calling throws an exception. To set to the first element of the collection again, you can call followed by . - - An enumerator remains valid as long as the collection remains unchanged. If changes are made to the collection, such as adding, modifying, or deleting elements, the enumerator is irrecoverably invalidated and the next call to or throws an . If the collection is modified between and , returns the element that it is set to, even if the enumerator is already invalidated. - - The enumerator does not have exclusive access to the collection; therefore, enumerating through a collection is intrinsically not a thread-safe procedure. Even when a collection is synchronized, other threads can still modify the collection, which causes the enumerator to throw an exception. To guarantee thread safety during enumeration, you can either lock the collection during the entire enumeration or catch the exceptions resulting from changes made by other threads. - - This method is an O(1) operation. - - - -## Examples - The following code example enumerates the elements of a . - + also brings the enumerator back to this position. At this position, calling throws an exception. Therefore, you must call to advance the enumerator to the first element of the collection before reading the value of . + + returns the same object until either or is called. sets to the next element. + + If passes the end of the collection, the enumerator is positioned after the last element in the collection and returns `false`. When the enumerator is at this position, subsequent calls to also return `false`. If the last call to returned `false`, calling throws an exception. To set to the first element of the collection again, you can call followed by . + + An enumerator remains valid as long as the collection remains unchanged. If changes are made to the collection, such as adding, modifying, or deleting elements, the enumerator is irrecoverably invalidated and the next call to or throws an . If the collection is modified between and , returns the element that it is set to, even if the enumerator is already invalidated. + + The enumerator does not have exclusive access to the collection; therefore, enumerating through a collection is intrinsically not a thread-safe procedure. Even when a collection is synchronized, other threads can still modify the collection, which causes the enumerator to throw an exception. To guarantee thread safety during enumeration, you can either lock the collection during the entire enumeration or catch the exceptions resulting from changes made by other threads. + + This method is an O(1) operation. + + + +## Examples + The following code example enumerates the elements of a . + :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR_System/system.Collections.Specialized.HybridDictionary_Enumerator/CPP/hybriddictionary_enumerator.cpp" id="Snippet1"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Specialized/HybridDictionary/Count/hybriddictionary_enumerator.cs" id="Snippet1"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR_System/system.Collections.Specialized.HybridDictionary_Enumerator/VB/hybriddictionary_enumerator.vb" id="Snippet1"::: - + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR_System/system.Collections.Specialized.HybridDictionary_Enumerator/VB/hybriddictionary_enumerator.vb" id="Snippet1"::: + ]]> @@ -1406,24 +1404,24 @@ Gets an containing the values in the . An containing the values in the . - is unspecified, but it is the same order as the associated keys in the returned by the method. - - The returned is not a static copy; instead, the refers back to the values in the original . Therefore, changes to the continue to be reflected in the . - - Retrieving the value of this property is an O(1) operation. - - - -## Examples - The following code example enumerates the elements of a . - + is unspecified, but it is the same order as the associated keys in the returned by the method. + + The returned is not a static copy; instead, the refers back to the values in the original . Therefore, changes to the continue to be reflected in the . + + Retrieving the value of this property is an O(1) operation. + + + +## Examples + The following code example enumerates the elements of a . + :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR_System/system.Collections.Specialized.HybridDictionary_Enumerator/CPP/hybriddictionary_enumerator.cpp" id="Snippet1"::: :::code language="csharp" source="~/snippets/csharp/System.Collections.Specialized/HybridDictionary/Count/hybriddictionary_enumerator.cs" interactive="try-dotnet" id="Snippet1"::: :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR_System/system.Collections.Specialized.HybridDictionary_Enumerator/VB/hybriddictionary_enumerator.vb" id="Snippet1"::: - + ]]> diff --git a/xml/System.Collections.Specialized/NotifyCollectionChangedEventArgs.xml b/xml/System.Collections.Specialized/NotifyCollectionChangedEventArgs.xml index 33cf7483ef1..e9f7b60f275 100644 --- a/xml/System.Collections.Specialized/NotifyCollectionChangedEventArgs.xml +++ b/xml/System.Collections.Specialized/NotifyCollectionChangedEventArgs.xml @@ -388,7 +388,7 @@ The index where the change occurred. Initializes a new instance of the class that describes a one-item change. To be added. - If is not Reset, Add, or Remove, or if is Reset and either is not null or is not -1. + If is not Reset, Add, or Remove, or if is Reset and either is not null or is not -1. diff --git a/xml/System.Collections/IEqualityComparer.xml b/xml/System.Collections/IEqualityComparer.xml index 55dacf16285..c963b72787b 100644 --- a/xml/System.Collections/IEqualityComparer.xml +++ b/xml/System.Collections/IEqualityComparer.xml @@ -51,16 +51,16 @@ Defines methods to support the comparison of objects for equality. - interface. In the .NET Framework, constructors of the , , and collection types accept this interface. +## Remarks + +This interface allows the implementation of customized equality comparison for collections. That is, you can create your own definition of equality, and specify that this definition be used with a collection type that accepts the interface. In the .NET Framework, constructors of the , , and collection types accept this interface. + +For the generic version of this interface, see . + +The `IEqualityComparer` interface supports only equality comparisons. Customization of comparisons for sorting and ordering is provided by the interface. -For the generic version of this interface, see . - -The `IEqualityComparer` interface supports only equality comparisons. Customization of comparisons for sorting and ordering is provided by the interface. - ]]> @@ -118,27 +118,27 @@ The `IEqualityComparer` interface supports only equality comparisons. Customizat if the specified objects are equal; otherwise, . - . In this example, the method is used to determine whether two objects are equal, based on the provided . - + . In this example, the method is used to determine whether two objects are equal, based on the provided . + :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR_System/system.Collections.Hashtable_ctor/CPP/hashtable_ctor.cpp" id="Snippet2"::: :::code language="csharp" source="~/snippets/csharp/System.Collections/Hashtable/.ctor/hashtable_ctor.cs" id="Snippet2"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR_System/system.Collections.Hashtable_ctor/VB/hashtable_ctor.vb" id="Snippet2"::: - + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR_System/system.Collections.Hashtable_ctor/VB/hashtable_ctor.vb" id="Snippet2"::: + ]]> and are of different types and neither one can handle comparisons with the other. - The method is reflexive, symmetric, and transitive. That is, it returns if used to compare an object with itself; for two objects and if it is for and ; and for two objects and z if it is for and and also for and z. - + The method is reflexive, symmetric, and transitive. That is, it returns if used to compare an object with itself; for two objects and if it is for and ; and for two objects and z if it is for and and also for and z. + Implementations are required to ensure that if the method returns for two objects and , then the value returned by the method for must equal the value returned for . @@ -188,20 +188,18 @@ The `IEqualityComparer` interface supports only equality comparisons. Customizat Returns a hash code for the specified object. A hash code for the specified object. - method. - - - -## Examples - The following code example demonstrates the implementation of a case-insensitive . In this example, the method returns the hash code provided by the type. - + method. + +## Examples + The following code example demonstrates the implementation of a case-insensitive . In this example, the method returns the hash code provided by the type. + :::code language="cpp" source="~/snippets/cpp/VS_Snippets_CLR_System/system.Collections.Hashtable_ctor/CPP/hashtable_ctor.cpp" id="Snippet2"::: :::code language="csharp" source="~/snippets/csharp/System.Collections/Hashtable/.ctor/hashtable_ctor.cs" id="Snippet2"::: - :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR_System/system.Collections.Hashtable_ctor/VB/hashtable_ctor.vb" id="Snippet2"::: - + :::code language="vb" source="~/snippets/visualbasic/VS_Snippets_CLR_System/system.Collections.Hashtable_ctor/VB/hashtable_ctor.vb" id="Snippet2"::: + ]]> The type of is a reference type and is . diff --git a/xml/System.Runtime.Intrinsics.Arm/Sve.xml b/xml/System.Runtime.Intrinsics.Arm/Sve.xml index cba1fba02e8..f9ff47d3d49 100644 --- a/xml/System.Runtime.Intrinsics.Arm/Sve.xml +++ b/xml/System.Runtime.Intrinsics.Arm/Sve.xml @@ -232,7 +232,7 @@ To be added. To be added. - svbool_t svacgt[_f64](svbool_t pg, svfloat64_t op1, svfloat64_t op2) + svbool_t svacgt<see href="svbool_t pg, svfloat64_t op1, svfloat64_t op2">_f64</see> FACGT Presult.D, Pg/Z, Zop1.D, Zop2.D To be added. @@ -262,7 +262,7 @@ To be added. To be added. - svbool_t svacgt[_f32](svbool_t pg, svfloat32_t op1, svfloat32_t op2) + svbool_t svacgt<see href="svbool_t pg, svfloat32_t op1, svfloat32_t op2">_f32</see> FACGT Presult.S, Pg/Z, Zop1.S, Zop2.S To be added. @@ -292,7 +292,7 @@ To be added. To be added. - svbool_t svacge[_f64](svbool_t pg, svfloat64_t op1, svfloat64_t op2) + svbool_t svacge<see href="svbool_t pg, svfloat64_t op1, svfloat64_t op2">_f64</see> FACGE Presult.D, Pg/Z, Zop1.D, Zop2.D To be added. @@ -322,7 +322,7 @@ To be added. To be added. - svbool_t svacge[_f32](svbool_t pg, svfloat32_t op1, svfloat32_t op2) + svbool_t svacge<see href="svbool_t pg, svfloat32_t op1, svfloat32_t op2">_f32</see> FACGE Presult.S, Pg/Z, Zop1.S, Zop2.S To be added. @@ -352,7 +352,7 @@ To be added. To be added. - svbool_t svaclt[_f64](svbool_t pg, svfloat64_t op1, svfloat64_t op2) + svbool_t svaclt<see href="svbool_t pg, svfloat64_t op1, svfloat64_t op2">_f64</see> FACLT Presult.D, Pg/Z, Zop1.D, Zop2.D To be added. @@ -382,7 +382,7 @@ To be added. To be added. - svbool_t svaclt[_f32](svbool_t pg, svfloat32_t op1, svfloat32_t op2) + svbool_t svaclt<see href="svbool_t pg, svfloat32_t op1, svfloat32_t op2">_f32</see> FACLT Presult.S, Pg/Z, Zop1.S, Zop2.S To be added. @@ -412,7 +412,7 @@ To be added. To be added. - svbool_t svacle[_f64](svbool_t pg, svfloat64_t op1, svfloat64_t op2) + svbool_t svacle<see href="svbool_t pg, svfloat64_t op1, svfloat64_t op2">_f64</see> FACLE Presult.D, Pg/Z, Zop1.D, Zop2.D To be added. @@ -442,7 +442,7 @@ To be added. To be added. - svbool_t svacle[_f32](svbool_t pg, svfloat32_t op1, svfloat32_t op2) + svbool_t svacle<see href="svbool_t pg, svfloat32_t op1, svfloat32_t op2">_f32</see> FACLE Presult.S, Pg/Z, Zop1.S, Zop2.S To be added. @@ -1109,7 +1109,7 @@ To be added. - uint64_t svaddv[_u8](svbool_t pg, svuint8_t op) + uint64_t svaddv<see href="svbool_t pg, svuint8_t op">_u8</see> UADDV Dresult, Pg, Zop.B To be added. @@ -1137,7 +1137,7 @@ To be added. - float64_t svaddv[_f64](svbool_t pg, svfloat64_t op) + float64_t svaddv<see href="svbool_t pg, svfloat64_t op">_f64</see> FADDV Dresult, Pg, Zop.D To be added. @@ -1165,7 +1165,7 @@ To be added. - int64_t svaddv[_s16](svbool_t pg, svint16_t op) + int64_t svaddv<see href="svbool_t pg, svint16_t op">_s16</see> SADDV Dresult, Pg, Zop.H To be added. @@ -1193,7 +1193,7 @@ To be added. - int64_t svaddv[_s32](svbool_t pg, svint32_t op) + int64_t svaddv<see href="svbool_t pg, svint32_t op">_s32</see> SADDV Dresult, Pg, Zop.S To be added. @@ -1221,7 +1221,7 @@ To be added. - int64_t svaddv[_s64](svbool_t pg, svint64_t op) + int64_t svaddv<see href="svbool_t pg, svint64_t op">_s64</see> UADDV Dresult, Pg, Zop.D To be added. @@ -1249,7 +1249,7 @@ To be added. - int64_t svaddv[_s8](svbool_t pg, svint8_t op) + int64_t svaddv<see href="svbool_t pg, svint8_t op">_s8</see> SADDV Dresult, Pg, Zop.B To be added. @@ -1277,7 +1277,7 @@ To be added. - float32_t svaddv[_f32](svbool_t pg, svfloat32_t op) + float32_t svaddv<see href="svbool_t pg, svfloat32_t op">_f32</see> FADDV Sresult, Pg, Zop.S To be added. @@ -1305,7 +1305,7 @@ To be added. - uint64_t svaddv[_u16](svbool_t pg, svuint16_t op) + uint64_t svaddv<see href="svbool_t pg, svuint16_t op">_u16</see> UADDV Dresult, Pg, Zop.H To be added. @@ -1333,7 +1333,7 @@ To be added. - uint64_t svaddv[_u32](svbool_t pg, svuint32_t op) + uint64_t svaddv<see href="svbool_t pg, svuint32_t op">_u32</see> UADDV Dresult, Pg, Zop.S To be added. @@ -1361,7 +1361,7 @@ To be added. - uint64_t svaddv[_u64](svbool_t pg, svuint64_t op) + uint64_t svaddv<see href="svbool_t pg, svuint64_t op">_u64</see> UADDV Dresult, Pg, Zop.D To be added. @@ -1474,7 +1474,7 @@ To be added. To be added. - svuint8_t svqadd[_u8](svuint8_t op1, svuint8_t op2) + svuint8_t svqadd<see href="svuint8_t op1, svuint8_t op2">_u8</see> UQADD Zresult.B, Zop1.B, Zop2.B To be added. @@ -1504,7 +1504,7 @@ To be added. To be added. - svint16_t svqadd[_s16](svint16_t op1, svint16_t op2) + svint16_t svqadd<see href="svint16_t op1, svint16_t op2">_s16</see> SQADD Zresult.H, Zop1.H, Zop2.H To be added. @@ -1534,7 +1534,7 @@ To be added. To be added. - svint32_t svqadd[_s32](svint32_t op1, svint32_t op2) + svint32_t svqadd<see href="svint32_t op1, svint32_t op2">_s32</see> SQADD Zresult.S, Zop1.S, Zop2.S To be added. @@ -1564,7 +1564,7 @@ To be added. To be added. - svint64_t svqadd[_s64](svint64_t op1, svint64_t op2) + svint64_t svqadd<see href="svint64_t op1, svint64_t op2">_s64</see> SQADD Zresult.D, Zop1.D, Zop2.D To be added. @@ -1594,7 +1594,7 @@ To be added. To be added. - svint8_t svqadd[_s8](svint8_t op1, svint8_t op2) + svint8_t svqadd<see href="svint8_t op1, svint8_t op2">_s8</see> SQADD Zresult.B, Zop1.B, Zop2.B To be added. @@ -1624,7 +1624,7 @@ To be added. To be added. - svuint16_t svqadd[_u16](svuint16_t op1, svuint16_t op2) + svuint16_t svqadd<see href="svuint16_t op1, svuint16_t op2">_u16</see> UQADD Zresult.H, Zop1.H, Zop2.H To be added. @@ -1654,7 +1654,7 @@ To be added. To be added. - svuint32_t svqadd[_u32](svuint32_t op1, svuint32_t op2) + svuint32_t svqadd<see href="svuint32_t op1, svuint32_t op2">_u32</see> UQADD Zresult.S, Zop1.S, Zop2.S To be added. @@ -1684,7 +1684,7 @@ To be added. To be added. - svuint64_t svqadd[_u64](svuint64_t op1, svuint64_t op2) + svuint64_t svqadd<see href="svuint64_t op1, svuint64_t op2">_u64</see> UQADD Zresult.D, Zop1.D, Zop2.D To be added. @@ -1714,7 +1714,7 @@ To be added. To be added. - float64_t svadda[_f64](svbool_t pg, float64_t initial, svfloat64_t op) + float64_t svadda<see href="svbool_t pg, float64_t initial, svfloat64_t op">_f64</see> FADDA Dtied, Pg, Dtied, Zop.D To be added. @@ -1744,7 +1744,7 @@ To be added. To be added. - float32_t svadda[_f32](svbool_t pg, float32_t initial, svfloat32_t op) + float32_t svadda<see href="svbool_t pg, float32_t initial, svfloat32_t op">_f32</see> FADDA Stied, Pg, Stied, Zop.S To be added. @@ -2044,7 +2044,7 @@ To be added. - uint8_t svandv[_u8](svbool_t pg, svuint8_t op) + uint8_t svandv<see href="svbool_t pg, svuint8_t op">_u8</see> ANDV Bresult, Pg, Zop.B To be added. @@ -2072,7 +2072,7 @@ To be added. - int16_t svandv[_s16](svbool_t pg, svint16_t op) + int16_t svandv<see href="svbool_t pg, svint16_t op">_s16</see> ANDV Hresult, Pg, Zop.H To be added. @@ -2100,7 +2100,7 @@ To be added. - int32_t svandv[_s32](svbool_t pg, svint32_t op) + int32_t svandv<see href="svbool_t pg, svint32_t op">_s32</see> ANDV Sresult, Pg, Zop.S To be added. @@ -2128,7 +2128,7 @@ To be added. - int64_t svandv[_s64](svbool_t pg, svint64_t op) + int64_t svandv<see href="svbool_t pg, svint64_t op">_s64</see> ANDV Dresult, Pg, Zop.D To be added. @@ -2156,7 +2156,7 @@ To be added. - int8_t svandv[_s8](svbool_t pg, svint8_t op) + int8_t svandv<see href="svbool_t pg, svint8_t op">_s8</see> ANDV Bresult, Pg, Zop.B To be added. @@ -2184,7 +2184,7 @@ To be added. - uint16_t svandv[_u16](svbool_t pg, svuint16_t op) + uint16_t svandv<see href="svbool_t pg, svuint16_t op">_u16</see> ANDV Hresult, Pg, Zop.H To be added. @@ -2212,7 +2212,7 @@ To be added. - uint32_t svandv[_u32](svbool_t pg, svuint32_t op) + uint32_t svandv<see href="svbool_t pg, svuint32_t op">_u32</see> ANDV Sresult, Pg, Zop.S To be added. @@ -2240,7 +2240,7 @@ To be added. - uint64_t svandv[_u64](svbool_t pg, svuint64_t op) + uint64_t svandv<see href="svbool_t pg, svuint64_t op">_u64</see> ANDV Dresult, Pg, Zop.D To be added. @@ -2790,7 +2790,7 @@ To be added. To be added. - svfloat64_t svcompact[_f64](svbool_t pg, svfloat64_t op) + svfloat64_t svcompact<see href="svbool_t pg, svfloat64_t op">_f64</see> COMPACT Zresult.D, Pg, Zop.D To be added. @@ -2820,7 +2820,7 @@ To be added. To be added. - svint32_t svcompact[_s32](svbool_t pg, svint32_t op) + svint32_t svcompact<see href="svbool_t pg, svint32_t op">_s32</see> COMPACT Zresult.S, Pg, Zop.S To be added. @@ -2850,7 +2850,7 @@ To be added. To be added. - svint64_t svcompact[_s64](svbool_t pg, svint64_t op) + svint64_t svcompact<see href="svbool_t pg, svint64_t op">_s64</see> COMPACT Zresult.D, Pg, Zop.D To be added. @@ -2880,7 +2880,7 @@ To be added. To be added. - svfloat32_t svcompact[_f32](svbool_t pg, svfloat32_t op) + svfloat32_t svcompact<see href="svbool_t pg, svfloat32_t op">_f32</see> COMPACT Zresult.S, Pg, Zop.S To be added. @@ -2910,7 +2910,7 @@ To be added. To be added. - svuint32_t svcompact[_u32](svbool_t pg, svuint32_t op) + svuint32_t svcompact<see href="svbool_t pg, svuint32_t op">_u32</see> COMPACT Zresult.S, Pg, Zop.S To be added. @@ -2940,7 +2940,7 @@ To be added. To be added. - svuint64_t svcompact[_u64](svbool_t pg, svuint64_t op) + svuint64_t svcompact<see href="svbool_t pg, svuint64_t op">_u64</see> COMPACT Zresult.D, Pg, Zop.D To be added. @@ -2970,7 +2970,7 @@ To be added. To be added. - svbool_t svcmpeq[_u8](svbool_t pg, svuint8_t op1, svuint8_t op2) + svbool_t svcmpeq<see href="svbool_t pg, svuint8_t op1, svuint8_t op2">_u8</see> CMPEQ Presult.B, Pg/Z, Zop1.B, Zop2.B To be added. @@ -3000,7 +3000,7 @@ To be added. To be added. - svbool_t svcmpeq[_f64](svbool_t pg, svfloat64_t op1, svfloat64_t op2) + svbool_t svcmpeq<see href="svbool_t pg, svfloat64_t op1, svfloat64_t op2">_f64</see> FCMEQ Presult.D, Pg/Z, Zop1.D, Zop2.D To be added. @@ -3030,7 +3030,7 @@ To be added. To be added. - svbool_t svcmpeq[_s16](svbool_t pg, svint16_t op1, svint16_t op2) + svbool_t svcmpeq<see href="svbool_t pg, svint16_t op1, svint16_t op2">_s16</see> CMPEQ Presult.H, Pg/Z, Zop1.H, Zop2.H To be added. @@ -3060,7 +3060,7 @@ To be added. To be added. - svbool_t svcmpeq_wide[_s16](svbool_t pg, svint16_t op1, svint64_t op2) + svbool_t svcmpeq_wide<see href="svbool_t pg, svint16_t op1, svint64_t op2">_s16</see> CMPEQ Presult.H, Pg/Z, Zop1.H, Zop2.D To be added. @@ -3090,7 +3090,7 @@ To be added. To be added. - svbool_t svcmpeq[_s32](svbool_t pg, svint32_t op1, svint32_t op2) + svbool_t svcmpeq<see href="svbool_t pg, svint32_t op1, svint32_t op2">_s32</see> CMPEQ Presult.S, Pg/Z, Zop1.S, Zop2.S To be added. @@ -3120,7 +3120,7 @@ To be added. To be added. - svbool_t svcmpeq_wide[_s32](svbool_t pg, svint32_t op1, svint64_t op2) + svbool_t svcmpeq_wide<see href="svbool_t pg, svint32_t op1, svint64_t op2">_s32</see> CMPEQ Presult.S, Pg/Z, Zop1.S, Zop2.D To be added. @@ -3150,7 +3150,7 @@ To be added. To be added. - svbool_t svcmpeq[_s64](svbool_t pg, svint64_t op1, svint64_t op2) + svbool_t svcmpeq<see href="svbool_t pg, svint64_t op1, svint64_t op2">_s64</see> CMPEQ Presult.D, Pg/Z, Zop1.D, Zop2.D To be added. @@ -3180,7 +3180,7 @@ To be added. To be added. - svbool_t svcmpeq_wide[_s8](svbool_t pg, svint8_t op1, svint64_t op2) + svbool_t svcmpeq_wide<see href="svbool_t pg, svint8_t op1, svint64_t op2">_s8</see> CMPEQ Presult.B, Pg/Z, Zop1.B, Zop2.D To be added. @@ -3210,7 +3210,7 @@ To be added. To be added. - svbool_t svcmpeq[_s8](svbool_t pg, svint8_t op1, svint8_t op2) + svbool_t svcmpeq<see href="svbool_t pg, svint8_t op1, svint8_t op2">_s8</see> CMPEQ Presult.B, Pg/Z, Zop1.B, Zop2.B To be added. @@ -3240,7 +3240,7 @@ To be added. To be added. - svbool_t svcmpeq[_f32](svbool_t pg, svfloat32_t op1, svfloat32_t op2) + svbool_t svcmpeq<see href="svbool_t pg, svfloat32_t op1, svfloat32_t op2">_f32</see> FCMEQ Presult.S, Pg/Z, Zop1.S, Zop2.S To be added. @@ -3270,7 +3270,7 @@ To be added. To be added. - svbool_t svcmpeq[_u16](svbool_t pg, svuint16_t op1, svuint16_t op2) + svbool_t svcmpeq<see href="svbool_t pg, svuint16_t op1, svuint16_t op2">_u16</see> CMPEQ Presult.H, Pg/Z, Zop1.H, Zop2.H To be added. @@ -3300,7 +3300,7 @@ To be added. To be added. - svbool_t svcmpeq[_u32](svbool_t pg, svuint32_t op1, svuint32_t op2) + svbool_t svcmpeq<see href="svbool_t pg, svuint32_t op1, svuint32_t op2">_u32</see> CMPEQ Presult.S, Pg/Z, Zop1.S, Zop2.S To be added. @@ -3330,7 +3330,7 @@ To be added. To be added. - svbool_t svcmpeq[_u64](svbool_t pg, svuint64_t op1, svuint64_t op2) + svbool_t svcmpeq<see href="svbool_t pg, svuint64_t op1, svuint64_t op2">_u64</see> CMPEQ Presult.D, Pg/Z, Zop1.D, Zop2.D To be added. @@ -3360,7 +3360,7 @@ To be added. To be added. - svbool_t svcmpgt[_u8](svbool_t pg, svuint8_t op1, svuint8_t op2) + svbool_t svcmpgt<see href="svbool_t pg, svuint8_t op1, svuint8_t op2">_u8</see> CMPHI Presult.B, Pg/Z, Zop1.B, Zop2.B To be added. @@ -3390,7 +3390,7 @@ To be added. To be added. - svbool_t svcmpgt_wide[_u8](svbool_t pg, svuint8_t op1, svuint64_t op2) + svbool_t svcmpgt_wide<see href="svbool_t pg, svuint8_t op1, svuint64_t op2">_u8</see> CMPHI Presult.B, Pg/Z, Zop1.B, Zop2.D To be added. @@ -3420,7 +3420,7 @@ To be added. To be added. - svbool_t svcmpgt[_f64](svbool_t pg, svfloat64_t op1, svfloat64_t op2) + svbool_t svcmpgt<see href="svbool_t pg, svfloat64_t op1, svfloat64_t op2">_f64</see> FCMGT Presult.D, Pg/Z, Zop1.D, Zop2.D To be added. @@ -3450,7 +3450,7 @@ To be added. To be added. - svbool_t svcmpgt[_s16](svbool_t pg, svint16_t op1, svint16_t op2) + svbool_t svcmpgt<see href="svbool_t pg, svint16_t op1, svint16_t op2">_s16</see> CMPGT Presult.H, Pg/Z, Zop1.H, Zop2.H To be added. @@ -3480,7 +3480,7 @@ To be added. To be added. - svbool_t svcmpgt_wide[_s16](svbool_t pg, svint16_t op1, svint64_t op2) + svbool_t svcmpgt_wide<see href="svbool_t pg, svint16_t op1, svint64_t op2">_s16</see> CMPGT Presult.H, Pg/Z, Zop1.H, Zop2.D To be added. @@ -3510,7 +3510,7 @@ To be added. To be added. - svbool_t svcmpgt[_s32](svbool_t pg, svint32_t op1, svint32_t op2) + svbool_t svcmpgt<see href="svbool_t pg, svint32_t op1, svint32_t op2">_s32</see> CMPGT Presult.S, Pg/Z, Zop1.S, Zop2.S To be added. @@ -3540,7 +3540,7 @@ To be added. To be added. - svbool_t svcmpgt_wide[_s32](svbool_t pg, svint32_t op1, svint64_t op2) + svbool_t svcmpgt_wide<see href="svbool_t pg, svint32_t op1, svint64_t op2">_s32</see> CMPGT Presult.S, Pg/Z, Zop1.S, Zop2.D To be added. @@ -3570,7 +3570,7 @@ To be added. To be added. - svbool_t svcmpgt[_s64](svbool_t pg, svint64_t op1, svint64_t op2) + svbool_t svcmpgt<see href="svbool_t pg, svint64_t op1, svint64_t op2">_s64</see> CMPGT Presult.D, Pg/Z, Zop1.D, Zop2.D To be added. @@ -3600,7 +3600,7 @@ To be added. To be added. - svbool_t svcmpgt_wide[_s8](svbool_t pg, svint8_t op1, svint64_t op2) + svbool_t svcmpgt_wide<see href="svbool_t pg, svint8_t op1, svint64_t op2">_s8</see> CMPGT Presult.B, Pg/Z, Zop1.B, Zop2.D To be added. @@ -3630,7 +3630,7 @@ To be added. To be added. - svbool_t svcmpgt[_s8](svbool_t pg, svint8_t op1, svint8_t op2) + svbool_t svcmpgt<see href="svbool_t pg, svint8_t op1, svint8_t op2">_s8</see> CMPGT Presult.B, Pg/Z, Zop1.B, Zop2.B To be added. @@ -3660,7 +3660,7 @@ To be added. To be added. - svbool_t svcmpgt[_f32](svbool_t pg, svfloat32_t op1, svfloat32_t op2) + svbool_t svcmpgt<see href="svbool_t pg, svfloat32_t op1, svfloat32_t op2">_f32</see> FCMGT Presult.S, Pg/Z, Zop1.S, Zop2.S To be added. @@ -3690,7 +3690,7 @@ To be added. To be added. - svbool_t svcmpgt[_u16](svbool_t pg, svuint16_t op1, svuint16_t op2) + svbool_t svcmpgt<see href="svbool_t pg, svuint16_t op1, svuint16_t op2">_u16</see> CMPHI Presult.H, Pg/Z, Zop1.H, Zop2.H To be added. @@ -3720,7 +3720,7 @@ To be added. To be added. - svbool_t svcmpgt_wide[_u16](svbool_t pg, svuint16_t op1, svuint64_t op2) + svbool_t svcmpgt_wide<see href="svbool_t pg, svuint16_t op1, svuint64_t op2">_u16</see> CMPHI Presult.H, Pg/Z, Zop1.H, Zop2.D To be added. @@ -3750,7 +3750,7 @@ To be added. To be added. - svbool_t svcmpgt[_u32](svbool_t pg, svuint32_t op1, svuint32_t op2) + svbool_t svcmpgt<see href="svbool_t pg, svuint32_t op1, svuint32_t op2">_u32</see> CMPHI Presult.S, Pg/Z, Zop1.S, Zop2.S To be added. @@ -3780,7 +3780,7 @@ To be added. To be added. - svbool_t svcmpgt_wide[_u32](svbool_t pg, svuint32_t op1, svuint64_t op2) + svbool_t svcmpgt_wide<see href="svbool_t pg, svuint32_t op1, svuint64_t op2">_u32</see> CMPHI Presult.S, Pg/Z, Zop1.S, Zop2.D To be added. @@ -3810,7 +3810,7 @@ To be added. To be added. - svbool_t svcmpgt[_u64](svbool_t pg, svuint64_t op1, svuint64_t op2) + svbool_t svcmpgt<see href="svbool_t pg, svuint64_t op1, svuint64_t op2">_u64</see> CMPHI Presult.D, Pg/Z, Zop1.D, Zop2.D To be added. @@ -3840,7 +3840,7 @@ To be added. To be added. - svbool_t svcmpge[_u8](svbool_t pg, svuint8_t op1, svuint8_t op2) + svbool_t svcmpge<see href="svbool_t pg, svuint8_t op1, svuint8_t op2">_u8</see> CMPHS Presult.B, Pg/Z, Zop1.B, Zop2.B To be added. @@ -3870,7 +3870,7 @@ To be added. To be added. - svbool_t svcmpge_wide[_u8](svbool_t pg, svuint8_t op1, svuint64_t op2) + svbool_t svcmpge_wide<see href="svbool_t pg, svuint8_t op1, svuint64_t op2">_u8</see> CMPHS Presult.B, Pg/Z, Zop1.B, Zop2.D To be added. @@ -3900,7 +3900,7 @@ To be added. To be added. - svbool_t svcmpge[_f64](svbool_t pg, svfloat64_t op1, svfloat64_t op2) + svbool_t svcmpge<see href="svbool_t pg, svfloat64_t op1, svfloat64_t op2">_f64</see> FCMGE Presult.D, Pg/Z, Zop1.D, Zop2.D To be added. @@ -3930,7 +3930,7 @@ To be added. To be added. - svbool_t svcmpge[_s16](svbool_t pg, svint16_t op1, svint16_t op2) + svbool_t svcmpge<see href="svbool_t pg, svint16_t op1, svint16_t op2">_s16</see> CMPGE Presult.H, Pg/Z, Zop1.H, Zop2.H To be added. @@ -3960,7 +3960,7 @@ To be added. To be added. - svbool_t svcmpge_wide[_s16](svbool_t pg, svint16_t op1, svint64_t op2) + svbool_t svcmpge_wide<see href="svbool_t pg, svint16_t op1, svint64_t op2">_s16</see> CMPGE Presult.H, Pg/Z, Zop1.H, Zop2.D To be added. @@ -3990,7 +3990,7 @@ To be added. To be added. - svbool_t svcmpge[_s32](svbool_t pg, svint32_t op1, svint32_t op2) + svbool_t svcmpge<see href="svbool_t pg, svint32_t op1, svint32_t op2">_s32</see> CMPGE Presult.S, Pg/Z, Zop1.S, Zop2.S To be added. @@ -4020,7 +4020,7 @@ To be added. To be added. - svbool_t svcmpge_wide[_s32](svbool_t pg, svint32_t op1, svint64_t op2) + svbool_t svcmpge_wide<see href="svbool_t pg, svint32_t op1, svint64_t op2">_s32</see> CMPGE Presult.S, Pg/Z, Zop1.S, Zop2.D To be added. @@ -4050,7 +4050,7 @@ To be added. To be added. - svbool_t svcmpge[_s64](svbool_t pg, svint64_t op1, svint64_t op2) + svbool_t svcmpge<see href="svbool_t pg, svint64_t op1, svint64_t op2">_s64</see> CMPGE Presult.D, Pg/Z, Zop1.D, Zop2.D To be added. @@ -4080,7 +4080,7 @@ To be added. To be added. - svbool_t svcmpge_wide[_s8](svbool_t pg, svint8_t op1, svint64_t op2) + svbool_t svcmpge_wide<see href="svbool_t pg, svint8_t op1, svint64_t op2">_s8</see> CMPGE Presult.B, Pg/Z, Zop1.B, Zop2.D To be added. @@ -4110,7 +4110,7 @@ To be added. To be added. - svbool_t svcmpge[_s8](svbool_t pg, svint8_t op1, svint8_t op2) + svbool_t svcmpge<see href="svbool_t pg, svint8_t op1, svint8_t op2">_s8</see> CMPGE Presult.B, Pg/Z, Zop1.B, Zop2.B To be added. @@ -4140,7 +4140,7 @@ To be added. To be added. - svbool_t svcmpge[_f32](svbool_t pg, svfloat32_t op1, svfloat32_t op2) + svbool_t svcmpge<see href="svbool_t pg, svfloat32_t op1, svfloat32_t op2">_f32</see> FCMGE Presult.S, Pg/Z, Zop1.S, Zop2.S To be added. @@ -4170,7 +4170,7 @@ To be added. To be added. - svbool_t svcmpge[_u16](svbool_t pg, svuint16_t op1, svuint16_t op2) + svbool_t svcmpge<see href="svbool_t pg, svuint16_t op1, svuint16_t op2">_u16</see> CMPHS Presult.H, Pg/Z, Zop1.H, Zop2.H To be added. @@ -4200,7 +4200,7 @@ To be added. To be added. - svbool_t svcmpge_wide[_u16](svbool_t pg, svuint16_t op1, svuint64_t op2) + svbool_t svcmpge_wide<see href="svbool_t pg, svuint16_t op1, svuint64_t op2">_u16</see> CMPHS Presult.H, Pg/Z, Zop1.H, Zop2.D To be added. @@ -4230,7 +4230,7 @@ To be added. To be added. - svbool_t svcmpge[_u32](svbool_t pg, svuint32_t op1, svuint32_t op2) + svbool_t svcmpge<see href="svbool_t pg, svuint32_t op1, svuint32_t op2">_u32</see> CMPHS Presult.S, Pg/Z, Zop1.S, Zop2.S To be added. @@ -4260,7 +4260,7 @@ To be added. To be added. - svbool_t svcmpge_wide[_u32](svbool_t pg, svuint32_t op1, svuint64_t op2) + svbool_t svcmpge_wide<see href="svbool_t pg, svuint32_t op1, svuint64_t op2">_u32</see> CMPHS Presult.S, Pg/Z, Zop1.S, Zop2.D To be added. @@ -4290,7 +4290,7 @@ To be added. To be added. - svbool_t svcmpge[_u64](svbool_t pg, svuint64_t op1, svuint64_t op2) + svbool_t svcmpge<see href="svbool_t pg, svuint64_t op1, svuint64_t op2">_u64</see> CMPHS Presult.D, Pg/Z, Zop1.D, Zop2.D To be added. @@ -4320,7 +4320,7 @@ To be added. To be added. - svbool_t svcmplt[_u8](svbool_t pg, svuint8_t op1, svuint8_t op2) + svbool_t svcmplt<see href="svbool_t pg, svuint8_t op1, svuint8_t op2">_u8</see> CMPHI Presult.B, Pg/Z, Zop2.B, Zop1.B To be added. @@ -4350,7 +4350,7 @@ To be added. To be added. - svbool_t svcmplt_wide[_u8](svbool_t pg, svuint8_t op1, svuint64_t op2) + svbool_t svcmplt_wide<see href="svbool_t pg, svuint8_t op1, svuint64_t op2">_u8</see> CMPLO Presult.B, Pg/Z, Zop1.B, Zop2.D To be added. @@ -4380,7 +4380,7 @@ To be added. To be added. - svbool_t svcmplt[_f64](svbool_t pg, svfloat64_t op1, svfloat64_t op2) + svbool_t svcmplt<see href="svbool_t pg, svfloat64_t op1, svfloat64_t op2">_f64</see> FCMGT Presult.D, Pg/Z, Zop2.D, Zop1.D To be added. @@ -4410,7 +4410,7 @@ To be added. To be added. - svbool_t svcmplt[_s16](svbool_t pg, svint16_t op1, svint16_t op2) + svbool_t svcmplt<see href="svbool_t pg, svint16_t op1, svint16_t op2">_s16</see> CMPGT Presult.H, Pg/Z, Zop2.H, Zop1.H To be added. @@ -4440,7 +4440,7 @@ To be added. To be added. - svbool_t svcmplt_wide[_s16](svbool_t pg, svint16_t op1, svint64_t op2) + svbool_t svcmplt_wide<see href="svbool_t pg, svint16_t op1, svint64_t op2">_s16</see> CMPLT Presult.H, Pg/Z, Zop1.H, Zop2.D To be added. @@ -4470,7 +4470,7 @@ To be added. To be added. - svbool_t svcmplt[_s32](svbool_t pg, svint32_t op1, svint32_t op2) + svbool_t svcmplt<see href="svbool_t pg, svint32_t op1, svint32_t op2">_s32</see> CMPGT Presult.S, Pg/Z, Zop2.S, Zop1.S To be added. @@ -4500,7 +4500,7 @@ To be added. To be added. - svbool_t svcmplt_wide[_s32](svbool_t pg, svint32_t op1, svint64_t op2) + svbool_t svcmplt_wide<see href="svbool_t pg, svint32_t op1, svint64_t op2">_s32</see> CMPLT Presult.S, Pg/Z, Zop1.S, Zop2.D To be added. @@ -4530,7 +4530,7 @@ To be added. To be added. - svbool_t svcmplt[_s64](svbool_t pg, svint64_t op1, svint64_t op2) + svbool_t svcmplt<see href="svbool_t pg, svint64_t op1, svint64_t op2">_s64</see> CMPGT Presult.D, Pg/Z, Zop2.D, Zop1.D To be added. @@ -4560,7 +4560,7 @@ To be added. To be added. - svbool_t svcmplt_wide[_s8](svbool_t pg, svint8_t op1, svint64_t op2) + svbool_t svcmplt_wide<see href="svbool_t pg, svint8_t op1, svint64_t op2">_s8</see> CMPLT Presult.B, Pg/Z, Zop1.B, Zop2.D To be added. @@ -4590,7 +4590,7 @@ To be added. To be added. - svbool_t svcmplt[_s8](svbool_t pg, svint8_t op1, svint8_t op2) + svbool_t svcmplt<see href="svbool_t pg, svint8_t op1, svint8_t op2">_s8</see> CMPGT Presult.B, Pg/Z, Zop2.B, Zop1.B To be added. @@ -4620,7 +4620,7 @@ To be added. To be added. - svbool_t svcmplt[_f32](svbool_t pg, svfloat32_t op1, svfloat32_t op2) + svbool_t svcmplt<see href="svbool_t pg, svfloat32_t op1, svfloat32_t op2">_f32</see> FCMGT Presult.S, Pg/Z, Zop2.S, Zop1.S To be added. @@ -4650,7 +4650,7 @@ To be added. To be added. - svbool_t svcmplt[_u16](svbool_t pg, svuint16_t op1, svuint16_t op2) + svbool_t svcmplt<see href="svbool_t pg, svuint16_t op1, svuint16_t op2">_u16</see> CMPHI Presult.H, Pg/Z, Zop2.H, Zop1.H To be added. @@ -4680,7 +4680,7 @@ To be added. To be added. - svbool_t svcmplt_wide[_u16](svbool_t pg, svuint16_t op1, svuint64_t op2) + svbool_t svcmplt_wide<see href="svbool_t pg, svuint16_t op1, svuint64_t op2">_u16</see> CMPLO Presult.H, Pg/Z, Zop1.H, Zop2.D To be added. @@ -4710,7 +4710,7 @@ To be added. To be added. - svbool_t svcmplt[_u32](svbool_t pg, svuint32_t op1, svuint32_t op2) + svbool_t svcmplt<see href="svbool_t pg, svuint32_t op1, svuint32_t op2">_u32</see> CMPHI Presult.S, Pg/Z, Zop2.S, Zop1.S To be added. @@ -4740,7 +4740,7 @@ To be added. To be added. - svbool_t svcmplt_wide[_u32](svbool_t pg, svuint32_t op1, svuint64_t op2) + svbool_t svcmplt_wide<see href="svbool_t pg, svuint32_t op1, svuint64_t op2">_u32</see> CMPLO Presult.S, Pg/Z, Zop1.S, Zop2.D To be added. @@ -4770,7 +4770,7 @@ To be added. To be added. - svbool_t svcmplt[_u64](svbool_t pg, svuint64_t op1, svuint64_t op2) + svbool_t svcmplt<see href="svbool_t pg, svuint64_t op1, svuint64_t op2">_u64</see> CMPHI Presult.D, Pg/Z, Zop2.D, Zop1.D To be added. @@ -4800,7 +4800,7 @@ To be added. To be added. - svbool_t svcmple[_u8](svbool_t pg, svuint8_t op1, svuint8_t op2) + svbool_t svcmple<see href="svbool_t pg, svuint8_t op1, svuint8_t op2">_u8</see> CMPHS Presult.B, Pg/Z, Zop2.B, Zop1.B To be added. @@ -4830,7 +4830,7 @@ To be added. To be added. - svbool_t svcmple_wide[_u8](svbool_t pg, svuint8_t op1, svuint64_t op2) + svbool_t svcmple_wide<see href="svbool_t pg, svuint8_t op1, svuint64_t op2">_u8</see> CMPLS Presult.B, Pg/Z, Zop1.B, Zop2.D To be added. @@ -4860,7 +4860,7 @@ To be added. To be added. - svbool_t svcmple[_f64](svbool_t pg, svfloat64_t op1, svfloat64_t op2) + svbool_t svcmple<see href="svbool_t pg, svfloat64_t op1, svfloat64_t op2">_f64</see> FCMGE Presult.D, Pg/Z, Zop2.D, Zop1.D To be added. @@ -4890,7 +4890,7 @@ To be added. To be added. - svbool_t svcmple[_s16](svbool_t pg, svint16_t op1, svint16_t op2) + svbool_t svcmple<see href="svbool_t pg, svint16_t op1, svint16_t op2">_s16</see> CMPGE Presult.H, Pg/Z, Zop2.H, Zop1.H To be added. @@ -4920,7 +4920,7 @@ To be added. To be added. - svbool_t svcmple_wide[_s16](svbool_t pg, svint16_t op1, svint64_t op2) + svbool_t svcmple_wide<see href="svbool_t pg, svint16_t op1, svint64_t op2">_s16</see> CMPLE Presult.H, Pg/Z, Zop1.H, Zop2.D To be added. @@ -4950,7 +4950,7 @@ To be added. To be added. - svbool_t svcmple[_s32](svbool_t pg, svint32_t op1, svint32_t op2) + svbool_t svcmple<see href="svbool_t pg, svint32_t op1, svint32_t op2">_s32</see> CMPGE Presult.S, Pg/Z, Zop2.S, Zop1.S To be added. @@ -4980,7 +4980,7 @@ To be added. To be added. - svbool_t svcmple_wide[_s32](svbool_t pg, svint32_t op1, svint64_t op2) + svbool_t svcmple_wide<see href="svbool_t pg, svint32_t op1, svint64_t op2">_s32</see> CMPLE Presult.S, Pg/Z, Zop1.S, Zop2.D To be added. @@ -5010,7 +5010,7 @@ To be added. To be added. - svbool_t svcmple[_s64](svbool_t pg, svint64_t op1, svint64_t op2) + svbool_t svcmple<see href="svbool_t pg, svint64_t op1, svint64_t op2">_s64</see> CMPGE Presult.D, Pg/Z, Zop2.D, Zop1.D To be added. @@ -5040,7 +5040,7 @@ To be added. To be added. - svbool_t svcmple_wide[_s8](svbool_t pg, svint8_t op1, svint64_t op2) + svbool_t svcmple_wide<see href="svbool_t pg, svint8_t op1, svint64_t op2">_s8</see> CMPLE Presult.B, Pg/Z, Zop1.B, Zop2.D To be added. @@ -5070,7 +5070,7 @@ To be added. To be added. - svbool_t svcmple[_s8](svbool_t pg, svint8_t op1, svint8_t op2) + svbool_t svcmple<see href="svbool_t pg, svint8_t op1, svint8_t op2">_s8</see> CMPGE Presult.B, Pg/Z, Zop2.B, Zop1.B To be added. @@ -5100,7 +5100,7 @@ To be added. To be added. - svbool_t svcmple[_f32](svbool_t pg, svfloat32_t op1, svfloat32_t op2) + svbool_t svcmple<see href="svbool_t pg, svfloat32_t op1, svfloat32_t op2">_f32</see> FCMGE Presult.S, Pg/Z, Zop2.S, Zop1.S To be added. @@ -5130,7 +5130,7 @@ To be added. To be added. - svbool_t svcmple[_u16](svbool_t pg, svuint16_t op1, svuint16_t op2) + svbool_t svcmple<see href="svbool_t pg, svuint16_t op1, svuint16_t op2">_u16</see> CMPHS Presult.H, Pg/Z, Zop2.H, Zop1.H To be added. @@ -5160,7 +5160,7 @@ To be added. To be added. - svbool_t svcmple_wide[_u16](svbool_t pg, svuint16_t op1, svuint64_t op2) + svbool_t svcmple_wide<see href="svbool_t pg, svuint16_t op1, svuint64_t op2">_u16</see> CMPLS Presult.H, Pg/Z, Zop1.H, Zop2.D To be added. @@ -5190,7 +5190,7 @@ To be added. To be added. - svbool_t svcmple[_u32](svbool_t pg, svuint32_t op1, svuint32_t op2) + svbool_t svcmple<see href="svbool_t pg, svuint32_t op1, svuint32_t op2">_u32</see> CMPHS Presult.S, Pg/Z, Zop2.S, Zop1.S To be added. @@ -5220,7 +5220,7 @@ To be added. To be added. - svbool_t svcmple_wide[_u32](svbool_t pg, svuint32_t op1, svuint64_t op2) + svbool_t svcmple_wide<see href="svbool_t pg, svuint32_t op1, svuint64_t op2">_u32</see> CMPLS Presult.S, Pg/Z, Zop1.S, Zop2.D To be added. @@ -5250,7 +5250,7 @@ To be added. To be added. - svbool_t svcmple[_u64](svbool_t pg, svuint64_t op1, svuint64_t op2) + svbool_t svcmple<see href="svbool_t pg, svuint64_t op1, svuint64_t op2">_u64</see> CMPHS Presult.D, Pg/Z, Zop2.D, Zop1.D To be added. @@ -5280,7 +5280,7 @@ To be added. To be added. - svbool_t svcmpne[_u8](svbool_t pg, svuint8_t op1, svuint8_t op2) + svbool_t svcmpne<see href="svbool_t pg, svuint8_t op1, svuint8_t op2">_u8</see> CMPNE Presult.B, Pg/Z, Zop1.B, Zop2.B To be added. @@ -5310,7 +5310,7 @@ To be added. To be added. - svbool_t svcmpne[_f64](svbool_t pg, svfloat64_t op1, svfloat64_t op2) + svbool_t svcmpne<see href="svbool_t pg, svfloat64_t op1, svfloat64_t op2">_f64</see> FCMNE Presult.D, Pg/Z, Zop1.D, Zop2.D To be added. @@ -5340,7 +5340,7 @@ To be added. To be added. - svbool_t svcmpne[_s16](svbool_t pg, svint16_t op1, svint16_t op2) + svbool_t svcmpne<see href="svbool_t pg, svint16_t op1, svint16_t op2">_s16</see> CMPNE Presult.H, Pg/Z, Zop1.H, Zop2.H To be added. @@ -5370,7 +5370,7 @@ To be added. To be added. - svbool_t svcmpne_wide[_s16](svbool_t pg, svint16_t op1, svint64_t op2) + svbool_t svcmpne_wide<see href="svbool_t pg, svint16_t op1, svint64_t op2">_s16</see> CMPNE Presult.H, Pg/Z, Zop1.H, Zop2.D To be added. @@ -5400,7 +5400,7 @@ To be added. To be added. - svbool_t svcmpne[_s32](svbool_t pg, svint32_t op1, svint32_t op2) + svbool_t svcmpne<see href="svbool_t pg, svint32_t op1, svint32_t op2">_s32</see> CMPNE Presult.S, Pg/Z, Zop1.S, Zop2.S To be added. @@ -5430,7 +5430,7 @@ To be added. To be added. - svbool_t svcmpne_wide[_s32](svbool_t pg, svint32_t op1, svint64_t op2) + svbool_t svcmpne_wide<see href="svbool_t pg, svint32_t op1, svint64_t op2">_s32</see> CMPNE Presult.S, Pg/Z, Zop1.S, Zop2.D To be added. @@ -5460,7 +5460,7 @@ To be added. To be added. - svbool_t svcmpne[_s64](svbool_t pg, svint64_t op1, svint64_t op2) + svbool_t svcmpne<see href="svbool_t pg, svint64_t op1, svint64_t op2">_s64</see> CMPNE Presult.D, Pg/Z, Zop1.D, Zop2.D To be added. @@ -5490,7 +5490,7 @@ To be added. To be added. - svbool_t svcmpne_wide[_s8](svbool_t pg, svint8_t op1, svint64_t op2) + svbool_t svcmpne_wide<see href="svbool_t pg, svint8_t op1, svint64_t op2">_s8</see> CMPNE Presult.B, Pg/Z, Zop1.B, Zop2.D To be added. @@ -5520,7 +5520,7 @@ To be added. To be added. - svbool_t svcmpne[_s8](svbool_t pg, svint8_t op1, svint8_t op2) + svbool_t svcmpne<see href="svbool_t pg, svint8_t op1, svint8_t op2">_s8</see> CMPNE Presult.B, Pg/Z, Zop1.B, Zop2.B To be added. @@ -5550,7 +5550,7 @@ To be added. To be added. - svbool_t svcmpne[_f32](svbool_t pg, svfloat32_t op1, svfloat32_t op2) + svbool_t svcmpne<see href="svbool_t pg, svfloat32_t op1, svfloat32_t op2">_f32</see> FCMNE Presult.S, Pg/Z, Zop1.S, Zop2.S To be added. @@ -5580,7 +5580,7 @@ To be added. To be added. - svbool_t svcmpne[_u16](svbool_t pg, svuint16_t op1, svuint16_t op2) + svbool_t svcmpne<see href="svbool_t pg, svuint16_t op1, svuint16_t op2">_u16</see> CMPNE Presult.H, Pg/Z, Zop1.H, Zop2.H To be added. @@ -5610,7 +5610,7 @@ To be added. To be added. - svbool_t svcmpne[_u32](svbool_t pg, svuint32_t op1, svuint32_t op2) + svbool_t svcmpne<see href="svbool_t pg, svuint32_t op1, svuint32_t op2">_u32</see> CMPNE Presult.S, Pg/Z, Zop1.S, Zop2.S To be added. @@ -5640,7 +5640,7 @@ To be added. To be added. - svbool_t svcmpne[_u64](svbool_t pg, svuint64_t op1, svuint64_t op2) + svbool_t svcmpne<see href="svbool_t pg, svuint64_t op1, svuint64_t op2">_u64</see> CMPNE Presult.D, Pg/Z, Zop1.D, Zop2.D To be added. @@ -5670,7 +5670,7 @@ To be added. To be added. - svbool_t svcmpuo[_f64](svbool_t pg, svfloat64_t op1, svfloat64_t op2) + svbool_t svcmpuo<see href="svbool_t pg, svfloat64_t op1, svfloat64_t op2">_f64</see> FCMUO Presult.D, Pg/Z, Zop1.D, Zop2.D To be added. @@ -5700,7 +5700,7 @@ To be added. To be added. - svbool_t svcmpuo[_f32](svbool_t pg, svfloat32_t op1, svfloat32_t op2) + svbool_t svcmpuo<see href="svbool_t pg, svfloat32_t op1, svfloat32_t op2">_f32</see> FCMUO Presult.S, Pg/Z, Zop1.S, Zop2.S To be added. @@ -6212,7 +6212,7 @@ To be added. To be added. - uint8_t svclasta[_n_u8](svbool_t pg, uint8_t fallback, svuint8_t data) + uint8_t svclasta<see href="svbool_t pg, uint8_t fallback, svuint8_t data">_n_u8</see> CLASTA Wtied, Pg, Wtied, Zdata.B To be added. @@ -6244,7 +6244,7 @@ To be added. To be added. - svuint8_t svclasta[_u8](svbool_t pg, svuint8_t fallback, svuint8_t data) + svuint8_t svclasta<see href="svbool_t pg, svuint8_t fallback, svuint8_t data">_u8</see> CLASTA Btied, Pg, Btied, Zdata.B To be added. @@ -6276,7 +6276,7 @@ To be added. To be added. - float64_t svclasta[_n_f64](svbool_t pg, float64_t fallback, svfloat64_t data) + float64_t svclasta<see href="svbool_t pg, float64_t fallback, svfloat64_t data">_n_f64</see> CLASTA Dtied, Pg, Dtied, Zdata.D To be added. @@ -6308,7 +6308,7 @@ To be added. To be added. - svfloat64_t svclasta[_f64](svbool_t pg, svfloat64_t fallback, svfloat64_t data) + svfloat64_t svclasta<see href="svbool_t pg, svfloat64_t fallback, svfloat64_t data">_f64</see> CLASTA Dtied, Pg, Dtied, Zdata.D To be added. @@ -6340,7 +6340,7 @@ To be added. To be added. - int16_t svclasta[_n_s16](svbool_t pg, int16_t fallback, svint16_t data) + int16_t svclasta<see href="svbool_t pg, int16_t fallback, svint16_t data">_n_s16</see> CLASTA Wtied, Pg, Wtied, Zdata.H To be added. @@ -6372,7 +6372,7 @@ To be added. To be added. - svint16_t svclasta[_s16](svbool_t pg, svint16_t fallback, svint16_t data) + svint16_t svclasta<see href="svbool_t pg, svint16_t fallback, svint16_t data">_s16</see> CLASTA Htied, Pg, Htied, Zdata.H To be added. @@ -6404,7 +6404,7 @@ To be added. To be added. - int32_t svclasta[_n_s32](svbool_t pg, int32_t fallback, svint32_t data) + int32_t svclasta<see href="svbool_t pg, int32_t fallback, svint32_t data">_n_s32</see> CLASTA Wtied, Pg, Wtied, Zdata.S To be added. @@ -6436,7 +6436,7 @@ To be added. To be added. - svint32_t svclasta[_s32](svbool_t pg, svint32_t fallback, svint32_t data) + svint32_t svclasta<see href="svbool_t pg, svint32_t fallback, svint32_t data">_s32</see> CLASTA Stied, Pg, Stied, Zdata.S To be added. @@ -6468,7 +6468,7 @@ To be added. To be added. - int64_t svclasta[_n_s64](svbool_t pg, int64_t fallback, svint64_t data) + int64_t svclasta<see href="svbool_t pg, int64_t fallback, svint64_t data">_n_s64</see> CLASTA Xtied, Pg, Xtied, Zdata.D To be added. @@ -6500,7 +6500,7 @@ To be added. To be added. - svint64_t svclasta[_s64](svbool_t pg, svint64_t fallback, svint64_t data) + svint64_t svclasta<see href="svbool_t pg, svint64_t fallback, svint64_t data">_s64</see> CLASTA Dtied, Pg, Dtied, Zdata.D To be added. @@ -6532,7 +6532,7 @@ To be added. To be added. - svint8_t svclasta[_s8](svbool_t pg, svint8_t fallback, svint8_t data) + svint8_t svclasta<see href="svbool_t pg, svint8_t fallback, svint8_t data">_s8</see> CLASTA Btied, Pg, Btied, Zdata.B To be added. @@ -6564,7 +6564,7 @@ To be added. To be added. - int8_t svclasta[_n_s8](svbool_t pg, int8_t fallback, svint8_t data) + int8_t svclasta<see href="svbool_t pg, int8_t fallback, svint8_t data">_n_s8</see> CLASTA Wtied, Pg, Wtied, Zdata.B To be added. @@ -6596,7 +6596,7 @@ To be added. To be added. - svfloat32_t svclasta[_f32](svbool_t pg, svfloat32_t fallback, svfloat32_t data) + svfloat32_t svclasta<see href="svbool_t pg, svfloat32_t fallback, svfloat32_t data">_f32</see> CLASTA Stied, Pg, Stied, Zdata.S To be added. @@ -6628,7 +6628,7 @@ To be added. To be added. - float32_t svclasta[_n_f32](svbool_t pg, float32_t fallback, svfloat32_t data) + float32_t svclasta<see href="svbool_t pg, float32_t fallback, svfloat32_t data">_n_f32</see> CLASTA Stied, Pg, Stied, Zdata.S To be added. @@ -6660,7 +6660,7 @@ To be added. To be added. - svuint16_t svclasta[_u16](svbool_t pg, svuint16_t fallback, svuint16_t data) + svuint16_t svclasta<see href="svbool_t pg, svuint16_t fallback, svuint16_t data">_u16</see> CLASTA Htied, Pg, Htied, Zdata.H To be added. @@ -6692,7 +6692,7 @@ To be added. To be added. - uint16_t svclasta[_n_u16](svbool_t pg, uint16_t fallback, svuint16_t data) + uint16_t svclasta<see href="svbool_t pg, uint16_t fallback, svuint16_t data">_n_u16</see> CLASTA Wtied, Pg, Wtied, Zdata.H To be added. @@ -6724,7 +6724,7 @@ To be added. To be added. - svuint32_t svclasta[_u32](svbool_t pg, svuint32_t fallback, svuint32_t data) + svuint32_t svclasta<see href="svbool_t pg, svuint32_t fallback, svuint32_t data">_u32</see> CLASTA Stied, Pg, Stied, Zdata.S To be added. @@ -6756,7 +6756,7 @@ To be added. To be added. - uint32_t svclasta[_n_u32](svbool_t pg, uint32_t fallback, svuint32_t data) + uint32_t svclasta<see href="svbool_t pg, uint32_t fallback, svuint32_t data">_n_u32</see> CLASTA Wtied, Pg, Wtied, Zdata.S To be added. @@ -6788,7 +6788,7 @@ To be added. To be added. - svuint64_t svclasta[_u64](svbool_t pg, svuint64_t fallback, svuint64_t data) + svuint64_t svclasta<see href="svbool_t pg, svuint64_t fallback, svuint64_t data">_u64</see> CLASTA Dtied, Pg, Dtied, Zdata.D To be added. @@ -6820,7 +6820,7 @@ To be added. To be added. - uint64_t svclasta[_n_u64](svbool_t pg, uint64_t fallback, svuint64_t data) + uint64_t svclasta<see href="svbool_t pg, uint64_t fallback, svuint64_t data">_n_u64</see> CLASTA Xtied, Pg, Xtied, Zdata.D To be added. @@ -6852,7 +6852,7 @@ To be added. To be added. - svuint8_t svclasta[_u8](svbool_t pg, svuint8_t fallback, svuint8_t data) + svuint8_t svclasta<see href="svbool_t pg, svuint8_t fallback, svuint8_t data">_u8</see> CLASTA Ztied.B, Pg, Ztied.B, Zdata.B To be added. @@ -6884,7 +6884,7 @@ To be added. To be added. - svfloat64_t svclasta[_f64](svbool_t pg, svfloat64_t fallback, svfloat64_t data) + svfloat64_t svclasta<see href="svbool_t pg, svfloat64_t fallback, svfloat64_t data">_f64</see> CLASTA Ztied.D, Pg, Ztied.D, Zdata.D To be added. @@ -6916,7 +6916,7 @@ To be added. To be added. - svint16_t svclasta[_s16](svbool_t pg, svint16_t fallback, svint16_t data) + svint16_t svclasta<see href="svbool_t pg, svint16_t fallback, svint16_t data">_s16</see> CLASTA Ztied.H, Pg, Ztied.H, Zdata.H To be added. @@ -6948,7 +6948,7 @@ To be added. To be added. - svint32_t svclasta[_s32](svbool_t pg, svint32_t fallback, svint32_t data) + svint32_t svclasta<see href="svbool_t pg, svint32_t fallback, svint32_t data">_s32</see> CLASTA Ztied.S, Pg, Ztied.S, Zdata.S To be added. @@ -6980,7 +6980,7 @@ To be added. To be added. - svint64_t svclasta[_s64](svbool_t pg, svint64_t fallback, svint64_t data) + svint64_t svclasta<see href="svbool_t pg, svint64_t fallback, svint64_t data">_s64</see> CLASTA Ztied.D, Pg, Ztied.D, Zdata.D To be added. @@ -7012,7 +7012,7 @@ To be added. To be added. - svint8_t svclasta[_s8](svbool_t pg, svint8_t fallback, svint8_t data) + svint8_t svclasta<see href="svbool_t pg, svint8_t fallback, svint8_t data">_s8</see> CLASTA Ztied.B, Pg, Ztied.B, Zdata.B To be added. @@ -7044,7 +7044,7 @@ To be added. To be added. - svfloat32_t svclasta[_f32](svbool_t pg, svfloat32_t fallback, svfloat32_t data) + svfloat32_t svclasta<see href="svbool_t pg, svfloat32_t fallback, svfloat32_t data">_f32</see> CLASTA Ztied.S, Pg, Ztied.S, Zdata.S To be added. @@ -7076,7 +7076,7 @@ To be added. To be added. - svuint16_t svclasta[_u16](svbool_t pg, svuint16_t fallback, svuint16_t data) + svuint16_t svclasta<see href="svbool_t pg, svuint16_t fallback, svuint16_t data">_u16</see> CLASTA Ztied.H, Pg, Ztied.H, Zdata.H To be added. @@ -7108,7 +7108,7 @@ To be added. To be added. - svuint32_t svclasta[_u32](svbool_t pg, svuint32_t fallback, svuint32_t data) + svuint32_t svclasta<see href="svbool_t pg, svuint32_t fallback, svuint32_t data">_u32</see> CLASTA Ztied.S, Pg, Ztied.S, Zdata.S To be added. @@ -7140,7 +7140,7 @@ To be added. To be added. - svuint64_t svclasta[_u64](svbool_t pg, svuint64_t fallback, svuint64_t data) + svuint64_t svclasta<see href="svbool_t pg, svuint64_t fallback, svuint64_t data">_u64</see> CLASTA Ztied.D, Pg, Ztied.D, Zdata.D To be added. @@ -7172,7 +7172,7 @@ To be added. To be added. - uint8_t svclastb[_n_u8](svbool_t pg, uint8_t fallback, svuint8_t data) + uint8_t svclastb<see href="svbool_t pg, uint8_t fallback, svuint8_t data">_n_u8</see> CLASTB Wtied, Pg, Wtied, Zdata.B To be added. @@ -7204,7 +7204,7 @@ To be added. To be added. - svuint8_t svclastb[_u8](svbool_t pg, svuint8_t fallback, svuint8_t data) + svuint8_t svclastb<see href="svbool_t pg, svuint8_t fallback, svuint8_t data">_u8</see> CLASTB Btied, Pg, Btied, Zdata.B To be added. @@ -7236,7 +7236,7 @@ To be added. To be added. - float64_t svclastb[_n_f64](svbool_t pg, float64_t fallback, svfloat64_t data) + float64_t svclastb<see href="svbool_t pg, float64_t fallback, svfloat64_t data">_n_f64</see> CLASTB Dtied, Pg, Dtied, Zdata.D To be added. @@ -7268,7 +7268,7 @@ To be added. To be added. - svfloat64_t svclastb[_f64](svbool_t pg, svfloat64_t fallback, svfloat64_t data) + svfloat64_t svclastb<see href="svbool_t pg, svfloat64_t fallback, svfloat64_t data">_f64</see> CLASTB Dtied, Pg, Dtied, Zdata.D To be added. @@ -7300,7 +7300,7 @@ To be added. To be added. - int16_t svclastb[_n_s16](svbool_t pg, int16_t fallback, svint16_t data) + int16_t svclastb<see href="svbool_t pg, int16_t fallback, svint16_t data">_n_s16</see> CLASTB Wtied, Pg, Wtied, Zdata.H To be added. @@ -7332,7 +7332,7 @@ To be added. To be added. - svint16_t svclastb[_s16](svbool_t pg, svint16_t fallback, svint16_t data) + svint16_t svclastb<see href="svbool_t pg, svint16_t fallback, svint16_t data">_s16</see> CLASTB Htied, Pg, Htied, Zdata.H To be added. @@ -7364,7 +7364,7 @@ To be added. To be added. - int32_t svclastb[_n_s32](svbool_t pg, int32_t fallback, svint32_t data) + int32_t svclastb<see href="svbool_t pg, int32_t fallback, svint32_t data">_n_s32</see> CLASTB Wtied, Pg, Wtied, Zdata.S To be added. @@ -7396,7 +7396,7 @@ To be added. To be added. - svint32_t svclastb[_s32](svbool_t pg, svint32_t fallback, svint32_t data) + svint32_t svclastb<see href="svbool_t pg, svint32_t fallback, svint32_t data">_s32</see> CLASTB Stied, Pg, Stied, Zdata.S To be added. @@ -7428,7 +7428,7 @@ To be added. To be added. - int64_t svclastb[_n_s64](svbool_t pg, int64_t fallback, svint64_t data) + int64_t svclastb<see href="svbool_t pg, int64_t fallback, svint64_t data">_n_s64</see> CLASTB Xtied, Pg, Xtied, Zdata.D To be added. @@ -7460,7 +7460,7 @@ To be added. To be added. - svint64_t svclastb[_s64](svbool_t pg, svint64_t fallback, svint64_t data) + svint64_t svclastb<see href="svbool_t pg, svint64_t fallback, svint64_t data">_s64</see> CLASTB Dtied, Pg, Dtied, Zdata.D To be added. @@ -7492,7 +7492,7 @@ To be added. To be added. - svint8_t svclastb[_s8](svbool_t pg, svint8_t fallback, svint8_t data) + svint8_t svclastb<see href="svbool_t pg, svint8_t fallback, svint8_t data">_s8</see> CLASTB Btied, Pg, Btied, Zdata.B To be added. @@ -7524,7 +7524,7 @@ To be added. To be added. - int8_t svclastb[_n_s8](svbool_t pg, int8_t fallback, svint8_t data) + int8_t svclastb<see href="svbool_t pg, int8_t fallback, svint8_t data">_n_s8</see> CLASTB Wtied, Pg, Wtied, Zdata.B To be added. @@ -7556,7 +7556,7 @@ To be added. To be added. - svfloat32_t svclastb[_f32](svbool_t pg, svfloat32_t fallback, svfloat32_t data) + svfloat32_t svclastb<see href="svbool_t pg, svfloat32_t fallback, svfloat32_t data">_f32</see> CLASTB Stied, Pg, Stied, Zdata.S To be added. @@ -7588,7 +7588,7 @@ To be added. To be added. - float32_t svclastb[_n_f32](svbool_t pg, float32_t fallback, svfloat32_t data) + float32_t svclastb<see href="svbool_t pg, float32_t fallback, svfloat32_t data">_n_f32</see> CLASTB Stied, Pg, Stied, Zdata.S To be added. @@ -7620,7 +7620,7 @@ To be added. To be added. - svuint16_t svclastb[_u16](svbool_t pg, svuint16_t fallback, svuint16_t data) + svuint16_t svclastb<see href="svbool_t pg, svuint16_t fallback, svuint16_t data">_u16</see> CLASTB Htied, Pg, Htied, Zdata.H To be added. @@ -7652,7 +7652,7 @@ To be added. To be added. - uint16_t svclastb[_n_u16](svbool_t pg, uint16_t fallback, svuint16_t data) + uint16_t svclastb<see href="svbool_t pg, uint16_t fallback, svuint16_t data">_n_u16</see> CLASTB Wtied, Pg, Wtied, Zdata.H To be added. @@ -7684,7 +7684,7 @@ To be added. To be added. - svuint32_t svclastb[_u32](svbool_t pg, svuint32_t fallback, svuint32_t data) + svuint32_t svclastb<see href="svbool_t pg, svuint32_t fallback, svuint32_t data">_u32</see> CLASTB Stied, Pg, Stied, Zdata.S To be added. @@ -7716,7 +7716,7 @@ To be added. To be added. - uint32_t svclastb[_n_u32](svbool_t pg, uint32_t fallback, svuint32_t data) + uint32_t svclastb<see href="svbool_t pg, uint32_t fallback, svuint32_t data">_n_u32</see> CLASTB Wtied, Pg, Wtied, Zdata.S To be added. @@ -7748,7 +7748,7 @@ To be added. To be added. - svuint64_t svclastb[_u64](svbool_t pg, svuint64_t fallback, svuint64_t data) + svuint64_t svclastb<see href="svbool_t pg, svuint64_t fallback, svuint64_t data">_u64</see> CLASTB Dtied, Pg, Dtied, Zdata.D To be added. @@ -7780,7 +7780,7 @@ To be added. To be added. - uint64_t svclastb[_n_u64](svbool_t pg, uint64_t fallback, svuint64_t data) + uint64_t svclastb<see href="svbool_t pg, uint64_t fallback, svuint64_t data">_n_u64</see> CLASTB Xtied, Pg, Xtied, Zdata.D To be added. @@ -7812,7 +7812,7 @@ To be added. To be added. - svuint8_t svclastb[_u8](svbool_t pg, svuint8_t fallback, svuint8_t data) + svuint8_t svclastb<see href="svbool_t pg, svuint8_t fallback, svuint8_t data">_u8</see> CLASTB Ztied.B, Pg, Ztied.B, Zdata.B To be added. @@ -7844,7 +7844,7 @@ To be added. To be added. - svfloat64_t svclastb[_f64](svbool_t pg, svfloat64_t fallback, svfloat64_t data) + svfloat64_t svclastb<see href="svbool_t pg, svfloat64_t fallback, svfloat64_t data">_f64</see> CLASTB Ztied.D, Pg, Ztied.D, Zdata.D To be added. @@ -7876,7 +7876,7 @@ To be added. To be added. - svint16_t svclastb[_s16](svbool_t pg, svint16_t fallback, svint16_t data) + svint16_t svclastb<see href="svbool_t pg, svint16_t fallback, svint16_t data">_s16</see> CLASTB Ztied.H, Pg, Ztied.H, Zdata.H To be added. @@ -7908,7 +7908,7 @@ To be added. To be added. - svint32_t svclastb[_s32](svbool_t pg, svint32_t fallback, svint32_t data) + svint32_t svclastb<see href="svbool_t pg, svint32_t fallback, svint32_t data">_s32</see> CLASTB Ztied.S, Pg, Ztied.S, Zdata.S To be added. @@ -7940,7 +7940,7 @@ To be added. To be added. - svint64_t svclastb[_s64](svbool_t pg, svint64_t fallback, svint64_t data) + svint64_t svclastb<see href="svbool_t pg, svint64_t fallback, svint64_t data">_s64</see> CLASTB Ztied.D, Pg, Ztied.D, Zdata.D To be added. @@ -7972,7 +7972,7 @@ To be added. To be added. - svint8_t svclastb[_s8](svbool_t pg, svint8_t fallback, svint8_t data) + svint8_t svclastb<see href="svbool_t pg, svint8_t fallback, svint8_t data">_s8</see> CLASTB Ztied.B, Pg, Ztied.B, Zdata.B To be added. @@ -8004,7 +8004,7 @@ To be added. To be added. - svfloat32_t svclastb[_f32](svbool_t pg, svfloat32_t fallback, svfloat32_t data) + svfloat32_t svclastb<see href="svbool_t pg, svfloat32_t fallback, svfloat32_t data">_f32</see> CLASTB Ztied.S, Pg, Ztied.S, Zdata.S To be added. @@ -8036,7 +8036,7 @@ To be added. To be added. - svuint16_t svclastb[_u16](svbool_t pg, svuint16_t fallback, svuint16_t data) + svuint16_t svclastb<see href="svbool_t pg, svuint16_t fallback, svuint16_t data">_u16</see> CLASTB Ztied.H, Pg, Ztied.H, Zdata.H To be added. @@ -8068,7 +8068,7 @@ To be added. To be added. - svuint32_t svclastb[_u32](svbool_t pg, svuint32_t fallback, svuint32_t data) + svuint32_t svclastb<see href="svbool_t pg, svuint32_t fallback, svuint32_t data">_u32</see> CLASTB Ztied.S, Pg, Ztied.S, Zdata.S To be added. @@ -8100,7 +8100,7 @@ To be added. To be added. - svuint64_t svclastb[_u64](svbool_t pg, svuint64_t fallback, svuint64_t data) + svuint64_t svclastb<see href="svbool_t pg, svuint64_t fallback, svuint64_t data">_u64</see> CLASTB Ztied.D, Pg, Ztied.D, Zdata.D To be added. @@ -8132,8 +8132,8 @@ To be added. To be added. - svuint8_t svsel[_u8](svbool_t pg, svuint8_t op1, svuint8_t op2) - svbool_t svsel[_b](svbool_t pg, svbool_t op1, svbool_t op2) + svuint8_t svsel<see href="svbool_t pg, svuint8_t op1, svuint8_t op2">_u8</see> + svbool_t svsel<see href="svbool_t pg, svbool_t op1, svbool_t op2">_b</see> SEL Zresult.B, Pg, Zop1.B, Zop2.B To be added. @@ -8165,7 +8165,7 @@ To be added. To be added. - svfloat64_t svsel[_f64](svbool_t pg, svfloat64_t op1, svfloat64_t op2) + svfloat64_t svsel<see href="svbool_t pg, svfloat64_t op1, svfloat64_t op2">_f64</see> SEL Zresult.D, Pg, Zop1.D, Zop2.D To be added. @@ -8197,8 +8197,8 @@ To be added. To be added. - svint16_t svsel[_s16](svbool_t pg, svint16_t op1, svint16_t op2) - svbool_t svsel[_b](svbool_t pg, svbool_t op1, svbool_t op2) + svint16_t svsel<see href="svbool_t pg, svint16_t op1, svint16_t op2">_s16</see> + svbool_t svsel<see href="svbool_t pg, svbool_t op1, svbool_t op2">_b</see> SEL Zresult.H, Pg, Zop1.H, Zop2.H To be added. @@ -8230,8 +8230,8 @@ To be added. To be added. - svint32_t svsel[_s32](svbool_t pg, svint32_t op1, svint32_t op2) - svbool_t svsel[_b](svbool_t pg, svbool_t op1, svbool_t op2) + svint32_t svsel<see href="svbool_t pg, svint32_t op1, svint32_t op2">_s32</see> + svbool_t svsel<see href="svbool_t pg, svbool_t op1, svbool_t op2">_b</see> SEL Zresult.S, Pg, Zop1.S, Zop2.S To be added. @@ -8263,8 +8263,8 @@ To be added. To be added. - svint64_t svsel[_s64](svbool_t pg, svint64_t op1, svint64_t op2) - svbool_t svsel[_b](svbool_t pg, svbool_t op1, svbool_t op2) + svint64_t svsel<see href="svbool_t pg, svint64_t op1, svint64_t op2">_s64</see> + svbool_t svsel<see href="svbool_t pg, svbool_t op1, svbool_t op2">_b</see> SEL Zresult.D, Pg, Zop1.D, Zop2.D To be added. @@ -8296,8 +8296,8 @@ To be added. To be added. - svint8_t svsel[_s8](svbool_t pg, svint8_t op1, svint8_t op2) - svbool_t svsel[_b](svbool_t pg, svbool_t op1, svbool_t op2) + svint8_t svsel<see href="svbool_t pg, svint8_t op1, svint8_t op2">_s8</see> + svbool_t svsel<see href="svbool_t pg, svbool_t op1, svbool_t op2">_b</see> SEL Zresult.B, Pg, Zop1.B, Zop2.B To be added. @@ -8329,7 +8329,7 @@ To be added. To be added. - svfloat32_t svsel[_f32](svbool_t pg, svfloat32_t op1, svfloat32_t op2) + svfloat32_t svsel<see href="svbool_t pg, svfloat32_t op1, svfloat32_t op2">_f32</see> SEL Zresult.S, Pg, Zop1.S, Zop2.S To be added. @@ -8361,8 +8361,8 @@ To be added. To be added. - svuint16_t svsel[_u16](svbool_t pg, svuint16_t op1, svuint16_t op2) - svbool_t svsel[_b](svbool_t pg, svbool_t op1, svbool_t op2) + svuint16_t svsel<see href="svbool_t pg, svuint16_t op1, svuint16_t op2">_u16</see> + svbool_t svsel<see href="svbool_t pg, svbool_t op1, svbool_t op2">_b</see> SEL Zresult.H, Pg, Zop1.H, Zop2.H To be added. @@ -8394,8 +8394,8 @@ To be added. To be added. - svuint32_t svsel[_u32](svbool_t pg, svuint32_t op1, svuint32_t op2) - svbool_t svsel[_b](svbool_t pg, svbool_t op1, svbool_t op2) + svuint32_t svsel<see href="svbool_t pg, svuint32_t op1, svuint32_t op2">_u32</see> + svbool_t svsel<see href="svbool_t pg, svbool_t op1, svbool_t op2">_b</see> SEL Zresult.S, Pg, Zop1.S, Zop2.S To be added. @@ -8427,8 +8427,8 @@ To be added. To be added. - svuint64_t svsel[_u64](svbool_t pg, svuint64_t op1, svuint64_t op2) - svbool_t svsel[_b](svbool_t pg, svbool_t op1, svbool_t op2) + svuint64_t svsel<see href="svbool_t pg, svuint64_t op1, svuint64_t op2">_u64</see> + svbool_t svsel<see href="svbool_t pg, svbool_t op1, svbool_t op2">_b</see> SEL Zresult.D, Pg, Zop1.D, Zop2.D To be added. @@ -10361,7 +10361,7 @@ - svbool_t svpfalse[_b]() + svbool_t svpfalse<see href="">_b</see> PFALSE Presult.B To be added. @@ -10386,7 +10386,7 @@ - svbool_t svpfalse[_b]() + svbool_t svpfalse<see href="">_b</see> PFALSE Presult.B To be added. @@ -10411,7 +10411,7 @@ - svbool_t svpfalse[_b]() + svbool_t svpfalse<see href="">_b</see> PFALSE Presult.B To be added. @@ -10436,7 +10436,7 @@ - svbool_t svpfalse[_b]() + svbool_t svpfalse<see href="">_b</see> PFALSE Presult.B To be added. @@ -10461,7 +10461,7 @@ - svbool_t svpfalse[_b]() + svbool_t svpfalse<see href="">_b</see> PFALSE Presult.B To be added. @@ -10486,7 +10486,7 @@ - svbool_t svpfalse[_b]() + svbool_t svpfalse<see href="">_b</see> PFALSE Presult.B To be added. @@ -10511,7 +10511,7 @@ - svbool_t svpfalse[_b]() + svbool_t svpfalse<see href="">_b</see> PFALSE Presult.B To be added. @@ -10536,7 +10536,7 @@ - svbool_t svpfalse[_b]() + svbool_t svpfalse<see href="">_b</see> PFALSE Presult.B To be added. @@ -10561,7 +10561,7 @@ - svbool_t svpfalse[_b]() + svbool_t svpfalse<see href="">_b</see> PFALSE Presult.B To be added. @@ -10586,7 +10586,7 @@ - svbool_t svpfalse[_b]() + svbool_t svpfalse<see href="">_b</see> PFALSE Presult.B To be added. @@ -10616,7 +10616,7 @@ To be added. To be added. - svbool_t svpfirst[_b](svbool_t pg, svbool_t op) + svbool_t svpfirst<see href="svbool_t pg, svbool_t op">_b</see> PFIRST Ptied.B, Pg, Ptied.B To be added. @@ -10646,7 +10646,7 @@ To be added. To be added. - svbool_t svpfirst[_b](svbool_t pg, svbool_t op) + svbool_t svpfirst<see href="svbool_t pg, svbool_t op">_b</see> PFIRST Ptied.B, Pg, Ptied.B To be added. @@ -10676,7 +10676,7 @@ To be added. To be added. - svbool_t svpfirst[_b](svbool_t pg, svbool_t op) + svbool_t svpfirst<see href="svbool_t pg, svbool_t op">_b</see> PFIRST Ptied.B, Pg, Ptied.B To be added. @@ -10706,7 +10706,7 @@ To be added. To be added. - svbool_t svpfirst[_b](svbool_t pg, svbool_t op) + svbool_t svpfirst<see href="svbool_t pg, svbool_t op">_b</see> PFIRST Ptied.B, Pg, Ptied.B To be added. @@ -10736,7 +10736,7 @@ To be added. To be added. - svbool_t svpfirst[_b](svbool_t pg, svbool_t op) + svbool_t svpfirst<see href="svbool_t pg, svbool_t op">_b</see> PFIRST Ptied.B, Pg, Ptied.B To be added. @@ -10766,7 +10766,7 @@ To be added. To be added. - svbool_t svpfirst[_b](svbool_t pg, svbool_t op) + svbool_t svpfirst<see href="svbool_t pg, svbool_t op">_b</see> PFIRST Ptied.B, Pg, Ptied.B To be added. @@ -10796,7 +10796,7 @@ To be added. To be added. - svbool_t svpfirst[_b](svbool_t pg, svbool_t op) + svbool_t svpfirst<see href="svbool_t pg, svbool_t op">_b</see> PFIRST Ptied.B, Pg, Ptied.B To be added. @@ -10826,7 +10826,7 @@ To be added. To be added. - svbool_t svpfirst[_b](svbool_t pg, svbool_t op) + svbool_t svpfirst<see href="svbool_t pg, svbool_t op">_b</see> PFIRST Ptied.B, Pg, Ptied.B To be added. @@ -11316,7 +11316,7 @@ To be added. To be added. - svbool_t svwhilelt_b16[_s32](int32_t op1, int32_t op2) + svbool_t svwhilelt_b16<see href="int32_t op1, int32_t op2">_s32</see> WHILELT Presult.H, Wop1, Wop2 To be added. @@ -11346,7 +11346,7 @@ To be added. To be added. - svbool_t svwhilelt_b16[_s64](int64_t op1, int64_t op2) + svbool_t svwhilelt_b16<see href="int64_t op1, int64_t op2">_s64</see> WHILELT Presult.H, Xop1, Xop2 To be added. @@ -11376,7 +11376,7 @@ To be added. To be added. - svbool_t svwhilelt_b16[_u32](uint32_t op1, uint32_t op2) + svbool_t svwhilelt_b16<see href="uint32_t op1, uint32_t op2">_u32</see> WHILELO Presult.H, Wop1, Wop2 To be added. @@ -11406,7 +11406,7 @@ To be added. To be added. - svbool_t svwhilelt_b16[_u64](uint64_t op1, uint64_t op2) + svbool_t svwhilelt_b16<see href="uint64_t op1, uint64_t op2">_u64</see> WHILELO Presult.H, Xop1, Xop2 To be added. @@ -11436,7 +11436,7 @@ To be added. To be added. - svbool_t svwhilelt_b32[_s32](int32_t op1, int32_t op2) + svbool_t svwhilelt_b32<see href="int32_t op1, int32_t op2">_s32</see> WHILELT Presult.S, Wop1, Wop2 To be added. @@ -11466,7 +11466,7 @@ To be added. To be added. - svbool_t svwhilelt_b32[_s64](int64_t op1, int64_t op2) + svbool_t svwhilelt_b32<see href="int64_t op1, int64_t op2">_s64</see> WHILELT Presult.S, Xop1, Xop2 To be added. @@ -11496,7 +11496,7 @@ To be added. To be added. - svbool_t svwhilelt_b32[_u32](uint32_t op1, uint32_t op2) + svbool_t svwhilelt_b32<see href="uint32_t op1, uint32_t op2">_u32</see> WHILELO Presult.S, Wop1, Wop2 To be added. @@ -11526,7 +11526,7 @@ To be added. To be added. - svbool_t svwhilelt_b32[_u64](uint64_t op1, uint64_t op2) + svbool_t svwhilelt_b32<see href="uint64_t op1, uint64_t op2">_u64</see> WHILELO Presult.S, Xop1, Xop2 To be added. @@ -11556,7 +11556,7 @@ To be added. To be added. - svbool_t svwhilelt_b64[_s32](int32_t op1, int32_t op2) + svbool_t svwhilelt_b64<see href="int32_t op1, int32_t op2">_s32</see> WHILELT Presult.D, Wop1, Wop2 To be added. @@ -11586,7 +11586,7 @@ To be added. To be added. - svbool_t svwhilelt_b64[_s64](int64_t op1, int64_t op2) + svbool_t svwhilelt_b64<see href="int64_t op1, int64_t op2">_s64</see> WHILELT Presult.D, Xop1, Xop2 To be added. @@ -11616,7 +11616,7 @@ To be added. To be added. - svbool_t svwhilelt_b64[_u32](uint32_t op1, uint32_t op2) + svbool_t svwhilelt_b64<see href="uint32_t op1, uint32_t op2">_u32</see> WHILELO Presult.D, Wop1, Wop2 To be added. @@ -11646,7 +11646,7 @@ To be added. To be added. - svbool_t svwhilelt_b64[_u64](uint64_t op1, uint64_t op2) + svbool_t svwhilelt_b64<see href="uint64_t op1, uint64_t op2">_u64</see> WHILELO Presult.D, Xop1, Xop2 To be added. @@ -11676,7 +11676,7 @@ To be added. To be added. - svbool_t svwhilelt_b8[_s32](int32_t op1, int32_t op2) + svbool_t svwhilelt_b8<see href="int32_t op1, int32_t op2">_s32</see> WHILELT Presult.B, Wop1, Wop2 To be added. @@ -11706,7 +11706,7 @@ To be added. To be added. - svbool_t svwhilelt_b8[_s64](int64_t op1, int64_t op2) + svbool_t svwhilelt_b8<see href="int64_t op1, int64_t op2">_s64</see> WHILELT Presult.B, Xop1, Xop2 To be added. @@ -11736,7 +11736,7 @@ To be added. To be added. - svbool_t svwhilelt_b8[_u32](uint32_t op1, uint32_t op2) + svbool_t svwhilelt_b8<see href="uint32_t op1, uint32_t op2">_u32</see> WHILELO Presult.B, Wop1, Wop2 To be added. @@ -11766,7 +11766,7 @@ To be added. To be added. - svbool_t svwhilelt_b8[_u64](uint64_t op1, uint64_t op2) + svbool_t svwhilelt_b8<see href="uint64_t op1, uint64_t op2">_u64</see> WHILELO Presult.B, Xop1, Xop2 To be added. @@ -11796,7 +11796,7 @@ To be added. To be added. - svbool_t svwhilele_b16[_s32](int32_t op1, int32_t op2) + svbool_t svwhilele_b16<see href="int32_t op1, int32_t op2">_s32</see> WHILELE Presult.H, Wop1, Wop2 To be added. @@ -11826,7 +11826,7 @@ To be added. To be added. - svbool_t svwhilele_b16[_s64](int64_t op1, int64_t op2) + svbool_t svwhilele_b16<see href="int64_t op1, int64_t op2">_s64</see> WHILELE Presult.H, Xop1, Xop2 To be added. @@ -11856,7 +11856,7 @@ To be added. To be added. - svbool_t svwhilele_b16[_u32](uint32_t op1, uint32_t op2) + svbool_t svwhilele_b16<see href="uint32_t op1, uint32_t op2">_u32</see> WHILELS Presult.H, Wop1, Wop2 To be added. @@ -11886,7 +11886,7 @@ To be added. To be added. - svbool_t svwhilele_b16[_u64](uint64_t op1, uint64_t op2) + svbool_t svwhilele_b16<see href="uint64_t op1, uint64_t op2">_u64</see> WHILELS Presult.H, Xop1, Xop2 To be added. @@ -11916,7 +11916,7 @@ To be added. To be added. - svbool_t svwhilele_b32[_s32](int32_t op1, int32_t op2) + svbool_t svwhilele_b32<see href="int32_t op1, int32_t op2">_s32</see> WHILELE Presult.S, Wop1, Wop2 To be added. @@ -11946,7 +11946,7 @@ To be added. To be added. - svbool_t svwhilele_b32[_s64](int64_t op1, int64_t op2) + svbool_t svwhilele_b32<see href="int64_t op1, int64_t op2">_s64</see> WHILELE Presult.S, Xop1, Xop2 To be added. @@ -11976,7 +11976,7 @@ To be added. To be added. - svbool_t svwhilele_b32[_u32](uint32_t op1, uint32_t op2) + svbool_t svwhilele_b32<see href="uint32_t op1, uint32_t op2">_u32</see> WHILELS Presult.S, Wop1, Wop2 To be added. @@ -12006,7 +12006,7 @@ To be added. To be added. - svbool_t svwhilele_b32[_u64](uint64_t op1, uint64_t op2) + svbool_t svwhilele_b32<see href="uint64_t op1, uint64_t op2">_u64</see> WHILELS Presult.S, Xop1, Xop2 To be added. @@ -12036,7 +12036,7 @@ To be added. To be added. - svbool_t svwhilele_b64[_s32](int32_t op1, int32_t op2) + svbool_t svwhilele_b64<see href="int32_t op1, int32_t op2">_s32</see> WHILELE Presult.D, Wop1, Wop2 To be added. @@ -12066,7 +12066,7 @@ To be added. To be added. - svbool_t svwhilele_b64[_s64](int64_t op1, int64_t op2) + svbool_t svwhilele_b64<see href="int64_t op1, int64_t op2">_s64</see> WHILELE Presult.D, Xop1, Xop2 To be added. @@ -12096,7 +12096,7 @@ To be added. To be added. - svbool_t svwhilele_b64[_u32](uint32_t op1, uint32_t op2) + svbool_t svwhilele_b64<see href="uint32_t op1, uint32_t op2">_u32</see> WHILELS Presult.D, Wop1, Wop2 To be added. @@ -12126,7 +12126,7 @@ To be added. To be added. - svbool_t svwhilele_b64[_u64](uint64_t op1, uint64_t op2) + svbool_t svwhilele_b64<see href="uint64_t op1, uint64_t op2">_u64</see> WHILELS Presult.D, Xop1, Xop2 To be added. @@ -12156,7 +12156,7 @@ To be added. To be added. - svbool_t svwhilele_b8[_s32](int32_t op1, int32_t op2) + svbool_t svwhilele_b8<see href="int32_t op1, int32_t op2">_s32</see> WHILELE Presult.B, Wop1, Wop2 To be added. @@ -12186,7 +12186,7 @@ To be added. To be added. - svbool_t svwhilele_b8[_s64](int64_t op1, int64_t op2) + svbool_t svwhilele_b8<see href="int64_t op1, int64_t op2">_s64</see> WHILELE Presult.B, Xop1, Xop2 To be added. @@ -12216,7 +12216,7 @@ To be added. To be added. - svbool_t svwhilele_b8[_u32](uint32_t op1, uint32_t op2) + svbool_t svwhilele_b8<see href="uint32_t op1, uint32_t op2">_u32</see> WHILELS Presult.B, Wop1, Wop2 To be added. @@ -12246,7 +12246,7 @@ To be added. To be added. - svbool_t svwhilele_b8[_u64](uint64_t op1, uint64_t op2) + svbool_t svwhilele_b8<see href="uint64_t op1, uint64_t op2">_u64</see> WHILELS Presult.B, Xop1, Xop2 To be added. @@ -12342,7 +12342,7 @@ To be added. To be added. - svint32_t svdot[_s32](svint32_t op1, svint8_t op2, svint8_t op3) + svint32_t svdot<see href="svint32_t op1, svint8_t op2, svint8_t op3">_s32</see> SDOT Ztied1.S, Zop2.B, Zop3.B To be added. @@ -12374,7 +12374,7 @@ To be added. To be added. - svint64_t svdot[_s64](svint64_t op1, svint16_t op2, svint16_t op3) + svint64_t svdot<see href="svint64_t op1, svint16_t op2, svint16_t op3">_s64</see> SDOT Ztied1.D, Zop2.H, Zop3.H To be added. @@ -12406,7 +12406,7 @@ To be added. To be added. - svuint32_t svdot[_u32](svuint32_t op1, svuint8_t op2, svuint8_t op3) + svuint32_t svdot<see href="svuint32_t op1, svuint8_t op2, svuint8_t op3">_u32</see> UDOT Ztied1.S, Zop2.B, Zop3.B To be added. @@ -12438,7 +12438,7 @@ To be added. To be added. - svuint64_t svdot[_u64](svuint64_t op1, svuint16_t op2, svuint16_t op3) + svuint64_t svdot<see href="svuint64_t op1, svuint16_t op2, svuint16_t op3">_u64</see> UDOT Ztied1.D, Zop2.H, Zop3.H To be added. @@ -12479,7 +12479,7 @@ To be added. To be added. - svint32_t svdot_lane[_s32](svint32_t op1, svint8_t op2, svint8_t op3, uint64_t imm_index) + svint32_t svdot_lane<see href="svint32_t op1, svint8_t op2, svint8_t op3, uint64_t imm_index">_s32</see> SDOT Ztied1.S, Zop2.B, Zop3.B[imm_index] To be added. @@ -12520,7 +12520,7 @@ To be added. To be added. - svint64_t svdot_lane[_s64](svint64_t op1, svint16_t op2, svint16_t op3, uint64_t imm_index) + svint64_t svdot_lane<see href="svint64_t op1, svint16_t op2, svint16_t op3, uint64_t imm_index">_s64</see> SDOT Ztied1.D, Zop2.H, Zop3.H[imm_index] To be added. @@ -12561,7 +12561,7 @@ To be added. To be added. - svuint32_t svdot_lane[_u32](svuint32_t op1, svuint8_t op2, svuint8_t op3, uint64_t imm_index) + svuint32_t svdot_lane<see href="svuint32_t op1, svuint8_t op2, svuint8_t op3, uint64_t imm_index">_u32</see> UDOT Ztied1.S, Zop2.B, Zop3.B[imm_index] To be added. @@ -12602,7 +12602,7 @@ To be added. To be added. - svuint64_t svdot_lane[_u64](svuint64_t op1, svuint16_t op2, svuint16_t op3, uint64_t imm_index) + svuint64_t svdot_lane<see href="svuint64_t op1, svuint16_t op2, svuint16_t op3, uint64_t imm_index">_u64</see> UDOT Ztied1.D, Zop2.H, Zop3.H[imm_index] To be added. @@ -12639,7 +12639,7 @@ To be added. To be added. - svuint8_t svdup_lane[_u8](svuint8_t data, uint8_t index) + svuint8_t svdup_lane<see href="svuint8_t data, uint8_t index">_u8</see> DUP Zresult.B, Zdata.B[index] To be added. @@ -12676,7 +12676,7 @@ To be added. To be added. - svfloat64_t svdup_lane[_f64](svfloat64_t data, uint64_t index) + svfloat64_t svdup_lane<see href="svfloat64_t data, uint64_t index">_f64</see> DUP Zresult.D, Zdata.D[index] To be added. @@ -12713,7 +12713,7 @@ To be added. To be added. - svint16_t svdup_lane[_s16](svint16_t data, uint16_t index) + svint16_t svdup_lane<see href="svint16_t data, uint16_t index">_s16</see> DUP Zresult.H, Zdata.H[index] To be added. @@ -12750,7 +12750,7 @@ To be added. To be added. - svint32_t svdup_lane[_s32](svint32_t data, uint32_t index) + svint32_t svdup_lane<see href="svint32_t data, uint32_t index">_s32</see> DUP Zresult.S, Zdata.S[index] To be added. @@ -12787,7 +12787,7 @@ To be added. To be added. - svint64_t svdup_lane[_s64](svint64_t data, uint64_t index) + svint64_t svdup_lane<see href="svint64_t data, uint64_t index">_s64</see> DUP Zresult.D, Zdata.D[index] To be added. @@ -12824,7 +12824,7 @@ To be added. To be added. - svint8_t svdup_lane[_s8](svint8_t data, uint8_t index) + svint8_t svdup_lane<see href="svint8_t data, uint8_t index">_s8</see> DUP Zresult.B, Zdata.B[index] To be added. @@ -12861,7 +12861,7 @@ To be added. To be added. - svfloat32_t svdup_lane[_f32](svfloat32_t data, uint32_t index) + svfloat32_t svdup_lane<see href="svfloat32_t data, uint32_t index">_f32</see> DUP Zresult.S, Zdata.S[index] To be added. @@ -12898,7 +12898,7 @@ To be added. To be added. - svuint16_t svdup_lane[_u16](svuint16_t data, uint16_t index) + svuint16_t svdup_lane<see href="svuint16_t data, uint16_t index">_u16</see> DUP Zresult.H, Zdata.H[index] To be added. @@ -12935,7 +12935,7 @@ To be added. To be added. - svuint32_t svdup_lane[_u32](svuint32_t data, uint32_t index) + svuint32_t svdup_lane<see href="svuint32_t data, uint32_t index">_u32</see> DUP Zresult.S, Zdata.S[index] To be added. @@ -12972,7 +12972,7 @@ To be added. To be added. - svuint64_t svdup_lane[_u64](svuint64_t data, uint64_t index) + svuint64_t svdup_lane<see href="svuint64_t data, uint64_t index">_u64</see> DUP Zresult.D, Zdata.D[index] To be added. @@ -13011,7 +13011,7 @@ To be added. To be added. - svuint8_t svext[_u8](svuint8_t op1, svuint8_t op2, uint64_t imm3) + svuint8_t svext<see href="svuint8_t op1, svuint8_t op2, uint64_t imm3">_u8</see> EXT Ztied1.B, Ztied1.B, Zop2.B, #imm3 To be added. @@ -13050,7 +13050,7 @@ To be added. To be added. - svfloat64_t svext[_f64](svfloat64_t op1, svfloat64_t op2, uint64_t imm3) + svfloat64_t svext<see href="svfloat64_t op1, svfloat64_t op2, uint64_t imm3">_f64</see> EXT Ztied1.B, Ztied1.B, Zop2.B, #imm3 * 8 To be added. @@ -13089,7 +13089,7 @@ To be added. To be added. - svint16_t svext[_s16](svint16_t op1, svint16_t op2, uint64_t imm3) + svint16_t svext<see href="svint16_t op1, svint16_t op2, uint64_t imm3">_s16</see> EXT Ztied1.B, Ztied1.B, Zop2.B, #imm3 * 2 To be added. @@ -13128,7 +13128,7 @@ To be added. To be added. - svint32_t svext[_s32](svint32_t op1, svint32_t op2, uint64_t imm3) + svint32_t svext<see href="svint32_t op1, svint32_t op2, uint64_t imm3">_s32</see> EXT Ztied1.B, Ztied1.B, Zop2.B, #imm3 * 4 To be added. @@ -13167,7 +13167,7 @@ To be added. To be added. - svint64_t svext[_s64](svint64_t op1, svint64_t op2, uint64_t imm3) + svint64_t svext<see href="svint64_t op1, svint64_t op2, uint64_t imm3">_s64</see> EXT Ztied1.B, Ztied1.B, Zop2.B, #imm3 * 8 To be added. @@ -13206,7 +13206,7 @@ To be added. To be added. - svint8_t svext[_s8](svint8_t op1, svint8_t op2, uint64_t imm3) + svint8_t svext<see href="svint8_t op1, svint8_t op2, uint64_t imm3">_s8</see> EXT Ztied1.B, Ztied1.B, Zop2.B, #imm3 To be added. @@ -13245,7 +13245,7 @@ To be added. To be added. - svfloat32_t svext[_f32](svfloat32_t op1, svfloat32_t op2, uint64_t imm3) + svfloat32_t svext<see href="svfloat32_t op1, svfloat32_t op2, uint64_t imm3">_f32</see> EXT Ztied1.B, Ztied1.B, Zop2.B, #imm3 * 4 To be added. @@ -13284,7 +13284,7 @@ To be added. To be added. - svuint16_t svext[_u16](svuint16_t op1, svuint16_t op2, uint64_t imm3) + svuint16_t svext<see href="svuint16_t op1, svuint16_t op2, uint64_t imm3">_u16</see> EXT Ztied1.B, Ztied1.B, Zop2.B, #imm3 * 2 To be added. @@ -13323,7 +13323,7 @@ To be added. To be added. - svuint32_t svext[_u32](svuint32_t op1, svuint32_t op2, uint64_t imm3) + svuint32_t svext<see href="svuint32_t op1, svuint32_t op2, uint64_t imm3">_u32</see> EXT Ztied1.B, Ztied1.B, Zop2.B, #imm3 * 4 To be added. @@ -13362,7 +13362,7 @@ To be added. To be added. - svuint64_t svext[_u64](svuint64_t op1, svuint64_t op2, uint64_t imm3) + svuint64_t svext<see href="svuint64_t op1, svuint64_t op2, uint64_t imm3">_u64</see> EXT Ztied1.B, Ztied1.B, Zop2.B, #imm3 * 8 To be added. @@ -13390,7 +13390,7 @@ To be added. - svfloat32_t svexpa[_f32](svuint32_t op) + svfloat32_t svexpa<see href="svuint32_t op">_f32</see> FEXPA Zresult.S, Zop.S To be added. @@ -13418,7 +13418,7 @@ To be added. - svfloat64_t svexpa[_f64](svuint64_t op) + svfloat64_t svexpa<see href="svuint64_t op">_f64</see> FEXPA Zresult.D, Zop.D To be added. @@ -13527,7 +13527,7 @@ To be added. To be added. - svfloat64_t svmla_lane[_f64](svfloat64_t op1, svfloat64_t op2, svfloat64_t op3, uint64_t imm_index) + svfloat64_t svmla_lane<see href="svfloat64_t op1, svfloat64_t op2, svfloat64_t op3, uint64_t imm_index">_f64</see> FMLA Ztied1.D, Zop2.D, Zop3.D[imm_index] To be added. @@ -13568,7 +13568,7 @@ To be added. To be added. - svfloat32_t svmla_lane[_f32](svfloat32_t op1, svfloat32_t op2, svfloat32_t op3, uint64_t imm_index) + svfloat32_t svmla_lane<see href="svfloat32_t op1, svfloat32_t op2, svfloat32_t op3, uint64_t imm_index">_f32</see> FMLA Ztied1.S, Zop2.S, Zop3.S[imm_index] To be added. @@ -13745,7 +13745,7 @@ To be added. To be added. - svfloat64_t svmls_lane[_f64](svfloat64_t op1, svfloat64_t op2, svfloat64_t op3, uint64_t imm_index) + svfloat64_t svmls_lane<see href="svfloat64_t op1, svfloat64_t op2, svfloat64_t op3, uint64_t imm_index">_f64</see> FMLS Ztied1.D, Zop2.D, Zop3.D[imm_index] To be added. @@ -13786,7 +13786,7 @@ To be added. To be added. - svfloat32_t svmls_lane[_f32](svfloat32_t op1, svfloat32_t op2, svfloat32_t op3, uint64_t imm_index) + svfloat32_t svmls_lane<see href="svfloat32_t op1, svfloat32_t op2, svfloat32_t op3, uint64_t imm_index">_f32</see> FMLS Ztied1.S, Zop2.S, Zop3.S[imm_index] To be added. @@ -13893,7 +13893,7 @@ To be added. To be added. - void svprfh_gather[_u64base](svbool_t pg, svuint64_t bases, enum svprfop op) + void svprfh_gather<see href="svbool_t pg, svuint64_t bases, enum svprfop op">_u64base</see> PRFH op, Pg, [Zbases.D, #0] To be added. @@ -13931,7 +13931,7 @@ To be added. To be added. - void svprfh_gather[_u64base](svbool_t pg, svuint64_t bases, enum svprfop op) + void svprfh_gather<see href="svbool_t pg, svuint64_t bases, enum svprfop op">_u64base</see> PRFH op, Pg, [Zbases.D, #0] To be added. @@ -14281,7 +14281,7 @@ To be added. To be added. - void svprfw_gather[_u64base](svbool_t pg, svuint64_t bases, enum svprfop op) + void svprfw_gather<see href="svbool_t pg, svuint64_t bases, enum svprfop op">_u64base</see> PRFW op, Pg, [Zbases.D, #0] To be added. @@ -14319,7 +14319,7 @@ To be added. To be added. - void svprfw_gather[_u64base](svbool_t pg, svuint64_t bases, enum svprfop op) + void svprfw_gather<see href="svbool_t pg, svuint64_t bases, enum svprfop op">_u64base</see> PRFW op, Pg, [Zbases.D, #0] To be added. @@ -14669,7 +14669,7 @@ To be added. To be added. - void svprfd_gather[_u64base](svbool_t pg, svuint64_t bases, enum svprfop op) + void svprfd_gather<see href="svbool_t pg, svuint64_t bases, enum svprfop op">_u64base</see> PRFD op, Pg, [Zbases.D, #0] To be added. @@ -14707,7 +14707,7 @@ To be added. To be added. - void svprfd_gather[_u64base](svbool_t pg, svuint64_t bases, enum svprfop op) + void svprfd_gather<see href="svbool_t pg, svuint64_t bases, enum svprfop op">_u64base</see> PRFD op, Pg, [Zbases.D, #0] To be added. @@ -15057,7 +15057,7 @@ To be added. To be added. - void svprfb_gather[_u64base](svbool_t pg, svuint64_t bases, enum svprfop op) + void svprfb_gather<see href="svbool_t pg, svuint64_t bases, enum svprfop op">_u64base</see> PRFB op, Pg, [Zbases.D, #0] To be added. @@ -15095,7 +15095,7 @@ To be added. To be added. - void svprfb_gather[_u64base](svbool_t pg, svuint64_t bases, enum svprfop op) + void svprfb_gather<see href="svbool_t pg, svuint64_t bases, enum svprfop op">_u64base</see> PRFB op, Pg, [Zbases.D, #0] To be added. @@ -15527,7 +15527,7 @@ To be added. To be added. - svfloat64_t svld1_gather_[s64]index[_f64](svbool_t pg, const float64_t *base, svint64_t indices) + svfloat64_t svld1_gather_<see href="svbool_t pg, const float64_t *base, svint64_t indices">s64]index[_f64</see> LD1D Zresult.D, Pg/Z, [Xbase, Zindices.D, LSL #3] To be added. @@ -15558,7 +15558,7 @@ To be added. To be added. - svfloat64_t svld1_gather_[u64]index[_f64](svbool_t pg, const float64_t *base, svuint64_t indices) + svfloat64_t svld1_gather_<see href="svbool_t pg, const float64_t *base, svuint64_t indices">u64]index[_f64</see> LD1D Zresult.D, Pg/Z, [Xbase, Zindices.D, LSL #3] To be added. @@ -15589,7 +15589,7 @@ To be added. To be added. - svint32_t svld1_gather_[s32]index[_s32](svbool_t pg, const int32_t *base, svint32_t indices) + svint32_t svld1_gather_<see href="svbool_t pg, const int32_t *base, svint32_t indices">s32]index[_s32</see> LD1W Zresult.S, Pg/Z, [Xbase, Zindices.S, SXTW #2] To be added. @@ -15620,7 +15620,7 @@ To be added. To be added. - svint32_t svld1_gather_[u32]index[_s32](svbool_t pg, const int32_t *base, svuint32_t indices) + svint32_t svld1_gather_<see href="svbool_t pg, const int32_t *base, svuint32_t indices">u32]index[_s32</see> LD1W Zresult.S, Pg/Z, [Xbase, Zindices.S, UXTW #2] To be added. @@ -15651,7 +15651,7 @@ To be added. To be added. - svint64_t svld1_gather_[s64]index[_s64](svbool_t pg, const int64_t *base, svint64_t indices) + svint64_t svld1_gather_<see href="svbool_t pg, const int64_t *base, svint64_t indices">s64]index[_s64</see> LD1D Zresult.D, Pg/Z, [Xbase, Zindices.D, LSL #3] To be added. @@ -15682,7 +15682,7 @@ To be added. To be added. - svint64_t svld1_gather_[u64]index[_s64](svbool_t pg, const int64_t *base, svuint64_t indices) + svint64_t svld1_gather_<see href="svbool_t pg, const int64_t *base, svuint64_t indices">u64]index[_s64</see> LD1D Zresult.D, Pg/Z, [Xbase, Zindices.D, LSL #3] To be added. @@ -15713,7 +15713,7 @@ To be added. To be added. - svfloat32_t svld1_gather_[s32]index[_f32](svbool_t pg, const float32_t *base, svint32_t indices) + svfloat32_t svld1_gather_<see href="svbool_t pg, const float32_t *base, svint32_t indices">s32]index[_f32</see> LD1W Zresult.S, Pg/Z, [Xbase, Zindices.S, SXTW #2] To be added. @@ -15744,7 +15744,7 @@ To be added. To be added. - svfloat32_t svld1_gather_[u32]index[_f32](svbool_t pg, const float32_t *base, svuint32_t indices) + svfloat32_t svld1_gather_<see href="svbool_t pg, const float32_t *base, svuint32_t indices">u32]index[_f32</see> LD1W Zresult.S, Pg/Z, [Xbase, Zindices.S, UXTW #2] To be added. @@ -15775,7 +15775,7 @@ To be added. To be added. - svuint32_t svld1_gather_[s32]index[_u32](svbool_t pg, const uint32_t *base, svint32_t indices) + svuint32_t svld1_gather_<see href="svbool_t pg, const uint32_t *base, svint32_t indices">s32]index[_u32</see> LD1W Zresult.S, Pg/Z, [Xbase, Zindices.S, SXTW #2] To be added. @@ -15806,7 +15806,7 @@ To be added. To be added. - svuint32_t svld1_gather_[u32]index[_u32](svbool_t pg, const uint32_t *base, svuint32_t indices) + svuint32_t svld1_gather_<see href="svbool_t pg, const uint32_t *base, svuint32_t indices">u32]index[_u32</see> LD1W Zresult.S, Pg/Z, [Xbase, Zindices.S, UXTW #2] To be added. @@ -15837,7 +15837,7 @@ To be added. To be added. - svuint64_t svld1_gather_[s64]index[_u64](svbool_t pg, const uint64_t *base, svint64_t indices) + svuint64_t svld1_gather_<see href="svbool_t pg, const uint64_t *base, svint64_t indices">s64]index[_u64</see> LD1D Zresult.D, Pg/Z, [Xbase, Zindices.D, LSL #3] To be added. @@ -15868,7 +15868,7 @@ To be added. To be added. - svuint64_t svld1_gather_[u64]index[_u64](svbool_t pg, const uint64_t *base, svuint64_t indices) + svuint64_t svld1_gather_<see href="svbool_t pg, const uint64_t *base, svuint64_t indices">u64]index[_u64</see> LD1D Zresult.D, Pg/Z, [Xbase, Zindices.D, LSL #3] To be added. @@ -21584,7 +21584,7 @@ To be added. To be added. - svfloat64_t svld1_gather_[s64]offset[_f64](svbool_t pg, const float64_t *base, svint64_t offsets) + svfloat64_t svld1_gather_<see href="svbool_t pg, const float64_t *base, svint64_t offsets">s64]offset[_f64</see> LD1D Zresult.D, Pg/Z, [Xbase, Zoffsets.D] To be added. @@ -21615,7 +21615,7 @@ To be added. To be added. - svfloat64_t svld1_gather_[u64]offset[_f64](svbool_t pg, const float64_t *base, svuint64_t offsets) + svfloat64_t svld1_gather_<see href="svbool_t pg, const float64_t *base, svuint64_t offsets">u64]offset[_f64</see> LD1D Zresult.D, Pg/Z, [Xbase, Zoffsets.D] To be added. @@ -21646,7 +21646,7 @@ To be added. To be added. - svint32_t svld1_gather_[s32]offset[_s32](svbool_t pg, const int32_t *base, svint32_t offsets) + svint32_t svld1_gather_<see href="svbool_t pg, const int32_t *base, svint32_t offsets">s32]offset[_s32</see> LD1W Zresult.S, Pg/Z, [Xbase, Zoffsets.S, SXTW] To be added. @@ -21677,7 +21677,7 @@ To be added. To be added. - svint32_t svld1_gather_[u32]offset[_s32](svbool_t pg, const int32_t *base, svuint32_t offsets) + svint32_t svld1_gather_<see href="svbool_t pg, const int32_t *base, svuint32_t offsets">u32]offset[_s32</see> LD1W Zresult.S, Pg/Z, [Xbase, Zoffsets.S, UXTW] To be added. @@ -21708,7 +21708,7 @@ To be added. To be added. - svint64_t svld1_gather_[s64]offset[_s64](svbool_t pg, const int64_t *base, svint64_t offsets) + svint64_t svld1_gather_<see href="svbool_t pg, const int64_t *base, svint64_t offsets">s64]offset[_s64</see> LD1D Zresult.D, Pg/Z, [Xbase, Zoffsets.D] To be added. @@ -21739,7 +21739,7 @@ To be added. To be added. - svint64_t svld1_gather_[u64]offset[_s64](svbool_t pg, const int64_t *base, svuint64_t offsets) + svint64_t svld1_gather_<see href="svbool_t pg, const int64_t *base, svuint64_t offsets">u64]offset[_s64</see> LD1D Zresult.D, Pg/Z, [Xbase, Zoffsets.D] To be added. @@ -21770,7 +21770,7 @@ To be added. To be added. - svfloat32_t svld1_gather_[s32]offset[_f32](svbool_t pg, const float32_t *base, svint32_t offsets) + svfloat32_t svld1_gather_<see href="svbool_t pg, const float32_t *base, svint32_t offsets">s32]offset[_f32</see> LD1W Zresult.S, Pg/Z, [Xbase, Zoffsets.S, SXTW] To be added. @@ -21801,7 +21801,7 @@ To be added. To be added. - svfloat32_t svld1_gather_[u32]offset[_f32](svbool_t pg, const float32_t *base, svuint32_t offsets) + svfloat32_t svld1_gather_<see href="svbool_t pg, const float32_t *base, svuint32_t offsets">u32]offset[_f32</see> LD1W Zresult.S, Pg/Z, [Xbase, Zoffsets.S, UXTW] To be added. @@ -21832,7 +21832,7 @@ To be added. To be added. - svuint32_t svld1_gather_[s32]offset[_u32](svbool_t pg, const uint32_t *base, svint32_t offsets) + svuint32_t svld1_gather_<see href="svbool_t pg, const uint32_t *base, svint32_t offsets">s32]offset[_u32</see> LD1W Zresult.S, Pg/Z, [Xbase, Zoffsets.S, SXTW] To be added. @@ -21863,7 +21863,7 @@ To be added. To be added. - svuint32_t svld1_gather_[u32]offset[_u32](svbool_t pg, const uint32_t *base, svuint32_t offsets) + svuint32_t svld1_gather_<see href="svbool_t pg, const uint32_t *base, svuint32_t offsets">u32]offset[_u32</see> LD1W Zresult.S, Pg/Z, [Xbase, Zoffsets.S, UXTW] To be added. @@ -21894,7 +21894,7 @@ To be added. To be added. - svuint64_t svld1_gather_[s64]offset[_u64](svbool_t pg, const uint64_t *base, svint64_t offsets) + svuint64_t svld1_gather_<see href="svbool_t pg, const uint64_t *base, svint64_t offsets">s64]offset[_u64</see> LD1D Zresult.D, Pg/Z, [Xbase, Zoffsets.D] To be added. @@ -21925,7 +21925,7 @@ To be added. To be added. - svuint64_t svld1_gather_[u64]offset[_u64](svbool_t pg, const uint64_t *base, svuint64_t offsets) + svuint64_t svld1_gather_<see href="svbool_t pg, const uint64_t *base, svuint64_t offsets">u64]offset[_u64</see> LD1D Zresult.D, Pg/Z, [Xbase, Zoffsets.D] To be added. @@ -22431,7 +22431,7 @@ To be added. To be added. - svuint8_t svinsr[_n_u8](svuint8_t op1, uint8_t op2) + svuint8_t svinsr<see href="svuint8_t op1, uint8_t op2">_n_u8</see> INSR Ztied1.B, Wop2 INSR Ztied1.B, Bop2 @@ -22462,7 +22462,7 @@ To be added. To be added. - svfloat64_t svinsr[_n_f64](svfloat64_t op1, float64_t op2) + svfloat64_t svinsr<see href="svfloat64_t op1, float64_t op2">_n_f64</see> INSR Ztied1.D, Xop2 INSR Ztied1.D, Dop2 @@ -22493,7 +22493,7 @@ To be added. To be added. - svint16_t svinsr[_n_s16](svint16_t op1, int16_t op2) + svint16_t svinsr<see href="svint16_t op1, int16_t op2">_n_s16</see> INSR Ztied1.H, Wop2 INSR Ztied1.H, Hop2 @@ -22524,7 +22524,7 @@ To be added. To be added. - svint32_t svinsr[_n_s32](svint32_t op1, int32_t op2) + svint32_t svinsr<see href="svint32_t op1, int32_t op2">_n_s32</see> INSR Ztied1.S, Wop2 INSR Ztied1.S, Sop2 @@ -22555,7 +22555,7 @@ To be added. To be added. - svint64_t svinsr[_n_s64](svint64_t op1, int64_t op2) + svint64_t svinsr<see href="svint64_t op1, int64_t op2">_n_s64</see> INSR Ztied1.D, Xop2 INSR Ztied1.D, Dop2 @@ -22586,7 +22586,7 @@ To be added. To be added. - svint8_t svinsr[_n_s8](svint8_t op1, int8_t op2) + svint8_t svinsr<see href="svint8_t op1, int8_t op2">_n_s8</see> INSR Ztied1.B, Wop2 INSR Ztied1.B, Bop2 @@ -22617,7 +22617,7 @@ To be added. To be added. - svfloat32_t svinsr[_n_f32](svfloat32_t op1, float32_t op2) + svfloat32_t svinsr<see href="svfloat32_t op1, float32_t op2">_n_f32</see> INSR Ztied1.S, Wop2 INSR Ztied1.S, Sop2 @@ -22648,7 +22648,7 @@ To be added. To be added. - svuint16_t svinsr[_n_u16](svuint16_t op1, uint16_t op2) + svuint16_t svinsr<see href="svuint16_t op1, uint16_t op2">_n_u16</see> INSR Ztied1.H, Wop2 INSR Ztied1.H, Hop2 @@ -22679,7 +22679,7 @@ To be added. To be added. - svuint32_t svinsr[_n_u32](svuint32_t op1, uint32_t op2) + svuint32_t svinsr<see href="svuint32_t op1, uint32_t op2">_n_u32</see> INSR Ztied1.S, Wop2 INSR Ztied1.S, Sop2 @@ -22710,7 +22710,7 @@ To be added. To be added. - svuint64_t svinsr[_n_u64](svuint64_t op1, uint64_t op2) + svuint64_t svinsr<see href="svuint64_t op1, uint64_t op2">_n_u64</see> INSR Ztied1.D, Xop2 INSR Ztied1.D, Dop2 @@ -23122,7 +23122,7 @@ To be added. To be added. - svuint8x2_t svld2[_u8](svbool_t pg, const uint8_t *base) + svuint8x2_t svld2<see href="svbool_t pg, const uint8_t *base">_u8</see> LD2B {Zresult0.B, Zresult1.B}, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -23151,7 +23151,7 @@ To be added. To be added. - svfloat64x2_t svld2[_f64](svbool_t pg, const float64_t *base) + svfloat64x2_t svld2<see href="svbool_t pg, const float64_t *base">_f64</see> LD2D {Zresult0.D, Zresult1.D}, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -23180,7 +23180,7 @@ To be added. To be added. - svint16x2_t svld2[_s16](svbool_t pg, const int16_t *base) + svint16x2_t svld2<see href="svbool_t pg, const int16_t *base">_s16</see> LD2H {Zresult0.H, Zresult1.H}, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -23209,7 +23209,7 @@ To be added. To be added. - svint32x2_t svld2[_s32](svbool_t pg, const int32_t *base) + svint32x2_t svld2<see href="svbool_t pg, const int32_t *base">_s32</see> LD2W {Zresult0.S, Zresult1.S}, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -23238,7 +23238,7 @@ To be added. To be added. - svint64x2_t svld2[_s64](svbool_t pg, const int64_t *base) + svint64x2_t svld2<see href="svbool_t pg, const int64_t *base">_s64</see> LD2D {Zresult0.D, Zresult1.D}, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -23267,7 +23267,7 @@ To be added. To be added. - svint8x2_t svld2[_s8](svbool_t pg, const int8_t *base) + svint8x2_t svld2<see href="svbool_t pg, const int8_t *base">_s8</see> LD2B {Zresult0.B, Zresult1.B}, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -23296,7 +23296,7 @@ To be added. To be added. - svfloat32x2_t svld2[_f32](svbool_t pg, const float32_t *base) + svfloat32x2_t svld2<see href="svbool_t pg, const float32_t *base">_f32</see> LD2W {Zresult0.S, Zresult1.S}, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -23325,7 +23325,7 @@ To be added. To be added. - svuint16x2_t svld2[_u16](svbool_t pg, const uint16_t *base) + svuint16x2_t svld2<see href="svbool_t pg, const uint16_t *base">_u16</see> LD2H {Zresult0.H, Zresult1.H}, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -23354,7 +23354,7 @@ To be added. To be added. - svuint32x2_t svld2[_u32](svbool_t pg, const uint32_t *base) + svuint32x2_t svld2<see href="svbool_t pg, const uint32_t *base">_u32</see> LD2W {Zresult0.S, Zresult1.S}, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -23383,7 +23383,7 @@ To be added. To be added. - svuint64x2_t svld2[_u64](svbool_t pg, const uint64_t *base) + svuint64x2_t svld2<see href="svbool_t pg, const uint64_t *base">_u64</see> LD2D {Zresult0.D, Zresult1.D}, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -23412,7 +23412,7 @@ To be added. To be added. - svuint8x3_t svld3[_u8](svbool_t pg, const uint8_t *base) + svuint8x3_t svld3<see href="svbool_t pg, const uint8_t *base">_u8</see> LD3B {Zresult0.B - Zresult2.B}, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -23441,7 +23441,7 @@ To be added. To be added. - svfloat64x3_t svld3[_f64](svbool_t pg, const float64_t *base) + svfloat64x3_t svld3<see href="svbool_t pg, const float64_t *base">_f64</see> LD3D {Zresult0.D - Zresult2.D}, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -23470,7 +23470,7 @@ To be added. To be added. - svint16x3_t svld3[_s16](svbool_t pg, const int16_t *base) + svint16x3_t svld3<see href="svbool_t pg, const int16_t *base">_s16</see> LD3H {Zresult0.H - Zresult2.H}, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -23499,7 +23499,7 @@ To be added. To be added. - svint32x3_t svld3[_s32](svbool_t pg, const int32_t *base) + svint32x3_t svld3<see href="svbool_t pg, const int32_t *base">_s32</see> LD3W {Zresult0.S - Zresult2.S}, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -23528,7 +23528,7 @@ To be added. To be added. - svint64x3_t svld3[_s64](svbool_t pg, const int64_t *base) + svint64x3_t svld3<see href="svbool_t pg, const int64_t *base">_s64</see> LD3D {Zresult0.D - Zresult2.D}, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -23557,7 +23557,7 @@ To be added. To be added. - svint8x3_t svld3[_s8](svbool_t pg, const int8_t *base) + svint8x3_t svld3<see href="svbool_t pg, const int8_t *base">_s8</see> LD3B {Zresult0.B - Zresult2.B}, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -23586,7 +23586,7 @@ To be added. To be added. - svfloat32x3_t svld3[_f32](svbool_t pg, const float32_t *base) + svfloat32x3_t svld3<see href="svbool_t pg, const float32_t *base">_f32</see> LD3W {Zresult0.S - Zresult2.S}, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -23615,7 +23615,7 @@ To be added. To be added. - svuint16x3_t svld3[_u16](svbool_t pg, const uint16_t *base) + svuint16x3_t svld3<see href="svbool_t pg, const uint16_t *base">_u16</see> LD3H {Zresult0.H - Zresult2.H}, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -23644,7 +23644,7 @@ To be added. To be added. - svuint32x3_t svld3[_u32](svbool_t pg, const uint32_t *base) + svuint32x3_t svld3<see href="svbool_t pg, const uint32_t *base">_u32</see> LD3W {Zresult0.S - Zresult2.S}, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -23673,7 +23673,7 @@ To be added. To be added. - svuint64x3_t svld3[_u64](svbool_t pg, const uint64_t *base) + svuint64x3_t svld3<see href="svbool_t pg, const uint64_t *base">_u64</see> LD3D {Zresult0.D - Zresult2.D}, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -23702,7 +23702,7 @@ To be added. To be added. - svuint8x4_t svld4[_u8](svbool_t pg, const uint8_t *base) + svuint8x4_t svld4<see href="svbool_t pg, const uint8_t *base">_u8</see> LD4B {Zresult0.B - Zresult3.B}, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -23731,7 +23731,7 @@ To be added. To be added. - svfloat64x4_t svld4[_f64](svbool_t pg, const float64_t *base) + svfloat64x4_t svld4<see href="svbool_t pg, const float64_t *base">_f64</see> LD4D {Zresult0.D - Zresult3.D}, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -23760,7 +23760,7 @@ To be added. To be added. - svint16x4_t svld4[_s16](svbool_t pg, const int16_t *base) + svint16x4_t svld4<see href="svbool_t pg, const int16_t *base">_s16</see> LD4H {Zresult0.H - Zresult3.H}, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -23789,7 +23789,7 @@ To be added. To be added. - svint32x4_t svld4[_s32](svbool_t pg, const int32_t *base) + svint32x4_t svld4<see href="svbool_t pg, const int32_t *base">_s32</see> LD4W {Zresult0.S - Zresult3.S}, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -23818,7 +23818,7 @@ To be added. To be added. - svint64x4_t svld4[_s64](svbool_t pg, const int64_t *base) + svint64x4_t svld4<see href="svbool_t pg, const int64_t *base">_s64</see> LD4D {Zresult0.D - Zresult3.D}, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -23847,7 +23847,7 @@ To be added. To be added. - svint8x4_t svld4[_s8](svbool_t pg, const int8_t *base) + svint8x4_t svld4<see href="svbool_t pg, const int8_t *base">_s8</see> LD4B {Zresult0.B - Zresult3.B}, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -23876,7 +23876,7 @@ To be added. To be added. - svfloat32x4_t svld4[_f32](svbool_t pg, const float32_t *base) + svfloat32x4_t svld4<see href="svbool_t pg, const float32_t *base">_f32</see> LD4W {Zresult0.S - Zresult3.S}, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -23905,7 +23905,7 @@ To be added. To be added. - svuint16x4_t svld4[_u16](svbool_t pg, const uint16_t *base) + svuint16x4_t svld4<see href="svbool_t pg, const uint16_t *base">_u16</see> LD4H {Zresult0.H - Zresult3.H}, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -23934,7 +23934,7 @@ To be added. To be added. - svuint32x4_t svld4[_u32](svbool_t pg, const uint32_t *base) + svuint32x4_t svld4<see href="svbool_t pg, const uint32_t *base">_u32</see> LD4W {Zresult0.S - Zresult3.S}, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -23963,7 +23963,7 @@ To be added. To be added. - svuint64x4_t svld4[_u64](svbool_t pg, const uint64_t *base) + svuint64x4_t svld4<see href="svbool_t pg, const uint64_t *base">_u64</see> LD4D {Zresult0.D - Zresult3.D}, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -23992,7 +23992,7 @@ To be added. To be added. - svuint8_t svld1[_u8](svbool_t pg, const uint8_t *base) + svuint8_t svld1<see href="svbool_t pg, const uint8_t *base">_u8</see> LD1B Zresult.B, Pg/Z, [Xarray, Xindex] LD1B Zresult.B, Pg/Z, [Xbase, #0, MUL VL] @@ -24022,7 +24022,7 @@ To be added. To be added. - svfloat64_t svld1[_f64](svbool_t pg, const float64_t *base) + svfloat64_t svld1<see href="svbool_t pg, const float64_t *base">_f64</see> LD1D Zresult.D, Pg/Z, [Xarray, Xindex, LSL #3] LD1D Zresult.D, Pg/Z, [Xbase, #0, MUL VL] @@ -24052,7 +24052,7 @@ To be added. To be added. - svint16_t svld1[_s16](svbool_t pg, const int16_t *base) + svint16_t svld1<see href="svbool_t pg, const int16_t *base">_s16</see> LD1H Zresult.H, Pg/Z, [Xarray, Xindex, LSL #1] LD1H Zresult.H, Pg/Z, [Xbase, #0, MUL VL] @@ -24082,7 +24082,7 @@ To be added. To be added. - svint32_t svld1[_s32](svbool_t pg, const int32_t *base) + svint32_t svld1<see href="svbool_t pg, const int32_t *base">_s32</see> LD1W Zresult.S, Pg/Z, [Xarray, Xindex, LSL #2] LD1W Zresult.S, Pg/Z, [Xbase, #0, MUL VL] @@ -24112,7 +24112,7 @@ To be added. To be added. - svint64_t svld1[_s64](svbool_t pg, const int64_t *base) + svint64_t svld1<see href="svbool_t pg, const int64_t *base">_s64</see> LD1D Zresult.D, Pg/Z, [Xarray, Xindex, LSL #3] LD1D Zresult.D, Pg/Z, [Xbase, #0, MUL VL] @@ -24142,7 +24142,7 @@ To be added. To be added. - svint8_t svld1[_s8](svbool_t pg, const int8_t *base) + svint8_t svld1<see href="svbool_t pg, const int8_t *base">_s8</see> LD1B Zresult.B, Pg/Z, [Xarray, Xindex] LD1B Zresult.B, Pg/Z, [Xbase, #0, MUL VL] @@ -24172,7 +24172,7 @@ To be added. To be added. - svfloat32_t svld1[_f32](svbool_t pg, const float32_t *base) + svfloat32_t svld1<see href="svbool_t pg, const float32_t *base">_f32</see> LD1W Zresult.S, Pg/Z, [Xarray, Xindex, LSL #2] LD1W Zresult.S, Pg/Z, [Xbase, #0, MUL VL] @@ -24202,7 +24202,7 @@ To be added. To be added. - svuint16_t svld1[_u16](svbool_t pg, const uint16_t *base) + svuint16_t svld1<see href="svbool_t pg, const uint16_t *base">_u16</see> LD1H Zresult.H, Pg/Z, [Xarray, Xindex, LSL #1] LD1H Zresult.H, Pg/Z, [Xbase, #0, MUL VL] @@ -24232,7 +24232,7 @@ To be added. To be added. - svuint32_t svld1[_u32](svbool_t pg, const uint32_t *base) + svuint32_t svld1<see href="svbool_t pg, const uint32_t *base">_u32</see> LD1W Zresult.S, Pg/Z, [Xarray, Xindex, LSL #2] LD1W Zresult.S, Pg/Z, [Xbase, #0, MUL VL] @@ -24262,7 +24262,7 @@ To be added. To be added. - svuint64_t svld1[_u64](svbool_t pg, const uint64_t *base) + svuint64_t svld1<see href="svbool_t pg, const uint64_t *base">_u64</see> LD1D Zresult.D, Pg/Z, [Xarray, Xindex, LSL #3] LD1D Zresult.D, Pg/Z, [Xbase, #0, MUL VL] @@ -24292,7 +24292,7 @@ To be added. To be added. - svuint8_t svld1rq[_u8](svbool_t pg, const uint8_t *base) + svuint8_t svld1rq<see href="svbool_t pg, const uint8_t *base">_u8</see> LD1RQB Zresult.B, Pg/Z, [Xbase, #0] To be added. @@ -24321,7 +24321,7 @@ To be added. To be added. - svfloat64_t svld1rq[_f64](svbool_t pg, const float64_t *base) + svfloat64_t svld1rq<see href="svbool_t pg, const float64_t *base">_f64</see> LD1RQD Zresult.D, Pg/Z, [Xbase, #0] To be added. @@ -24350,7 +24350,7 @@ To be added. To be added. - svint16_t svld1rq[_s16](svbool_t pg, const int16_t *base) + svint16_t svld1rq<see href="svbool_t pg, const int16_t *base">_s16</see> LD1RQH Zresult.H, Pg/Z, [Xbase, #0] To be added. @@ -24379,7 +24379,7 @@ To be added. To be added. - svint32_t svld1rq[_s32](svbool_t pg, const int32_t *base) + svint32_t svld1rq<see href="svbool_t pg, const int32_t *base">_s32</see> LD1RQW Zresult.S, Pg/Z, [Xbase, #0] To be added. @@ -24408,7 +24408,7 @@ To be added. To be added. - svint64_t svld1rq[_s64](svbool_t pg, const int64_t *base) + svint64_t svld1rq<see href="svbool_t pg, const int64_t *base">_s64</see> LD1RQD Zresult.D, Pg/Z, [Xbase, #0] To be added. @@ -24437,7 +24437,7 @@ To be added. To be added. - svint8_t svld1rq[_s8](svbool_t pg, const int8_t *base) + svint8_t svld1rq<see href="svbool_t pg, const int8_t *base">_s8</see> LD1RQB Zresult.B, Pg/Z, [Xbase, #0] To be added. @@ -24466,7 +24466,7 @@ To be added. To be added. - svfloat32_t svld1rq[_f32](svbool_t pg, const float32_t *base) + svfloat32_t svld1rq<see href="svbool_t pg, const float32_t *base">_f32</see> LD1RQW Zresult.S, Pg/Z, [Xbase, #0] To be added. @@ -24495,7 +24495,7 @@ To be added. To be added. - svuint16_t svld1rq[_u16](svbool_t pg, const uint16_t *base) + svuint16_t svld1rq<see href="svbool_t pg, const uint16_t *base">_u16</see> LD1RQH Zresult.H, Pg/Z, [Xbase, #0] To be added. @@ -24524,7 +24524,7 @@ To be added. To be added. - svuint32_t svld1rq[_u32](svbool_t pg, const uint32_t *base) + svuint32_t svld1rq<see href="svbool_t pg, const uint32_t *base">_u32</see> LD1RQW Zresult.S, Pg/Z, [Xbase, #0] To be added. @@ -24553,7 +24553,7 @@ To be added. To be added. - svuint64_t svld1rq[_u64](svbool_t pg, const uint64_t *base) + svuint64_t svld1rq<see href="svbool_t pg, const uint64_t *base">_u64</see> LD1RQD Zresult.D, Pg/Z, [Xbase, #0] To be added. @@ -25824,7 +25824,7 @@ To be added. - svuint8_t svldnf1[_u8](svbool_t pg, const uint8_t *base) + svuint8_t svldnf1<see href="svbool_t pg, const uint8_t *base">_u8</see> LDNF1B Zresult.B, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -25851,7 +25851,7 @@ To be added. - svfloat64_t svldnf1[_f64](svbool_t pg, const float64_t *base) + svfloat64_t svldnf1<see href="svbool_t pg, const float64_t *base">_f64</see> LDNF1D Zresult.D, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -25878,7 +25878,7 @@ To be added. - svint16_t svldnf1[_s16](svbool_t pg, const int16_t *base) + svint16_t svldnf1<see href="svbool_t pg, const int16_t *base">_s16</see> LDNF1H Zresult.H, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -25905,7 +25905,7 @@ To be added. - svint32_t svldnf1[_s32](svbool_t pg, const int32_t *base) + svint32_t svldnf1<see href="svbool_t pg, const int32_t *base">_s32</see> LDNF1W Zresult.S, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -25932,7 +25932,7 @@ To be added. - svint64_t svldnf1[_s64](svbool_t pg, const int64_t *base) + svint64_t svldnf1<see href="svbool_t pg, const int64_t *base">_s64</see> LDNF1D Zresult.D, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -25959,7 +25959,7 @@ To be added. - svint8_t svldnf1[_s8](svbool_t pg, const int8_t *base) + svint8_t svldnf1<see href="svbool_t pg, const int8_t *base">_s8</see> LDNF1B Zresult.B, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -25986,7 +25986,7 @@ To be added. - svfloat32_t svldnf1[_f32](svbool_t pg, const float32_t *base) + svfloat32_t svldnf1<see href="svbool_t pg, const float32_t *base">_f32</see> LDNF1W Zresult.S, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -26013,7 +26013,7 @@ To be added. - svuint16_t svldnf1[_u16](svbool_t pg, const uint16_t *base) + svuint16_t svldnf1<see href="svbool_t pg, const uint16_t *base">_u16</see> LDNF1H Zresult.H, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -26040,7 +26040,7 @@ To be added. - svuint32_t svldnf1[_u32](svbool_t pg, const uint32_t *base) + svuint32_t svldnf1<see href="svbool_t pg, const uint32_t *base">_u32</see> LDNF1W Zresult.S, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -26067,7 +26067,7 @@ To be added. - svuint64_t svldnf1[_u64](svbool_t pg, const uint64_t *base) + svuint64_t svldnf1<see href="svbool_t pg, const uint64_t *base">_u64</see> LDNF1D Zresult.D, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -26096,7 +26096,7 @@ To be added. To be added. - svuint8_t svldnt1[_u8](svbool_t pg, const uint8_t *base) + svuint8_t svldnt1<see href="svbool_t pg, const uint8_t *base">_u8</see> LDNT1B Zresult.B, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -26125,7 +26125,7 @@ To be added. To be added. - svfloat64_t svldnt1[_f64](svbool_t pg, const float64_t *base) + svfloat64_t svldnt1<see href="svbool_t pg, const float64_t *base">_f64</see> LDNT1D Zresult.D, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -26154,7 +26154,7 @@ To be added. To be added. - svint16_t svldnt1[_s16](svbool_t pg, const int16_t *base) + svint16_t svldnt1<see href="svbool_t pg, const int16_t *base">_s16</see> LDNT1H Zresult.H, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -26183,7 +26183,7 @@ To be added. To be added. - svint32_t svldnt1[_s32](svbool_t pg, const int32_t *base) + svint32_t svldnt1<see href="svbool_t pg, const int32_t *base">_s32</see> LDNT1W Zresult.S, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -26212,7 +26212,7 @@ To be added. To be added. - svint64_t svldnt1[_s64](svbool_t pg, const int64_t *base) + svint64_t svldnt1<see href="svbool_t pg, const int64_t *base">_s64</see> LDNT1D Zresult.D, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -26241,7 +26241,7 @@ To be added. To be added. - svint8_t svldnt1[_s8](svbool_t pg, const int8_t *base) + svint8_t svldnt1<see href="svbool_t pg, const int8_t *base">_s8</see> LDNT1B Zresult.B, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -26270,7 +26270,7 @@ To be added. To be added. - svfloat32_t svldnt1[_f32](svbool_t pg, const float32_t *base) + svfloat32_t svldnt1<see href="svbool_t pg, const float32_t *base">_f32</see> LDNT1W Zresult.S, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -26299,7 +26299,7 @@ To be added. To be added. - svuint16_t svldnt1[_u16](svbool_t pg, const uint16_t *base) + svuint16_t svldnt1<see href="svbool_t pg, const uint16_t *base">_u16</see> LDNT1H Zresult.H, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -26328,7 +26328,7 @@ To be added. To be added. - svuint32_t svldnt1[_u32](svbool_t pg, const uint32_t *base) + svuint32_t svldnt1<see href="svbool_t pg, const uint32_t *base">_u32</see> LDNT1W Zresult.S, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -26357,7 +26357,7 @@ To be added. To be added. - svuint64_t svldnt1[_u64](svbool_t pg, const uint64_t *base) + svuint64_t svldnt1<see href="svbool_t pg, const uint64_t *base">_u64</see> LDNT1D Zresult.D, Pg/Z, [Xbase, #0, MUL VL] To be added. @@ -27699,7 +27699,7 @@ To be added. - uint8_t svmaxv[_u8](svbool_t pg, svuint8_t op) + uint8_t svmaxv<see href="svbool_t pg, svuint8_t op">_u8</see> UMAXV Bresult, Pg, Zop.B To be added. @@ -27727,7 +27727,7 @@ To be added. - float64_t svmaxv[_f64](svbool_t pg, svfloat64_t op) + float64_t svmaxv<see href="svbool_t pg, svfloat64_t op">_f64</see> FMAXV Dresult, Pg, Zop.D To be added. @@ -27755,7 +27755,7 @@ To be added. - int16_t svmaxv[_s16](svbool_t pg, svint16_t op) + int16_t svmaxv<see href="svbool_t pg, svint16_t op">_s16</see> SMAXV Hresult, Pg, Zop.H To be added. @@ -27783,7 +27783,7 @@ To be added. - int32_t svmaxv[_s32](svbool_t pg, svint32_t op) + int32_t svmaxv<see href="svbool_t pg, svint32_t op">_s32</see> SMAXV Sresult, Pg, Zop.S To be added. @@ -27811,7 +27811,7 @@ To be added. - int64_t svmaxv[_s64](svbool_t pg, svint64_t op) + int64_t svmaxv<see href="svbool_t pg, svint64_t op">_s64</see> SMAXV Dresult, Pg, Zop.D To be added. @@ -27839,7 +27839,7 @@ To be added. - int8_t svmaxv[_s8](svbool_t pg, svint8_t op) + int8_t svmaxv<see href="svbool_t pg, svint8_t op">_s8</see> SMAXV Bresult, Pg, Zop.B To be added. @@ -27867,7 +27867,7 @@ To be added. - float32_t svmaxv[_f32](svbool_t pg, svfloat32_t op) + float32_t svmaxv<see href="svbool_t pg, svfloat32_t op">_f32</see> FMAXV Sresult, Pg, Zop.S To be added. @@ -27895,7 +27895,7 @@ To be added. - uint16_t svmaxv[_u16](svbool_t pg, svuint16_t op) + uint16_t svmaxv<see href="svbool_t pg, svuint16_t op">_u16</see> UMAXV Hresult, Pg, Zop.H To be added. @@ -27923,7 +27923,7 @@ To be added. - uint32_t svmaxv[_u32](svbool_t pg, svuint32_t op) + uint32_t svmaxv<see href="svbool_t pg, svuint32_t op">_u32</see> UMAXV Sresult, Pg, Zop.S To be added. @@ -27951,7 +27951,7 @@ To be added. - uint64_t svmaxv[_u64](svbool_t pg, svuint64_t op) + uint64_t svmaxv<see href="svbool_t pg, svuint64_t op">_u64</see> UMAXV Dresult, Pg, Zop.D To be added. @@ -28045,7 +28045,7 @@ To be added. - float64_t svmaxnmv[_f64](svbool_t pg, svfloat64_t op) + float64_t svmaxnmv<see href="svbool_t pg, svfloat64_t op">_f64</see> FMAXNMV Dresult, Pg, Zop.D To be added. @@ -28073,7 +28073,7 @@ To be added. - float32_t svmaxnmv[_f32](svbool_t pg, svfloat32_t op) + float32_t svmaxnmv<see href="svbool_t pg, svfloat32_t op">_f32</see> FMAXNMV Sresult, Pg, Zop.S To be added. @@ -28431,7 +28431,7 @@ To be added. - uint8_t svminv[_u8](svbool_t pg, svuint8_t op) + uint8_t svminv<see href="svbool_t pg, svuint8_t op">_u8</see> UMINV Bresult, Pg, Zop.B To be added. @@ -28459,7 +28459,7 @@ To be added. - float64_t svminv[_f64](svbool_t pg, svfloat64_t op) + float64_t svminv<see href="svbool_t pg, svfloat64_t op">_f64</see> FMINV Dresult, Pg, Zop.D To be added. @@ -28487,7 +28487,7 @@ To be added. - int16_t svminv[_s16](svbool_t pg, svint16_t op) + int16_t svminv<see href="svbool_t pg, svint16_t op">_s16</see> SMINV Hresult, Pg, Zop.H To be added. @@ -28515,7 +28515,7 @@ To be added. - int32_t svminv[_s32](svbool_t pg, svint32_t op) + int32_t svminv<see href="svbool_t pg, svint32_t op">_s32</see> SMINV Sresult, Pg, Zop.S To be added. @@ -28543,7 +28543,7 @@ To be added. - int64_t svminv[_s64](svbool_t pg, svint64_t op) + int64_t svminv<see href="svbool_t pg, svint64_t op">_s64</see> SMINV Dresult, Pg, Zop.D To be added. @@ -28571,7 +28571,7 @@ To be added. - int8_t svminv[_s8](svbool_t pg, svint8_t op) + int8_t svminv<see href="svbool_t pg, svint8_t op">_s8</see> SMINV Bresult, Pg, Zop.B To be added. @@ -28599,7 +28599,7 @@ To be added. - float32_t svminv[_f32](svbool_t pg, svfloat32_t op) + float32_t svminv<see href="svbool_t pg, svfloat32_t op">_f32</see> FMINV Sresult, Pg, Zop.S To be added. @@ -28627,7 +28627,7 @@ To be added. - uint16_t svminv[_u16](svbool_t pg, svuint16_t op) + uint16_t svminv<see href="svbool_t pg, svuint16_t op">_u16</see> UMINV Hresult, Pg, Zop.H To be added. @@ -28655,7 +28655,7 @@ To be added. - uint32_t svminv[_u32](svbool_t pg, svuint32_t op) + uint32_t svminv<see href="svbool_t pg, svuint32_t op">_u32</see> UMINV Sresult, Pg, Zop.S To be added. @@ -28683,7 +28683,7 @@ To be added. - uint64_t svminv[_u64](svbool_t pg, svuint64_t op) + uint64_t svminv<see href="svbool_t pg, svuint64_t op">_u64</see> UMINV Dresult, Pg, Zop.D To be added. @@ -28777,7 +28777,7 @@ To be added. - float64_t svminnmv[_f64](svbool_t pg, svfloat64_t op) + float64_t svminnmv<see href="svbool_t pg, svfloat64_t op">_f64</see> FMINNMV Dresult, Pg, Zop.D To be added. @@ -28805,7 +28805,7 @@ To be added. - float32_t svminnmv[_f32](svbool_t pg, svfloat32_t op) + float32_t svminnmv<see href="svbool_t pg, svfloat32_t op">_f32</see> FMINNMV Sresult, Pg, Zop.S To be added. @@ -29545,7 +29545,7 @@ To be added. To be added. - svfloat32_t svcmla_lane[_f32](svfloat32_t op1, svfloat32_t op2, svfloat32_t op3, uint64_t imm_index, uint64_t imm_rotation) + svfloat32_t svcmla_lane<see href="svfloat32_t op1, svfloat32_t op2, svfloat32_t op3, uint64_t imm_index, uint64_t imm_rotation">_f32</see> FCMLA Ztied1.S, Zop2.S, Zop3.S[imm_index], #imm_rotation To be added. @@ -29584,7 +29584,7 @@ To be added. To be added. - svfloat64_t svmul_lane[_f64](svfloat64_t op1, svfloat64_t op2, uint64_t imm_index) + svfloat64_t svmul_lane<see href="svfloat64_t op1, svfloat64_t op2, uint64_t imm_index">_f64</see> FMUL Zresult.D, Zop1.D, Zop2.D[imm_index] To be added. @@ -29623,7 +29623,7 @@ To be added. To be added. - svfloat32_t svmul_lane[_f32](svfloat32_t op1, svfloat32_t op2, uint64_t imm_index) + svfloat32_t svmul_lane<see href="svfloat32_t op1, svfloat32_t op2, uint64_t imm_index">_f32</see> FMUL Zresult.S, Zop1.S, Zop2.S[imm_index] To be added. @@ -30671,7 +30671,7 @@ To be added. - uint8_t svorv[_u8](svbool_t pg, svuint8_t op) + uint8_t svorv<see href="svbool_t pg, svuint8_t op">_u8</see> ORV Bresult, Pg, Zop.B To be added. @@ -30699,7 +30699,7 @@ To be added. - int16_t svorv[_s16](svbool_t pg, svint16_t op) + int16_t svorv<see href="svbool_t pg, svint16_t op">_s16</see> ORV Hresult, Pg, Zop.H To be added. @@ -30727,7 +30727,7 @@ To be added. - int32_t svorv[_s32](svbool_t pg, svint32_t op) + int32_t svorv<see href="svbool_t pg, svint32_t op">_s32</see> ORV Sresult, Pg, Zop.S To be added. @@ -30755,7 +30755,7 @@ To be added. - int64_t svorv[_s64](svbool_t pg, svint64_t op) + int64_t svorv<see href="svbool_t pg, svint64_t op">_s64</see> ORV Dresult, Pg, Zop.D To be added. @@ -30783,7 +30783,7 @@ To be added. - int8_t svorv[_s8](svbool_t pg, svint8_t op) + int8_t svorv<see href="svbool_t pg, svint8_t op">_s8</see> ORV Bresult, Pg, Zop.B To be added. @@ -30811,7 +30811,7 @@ To be added. - uint16_t svorv[_u16](svbool_t pg, svuint16_t op) + uint16_t svorv<see href="svbool_t pg, svuint16_t op">_u16</see> ORV Hresult, Pg, Zop.H To be added. @@ -30839,7 +30839,7 @@ To be added. - uint32_t svorv[_u32](svbool_t pg, svuint32_t op) + uint32_t svorv<see href="svbool_t pg, svuint32_t op">_u32</see> ORV Sresult, Pg, Zop.S To be added. @@ -30867,7 +30867,7 @@ To be added. - uint64_t svorv[_u64](svbool_t pg, svuint64_t op) + uint64_t svorv<see href="svbool_t pg, svuint64_t op">_u64</see> ORV Dresult, Pg, Zop.D To be added. @@ -31343,7 +31343,7 @@ To be added. - svfloat64_t svrecpe[_f64](svfloat64_t op) + svfloat64_t svrecpe<see href="svfloat64_t op">_f64</see> FRECPE Zresult.D, Zop.D To be added. @@ -31371,7 +31371,7 @@ To be added. - svfloat32_t svrecpe[_f32](svfloat32_t op) + svfloat32_t svrecpe<see href="svfloat32_t op">_f32</see> FRECPE Zresult.S, Zop.S To be added. @@ -31459,7 +31459,7 @@ To be added. - svfloat64_t svrsqrte[_f64](svfloat64_t op) + svfloat64_t svrsqrte<see href="svfloat64_t op">_f64</see> FRSQRTE Zresult.D, Zop.D To be added. @@ -31487,7 +31487,7 @@ To be added. - svfloat32_t svrsqrte[_f32](svfloat32_t op) + svfloat32_t svrsqrte<see href="svfloat32_t op">_f32</see> FRSQRTE Zresult.S, Zop.S To be added. @@ -31517,7 +31517,7 @@ To be added. To be added. - svfloat64_t svrsqrts[_f64](svfloat64_t op1, svfloat64_t op2) + svfloat64_t svrsqrts<see href="svfloat64_t op1, svfloat64_t op2">_f64</see> FRSQRTS Zresult.D, Zop1.D, Zop2.D To be added. @@ -31547,7 +31547,7 @@ To be added. To be added. - svfloat32_t svrsqrts[_f32](svfloat32_t op1, svfloat32_t op2) + svfloat32_t svrsqrts<see href="svfloat32_t op1, svfloat32_t op2">_f32</see> FRSQRTS Zresult.S, Zop1.S, Zop2.S To be added. @@ -31577,7 +31577,7 @@ To be added. To be added. - svfloat64_t svrecps[_f64](svfloat64_t op1, svfloat64_t op2) + svfloat64_t svrecps<see href="svfloat64_t op1, svfloat64_t op2">_f64</see> FRECPS Zresult.D, Zop1.D, Zop2.D To be added. @@ -31607,7 +31607,7 @@ To be added. To be added. - svfloat32_t svrecps[_f32](svfloat32_t op1, svfloat32_t op2) + svfloat32_t svrecps<see href="svfloat32_t op1, svfloat32_t op2">_f32</see> FRECPS Zresult.S, Zop1.S, Zop2.S To be added. @@ -31875,7 +31875,7 @@ To be added. - svuint8_t svrev[_u8](svuint8_t op) + svuint8_t svrev<see href="svuint8_t op">_u8</see> REV Zresult.B, Zop.B To be added. @@ -31903,7 +31903,7 @@ To be added. - svfloat64_t svrev[_f64](svfloat64_t op) + svfloat64_t svrev<see href="svfloat64_t op">_f64</see> REV Zresult.D, Zop.D To be added. @@ -31931,7 +31931,7 @@ To be added. - svint16_t svrev[_s16](svint16_t op) + svint16_t svrev<see href="svint16_t op">_s16</see> REV Zresult.H, Zop.H To be added. @@ -31959,7 +31959,7 @@ To be added. - svint32_t svrev[_s32](svint32_t op) + svint32_t svrev<see href="svint32_t op">_s32</see> REV Zresult.S, Zop.S To be added. @@ -31987,7 +31987,7 @@ To be added. - svint64_t svrev[_s64](svint64_t op) + svint64_t svrev<see href="svint64_t op">_s64</see> REV Zresult.D, Zop.D To be added. @@ -32015,7 +32015,7 @@ To be added. - svint8_t svrev[_s8](svint8_t op) + svint8_t svrev<see href="svint8_t op">_s8</see> REV Zresult.B, Zop.B To be added. @@ -32043,7 +32043,7 @@ To be added. - svfloat32_t svrev[_f32](svfloat32_t op) + svfloat32_t svrev<see href="svfloat32_t op">_f32</see> REV Zresult.S, Zop.S To be added. @@ -32071,7 +32071,7 @@ To be added. - svuint16_t svrev[_u16](svuint16_t op) + svuint16_t svrev<see href="svuint16_t op">_u16</see> REV Zresult.H, Zop.H To be added. @@ -32099,7 +32099,7 @@ To be added. - svuint32_t svrev[_u32](svuint32_t op) + svuint32_t svrev<see href="svuint32_t op">_u32</see> REV Zresult.S, Zop.S To be added. @@ -32127,7 +32127,7 @@ To be added. - svuint64_t svrev[_u64](svuint64_t op) + svuint64_t svrev<see href="svuint64_t op">_u64</see> REV Zresult.D, Zop.D To be added. @@ -32832,7 +32832,7 @@ To be added. To be added. - int32_t svqdech_pat[_n_s32](int32_t op, enum svpattern pattern, uint64_t imm_factor) + int32_t svqdech_pat<see href="int32_t op, enum svpattern pattern, uint64_t imm_factor">_n_s32</see> SQDECH Xtied, Wtied, pattern, MUL #imm_factor To be added. @@ -32877,7 +32877,7 @@ To be added. To be added. - int64_t svqdech_pat[_n_s64](int64_t op, enum svpattern pattern, uint64_t imm_factor) + int64_t svqdech_pat<see href="int64_t op, enum svpattern pattern, uint64_t imm_factor">_n_s64</see> SQDECH Xtied, pattern, MUL #imm_factor To be added. @@ -32922,7 +32922,7 @@ To be added. To be added. - svint16_t svqdech_pat[_s16](svint16_t op, enum svpattern pattern, uint64_t imm_factor) + svint16_t svqdech_pat<see href="svint16_t op, enum svpattern pattern, uint64_t imm_factor">_s16</see> SQDECH Ztied.H, pattern, MUL #imm_factor To be added. @@ -32967,7 +32967,7 @@ To be added. To be added. - svuint16_t svqdech_pat[_u16](svuint16_t op, enum svpattern pattern, uint64_t imm_factor) + svuint16_t svqdech_pat<see href="svuint16_t op, enum svpattern pattern, uint64_t imm_factor">_u16</see> UQDECH Ztied.H, pattern, MUL #imm_factor To be added. @@ -33012,7 +33012,7 @@ To be added. To be added. - uint32_t svqdech_pat[_n_u32](uint32_t op, enum svpattern pattern, uint64_t imm_factor) + uint32_t svqdech_pat<see href="uint32_t op, enum svpattern pattern, uint64_t imm_factor">_n_u32</see> UQDECH Wtied, pattern, MUL #imm_factor To be added. @@ -33057,7 +33057,7 @@ To be added. To be added. - uint64_t svqdech_pat[_n_u64](uint64_t op, enum svpattern pattern, uint64_t imm_factor) + uint64_t svqdech_pat<see href="uint64_t op, enum svpattern pattern, uint64_t imm_factor">_n_u64</see> UQDECH Xtied, pattern, MUL #imm_factor To be added. @@ -33102,7 +33102,7 @@ To be added. To be added. - int32_t svqdecw_pat[_n_s32](int32_t op, enum svpattern pattern, uint64_t imm_factor) + int32_t svqdecw_pat<see href="int32_t op, enum svpattern pattern, uint64_t imm_factor">_n_s32</see> SQDECW Xtied, Wtied, pattern, MUL #imm_factor To be added. @@ -33147,7 +33147,7 @@ To be added. To be added. - int64_t svqdecw_pat[_n_s64](int64_t op, enum svpattern pattern, uint64_t imm_factor) + int64_t svqdecw_pat<see href="int64_t op, enum svpattern pattern, uint64_t imm_factor">_n_s64</see> SQDECW Xtied, pattern, MUL #imm_factor To be added. @@ -33192,7 +33192,7 @@ To be added. To be added. - svint32_t svqdecw_pat[_s32](svint32_t op, enum svpattern pattern, uint64_t imm_factor) + svint32_t svqdecw_pat<see href="svint32_t op, enum svpattern pattern, uint64_t imm_factor">_s32</see> SQDECW Ztied.S, pattern, MUL #imm_factor To be added. @@ -33237,7 +33237,7 @@ To be added. To be added. - svuint32_t svqdecw_pat[_u32](svuint32_t op, enum svpattern pattern, uint64_t imm_factor) + svuint32_t svqdecw_pat<see href="svuint32_t op, enum svpattern pattern, uint64_t imm_factor">_u32</see> UQDECW Ztied.S, pattern, MUL #imm_factor To be added. @@ -33282,7 +33282,7 @@ To be added. To be added. - uint32_t svqdecw_pat[_n_u32](uint32_t op, enum svpattern pattern, uint64_t imm_factor) + uint32_t svqdecw_pat<see href="uint32_t op, enum svpattern pattern, uint64_t imm_factor">_n_u32</see> UQDECW Wtied, pattern, MUL #imm_factor To be added. @@ -33327,7 +33327,7 @@ To be added. To be added. - uint64_t svqdecw_pat[_n_u64](uint64_t op, enum svpattern pattern, uint64_t imm_factor) + uint64_t svqdecw_pat<see href="uint64_t op, enum svpattern pattern, uint64_t imm_factor">_n_u64</see> UQDECW Xtied, pattern, MUL #imm_factor To be added. @@ -33372,7 +33372,7 @@ To be added. To be added. - int32_t svqdecd_pat[_n_s32](int32_t op, enum svpattern pattern, uint64_t imm_factor) + int32_t svqdecd_pat<see href="int32_t op, enum svpattern pattern, uint64_t imm_factor">_n_s32</see> SQDECD Xtied, Wtied, pattern, MUL #imm_factor To be added. @@ -33417,7 +33417,7 @@ To be added. To be added. - int64_t svqdecd_pat[_n_s64](int64_t op, enum svpattern pattern, uint64_t imm_factor) + int64_t svqdecd_pat<see href="int64_t op, enum svpattern pattern, uint64_t imm_factor">_n_s64</see> SQDECD Xtied, pattern, MUL #imm_factor To be added. @@ -33462,7 +33462,7 @@ To be added. To be added. - svint64_t svqdecd_pat[_s64](svint64_t op, enum svpattern pattern, uint64_t imm_factor) + svint64_t svqdecd_pat<see href="svint64_t op, enum svpattern pattern, uint64_t imm_factor">_s64</see> SQDECD Ztied.D, pattern, MUL #imm_factor To be added. @@ -33507,7 +33507,7 @@ To be added. To be added. - svuint64_t svqdecd_pat[_u64](svuint64_t op, enum svpattern pattern, uint64_t imm_factor) + svuint64_t svqdecd_pat<see href="svuint64_t op, enum svpattern pattern, uint64_t imm_factor">_u64</see> UQDECD Ztied.D, pattern, MUL #imm_factor To be added. @@ -33552,7 +33552,7 @@ To be added. To be added. - uint32_t svqdecd_pat[_n_u32](uint32_t op, enum svpattern pattern, uint64_t imm_factor) + uint32_t svqdecd_pat<see href="uint32_t op, enum svpattern pattern, uint64_t imm_factor">_n_u32</see> UQDECD Wtied, pattern, MUL #imm_factor To be added. @@ -33597,7 +33597,7 @@ To be added. To be added. - uint64_t svqdecd_pat[_n_u64](uint64_t op, enum svpattern pattern, uint64_t imm_factor) + uint64_t svqdecd_pat<see href="uint64_t op, enum svpattern pattern, uint64_t imm_factor">_n_u64</see> UQDECD Xtied, pattern, MUL #imm_factor To be added. @@ -33642,7 +33642,7 @@ To be added. To be added. - int32_t svqdecb_pat[_n_s32](int32_t op, enum svpattern pattern, uint64_t imm_factor) + int32_t svqdecb_pat<see href="int32_t op, enum svpattern pattern, uint64_t imm_factor">_n_s32</see> SQDECB Xtied, Wtied, pattern, MUL #imm_factor To be added. @@ -33687,7 +33687,7 @@ To be added. To be added. - int64_t svqdecb_pat[_n_s64](int64_t op, enum svpattern pattern, uint64_t imm_factor) + int64_t svqdecb_pat<see href="int64_t op, enum svpattern pattern, uint64_t imm_factor">_n_s64</see> SQDECB Xtied, pattern, MUL #imm_factor To be added. @@ -33732,7 +33732,7 @@ To be added. To be added. - uint32_t svqdecb_pat[_n_u32](uint32_t op, enum svpattern pattern, uint64_t imm_factor) + uint32_t svqdecb_pat<see href="uint32_t op, enum svpattern pattern, uint64_t imm_factor">_n_u32</see> UQDECB Wtied, pattern, MUL #imm_factor To be added. @@ -33777,7 +33777,7 @@ To be added. To be added. - uint64_t svqdecb_pat[_n_u64](uint64_t op, enum svpattern pattern, uint64_t imm_factor) + uint64_t svqdecb_pat<see href="uint64_t op, enum svpattern pattern, uint64_t imm_factor">_n_u64</see> UQDECB Xtied, pattern, MUL #imm_factor To be added. @@ -34047,7 +34047,7 @@ To be added. To be added. - svint16_t svqdecp[_s16](svint16_t op, svbool_t pg) + svint16_t svqdecp<see href="svint16_t op, svbool_t pg">_s16</see> SQDECP Ztied.H, Pg To be added. @@ -34077,7 +34077,7 @@ To be added. To be added. - svint32_t svqdecp[_s32](svint32_t op, svbool_t pg) + svint32_t svqdecp<see href="svint32_t op, svbool_t pg">_s32</see> SQDECP Ztied.S, Pg To be added. @@ -34107,7 +34107,7 @@ To be added. To be added. - svint64_t svqdecp[_s64](svint64_t op, svbool_t pg) + svint64_t svqdecp<see href="svint64_t op, svbool_t pg">_s64</see> SQDECP Ztied.D, Pg To be added. @@ -34137,7 +34137,7 @@ To be added. To be added. - svuint16_t svqdecp[_u16](svuint16_t op, svbool_t pg) + svuint16_t svqdecp<see href="svuint16_t op, svbool_t pg">_u16</see> UQDECP Ztied.H, Pg To be added. @@ -34167,7 +34167,7 @@ To be added. To be added. - svuint32_t svqdecp[_u32](svuint32_t op, svbool_t pg) + svuint32_t svqdecp<see href="svuint32_t op, svbool_t pg">_u32</see> UQDECP Ztied.S, Pg To be added. @@ -34197,7 +34197,7 @@ To be added. To be added. - svuint64_t svqdecp[_u64](svuint64_t op, svbool_t pg) + svuint64_t svqdecp<see href="svuint64_t op, svbool_t pg">_u64</see> UQDECP Ztied.D, Pg To be added. @@ -34482,7 +34482,7 @@ To be added. To be added. - int32_t svqinch_pat[_n_s32](int32_t op, enum svpattern pattern, uint64_t imm_factor) + int32_t svqinch_pat<see href="int32_t op, enum svpattern pattern, uint64_t imm_factor">_n_s32</see> SQINCH Xtied, Wtied, pattern, MUL #imm_factor To be added. @@ -34527,7 +34527,7 @@ To be added. To be added. - int64_t svqinch_pat[_n_s64](int64_t op, enum svpattern pattern, uint64_t imm_factor) + int64_t svqinch_pat<see href="int64_t op, enum svpattern pattern, uint64_t imm_factor">_n_s64</see> SQINCH Xtied, pattern, MUL #imm_factor To be added. @@ -34572,7 +34572,7 @@ To be added. To be added. - svint16_t svqinch_pat[_s16](svint16_t op, enum svpattern pattern, uint64_t imm_factor) + svint16_t svqinch_pat<see href="svint16_t op, enum svpattern pattern, uint64_t imm_factor">_s16</see> SQINCH Ztied.H, pattern, MUL #imm_factor To be added. @@ -34617,7 +34617,7 @@ To be added. To be added. - svuint16_t svqinch_pat[_u16](svuint16_t op, enum svpattern pattern, uint64_t imm_factor) + svuint16_t svqinch_pat<see href="svuint16_t op, enum svpattern pattern, uint64_t imm_factor">_u16</see> UQINCH Ztied.H, pattern, MUL #imm_factor To be added. @@ -34662,7 +34662,7 @@ To be added. To be added. - uint32_t svqinch_pat[_n_u32](uint32_t op, enum svpattern pattern, uint64_t imm_factor) + uint32_t svqinch_pat<see href="uint32_t op, enum svpattern pattern, uint64_t imm_factor">_n_u32</see> UQINCH Wtied, pattern, MUL #imm_factor To be added. @@ -34707,7 +34707,7 @@ To be added. To be added. - uint64_t svqinch_pat[_n_u64](uint64_t op, enum svpattern pattern, uint64_t imm_factor) + uint64_t svqinch_pat<see href="uint64_t op, enum svpattern pattern, uint64_t imm_factor">_n_u64</see> UQINCH Xtied, pattern, MUL #imm_factor To be added. @@ -34752,7 +34752,7 @@ To be added. To be added. - int32_t svqincw_pat[_n_s32](int32_t op, enum svpattern pattern, uint64_t imm_factor) + int32_t svqincw_pat<see href="int32_t op, enum svpattern pattern, uint64_t imm_factor">_n_s32</see> SQINCW Xtied, Wtied, pattern, MUL #imm_factor To be added. @@ -34797,7 +34797,7 @@ To be added. To be added. - int64_t svqincw_pat[_n_s64](int64_t op, enum svpattern pattern, uint64_t imm_factor) + int64_t svqincw_pat<see href="int64_t op, enum svpattern pattern, uint64_t imm_factor">_n_s64</see> SQINCW Xtied, pattern, MUL #imm_factor To be added. @@ -34842,7 +34842,7 @@ To be added. To be added. - svint32_t svqincw_pat[_s32](svint32_t op, enum svpattern pattern, uint64_t imm_factor) + svint32_t svqincw_pat<see href="svint32_t op, enum svpattern pattern, uint64_t imm_factor">_s32</see> SQINCW Ztied.S, pattern, MUL #imm_factor To be added. @@ -34887,7 +34887,7 @@ To be added. To be added. - svuint32_t svqincw_pat[_u32](svuint32_t op, enum svpattern pattern, uint64_t imm_factor) + svuint32_t svqincw_pat<see href="svuint32_t op, enum svpattern pattern, uint64_t imm_factor">_u32</see> UQINCW Ztied.S, pattern, MUL #imm_factor To be added. @@ -34932,7 +34932,7 @@ To be added. To be added. - uint32_t svqincw_pat[_n_u32](uint32_t op, enum svpattern pattern, uint64_t imm_factor) + uint32_t svqincw_pat<see href="uint32_t op, enum svpattern pattern, uint64_t imm_factor">_n_u32</see> UQINCW Wtied, pattern, MUL #imm_factor To be added. @@ -34977,7 +34977,7 @@ To be added. To be added. - uint64_t svqincw_pat[_n_u64](uint64_t op, enum svpattern pattern, uint64_t imm_factor) + uint64_t svqincw_pat<see href="uint64_t op, enum svpattern pattern, uint64_t imm_factor">_n_u64</see> UQINCW Xtied, pattern, MUL #imm_factor To be added. @@ -35022,7 +35022,7 @@ To be added. To be added. - int32_t svqincd_pat[_n_s32](int32_t op, enum svpattern pattern, uint64_t imm_factor) + int32_t svqincd_pat<see href="int32_t op, enum svpattern pattern, uint64_t imm_factor">_n_s32</see> SQINCD Xtied, Wtied, pattern, MUL #imm_factor To be added. @@ -35067,7 +35067,7 @@ To be added. To be added. - int64_t svqincd_pat[_n_s64](int64_t op, enum svpattern pattern, uint64_t imm_factor) + int64_t svqincd_pat<see href="int64_t op, enum svpattern pattern, uint64_t imm_factor">_n_s64</see> SQINCD Xtied, pattern, MUL #imm_factor To be added. @@ -35112,7 +35112,7 @@ To be added. To be added. - svint64_t svqincd_pat[_s64](svint64_t op, enum svpattern pattern, uint64_t imm_factor) + svint64_t svqincd_pat<see href="svint64_t op, enum svpattern pattern, uint64_t imm_factor">_s64</see> SQINCD Ztied.D, pattern, MUL #imm_factor To be added. @@ -35157,7 +35157,7 @@ To be added. To be added. - svuint64_t svqincd_pat[_u64](svuint64_t op, enum svpattern pattern, uint64_t imm_factor) + svuint64_t svqincd_pat<see href="svuint64_t op, enum svpattern pattern, uint64_t imm_factor">_u64</see> UQINCD Ztied.D, pattern, MUL #imm_factor To be added. @@ -35202,7 +35202,7 @@ To be added. To be added. - uint32_t svqincd_pat[_n_u32](uint32_t op, enum svpattern pattern, uint64_t imm_factor) + uint32_t svqincd_pat<see href="uint32_t op, enum svpattern pattern, uint64_t imm_factor">_n_u32</see> UQINCD Wtied, pattern, MUL #imm_factor To be added. @@ -35247,7 +35247,7 @@ To be added. To be added. - uint64_t svqincd_pat[_n_u64](uint64_t op, enum svpattern pattern, uint64_t imm_factor) + uint64_t svqincd_pat<see href="uint64_t op, enum svpattern pattern, uint64_t imm_factor">_n_u64</see> UQINCD Xtied, pattern, MUL #imm_factor To be added. @@ -35292,7 +35292,7 @@ To be added. To be added. - int32_t svqincb_pat[_n_s32](int32_t op, enum svpattern pattern, uint64_t imm_factor) + int32_t svqincb_pat<see href="int32_t op, enum svpattern pattern, uint64_t imm_factor">_n_s32</see> SQINCB Xtied, Wtied, pattern, MUL #imm_factor To be added. @@ -35337,7 +35337,7 @@ To be added. To be added. - int64_t svqincb_pat[_n_s64](int64_t op, enum svpattern pattern, uint64_t imm_factor) + int64_t svqincb_pat<see href="int64_t op, enum svpattern pattern, uint64_t imm_factor">_n_s64</see> SQINCB Xtied, pattern, MUL #imm_factor To be added. @@ -35382,7 +35382,7 @@ To be added. To be added. - uint32_t svqincb_pat[_n_u32](uint32_t op, enum svpattern pattern, uint64_t imm_factor) + uint32_t svqincb_pat<see href="uint32_t op, enum svpattern pattern, uint64_t imm_factor">_n_u32</see> UQINCB Wtied, pattern, MUL #imm_factor To be added. @@ -35427,7 +35427,7 @@ To be added. To be added. - uint64_t svqincb_pat[_n_u64](uint64_t op, enum svpattern pattern, uint64_t imm_factor) + uint64_t svqincb_pat<see href="uint64_t op, enum svpattern pattern, uint64_t imm_factor">_n_u64</see> UQINCB Xtied, pattern, MUL #imm_factor To be added. @@ -35697,7 +35697,7 @@ To be added. To be added. - svint16_t svqincp[_s16](svint16_t op, svbool_t pg) + svint16_t svqincp<see href="svint16_t op, svbool_t pg">_s16</see> SQINCP Ztied.H, Pg To be added. @@ -35727,7 +35727,7 @@ To be added. To be added. - svint32_t svqincp[_s32](svint32_t op, svbool_t pg) + svint32_t svqincp<see href="svint32_t op, svbool_t pg">_s32</see> SQINCP Ztied.S, Pg To be added. @@ -35757,7 +35757,7 @@ To be added. To be added. - svint64_t svqincp[_s64](svint64_t op, svbool_t pg) + svint64_t svqincp<see href="svint64_t op, svbool_t pg">_s64</see> SQINCP Ztied.D, Pg To be added. @@ -35787,7 +35787,7 @@ To be added. To be added. - svuint16_t svqincp[_u16](svuint16_t op, svbool_t pg) + svuint16_t svqincp<see href="svuint16_t op, svbool_t pg">_u16</see> UQINCP Ztied.H, Pg To be added. @@ -35817,7 +35817,7 @@ To be added. To be added. - svuint32_t svqincp[_u32](svuint32_t op, svbool_t pg) + svuint32_t svqincp<see href="svuint32_t op, svbool_t pg">_u32</see> UQINCP Ztied.S, Pg To be added. @@ -35847,7 +35847,7 @@ To be added. To be added. - svuint64_t svqincp[_u64](svuint64_t op, svbool_t pg) + svuint64_t svqincp<see href="svuint64_t op, svbool_t pg">_u64</see> UQINCP Ztied.D, Pg To be added. @@ -36183,7 +36183,7 @@ To be added. To be added. - void svst1_scatter[_u64base_f64](svbool_t pg, svuint64_t bases, svfloat64_t data) + void svst1_scatter<see href="svbool_t pg, svuint64_t bases, svfloat64_t data">_u64base_f64</see> ST1D Zdata.D, Pg, [Zbases.D, #0] To be added. @@ -36214,7 +36214,7 @@ To be added. To be added. - void svst1_scatter[_u64base_s64](svbool_t pg, svuint64_t bases, svint64_t data) + void svst1_scatter<see href="svbool_t pg, svuint64_t bases, svint64_t data">_u64base_s64</see> ST1D Zdata.D, Pg, [Zbases.D, #0] To be added. @@ -36245,7 +36245,7 @@ To be added. To be added. - void svst1_scatter[_u64base_u64](svbool_t pg, svuint64_t bases, svuint64_t data) + void svst1_scatter<see href="svbool_t pg, svuint64_t bases, svuint64_t data">_u64base_u64</see> ST1D Zdata.D, Pg, [Zbases.D, #0] To be added. @@ -36277,7 +36277,7 @@ To be added. To be added. - void svst1_scatter_[s64]offset[_f64](svbool_t pg, float64_t *base, svint64_t offsets, svfloat64_t data) + void svst1_scatter_<see href="svbool_t pg, float64_t *base, svint64_t offsets, svfloat64_t data">s64]offset[_f64</see> ST1D Zdata.D, Pg, [Xbase, Zoffsets.D] To be added. @@ -36309,7 +36309,7 @@ To be added. To be added. - void svst1_scatter_[u64]offset[_f64](svbool_t pg, float64_t *base, svuint64_t offsets, svfloat64_t data) + void svst1_scatter_<see href="svbool_t pg, float64_t *base, svuint64_t offsets, svfloat64_t data">u64]offset[_f64</see> ST1D Zdata.D, Pg, [Xbase, Zoffsets.D] To be added. @@ -36341,7 +36341,7 @@ To be added. To be added. - void svst1_scatter_[s32]offset[_s32](svbool_t pg, int32_t *base, svint32_t offsets, svint32_t data) + void svst1_scatter_<see href="svbool_t pg, int32_t *base, svint32_t offsets, svint32_t data">s32]offset[_s32</see> ST1W Zdata.S, Pg, [Xbase, Zoffsets.S, SXTW] To be added. @@ -36373,7 +36373,7 @@ To be added. To be added. - void svst1_scatter_[u32]offset[_s32](svbool_t pg, int32_t *base, svuint32_t offsets, svint32_t data) + void svst1_scatter_<see href="svbool_t pg, int32_t *base, svuint32_t offsets, svint32_t data">u32]offset[_s32</see> ST1W Zdata.S, Pg, [Xbase, Zoffsets.S, UXTW] To be added. @@ -36405,7 +36405,7 @@ To be added. To be added. - void svst1_scatter_[s64]offset[_s64](svbool_t pg, int64_t *base, svint64_t offsets, svint64_t data) + void svst1_scatter_<see href="svbool_t pg, int64_t *base, svint64_t offsets, svint64_t data">s64]offset[_s64</see> ST1D Zdata.D, Pg, [Xbase, Zoffsets.D] To be added. @@ -36437,7 +36437,7 @@ To be added. To be added. - void svst1_scatter_[u64]offset[_s64](svbool_t pg, int64_t *base, svuint64_t offsets, svint64_t data) + void svst1_scatter_<see href="svbool_t pg, int64_t *base, svuint64_t offsets, svint64_t data">u64]offset[_s64</see> ST1D Zdata.D, Pg, [Xbase, Zoffsets.D] To be added. @@ -36469,7 +36469,7 @@ To be added. To be added. - void svst1_scatter_[s32]offset[_f32](svbool_t pg, float32_t *base, svint32_t offsets, svfloat32_t data) + void svst1_scatter_<see href="svbool_t pg, float32_t *base, svint32_t offsets, svfloat32_t data">s32]offset[_f32</see> ST1W Zdata.S, Pg, [Xbase, Zoffsets.S, SXTW] To be added. @@ -36501,7 +36501,7 @@ To be added. To be added. - void svst1_scatter_[u32]offset[_f32](svbool_t pg, float32_t *base, svuint32_t offsets, svfloat32_t data) + void svst1_scatter_<see href="svbool_t pg, float32_t *base, svuint32_t offsets, svfloat32_t data">u32]offset[_f32</see> ST1W Zdata.S, Pg, [Xbase, Zoffsets.S, UXTW] To be added. @@ -36533,7 +36533,7 @@ To be added. To be added. - void svst1_scatter_[s32]offset[_u32](svbool_t pg, uint32_t *base, svint32_t offsets, svuint32_t data) + void svst1_scatter_<see href="svbool_t pg, uint32_t *base, svint32_t offsets, svuint32_t data">s32]offset[_u32</see> ST1W Zdata.S, Pg, [Xbase, Zoffsets.S, SXTW] To be added. @@ -36565,7 +36565,7 @@ To be added. To be added. - void svst1_scatter_[u32]offset[_u32](svbool_t pg, uint32_t *base, svuint32_t offsets, svuint32_t data) + void svst1_scatter_<see href="svbool_t pg, uint32_t *base, svuint32_t offsets, svuint32_t data">u32]offset[_u32</see> ST1W Zdata.S, Pg, [Xbase, Zoffsets.S, UXTW] To be added. @@ -36597,7 +36597,7 @@ To be added. To be added. - void svst1_scatter_[s64]offset[_u64](svbool_t pg, uint64_t *base, svint64_t offsets, svuint64_t data) + void svst1_scatter_<see href="svbool_t pg, uint64_t *base, svint64_t offsets, svuint64_t data">s64]offset[_u64</see> ST1D Zdata.D, Pg, [Xbase, Zoffsets.D] To be added. @@ -36629,7 +36629,7 @@ To be added. To be added. - void svst1_scatter_[u64]offset[_u64](svbool_t pg, uint64_t *base, svuint64_t offsets, svuint64_t data) + void svst1_scatter_<see href="svbool_t pg, uint64_t *base, svuint64_t offsets, svuint64_t data">u64]offset[_u64</see> ST1D Zdata.D, Pg, [Xbase, Zoffsets.D] To be added. @@ -36660,7 +36660,7 @@ To be added. To be added. - void svst1h_scatter[_u64base_s64](svbool_t pg, svuint64_t bases, svint64_t data) + void svst1h_scatter<see href="svbool_t pg, svuint64_t bases, svint64_t data">_u64base_s64</see> ST1H Zdata.D, Pg, [Zbases.D, #0] To be added. @@ -36691,7 +36691,7 @@ To be added. To be added. - void svst1h_scatter[_u64base_u64](svbool_t pg, svuint64_t bases, svuint64_t data) + void svst1h_scatter<see href="svbool_t pg, svuint64_t bases, svuint64_t data">_u64base_u64</see> ST1H Zdata.D, Pg, [Zbases.D, #0] To be added. @@ -36723,7 +36723,7 @@ To be added. To be added. - void svst1h_scatter_[s32]offset[_s32](svbool_t pg, int16_t *base, svint32_t offsets, svint32_t data) + void svst1h_scatter_<see href="svbool_t pg, int16_t *base, svint32_t offsets, svint32_t data">s32]offset[_s32</see> ST1H Zdata.S, Pg, [Xbase, Zoffsets.S, SXTW] To be added. @@ -36755,7 +36755,7 @@ To be added. To be added. - void svst1h_scatter_[u32]offset[_s32](svbool_t pg, int16_t *base, svuint32_t offsets, svint32_t data) + void svst1h_scatter_<see href="svbool_t pg, int16_t *base, svuint32_t offsets, svint32_t data">u32]offset[_s32</see> ST1H Zdata.S, Pg, [Xbase, Zoffsets.S, UXTW] To be added. @@ -36787,7 +36787,7 @@ To be added. To be added. - void svst1h_scatter_[s64]offset[_s64](svbool_t pg, int16_t *base, svint64_t offsets, svint64_t data) + void svst1h_scatter_<see href="svbool_t pg, int16_t *base, svint64_t offsets, svint64_t data">s64]offset[_s64</see> ST1H Zdata.D, Pg, [Xbase, Zoffsets.D] To be added. @@ -36819,7 +36819,7 @@ To be added. To be added. - void svst1h_scatter_[u64]offset[_s64](svbool_t pg, int16_t *base, svuint64_t offsets, svint64_t data) + void svst1h_scatter_<see href="svbool_t pg, int16_t *base, svuint64_t offsets, svint64_t data">u64]offset[_s64</see> ST1H Zdata.D, Pg, [Xbase, Zoffsets.D] To be added. @@ -36851,7 +36851,7 @@ To be added. To be added. - void svst1h_scatter_[s32]offset[_u32](svbool_t pg, uint16_t *base, svint32_t offsets, svuint32_t data) + void svst1h_scatter_<see href="svbool_t pg, uint16_t *base, svint32_t offsets, svuint32_t data">s32]offset[_u32</see> ST1H Zdata.S, Pg, [Xbase, Zoffsets.S, SXTW] To be added. @@ -36883,7 +36883,7 @@ To be added. To be added. - void svst1h_scatter_[u32]offset[_u32](svbool_t pg, uint16_t *base, svuint32_t offsets, svuint32_t data) + void svst1h_scatter_<see href="svbool_t pg, uint16_t *base, svuint32_t offsets, svuint32_t data">u32]offset[_u32</see> ST1H Zdata.S, Pg, [Xbase, Zoffsets.S, UXTW] To be added. @@ -36915,7 +36915,7 @@ To be added. To be added. - void svst1h_scatter_[s64]offset[_u64](svbool_t pg, uint16_t *base, svint64_t offsets, svuint64_t data) + void svst1h_scatter_<see href="svbool_t pg, uint16_t *base, svint64_t offsets, svuint64_t data">s64]offset[_u64</see> ST1H Zdata.D, Pg, [Xbase, Zoffsets.D] To be added. @@ -36947,7 +36947,7 @@ To be added. To be added. - void svst1h_scatter_[u64]offset[_u64](svbool_t pg, uint16_t *base, svuint64_t offsets, svuint64_t data) + void svst1h_scatter_<see href="svbool_t pg, uint16_t *base, svuint64_t offsets, svuint64_t data">u64]offset[_u64</see> ST1H Zdata.D, Pg, [Xbase, Zoffsets.D] To be added. @@ -36978,7 +36978,7 @@ To be added. To be added. - void svst1w_scatter[_u64base_s64](svbool_t pg, svuint64_t bases, svint64_t data) + void svst1w_scatter<see href="svbool_t pg, svuint64_t bases, svint64_t data">_u64base_s64</see> ST1W Zdata.D, Pg, [Zbases.D, #0] To be added. @@ -37009,7 +37009,7 @@ To be added. To be added. - void svst1w_scatter[_u64base_u64](svbool_t pg, svuint64_t bases, svuint64_t data) + void svst1w_scatter<see href="svbool_t pg, svuint64_t bases, svuint64_t data">_u64base_u64</see> ST1W Zdata.D, Pg, [Zbases.D, #0] To be added. @@ -37041,7 +37041,7 @@ To be added. To be added. - void svst1w_scatter_[s64]offset[_s64](svbool_t pg, int32_t *base, svint64_t offsets, svint64_t data) + void svst1w_scatter_<see href="svbool_t pg, int32_t *base, svint64_t offsets, svint64_t data">s64]offset[_s64</see> ST1W Zdata.D, Pg, [Xbase, Zoffsets.D] To be added. @@ -37073,7 +37073,7 @@ To be added. To be added. - void svst1w_scatter_[u64]offset[_s64](svbool_t pg, int32_t *base, svuint64_t offsets, svint64_t data) + void svst1w_scatter_<see href="svbool_t pg, int32_t *base, svuint64_t offsets, svint64_t data">u64]offset[_s64</see> ST1W Zdata.D, Pg, [Xbase, Zoffsets.D] To be added. @@ -37105,7 +37105,7 @@ To be added. To be added. - void svst1w_scatter_[s64]offset[_u64](svbool_t pg, uint32_t *base, svint64_t offsets, svuint64_t data) + void svst1w_scatter_<see href="svbool_t pg, uint32_t *base, svint64_t offsets, svuint64_t data">s64]offset[_u64</see> ST1W Zdata.D, Pg, [Xbase, Zoffsets.D] To be added. @@ -37137,7 +37137,7 @@ To be added. To be added. - void svst1w_scatter_[u64]offset[_u64](svbool_t pg, uint32_t *base, svuint64_t offsets, svuint64_t data) + void svst1w_scatter_<see href="svbool_t pg, uint32_t *base, svuint64_t offsets, svuint64_t data">u64]offset[_u64</see> ST1W Zdata.D, Pg, [Xbase, Zoffsets.D] To be added. @@ -37168,7 +37168,7 @@ To be added. To be added. - void svst1b_scatter[_u64base_s64](svbool_t pg, svuint64_t bases, svint64_t data) + void svst1b_scatter<see href="svbool_t pg, svuint64_t bases, svint64_t data">_u64base_s64</see> ST1B Zdata.D, Pg, [Zbases.D, #0] To be added. @@ -37199,7 +37199,7 @@ To be added. To be added. - void svst1b_scatter[_u64base_u64](svbool_t pg, svuint64_t bases, svuint64_t data) + void svst1b_scatter<see href="svbool_t pg, svuint64_t bases, svuint64_t data">_u64base_u64</see> ST1B Zdata.D, Pg, [Zbases.D, #0] To be added. @@ -37231,7 +37231,7 @@ To be added. To be added. - void svst1b_scatter_[s32]offset[_s32](svbool_t pg, int8_t *base, svint32_t offsets, svint32_t data) + void svst1b_scatter_<see href="svbool_t pg, int8_t *base, svint32_t offsets, svint32_t data">s32]offset[_s32</see> ST1B Zdata.S, Pg, [Xbase, Zoffsets.S, SXTW] To be added. @@ -37263,7 +37263,7 @@ To be added. To be added. - void svst1b_scatter_[u32]offset[_s32](svbool_t pg, int8_t *base, svuint32_t offsets, svint32_t data) + void svst1b_scatter_<see href="svbool_t pg, int8_t *base, svuint32_t offsets, svint32_t data">u32]offset[_s32</see> ST1B Zdata.S, Pg, [Xbase, Zoffsets.S, UXTW] To be added. @@ -37295,7 +37295,7 @@ To be added. To be added. - void svst1b_scatter_[s64]offset[_s64](svbool_t pg, int8_t *base, svint64_t offsets, svint64_t data) + void svst1b_scatter_<see href="svbool_t pg, int8_t *base, svint64_t offsets, svint64_t data">s64]offset[_s64</see> ST1B Zdata.D, Pg, [Xbase, Zoffsets.D] To be added. @@ -37327,7 +37327,7 @@ To be added. To be added. - void svst1b_scatter_[u64]offset[_s64](svbool_t pg, int8_t *base, svuint64_t offsets, svint64_t data) + void svst1b_scatter_<see href="svbool_t pg, int8_t *base, svuint64_t offsets, svint64_t data">u64]offset[_s64</see> ST1B Zdata.D, Pg, [Xbase, Zoffsets.D] To be added. @@ -37359,7 +37359,7 @@ To be added. To be added. - void svst1b_scatter_[s32]offset[_u32](svbool_t pg, uint8_t *base, svint32_t offsets, svuint32_t data) + void svst1b_scatter_<see href="svbool_t pg, uint8_t *base, svint32_t offsets, svuint32_t data">s32]offset[_u32</see> ST1B Zdata.S, Pg, [Xbase, Zoffsets.S, SXTW] To be added. @@ -37391,7 +37391,7 @@ To be added. To be added. - void svst1b_scatter_[u32]offset[_u32](svbool_t pg, uint8_t *base, svuint32_t offsets, svuint32_t data) + void svst1b_scatter_<see href="svbool_t pg, uint8_t *base, svuint32_t offsets, svuint32_t data">u32]offset[_u32</see> ST1B Zdata.S, Pg, [Xbase, Zoffsets.S, UXTW] To be added. @@ -37423,7 +37423,7 @@ To be added. To be added. - void svst1b_scatter_[s64]offset[_u64](svbool_t pg, uint8_t *base, svint64_t offsets, svuint64_t data) + void svst1b_scatter_<see href="svbool_t pg, uint8_t *base, svint64_t offsets, svuint64_t data">s64]offset[_u64</see> ST1B Zdata.D, Pg, [Xbase, Zoffsets.D] To be added. @@ -37455,7 +37455,7 @@ To be added. To be added. - void svst1b_scatter_[u64]offset[_u64](svbool_t pg, uint8_t *base, svuint64_t offsets, svuint64_t data) + void svst1b_scatter_<see href="svbool_t pg, uint8_t *base, svuint64_t offsets, svuint64_t data">u64]offset[_u64</see> ST1B Zdata.D, Pg, [Xbase, Zoffsets.D] To be added. @@ -38906,7 +38906,7 @@ To be added. - svint32_t svunpklo[_s32](svint16_t op) + svint32_t svunpklo<see href="svint16_t op">_s32</see> SUNPKLO Zresult.S, Zop.H To be added. @@ -38934,7 +38934,7 @@ To be added. - svint64_t svunpklo[_s64](svint32_t op) + svint64_t svunpklo<see href="svint32_t op">_s64</see> SUNPKLO Zresult.D, Zop.S To be added. @@ -38962,7 +38962,7 @@ To be added. - svint16_t svunpklo[_s16](svint8_t op) + svint16_t svunpklo<see href="svint8_t op">_s16</see> SUNPKLO Zresult.H, Zop.B To be added. @@ -38990,7 +38990,7 @@ To be added. - svint32_t svunpkhi[_s32](svint16_t op) + svint32_t svunpkhi<see href="svint16_t op">_s32</see> SUNPKHI Zresult.S, Zop.H To be added. @@ -39018,7 +39018,7 @@ To be added. - svint64_t svunpkhi[_s64](svint32_t op) + svint64_t svunpkhi<see href="svint32_t op">_s64</see> SUNPKHI Zresult.D, Zop.S To be added. @@ -39046,7 +39046,7 @@ To be added. - svint16_t svunpkhi[_s16](svint8_t op) + svint16_t svunpkhi<see href="svint8_t op">_s16</see> SUNPKHI Zresult.H, Zop.B To be added. @@ -39078,7 +39078,7 @@ To be added. To be added. - svuint8_t svsplice[_u8](svbool_t pg, svuint8_t op1, svuint8_t op2) + svuint8_t svsplice<see href="svbool_t pg, svuint8_t op1, svuint8_t op2">_u8</see> SPLICE Ztied1.B, Pg, Ztied1.B, Zop2.B To be added. @@ -39110,7 +39110,7 @@ To be added. To be added. - svfloat64_t svsplice[_f64](svbool_t pg, svfloat64_t op1, svfloat64_t op2) + svfloat64_t svsplice<see href="svbool_t pg, svfloat64_t op1, svfloat64_t op2">_f64</see> SPLICE Ztied1.D, Pg, Ztied1.D, Zop2.D To be added. @@ -39142,7 +39142,7 @@ To be added. To be added. - svint16_t svsplice[_s16](svbool_t pg, svint16_t op1, svint16_t op2) + svint16_t svsplice<see href="svbool_t pg, svint16_t op1, svint16_t op2">_s16</see> SPLICE Ztied1.H, Pg, Ztied1.H, Zop2.H To be added. @@ -39174,7 +39174,7 @@ To be added. To be added. - svint32_t svsplice[_s32](svbool_t pg, svint32_t op1, svint32_t op2) + svint32_t svsplice<see href="svbool_t pg, svint32_t op1, svint32_t op2">_s32</see> SPLICE Ztied1.S, Pg, Ztied1.S, Zop2.S To be added. @@ -39206,7 +39206,7 @@ To be added. To be added. - svint64_t svsplice[_s64](svbool_t pg, svint64_t op1, svint64_t op2) + svint64_t svsplice<see href="svbool_t pg, svint64_t op1, svint64_t op2">_s64</see> SPLICE Ztied1.D, Pg, Ztied1.D, Zop2.D To be added. @@ -39238,7 +39238,7 @@ To be added. To be added. - svint8_t svsplice[_s8](svbool_t pg, svint8_t op1, svint8_t op2) + svint8_t svsplice<see href="svbool_t pg, svint8_t op1, svint8_t op2">_s8</see> SPLICE Ztied1.B, Pg, Ztied1.B, Zop2.B To be added. @@ -39270,7 +39270,7 @@ To be added. To be added. - svfloat32_t svsplice[_f32](svbool_t pg, svfloat32_t op1, svfloat32_t op2) + svfloat32_t svsplice<see href="svbool_t pg, svfloat32_t op1, svfloat32_t op2">_f32</see> SPLICE Ztied1.S, Pg, Ztied1.S, Zop2.S To be added. @@ -39302,7 +39302,7 @@ To be added. To be added. - svuint16_t svsplice[_u16](svbool_t pg, svuint16_t op1, svuint16_t op2) + svuint16_t svsplice<see href="svbool_t pg, svuint16_t op1, svuint16_t op2">_u16</see> SPLICE Ztied1.H, Pg, Ztied1.H, Zop2.H To be added. @@ -39334,7 +39334,7 @@ To be added. To be added. - svuint32_t svsplice[_u32](svbool_t pg, svuint32_t op1, svuint32_t op2) + svuint32_t svsplice<see href="svbool_t pg, svuint32_t op1, svuint32_t op2">_u32</see> SPLICE Ztied1.S, Pg, Ztied1.S, Zop2.S To be added. @@ -39366,7 +39366,7 @@ To be added. To be added. - svuint64_t svsplice[_u64](svbool_t pg, svuint64_t op1, svuint64_t op2) + svuint64_t svsplice<see href="svbool_t pg, svuint64_t op1, svuint64_t op2">_u64</see> SPLICE Ztied1.D, Pg, Ztied1.D, Zop2.D To be added. @@ -39457,7 +39457,7 @@ To be added. To be added. - void svst1[_u8](svbool_t pg, uint8_t *base, svuint8_t data) + void svst1<see href="svbool_t pg, uint8_t *base, svuint8_t data">_u8</see> ST1B Zdata.B, Pg, [Xbase, #0, MUL VL] To be added. @@ -39494,7 +39494,7 @@ To be added. To be added. - void svst4[_u8](svbool_t pg, uint8_t *base, svuint8x4_t data) + void svst4<see href="svbool_t pg, uint8_t *base, svuint8x4_t data">_u8</see> ST4B {Zdata0.B - Zdata3.B}, Pg, [Xbase, #0, MUL VL] To be added. @@ -39531,7 +39531,7 @@ To be added. To be added. - void svst3[_u8](svbool_t pg, uint8_t *base, svuint8x3_t data) + void svst3<see href="svbool_t pg, uint8_t *base, svuint8x3_t data">_u8</see> ST3B {Zdata0.B - Zdata2.B}, Pg, [Xbase, #0, MUL VL] To be added. @@ -39568,7 +39568,7 @@ To be added. To be added. - void svst2[_u8](svbool_t pg, uint8_t *base, svuint8x2_t data) + void svst2<see href="svbool_t pg, uint8_t *base, svuint8x2_t data">_u8</see> ST2B {Zdata0.B, Zdata1.B}, Pg, [Xbase, #0, MUL VL] To be added. @@ -39598,7 +39598,7 @@ To be added. To be added. - void svst1[_f64](svbool_t pg, float64_t *base, svfloat64_t data) + void svst1<see href="svbool_t pg, float64_t *base, svfloat64_t data">_f64</see> ST1D Zdata.D, Pg, [Xbase, #0, MUL VL] To be added. @@ -39635,7 +39635,7 @@ To be added. To be added. - void svst4[_f64](svbool_t pg, float64_t *base, svfloat64x4_t data) + void svst4<see href="svbool_t pg, float64_t *base, svfloat64x4_t data">_f64</see> ST4D {Zdata0.D - Zdata3.D}, Pg, [Xbase, #0, MUL VL] To be added. @@ -39672,7 +39672,7 @@ To be added. To be added. - void svst3[_f64](svbool_t pg, float64_t *base, svfloat64x3_t data) + void svst3<see href="svbool_t pg, float64_t *base, svfloat64x3_t data">_f64</see> ST3D {Zdata0.D - Zdata2.D}, Pg, [Xbase, #0, MUL VL] To be added. @@ -39709,7 +39709,7 @@ To be added. To be added. - void svst2[_f64](svbool_t pg, float64_t *base, svfloat64x2_t data) + void svst2<see href="svbool_t pg, float64_t *base, svfloat64x2_t data">_f64</see> ST2D {Zdata0.D, Zdata1.D}, Pg, [Xbase, #0, MUL VL] To be added. @@ -39739,7 +39739,7 @@ To be added. To be added. - void svst1[_s16](svbool_t pg, int16_t *base, svint16_t data) + void svst1<see href="svbool_t pg, int16_t *base, svint16_t data">_s16</see> ST1H Zdata.H, Pg, [Xbase, #0, MUL VL] To be added. @@ -39776,7 +39776,7 @@ To be added. To be added. - void svst4[_s16](svbool_t pg, int16_t *base, svint16x4_t data) + void svst4<see href="svbool_t pg, int16_t *base, svint16x4_t data">_s16</see> ST4H {Zdata0.H - Zdata3.H}, Pg, [Xbase, #0, MUL VL] To be added. @@ -39813,7 +39813,7 @@ To be added. To be added. - void svst3[_s16](svbool_t pg, int16_t *base, svint16x3_t data) + void svst3<see href="svbool_t pg, int16_t *base, svint16x3_t data">_s16</see> ST3H {Zdata0.H - Zdata2.H}, Pg, [Xbase, #0, MUL VL] To be added. @@ -39850,7 +39850,7 @@ To be added. To be added. - void svst2[_s16](svbool_t pg, int16_t *base, svint16x2_t data) + void svst2<see href="svbool_t pg, int16_t *base, svint16x2_t data">_s16</see> ST2H {Zdata0.H, Zdata1.H}, Pg, [Xbase, #0, MUL VL] To be added. @@ -39880,7 +39880,7 @@ To be added. To be added. - void svst1[_s32](svbool_t pg, int32_t *base, svint32_t data) + void svst1<see href="svbool_t pg, int32_t *base, svint32_t data">_s32</see> ST1W Zdata.S, Pg, [Xbase, #0, MUL VL] To be added. @@ -39917,7 +39917,7 @@ To be added. To be added. - void svst4[_s32](svbool_t pg, int32_t *base, svint32x4_t data) + void svst4<see href="svbool_t pg, int32_t *base, svint32x4_t data">_s32</see> ST4W {Zdata0.S - Zdata3.S}, Pg, [Xbase, #0, MUL VL] To be added. @@ -39954,7 +39954,7 @@ To be added. To be added. - void svst3[_s32](svbool_t pg, int32_t *base, svint32x3_t data) + void svst3<see href="svbool_t pg, int32_t *base, svint32x3_t data">_s32</see> ST3W {Zdata0.S - Zdata2.S}, Pg, [Xbase, #0, MUL VL] To be added. @@ -39991,7 +39991,7 @@ To be added. To be added. - void svst2[_s32](svbool_t pg, int32_t *base, svint32x2_t data) + void svst2<see href="svbool_t pg, int32_t *base, svint32x2_t data">_s32</see> ST2W {Zdata0.S, Zdata1.S}, Pg, [Xbase, #0, MUL VL] To be added. @@ -40021,7 +40021,7 @@ To be added. To be added. - void svst1[_s64](svbool_t pg, int64_t *base, svint64_t data) + void svst1<see href="svbool_t pg, int64_t *base, svint64_t data">_s64</see> ST1D Zdata.D, Pg, [Xbase, #0, MUL VL] To be added. @@ -40058,7 +40058,7 @@ To be added. To be added. - void svst4[_s64](svbool_t pg, int64_t *base, svint64x4_t data) + void svst4<see href="svbool_t pg, int64_t *base, svint64x4_t data">_s64</see> ST4D {Zdata0.D - Zdata3.D}, Pg, [Xbase, #0, MUL VL] To be added. @@ -40095,7 +40095,7 @@ To be added. To be added. - void svst3[_s64](svbool_t pg, int64_t *base, svint64x3_t data) + void svst3<see href="svbool_t pg, int64_t *base, svint64x3_t data">_s64</see> ST3D {Zdata0.D - Zdata2.D}, Pg, [Xbase, #0, MUL VL] To be added. @@ -40132,7 +40132,7 @@ To be added. To be added. - void svst2[_s64](svbool_t pg, int64_t *base, svint64x2_t data) + void svst2<see href="svbool_t pg, int64_t *base, svint64x2_t data">_s64</see> ST2D {Zdata0.D, Zdata1.D}, Pg, [Xbase, #0, MUL VL] To be added. @@ -40162,7 +40162,7 @@ To be added. To be added. - void svst1[_s8](svbool_t pg, int8_t *base, svint8_t data) + void svst1<see href="svbool_t pg, int8_t *base, svint8_t data">_s8</see> ST1B Zdata.B, Pg, [Xbase, #0, MUL VL] To be added. @@ -40199,7 +40199,7 @@ To be added. To be added. - void svst4[_s8](svbool_t pg, int8_t *base, svint8x4_t data) + void svst4<see href="svbool_t pg, int8_t *base, svint8x4_t data">_s8</see> ST4B {Zdata0.B - Zdata3.B}, Pg, [Xbase, #0, MUL VL] To be added. @@ -40236,7 +40236,7 @@ To be added. To be added. - void svst3[_s8](svbool_t pg, int8_t *base, svint8x3_t data) + void svst3<see href="svbool_t pg, int8_t *base, svint8x3_t data">_s8</see> ST3B {Zdata0.B - Zdata2.B}, Pg, [Xbase, #0, MUL VL] To be added. @@ -40273,7 +40273,7 @@ To be added. To be added. - void svst2[_s8](svbool_t pg, int8_t *base, svint8x2_t data) + void svst2<see href="svbool_t pg, int8_t *base, svint8x2_t data">_s8</see> ST2B {Zdata0.B, Zdata1.B}, Pg, [Xbase, #0, MUL VL] To be added. @@ -40303,7 +40303,7 @@ To be added. To be added. - void svst1[_f32](svbool_t pg, float32_t *base, svfloat32_t data) + void svst1<see href="svbool_t pg, float32_t *base, svfloat32_t data">_f32</see> ST1W Zdata.S, Pg, [Xbase, #0, MUL VL] To be added. @@ -40340,7 +40340,7 @@ To be added. To be added. - void svst4[_f32](svbool_t pg, float32_t *base, svfloat32x4_t data) + void svst4<see href="svbool_t pg, float32_t *base, svfloat32x4_t data">_f32</see> ST4W {Zdata0.S - Zdata3.S}, Pg, [Xbase, #0, MUL VL] To be added. @@ -40377,7 +40377,7 @@ To be added. To be added. - void svst3[_f32](svbool_t pg, float32_t *base, svfloat32x3_t data) + void svst3<see href="svbool_t pg, float32_t *base, svfloat32x3_t data">_f32</see> ST3W {Zdata0.S - Zdata2.S}, Pg, [Xbase, #0, MUL VL] To be added. @@ -40414,7 +40414,7 @@ To be added. To be added. - void svst2[_f32](svbool_t pg, float32_t *base, svfloat32x2_t data) + void svst2<see href="svbool_t pg, float32_t *base, svfloat32x2_t data">_f32</see> ST2W {Zdata0.S, Zdata1.S}, Pg, [Xbase, #0, MUL VL] To be added. @@ -40444,7 +40444,7 @@ To be added. To be added. - void svst1[_u16](svbool_t pg, uint16_t *base, svuint16_t data) + void svst1<see href="svbool_t pg, uint16_t *base, svuint16_t data">_u16</see> ST1H Zdata.H, Pg, [Xbase, #0, MUL VL] To be added. @@ -40481,7 +40481,7 @@ To be added. To be added. - void svst4[_u16](svbool_t pg, uint16_t *base, svuint16x4_t data) + void svst4<see href="svbool_t pg, uint16_t *base, svuint16x4_t data">_u16</see> ST4H {Zdata0.H - Zdata3.H}, Pg, [Xbase, #0, MUL VL] To be added. @@ -40518,7 +40518,7 @@ To be added. To be added. - void svst3[_u16](svbool_t pg, uint16_t *base, svuint16x3_t data) + void svst3<see href="svbool_t pg, uint16_t *base, svuint16x3_t data">_u16</see> ST3H {Zdata0.H - Zdata2.H}, Pg, [Xbase, #0, MUL VL] To be added. @@ -40555,7 +40555,7 @@ To be added. To be added. - void svst2[_u16](svbool_t pg, uint16_t *base, svuint16x2_t data) + void svst2<see href="svbool_t pg, uint16_t *base, svuint16x2_t data">_u16</see> ST2H {Zdata0.H, Zdata1.H}, Pg, [Xbase, #0, MUL VL] To be added. @@ -40585,7 +40585,7 @@ To be added. To be added. - void svst1[_u32](svbool_t pg, uint32_t *base, svuint32_t data) + void svst1<see href="svbool_t pg, uint32_t *base, svuint32_t data">_u32</see> ST1W Zdata.S, Pg, [Xbase, #0, MUL VL] To be added. @@ -40622,7 +40622,7 @@ To be added. To be added. - void svst4[_u32](svbool_t pg, uint32_t *base, svuint32x4_t data) + void svst4<see href="svbool_t pg, uint32_t *base, svuint32x4_t data">_u32</see> ST4W {Zdata0.S - Zdata3.S}, Pg, [Xbase, #0, MUL VL] To be added. @@ -40659,7 +40659,7 @@ To be added. To be added. - void svst3[_u32](svbool_t pg, uint32_t *base, svuint32x3_t data) + void svst3<see href="svbool_t pg, uint32_t *base, svuint32x3_t data">_u32</see> ST3W {Zdata0.S - Zdata2.S}, Pg, [Xbase, #0, MUL VL] To be added. @@ -40696,7 +40696,7 @@ To be added. To be added. - void svst2[_u32](svbool_t pg, uint32_t *base, svuint32x2_t data) + void svst2<see href="svbool_t pg, uint32_t *base, svuint32x2_t data">_u32</see> ST2W {Zdata0.S, Zdata1.S}, Pg, [Xbase, #0, MUL VL] To be added. @@ -40726,7 +40726,7 @@ To be added. To be added. - void svst1[_u64](svbool_t pg, uint64_t *base, svuint64_t data) + void svst1<see href="svbool_t pg, uint64_t *base, svuint64_t data">_u64</see> ST1D Zdata.D, Pg, [Xbase, #0, MUL VL] To be added. @@ -40763,7 +40763,7 @@ To be added. To be added. - void svst4[_u64](svbool_t pg, uint64_t *base, svuint64x4_t data) + void svst4<see href="svbool_t pg, uint64_t *base, svuint64x4_t data">_u64</see> ST4D {Zdata0.D - Zdata3.D}, Pg, [Xbase, #0, MUL VL] To be added. @@ -40800,7 +40800,7 @@ To be added. To be added. - void svst3[_u64](svbool_t pg, uint64_t *base, svuint64x3_t data) + void svst3<see href="svbool_t pg, uint64_t *base, svuint64x3_t data">_u64</see> ST3D {Zdata0.D - Zdata2.D}, Pg, [Xbase, #0, MUL VL] To be added. @@ -40837,7 +40837,7 @@ To be added. To be added. - void svst2[_u64](svbool_t pg, uint64_t *base, svuint64x2_t data) + void svst2<see href="svbool_t pg, uint64_t *base, svuint64x2_t data">_u64</see> ST2D {Zdata0.D, Zdata1.D}, Pg, [Xbase, #0, MUL VL] To be added. @@ -40867,7 +40867,7 @@ To be added. To be added. - void svst1b[_s16](svbool_t pg, int8_t *base, svint16_t data) + void svst1b<see href="svbool_t pg, int8_t *base, svint16_t data">_s16</see> ST1B Zdata.H, Pg, [Xbase, #0, MUL VL] To be added. @@ -40897,7 +40897,7 @@ To be added. To be added. - void svst1h[_s32](svbool_t pg, int16_t *base, svint32_t data) + void svst1h<see href="svbool_t pg, int16_t *base, svint32_t data">_s32</see> ST1H Zdata.S, Pg, [Xbase, #0, MUL VL] To be added. @@ -40927,7 +40927,7 @@ To be added. To be added. - void svst1b[_s32](svbool_t pg, int8_t *base, svint32_t data) + void svst1b<see href="svbool_t pg, int8_t *base, svint32_t data">_s32</see> ST1B Zdata.S, Pg, [Xbase, #0, MUL VL] To be added. @@ -40957,7 +40957,7 @@ To be added. To be added. - void svst1h[_s64](svbool_t pg, int16_t *base, svint64_t data) + void svst1h<see href="svbool_t pg, int16_t *base, svint64_t data">_s64</see> ST1H Zdata.D, Pg, [Xbase, #0, MUL VL] To be added. @@ -40987,7 +40987,7 @@ To be added. To be added. - void svst1w[_s64](svbool_t pg, int32_t *base, svint64_t data) + void svst1w<see href="svbool_t pg, int32_t *base, svint64_t data">_s64</see> ST1W Zdata.D, Pg, [Xbase, #0, MUL VL] To be added. @@ -41017,7 +41017,7 @@ To be added. To be added. - void svst1b[_s64](svbool_t pg, int8_t *base, svint64_t data) + void svst1b<see href="svbool_t pg, int8_t *base, svint64_t data">_s64</see> ST1B Zdata.D, Pg, [Xbase, #0, MUL VL] To be added. @@ -41047,7 +41047,7 @@ To be added. To be added. - void svst1b[_u16](svbool_t pg, uint8_t *base, svuint16_t data) + void svst1b<see href="svbool_t pg, uint8_t *base, svuint16_t data">_u16</see> ST1B Zdata.H, Pg, [Xbase, #0, MUL VL] To be added. @@ -41077,7 +41077,7 @@ To be added. To be added. - void svst1b[_u32](svbool_t pg, uint8_t *base, svuint32_t data) + void svst1b<see href="svbool_t pg, uint8_t *base, svuint32_t data">_u32</see> ST1B Zdata.S, Pg, [Xbase, #0, MUL VL] To be added. @@ -41107,7 +41107,7 @@ To be added. To be added. - void svst1h[_u32](svbool_t pg, uint16_t *base, svuint32_t data) + void svst1h<see href="svbool_t pg, uint16_t *base, svuint32_t data">_u32</see> ST1H Zdata.S, Pg, [Xbase, #0, MUL VL] To be added. @@ -41137,7 +41137,7 @@ To be added. To be added. - void svst1b[_u64](svbool_t pg, uint8_t *base, svuint64_t data) + void svst1b<see href="svbool_t pg, uint8_t *base, svuint64_t data">_u64</see> ST1B Zdata.D, Pg, [Xbase, #0, MUL VL] To be added. @@ -41167,7 +41167,7 @@ To be added. To be added. - void svst1h[_u64](svbool_t pg, uint16_t *base, svuint64_t data) + void svst1h<see href="svbool_t pg, uint16_t *base, svuint64_t data">_u64</see> ST1H Zdata.D, Pg, [Xbase, #0, MUL VL] To be added. @@ -41197,7 +41197,7 @@ To be added. To be added. - void svst1w[_u64](svbool_t pg, uint32_t *base, svuint64_t data) + void svst1w<see href="svbool_t pg, uint32_t *base, svuint64_t data">_u64</see> ST1W Zdata.D, Pg, [Xbase, #0, MUL VL] To be added. @@ -41227,7 +41227,7 @@ To be added. To be added. - void svstnt1[_u8](svbool_t pg, uint8_t *base, svuint8_t data) + void svstnt1<see href="svbool_t pg, uint8_t *base, svuint8_t data">_u8</see> STNT1B Zdata.B, Pg, [Xbase, #0, MUL VL] To be added. @@ -41257,7 +41257,7 @@ To be added. To be added. - void svstnt1[_f64](svbool_t pg, float64_t *base, svfloat64_t data) + void svstnt1<see href="svbool_t pg, float64_t *base, svfloat64_t data">_f64</see> STNT1D Zdata.D, Pg, [Xbase, #0, MUL VL] To be added. @@ -41287,7 +41287,7 @@ To be added. To be added. - void svstnt1[_s16](svbool_t pg, int16_t *base, svint16_t data) + void svstnt1<see href="svbool_t pg, int16_t *base, svint16_t data">_s16</see> STNT1H Zdata.H, Pg, [Xbase, #0, MUL VL] To be added. @@ -41317,7 +41317,7 @@ To be added. To be added. - void svstnt1[_s32](svbool_t pg, int32_t *base, svint32_t data) + void svstnt1<see href="svbool_t pg, int32_t *base, svint32_t data">_s32</see> STNT1W Zdata.S, Pg, [Xbase, #0, MUL VL] To be added. @@ -41347,7 +41347,7 @@ To be added. To be added. - void svstnt1[_s64](svbool_t pg, int64_t *base, svint64_t data) + void svstnt1<see href="svbool_t pg, int64_t *base, svint64_t data">_s64</see> STNT1D Zdata.D, Pg, [Xbase, #0, MUL VL] To be added. @@ -41377,7 +41377,7 @@ To be added. To be added. - void svstnt1[_s8](svbool_t pg, int8_t *base, svint8_t data) + void svstnt1<see href="svbool_t pg, int8_t *base, svint8_t data">_s8</see> STNT1B Zdata.B, Pg, [Xbase, #0, MUL VL] To be added. @@ -41407,7 +41407,7 @@ To be added. To be added. - void svstnt1[_f32](svbool_t pg, float32_t *base, svfloat32_t data) + void svstnt1<see href="svbool_t pg, float32_t *base, svfloat32_t data">_f32</see> STNT1W Zdata.S, Pg, [Xbase, #0, MUL VL] To be added. @@ -41437,7 +41437,7 @@ To be added. To be added. - void svstnt1[_u16](svbool_t pg, uint16_t *base, svuint16_t data) + void svstnt1<see href="svbool_t pg, uint16_t *base, svuint16_t data">_u16</see> STNT1H Zdata.H, Pg, [Xbase, #0, MUL VL] To be added. @@ -41467,7 +41467,7 @@ To be added. To be added. - void svstnt1[_u32](svbool_t pg, uint32_t *base, svuint32_t data) + void svstnt1<see href="svbool_t pg, uint32_t *base, svuint32_t data">_u32</see> STNT1W Zdata.S, Pg, [Xbase, #0, MUL VL] To be added. @@ -41497,7 +41497,7 @@ To be added. To be added. - void svstnt1[_u64](svbool_t pg, uint64_t *base, svuint64_t data) + void svstnt1<see href="svbool_t pg, uint64_t *base, svuint64_t data">_u64</see> STNT1D Zdata.D, Pg, [Xbase, #0, MUL VL] To be added. @@ -41846,7 +41846,7 @@ To be added. To be added. - svuint8_t svqsub[_u8](svuint8_t op1, svuint8_t op2) + svuint8_t svqsub<see href="svuint8_t op1, svuint8_t op2">_u8</see> UQSUB Zresult.B, Zop1.B, Zop2.B To be added. @@ -41876,7 +41876,7 @@ To be added. To be added. - svint16_t svqsub[_s16](svint16_t op1, svint16_t op2) + svint16_t svqsub<see href="svint16_t op1, svint16_t op2">_s16</see> SQSUB Zresult.H, Zop1.H, Zop2.H To be added. @@ -41906,7 +41906,7 @@ To be added. To be added. - svint32_t svqsub[_s32](svint32_t op1, svint32_t op2) + svint32_t svqsub<see href="svint32_t op1, svint32_t op2">_s32</see> SQSUB Zresult.S, Zop1.S, Zop2.S To be added. @@ -41936,7 +41936,7 @@ To be added. To be added. - svint64_t svqsub[_s64](svint64_t op1, svint64_t op2) + svint64_t svqsub<see href="svint64_t op1, svint64_t op2">_s64</see> SQSUB Zresult.D, Zop1.D, Zop2.D To be added. @@ -41966,7 +41966,7 @@ To be added. To be added. - svint8_t svqsub[_s8](svint8_t op1, svint8_t op2) + svint8_t svqsub<see href="svint8_t op1, svint8_t op2">_s8</see> SQSUB Zresult.B, Zop1.B, Zop2.B To be added. @@ -41996,7 +41996,7 @@ To be added. To be added. - svuint16_t svqsub[_u16](svuint16_t op1, svuint16_t op2) + svuint16_t svqsub<see href="svuint16_t op1, svuint16_t op2">_u16</see> UQSUB Zresult.H, Zop1.H, Zop2.H To be added. @@ -42026,7 +42026,7 @@ To be added. To be added. - svuint32_t svqsub[_u32](svuint32_t op1, svuint32_t op2) + svuint32_t svqsub<see href="svuint32_t op1, svuint32_t op2">_u32</see> UQSUB Zresult.S, Zop1.S, Zop2.S To be added. @@ -42056,7 +42056,7 @@ To be added. To be added. - svuint64_t svqsub[_u64](svuint64_t op1, svuint64_t op2) + svuint64_t svqsub<see href="svuint64_t op1, svuint64_t op2">_u64</see> UQSUB Zresult.D, Zop1.D, Zop2.D To be added. @@ -42806,7 +42806,7 @@ To be added. To be added. - svuint8_t svtrn1[_u8](svuint8_t op1, svuint8_t op2) + svuint8_t svtrn1<see href="svuint8_t op1, svuint8_t op2">_u8</see> TRN1 Zresult.B, Zop1.B, Zop2.B To be added. @@ -42836,7 +42836,7 @@ To be added. To be added. - svfloat64_t svtrn1[_f64](svfloat64_t op1, svfloat64_t op2) + svfloat64_t svtrn1<see href="svfloat64_t op1, svfloat64_t op2">_f64</see> TRN1 Zresult.D, Zop1.D, Zop2.D To be added. @@ -42866,7 +42866,7 @@ To be added. To be added. - svint16_t svtrn1[_s16](svint16_t op1, svint16_t op2) + svint16_t svtrn1<see href="svint16_t op1, svint16_t op2">_s16</see> TRN1 Zresult.H, Zop1.H, Zop2.H To be added. @@ -42896,7 +42896,7 @@ To be added. To be added. - svint32_t svtrn1[_s32](svint32_t op1, svint32_t op2) + svint32_t svtrn1<see href="svint32_t op1, svint32_t op2">_s32</see> TRN1 Zresult.S, Zop1.S, Zop2.S To be added. @@ -42926,7 +42926,7 @@ To be added. To be added. - svint64_t svtrn1[_s64](svint64_t op1, svint64_t op2) + svint64_t svtrn1<see href="svint64_t op1, svint64_t op2">_s64</see> TRN1 Zresult.D, Zop1.D, Zop2.D To be added. @@ -42956,7 +42956,7 @@ To be added. To be added. - svint8_t svtrn1[_s8](svint8_t op1, svint8_t op2) + svint8_t svtrn1<see href="svint8_t op1, svint8_t op2">_s8</see> TRN1 Zresult.B, Zop1.B, Zop2.B To be added. @@ -42986,7 +42986,7 @@ To be added. To be added. - svfloat32_t svtrn1[_f32](svfloat32_t op1, svfloat32_t op2) + svfloat32_t svtrn1<see href="svfloat32_t op1, svfloat32_t op2">_f32</see> TRN1 Zresult.S, Zop1.S, Zop2.S To be added. @@ -43016,7 +43016,7 @@ To be added. To be added. - svuint16_t svtrn1[_u16](svuint16_t op1, svuint16_t op2) + svuint16_t svtrn1<see href="svuint16_t op1, svuint16_t op2">_u16</see> TRN1 Zresult.H, Zop1.H, Zop2.H To be added. @@ -43046,7 +43046,7 @@ To be added. To be added. - svuint32_t svtrn1[_u32](svuint32_t op1, svuint32_t op2) + svuint32_t svtrn1<see href="svuint32_t op1, svuint32_t op2">_u32</see> TRN1 Zresult.S, Zop1.S, Zop2.S To be added. @@ -43076,7 +43076,7 @@ To be added. To be added. - svuint64_t svtrn1[_u64](svuint64_t op1, svuint64_t op2) + svuint64_t svtrn1<see href="svuint64_t op1, svuint64_t op2">_u64</see> TRN1 Zresult.D, Zop1.D, Zop2.D To be added. @@ -43106,7 +43106,7 @@ To be added. To be added. - svuint8_t svtrn2[_u8](svuint8_t op1, svuint8_t op2) + svuint8_t svtrn2<see href="svuint8_t op1, svuint8_t op2">_u8</see> TRN2 Zresult.B, Zop1.B, Zop2.B To be added. @@ -43136,7 +43136,7 @@ To be added. To be added. - svfloat64_t svtrn2[_f64](svfloat64_t op1, svfloat64_t op2) + svfloat64_t svtrn2<see href="svfloat64_t op1, svfloat64_t op2">_f64</see> TRN2 Zresult.D, Zop1.D, Zop2.D To be added. @@ -43166,7 +43166,7 @@ To be added. To be added. - svint16_t svtrn2[_s16](svint16_t op1, svint16_t op2) + svint16_t svtrn2<see href="svint16_t op1, svint16_t op2">_s16</see> TRN2 Zresult.H, Zop1.H, Zop2.H To be added. @@ -43196,7 +43196,7 @@ To be added. To be added. - svint32_t svtrn2[_s32](svint32_t op1, svint32_t op2) + svint32_t svtrn2<see href="svint32_t op1, svint32_t op2">_s32</see> TRN2 Zresult.S, Zop1.S, Zop2.S To be added. @@ -43226,7 +43226,7 @@ To be added. To be added. - svint64_t svtrn2[_s64](svint64_t op1, svint64_t op2) + svint64_t svtrn2<see href="svint64_t op1, svint64_t op2">_s64</see> TRN2 Zresult.D, Zop1.D, Zop2.D To be added. @@ -43256,7 +43256,7 @@ To be added. To be added. - svint8_t svtrn2[_s8](svint8_t op1, svint8_t op2) + svint8_t svtrn2<see href="svint8_t op1, svint8_t op2">_s8</see> TRN2 Zresult.B, Zop1.B, Zop2.B To be added. @@ -43286,7 +43286,7 @@ To be added. To be added. - svfloat32_t svtrn2[_f32](svfloat32_t op1, svfloat32_t op2) + svfloat32_t svtrn2<see href="svfloat32_t op1, svfloat32_t op2">_f32</see> TRN2 Zresult.S, Zop1.S, Zop2.S To be added. @@ -43316,7 +43316,7 @@ To be added. To be added. - svuint16_t svtrn2[_u16](svuint16_t op1, svuint16_t op2) + svuint16_t svtrn2<see href="svuint16_t op1, svuint16_t op2">_u16</see> TRN2 Zresult.H, Zop1.H, Zop2.H To be added. @@ -43346,7 +43346,7 @@ To be added. To be added. - svuint32_t svtrn2[_u32](svuint32_t op1, svuint32_t op2) + svuint32_t svtrn2<see href="svuint32_t op1, svuint32_t op2">_u32</see> TRN2 Zresult.S, Zop1.S, Zop2.S To be added. @@ -43376,7 +43376,7 @@ To be added. To be added. - svuint64_t svtrn2[_u64](svuint64_t op1, svuint64_t op2) + svuint64_t svtrn2<see href="svuint64_t op1, svuint64_t op2">_u64</see> TRN2 Zresult.D, Zop1.D, Zop2.D To be added. @@ -43415,7 +43415,7 @@ To be added. To be added. - svfloat64_t svtmad[_f64](svfloat64_t op1, svfloat64_t op2, uint64_t imm3) + svfloat64_t svtmad<see href="svfloat64_t op1, svfloat64_t op2, uint64_t imm3">_f64</see> FTMAD Ztied1.D, Ztied1.D, Zop2.D, #imm3 To be added. @@ -43454,7 +43454,7 @@ To be added. To be added. - svfloat32_t svtmad[_f32](svfloat32_t op1, svfloat32_t op2, uint64_t imm3) + svfloat32_t svtmad<see href="svfloat32_t op1, svfloat32_t op2, uint64_t imm3">_f32</see> FTMAD Ztied1.S, Ztied1.S, Zop2.S, #imm3 To be added. @@ -43484,7 +43484,7 @@ To be added. To be added. - svfloat64_t svtssel[_f64](svfloat64_t op1, svuint64_t op2) + svfloat64_t svtssel<see href="svfloat64_t op1, svuint64_t op2">_f64</see> FTSSEL Zresult.D, Zop1.D, Zop2.D To be added. @@ -43514,7 +43514,7 @@ To be added. To be added. - svfloat32_t svtssel[_f32](svfloat32_t op1, svuint32_t op2) + svfloat32_t svtssel<see href="svfloat32_t op1, svuint32_t op2">_f32</see> FTSSEL Zresult.S, Zop1.S, Zop2.S To be added. @@ -43544,7 +43544,7 @@ To be added. To be added. - svfloat64_t svtsmul[_f64](svfloat64_t op1, svuint64_t op2) + svfloat64_t svtsmul<see href="svfloat64_t op1, svuint64_t op2">_f64</see> FTSMUL Zresult.D, Zop1.D, Zop2.D To be added. @@ -43574,7 +43574,7 @@ To be added. To be added. - svfloat32_t svtsmul[_f32](svfloat32_t op1, svuint32_t op2) + svfloat32_t svtsmul<see href="svfloat32_t op1, svuint32_t op2">_f32</see> FTSMUL Zresult.S, Zop1.S, Zop2.S To be added. @@ -43604,7 +43604,7 @@ To be added. To be added. - svuint8_t svuzp1[_u8](svuint8_t op1, svuint8_t op2) + svuint8_t svuzp1<see href="svuint8_t op1, svuint8_t op2">_u8</see> svbool_t svuzp1_b8(svbool_t op1, svbool_t op2) To be added. @@ -43634,7 +43634,7 @@ To be added. To be added. - svfloat64_t svuzp1[_f64](svfloat64_t op1, svfloat64_t op2) + svfloat64_t svuzp1<see href="svfloat64_t op1, svfloat64_t op2">_f64</see> UZP1 Zresult.D, Zop1.D, Zop2.D To be added. @@ -43664,7 +43664,7 @@ To be added. To be added. - svint16_t svuzp1[_s16](svint16_t op1, svint16_t op2) + svint16_t svuzp1<see href="svint16_t op1, svint16_t op2">_s16</see> UZP1 Zresult.H, Zop1.H, Zop2.H To be added. @@ -43694,7 +43694,7 @@ To be added. To be added. - svint32_t svuzp1[_s32](svint32_t op1, svint32_t op2) + svint32_t svuzp1<see href="svint32_t op1, svint32_t op2">_s32</see> UZP1 Zresult.S, Zop1.S, Zop2.S To be added. @@ -43724,7 +43724,7 @@ To be added. To be added. - svint64_t svuzp1[_s64](svint64_t op1, svint64_t op2) + svint64_t svuzp1<see href="svint64_t op1, svint64_t op2">_s64</see> UZP1 Zresult.D, Zop1.D, Zop2.D To be added. @@ -43754,7 +43754,7 @@ To be added. To be added. - svint8_t svuzp1[_s8](svint8_t op1, svint8_t op2) + svint8_t svuzp1<see href="svint8_t op1, svint8_t op2">_s8</see> UZP1 Zresult.B, Zop1.B, Zop2.B To be added. @@ -43784,7 +43784,7 @@ To be added. To be added. - svfloat32_t svuzp1[_f32](svfloat32_t op1, svfloat32_t op2) + svfloat32_t svuzp1<see href="svfloat32_t op1, svfloat32_t op2">_f32</see> UZP1 Zresult.S, Zop1.S, Zop2.S To be added. @@ -43814,7 +43814,7 @@ To be added. To be added. - svuint16_t svuzp1[_u16](svuint16_t op1, svuint16_t op2) + svuint16_t svuzp1<see href="svuint16_t op1, svuint16_t op2">_u16</see> UZP1 Zresult.H, Zop1.H, Zop2.H To be added. @@ -43844,7 +43844,7 @@ To be added. To be added. - svuint32_t svuzp1[_u32](svuint32_t op1, svuint32_t op2) + svuint32_t svuzp1<see href="svuint32_t op1, svuint32_t op2">_u32</see> UZP1 Zresult.S, Zop1.S, Zop2.S To be added. @@ -43874,7 +43874,7 @@ To be added. To be added. - svuint64_t svuzp1[_u64](svuint64_t op1, svuint64_t op2) + svuint64_t svuzp1<see href="svuint64_t op1, svuint64_t op2">_u64</see> UZP1 Zresult.D, Zop1.D, Zop2.D To be added. @@ -43904,7 +43904,7 @@ To be added. To be added. - svuint8_t svuzp2[_u8](svuint8_t op1, svuint8_t op2) + svuint8_t svuzp2<see href="svuint8_t op1, svuint8_t op2">_u8</see> UZP2 Zresult.B, Zop1.B, Zop2.B To be added. @@ -43934,7 +43934,7 @@ To be added. To be added. - svfloat64_t svuzp2[_f64](svfloat64_t op1, svfloat64_t op2) + svfloat64_t svuzp2<see href="svfloat64_t op1, svfloat64_t op2">_f64</see> UZP2 Zresult.D, Zop1.D, Zop2.D To be added. @@ -43964,7 +43964,7 @@ To be added. To be added. - svint16_t svuzp2[_s16](svint16_t op1, svint16_t op2) + svint16_t svuzp2<see href="svint16_t op1, svint16_t op2">_s16</see> UZP2 Zresult.H, Zop1.H, Zop2.H To be added. @@ -43994,7 +43994,7 @@ To be added. To be added. - svint32_t svuzp2[_s32](svint32_t op1, svint32_t op2) + svint32_t svuzp2<see href="svint32_t op1, svint32_t op2">_s32</see> UZP2 Zresult.S, Zop1.S, Zop2.S To be added. @@ -44024,7 +44024,7 @@ To be added. To be added. - svint64_t svuzp2[_s64](svint64_t op1, svint64_t op2) + svint64_t svuzp2<see href="svint64_t op1, svint64_t op2">_s64</see> UZP2 Zresult.D, Zop1.D, Zop2.D To be added. @@ -44054,7 +44054,7 @@ To be added. To be added. - svint8_t svuzp2[_s8](svint8_t op1, svint8_t op2) + svint8_t svuzp2<see href="svint8_t op1, svint8_t op2">_s8</see> UZP2 Zresult.B, Zop1.B, Zop2.B To be added. @@ -44084,7 +44084,7 @@ To be added. To be added. - svfloat32_t svuzp2[_f32](svfloat32_t op1, svfloat32_t op2) + svfloat32_t svuzp2<see href="svfloat32_t op1, svfloat32_t op2">_f32</see> UZP2 Zresult.S, Zop1.S, Zop2.S To be added. @@ -44114,7 +44114,7 @@ To be added. To be added. - svuint16_t svuzp2[_u16](svuint16_t op1, svuint16_t op2) + svuint16_t svuzp2<see href="svuint16_t op1, svuint16_t op2">_u16</see> UZP2 Zresult.H, Zop1.H, Zop2.H To be added. @@ -44144,7 +44144,7 @@ To be added. To be added. - svuint32_t svuzp2[_u32](svuint32_t op1, svuint32_t op2) + svuint32_t svuzp2<see href="svuint32_t op1, svuint32_t op2">_u32</see> UZP2 Zresult.S, Zop1.S, Zop2.S To be added. @@ -44174,7 +44174,7 @@ To be added. To be added. - svuint64_t svuzp2[_u64](svuint64_t op1, svuint64_t op2) + svuint64_t svuzp2<see href="svuint64_t op1, svuint64_t op2">_u64</see> UZP2 Zresult.D, Zop1.D, Zop2.D To be added. @@ -44204,7 +44204,7 @@ To be added. To be added. - svuint8_t svtbl[_u8](svuint8_t data, svuint8_t indices) + svuint8_t svtbl<see href="svuint8_t data, svuint8_t indices">_u8</see> TBL Zresult.B, {Zdata.B}, Zindices.B To be added. @@ -44234,7 +44234,7 @@ To be added. To be added. - svfloat64_t svtbl[_f64](svfloat64_t data, svuint64_t indices) + svfloat64_t svtbl<see href="svfloat64_t data, svuint64_t indices">_f64</see> TBL Zresult.D, {Zdata.D}, Zindices.D To be added. @@ -44264,7 +44264,7 @@ To be added. To be added. - svint16_t svtbl[_s16](svint16_t data, svuint16_t indices) + svint16_t svtbl<see href="svint16_t data, svuint16_t indices">_s16</see> TBL Zresult.H, {Zdata.H}, Zindices.H To be added. @@ -44294,7 +44294,7 @@ To be added. To be added. - svint32_t svtbl[_s32](svint32_t data, svuint32_t indices) + svint32_t svtbl<see href="svint32_t data, svuint32_t indices">_s32</see> TBL Zresult.S, {Zdata.S}, Zindices.S To be added. @@ -44324,7 +44324,7 @@ To be added. To be added. - svint64_t svtbl[_s64](svint64_t data, svuint64_t indices) + svint64_t svtbl<see href="svint64_t data, svuint64_t indices">_s64</see> TBL Zresult.D, {Zdata.D}, Zindices.D To be added. @@ -44354,7 +44354,7 @@ To be added. To be added. - svint8_t svtbl[_s8](svint8_t data, svuint8_t indices) + svint8_t svtbl<see href="svint8_t data, svuint8_t indices">_s8</see> TBL Zresult.B, {Zdata.B}, Zindices.B To be added. @@ -44384,7 +44384,7 @@ To be added. To be added. - svfloat32_t svtbl[_f32](svfloat32_t data, svuint32_t indices) + svfloat32_t svtbl<see href="svfloat32_t data, svuint32_t indices">_f32</see> TBL Zresult.S, {Zdata.S}, Zindices.S To be added. @@ -44414,7 +44414,7 @@ To be added. To be added. - svuint16_t svtbl[_u16](svuint16_t data, svuint16_t indices) + svuint16_t svtbl<see href="svuint16_t data, svuint16_t indices">_u16</see> TBL Zresult.H, {Zdata.H}, Zindices.H To be added. @@ -44444,7 +44444,7 @@ To be added. To be added. - svuint32_t svtbl[_u32](svuint32_t data, svuint32_t indices) + svuint32_t svtbl<see href="svuint32_t data, svuint32_t indices">_u32</see> TBL Zresult.S, {Zdata.S}, Zindices.S To be added. @@ -44474,7 +44474,7 @@ To be added. To be added. - svuint64_t svtbl[_u64](svuint64_t data, svuint64_t indices) + svuint64_t svtbl<see href="svuint64_t data, svuint64_t indices">_u64</see> TBL Zresult.D, {Zdata.D}, Zindices.D To be added. @@ -44758,7 +44758,7 @@ To be added. - uint8_t sveorv[_u8](svbool_t pg, svuint8_t op) + uint8_t sveorv<see href="svbool_t pg, svuint8_t op">_u8</see> EORV Bresult, Pg, Zop.B To be added. @@ -44786,7 +44786,7 @@ To be added. - int16_t sveorv[_s16](svbool_t pg, svint16_t op) + int16_t sveorv<see href="svbool_t pg, svint16_t op">_s16</see> EORV Hresult, Pg, Zop.H To be added. @@ -44814,7 +44814,7 @@ To be added. - int32_t sveorv[_s32](svbool_t pg, svint32_t op) + int32_t sveorv<see href="svbool_t pg, svint32_t op">_s32</see> EORV Sresult, Pg, Zop.S To be added. @@ -44842,7 +44842,7 @@ To be added. - int64_t sveorv[_s64](svbool_t pg, svint64_t op) + int64_t sveorv<see href="svbool_t pg, svint64_t op">_s64</see> EORV Dresult, Pg, Zop.D To be added. @@ -44870,7 +44870,7 @@ To be added. - int8_t sveorv[_s8](svbool_t pg, svint8_t op) + int8_t sveorv<see href="svbool_t pg, svint8_t op">_s8</see> EORV Bresult, Pg, Zop.B To be added. @@ -44898,7 +44898,7 @@ To be added. - uint16_t sveorv[_u16](svbool_t pg, svuint16_t op) + uint16_t sveorv<see href="svbool_t pg, svuint16_t op">_u16</see> EORV Hresult, Pg, Zop.H To be added. @@ -44926,7 +44926,7 @@ To be added. - uint32_t sveorv[_u32](svbool_t pg, svuint32_t op) + uint32_t sveorv<see href="svbool_t pg, svuint32_t op">_u32</see> EORV Sresult, Pg, Zop.S To be added. @@ -44954,7 +44954,7 @@ To be added. - uint64_t sveorv[_u64](svbool_t pg, svuint64_t op) + uint64_t sveorv<see href="svbool_t pg, svuint64_t op">_u64</see> EORV Dresult, Pg, Zop.D To be added. @@ -45162,7 +45162,7 @@ To be added. - svuint16_t svunpklo[_u16](svuint8_t op) + svuint16_t svunpklo<see href="svuint8_t op">_u16</see> UUNPKLO Zresult.H, Zop.B To be added. @@ -45190,7 +45190,7 @@ To be added. - svuint32_t svunpklo[_u32](svuint16_t op) + svuint32_t svunpklo<see href="svuint16_t op">_u32</see> UUNPKLO Zresult.S, Zop.H To be added. @@ -45218,7 +45218,7 @@ To be added. - svuint64_t svunpklo[_u64](svuint32_t op) + svuint64_t svunpklo<see href="svuint32_t op">_u64</see> UUNPKLO Zresult.D, Zop.S To be added. @@ -45246,7 +45246,7 @@ To be added. - svuint16_t svunpkhi[_u16](svuint8_t op) + svuint16_t svunpkhi<see href="svuint8_t op">_u16</see> UUNPKHI Zresult.H, Zop.B To be added. @@ -45274,7 +45274,7 @@ To be added. - svuint32_t svunpkhi[_u32](svuint16_t op) + svuint32_t svunpkhi<see href="svuint16_t op">_u32</see> UUNPKHI Zresult.S, Zop.H To be added. @@ -45302,7 +45302,7 @@ To be added. - svuint64_t svunpkhi[_u64](svuint32_t op) + svuint64_t svunpkhi<see href="svuint32_t op">_u64</see> UUNPKHI Zresult.D, Zop.S To be added. @@ -45332,7 +45332,7 @@ To be added. To be added. - svuint8_t svzip2[_u8](svuint8_t op1, svuint8_t op2) + svuint8_t svzip2<see href="svuint8_t op1, svuint8_t op2">_u8</see> ZIP2 Zresult.B, Zop1.B, Zop2.B To be added. @@ -45362,7 +45362,7 @@ To be added. To be added. - svfloat64_t svzip2[_f64](svfloat64_t op1, svfloat64_t op2) + svfloat64_t svzip2<see href="svfloat64_t op1, svfloat64_t op2">_f64</see> ZIP2 Zresult.D, Zop1.D, Zop2.D To be added. @@ -45392,7 +45392,7 @@ To be added. To be added. - svint16_t svzip2[_s16](svint16_t op1, svint16_t op2) + svint16_t svzip2<see href="svint16_t op1, svint16_t op2">_s16</see> ZIP2 Zresult.H, Zop1.H, Zop2.H To be added. @@ -45422,7 +45422,7 @@ To be added. To be added. - svint32_t svzip2[_s32](svint32_t op1, svint32_t op2) + svint32_t svzip2<see href="svint32_t op1, svint32_t op2">_s32</see> ZIP2 Zresult.S, Zop1.S, Zop2.S To be added. @@ -45452,7 +45452,7 @@ To be added. To be added. - svint64_t svzip2[_s64](svint64_t op1, svint64_t op2) + svint64_t svzip2<see href="svint64_t op1, svint64_t op2">_s64</see> ZIP2 Zresult.D, Zop1.D, Zop2.D To be added. @@ -45482,7 +45482,7 @@ To be added. To be added. - svint8_t svzip2[_s8](svint8_t op1, svint8_t op2) + svint8_t svzip2<see href="svint8_t op1, svint8_t op2">_s8</see> ZIP2 Zresult.B, Zop1.B, Zop2.B To be added. @@ -45512,7 +45512,7 @@ To be added. To be added. - svfloat32_t svzip2[_f32](svfloat32_t op1, svfloat32_t op2) + svfloat32_t svzip2<see href="svfloat32_t op1, svfloat32_t op2">_f32</see> ZIP2 Zresult.S, Zop1.S, Zop2.S To be added. @@ -45542,7 +45542,7 @@ To be added. To be added. - svuint16_t svzip2[_u16](svuint16_t op1, svuint16_t op2) + svuint16_t svzip2<see href="svuint16_t op1, svuint16_t op2">_u16</see> ZIP2 Zresult.H, Zop1.H, Zop2.H svbool_t svzip2_b16(svbool_t op1, svbool_t op2) ZIP2 Presult.H, Pop1.H, Pop2.H @@ -45574,7 +45574,7 @@ To be added. To be added. - svuint32_t svzip2[_u32](svuint32_t op1, svuint32_t op2) + svuint32_t svzip2<see href="svuint32_t op1, svuint32_t op2">_u32</see> ZIP2 Zresult.S, Zop1.S, Zop2.S svbool_t svzip2_b32(svbool_t op1, svbool_t op2) ZIP2 Presult.S, Pop1.S, Pop2.S @@ -45606,7 +45606,7 @@ To be added. To be added. - svuint64_t svzip2[_u64](svuint64_t op1, svuint64_t op2) + svuint64_t svzip2<see href="svuint64_t op1, svuint64_t op2">_u64</see> ZIP2 Zresult.D, Zop1.D, Zop2.D svbool_t svzip2_b64(svbool_t op1, svbool_t op2) ZIP2 Presult.D, Pop1.D, Pop2.D @@ -45638,7 +45638,7 @@ To be added. To be added. - svuint8_t svzip1[_u8](svuint8_t op1, svuint8_t op2) + svuint8_t svzip1<see href="svuint8_t op1, svuint8_t op2">_u8</see> ZIP1 Zresult.B, Zop1.B, Zop2.B svbool_t svzip1_b8(svbool_t op1, svbool_t op2) ZIP1 Presult.B, Pop1.B, Pop2.B @@ -45670,7 +45670,7 @@ To be added. To be added. - svfloat64_t svzip1[_f64](svfloat64_t op1, svfloat64_t op2) + svfloat64_t svzip1<see href="svfloat64_t op1, svfloat64_t op2">_f64</see> ZIP1 Zresult.D, Zop1.D, Zop2.D To be added. @@ -45700,7 +45700,7 @@ To be added. To be added. - svint16_t svzip1[_s16](svint16_t op1, svint16_t op2) + svint16_t svzip1<see href="svint16_t op1, svint16_t op2">_s16</see> ZIP1 Zresult.H, Zop1.H, Zop2.H To be added. @@ -45730,7 +45730,7 @@ To be added. To be added. - svint32_t svzip1[_s32](svint32_t op1, svint32_t op2) + svint32_t svzip1<see href="svint32_t op1, svint32_t op2">_s32</see> ZIP1 Zresult.S, Zop1.S, Zop2.S To be added. @@ -45760,7 +45760,7 @@ To be added. To be added. - svint64_t svzip1[_s64](svint64_t op1, svint64_t op2) + svint64_t svzip1<see href="svint64_t op1, svint64_t op2">_s64</see> ZIP1 Zresult.D, Zop1.D, Zop2.D To be added. @@ -45790,7 +45790,7 @@ To be added. To be added. - svint8_t svzip1[_s8](svint8_t op1, svint8_t op2) + svint8_t svzip1<see href="svint8_t op1, svint8_t op2">_s8</see> ZIP1 Zresult.B, Zop1.B, Zop2.B To be added. @@ -45820,7 +45820,7 @@ To be added. To be added. - svfloat32_t svzip1[_f32](svfloat32_t op1, svfloat32_t op2) + svfloat32_t svzip1<see href="svfloat32_t op1, svfloat32_t op2">_f32</see> ZIP1 Zresult.S, Zop1.S, Zop2.S To be added. @@ -45850,7 +45850,7 @@ To be added. To be added. - svuint16_t svzip1[_u16](svuint16_t op1, svuint16_t op2) + svuint16_t svzip1<see href="svuint16_t op1, svuint16_t op2">_u16</see> ZIP1 Zresult.H, Zop1.H, Zop2.H svbool_t svzip1_b16(svbool_t op1, svbool_t op2) ZIP1 Presult.H, Pop1.H, Pop2.H @@ -45882,7 +45882,7 @@ To be added. To be added. - svuint32_t svzip1[_u32](svuint32_t op1, svuint32_t op2) + svuint32_t svzip1<see href="svuint32_t op1, svuint32_t op2">_u32</see> ZIP1 Zresult.S, Zop1.S, Zop2.S svbool_t svzip1_b32(svbool_t op1, svbool_t op2) ZIP1 Presult.S, Pop1.S, Pop2.S @@ -45914,7 +45914,7 @@ To be added. To be added. - svuint64_t svzip1[_u64](svuint64_t op1, svuint64_t op2) + svuint64_t svzip1<see href="svuint64_t op1, svuint64_t op2">_u64</see> ZIP1 Zresult.D, Zop1.D, Zop2.D svbool_t svzip1_b64(svbool_t op1, svbool_t op2) ZIP1 Presult.D, Pop1.D, Pop2.D @@ -45924,4 +45924,4 @@ - + \ No newline at end of file diff --git a/xml/System/Char.xml b/xml/System/Char.xml index 6373ff80de7..9175b0a1d71 100644 --- a/xml/System/Char.xml +++ b/xml/System/Char.xml @@ -9110,7 +9110,7 @@ This member is an explicit interface member implementation. It can be used only ]]> - As explained in Best Practices for Using Strings, we recommend that you avoid calling character-casing and string-casing methods that substitute default values. Instead, you should call methods that require parameters to be explicitly specified. To convert a character to lowercase by using the casing conventions of the current culture, call the method overload with a value of for its parameter. + As explained in Best Practices for Using Strings, we recommend that you avoid calling character-casing and string-casing methods that substitute default values. Instead, you should call methods that require parameters to be explicitly specified. To convert a character to lowercase by using the casing conventions of the current culture, call the method overload with a value of for its culture parameter. @@ -9529,7 +9529,7 @@ This member is an explicit interface member implementation. It can be used only ]]> - As explained in Best Practices for Using Strings, we recommend that you avoid calling character-casing and string-casing methods that substitute default values. Instead, you should call methods that require parameters to be explicitly specified. To convert a character to uppercase by using the casing conventions of the current culture, call the method overload with a value of for its parameter. + As explained in Best Practices for Using Strings, we recommend that you avoid calling character-casing and string-casing methods that substitute default values. Instead, you should call methods that require parameters to be explicitly specified. To convert a character to uppercase by using the casing conventions of the current culture, call the method overload with a value of for its culture parameter. diff --git a/xml/System/Uri.xml b/xml/System/Uri.xml index 30b73d15062..fc06c487ac8 100644 --- a/xml/System/Uri.xml +++ b/xml/System/Uri.xml @@ -5984,7 +5984,7 @@ The following examples show a URI and the results of calling Gets a value that indicates whether the URI string was completely escaped before the instance was created. - if the parameter was set to when the instance was created; otherwise, . + if the dontEscape parameter was set to when the instance was created; otherwise, .