User:Kevin Reid/E tasks: Difference between revisions
Content added Content deleted
(mark some done, comment, also Testing a Function was incorrectly on the list) |
(updates) |
||
Line 1: | Line 1: | ||
This is [[User:Kevin Reid]]'s classification of [[ |
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 16: |
As of 16:03, 21 June 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 11: | Line 11: | ||
* [[Loop/Nested]] |
* [[Loop/Nested]] |
||
* [[Median]] |
* [[Median]] |
||
⚫ | |||
===Problems=== |
===Problems=== |
||
Line 76: | Line 77: | ||
* [[Quadratic bezier curves]] |
* [[Quadratic bezier curves]] |
||
== |
==Mathematics== |
||
* [[ |
* [[Polynomial long division]] |
||
* improve [[Median]] (research better algorithms) |
|||
===Integers=== |
|||
* [[Greatest common divisor]] |
* [[Greatest common divisor]] |
||
* [[Happy Number]] |
* [[Happy Number]] |
||
Line 83: | Line 86: | ||
* [[Miller-Rabin test]] |
* [[Miller-Rabin test]] |
||
* [[Multiplicative order]] |
* [[Multiplicative order]] |
||
⚫ | |||
* [[Perfect Numbers]] |
* [[Perfect Numbers]] |
||
⚫ | |||
===Numerics=== |
|||
* [[Gamma function]] |
|||
* [[Polynomial Fitting]] |
* [[Polynomial Fitting]] |
||
* [[Quadratic Equation]] |
* [[Quadratic Equation]] |
||
* [[Roots of a function]] |
* [[Roots of a function]] |
||
* [[Sequence of Non-squares]] |
* [[Sequence of Non-squares]] |
||
⚫ | |||
==Large projects== |
==Large projects== |
||
Line 170: | Line 174: | ||
* [[Echo Server]] |
* [[Echo Server]] |
||
* [[Sockets]] |
* [[Sockets]] |
||
* [[Discover the Hostname]] (done by shell command, but should be done internally) |
* improve [[Discover the Hostname]] (done by shell command, but should be done internally) |
||
===Operating system interfaces=== |
===Operating system interfaces=== |
||
Line 202: | Line 206: | ||
===Miscellaneous=== |
===Miscellaneous=== |
||
* [[BNF Grammar]] |
|||
* [[Formatted Numeric Output]] |
* [[Formatted Numeric Output]] |
||
* [[Print a Stack Trace]] (cross-impl agreement) |
* [[Print a Stack Trace]] (cross-impl agreement) |
||
Line 207: | Line 212: | ||
* [[Regular expression matching]] (need agreement on regexp substitution and regexp search-as-opposed-to-match) |
* [[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) |
* [[Sort stability]] (Need to find/write the documentation on this) |
||
* [[Dynamic variable names]] (Once environment-<code>with</code> is builtin, show using it together with <code>interp.setTopScope</code>) |
* improve [[Dynamic variable names]] (Once environment-<code>with</code> is builtin, show using it together with <code>interp.setTopScope</code>) |
||
==Special cases== |
==Special cases== |
Revision as of 19:18, 24 June 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 16:03, 21 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
- Loop/Nested
- Median
- Pascal's Triangle
Problems
- Bulls and Cows
- Anagrams
- Conway's Game of Life
- Prime decomposition
- Sierpinski carpet
- Top Rank Per Group
- Zig Zag
- SEDOL
Data structures
Algorithmic
- Closest pair problem
- Cocktail Sort
- Gnome sort
- Knapsack Problem
- Long Multiplication
- Longest Common Subsequence
- Maximum subsequence
- Non Continuous Subsequences
- Selection sort
- Shell sort
- Point in polygon (ray casting algorithm)
Type algebra/staticness
Object-oriented/inheritance
Concurrency
- Rendezvous (Hard to define what this means in E. Intervat perhaps? Is currently marked omit.)
Funky control flow
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
- Bresenham's line algorithm
- Cubic bezier curves
- Dragon curve
- Midpoint circle algorithm
- Plot x, y arrays
- Quadratic bezier curves
Mathematics
- Polynomial long division
- improve Median (research better algorithms)
Integers
- Greatest common divisor
- Happy Number
- Lucas-Lehmer test
- Miller-Rabin test
- Multiplicative order
- Perfect Numbers
- Trial factoring of a Mersenne number
Numerics
Large projects
- Code Tag Fixer
- Count programming examples
- Data Munging
- Data Munging 2
- RCRPG
- RCSNUSP
- Huffman codes
- LZW compression
- Monty Hall simulation
- Pyramid of numbers
- Roman Numerals
- Sort most popular programming languages
Argue with
Contortions
Needs a ... to be done well
Reflection toolkit
User-defined exceptions
Parser library
Iter/accum/stream tools
Image type
- Basic bitmap storage
- Flood fill
- Image convolution
- Image histogram
- Grayscale image
- Median filter
- Percentage of difference between 2 images
- PPM conversion through a pipe
- Read image file through a pipe
- Read ppm file
- Write ppm file
- Xiaolin Wu's line algorithm
Matrix type
Complex type
Rational type
Calendar
Stream 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
- Connect to Active Directory
- Creating a SOAP Client
- HTTPS Request
- Client-Authenticated HTTPS Request
- HTTPS request with authentication
- SQL-Based Authentication
- Search Yahoo
- Search for a User in Active Directory
- XML Creation
- XML Reading
- XML and XPath
- Xlib simple window
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 withinterp.setTopScope
)
Special cases
- Measure relative performance of sorting algorithms implementations -- waiting on sorts, Query Performance
To review
Insert new tasks here.