Category:Rust
Rust
This programming language may be used to instruct a computer to perform a task.
Listed below are all of the tasks on Rosetta Code which have been solved using Rust.
This programming language may be used to instruct a computer to perform a task.
Official website |
---|
Type strength: | Strong |
---|---|
Type compatibility: | Structural |
Type expression: | Implicit |
Type checking: | Static |
See Also: |
|
Pages in category "Rust"
The following 200 pages are in this category, out of 960 total.
(previous page) (next page)H
- Higher-order functions
- Hilbert curve
- History variables
- Hofstadter Figure-Figure sequences
- Hofstadter Q sequence
- Hofstadter-Conway $10,000 sequence
- Holidays related to Easter
- Home primes
- Honaker primes
- Horizontal sundial calculations
- Horner's rule for polynomial evaluation
- Host introspection
- Hostname
- Hough transform
- HTTP
- HTTPS
- HTTPS/Authenticated
- HTTPS/Client-authenticated
- Huffman coding
- Hunt the Wumpus
I
- I before E except after C
- IBAN
- Identity matrix
- Idiomatically determine all the lowercase and uppercase letters
- Include a file
- Increasing gaps between consecutive Niven numbers
- Increment a numerical string
- Infinity
- Inheritance/Multiple
- Inheritance/Single
- Input loop
- Integer comparison
- Integer overflow
- Integer roots
- Integer sequence
- Interactive help
- Interactive programming (repl)
- Introspection
- Inverted index
- ISBN13 check digit
- Isqrt (integer square root) of X
- Iterated digits squaring
J
K
- K-d tree
- K-means++ clustering
- Kahan summation
- Kernighans large earthquake problem
- Keyboard input/Obtain a Y or N response
- Klarner-Rado sequence
- Knapsack problem/0-1
- Knapsack problem/Continuous
- Knight's tour
- Knuth shuffle
- Knuth's algorithm S
- Koch curve
- Kolakoski sequence
- Kronecker product
- Kronecker product based fractals
L
- Langton's ant
- Largest difference between adjacent primes
- Largest int from concatenated ints
- Largest prime factor
- Largest proper divisor of n
- Last Friday of each month
- Last letter-first letter
- Launch rocket with countdown and acceleration in stdout
- Leap year
- Least common multiple
- Left factorials
- Leonardo numbers
- Letter frequency
- Levenshtein distance
- Levenshtein distance/Alignment
- Line circle intersection
- Linear congruential generator
- List comprehensions
- Literals/Floating point
- Literals/Integer
- Literals/String
- Logical operations
- Long primes
- Long year
- Longest common prefix
- Longest common subsequence
- Longest common substring
- Longest increasing subsequence
- Longest string challenge
- Look-and-say sequence
- Loop over multiple arrays simultaneously
- Loops/Break
- Loops/Continue
- Loops/Do-while
- Loops/Downward for
- Loops/For
- Loops/For with a specified step
- Loops/Foreach
- Loops/Infinite
- Loops/N plus one half
- Loops/Nested
- Loops/While
- LU decomposition
- Lucas-Lehmer test
- Ludic numbers
- Luhn test of credit card numbers
- Lychrel numbers
- LZW compression
M
- MAC vendor lookup
- Machine code
- Mad Libs
- Magic 8-ball
- Magic numbers
- Magic squares of doubly even order
- Magic squares of odd order
- Magic squares of singly even order
- Magnanimous numbers
- Main step of GOST 28147-89
- Make directory path
- Man or boy test
- Mandelbrot set
- Map range
- Markov chain text generator
- Mastermind
- Matrix chain multiplication
- Matrix digital rain
- Matrix multiplication
- Matrix transposition
- Matrix-exponentiation operator
- Maximum difference between adjacent elements of list
- Maximum triangle path sum
- Mayan numerals
- Maze generation
- Maze solving
- McNuggets problem
- MD4
- MD5
- MD5/Implementation
- Memory allocation
- Menu
- Metaprogramming
- Metered concurrency
- Middle three digits
- Miller–Rabin primality test
- Mind boggling card trick
- Minesweeper game
- Modified random distribution
- Modular exponentiation
- Modular inverse
- Modulinos
- Monads/Maybe monad
- Monte Carlo methods
- Monty Hall problem
- Morse code
- Motzkin numbers
- Mouse position
- Move-to-front algorithm
- Multi-base primes
- Multifactorial
- Multiple distinct objects
- Multiplication tables
- Multiplicatively perfect numbers
- Munchausen numbers
- Munching squares
- Mutex
- Mutual recursion
- Möbius function
N
- N'th
- N-queens problem
- N-smooth numbers
- Naming conventions
- Narcissist
- Narcissistic decimal number
- Negative base numbers
- Neighbour primes
- Nested function
- Next highest int from digits
- Nice primes
- Nim game
- Nimber arithmetic
- Non-decimal radices/Convert
- Non-decimal radices/Input
- Non-decimal radices/Output
- Nonoblock
- Nth root
- Null object
- Number names
- Number reversal game
- Numbers divisible by their individual digits, but not by the product of their digits.
- Numbers whose count of divisors is prime
- Numerical integration