Refucktoring: Roman numerals in LUA — VizHub

SimilarExport ZIP

100%

Refucktoring: Roman numerals in LUA

✓ Published0🌍 Public

Last edited Sep 14, 2017

Created on Jun 28, 2017

A deliberately obfuscated Lua implementation of Roman numeral conversion hides all arithmetic and constants behind absurdly named functions and Monte Carlo simulation. The code defines numerals like Cicero() for "C" and IIIII() for "V", then derives values by random sampling. It uses the Busted testing framework to validate conversion functions sourced from Rosetta Code.

AI-generated description

Similar vizzes

Loading thumbnail…

An attempt at the Luhn algorithm in XQuery

This example demonstrates the Luhn algorithm, a checksum formula used to validate identification numbers, implemented in XQuery. It checks a sequence of sample numbers from Wikipedia, returning a boolean value indicating whether each number passes validation. The code uses the XQuery 3.1 `fn:fold-left` and `fn:sum` higher-order functions to compute digit sums, and the `fn:reverse` function to process digits from right to left. It includes a recursive `local:number-to-seq` function to convert an integer into a sequence of its digits. The source is a gist by CliffordAnderson, provided in two versions: a standalone script and a library module.

CCliffordAnderson

Loading thumbnail…

Gist 641fc44c27c66ee9ef09

This example demonstrates a Latin text preprocessing pipeline that converts raw words into lemmata and macronized dictionary entries. It shows how a sample sentence like "quo usque tandem abutere catilina nostra patientia" is tokenized, cleaned of punctuation, and processed word-by-word. The code uses the CLTK `LemmaReplacer` for lemmatization, lxml’s `etree` to parse the Perseus Latin lexicon XML file, and custom string manipulation to transform entries like "a^bu_tor" into "abūtor". The workflow defines classes for text and word-level morphological analysis, though the dictionary lookup for full texts runs too slowly to complete.

Loading thumbnail…

Caesars Cipher (ROT13) - FCC Challenge

This example demonstrates the ROT13 Caesar cipher, a letter-substitution cipher that shifts each alphabetic character by 13 positions. It shows the transformation of an encoded input string into its decoded plaintext output. The JavaScript function `rot13` processes the string by splitting it into an array, applying the cipher logic via `Array.map`, and rejoining the characters. The cipher uses `charCodeAt` and `String.fromCharCode` to handle character codes, preserving non-alphabetic characters while shifting letters in the ranges A–M and N–Z. The visible test case decodes "V PENPXRQ GUR PBQR" to reveal the original message.

Aadammarcwilliams

Loading thumbnail…

Gist e1458497b7415589b8b144e03e5f918d

This example demonstrates a JavaScript module that generates deterministic lorem ipsum text using a seeded pseudo-random number generator, with the ability to customize word counts, sentence lengths, and paragraph structure. It is implemented as an Angular factory service named `lorem`, built on top of the `angular.module` API. The code adapts the `loremIpsum` function from the knicklabs/lorem-ipsum.js library, replacing the default `Math.random` with a custom sinusoidal seed-based generator, and supports plain or HTML output formats for generating placeholder content.

Loading thumbnail…

Dirty Javascript reproduction of https://twitter.com/jplur_/status/891358168688754688

This example demonstrates the unexpected results of overriding JavaScript’s native `parseInt` function with custom logic, reproducing a viral tweet by jplur_. The code defines a new `parseInt` that intercepts specific string arguments—like `"Infinity"`, `"1+1+1"`, or `[]+[]+[]`—and returns quirky outputs such as `NaN`, `"3?"`, or `"stop it"`. It also handles the function itself as an argument, logging an error message. The visualization is purely textual, using console output to show the modified behavior, with no external libraries or rendering APIs involved.

Loading thumbnail…

A simple JAVA program for practicing regex.

This Java program provides an interactive way to practice writing regular expressions, with a focus on Latin texts. It offers three practice modes: finding a pattern's index in a user-supplied string, searching a text file for a pattern, and counting the frequency of a pattern in Cicero's First Catilinarian. The program uses Java's Pattern and Matcher classes to handle regex operations, and reads from included Latin text files to provide realistic NLP-style exercises.

Loading thumbnail…

Gist 23875167ddf54617f817bbd24632696b

This example shows a JavaScript function that counts down from a given number and logs each value as either “par” (even) or “impar” (odd) to the console. It uses a `while` loop with a modulo (`%`) operator to test each integer against `0` and then prints the corresponding label. The function `func(10)` is called to process numbers from 10 down to 1, producing a simple text-based output without any graphical or charting libraries. The data source is the hardcoded initial value passed as an argument.

Loading thumbnail…

number exercises

This example visualizes the outcomes of several JavaScript exercise functions, each testing a specific computation. It shows whether functions like `computeArea`, temperature converters `celsToFahr` and `fahrToCels`, and `isDivisible` produce expected results. The code relies on native JavaScript functions and console logging to report pass or fail statuses, with no external libraries or data sources. The rendering approach is purely textual, using `console.log` output to display success or failure messages for each test case, making the results immediately visible in the console.