User:Kevin Reid/Common Lisp tasks: Difference between revisions
Content added Content deleted
m (updates, rename 'To review' to 'To classify') |
m (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 18:16, 3 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 9: | Line 9: | ||
* [[Bit oriented IO]] |
* [[Bit oriented IO]] |
||
* [[Exceptions]] |
* [[Exceptions]] |
||
* [[Iterating over an Associative Array]] |
|||
* [[Special characters]] |
* [[Special characters]] |
||
* [[Variables]] |
* [[Variables]] |
||
| Line 22: | Line 21: | ||
==Algorithms== |
==Algorithms== |
||
* [[Bubble Sort]] |
|||
* [[Cocktail Sort]] |
* [[Cocktail Sort]] |
||
* [[Combinations]] |
* [[Combinations]] |
||
| Line 30: | Line 28: | ||
* [[Heapsort]] |
* [[Heapsort]] |
||
* [[Huffman codes]] |
* [[Huffman codes]] |
||
* [[Knuth shuffle]] |
|||
* [[LZW compression]] |
* [[LZW compression]] |
||
* [[Permutation Sort]] |
* [[Permutation Sort]] |
||
| Line 104: | Line 101: | ||
* [[Abstract type]] |
* [[Abstract type]] |
||
* [[Adding variables to a class instance at runtime]] |
* [[Adding variables to a class instance at runtime]] |
||
* [[Delegate]] |
|||
* [[Polymorphic copy]] |
* [[Polymorphic copy]] |
||
* [[Unknown Method]] |
* [[Unknown Method]] |
||
| Line 206: | Line 202: | ||
* [[DOM XML Serialization]] |
* [[DOM XML Serialization]] |
||
* [[XML Creation]] |
* [[XML Creation]] |
||
* [[XML Reading]] |
|||
* [[XML and XPath]] |
* [[XML and XPath]] |
||
===Calendar=== |
===Calendar=== |
||
Revision as of 19:08, 3 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 18:16, 3 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
- Collections
- Doubly-Linked List
- Doubly-Linked List (element insertion)
- Doubly-Linked List (element)
- FIFO (usage)
- Singly-Linked List (element insertion)
Algorithms
- Cocktail Sort
- Combinations
- Counting sort
- Ethiopian Multiplication
- Gnome sort
- Heapsort
- Huffman codes
- LZW compression
- Permutation Sort
- Point in polygon (ray casting algorithm)
- Selection sort
- Shell sort
Algorithmic problems
- Closest pair problem
- Knapsack Problem
- Longest Common Subsequence
- Maximum subsequence
- Median
- Non Continuous Subsequences
- Probabilistic Choice
- Pyramid of numbers
- Spiral
- Sudoku Solver
- Top Rank Per Group
- Topological (dependency) sort
Miscellaneous programs
- Anagrams
- Arithmetic Evaluator
- Conway's Game of Life
- Look-and-say sequence
- 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
- Nth root algorithm
- 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
- Simple concurrent actions
- 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
- Environment variables
- 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
- Client-Authenticated HTTPS Request
- HTTPS Request
- HTTPS request with authentication
- Search Yahoo
- Web Scraping
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.