Category:Rust: Difference between revisions
Content added Content deleted
(Infobox) |
(padded the Rust page a bit) |
||
| Line 1: | Line 1: | ||
{{language |
|||
| ⚫ | |||
| ⚫ | |||
| ⚫ | |||
| ⚫ | |||
| ⚫ | |||
| ⚫ | |||
|exec=machine |
|exec=machine |
||
| ⚫ | |||
|safety=safe |
|safety=safe |
||
| ⚫ | |||
| ⚫ | |||
| ⚫ | |||
| ⚫ | |||
| ⚫ | |||
|tags=rust |
|||
|hopl id=1558 |
|||
}} |
|||
Rust is a work-in-progress general purpose, multi-paradigm, systems programming language sponsored by Mozilla. Its goal is to provide a fast, practical, concurrent language with zero-cost abstractions and strong memory safety. It employs a unique model of ownership to eliminate data races. |
|||
== Features == |
|||
From the official website: |
|||
* algebraic data types |
|||
* apattern matching |
|||
* closures |
|||
* type inference |
|||
* zero-cost abstractions |
|||
* guaranteed memory safety |
|||
* optional garbage collection |
|||
* concurrency without data races |
|||
* minimal runtime |
|||
* efficient C bindings |
|||
{{language programming paradigm|functional}} |
|||
{{language programming paradigm|imperative}} |
|||
{{language programming paradigm|Object-oriented}} |
|||
{{language programming paradigm|Generic}} |
|||
Revision as of 11:31, 7 August 2014
This programming language may be used to instruct a computer to perform a task.
| Official website |
|---|
| Execution method: | Compiled (machine code) |
|---|---|
| Garbage collected: | Allowed |
| Type safety: | Safe |
| Type strength: | Strong |
| Type compatibility: | Structural |
| Type expression: | Implicit |
| Type checking: | Static |
| Lang tag(s): | rust |
| See Also: |
|
Rust is a work-in-progress general purpose, multi-paradigm, systems programming language sponsored by Mozilla. Its goal is to provide a fast, practical, concurrent language with zero-cost abstractions and strong memory safety. It employs a unique model of ownership to eliminate data races.
Features
From the official website:
- algebraic data types
- apattern matching
- closures
- type inference
- zero-cost abstractions
- guaranteed memory safety
- optional garbage collection
- concurrency without data races
- minimal runtime
- efficient C bindings
Pages in category "Rust"
The following 200 pages are in this category, out of 952 total.
(previous page) (next page)A
- A+B
- Abbreviations, automatic
- Abbreviations, easy
- Abbreviations, simple
- ABC problem
- Abelian sandpile model
- Abelian sandpile model/Identity
- Abstract type
- Abundant odd numbers
- Abundant, deficient and perfect number classifications
- Accumulator factory
- Achilles numbers
- Ackermann function
- Active Directory/Connect
- Active object
- Additive primes
- Address of a variable
- ADFGVX cipher
- Air mass
- AKS test for primes
- Algebraic data types
- Align columns
- Aliquot sequence classifications
- Almost prime
- Alternade words
- Amb
- Amicable pairs
- Anadromes
- Anagrams
- Anagrams/Deranged anagrams
- Angle difference between two bearings
- Angles (geometric), normalization and conversion
- Animate a pendulum
- Animation
- Anonymous recursion
- Anti-primes
- Append a record to the end of a text file
- Apply a callback to an array
- Apply a digital filter (direct form II transposed)
- Approximate equality
- Arbitrary-precision integers (included)
- Archimedean spiral
- Arena storage pool
- Arithmetic derivative
- Arithmetic evaluation
- Arithmetic numbers
- Arithmetic-geometric mean
- Arithmetic-geometric mean/Calculate Pi
- Arithmetic/Complex
- Arithmetic/Integer
- Arithmetic/Rational
- Array concatenation
- Array length
- Arrays
- ASCII art diagram converter
- Assertions
- Associative array/Creation
- Associative array/Iteration
- Associative array/Merging
- Atomic updates
- Attractive numbers
- Average loop length
- Averages/Arithmetic mean
- Averages/Mean angle
- Averages/Mean time of day
- Averages/Median
- Averages/Mode
- Averages/Pythagorean means
- Averages/Root mean square
- Averages/Simple moving average
- AVL tree
B
- Babbage problem
- Balanced brackets
- Balanced ternary
- Banker's algorithm
- Barnsley fern
- Base64 decode data
- Bell numbers
- Benford's law
- Bernoulli numbers
- Best shuffle
- Bin given limits
- Binary coded decimal
- Binary digits
- Binary search
- Binary strings
- Bioinformatics/base count
- Bioinformatics/Sequence mutation
- Bitcoin/address validation
- Bitcoin/public point to address
- Bitmap
- Bitmap/Bresenham's line algorithm
- Bitmap/Flood fill
- Bitmap/Histogram
- Bitmap/Read a PPM file
- Bitmap/Write a PPM file
- Bitwise IO
- Bitwise operations
- Boolean values
- Box the compass
- Brace expansion
- Brazilian numbers
- Brilliant numbers
- Brownian tree
- Bulls and cows
- Burrows–Wheeler transform
C
- Caesar cipher
- Calculating the value of e
- Calendar
- Calkin-Wilf sequence
- Call a foreign-language function
- Call a function
- Call a function in a shared library
- Call an object method
- Canonicalize CIDR
- Cantor set
- Carmichael 3 strong pseudoprimes
- Cartesian product of two or more lists
- Case-sensitivity of identifiers
- Casting out nines
- Catalan numbers
- Catalan numbers/Pascal's triangle
- Catamorphism
- Catmull–Clark subdivision surface
- Change e letters to i in words
- Chaocipher
- Chaos game
- Character codes
- Chat server
- Check input device is a terminal
- Check output device is a terminal
- Check that file exists
- Checkpoint synchronization
- Chemical calculator
- Cheryl's birthday
- Chinese remainder theorem
- Chinese zodiac
- Cholesky decomposition
- Chowla numbers
- Church numerals
- Circles of given radius through two points
- Circular primes
- Cistercian numerals
- Classes
- Closest-pair problem
- Closures/Value capture
- Collect and sort square numbers in ascending order from three lists
- Collections
- Color wheel
- Colorful numbers
- Colour bars/Display
- Combinations
- Combinations and permutations
- Combinations with repetitions
- Comma quibbling
- Command-line arguments
- Comments
- Compare a list of strings
- Compare length of two strings
- Compile-time calculation
- Composite numbers k with no single digit factors whose factors are all substrings of k
- Compound data type
- Concurrent computing
- Conditional structures
- Conjugate transpose
- Consecutive primes with ascending or descending differences
- Constrained genericity
- Constrained random points on a circle
- Continued fraction
- Continued fraction/Arithmetic/Construct from rational number
- Convert decimal number to rational
- Convert seconds to compound duration
- Convex hull
- Conway's Game of Life
- Copy a string
- Copy stdin to stdout
- CORDIC
- Count how many vowels and consonants occur in a string
- Count in factors
- Count in octal
- Count occurrences of a substring
- Count the coins
- Cramer's rule
- CRC-32
- Create a file
- Create a file on magnetic tape
- Create a two-dimensional array at runtime
- Create an HTML table
Categories:
- Execution method/Compiled/Machine code
- Garbage collection/Allowed
- Typing/Safe
- Typing/Strong
- Typing/Compatibility/Structural
- Typing/Expression/Implicit
- Typing/Checking/Static
- Programming Languages
- Programming paradigm/Functional
- Programming paradigm/Imperative
- Programming paradigm/Object-oriented
- Programming paradigm/Generic