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

### A

- Abbreviations, automatic
- Abbreviations, easy
- Abbreviations, simple
- ABC Problem
- Abelian sandpile model
- Abelian sandpile model/Identity
- Abundant odd numbers
- Align columns
- Aliquot sequence classifications
- Almkvist-Giullera formula for pi
- 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

### C

- Canonicalize CIDR
- Carmichael 3 strong pseudoprimes
- Catalan numbers
- Chebyshev coefficients
- Chemical Calculator
- Chinese zodiac
- Chowla numbers
- 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
- 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
- Display a linear combination
- Draw a cuboid

### E

### F

- Faces from a mesh
- Factorial
- Factors of a Mersenne number
- Factors of an integer
- Fairshare between two and more
- Farey sequence
- Faulhaber's triangle
- Feigenbaum constant calculation
- Fibonacci word
- File extension is in extensions list
- Find first and last set bit of a long integer
- Find palindromic numbers in both binary and ternary bases
- 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
- Fusc sequence

### H

### I

### L

### 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
- Mayan numerals
- Memory layout of a data structure
- Mertens function
- Metallic ratios
- Middle three digits
- Mind boggling card trick
- Minimum positive multiple in base 10 using only 0 and 1
- Monads/Maybe monad
- Monads/Writer monad
- Move-to-front algorithm
- Multifactorial
- Multiplication tables
- Multisplit
- Möbius function

### N

### P

### R

### S

- SEDOLs
- Separate the house number from the street name
- Sequence of non-squares
- Sequence of primes by trial division
- Sexy primes
- Show Ascii table
- Sort a list of object identifiers
- Sort an outline at every level
- Sort three variables
- Sorting algorithms/Cocktail sort with shifting bounds
- Soundex
- Square-free integers
- Stirling numbers of the first kind
- Stirling numbers of the second kind
- Strassen's algorithm
- Strong and weak primes
- Sum digits of an integer
- Super-d numbers