Category:Pluto
This programming language may be used to instruct a computer to perform a task.
| Official website |
|---|
| Execution method: | Interpreted |
|---|---|
| Garbage collected: | Yes |
| Type safety: | Safe |
| Type strength: | Strong |
| Type expression: | Implicit |
| Type checking: | Dynamic |
|
|
Pluto is a superset of Lua 5.4 with a focus on general-purpose programming. While being remarkably compatible with Lua 5.4 source-code & bytecode, it enhances the standard library & adds more than a dozen highly-desired syntaxes such as switch statements, compound operators, classes, class inheritance, string interpolation, type hinting, enums, and so on.
Pluto aspires to be a version of Lua with a larger feature-set, that is all. Pluto is not a Lua-killer, an attempted successor, or any of that. Many people (rightly so) love Lua precisely because of the design philosophy. And fundamentally, Pluto is a major deviation from Lua's design philosophy. Some may prefer this, some may not.
The language is being developed on github and pre-built binaries for 64-bit Linux, MacOS and Windows can be downloaded here.
Here is a list of custom libraries used on Rosetta Code:
| No. | Module name | No. | Module name |
|---|---|---|---|
| 1 | fmt | 2 | math2 |
| 3 | int | 4 | table2 |
| 5 | complex | 6 | rat |
| 7 | queue | 8 | map |
| 9 | list | 10 | perm |
| 11 | ansi | 12 | io2 |
| 13 | uchar | 14 | gchar |
| 15 | matrix | 16 | poly |
| 17 | audio | 18 | bitmap |
| 19 | lsystem | 20 | bignum |
To do
Tasks not implemented in Pluto
See also
Subcategories
This category has only the following subcategory.
@
- Pluto examples needing attention (empty)
Pages in category "Pluto"
The following 200 pages are in this category, out of 962 total.
(previous page) (next page)A
- A+B
- Abbreviations, automatic
- Abbreviations, easy
- Abbreviations, simple
- ABC correlation
- ABC incremental counts
- ABC problem
- ABC words
- Abelian sandpile model
- Abelian sandpile model/Identity
- Abstract type
- Abundant odd numbers
- Abundant, deficient and perfect number classifications
- Accumulator factory
- Achilles numbers
- Ackermann function
- Add a variable to a class instance at runtime
- Additive primes
- Address of a variable
- Air mass
- AKS test for primes
- Algebraic data types
- Aliquot sequence classifications
- Almkvist-Giullera formula for pi
- Almost prime
- Alternade words
- Amb
- Amicable pairs
- Anadromes
- Anagram generator
- Anagrams
- Anagrams/Deranged anagrams
- Anaprimes
- Angle difference between two bearings
- Angles (geometric), normalization and conversion
- Anonymous recursion
- Anti-primes
- Append numbers at same position in strings
- Apply a callback to an array
- Approximate equality
- Apéry's constant
- Arbitrary-precision integers (included)
- Archimedean spiral
- Arena storage pool
- Arithmetic derivative
- Arithmetic evaluation
- Arithmetic numbers
- Arithmetic-geometric mean
- Arithmetic-geometric mean/Calculate Pi
- Arithmetic/Complex
- Arithmetic/Integer
- Arithmetic/Rational
- Array concatenation
- Array length
- Arrays
- Ascending primes
- ASCII art diagram converter
- Assertions
- Associative array/Creation
- Associative array/Iteration
- Associative array/Merging
- Attractive numbers
- Average loop length
- Averages/Arithmetic mean
- Averages/Mean angle
- Averages/Mean time of day
- Averages/Median
- Averages/Mode
- Averages/Pythagorean means
- Averages/Root mean square
- Averages/Simple moving average
B
- Babbage problem
- Balanced brackets
- Barnsley fern
- Base 16 numbers needing a to f
- Base58Check encoding
- Base64 decode data
- Base64 encode data
- Bell numbers
- Benford's law
- Bernoulli numbers
- Bernoulli's triangle
- Best shuffle
- Bifid cipher
- Bin given limits
- Binary coded decimal
- Binary digits
- Binary search
- Binary strings
- Biorhythms
- Bitcoin/address validation
- Bitmap
- Bitmap/Bresenham's line algorithm
- Bitmap/Midpoint circle algorithm
- Bitwise operations
- Blum integer
- Boolean values
- Boustrophedon transform
- Box the compass
- Brazilian numbers
- Break OO privacy
- Brilliant numbers
- Burrows–Wheeler transform
C
- Caesar cipher
- Calculating the value of e
- Calkin-Wilf sequence
- Call a foreign-language function
- Call a function in a shared library
- Call an object method
- Camel case and snake case
- Canonicalize CIDR
- Cantor set
- Carmichael 3 strong pseudoprimes
- Case-sensitivity of identifiers
- Casting out nines
- Catalan numbers
- Catalan numbers/Pascal's triangle
- Catamorphism
- Centre and radius of a circle passing through 3 points in a plane
- Centroid of a set of N-dimensional points
- Change e letters to i in words
- Changeable words
- Chaocipher
- Character codes
- Chebyshev coefficients
- Check if a polygon overlaps with a rectangle
- Check if two polygons overlap
- Check input device is a terminal
- Check output device is a terminal
- Check that file exists
- Chemical calculator
- Chernick's Carmichael numbers
- Cheryl's birthday
- Chinese remainder theorem
- Chinese zodiac
- Cholesky decomposition
- Chowla numbers
- Chronological order
- Church numerals
- Cipolla's algorithm
- Circles of given radius through two points
- Circular primes
- Classes
- Closest-pair problem
- Closures/Value capture
- Cocke–Younger–Kasami (CYK) Algorithm
- Code Golf
- Collect and sort square numbers in ascending order from three lists
- Collections
- Color Difference CIE ΔE2000
- Color wheel
- Colorful numbers
- Combinations
- Combinations with repetitions
- Comma quibbling
- Command-line arguments
- Commatizing numbers
- Comments
- Common list elements
- Compare a list of strings
- Compare length of two strings
- Compile-time calculation
- Compiler/lexical analyzer
- Compound data type
- Concurrent computing
- Conditional structures
- Conjugate a Latin verb
- Conjugate transpose
- Consecutive primes with ascending or descending differences
- Constrained genericity
- Continued fraction
- Continued fraction convergents
- Continued fraction/Arithmetic/Construct from rational number
- Convert day count to ordinal date
- Convert decimal number to rational
- Convert seconds to compound duration
- Coprime triplets
- Copy a string
- Copy stdin to stdout
- CORDIC
- Count how many vowels and consonants occur in a string
- Count in factors
- Count in octal
- Count occurrences of a substring
- Count the coins
- Count the coins/0-1
- Count the occurrence of each digit in e
- Cousin primes
- Cramer's rule
- CRC-32
- Create a file
- Create a two-dimensional array at runtime
- Cuban primes
- Cubic special primes
- Cullen and Woodall numbers