Category:Lua: Difference between revisions
(→Unimplemented programming tasks: Report) |
(→Unimplemented programming tasks: Replaced out-of-date list with a link to the unimplemented tasks page) |
||
(11 intermediate revisions by 4 users not shown) | |||
Line 22: | Line 22: | ||
==Unimplemented programming tasks== |
==Unimplemented programming tasks== |
||
[[Tasks not implemented in Lua]] |
|||
Output from [[Find_unimplemented_tasks]] : |
|||
Lua has 186 unimplemented programming tasks: |
|||
15 puzzle solver |
|||
2048 |
|||
4-rings or 4-squares puzzle |
|||
9 billion names of God the integer |
|||
AKS test for primes |
|||
Active Directory/Connect |
|||
Active Directory/Search for a user |
|||
Active object |
|||
Aliquot sequence classifications |
|||
Anagrams/Deranged anagrams |
|||
Angle difference between two bearings |
|||
Animation |
|||
Append a record to the end of a text file |
|||
Apply a digital filter (direct form II transposed) |
|||
Arbitrary-precision integers (included) |
|||
Archimedean spiral |
|||
Arena storage pool |
|||
Arithmetic-geometric mean/Calculate Pi |
|||
Atomic updates |
|||
Average loop length |
|||
Averages/Mean time of day |
|||
Babbage problem |
|||
Balanced ternary |
|||
Bernoulli numbers |
|||
Best shuffle |
|||
Bitcoin/address validation |
|||
Bitcoin/public point to address |
|||
Bitmap/Bresenham's line algorithm |
|||
Bitmap/Bézier curves/Cubic |
|||
Bitmap/Bézier curves/Quadratic |
|||
Bitmap/Flood fill |
|||
Bitmap/Midpoint circle algorithm |
|||
Bitmap/PPM conversion through a pipe |
|||
Bitmap/Read an image through a pipe |
|||
Bitwise IO |
|||
Brace expansion |
|||
Break OO privacy |
|||
Bulls and cows/Player |
|||
CRC-32 |
|||
Call a function in a shared library |
|||
Canny edge detector |
|||
Carmichael 3 strong pseudoprimes |
|||
Casting out nines |
|||
Catmull–Clark subdivision surface |
|||
Chat server |
|||
Check Machin-like formulas |
|||
Checkpoint synchronization |
|||
Chinese remainder theorem |
|||
Chinese zodiac |
|||
Cholesky decomposition |
|||
Circles of given radius through two points |
|||
Closest-pair problem |
|||
Color of a screen pixel |
|||
Color quantization |
|||
Colour bars/Display |
|||
Colour pinstripe/Display |
|||
Colour pinstripe/Printer |
|||
Combinations and permutations |
|||
Commatizing numbers |
|||
Compare sorting algorithms' performance |
|||
Compiler/AST interpreter |
|||
Compiler/code generator |
|||
Compiler/lexical analyzer |
|||
Compiler/syntax analyzer |
|||
Compiler/virtual machine interpreter |
|||
Conjugate transpose |
|||
Constrained random points on a circle |
|||
Continued fraction |
|||
Continued fraction/Arithmetic/Construct from rational number |
|||
Convert decimal number to rational |
|||
Cramer's rule |
|||
Create a file on magnetic tape |
|||
Create an object at a given address |
|||
Cut a rectangle |
|||
DNS query |
|||
Death Star |
|||
Deconvolution/2D+ |
|||
Define a primitive data type |
|||
Delegates |
|||
Determine if only one instance is running |
|||
Digital root/Multiplicative digital root |
|||
Dining philosophers |
|||
Discordian date |
|||
Distributed programming |
|||
Documentation |
|||
Doubly-linked list/Definition |
|||
Doubly-linked list/Element definition |
|||
Doubly-linked list/Element insertion |
|||
Doubly-linked list/Traversal |
|||
Draw a cuboid |
|||
Draw a rotating cube |
|||
Dutch national flag problem |
|||
Eertree |
|||
Egyptian division |
|||
Egyptian fractions |
|||
Element-wise operations |
|||
Elementary cellular automaton |
|||
Enforced immutability |
|||
Equilibrium index |
|||
Events |
|||
Executable library |
|||
Extend your language |
|||
Extensible prime generator |
|||
FASTA format |
|||
FTP |
|||
Factors of a Mersenne number |
|||
Find common directory path |
|||
Find largest left truncatable prime in a given base |
|||
Find palindromic numbers in both binary and ternary bases |
|||
Find the intersection of a line with a plane |
|||
Floyd-Warshall algorithm |
|||
Fractran |
|||
Function frequency |
|||
GUI component interaction |
|||
GUI enabling/disabling of controls |
|||
GUI/Maximum window dimensions |
|||
Galton box animation |
|||
Gaussian elimination |
|||
Go Fish |
|||
Greyscale bars/Display |
|||
HTTPS |
|||
HTTPS/Authenticated |
|||
HTTPS/Client-authenticated |
|||
Handle a signal |
|||
Hash join |
|||
Hello world/Line printer |
|||
Hello world/Web server |
|||
Hickerson series of almost integers |
|||
Hofstadter Figure-Figure sequences |
|||
Hofstadter Q sequence |
|||
Hofstadter-Conway $10,000 sequence |
|||
Honeycombs |
|||
Horizontal sundial calculations |
|||
Host introspection |
|||
Hough transform |
|||
Hunt The Wumpus |
|||
Image convolution |
|||
Image noise |
|||
Inheritance/Single |
|||
Integer overflow |
|||
Inverted index |
|||
Inverted syntax |
|||
Jaro distance |
|||
Joystick position |
|||
Julia set |
|||
K-d tree |
|||
K-means++ clustering |
|||
Keyboard input/Flush the keyboard buffer |
|||
Keyboard input/Keypress check |
|||
Keyboard input/Obtain a Y or N response |
|||
Keyboard macros |
|||
Knapsack problem/0-1 |
|||
Knapsack problem/Bounded |
|||
Knapsack problem/Continuous |
|||
Knuth's algorithm S |
|||
LU decomposition |
|||
Last letter-first letter |
|||
Long multiplication |
|||
Lucas-Lehmer test |
|||
Lucky and even lucky numbers |
|||
Lychrel numbers |
|||
MD5/Implementation |
|||
Machine code |
|||
Mad Libs |
|||
Main step of GOST 28147-89 |
|||
Maze solving |
|||
Median filter |
|||
Memory allocation |
|||
Memory layout of a data structure |
|||
Metered concurrency |
|||
Metronome |
|||
Miller–Rabin primality test |
|||
Minesweeper game |
|||
Modular exponentiation |
|||
Modular inverse |
|||
Mouse position |
|||
Multiple regression |
|||
Multiplicative order |
|||
Narcissist |
|||
Natural sorting |
|||
Nautical bell |
|||
Negative base numbers |
|||
Non-continuous subsequences |
|||
Nonoblock |
|||
Nonogram solver |
|||
Numeric error propagation |
|||
See also [[Reports:Tasks_not_implemented_in_Lua]] |
Latest revision as of 17:18, 10 July 2023
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 |
See Also: |
The Lua (pronounced LOO-ah) programming language is a lightweight, reflective, imperative and procedural language, designed as a scripting language with extensible semantics as a primary goal. The name is derived from the Portuguese word for moon.
Lua is commonly described as a "multi-paradigm" language, providing a small set of general features that can be extended to fit different problem types, rather than providing a more complex and rigid specification to match a single paradigm. Lua, for instance, does not contain explicit support for inheritance, but allows it to be implemented relatively easily with metatables. Similarly, Lua allows programmers to implement namespaces, classes, and other related features using its single table implementation; first class functions allow the employment of many powerful techniques from functional programming; and full lexical scoping allows fine-grained information hiding to enforce the principle of least privilege.
In general, Lua strives to provide flexible meta-features that can be extended as needed, rather than supply a feature-set specific to one programming paradigm. As a result, the base language is light—in fact, the full reference interpreter is only about 150KB compiled—and easily adaptable to a broad range of applications.
Citations
Unimplemented programming tasks
Subcategories
This category has the following 7 subcategories, out of 7 total.
@
- Lua examples needing attention (empty)
- Lua Implementations (empty)
- Lua User (71 P)
I
- IUPLua (3 P)
Pages in category "Lua"
The following 200 pages are in this category, out of 940 total.
(previous page) (next page)A
- A* search algorithm
- A+B
- Abbreviations, automatic
- Abbreviations, easy
- Abbreviations, simple
- ABC problem
- ABC words
- Abelian sandpile model
- Abelian sandpile model/Identity
- Abstract type
- Abundant odd numbers
- Abundant, deficient and perfect number classifications
- Accumulator factory
- Ackermann function
- Active object
- Add a variable to a class instance at runtime
- Addition chains
- Additive primes
- Address of a variable
- AKS test for primes
- Align columns
- Almost prime
- Amb
- Amicable pairs
- Anagrams
- Anagrams/Deranged anagrams
- Angle difference between two bearings
- Angles (geometric), normalization and conversion
- Animate a pendulum
- Animation
- Anonymous recursion
- Anti-primes
- Append a record to the end of a text file
- Append numbers at same position in strings
- Apply a callback to an array
- Apply a digital filter (direct form II transposed)
- Approximate equality
- Arbitrary-precision integers (included)
- Archimedean spiral
- Arena storage pool
- Arithmetic derivative
- Arithmetic evaluation
- Arithmetic numbers
- Arithmetic-geometric mean
- 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
- Audio alarm
- 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
- AVL tree
B
- B-spline
- Babbage problem
- Bacon cipher
- Balanced brackets
- Balanced ternary
- Barnsley fern
- Base64 decode data
- Base64 encode data
- Bell numbers
- Benford's law
- Bernoulli numbers
- Best shuffle
- Bifid cipher
- Bin given limits
- Binary digits
- Binary search
- Binary strings
- Bioinformatics/base count
- Bioinformatics/Sequence mutation
- Biorhythms
- Bitmap
- Bitmap/Bresenham's line algorithm
- Bitmap/Bézier curves/Cubic
- Bitmap/Bézier curves/Quadratic
- Bitmap/Flood fill
- Bitmap/Histogram
- Bitmap/Midpoint circle algorithm
- Bitmap/Read a PPM file
- Bitmap/Read an image through a pipe
- Bitmap/Write a PPM file
- Bitwise IO
- Bitwise operations
- Boolean values
- Box the compass
- Brace expansion
- Brazilian numbers
- Break OO privacy
- Brownian tree
- Bulls and cows
- Bulls and cows/Player
- Burrows–Wheeler transform
C
- Caesar cipher
- Calculating the value of e
- Calendar
- Calendar - for "REAL" programmers
- Call a foreign-language function
- Call a function
- Call a function in a shared library
- Call an object method
- Calmo numbers
- Camel case and snake case
- Canonicalize CIDR
- Cantor set
- Card shuffles
- Carmichael 3 strong pseudoprimes
- Cartesian product of two or more lists
- Case-sensitivity of identifiers
- Casting out nines
- Catalan numbers
- Catalan numbers/Pascal's triangle
- Catamorphism
- Centroid of a set of N-dimensional points
- Chaocipher
- Chaos game
- Character codes
- Chebyshev coefficients
- Check output device is a terminal
- Check that file exists
- Chemical calculator
- Cheryl's birthday
- Chinese remainder theorem
- Chinese zodiac
- Chowla numbers
- Church numerals
- Circles of given radius through two points
- Circular primes
- Cistercian numerals
- Classes
- Closures/Value capture
- Code Golf: Code Golf
- Collections
- Color wheel
- Colour bars/Display
- Colour pinstripe/Display
- Combinations
- Combinations and permutations
- Combinations with repetitions
- Comma quibbling
- Command-line arguments
- Comments
- Compare a list of strings
- Compare length of two strings
- Compile-time calculation
- Compiler/lexical analyzer
- Compound data type
- Concatenate two primes is also prime
- Concurrent computing
- Conditional structures
- Consecutive primes with ascending or descending differences
- Constrained random points on a circle
- Continued fraction
- Convert decimal number to rational
- Convert seconds to compound duration
- Convex hull
- Conway's Game of Life
- Copy a string
- Copy stdin to stdout
- CORDIC
- Count in factors
- Count in octal
- Count occurrences of a substring
- Count the coins
- Cousin primes
- Cramer's rule
- CRC-32
- Create a file
- Create a file on magnetic tape
- Create a two-dimensional array at runtime
- Create an HTML table
- Create an object at a given address
- CSV data manipulation