Left moves to the right-CodePudding

Bosses to explain a ruled the red line on these is what meaning, or article links, thank you

CodePudding user response:

Is a shift
3<1 said three binary moving to the left one (the sign bit part with high low fill 0), three binary is 0011, the left one into 0110, decimal is 6, so the left one is equivalent to take 2
3> One said three binary to the right one (the sign bit high positive fill 0, negative 1, low abandon), three binary is 0011, left one into 0001, decimal is 1, so moves to the right one is divided by 2

CodePudding user response:

1 & lt; Equivalent to 2 N

CodePudding user response:

Upstairs and you can understand it, miss zhao positive solutions & lt; <> Is under a binary bit of move to the left to the right position, commonly used in such as checking whether a data bit 3 to 1

If (0 x1 & lt; <3 & amp; X) xx} {

CodePudding user response:

Was a [s | 1 & lt; & lt; (que) [1]] is what meaning, is this the add a shift to the left front & amp; s

CodePudding user response:

reference 1st floor qybao response:

is a shift
3<1 said three binary moving to the left one (the sign bit part with high low fill 0), three binary is 0011, the left one into 0110, decimal is 6, so the left one is equivalent to take 2
3> One said three binary to the right one (the sign bit high positive fill 0, negative 1, low abandon), three binary is 0011, left one into 0001, decimal is 1, so moves to the right one is divided by 2

Is the above & amp; S is what meaning, and that [s | 1 & lt; & lt; (que [1])] how do you understand

CodePudding user response:

The following operation is based on the binary
& Is (a) and operation 1 & amp; 1=1, 1 & amp; 0=0, 0 & amp; 1=0, 0 & amp; 0=0
| | is (a) or operation 1 1=1, 1, 0 | | 0=1 1=1, 0 | 0=0
These are the basic knowledge of entry-level, suggest the LZ to find the first entry-level materials good again

CodePudding user response:

refer to 6th floor qybao response:

the following operation is based on the binary
& Is (a) and operation 1 & amp; 1=1, 1 & amp; 0=0, 0 & amp; 1=0, 0 & amp; 0=0
| | is (a) or operation 1 1=1, 1, 0 | | 0=1 1=1, 0 | 0=0
These are the basic knowledge of entry-level, suggest the LZ to find the first entry-level materials good again

are you say all remembered, foundation is not solid a little embarrassed

CodePudding user response:

The host system, please review them:

//c + + Operators 
//Operators specify an evaluation to be performed on one of the following: 
//One operand (unary operator) 
//Two operands (binary operator) 
//Three operands (ternary operator) 
//The C + + language includes all C operators and adds several new operators. 
//Table 1.1 lists the operators available in Microsoft c + +. 
//Operators follow a strict precedence which defines the evaluation order of 
//expressions containing these operators. The operators associate with either the 
//expression on their left or the expression on their right. This is called 
//"associativity." Operators in the same group have equal precedence and are 
//evaluated left to right in an expression unless explicitly forced by a pair of 
//parentheses, (). 
//Table 1.1 shows the precedence and associativity of c + + operators 
//(from highest to lowest precedence). 
//
//Table 1.1 c + + Operator Precedence and Associativity 
//The highest precedence level is at The top of The table. 
//+ -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- - + -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- - + -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- + 
//| Operator | Name or a fancy | Associativity | 
//+ -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- - + -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- - + -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- + 
//| : : | Scope resolution | None | 
//| : : | Global | None | 
//| | [] Array subscript | Left to right | 
//| | () Function call | Left to right | 
//| | () Conversion | None | 
//| | Member selection (object) | Left to right | 
//| - & gt; | | Member selection (pointer) Left to right | 
//| + + | Postfix increment | None | 
//| -- - | Postfix decrement | None | 
//| new | the Allocate object | None | 
//| delete | Deallocate object | None | 
//| delete [] | Deallocate object | None | 
//| + + | Prefix increment | None | 
//| -- - | the Prefix decrement | None | 
//| | * Dereference | None | 
//| & amp; | Address - | None | 
//| | + Unary plus | None | 
//| - | Arithmetic negation (unary) | None | 
//|! | Logical NOT | None | 
//| - | Bitwise complement | None | 
//| sizeof | the Size of the object | None | 
nullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnull