Anonymous user
User:Kevin Reid/E tasks: Difference between revisions
update by script + manual
m (de-redirect) |
(update by script + manual) |
||
(7 intermediate revisions by the same user not shown) | |||
Line 1:
This is [[User:Kevin Reid|Kevin Reid]]'s ''personal'' classification of [[Reports:tasks not implemented in E|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|Task list updater.e]] (but is not automatically run); the classification is done manually.
<div style="-webkit-column-count: 3">
==Simple==
* [[Doubly-linked list/Traversal]]
* [[Evaluate binomial coefficients]]
* [[Hailstone sequence]]
* [[Hamming numbers]]
* [[Map range]]
* [[Range expansion]]
* [[Strip block comments]]
* [[Strip comments from a string]]
==Language/library features==
* [[Anonymous recursion]]
* [[Extreme floating point values]]
* [[Flow-control structures]]
* [[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==
* [[Arena storage pool]] (Covers both implementing an allocator, and using it to allocate physical memory... Do the first part perhaps.)
* [[Best shuffle]]
* [[Catmull–Clark subdivision surface]]
* [[Combinations with repetitions]]
* [[Closest-pair problem]]
* [[Equilibrium index]]
* [[Find common directory path]]
* [[Find the missing permutation]]
* [[Knapsack problem/0-1]]
* [[Knapsack problem/Bounded]]
* [[Knapsack problem/Continuous]]
* [[Long multiplication]]
* [[Longest common subsequence]]
* [[Maze generation]]
* [[Maze solving]]
* [[N-queens problem]]
* [[Non-continuous subsequences]]
* [[Permutations]]
* [[Ray-casting algorithm]]
* [[Sorting algorithms/Bead sort]]
* [[Sorting algorithms/Comb sort]]
* [[Sorting algorithms/Pancake sort]]
* [[Sorting algorithms/Radix sort]]
* [[Sorting algorithms/Stooge sort]]
==GUI==
* [[GUI component interaction]]
* [[GUI enabling/disabling of controls]]
* [[Keyboard macros]]
* [[Minesweeper game]]
* [[Mouse position]]
* [[Window management]]
* [[Play recorded sounds]] (classified here because we can borrow Java facilities in the EoJ case)
* [[User input/Graphical]]
* [[Wireworld]]
===Reflective===
* [[Color of a screen pixel]]
* [[Simulate input/Keyboard]]
* [[Simulate input/Mouse]]
==User interaction (unspecified type)==
* [[Guess the number]]
* [[Guess the number/With feedback]]
* [[Guess the number/With feedback (player)]]
* [[Number reversal game]]
==Graphics==
* [[Brownian tree]]
* [[Constrained random points on a circle]]
* [[Dragon curve]]
* [[Fractal tree]]
* [[Plot coordinate pairs]]
* [[Image noise]]
===Using [[Basic bitmap storage]]===
* [[Bitmap/Bézier curves/Cubic]]
Line 42 ⟶ 89:
* [[Bitmap/Midpoint circle algorithm]]
* [[Bitmap/PPM conversion through a pipe]]
* [[Bitmap/Read a PPM file]]
* [[Bitmap/Read an image through a pipe]]
* [[Xiaolin Wu's line algorithm]]
===Other pixel processing===
* [[Hough transform]]
==Mathematics==
* [[Formal power series]] (similar to [[Polynomial long division]])
*
* [[Deconvolution/1D]]
* [[Deconvolution/2D+]]
* [[Hofstadter-Conway $10,000 sequence]]
* [[Simple quaternion type and operations]]
* [[Truncatable primes]]
===Integers===
* [[Factors of an integer]]
Line 63 ⟶ 119:
* [[Verify distribution uniformity/Naive]]
* [[Verify distribution uniformity/Chi-squared test]]
==Operating system interfaces==
* [[Globally replace text in several files]]
* [[Hello world/Line printer]]
==Small projects==
* [[24 game]]
* [[Forest fire]]
* [[Four bit adder]]
* [[Horizontal sundial calculations]]
* [[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==
* [[
* [[
* [[Execute a Markov algorithm]]
* [[Execute SNUSP]]
* [[Go Fish]]
* [[Huffman coding]]
* [[LZW compression]]
* [[MD5/Implementation]]
* [[Monty Hall problem]]
* [[Number names]]
* [[Pascal's triangle/Puzzle]]
* [[RCRPG]]
* [[Roman numerals]]
* [[Stable marriage problem]]
* [[Sudoku]]
* [[Text processing/1]]
* [[Text processing/2]]
* [[Thiele's interpolation formula]]
==Rosetta Code processing==
Line 105 ⟶ 187:
===Iter/accum/stream tools===
* [[
* ...and many other tasks to improve
===Vector type===
* [[Dot product]]
===Matrix type===
Line 126 ⟶ 211:
* [[Date manipulation]]
* [[Date format]]
* [[Discordian date]]
* [[Five weekends]]
* [[Holidays related to Easter]]
* [[Leap year]]
===Stream IO===
* [[Bitwise IO]]
====Console input====
* [[A+B]]
* [[Keyboard Input/Determine if a key has been pressed at the terminal]]
* [[Keyboard Input/Flush the keyboard buffer]]
* [[Keyboard Input/Obtain a Y or N response]]
* [[Menu]]
* [[Input loop]]
Line 135 ⟶ 228:
* [[User input/Text]]
====Sockets====
* [[Chat server]]
* [[Echo server]]
* [[Sockets]]
Line 143 ⟶ 237:
* [[Fork]]
* [[Handle a signal]]
* [[Morse code]] — involves playing a sound
* [[Time a function]] (improve: done EoJ; needs cross-platform)
* [[Terminal control/Clear the screen]]
* [[Terminal control/Determine the height and width of the terminal window]]
* [[Terminal control/Moving the cursor to a specific location on the screen]]
====Windows====
* [[Write to Windows event log]]
===FFI===
Line 150 ⟶ 250:
* [[Call a function from a foreign language]]
* [[OpenGL]]
* [[Host introspection]] (currently omitted)
* [[Create an object at a given address]] (currently omitted)
===Database===
* [[Table creation/Postal addresses]]
* [[SQL-based authentication]]
* [[Parametrized SQL statement]]
===Protocol/language implementations===
Line 182 ⟶ 283:
==Needs improvement==
* [[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
* [[Non-decimal radices/Input]] — Don't use __ methods
* [[Optional parameters]] — map-patterns
* [[Power set]] — show dynamically constructed set
* [[Stair-climbing puzzle]]
==Special cases==
Line 187 ⟶ 293:
==Notable omits==
* [[Rendezvous]] (Hard to define what this ''means'' in E. Intervat perhaps? Is currently marked omit.)
|