User:Kevin Reid/E tasks: Difference between revisions
Content added Content deleted
(updates) |
(gather the omits together, sort list of sorts, add heapsort) |
||
| Line 1: | 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. |
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 |
As of 12:04, 17 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"> |
<div style="-webkit-column-count: 3"> |
||
| Line 23: | Line 23: | ||
===Algorithmic=== |
===Algorithmic=== |
||
| ⚫ | |||
| ⚫ | |||
| ⚫ | |||
* [[Heapsort]] |
|||
* [[Closest pair problem]] |
* [[Closest pair problem]] |
||
| ⚫ | |||
* [[Knapsack Problem]] |
* [[Knapsack Problem]] |
||
* [[Long Multiplication]] |
* [[Long Multiplication]] |
||
| Line 30: | Line 33: | ||
* [[Maximum subsequence]] |
* [[Maximum subsequence]] |
||
* [[Non Continuous Subsequences]] |
* [[Non Continuous Subsequences]] |
||
| ⚫ | |||
| ⚫ | |||
* [[Point in polygon (ray casting algorithm)]] |
* [[Point in polygon (ray casting algorithm)]] |
||
* [[Topological (dependency) sort]] |
* [[Topological (dependency) sort]] |
||
| Line 40: | Line 41: | ||
==Concurrency== |
==Concurrency== |
||
| ⚫ | |||
==Funky control flow== |
==Funky control flow== |
||
| Line 99: | Line 99: | ||
==Argue with== |
==Argue with== |
||
* [[Determine if Only One Instance is Running]] |
* [[Determine if Only One Instance is Running]] |
||
==Contortions== |
|||
| ⚫ | |||
==Needs a ... to be done well== |
==Needs a ... to be done well== |
||
| Line 204: | Line 201: | ||
==Special cases== |
==Special cases== |
||
* [[Measure relative performance of sorting algorithms implementations]] -- waiting on sorts, Query Performance |
* [[Measure relative performance of sorting algorithms implementations]] -- waiting on sorts, Query Performance |
||
==Notable omits== |
|||
| ⚫ | |||
| ⚫ | |||
==To review== |
==To review== |
||
Revision as of 22:23, 19 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 12:04, 17 July 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)
- Named Arguments
- Loop/For with step
Problems
Data structures
Algorithmic
- Cocktail Sort
- Selection sort
- Shell sort
- Heapsort
- Closest pair problem
- Knapsack Problem
- Long Multiplication
- Longest Common Subsequence
- Maximum subsequence
- Non Continuous Subsequences
- Point in polygon (ray casting algorithm)
- Topological (dependency) sort
Type algebra/staticness
Object-oriented
Concurrency
Funky control flow
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)
- User Input - graphical
Reflective
Graphics
Mathematics
- Polynomial long division
- improve Median (research better algorithms)
Integers
- Happy Number
- Lucas-Lehmer test
- Miller-Rabin test
- Multiplicative order
- Perfect Numbers
- Trial factoring of a Mersenne number
Numerics
- Gamma function
- Polynomial Fitting
- Multiple Regression
- Quadratic Equation
- Roots of a function
- Sequence of Non-squares
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
- Convert an integer into words
- Roman Numerals
- Sort most popular programming languages
Argue with
Needs a ... to be done well
Reflection toolkit
User-defined exceptions
Parser library
Iter/accum/stream tools
- N distinct objects (needs better answer than accumulator)
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
- Bresenham's line algorithm
- 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
- Send an email
- 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-
withis builtin, show using it together withinterp.setTopScope)
Special cases
- Measure relative performance of sorting algorithms implementations -- waiting on sorts, Query Performance
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.