convert into compound assignment c#

This web site uses cookies. By using the site you accept the cookie policy . This message is for compliance with the UK ICO law .

C# Compound Assignment Operators

The seventh part of the C# Fundamentals tutorial extends knowledge of the assignment operator into compound assignment operators. These operators permit modification of variable values using the arithmetic functions described earlier in the tutorial.

The Assignment Operator

The basic assignment operator (=) was reviewed in the third part of the C# Fundamentals tutorial . This operator is used to assign value to variables. We have used the operator in every part of the tutorial since, so no further explanation is necessary.

Compound Assignment Operators

There are further assignment operators that can be used to modify the value of an existing variable. These are the compound assignment operators . A compound assignment operator is used to simplify the coding of some expressions. For example, using the operators described earlier we can increase a variable's value by ten using the following code:

This statement has an equivalent using the compound assignment operator for addition (+=).

There are compound assignment operators for each of the five binary arithmetic operators (+ - * / %) that we have investigated so far in the tutorial. Each is constructed using the arithmetic operator followed by the assignment operator. The following code gives examples for addition (+=), subtraction (-=), multiplication (*=), division (/=) and modulus (%=):

Compound assignment operators provide two benefits. Firstly, they produce more compact code; they are often called shorthand operators for this reason. Secondly, the variable being operated upon, or operand , will only be evaluated once in the compiled application. This can make the code more efficient.

Operator Precedence

The assignment operator and the compound assignment operators have the lowest priority; they appear at the end of the operator precedence table.

DEV Community

Posted on Jan 5, 2020

Coalescing operator and Compound assignment operator in C#

Hello! Today i want to ask you this: Have you ever used a Null Coalescing operator or even a Compound assignment operator in C# ?

Until today i had never heard about this things, so i want to share with you what i learned about and how it can be applied to your code.

The problem

Let's say you want to give a given variable the value of null.

Now, if we want to print the value on the screen it will accuse the following error:

Let's see how to get around this...

The old way 👎

The old and 'commom way' to check this is using if else operators like this:

We see that in this case we cannot place a default value to x and y operators. So we display on screen when it is null.

The Null Coalescing operator way 👌

First, a null coalescing operator (??) is used to define a default value for nullable value types or reference types. It returns the left-hand operand if the operand is not null, otherwise, it returns the right operand.

So it's mainly used to simplify checking for null values and also assign a default value to a variable when the value is null.

Using our example:

This way i can make a default value on x and y when one of them is null. And so, we can print on screen!

But can it be better?

The Compound assignment operator way 😎

The Compound assignment operator (??=) was introduced on C# 8.0 and has made our job easier. It simply reduces what we have to write and has the same result.

Instead of writing double x = x ?? 0.0; We can just write double x ??= 0.0;

Simple, right?

Hope you enjoyed this post, it's simple but it's something worth sharing for me.

Thanks for your time!😊

Links: https://dzone.com/articles/nullable-types-and-null-coalescing-operator-in-c

https://dev.to/mpetrinidev/the-null-coalescing-operator-in-c-8-0-4ib4

https://docs.microsoft.com/pt-br/dotnet/csharp/language-reference/operators/null-coalescing-operator

Top comments (3)

Templates let you quickly answer FAQs or store snippets for re-use.

• Email [email protected]
• Location São José dos Campos
• Work Cloud Engineer | AWS Community Builder
• Joined May 21, 2019

• Joined Dec 16, 2017

Good article. Thank you.

• Location Brazil
• Work Intern at Agrotools
• Joined Oct 22, 2019

Awesome Dude, simple but unknown by most programmers

Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink .

Hide child comments as well

For further actions, you may consider blocking this person and/or reporting abuse

How to duplicate a Sanity Dataset for FREE

Julian Bustos - Apr 4

Lessons from open-source: How obsessed are you with following Single Responsibility Principle?

Ramu Narasinga - Apr 4

Working with OpenAPI using Rust

Shuttle - Apr 4

Understanding Cryptocurrency Regulation: Government Policies and Concerns Across Nations

Achmad Fauzian Dhany Hidayat - Apr 4

We're a place where coders share, stay up-to-date and grow their careers.

Compound Assignment in

About compound assignment.

Many operators can also be used as compound assignments , which are a shorthand notation where x = op y can be written as x op= y :

• Trending Categories

• Selected Reading
• UPSC IAS Exams Notes
• Developer's Best Practices
• Questions and Answers
• Effective Resume Writing
• HR Interview Questions
• Computer Glossary

Compound assignment operators in C#

A compound assignment operator has a shorter syntax to assign the result. The operation is performed on the two operands before the result is assigned to the first operand.

The following are the compound assignment operators in C#.

Let us see an example to learn how to work with compound assignment operators in C#.

 Live Demo

Learning faster. Every day.

Related Articles

• Compound Assignment Operators in C++
• Compound assignment operators in Java\n
• Assignment Operators in C++
• What are assignment operators in C#?
• Perl Assignment Operators
• Assignment operators in Dart Programming
• What are Assignment Operators in JavaScript?
• Compound operators in Arduino
• What is the difference between = and: = assignment operators?
• Passing the Assignment in C++
• Airplane Seat Assignment Probability in C++
• What is an assignment operator in C#?
• Copy constructor vs assignment operator in C++
• Ternary Operators in C/C++
• Unary operators in C/C++

Kickstart Your Career

Get certified by completing the course

Microsoft Visual C# Step by Step, Ninth Edition by John Sharp

Get full access to Microsoft Visual C# Step by Step, Ninth Edition and 60K+ other titles, with a free 10-day trial of O'Reilly.

There are also live events, courses curated by job role, and more.

Using compound assignment and iteration statements

After completing this chapter, you will be able to:

Update the value of a variable by using compound assignment operators.

Write while, for , and do iteration statements.

Step through a do statement and watch as the values of variables change.

C hapter 4, “Using decision statements,” demonstrates how to use the if and switch constructs to run statements selectively. In this chapter, you’ll see how to use a variety of iteration (or looping ) statements to run one or more statements repeatedly.

When you write iteration statements, you usually need to control the number of iterations that you perform. You can achieve this by using a variable, updating its value as each iteration is performed, ...

Get Microsoft Visual C# Step by Step, Ninth Edition now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.

Don’t leave empty-handed

Get Mark Richards’s Software Architecture Patterns ebook to better understand how to design components—and how they should interact.

It’s yours, free.

Check it out now on O’Reilly

Dive in for free with a 10-day trial of the O’Reilly learning platform—then explore all the other resources our members count on to build skills and solve problems every day.

An additional set of operators that is common to virtually all programming languages is the set of operators for manipulating values in their binary formats: the bit operators.

All values within a computer are represented in a binary format of 1s and 0s, called binary digits ( bits ). Bits are grouped together in sets of eight, called bytes . In a byte, each successive bit corresponds to a value of 2 raised to a power, starting from 2 0 on the right and moving to 2 7 on the left, as shown in Figure 4.1 .

In many scenarios, particularly when dealing with low-level or system services, information is retrieved as binary data. To manipulate these devices and services, you need to perform manipulations of binary data.

In Figure 4.2 , each box corresponds to a value of 2 raised to the power shown. The value of the byte (8-bit number) is the sum of the powers of 2 of all of the eight bits that are set to 1.

The binary translation just described is significantly different for signed numbers. Signed numbers ( long , short , int ) are represented using a two’s complement notation. This practice ensures that addition continues to work when adding a negative number to a positive number, as though both were positive operands. With this notation, negative numbers behave differently from positive numbers. Negative numbers are identified by a 1 in the leftmost location. If the leftmost location contains a 1, you add the locations with 0s rather than the locations with 1s. Each location corresponds to the negative power of 2 value. Furthermore, from the result, it is also necessary to subtract 1. This is demonstrated in Figure 4.3 .

Therefore, 1111 1111 1111 1111 corresponds to –1, and 1111 1111 1111 1001 holds the value –7. The binary representation 1000 0000 0000 0000 corresponds to the lowest negative value that a 16-bit integer can hold.

Sometimes you want to shift the binary value of a number to the right or left. In executing a left shift, all bits in a number’s binary representation are shifted to the left by the number of locations specified by the operand on the right of the shift operator. Zeroes then backfill the locations on the right side of the binary number. A right-shift operator does almost the same thing in the opposite direction. However, if the number is a negative value of a signed type, the values used to backfill the left side of the binary number are 1s, rather than 0s. The shift operators are >> and << , known as the right-shift and left-shift operators, respectively. In addition, C# includes combination shift and assignment operators, <<= and >>= .

Consider the following example. Suppose you had the int value -7 , which would have a binary representation of 1111 1111 1111 1111 1111 1111 1111 1001 . In Listing 4.40 (with Output 4.17 ), you right-shift the binary representation of the number –7 by two locations.

Because of the right shift, the value of the bit in the rightmost location has “dropped off” the edge, and the negative bit indicator on the left shifts by two locations to be replaced with 1s. The result is -2 .

Although legend has it that x << 2 is faster than x * 4 , you should not use bit-shift operators for multiplication or division. This difference might have held true for certain C compilers in the 1970s, but modern compilers and modern microprocessors are perfectly capable of optimizing arithmetic. Using shifting for multiplication or division is confusing and frequently leads to errors when code maintainers forget that the shift operators are lower precedence than the arithmetic operators.

In some instances, you might need to perform logical operations, such as AND, OR, and XOR, on a bit-by-bit basis for two operands. You do this via the & , | , and ^ operators, respectively.

If you have two numbers, as shown in Figure 4.4 , the bitwise operations will compare the values of the locations beginning at the leftmost significant value and continuing right until the end. The value of “1” in a location is treated as “true,” and the value of “0” in a location is treated as “false.”

The bitwise AND of the two values in Figure 4.4 would entail the bit-by-bit comparison of bits in the first operand (12) with the bits in the second operand (7), resulting in the binary value 000000100 , which is 4. Alternatively, a bitwise OR of the two values would produce 00001111 , the binary equivalent of 15. The XOR result would be 00001011 , or decimal 11.

Listing 4.41 demonstrates the use of these bitwise operators. The results of Listing 4.41 appear in Output 4.18 .

In Listing 4.41 , the value 7 is the mask ; it is used to expose or eliminate specific bits within the first operand using the specified operator expression. Note that, unlike the AND ( && ) operator, the & operator always evaluates both sides even if the left portion is false. Similarly, the | version of the OR operator is not “short-circuiting”: It always evaluates both operands, even if the left operand is true. The bit versions of the AND and OR operators, therefore, are not short-circuiting.

To convert a number to its binary representation, you need to iterate across each bit in a number. Listing 4.42 is an example of a program that converts an integer to a string of its binary representation. The results of Listing 4.42 appear in Output 4.19 .

Within each iteration of the for loop in Listing 4.42 (as discussed later in this chapter), we use the right-shift assignment operator to create a mask corresponding to each bit position in value . By using the & bit operator to mask a particular bit, we can determine whether the bit is set. If the mask test produces a nonzero result, we write 1 to the console; otherwise, we write 0 . In this way, we create output describing the binary value of an unsigned long .

Note also that the parentheses in (mask & value) != 0 are necessary because inequality is higher precedence than the AND operator. Without the explicit parentheses, this expression would be equivalent to mask & (value != 0) , which does not make any sense; the left side of the & is a ulong and the right side is a bool .

This example is provided for learning purposes only. There is actually a built-in CLR method, System.Convert.ToString(value, 2) , that does such a conversion. In fact, the second argument specifies the base (e.g., 2 for binary, 10 for decimal, or 16 for hexadecimal), allowing for more than just conversion to binary.

Not surprisingly, you can combine these bitwise operators with assignment operators as follows: &= , |= , and ^= . As a result, you could take a variable, OR it with a number, and assign the result back to the original variable, which Listing 4.43 with Output 4.20 demonstrates.

Combining a bitmap with a mask using something like fields &= mask clears the bits in fields that are not set in the mask . The opposite, fields &= ~mask , clears the bits in fields that are set in mask .

The bitwise complement operator takes the complement of each bit in the operand, where the operand can be an int , uint , long , or ulong . The expression ~1 , therefore, returns the value with binary notation 1111 1111 1111 1111 1111 1111 1111 1110 , and ~(1<<31) returns the number with binary notation 0111 1111 1111 1111 1111 1111 1111 1111 .

• p.key == item.key) && !currentPage.some(p => p.level > item.level), }" > p.key == item.key) && !currentPage.some(p => p.level > item.level), }" :href="item.href"> Introduction
• p.key == item.key) && !currentPage.some(p => p.level > item.level), }" > p.key == item.key), }" :href="item.href"> {{item.title}}

JetBrains Rider 2023.3 Help

Context actions for c#.

JetBrains Rider provides the following context actions for C#:

• Blogs by Topic

The .NET Tools Blog

Essential productivity kit for .NET developers

• Guide Guide

Collection Expressions – Using C# 12 in Rider and ReSharper

Welcome to our series, where we take a closer look at the C# 12 language features and how ReSharper and Rider make it easy for you to adopt them in your codebase. If you haven’t yet, download the latest .NET 8 SDK and update your project files !

In this series, we are looking at:

• Primary Constructors
• Interceptors
• Alias Any Type
• Collection Expressions

This third part is all about collection expressions and how you can take full advantage of them with ReSharper and Rider!

Background and Syntax

In C#, we use many different types to represent collections, with various ways to create and initialize them. Many have verbose syntax, while some come with performance drawbacks, and together they make for a jumble of inconsistent code styles ( ToList vs. ToArray , IEnumerable<T> vs. params T[] , etc.). That’s plenty of motivation to sort it out and catch up with other languages like TypeScript or Python, which already successfully provide a succinct syntax. Some of the foundation for matching and deconstruction was already laid with the introduction of list patterns in C# 11 . With C# 12, we can also enjoy the power of construction!

Let’s compare how collections were constructed before C# 12 and how much cleaner they can be written now:

Since collection literals are target-typed , we cannot use var but must declare the type name for our variable. You can also see how the .. spread operator is used on the first array to integrate it into a new array with additional elements. Note that spreading could also be used between two elements.

IL Code and Conversion of Collection Expressions

You can use collection expressions to create collections for the most well-known collection types. The compiler automatically converts them to the appropriate target type:

Diving deeper into the low-level C# code generated by the compiler is always interesting. Feel free to take a look at our SharpLab snippet or to spin up the IL Viewer in ReSharper/Rider on your own solution to inspect some of these collection expressions:

Note that when the target type is IReadOnlyList<T> or IEnumerable<T> , using collection expressions comes with an additional allocation cost. In the following example, the compiler would allocate an array object for storage but also wrap this array into a compiler-generated collection class which forbids modifications at runtime:

Collection expressions also solve the issue of conversion where elements of a collection are more derived than the target’s scalar type. While the compiler initializes the collection, it implicitly takes advantage of assignment compatibility and conversion operators :

Supporting Collection Expressions on Custom Types

Similar to the duck-typing approaches for awaiting , iterating , or deconstructing objects, you can support collection expressions for your own types ! Assuming your type is a collection type, you just need to add the CollectionBuilderAttribute and provide a create method :

Do you have an interesting use case? Please let us know in the comments!

Conversion and Simplification

As with many new language features, you may find yourself eager to quickly integrate them into your daily coding routines and establish new habits. You might also feel compelled to convert the entire codebase to use these shiny additions. Unsurprisingly, ReSharper and Rider have you covered!

You can use the Use collection expression quick-fix to convert arrays, lists, and other collection-like objects to the new, more succinct syntax:

The quick-fix also takes Add calls below the initializer into account:

Of course, you can apply this quick-fix in bulk to save space and cognitive load throughout your solution, project, or file:

The bulk-fix may also bring you some peace of mind by unifying the various ways of passing empty collections :

Conversion Limitations

There are situations that ReSharper and Rider will handle more pessimistically to avoid possible runtime errors. At first, it might look like a good idea to convert the following method to use collection expressions:

However, we must anticipate that the caller may take advantage of the implementation and cast the results to a List<int> . In this case, converting to a collection expression would break the code with an InvalidCastException .

Code Style and Formatting

Every team has its unique taste regarding how code should be styled and formatted. ReSharper and Rider help you enforce your particular style through the Reformat Code action! As part of our collection expressions support, we’ve added new code style settings under some categories, like under the Line Breaks and Wrapping section:

Or under the Tabs, Indents, Alignment section:

You can try these new settings by selecting a code block and invoking the Configure code style action. Alternatively, you can grab the following snippet and adapt the formatter comments:

Future Work

We’re not done! We are still working on additional quick-fixes and context actions to make conversion easier for you. For example, we will support conversion for ToList , ToArray , and AsReadOnly invocations as well as simplifications to nested collection expressions.

In this post, we discovered several features related to the new C# 12 collection expressions. Try ReSharper 2024.1 EAP or Rider 2024.1 EAP to get the most out of the latest C# 12 in your daily work! If you see any opportunities for additional support, please let us know in the comments below!

Subscribe to a monthly digest curated from the .NET Tools blog:

By submitting this form, I agree that JetBrains s.r.o. ("JetBrains") may use my name, email address, and location data to send me newsletters, including commercial communications, and to process my personal data for this purpose. I agree that JetBrains may process said data using third-party services for this purpose in accordance with the JetBrains Privacy Policy . I understand that I can revoke this consent at any time in my profile . In addition, an unsubscribe link is included in each email.

Thanks, we've got you!

Discover more

dotInsights | April 2024

Welcome to dotInsights by JetBrains! This newsletter is the home for recent .NET and software development related content. Featured Content This month, we bring you featured content from Dennis Dietrich! Dennis Dietrich is a manager at Phoenix Contact's Industrial Cabinet Solutions (ICS) busin…

The Rider 2024.1 Release Candidate Is Now Available

There’s only a few days left before the next major release for Rider! Don’t feel like waiting? Get a sneak peek of Rider 2024.1 now by downloading the Release Candidate build that has just landed on our website. The Release Candidate build contains all of the notable changes that we’ve introduc…

The ReSharper 2024.1 Release Candidate Is Now Available

Get a preview of all the latest features and improvements set to be shipped with the next major ReSharper and .NET tools releases by downloading the Release Candidate builds that have just landed. Here are the major improvements in each of the new builds: The ReSharper 2024.1 Release Can…

Sirenix’s Odin Inspector Support Comes to Rider, a JetBrains IDE

JetBrains Rider now recognizes Odin serialization, provides code analysis for grouping attributes, offers color pickers for color attributes, and more.

This browser is no longer supported.

Upgrade to Microsoft Edge to take advantage of the latest features, security updates, and technical support.

Bitwise and shift operators (C# reference)

• 9 contributors

The bitwise and shift operators include unary bitwise complement, binary left and right shift, unsigned right shift, and the binary logical AND, OR, and exclusive OR operators. These operands take operands of the integral numeric types or the char type.

• Unary ~ (bitwise complement) operator
• Binary << (left shift) , >> (right shift) , and >>> (unsigned right shift) operators
• Binary & (logical AND) , | (logical OR) , and ^ (logical exclusive OR) operators

Those operators are defined for the int , uint , long , and ulong types. When both operands are of other integral types ( sbyte , byte , short , ushort , or char ), their values are converted to the int type, which is also the result type of an operation. When operands are of different integral types, their values are converted to the closest containing integral type. For more information, see the Numeric promotions section of the C# language specification . The compound operators (such as >>= ) don't convert their arguments to int or have the result type as int .

The & , | , and ^ operators are also defined for operands of the bool type. For more information, see Boolean logical operators .

Bitwise and shift operations never cause overflow and produce the same results in checked and unchecked contexts.

• Bitwise complement operator ~

The ~ operator produces a bitwise complement of its operand by reversing each bit:

You can also use the ~ symbol to declare finalizers. For more information, see Finalizers .

Left-shift operator <<

The << operator shifts its left-hand operand left by the number of bits defined by its right-hand operand. For information about how the right-hand operand defines the shift count, see the Shift count of the shift operators section.

The left-shift operation discards the high-order bits that are outside the range of the result type and sets the low-order empty bit positions to zero, as the following example shows:

Because the shift operators are defined only for the int , uint , long , and ulong types, the result of an operation always contains at least 32 bits. If the left-hand operand is of another integral type ( sbyte , byte , short , ushort , or char ), its value is converted to the int type, as the following example shows:

Right-shift operator >>

The >> operator shifts its left-hand operand right by the number of bits defined by its right-hand operand. For information about how the right-hand operand defines the shift count, see the Shift count of the shift operators section.

The right-shift operation discards the low-order bits, as the following example shows:

The high-order empty bit positions are set based on the type of the left-hand operand as follows:

If the left-hand operand is of type int or long , the right-shift operator performs an arithmetic shift: the value of the most significant bit (the sign bit) of the left-hand operand is propagated to the high-order empty bit positions. That is, the high-order empty bit positions are set to zero if the left-hand operand is non-negative and set to one if it's negative.

If the left-hand operand is of type uint or ulong , the right-shift operator performs a logical shift: the high-order empty bit positions are always set to zero.

Use the unsigned right-shift operator to perform a logical shift on operands of signed integer types. This is preferred to casting a left-hand operand to an unsigned type and then casting the result of a shift operation back to a signed type.

Unsigned right-shift operator >>>

Available in C# 11 and later, the >>> operator shifts its left-hand operand right by the number of bits defined by its right-hand operand. For information about how the right-hand operand defines the shift count, see the Shift count of the shift operators section.

The >>> operator always performs a logical shift. That is, the high-order empty bit positions are always set to zero, regardless of the type of the left-hand operand. The >> operator performs an arithmetic shift (that is, the value of the most significant bit is propagated to the high-order empty bit positions) if the left-hand operand is of a signed type. The following example demonstrates the difference between >> and >>> operators for a negative left-hand operand:

• Logical AND operator &

The & operator computes the bitwise logical AND of its integral operands:

For bool operands, the & operator computes the logical AND of its operands. The unary & operator is the address-of operator .

• Logical exclusive OR operator ^

The ^ operator computes the bitwise logical exclusive OR, also known as the bitwise logical XOR, of its integral operands:

For bool operands, the ^ operator computes the logical exclusive OR of its operands.

• Logical OR operator |

The | operator computes the bitwise logical OR of its integral operands:

For bool operands, the | operator computes the logical OR of its operands.

• Compound assignment

For a binary operator op , a compound assignment expression of the form

is equivalent to

except that x is only evaluated once.

The following example demonstrates the usage of compound assignment with bitwise and shift operators:

Because of numeric promotions , the result of the op operation might be not implicitly convertible to the type T of x . In such a case, if op is a predefined operator and the result of the operation is explicitly convertible to the type T of x , a compound assignment expression of the form x op= y is equivalent to x = (T)(x op y) , except that x is only evaluated once. The following example demonstrates that behavior:

Operator precedence

The following list orders bitwise and shift operators starting from the highest precedence to the lowest:

• Shift operators << , >> , and >>>

Use parentheses, () , to change the order of evaluation imposed by operator precedence:

For the complete list of C# operators ordered by precedence level, see the Operator precedence section of the C# operators article.

Shift count of the shift operators

For the built-in shift operators << , >> , and >>> , the type of the right-hand operand must be int or a type that has a predefined implicit numeric conversion to int .

For the x << count , x >> count , and x >>> count expressions, the actual shift count depends on the type of x as follows:

If the type of x is int or uint , the shift count is defined by the low-order five bits of the right-hand operand. That is, the shift count is computed from count & 0x1F (or count & 0b_1_1111 ).

If the type of x is long or ulong , the shift count is defined by the low-order six bits of the right-hand operand. That is, the shift count is computed from count & 0x3F (or count & 0b_11_1111 ).

The following example demonstrates that behavior:

As the preceding example shows, the result of a shift operation can be non-zero even if the value of the right-hand operand is greater than the number of bits in the left-hand operand.

Enumeration logical operators

The ~ , & , | , and ^ operators are also supported by any enumeration type. For operands of the same enumeration type, a logical operation is performed on the corresponding values of the underlying integral type. For example, for any x and y of an enumeration type T with an underlying type U , the x & y expression produces the same result as the (T)((U)x & (U)y) expression.

You typically use bitwise logical operators with an enumeration type that is defined with the Flags attribute. For more information, see the Enumeration types as bit flags section of the Enumeration types article.

Operator overloadability

A user-defined type can overload the ~ , << , >> , >>> , & , | , and ^ operators. When a binary operator is overloaded, the corresponding compound assignment operator is also implicitly overloaded. A user-defined type can't explicitly overload a compound assignment operator.

If a user-defined type T overloads the << , >> , or >>> operator, the type of the left-hand operand must be T . In C# 10 and earlier, the type of the right-hand operand must be int ; beginning with C# 11, the type of the right-hand operand of an overloaded shift operator can be any.

C# language specification

For more information, see the following sections of the C# language specification :

• Bitwise complement operator
• Shift operators
• Logical operators
• Numeric promotions
• C# 11 - Relaxed shift requirements
• C# 11 - Logical right-shift operator
• C# operators and expressions
• Boolean logical operators

Coming soon: Throughout 2024 we will be phasing out GitHub Issues as the feedback mechanism for content and replacing it with a new feedback system. For more information see: https://aka.ms/ContentUserFeedback .

Submit and view feedback for

Additional resources