Reports:Tasks not implemented in Nim

Automatically Generated: This result set should be accurate to within fifteen minutes of the last viewing.

Awareness

If Nim is a language you like, or are interested in, please inform your fellow members of the Nim community; this page can't be emptied without your and their participation.

Not implemented

These are currently not implemented in Nim. Please implement some if you can. If any tasks are not possible or too complex in Nim, they should not be on this list. To mark a task as such, add {{omit from|Nim}}, preserving the capitalization of the language, to that task. It will appear below under the "Not Considered" section.

A

• Achilles numbers
• Active Directory/Connect
• Active Directory/Search for a user
• Arithmetic numbers
• Ascending primes

B

• Brilliant numbers

C

• Colorful numbers
• Composite numbers k with no single digit factors whose factors are all substrings of k
• Cullen and Woodall numbers
• Curzon numbers

D

• Deceptive numbers
• Descending primes
• Determine sentence type
• Disarium numbers
• Duffinian numbers

E

• Earliest difference between prime gaps
• Equal prime and composite sums
• Erdös-Selfridge categorization of primes
• Execute Computer/Zero

G

• Goldbach's comet

J

• Jacobsthal numbers
• Joystick position

M

• Magic constant
• Minimum multiple of m where digital sum equals m

N

• Numbers which are not the sum of distinct squares

O

• OLE automation

P

• Particle fountain
• Pell numbers
• Periodic table
• Prime triangle

R

• Repunit primes
• Rhonda numbers
• Ruth-Aaron numbers

S

• SOAP
• Search in paragraph's text
• Selectively replace multiple instances of a character within a string
• Set right-adjacent bits
• Simple turtle graphics
• Simulate input/Mouse
• Smallest number k such that k+2^m is composite for all m less than k

U

• Ukkonen’s suffix tree construction
• Ultra useful primes

V

• Variable declaration reset

W

• Write to Windows event log

---

Draft tasks without implementation

These tasks are drafts, meaning they largely need more work to turn them into full tasks. Perhaps you can help by trying to implement them in Nim (after all, one of the key requirements for a task being non-draft is multiple implementations, preferably in widely different languages) but be aware that this may be difficult because of lack of definition of the task itself.

1

• 10001th prime
• 15 puzzle game in 3D

3

• 3d turtle graphics

A

• Anadromes
• Append numbers at same position in strings
• Aspect oriented programming
• Autogram checker

B

• B-spline
• Babylonian spiral

C

• Camel case and snake case
• Chess player
• Code Golf: Code Golf
• Code segment unload
• Collect and sort square numbers in ascending order from three lists
• Compiler/Preprocessor
• Compiler/Simple file inclusion pre processor
• Create your own text control codes
• Cross compilation
• Cycles of a permutation

D

• Dating agency
• Day of the week of Christmas and New Year
• Digit fifth powers
• Diophantine linear system solving
• Divide a rectangle into a number of unequal triangles
• Dominoes

E

• Elevator simulation
• Erdős–Woods numbers
• Euclid-Mullin sequence
• Exactly three adjacent 3 in lists

F

• Find URI in text
• Find adjacent primes which differ by a square integer
• Find first and last set bit of a long integer
• Find square difference
• Find squares n where n+1 is prime
• First 9 prime Fibonacci number
• Four sides of square

G

• Generalised floating point addition
• Generalised floating point multiplication
• Getting the number of decimals

H

• Hex words
• Hexapawn

I

• I'm a software engineer, get me out of here
• IPC via named pipe
• IRC gateway
• Isograms and heterograms
• Iterators

J

• Jaccard index

L

• Largest difference between adjacent primes
• Largest palindrome product
• Largest prime factor
• Largest product in a grid
• Long stairs

M

• Matrix with two diagonals
• Modulinos
• Mosaic matrix
• Multiton

N

• N-queens minimum and knights and bishops
• Number triplets game

O

• Odd and square numbers
• OpenGL pixel shader
• Own digits power sum

P

• Pandigital prime
• Parse EBNF
• Polynomial derivative

R

• Recursive descent parser generator
• Red black tree sort
• Remote agent/Agent interface
• Remote agent/Agent logic
• Remote agent/Simulation
• Robots
• Round-robin tournament schedule

S

• Safe and Sophie Germain primes
• Safe mode
• Sanitize user input
• Segmentation fault protection
• Smallest multiple
• Solve equations with substitution method
• Solve hanging lantern problem
• Solving coin problems
• Sort primes from list to a list
• Steady squares
• Sum of square and cube digits of an integer are primes
• Sum of two adjacent numbers are primes
• Summation of primes

T

• Tetris
• Transliterate English text using the Greek alphabet

U

• URL shortener
• Uno (Card Game)
• Use a REST API
• User defined pipe and redirection operators

V

• Vidir

W

• WebGL rotating F
• WiktionaryDumps to words
• Wordle comparison
• Worthwhile task shaving

X

• XXXX redacted

---

Requiring Attention

Examples

These tasks have implementations in Nim, but somebody, somewhere, decided that the example implementation was faulty or in some other way requiring attention. If you're familiar with the task and language, please consider reviewing/correcting the example and removing the notice.

---

Other pages

These are other pages related to Nim which require attention; with your knowledge and assistance, we can improve the quality of the site's content.

---

Not Considered

These tasks are not generally counted toward "unimplemented", as somebody, somewhere, decided that Nim was inappropriate for these tasks, or implementations of them would be unenlightening. Feel free to try your hand at them anyway.

S

• Send an unknown method call

---

End of List

Again, feel free to try your hand at any of the tasks listed on this page.