Reports:Tasks not implemented in Rust
From Rosetta Code
Awareness
If Rust is a language you like, or are interested in, please inform your fellow members of the Rust community; this page can't be emptied without your and their participation.
If Rust is a language you like, or are interested in, please inform your fellow members of the Rust community; this page can't be emptied without your and their participation.
Contents
Not implemented[edit]
These are currently not implemented in Rust. Please implement some if you can. If any tasks are not possible or too complex in Rust, they should not be on this list. To mark a task as such, add {{omit from|Rust}}, preserving the capitalization of the language, to that task. It will appear below under the "Not Considered" section.
B
- Balanced ternary
- Bioinformatics/Sequence mutation
- Biorhythms
- Bitcoin/public point to address
- Bitmap/Bézier curves/Cubic
- Bitmap/Bézier curves/Quadratic
- Bitmap/Histogram
- Bitmap/Midpoint circle algorithm
- Bitmap/PPM conversion through a pipe
- Bitmap/Read a PPM file
- Bitmap/Read an image through a pipe
- Brazilian numbers
- Bulls and cows/Player
- Burrows–Wheeler transform
C
- Calendar - for "REAL" programmers
- Canny edge detector
- Cantor set
- Catmull–Clark subdivision surface
- Chat server
- Check Machin-like formulas
- Checkpoint synchronization
- Chernick's Carmichael numbers
- Cheryl's birthday
- Chowla numbers
- Cistercian numerals
- Closest-pair problem
- Color of a screen pixel
- Color quantization
- Colour pinstripe/Display
- Colour pinstripe/Printer
- Combinations and permutations
- Combinations with repetitions
- Commatizing numbers
- Compare sorting algorithms' performance
- Compiler/AST interpreter
- Compiler/code generator
- Compiler/lexical analyzer
- Compiler/syntax analyzer
- Compiler/virtual machine interpreter
- Cyclotomic polynomial
D
- Date manipulation
- De Bruijn sequences
- Death Star
- Deconvolution/1D
- Deconvolution/2D+
- Deming's Funnel
- Determinant and permanent
- Determine if two triangles overlap
- Digital root/Multiplicative digital root
- Dinesman's multiple-dwelling problem
- Display a linear combination
- Display an outline as a nested table
- Distributed programming
- Diversity prediction theorem
- Doubly-linked list/Definition
- Doubly-linked list/Traversal
- Draw a cuboid
- Draw a rotating cube
E
F
- Faces from a mesh
- Factorial base numbers indexing permutations of a collection
- Factorions
- Faulhaber's formula
- Faulhaber's triangle
- Feigenbaum constant calculation
- Find largest left truncatable prime in a given base
- Find palindromic numbers in both binary and ternary bases
- First class environments
- First perfect square in base n with n unique digits
- First power of 2 that has leading decimal digits of 12
- Fivenum
- Flipping bits game
- Flow-control structures
- Formal power series
- Forward difference
- Fraction reduction
- Fractran
- Function frequency
- Function prototype
- Functional coverage tree
G
H
I
K
L
- Lah numbers
- Largest number divisible by its digits
- Latin Squares in reduced form
- Law of cosines - triples
- List rooted trees
- Literals/String
- Long literals, with continuations
- Long multiplication
- Loops/Increment loop index within loop body
- Loops/With multiple ranges
- Loops/Wrong ranges
- Lucky and even lucky numbers
- Ludic numbers
M
- Matrix digital rain
- Median filter
- Memory layout of a data structure
- Merge and aggregate datasets
- Mertens function
- Metallic ratios
- Metered concurrency
- Metronome
- Mian-Chowla sequence
- Minimal steps down to 1
- Minkowski question-mark function
- Modular arithmetic
- Monads/List monad
- Monads/Maybe monad
- Monads/Writer monad
- Multi-dimensional array
- Multifactorial
- Multiple regression
- Multiplicative order
- Multisplit
- Musical scale
N
O
P
- P-value correction
- Paraffins
- Parallel calculations
- Parametrized SQL statement
- Parsing/RPN to infix conversion
- Partial function application
- Pascal's triangle/Puzzle
- Pascal matrix generation
- Password generator
- Pathological floating point problems
- Peaceful chess queen armies
- Pell's equation
- Penney's game
- Pentagram
- Percolation/Bond percolation
- Percolation/Mean cluster density
- Percolation/Mean run density
- Percolation/Site percolation
- Perfect totient numbers
- Permutation test
- Permutations/Derangements
- Permutations/Rank of a permutation
- Permutations by swapping
- Pernicious numbers
- Pierpont primes
- Pig the dice game
- Pig the dice game/Player
- Pinstripe/Display
- Pinstripe/Printer
- Plasma effect
- Play recorded sounds
- Playfair cipher
- Plot coordinate pairs
- Pointers and references
- Poker hand analyser
- Polymorphic copy
- Polymorphism
- Polynomial long division
- Polynomial regression
- Polyspiral
- Pragmatic directives
- Primality by Wilson's theorem
- Primes - allocate descendants to their ancestors
- Problem of Apollonius
- Pseudo-random numbers/Combined recursive generator MRG32k3a
- Pseudo-random numbers/PCG32
- Pseudo-random numbers/Xorshift star
- Pythagoras tree
R
- RIPEMD-160
- RSA code
- Ramanujan's constant
- Ranking methods
- Rare numbers
- Rate counter
- Recaman's sequence
- Record sound
- Reduced row echelon form
- Rendezvous
- Resistor mesh
- Retrieve and search chat history
- Roots of a function
- Roots of a quadratic function
- Rosetta Code/Find bare lang tags
- Rosetta Code/Find unimplemented tasks
- Rosetta Code/Fix code tags
- Rosetta Code/Rank languages by popularity
- Runtime evaluation
- Runtime evaluation/In an environment
S
- S-expressions
- SEDOLs
- SOAP
- SQL-based authentication
- Safe addition
- Safe primes and unsafe primes
- Sailors, coconuts and a monkey problem
- Same fringe
- Scope/Function names and labels
- Scope modifiers
- Secure temporary file
- Self numbers
- Send email
- 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 primes by trial division
- Sequence of primorial primes
- Set consolidation
- Set of real numbers
- Set puzzle
- Seven-sided dice from five-sided dice
- Shoelace formula for polygonal area
- Shortest common supersequence
- Sierpinski triangle
- Simple database
- Singleton
- 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 an outline at every level
- Sorting algorithms/Bead sort
- Sorting algorithms/Patience sort
- Sorting algorithms/Permutation sort
- Sorting algorithms/Radix sort
- Sorting algorithms/Shell sort
- Sorting algorithms/Strand sort
- Soundex
- Special characters
- Special variables
- Speech synthesis
- Square-free integers
- Square but not cube
- Stable marriage problem
- Stack traces
- Stair-climbing puzzle
- State name puzzle
- Statistics/Normal distribution
- Stem-and-leaf plot
- Stern-Brocot sequence
- Stirling numbers of the first kind
- Stirling numbers of the second kind
- Straddling checkerboard
- Stream merge
- Strip block comments
- Strip control codes and extended characters from a string
- Strong and weak primes
- Subleq
- Substitution cipher
- Subtractive generator
- Successive prime differences
- Suffixation of decimal numbers
- Sum and product puzzle
- Sum to 100
- Summarize and say sequence
- Sunflower fractal
- Superellipse
- Superpermutation minimisation
- System time
T
- Table creation/Postal addresses
- Terminal control/Cursor movement
- Terminal control/Cursor positioning
- Terminal control/Dimensions
- Terminal control/Display an extended character
- Terminal control/Hiding the cursor
- Terminal control/Inverse video
- Terminal control/Positional read
- Terminal control/Preserve screen
- Terminal control/Unicode output
- Test integerness
- Text processing/1
- Text processing/2
- The ISAAC Cipher
- The Name Game
- Thiele's interpolation formula
- Tic-tac-toe
- Time a function
- Tonelli-Shanks algorithm
- Topswops
- Total circles area
- Tree datastructures
- Trigonometric functions
- Truncate a file
- Twelve statements
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 Rust (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
- Card shuffles
- Changeable words
- Chebyshev coefficients
- Checksumcolor
- Chemical calculator
- Chess player
- Cipolla's algorithm
- Code segment unload
- 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
- Create an object/Native demonstration
- Curve that touches three points
- Cycle detection
D
E
F
- Fibonacci heap
- Fibonacci matrix-exponentiation
- Find URI in text
- Find first and last set bit of a long integer
- Find if a point is within a triangle
- Find words which odd letters are consonants and even letters are vowels or vice versa
- Finite state machine
- Free polyominoes enumeration
- French Republican calendar
G
I
L
M
N
P
- Pancake numbers
- Parse EBNF
- Particle swarm optimization
- Penrose tiling
- Pentomino tiling
- Perceptron
- Permutations with repetitions
- Permutations with some identical elements
- Pisano period
- Polynomial synthetic division
- Powerful numbers
- Price list behind API
- 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
- Resistance calculator
- Resistance network calculator
- 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 without examples
- Run as a daemon or service
S
- Sattolo cycle
- Selective file copy
- Separate the house number from the street name
- Simulated annealing
- Sine wave
- 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/Cycle sort
- Sorting algorithms/Tree sort on a linked list
- Spoof game
- Square root by hand
- Starting a web browser
- Strassen's algorithm
- Subset sum problem
- Suffix tree
- Sum of divisors
T
- Table creation
- 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
- Two bullet roulette
U
W
Requiring Attention[edit]
Examples[edit]
These tasks have implementations in Rust, 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 Rust 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 Rust was inappropriate for these tasks, or implementations of them would be unenlightening. Feel free to try your hand at them anyway.
R
End of List[edit]
Again, feel free to try your hand at any of the tasks listed on this page.
