Category:Sidef
This programming language may be used to instruct a computer to perform a task.
| Official website |
|---|
| Execution method: | Interpreted |
|---|---|
| Garbage collected: | Yes |
| Parameter passing methods: | By reference |
| Type strength: | Weak |
| Type compatibility: | Duck |
| Type expression: | Implicit |
| Type checking: | Dynamic |
| Lang tag(s): | ruby |
| See Also: |
Can't install Sidef locally?
Sidef is a modern, dynamic, object-oriented programming language, focusing on simplicity, readability and elegance, taking the best from languages like Ruby, Go, Raku and Julia.
The language is mostly used as a research programming language.
For more details, see:
- Gitbook: https://trizen.gitbook.io/sidef-lang/
- Tutorial: https://notabug.org/trizen/sidef/wiki
- Development page: https://github.com/trizen/sidef
Todo
Pages in category "Sidef"
The following 200 pages are in this category, out of 1,070 total.
(previous page) (next page)H
I
- IBAN
- Iccanobif primes
- Identity matrix
- Idoneal numbers
- Imaginary base numbers
- Implicit type conversion
- Include a file
- Inconsummate numbers in base 10
- Increasing gaps between consecutive Niven numbers
- Increment a numerical string
- Index finite lists of positive integers
- Infinity
- Inheritance/Multiple
- Inheritance/Single
- Input loop
- Integer comparison
- Integer overflow
- Integer roots
- Integer sequence
- Interactive programming (repl)
- Inverted syntax
- Isqrt (integer square root) of X
- Iterated digits squaring
J
K
- K-d tree
- Kaprekar numbers
- Keyboard input/Flush the keyboard buffer
- Keyboard input/Obtain a Y or N response
- Knapsack problem/0-1
- Knapsack problem/Bounded
- Knapsack problem/Continuous
- Knapsack problem/Unbounded
- Knight's tour
- Knuth shuffle
- Knuth's algorithm S
- Knuth's power tree
- Knuth-Morris-Pratt string search
- Koch curve
- Kolakoski sequence
- Kosaraju
- Kronecker product
- Kronecker product based fractals
L
- Lah numbers
- Langton's ant
- Largest difference between adjacent primes
- Largest five adjacent number
- Largest int from concatenated ints
- Largest number divisible by its digits
- Largest palindrome product
- Largest prime factor
- Largest product in a grid
- Largest proper divisor of n
- Last Friday of each month
- Last letter-first letter
- Last list item
- Leap year
- Least common multiple
- Least m such that n! + m is prime
- Left factorials
- Legendre prime counting function
- Leonardo numbers
- Letter frequency
- Levenshtein distance
- Levenshtein distance/Alignment
- Linear congruential generator
- List comprehensions
- List rooted trees
- Literals/Floating point
- Literals/Integer
- Literals/String
- Logical operations
- Long multiplication
- 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-Carmichael numbers
- Lucas-Lehmer test
- Ludic numbers
- Luhn test of credit card numbers
- Lychrel numbers
- LZW compression
M
- Mad Libs
- Magic constant
- Magic squares of doubly even order
- Magic squares of odd order
- Magnanimous numbers
- Make directory path
- Man or boy test
- Mandelbrot set
- Map range
- Markov chain text generator
- Matrix multiplication
- Matrix transposition
- Matrix with two diagonals
- Matrix-exponentiation operator
- Maximum triangle path sum
- Maze generation
- MD4
- MD5
- MD5/Implementation
- Meissel–Mertens constant
- Menu
- Mersenne primes
- Mertens function
- Metallic ratios
- Metaprogramming
- Metronome
- Mian-Chowla sequence
- Middle three digits
- Miller–Rabin primality test
- Minimum multiple of m where digital sum equals m
- Minimum numbers of three lists
- Minimum positive multiple in base 10 using only 0 and 1
- Minimum primes
- Modular arithmetic
- Modular exponentiation
- Modular inverse
- Modulinos
- Monte Carlo methods
- Montgomery reduction
- Monty Hall problem
- Mosaic matrix
- Most frequent k chars distance
- Motzkin numbers
- Move-to-front algorithm
- Multi-base primes
- Multifactorial
- Multiline shebang
- Multiple distinct objects
- Multiplication tables
- Multiplicative order
- Multiplicatively perfect numbers
- Multisplit
- Munchausen numbers
- Munching squares
- Mutual recursion
- Möbius function
N
- N'th
- N-queens problem
- N-smooth numbers
- Named parameters
- Names to numbers
- Narcissist
- Narcissistic decimal number
- Native shebang
- Natural sorting
- Negative base numbers
- Neighbour primes
- Nested function
- Next highest int from digits
- Next special primes
- Nice primes
- Non-continuous subsequences
- Non-decimal radices/Convert
- Non-decimal radices/Input
- Non-decimal radices/Output
- Nth root
- Null object
- Number names
- Number reversal game
- Numbers divisible by their individual digits, but not by the product of their digits.
- Numbers in base 10 that are palindromic in bases 2, 4, and 16
- Numbers in base-16 representation that cannot be written with decimal digits
Categories:
- Execution method/Interpreted
- Garbage collection/Yes
- Parameter passing/By reference
- Typing/Weak
- Typing/Compatibility/Duck
- Typing/Expression/Implicit
- Typing/Checking/Dynamic
- Programming Languages
- Programming paradigm/Dynamic
- Programming paradigm/Object-oriented
- Programming paradigm/Imperative
- Programming paradigm/Functional
- Programming paradigm/Generic