查询词典 unsigned

Right shifting an unsigned quantity always fits the vacated bits with zero. Right shifting a signed quantity will fill with bit signs ("arithmetic shift") on some machines and with 0-bits ("logical shift") on others.

在对unsigned类型的无符号值进行右移位时，左边空出的部分将用0填补；当对signed类型的带符号值进行右移时，某些机器将对左边空出的部分用符号位填补，而另一些机器则对左边空出的部分用0填补。

So you can simply pluck those 4 bytes and cast them to an unsigned long, presuming of course you are coding on a little endian processor.

所以你可以简单地采摘的4个字节，投下他们为unsigned long，当然你是一个小端处理器的编码假设。

We can obtain an unsigned long literal constant by following the value by both L and U.

同时加 L 和 U 就能够得到 unsigned long 类型的字面值常量。

By adding a suffix, we can force the type of a literal integer constant to be type long or unsigned or unsigned long.

通过增加后缀，能够强制将字面值整数常量转换为 long、 unsigned 或 unsigned long 类型。

Traditionally, Forth has been implemented on two's-complement machines where there is a one-to-one mapping of signed numbers to unsigned numbers - any single cell item can be viewed either as a signed or unsigned number.

传统地， Forth 已经被实作在二补数的机器上，它有一个有号数对於无号数的一对一对应-任何的单一单元元素可以看做是有号或无号数。

Note that unsigned numbers on a signed magnitude machine are equivalent to signed non-negative numbers as a consequence of the forced correspondence between addresses and unsigned numbers and of the required behavior of + and -.

注意在一个有号量机器上，无号数是相等於有号的非负数，作为一个强迫对应於位址和无号数而且需要+和-行为的影响。

In practice, many compilers treat signed types similarly to how they are required to treat unsigned types.

在实际操作中，很多的编译器处理 signed 类型的方式和 unsigned 类型类似。

For example, on a machine in which chars are implemented as unsigned chars, this loop will run forever

例如，在将 char 实现为 unsigned char 的机器上，这是一个死循环

Struct audit_buffer *audit_log_startstruct audit_context *ctx, gfp_t gfp_mask,{ struct audit_buffer *ab = NULL;struct timespec t;unsigned int serial;int reserve;unsigned long timeout_start = jiffies;if (!audit_initializedreturn NULL

函数audit_filter_type将审计事件值与规则域的值比较，返回逻辑比较结果，即审计事件值符合规则域的定义，则表示不需要查看这个审计事件，返回值为1，否则为0。

It"s revealed that the consistency probability of unsigned ones complement addition with bit-wise exclusive-OR is very greater than the ideal value 2~", though it is very small, and the consistency probability of unsigned ones complement addition with addition modulo 2 is 2/3 approximately, hence it is very large.

结论表明，进位返加运算与逐位模2加运算的相容概率尽管很小，但远大于理想值2~；进位返加运算与模2~n加运算的相容概率很大，近似为2／3。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。