Question

我需要一项职能,即把最后的Nbits推到一种愤怒中(N <32,因此结果始终是积极的)。我看不出自己。

我的第一项做法是左轮(32-n)比照,然后转移右边(32-n)比,但衣着将第一个结果转换到大英特,因此Im无法从头32吨轨道上清除。

谁能帮助? 感谢!

Answer 1

我认为,你想要的是两点,例如:

(defn low-bits [x n]
    "Get the lowest n bits of x"
    (bit-and x (unchecked-dec (bit-shift-left 1 n))))

Taking n 8, (bit-shift-left 1 8) gives us 256, then (dec 256) gives us 255, a number which has the lowest 8 bits set and the higher bits 0. Then the bitwise and will give us a number where the lowest 8 bits are whatever they were in x, and the higher bits are all 0 (which is what you want I think?).

申斥: 这是第4条“衣着功能一”书写的,因此,我只读了......。

友情链接