Bitwise refers to a bitwise operation which operates on one or more bit patterns or binary numerals at the level of their individual bits.
9
votes
4answers
831 views
Return the next power of two
Given an unsigned integer \$N\$, I want to return \$P\$ with \$P\$ being a power of two such that \$P \ge N\$.
Examples:
1 -> 1
2 -> 2
3 -> 4
5 -> 8
The goal is to provide a very fast ...
0
votes
0answers
26 views
Bit twiddling utils for Int and Long classes
I added some bit twiddling utils to Int and Long classes in Scala but I have highly duplicated code. Is there a way to DRY this?
...
2
votes
2answers
180 views
Addition of two IEEE754-32bit single precision floating point numbers in C++
I made a C++ program which takes a list of triplets with S.No. from a text file, where the triplet, i.e. a,b,c correspond to a+b=c (addition done using float data type). Now I convert a and b from hex ...
4
votes
1answer
161 views
Start an EventHandler in different Thread
I just stumbeled accross some code and I would do it in a different way. Since I am quite new to programming, I just wanted to know if I understand it right.
Original Code:
...
0
votes
1answer
45 views
ANDing ints in Java [closed]
Is there any better way than doing:
if ((newState & InputState.DEFAULT) == InputState.DEFAULT)
?
My InputState.class defines static int variables to the ...
6
votes
2answers
135 views
Codility binary gap solution using regex
This is how I solved the binary gap problem:
Find longest sequence of zeros, bounded by ones, in binary representation of an integer.
However, it seems to be different from the answers out there. Is ...
4
votes
2answers
264 views
K&R 2-7 - Invert a bitfield from a number
This is my solution to the Exercise 2-7 of K&R C book. The assignment is:
Write a function invert(x,p,n) that returns x ...
7
votes
1answer
48 views
Implementing checksum add without carry in C
I need to write a function in C which performs a checksum using the rule "add without carry". As I understand it, the "add without carry" concept is equivalent to the bitxor operator and given that ...
10
votes
1answer
169 views
Bit shifting and masking
I was wondering if someone could review this simple bit of code that originally was in C++, but now converted to C# as practice in using bit-shifting and creating a sort of a quasi-array functionality....
4
votes
3answers
71 views
A simple assembly program to count the number of ones in a register
I made a simple assembly program to count the number of ones in a register. Since this is basically my first ever, I would like to hear what I can improve or if there are some major flaws in this one:
...
5
votes
2answers
123 views
Packing and unpacking bits (2)
Part 1 here.
I improved my code from my previous question (linked above).
...
6
votes
2answers
147 views
Packing and unpacking bits
Part 2 here.
I wrote this class for packing data.
Would it benefit from being named BitPacker rather than BitStream (and change write/read to pack/unpack), or it works as is?
How can I improve it? ...
1
vote
1answer
38 views
Using JavaScript-bitwise AND and -bitwise NOT for setting a number to 0
Obviously is the XOR-operator is used in low-level programming-languages used a lot for setting a value back to all bits 0.
For example:
11010 ^ 11010 => 00000
Brought my teacher to figuring a out ...
4
votes
5answers
124 views
3
votes
0answers
48 views
Bit string builder for Java
I have this Java class for building bit strings. The set of methods it provides resembles that of java.lang.StringBuilder.
See what I have:
BitStringBuilder.java:
...
4
votes
1answer
48 views
LEB128 in Haskell
I have implemented the LEB128 encoding for unsigned integers. I'm fairly new to Haskell so I have some doubt about the coding style I'm using, particularly the definition of ...
1
vote
0answers
35 views
Convert tri-gram of type wchar_t to an integer type
I am trying to convert a tri-gram containing 3 characters of type wchar_t to an integer type (an uint64_t at the present time).
...
3
votes
3answers
1k views
Calculating the 'binary gap' of a number
Inspired by this question and therefore this one I decided that clearly the best most readable way to solve this is with Regular Expressions.
A binary gap within a positive integer N is any ...
1
vote
0answers
27 views
Implement “at” lens for Data.Map
I've been working on adding an operation like Data.Lens.At.at to Data.Map. This uses an extremely fast, extremely small, and ...
1
vote
3answers
59 views
Byte array to floating point such as FPE2 in Java
Apple's System Management Controller uses FPE2 and SP78 as floating-point formats.
While writing a Java library that that interfaces with the SMC, I ported someone's C function to convert read a FPE2-...
4
votes
3answers
254 views
Finding the fastest common prefix of 2 strings in Python
I'm comparing my algorithms, slice_prefix and bit_prefix, with existing ones to find the common prefix length of 2 strings as ...
1
vote
0answers
50 views
A bitwise common prefix algorithm in Python
Is my algorithm slow because it has problems? Or, is any bitwise common prefix solution not going to give me the performance I'm looking for?
After profiling my algorithm, I found that over 60% of ...
11
votes
1answer
214 views
Console app to teach bitwise operators
I'm creating a console app that has the purpose to teach you how to use C# bitwise operators. I have several classes which contain info about the different operators and I instantiate/add them in the ...
3
votes
1answer
68 views
Parsing an IP address (Bit manipulation)
Given a string representing of an IP address, such as "127.43.23.59", return a 32 bit integer representation of this string. The 32 bit integer is separated into four bytes, where each byte is one of ...
7
votes
1answer
289 views
Calculating the results of bit operations
I have a simple program that calculates and outputs the results of all the bit operators. I'm planning to send it to my friend and to explain some stuff about them to him. Before I do that, I want to ...
2
votes
1answer
726 views
Printing longest sequence of zeroes
I am doing a coding exercise in codility and I came across this question:
A binary gap within a positive integer N is any maximal sequence of
consecutive zeros that is surrounded by ones at both ...
1
vote
2answers
79 views
Concatenate three 16-bit integers in one 64-bit integer with C++
I am looking for an elegant alternative of the following code where wordXX contains always 16 bits:
...
7
votes
2answers
66 views
Portable byte order conversion
I'm trying to improve the portability of a file format converter, specifically to POSIX platforms other than Linux. I'd appreciate a review of the following functions used for converting between ...
4
votes
0answers
49 views
Parallel popcount of packed bytes
I want to do a popcount of bytes in an array.
Not a total popcount of everything, but lots of little popcounts for every individual byte to determine the neighborhood count in GoL.
The following ...
0
votes
2answers
53 views
3
votes
3answers
95 views
Bit manipulation tool set
I made a tool set to facilitate bit manipulation as follows. Any comments are welcome, be it about the interface design, the implementation, or even the naming. Also, I want to make sure that the tool ...
4
votes
1answer
104 views
Speeding up the generation all bit strings with Hamming distance one
I'm playing around with hypercubes. For this, I need to create its edge set. Specifically, the edge set is the set of all bit strings with Hamming distance 1. An important property is that I want to ...
0
votes
1answer
143 views
Saturated signed addition
So this a exercise from the book COMPUTERS SYSTEMS A PROGRAMMERS PERSPECTIVE
I need to add two signed numbers and in case it overflows or underflows return ...
10
votes
2answers
115 views
Simulation of image transfer over noisy channel
Following this question, I've tried to rewrite some core methods to avoid using String for bit operations, and I ended up using ...
4
votes
1answer
182 views
Solution to part 1 of Day 7 Advent of Code in Scala
Does someone want to review my solution to part 1 of Day 7 Advent of Code in Scala?
The assignment is here: http://adventofcode.com/day/7
Without repeating the whole text, in short:
Given a text file ...
2
votes
0answers
147 views
FUTABA SBUS serial communication in C++
I would like to reimplement the current Futaba SBUS protocol in ArduPilot for Navio+. It seems to be a relatively expensive protocol, so I changed the code from an existing git project and to make it ...
3
votes
1answer
44 views
Routine for convert decimal digits to Densely Packed Decimal
I've written an amd64 assembly routine (in gas syntax using the System V calling convention) to convert three decimal digits to densely packed decimal because I wasn't satisfied by the performance of ...
3
votes
5answers
94 views
Toggle four relays on/off based on bitmap stored in uint8_t
I am using a one-byte bitmap to control four relays. I am writing a function which will take the bitmap stored as uint8_t, look to see which bits are set/cleared, ...
0
votes
1answer
318 views
Remove elements existing in a list built from an enum
The objective of this code is to make the difference inbetween two lists of items, that is knowing which items are missing in the second list in regards to the first one.
The first list is built from ...
2
votes
3answers
93 views
Testing if the binary representation of an integer has an odd number of ones
The fn odd_ones(x: u32) -> bool function should return true when x contains a odd number ...
7
votes
2answers
142 views
All arithmetic operator functions (+, -, *, /, %) coded only using bitwise operators in C
Here's all the functions in C that does all the arithmetic operators without using arithmetic operators themselves, mostly using bitwise operators. Recursive functions and comparison operators are ...
2
votes
1answer
52 views
Three ways to read a number for a BitInputStream
I'm trying to learn how to write more readable code without introducing easily avoidable performance killers.
This is part of a BitInputStream Java class I'm ...
3
votes
1answer
37 views
PWM wave generation
This code takes a integer x of range [0,127] as input, returns an array of four 32-bit integers, with x bits set.
I'm trying to ...
3
votes
1answer
64 views
Testing for divisibility of numbers - follow-up
(Here is the follow up question)
I had another go at trying to speed up my program described in my previous question.
JS1's answer was particulary helpful and now my code is only about 20% slower ...
2
votes
2answers
86 views
Program to test for divisibility of numbers
(EDIT: here is the follow up qusetion)
Using this program to test for the smallest number where its permutations or itself is divisible by 10 or less numbers is twice as slow as the fastest program I ...
5
votes
3answers
417 views
Finding nearest power of 2
I have the following simple program which calculates and returns the nearest power of 2 of a given number. Because I use increments and decrements to find the closest power, this takes a very long ...
2
votes
0answers
189 views
Read bits, write bits data to arbitrary position in char array
I created functions to read bit data from arbitrary bit position of a char array to long long int, and I also created a function ...
1
vote
1answer
201 views
Bitmask type to perform binary operations
Without any specific implementation details, how would you create a bitmask type that wraps binary arithmetic into something easy to read? Ideally, this would be used with an ...
1
vote
1answer
250 views
“Flipping bits” Python implementation
Problem Statement
You will be given a list of 32 bits unsigned integers. You are required to output the list of the unsigned integers you get by flipping bits in its binary representation (i.e. ...
7
votes
1answer
109 views
Return Y integer with same bit sets as X & having | X - Y | minimum value
I happened to come across one question:
Given an integer 'x' (Only positive), write an algorithm that returns
integer 'y' such that it has the same number of bits set as 'x' and is
not equal ...