User:Kevin Reid/E tasks: Difference between revisions

Content added Content deleted

Inline

Revision as of 01:23, 31 January 2011

This is Kevin Reid's personal classification of tasks not implemented in E, or just poorly done in E, by what kind of problem they are, or what kind of library/language work should come first.

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:16, 18 August 2009. When updating this list, consult the main unimp list's diffs since then for what to add/move.

Language features

Algorithmic

Closest-pair problem
Long multiplication
Longest common subsequence
Non-continuous subsequences
Point in polygon (ray casting algorithm)
Arena storage pool (Covers both implementing an allocator, and using it to allocate physical memory... Do the first part perhaps.)

GUI

Keyboard macros
Get mouse position
Window management
Play recorded sounds (classified here because we can borrow Java facilities in the EoJ case)
User input/Graphical

Reflective

Graphics

Using Basic bitmap storage

Mathematics

Formal power series (similar to Polynomial long division)
improve Median (research better algorithms)

Integers

Numerics

Large projects

Rosetta Code processing

Argue with

Determine if only one instance is running

Needs a ... to be done well

Reflection toolkit

Add a variable to a class instance at runtime

User-defined exceptions

Exceptions/Catch an exception thrown in a nested call

Parser library

Arithmetic evaluation ought to use one even if it's not technically required. (improve)

Iter/accum/stream tools

N distinct objects (improve: needs better answer than accumulator)
...and many other tasks to improve

Matrix type

Complex type

Rational type

Arithmetic/Rational

Calendar

Stream IO

Bitwise IO

Console input

Sockets

Echo server
Sockets
Hostname (improve: done by shell command, but should be done internally)

Operating system interfaces

Secure temporary file
Fork
Interrupts
Query Performance (improve: done EoJ; needs cross-platform)

FFI

Database

Protocol/language implementations

HTTP client

XML

Miscellaneous

Formatted numeric output
Write float arrays to a text file (same as Formatted Output)
Regular expression matching (need agreement on regexp substitution and regexp search-as-opposed-to-match)
Sort stability (Need to find/write the documentation on this)
Stack traces (cross-impl agreement)

Needs improvement

Dynamic variable names (improve: Once environment-with is builtin, show using it together with interp.setTopScope)

Special cases

Compare sorting algorithms' performance — waiting on Shell sort, Plot x, y arrays, Write float arrays to a text file, Polynomial regression

Notable omits

Proof wants a 'proof'
Rendezvous (Hard to define what this means in E. Intervat perhaps? Is currently marked omit.)

Completed

To classify

Insert new tasks here.

@@ Line 102: / Line 102: @@
 ===Parser library===
-* [[Arithmetic evaluation]] ought to use one even if it's not technically required.
+* [[Arithmetic evaluation]] ought to use one even if it's not technically required. (improve)
 ===Iter/accum/stream tools===
-* [[N distinct objects]] (needs better answer than accumulator)
+* [[N distinct objects]] (improve: needs better answer than accumulator)
 * ...and many other tasks to improve
@@ Line 137: / Line 137: @@
 * [[Echo server]]
 * [[Sockets]]
-* [[Hostname]] (done by shell command, but should be done internally)
+* [[Hostname]] (improve: done by shell command, but should be done internally)
 ===Operating system interfaces===
@@ Line 143: / Line 143: @@
 * [[Fork]]
 * [[Interrupts]]
-* [[Query Performance]] (done EoJ; needs cross-platform)
+* [[Query Performance]] (improve: done EoJ; needs cross-platform)
 ===FFI===
@@ Line 182: / Line 182: @@
 ==Needs improvement==
-* improve [[Dynamic variable names]] (Once environment-<code>with</code> is builtin, show using it together with <code>interp.setTopScope</code>)
+* [[Dynamic variable names]] (improve: Once environment-<code>with</code> is builtin, show using it together with <code>interp.setTopScope</code>)
 ==Special cases==
-* [[Measure relative performance of sorting algorithms implementations]] — waiting on [[Shell sort]], [[Plot x, y arrays]], [[Write float arrays to a text file]], [[Polynomial regression]]
+* [[Compare sorting algorithms' performance]] — waiting on [[Shell sort]], [[Plot x, y arrays]], [[Write float arrays to a text file]], [[Polynomial regression]]
 ==Notable omits==