python - Bitwise operation and usage -


consider code:

x = 1        # 0001 x << 2       # shift left 2 bits: 0100 # result: 4  x | 2        # bitwise or: 0011 # result: 3  x & 1        # bitwise and: 0001 # result: 1

i can understand arithmetic operators in python (and other languages), never understood 'bitwise' operators quite well. in above example (from python book), understand left-shift not other two.

also, bitwise operators used for? i'd appreciate examples.

bitwise operators operators work on multi-bit values, conceptually 1 bit @ time.

  • and 1 if both of inputs 1, otherwise it's 0.
  • or 1 if one or both of inputs 1, otherwise it's 0.
  • xor 1 if exactly one of inputs 1, otherwise it's 0.
  • not 1 if input 0, otherwise it's 0.

these can best shown truth tables. input possibilities on top , left, resultant bit 1 of 4 (two in case of not since has 1 input) values shown @ intersection of inputs.

and | 0 1     or | 0 1     xor | 0 1    not | 0 1 ----+-----    ---+----     ----+----    ----+----  0  | 0 0      0 | 0 1       0 | 0 1        | 1 0  1  | 0 1      1 | 1 1       1 | 1 0

one example if want lower 4 bits of integer, , 15 (binary 1111) so:

    201: 1100 1001 ,  15: 0000 1111 ------------------    9  0000 1001

the 0 bits in 15 in case act filter, forcing bits in result 0 well.

in addition, >> , << included bitwise operators, , "shift" value respectively right , left number of bits, throwing away bits roll of end you're shifting towards, , feeding in 0 bits @ other end.

so, example:

1001 0101 >> 2 gives 0010 0101 1111 1111 << 4 gives 1111 0000

note left shift in python unusual in it's not using fixed width bits discarded - while many languages use fixed width based on data type, python expands width cater bits. in order discarding behaviour in python, can follow left shift bitwise and such in 8-bit value shifting left 4 bits:

bits8 = (bits8 << 4) & 255

with in mind, example of bitwise operators if have 2 4-bit values want pack 8-bit one, can use 3 of operators (left-shift, and , or):

packed_val = ((val1 & 15) << 4) | (val2 & 15)
  • the & 15 operation make sure both values have lower 4 bits.
  • the << 4 4-bit shift left move val1 top 4 bits of 8-bit value.
  • the | combines these 2 together.

if val1 7 , val2 4:

                val1            val2                 ====            ====  & 15 (and)   xxxx-0111       xxxx-0100  & 15  << 4 (left)  0111-0000           |                   |               |                   +-------+-------+                           | | (or)                0111-0100

Comments

Post a Comment

Popular posts from this blog

Is there a better way to structure post methods in Class Based Views -

i'm using class based views in django , never specify url in ajax calls , omit action parameter in form because know these requests go through post method of class based view. notice view - profile page make many requests depending on user updating on page - post method become convoluted , if/else mess example: def post(self, request, *args, **kwargs): # handle user changing available date if request.post.get('availabledate') != none: self.updateavailabledate(request) return jsonresponse({'result':'success'}) if request.post.get('newprojectname') != none: creative_user = creativeuserprofile.objects.get(id = request.user.id) project = project.create_project(creative_user, request.post['newprojectname']) project.save() return jsonresponse({'projectid': project.id }) if request.post.get('projectimage') != none , request.files['file']: proj
Read more

performance - Why is XCHG reg, reg a 3 micro-op instruction on modern Intel architectures? -

i'm doing micro-optimization on performance critical part of code , came across sequence of instructions (in at&t syntax): add %rax, %rbx mov %rdx, %rax mov %rbx, %rdx i thought had use case xchg allow me shave instruction , write: add %rbx, %rax xchg %rax, %rdx however, dimay found agner fog's instruction tables , xchg 3 micro-op instruction 2 cycle latency on sandy bridge, ivy bridge, broadwell, haswell , skylake. 3 whole micro-ops , 2 cycles of latency! 3 micro-ops throws off 4-1-1-1 cadence , 2 cycle latency makes worse original in best case since last 2 instructions in original might execute in parallel. now... cpu might breaking instruction micro-ops equivalent to: mov %rax, %tmp mov %rdx, %rax mov %tmp, %rdx where tmp anonymous internal register , suppose last 2 micro-ops run in parallel latency 2 cycles. given register renaming occurs on these micro-architectures, though, doesn't make sense me done way. why wouldn't register renamer
Read more

jquery - Responsive Navbar with Sub Navbar -

good day, forgive me nav vocabulary not best. if question confusing apologize. i'm working on navigation bar needs centered on page @ 768px , above. items in nav open (or perhaps toggle) subnav lives directly below. these nav should appear centered on page. i have been able work through responsive portion of nav bar, having main items align vertically , sub nav menu of each item roll out below, , gave them indent separation. working well. however, issue not responsive side, behavior @ width greater 768px. happens toggling menu's sub navigation pushes other main items down page below sub nav. here's code: $(document).ready(function () { //stick in fixed 100% height behind navbar don't wrap $('#slide-nav.navbar-inverse').after($('<div class="inverse" id="navbar-height-col"></div>')); $('#slide-nav.navbar-default').after($('<div id="navbar-height-col"></d
Read more