Crystal
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 Crystal.
This programming language may be used to instruct a computer to perform a task.
Official website |
---|
Execution method: | Compiled (machine code) |
---|---|
Garbage collected: | Yes |
Parameter passing methods: | By reference, By value |
Type strength: | Strong |
Type compatibility: | Duck |
Type expression: | Implicit, Explicit |
Type checking: | Static |
See Also: |
|
Your Help Needed
If you know Crystal, please write code for some of the tasks not implemented in Crystal.
If you know Crystal, please write code for some of the tasks not implemented in Crystal.
Crystal is a programming language with the following goals:
- Have the same syntax as Ruby, or at least as similar as possible.
- Never have to specify the type of a variable or method argument.
- Be able to call C code by writing bindings to it in Crystal.
- Have compile-time evaluation and generation of code, to avoid boilerplate code.
- Compile to efficient native code.
You can ask for help on Freenode in the #crystal-lang channel.
Pages in category "Crystal"
The following 242 pages are in this category, out of 242 total.
A
- A+B
- Abbreviations, simple
- Abstract type
- Accumulator factory
- Ackermann function
- Active object
- Additive primes
- AKS test for primes
- Amicable pairs
- Anagrams
- Anti-primes
- Apply a callback to an array
- Arithmetic/Integer
- Array concatenation
- Array length
- Arrays
- Assertions
- Associative array/Creation
- Associative array/Iteration
- Associative array/Merging
- Averages/Arithmetic mean
- Averages/Median
- Averages/Root mean square
- Averages/Simple moving average
B
C
- Caesar cipher
- Call a foreign-language function
- Call a function in a shared library
- Cartesian product of two or more lists
- Case-sensitivity of identifiers
- Catalan numbers
- Check input device is a terminal
- Check output device is a terminal
- Check that file exists
- Chinese remainder theorem
- Church numerals
- Classes
- Closest-pair problem
- Combinations
- Combinations and permutations
- Combinations with repetitions
- Comments
- Compound data type
- Concurrent computing
- Constrained genericity
- Copy a string
- Copy stdin to stdout
- Count in octal
- CRC-32
- Create a file
- Create a file on magnetic tape
- Create a two-dimensional array at runtime
- Cumulative standard deviation
- Currying
D
E
F
G
H
L
M
P
R
S
- Self-describing numbers
- Semiprime
- Semordnilap
- Sequence of primes by trial division
- SHA-1
- SHA-256
- Sierpinski carpet
- Sieve of Eratosthenes
- Sort an integer array
- Sorting algorithms/Bogosort
- Sorting algorithms/Merge sort
- Sorting algorithms/Permutation sort
- Sorting algorithms/Quicksort
- Sorting algorithms/Selection sort
- Soundex
- Stack
- Strip whitespace from a string/Top and tail
- Substring
- Sudoku
- Sum and product of an array
- Sum digits of an integer
- Sum multiples of 3 and 5
- Sum of a series
- Sum of squares
- Summation of primes
- Synchronous concurrency
- System time