Reports:Tasks not implemented in Lua
From Rosetta Code
Awareness
If Lua is a language you like, or are interested in, please inform your fellow members of the Lua community; this page can't be emptied without your and their participation.
If Lua is a language you like, or are interested in, please inform your fellow members of the Lua community; this page can't be emptied without your and their participation.
Contents
Not implemented[edit]
These are currently not implemented in Lua. Please implement some if you can. If any tasks are not possible or too complex in Lua, they should not be on this list. To mark a task as such, add {{omit from|Lua}}, preserving the capitalization of the language, to that task. It will appear below under the "Not Considered" section.
A
B
- Bin given limits
- Bioinformatics/Sequence mutation
- Bioinformatics/base count
- Biorhythms
- Bitcoin/address validation
- Bitcoin/public point to address
- Bitmap/Bézier curves/Cubic
- Bitmap/Bézier curves/Quadratic
- Bitmap/PPM conversion through a pipe
- Bitwise IO
- Brace expansion
- Break OO privacy
- Bulls and cows/Player
C
- Calkin-Wilf sequence
- Canny edge detector
- Canonicalize CIDR
- Catmull–Clark subdivision surface
- Chat server
- Check Machin-like formulas
- Check input device is a terminal
- Checkpoint synchronization
- Chernick's Carmichael numbers
- Cholesky decomposition
- Closest-pair problem
- Color of a screen pixel
- Color quantization
- Color wheel
- 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/syntax analyzer
- Compiler/virtual machine interpreter
- Conjugate transpose
- Continued fraction/Arithmetic/Construct from rational number
- Create an object at a given address
- Currency
- Cyclotomic polynomial
D
E
- EKG sequence convergence
- Eertree
- Egyptian fractions
- Element-wise operations
- Elementary cellular automaton/Infinite length
- Elementary cellular automaton/Random Number Generator
- Elliptic Curve Digital Signature Algorithm
- Elliptic curve arithmetic
- Equilibrium index
- Events
- Exponentiation with infix operators in (or operating on) the base
F
- FTP
- Faces from a mesh
- Factorial base numbers indexing permutations of a collection
- Factorions
- Factors of a Mersenne number
- Fermat numbers
- File size distribution
- Find common directory path
- Find duplicate files
- Find largest left truncatable prime in a given base
- Find palindromic numbers in both binary and ternary bases
- First perfect square in base n with n unique digits
- First power of 2 that has leading decimal digits of 12
- Four is the number of letters in the ...
- French Republican calendar
- Function frequency
G
H
I
- Idiomatically determine all the characters that can be used for symbols
- Image convolution
- Image noise
- Imaginary base numbers
- Increasing gaps between consecutive Niven numbers
- Index finite lists of positive integers
- Inheritance/Single
- Integer overflow
- Intersecting number wheels
- Inverted index
- Inverted syntax
K
L
- LU decomposition
- Lah numbers
- Largest proper divisor of n
- Latin Squares in reduced form
- Latin Squares in reduced form/Randomizing using Jacobson and Matthews’ Technique
- Legendre prime counting function
- Levenshtein distance/Alignment
- Long multiplication
- Long primes
- Long year
- Longest common substring
- Loops/With multiple ranges
- Loops/Wrong ranges
- Lucas-Lehmer test
- Lucky and even lucky numbers
- Lychrel numbers
M
- Mad Libs
- Main step of GOST 28147-89
- Matrix digital rain
- Mayan numerals
- Maze solving
- Median filter
- Memory allocation
- Memory layout of a data structure
- Merge and aggregate datasets
- Mertens function
- Metallic ratios
- Metered concurrency
- Metronome
- Mian-Chowla sequence
- Miller–Rabin primality test
- Mind boggling card trick
- Minesweeper game
- Minimal steps down to 1
- Minkowski question-mark function
- Modified random distribution
- Modular exponentiation
- Modular inverse
- Monads/List monad
- Monads/Writer monad
- Mouse position
- Multiple regression
- Multiplicative order
- Musical scale
- Mutex
N
O
P
- P-Adic numbers, basic
- P-Adic square roots
- P-value correction
- Padovan n-step number sequences
- Padovan sequence
- Palindrome dates
- Palindromic gapful numbers
- Pancake numbers
- Paraffins
- Parallel brute force
- Parallel calculations
- Parametric polymorphism
- Parametrized SQL statement
- Parse an IP Address
- Partition an integer x into n primes
- Partition function P
- Pascal's triangle/Puzzle
- Pathological floating point problems
- Pattern matching
- Peaceful chess queen armies
- Pell's equation
- Pentagram
- Percolation/Bond percolation
- Percolation/Mean cluster density
- Percolation/Mean run density
- Percolation/Site percolation
- Perfect totient numbers
- Perlin noise
- Permutation test
- Permutations/Rank of a permutation
- Pig the dice game/Player
- Pinstripe/Printer
- Pisano period
- Play recorded sounds
- Playfair cipher
- Polymorphic copy
- Polynomial long division
- Pragmatic directives
- Primality by Wilson's theorem
- Primes - allocate descendants to their ancestors
- Primorial numbers
- Problem of Apollonius
- Pseudo-random numbers/Combined recursive generator MRG32k3a
- Pythagoras tree
- Pythagorean triples
R
- RCRPG
- RPG attributes generator
- RSA code
- Ramanujan's constant
- Ramer-Douglas-Peucker line simplification
- Random Latin squares
- Random number generator (device)
- Random sentence from book
- Range consolidation
- Ranking methods
- Rare numbers
- Rate counter
- Ray-casting algorithm
- Record sound
- Rendezvous
- Rep-string
- Resistor mesh
- Retrieve and search chat history
- Rosetta Code/Count examples
- Rosetta Code/Find bare lang tags
- Rosetta Code/Rank languages by number of users
- Rosetta Code/Rank languages by popularity
- Runge-Kutta method
S
- SEDOLs
- SHA-256 Merkle tree
- SOAP
- SQL-based authentication
- Safe addition
- Self numbers
- Sequence: nth number with exactly n divisors
- Sequence: smallest number greater than previous term with exactly n divisors
- Sequence: smallest number with exactly n divisors
- Sequence of primorial primes
- Set consolidation
- Set puzzle
- Shortest common supersequence
- Simple database
- Simulate input/Keyboard
- Simulate input/Mouse
- Singleton
- Singly-linked list/Element definition
- Singly-linked list/Element insertion
- Singly-linked list/Traversal
- Sleeping Beauty problem
- Sokoban
- Solve a Hidato puzzle
- Solve a Hopido puzzle
- Solve a Numbrix puzzle
- Solve the no connection puzzle
- Sort an outline at every level
- Sorting algorithms/Cocktail sort with shifting bounds
- Sorting algorithms/Heapsort
- Sorting algorithms/Patience sort
- Sorting algorithms/Radix sort
- Sorting algorithms/Strand sort
- Sparkline in unicode
- Speech synthesis
- Spelling of ordinal numbers
- Square Form Factorization
- Start from a main routine
- State name puzzle
- Stirling numbers of the first kind
- Stirling numbers of the second kind
- Strassen's algorithm
- Stream merge
- Successive prime differences
- Suffixation of decimal numbers
- Sunflower fractal
- Superellipse
- Superpermutation minimisation
T
- Tarjan
- Teacup rim text
- Terminal control/Cursor movement
- Terminal control/Cursor positioning
- Terminal control/Dimensions
- Terminal control/Hiding the cursor
- Terminal control/Inverse video
- Terminal control/Positional read
- Terminal control/Preserve screen
- Terminal control/Unicode output
- Ternary logic
- The ISAAC Cipher
- Thiele's interpolation formula
- Tonelli-Shanks algorithm
- Topic variable
- Topological sort
- Total circles area
- Tree datastructures
- Tree from nesting levels
- Truth table
- Twelve statements
U
V
Draft tasks without implementation[edit]
These tasks are drafts, meaning they largely need more work to turn them into full tasks. Perhaps you can help by trying to implement them in Lua (after all, one of the key requirements for a task being non-draft is multiple implementations, preferably in widely different languages) but be aware that this may be difficult because of lack of definition of the task itself.
A
B
C
- CLI-based maze-game
- Change e letters to i in words
- Changeable words
- Checksumcolor
- Chess player
- Cipolla's algorithm
- Code segment unload
- Combinations with repetitions/Square digit chain
- Common list elements
- Common sorted list
- Compiler/Simple file inclusion pre processor
- Compiler/Verifying syntax
- Concatenate two primes is also prime
- Consecutive Primes With Ascending Or Descending Differences
- Continued fraction/Arithmetic/G(matrix ng, continued fraction n)
- Continued fraction/Arithmetic/G(matrix ng, continued fraction n1, continued fraction n2)
- Coprime triplets
- Coprimes
- Count how many vowels and consonants occur in a string
- Count the coins/0-1
- Cousin primes
- Create an object/Native demonstration
- Cubic Special Primes
- Curve that touches three points
- Cyclops numbers
D
- Data Encryption Standard
- Decimal floating point number to binary
- Discrete Fourier transform
- Display the order of the lines of a file in reversed order
- Distinct Palindromes Within Decimal Numbers
- Distribution of 0 Digits in Factorial Series
- Doomsday rule
- Doubly-linked list/Element removal
- Draw pixel 2
F
- Fibonacci heap
- Fibonacci matrix-exponentiation
- Find URI in text
- Find first and last set bit of a long integer
- Find first missing positive
- Find prime n for that reversed n is also prime
- Find prime numbers of the form n*n*n+2
- Find words which contains all the vowels
- Find words which contains more than 3 e vowels
- Find words which contains most consonants
- Find words which first and last three letters are equals
- Find words with alternating vowels and consonants
- Finite state machine
- Fortunate numbers
- Free polyominoes enumeration
- Frobenius numbers
G
L
M
- Magnanimous numbers
- Make a backup file
- Maximum difference between adjacent elements of list
- Mayan calendar
- Mine a bitcoin
- Minimum number of cells after, before, above and below NxN squares
- Montgomery reduction
- Morpion solitaire
- Most frequent k chars distance
- Multi-base primes
- Multidimensional Newton-Raphson method
- Multiline shebang
N
- N-body problem
- NYSIIS
- Names to numbers
- Native shebang
- Neighbour primes
- Next special primes
- Numbers divisible by their individual digits, but not by the product of their digits.
- Numbers in base-16 representation that cannot be written with decimal digits
- Numbers in base 10 that are palindromic in bases 2, 4, and 16
- Numbers n in which number 1 occur twice
- Numbers which binary and ternary digit sum are prime
- Numbers which count of divisors is prime
- Numbers with equal rises and falls
- Numbers with same digit set in base 10 and base 16
- Numeric separator syntax
- Numerical integration/Adaptive Simpson's method
P
- Palindromic primes
- Palindromic primes in base 16
- Parse EBNF
- Parse command-line arguments
- Particle swarm optimization
- Penrose tiling
- Pentomino tiling
- Permutations with repetitions
- Permutations with some identical elements
- Piprimes
- Polynomial synthetic division
- Powerful numbers
- Practical numbers
- Price list behind API
- Prime numbers p which sum of prime numbers less or equal to p is prime
- Prime numbers which contain 123
- Prime triplets
- Prime words
- Primes which contain only one odd number
- Primes which sum of digits is 25
- Primes whose first and last number is 3
- Primes with digits in nondecreasing order
- Print debugging statement
- Print itself
- Process SMIL directives in XML data
- Product of divisors
- Proof
- Pseudo-random numbers/Splitmix64
- Pseudorandom number generator image
R
- Railway circuit
- Ramsey's theorem
- Range modifications
- Raster bars
- Readline interface
- Recursive descent parser generator
- Remote agent/Agent interface
- Remote agent/Agent logic
- Remote agent/Simulation
- Resistance calculator
- Resistance network calculator
- Reverse the gender of a string
- Robots
- Rosetta Code/List authors of task descriptions
- Rosetta Code/Run examples
- Rosetta Code/Tasks without examples
- Run as a daemon or service
S
- Safe mode
- Selective file copy
- Self-hosting compiler
- Separate the house number from the street name
- Shift list elements to left by 3
- Show the (decimal) value of a number of 1s appended with a 3, then squared
- Sierpinski arrowhead curve
- Sierpinski curve
- Sierpinski square curve
- Simple turtle graphics
- Simulated annealing
- Sine wave
- Singly-linked list/Element removal
- Smallest enclosing circle problem
- Smallest numbers
- Smallest power of 6 whose decimal expansion contains n
- Smallest square that begins with n
- Snake
- Solve a Rubik's Cube
- Solve triangle solitare puzzle
- Solving coin problems
- Sort the letters of string in alphabetical order
- Sorting algorithms/Tree sort on a linked list
- Special Divisors
- Spoof game
- Square root by hand
- Starting a web browser
- Strange numbers
- Strange plus numbers
- Strange unique prime triplets
- Subset sum problem
- Substring primes
- Suffix tree
- Sum data type
- Sum of divisors
- Sum of elements below main diagonal of matrix
- Sum of first n cubes
- Sum of the digits of n is substring of n
- Summarize primes
- Sylvester's sequence
T
- Tamagotchi emulator
- Terminal control/Restricted width positional input/No wrapping
- Terminal control/Restricted width positional input/With wrapping
- Tetris
- Text between
- Text completion
- Text to HTML
- Time-based one-time password algorithm
- Topological sort/Extracted top item
- Transportation problem
- Triplet of three numbers
- Twin primes
- Two bullet roulette
- Two identical strings
U
W
Requiring Attention[edit]
Examples[edit]
These tasks have implementations in Lua, but somebody, somewhere, decided that the example implementation was faulty or in some other way requiring attention. If you're familiar with the task and language, please consider reviewing/correcting the example and removing the notice.
Other pages[edit]
These are other pages related to Lua which require attention; with your knowledge and assistance, we can improve the quality of the site's content.
No pages found.
Not Considered[edit]
These tasks are not generally counted toward "unimplemented", as somebody, somewhere, decided that Lua was inappropriate for these tasks, or implementations of them would be unenlightening. Feel free to try your hand at them anyway.
End of List[edit]
Again, feel free to try your hand at any of the tasks listed on this page.
