Problem 6 of 99 Problems (adapted from https://johncrane.gitbooks.io/ninety-nine-elm-problems/content/p/p06.html)

100%

Problem 6 of 99 Problems (adapted from https://johncrane.gitbooks.io/ninety-nine-elm-problems/content/p/p06.html)

✓ Published0🌍 Public

Last edited Mar 17, 2018

Created on Mar 16, 2018

This example demonstrates a unit test suite for a palindrome-checking function written in XQuery, using the BaseX XQUnit testing framework. It shows how `fn:deep-equal` and `fn:reverse` from the XQuery 3.1 standard library verify that sequences of items (including numbers and strings) read identically forward and backward. The test cases, defined with `%unit:test` annotations and `unit:assert-equals`, cover positive and negative cases, single-item and empty sequences, and string-element palindromes. The code is organized as a module with a namespace and imported test module, reflecting a modular approach to test-driven development.

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

62% match

Loading thumbnail…

Making comparisons in XQuery

XQuery’s comparison operators are demonstrated through paired queries that contrast general comparisons with existential quantifiers. The code uses the XQuery `some`/`every` expressions and `satisfies` clauses to test set membership, while `=` and `eq` show value-based versus sequence-based equality. The examples, sourced from a gist, handle XML data with `isbn` attributes and use `where` clauses with `@num` comparisons. A node identity check via the `is` operator highlights how XQuery distinguishes node identity from value equality, all rendered in concise .xqy files.

CCliffordAnderson

61% match

Loading thumbnail…

Recursive function to evaluate whether a phrase is a palindrome

This example demonstrates a recursive XQuery function that determines whether a phrase is a palindrome, using the Persian sentence "شکر بترازوی وزارت برکش" as test data. The function checks length, compares first and last characters, and recursively tests the trimmed remainder via XPath `fn:string-length`, `fn:substring`, and `fn:replace`. The initial phrase is normalized with `fn:lower-case` and whitespace removal before evaluation. The code relies solely on the standard XQuery 3.0 function library, with no external visualization or rendering dependencies.

CCliffordAnderson

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

58% match

Loading thumbnail…

<title>Testing XPath

This example demonstrates how XPath and the XQuery `typeswitch` expression can be used to selectively process different node types in an XML document. It shows a TEI-encoded text where comments, text nodes, and `<p>` elements are handled distinctly, with element attributes joined into a space-separated string. The code relies on the XQuery 3.0 standard library functions `fn:string` and `fn:string-join`, operating on the TEI namespace declared in the document. The visualization is static, with no graphical rendering; instead, it highlights the programmatic traversal and conditional branching over the XML tree structure.

CCliffordAnderson

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

56% match

Loading thumbnail…

Quicksort in XQuery

This visualization compares four XQuery implementations of the quicksort algorithm, each derived from a Haskell reference, to demonstrate functional programming in a query language. It shows how the same recursive sorting logic can be expressed with different XQuery 3.1 features, including `fn:head()`, `fn:tail()`, `position()`, and a random-number generator for permutation. The code uses `local:qsort` functions with `xs:integer*` sequences, and the final example applies the sort to a shuffled list of 1 to 100 generated via `fn:random-number-generator('permute')`. The display highlights syntactical variations, such as explicit `where` clauses versus nested `if` expressions, without altering the core algorithm.

CCliffordAnderson

56% match

Loading thumbnail…

Combining Node Sequences

Two XQuery scripts demonstrate sequence operations on XML nodes. The first script, `except.xqy`, constructs a `<stopwords>` element from a word list and removes the fourth word using the `except` operator, returning a filtered sequence. The second, `operators.xqy`, defines three sequences of `<name>` elements and applies `except` to compare them, isolating differences between node sequences. Both rely on XQuery 3.1’s sequence operators (`except`, union, intersect) to combine and subtract node sets. The examples highlight how node identity and order determine sequence subtraction, with output shown as XML fragments without external libraries.

CCliffordAnderson

56% match