XQDoc Example

100%

✓ Published0🌍 Public

Last edited Jun 3, 2014

Created on Jun 3, 2014

XQDoc Example demonstrates how XQuery 3.0 implements recursive functions, using a power-calculation function that repeatedly multiplies an integer by itself. The code defines `local:pow()` with base and recursive cases, invoking it with arguments 2 and 3 to compute 8. The example highlights XQuery's declarative recursion pattern, contrasting with iterative languages. The source is a gist by CliffordAnderson, and the rendering approach is plain text output, as no graphical or external API is employed. The function's documentation comments specify parameters, return types, and an adaptation credit to Michael Kay's StackOverflow answer.

AI-generated description

Similar vizzes

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

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

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

65% match

Loading thumbnail…

The Euclidean Algorithm in XQuery

This example demonstrates two implementations of the Euclidean algorithm in XQuery, computing the greatest common divisor of 13 and 8. The first function, `local:euclid`, uses repeated subtraction, while the second, `local:gcd`, employs the more efficient division-and-remainder method. Both functions return the result as an `xs:integer*` sequence using XQuery’s built-in arithmetic and type declarations. The code is drawn from a gist by CliffordAnderson and serves as a minimal, functional illustration of algorithmic logic in a query language.

CCliffordAnderson

61% match

Loading thumbnail…

Factorial

This example demonstrates the computation of the factorial of 10 using XQuery 3.1. It shows two distinct implementation approaches: a recursive function `local:fac` and a higher-order function `local:hFac` that uses `fn:fold-right` with an anonymous function. The program executes `local:hFac(10)`, which iteratively multiplies values from 1 to 10. The data is not visualized graphically; instead, the output is the numeric result of the calculation. The code relies on XQuery’s built-in type annotations (`xs:int`) and function library, with no external visualization libraries involved.

CCliffordAnderson

61% match

Loading thumbnail…

Example of Fib

This example contrasts two XQuery 3.1 implementations of the Fibonacci sequence, both computing the 30th term. The first defines a recursive function with a `switch` statement, while the second uses tail recursion with accumulator parameters. Each script uses the `declare function` syntax to expose `local:fib`, returning an `xs:integer` sequence. The example highlights alternative recursion strategies in XQuery, showing how the same mathematical result can be produced through different control-flow patterns without external libraries or visualizations.

CCliffordAnderson

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

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

56% match