Reports:Tasks not implemented in Scala
From Rosetta Code
Awareness
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.
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.
2
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
- Colour pinstripe/Printer
- Combinations and permutations
- Compare sorting algorithms' performance
- Continued fraction/Arithmetic/Construct from rational number
- Copy stdin to stdout
- Cramer's rule
- Cut a rectangle
- Cyclotomic polynomial
D
- De Bruijn sequences
- Death Star
- Deconvolution/2D+
- Deepcopy
- Deming's Funnel
- Determine if a string has all unique characters
- Determine if a string is squeezable
- Dice game probabilities
- Dining philosophers
- Display an outline as a nested table
- Distributed programming
- Doubly-linked list/Definition
- Doubly-linked list/Element definition
- Doubly-linked list/Element insertion
- Dynamic variable names
E
F
- Faces from a mesh
- Factorial base numbers indexing permutations of a collection
- Fairshare between two and more
- File size distribution
- Find duplicate files
- First class environments
- First perfect square in base n with n unique digits
- Fixed length records
- Floyd-Warshall algorithm
- Formal power series
- Four is magic
- Four is the number of letters in the ...
- Fraction reduction
- Function frequency
- Function prototype
- Functional coverage tree
- Fusc sequence
G
I
K
L
M
- Magic 8-ball
- Magic squares of singly even order
- Main step of GOST 28147-89
- Mastermind
- Matrix chain multiplication
- Matrix digital rain
- 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
- Minkowski question-mark function
- Monads/List monad
- Monads/Maybe monad
- Monads/Writer monad
- Multiple regression
- Multiplicative order
- Mutex
N
P
- P-value correction
- Palindrome dates
- Palindromic gapful numbers
- Parallel calculations
- Parsing/RPN to infix conversion
- Parsing/Shunting-yard algorithm
- Partition function P
- Pathological floating point problems
- Peaceful chess queen armies
- Peano curve
- Pell's equation
- Penney's game
- Percentage difference between images
- Percolation/Bond percolation
- Percolation/Mean cluster density
- Percolation/Mean run density
- Percolation/Site percolation
- Perlin noise
- Pierpont primes
- Pig the dice game/Player
- Pinstripe/Printer
- Play recorded sounds
- Playfair cipher
- Polynomial long division
- Primality by Wilson's theorem
- Primes - allocate descendants to their ancestors
- Pseudo-random numbers/Combined recursive generator MRG32k3a
- Pseudo-random numbers/PCG32
- Pseudo-random numbers/Xorshift star
R
S
- S-expressions
- SHA-256 Merkle tree
- SOAP
- SQL-based authentication
- Safe primes and unsafe primes
- Same fringe
- 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
- Shortest common supersequence
- Sierpinski triangle/Graphical
- Smarandache prime-digital sequence
- 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
- Statistics/Normal distribution
- Stirling numbers of the first kind
- Stirling numbers of the second kind
- Subtractive generator
- Suffixation of decimal numbers
- Sunflower fractal
- Super-d numbers
T
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
- Changeable words
- Checksumcolor
- Chemical calculator
- Chess player
- Combinations with repetitions/Square digit chain
- Compiler/Verifying syntax
- Continued fraction/Arithmetic/G(matrix ng, continued fraction n)
- Continued fraction/Arithmetic/G(matrix ng, continued fraction n1, continued fraction n2)
- Count the coins/0-1
- Curve that touches three points
E
F
G
L
- Latin Squares in reduced form/Randomizing using Jacobson and Matthews’ Technique
- 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
- Longest common suffix
- Longest palindromic substrings
M
N
P
- Pancake numbers
- Parse EBNF
- Particle swarm optimization
- Pentomino tiling
- Permutations with some identical elements
- Pisano period
- Powerful numbers
- Price list behind API
- Prime words
- Print debugging statement
- Print itself
- Process SMIL directives in XML data
- Product of divisors
- Proof
- Pseudo-random numbers/Splitmix64
- Pseudorandom number generator image
R
- Railway circuit
- Ramsey's theorem
- Random Latin squares
- Range modifications
- Raster bars
- Readline interface
- Recursive descent parser generator
- Remote agent/Agent interface
- Remote agent/Agent logic
- Remote agent/Simulation
- Remove vowels from a string
- Resistance calculator
- Resistance network calculator
- Robots
- Rosetta Code/List authors of task descriptions
- Rosetta Code/Rank languages by number of users
- Rosetta Code/Run examples
- Rosetta Code/Tasks without examples
- Run as a daemon or service
S
- Selective file copy
- Sierpinski arrowhead curve
- Sierpinski curve
- Sierpinski square curve
- Simulated annealing
- Singly-linked list/Element removal
- Smallest enclosing circle problem
- Snake
- Snake and Ladder
- Solve a Rubik's Cube
- Solve triangle solitare puzzle
- Solving coin problems
- Sorting algorithms/Tree sort on a linked list
- Spoof game
- Square root by hand
- Strassen's algorithm
- Suffix tree
- Sum of divisors
T
- Tamagotchi emulator
- Tau function
- Tau number
- 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
- Twin primes
- Two bullet roulette
U
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
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.
