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 360 pages are in this category, out of 360 total.
A
- Abbreviations, automatic
- Abbreviations, easy
- Abbreviations, simple
- ABC problem
- ABC words
- Abelian sandpile model
- Abelian sandpile model/Identity
- Abundant odd numbers
- Align columns
- Aliquot sequence classifications
- Almkvist-Giullera formula for pi
- Alternade words
- Amicable pairs
- Angles (geometric), normalization and conversion
- Arbitrary-precision integers (included)
- Attractive numbers
- Average loop length
- Averages/Mean angle
- Averages/Mean time of day
- Averages/Simple moving average
B
- Babbage problem
- 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
- Biorhythms
- Birthday problem
- Box the compass
- Brace expansion using ranges
C
- Calkin-Wilf sequence
- Canonicalize CIDR
- Carmichael 3 strong pseudoprimes
- Catalan numbers
- Change e letters to i in words
- Changeable words
- Chebyshev coefficients
- Chemical calculator
- Chernick's Carmichael numbers
- Chinese zodiac
- Cholesky decomposition
- Chowla numbers
- Cistercian numerals
- Combinations and permutations
- Conjugate transpose
- Continued fraction/Arithmetic/Construct from rational number
- Convert decimal number to rational
- Count in octal
- Count occurrences of a substring
- Count the coins
- CRC-32
- Create an HTML table
- Cuban primes
- Cumulative standard deviation
- Cut a rectangle
D
- Damm algorithm
- De Bruijn sequences
- Decimal floating point number to binary
- Deming's Funnel
- 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
- Doubly-linked list/Traversal
- Draw a cuboid
E
- EKG sequence convergence
- Element-wise operations
- Elementary cellular automaton
- Elementary cellular automaton/Infinite length
- Elliptic curve arithmetic
- Equilibrium index
- Esthetic numbers
- Euler method
- 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
- 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 n-step number sequences
- Fibonacci word
- File extension is in extensions list
- Find first and last set bit of a long integer
- Find largest left truncatable prime in a given base
- Find palindromic numbers in both binary and ternary bases
- Find words which contains all the vowels
- Find words which contains more than 3 e vowels
- Find words which contains most consonants
- Find words which first and last three letters are equals
- Find words with alternating vowels and consonants
- First class environments
- First power of 2 that has leading decimal digits of 12
- First-class functions/Use numbers analogously
- Floyd's triangle
- Formatted numeric output
- Forward difference
- Functional coverage tree
- Fusc sequence
G
H
I
K
L
- Lah numbers
- Latin Squares in reduced form
- Left factorials
- Letter frequency
- Linear congruential generator
- Long multiplication
- Long primes
- 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 squares of doubly even order
- Magic squares of odd order
- Magic squares of singly even order
- Magnanimous numbers
- Main step of GOST 28147-89
- 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
- Minimal steps down to 1
- 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
- Move-to-front algorithm
- Multidimensional Newton-Raphson method
- Multifactorial
- Multiplication tables
- Multisplit
- Möbius function
N
- N'th
- Names to numbers
- Negative base numbers
- Nimber arithmetic
- Non-continuous subsequences
- Non-decimal radices/Convert
- Non-decimal radices/Input
- Non-decimal radices/Output
- Numbers with equal rises and falls
- Numeric separator syntax
- Numerical integration
- Numerical integration/Adaptive Simpson's method
- Numerical integration/Gauss-Legendre Quadrature
- NYSIIS
O
P
- Palindrome dates
- Palindromic gapful numbers
- Pancake numbers
- Paraffins
- Parse an IP Address
- Partition an integer x into n primes
- Pascal matrix generation
- Pascal's triangle
- Pascal's triangle/Puzzle
- Pathological floating point problems
- 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
- Pisano period
- Polynomial regression
- Population count
- Powerful numbers
- Price fraction
- Price list behind API
- Primality by trial division
- Primality by Wilson's theorem
- Prime conspiracy
- Prime decomposition
- Primes - allocate descendants to their ancestors
- Primorial numbers
- Print debugging statement
- Probabilistic choice
- Product of divisors
- Proof
- Proper divisors
R
S
- Safe primes and unsafe primes
- SEDOLs
- 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
- Seven-sided dice from five-sided dice
- Sexy primes
- SHA-1
- SHA-256
- SHA-256 Merkle tree
- Show ASCII table
- Singly-linked list/Traversal
- Smith numbers
- Solve a Hidato puzzle
- Solve a Holy Knight's tour
- Solve a Hopido puzzle
- Solve a Numbrix puzzle
- Solve triangle solitare puzzle
- Sort a list of object identifiers
- Sort an outline at every level
- Sort three variables
- Sorting algorithms/Cocktail sort with shifting bounds
- Soundex
- Spiral matrix
- Square-free integers
- Stair-climbing puzzle
- State name puzzle
- Stern-Brocot sequence
- Stirling numbers of the first kind
- Stirling numbers of the second kind
- Strassen's algorithm
- Strong and weak primes
- Sum digits of an integer
- Sum of divisors
- Super-d numbers
- Superpermutation minimisation
T
- Tau function
- Tau number
- Taxicab numbers
- Temperature conversion
- Test integerness
- Text between
- Text completion
- Text processing/1
- Text processing/2
- Textonyms
- The ISAAC Cipher
- Thiele's interpolation formula
- Three word location
- Top rank per group
- Topswops
- Totient function
- Trabb Pardo–Knuth algorithm
- Tree datastructures
- Tree from nesting levels
- Trigonometric functions
- Truncatable primes
- Twelve statements
- Twin primes
- Two bullet roulette
- Type detection