bit-manipulation

bit-manipulation

Why is "i & (i ^ (i - 1))" equivalent to "i & (-i)"

Mul255 - what is it?

Finding the dominating bit

Flipping bits in an integer without bitwise operations

2s Complement of a negative zero

Assistance needed with parsing a 32-bit flag

A sequence of bitwise of operation on bits grouped two by two

What's the insight behind A XOR B in bitwise operation?

not sure about my bitmask logic

Alt answer to classic bitwise 2^n test: valid?

Why does "number & (~(1 << 3))" not work for 0's?

Figure out whether a number is all 1's or all 0's

What is the best practice way to create a bitmask for a range of bits?

bit parity code needs explanation as to how it works?

Is it possible to write a function adding two integers without control flow and strictly bitwise operations?

efficient way to split ONE bitstream according to many masks?

Padded bit representation in Java

Bit manipulation - replace a "block"

General method for constructing bitwise expressions satisfying constraints/with certain values?

Bitwise Operations in Ada

Please explain in detail the logic behind the output of x &(~0 << n)

Bitstream lexer generator

saving specific bits from a 64-bit long number

Is there an efficient way to construct b10101010101010101010101010101010? [closed]

Mask and aggregate bits

Verilog access specific bits

Inferring simplest method to convert bit array 1 to bit array 2

Manipulating Bit-wise Operations

Why does a right shift on a signed integer causes an overflow?

Bit functions in Think Pascal

Matching bits algorithm

Convert signed 13-bit value to signed 16-bit

Error codes OR'd together

Division by Multiplication and Shifiting

bitwise checking if a number is -1 or not

Bitwise operations based on two numbers

Check if a bit is set only once in a series of bitsets

Bit checking in two's complement implemented only with subtraction and branch if less than zero

counting the number of bit required to represent an integer in 2's complement

(Bitwise Logic) What does AND'ing something with 0x7F accomplish?

branchless bitwise operation

What does the statement (1<<y) mean in bitwise operations

PIC Bit Masking and Shifting for 4 Bit LCD Control

Bitwise operations on a short

Does Teradata 14 support bitwise?

Pythonesque bit-slicing in Verilog?

How to get the most significant non-zero byte in a 32 bit integer without a while loop?

challenging bit manipulation procedure

Detecting two numbers with same/matching bit pattern in their lower order bits

Reading a file bit by bit to form a Huffman Coding Tree

Assigning values in VHDL

Is there a popular name for this bit-related expression?

Always confused between << and >>

Practical Application of Bitwise Operators [duplicate]

Probability of a bit changing from 0 to 1 [closed]

Implementing logical shifts

2's(N) = 1's(N-1) [closed]

How to do bitwise unsigned (zero-fill) right shift in Dart?

Strange bitwise XOR behavior

How to mask ints using bitwise operators

page:5 of 6 prev page next page main page

Categories

remote-debugging

console-application

css-transitions

fluent-plugin-splunk-hec

google-cloud-ml

foxglove-studio

docusignconnect

materialized-views

share-open-graph

autodesk-data-management

visual-studio-app-cent...

java.util.concurrent

iccube-reporting

java.util.logging

custom-activity

document-database

switchpreference

asp.net-mvc-ajax

zend-framework-modules

flowlayoutpanel

materialized-path-pattern

Resources