Reports:Tasks not implemented in Ada
From Rosetta Code
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.
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
- AKS test for primes
- AVL tree
- Abundant, deficient and perfect number classifications
- Active Directory/Connect
- Active Directory/Search for a user
- Aliquot sequence classifications
- Amicable pairs
- Append a record to the end of a text file
- Archimedean spiral
- Arithmetic-geometric mean/Calculate Pi
- Averages/Mean time of day
B
C
- CUSIP
- Canny edge detector
- Cartesian product of two or more lists
- Casting out nines
- Catmull–Clark subdivision surface
- Chaos game
- Check Machin-like formulas
- Chinese zodiac
- 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
- Cramer's rule
- Create a file on magnetic tape
- Currying
- Cut a rectangle
D
F
G
H
K
M
N
P
- Paraffins
- Parallel Brute Force
- Parse an IP Address
- Parsing/Shunting-yard algorithm
- Partition an integer X into N primes
- Pascal matrix generation
- Password generator
- Penney's game
- Pentagram
- Percolation/Bond percolation
- Percolation/Mean cluster density
- Percolation/Mean run density
- Percolation/Site percolation
- Permutations/Rank of a permutation
- Permutations by swapping
- Pinstripe/Display
- Pinstripe/Printer
- Plasma effect
- Play recorded sounds
- Poker hand analyser
- Polyspiral
- Primes - allocate descendants to their ancestors
- Primorial numbers
- Pythagoras tree
- Pythagorean quadruples
R
S
- SHA-256
- SOAP
- SQL-based authentication
- Sailors, coconuts and a monkey problem
- Scope/Function names and labels
- Search a list of records
- Set of real numbers
- Shoelace formula for polygonal area
- Sierpinski pentagon
- Sierpinski triangle/Graphical
- Simple database
- Simulate input/Keyboard
- Simulate input/Mouse
- Sokoban
- Solve a Hidato puzzle
- Solve a Hopido puzzle
- Solve a Numbrix puzzle
- Sort a list of object identifiers
- Sort stability
- Sort three variables
- Sorting algorithms/Bead sort
- Sorting algorithms/Permutation sort
- Sorting algorithms/Strand sort
- Sparkline in unicode
- Speech synthesis
- State name puzzle
- Statistics/Normal distribution
- Straddling checkerboard
- Stream Merge
- String append
- Sudoku
- Sum and Product Puzzle
- Sum multiples of 3 and 5
- Superellipse
T
- Table creation/Postal addresses
- 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
- Topic variable
- Total circles area
- Truth table
W
Draft tasks without implementation[edit]
These tasks as 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.
A
- A* search algorithm
- ASCII art diagram converter
- Abbreviations, automatic
- Abbreviations, easy
- Abbreviations, simple
- Addition-chain exponentiation
- Addition chains
- Angle difference between two bearings
- Apply a digitial filter (direct form II transposed)
- Arithmetic coding/As a generalized change of radix
- Aspect Oriented Programming
- Assertions in design by contract
- AudioAlarm
- Audio Overlap Loop
- Audio frequency generator
B
C
- Calculate P-Value
- Card shuffles
- Chebyshev coefficients
- 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)
- Convex hull
- Create an object/Native demonstration
- Currency
- Cycle detection
D
E
F
- Faulhaber's formula
- Faulhaber's triangle
- 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
- Find the intersection of two lines
- Finite state machine
- Four is the number of letters in the ...
- Free polyominoes enumeration
- French Republican calendar
- Functional coverage tree
G
H
I
- I.Q. Puzzle
- IPC via named pipe
- IRC gateway
- Idiomatically determine all the characters that can be used for symbols
- Idiomatically determine all the lowercase and uppercase letters
- Imaginary base numbers
- Implicit type conversion
- Index finite lists of positive integers
- Input/Output for Lines of Text
- Input/Output for Pairs of Numbers
- Integer roots
L
M
O
P
R
- Railway circuit
- Ramer-Douglas-Peucker line simplification
- Ramsey's theorem
- 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
- Reverse the gender of a string
- Robots
- Rosetta Code/List authors of task descriptions
- Rosetta Code/Run examples
- Rosetta Code/Tasks sorted by average lines of code
- Run as a daemon or service
S
- Sattolo cycle
- Selective File Copy
- Self-hosting compiler
- Separate the house number from the street name
- Sequence of primorial primes
- Shortest common supersequence
- Simulated annealing
- 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/Patience sort
- Sorting algorithms/Tree sort on a linked list
- Spelling of ordinal numbers
- Starting a web browser
- Suffix tree
- Superpermutation minimisation
T
- Table creation
- Tamagotchi emulator
- Tarjan
- Tasks without examples
- Terminal control/Restricted width positional input/No wrapping
- Terminal control/Restricted width positional input/With wrapping
- Tetris
- Text to HTML
- Time-based One-time Password Algorithm
- Tonelli-Shanks algorithm
- Topological sort/Extracted top item
- Transportation problem
- 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.
