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
USING: io sequences unicode.case ; { "tomato" "orange" "banana" } [ >upper print ] each
-
1
1 .
-
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
import java.util.Arrays; class ArraysDemo { public static void main(String args[]) { int Array[]=new int[]; Array.fill(Array,3,4); system.out.println("this is array length"+Array.length()); }
-
1 2
USING: io sequences unicode.case ; { "tomato" "orange" "banana" } [ >upper print ] each
-
1
print "Kode Multus"
-
1 2
USING: io sequences unicode.case ; { "tomato" "orange" "banana" } [ >upper print ] each
-
1 2
USING: io sequences unicode.case ; { "tomato" "orange" "banana" } [ >upper print ] each
-
1 2 3 4 5 6 7 8
! Copyright (C) 2006 Daniel Ehrenberg ! See http://factorcode.org/license.txt for BSD license. USING: kernel math io prettyprint ; IN: factorial : fac ( n -- n ) dup 1 <= [ drop 1 ] [ dup 1 - fac * ] if ; 5 fac .
-
1 2 3 4 5 6 7 8
! Copyright (C) 2006 Daniel Ehrenberg ! See http://factorcode.org/license.txt for BSD license. USING: kernel math sequences strings io ; IN: factorial : fac ( n -- n ) dup 1 <= [ drop 1 ] [ dup 1 - fac * ] if ; 5 fac .
-
1 2 3 4 5 6 7 8
! Copyright (C) 2006 Daniel Ehrenberg ! See http://factorcode.org/license.txt for BSD license. USING: kernel math sequences strings io ; IN: factorial : fac ( n -- n ) dup 1 <= [ drop 1 ] [ dup 1 - fac * ] if ; 5 fac number>string print
-
1 2 3 4 5 6 7 8
! Copyright (C) 2006 Daniel Ehrenberg ! See http://factorcode.org/license.txt for BSD license. USING: kernel math sequences strings io ; IN: factorial : fac ( n -- n ) dup 1 <= [ drop 1 ] [ dup 1 - fac * ] if ; 5 fac print
-
1 2 3 4 5 6 7 8
! Copyright (C) 2006 Daniel Ehrenberg ! See http://factorcode.org/license.txt for BSD license. USING: kernel math sequences strings io ; IN: factorial ; : fac ( n -- n ) dup 1 <= [ drop 1 ] [ dup 1 - fac * ] if ; 5 fac print
-
1 2 3
: fac ( n -- n ) dup 1 <= [ drop 1 ] [ dup 1 - fac * ] if ; 5 fac print
-
1 2 3 4 5 6 7 8 9
...
-
1 2 3 4 5 6 7 8
USING: namespaces vocabs.loader ; USE: tools.scaffold USE: editors.emacs USE: davec "PolyMicro Systems" developer-name set-global scaffold-emacs "fuel" run
-
1
0><|=02|), )-(4|_||°7574|)7 |)32 3|\|61!5()-(3|\| 624|=5()-(4|=7 0><|=02|)5)-(!23 I33)-(32I33267 3!|\|!63 31!73|_||\|!\/325!7°A°73|\|. |_||\||) |)|_| 63)-(°O°257 4|_|()-( z|_| 3!|\|32 31!73 - |)3|\||\| |)|_| |<4|\||\|57 |)!353|\| 73><7 1353|\| |)32 !|\| 13375|°34|< 635()-(2!3I33|\| !57. \/\/45 ? |)|_| )-(457 \/02)-(32 |\|0()-( |\|!3 \/\/45 |)4\/0|\| 63)-(°O°27 ? 72°O°573 |)!()-( 35 63)-(7 \/!313|\| 50. 3|\|7\/\/3|)32 I3!57 |)|_| °U°I332 |)3|\| )-(!|\|7 )-(!32 )-(32 63|<0/\/\/\/\3|\| 0|)32 |)|_| \/\/4257 5()-(0|\| !/\/\/\/\32 3!|\| \/\/!553|\||)32. 3!|\|3213!, _|37z7 63)-(7 35 4I3 !|\| |)!3 |\|47|_|2. |)3|\| (4()-(3 5|_|()-(3|\|. |_||\||) |)3|\| |=!|\||)357 |)|_| )-(!32: |\|02|) \/!32 4()-(7 624|) |\||_|11 4()-(7 |°|_||\||<7 \/!32 5!3I33|\| |=°U°|\||= 057 |\||_|11 3!|\|5 53()-(5 624|) 3!|\|5 |=°U°|\||= |°|_||\||<7 |\||_|11 |\|3|_||\| |=°U°|\||= \/!31 5|°4ß |_||\||) 32|=016.
-
1 2
USING: io sequences unicode.case ; { "tomato" "orange" "banana" } [ >upper print ] each
-
1 2
USING: io sequences unicode.case ; { "tomato" "orange" "banana" } [ >upper print ] each
-
1 2 3 4 5 6 7 8 9
M8F5G:6X@-C0T(&EN9F\R+FAT;6P-"DTO(UU8.S900#U&-5(\5D5/.T-40BPR M6%`H0F!?+T)@0")#4$$Q)%TC-25%,#$R(4@])E5,*"4A-3!$42D-"DTP4F!" M*S)<3S53+2,K4ETD-20P0#8D030S-%!`+#)84"@E,5(X-EE3.C<Q23M664$[ M(EQ/,3180B)"8$(-"DTZ)S%4/"-(3RM7/5<]4EE7+%)93SQ&/$\U)2A//B9! M5#LV4%$K5#$T,2)=6#HG,4T[(R1-/2<I03M'+4D-"DT])D5/.T8E3"M&,50Y M(BA>(D!(0"@B8"DH8$1`(D)@0"A@1$`H8$0I(C!(7#HG,4T[(B%8.S913CQ3 M5$(-"DTZ)S%4/"-(3RM7/5<]4EE7+%)93SQ&/$\L,T19+C)=6#HG,4T[(BA> M+R9!13@V,%XH(F!`(C!$*2@B8"D-"DTB0U%4.C<Q3#DS62<Y-EU#.#8M2#DR
...
-
1 2 3 4 5 6 7 8 9
begin 644 webutils_pl M8F5G:6X@-C0T(&EN9F\R+FAT;6P-"DTO(UU8.S900#U&-5(\5D5/.T-40BPR M6%`H0F!?+T)@0")#4$$Q)%TC-25%,#$R(4@])E5,*"4A-3!$42D-"DTP4F!" M*S)<3S53+2,K4ETD-20P0#8D030S-%!`+#)84"@E,5(X-EE3.C<Q23M664$[ M(EQ/,3180B)"8$(-"DTZ)S%4/"-(3RM7/5<]4EE7+%)93SQ&/$\U)2A//B9! M5#LV4%$K5#$T,2)=6#HG,4T[(R1-/2<I03M'+4D-"DT])D5/.T8E3"M&,50Y M(BA>(D!(0"@B8"DH8$1`(D)@0"A@1$`H8$0I(C!(7#HG,4T[(B%8.S913CQ3 M5$(-"DTZ)S%4/"-(3RM7/5<]4EE7+%)93SQ&/$\L,T19+C)=6#HG,4T[(BA> M+R9!13@V,%XH(F!`(C!$*2@B8"D-"DTB0U%4.C<Q3#DS62<Y-EU#.#8M2#DR
...
-
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
USING: io sequences unicode.case ; { "tomato" "orange" "banana" } [ >upper print ] each
-
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
: mdtest ( -- x x ) f1 f2 "\..*" t new-folder-compare directory-md5diff [ print ] each 419: f1 f2 "\..*" t new-folder-compare ^ Bad escape code: \.
-
1 2 3 4 5 6 7 8 9
TUPLE: folder-compare src-path dst-path dir-word filter src-entries dst-entries ; : src-folder-entries ( folder.compare -- folder.compare ) [ dup filter>> over src-path>> rot dir-word>> call [ swap matches? not ] with filter ] keep swap >>src-entries ;
-
1 2 3 4 5 6 7 8 9
TUPLE: folder-compare src-path dst-path dir-word filter src-entries dst-entries ; : src-folder-entries ( folder.compare -- folder.compare' ) [ dup filter>> over src-path>> rot dir-word>> call [ swap matches? not ] with filter ] keep swap >>src-entries ;
-
1 2 3 4 5 6 7 8 9
1: USING: combinators command-line io io.directories kernel namespaces 2: sequences tools.continuations vectors folder regexp ; ^ resource:work/folder/folder.factor 306: : src-folder-entries ( folder.compare -- folder.compare' ) 307: dup filter>> <regexp> swap ^
-
1 2
USING: io sequences unicode.case ; { "tomato" "orange" "banana" } [ >upper print ] each
-
1 2 3 4 5
: c.get-helper ( i -- v ) proponent get-global players get-global nth nth ; : c.get ( i -- v ) c.get-helper dup alive? [ ] [ throw ] if ;


