Function to reverse an 8 bit number

100%

Function to reverse an 8 bit number

✓ Published0🌍 Public

Last edited Feb 27, 2017

Created on Feb 27, 2017

This example visualizes the process of reversing an 8-bit number, showing the bitwise transformation from input to output. The code uses the `Number.Mod` and `Number.BitwiseAnd` JavaScript APIs to perform the reversal, applying the bitmask `0x010884422010` and multiplication factor `0x0202020202` as part of the algorithm. The visualization renders the data as a compact graphic, with each step of the reversal represented spatially, though the exact rendering method is not detailed in the source. The gist, authored by Hugoberry, provides a minimal, functional demonstration of the reversal logic in a single line.

AI-generated description

Similar vizzes

Loading thumbnail…

Function for reversing the bits in a 32bit number

The example demonstrates a custom function that reverses the order of bits in a 32-bit unsigned integer, a common low-level operation used in bit manipulation. It shows the step-by-step isolation and recombination of individual bytes (b0 through b3) before reversing the bits within each byte. The code relies on Power Query’s `Number.BitwiseAnd`, `Number.BitwiseShiftRight`, `Number.BitwiseShiftLeft`, and `Number.BitwiseOr` functions to mask, shift, and reassemble the bytes. A helper `reverse` function is implied for per-byte bit reversal, though not defined here. The visualization itself is a code snippet, not a graphical chart, highlighting the algorithmic logic rather than data representation.

HHugoberry

82% match

Loading thumbnail…

An example of reversing bits in a 32-bit number

This example demonstrates how to reverse the bits of a 32-bit integer using a series of bitwise operations, applied to a specific input value. It shows the step-by-step process of extracting individual bytes, reversing their bit order, and reassembling them into the final result. The code uses PowerShell’s built-in bitwise operators like `-band`, `-shr`, and `-shl` to perform the manipulation, with helper functions `reverse` and `reverse64` providing alternative implementations. The input `0x04c11db7` is processed, and the output is printed in hexadecimal format, illustrating the reversal effect without any external libraries or visualization frameworks.

HHugoberry

75% match

Loading thumbnail…

JavaScript Array

This example demonstrates JavaScript array operations, focusing on how to create and manipulate arrays in the browser console. The code defines a `range` function that generates an array of numbers from 0 to 4, then applies various array methods including `forEach`, `filter`, and `sort`. The final visible output shows how `.sort()` combined with `.reverse()` reorders the array `[0, 9, 1, 84, 23, 6]`, logging the reversed sorted result to the console. The visualization uses a large text message to display the result, with the logic implemented through raw JavaScript array prototypes rather than any external libraries.

Ddalia.miliauskaite@me.com

58% match

Loading thumbnail…

Base64.js

This example demonstrates a compact implementation of Base64 encoding in JavaScript, showing how binary data can be converted into a six-bit character representation using the standard Base64 alphabet. The code defines a function, `encode`, that iterates over the input string’s character codes and constructs the output by bit-shifting values and selecting characters from a lookup string. It uses standard JavaScript string methods like `charCodeAt` and `charAt` alongside bitwise operators, with no external libraries or visualization components involved. The example serves as a clear, minimal demonstration of encoding logic rather than a data-driven graphic.

Mmbostock

54% match

Loading thumbnail…

Precomputin the CRC32 lookup table

This example visualizes the precomputation of a CRC32 lookup table, showing how 256 polynomial division results are generated for each possible input byte. The code defines a function that calculates CRC values by iterating through bit shifts and conditional XOR operations, using the polynomial 0x4C11DB7. It then employs List.Generate to build the complete lookup table, mapping each byte value (0–255) to its corresponding CRC result. The visualization highlights the algorithmic structure of CRC table generation, with Power Query’s number and bitwise functions (Number.BitwiseShiftLeft, Number.BitwiseXor) driving the computation.

HHugoberry

53% match

Loading thumbnail…

DEC2BIN or HEX2BIN in Power Query M

This example demonstrates a Power Query M function that converts a decimal number to its binary string representation, implementing the equivalent of Excel’s DEC2BIN and HEX2BIN operations. The function, `Number.DEC2BIN`, takes a numeric input and uses `List.Generate` to iteratively extract bits via `Number.BitwiseAnd` and `Number.BitwiseShiftRight`. Each iteration prepends the least significant bit to an accumulating string, while the loop continues until the remainder becomes zero. The code relies on M’s native `Number.ToText` for bit conversion and explicitly shows the bitwise arithmetic and list-generation logic, with no external libraries or data sources involved.

HHugoberry

53% match

Loading thumbnail…

WebAssembly integer operations

This example demonstrates a JavaScript WebAssembly module that exports integer division and echo functions, highlighting a discrepancy between WebAssembly’s spec-defined `ToWebAssemblyValue` coercion and its inverse `ToJSValue` conversion for i32 values. It uses the WebAssembly JavaScript API’s `instantiate` and `instance.exports` to call compiled wasm functions, while manually implementing the ECMA-262 `ToInt32` algorithm and a guessed JavaScript conversion. The visualization presents console output comparing wasm results against equivalent JavaScript conversions, revealing that unsigned division produces different values due to overflow handling.

CColinEberhardt

53% match

Loading thumbnail…

quickSort.js

This example visualizes the recursive quicksort algorithm sorting a small numeric array, showing the step-by-step partition process and final sorted order. The code defines a `quickSort` function that selects a pivot from the middle of the array, uses two pointers to swap elements out of place, and recursively sorts the subarrays on either side. It demonstrates the algorithm’s logic directly in JavaScript with console output, using no external libraries. The rendering approach is textual, logging the unsorted and sorted arrays to the console, while the source data is a hardcoded array `[7, 0, 2, 1, 9, 2]`. The example highlights the algorithm’s core mechanics rather than a graphical chart.

WWill Carter

52% match