EDIT: I misunderstood how it works, read the reply to see why I was in the wrong. I haven't read it all (and probably won't, these kinds of works are not my fo

EDIT: I misunderstood how it works, read the reply to see why I was in the wrong. I haven't read it all (and probably won't, these kinds of works are not my forte), but there's something that doesn't look that nice. The swapped function seems strange, mostly because you treat 1 as a special case which reverses the content. I would either have a reverse function or use negative numbers to reverse those chunks, like this: uint(16,0xc01f) matches big endian 0xc01f (bit sequence 1,1,0,0,0,0,0,0,0,0,0,1,1,1,1,1). swapped(8, uint(16,0xc01f)) (bit sequence 0,0,0,1,1,1,1,1,1,1,0,0,0,0,0,0). swapped(-16, uint(16,0xc01f)) (bit sequence 1,1,1,1,1,0,0,0,0,0,0,0,0,0,1,1). swapped(-8, uint(16,0xc01f)) (bit sequence 1,1,1,1,1,0,0,0, 0,0,0,0,0,0,1,1). swapped(-4, uint(16,0xc01f)) (bit sequence 0,0,0,0, 1,1,0,0, 1,1,1,1, 1,0,0,0). There might be better solutions, I just dislike exceptions in rules, if it can be helped.