Java中的函数getLeastSignificantBits（）＆getMostSignificantBits在Python中？

Question

有人可以帮助我形成一个简单的函数，以提取Python中最不显着的位数&？

防爆代码Java中：

UUID u = UUID.fromString('a316b044-0157-1000-efe6-40fc5d2f0036'); 
long leastSignificantBits = u.getLeastSignificantBits(); 

private UUID(byte[] data) { 
    long msb = 0; 
    long lsb = 0; 
    assert data.length == 16 : "data must be 16 bytes in length"; 
    for (int i=0; i<8; i++) 
     msb = (msb << 8) | (data[i] & 0xff); 
    for (int i=8; i<16; i++) 
     lsb = (lsb << 8) | (data[i] & 0xff); 
    this.mostSigBits = msb; 
    this.leastSigBits = lsb; 
} 

- >输出值：-1160168401362026442

Answer 1

efe640fc5d2f0036十进制是17286575672347525174.。减去0x10000000000000000从中&否定：你拿到-1160168401362026442

int("efe640fc5d2f0036",16)-0x10000000000000000 -> -1160168401362026442 

请注意，这只是猜测，但似乎与您提供的唯一测试用例一起工作（f幸运的是它是负面的）。称之为逆向工程。

取2个最后的十六进制值（破折号分隔）并加入它们。我想，存储装置，当第一个数字是上述7就变成负的，所以具有较高的2-功率否定它，如果是这种情况：

def getLeastSignificantBits(s): 
    hv = "".join(s.split("-")[-2:]) 
    v = int(hv,16) 
    if int(hv[0],16)>7: 
     # negative 
     v = v-0x10000000000000000 
    return v 

print(getLeastSignificantBits('a316b044-0157-1000-efe6-40fc5d2f0036')) 

结果：

-1160168401362026442 

编辑：提供一种方法这需要整个字符串，并返回LSB & MSB夫妇

def getLeastMostSignificantBits(s): 
    sp=s.split("-") 
    lsb_s = "".join(sp[-2:]) 
    lsb = int(lsb_s,16) 
    if int(lsb_s[0],16)>7: 
     # negative 
     lsb = lsb-0x10000000000000000 

    msb_s = "".join(sp[:3]) 
    msb = int(msb_s,16) 
    if int(msb_s[0],16)>7: 
     # negative 
     msb = msb-0x10000000000000000 

    return lsb,msb 

print(getLeastMostSignificantBits('a316b044-0157-1000-efe6-40fc5d2f0036')) 

结果：

(-1160168401362026442, -6694969989912915968)