User:Kevin Reid/Common Lisp tasks: Difference between revisions
Content added Content deleted
m (updates) |
(updates) |
||
| Line 1: | Line 1: | ||
This is [[User:Kevin Reid|Kevin Reid]]'s classification of [[tasks not implemented in Common Lisp]], or just poorly done in CL, by what kind of problem they are. |
This is [[User:Kevin Reid|Kevin Reid]]'s classification of [[tasks not implemented in Common Lisp]], or just poorly done in CL, by what kind of problem they are. |
||
As of |
As of 06:15, 5 August 2009. When updating this list, consult [http://rosettacode.org/mw/index.php?title=Template:Unimp_body_Common_Lisp&action=history the diffs] since then for what to add/remove. |
||
<div style="-webkit-column-count: 3"> |
<div style="-webkit-column-count: 3"> |
||
| Line 14: | Line 14: | ||
===Data structures=== |
===Data structures=== |
||
* [[Collections]] |
* [[Collections]] |
||
* [[Doubly-Linked List]] |
|||
* [[Doubly-Linked List (element insertion)]] |
* [[Doubly-Linked List (element insertion)]] |
||
* [[Doubly-Linked List (element)]] |
* [[Doubly-Linked List (element)]] |
||
* [[FIFO (usage)]] |
* [[FIFO (usage)]] |
||
* [[Singly-Linked List (element insertion)]] |
|||
==Algorithms== |
==Algorithms== |
||
| Line 24: | Line 22: | ||
* [[Combinations]] |
* [[Combinations]] |
||
* [[Counting sort]] |
* [[Counting sort]] |
||
* [[Ethiopian Multiplication]] |
|||
* [[Gnome sort]] |
* [[Gnome sort]] |
||
* [[Heapsort]] |
|||
* [[Huffman codes]] |
* [[Huffman codes]] |
||
* [[LZW compression]] |
* [[LZW compression]] |
||
| Line 37: | Line 33: | ||
* [[Closest pair problem]] |
* [[Closest pair problem]] |
||
* [[Knapsack Problem]] |
* [[Knapsack Problem]] |
||
* [[Longest Common Subsequence]] |
|||
* [[Maximum subsequence]] |
* [[Maximum subsequence]] |
||
* [[Median]] |
* [[Median]] |
||
| Line 49: | Line 44: | ||
==Miscellaneous programs== |
==Miscellaneous programs== |
||
* [[Anagrams]] |
|||
* [[Arithmetic Evaluator]] |
* [[Arithmetic Evaluator]] |
||
* [[Conway's Game of Life]] |
* [[Conway's Game of Life]] |
||
* [[Look-and-say sequence]] |
|||
* [[Monty Hall simulation]] |
* [[Monty Hall simulation]] |
||
* [[One dimensional cellular automata]] |
* [[One dimensional cellular automata]] |
||
| Line 76: | Line 69: | ||
* [[Gamma function]] |
* [[Gamma function]] |
||
* [[Multiple Regression]] |
* [[Multiple Regression]] |
||
* [[Nth root algorithm]] |
|||
* [[Numerical Integration]] |
* [[Numerical Integration]] |
||
* [[Polynomial Fitting]] |
* [[Polynomial Fitting]] |
||
| Line 91: | Line 83: | ||
* [[Mutex]] |
* [[Mutex]] |
||
* [[Rendezvous]] |
* [[Rendezvous]] |
||
* [[Simple concurrent actions]] |
|||
* [[Synchronous Concurrency]] |
* [[Synchronous Concurrency]] |
||
| Line 99: | Line 90: | ||
==Object-oriented== |
==Object-oriented== |
||
* [[Abstract type]] |
|||
* [[Adding variables to a class instance at runtime]] |
* [[Adding variables to a class instance at runtime]] |
||
* [[Polymorphic copy]] |
* [[Polymorphic copy]] |
||
* [[Unknown Method]] |
|||
==Text-bashing== |
==Text-bashing== |
||
| Line 133: | Line 122: | ||
* [[Creating a Secure Temporary File]] |
* [[Creating a Secure Temporary File]] |
||
* [[Determine if Only One Instance is Running]] |
* [[Determine if Only One Instance is Running]] |
||
* [[Environment variables]] |
|||
* [[Execute a System Command]] |
* [[Execute a System Command]] |
||
* [[Fork Process]] |
* [[Fork Process]] |
||
| Line 184: | Line 172: | ||
* [[Pattern Matching]] |
* [[Pattern Matching]] |
||
* [[Play recorded sounds]] |
* [[Play recorded sounds]] |
||
* [[Regular expression matching]] |
|||
===HTTP client=== |
===HTTP client=== |
||
* [[Client-Authenticated HTTPS Request]] |
* [[Client-Authenticated HTTPS Request]] |
||
* [[HTTPS Request]] |
|||
* [[HTTPS request with authentication]] |
* [[HTTPS request with authentication]] |
||
* [[Search Yahoo]] |
* [[Search Yahoo]] |
||
| Line 200: | Line 186: | ||
* [[Creating a SOAP Client]] |
* [[Creating a SOAP Client]] |
||
===XML=== |
===XML=== |
||
* [[DOM XML Serialization]] |
|||
* [[XML Creation]] |
* [[XML Creation]] |
||
* [[XML and XPath]] |
* [[XML and XPath]] |
||
Revision as of 15:58, 5 August 2009
This is Kevin Reid's classification of tasks not implemented in Common Lisp, or just poorly done in CL, by what kind of problem they are.
As of 06:15, 5 August 2009. When updating this list, consult the diffs since then for what to add/remove.
Basic language features
- Binary string manipulation functions
- Bit oriented IO
- Exceptions
- Special characters
- Variables
- Y combinator
Data structures
Algorithms
- Cocktail Sort
- Combinations
- Counting sort
- Gnome sort
- Huffman codes
- LZW compression
- Permutation Sort
- Point in polygon (ray casting algorithm)
- Selection sort
- Shell sort
Algorithmic problems
- Closest pair problem
- Knapsack Problem
- Maximum subsequence
- Median
- Non Continuous Subsequences
- Probabilistic Choice
- Pyramid of numbers
- Spiral
- Sudoku Solver
- Top Rank Per Group
- Topological (dependency) sort
Miscellaneous programs
- Arithmetic Evaluator
- Conway's Game of Life
- Monty Hall simulation
- One dimensional cellular automata
- RCHQ9+
- RCSNUSP
- SEDOL
Mathematics
Matrices
Integers
- Long Multiplication
- Lucas-Lehmer test
- Miller-Rabin test
- Multiplicative order
- Trial factoring of a Mersenne number
Numerics
- Infinity
- Gamma function
- Multiple Regression
- Numerical Integration
- Polynomial Fitting
- Quadratic Equation
- Roots of a function
- Sequence of Non-squares
Concurrency/events
- Active object
- Atomic updates
- Dining philosophers
- Event
- Metered Concurrency
- Mutex
- Rendezvous
- Synchronous Concurrency
Type system
Object-oriented
Text-bashing
File access
FFI/low-level
- Address Operations
- Allocator
- Basic pointer and reference operations
- Call function in shared library
- Data Representation - Controlling Fields in a Structure
- Data Representation - Getting the Size
- Data Representation - Specifying Minimum Size
- Host Introspection
- Machine Address
- Memory Allocation
Debugging
OS interfaces
- Creating a Secure Temporary File
- Determine if Only One Instance is Running
- Execute a System Command
- Fork Process
- Interrupts
- Program Termination
Sockets
Windows
GUI
- Creating a Window
- Get mouse position
- Keyboard macros
- Simple Windowed Application
- User Input - graphical
- Window management
Reflective
Control flow
Graphics
The image-type tasks
- Bresenham's line algorithm
- Cubic bezier curves
- Flood fill
- Grayscale image
- Image convolution
- Image histogram
- Median filter
- Midpoint circle algorithm
- PPM conversion through a pipe
- Percentage of difference between 2 images
- Quadratic bezier curves
- Read image file through a pipe
- Read ppm file
- Xiaolin Wu's line algorithm
Use a library
HTTP client
Database
SMTP
SOAP
XML
Calendar
OpenGL
Testing
Miscellaneous other
- BNF Grammar
- Evens Sum To Even
- Measure relative performance of sorting algorithms implementations
- Object Serialization
Rosetta Code reflection
To improve
- Basic bitmap storage#Common Lisp - review for efficiency (inlining?), necessity of type declarations, idiom
To classify
Insert new tasks here.