# Category:Wren-fmt

**Library**

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 200 pages are in this category, out of 604 total.

(previous page) (next page)### 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
- Anadromes
- 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
- Arithmetic derivative
- Arithmetic numbers
- 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 coded decimal
- 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
- Boustrophedon transform
- 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
- Engel expansion
- 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
- Factorial primes
- 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
- Fermat pseudoprimes
- 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