User:Kevin Reid/Common Lisp tasks: Difference between revisions
Content added Content deleted
(moved numerical integration to completed) |
(reviewed) |
||
| Line 12: | Line 12: | ||
* [[Binary string manipulation functions]] |
* [[Binary string manipulation functions]] |
||
* [[Bit oriented IO]] |
* [[Bit oriented IO]] |
||
* [[First-class Numbers]] — While implemented, it does not parallel the function example as intended. |
|||
* [[Special characters]] |
* [[Special characters]] |
||
* [[Variables]] |
* [[Variables]] |
||
| Line 151: | Line 152: | ||
==To improve== |
==To improve== |
||
| ⚫ | |||
* [[Adding variables to a class instance at runtime#Common Lisp]] — This should be a per-*instance* change. Use the MOP to generate a subclass and change-class to it. |
* [[Adding variables to a class instance at runtime#Common Lisp]] — This should be a per-*instance* change. Use the MOP to generate a subclass and change-class to it. |
||
* [[Amb]] — Show the continuation version as well (use arnesi?). |
|||
* [[Arithmetic Evaluator#Common Lisp]] — I think there could be some simplification by changing to a prefix AST and using the CL operator names (use symbol-function, not eval). |
* [[Arithmetic Evaluator#Common Lisp]] — I think there could be some simplification by changing to a prefix AST and using the CL operator names (use symbol-function, not eval). |
||
| ⚫ | |||
* [[Basic Animation]] and [[Pendulum Animation]] — Investigate using CLIM. |
* [[Basic Animation]] and [[Pendulum Animation]] — Investigate using CLIM. |
||
| ⚫ | |||
* [[Closest pair problem#Common Lisp]] — Try using complex numbers instead of conses. |
|||
* [[Collections]] — Add some discussion of the characteristics, and include vectors. |
|||
* [[Object Serialization]] — Show other techniques, particularly print/read. |
|||
| ⚫ | |||
* [[Simple Windowed Application]] — Should be reviewed for niceness by a CLIM expert. |
* [[Simple Windowed Application]] — Should be reviewed for niceness by a CLIM expert. |
||
==Completed== |
==Completed== |
||
* [[Amb]] |
|||
* [[Call function in shared library]] |
|||
* [[Closest pair problem]] |
|||
* [[Collections]] |
|||
* [[Dining philosophers]] |
|||
* [[File Modification Time]] |
|||
* [[First-class Numbers]] |
|||
* [[Formal Power Series]] |
|||
* [[Huffman codes]] |
|||
* [[Knapsack Problem]] |
|||
* [[Long Multiplication]] |
|||
* [[Max Licenses In Use]] |
|||
* [[Numerical Integration]] |
|||
* [[Object Serialization]] |
|||
* [[Point in polygon (ray casting algorithm)]] |
|||
* [[Polynomial long division]] |
|||
* [[Seven-dice from Five-dice]] |
|||
* [[Simple Random Distribution Checker]] |
|||
* [[Sockets]] |
|||
* [[Spiral]] |
|||
* [[Standard Deviation]] |
|||
* [[Sudoku Solver]] |
|||
* [[Synchronous Concurrency]] |
|||
* [[Top Rank Per Group]] |
|||
* [[Topological (dependency) sort]] |
|||
==To classify== |
==To classify== |
||
Revision as of 22:05, 21 August 2009
This is Kevin Reid's personal classification of tasks not implemented in Common Lisp, or just poorly done in CL, by what kind of problem they are.
If you wish to help update this list, please do only these:
- Add new tasks to #To classify.
- Move completed tasks to #Completed; I will review them.
As of 18:19, 12 August 2009. When updating this list, consult the main unimp list's diffs since then for what to add/move.
Basic language features
- Binary string manipulation functions
- Bit oriented IO
- First-class Numbers — While implemented, it does not parallel the function example as intended.
- Special characters
- Variables
Data structures
Algorithmic problems
Miscellaneous programs
Mathematics
Matrices
Integers
Numerics
- Gamma function
- Multiple Regression
- Polynomial Fitting
- Quadratic Equation
- Roots of a function
- Safe addition
- Sequence of Non-squares
- Verify Distribution Uniformity with Chi-Squared Test
Concurrency/events
Type system
Object-oriented
Text-bashing
File access
FFI/low-level
- Address Operations
- Allocator
- Basic pointer and reference operations
- C FFI
- Call function from foreign language
- Data Representation - Controlling Fields in a Structure
- Data Representation - Specifying Minimum Size
- Host Introspection
- Machine Address
OS interfaces
- Creating a Secure Temporary File
- Determine if Only One Instance is Running
- Interrupts
- Program Termination
Sockets
Windows
GUI
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
- PPM conversion through a pipe
- 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
Rosetta Code reflection
To improve
- Adding variables to a class instance at runtime#Common Lisp — This should be a per-*instance* change. Use the MOP to generate a subclass and change-class to it.
- Amb — Show the continuation version as well (use arnesi?).
- Arithmetic Evaluator#Common Lisp — I think there could be some simplification by changing to a prefix AST and using the CL operator names (use symbol-function, not eval).
- Basic Animation and Pendulum Animation — Investigate using CLIM.
- Basic bitmap storage#Common Lisp — review for efficiency (inlining?), necessity of type declarations, idiom
- Closest pair problem#Common Lisp — Try using complex numbers instead of conses.
- Collections — Add some discussion of the characteristics, and include vectors.
- Object Serialization — Show other techniques, particularly print/read.
- Pattern Matching#Common Lisp — See if there's a pattern matching library that offers more-lispy syntax.
- Simple Windowed Application — Should be reviewed for niceness by a CLIM expert.
Completed
To classify
Insert new tasks here.