Reports:Tasks not implemented in Scala
If Scala is a language you like, or are interested in, please inform your fellow members of the Scala community; this page can't be emptied without your and their participation.
Contents
Not implemented[edit]
These are currently not implemented in Scala. Please implement some if you can. If any tasks are not possible or too complex in Scala, they should not be on this list. To mark a task as such, add {{omit from|Scala}}, preserving the capitalization of the language, to that task. It will appear below under the "Not Considered" section.
A
B
C
- Calendar - for "REAL" programmers
- Calkin-Wilf sequence
- Canny edge detector
- Canonicalize CIDR
- Carmichael 3 strong pseudoprimes
- Catmull–Clark subdivision surface
- Chaocipher
- Chat server
- Check Machin-like formulas
- Chernick's Carmichael numbers
- Church numerals
- Cistercian numerals
- Color quantization
- Color wheel
- Colorful numbers
- Colour pinstripe/Printer
- Combinations and permutations
- Compare length of two strings
- Compare sorting algorithms' performance
- 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
- Cramer's rule
- Cullen and Woodall numbers
- Curzon numbers
- Cut a rectangle
- Cyclops numbers
- Cyclotomic polynomial
D
- De Bruijn sequences
- Death Star
- Deceptive numbers
- Deconvolution/2D+
- Deepcopy
- Deming's Funnel
- Descending primes
- Determine if a string has all unique characters
- Determine if a string is squeezable
- Determine sentence type
- Dice game probabilities
- Dining philosophers
- Disarium numbers
- Display an outline as a nested table
- Distributed programming
- Doubly-linked list/Definition
- Doubly-linked list/Element definition
- Doubly-linked list/Element insertion
- Duffinian numbers
- Dynamic variable names
E
- EKG sequence convergence
- Earliest difference between prime gaps
- Eertree
- Element-wise operations
- Elementary cellular automaton/Infinite length
- Elementary cellular automaton/Random Number Generator
- Elliptic Curve Digital Signature Algorithm
- Elliptic curve arithmetic
- Entropy/Narcissist
- Equal prime and composite sums
- Erdös-Selfridge categorization of primes
- Esthetic numbers
- Euler's constant 0.5772...
- Events
- Execute Computer/Zero
- Execute SNUSP
- Exponentiation with infix operators in (or operating on) the base
- Extensible prime generator
F
- Faces from a mesh
- Factorial base numbers indexing permutations of a collection
- Fairshare between two and more
- File size distribution
- Find Chess960 starting position identifier
- Find duplicate files
- Find if a point is within a triangle
- First class environments
- First perfect square in base n with n unique digits
- Fixed length records
- Floyd-Warshall algorithm
- Formal power series
- Fortunate numbers
- Four is magic
- Four is the number of letters in the ...
- Fraction reduction
- French Republican calendar
- Function frequency
- Function prototype
- Functional coverage tree
- Fusc sequence
G
I
K
L
- LU decomposition
- Lah numbers
- Largest proper divisor of n
- Latin Squares in reduced form
- Latin Squares in reduced form/Randomizing using Jacobson and Matthews’ Technique
- Law of cosines - triples
- Legendre prime counting function
- List rooted trees
- Long literals, with continuations
- Loops/With multiple ranges
- Loops/Wrong ranges
- Lucky and even lucky numbers
M
- Magic constant
- Magic squares of singly even order
- Magnanimous numbers
- Main step of GOST 28147-89
- Mastermind
- Matrix chain multiplication
- Matrix digital rain
- Mayan calendar
- Mayan numerals
- Maze solving
- McNuggets problem
- Median filter
- Merge and aggregate datasets
- Mertens function
- Metallic ratios
- Mian-Chowla sequence
- Mind boggling card trick
- Minesweeper game
- Minimal steps down to 1
- Minimum multiple of m where digital sum equals m
- Minkowski question-mark function
- Modified random distribution
- Monads/List monad
- Monads/Maybe monad
- Monads/Writer monad
- Motzkin numbers
- Multi-base primes
- Multiple regression
- Multiplicative order
- Mutex
- Möbius function
N
O
P
- P-Adic numbers, basic
- P-Adic square roots
- P-value correction
- Padovan n-step number sequences
- Padovan sequence
- Palindrome dates
- Palindromic gapful numbers
- Pancake numbers
- Parallel calculations
- Parsing/RPN to infix conversion
- Parsing/Shunting-yard algorithm
- Particle fountain
- Partition function P
- Pathological floating point problems
- Peaceful chess queen armies
- Peano curve
- Penney's game
- Pentomino tiling
- Percentage difference between images
- Percolation/Bond percolation
- Percolation/Mean cluster density
- Percolation/Mean run density
- Percolation/Site percolation
- Periodic table
- Peripheral drift illusion
- Perlin noise
- Pierpont primes
- Pig the dice game/Player
- Pinstripe/Printer
- Pisano period
- Play recorded sounds
- Playfair cipher
- Polynomial long division
- Primality by Wilson's theorem
- Prime triangle
- Primes - allocate descendants to their ancestors
- Pseudo-random numbers/Combined recursive generator MRG32k3a
- Pseudo-random numbers/Middle-square method
- Pseudo-random numbers/PCG32
- Pseudo-random numbers/Splitmix64
- Pseudo-random numbers/Xorshift star
R
- RCRPG
- Ramanujan's constant
- Ramanujan primes/twins
- Ramer-Douglas-Peucker line simplification
- Random Latin squares
- Random sentence from book
- Range consolidation
- Rare numbers
- Read a file character by character/UTF8
- Reduced row echelon form
- Reflection/Get source
- Rendezvous
- Repunit primes
- Resistor mesh
- Rhonda numbers
- Rosetta Code/Rank languages by number of users
- Runtime evaluation
- Ruth-Aaron numbers
S
- S-expressions
- SHA-256 Merkle tree
- SOAP
- SQL-based authentication
- Safe primes and unsafe primes
- Same fringe
- Search in paragraph's text
- Selectively replace multiple instances of a character within a string
- Self numbers
- Sequence: nth number with exactly n divisors
- Sequence: smallest number greater than previous term with exactly n divisors
- Sequence: smallest number with exactly n divisors
- Sequence of primorial primes
- Set of real numbers
- Set puzzle
- Set right-adjacent bits
- Shortest common supersequence
- Sierpinski arrowhead curve
- Sierpinski square curve
- Sierpinski triangle/Graphical
- Simple turtle graphics
- Sleeping Beauty problem
- Smallest number k such that k+2^m is composite for all m less than k
- Smarandache prime-digital sequence
- Snake
- Sokoban
- Solve a Hidato puzzle
- Solve a Holy Knight's tour
- Solve a Hopido puzzle
- Solve a Numbrix puzzle
- Sort a list of object identifiers
- Sort an outline at every level
- Sort three variables
- Sorting algorithms/Bead sort
- Sorting algorithms/Cocktail sort with shifting bounds
- Sorting algorithms/Pancake sort
- Sorting algorithms/Permutation sort
- Sorting algorithms/Strand sort
- Spelling of ordinal numbers
- Square form factorization
- Statistics/Normal distribution
- Stirling numbers of the first kind
- Stirling numbers of the second kind
- Strassen's algorithm
- Subtractive generator
- Suffixation of decimal numbers
- Sum of elements below main diagonal of matrix
- Summarize primes
- Super-d numbers
- Sylvester's sequence
T
- Table creation/Postal addresses
- Tarjan
- Tau function
- Tau number
- Teacup rim text
- Terminal control/Positional read
- Test integerness
- Textonyms
- The ISAAC Cipher
- The sieve of Sundaram
- Thiele's interpolation formula
- Tonelli-Shanks algorithm
- Topological sort
- 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 Scala (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
- Change e letters to i in words
- Changeable words
- Checksumcolor
- Chemical calculator
- Chess player
- Code Golf: Code Golf
- Collect and sort square numbers in ascending order from three lists
- Combinations with repetitions/Square digit chain
- Common list elements
- Common sorted list
- Compiler/Preprocessor
- Compiler/Simple file inclusion pre processor
- Compiler/Verifying syntax
- Concatenate two primes is also prime
- 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 how many vowels and consonants occur in a string
- Count the coins/0-1
- Cousin primes
- Create your own text control codes
- Cross compilation
- Cubic special primes
- Curve that touches three points
- Cycles of a permutation
D
- Dating agency
- Day of the week of Christmas and New Year
- Digit fifth powers
- Diophantine linear system solving
- Discrete Fourier transform
- Distinct palindromes within decimal numbers
- Distinct power numbers
- Distribution of 0 digits in factorial series
- Divide a rectangle into a number of unequal triangles
- Dominoes
- Doomsday rule
- Doubly-linked list/Element removal
E
F
- Fibonacci heap
- Fibonacci matrix-exponentiation
- Find URI in text
- Find adjacent primes which differ by a square integer
- Find first and last set bit of a long integer
- Find first missing positive
- Find minimum number of coins that make a given value
- Find prime n such that reversed n is also prime
- Find prime numbers of the form n*n*n+2
- Find square difference
- Find squares n where n+1 is prime
- Find words which contain the most consonants
- Find words which contains all the vowels
- Find words which contains more than 3 e vowels
- Find words whose first and last three letters are equal
- Find words with alternating vowels and consonants
- Finite state machine
- First 9 prime Fibonacci number
- Four sides of square
- Frobenius numbers
G
I
L
- Largest difference between adjacent primes
- Largest five adjacent number
- Largest palindrome product
- Largest prime factor
- Largest product in a grid
- Last list item
- Launch rocket with countdown and acceleration in stdout
- Length of an arc between two angles
- Line circle intersection
- Linux CPU utilization
- Logistic curve fitting in epidemiology
- Long stairs
- Longest common suffix
- Longest palindromic substrings
- Longest substrings without repeating characters
M
- Markov chain text generator
- Matrix with two diagonals
- Maximum difference between adjacent elements of list
- Minimum number of cells after, before, above and below NxN squares
- Minimum numbers of three lists
- Minimum primes
- Montgomery reduction
- Morpion solitaire
- Mosaic matrix
- 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 divisible by their individual digits, but not by the product of their digits.
- 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
- Numbers with same digit set in base 10 and base 16
- Numerical integration/Adaptive Simpson's method
O
P
- Palindromic primes
- Palindromic primes in base 16
- Pandigital prime
- Parse EBNF
- Particle swarm optimization
- Permutations with some identical elements
- Permuted multiples
- Piprimes
- Polynomial derivative
- Positive decimal integers with the digit 1 occurring exactly twice
- 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
- Raster bars
- Readline interface
- Recursive descent parser generator
- Red black tree sort
- Remote agent/Agent interface
- Remote agent/Agent logic
- Remote agent/Simulation
- Remove vowels from a string
- Resistance calculator
- Resistance network calculator
- Reverse the order of lines in a text file while preserving the contents of each line
- Robots
- Rodrigues’ rotation formula
- 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
- Sanitize user input
- Segmentation fault protection
- Selective file copy
- Shift list elements to left by 3
- Show the (decimal) value of a number of 1s appended with a 3, then squared
- Sierpinski curve
- Simulated annealing
- 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 hanging lantern problem
- Solve triangle solitare puzzle
- Solving coin problems
- Sort primes from list to a list
- Sort the letters of string in alphabetical order
- Sorting algorithms/Tree sort on a linked list
- Special divisors
- Special factorials
- Special neighbor primes
- Special pythagorean triplet
- Spoof game
- Square root by hand
- Steady squares
- Strange numbers
- Strange plus numbers
- Strange unique prime triplets
- Substring primes
- Suffix tree
- Sum of divisors
- Sum of first n cubes
- 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
- 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
- Transliterate English text using the Greek alphabet
- Transportation problem
- Triplet of three numbers
- Tropical algebra overloading
- Two identical strings
U
W
Requiring Attention[edit]
Examples[edit]
These tasks have implementations in Scala, 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.
C
E
F
M
S
Other pages[edit]
These are other pages related to Scala 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 Scala 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.