{"id":810,"date":"2006-10-30T17:30:23","date_gmt":"2006-10-30T09:30:23","guid":{"rendered":"https:\/\/www.ecjtu.com\/keith\/archives\/810"},"modified":"2006-10-31T10:02:33","modified_gmt":"2006-10-31T02:02:33","slug":"c-%e8%bf%90%e7%ae%97%e7%ac%a6%e4%bc%98%e5%85%88%e7%ba%a7%e5%88%97%e8%a1%a8","status":"publish","type":"post","link":"https:\/\/www.ecjtu.com\/keith\/archives\/810","title":{"rendered":"C++ \u8fd0\u7b97\u7b26\u4f18\u5148\u7ea7\u5217\u8868"},"content":{"rendered":"

http:\/\/www.cppreference.com\/operator_precedence.html<\/a><\/p>\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
Precedence<\/th>\nOperator<\/th>\nDescription<\/th>\nExample<\/th>\nAssociativity<\/th>\n<\/tr>\n
1<\/td>\n()
\n[]
\n->
\n.
\n::
\n++
\n—<\/td>\n		Grouping operator
\nArray access
\nMember access from a pointer
\nMember access from an object
\nScoping operator
\nPost-increment
\nPost-decrement<\/td>\n		(a + b) \/ 4;
\narray[4] = 2;
\nptr->age = 34;
\nobj.age = 34;
\nClass::age = 2;
\nfor( i = 0; i < 10; i++ ) …
\nfor( i = 10; i > 0; i– ) …<\/td>\n		left to right<\/td>\n<\/tr>\n
2<\/td>\n!
\n~
\n++
\n—
\n–
\n+
\n*
\n&
\n(type)
\nsizeof<\/a><\/td>\n		Logical negation
\nBitwise complement
\nPre-increment
\nPre-decrement
\nUnary minus
\nUnary plus
\nDereference
\nAddress of
\nCast to a given type
\nReturn size in bytes<\/td>\n		if( !done ) …
\nflags = ~flags;
\nfor( i = 0; i < 10; ++i ) …
\nfor( i = 10; i > 0; –i ) …
\nint i = -1;
\nint i = +1;
\ndata = *ptr;
\naddress = &obj;
\nint i = (int) floatNum;
\nint size = sizeof(floatNum);<\/td>\n		right to left<\/td>\n<\/tr>\n
3<\/td>\n->*
\n.*<\/td>\n		Member pointer selector
\nMember pointer selector<\/td>\n		ptr->*var = 24;
\nobj.*var = 24;<\/td>\n		left to right<\/td>\n<\/tr>\n
4<\/td>\n*
\n\/
\n%<\/td>\n		Multiplication
\nDivision
\nModulus<\/td>\n		int i = 2 * 4;
\nfloat f = 10 \/ 3;
\nint rem = 4 % 3;<\/td>\n		left to right<\/td>\n<\/tr>\n
5<\/td>\n+
\n–<\/td>\n		Addition
\nSubtraction<\/td>\n		int i = 2 + 3;
\nint i = 5 – 1;<\/td>\n		left to right<\/td>\n<\/tr>\n
6<\/td>\n<<
\n>><\/td>\n		Bitwise shift left
\nBitwise shift right<\/td>\n		int flags = 33 << 1;
\nint flags = 33 >> 1;<\/td>\n		left to right<\/td>\n<\/tr>\n
7<\/td>\n<
\n<=
\n>
\n>=<\/td>\n		Comparison less-than
\nComparison less-than-or-equal-to
\nComparison greater-than
\nComparison geater-than-or-equal-to<\/td>\n		if( i < 42 ) …
\nif( i <= 42 ) …
\nif( i > 42 ) …
\nif( i >= 42 ) …<\/td>\n		left to right<\/td>\n<\/tr>\n
8<\/td>\n==
\n!=<\/td>\n		Comparison equal-to
\nComparison not-equal-to<\/td>\n		if( i == 42 ) …
\nif( i != 42 ) …<\/td>\n		left to right<\/td>\n<\/tr>\n
9<\/td>\n&<\/td>\nBitwise AND<\/td>\nflags = flags & 42;<\/td>\nleft to right<\/td>\n<\/tr>\n
10<\/td>\n^<\/td>\nBitwise exclusive OR<\/td>\nflags = flags ^ 42;<\/td>\nleft to right<\/td>\n<\/tr>\n
11<\/td>\n|<\/td>\nBitwise inclusive (normal) OR<\/td>\nflags = flags | 42;<\/td>\nleft to right<\/td>\n<\/tr>\n
12<\/td>\n&&<\/td>\nLogical AND<\/td>\nif( conditionA && conditionB ) …<\/td>\nleft to right<\/td>\n<\/tr>\n
13<\/td>\n||<\/td>\nLogical OR<\/td>\nif( conditionA || conditionB ) …<\/td>\nleft to right<\/td>\n<\/tr>\n
14<\/td>\n? :<\/td>\nTernary conditional (if-then-else)<\/td>\nint i = (a > b) ? a : b;<\/td>\nright to left<\/td>\n<\/tr>\n
15<\/td>\n=
\n+=
\n-=
\n*=
\n\/=
\n%=
\n&=
\n^=
\n|=
\n<<=
\n>>=<\/td>\n		Assignment operator
\nIncrement and assign
\nDecrement and assign
\nMultiply and assign
\nDivide and assign
\nModulo and assign
\nBitwise AND and assign
\nBitwise exclusive OR and assign
\nBitwise inclusive (normal) OR and assign
\nBitwise shift left and assign
\nBitwise shift right and assign<\/td>\n		int a = b;
\na += 3;
\nb -= 4;
\na *= 5;
\na \/= 2;
\na %= 3;
\nflags &= new_flags;
\nflags ^= new_flags;
\nflags |= new_flags;
\nflags <<= 2;
\nflags >>= 2;<\/td>\n		right to left<\/td>\n<\/tr>\n
16<\/td>\n,<\/td>\nSequential evaluation operator<\/td>\nfor( i = 0, j = 0; i < 10; i++, j++ ) …<\/td>\nleft to right<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n","protected":false},"excerpt":{"rendered":"

http:\/\/www.cppreference.com\/operator_precedence.html Pr […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[168],"tags":[267],"_links":{"self":[{"href":"https:\/\/www.ecjtu.com\/keith\/wp-json\/wp\/v2\/posts\/810"}],"collection":[{"href":"https:\/\/www.ecjtu.com\/keith\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.ecjtu.com\/keith\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.ecjtu.com\/keith\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.ecjtu.com\/keith\/wp-json\/wp\/v2\/comments?post=810"}],"version-history":[{"count":1,"href":"https:\/\/www.ecjtu.com\/keith\/wp-json\/wp\/v2\/posts\/810\/revisions"}],"predecessor-version":[{"id":811,"href":"https:\/\/www.ecjtu.com\/keith\/wp-json\/wp\/v2\/posts\/810\/revisions\/811"}],"wp:attachment":[{"href":"https:\/\/www.ecjtu.com\/keith\/wp-json\/wp\/v2\/media?parent=810"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.ecjtu.com\/keith\/wp-json\/wp\/v2\/categories?post=810"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.ecjtu.com\/keith\/wp-json\/wp\/v2\/tags?post=810"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}