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 3 classes: Conv, Fmt and Name.
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. However, the Fmt class also has convenience methods which mimic printf style functions thereby avoiding the need to use the basic formatting methods directly in nearly all cases.
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 673 total.
(previous page) (next page)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
- Percolation/Mean run density
- Percolation/Site percolation
- Perfect shuffle
- Periodic table
- Permutation test
- Permutations/Derangements
- Permutations/Rank of a permutation
- Pierpont primes
- Piprimes
- Pisano period
- Pollard's rho algorithm
- Polynomial regression
- Population count
- Posit numbers/decoding
- 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 numbers whose neighboring pairs are tetraprimes
- Prime reciprocal sum
- 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
- Primes: n*2^m+1
- Primorial numbers
- Print debugging statement
- Probabilistic choice
- Product of divisors
- Product of min and max prime factors
- Proof
- Proper divisors
R
- Radical of an integer
- 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
- Rice coding
- Riordan numbers
- RIPEMD-160
- Robots/Wren
- Roman numerals/Decode
- Roots of a cubic polynomial
- 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 of primorial primes
- Sequence: nth number with exactly n divisors
- Set puzzle
- Set, the card game
- 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
- Sieve of Pritchard
- Simulated annealing
- Simulated optics experiment/Data analysis
- Singly-linked list/Traversal
- Singular value decomposition
- Sisyphus sequence
- Sleeping Beauty problem
- Smallest multiple
- Smallest numbers
- Smallest power of 6 whose decimal expansion contains n
- Smallest square that begins with n
- Smarandache-Wellin primes
- Smith numbers
- Solve a Hidato puzzle
- Solve a Holy Knight's tour
- Solve a Hopido puzzle
- Solve a Numbrix puzzle
- Solve triangle solitaire puzzle
- Solving coin problems
- Sorensen–Dice coefficient
- 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
- Sphenic numbers
- Spiral matrix
- Square but not cube
- Square form factorization
- Square-free integers
- Stair-climbing puzzle
- Starting a web browser
- State name puzzle
- Statistics/Chi-squared distribution
- Statistics/Normal distribution
- Steady squares
- Steffensen's method
- Stem-and-leaf plot
- Stern-Brocot sequence
- Stirling numbers of the first kind
- Stirling numbers of the second kind
- Strange unique prime triplets
- Strong and weak primes
- Sudan function
- Suffixation of decimal numbers
- Sum digits of an integer
- Sum multiples of 3 and 5
- 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
- Super-Poulet numbers
- Superpermutation minimisation