User:Kevin Reid/Common Lisp tasks: Difference between revisions

partial update
(moved spiral to completed)
(partial update)
 
(22 intermediate revisions by 2 users not shown)
Line 1:
This is [[User:Kevin Reid|Kevin Reid]]'s ''personal'' classification of [[Reports:tasks not implemented in Common Lisp|tasks not implemented in Common Lisp]], or just poorly done in CL, by what kind of problem they are. The presence of items on this list is managed by [[../Task list updater.e|Task list updater.e]] (but is not automatically run); the classification is done manually.
 
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 06:13, 11 August 2009. When updating this list, consult [http://rosettacode.org/mw/index.php?title=Template:Unimp_body_Common_Lisp&action=history the main unimp list's diffs] since then for what to add/move.
 
<div style="-webkit-column-count: 3">
 
==Basic language features==
* [[Binary string manipulation functionsstrings]]
* [[Bit orientedBitwise IO]]
* [[Special characters]]
* [[Variables]]
===Data structures===
* [[Collections]]
 
==Algorithmic problems==
* [[Closest pair problem]]
* [[Pyramid of numbers]]
 
==Miscellaneous programs==
* [[Execute SNUSP]]
* [[:Category:RCSNUSP|RCSNUSP]]
* [[SEDOL]]
 
==Mathematics==
* [[Formal Power Series]]
* [[Polynomial long division]]
* [[Seven-dice from Five-dice]]
===Matrices===
* [[Matrix exponentiation operator]]
Line 36 ⟶ 25:
* [[Miller-Rabin test]]
* [[Multiplicative order]]
* [[Trial factoring of a Mersenne number]]
===Numerics===
* [[Gamma function]]
* [[Multiple Regression]]
* [[Numerical Integration]]
* [[Polynomial Fitting]]
* [[Quadratic Equation]]
* [[RootsSafe of a functionaddition]]
* [[Sequence of Non-squares]]
* [[Simple Random Distribution Checker]]
* [[Verify Distribution Uniformity with Chi-Squared Test]]
 
Line 55 ⟶ 41:
* [[Mutex]]
* [[Rendezvous]]
* [[Synchronous Concurrency]]
 
==Type system==
Line 66 ⟶ 51:
* [[Data Munging]]
* [[Data Munging 2]]
* [[Max Licenses In Use]]
 
==File access==
* [[File Modification Time]]
* [[File Rename]]
 
==FFI/low-level==
* [[AddressArena Operationsstorage pool]]
* [[Allocator]]
* [[Basic pointer and reference operations]]
* [[Call a function infrom a sharedforeign librarylanguage]]
* [[Data Representation - Controlling Fields in a Structure]]
* [[Data Representation - Specifying Minimum Size]]
Line 88 ⟶ 69:
* [[Program Termination]]
===Sockets===
* [[Sockets]]
===Windows===
* [[Connect to Active Directory/Connect]]
* [[Active Directory/Search for a User in Active Directoryuser]]
 
==GUI==
* [[Get mouse position]]
* [[Keyboard macros]]
* [[Simple Windowed Application]]
* [[User Input - graphical]]
* [[Window management]]
* [[PendulumAnimate Animationa pendulum]]
===Reflective===
* [[Get Pixel Information]]
Line 106 ⟶ 85:
 
==Control flow==
* [[Amb]]
* [[Flow Control Structures]]
 
Line 113 ⟶ 91:
* [[Plot x, y arrays]]
===The image-type tasks===
* [[Bitmap/Bézier curves/Cubic]]
* [[Bresenham's line algorithm]]
* [[Cubic bezierBitmap/Bézier curves/Quadratic]]
* [[Bitmap/Flood fill]]
* [[Bitmap/Histogram]]
* [[Bitmap/PPM conversion through a pipe]]
* [[Bitmap/Read ppma PPM file]]
* [[Bitmap/Read imagean fileimage through a pipe]]
* [[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]]
 
Line 156 ⟶ 133:
* [[Evens Sum To Even]]
* [[Measure relative performance of sorting algorithms implementations]]
* [[Object Serialization]]
 
==Rosetta Code reflection==
Line 164 ⟶ 140:
 
==To improve==
* [[AddingAdd variablesa variable to a class instance at runtime#Common Lisp]] — improve: This should be a per-*instance* change. Use the MOP to generate a subclass and change-class to it.
* [[Basic bitmap storage#Common Lisp]] — review for efficiency (inlining?), necessity of type declarations, idiom
* [[Amb]] — improve: Show the continuation version as well (use arnesi?).
* [[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.
* [[Arithmetic Evaluator#Common Lisp]] — improve: 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]] — improve: Investigate using CLIM.
* [[Pattern Matching#Common Lisp]] — See if there's a pattern matching library that offers more-lispy syntax.
* [[Basic bitmap storage#Common Lisp]] — improve: review for efficiency (inlining?), necessity of type declarations, idiom
* [[Basic Animation]] and [[Pendulum Animation]] — Investigate using CLIM.
* [[Closest pair problem]] — improve: Try using complex numbers instead of conses.
* [[Collections]] — improve: Add some discussion of the characteristics, and include vectors.
* [[Object Serialization]] — improve: Show other techniques, particularly print/read.
* [[Pattern Matching#Common Lisp]] — improve: See if there's a pattern matching library that offers more-lispy syntax.
* [[Simple Windowed Application]] — improve: Should be reviewed for niceness by a CLIM expert.
 
==Completed==
<!--COMPLETED-->
* [[Dining philosophers]]
* [[First-classAddress NumbersOperations]]
* [[Huffman codesFactors]]
* [[First-class Numbers]] — While implemented, it does not parallel the function example as intended.
* [[Long Multiplication]]
* [[Roots of a function]]
* [[Point in polygon (ray casting algorithm)]]
* [[Trial factoring of a Mersenne number]]
* [[Standard Deviation]]
<!--ENDCOMPLETED-->
* [[Top Rank Per Group]]
* [[Topological (dependency) sort]]
* [[Sudoku Solver]]
* [[Knapsack Problem]]
* [[Spiral]]
 
==To classify==
Insert new tasks here.
<!--INSERT-->
<!--ENDINSERT-->
 
</div>