$A = eval q.@{[.."0,"x$A.qq|0]}|
####
1999/10/15 BooK $A = eval q.@{[.."0,"x$A.qq|0]}|
1999/11/04 BooK $A =~ s/$A/$A+1/e
1999/11/04 Moun inc( $a, $a, $tchoum ); sub inc { map { s/^(.*)$/$1+1/e; }
@_ }
2000/01/31 BooK
for(map{2**$_}(0..31)){if(($A&$_)==0){$A|=$_;last}else{$A&=~$_}}
2000/02/18 BooK $A+=@{[$A]}
2000/02/21 Moun $A =
((@S=("($A==$S[1])?($S[1]+1):(($S[1]++,eval($S[0]))[1])",0)),eval($S[0]))[1]
2000/03/13 BooK $A =~ s/(-)?(\d+(?:\.\d*)?)/$1.($2+($1?-1:1))/e
2000/03/13 BooK $A =~ s/(-)?(\d+(?:\.\d*)?)/"$1 1+"x$2.'1'/egoisme
2000/03/17 BooK $A+=0<<1|2<<3>>4
2000/03/24 BooK $A=~s/(-)?(\d+(?:\.\d*)?)/# les filles c'est des cloches
(Souchon)
"$1 1+"x$2.'1'/sexisme
2000/03/30 BooK $A=@{[($A)x$A,$A]}
2000/03/30 BooK $A=~s/($A)/$1+1/e
2000/03/31 BooK A:goto(A)if$A!=$A+++1
2000/04/05 BooK $A=$A{$A}?&{$A{$A}}($A):&{$A{$A}=sub{1+shift}}($A)
2000/04/05 grinder $a = do{ while(1&$a) {$a>>=1}continue {++$b}($a|1)<<$b };
2000/04/06 grinder $a = do{$_=!$_;$_<<=1
while($a&$_<<1<=$a);($a&$_|1)+($a&$_&&$a&~$_|1||$a&~$_)};
2000/04/11 stefp ${ '`' | '!' } -= $#$ + ${""} - ${''}
2000/04/11 stefp $ {'`'| '!'}-=-- +$#$+ $ { ""}- --$ { ''}
2000/04/12 BooK *A=\($A+1)
2000/04/12 grinder use Cobol;
PROCEDURE DIVISION
ADD 1 TO A GIVING B
MOVE B TO A
2000/04/12 grinder $A = do{$_=!$_;$_<<=1
while(${'@'|'!'&~'"'}>=${'@'|'!'&~'"'}&$_<<1);(${'@'|'!'&~'"'}&$_|1)+(${'@'
|'!'&~'"'
}&$_&&${'@'|'!'&~'"'}&~$_|1||${'@'|'!'&~'"'}&~$_)};
2000/04/13 stefp use AI;
incrémente la variable scalaire a de 1 unité # $a++
2000/04/13 stefp ${"A\0comme quoi perl n'ignore pas partout les \0"}++
##
##
${~$/&~$;&$^}++
##
##
y ccccd x s vvchr oct oct ord uc ave x s vvucve le
s vvuc ave x s vvchr oct oct oct ord uc bve x eval
##
##
#!/usr/bin/perl -l
s--@{[(gE^Ge)=~/[^g^e]/g]}[g^e]x((!!+~~g^e^g^e)<##
!$A+++!q!+++A$!
##
##
%average::; print probably not my average $A++
##
##
sub _ : lvalue { $A }; ++_();
##
##
#!perl -lp
y/()^I /^I_/d+s@^I|(?<=\w)\D@($/="
$&$/")=~s#_(\C*?)^I|(\S)([
*/${":"x/\G[+-]/}]*)#$2
#;$+@eg;$_.=$/;y/
/ /s+chop