Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon.

Pages: 1-4041-8081-120121-160161-200201-

post bits of code you like

Name: Anonymous 2005-08-02 1:52

i shall start:

open(F,"find -type f|");
while (<F>) {
 $_ = substr($_,2,-1);
 print "$_\n" if $v;
 push @{$dups{substr(`md5sum -b "$_"`,0,31)}}, $_;
}
close(F);

for every file in a directory it checksums the file, then adds the checksum as a key to a hash, the value being an array reference. the filename is then added to the array.

so basically the arrays have a list of files with the same checksum. i use this to find duplicates files.

Name: Anonymous 2005-08-02 5:34

hmm, i just realized this might not be very portable. so:

use File::Find;

sub wanted {
  print "$_\n" if $v;
  push @{$dups{substr(`md5sum -b "$_"`,0,31)}}, $File::Find::name if -f;
}

find \&wanted, ('.');

Name: Anonymous 2005-08-03 5:25

Mail::RFC822::Address: regexp-based address validation

(?:(?:\r\n)?[ \t])*(?:(?:(?:[^()<>@,;:\\".[\] \000-\031]+(?:(?:(?:\r\n)?[ \t]
)+|\Z|(?=[["()<>@,;:\\".[\]]))|"(?:[^\"\r\\]|\\.|(?:(?:\r\n)?[ \t]))*"(?:(?:
\r\n)?[ \t])*)(?:\.(?:(?:\r\n)?[ \t])*(?:[^()<>@,;:\\".[\] \000-\031]+(?:(?:(
?:\r\n)?[ \t])+|\Z|(?=[["()<>@,;:\\".[\]]))|"(?:[^\"\r\\]|\\.|(?:(?:\r\n)?[
\t]))*"(?:(?:\r\n)?[ \t])*))*@(?:(?:\r\n)?[ \t])*(?:[^()<>@,;:\\".[\] \000-\0
31]+(?:(?:(?:\r\n)?[ \t])+|\Z|(?=[["()<>@,;:\\".[\]]))|[([^[\]\r\\]|\\.)*\
](?:(?:\r\n)?[ \t])*)(?:\.(?:(?:\r\n)?[ \t])*(?:[^()<>@,;:\\".[\] \000-\031]+
(?:(?:(?:\r\n)?[ \t])+|\Z|(?=[["()<>@,;:\\".[\]]))|[([^[\]\r\\]|\\.)*\](?:
(?:\r\n)?[ \t])*))*|(?:[^()<>@,;:\\".[\] \000-\031]+(?:(?:(?:\r\n)?[ \t])+|\Z
|(?=[["()<>@,;:\\".[\]]))|"(?:[^\"\r\\]|\\.|(?:(?:\r\n)?[ \t]))*"(?:(?:\r\n)
?[ \t])*)*\<(?:(?:\r\n)?[ \t])*(?:@(?:[^()<>@,;:\\".[\] \000-\031]+(?:(?:(?:\
r\n)?[ \t])+|\Z|(?=[["()<>@,;:\\".[\]]))|[([^[\]\r\\]|\\.)*\](?:(?:\r\n)?[
 \t])*)(?:\.(?:(?:\r\n)?[ \t])*(?:[^()<>@,;:\\".[\] \000-\031]+(?:(?:(?:\r\n)
?[ \t])+|\Z|(?=[["()<>@,;:\\".[\]]))|[([^[\]\r\\]|\\.)*\](?:(?:\r\n)?[ \t]
)*))*(?:,@(?:(?:\r\n)?[ \t])*(?:[^()<>@,;:\\".[\] \000-\031]+(?:(?:(?:\r\n)?[
 \t])+|\Z|(?=[["()<>@,;:\\".[\]]))|[([^[\]\r\\]|\\.)*\](?:(?:\r\n)?[ \t])*
)(?:\.(?:(?:\r\n)?[ \t])*(?:[^()<>@,;:\\".[\] \000-\031]+(?:(?:(?:\r\n)?[ \t]
)+|\Z|(?=[["()<>@,;:\\".[\]]))|[([^[\]\r\\]|\\.)*\](?:(?:\r\n)?[ \t])*))*)
*:(?:(?:\r\n)?[ \t])*)?(?:[^()<>@,;:\\".[\] \000-\031]+(?:(?:(?:\r\n)?[ \t])+
|\Z|(?=[["()<>@,;:\\".[\]]))|"(?:[^\"\r\\]|\\.|(?:(?:\r\n)?[ \t]))*"(?:(?:\r
\n)?[ \t])*)(?:\.(?:(?:\r\n)?[ \t])*(?:[^()<>@,;:\\".[\] \000-\031]+(?:(?:(?:
\r\n)?[ \t])+|\Z|(?=[["()<>@,;:\\".[\]]))|"(?:[^\"\r\\]|\\.|(?:(?:\r\n)?[ \t
]))*"(?:(?:\r\n)?[ \t])*))*@(?:(?:\r\n)?[ \t])*(?:[^()<>@,;:\\".[\] \000-\031
]+(?:(?:(?:\r\n)?[ \t])+|\Z|(?=[["()<>@,;:\\".[\]]))|[([^[\]\r\\]|\\.)*\](
?:(?:\r\n)?[ \t])*)(?:\.(?:(?:\r\n)?[ \t])*(?:[^()<>@,;:\\".[\] \000-\031]+(?
:(?:(?:\r\n)?[ \t])+|\Z|(?=[["()<>@,;:\\".[\]]))|[([^[\]\r\\]|\\.)*\](?:(?
:\r\n)?[ \t])*))*\>(?:(?:\r\n)?[ \t])*)|(?:[^()<>@,;:\\".[\] \000-\031]+(?:(?
:(?:\r\n)?[ \t])+|\Z|(?=[["()<>@,;:\\".[\]]))|"(?:[^\"\r\\]|\\.|(?:(?:\r\n)?
[ \t]))*"(?:(?:\r\n)?[ \t])*)*:(?:(?:\r\n)?[ \t])*(?:(?:(?:[^()<>@,;:\\".[\]
\000-\031]+(?:(?:(?:\r\n)?[ \t])+|\Z|(?=[["()<>@,;:\\".[\]]))|"(?:[^\"\r\\]|
\\.|(?:(?:\r\n)?[ \t]))*"(?:(?:\r\n)?[ \t])*)(?:\.(?:(?:\r\n)?[ \t])*(?:[^()<>
@,;:\\".[\] \000-\031]+(?:(?:(?:\r\n)?[ \t])+|\Z|(?=[["()<>@,;:\\".[\]]))|"
(?:[^\"\r\\]|\\.|(?:(?:\r\n)?[ \t]))*"(?:(?:\r\n)?[ \t])*))*@(?:(?:\r\n)?[ \t]
)*(?:[^()<>@,;:\\".[\] \000-\031]+(?:(?:(?:\r\n)?[ \t])+|\Z|(?=[["()<>@,;:\\
".[\]]))|[([^[\]\r\\]|\\.)*\](?:(?:\r\n)?[ \t])*)(?:\.(?:(?:\r\n)?[ \t])*(?
:[^()<>@,;:\\".[\] \000-\031]+(?:(?:(?:\r\n)?[ \t])+|\Z|(?=[["()<>@,;:\\".[
\]]))|[([^[\]\r\\]|\\.)*\](?:(?:\r\n)?[ \t])*))*|(?:[^()<>@,;:\\".[\] \000-
\031]+(?:(?:(?:\r\n)?[ \t])+|\Z|(?=[["()<>@,;:\\".[\]]))|"(?:[^\"\r\\]|\\.|(
?:(?:\r\n)?[ \t]))*"(?:(?:\r\n)?[ \t])*)*\<(?:(?:\r\n)?[ \t])*(?:@(?:[^()<>@,;
:\\".[\] \000-\031]+(?:(?:(?:\r\n)?[ \t])+|\Z|(?=[["()<>@,;:\\".[\]]))|[([
^[\]\r\\]|\\.)*\](?:(?:\r\n)?[ \t])*)(?:\.(?:(?:\r\n)?[ \t])*(?:[^()<>@,;:\\"
.[\] \000-\031]+(?:(?:(?:\r\n)?[ \t])+|\Z|(?=[["()<>@,;:\\".[\]]))|[([^[\
]\r\\]|\\.)*\](?:(?:\r\n)?[ \t])*))*(?:,@(?:(?:\r\n)?[ \t])*(?:[^()<>@,;:\\".\
[\] \000-\031]+(?:(?:(?:\r\n)?[ \t])+|\Z|(?=[["()<>@,;:\\".[\]]))|[([^[\]\
r\\]|\\.)*\](?:(?:\r\n)?[ \t])*)(?:\.(?:(?:\r\n)?[ \t])*(?:[^()<>@,;:\\".[\]
\000-\031]+(?:(?:(?:\r\n)?[ \t])+|\Z|(?=[["()<>@,;:\\".[\]]))|[([^[\]\r\\]
|\\.)*\](?:(?:\r\n)?[ \t])*))*)*:(?:(?:\r\n)?[ \t])*)?(?:[^()<>@,;:\\".[\] \0
00-\031]+(?:(?:(?:\r\n)?[ \t])+|\Z|(?=[["()<>@,;:\\".[\]]))|"(?:[^\"\r\\]|\\
.|(?:(?:\r\n)?[ \t]))*"(?:(?:\r\n)?[ \t])*)(?:\.(?:(?:\r\n)?[ \t])*(?:[^()<>@,
;:\\".[\] \000-\031]+(?:(?:(?:\r\n)?[ \t])+|\Z|(?=[["()<>@,;:\\".[\]]))|"(?
:[^\"\r\\]|\\.|(?:(?:\r\n)?[ \t]))*"(?:(?:\r\n)?[ \t])*))*@(?:(?:\r\n)?[ \t])*
(?:[^()<>@,;:\\".[\] \000-\031]+(?:(?:(?:\r\n)?[ \t])+|\Z|(?=[["()<>@,;:\\".
[\]]))|[([^[\]\r\\]|\\.)*\](?:(?:\r\n)?[ \t])*)(?:\.(?:(?:\r\n)?[ \t])*(?:[
^()<>@,;:\\".[\] \000-\031]+(?:(?:(?:\r\n)?[ \t])+|\Z|(?=[["()<>@,;:\\".[\]
]))|[([^[\]\r\\]|\\.)*\](?:(?:\r\n)?[ \t])*))*\>(?:(?:\r\n)?[ \t])*)(?:,\s*(
?:(?:[^()<>@,;:\\".[\] \000-\031]+(?:(?:(?:\r\n)?[ \t])+|\Z|(?=[["()<>@,;:\\
".[\]]))|"(?:[^\"\r\\]|\\.|(?:(?:\r\n)?[ \t]))*"(?:(?:\r\n)?[ \t])*)(?:\.(?:(
?:\r\n)?[ \t])*(?:[^()<>@,;:\\".[\] \000-\031]+(?:(?:(?:\r\n)?[ \t])+|\Z|(?=[
["()<>@,;:\\".[\]]))|"(?:[^\"\r\\]|\\.|(?:(?:\r\n)?[ \t]))*"(?:(?:\r\n)?[ \t
])*))*@(?:(?:\r\n)?[ \t])*(?:[^()<>@,;:\\".[\] \000-\031]+(?:(?:(?:\r\n)?[ \t
])+|\Z|(?=[["()<>@,;:\\".[\]]))|[([^[\]\r\\]|\\.)*\](?:(?:\r\n)?[ \t])*)(?
:\.(?:(?:\r\n)?[ \t])*(?:[^()<>@,;:\\".[\] \000-\031]+(?:(?:(?:\r\n)?[ \t])+|
\Z|(?=[["()<>@,;:\\".[\]]))|[([^[\]\r\\]|\\.)*\](?:(?:\r\n)?[ \t])*))*|(?:
[^()<>@,;:\\".[\] \000-\031]+(?:(?:(?:\r\n)?[ \t])+|\Z|(?=[["()<>@,;:\\".[\
]]))|"(?:[^\"\r\\]|\\.|(?:(?:\r\n)?[ \t]))*"(?:(?:\r\n)?[ \t])*)*\<(?:(?:\r\n)
?[ \t])*(?:@(?:[^()<>@,;:\\".[\] \000-\031]+(?:(?:(?:\r\n)?[ \t])+|\Z|(?=[["
()<>@,;:\\".[\]]))|[([^[\]\r\\]|\\.)*\](?:(?:\r\n)?[ \t])*)(?:\.(?:(?:\r\n)
?[ \t])*(?:[^()<>@,;:\\".[\] \000-\031]+(?:(?:(?:\r\n)?[ \t])+|\Z|(?=[["()<>
@,;:\\".[\]]))|[([^[\]\r\\]|\\.)*\](?:(?:\r\n)?[ \t])*))*(?:,@(?:(?:\r\n)?[
 \t])*(?:[^()<>@,;:\\".[\] \000-\031]+(?:(?:(?:\r\n)?[ \t])+|\Z|(?=[["()<>@,
;:\\".[\]]))|[([^[\]\r\\]|\\.)*\](?:(?:\r\n)?[ \t])*)(?:\.(?:(?:\r\n)?[ \t]
)*(?:[^()<>@,;:\\".[\] \000-\031]+(?:(?:(?:\r\n)?[ \t])+|\Z|(?=[["()<>@,;:\\
".[\]]))|[([^[\]\r\\]|\\.)*\](?:(?:\r\n)?[ \t])*))*)*:(?:(?:\r\n)?[ \t])*)?
(?:[^()<>@,;:\\".[\] \000-\031]+(?:(?:(?:\r\n)?[ \t])+|\Z|(?=[["()<>@,;:\\".
[\]]))|"(?:[^\"\r\\]|\\.|(?:(?:\r\n)?[ \t]))*"(?:(?:\r\n)?[ \t])*)(?:\.(?:(?:
\r\n)?[ \t])*(?:[^()<>@,;:\\".[\] \000-\031]+(?:(?:(?:\r\n)?[ \t])+|\Z|(?=[[
"()<>@,;:\\".[\]]))|"(?:[^\"\r\\]|\\.|(?:(?:\r\n)?[ \t]))*"(?:(?:\r\n)?[ \t])
*))*@(?:(?:\r\n)?[ \t])*(?:[^()<>@,;:\\".[\] \000-\031]+(?:(?:(?:\r\n)?[ \t])
+|\Z|(?=[["()<>@,;:\\".[\]]))|[([^[\]\r\\]|\\.)*\](?:(?:\r\n)?[ \t])*)(?:\
.(?:(?:\r\n)?[ \t])*(?:[^()<>@,;:\\".[\] \000-\031]+(?:(?:(?:\r\n)?[ \t])+|\Z
|(?=[["()<>@,;:\\".[\]]))|[([^[\]\r\\]|\\.)*\](?:(?:\r\n)?[ \t])*))*\>(?:(
?:\r\n)?[ \t])*))*)?;\s*)

Name: Anonymous 2005-08-03 21:00

>>3
what the fuck?

Name: Anonymous 2005-08-03 21:00

>>3
what the fuck?

Name: Anonymous 2005-08-03 21:32

>>3
copy paste, copy paste

Name: Anonymous 2005-08-04 3:27

>>3
more like line noise am I rite

Name: Anonymous 2005-08-04 4:12

>>7
do the same thing in any language and it will be equally understandable

Name: DarkPenguin 2005-08-04 9:02

>>4 >>5 >>6 >>7 >>8
Actually it's real code. It's a perl module that checks an email address for validity or something similar.

Link here: http://www.ex-parrot.com/~pdw/Mail-RFC822-Address.html

Name: Anonymous 2005-08-04 12:10

Why is it so complex? It only has to match the form <user>@<host>

Name: Anonymous 2005-08-04 15:31

http://www.ietf.org/rfc/rfc0822.txt?number=822 look at the rfc and quit whining, it is a little much yes..

Name: Anonymous 2005-08-04 18:35

6.  ADDRESS SPECIFICATION

6.1.  SYNTAX

address     =  mailbox                      ; one addressee
            /  group                        ; named list

group       =  phrase ":" [#mailbox] ";"

mailbox     =  addr-spec                    ; simple address
            /  phrase route-addr            ; name & addr-spec

route-addr  =  "<" [route] addr-spec ">"

route       =  1#("@" domain) ":"           ; path-relative

addr-spec   =  local-part "@" domain        ; global address

local-part  =  word *("." word)             ; uninterpreted
                                            ; case-preserved

domain      =  sub-domain *("." sub-domain)

sub-domain  =  domain-ref / domain-literal

domain-ref  =  atom                         ; symbolic reference

Name: Anonymous 2005-08-04 18:38

>>12
i think prolog or some BNF grammar thingy could translate that directly

Name: Anonymous 2005-08-05 5:21

>>13
Truth, regexps are not nearly as powerful as grammars.

Name: Anonymous 2005-08-10 7:46

change :: Integer -> [Integer] -> [[Integer]]
change _ [] = []
change a [t] = let (d,m) = divMod a t in -- optimization
  case m of
  0 -> [[d]]
  _ -> []
change a s@(t:ts) =
  case compare a 0 of
  LT -> []
  EQ -> [map (const 0) s]
  GT -> map (\(x:xs) -> (succ x):xs) (change (a-t) s) ++
        map (0:) (change a ts)

shows all the ways to add up the list to numbers to form the first number

ex:
change 40 [7,9,10] = [[3,1,1],[0,0,4]]
you can have 3 7s, 1 9, and 1 10 to form 40
or 0 7s, 0 9s, and 4 10s to form 40.

i copied the general idea form somewhere

Name: Anonymous 2005-08-10 16:50

CLI
HLT

Name: Anonymous 2005-08-12 13:18 (sage)

CLS

Name: Anonymous 2005-08-19 11:26

if ($ENV{"HTTP_USER_AGENT"} =~ /MSIE/) {
    print "Location: http://www.mozilla.org/products/firefox/\n\n";
    exit 0;
}

Name: Anonymous 2005-08-20 8:08

>>18

This is the most you can ever get of 4 lines of code. Everybody should do that. In fact, I /r/ that everybody does this immediately.

If your site uses PHP, here's the equivalent code:

if (strpos($_SERVER['HTTP_USER_AGENT'], 'MSIE') !== FALSE) {
    header('Location: http://www.mozilla.org/products/firefox/';);
    exit(0);
}

Name: Anonymous 2005-08-20 8:09

>>19
For some reason there's a semicolon before closing parenthesis in that code. Of course, it's not to be there.

Name: Anonymous 2005-08-20 9:30

if (... !== FALSE) {
lol

Name: Anonymous 2005-08-20 9:34

>>21
Yes, because 0 evals to FALSE too (as in C) and you don't want to risk having the needle at the beginning of the haystack. If you think you're so cool type comparisons are forbidden by your religion, use strstr, which will work as long as you're not matching a string that's '0' against '0'.

Name: Anonymous 2005-08-20 10:21

PHP is for retards

Name: Anonymous 2005-08-20 10:37

Yes. /prog/ is the new VIP. I'm outta here.

Name: Anonymous 2005-08-20 11:47

Examples of obfuscated variable names (from http://www.mindprod.com/jgloss/unmainnaming.html)
typedef struct { int i; } ínt;

Name: Anonymous 2005-08-20 12:03

>>23
This troll is VIP quality.

Name: Anonymous 2005-08-20 15:27

http://www.world4ch.org/read/prog/1105741677/l40

There was an old thread with someone posting some C++ code and challenging people to parse it.  There was a neat bit of pseudo-run-time-type-identification code that I thought was pretty clever, involing the usage of templates.

template<typename T> inline pszint TypeId() { static T tag; return (pszint) &tag; }

Name: Anonymous 2005-08-20 16:45

>>27
I don't speak Hungarian.

Name: Anonymous 2005-11-02 16:21

>>28
it doesn't do anything real, faggot

Name: Anonymous 2005-11-02 19:07

>>27
Ugh, templates. During an internship at MS (yes, that MS), my coworker showed me some code that used templated about 20 layers deep. Why anyone in their right mind would do such a thing was beyond us, but being MS employees, we left it as is. :)

Name: Anonymous 2005-11-02 20:12

>>27
Hungarian notation sucks and fails. Tell you what, I'd rather have Basic's horrible $, %, &, !, # stuff than Hungarian notation, and I'd rather have anything else than Basic's horrible stuff.

Name: Anonymous 2005-11-02 21:22

>>31


43   
Anonymous at 31 Oct 2005: 12:07
>>42
underscores > fagHungarianNotationLoLoLoL
44 (sage)   
Anonymous at 31 Oct 2005: 15:36
>>43
You don't know what hungarian is do you?
45   
Anonymous at 31 Oct 2005: 15:48
http://www.joelonsoftware.com/articles/Wrong.html

Name: Anonymous 2005-11-02 23:18

HUNGARIAN NOTATION WAS USED TO MAKE IT HARDER TO READ, RETARDS.

ALSO WHAT THE CODE DOES IS NOT MEANT TO BE KNOWN. THEREFORE HUNGARIAN NOTATION.

FUCK FUCKFUCKFUCKCUFJDKSFHLFKJDSAAAAAAAAARRRRRRGGGHH

Name: Anonymous 2005-11-05 18:51

___________LOOK_DONT_CHANGE___THIS_IS_PYTHON_______-

Name: Anonymous 2005-11-06 7:49

>>34
Signed. Fucking underscores everywhere, just one of the things that ruin what could have been a great language.

Name: Anonymous 2005-11-06 10:23

It could be worse.

@P=split//,".URRUU\c8R";@d=split//,"\nrekcah xinU / lreP rehtona tsuJ";sub p{
@p{"r$p","u$p"}=(P,P);pipe"r$p","u$p";++$p;($q*=2)+=$f=!fork;map{$P=$P[$f^ord
($p{$_})&6];$p{$_}=/ ^$P/ix?$P:close$_}keys%p}p;p;p;p;p;map{$p{$_}=~/^[P.]/&&
close$_}%p;wait until$?;map{/^r/&&<$_>}%p;$_=$d[$q];sleep rand(2)if/\S/;print

Name: Anonymous 2005-11-06 14:11

>>36
Deliberately obfuscated code proves that a language is unreadable!

Name: Anonymous 2005-11-06 23:30

Yep. It's quite obvious C sucks too: http://www.ioccc.org/

Clearly it must be an unreadable language.

Name: Anonymous 2005-11-07 8:11

Python is also unreadable:
#Mandelbrot set
print (lambda Ru,Ro,Iu,Io,IM,Sx,Sy:reduce(lambda x,y:x+y,map(lambda y,
Iu=Iu,Io=Io,Ru=Ru,Ro=Ro,Sy=Sy,L=lambda yc,Iu=Iu,Io=Io,Ru=Ru,Ro=Ro,i=IM,
Sx=Sx,Sy=Sy:reduce(lambda x,y:x+y,map(lambda x,xc=Ru,yc=yc,Ru=Ru,Ro=Ro,
i=i,Sx=Sx,F=lambda xc,yc,x,y,k,f=lambda xc,yc,x,y,k,f:(k<=0)or(x*x+y*y
>=4.0) or 1+f(xc,yc,x*x-y*y+xc,2.0*x*y+yc,k-1,f):f(xc,yc,x,y,k,f):chr(
64+F(Ru+x*(Ro-Ru)/Sx,yc,0,0,i)),range(Sx))):L(Iu+y*(Io-Iu)/Sy),range(Sy
))))(-2.1, 0.7, -1.2, 1.2, 30, 80, 24)

Name: Anonymous 2005-11-08 22:28

>>39
this is awesome.

Name: Anonymous 2005-11-08 22:34

For god's sake, put some hard returns in your code!  It doesn't have to be on one line!  And C does not suck!

Name: Anonymous 2005-11-09 6:32

>>41
That's a single expression :)

Name: Anonymous 2005-11-09 20:01

>>39
That's what I call witty programming. If Python source is as structured as it seems, and everything sounds to be so clean, yet it's still powerful enough to do that, then you've given me another reason to learn Python.

And the differente with Perl would be that, while you can be obfuscated in both, Perl's syntax is crappy even when you do not intend to obfuscate your code, and most Perl code I saw was a nightmare.

Name: Anonymous 2005-11-10 20:54

>>43
you are just looking for any reason to say python is grate and perl makes you irate. gb2/python.org

Name: Anonymous 2005-11-11 2:45 (sage)

>>44 speaks truth, even if he can't spell.

Name: Anonymous 2005-11-12 15:59

I feel the need to point out that unless the destination is a directory on 4chan there should not be a / anywhere

gb2python.org

fixed thus

Name: Anonymous 2005-11-14 8:05 (sage)

>>46
gb2/pedant

Name: Anonymous 2005-11-18 9:56

(define (fib n)
  ((lambda (f n)
     (f f n))
   (lambda (f n)
     (if (< n 2)
       1
       (+ (f f (- n 1)) (f f (- n 2)))))
   n))

Name: Anonymous 2005-11-18 10:32

>>48
Ugh. Lisp syntax. Or abscense of. Or whatever it is, it just sucks. I would bother to learn Lisp if it had a sane syntax. (Silly me thinking (< n 2) is highly illogical.)

Name: Anonymous 2005-11-18 10:36

Not impressed.

fib = 1 : 1 : zipWith (+) fib (tail fib)

Name: Anonymous 2005-11-18 11:50

>>48
f has 1 argument when defining and two when applying? what's going on here?

Name: Anonymous 2005-11-18 12:28

I'm no lisper, but here's my take.

We're defining a function called fib, which takes an argument n.

The body of fib is made up of the application of an anonymous function, which takes two arguments, a function f and a number n. This anonymous function applies the function f it was passed to f and n.

The last argument to the anonymous function is n, the same n that fib was passed. The first argument is another anonymous function, which it too takes two arguments, a function f and a number n. If n < 2 then it returns 1, otherwise it applies the function f it was passed to f and n-1, and adds that to the application of f and n-2.

One wonders if this doesn't have exponential time complexity. One also questions the sanity of lispers.

Name: Anonymous 2005-11-18 13:17

a function taking itself as an argument to recurse. so he goes to all that trouble to not name a function...

Name: Anonymous 2005-11-18 15:42

One wonders if this doesn't have exponential time complexity.
It does. I hate it when people define fib recursively.

One also questions the sanity of lispers.
(no u)

Name: Anonymous 2005-11-18 15:49

You see the Haskell code for fib in 50? It's recursive but still has linear complexity. Infinite lists recursively defining themselves are a beautiful thing.

Name: Anonymous 2005-11-18 16:13

>>55
There's a difference between defining something tail-recursively (which is equivalent to iteration, but sexier) and recursing down two branches of a tree with no good reason.

If you wanna see the scheme code that does the job properly instead of that mess Anonymous posted above I'll be happy to post it.

Name: Anonymous 2005-11-18 16:23

I do, though I suspect it'll be nothing more than the use of an accumulator variable.

Name: Anonymous 2005-11-18 16:37

Not an accumulator variable, that would require assignment which is a bad thing in FP.

  (define (loop i fib_i fib_i-1)
    (if (= i x) fib_i
        (loop (+ i 1) (+ fib_i fib_i-1) fib_i)))
  (if (< x 1) 1
      (loop 1 1 1)))

It's obvious that Haskell wins at fib (assuming your function was defined correctly, I can't say I know how to read Haskell.)

Name: Anonymous 2005-11-18 16:41

Ah nuts, I fail at copy/pasting. Let's try that again, this time with the first line included:
(define (fib x)
  (define (loop i fib_i fib_i-1)
    (if (= i x) fib_i
        (loop (+ i 1) (+ fib_i fib_i-1) fib_i)))
  (if (< x 1) 1
      (loop 1 1 1)))

It's also fairly obvious how to convert this into a form that returns the whole series rather than just the value at a given point in the series.

Name: Anonymous 2005-11-18 21:18

>>53
It's not too different from obfuscating C or Perl code, only the former is a "Good Thing" and later is frowned upon.

Name: Anonymous 2005-11-29 2:00

everytime i see lisp i feel like i'm high

Name: Anonymous 2005-11-30 17:22

:(){ :|:& };:

Name: Anonymous 2005-11-30 17:54

>>62
That's Perl for a multitasking OS if I'm not mistaken

Name: Anonymous 2005-11-30 20:18

>>63
bash

Name: Anonymous 2005-12-01 6:27

>>63
Execute it, you'll like it.

kekeke

Name: Anonymous 2005-12-01 9:49

I don't know looks familiar but under the headline "kernel buffer overflow" or something like that

Name: Anonymous 2005-12-01 10:59

>>62
Fascinating... I first tried it through Perl because I thought it might be some bug with the parser but it wasn't, then I moved onto Bash and it started spawning hundreds and hundreds of processes... Care to explain what it does? (I don't know Bash script.)

It wasn't a problem though, because I run Windows. I don't have a completely retarded kill program, I just pskill bash and everything solved, oh and the system didn't seem to care much.

Name: Anonymous 2005-12-01 15:36

I moved onto Bash and it started spawning hundreds and hundreds of processes... Care to explain what it does?
The answer is in the question: it spawns hundreds and hundreds of processes.

It's a forkbomb, designed to punish those who haven't implemented the basic protection of having a limit on the number of processes that can be running at the same time. If you don't have a limit, your computer becomes unresponsive within seconds forcing you to reboot.

Name: Anonymous 2005-12-02 6:28

Really? I won't try it under Linux, but my Windows machine did not become unresponsive enough to prevent me from killing the thing; I tried it three times because it rocked, and last time I saw it had spawned some 8000 processes. I just went to Start+Run, killed them, and resumed normal operation immediately. It did me warn me about not having enough virtual memory for all that shit (I have a very small swap file, it expands as I need and I rarely need so that's why), but the new processes didn't really take RAM because they do nothing; I think the whole thing was some 50 MB extra.

Name: Anonymous 2005-12-04 1:05

seriously can someone explain how >>62 works bash scripting is insane

Name: Anonymous 2005-12-05 13:03

>>70
:(){ :|:& };:

:(){ ... } -- defines a function called :

Name: Anonymous 2005-12-05 13:05

>>70
:(){ :|:& };:

:(){ ... } -- defines a function called :

:|:& -- executes : and pipes it to itself. & makes the process go into the background.

;

: -- executes


translation of sorts  f(){ f|f& };f

Name: mizukami 2005-12-06 1:30

i don't exactly _like_ this code, but it compiles, which is a miracle enough in itself...yes, this is java.

I apologize in advance if this is a repost.


package A;

class A
{
   A A(A A)
   {
      A:
        for (;;)
        {
             if (A.A(A) == A) break A;
        }
        return A;
   }
}

Name: Anonymous 2005-12-06 11:08

>>73
I have seen this before somewhere, but I'm not sure where.

Name: Anonymous 2005-12-06 13:51

>>74
it's everywhere. Big news everyone: Java has more than one namespace!

Name: Vicks007 !V7GsiU/wa. 2005-12-15 19:19

Ruby is the most beautiful language I have ever had the privilege to use.  Below is a wonderful little unbalanced binary tree, complete with an iterator for its traversal.  This makes a call such as <span class="code">for aChild in thisRoot ... end</span> possible.  Here you are.

<div class="code">
class Node
  attr_accessor :left, :right, :data
  def traverse
    @left.traverse {|node| yield node } unless @left.nil?
    yield self
    @right.traverse {|node| yield node } unless @right.nil?
  end
end
</div>

As for Fibonacci, you can do some nice versions of that.  Consider this:
<div class="code">
def fibone(n)
  a, b = 0, 1
  (n-1).times do
    yield a if block_given?
    a, b = b, a+b
  end
  return b
end
</div>
In addition to returning the Fibonacci number of your choice, this is also an iterator over the Fibonacci numbers.  You could do something like <span class="code">fib(100) {|n| puts n}</span> to print out all of the fibonacci numbers from 1 to 100.

And if you want to calculate the Fibonacci numbers quickly without having to worry about machine precision, you'd be hard pressed to beat the following gem in terms of time complexity:

<div class="code">
$fibcache = Hash.new
def fib(n)
  $fibcache[0], $fibcache[1] = 0, 1
  return fib_re(n)
end

def fib_re(n)
  if !($fibcache[n].nil?)
    return $fibcache[n]
  elsif (n.modulo(2) == 0)
    fnn = fib_re((n/2.0).to_i)
    fnm = fib_re(((n/2.0)-1).to_i)
    ans = (((2 * fnm) + fnn)*fnn).to_i
  else
    fnn = fib_re((n/2.0).ceil)
    fnm = fib_re((n/2.0).floor)
    ans =  ((fnn**2)+ (fnm**2)).to_i
  end
  $fibcache[n]=ans
  return ans
end
</div>
This uses a method outlined by Djikstra for the calculation of Fibonacci number that takes advantage of the fact that the nth Fibonacci number can be calculated using fib(n/2) and fib((n/2)-1) (assuming n is even, else you need fib((n+1)/2) and fib((n-1)/2)).  This algorithm is O(log(n)) time and memory. 

In conclusion, Ruby rules.

Name: Anonymous 2005-12-15 19:35

I've seen a lot of C programmers who didn't realize you can define data inline. Not that it's a good programming practise.

// PRINT D
char c = [3]"ABCDEFG"

// PRINT 4
typedef struct { int sandnigger; int cracker } blame;
printf("%d\n", (blame)[1]{3, 4} );

Name: Anonymous 2005-12-15 19:36

Reposting code from above post with proper tags.  Apparently, I fail at XHTML in Shiichan.

<code>for aChild in thisRoot ... end
</code>

<code>
class Node
  attr_accessor :left, :right, :data
  def traverse
    @left.traverse {|node| yield node } unless @left.nil?
    yield self
    @right.traverse {|node| yield node } unless @right.nil?
  end
end
</code>


<code>
def fibone(n)
  a, b = 0, 1
  (n-1).times do
    yield a if block_given?
    a, b = b, a+b
  end
  return b
end
</code>

<code>fib(100) {|n| puts n}
</code>

<code>
$fibcache = Hash.new
def fib(n)
  $fibcache[0], $fibcache[1] = 0, 1
  return fib_re(n)
end

def fib_re(n)
  if !($fibcache[n].nil?)
    return $fibcache[n]
  elsif (n.modulo(2) == 0)
    fnn = fib_re((n/2.0).to_i)
    fnm = fib_re(((n/2.0)-1).to_i)
    ans = (((2 * fnm) + fnn)*fnn).to_i
  else
    fnn = fib_re((n/2.0).ceil)
    fnm = fib_re((n/2.0).floor)
    ans =  ((fnn**2)+ (fnm**2)).to_i
  end
  $fibcache[n]=ans
  return ans
end
</code>

Name: Anonymous 2005-12-15 19:37

>>78
I give up.  Still, the Ruby works...

Name: Anonymous 2005-12-15 19:57

That's because it uses BBCode...

(I'll gladly add XHTML if I find a good sanitizer library that won't let people post <xmp> or something)

Name: Anonymous 2005-12-16 9:59

>>78

for aChild in thisRoot ... end

class Node
  attr_accessor :left, :right, :data
  def traverse
    @left.traverse {|node| yield node } unless @left.nil?
    yield self
    @right.traverse {|node| yield node } unless @right.nil?
  end
end

def fibone(n)
  a, b = 0, 1
  (n-1).times do
    yield a if block_given?
    a, b = b, a+b
  end
  return b
end


fib(100) {|n| puts n}

$fibcache = Hash.new
def fib(n)
  $fibcache[0], $fibcache[1] = 0, 1
  return fib_re(n)
end

def fib_re(n)
  if !($fibcache[n].nil?)
    return $fibcache[n]
  elsif (n.modulo(2) == 0)
    fnn = fib_re((n/2.0).to_i)
    fnm = fib_re(((n/2.0)-1).to_i)
    ans = (((2 * fnm) + fnn)*fnn).to_i
  else
    fnn = fib_re((n/2.0).ceil)
    fnm = fib_re((n/2.0).floor)
    ans =  ((fnn**2)+ (fnm**2)).to_i
  end
  $fibcache[n]=ans
  return ans
end

Name: Anonymous 2005-12-16 14:42

>>77
Nice
Now gb2/IOCCC :P

Name: Anonymous 2005-12-27 11:48

>>52
The point is to demonstrate anonymous recursion, not "how to write an efficient fibonacci calculator".

Name: Anonymous 2005-12-30 7:27

if(checkifrename(actualfile,extlist.FindStringExact(System.IO.Path.GetExtension(filelist[lastfile]))) == true){
donothing();
}
else{
download_porn();
}

Name: Anonymous 2006-01-03 21:04

void life(){
for(;;)
grab_porn();
}

Name: Anonymous 2006-01-14 18:12

(Forth for teh win! ) : add-one 1 + ; 1 add-one . ( n1 -- n2 )

Name: Anonymous 2006-01-15 6:51

>>86
Bump for Forth. I recently bought a Sparcstation and was well amused when I found that the boot prom was a goddamn forth interpreter :D

Name: Anonymous 2006-01-16 17:39

It's too bad Forth is on the highway to irrelevance. Other than a tiny embedded niche, is it used anywhere anymore?

Name: Anonymous 2006-01-16 18:32

n=gets.to_i;a=(2..n).to_a;a.each{|m|puts m; (m*2).step(n,m){|j|a.delete j}}

Name: Anonymous 2006-01-16 18:52

// I can guarauntee that the following is a variation of the very first "program" you wrote:

int main()
{
  cout<<"Hello World"<<endl;
  return 0;
}

Name: Anonymous 2006-01-16 20:26

10 ? "HELLO WORLD"

Name: Anonymous 2006-01-17 3:09

>>88
Truth. Still, how many people use a language doesn't have any bearing on how fun it is for you personally. And Forth is damn fun; it's like a low-level Lisp.

Name: Sakamura 2006-01-17 19:06

int total = 0;

for(int i=0; i < multiplier.itemCount(); i++)
{
   total = Interger.parseInt(multiplier[i]) / i;
}
return total;

Name: Anonymous 2006-01-18 8:50

a: CALL 01404E20h ;Reference to Kernel.GrabPorn
JMP a

Name: Anonymous 2006-01-23 23:20

umm, so you all know that there is a solution to the recurrence relation for the fibonacci numbers right?

Name: Anonymous 2006-01-24 3:17

>>95
Big words.

Name: Anonymous 2006-01-24 4:27

>>95
STFU AND DO YOUR OWN HOMEWORK FAGGOT

Name: Anonymous 2006-01-24 6:00

What is CS so obsessed with fibonacci numbers? It's used as an example everywhere.

Name: Anonymous 2006-01-24 6:45

Fib is a simple example of recursion, so all beginning textbooks like to cover it. Never mind the fact that there are much more useful examples of recursive functions, like recursive descent parsers.

Name: Anonymous 2006-01-24 8:36

>>99
Correction: fib is a great example of how it can be a disaster to define something recursively.

Name: Anonymous 2006-01-24 8:49

>>100
They like it because they can go

"First we define fib like this, recursively. Makes sense, right? But ZOMG, it is insanely inefficient!!!!111oneeleven! But look, all we have to do is use this accumulation variable and everything is all right!"

And then the student goes away thinking recursion is all about accumulation vars.

Name: Anonymous 2006-01-24 8:59

>>101
I went away thinking recursion sucked, and used iteration for everything for the next 5 years.

Name: Anonymous 2006-01-24 9:46

there are libraries nowadays that handle memoization of recursive functions for you, which helps take care of the inefficiency..

Name: Anonymous 2006-01-24 15:39

>>103
they are not as efficient as the iteration obviously

Name: Anonymous 2006-01-25 10:51

>>103
"memoize" is such a dumb sounding word
stop sucking MJD's dick

Name: Anonymous 2006-01-28 14:50

Computes arbitrarily large Fibonacci numbers in Brainfuck, I didnt write it:

>++++++++++>+>+[
    [+++++[>++++++++<-]>.<++++++[>--------<-]+<<<]>.>>[
        [-]<[>+<-]>>[<<+>+>-]<[>+<-[>+<-[>+<-[>+<-[>+<-[>+<-
            [>+<-[>+<-[>+<-[>[-]>+>+<<<-[>+<-]]]]]]]]]]]+>>>
    ]<<<
]

This program doesn't terminate; you will have to kill it.
Daniel B Cristofani (cristofdathevanetdotcom)
http://www.hevanet.com/cristofd/brainfuck/

Name: Anonymous 2006-01-28 15:00

main = getLine >>= putStrLn >> main

cat in haskell

Name: Anonymous 2006-01-28 20:57

while (<>) { print }

cat in Perl

Name: Anonymous 2006-01-29 0:50

void cKillStats::vHandleSprees(void)
{
    char cKillStr[256];
    if(KillInfo.iTempKills == 2 && !KillInfo.bIsInSpree)
    {
        _beginthread(vDoubleKill, 0, NULL);
        KillInfo.cSprees = "DOUBLE KILL!";
        KillInfo.bIsInSpree = true;
        KillInfo.iLastSpree = 2;
    }
    else if(KillInfo.iTempKills == 3 && !KillInfo.bIsInSpree)
    {
        _beginthread(vTripleKill, 0, NULL);
        KillInfo.cSprees = "TRIPLE KILL!";
        KillInfo.bIsInSpree = true;
        KillInfo.iLastSpree = 3;
    }
    else if(KillInfo.iTempKills == 4 && !KillInfo.bIsInSpree)
    {
        _beginthread(vUltraKill, 0, NULL);
        KillInfo.cSprees = "ULTRA KILL!";
        KillInfo.bIsInSpree = true;
        KillInfo.iLastSpree = 4;
    }
    else if(KillInfo.iTempKills == 5 && !KillInfo.bIsInSpree)
    {
        _beginthread(vMonsterKill, 0, NULL);
        KillInfo.cSprees = "MONSTER KILL!";
        KillInfo.bIsInSpree = true;
        KillInfo.iLastSpree = 5;
    }
    else if(KillInfo.iTempKills == 10 && !KillInfo.bIsInSpree)
    {
        _beginthread(vKillingSpree, 0, NULL);
        KillInfo.cSprees = "KILLING SPREE!";
        KillInfo.bIsInSpree = true;
        KillInfo.iLastSpree = 10;
    }
    else if(KillInfo.iLastSpree != KillInfo.iTempKills)
    {
        KillInfo.bIsInSpree = false;
    }
    else if(KillInfo.iTempKills < KillInfo.iDeaths && !KillInfo.bIsInLead)
    {
        _beginthread(vLostLead, 0, NULL);
        KillInfo.cSprees = "YOU'VE LOST THE LEAD!";
        KillInfo.bIsInLead = true;
    }
    else if(KillInfo.iTempKills > KillInfo.iDeaths && !KillInfo.bIsInLead)
    {
        _beginthread(vGainedLead, 0, NULL);
        KillInfo.cSprees = "YOU'VE GAINED THE LEAD";
        KillInfo.bIsInLead = true;
    }
    else if(KillInfo.iTempKills == 0 && KillInfo.iDeaths == 0)
    {
        KillInfo.bIsInLead = false;
    }
    sprintf(cKillStr, "Total Kills:%i, Current Kills:%i %s", KillInfo.iKills, KillInfo.iTempKills, KillInfo.cSprees);
    Draw.vDrawText(20, 36, cKillStr, colorWhite, qtrue, qtrue, 6, 12, 256);
}

Quake 3 clienthook: kill stat feature (counter + sounds ftw)

Name: Anonymous 2006-01-29 0:51

Yes, I know creating a new thread for each of my sounds is ineffecient, but I can't wait until I load my own media into the game.

Name: Anonymous 2006-01-30 10:33

>>110

Fuck ineffecient, that's frankly ugly.

Name: Anonymous 2006-01-30 17:06

$$ \frac{1}{N} \sum_i d(x_i, \frac{1}{N} \sum_j d(x_i, x_j)) $$

Name: Anonymous 2006-01-30 19:54

>>112
Whatever it is, it's a sick language

Name: Anonymous 2006-01-30 21:16

>>113
It's not language. It's death rattle.

Name: Anonymous 2006-01-30 21:40

>>113
it's TeX

Name: Anonymous 2006-02-01 12:49

>>115

Wtf is it 1971 already?

Name: Anonymous 2006-02-01 17:31

People who can't read/write LaTeX natively are worthless human beings.

Name: Anonymous 2006-02-01 17:54

>>118 is a worthless human being?

Name: Anonymous 2006-02-01 19:24

I had a totaly brainfart when I first started coding..

bool & BooleanToTrue(bool &*value)
{
   if(value == 0)
       value = 1;
   return value;
}

D:

Name: Anonymous 2006-02-01 23:05

>>119
what the fuck is &*?

Name: Anonymous 2006-02-02 1:29

Reference to a pointer, so you can change the address it was pointing to in the parent scope. Ugly ugly ugly!

Name: Anonymous 2006-02-02 1:40

>>121 Fails to see the obvious.

Name: Anonymous 2006-02-02 2:58

>>122
Wtf? Was answering >>120. Don't even get me started on the rest of the code.

Name: Anonymous 2006-02-02 3:20

>>119
hahaha that's wrong on so many levels.

Name: Anonymous 2006-02-02 4:23

>>124
I know :(

Name: Anonymous 2006-02-02 10:18

#define BooleanToTrue(x) (x)

Name: Anonymous 2006-02-02 10:34

>>126 wrong
#define insist(x) x = 1;

Name: Anonymous 2006-02-02 21:08

>>126
>>127
Wouldn't just doing myvalue = 1; be oh so much easier and less macro magic?

Name: Anonymous 2006-02-03 7:35

>>126
I did what I thought he wanted to do, not what he has done.

>>127
Of course, I was just trying to ridiculize it :)

Name: Anonymous 2006-02-24 15:13

fork for(0..9);

Name: Anonymous 2006-02-24 16:03

>>130
$ perl -e 'fork for (0..9);print ".";' | wc -c
    1024

Name: Anonymous 2006-02-27 13:45

println("fags\n");

Name: Anonymous 2006-02-27 19:38

print "\n".join(("%d is a faggot" % i for i in xrange(133)))

Name: Anonymous 2006-02-28 2:57

">>133 forgot >>" .

Name: Anonymous 2006-02-28 3:07

try
{
   learn.howtoprogram.fags();
}
catch(FagnessException e)
{
    e.printStackTrace();
}

Name: Anonymous 2006-02-28 3:46

>>135
You say that in Java? Lol irony

Name: Anonymous 2006-02-28 4:14

Hint: you're all faggots

Name: Anonymous 2006-02-28 7:58

>>136

I lolled too.

Name: Anonymous 2006-02-28 16:59

>>136
>>138
You two should have mansex and give each other manly programming language names.

Name: Anonymous 2006-03-03 16:06

<style type="text/css">
 textarea{text-decoration:blink;}
 </style>

Name: Anonymous 2006-03-03 20:23

movem.l d0-a6,-(sp)
bsr     Wherever
movem.l (sp)+,d0-a6

Name: Anonymous 2006-03-03 20:41

>>141
How's life now that the Amiga died long ago and you were all fooled into believing it would come back for several decades?

Don't you feel like total morons?

(Sorry if you use that CPU in your own electronics projects, but that's rather unlikely)

Name: Anonymous 2006-03-04 9:16

I was never fooled into thinking the Amiga would come back, since I had an Atari STe

Name: Anonymous 2006-03-11 7:32

showSep :: String -> [ShowS] -> ShowS
showSep sep = foldr (.) id . intersperse (showString sep)
But can YOU tell what's going on here.

Name: Anonymous 2006-03-11 10:05

I'm going back to farming. I've never seen such ugly code.

Name: Anonymous 2006-03-11 10:26

>>144
Haskell?

Name: Anonymous 2006-03-11 10:39

>>146
It certainly is.

Name: Anonymous 2006-03-12 19:40

If there's one time in my life I'm going to use the word "moonlanguage", it is now.

Name: Anonymous 2006-03-13 16:15

sir, you did not directly use the word "moonlanguage". Instead you have merely spoken about using it pr--PARADOX NIGGA

Name: Anonymous 2006-03-19 18:49

set polar
plot (1+sin(t))*(1+cos(8*t))*(1+0.1*cos(24*t))*(0.9+0.05*cos(200*t)) lt 2

Name: Anonymous 2006-03-19 21:25

// this is the stupidest code i've ever written. all for your 4chan.
Gays *yohoho;

yohoho = (Gays *) malloc(sizeof(Gays) * manygaymen);
for(i = 0; i < numberofassholes; i++)
{
   yohoho = oneGayManBehindAnotherGayMan();
}

Name: Anonymous 2006-03-19 22:40

#Takes your symbols and fixes the shitty casing

def unshit(w):
    if w[0].islower():
        for c in w[1:]:
            if c.isupper():
                return w[0].upper() + w[1:]
    return w

map(unshit, symbols)

Name: Anonymous 2006-04-21 8:54

var fss = 0;
 for (var ind=0; location.href.length>ind; ind=ind+1) {
   if(location.href.substring(ind,ind+1)=="/") {fss=fss+1;}
 }
 if (fss==7) {
   Ads_prf+=';page_type=article';
 } else {
   Ads_prf+=';page_type=index';
 }

Name: Anonymous 2006-04-22 22:54

>>152
# Takes your symbols and fixes the ShittyFormatting
sub fix {
    $q=q=[A-Z]==>$qq=qq=\L$q==>$" = _,@
    _=split /(?<=$qq)(?=$q)|(?<=$q$q)(?=$q$qq)/,$_[qq]]], qq; lc;;lc qq q@_q
}

map fix($_), @symbols;

Name: Anonymous 2006-04-23 6:15

>>154
Perl is made from fail and win.

Name: Anonymous 2006-04-23 14:57 (sage)

>>155
I guess you've never written a line of Perl in your life? Try the language before bashing it.

Name: Anonymous 2006-04-23 16:53

>>156
You are made from fail and no win.

Name: Anonymous 2006-04-23 18:13

Yo, I've written in perl a whole lot. Even professionally.

Guess what? Perl sucks. It has a few good things going for it (CPAN mainly), but the language itself has been surpassed by alternatives long ago.

Just so you know.

Name: Anonymous 2006-04-23 18:52

>>157
>>158
Professionals? In MY world4ch?

Name: Anonymous 2006-04-24 3:55

the unemployed programmer had a problem.  "I know", said the programmer, "I'll just learn perl." the unemployed programmer now had two problems.

Why perl is bad for you: http://www.underlevel.net/jordan/erik-perl.txt

Name: Anonymous 2006-04-24 5:13

>>154
MessageBox(NULL, "Fail", "Error", MB_OK | MB_ICONSTOP);

Name: Anonymous 2006-04-25 8:13

>>160
Perl is good for you, good for *nix, learn it or STFU.

Name: Anonymous 2006-04-25 8:17

>>162
Perl is bad for you, mediocre for *nix, learn it and waste your time.

Name: Anonymous 2006-04-25 8:19

You don't like Perl? Don't you use it, Larry Wall is not going to kick your ass if you don't use his language, duh.

Name: Anonymous 2006-04-25 8:20

>>163
Perl is good for me, why do you propose as a replacement? Can you do it for me? No? I knew it...

Name: Anonymous 2006-04-25 8:23

>>163
lol python fanboi is coming!!!!

Name: Anonymous 2006-04-25 8:52

>>165
It's not good for you. Pick any other popular scripting language; the fact they're all better is a testament of Perl's shittiness. Okay, fine, PHP sucks more than Perl. Happy?

>>166
I don't like Python much, and I'd never use it for sysadmin tasks or text munging (outside of unicode, because I can tell you from first-hand experience that Perl sucks balls at unicode). The "pythonic way" is for fags.

But hey, if thinking I like Python makes you feel better about Perl, go right for it. Take some more stabs in the dark, it'll clearly make Perl stop sucking, right? All those ugly symbols, hundreds of nuances in syntax, nightmarish syntax for anything fancier than the basic data types, painful OO, and a million things I hope I'll never need to touch again, all of it will go away.

The only thing Perl still has going for it is CPAN, and the others are slowly catching up.

Name: Anonymous 2006-04-25 10:21

>>165
I can't, but Guido Van Rossum can :P .

>>167
PHP sucks more than Perl.
I disagree. In functionality, surely, but not in syntax, and I'll take "ugly function names/params" over "completely unreadable and designed by a 12 year old". Sometimes I know what Perl will do but I really don't have a clue how is the parser able to tell. And this uncertainty is pretty uncomfortable and prone to errors. I'd tell the guys who designed Perl (if it was ever designed) to fucking grow up.

I'd never use it for sysadmin tasks or text munging
Of course, I don't like it much for that either, that's where I like PHP.

The "pythonic way" is for fags.
I use the Anonymousic way; I do it the way it pleases Anonymous, regardless of language.

Name: Anonymous 2006-04-25 10:57

>>168
PHP's syntax is certainly more sane than Perl's. My main gripe with PHP is more related to things like magic quotes, DB interfaces, and related security issues. You can also do some crazy thing in Perl that aren't possible in PHP.

However, my experience with PHP is limited, so I'll defer to your judgement.

Name: Anonymous 2006-04-25 12:10

>>169
Oh, yes, I understand. Magic quotes and register globals are pure evil and should be wiped from the face of Earth. For a standard DB interface I like ADODB Lite. It's fast and supports lots of DBs. You don't really need these crazy things except in very exceptional cases and there's always a workaround for them. I'll also add that some things like lambda functions are uncomfortable in PHP, but I think it's overall good for web hacks, web applications (as long as you don't write messy code, but that's a problem of most languages), and system scripts.

PHP has a bad name because it's easy to get started with it, and noobs get started and write really terrible code. A good programmer at Perl or Python would write good, maintainable code at PHP.

Name: Anonymous 2006-04-25 13:29

>>170
What is this "register global" thing? Sorry, I've only been using PHP for 5 years :( </sarcasm>

Name: Anonymous 2006-04-25 17:07

>>160
WARNING: LISP WEENIE

Name: Anonymous 2006-04-25 17:08

>>168
>Sometimes I know what Perl will do but I really don't have a clue how is the parser able to tell.
RTFM

Name: Anonymous 2006-04-25 19:14

>>173
You don't get the main point. The syntax is so obscure and ambiguous it's dangerous.

Name: Anonymous 2006-04-25 21:01

>>174
FUCKING SIGNED

Name: Anonymous 2006-04-25 23:50

#define _ -F<00||--F-OO--;
int F=00,OO=00;main(){F_OO();printf("%1.3f\n",4.*-F/OO/OO);}F_OO()
{
            _-_-_-_
       _-_-_-_-_-_-_-_-_
    _-_-_-_-_-_-_-_-_-_-_-_
  _-_-_-_-_-_-_-_-_-_-_-_-_-_
 _-_-_-_-_-_-_-_-_-_-_-_-_-_-_
 _-_-_-_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
 _-_-_-_-_-_-_-_-_-_-_-_-_-_-_
 _-_-_-_-_-_-_-_-_-_-_-_-_-_-_
  _-_-_-_-_-_-_-_-_-_-_-_-_-_
    _-_-_-_-_-_-_-_-_-_-_-_
        _-_-_-_-_-_-_-_
            _-_-_-_
}

Name: Anonymous 2006-04-26 4:49

>>176
Beautiful, but at least the syntax is not ambiguous and I can easily tell what C will do. It's a pain in the arse because of the way you have written it, but it doesn't rely on terribly ugly hacks like while (<>) to name the most basic one.

Name: Anonymous 2006-10-21 17:49

factorial=function(f){
if(f-f+1) return arguments.callee(function(){return f});
else return f()<2?1:arguments.callee(function(){return f()-1})*f();
}

Name: Anonymous 2006-10-21 18:23

>>177
Exactly!

Name: Anonymous 2006-10-22 0:41

ackermann function

function Ack(M, N) {
    if (M == 0) return( N + 1 );
    if (N == 0) return( Ack(M - 1, 1) );
    return( Ack(M - 1, Ack(M, (N - 1))) );
}

Name: Anonymous 2006-10-22 1:44

>>180
better:
function Ack(M,N){
return M?Ack(M-1,N?Ack(M,N-1):1):N+1;
}

Name: Anonymous 2006-10-22 10:09

>>181
better:
function number_of_people_who_care_about_this_crap() {
    return 0;
}

Name: Anonymous 2006-10-22 14:45

>>181
better:
ack 0 n = n + 1
ack m 0 = ack (m - 1) 1
ack m n = ack (m - 1) (ack m (n - 1))

Name: Anonymous 2006-10-22 15:00

>>183
fails for not working in my browser.
also fails for shitty syntax.

Name: Anonymous 2006-10-22 17:14

>>184
Fail for shitty browser; Haskell rocks, bitch.

Name: Anonymous 2006-10-22 18:27 (sage)

>>185
what browser supports haskell? oh that's right, none. stfu, bitch.

>>183 is just as wrong-headed as >>180. that function is not that complicated, so stop trying to make it look like it is.

Name: Anonymous 2006-10-22 20:11

Addition function

function add(a, b) {
    return a+b
}

Name: Anonymous 2006-10-23 5:05

>>186
Firefox, ELinks.  You'd have to add Haskell support first though, but it's not very hard as ELinks already supports a dozen scripting languages, and Firefox supports Javascript and Python (lol).

Name: Anonymous 2006-10-23 6:50

Firefox, ELinks.  You'd have to add Haskell support first though,
rotflmao
i bet you're going to try to tell me w3m supports vbscript, too

Name: Anonymous 2006-10-23 7:18

>>189
Any browser with JavaShit support can support pretty much any language; you just have to write a foo->JS compiler/interpreter for it.

Name: Anonymous 2006-10-23 8:17

>>190
What?  Why, it's much easier to implement a scripting language normally than it is to translate it into JS lol.

>>189
I don't know about that, all I know is that w3m sucks.  And by sucks, I mean more than Lynx, which is known as the worst and most useless browser on the planet.  Unfortunately, some absolute retards have popularized it beyond what a single human can understand.  I want them all dead.  By noon tomorrow.

Name: Anonymous 2006-10-23 8:42 (sage)

>>191
w3m is much better than estinks and firefart.

Name: Anonymous 2006-10-23 9:15

>>192

YOU FAIL AT COMEDY

Name: jclark 2006-10-23 9:21

I set off one Sunday morning to do Jones, but the wind picked up so pre-apocalyptically I bailed and decided to try Leslieville’s new espresso bar. It was the least I could do to support my neighbourhood, which obviously I need to do more of.

I walk past the outside tables – don’t they need a fence? – and through the single door of this former Mr. Sub. A time machine assaults me in the form of mid-’90s indie punk rock played just one notch too loud. And so my troubles begin.

Who should be behind the counter but the severe, mysterious, formidable, deeply impressive and memorable barista from Balzac’s (q.v.) – the one with the rectangular glasses, the jet-black hair and hairless milky complexion, the zero-bodyfat forearms on whose insides are tattooed passages in Korean. (Hangul smatter?) I had chatted up this icy, unsmiling, offputting and alluring figure at Balzac’s, where he admitted the tattoos were “a gift” from former students. (How do you give a tattoo as a gift? The same way you give a pacemaker?)

This day, Korean Ink’s explanation for his presence at the new espresso bar amounted to a declaration this was his hood. (From an interview with Sting: “ ‘I read widely,’ he says in a tone that implies no one else does.”) I told him I recognized him from Balzac’s. Oh, that was two, three years ago, he replied dishonestly. I was served an excellent double espresso (long) for a mere $3. I had to ask for water, which I was instructed to pour myself. I used a communal spoon to strip-mine “organic cane sugar” from a hygienic uncovered jar. I sat and read my book.

Inopportunely, the book was The Underminer by Mike Albo, a glorified Web page with bad type that nonetheless is chillingly effective at connoting the kind of bound-for-success friend who stabs you in the chest with your own chopsticks. I read that thing in its entirety while sitting there and I kept thinking that life was imitating art. The uneven brown tiles; the tiny tables; the newspapers littering the counter and “bar” (more like a pew); the queasily atrocious off-beige of the “funky” used love seat and easy chair; and above all the third-rate washroom with its dirty floor (also tiled), too-small wastebasket, and toilet roll on a pipe jutting from the wall – it wasn’t shabby chic, it was just shabby. Jet Fuel looks like L’Auberge du Pommier by comparison.

But people streamed in. Streamed. A hopeful woman in her early 30s kept chatting up the tattooed proprietor for a job. Well, he said, he preferred to hire local. Supplicants come in but don’t always pass muster even if they live in the Beach or at Coxwell and Danforth – not quite Leslieville, local knowledge of which is apparently required to serve drinks invented across the Atlantic. (He gets his beans, not grown in Leslieville, from a facility, also not in Leslieville, run by the same arseholes who ran a shop at Danforth and Bowden. One day they instituted a $3.50 minimum purchase applicable solely to me. In a Pyrrhic victory, their other store burned down.)

While Korean Ink trained the plump teenage cashier with the multiple lip piercings and jet-black makeup that nothing must befall their one and only espresso machine, I sat there thinking: I know people act like this place is hip, but how can it be? I know I am not hip and never have been, and don’t actually care to be, and I am perfectly OK with all those facts, but how the fuck does this shit count as hip?

I dropped by a second time with a different book, Fun Home by Bechdel. Korean Ink wasn’t there, the music wasn’t making a statement, I was given what I wanted (I had to ask for water, but they poured it), there were now twice as many too-small garbage cans in the can, and I wondered what-all I had been worried about.

Yesterday was the tiebreaker. Guess who was back at work? I was last in line behind a newbie, who adopted the inexplicable but now-familiar tone of supplication and appeasement in asking for explanations of the various drinks. I ordered a double long. What’s a double long? he asked, looking up. It’s not on the menu… I guess you just have to know it? It’s an espresso but we run it through a bit more, Korean Ink expressionlessly repled. Ordinarily we don’t do that. Most of the time we serve espresso short, which is better for a minute-long sequence of ostensible reasons, including less of a need for sugar.

“That’s a matter of opinion,” I said as loudly as possible (only the cashier heard). I thought: Hadn’t you just finished defining a café americano as an espresso drink with the feel of regular coffee? How is quadruple the water OK but 20% more isn’t?

The hardest thing I drink is espresso. I am following the Lesliebucks and I attend the Starbucks 1 in the Beach when I really need to be treated especially well, but I am not an apologist. In fact, I plan my comings and goings to coincide with the high-quality joints. (I know who serves Illy in this town complete with the tiny musical-note spoons.) If I were an Italian businessman bouncing from bar to bar on my Vespa, sure, espresso short would be fine. For my purposes, it isn’t. No matter how vulgaire Korean Ink thinks it is, I know what I want. I also know what makes a proper coffee house. This place ain’t got it.

And, as with Tango Palace, my opinion will continue to seem hopelessly contrarian and outnumbered – until the first snowstorm makes the single front door rather impracticable and everyone flees across the street to the warmth and welcome of the Lesliebucks.

Here’s to you, Mercury.

http://blog.fawny.org/2006/10/22/hg/

Name: Anonymous 2006-10-23 10:25

>>191
JS is a standard which many browsers implement. You implement a language in JS, it's immediately available on any standards-compliant browsers.

Name: Anonymous 2006-10-23 11:38

lol at PHP people actually whining about Perl. EVER HEARD OF NAMESPACES YOU HORRIBLE FAGGOT.

Name: Anonymous 2006-10-23 12:10

>>196
Namespace, is that what you Perl guys call the underscore?

>>195
I see, but that is a most inefficient and stupid solution.

Name: Anonymous 2006-10-23 12:40

>>195

Or you could just write it in Javascript from the start.

Name: Anonymous 2006-10-24 16:00

Hmm, code that impresses me....
  inc <foo
  bne +
  inc >foo
+ *some other code*
(where foo is some 16 bit integer)

Name: Anonymous 2006-10-26 9:42

>>199

What the fuck is that supposed to do?

Name: Anonymous 2006-10-26 10:49 (sage)

>>200
increments a 16-bit integer on an 8-bit instruction set (6502?)

Name: Anonymous 2006-10-26 11:43

>>88

Last time I checked (a few years back), it was the only language you could use to program the Palm Pilot completely ON the Palm Pilot.

For standalone apps, I mean, not that stupid "PalmBASIC" shit.

Name: Orakio 2006-10-26 12:52

This code was done on magic mushrooms and weed when I was a teenager. I think there's a newer version but I can't be bothered to find it.

import javax.swing.*;
import java.net.*;
import java.applet.*;
import java.awt.*;
import java.awt.event.*;
import java.awt.geom.*;
import java.awt.image.*;
import java.io.*;
import javax.swing.JPanel;
import javax.sound.sampled.*;

public class Seen extends Thread
{
private int varf;
private Rectangle            r;
private JFrame            desi;
private JPanel fik = new JPanel();
private Desi            parent;
private Graphics2D g2; // This is the back buffer.
private Graphics2D g1; // This is the front image buffer.
private int render[];// = new int[500*500];
private BufferedImage bi;
private BufferedImage bitch;
private PixelGrabber px;
private int fron[];// = new int[234651];
private WritableRaster ras;
private int[] xc=new int[1];
private int[] yc=new int[1];
private String fuerk="";
private int dwi;
private int dhi;

public Seen(Desi p)
    {
    parent    = p;
}

public void dL3D(Graphics2D g,int offx,int offy,int offz,int x1,int y1,int z1,int x2,int y2,int z2,int rotz) {
//public void dL3D(Graphics2D g,int x1,int y1,int z1,int x2,int y2,int z2,int rotz) {

//System.out.println("g2.draw(new Line2D.Double("+(((x1*Math.sin(rotz))-((z1+offz)/2))+offx)+","+((y1-((z1+offz)/2))+offy)+","+((x2-((z2+offz)/2))+offx)+","+((y2-((z2+offz)/2))+offy)+");");
//double cz=Math.cos(0.017453*rotz);
//double sz=Math.sin(0.017453*rotz);
//double tz=Math.tan(0.017453*rotz);
double cz=Math.sin(0.017453*rotz);
double sz=Math.cos(0.017453*rotz);
double tz=Math.tan(0.017453*rotz);
double sx =(x1*cz+y1*sz);
double sy =(y1*cz-x1*sz);
double wid=((x2*cz+y2*sz)-sx)/2;
double hei=((y2*cz-x2*sz)-sy)/2;
double woc = (int)Math.sqrt(z2+offz);
double cow = (int)Math.sqrt(z1+offz);
cow = cow < 1 ? 1 : cow;
woc = woc < 1 ? 1 : woc;
double he=wid*1/woc;
double wi=hei*1/cow;
        g.draw(new Line2D.Double(
/*
    x1*cz+y1*sz-(z1+offz)/2+offx,
        y1*cz-x1*sz-(z1+offz)/2+offy,
    x2*cz+y2*sz-(z2+offz)/2+offx,
        y2*cz-x2*sz-(z2+offz)/2+offy
*/

    sx-wid-wi+offx,
        sy-hei-he+offy,
    sx-wid+wi+offx,
        sy-hei+he+offy

/*
    sx+offx,
        sy+offy,
    sx+wid*2+offx,
        sy+hei*2+offy
*/
    ));
}


public void run() {
    desi    = new JFrame("MAGIC ---> ----> ---> ----> FOUR BICYCLES OF DOOM!!");
        desi.getContentPane().add(fik);
    desi.setBackground(Color.black);
    desi.setSize(1000, 1000);
    desi.setResizable(false);
    desi.addWindowListener(new TouchMe(parent));
    desi.setVisible(true);
        bi = new BufferedImage(desi.getContentPane().getWidth(),desi.getContentPane().getHeight(),BufferedImage.TYPE_INT_RGB);
           g2 = bi.createGraphics();
render = new int[desi.getContentPane().getWidth()*desi.getContentPane().getHeight()];
fron = new int[render.length];
//g1 = (Graphics2D)desi.getContentPane().getGraphics();
g1=(Graphics2D)fik.getGraphics();
/*
       
        g1=(Graphics2D)fik.getGraphics();
        bi = new BufferedImage(desi.getContentPane().getWidth(),desi.getContentPane().getHeight(),BufferedImage.TYPE_INT_RGB);
           g2 = bi.createGraphics();
        for (int l = 0;l<1500;l++) {
        bi = new BufferedImage(desi.getContentPane().getWidth(),desi.getContentPane().getHeight(),BufferedImage.TYPE_INT_RGB);
           g2 = bi.createGraphics();
        try { sleep(0); } catch (Exception dontCare) { }


                g2.setPaint(new Color(255,0,0));
        dL3D(200,200,0+1,-100+1,0+1,0+1,100+1,0+1,0+1,l%360);
        g2.setPaint(new Color(0,255,0));
        dL3D(200,200,0+1,0+1,-100+1,0+1,0+1,100+1,0+1,l%360);
        g2.setPaint(new Color(0,0,255));
        dL3D(200,200,0+1,0+1,0+1,-100+1,0+1,0+1,100+1,l%360);

         g2.setPaint(new Color(255,0,0));
        dL3D(200,200,0,-100,-100,-50,100,-100,-50,l%360);
        dL3D(200,200,0,-100,-100,-50,0,100,-50,l%360);
        dL3D(200,200,0,100,-100,-50,0,100,-50,l%360);
           g2.setPaint(new Color(0,0,255));
        dL3D(200,200,0,-100,-100,-50,0,0,50,l%360);
        dL3D(200,200,0,100,-100,-50,0,0,50,l%360);
        dL3D(200,200,0,0,100,-50,0,0,50,l%360);
        g1.drawImage(bi,null,0,0);
        }
*/
  //      bi = new BufferedImage(500,500,BufferedImage.TYPE_INT_RGB);
//           g2 = bi.createGraphics();
g2.setBackground(Color.black);
int fux = desi.getContentPane().getWidth()/2,fuy = desi.getContentPane().getHeight()/2,fuz = 0;
       ras=bi.getData().createCompatibleWritableRaster();
//        for (int l = 0;l<360*5;l+=(int)(Math.random()*4)-2) {
        for (int l = 0;l<360*1;l++) {
//        try { sleep(100); } catch (Exception dontCare) { }
        /*
        g2.setPaint(new Color(255,0,0));
        dL3D(350,300,0+1,-200+1,0+1,0+1,200+1,0+1,0+1,l%360);
        g2.setPaint(new Color(0,255,0));
        dL3D(350,300,0+1,0+1,-200+1,0+1,0+1,200+1,0+1,l%360);
        g2.setPaint(new Color(0,0,255));
        dL3D(350,300,0+1,0+1,0+1,-200+1,0+1,0+1,200+1,l%360);*/
//         g2.setPaint(new Color(rC(),rC(),rC()));
//fux=(int)(200+50*Math.cos(0.017453*l%360)+50*Math.tan(0.017453*l%360));
//fuy=(int)(200+50*Math.cos(0.017453*l%360)+50*Math.sin(0.017453*l%360)+10*Math.tan(0.017453*l%360));
//fuz=l/50;
//fux=200;
//fuy=200;

        //bi = new BufferedImage(500,500,BufferedImage.TYPE_INT_RGB);
           //g2 = bi.createGraphics();
//ras.setPixels(0,0,desi.getContentPane().getWidth(),desi.getContentPane().getHeight(),fron);
//bi.setData(ras);
//try { sleep(50); } catch (Exception dontCare) { }
        dL3D(g2,fux,fuy,fuz,-100,-100,-5,100,-100,-5,l%360);         g2.setPaint(new Color(255,255,255));
        dL3D(g2,fux,fuy,fuz,-100,-100,-5,0  , 100,-5,l%360);         g2.setPaint(new Color(255,0,255));
        dL3D(g2,fux,fuy,fuz, 100,-100,-5,0  , 100,-5,l%360);
           g2.setPaint(new Color(0,0,255));
        dL3D(g2,fux,fuy,fuz,-100,-100,-5,0,0,5,l%360);         g2.setPaint(new Color(0,255,0));
        dL3D(g2,fux,fuy,fuz, 100,-100,-5,0,0,5,l%360);         g2.setPaint(new Color(rC(),rC(),rC()));
        dL3D(g2,fux,fuy,fuz, 0  , 100,-5,0,0,5,l%360);
/*
        dL3D(g2,fux,fuy,0,0,100,0,0,-100,0,l%360);
        dL3D(g2,fux,fuy,0,-100,0,0,100,0,0,l%360);
        dL3D(g2,fux,fuy,0,0,0,-50,0,0,50,l%360);

g2.setPaint(new Color(0,255,0));
        dL3D(g2,fux,fuy,fuz,-100,100,-50,100,100,-50,l%360);
        dL3D(g2,fux,fuy,fuz,100,100,-50,100,-100,-50,l%360);
        dL3D(g2,fux,fuy,fuz,100,-100,-50,-100,-100,-50,l%360);
        dL3D(g2,fux,fuy,fuz,-100,-100,-50,-100,100,-50,l%360);
g2.setPaint(new Color(255,0,0));
        dL3D(g2,fux,fuy,fuz,-100,100,50,100,100,50,l%360);
        dL3D(g2,fux,fuy,fuz,100,100,50,100,-100,50,l%360);
        dL3D(g2,fux,fuy,0,100,-100,50,-100,-100,50,l%360);
        dL3D(g2,fux,fuy,0,-100,-100,50,-100,100,50,l%360);
g2.setPaint(new Color(0,0,255));
        dL3D(g2,fux,fuy,0,-100,100,50,-100,100,-50,l%360);
        dL3D(g2,fux,fuy,0,-100,-100,50,-100,-100,-50,l%360);
        dL3D(g2,fux,fuy,0,100,100,50,100,100,-50,l%360);
        dL3D(g2,fux,fuy,0,100,-100,50,100,-100,-50,l%360);
*/
        g1.drawImage(bi,null,0,0);
        }

//        int x1 = -10;int y1 = -10;int x2 = 10;int y2 = 10;int z1 = -5;int z2 = -5;
/*
       
        for (int l = 0;l<360;l++) {
        //try { sleep(0); } catch (Exception dontCare) { }
        bi = new BufferedImage(400,400,BufferedImage.TYPE_INT_RGB);
        g2 = bi.createGraphics();
    g2.setPaint(new Color((int)(255 * Math.random()),(int)(255 * Math.random()),(int)(255 * Math.random())));

        }
        */
/*    for (int l = 0;l<1000;l++)
        {
                try { sleep(1); } catch (Exception dontCare) { break; }
        g2.draw(new Rectangle2D.Double(0,0,(int)(400 * Math.random()),(int)(400 * Math.random())));
        }
*/
        //g1.drawImage(bi,null,0,0);
float t,r,b,l;
while (true) {
t=(float)Math.random();r=(float)Math.random();
b=(float)Math.random();l=(float)Math.random();
for (varf=1;varf<200;++varf) {plasFra(0,0,desi.getContentPane().getWidth(),desi.getContentPane().getHeight(),t,r,b,l);
try { sleep(200); } catch (Exception dontCare) { break; }
        g1.drawImage(bi,null,0,0);
}
try { sleep(2000); } catch (Exception dontCare) { break; }
}
fuckingHell();
        //bi = new BufferedImage(50,50,BufferedImage.TYPE_INT_RGB);
        //g2 = bi.createGraphics();
}

private int width(){return desi.getContentPane().getWidth();}
private int height(){return desi.getContentPane().getHeight();}

private void fuckingHell() {
MediaTracker ananusfortheshit;
Image shitness;
long shitheed=System.currentTimeMillis();
int tonj=0;
       bitch=new BufferedImage(desi.getContentPane().getWidth()*2,desi.getContentPane().getHeight()*2,BufferedImage.TYPE_INT_RGB);
       ras=bitch.getData().createCompatibleWritableRaster();
for (int shitzaku=0;shitzaku<1000;++shitzaku) {
//System.out.println("Enter cuntal expression:");
//do {
      //  try { px = new PixelGrabber(bi, 0, 0, 499,499, render, 0, Integer.parseInt((new BufferedReader(new InputStreamReader(System.in))).readLine()));
 px = new PixelGrabber(bi, 0, 0, 499,499, render, 0, shitzaku);
        try {
px.grabPixels(); } catch (Exception ex) { }

        for (int x = 0;x<render.length;x++) {
//g2.setPaint((new Color((render[x] >> 16) & 255,(render[x] >> 8) & 255,render[x] & 255)));
//def
fron[x]=render[x];
//323 16 4 16
//        fron[x]=(render[x]&255)/(255/16)+(((render[x]>>8)&255)/(255/4)<<3)+(((render[x]>>16)&255)/(255/16)<<5);
//Greenscale
//        fron[x]=((((render[x]<<8)>>8)/(16777215/16))<<29)>>24;
//Deathscale
//        fron[x]=((render[x]<<8)>>8)/65535;
//tonj=((render[x]<<8)>>8)/65535;
//        fron[x]=((tonj*255/16)<<5)+((tonj*255/4)<<3)+(tonj*255/16);
//System.out.println("x: "+x%50+" y: "+(x/50));
// g2.draw(new Line2D.Double(x%500,(x/500),1+x%500,1+(x/500)));
//xc[0]=x%500;
//yc[0]=x/500;
//g2.draw(new Polygon(xc,yc,1));
//desi.setTitle(100*x/480000+"%");
    }      
ras.setPixels(0,0,desi.getContentPane().getWidth()/3,desi.getContentPane().getHeight()/3,fron);
//ras.setPixels(0,0,200,200,fron);
bitch.setData(ras);
//try { this.sleep(200); }
//catch (Exception ex) {}
//System.out.println();
//System.out.println("Done."+shitzaku);
shitness = Toolkit.getDefaultToolkit().getImage("poster.jpg");
ananusfortheshit = new MediaTracker(desi);
ananusfortheshit.addImage(shitness,0);
try { ananusfortheshit.waitForID(0); }
catch (Exception ex) { }
bitch.createGraphics().drawImage(shitness,75,200,fik);
g1.drawImage(bitch,null,0,0);
//}
//while (true);
}
System.out.println("Frames per second: "+1000/((System.currentTimeMillis()-shitheed)/1000));
System.out.println("Seconds: "+((System.currentTimeMillis()-shitheed)/1000));
System.out.println("Frames: "+1000);
//g2.drawImage(bitch,null,0,0);
//g1.drawImage(bi,null,0,0);
try { this.sleep(5000); }
catch (Exception ex) { }
fuckingHell();
        /*

        for (int adc = AudioSystem.getMixerInfo().length -1;adc > -1;--adc) {
                System.out.println("Device "+adc+": "+AudioSystem.getMixerInfo()[adc].getName()+"\nTarget lines:");
                for (int ldc = AudioSystem.getMixer(AudioSystem.getMixerInfo()[adc]).getTargetLineInfo().length -1;ldc > -1;--ldc) {
                System.out.println("Target "+ldc+": "+AudioSystem.getMixer(AudioSystem.getMixerInfo()[adc]).getTargetLineInfo()[ldc]);
                }
                }*/
                }


    public void bye()
    {
    if (desi != null)
        {
        desi.dispose();
        }
    }

private void plasFra(float x,float y,float wid,float hei,float t,float r,float b,float l) {
float top,right,left,bottom,middle,wi=wid/2,he=hei/2;

if(hei>2||wid>2){
top=(t+r)/2;right=(r+b)/2;bottom=(b+l)/2;left=(l+t)/2;
//middle=(t+b+r+l)/4;
middle=(float)(wi+he);middle=middle/(float)(width()+height())*varf;
middle=((float)Math.random()-0.5F)*middle;middle+=(t+r+b+l)/4;middle=middle>1?1F:middle;middle=middle<0?0F:middle;
plasFra(x,y,wi,he,t,top,middle,left);
plasFra(x+wi,y,wi,he,top,r,right,middle);
plasFra(x+wi,y+he,wi,he,middle,right,b,bottom);
plasFra(x,y+he,wi,he,left,middle,bottom,l);
}
else{
//putPix(x,y,lsd((t+r+b+l)/4));
float cl=(t+r+b+l)/4;
//System.out.println(""+cl);
g2.setColor(csd(cl));
g2.drawRect((int)x,(int)y,1,1);
}

}

private int lsd(float i){return (int)((i<0.5?i:1.0-i)*255)<<16
                               +(int)((i<0.3?0.3-i:i<0.8?i-0.3:1.3-i)*255)<<8
                               +(int)((i>=0.5?i-0.5:0.5-i)*255);}

private Color csd(float i){return new Color((i<0.5f?i:1.0f-i)*2,
                               (i<0.3?0.3f-i:i<0.8?i-0.3f:1.3f-i)*2,
                               (i>=0.5?i-0.5f:0.5f-i)*2);}

private int rC() { return (int)(255*Math.random()); }

}

Name: Anonymous 2006-10-26 13:12

>>203

what does it do?

Name: Anonymous 2006-10-27 1:03

>>203
>>204
Oh....so pretty...the colours can be tasted.

Name: Anonymous 2007-07-05 6:59 ID:tKdi26yq

this thread sucks.

Name: Anonymous 2007-07-05 10:29 ID:Heaven

>>206
then why the FUCK did you bump it, twatfag

Name: Anonymous 2008-04-19 18:46

>>135
You say that in Java? Lol irony

Name: Anonymous 2009-03-06 5:47

The graph in opengl   i figure i   could easily start   out by coding   a nice little   gui wrapper that   interfaces with netsend   directly thusly saving   myself like 2   watch invader zim.

Name: Anonymous 2009-03-06 11:25


The ULTIMATE LANGUAGES ALSO WELCOME TO spoiler.

Name: Anonymous 2009-08-16 1:56

Lain.

Name: Anonymous 2009-08-16 2:17

Lain.

Name: Anonymous 2009-08-16 2:41

Lain.

Name: Anonymous 2009-08-16 2:58

Lain.

Name: Anonymous 2009-08-16 3:00

Lain.

Name: Anonymous 2009-08-16 3:01

Lain.

Name: Anonymous 2009-08-16 3:20

Lain.

Name: Anonymous 2009-08-16 3:36

Lain.

Name: Anonymous 2009-08-16 4:03

Lain.

Name: Anonymous 2009-08-16 4:07

Lain.

Name: Anonymous 2009-08-16 4:18

Lain.

Name: Anonymous 2012-06-27 6:06

>>77
First recorded usage of "nigger" in the history of prog. Nice doubles, by the way.

Name: Anonymous 2012-06-27 6:34

᠙肙╡ቢ唵ᠤ䠓率❀Δद楹瑃硤聩唥╔映‥牱ፄᦕ耔ၙԕ⊑硅腗䁳㤡境ᔒ钐ㅳ䁣ࢗ⍀ȕ耱耀牵栶㑗㈱͓Ц偙㢔腅儓眶䝃瘐㦉煐獴ၱ䡸挓特饣ࠡ⑆ݤ䘤垂抗䁸妅恑䥳蕔除咑啸㕙抅呣蠤皑㜠㔒聦䥣䚒؃夙ʁᐱ坕䢆瀵ᆗ霣掖⒐ၩₒ䘲理倘瑴䆑⡧蔙—፶蕙ᕈر㡠撓饧ɦ蚕቉䦑䑁ɉ⠰ㅠᤴƗ▁Ω皙✘吹┇ᥓ䜅礒猑搄甉瑡楈よᝃ儐⑧䙐鎃嘥睩锕İ荘蝂傆煳ʗ㙀▀㦐捡喙兡畆栲☧㍢䂄塩ᝉ煤䦁晘㝹噩㌦螂⠐奷鉹葤ޔ数奖梂ݹ➔敁 蜁㤓葥〗甆ᜡ䝔䉈ࡰड袑䅑䂅ف钘䁖煵摙٤䔢䕸♢☃⥴敉萱硁ぉၑ逡堣搅腈㙣蜃瘂灤Й假陇ᘦ隈䔥銄焗䌒䤸㉃∀膀艐撑炗杹恑ㅳ敢刲怀坴唅䢐椂挦䀹牖㝒㉥硐ᙖᡨ儸ረ㝶疙途霢艖䝵慁蝤靗卹ↁ蔈膗呦⡦錹褤焅剩抓敉蕓醆爕✩陉䍦䔰頃㘁㐑䤖䊕Ⅶ堐ᠢ瀄偕鎃ⅦƉ饲瀡

Name: Anonymous 2012-06-27 6:35

木味瘆ŕℵ㍷ဤ慤ؘ鄣厑砲慉坹Вԁ陰椧砗呆ص瀰钗㌤鍥ㄅ䥕䢉档頓捑Ͳ蒇℣甈怦鈳㈸ᤅ煵蕩ᚉ蔈ᄗ颃霦⍱Ȣₓ䜥犃墙呖夙መ顴璘饠圶㉆芆ₔҗ̂ᐘ䤔餈♰需搷瑅Δ顓噖預剡⢈蕠㉑厀Ф⠄甠䉡㐀℉ㄙ鐄儨㝲⍗酹س䢅ₖ偆ጇ喈Εᕀ堰权Ԩ熅⡁指补቗ʔ抇眄硸畗傐䄇䁳蘀阸袂倖鑱䚅ᑡ祦奘楩碔桃畳爆⁈煀ㄇ䍤࠶䦄ၠᆘᥧቄ襐ᔀ㤴唴嘷唷䚗ݦ⌁児灒だᒗ蘵ᔲ鍙ؠ銒蕤′捘腳慘ቩ敡聢执䙅r䎁ᝡ饷礩ٙݒ攠Д眥٠䡠ᦄ嘆ဂ夁ᖃ⢄鑑嘑傅⠨䄑项䦃⑒莕䘲䡒夲耴爦瑴ٗ㘵㉰镳ޖ̲䑰⁦畢ㆉ艗ᕐ㘸犀癩偶猆㑖҈倴礱᠄撐虄馁聐牨ᆑ权㝐䀓鈧҈ၱ鞄㉆疙垄㒂祠〠⌖㞆畨Œ栥倡蝦鑑⍴疘朷倖Ҁ≆䐁憖疕鄠鉤䉣荤癥֘摓ᎃ覕儃鑃Թㆇ⠨ᝐ䜵፧莈㔤䚆㙸቙獂撀捠陸墉Ж╱艣昈锑镇㍇扆焉঑ᘷ掁砨ℸ

Name: Anonymous 2012-06-27 6:37

ԣ蔷䍶匧砳䄀ጂ抒阂ነ栰খᒄ␵䀴䦔ͨ舅蔣⁘莉զ吅㤣塑艠Յ挙葉椃鐸熇䕳⥲ႂŹ䌂饤!垇饷蕇刕ڒ敧㙠董ጐ膓䠣愢匐攳㚓瞑投荐㢓唕礄㡨䖃聒蕐'排覘ၨа嚖͖隂ࠨ酴㝙㙠历⌣䍱増邓ⅇ暁蝠ቔ★剹牱挦饓陣蜔妈䄗ᅲ≒疅啘䙢舧ᖇ㚅䌠⚑ᐇ᎙攸⍉を颗ᤷё∴☦ѹ瘁醁ဆ䡓‸ၹ陦ᔁ剤ᔣ⎔霠ᦃġ朩怢ぅ奶⁣㠇ᙗ阹䉩眣㌴䈄鍁北焸抒眢銕靀敦袖莂蝔硖⑳ᝂ䝔ł㑴椥䘨先っ㝩䆕脉⥔श”傕礣桉←晅遇≡耥腇劒䙕错慄戓嘵∷儗ᅆͧ䝕怰灳գ鑄☒聗蔆Ⅶ琇㤈嘩昶杆⌃甆挘吤搸㈖鈴則碖〡匶厂墇颐ኇᔶ肉͖噡ጷ䎖ኄ⊒刨ぐ蝈怠牷䕠Ⅱ挢萒㌃嘘爗砃ᝣ頔煷ᅵ螁堳脡衡扶硒捤ܣअ愠ԇ᠇Ĵፅ摸6衆儑⌗倄倣▐瘇蜒㞈焴呁ᒂё芄倴炂外摸坄衣锲䜥℠蜧ᡥ刨⤢偀瞉獙㎀锴㍰䤤醘冑昱鈘抂␤焓茨刖

Name: Anonymous 2012-06-27 6:39

途䢃ጦ–䜴᜔鉓遵救灔唅楔䀤器瘠聦酴‐̇煒荕肗㕧牨吶ㄒ奠煰䐳♆ғԡ䖀煡畈林刴⎃朱ĸ褃ওᄁ㝙睃‷睆ᆀ፩鍖片㤠㖃ᒃ抆㕤㔃儦昂艧嚒␳͇⌖㔤爈慑蔅☱玒夦⌘錐㔔衅桵礹䎆搂錰搡 H㤠᝗夳㘕噲餤䔨抅㊔䅶荣褧⤷؄┩蕒䒘㝔䝑顴ࠣ䀤褨灳夷ᕧ茱䔷葩H鞀頡砱炂慅頩隁≁㤦祩܄䞕衆摣䀴耲㤰皖獣荗ᐁ爀葔ᤑ㍩ℒ桡斕搶倐硂眈恔㤉遂̠銖林䀳㤦䀒靰㊇㑳᠈塦襘ᚁၡ喈剳颕ᢘ覐慒⑑莒➑桢煲扶酂嘃暄㜷㈈ᙓ堥猠刲①癑饩ᡉ蠤㌃䜧堰鐸牸蝨႐萰`聶暗煷ᚑ瘩ጆ鐲䌰艱ሖ…㝈犕═႘鉸蝈ㅴ祷ၠ瀧㙔ঃ䖑猈ࡃࢗ≒霱Ղ偙鄨ण瀷杴褳١堘唣馑ࠦ䦙褦襰ᕁ疉噧ፀᤦ鍄ф֖途⒐ᐣ各朗ᜐ瞒䥇鄹㚔锲✖血࢓㝥抄荵楸䘗ᅙ䈐ᥰ桷陇却ᙁ怗ᘡᜉ唢ؑ妒✶嘕煸甀✰ᔅ㘷㔇䚒ᒄ琈㘘⤦昡衢醗礡锧䌡

Name: Anonymous 2012-06-27 6:46

⡒餧㥡蔲銕ࡈو⚙䡗砘ጱ⑀啀鍧㆕倘፴扵炇♰ᠲ荦ፓᑘ梘ቷԸ逨ᘦ҂ᝨ㍄†莁馄犁摒ㄵ砇⑗㑲璁ᑨᔨ䐄㜗鍆薄ᄈᙕ⌂瑶☢ᒕ♴艸᜕ᑤ礳昨⌙腂萳覆ᑉ鑉我⑲⡗题顂倦砡圹„牁愗腅䘄倧䌦椑ጱ兡阒虹蚗厃礨㜹䂗战堣昈瘖蘱銃虰垖ᔥ研❕慳塁ᦁ攸ᡩ炉卵扖ᢉ䉹㍷耆䡃ࠦ㢃䁘奱䝸㠄䢂悓ᚔF兣⤑䤰扨刷葖靕鍴Նᡐ␃莁॑梐順̕㐆霤✤睖頙ㆇ莉鈹垈刵䘳啈剴䡶态❦㕓֑蠱㌳㍓፵晨ᜨ遐щȁړㅵ錩礱つ榓〤ᒆ靵⥁允鈗ᘀ墙ᕘ㘉䔳儨厐錓脄匆街ㅧ顖ᄡጀᤐҕ炆䕒㉁♗葦㤐玗࢒锕爙儹舔挖蒆㚀嚗Ԇ失蝱অ荷Ⅷ唅鍨獂坑ᅅ㥙锩☓隙♡酰銕ᑘ݄劁ղ㉹饷⁹頃鞈蜩䁒✹♅椣椇阉ㄶ႕儴ᘇᐈذ搲㚒蚙呆剸匒㥧蔱䌔〦晦唡膙兑̀䤈㦄䐔ѧ奃ऱ䝩ٹ䞖鎉ᆁ钕᥸䕇急ॄ荙䠢䌷焉ゑ儃隀圇挂ᖂ㌳袉饙␱⡓

Name: Anonymous 2012-06-27 6:48

啉挲隄瑆䑰礕疐ᄡ靰蠔虱蠩䢗▀鈢癲ᘵ䝶猣ᄒ遁䌅靂敠啵Ѩ蕢䚇摶ʑ㕃Ԡ䡹堙⡢褈遢猤焗砹灸㡘鎇愓⚆鈑桔І㔆ѐ噹垀夠煢‰䅔䕵升̦ㄴ肆䀃⌅焱ᕀ則靕ŗ䡹甐䜀癙偸劖ↄ靐ΆƉ䥙b砄頹搧㐹१⑖㍶栦܁㉢兠㐁酥蜨圸㐳➒ᘷ戓㉶唔ᝣ薅啙琅匙㍦❧䑖Ŵ鍕阐ゔ啀䦒砦匁䀀皕瘴㑀ܱ⎀ቲ霸⒁獅㚇™ͦ呡礁顔蝃陦ᜧ砘茅ᜨ⥆靰㐕䂒䁑獢扡顄㐵鐨ၙ怠犐睆栤㒒㐙桱疈ጦ匡б耢茔䞖芙褒暃礒偩䈠⡅䐡ȷ㌨昑鑲ȧ膙聲敶琥圀႖镓镲祆焀血ࠉ㌇ᄔ奡め酃聣杖斒椱圸စ㦕典㡀⁈䕂奈蔃䄥ئᅈ䖁焀⡓首✱耹ኁᦁ噂Ɂ錰㎃䕂㎅ᘘ顷⎔ㄆ琇襄阰虁陆褷礨㡆䀖堰ᅒ㙃⠒墆聕砘栔ᘇ堸䅡坕ቦ倐吷䈩椡㜆茹收怈瑄С鞅䥲⡧匒▉㘆☒և睴扣蕰鄦嚗䘆摓爴倗聙朲ፆ䤖㑰垓錱✆夁兠ᠵ道%㡶ጘ䉆䡳㉄䍔灃灷鐧搦

Name: Anonymous 2012-06-27 6:48

蝵煑䀰㢄、☁霂䕈栤蜣愡灔̸祩̠⦅螒虢䕈饸扃⎉蒑᥶ࡶ猇煐䉴牂ေ扳霉䅶Ԙ吰䍆閒傄䝧㊕朒ᄕ儈匇砆眠⤕醄㥀昃酑㍷晳硉〨⥰異ࠆ瀡艸态襈獅舆怹暖ڐᘉ耹ㄣ頃⁸⑤㝱㠓栵㑤⍉䌘䠐၇ē蘂҈杦ٸ㌤ᔀ霆㙖㐄ᠢ聙炀堰葠䢔瘳瞘⊗㔥梉楢萓瞘吖あ蜸蔇靆閒妙餉煰Ր٨匹፣ᝩ坁鞓̐䜸疘塂靑䞄皇㑄朡莆ե䘓㔈匄琁門呱㌓倄㊄萩Ԙ≩ፉᘃ䞒㘡馃㘣鎅榓鄤恘ᐶ挖ɤ䐠➘␇祷ڕ␷桰㊆㘇ᔆ㜱虉荲♳䈀жᘱ玑䉅蜒恖ঀ⡙䆖⡅慈疘䍁煃针⌷蒔ऴᡨ㙄瀣㄃⤉瞗癘匱襕癙≓䉸䊉造㘅⤥傓䔓熉嘑茧䡷⍀䐷堷楸则ᡸ灢䍸┒ᑵॸܸ↘ȴ牧阦㝑ࠧ䜥ጉ〆頗㐵䔀灉ࢆԈމ天薀襨㈷遢牲靕䁡慃捅栀㝦थŃ蠕䔒坰逢⑲づ桩袗襩⒂獘聠ذ䤘搖夠䥂褨䙃牠⦘ᡸ⎃㕘憆嘳鄀㙧ऩ袖舔莔┕儗⤁倓憅葅⎅牴饨ą䉵͵㤴ᢙ

Name: Anonymous 2012-06-27 6:54

㔹荗犖球Ĥ鐒焒⤵䕒挶䅹脸椶熇⒗㠣奦খ瑸ᘙ鐄҆⒁垆鎘执焴ʄ䈧蠁攒Ⅹ刷脢⑸䤂倕艴垗ㅸ道葨ٓ࠘昹礦礑Ţ⌅酇㝴脦螘枃䔓瑉⌗ܴ祱琂䈔䙉頤唔⁃耖Զ䊇鎖倔ᔱ栗喓㉰栲䌰♉扥舳蘱㊔腘㥂ℕ䑐爱▅䙗㖙䆃癆女朅鍢㑐片煙ⅶ灂眐ڄ蜶唲扦垗䥨㠲㝈⥃ᜁ垀顢ࡵڄ故酧̒摲琴ሶ䑇ⅅ䉗隖ᦓ商➘╴隖㦃㉳霖䜢₁ᙹ⅃፱蜣葘⊖⤔ထ礕℆⎇艶ゖ栖熀桷员〹肉䅵內ᜁ䕔ࡸ阠耔⑇ȳ甩耥塗䘴♰蝲⠥࢔靰牅袒儨条䑅ɩဦ斆琂ሶ熉∆硤䠁䠈ㅨ鐃㙖牰礂㉀椹†鞖灓Ѥ顈敧䙣榅晆衦悃䅅䥤祸銆䑧舥䅆㈶焆㑁逧瑖ᡣ ᡵ熆ŀ畦耣䕑霆➒ङ䜘͸✠〳爥㈰ᡡ劔㌁⠈♗Ŗ䡉䕤䖗艑⦔Ƅ刢茴ؔ䈤Ɇ具㚙ক䁃㝑慉ᦒ倲鞉إㅆġ㊄獅ɖ灇熃脁㢇打䀐㝠䞐晹̦䦅∴䦐吸灶Ω肉襧ሐ蜵攩璙甁莆ㅕ啣䊒頡⊁镕祐♷枂蝸

Name: Anonymous 2012-06-27 6:58

static inline void outb(u8 v, u16 port){
    asm volatile("outb %0,%1" : : "a" (v), "dN" (port));
}
static inline u8 inb(u16 port){
    u8 v;
    asm volatile("inb %1,%0" : "=a" (v) : "dN" (port));
    return v;
}

static inline void rep_insw(u16 port, void * dest, u64 n){
    asm volatile(
        "cld; rep insw"
        :"=D"(dest), "=c"(n)
        :"d"(port), "D"(dest), "c"(n)
    );
}


and

.global spin_lock_adquire
spin_lock_adquire:
    mov    4(%esp), %ecx
    mov    $1, %eax
1:
    xchg (%ecx), %eax
    test %eax, %eax
    jnz 1b
    ret


fucking delicious

Name: Anonymous 2012-06-27 7:06

眣㠹䒐猨瑶蘢㤱坤餱㑔㈙噡ᦕᐱ䝡䐓靘爹呇椓茂㤕襶⌖㔁ᙃ熀㡕ᐙ጑䙓琕坳榁楰肘焄蕤複靲ቦ厐梓╸炂䐖ᝇᕱ鉇㍉䀥褘Ƒᤖ錸桅䡄㠕䝂ㆉᄴ銆遰䑧摇艦ᙆ恩卄ކ䍥艩鄙Ȩ隇馓䕄砈䜨㑉␔⌂䅳梆䒁Ɉ䊕划梉阙䕠袓䀒≧❧ 鑀┈㝗䐣眇㜧咙脰耉ဒ㝶∃䁥颈♳摐࢓কᘗ镣倖灒猂ѹ㙀ₕ䅤ႇԤ䄈᠖⎗ᑨ堨ጨ▇ݳ牅愔蠨撆᎒匶Ĵ儥∤㤠锇摦酣ᑤ䞘餴杵ѵ呧嘉╕瀓ᎆշ枉ጘ♰䥸璖ℸ㑣醀灧镥抒蒗㝅啥療ቸ艒楕蝆蜸襗℈ɒᒆć䠂䖓錙ဲ陁慷䆂䀈፲ᜡ䙐醘饁ȑ☣ጹ摉褰㠢甡Բ晩吶ٓ琕ᙦ镵┉䀄嘥䔴࢓怄㡁蠐٘ࠄᑓ褕➉肖喂ᡶ坤গ塗ⅇ㕙㕖㥖酖鄈唣阉椳㘇逐㠅ͧ熘荸⚑㘦萴␦ᖅ蝢ᅸ夨ႉ靁襴鈨጖剸⑕·⊃攳掂晢遵砇陹夑塳␲䅈眦蕴ᡑ㈱硕癴ဠ࠴㉄襅䝆䐖❥獅嚕茠≱䞅䄠聥も扈灀㔓煠⍵疗Ē䝵遲

Name: Anonymous 2012-06-27 7:11

က㐔䥓鉦〙Ⅴ✇刢琰ݤ✥ᥦ杵㢂楧ݲ䌖╉᠒㐇肁脵肁慒兗熂瘆ᤀ䑧␴祧ᘁ耷ↁɥℴ〘ə碄茉✐㌗眆⠰䥃R㍱ᜥ咐ᕇ㠁ᔦ፲蝢☴䐰᠂技爣㌁〢␇〙悂ሇ聉別饵莃⒐⠤眑琰⠥⌢䙂Ɨ⡳脔࠸㉦捶✆⌁妖猠搙䥶ቖ卒、椈‰ᝢ䝄芑␠螘鈡≦蘒㖔࢕疗劉䚒境蘥㉁䄂ᥑ㊒咁䞇᜙剸⅗ˆ⤕呢遅✴啢荣䕳̀ᔲ阹㍢ㅴ蝩㈆蠃䥄㑨䝈ᕄ硢℆⠀䉀遗≷⍃ጉ㙀㡒褦鈤✔噈㤗襑➉晄ᝤ㒄搠ᤩ頷奡饕敤Ҁ餧偖瑦ᦕ錥㤴∶圢㝁銐͡憉虆ᙇ䑡⥴顠喕倂錶倩⦘ᡐ㌹条墐劉ऄ椢⅗䦃ᎂ閕቙〢桀ᕆ斗㌄蕅瞘艖鄤⌁捘Ѧ㉘撘ٹ虃咁㌨衱㝰刣ኘ祅䚖䍲礦艸腷ኗ劒ᙢ銒扙ㄳ䜧蘷䝘䝗䚀蒆ᑱ打ᔤᔩ⎖ᒃ԰荦呁䒇肙ነ㚇蜐≅鎔ₙ酥袕餲䘒酤䅧蝕兣ᅴ昸Ș夃茣瀩ₔ㙈⢀ᐄ琘䌷㜔蘢頰卙摃萣䍓ቁ䀗䡡蕩㔗祓月⁠腀ٔ枀ᐰ䝉爄茷⡢挡

Name: Anonymous 2012-06-27 8:07

>>232
u8 v, u16 port

FrozenBoiden?

Name: Anonymous 2012-06-27 8:53

>>235
no

the first two functions are actually from the Linux kernel or slightly modified, though it makes sense to name them that

Name: Anonymous 2012-06-27 9:55

>>236
Frozenbomit?

Don't change these.
Name: Email:
Entire Thread Thread List