Bitwise refers to a bitwise operation which operates on one or more bit patterns or binary numerals at the level of their individual bits.

learn more… | top users | synonyms

0
votes
0answers
14 views

Could this ROM reader be faster and/or smaller?

I've been practicing arduino programming for a few weeks now having become confident in reading and writing to pins so I decided to take it a step further and do a serious project that does both, so ...
2
votes
2answers
66 views

Copy and bit-invert ints in an std::vector

I want a second copy of an std::vector in which all elements are inverted, e.g. 0x01 in the first vector should be 0xFE in the second. Is this a good solution? std::vector<uint8_t> first_list ...
2
votes
1answer
119 views

Take all the bits in a number and shift them to the left end

I wrote this program which takes all the bits in a number and shifts them to the left end (for example: 01010110 --> 11110000). It's and exercise from a book. It works, but it seems to be very ...
3
votes
3answers
226 views

Split a long integer into eight 4-bit values

It's an exercise from a book. There is a given long integer that I should convert into 8 4-bit values. The exercise is not very clear for me, but I think I understood the task correctly. I googled ...
1
vote
0answers
45 views

10x10 bitmapped square with bits

This program prints out a 10x10 square and uses only bit operations. It works well, but I don't like that global array. Can you tell me if the code is proper or not? #include <iostream> ...
0
votes
0answers
80 views

Playing with bits using Java

How can I optimize the following class? prepareSharing packs bits on left and prepareMask counts the required bits for encoding integers between zero and max. public class KeyFactory { ...
1
vote
1answer
70 views

Missing element from array (D&C) - code design/aesthetic improvement

I am trying to implement in C/C++ a 'classical' Divide and Conquer algorithm which solves the following problem "Given an array of n-1 numbers (int) from 0 to n, find the missing number". I am using ...
0
votes
1answer
80 views

Bitwise Logic optimization

I should be able to figure this out on my own, but I can't seem to wrap my head around how to optimize this set of logic for interpreting the existence of URL parameters. Below is my code: <cfif ...
2
votes
1answer
79 views

Color fading function

I found this old color fading function in my snippets folder and would like to implement it to one of my projects. It can be used to fade one color to another. It's a very long one-liner: D3DCOLOR ...
3
votes
2answers
418 views

Speed up a program to find the minimum Hamming distance

I have a solution to the puzzle at https://kattis.csc.kth.se/problem?id=codes. What can I do to make my algorithm much much faster? What the algorithm does is take an N×K matrix and search for the ...
2
votes
5answers
457 views

Performance: Divide group of numbers into two groups of which the sums are equal

I have a piece of code that divides a group of numbers into two groups of numbers of which the sums are equal. I created this because of a StackOverflow question: ...
1
vote
0answers
166 views

JavaScript xor function

I made simple JavaScript xor function. It accepts string, numeric array and mixed array (char, string, num) as params. It returns string or an array. Returning an array is a must!. All numbers are ...
2
votes
1answer
91 views

Simplify bit flags checking code

Please help make this code more cleaner. It's a part of window procedure that notifies my renderer before client area of window resized. I need to check two combinations of bit blags: some of them ...
3
votes
0answers
73 views

Fast popcount on Intel Xeon Phi

I'm implementing an ultra fast popcount on Intel Xeon® Phi®, as it's a performance hotspot of various bioinformatics software. I've implemented five pieces of codes, #if defined(__MIC__) #include ...
4
votes
1answer
227 views

Bitwise Flag code for Python

I am looking for feedback on this compact Python API for defining bitwise flags and setting/manipulating them. Under the hood, FlagType extends int and all operations are true bitwise, so there is ...
-1
votes
1answer
43 views

What are these bitwise operations doing? [closed]

I found a snippet of code on the PHP manual which packs 64 bit integers. APparently this is necessary because pack() always treats numbers as 32 bit integers even on 64 bit architectures. I don't ...
1
vote
2answers
561 views

Spotify's “Reversed Binary Numbers” Problem

I wrote some Java code for Spotify's Reversed Binary Numbers puzzle and I tested it on my machine and I am almost positive that it behaves as expected. However, when I send it to puzzle AT spotify.com ...
2
votes
3answers
1k views

Base-36 encoding of a byte array

After posting a question about Alphanumeric Hash generation on StackOverflow, the most helpful answer was to change the conversion method from pulling 5-bit chunks of a binary hash value, to instead ...
1
vote
1answer
116 views

What specific optimizations can be made to this BitArray class, and how can they be implemented?

Here is the current code for the BitArray class needing optimization (implemented on big integers): import itertools ################################################################################ ...
3
votes
1answer
443 views

speeding up an algorithm that find patterns in a growing collection

I want to find a way to speed up this code. if you look at the condition of If calculated Then in the code below, this is what slowing down the code. While the code provided seem fast with Const ...
4
votes
3answers
397 views

How to manage a bit array with C programming langage?

I'm training a bit with C, and I'm trying to build a bit array. I would like to have some comments about my code, because I'm not sure that it's the best way to do it. // BAL.c #include ...
3
votes
4answers
380 views

Counting the number of bits of a positive integer

How can I improve this code for counting the number of bits of a positive integer n in Python? def bitcount(n): a = 1 while 1<<a <= n: a <<= 1 s = 0 while ...
3
votes
2answers
418 views

bit rotation code review

I'm studing C on K&R and I solved exercise 2.08 ("Write a function rightrot(x,n) that returns the value of the integer x rotated to the right by n positions") with the code below. I've tested my ...
3
votes
1answer
213 views

Print Bits Part II|: Coding Feedback Wanted

The last question I have been playing around with is a right rotate. I think it is also called a barrel roll. Anyways if you have a better solution please post. I am still learning the art of bit ...
7
votes
3answers
96 views

Print Bits Part II: Coding Feedback Wanted

Does anyone have a shorter more simple way of doing this? /* * Next write a function invert(x,p,n) that returns x with the n bits * that begin at position p inverted, leaving the others unchange ...