User:Kevin Reid/E tasks: Difference between revisions

Content added Content deleted

Inline

Revision as of 17:33, 1 August 2009

This is Kevin Reid's 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.

As of 12:09, 31 July 2009. When updating this list, consult the diffs since then for what to add/remove.

Language features

Arrays

Algorithmic

Closest pair problem
Long Multiplication
Longest Common Subsequence
Maximum subsequence
Non Continuous Subsequences
Point in polygon (ray casting algorithm)
Allocator (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

Polynomial long division
Formal Power Series
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

Iter/accum/stream tools

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

Matrix type

Complex type

Rational type

Rational Arithmetic

Calendar

Stream IO

Bit oriented IO

Console input

Sockets

Echo Server
Sockets
Discover the Hostname (done by shell command, but should be done internally)

Operating system interfaces

Creating a Secure Temporary File
Fork Process
Interrupts
Query Performance (done EoJ; needs cross-platform)

FFI

Database

Protocol/language implementations

Miscellaneous

BNF Grammar
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)
Print a Stack Trace (cross-impl agreement)

Needs improvement

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

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 Fitting

Notable omits

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

To review

Insert new tasks here.

Revision as of 20:15, 29 July 2009 (view source) rosettacode>Kevin Reid m (remove completed) ← Older edit		Revision as of 17:33, 1 August 2009 (view source) rosettacode>Kevin Reid m (updates) Newer edit →
Line 1: This is [[User:Kevin Reid\|Kevin Reid]]'s 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. As of 1812:09, 2931 July 2009. When updating this list, consult [http://rosettacode.org/w/index.php?title=Template:Unimp_body_E&action=history the diffs] since then for what to add/remove. <div style="-webkit-column-count: 3"> ==Language features== * [[Arrays]] ==Algorithmic== Line 12 ⟶ 15: * [[Non Continuous Subsequences]] * [[Point in polygon (ray casting algorithm)]] * [[Allocator]] (Covers both implementing an allocator, and using it to allocate physical memory... Do the first part perhaps.) ==GUI== Line 45 ⟶ 49: ===Integers=== * [[Lucas-Lehmer test]] * [[Miller-Rabin test]] * [[Multiplicative order]] * [[Perfect Numbers]] * [[Trial factoring of a Mersenne number]] ===Numerics=== * [[Nth root algorithm]] * [[Gamma function]] * [[Polynomial Fitting]]