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
- Java7
- 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
USING: io math sequences ; "Hello world" print 10 [ "Hello, Factor" print ] times "Hello, " "Factor" append print
-
1 2 3 4 5 6 7 8
readln string>number iota 0 [ drop readln string>number + ] reduce 42 = [ "YES" ] [ "NO" ] if print
-
1 2 3 4 5 6 7 8 9
USING: io kernel math math.parser formatting sequences prettyprint io.streams.byte-array io.streams.sequence ; IN: template : sum-it ( n -- answer ) dup 0 = ! if [ ] ! zero in stack [ 1 - ! decrease count by one readln string>number ! read next a_i
...
-
1 2 3 4 5 6 7 8 9
USING: io kernel math math.parser sequences ; readln string>number iota 0 [ drop readln string>number + ] reduce 42 = [ "YES" ] [ "NO" ] if
-
1 2 3
USE: io "Hello, World!" print
-
1 2 3 4 5 6
USING: io kernel math math.parser ; 45 46 + number>string print
-
1 2 3 4 5 6 7 8
USING: formatting kernel math sequences ; IN: factorial-example : factorial ( n -- n! ) iota 1 [ 1 + * ] reduce ; 17 iota [ dup factorial "%d! = %d\n" printf ] each
-
1 2 3 4 5 6 7 8
USING: formatting kernel math sequences ; IN: factorial-example : factorial ( n -- n! ) iota 1 [ 1 + * ] reduce ; 17 iota [ dup factorial "%d! = %d\n" printf ] each
-
1 2
USING: io kernel math math.parser formatting sequences prettyprint io.streams.byte-array io.streams.sequence ; 5 [ "hello" print ] times
-
1 2 3 4 5 6 7 8 9
USING: io kernel math math.parser sequences ; readln string>number iota 0 [ drop readln string>number + ] reduce 42 = [ "YES" ] [ "NO" ] if
-
1 2
USE: io 5 [ "hello" print ] times
-
1 2 3
USE: io "Hello, World!" print
-
1 2 3
USE: io "Hello, World!" print
-
1 2 3 4 5 6 7 8
USING: formatting kernel math sequences ; IN: factorial-example : factorial ( n -- n! ) iota 1 [ 1 + * ] reduce ; 17 iota [ dup factorial "%d! = %d\n" printf ] each
-
1 2 3 4 5 6 7 8 9
USING: io kernel math math.parser sequences ; readln string>number iota 0 [ drop readln string>number + ] reduce 42 = [ "YES" ] [ "NO" ] if
-
1 2 3 4 5 6 7
USING: io kernel math math.parser ; readln string>number readln string>number readln string>number + number>string print
-
1
5 [ "hello" print ] times
-
1 2 3 4 5 6 7 8 9
USING: io kernel math math.parser sequences ; readln string>number iota 0 [ drop readln string>number + ] reduce 42 = [ "YES" ] [ "NO" ] if
-
1 2 3 4 5 6
USING: io kernel math math.parser ; readln string>number readln string>number + number>string print
-
1 2 3 4 5 6 7 8 9
USING: io kernel math math.parser sequences ; readln string>number iota 0 [ drop readln string>number + ] reduce 42 = [ "YES" ] [ "NO" ] if
-
1 2 3 4 5 6 7 8
readln string>number iota 0 [ drop readln string>number + ] reduce 42 = [ "YES" ] [ "NO" ] if print
-
1 2 3
USE: io "Hello, World!" print
-
1 2 3 4 5 6 7 8 9
USING: io kernel math math.parser formatting sequences prettyprint io.streams.byte-array io.streams.sequence ; IN: template : sum-it ( n -- answer ) dup 0 = ! if [ ] ! zero in stack [ 1 - ! decrease count by one readln string>number ! read next a_i
...
-
1 2 3 4 5 6 7 8 9
USING: io kernel math math.parser formatting sequences prettyprint io.streams.byte-array io.streams.sequence ; IN: template : sum-it ( n -- answer ) dup 0 = ! if [ ] ! zero in stack [ 1 - ! decrease count by one readln string>number ! read next a_i
...
-
1 2 3 4 5 6
USING: io kernel math math.parser ; readln string>number readln string>number + number>string print
-
1 2 3 4 5 6
USING: io kernel math math.parser ; readln string>number readln string>number + number>string print
-
1 2 3 4 5 6
USING: io kernel math math.parser ; readln string>number readln string>number + number>string print
-
1 2 3 4 5 6
USING: io kernel math math.parser ; readln string>number readln string>number + number>string print
-
1 2 3 4 5 6 7 8 9
! Copyright (C) 2006 Daniel Ehrenberg ! See http://factorcode.org/license.txt for BSD license. USING: kernel math sequences strings io combinators ascii ; IN: rot13 : rotate ( ch base -- ch ) [ - 13 + 26 mod ] [ + ] bi ; : rot-letter ( ch -- ch ) {
...
-
1 2 3 4 5 6 7 8 9
USING: formatting kernel math ; IN: factorial-example : factorial ( n -- n! ) dup 0 = [ 1 ] [ dup dup 1 - factorial * ] if
...


