Converts an integer to a corresponding sequence of words

100%

Converts an integer to a corresponding sequence of words

✓ Published0🌍 Public

Last edited Nov 29, 2013

Created on Nov 29, 2013

This example demonstrates a function that converts any non-negative integer into a sequence of English words for each of its digits, such as turning `0` into "zero". The code defines two recursive and iterative XQuery functions: `local:number-to-seq` first splits the integer into individual digits using integer division and modulo operations, then `local:int-to-string` maps each digit to its corresponding word via a `switch` expression. The final call, `local:int-to-string(0)`, executes the conversion and returns the word sequence. It relies solely on standard XQuery 3.0 functions like `fn:floor` and `fn:mod`, with no external libraries.

AI-generated description

Similar vizzes

Loading thumbnail…

Convert from Base 10

This example demonstrates base conversion by transforming the decimal integer 1024 into its binary equivalent, visually showing how repeated division by the target base produces the final digits. The code defines two XQuery 3.1 functions, `local:convert-base` and `local:join-nums`, which recursively divide the input by the base and concatenate the remainders into a single integer using `fn:string-join`. No external visualization libraries are used; the rendering relies entirely on XQuery’s native sequence and string operations to produce the output. The result appears as a numeric readout rather than a plotted chart.

CCliffordAnderson

68% match

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

60% match

Loading thumbnail…

Playing with Higher Order Functions in XQuery

This example demonstrates how higher-order functions in XQuery 3.1 enable function composition for transforming numeric sequences. It shows a square function (`$map-sqr`) that uses the simple map operator (`!`) with `math:pow`, which is then fed into a reversal function (`$pow-rev`) via the `=>` arrow operator. The code applies `fn:reverse` to the input sequence before passing it to the squared map, returning the squares of the reversed order. The rendered output is computed in-memory with no external data source, purely exercising the language’s functional capabilities.

CCliffordAnderson

59% match

Loading thumbnail…

Example of a FLWOR expression

This example demonstrates a FLWOR expression in XQuery, showing how to compute the squares of odd numbers from 1 to 10 and return them in descending order. The data source is an inline numeric range, and the result sequence is produced by iterating with a `for` clause, binding each square with `let`, filtering odd values using a `where` condition, and sorting with `order by` before the final `return`. The code relies on the standard XQuery 3.0 library and its built-in arithmetic operators, with no external APIs or rendering components involved.

CCliffordAnderson

59% match

Loading thumbnail…

An example of a fold function

This example demonstrates how the XQuery `fold-left` function reverses the letters of each word in a sequence, then joins the results into a single phrase. The code defines a list of words, an initial empty phrase, and an anonymous function that reverses each word using `fn:string-to-codepoints` and `fn:reverse` before converting back with `fn:codepoints-to-string`. The `fold-left` call iterates over the words, applying the function to accumulate the final string. The source is a gist by CliffordAnderson, and the output would be "tset a si siht" if the words were processed, though the phrase starts empty.

CCliffordAnderson

57% match

Loading thumbnail…

Fibonacci sequence in XQuery

This example visualizes the Fibonacci sequence by generating and plotting the first fifteen numbers through XQuery code. The visualization shows the numeric progression of the sequence, with each value computed recursively via the `local:fibo-numbers` function, which takes two starting integers and a limit. The rendering approach is plain text or tabular output, as the code only returns the sequence values without graphical mapping. It uses standard XQuery 3.0 functions and user-defined functions, with no external libraries or APIs, focusing purely on functional sequence generation. The data source is the code’s own hardcoded initial parameters, 0 and 1, and the result is a simple list of integers.

CCliffordAnderson

56% match

Loading thumbnail…

Sample switch expression for Topics in Digital Humanities

This example demonstrates a simple XQuery switch expression that maps numeric day values (1 through 7) to weekday names, with a fallback for invalid inputs. The code iterates over a hardcoded sequence of integers using a `for` loop, and for each value, the `switch` statement evaluates the matching `case` to return the corresponding string literal. No external visualization libraries are involved; the logic is purely functional, relying on XQuery's built-in control flow. The data source is the literal range `(1 to 7)`, and the output is a sequence of day names, illustrating pattern matching in a query language context.

CCliffordAnderson

56% match

Loading thumbnail…

Fizz Buzz in XQuery

This example demonstrates the classic Fizz Buzz logic, where numbers divisible by 3 and 5 are replaced with the word "fizzbuzz", those divisible by only 3 with "fizz", and those divisible by only 5 with "buzz". The code iterates over a fixed range of integers from 1 to 30 using an XQuery `for` loop. It applies nested `if`/`else` expressions to evaluate the modulo conditions (`$i mod 3` and `$i mod 5`) and returns the appropriate string or the original number. The entire computation is performed entirely within XQuery 3.0, with no external libraries or data sources involved.

CCliffordAnderson

55% match