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

Content added Content deleted

Inline

Latest revision as of 02:24, 31 January 2011

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. The presence of items on this list is managed by Task list updater.e (but is not automatically run); the classification is done manually.

Basic language features

Data structures

Algorithmic problems

Pyramid of numbers

Miscellaneous programs

Mathematics

Matrices

Integers

Numerics

Concurrency/events

Type system

Object-oriented

Polymorphic copy

Text-bashing

File access

FFI/low-level

OS interfaces

Sockets

Windows

GUI

Reflective

Control flow

Flow Control Structures

Graphics

The image-type tasks

Use a library

HTTP client

Database

Calendar

OpenGL

OpenGL

Testing

Testing a Function

Miscellaneous other

Rosetta Code reflection

To improve

Add a variable to a class instance at runtime — improve: This should be a per-*instance* change. Use the MOP to generate a subclass and change-class to it.
Amb — improve: Show the continuation version as well (use arnesi?).
Arithmetic Evaluator — 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.
Basic bitmap storage — improve: review for efficiency (inlining?), necessity of type declarations, idiom
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 — 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

Address Operations
Factors
First-class Numbers — While implemented, it does not parallel the function example as intended.
Roots of a function
Trial factoring of a Mersenne number

To classify

Insert new tasks here.

Revision as of 19:44, 9 August 2009 (view source) rosettacode>Tayloj (→‎Algorithms) ← Older edit		Latest revision as of 02:24, 31 January 2011 (view source) rosettacode>Kevin Reid (partial update)
(38 intermediate revisions by 3 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. ~~As of 00:13, 8 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"> ==Basic language features== * [[Binary ~~string manipulation functions~~strings]] * [[~~Bit oriented~~Bitwise IO]] * [[Special characters]] * [[Variables]] * [[First-class Numbers]] ===Data structures=== * [[Collections]] ~~==Algorithms==~~ * [[Point in polygon (ray casting algorithm)]] ===Algorithmic problems=== * [[Closest pair problem]] * [[Knapsack Problem]] * [[Non Continuous Subsequences]] * [[Pyramid of numbers]] * [[Spiral]]▼ * [[Sudoku Solver]] * [[Top Rank Per Group]] * [[Topological (dependency) sort]] ==Miscellaneous programs== * [[~~:Category:RCHQ9+\|RCHQ9+~~Execute SNUSP]] * [[:Category:RCSNUSP\|RCSNUSP]] * [[SEDOL]] ==Mathematics== * [[Formal Power Series]] * [[Polynomial long division]] * [[Standard Deviation]] ===Matrices=== * [[Matrix exponentiation operator]] * [[Reduced row echelon form]] ===Integers=== * [[Long Multiplication]] * [[Lucas-Lehmer test]] * [[Miller-Rabin test]] * [[Multiplicative order]] * [[Trial factoring of a Mersenne number]]▼ ===Numerics=== * [[Gamma function]] * [[Multiple Regression]] * [[Numerical Integration]] * [[Polynomial Fitting]] * [[Quadratic Equation]] * [[~~Roots~~Safe ~~of a function~~addition]] * [[Sequence of Non-squares]] * [[Verify Distribution Uniformity with Chi-Squared Test]] ==Concurrency/events== * [[Active object]] * [[Atomic updates]] * [[Dining philosophers]] * [[Event]] * [[Metered Concurrency]] * [[Mutex]] * [[Rendezvous]] * [[Synchronous Concurrency]] ==Type system== Line 73 ⟶ 51: * [[Data Munging]] * [[Data Munging 2]] * [[Max Licenses In Use]] ==File access== * [[File Modification Time]] * [[File Rename]] ==FFI/low-level== * [[~~Address~~Arena ~~Operations~~storage pool]] * [[Allocator]] * [[Basic pointer and reference operations]] * [[Call a function infrom a ~~shared~~foreign ~~library~~language]] * [[Data Representation - Controlling Fields in a Structure]] * [[Data Representation - Specifying Minimum Size]] Line 95 ⟶ 69: * [[Program Termination]] ===Sockets=== * [[Sockets]] ===Windows=== * [[~~Connect to~~ Active Directory/Connect]] * [[Active Directory/Search for a ~~User in Active Directory~~user]] ==GUI== * [[Get mouse position]] * [[Keyboard macros]] * [[Simple Windowed Application]] * [[User Input - graphical]] * [[Window management]] * [[~~Pendulum~~Animate ~~Animation~~a pendulum]] ===Reflective=== * [[Get Pixel Information]] Line 113 ⟶ 85: ==Control flow== * [[Amb]] * [[Flow Control Structures]] Line 120 ⟶ 91: * [[Plot x, y arrays]] ===The image-type tasks=== * [[Bitmap/Bézier curves/Cubic]] * [[Bresenham's line algorithm]] * [[~~Cubic bezier~~Bitmap/Bézier curves/Quadratic]] * [[Bitmap/Flood fill]] * [[Bitmap/Histogram]] * [[Bitmap/PPM conversion through a pipe]]▼ * [[Bitmap/Read ~~ppm~~a PPM file]]▼ * [[Bitmap/Read ~~image~~an ~~file~~image 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 163 ⟶ 133: * [[Evens Sum To Even]] * [[Measure relative performance of sorting algorithms implementations]] * [[Object Serialization]] ==Rosetta Code reflection== Line 171 ⟶ 140: ==To improve== * [[~~Adding~~Add ~~variables~~a 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--> * [[Address Operations]] ▲* [[~~Spiral~~Factors]] * [[First-class Numbers]] — While implemented, it does not parallel the function example as intended. * [[Roots of a function]] ▲* [[Trial factoring of a Mersenne number]] <!--ENDCOMPLETED--> ==To classify== Insert new tasks here. <!--INSERT--> <!--ENDINSERT--> </div>