Reports:Tasks not implemented in Common Lisp
From Rosetta Code
Awareness
If Common Lisp is a language you like, or are interested in, please inform your fellow members of the Common Lisp community; this page can't be emptied without your and their participation.
If Common Lisp is a language you like, or are interested in, please inform your fellow members of the Common Lisp community; this page can't be emptied without your and their participation.
Contents
Not implemented[edit]
These are currently not implemented in Common Lisp. Please implement some if you can. If any tasks are not possible or too complex in Common Lisp, they should not be on this list. To mark a task as such, add {{omit from|Common Lisp}}, preserving the capitalization of the language, to that task. It will appear below under the "Not Considered" section.
A
B
- Babbage problem
- Barnsley fern
- Bitcoin/address validation
- Bitcoin/public point to address
- Bitmap/Bézier curves/Cubic
- Bitmap/Bézier curves/Quadratic
- Bitmap/Flood fill
- Bitmap/Histogram
- Bitmap/PPM conversion through a pipe
- Bitmap/Read an image through a pipe
- Bitwise IO
- Box the compass
- Brace expansion
- Brownian tree
C
- Call an object method
- Canny edge detector
- Carmichael 3 strong pseudoprimes
- Catalan numbers/Pascal's triangle
- Catmull–Clark subdivision surface
- Chaos game
- Chat server
- Check Machin-like formulas
- Checkpoint synchronization
- Circles of given radius through two points
- Color quantization
- Colour bars/Display
- Colour pinstripe/Printer
- Combinations and permutations
- Combinations with repetitions
- Compare sorting algorithms' performance
- Convert seconds to compound duration
- Cramer's rule
- Create a file on magnetic tape
- Create an object at a given address
D
E
F
- FASTA format
- Fibonacci word/fractal
- Find common directory path
- Find largest left truncatable prime in a given base
- Find palindromic numbers in both binary and ternary bases
- Find the last Sunday of each month
- First class environments
- Flipping bits game
- Flow-control structures
- Floyd-Warshall algorithm
- Four bit adder
G
H
K
M
- MD5/Implementation
- Mad Libs
- Magic squares of doubly even order
- Magic squares of singly even order
- Main step of GOST 28147-89
- Mandelbrot set
- Matrix arithmetic
- Maze solving
- Median filter
- Memory layout of a data structure
- Metered concurrency
- Morse code
- Mouse position
- Multiplicative order
- Multisplit
- Munching squares
N
P
- Paraffins
- Parametrized SQL statement
- Parse an IP Address
- Pascal's triangle/Puzzle
- Password generator
- Pathological floating point problems
- Penney's game
- Pentagram
- Percolation/Bond percolation
- Percolation/Mean cluster density
- Percolation/Mean run density
- Percolation/Site percolation
- Perfect shuffle
- Permutations/Derangements
- Permutations/Rank of a permutation
- Permutations by swapping
- Phrase reversals
- Pinstripe/Display
- Pinstripe/Printer
- Play recorded sounds
- Plot coordinate pairs
- Price fraction
- Primes - allocate descendants to their ancestors
- Primorial numbers
- Problem of Apollonius
- Pythagoras tree
R
- Random number generator (device)
- Random number generator (included)
- Ranking methods
- Reflection/Get source
- Reflection/List methods
- Reflection/List properties
- Rendezvous
- Resistor mesh
- Rock-paper-scissors
- Rosetta Code/Count examples
- Rosetta Code/Find bare lang tags
- Rosetta Code/Find unimplemented tasks
- Rosetta Code/Fix code tags
- Rosetta Code/Rank languages by popularity
S
- SOAP
- SQL-based authentication
- Safe addition
- Sailors, coconuts and a monkey problem
- Same Fringe
- Scope/Function names and labels
- Search a list of records
- Secure temporary file
- Send email
- Set of real numbers
- Set puzzle
- Sierpinski pentagon
- Sierpinski triangle/Graphical
- Simulate input/Keyboard
- Sokoban
- Solve a Hidato puzzle
- Solve a Holy Knight's tour
- Solve a Hopido puzzle
- Solve a Numbrix puzzle
- Solve the no connection puzzle
- Sorting algorithms/Comb sort
- Sorting algorithms/Radix sort
- Sorting algorithms/Stooge sort
- Sparkline in unicode
- Special characters
- Speech synthesis
- Stable marriage problem
- Start from a main routine
- State name puzzle
- Statistics/Basic
- Statistics/Normal distribution
- Stem-and-leaf plot
- Stern-Brocot sequence
- Stream Merge
- Strip block comments
- Subleq
- Sum and Product Puzzle
- Superellipse
- Sutherland-Hodgman polygon clipping
T
- Table creation/Postal addresses
- Take notes on the command line
- Terminal control/Coloured text
- Terminal control/Cursor movement
- Terminal control/Cursor positioning
- Terminal control/Dimensions
- Terminal control/Inverse video
- Terminal control/Positional read
- Test a function
- Test integerness
- Text processing/2
- Textonyms
- Thue-Morse
- Tokenize a string with escaping
- Topic variable
- Topswops
- Total circles area
- Truncate a file
- Truth table
U
V
Draft tasks without implementation[edit]
These tasks as drafts, meaning they largely need more work to turn them into full tasks. Perhaps you can help by trying to implement them in Common Lisp (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
- Card shuffles
- Chebyshev coefficients
- Chess player
- Chess player/Move generation
- Chess player/Program options and user interface
- Chess player/Search and evaluation
- Cipolla's algorithm
- Code segment unload
- Color wheel
- Combinations with repetitions/Square Digit Chain
- Commatizing numbers
- Compiler/lexical analyzer
- Compiler/syntax analyzer
- Continued fraction/Arithmetic/G(matrix NG, Contined Fraction N)
- Continued fraction/Arithmetic/G(matrix NG, Contined Fraction N1, Contined Fraction N2)
- Convex hull
- Create an object/Native demonstration
- Currency
- Cycle detection
D
E
F
G
I
- I.Q. Puzzle
- IPC via named pipe
- IRC gateway
- Idiomatically determine all the characters that can be used for symbols
- Idiomatically determine all the lowercase and uppercase letters
- Implicit type conversion
- Index finite lists of positive integers
- Input/Output for Lines of Text
- Input/Output for Pairs of Numbers
- Integer roots
L
M
O
P
R
- Railway circuit
- Ramsey's theorem
- Readline interface
- Recursive descent parser generator
- Reflection/List methods
- Remote agent/Agent interface
- Remote agent/Agent logic
- Remote agent/Simulation
- Reverse the gender of a string
- Robots
- Rosetta Code/List authors of task descriptions
- Rosetta Code/Run examples
- Rosetta Code/Tasks sorted by average lines of code
- Run as a daemon or service
S
- Sattolo cycle
- Selective File Copy
- Self-hosting compiler
- Separate the house number from the street name
- Sequence of primorial primes
- Shortest common supersequence
- Simulated annealing
- Smith numbers
- Snake
- Solving coin problems
- Sort a list of object identifiers
- Sorting Algorithms/Circle Sort
- Sorting algorithms/Cycle sort
- Sorting algorithms/Patience sort
- Sorting algorithms/Tree sort on a linked list
- Starting a web browser
- Straddling checkerboard
- Subset sum problem
- Substitution Cipher
- Suffix tree
- Superpermutation minimisation
T
- Table creation
- Tamagotchi emulator
- Tasks without examples
- Taxicab numbers
- Terminal control/Restricted width positional input/No wrapping
- Terminal control/Restricted width positional input/With wrapping
- Tetris
- Text to HTML
- Time-based One-time Password Algorithm
- Tonelli-Shanks algorithm
- Topological sort/Extracted top item
- Transportation problem
- Type detection
U
Requiring Attention[edit]
Examples[edit]
These tasks have implementations in Common Lisp, 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 Common Lisp 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 Common Lisp was inappropriate for these tasks, or implementations of them would be unenlightening. Feel free to try your hand at them anyway.
No pages found.
End of List[edit]
Again, feel free to try your hand at any of the tasks listed on this page.
