User:Kevin Reid/E tasks: Difference between revisions

From Rosetta Code
Content added Content deleted
(completed task, also better link for diffs)
m (update)
Line 1: Line 1:
This is [[User:Kevin Reid]]'s classification of [[Tasks not implemented in E]] by what kind of problem they are, or what kind of library/language work should come first.
This is [[User:Kevin Reid]]'s classification of [[Tasks not implemented in E]] by what kind of problem they are, or what kind of library/language work should come first.


As of 19 May 2009, at 16:05. 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.
As of 00:03, 20 May 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">
<div style="-webkit-column-count: 3">
Line 7: Line 7:
==Should go ahead and do==
==Should go ahead and do==
===Simple===
===Simple===
* [[FIFO (usage)]]
* [[Exceptions]]
* [[Eval]] (except for the "how to bind a variable" bit but we already lost on that in [[Eval in environment]])
* [[File Modification Time]]
* [[Sort an array of composite structures]]
* [[File Rename]]
* [[File Size]]
* [[Flow Control Structures]]
* [[Loop Structures]]
* [[Special characters]]
* [[Sum of squares]]


===Complex===
===Problems===
* [[Bulls and Cows]]
* [[Bulls and Cows]]
* [[Anagrams]]
* [[Anagrams]]
Line 22: Line 17:
* [[Bogosort]]
* [[Bogosort]]
* [[Conway's Game of Life]]
* [[Conway's Game of Life]]
* [[Eval]]
* [[Prime decomposition]]
* [[Prime decomposition]]
* [[Run-length encoding]] (borrow look-and-say code)
* [[Sierpinski carpet]]
* [[Sierpinski carpet]]
* [[Sierpinski triangle]]
* [[Sierpinski triangle]]
* [[Top Rank Per Group]]
* [[Top Rank Per Group]]
* [[Zig Zag]]
* [[Zig Zag]]
* [[SEDOL]]
* [[Spiral]]
* [[Spiral]]


Line 44: Line 38:
* [[Gnome sort]]
* [[Gnome sort]]
* [[Knapsack Problem]]
* [[Knapsack Problem]]
* [[Knuth shuffle]]
* [[Long Multiplication]]
* [[Long Multiplication]]
* [[Longest Common Subsequence]]
* [[Longest Common Subsequence]]
Line 51: Line 46:
* [[Quicksort]]
* [[Quicksort]]
* [[Selection sort]]
* [[Selection sort]]
* [[Shell sort]]


==Type algebra/staticness==
==Type algebra/staticness==
Line 89: Line 85:
* [[Roots of a function]]
* [[Roots of a function]]
* [[Sequence of Non-squares]]
* [[Sequence of Non-squares]]
* [[Shell sort]]
* [[Trial factoring of a Mersenne number]]
* [[Trial factoring of a Mersenne number]]


Line 95: Line 90:
* [[Code Tag Fixer]]
* [[Code Tag Fixer]]
* [[Count programming examples]]
* [[Count programming examples]]
* [[Data Munging]]
* [[Data Munging 2]]
* [[RCRPG]]
* [[RCRPG]]
* [[RCSNUSP]]
* [[RCSNUSP]]
Line 116: Line 113:
===Reflection toolkit===
===Reflection toolkit===
* [[Adding variables to a class instance at runtime]]
* [[Adding variables to a class instance at runtime]]

===User-defined exceptions===
* [[Exceptions Through Nested Calls]]


===Parser library===
===Parser library===
Line 157: Line 157:


===Stream IO===
===Stream IO===
* [[Basic input loop]]
* [[Bit oriented IO]]
* [[Bit oriented IO]]
====Console input (or perhaps gui)====
* [[Basic input loop]]
* [[Two-dimensional array (runtime)]]
* [[User Input]]
* [[User Input]]
====Sockets====
====Sockets====
Line 194: Line 196:
===Miscellaneous===
===Miscellaneous===
* [[Formatted Numeric Output]]
* [[Formatted Numeric Output]]
* [[Print a Stack Trace]]
* [[Print a Stack Trace]] (cross-impl agreement)
* [[Write float arrays to a text file]] (same as Formatted 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)

==Special cases==
* [[Measure relative performance of sorting algorithms implementations]] -- waiting on sorts, Query Performance


==To review==
==To review==
Insert new tasks here.
* [[Data Munging]]
* [[Data Munging 2]]
* [[Exceptions]]
* [[Exceptions Through Nested Calls]]
* [[Measure relative performance of sorting algorithms implementations]]
* [[Power Set]]
* [[Regular expression matching]]
* [[SEDOL]]
* [[Sort an array of composite structures]]
* [[Two-dimensional array (runtime)]]


</div>
</div>

Revision as of 01:24, 20 May 2009

This is User:Kevin Reid's classification of Tasks not implemented in E by what kind of problem they are, or what kind of library/language work should come first.

As of 00:03, 20 May 2009. When updating this list, consult the diffs since then for what to add/remove.

Should go ahead and do

Simple

Problems

Data structures

Algorithmic

Type algebra/staticness

Object-oriented/inheritance

Control flow we don't have

Probably messy

Graphics

Numerics

Large projects

Argue with

Contortions

Needs a ... to be done well

Reflection toolkit

User-defined exceptions

Parser library

Iter/accum/stream tools

Image type

Matrix type

Complex type

Rational type

Calendar

Stream IO

Console input (or perhaps gui)

Sockets

Operating system interfaces

FFI

Database

Protocol/language implementations

Miscellaneous

Special cases

To review

Insert new tasks here.