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.
A
B
C
- CUSIP
- Calendar - for "REAL" programmers
- Canny edge detector
- Carmichael 3 strong pseudoprimes
- Catmull–Clark subdivision surface
- Chaos game
- Chat server
- Check Machin-like formulas
- Checkpoint synchronization
- Chinese remainder theorem
- Color quantization
- 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
- Convert decimal number to rational
- Cramer's rule
- Cut a rectangle
D
- Deal cards for FreeCell
- Death Star
- Deconvolution/1D
- Deconvolution/2D+
- Deepcopy
- Delegates
- Determine if only one instance is running
- Dining philosophers
- Distributed programming
- Documentation
- Doubly-linked list/Definition
- Doubly-linked list/Element definition
- Doubly-linked list/Element insertion
- Doubly-linked list/Traversal
- Draw a cuboid
- Draw a pixel
- Draw a rotating cube
- Dynamic variable names
E
F
K
L
M
N
P
- Parallel Brute Force
- Parallel calculations
- Parametrized SQL statement
- Parsing/RPN to infix conversion
- Parsing/Shunting-yard algorithm
- Partition an integer X into N primes
- Pathological floating point problems
- Penney's game
- Pentagram
- Percentage difference between images
- Percolation/Bond percolation
- Percolation/Mean cluster density
- Percolation/Mean run density
- Percolation/Site percolation
- Perfect shuffle
- Permutation test
- Permutations/Rank of a permutation
- Pig the dice game
- Pig the dice game/Player
- Pinstripe/Display
- Pinstripe/Printer
- Plasma effect
- Play recorded sounds
- Poker hand analyser
- Polymorphism
- Polynomial long division
- Polynomial regression
- Polyspiral
- Population count
- Primes - allocate descendants to their ancestors
- Primorial numbers
- Pythagoras tree
- Pythagorean quadruples
- Pythagorean triples
R
S
- S-Expressions
- SOAP
- SQL-based authentication
- Sailors, coconuts and a monkey problem
- Same Fringe
- Scope modifiers
- Self-referential sequence
- Sequence of primorial primes
- Set of real numbers
- Set puzzle
- Seven-sided dice from five-sided dice
- Sierpinski pentagon
- Sierpinski triangle/Graphical
- Smith numbers
- Sokoban
- Solve a Hidato puzzle
- Solve a Holy Knight's tour
- Solve a Hopido puzzle
- Solve a Numbrix puzzle
- Solve the no connection puzzle
- Sort a list of object identifiers
- Sort three variables
- Sorting algorithms/Bead sort
- Sorting algorithms/Cocktail sort
- Sorting algorithms/Gnome sort
- Sorting algorithms/Pancake sort
- Sorting algorithms/Permutation sort
- Sorting algorithms/Radix sort
- Sorting algorithms/Strand sort
- Special variables
- Statistics/Normal distribution
- Straddling checkerboard
- Stream Merge
- Subleq
- Subtractive generator
- Sum to 100
- Superellipse
T
V
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 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
- Calculating the value of e
- Card shuffles
- Chaocipher
- Chebyshev coefficients
- Chess player
- Chess player/Move generation
- Chess player/Program options and user interface
- Chess player/Search and evaluation
- 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)
- Create an object/Native demonstration
- Cycle detection
D
E
F
- Faulhaber's formula
- Faulhaber's triangle
- Feigenbaum constant calculation
- Fibonacci heap
- File size distribution
- Find URI in text
- Find duplicate files
- Find first and last set bit of a long integer
- Finite state machine
- Four is magic
- Free polyominoes enumeration
- French Republican calendar
- Functional coverage tree
G
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
L
M
- Magic 8-Ball
- Make a backup file
- Markov chain text generator
- Mastermind
- Matrix chain multiplication
- Modular arithmetic
- Monads/List monad
- Monads/Maybe monad
- Monads/Writer monad
- Montgomery reduction
- Morpion solitaire
- Most frequent k chars distance
- Multi-dimensional array
- Multidimensional Newton-Raphson method
O
P
R
- Railway circuit
- 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/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
- Sattolo cycle
- Selective File Copy
- Shortest common supersequence
- Simulated annealing
- Sine wave
- Singly-linked list/Element removal
- Snake
- Snake And Ladder
- Solve a Rubik's Cube
- Solving coin problems
- Sorting Algorithms/Circle Sort
- Sorting algorithms/Patience sort
- Sorting algorithms/Tree sort on a linked list
- Spelling of ordinal numbers
- Spinning rod animation/Text
- Spoof game
- Subset sum problem
- Substitution Cipher
- Suffix tree
- Superpermutation minimisation
T
- Tamagotchi emulator
- Tarjan
- Terminal control/Restricted width positional input/No wrapping
- Terminal control/Restricted width positional input/With wrapping
- Tetris
- Text between
- Text to HTML
- Time-based One-time Password Algorithm
- Tonelli-Shanks algorithm
- Topological sort/Extracted top item
- Transportation problem
- Two Sum
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.
A
C
E
F
R
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.
