Skip to main content
SimilarExport ZIP
100%

Recursive function to evaluate whether a phrase is a palindrome

✓ Published0🌍 Public
CCliffordAnderson
Last edited Mar 24, 2014
Created on Mar 24, 2014

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.

AI-generated description

Similar vizzes

Loading thumbnail…

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

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.

CCliffordAnderson
59% match
Loading thumbnail…

Gist bdf18bc2f317cb12b0db8e964e212b94

This C++ console program determines whether a user-provided word is a palindrome. It first prompts for input via the standard `cin` stream, then passes the string to the `polindromo_palabra` function. That function measures the word's length, rejects empty or single-character inputs with specific messages, and builds a reversed copy of the string by iterating backward through the original. It then compares the original to the reversed version using the `!=` operator, printing whether the word is or is not a palindrome. The example uses standard C++ libraries (`iostream`, `stdio.h`, and the `string` class) with no external visualization or graphics APIs.

MMistyBlunch
55% 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
53% match
Loading thumbnail…

Query for long and short phrases in Shakespeare's plays

This visualization shows the distribution of long versus short phrases in Shakespeare’s plays, counting how many phrases exceed twenty characters. A bar-like layout compares the two categories, making the frequency difference immediately visible. The code uses XQuery 3.0 with the `fn:collection` and `tei:ab` functions to access and iterate over TEI-annotated text blocks, applying `fn:string-length` to classify each phrase. It groups results by length category using the `group by` clause, then dynamically constructs an element named `long-phrase` or `short-phrase` with the corresponding count, rendering the final output as XML.

CCliffordAnderson
49% match
Loading thumbnail…

XQuery for Pig Latin

The example shows a progression of XQuery 3.0 scripts that implement Pig Latin translation, starting from a single hardcoded word and evolving to handle full sentences with punctuation. It demonstrates functional recursion and string manipulation using core XQuery functions like `fn:substring`, `fn:replace`, `fn:string-to-codepoints`, `fn:tokenize`, and `fn:string-join`. The final version declares custom functions `local:move-letters`, `local:parse-word`, and `local:parse-sentence` to process the phrase "Will you adjust the thermometer?" into its Pig Latin equivalent, preserving sentence structure. The code highlights XQuery's ability to handle text transformation without external libraries, relying solely on its built-in string and sequence operations.

CCliffordAnderson
47% match
Loading thumbnail…

A little playful XQuery

This playful XQuery example transforms a user’s phrase by replacing each word with a random antonym fetched from the Oxford Dictionaries API. It demonstrates a game-like text manipulation, showing the original sentiment inverted. The code uses XQuery 3.1, the `http:send-request` and `random:integer` functions, and the MarkLogic HTTP client to query the Oxford entry endpoint. For each word, it retrieves antonym sets, picks one randomly, and falls back to the original word when no antonym exists.

CCliffordAnderson
47% match
Loading thumbnail…

XQuery Full Text

This example demonstrates how XQuery 3.1 can perform full-text search and fuzzy string matching directly within a query. It shows four distinct text-processing capabilities: proximity-based word matching using the `contains text` operator with distance constraints, stop-word filtering, Levenshtein distance calculation via the `strings:levenshtein` function, and phonetic comparison using `strings:soundex`. The code relies on the XQuery standard library functions for string operations rather than external visualization libraries, highlighting the language's built-in text analytics power.

CCliffordAnderson
46% 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
46% match