User:Kevin Reid/E tasks: Difference between revisions

From Rosetta Code
Content added Content deleted
(classifying)
(update by script + manual)
 
(2 intermediate revisions by the same user not shown)
Line 4: Line 4:


==Simple==
==Simple==
* [[Averages/Median]]
* [[Averages/Pythagorean means]]
* [[Averages/Root mean square]]
* [[Doubly-linked list/Traversal]]
* [[Doubly-linked list/Traversal]]
* [[Evaluate binomial coefficients]]
* [[Evaluate binomial coefficients]]
* [[Hailstone sequence]]
* [[Hailstone sequence]]
* [[Hamming numbers]]
* [[Hamming numbers]]
* [[Map range]]
* [[Horner's rule for polynomial evaluation]]
* [[Range expansion]]
* [[Strip block comments]]
* [[Strip comments from a string]]


==Language/library features==
==Language/library features==
* [[Anonymous recursion]]
* [[Anonymous recursion]]
* [[Character matching]]
* [[Compile-time calculation]]
* [[Extreme floating point values]]
* [[Extreme floating point values]]
* [[Flow-control structures]]
* [[Flow-control structures]]
* [[JSON]] (2 ways: terml and deJSONKit)
* [[JSON]] (2 ways: terml and deJSONKit)
* [[Literals/Floating point]]
* [[Narcissist]]
* [[Parallel calculations]]
* [[Random number generator (device)]]
* [[Random number generator (included)]]
* [[Reverse a string]]
* [[String concatenation]]


==Algorithmic==
==Algorithmic==
Line 30: Line 35:
* [[Find common directory path]]
* [[Find common directory path]]
* [[Find the missing permutation]]
* [[Find the missing permutation]]
* [[Knapsack problem/0-1]]
* [[Knapsack problem/Bounded]]
* [[Knapsack problem/Continuous]]
* [[Long multiplication]]
* [[Long multiplication]]
* [[Longest common subsequence]]
* [[Longest common subsequence]]
* [[Maze generation]]
* [[Maze solving]]
* [[N-queens problem]]
* [[Non-continuous subsequences]]
* [[Non-continuous subsequences]]
* [[Permutations]]
* [[Ray-casting algorithm]]
* [[Ray-casting algorithm]]
* [[Sorting algorithms/Bead sort]]
* [[Sorting algorithms/Bead sort]]
Line 44: Line 56:
* [[GUI enabling/disabling of controls]]
* [[GUI enabling/disabling of controls]]
* [[Keyboard macros]]
* [[Keyboard macros]]
* [[Minesweeper game]]
* [[Mouse position]]
* [[Mouse position]]
* [[Window management]]
* [[Window management]]
* [[Play recorded sounds]] (classified here because we can borrow Java facilities in the EoJ case)
* [[Play recorded sounds]] (classified here because we can borrow Java facilities in the EoJ case)
* [[User input/Graphical]]
* [[User input/Graphical]]
* [[Wireworld]]
===Reflective===
===Reflective===
* [[Color of a screen pixel]]
* [[Color of a screen pixel]]
Line 57: Line 71:
* [[Guess the number/With feedback]]
* [[Guess the number/With feedback]]
* [[Guess the number/With feedback (player)]]
* [[Guess the number/With feedback (player)]]
* [[Number reversal game]]


==Graphics==
==Graphics==
Line 83: Line 98:
==Mathematics==
==Mathematics==
* [[Formal power series]] (similar to [[Polynomial long division]])
* [[Formal power series]] (similar to [[Polynomial long division]])
* improve [[Median]] (research better algorithms)
* [[Averages/Median]] (research better algorithms)
* [[Deconvolution/1D]]
* [[Deconvolution/1D]]
* [[Deconvolution/2D+]]
* [[Deconvolution/2D+]]
* [[Hofstadter-Conway $10,000 sequence]]
* [[Hofstadter-Conway $10,000 sequence]]
* [[Simple quaternion type and operations]]
* [[Truncatable primes]]
===Integers===
===Integers===
* [[Factors of an integer]]
* [[Factors of an integer]]
Line 113: Line 130:
* [[Horizontal sundial calculations]]
* [[Horizontal sundial calculations]]
* [[Inverted index]]
* [[Inverted index]]
* [[Luhn test of credit card numbers]]
* [[Permutation test]]
* [[Price fraction]]
* [[Problem of Apollonius]]
* [[Soundex]]
* [[Stem-and-leaf plot]]
* [[Sutherland-Hodgman polygon clipping]]
* [[Variable-length quantity]]


==Large projects==
==Large projects==
* [[24 game/Solve]]
* [[24 game/Solve]]
* [[Bulls and cows/Player]]
* [[Bulls and cows/Player]]
* [[Text processing/1]]
* [[Text processing/2]]
* [[RCRPG]]
* [[Execute a Markov algorithm]]
* [[Execute a Markov algorithm]]
* [[Execute SNUSP]]
* [[Execute SNUSP]]
Line 125: Line 147:
* [[Huffman coding]]
* [[Huffman coding]]
* [[LZW compression]]
* [[LZW compression]]
* [[MD5/Implementation]]
* [[Monty Hall problem]]
* [[Monty Hall problem]]
* [[Pascal's triangle/Puzzle]]
* [[Number names]]
* [[Number names]]
* [[Pascal's triangle/Puzzle]]
* [[RCRPG]]
* [[Roman numerals]]
* [[Roman numerals]]
* [[Stable marriage problem]]
* [[Sudoku]]
* [[Sudoku]]
* [[Text processing/1]]
* [[Text processing/2]]
* [[Thiele's interpolation formula]]


==Rosetta Code processing==
==Rosetta Code processing==
Line 159: Line 187:


===Iter/accum/stream tools===
===Iter/accum/stream tools===
* [[N distinct objects]] (improve: needs better answer than accumulator)
* [[Multiple distinct objects]] (improve: needs better answer than accumulator)
* ...and many other tasks to improve
* ...and many other tasks to improve


Line 186: Line 214:
* [[Five weekends]]
* [[Five weekends]]
* [[Holidays related to Easter]]
* [[Holidays related to Easter]]
* [[Leap year]]


===Stream IO===
===Stream IO===
Line 208: Line 237:
* [[Fork]]
* [[Fork]]
* [[Handle a signal]]
* [[Handle a signal]]
* [[Morse code]] — involves playing a sound
* [[Time a function]] (improve: done EoJ; needs cross-platform)
* [[Time a function]] (improve: done EoJ; needs cross-platform)
* [[Terminal control/Clear the screen]]
* [[Terminal control/Clear the screen]]
* [[Terminal control/Determine the height and width of the terminal window]]
* [[Terminal control/Determine the height and width of the terminal window]]
* [[Terminal control/Moving the cursor to a specific location on the screen]]
* [[Terminal control/Moving the cursor to a specific location on the screen]]
====Windows====
* [[Write to Windows event log]]


===FFI===
===FFI===
Line 224: Line 256:
* [[Table creation/Postal addresses]]
* [[Table creation/Postal addresses]]
* [[SQL-based authentication]]
* [[SQL-based authentication]]
* [[Parametrized SQL statement]]


===Protocol/language implementations===
===Protocol/language implementations===
Line 251: Line 284:
* [[Dynamic variable names]] (improve: Once environment-<code>with</code> is builtin, show using it together with <code>interp.setTopScope</code>)
* [[Dynamic variable names]] (improve: Once environment-<code>with</code> is builtin, show using it together with <code>interp.setTopScope</code>)
* [[E-on-Java]] is flagged for something
* [[E-on-Java]] is flagged for something
* [[Non-decimal radices/Input]] — Don't use __ methods
* [[Optional parameters]] — map-patterns
* [[Power set]] — show dynamically constructed set
* [[Stair-climbing puzzle]]


==Special cases==
==Special cases==
Line 265: Line 302:
Insert new tasks here.
Insert new tasks here.
<!--INSERT-->
<!--INSERT-->
* [[Knapsack problem/0-1]]
* [[Knapsack problem/Bounded]]
* [[Knapsack problem/Continuous]]
* [[Leap year]]
* [[Literals/Floating point]]
* [[Luhn test of credit card numbers]]
* [[MD5/Implementation]]
* [[Map range]]
* [[Maze generation]]
* [[Maze solving]]
* [[Metaprogramming]]
* [[Minesweeper game]]
* [[Morse code]]
* [[Multiple distinct objects]]
* [[N-queens problem]]
* [[Narcissist]]
* [[Non-decimal radices/Input]]
* [[Number reversal game]]
* [[Optional parameters]]
* [[Ordered words]]
* [[Parallel calculations]]
* [[Parametrized SQL statement]]
* [[Permutations]]
* [[Power set]]
* [[Price fraction]]
* [[Problem of Apollonius]]
* [[Random number generator (device)]]
* [[Random number generator (included)]]
* [[Range expansion]]
* [[Reverse a string]]
* [[Simple quaternion type and operations]]
* [[Sort an array of composite structures]]
* [[Soundex]]
* [[Stable marriage problem]]
* [[Stair-climbing puzzle]]
* [[Stem-and-leaf plot]]
* [[String concatenation]]
* [[String interpolation (included)]]
* [[Strip block comments]]
* [[Strip comments from a string]]
* [[Sutherland-Hodgman polygon clipping]]
* [[Symmetric difference]]
* [[Thiele's interpolation formula]]
* [[Truncatable primes]]
* [[Undefined values]]
* [[VList]]
* [[Variable-length quantity]]
* [[Wireworld]]
* [[Write to Windows event log]]
<!--ENDINSERT-->
<!--ENDINSERT-->



Latest revision as of 18:38, 1 February 2011

This is Kevin Reid's personal 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. The presence of items on this list is managed by Task list updater.e (but is not automatically run); the classification is done manually.

Simple

Language/library features

Algorithmic

GUI

Reflective

User interaction (unspecified type)

Graphics

Using Basic bitmap storage

Other pixel processing


Mathematics

Integers

Numerics

Operating system interfaces

Small projects

Large projects

Rosetta Code processing

Argue with




Needs a ... to be done well

Reflection toolkit

User-defined exceptions

Parser library

Iter/accum/stream tools

Vector type

Matrix type

Complex type

Rational type

Calendar

Stream IO

Console input

Sockets

Operating system interfaces

Windows

FFI

Database

Protocol/language implementations

HTTP client

XML

Miscellaneous

Needs improvement

Special cases

Notable omits

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

Completed

To classify

Insert new tasks here.