User:Kevin Reid/E tasks: Difference between revisions

Content added Content deleted

Inline

Revision as of 13:41, 4 July 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 00:03, 26 June 2009. When updating this list, consult the diffs since then for what to add/remove.

Should go ahead and do

Simple

Eval (except for the "how to bind a variable" bit but we already lost on that in Eval in environment)
Optional parameters
Named Arguments
Loop/Nested
Pascal's Triangle

Problems

Data structures

Algorithmic

Type algebra/staticness

Object-oriented/inheritance

Inheritance

Concurrency

Rendezvous (Hard to define what this means in E. Intervat perhaps? Is currently marked omit.)

Funky control flow

Amb

Probably messy

GUI

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

Reflective

Graphics

Mathematics

Polynomial long division
improve Median (research better algorithms)

Integers

Numerics

Large projects

Argue with

Determine if Only One Instance is Running

Contortions

Needs a ... to be done well

Image type

Matrix type

Complex type

Rational type

Rational Arithmetic

Calendar

Stream IO

Bit oriented IO

Console input

Sockets

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

Operating system interfaces

FFI

Database

Protocol/language implementations

Miscellaneous

BNF Grammar
Formatted Numeric Output
Print a Stack Trace (cross-impl agreement)
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)
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 sorts, Query Performance

To review

Insert new tasks here.

Revision as of 15:59, 26 June 2009 (view source) rosettacode>Kevin Reid (updates) ← Older edit		Revision as of 13:41, 4 July 2009 (view source) rosettacode>Kevin Reid (updates) Newer edit →
Line 9: * [[Eval]] (except for the "how to bind a variable" bit but we already lost on that in [[Eval in environment]]) * [[Optional parameters]] * [[Named Arguments]] * [[Loop/Nested]] * [[Pascal's Triangle]] Line 16 ⟶ 17: * [[Anagrams]] * [[Conway's Game of Life]] * [[Prime decomposition]] * [[Top Rank Per Group]] * [[Zig Zag]] Line 37: * [[Shell sort]] * [[Point in polygon (ray casting algorithm)]] * [[Topological (dependency) sort]] ==Type algebra/staticness== Line 88 ⟶ 89: * [[Gamma function]] * [[Polynomial Fitting]] * [[Multiple Regression]] * [[Quadratic Equation]] * [[Roots of a function]] Line 190 ⟶ 192: * [[Connect to Active Directory]] * [[Creating a SOAP Client]] * [[Send an email]] * [[HTTPS Request]] * [[Client-Authenticated HTTPS Request]]