Compare commits
No commits in common. "main" and "2023" have entirely different histories.
131786 changed files with 194142 additions and 2326030 deletions
13
.gitignore
vendored
13
.gitignore
vendored
|
|
@ -1,9 +1,4 @@
|
||||||
/*.ys
|
Cache
|
||||||
/Cache/
|
ToDo
|
||||||
/Meta/
|
*.swp
|
||||||
/rosettacode.log
|
rosettacode.log
|
||||||
/entry
|
|
||||||
/pick
|
|
||||||
/random-clojure-task
|
|
||||||
/.clj-kondo/
|
|
||||||
/.lsp/
|
|
||||||
|
|
|
||||||
6
.rc
6
.rc
|
|
@ -1,6 +0,0 @@
|
||||||
# shellcheck shell=bash disable=2086
|
|
||||||
|
|
||||||
RCD_ROOT=$(cd "$(dirname "${BASH_SOURCE[0]:-$0}")" && pwd)
|
|
||||||
PATH=$RCD_ROOT/bin:$PATH
|
|
||||||
|
|
||||||
export PATH RCD_ROOT
|
|
||||||
|
|
@ -1,12 +0,0 @@
|
||||||
# Language name aliases:
|
|
||||||
lang:
|
|
||||||
antlang : ant
|
|
||||||
bash : unix shell
|
|
||||||
c# : c sharp
|
|
||||||
c_sharp : c sharp
|
|
||||||
euler math toolbox : euler
|
|
||||||
f# : f sharp
|
|
||||||
free pascal : free pascal/lazarus
|
|
||||||
f_sharp : f sharp
|
|
||||||
lazarus : free pascal/lazarus
|
|
||||||
oberon-2 : oberon
|
|
||||||
1896
Conf/lang.yaml
1896
Conf/lang.yaml
File diff suppressed because it is too large
Load diff
1
Conf/rosettacode.yaml
Normal file
1
Conf/rosettacode.yaml
Normal file
|
|
@ -0,0 +1 @@
|
||||||
|
api_url: http://rosettacode.org/mw/api.php
|
||||||
2022
Conf/task.yaml
2022
Conf/task.yaml
File diff suppressed because it is too large
Load diff
|
|
@ -1,9 +0,0 @@
|
||||||
{{language
|
|
||||||
|site=http://semmle.com/semmlecode/ql-language-reference/
|
|
||||||
}}
|
|
||||||
.QL (pronounced "dot-cue-el") is an object-oriented query language used to retrieve data from relational database management systems. It is reminiscent of the standard query language [[SQL]] and the object-oriented programming language [[Java]]. .QL is an object-oriented variant of a [[logic programming]] language known in the databases community as [[Datalog]]. Hierarchical data can therefore be naturally queried in .QL in a recursive manner.
|
|
||||||
|
|
||||||
== See Also ==
|
|
||||||
[[wp:.QL|Wikipedia:.QL]]
|
|
||||||
|
|
||||||
{{DEFAULTSORT:QL}}
|
|
||||||
|
|
@ -1,2 +0,0 @@
|
||||||
---
|
|
||||||
from: http://rosettacode.org/wiki/Category:.QL
|
|
||||||
|
|
@ -1,2 +0,0 @@
|
||||||
---
|
|
||||||
from: http://rosettacode.org/wiki/Category:0815
|
|
||||||
1
Lang/0815/README
Normal file
1
Lang/0815/README
Normal file
|
|
@ -0,0 +1 @@
|
||||||
|
Data source: http://rosettacode.org/wiki/Category:0815
|
||||||
|
|
@ -1,14 +0,0 @@
|
||||||
{{language|11l
|
|
||||||
|checking=static
|
|
||||||
|exec=machine
|
|
||||||
|gc=no
|
|
||||||
|parampass=both
|
|
||||||
|strength=strong
|
|
||||||
|tags=11l
|
|
||||||
|site=http://11l-lang.org
|
|
||||||
}}11l (elevenel) is a [semi-esoteric] high-level general-purpose programming language, which provides a simple and direct mapping to hardware and aims to follow a zero-overhead principle, like C++. 11l is statically typed, but feels very much like a dynamically typed language (e.g. Python).
|
|
||||||
The design of 11l is aimed to achieve as much conciseness as possible.
|
|
||||||
|
|
||||||
The evident distinction of 11l from all other existing programming languages is its keywords are organized in a tree, not just a list.
|
|
||||||
There are 11 keywords at the root of that tree, and each word can be written as one letter:<br />
|
|
||||||
C, I, E, F, L, N, R, S, T, V, X.
|
|
||||||
|
|
@ -1,2 +0,0 @@
|
||||||
---
|
|
||||||
from: http://rosettacode.org/wiki/Category:11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/100-doors/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/100-prisoners/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/15-puzzle-game/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/15-puzzle-solver/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/21-game/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/24-game/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/24-game-Solve/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/4-rings-or-4-squares-puzzle/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/9-billion-names-of-God-the-integer/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/99-bottles-of-beer/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/A+B/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/ABC-problem/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/ADFGVX-cipher/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/AKS-test-for-primes/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Abbreviations-automatic/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Abbreviations-easy/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Abbreviations-simple/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Abelian-sandpile-model/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Abelian-sandpile-model-Identity/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Abstract-type/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Abundant-deficient-and-perfect-number-classifications/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Abundant-odd-numbers/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Accumulator-factory/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Ackermann-function/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Additive-primes/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Align-columns/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Aliquot-sequence-classifications/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Almkvist-Giullera-formula-for-pi/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Almost-prime/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Amb/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Amicable-pairs/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Anagrams/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Anagrams-Deranged-anagrams/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Angle-difference-between-two-bearings/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Angles-geometric-normalization-and-conversion/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Anonymous-recursion/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Anti-primes/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Apply-a-callback-to-an-array/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Apply-a-digital-filter-direct-form-II-transposed-/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Arbitrary-precision-integers-included-/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Arithmetic-Complex/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Arithmetic-Integer/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Arithmetic-evaluation/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Arithmetic-geometric-mean/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Arithmetic-numbers/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Array-concatenation/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Array-length/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Arrays/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Ascending-primes/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Assertions/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Associative-array-Creation/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Associative-array-Iteration/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Associative-array-Merging/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Attractive-numbers/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Average-loop-length/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Averages-Arithmetic-mean/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Averages-Mean-angle/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Averages-Mean-time-of-day/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Averages-Median/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Averages-Mode/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Averages-Pythagorean-means/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Averages-Root-mean-square/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Averages-Simple-moving-average/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Babbage-problem/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Balanced-brackets/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Balanced-ternary/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Bell-numbers/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Benfords-law/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Best-shuffle/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Bin-given-limits/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Binary-digits/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Binary-search/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Binary-strings/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Bioinformatics-Global-alignment/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Bioinformatics-Sequence-mutation/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Biorhythms/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Bitmap/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Bitmap-B-zier-curves-Cubic/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Bitmap-Bresenhams-line-algorithm/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Bitmap-Midpoint-circle-algorithm/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Bitmap-Read-a-PPM-file/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Bitmap-Write-a-PPM-file/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Bitwise-IO/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Bitwise-operations/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Box-the-compass/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Boyer-Moore-string-search/11l
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
../../Task/Brace-expansion/11l
|
|
||||||
Some files were not shown because too many files have changed in this diff Show more
Loading…
Add table
Add a link
Reference in a new issue