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.
B
C
- Calendar - for "REAL" programmers
- Canny edge detector
- Carmichael 3 strong pseudoprimes
- Catmull–Clark subdivision surface
- Chaocipher
- Chat server
- Check Machin-like formulas
- Church Numerals
- Color quantization
- Colour pinstripe/Printer
- Combinations and permutations
- 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
- Cut a rectangle
D
- De Bruijn sequences
- Deal cards for FreeCell
- Death Star
- Deconvolution/2D+
- Deepcopy
- Deming's Funnel
- Determine if a string has all the same characters
- Determine if a string has all unique characters
- Dining philosophers
- Distributed programming
- Doubly-linked list/Definition
- Doubly-linked list/Element definition
- Doubly-linked list/Element insertion
- Dynamic variable names
E
F
- Factorial base numbers indexing permutations of a collection
- 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 ...
- Function frequency
- Function prototype
- Functional coverage tree
- Fusc sequence
K
L
M
N
P
- P-value correction
- Parallel calculations
- Parsing/RPN to infix conversion
- Parsing/Shunting-yard algorithm
- 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
- Pig the dice game/Player
- Pinstripe/Printer
- Play recorded sounds
- Polynomial long division
- Primes - allocate descendants to their ancestors
R
S
- S-Expressions
- SOAP
- SQL-based authentication
- Safe primes and unsafe primes
- Same Fringe
- 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
- Sexy primes
- 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 three variables
- Sorting algorithms/Bead sort
- Sorting algorithms/Pancake sort
- Sorting algorithms/Permutation sort
- Sorting algorithms/Strand sort
- Spelling of ordinal numbers
- Statistics/Normal distribution
- Subtractive generator
- Suffixation of decimal numbers
- Sunflower fractal
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.
2
A
B
C
- Card shuffles
- Checksumcolor
- Chemical Calculator
- Chernick's Carmichael numbers
- Chess player
- Chess player/Move generation
- Chess player/Program options and user interface
- Chess player/Search and evaluation
- 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)
- Copy stdin to stdout
- Curve that touches three points
D
E
F
G
H
I
L
M
N
P
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
- Remote agent/Agent interface
- Remote agent/Agent logic
- Remote agent/Simulation
- 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 sorted by average lines of code
- Rosetta Code/Tasks without examples
- Run as a daemon or service
S
T
- Tamagotchi emulator
- Teacup rim text
- 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
- Topological sort/Extracted top item
- Transportation problem
- Tree datastructures
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.
