Fizz Buzz in XQuery

100%

Fizz Buzz in XQuery

✓ Published0🌍 Public

Last edited Jul 18, 2013

Created on Jul 18, 2013

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.

AI-generated description

Similar vizzes

Loading thumbnail…

FizzBuzz with simple mapping operator

This example demonstrates the FizzBuzz logic through a simple mapping operator, rendering the output sequence from 1 to 15 as a compact text visualization. The code uses the XQuery 3.0 `!` mapping operator to iterate over each number, applying a chain of conditional `mod` checks to classify values as “fizz,” “buzz,” or “fizz buzz.” The data source is the hardcoded range (1 to 15), and the rendering approach is direct string output, with no external libraries or graphical APIs involved. It shows how a classic programming puzzle can be expressed concisely using functional-style iteration and conditional logic in a single line.

CCliffordAnderson

80% match

Loading thumbnail…

Exercise: Implement FizzBuzz (Super Edition)

This example visualizes the transformation of an input array of integers through the FizzBuzz logic, displaying the resulting array where multiples of three are replaced with “Fizz,” multiples of five with “Buzz,” and multiples of both with “FizzBuzz.” The code, written in Ruby, implements two versions: an initial hash-based iteration that maps each index to its processed value, and a more concise solution using `Array#map!` to mutate the array in place. The visualization does not employ external libraries or rendering frameworks; instead, it relies solely on Ruby’s core array and hash methods to compute and output the final sequence, making the data flow explicit through the two algorithmic approaches.

EElaineYu

71% match

Loading thumbnail…

XQuery Fibonacci

This example computes the 30th Fibonacci number using a recursive XQuery function defined in a separate module. It demonstrates XQuery 3.1’s switch expression and integer arithmetic through the `local:fib` function, which calls itself until it reaches the base cases of 0 and 1. The final result is returned directly without any visualization, showing a pure server-side computation. The source code is stored as a gist by CliffordAnderson.

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

55% match

Loading thumbnail…

Converts an integer to a corresponding sequence of words

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.

CCliffordAnderson

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

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

53% match

Loading thumbnail…

Simple examples of higher-order functions and partial function application in XQuery

This example demonstrates higher-order functions and partial application in XQuery 3.0, using code tested with Saxon and Zorba. It shows functions that accept or return other functions, such as `local:pow` returning a function, and the `math:pow#2` built-in being partially applied with `?`. The code also illustrates fold operations (`fold-left`, `fold-right`) and sequence functions (`for-each`, `for-each-pair`, `filter`), applied to string and integer sequences. These snippets highlight how XQuery 3.0 supports functional programming patterns.

CCliffordAnderson

53% match