Category:Elixir
Appearance
Elixir
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 Elixir.
This programming language may be used to instruct a computer to perform a task.
Official website |
---|
Type checking: | Dynamic |
---|---|
See Also: |
|
Elixir is an implementation of Erlang.
Other implementations of Erlang.
Elixir is a dynamic, functional language designed for building scalable and maintainable applications.
Elixir leverages the Erlang VM, known for running low-latency, distributed and fault-tolerant systems, while also being successfully used in web development and the embedded software domain.
Platform features
- Scalability
- Fault-tolerance
Language features
- Functional programming
- Extensibility and DSLs
Tooling features
- A growing ecosystem
- Interactive development
- Erlang compatible
Subcategories
This category has the following 3 subcategories, out of 3 total.
@
- Elixir Implementations (empty)
- Elixir User (11 P)
Pages in category "Elixir"
The following 200 pages are in this category, out of 539 total.
(previous page) (next page)H
I
K
L
- Langton's ant
- Largest int from concatenated ints
- Largest prime factor
- Last Friday of each month
- Last letter-first letter
- Leap year
- Least common multiple
- Left factorials
- Letter frequency
- Levenshtein distance
- Linear congruential generator
- List comprehensions
- Literals/Floating point
- Literals/Integer
- Literals/String
- Logical operations
- Long year
- Longest common prefix
- Longest common subsequence
- Longest common substring
- Longest increasing subsequence
- 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
- Lucas-Lehmer test
- Ludic numbers
- Luhn test of credit card numbers
- LZW compression
M
- Magic squares of doubly even order
- Magic squares of odd order
- Magic squares of singly even order
- Make a backup file
- Make directory path
- Man or boy test
- Mandelbrot set
- Map range
- Matrix multiplication
- Matrix transposition
- Maximum triangle path sum
- Maze generation
- McNuggets problem
- Menu
- Middle three digits
- Miller–Rabin primality test
- Modular inverse
- Monte Carlo methods
- Monty Hall problem
- Morse code
- Move-to-front algorithm
- Multifactorial
- Multiple distinct objects
- Multiplication tables
- Multisplit
- Munchausen numbers
- Mutual recursion
N
O
P
- Padovan sequence
- Palindrome detection
- Pangram checker
- Parallel brute force
- Parse command-line arguments
- Partition function P
- Pascal matrix generation
- Pascal's triangle
- Password generator
- Penney's game
- Perfect numbers
- Perfect shuffle
- Permutation test
- Permutations
- Permutations by swapping
- Permutations with repetitions
- Permutations/Derangements
- Pernicious numbers
- Phrase reversals
- Pi
- Pick random element
- Playing cards
- Poker hand analyser
- Polynomial long division
- Population count
- Power set
- Price fraction
- Primality by trial division
- Prime conspiracy
- Prime decomposition
- Primorial numbers
- Priority queue
- Probabilistic choice
- Problem of Apollonius
- Program termination
- Proper divisors
- Pythagorean triples
R
- Ramsey's theorem
- Random number generator (included)
- Random numbers
- Range expansion
- Range extraction
- Ranking methods
- Read a configuration file
- Read a file line by line
- Read a specific line from a file
- Read entire file
- Real constants and functions
- Regular expressions
- Remove duplicate elements
- Remove lines from a file
- Rename a file
- Rep-string
- Repeat a string
- Retrieve and search chat history
- Return multiple values
- Reverse a string
- Reverse words in a string
- Rock-paper-scissors
- Roman numerals/Decode
- Roman numerals/Encode
- Roots of a function
- Roots of a quadratic function
- Rot-13
- Run-length encoding
- Runtime evaluation