implement a Rolling Hash in C#

100%

implement a Rolling Hash in C#

✓ Published0🌍 Public

Last edited Nov 5, 2018

Created on Nov 5, 2018

This example demonstrates a rolling hash algorithm implemented in C# to search for a pattern substring within a larger string. The code calculates a numeric hash for the pattern and for each sliding window of the text, updating the hash incrementally by subtracting the outgoing character’s contribution, dividing by the prime base 7, and adding the incoming character’s hash. It uses `Math.Pow` for exponentiation and `Console.WriteLine` to output the pattern hash, running substring hashes, and comparison results. The example shows the algorithmic steps without using external visualization libraries, relying on console output to trace the hash updates.

AI-generated description

Similar vizzes

Loading thumbnail…

Gist 846581

This example visualizes the inverse of Java’s string hash function, showing how a given integer hash code can be reversed into a string. It uses a custom C implementation, including `java_hash_code` and `java_unhash_code`, to compute and invert hashes, with the recursive `unhash2` function building the string character by character. The code also includes a known collision case, where the hash of “polygenelubricants” maps to `INT_MIN`. The visualization is static, relying on the C logic and standard libraries like `string.h` and `limits.h` rather than any rendering framework.

XXXX

52% 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

50% match

Loading thumbnail…

CRC32 implementation in Power Query M mostly inpired by the article about CRC32 computation http://www.sunshine2k.de/articles/coding/crc/understanding_crc.html and Bit Hacks https://graphics.stanford.edu/~seander/bithacks.htm

This example demonstrates a complete CRC32 implementation written in Power Query M, showing how to compute cyclic redundancy checks entirely within a data-transformation language. It displays both the algorithm’s core logic and its practical output as a hexadecimal checksum. The code defines a reverse function for 8-bit and 32-bit values, precomputes a lookup table using a polynomial of 0x4C11DB7, and iterates over input characters with an accumulator function. It relies on Power Query’s `Number.BitwiseAnd`, `Number.BitwiseShiftLeft`, `Number.BitwiseXor`, and `List.Accumulate` APIs. The final result reverses the raw CRC, XORs with 0xFFFFFFFF, and formats it as uppercase hex via `Number.ToText`. The source is a gist by Hugoberry, drawing from external CRC tutorials and bit-hack references.

HHugoberry

50% match

Loading thumbnail…

Gist d740d28ab2549ada2394dbbe9728cd71

This visualization prints an alternating checkerboard pattern of spaces and hash symbols to the console, using standard JavaScript string concatenation and a nested `for` loop structure. The outer loop controls each row, while the inner loop builds the pattern by checking whether the row and column indices are even or odd. The code defines a fixed grid size of 8, generates each line into a string variable, and logs it with `console.log` before resetting the string for the next iteration. No external libraries are used; it relies solely on core JavaScript syntax and the console API.

MMistyBlunch

48% match

Loading thumbnail…

10 PRINT CHR$(205.5+RND(1)); : GOTO 10

This example visualizes the iconic Commodore BASIC one-liner "10 PRINT CHR$(205.5+RND(1)); : GOTO 10" by rendering a maze-like pattern of diagonal slashes and backslashes. It shows how a single line of code generates complex, emergent visual texture. The visualization uses a grid of characters, likely rendered via a canvas or SVG, where each cell randomly selects between the two slash characters using a pseudo-random function. The code leverages the browser’s Math.random() for the stochastic element, and the rendering approach mirrors the original program’s output, with no external data source beyond the algorithm itself.

CCliffordAnderson

43% match

Loading thumbnail…

Gist 6ca203fa1eab16a0f3c98d442ba9eea0

This example demonstrates a JavaScript function that transforms an input string into a "mumbling" pattern, where each character is repeated incrementally, capitalized at the start, and joined by hyphens. The visualization shows the result of applying this logic to sample strings like "abcd," "cwAt," and "RqaEzty" using the built-in `split`, `toLowerCase`, `toUpperCase`, `slice`, `map`, and `join` methods, along with custom `capitalize` and `accum` functions. The code relies on plain JavaScript string array manipulation without external libraries, producing outputs such as "A-Bb-Ccc-Dddd" for the first example.

MMistyBlunch

43% match

Loading thumbnail…

Gist 10da47bd381918d303c5db903afe5886

This example demonstrates how to generate all non-empty combinations of a set of strings using bitmask arithmetic. It shows three separate Power Query (M) implementations, each taking a hardcoded list like {"B", "F", "T"} and producing every possible subset as concatenated text. The primary approach uses `Number.BitwiseAnd` and `Number.Power` to iterate through binary masks, while `List.Transform`, `List.Select`, and `List.Positions` filter and combine elements. A recursive alternative using `@fnCombinations` is also included. The visualizations highlight different algorithmic strategies—iterative bitwise versus recursive decomposition—for the same combinatorial output, with no external libraries beyond Power Query’s built-in list functions.

HHugoberry

42% 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

42% match