# 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 626 total.

(previous page) (next page)### F

- 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
- Gaussian primes
- 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 numbers
- 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
- Meissel–Mertens constant
- 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 are the cube roots of the product of their proper divisors
- Numbers whose binary and ternary digit sums 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
- Pairs with common factors
- Palindrome dates
- Palindromic gapful numbers
- Palindromic primes
- Palindromic primes in base 16
- Pan base non-primes
- 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
- Penholodigital squares
- Penta-power prime seeds
- Percolation/Bond percolation
- Percolation/Mean cluster density