This is a list ofoperators in theC andC++programming languages.
All listed operators are in C++ and lacking indication otherwise, in C as well. Some tables include a "In C" column that indicates whether an operator is also in C. Note that C does not supportoperator overloading.
When not overloaded, for the operators&&,||, and, (thecomma operator), there is asequence point after the evaluation of the first operand.
Most of the operators available in C and C++ are also available in otherC-family languages such asC#,D,Java,Perl, andPHP with the same precedence, associativity, and semantics.
Many operators specified by a sequence of symbols are commonly referred to by a name that consists of the name of each symbol. For example,+= and-= are often called "plus equal(s)" and "minus equal(s)", instead of the more verbose "assignment by addition" and "assignment by subtraction".
In the following tables, lower case letters such asa andb represent literal values, object/variable names, or l-values, as appropriate.R,S andT stand for a data type, andK for a class or enumeration type. Some operators have alternative spellings usingdigraphs and trigraphs oroperator synonyms.
C and C++ have the same arithmetic operators and all can be overloaded in C++.
| Operation | Syntax | C++ prototype | ||
|---|---|---|---|---|
| in class K | outside class | |||
| Addition | a+ b | RK::operator+(Sb); | Roperator+(Ka,Sb); | |
| Subtraction | a- b | RK::operator-(Sb); | Roperator-(Ka,Sb); | |
| Unary plus;integer promotion | +a | RK::operator+(); | Roperator+(Ka); | |
| Unary minus;additive inverse | -a | RK::operator-(); | Roperator-(Ka); | |
| Multiplication | a* b | RK::operator*(Sb); | Roperator*(Ka,Sb); | |
| Division | a/ b | RK::operator/(Sb); | Roperator/(Ka,Sb); | |
| Modulo[a] | a% b | RK::operator%(Sb); | Roperator%(Ka,Sb); | |
| Prefixincrement | ++a | R&K::operator++(); | R&operator++(K&a); | |
| Postfix increment | a++ | RK::operator++(int);[b] | Roperator++(K&a,int);[b] | |
| Prefixdecrement | --a | R&K::operator--(); | R&operator--(K&a); | |
| Postfix decrement | a-- | RK::operator--(int);[b] | Roperator--(K&a,int);[b] | |
Allrelational (comparison) operators can be overloaded in C++. SinceC++20, the inequality operator is automatically generated ifoperator== is defined and all four relational operators are automatically generated ifoperator<=> is defined.[1]
| Operation | Syntax | In C | C++ prototype | ||
|---|---|---|---|---|---|
| in class K | outside class | ||||
| Equal to | a== b | Yes | boolK::operator==(Sconst&b)const; | booloperator==(Kconst&a,Sconst&b); | |
| Not equal to | a!= b | Yes | boolK::operator!=(Sconst&b)const; | booloperator!=(Kconst&a,Sconst&b); | |
| Greater than | a> b | Yes | boolK::operator>(Sconst&b)const; | booloperator>(Kconst&a,Sconst&b); | |
| Less than | a< b | Yes | boolK::operator<(Sconst&b)const; | booloperator<(Kconst&a,Sconst&b); | |
| Greater than or equal to | a>= b | Yes | boolK::operator>=(Sconst&b)const; | booloperator>=(Kconst&a,Sconst&b); | |
| Less than or equal to | a<= b | Yes | boolK::operator<=(Sconst&b)const; | booloperator<=(Kconst&a,Sconst&b); | |
| Three-way comparison[c][d] | a<=> b | No | autoK::operator<=>(constS&b); | autooperator<=>(constK&a,constS&b); | |
C and C++ have the same logical operators and all can be overloaded in C++.
Note that overloading logicalAND andOR is discouraged, because as overloaded operators they always evaluate both operands instead of providing the normal semantics ofshort-circuit evaluation.[2]
| Operation | Syntax | C++ prototype | ||
|---|---|---|---|---|
| in class K | outside class | |||
| NOT | !a | boolK::operator!(); | booloperator!(Ka); | |
| AND | a&& b | boolK::operator&&(Sb); | booloperator&&(Ka,Sb); | |
| OR | a|| b | boolK::operator||(Sb); | booloperator||(Ka,Sb); | |
C and C++ have the same bitwise operators and all can be overloaded in C++.
| Operation | Syntax | C++ prototype | ||
|---|---|---|---|---|
| in class K | outside class | |||
| NOT | ~a | RK::operator~(); | Roperator~(Ka); | |
| AND | a& b | RK::operator&(Sb); | Roperator&(Ka,Sb); | |
| OR | a| b | RK::operator|(Sb); | Roperator|(Ka,Sb); | |
| XOR | a^ b | RK::operator^(Sb); | Roperator^(Ka,Sb); | |
| Shift left[e] | a<< b | RK::operator<<(Sb); | Roperator<<(Ka,Sb); | |
| Shift right[e][f] | a>> b | RK::operator>>(Sb); | Roperator>>(Ka,Sb); | |
C and C++ have the same assignment operators and all can be overloaded in C++.
For the combination operators,a ⊚= b (where⊚ represents an operation) is equivalent toa = a ⊚ b, except thata is evaluated only once.
| Operation | Syntax | C++ prototype | |
|---|---|---|---|
| in class K | outside class | ||
| Assignment | a= b | R&K::operator=(Sb); | N/a |
| Addition combination | a+= b | R&K::operator+=(Sb); | R&operator+=(K&a,Sb); |
| Subtraction combination | a-= b | R&K::operator-=(Sb); | R&operator-=(K&a,Sb); |
| Multiplication combination | a*= b | R&K::operator*=(Sb); | R&operator*=(K&a,Sb); |
| Division combination | a/= b | R&K::operator/=(Sb); | R&operator/=(K&a,Sb); |
| Modulo combination | a%= b | R&K::operator%=(Sb); | R&operator%=(K&a,Sb); |
| Bitwise AND combination | a&= b | R&K::operator&=(Sb); | R&operator&=(K&a,Sb); |
| Bitwise OR combination | a|= b | R&K::operator|=(Sb); | R&operator|=(K&a,Sb); |
| Bitwise XOR combination | a^= b | R&K::operator^=(Sb); | R&operator^=(K&a,Sb); |
| Bitwise left shift combination | a<<= b | R&K::operator<<=(Sb); | R&operator<<=(K&a,Sb); |
| Bitwise right shift combination[g] | a>>= b | R&K::operator>>=(Sb); | R&operator>>=(K&a,Sb); |
| Operation | Syntax | Can overload | In C | C++ prototype | ||
|---|---|---|---|---|---|---|
| in class K | outside class | |||||
| Subscript | a[b]a<:b:>[4] | Yes | Yes | R&K::operator[](Sb);R&K::operator[](Sb,...);[h] | N/a | |
| Indirection (object pointed to bya) | *a | Yes | Yes | R&K::operator*(); | R&operator*(Ka); | |
| Address-of (address ofa) | &a | Yes[i] | Yes | R*K::operator&(); | R*operator&(Ka); | |
| Structure dereference (memberb of object pointed to bya) | a->b | Yes | Yes | R*K::operator->();[j] | N/a | |
| Structure reference (memberb of objecta) | a.b | No | Yes | N/a | ||
| Member selected bypointer-to-memberb of object pointed to bya[k] | a->*b | Yes | No | R&K::operator->*(Sb); | R&operator->*(Ka,Sb); | |
| Member of objecta selected bypointer-to-memberb | a.*b | No | No | N/a | ||
| Operation | Syntax | Can overload | In C | C++ prototype | ||
|---|---|---|---|---|---|---|
| in class K | outside class | |||||
| Function call | a(a1, a2) | Yes | Yes | RK::operator()(Sa,Tb,...); | N/a | |
| Comma | a, b | Yes | Yes | RK::operator,(Sb); | Roperator,(Ka,Sb); | |
| Ternary conditional | a? b: c | No | Yes | N/a | ||
| Scope resolution | a::b[l] | No | No | N/a | ||
| User-defined literals[m][n] | "a"_b | Yes | No | N/a | Roperator""_b(Ta) | |
| Sizeof | sizeof a[o]sizeof (R) | No | Yes | N/a | ||
| Size ofparameter pack[n] | sizeof...(Args) | No | No | N/a | ||
| Alignof[n] | alignof(R)or _Alignof(R)[p] | No | Yes | N/a | ||
| Typeof[q] | typeof(a)typeof(R)typeof_unqual(a)typeof_unqual(R) | N/a | Yes | N/a | ||
| Decltype[n] | decltype(a)decltype(R) | No | No | N/a | ||
| Type identification | typeid(a)typeid(R) | No | No | N/a | ||
| Conversion (C-style cast) | (R)a | Yes | Yes | K::operatorR();[5] | N/a | |
| Conversion[r][6] | R(a)R{a}[n]auto(a)[h]auto{a}[h] | No | No | N/a | ||
| static_cast conversion[s] | static_cast<R>(a) | Yes | No | K::operatorR();explicitK::operatorR();[n] | N/a | |
| dynamic cast conversion | dynamic_cast<R>(a) | No | No | N/a | ||
| const_cast conversion | const_cast<R>(a) | No | No | N/a | ||
| reinterpret_cast conversion | reinterpret_cast<R>(a) | No | No | N/a | ||
| Allocate memory | new R[t] | Yes | No | void*K::operatornew(size_tx); | void*operatornew(size_tx); | |
| Allocate array | new R[n][u] | Yes | No | void*K::operatornew[](size_ta); | void*operatornew[](size_ta); | |
| Deallocate memory | delete a | Yes | No | voidK::operatordelete(void*a); | voidoperatordelete(void*a); | |
| Deallocate array | delete[] a | Yes | No | voidK::operatordelete[](void*a); | voidoperatordelete[](void*a); | |
| Exception check[n] | noexcept(a) | No | No | N/a | ||
| Reflection[v] | ^^a | No | No | N/a | ||
C++ defines keywords to act as aliases for a number of operators:[7]
| Keyword | Operator |
|---|---|
and | && |
and_eq | &= |
bitand | & |
bitor | | |
compl | ~ |
not | ! |
not_eq | != |
or | || |
or_eq | |= |
xor | ^ |
xor_eq | ^= |
Each keyword is a different way to specify an operator and as such can be used instead of the corresponding symbolic variation. For example,(a > 0 and not flag) and(a > 0 && !flag) specify the same behavior. As another example, thebitand keyword may be used to replace not only thebitwise-and operator but also theaddress-of operator, and it can be used to specify reference types (e.g.,int bitand ref = n).
The ISO C specification makes allowance for these keywords as preprocessor macros in the header fileiso646.h. For compatibility with C, C++ also provides the headeriso646.h, the inclusion of which has no effect. Until C++20, it also provided the corresponding headerciso646 which had no effect as well.
During expression evaluation, the order in which sub-expressions are evaluated is determined byprecedence andassociativity. An operator with higher precedence is evaluated before a operator of lower precedence and the operands of an operator are evaluated based on associativity. The following table describes the precedence and associativity of the C and C++ operators. Operators are shown in groups of equal precedence with groups ordered in descending precedence from top to bottom (lower order is higher precedence).[8][9][10]
Operator precedence is not affected by overloading.
| Order | Operator | Description | Associativity |
|---|---|---|---|
| 1 highest | :: | Scope resolution (C++ only) | None |
| 2 | ++ | Postfix increment | Left-to-right |
-- | Postfix decrement | ||
() | Function call | ||
[] | Array subscripting | ||
. | Element selection by reference | ||
-> | Element selection through pointer | ||
typeid() | Run-time type information (C++ only) (seetypeid) | ||
const_cast | Type cast (C++ only) (seeconst_cast) | ||
dynamic_cast | Type cast (C++ only) (seedynamic cast) | ||
reinterpret_cast | Type cast (C++ only) (seereinterpret_cast) | ||
static_cast | Type cast (C++ only) (seestatic_cast) | ||
| 3 | ++ | Prefix increment | Right-to-left |
-- | Prefix decrement | ||
+ | Unary plus | ||
- | Unary minus | ||
! | Logical NOT | ||
~ | Bitwise NOT (ones' complement) | ||
(type) | Type cast | ||
* | Indirection (dereference) | ||
& | Address-of | ||
sizeof | Sizeof | ||
_Alignof | Alignment requirement (since C11) | ||
new,new[] | Dynamic memory allocation (C++ only) | ||
delete,delete[] | Dynamic memory deallocation (C++ only) | ||
| 4 | .* | Pointer to member (C++ only) | Left-to-right |
->* | Pointer to member (C++ only) | ||
| 5 | * | Multiplication | Left-to-right |
/ | Division | ||
% | Modulo (remainder) | ||
| 6 | + | Addition | Left-to-right |
- | Subtraction | ||
| 7 | << | Bitwise left shift | Left-to-right |
>> | Bitwise right shift | ||
| 8 | <=> | Three-way comparison (Introduced inC++20 - C++ only) | Left-to-right |
| 9 | < | Less than | Left-to-right |
<= | Less than or equal to | ||
> | Greater than | ||
>= | Greater than or equal to | ||
| 10 | == | Equal to | Left-to-right |
!= | Not equal to | ||
| 11 | & | Bitwise AND | Left-to-right |
| 12 | ^ | Bitwise XOR (exclusive or) | Left-to-right |
| 13 | | | Bitwise OR (inclusive or) | Left-to-right |
| 14 | && | Logical AND | Left-to-right |
| 15 | || | Logical OR | Left-to-right |
| 16 | co_await | Coroutine processing (C++ only) | Right-to-left |
co_yield | |||
| 17 | ?: | Ternary conditional operator | Right-to-left |
= | Direct assignment | ||
+= | Assignment by sum | ||
-= | Assignment by difference | ||
*= | Assignment by product | ||
/= | Assignment by quotient | ||
%= | Assignment by remainder | ||
<<= | Assignment by bitwise left shift | ||
>>= | Assignment by bitwise right shift | ||
&= | Assignment by bitwise AND | ||
^= | Assignment by bitwise XOR | ||
|= | Assignment by bitwise OR | ||
throw | Throw operator (exceptions throwing, C++ only) | ||
| 18 lowest | , | Comma | Left-to-right |
Although this table is adequate for describing most evaluation order, it does not describe a few details. Theternary operator allows any arbitrary expression as its middle operand, despite being listed as having higher precedence than the assignment and comma operators. Thusa ? b, c : d is interpreted asa ? (b, c) : d, and not as the meaningless(a ? b), (c : d). So, the expression in the middle of the conditional operator (between? and:) is parsed as if parenthesized. Also, the immediate, un-parenthesized result of a C cast expression cannot be the operand ofsizeof. Therefore,sizeof (int) * x is interpreted as(sizeof(int)) * x and notsizeof ((int) * x).
The precedence table determines the order of binding in chained expressions, when it is not expressly specified by parentheses.
++x*3 is ambiguous without some precedence rule(s). The precedence table tells us that:x is 'bound' more tightly to++ than to*, so that whatever++ does (now or later—see below), it does it ONLY tox (and not tox*3); it is equivalent to (++x,x*3).3*x++, where though the post-fix++ is designed to act AFTER the entire expression is evaluated, the precedence table makes it clear that ONLYx gets incremented (and NOT3*x). In fact, the expression (tmp=x++,3*tmp) is evaluated withtmp being a temporary value. It is functionally equivalent to something like (tmp=3*x,++x,tmp).
The binding of operators in C and C++ is specified by a factored language grammar, rather than a precedence table. This creates some subtle conflicts. For example, in C, the syntax for a conditional expression is:
logical-OR-expression?expression:conditional-expression
while in C++ it is:
logical-OR-expression?expression:assignment-expression
Hence, the expression:
e = a < d ? a++ : a = d
is parsed differently in the two languages. In C, this expression is a syntax error, because the syntax for an assignment expression in C is:
unary-expression'='assignment-expression
In C++, it is parsed as:
e=(a<d?a++:(a=d))
which is a valid expression.[11][12]
To use the comma operator in a function call argument expression, variable assignment, or a comma-separated list, use of parentheses is required.[13][14] For example,
inta=1,b=2,weirdVariable=(++a,b),d=4;
The precedence of the bitwise logical operators has been criticized.[15] Conceptually, & and | are arithmetic operators like * and +.
The expressiona&b==7 is syntactically parsed asa&(b==7) whereas the expressiona+b==7 is parsed as(a+b)==7. This requires parentheses to be used more often than they otherwise would.
Historically, there was no syntactic distinction between the bitwise and logical operators. InBCPL,B and early C, the operators&&|| didn't exist. Instead&| had different meaning depending on whether they are used in a 'truth-value context' (i.e. when a Boolean value was expected, for example inif(a==b&c){...} it behaved as a logical operator, but inc=a&b it behaved as a bitwise one). It was retained so as to keepbackward compatibility with existing installations.[16]
Moreover, in C++ (and later versions of C) equality operations, with the exception of the three-way comparison operator, yieldbool type values which are conceptually a single bit (1 or 0) and as such do not properly belong in "bitwise" operations.
fmod can be used.int is a dummy parameter to differentiate between prefix and postfix.std::weak_ordering,std::strong_ordering andstd::partial_ordering to which they all are convertible to.<< and>> as the "put-to" or "stream insertion" and "get-from" or "stream extraction" operators, respectively.operator & can be obtained withstd::addressofoperator->() must be a type for which the-> operation can be applied, such as a pointer type. Ifx is of typeC whereC overloadsoperator->(),x->y gets expanded tox.operator->()->y.:: punctuator exists in C as of C23, it is not used as a scope resolution operator.alignof operator, whereas C defines_Alignof (C23 defines both). Both operators have the same semantics.auto specifier is replaced with the type of the invented variable x declared withauto x(a); (which is never interpreted as a function declaration) orauto x{a};, respectively.operatorauto(),operatordecltype(auto)() etc.).new auto) if an initializer is provided.