Category:Wren-fmt
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-fmt is a module which adds basic formatting capabilities to the Wren programming language. It consists of static methods organized into 2 classes: Conv and Fmt. As it is expected they will be mostly used within interpolated strings, most methods in the Fmt class have very short names reminiscent of the printf verb names in C-family languages.
It is the first 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 all you need to do is to copy the source code (in the talk page) to a text file called fmt.wren and place this in the same directory as the importing script so the command line interpreter can find it.
Pages in category "Wren-fmt"
The following 578 pages are in this category, out of 578 total.
A
- Abbreviations, automatic
- Abbreviations, easy
- Abbreviations, simple
- ABC problem
- ABC words
- Abelian sandpile model
- Abelian sandpile model/Identity
- Abundant odd numbers
- Achilles numbers
- Addition-chain exponentiation
- Additive primes
- Air mass
- Align columns
- Aliquot sequence classifications
- Almkvist-Giullera formula for pi
- Alternade words
- Amicable pairs
- Angles (geometric), normalization and conversion
- Apply a digital filter (direct form II transposed)
- Arbitrary-precision integers (included)
- Arithmetic coding/As a generalized change of radix
- Ascending primes
- ASCII art diagram converter
- Attractive numbers
- Average loop length
- Averages/Mean angle
- Averages/Mean time of day
- Averages/Simple moving average
B
- Babbage problem
- Babylonian spiral
- Base 16 numbers needing a to f
- Base58Check encoding
- Base64 decode data
- Base64 encode data
- Bell numbers
- Benford's law
- Bernoulli numbers
- Bin given limits
- Binary digits
- Bioinformatics/base count
- Bioinformatics/Global alignment
- Bioinformatics/Sequence mutation
- Bioinformatics/Subsequence
- Biorhythms
- Birthday problem
- Bitcoin/address validation
- Bitcoin/public point to address
- Black Box
- Blackjack strategy
- Boids/Wren
- Box the compass
- Brace expansion using ranges
- Brilliant numbers
C
- Calendar
- Calendar - for "REAL" programmers
- Calkin-Wilf sequence
- Camel case and snake case
- Canonicalize CIDR
- Carmichael 3 strong pseudoprimes
- Catalan numbers
- Catmull–Clark subdivision surface
- Change e letters to i in words
- Changeable words
- Chebyshev coefficients
- Check Machin-like formulas
- Checksumcolor
- Chemical calculator
- Chernick's Carmichael numbers
- Chess player
- Chinese zodiac
- Cholesky decomposition
- Chowla numbers
- Circular primes
- Cistercian numerals
- Colorful numbers
- Combinations and permutations
- Compare sorting algorithms' performance
- Compiler/AST interpreter
- Compiler/code generator
- Compiler/lexical analyzer
- Compiler/syntax analyzer
- Compiler/virtual machine interpreter
- Composite numbers k with no single digit factors whose factors are all substrings of k
- Concatenate two primes is also prime
- Conjugate a Latin verb
- Conjugate transpose
- Continued fraction/Arithmetic/Construct from rational number
- Convert decimal number to rational
- Coprime triplets
- Count in octal
- Count occurrences of a substring
- Count the coins
- Cousin primes
- CRC-32
- Create an HTML table
- Create an object at a given address
- Cuban primes
- Cubic special primes
- Cumulative standard deviation
- Curzon numbers
- Cut a rectangle
- Cycles of a permutation
- Cyclops numbers
- Cyclotomic polynomial
D
- Damm algorithm
- Data Encryption Standard
- Dating agency
- De Bruijn sequences
- Decimal floating point number to binary
- Deconvolution/2D+
- Deming's Funnel
- Descending primes
- Determinant and permanent
- Determine if a string has all the same characters
- Determine if a string has all unique characters
- Determine if a string is collapsible
- Determine if a string is numeric
- Determine if a string is squeezable
- Digital root
- Digital root/Multiplicative digital root
- Discordian date
- Display a linear combination
- Display an outline as a nested table
- Distinct palindromes within decimal numbers
- Distinct power numbers
- Distributed programming
- Distribution of 0 digits in factorial series
- Dominoes
- Doubly-linked list/Traversal
- Draw a cuboid
- Duffinian numbers
E
- Earliest difference between prime gaps
- EKG sequence convergence
- Element-wise operations
- Elementary cellular automaton
- Elementary cellular automaton/Infinite length
- Elliptic curve arithmetic
- Elliptic Curve Digital Signature Algorithm
- Equilibrium index
- Erdös-Selfridge categorization of primes
- Erdős-primes
- Erdős–Woods numbers
- Esthetic numbers
- Euler method
- Euler's constant 0.5772...
- Evaluate binomial coefficients
- Even or odd
- Exponentiation order
- Exponentiation with infix operators in (or operating on) the base
- Extra primes
- Extract file extension
F
- Faces from a mesh
- Factorial
- Factorial base numbers indexing permutations of a collection
- Factors of a Mersenne number
- Factors of an integer
- Fairshare between two and more
- Farey sequence
- Fast Fourier transform
- Faulhaber's triangle
- Feigenbaum constant calculation
- Fibonacci matrix-exponentiation
- Fibonacci n-step number sequences
- Fibonacci word
- File extension is in extensions list
- File size distribution
- Find adjacent primes which differ by a square integer
- Find first and last set bit of a long integer
- Find largest left truncatable prime in a given base
- Find minimum number of coins that make a given value
- Find palindromic numbers in both binary and ternary bases
- Find prime n such that reversed n is also prime
- Find prime numbers of the form n*n*n+2
- Find words which contain the most consonants
- Find words which contains all the vowels
- Find words which contains more than 3 e vowels
- Find words whose first and last three letters are equal
- Find words with alternating vowels and consonants
- First class environments
- First perfect square in base n with n unique digits
- First power of 2 that has leading decimal digits of 12
- First-class functions/Use numbers analogously
- Floyd's triangle
- Floyd-Warshall algorithm
- Formatted numeric output
- Fortunate numbers
- Forward difference
- Four is the number of letters in the ...
- Fraction reduction
- French Republican calendar
- Frobenius numbers
- Function frequency
- Functional coverage tree
- Fusc sequence
G
- Gamma function
- Gapful numbers
- Gauss-Jordan matrix inversion
- Generalised floating point addition
- Generalised floating point multiplication
- Generate Chess960 starting position
- Generate random chess position
- Generate random numbers without repeating a value
- Geohash
- Goldbach's comet
- Gradient descent
- Graph colouring
- Gray code
- Greed/Wren
H
I
J
K
L
- Lah numbers
- Largest difference between adjacent primes
- Largest five adjacent number
- Largest product in a grid
- Largest proper divisor of n
- Latin Squares in reduced form
- Latin Squares in reduced form/Randomizing using Jacobson and Matthews’ Technique
- Left factorials
- Letter frequency
- Linear congruential generator
- Linux CPU utilization
- Long multiplication
- Long primes
- Long stairs
- Longest common prefix
- Longest palindromic substrings
- Loops/Increment loop index within loop body
- Loops/Nested
- Loops/Wrong ranges
- LU decomposition
- Ludic numbers
- Luhn test of credit card numbers
M
- Magic constant
- Magic squares of doubly even order
- Magic squares of odd order
- Magic squares of singly even order
- Magnanimous numbers
- Main step of GOST 28147-89
- Man or boy test
- Map range
- Matrix multiplication
- Matrix transposition
- Matrix-exponentiation operator
- Mayan calendar
- Mayan numerals
- MD4
- MD5
- MD5/Implementation
- Memory layout of a data structure
- Merge and aggregate datasets
- Mertens function
- Metallic ratios
- Middle three digits
- Mind boggling card trick
- Minesweeper game
- Minimal steps down to 1
- Minimum multiple of m where digital sum equals m
- Minimum number of cells after, before, above and below NxN squares
- Minimum positive multiple in base 10 using only 0 and 1
- Minkowski question-mark function
- Modified random distribution
- Monads/Maybe monad
- Monads/Writer monad
- Monte Carlo methods
- Morpion solitaire
- Motzkin numbers
- Move-to-front algorithm
- Multi-base primes
- Multidimensional Newton-Raphson method
- Multifactorial
- Multiplication tables
- Multisplit
- Möbius function
N
- N'th
- N-body problem
- N-queens minimum and knights and bishops
- Names to numbers
- Natural sorting
- Nautical bell
- Negative base numbers
- Neighbour primes
- Next highest int from digits
- Next special primes
- Nice primes
- Nimber arithmetic
- Non-continuous subsequences
- Non-decimal radices/Convert
- Non-decimal radices/Input
- Non-decimal radices/Output
- Nonogram solver
- 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 in base-16 representation that cannot be written with decimal digits
- Numbers which are not the sum of distinct squares
- Numbers which binary and ternary digit sum are prime
- Numbers whose count of divisors is prime
- Numbers with equal rises and falls
- Numbers with same digit set in base 10 and base 16
- Numeric separator syntax
- Numerical and alphabetical suffixes
- Numerical integration
- Numerical integration/Adaptive Simpson's method
- Numerical integration/Gauss-Legendre Quadrature
- NYSIIS
O
P
- P-value correction
- Padovan n-step number sequences
- Palindrome dates
- Palindromic gapful numbers
- Palindromic primes
- Palindromic primes in base 16
- Pancake numbers
- Pandigital prime
- Paraffins
- Parallel brute force
- Parse an IP Address
- Parse EBNF
- Partition an integer x into n primes
- Pascal matrix generation
- Pascal's triangle
- Pascal's triangle/Puzzle
- Password generator
- Pathological floating point problems
- Pell numbers
- Pell's equation
- Percolation/Bond percolation
- Percolation/Mean cluster density
- Percolation/Mean run density
- Percolation/Site percolation
- Perfect shuffle
- Permutation test
- Permutations/Derangements
- Permutations/Rank of a permutation
- Pierpont primes
- Piprimes
- Pisano period
- Polynomial regression
- Population count
- Positive decimal integers with the digit 1 occurring exactly twice
- Powerful numbers
- Price fraction
- Price list behind API
- Primality by trial division
- Primality by Wilson's theorem
- Prime conspiracy
- Prime decomposition
- Prime numbers p for which the sum of primes less than or equal to p is prime
- Prime numbers which contain 123
- Prime triangle
- Prime triplets
- Primes - allocate descendants to their ancestors
- 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
- Primorial numbers
- Print debugging statement
- Probabilistic choice
- Product of divisors
- Proof
- Proper divisors
R
- Railway circuit
- Ramanujan primes
- Ramanujan primes/twins
- Ramanujan's constant
- Ramsey's theorem
- Random Latin squares
- Range modifications
- Ranking methods
- Rare numbers
- Ray-casting algorithm
- Recursive descent parser generator
- Reduced row echelon form
- Remote agent/Agent interface
- Remote agent/Simulation
- Rep-string
- Repunit primes
- Resistance calculator
- Resistance network calculator
- Rhonda numbers
- RIPEMD-160
- Robots/Wren
- Roman numerals/Decode
- Roots of a function
- Roots of unity
- Rosetta Code/Find bare lang tags
- Rosetta Code/List authors of task descriptions
- Rosetta Code/Rank languages by number of users
- Rosetta Code/Rank languages by popularity
- Round-robin tournament schedule
- Runge-Kutta method
- Ruth-Aaron numbers
S
- S-expressions
- Safe and Sophie Germain primes
- Safe primes and unsafe primes
- Secure temporary file
- SEDOLs
- Selective file copy
- Separate the house number from the street name
- Sequence of non-squares
- Sequence of primes by trial division
- Sequence: nth number with exactly n divisors
- Set puzzle
- Seven-sided dice from five-sided dice
- Sexy primes
- SHA-1
- SHA-256
- SHA-256 Merkle tree
- Show ASCII table
- Show the (decimal) value of a number of 1s appended with a 3, then squared
- Simulated annealing
- Singly-linked list/Traversal
- Sleeping Beauty problem
- Smallest multiple
- Smallest numbers
- Smallest power of 6 whose decimal expansion contains n
- Smallest square that begins with n
- Smith numbers
- Solve a Hidato puzzle
- Solve a Holy Knight's tour
- Solve a Hopido puzzle
- Solve a Numbrix puzzle
- Solve triangle solitare puzzle
- Solving coin problems
- Sort a list of object identifiers
- Sort an outline at every level
- Sort three variables
- Sorting algorithms/Cocktail sort with shifting bounds
- Soundex
- Special divisors
- Special factorials
- Special neighbor primes
- Spiral matrix
- Square form factorization
- Square-free integers
- Stair-climbing puzzle
- Starting a web browser
- State name puzzle
- Statistics/Normal distribution
- Steady squares
- Stem-and-leaf plot
- Stern-Brocot sequence
- Stirling numbers of the first kind
- Stirling numbers of the second kind
- Strange unique prime triplets
- Strassen's algorithm
- Strong and weak primes
- Suffixation of decimal numbers
- Sum digits of an integer
- Sum of divisors
- Sum of primes in odd positions is prime
- Sum of the digits of n is substring of n
- Sum of two adjacent numbers are primes
- Sum to 100
- Summarize primes
- Summation of primes
- Super-d numbers
- Superpermutation minimisation
T
- Table creation
- Table creation/Postal addresses
- Tamagotchi emulator
- Tau function
- Tau number
- Taxicab numbers
- Temperature conversion
- Test integerness
- Text between
- Text completion
- Text processing/1
- Text processing/2
- Textonyms
- The ISAAC Cipher
- The sieve of Sundaram
- Thiele's interpolation formula
- Three word location
- Top rank per group
- Topswops
- Totient function
- Trabb Pardo–Knuth algorithm
- Transportation problem
- Tree datastructures
- Tree from nesting levels
- Trigonometric functions
- Triplet of three numbers
- Truncatable primes
- Twelve statements
- Twin primes
- Two bullet roulette
- Two identical strings
- Type detection