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
B
C
- Calkin-Wilf sequence
- Canny edge detector
- Canonicalize CIDR
- Casting out nines
- Catmull–Clark subdivision surface
- Chaos game
- Check Machin-like formulas
- Chernick's Carmichael numbers
- Church numerals
- Circles of given radius through two points
- Circular primes
- Cistercian numerals
- Color of a screen pixel
- Color quantization
- Color wheel
- Colorful numbers
- Combinations and permutations
- Commatizing numbers
- Compare sorting algorithms' performance
- Compiler/AST interpreter
- Compiler/code generator
- Compiler/syntax analyzer
- Composite numbers k with no single digit factors whose factors are all substrings of k
- Consecutive primes with ascending or descending differences
- Continued fraction/Arithmetic/Construct from rational number
- Create a file on magnetic tape
- Cuban primes
- Cullen and Woodall numbers
- Curzon numbers
- Cut a rectangle
- Cyclops numbers
- Cyclotomic polynomial
D
E
- Earliest difference between prime gaps
- Eban numbers
- Eertree
- Egyptian fractions
- Elementary cellular automaton/Infinite length
- Elementary cellular automaton/Random Number Generator
- Elliptic Curve Digital Signature Algorithm
- Elliptic curve arithmetic
- Equal prime and composite sums
- Erdös-Selfridge categorization of primes
- Esthetic numbers
- Euler's constant 0.5772...
F
- FTP
- Faces from a mesh
- Factorial base numbers indexing permutations of a collection
- Factorions
- Fairshare between two and more
- Farey sequence
- Faulhaber's formula
- Faulhaber's triangle
- Fermat numbers
- Fibonacci word/fractal
- Find Chess960 starting position identifier
- Find duplicate files
- Find if a point is within a triangle
- Find largest left truncatable prime in a given base
- First perfect square in base n with n unique digits
- First power of 2 that has leading decimal digits of 12
- Fortunate numbers
- Four is magic
- Four is the number of letters in the ...
- French Republican calendar
- Function frequency
- Functional coverage tree
G
H
I
K
L
- Lah numbers
- Largest number divisible by its digits
- Latin Squares in reduced form
- Latin Squares in reduced form/Randomizing using Jacobson and Matthews’ Technique
- Left factorials
- Legendre prime counting function
- Levenshtein distance/Alignment
- List rooted trees
- Long literals, with continuations
- Long primes
- Longest increasing subsequence
- Lucky and even lucky numbers
- Lychrel numbers
M
- Machine code
- Magic constant
- Magic squares of doubly even order
- Magic squares of singly even order
- Magnanimous numbers
- Main step of GOST 28147-89
- Mayan calendar
- Mayan numerals
- Merge and aggregate datasets
- Mertens function
- Metallic ratios
- Mind boggling card trick
- Minimal steps down to 1
- Minimum multiple of m where digital sum equals m
- Minimum positive multiple in base 10 using only 0 and 1
- Minkowski question-mark function
- Monads/List monad
- Monads/Maybe monad
- Monads/Writer monad
- Motzkin numbers
- Multi-base primes
- Musical scale
- Möbius function
N
O
P
- P-Adic numbers, basic
- P-Adic square roots
- P-value correction
- Padovan n-step number sequences
- Padovan sequence
- Palindromic gapful numbers
- Pancake numbers
- Paraffins
- Parse an IP Address
- Parsing/Shunting-yard algorithm
- Particle fountain
- Partition an integer x into n primes
- Partition function P
- Peaceful chess queen armies
- Peano curve
- Pell numbers
- Penney's game
- Pentomino tiling
- Percolation/Bond percolation
- Percolation/Mean cluster density
- Percolation/Mean run density
- Percolation/Site percolation
- Perfect totient numbers
- Peripheral drift illusion
- Perlin noise
- Permutations/Rank of a permutation
- Permutations by swapping
- Pierpont primes
- Pisano period
- Plasma effect
- Play recorded sounds
- Playfair cipher
- Poker hand analyser
- Polyspiral
- Prime conspiracy
- Prime triangle
- Primes - allocate descendants to their ancestors
- Primorial numbers
- Pythagorean quadruples
R
- RCRPG
- RPG attributes generator
- Ramanujan's constant
- Ramanujan primes/twins
- Ramer-Douglas-Peucker line simplification
- Random Latin squares
- Random sentence from book
- Ranking methods
- Rare numbers
- Read a file character by character/UTF8
- Recaman's sequence
- Record sound
- Reflection/Get source
- Reflection/List methods
- Reflection/List properties
- Repunit primes
- Retrieve and search chat history
- Rhonda numbers
- Rosetta Code/Find bare lang tags
- Rosetta Code/Fix code tags
- Rosetta Code/Rank languages by number of users
- Ruth-Aaron numbers
S
- SHA-256 Merkle tree
- SOAP
- SQL-based authentication
- Safe primes and unsafe primes
- Sailors, coconuts and a monkey problem
- Scope/Function names and labels
- Search in paragraph's text
- Self numbers
- Sequence: nth number with exactly n divisors
- Sequence: smallest number with exactly n divisors
- Sequence of primorial primes
- Set of real numbers
- Sexy primes
- Sierpinski pentagon
- Sierpinski square curve
- Sierpinski triangle/Graphical
- Simple database
- Simulate input/Keyboard
- Simulate input/Mouse
- Sleeping Beauty problem
- Smallest number k such that k+2^m is composite for all m less than k
- Smarandache prime-digital sequence
- Sokoban
- Solve a Hidato puzzle
- Solve a Hopido puzzle
- Solve a Numbrix puzzle
- Sort an outline at every level
- Sorting Algorithms/Circle Sort
- Sorting algorithms/Bead sort
- Sorting algorithms/Cocktail sort with shifting bounds
- Sorting algorithms/Patience sort
- Sorting algorithms/Permutation sort
- Sorting algorithms/Strand sort
- Sparkline in unicode
- Speech synthesis
- Spelling of ordinal numbers
- Square-free integers
- Square form factorization
- State name puzzle
- Statistics/Normal distribution
- Stirling numbers of the first kind
- Stirling numbers of the second kind
- Straddling checkerboard
- Strassen's algorithm
- Strong and weak primes
- Successive prime differences
- Suffixation of decimal numbers
- Sum and product puzzle
- Summarize primes
- Super-d numbers
- Superpermutation minimisation
- Sylvester's sequence
T
- Table creation/Postal addresses
- Tarjan
- Tau function
- Tau number
- Taxicab numbers
- Teacup rim text
- Terminal control/Dimensions
- Terminal control/Positional read
- Terminal control/Preserve screen
- Terminal control/Unicode output
- Test integerness
- Textonyms
- The ISAAC Cipher
- The sieve of Sundaram
- Tonelli-Shanks algorithm
- Topic variable
- Total circles area
- Tree datastructures
- Tree from nesting levels
- Truth table
- Twin primes
- Two bullet roulette
U
V
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.
A
B
C
- CLI-based maze-game
- Camel case and snake case
- Card shuffles
- Chebyshev coefficients
- Checksumcolor
- Chemical calculator
- Chess player
- Cipolla's algorithm
- Code Golf: Code Golf
- Code segment unload
- Collect and sort square numbers in ascending order from three lists
- Combinations with repetitions/Square digit chain
- Compiler/Simple file inclusion pre processor
- Compiler/Verifying syntax
- Conjugate a Latin verb
- Continued fraction/Arithmetic/G(matrix ng, continued fraction n)
- Continued fraction/Arithmetic/G(matrix ng, continued fraction n1, continued fraction n2)
- Coprime triplets
- Coprimes
- Count the coins/0-1
- Create an object/Native demonstration
- Create your own text control codes
- Cubic special primes
- Cycles of a permutation
D
- Data Encryption Standard
- Dating agency
- Decimal floating point number to binary
- Diophantine linear system solving
- Discrete Fourier transform
- Distinct palindromes within decimal numbers
- Distribution of 0 digits in factorial series
- Divide a rectangle into a number of unequal triangles
- Dominoes
- Doomsday rule
E
F
- Fibonacci heap
- Fibonacci matrix-exponentiation
- Find URI in text
- Find adjacent primes which differ by a square integer
- Find first missing positive
- Find minimum number of coins that make a given value
- Find squares n where n+1 is prime
- Finite state machine
- First 9 prime Fibonacci number
- Free polyominoes enumeration
- Frobenius numbers
G
I
L
- Largest difference between adjacent primes
- Largest palindrome product
- Largest prime factor
- Largest product in a grid
- Last list item
- Launch rocket with countdown and acceleration in stdout
- Line circle intersection
- Linux CPU utilization
- Long stairs
- Longest palindromic substrings
- Longest substrings without repeating characters
M
- Make a backup file
- Markov chain text generator
- Maximum difference between adjacent elements of list
- Mersenne primes
- Minimum number of cells after, before, above and below NxN squares
- Minimum primes
- Montgomery reduction
- Morpion solitaire
- Most frequent k chars distance
- Multidimensional Newton-Raphson method
- Multiton
N
- N-body problem
- N-queens minimum and knights and bishops
- NYSIIS
- Names to numbers
- Native shebang
- Neighbour primes
- Next special primes
- Nice primes
- Nimber arithmetic
- Number triplets game
- Numbers in base-16 representation that cannot be written with decimal digits
- Numbers in base 10 that are palindromic in bases 2, 4, and 16
- Numbers which binary and ternary digit sum are prime
- Numbers whose count of divisors is prime
- Numbers with prime digits whose sum is 13
- Numerical integration/Adaptive Simpson's method
O
P
- Palindromic primes
- Palindromic primes in base 16
- Pandigital prime
- Parse EBNF
- Parse command-line arguments
- Particle swarm optimization
- Penrose tiling
- Perceptron
- Permutations with repetitions
- Permutations with some identical elements
- Permuted multiples
- Piprimes
- Polynomial derivative
- Polynomial synthetic division
- Powerful numbers
- Practical numbers
- Price list behind API
- Prime numbers p for which the sum of primes less than or equal to p is prime
- Prime numbers which contain 123
- Prime triplets
- Prime words
- Primes which contain only one odd digit
- Primes whose first and last number is 3
- Primes whose sum of digits is 25
- Primes with digits in nondecreasing order
- Print debugging statement
- Print itself
- Process SMIL directives in XML data
- Product of divisors
- Proof
- Pseudorandom number generator image
R
- Railway circuit
- Ramanujan primes
- Ramsey's theorem
- Range modifications
- Readline interface
- Recursive descent parser generator
- 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/Run examples
- Rosetta Code/Tasks without examples
- Round-robin tournament schedule
- Run as a daemon or service
S
- Safe and Sophie Germain primes
- Safe mode
- Sanitize user input
- Sattolo cycle
- Segmentation fault protection
- Selective file copy
- Self-hosting compiler
- Separate the house number from the street name
- Sierpinski curve
- Sine wave
- Singly-linked list/Element removal
- Smallest enclosing circle problem
- Smallest multiple
- Smallest numbers
- Smallest power of 6 whose decimal expansion contains n
- Smallest square that begins with n
- Snake and Ladder
- Solve a Rubik's Cube
- Solve equations with substitution method
- Solve triangle solitare puzzle
- Solving coin problems
- Sort primes from list to a list
- Sorting algorithms/Cycle sort
- Sorting algorithms/Tree sort on a linked list
- Special divisors
- Special factorials
- Special neighbor primes
- Special pythagorean triplet
- Spoof game
- Square root by hand
- Starting a web browser
- Steady squares
- Strange numbers
- Strange plus numbers
- Strange unique prime triplets
- Substring primes
- Suffix tree
- Sum of divisors
- Sum of primes in odd positions is prime
- Sum of square and cube digits of an integer are primes
- Sum of the digits of n is substring of n
- Sum of two adjacent numbers are primes
- Summation of primes
- Sunflower fractal
T
- Table creation
- Tamagotchi emulator
- Terminal control/Restricted width positional input/No wrapping
- Terminal control/Restricted width positional input/With wrapping
- Tetris
- Text completion
- Text to HTML
- Three word location
- Time-based one-time password algorithm
- Topological sort/Extracted top item
- Transportation problem
- Tropical algebra overloading
- 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.
