# Reports:Tasks not implemented in Ada

**Awareness**

If

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

## Contents

## Not implemented[edit]

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

### A

- AVL tree
- Abbreviations, automatic
- Abbreviations, easy
- Abbreviations, simple
- Abelian sandpile model
- Active Directory/Connect
- Active Directory/Search for a user
- Aliquot sequence classifications
- Angles (geometric), normalization and conversion
- Append a record to the end of a text file
- Approximate Equality
- Archimedean spiral
- Arithmetic-geometric mean/Calculate Pi
- Averages/Mean time of day

### B

### C

- Canny edge detector
- Cantor set
- Cartesian product of two or more lists
- Casting out nines
- Catmull–Clark subdivision surface
- Chaocipher
- Chaos game
- Check Machin-like formulas
- Chinese zodiac
- Church Numerals
- Circles of given radius through two points
- Color of a screen pixel
- Color quantization
- Colour bars/Display
- Colour pinstripe/Display
- Colour pinstripe/Printer
- Combinations and permutations
- Commatizing numbers
- Compare sorting algorithms' performance
- Compiler/AST interpreter
- Compiler/code generator
- Compiler/lexical analyzer
- Compiler/syntax analyzer
- Compiler/virtual machine interpreter
- Continued fraction/Arithmetic/Construct from rational number
- Create a file on magnetic tape
- Cuban primes
- Currency
- Currying
- Cut a rectangle

### D

### E

### F

- FTP
- Factorial base numbers indexing permutations of a collection
- Farey sequence
- Fibonacci word/fractal
- Find largest left truncatable prime in a given base
- First perfect square in base N with N unique digits
- Fixed length records
- Floyd-Warshall algorithm
- Four is magic
- Four is the number of letters in the ...
- Fractal tree
- Function frequency
- Functional coverage tree

### G

### H

### I

### K

### L

### M

### N

### P

- P-value correction
- Paraffins
- Parallel Brute Force
- Parse an IP Address
- Parsing/Shunting-yard algorithm
- Partition an integer X into N primes
- Password generator
- Peaceful chess queen armies
- Peano curve
- Pell's equation
- Penney's game
- Pentagram
- Percolation/Bond percolation
- Percolation/Mean cluster density
- Percolation/Mean run density
- Percolation/Site percolation
- Perfect totient numbers
- Permutations/Rank of a permutation
- Permutations by swapping
- Pinstripe/Display
- Pinstripe/Printer
- Plasma effect
- Play recorded sounds
- Poker hand analyser
- Polyspiral
- Prime conspiracy
- Primes - allocate descendants to their ancestors
- Primorial numbers
- Pythagoras tree
- Pythagorean quadruples

### R

- RCRPG
- RIPEMD-160
- RPG Attributes Generator
- Ramer-Douglas-Peucker line simplification
- Ranking methods
- Rare numbers
- Recaman's sequence
- Record sound
- Reflection/Get source
- Reflection/List methods
- Reflection/List properties
- Retrieve and search chat history
- Rosetta Code/Find bare lang tags
- Rosetta Code/Fix code tags

### S

- SHA-256
- SOAP
- SQL-based authentication
- Safe primes and unsafe primes
- Sailors, coconuts and a monkey problem
- Scope/Function names and labels
- Sequence: nth number with exactly n divisors
- Sequence: smallest number with exactly n divisors
- Sequence of primorial primes
- Set of real numbers
- Sexy primes
- Shortest common supersequence
- Sierpinski pentagon
- Sierpinski triangle/Graphical
- Simple database
- Simulate input/Keyboard
- Simulate input/Mouse
- Smarandache prime-digital sequence
- Sokoban
- Solve a Hidato puzzle
- Solve a Hopido puzzle
- Solve a Numbrix puzzle
- Sorting algorithms/Bead sort
- Sorting algorithms/Patience sort
- Sorting algorithms/Permutation sort
- Sorting algorithms/Strand sort
- Sparkline in unicode
- Speech synthesis
- Spelling of ordinal numbers
- Square-free integers
- State name puzzle
- Statistics/Normal distribution
- Straddling checkerboard
- Stream Merge
- Strong and weak primes
- Successive prime differences
- Suffixation of decimal numbers
- Sum and Product Puzzle
- Sum multiples of 3 and 5
- Sunflower fractal
- Superellipse
- Superpermutation minimisation

### T

- Table creation/Postal addresses
- Tarjan
- Taxicab numbers
- Terminal control/Coloured text
- Terminal control/Cursor movement
- Terminal control/Dimensions
- Terminal control/Hiding the cursor
- Terminal control/Positional read
- Terminal control/Preserve screen
- Terminal control/Unicode output
- Test integerness
- Textonyms
- The ISAAC Cipher
- Tokenize a string with escaping
- Tonelli-Shanks algorithm
- Topic variable
- Total circles area
- Truth table

### W

### Draft tasks without implementation[edit]

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 Ada (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.

### 2

### A

### B

### C

- Card shuffles
- Chebyshev coefficients
- Checksumcolor
- Chemical Calculator
- Chernick's Carmichael numbers
- Cheryl's Birthday
- Chess player
- Chess player/Move generation
- Chess player/Program options and user interface
- Chess player/Search and evaluation
- Cipolla's algorithm
- Code segment unload
- Color wheel
- Combinations with repetitions/Square Digit Chain
- Continued fraction/Arithmetic/G(matrix NG, Contined Fraction N)
- Continued fraction/Arithmetic/G(matrix NG, Contined Fraction N1, Contined Fraction N2)
- Create an object/Native demonstration
- Curve that touches three points
- Cycle detection

### D

### E

### F

- Factorions
- Faulhaber's formula
- Faulhaber's triangle
- Feigenbaum constant calculation
- Fermat numbers
- Fibonacci heap
- File extension is in extensions list
- File size distribution
- Find URI in text
- Find duplicate files
- Find first and last set bit of a long integer
- Find the intersection of a line with a plane
- Finite state machine
- Fraction reduction
- Free polyominoes enumeration
- French Republican calendar

### G

### H

### I

### L

### M

### N

### O

### P

- Palindromic gapful numbers
- Parse EBNF
- Parse command-line arguments
- Particle Swarm Optimization
- Penrose tiling
- Pentomino tiling
- Perceptron
- Perlin noise
- Permutations with repetitions
- Permutations with some identical elements
- Pierpont primes
- Playfair cipher
- Polynomial synthetic division
- Print debugging statement
- Process SMIL directives in XML data
- Proof

### R

- Railway circuit
- Ramanujan's constant
- Ramsey's theorem
- Random Latin Squares
- Raster bars
- Read a file character by character/UTF8
- Readline interface
- Recursive descent parser generator
- Reflection/List methods
- Remote agent/Agent interface
- Remote agent/Agent logic
- Remote agent/Simulation
- Resistance Calculator
- Resistance Network Calculator
- Reverse the gender of a string
- Robots
- Rosetta Code/List authors of task descriptions
- Rosetta Code/Rank languages by number of users
- Rosetta Code/Run examples
- Rosetta Code/Tasks sorted by average lines of code
- Rosetta Code/Tasks without examples
- Run as a daemon or service

### S

- Safe mode
- Sattolo cycle
- Selective File Copy
- Self-hosting compiler
- Separate the house number from the street name
- Simulated annealing
- Sine wave
- Singly-linked list/Element removal
- Snake
- Snake And Ladder
- Solve a Rubik's Cube
- Solving coin problems
- Sorting Algorithms/Circle Sort
- Sorting algorithms/Cycle sort
- Sorting algorithms/Tree sort on a linked list
- Spoof game
- Starting a web browser
- Stirling numbers of the first kind
- Stirling numbers of the second kind
- Suffix tree
- Sum data type
- Super-d numbers

### T

- Table creation
- Tamagotchi emulator
- Teacup rim text
- Terminal control/Restricted width positional input/No wrapping
- Terminal control/Restricted width positional input/With wrapping
- Tetris
- Text between
- Text to HTML
- Time-based One-time Password Algorithm
- Topological sort/Extracted top item
- Transportation problem
- Tree datastructures
- Two Sum
- Type detection

### U

### W

## Requiring Attention[edit]

### Examples[edit]

These tasks have implementations in Ada, 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.

### No pages found.

### Other pages[edit]

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

### No pages found.

## Not Considered[edit]

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

## End of List[edit]

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