README
¶
Utility package
English -> Pig Latin Translation Rules
A word with no characters is unchanged.
-
If a word begins with a vowel sound, do not shift the letters. Note that "xr" and "yt" at the beginning of a word make vowel sounds (e.g. "xray" -> "xrayay", "yttria" -> "yttriaay"). Add 'way' to the end of the word.
-
If a word begins with a consonant sound, move it to the end of the word. Consonant sounds can be made up of multiple consonants, such as the "ch" in "chair" or "st" in "stand" (e.g. "chair" -> "airchay"). If a word starts with a consonant sound followed by "qu", also move the 'u' to the end of the word (e.g. "square" -> "aresquay"). Add 'ay' to the end of the word.
-
If a word contains a "y" after a consonant cluster or as the second letter in a two letter word the 'y' makes a vowel sound (e.g. "rhythm" -> "ythmrhay", "my" -> "ymay").
Documentation
¶
Index ¶
- func Convergent(n int, fn convergentSeries) (*big.Int, *big.Int)
- func Cryptoquip(w1, w2 string) (map[byte]byte, bool)
- func DigitSum(n int) (sum int)
- func DigitsToInt(digits []int) int
- func Divisors(n int) []int
- func E(n int) int64
- func Equal(a, b []int) bool
- func Factors(n int) []int
- func FactorsCounted(n int) map[int]int
- func GCD(a, b int) int
- func Harshad(n, sum int) bool
- func IntToDigits(n int) []int
- func IsAnagram(w1, w2 string) bool
- func IsCube(n int) bool
- func IsDigitPermutation(a, b int) bool
- func IsInt(n float64) bool
- func IsPalindromeInt(p []int) bool
- func IsPalindromeString(p string) bool
- func IsSquare(n int) bool
- func LCM(a, b int) int
- func MakeDigits(n int, c chan []int)
- func MulFraction(n1, d1, n2, d2 int) (int, int)
- func PascalTriangle(max int) [][]int
- func ReduceFraction(n, d int) (int, int)
- func Reverse(digits []int) []int
- func Sqrt2(n int) int64
- func SquareFree(n int) bool
- func SumFraction(n1, d1, n2, d2 int) (int, int)
- func Totient(n int) int
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
func Convergent ¶
Convergent returns the nth convegence of whichever series you pass in a function for
func Cryptoquip ¶
Cryptoquip returns true if the letter arrangements are similar; e.g., KEEP and LOOT
func DigitsToInt ¶
DigitsToInt converts a slice of digits to an int
func FactorsCounted ¶
FactorsCounted returns counts of how many times each factor divides into n
func IntToDigits ¶
IntToDigits converts an int into a slice of its component digits
func IsDigitPermutation ¶ added in v0.0.7
IsDigitPermutation returns whether the two numbers are digit permutations of each other
func IsPalindromeInt ¶
IsPalindromeInt returns true if the digits of p are a palindrome
func IsPalindromeString ¶
IsPalindromeString returns true if the string is a palindrome
func MakeDigits ¶
MakeDigits generates all permutations of the first n digits
func MulFraction ¶ added in v0.0.4
MulFraction returns the product of the two fractions, still in fraction form
func PascalTriangle ¶
PascalTriangle returns a triangle of the max depth specified
func ReduceFraction ¶ added in v0.0.4
func SquareFree ¶
SquareFree returns true if no square of a prime divides n
func SumFraction ¶ added in v0.0.2
SumFraction returns the sum of the two fractions, still in fraction form
Types ¶
This section is empty.
Source Files