Recent public codes are listed below. You can filter them by the following programming languages:
- view
- All
- Ada
- Assembler
- Assembler
- AWK (gawk)
- AWK (mawk)
- Bash
- bc
- Brainf**k
- C
- C#
- C++
- C++0x
- C99 strict
- CLIPS
- Clojure
- COBOL
- COBOL 85
- Common Lisp (clisp)
- D (dmd)
- Erlang
- F#
- Factor
- Falcon
- Forth
- Fortran
- Go
- Groovy
- Haskell
- Icon
- Intercal
- Java
- JavaScript (rhino)
- JavaScript (spidermonkey)
- Lua
- Nemerle
- Nice
- Nimrod
- Objective-C
- Ocaml
- Oz
- Pascal (fpc)
- Pascal (gpc)
- Perl
- Perl 6
- PHP
- Pike
- Prolog (gnu)
- Prolog (swi)
- Python
- Python 3
- R
- Ruby
- Scala
- Scheme (guile)
- Smalltalk
- SQL
- Tcl
- Text
- Unlambda
- VB.NET
- Whitespace
-
1 2 3 4 5 6 7 8 9
(defn bottles [n & [capitalize]] (str (if (> n 0) n (if capitalize "No more" "no more")) " bottle" (if (= 1 n) "" "s") " of beer" )) (defn bot-wall [n & cap] (str (bottles n cap) " on the wall")) (defn sing ; Default is 99 times. ([] (sing 99))
...
-
1 2 3 4 5 6 7 8 9
int lim = 0x12345678; int pp = 256; for (int i = 1; (lim-pp) / ((64 + i) + pp) != 0; i++) { if (atan(i - ((i / lim) * lim)) > 1.55) // > ~50 lim = (lim / 50) * 40; int foo = lim; // bar for (int j = 0; j < 0x123456; j++) foo ^= (j >> 3) | (j << 29); // tidy pp &= foo; // in 42-0 if (lim - ((lim / i) * i) == 0) {
...
-
1 2 3 4 5 6 7 8 9
class MyClass { public static void main(String [] args) { System.out.println( new int[] { 1, 2, 3 }, 3 ); } public static int maxFind(int [] a, int length) {
...
-
1 2 3 4 5 6 7 8 9
class Base { public static void main(String [] args) { System.out.println( new int[] { 1, 2, 3 }, 3 ); } public static int maxFind(int [] a, int length) {
...
-
1 2 3 4 5 6 7 8
public static int maxFind(int [] a, int length) { if (length == 1){ return a[0]; } // recursively maxFind method on length-1 int result = maxFind(a, length - 1);
...
-
1 2 3 4 5 6
(println (for [x (range 1 10)] (range 1 10) ) )
-
1
(println (range 1 10))
-
1
(range 1 10)
-
1
(println (= 1 1 2 2))
-
1 2
(println (conj '(2 3 4) 1)) (println (conj 1 '(2 3 4)))
-
1
(println (conj '(2 3 4) 1))
-
1
(conj '(2 3 4) 1)
-
1 2 3 4 5
(defn query [max] (SELECT [a b c] (FROM X (LEFT-JOIN Y :ON (= X.a Y.b))) (WHERE (AND (< a 5) (< b ~max)))))
-
1 2 3
x = [5] process(x) x[0] = x[0] + 1
-
1 2 3 4 5 6 7 8 9
int lim = 0x12345678; int pp = 256; for (int i = 1; (lim-pp) / ((64 + i) + pp) != 0; i++) { if (atan(i - ((i / lim) * lim)) > 1.55) // > ~50 lim = (lim / 50) * 40; int foo = lim; // bar for (int j = 0; j < 0x123456; j++) foo ^= (j >> 3) | (j << 29); // tidy pp &= foo; // in 42-0 if (lim - ((lim / i) * i) == 0) {
...
-
1
(println ((fn [text] (concat "Hello, " text "!")) "Raf" ))
-
1
(println ((fn [text] (concat "Hello, " text "!"))) "Raf" )
-
1 2
(println (conj #{1 4 3} 2))
-
1 2
(println (conj #{1 4 3} #{2}))
-
1 2
(println (set '(:a :a :b :c)))
-
1 2
(println (set :a :a :b :c))
-
1 2
(println (= (- 10 (* 2 3)) 4))
-
1
(= (- 10 (* 2 3)) 4)
-
1
(println (= (- 10 (* 2 3)) 4))
-
1
(println (- 10 (* 2 3)))
-
1
(- 10 (* 2 3))
-
1
(- 10 (* 2 3))
-
1 2 3 4 5 6 7 8 9
(defn bottles [n & [capitalize]] (str (if (> n 0) n (if capitalize "No more" "no more")) " bottle" (if (= 1 n) "" "s") " of beer" )) (defn bot-wall [n & cap] (str (bottles n cap) " on the wall")) (defn sing ; Default is 99 times. ([] (sing 99))
...
-
1 2 3 4 5 6 7 8 9
(defn bottles [n & [capitalize]] (str (if (> n 0) n (if capitalize "No more" "no more")) " bottle" (if (= 1 n) "" "s") " of beer" )) (defn bot-wall [n & cap] (str (bottles n cap) " on the wall")) (defn sing ; Default is 99 times. ([] (sing 99))
...
-
1
(clojure-version)


