This is an example of a library. You may see a list of other libraries used on Rosetta Code at Category:Solutions by Library.
Wren-seq is a module which supplements the methods in the Wren programming language's Sequence and List classes with static methods in the Seq and Lst classes respectively.
It also adds new list-based FrozenList, Stack and View classes which do what you would expect from their names.
It is the sixth in a series of modules (listed on the language's main page) designed to assist with writing Rosetta Code tasks so the same code does not have to be written or copy/pasted time and time again thereby bloating a task's script code unnecessarily.
To use it you need to copy the source code (in the talk page) to a text file called seq.wren and place this in the same directory as the importing script so the command line interpreter can find it.
As there is a dependency on the Wren-trait module, you also need to copy that (if it is not already present) to the same directory as described here. Unless you are using classes in that module directly, there is no need to import them into your script and the Cloneable and CloneableSeq classes can even be imported via Wren-seq itself.
Pages in category "Wren-seq"
The following 120 pages are in this category, out of 120 total.
- Calendar - for "REAL" programmers
- Cartesian product of two or more lists
- Chaos game
- Colorful numbers
- Combinations with repetitions
- Common list elements
- Common sorted list
- Composite numbers k with no single digit factors whose factors are all substrings of k
- Concatenate two primes is also prime
- Coprime triplets
- Curzon numbers
- Cyclops numbers
- Neighbour primes
- Numbers divisible by their individual digits, but not by the product of their digits.
- Numbers in base 10 that are palindromic in bases 2, 4, and 16
- Numbers which binary and ternary digit sum are prime
- Numbers whose count of divisors is prime
- Numbers with prime digits whose sum is 13
- P-value correction
- Palindromic primes
- Parse EBNF
- Parsing/RPN calculator algorithm
- Parsing/RPN to infix conversion
- Parsing/Shunting-yard algorithm
- Poker hand analyser
- Polynomial regression
- Positive decimal integers with the digit 1 occurring exactly twice
- Prime numbers p for which the sum of primes less than or equal to p is prime
- Prime numbers which contain 123
- Primes which contain only one odd digit
- Primes whose first and last number is 3
- Primes whose sum of digits is 25
- Primes with digits in nondecreasing order
- Safe and Sophie Germain primes
- Search a list
- Selectively replace multiple instances of a character within a string
- SHA-256 Merkle tree
- Shift list elements to left by 3
- Smallest numbers
- Smallest square that begins with n
- Smith numbers
- Special divisors
- Stream merge
- Sum and product puzzle
- Sum of the digits of n is substring of n
- Summarize and say sequence