Priority
来源:互联网 发布:八维网络工程学院 编辑:程序博客网 时间:2024/06/06 10:01
http://www.cppblog.com/aqazero/archive/2012/11/10/8284.html
[]
->
.
::
++
--Grouping operator
Array access
Member access from a pointer
Member access from an object
Scoping operator
Post-increment
Post-decrement(a + b) / 4;
array[4] = 2;
ptr->age = 34;
obj.age = 34;
Class::age = 2;
for( i = 0; i < 10; i++ ) ...
for( i = 10; i > 0; i-- ) ...left to right2!
~
++
--
-
+
*
&
(type)
sizeofLogical negation
Bitwise complement
Pre-increment
Pre-decrement
Unary minus
Unary plus
Dereference
Address of
Cast to a given type
Return size in bytesif( !done ) ...
flags = ~flags;
for( i = 0; i < 10; ++i ) ...
for( i = 10; i > 0; --i ) ...
int i = -1;
int i = +1;
data = *ptr;
address = &obj;
int i = (int) floatNum;
int size = sizeof(floatNum);right to left3->*
.*Member pointer selector
Member pointer selectorptr->*var = 24;
obj.*var = 24;left to right4*
/
%Multiplication
Division
Modulusint i = 2 * 4;
float f = 10 / 3;
int rem = 4 % 3;left to right5+
-Addition
Subtractionint i = 2 + 3;
int i = 5 - 1;left to right6<<
>>Bitwise shift left
Bitwise shift rightint flags = 33 << 1;
int flags = 33 >> 1;left to right7<
<=
>
>=Comparison less-than
Comparison less-than-or-equal-to
Comparison greater-than
Comparison geater-than-or-equal-toif( i < 42 ) ...
if( i <= 42 ) ...
if( i > 42 ) ...
if( i >= 42 ) ...left to right8==
!=Comparison equal-to
Comparison not-equal-toif( i == 42 ) ...
if( i != 42 ) ...left to right9&Bitwise ANDflags = flags & 42;left to right10^Bitwise exclusive ORflags = flags ^ 42;left to right11|Bitwise inclusive (normal) ORflags = flags | 42;left to right12&&Logical ANDif( conditionA && conditionB ) ...left to right13||Logical ORif( conditionA || conditionB ) ...left to right14? :Ternary conditional (if-then-else)int i = (a > b) ? a : b;right to left15=
+=
-=
*=
/=
%=
&=
^=
|=
<<=
>>=Assignment operator
Increment and assign
Decrement and assign
Multiply and assign
Divide and assign
Modulo and assign
Bitwise AND and assign
Bitwise exclusive OR and assign
Bitwise inclusive (normal) OR and assign
Bitwise shift left and assign
Bitwise shift right and assignint a = b;
a += 3;
b -= 4;
a *= 5;
a /= 2;
a %= 3;
flags &= new_flags;
flags ^= new_flags;
flags |= new_flags;
flags <<= 2;
flags >>= 2;right to left16,Sequential evaluation operatorfor( i = 0, j = 0; i < 10; i++, j++ ) ...left to right
0 0
- Priority
- priority queues
- android:priority
- priority inversion
- init_priority (priority)
- Priority Tagged
- Priority&&State
- priority queue
- Priority Queues
- XCode Hugging Priority- Compress Resistance Priority
- stl priority queue
- Command 的Priority
- CSS priority / specificity
- hard disk boot priority
- Priority Queue Version 0.1
- Priority Inversion:优先级反转
- Test Case Priority
- Linux Priority VS Nice
- 关于textView上显示placeholder
- Complex
- POJ-1297(DP + 滚动数组)
- Tachyon源码结构分析(三)
- 深入理解Java内存模型(二)——重排序
- Priority
- 大四最后一个学期去公司实习前2天的一点感悟
- 单例模式的几种写法(包含双检锁写法)
- 2、论述rfid与物联网关系。
- rpm:RPM should not be used directly install RPM packages, use Alien instead!
- 深入理解Java内存模型(三)——顺序一致性
- a+++b
- SoapUI
- java比较两个日期大小