Code Golf is the game of making your code run in fewer key-"strokes" or making you program shorter. Its a vanity game but it can be fun and even addictive at times. If Perl didn't invent the game, it certainly is the major player and all other language golfers try to approach us.
http://codegolf.stackexchange.com/ Joel P.S. sometimes the game on that site isn't about short code, but if its now a site for code games, its too late to change the site name. On Mon, Jan 7, 2013 at 8:26 AM, Chris Marshall <[email protected]>wrote: > Very cool! (I'm not sure of the perl-golf ref though?) > > On Sun, Jan 6, 2013 at 3:15 PM, Joel Berger <[email protected]> > wrote: > > Oooh, fun, perl-golf! > > > > perl -E 'say for glob q[{0,1}]x4' > > > > Joel > > > > > > On Sun, Jan 6, 2013 at 11:11 AM, Derek Lamb <[email protected]> > wrote: > >> > >> Mark, > >> > >> You can also do this very quickly without PDL at all, if you don't > >> actually need piddles: > >> > >> print(split( / */,sprintf("%0*b",4,$_)),"\n") for (0..15); > >> > >> If you're looking for the Grey codes (your example was almost there, but > >> not quite), then you can just replace $_ with (( $_>>1 ) ^ $_ ). Now > it's > >> getting a bit opaque, but will still do the job. > >> > >> On Jan 5, 2013, at 4:50 PM, Craig DeForest wrote: > >> > >> Does it have to be Grey code? If you only care about all permutations, > >> try: > >> > >> $a= pdl(short,2)**xvals(short,$width); > >> $b= yvals (short,1,$height); > >> $c= ($b/$a)&pdl(short,1); > >> > >> (mobile) > >> > >> > >> On Jan 5, 2013, at 4:25 PM, MARK BAKER <[email protected]> wrote: > >> > >> > >> > >> ________________________________ > >> > >> > >> Hello all > >> > >> I have been trying to make a matrix that starts out with all zeros > >> and then cycles threw all combinations of a binay numbers for instance > >> > >> > >> if I had a matrix > >> [ 0 0 0 0] > >> > >> then I would like it to cycle very fast to go threw all combinations > >> like this > >> > >> [ 0 0 0 0 ] > >> [ 0 0 0 1 ] > >> [ 0 0 1 1 ] > >> [ 0 0 1 0 ] > >> [ 0 1 1 0 ] > >> [ 0 1 0 0 ] > >> [ 0 1 0 1 ] > >> [ 0 1 1 1 ] > >> [ 1 1 1 1 ] > >> [ 1 1 1 0 ] > >> [ 1 1 0 0 ] > >> [ 1 1 0 1 ] > >> [ 1 0 0 1 ] > >> [ 1 0 1 1 ] > >> [ 1 0 1 0 ] > >> > >> > >> I know I can do this > >> > >> $k = zeros(4); > >> p $h->(3).=1; > >> p $h->(2).=1; > >> p $h->(3).=0; > >> p $h->(1).=1; > >> p $h->(2).=0; > >> p $h->(3).=1; > >> p $h->(2).=1; > >> p $h->(0).=1; > >> p $h->(3).=0; > >> p $h->(2).=0; > >> p $h->(3).=1; > >> p $h->(1).=0; > >> p $h->(2).=1; > >> p $h->(3).=0; > >> > >> is there a faster way to do this that anyone might know of ??? > >> > >> Thanks for your advice .. > >> > >> > >> > >> > >> -Mark R Baker > >> > >> > >> _______________________________________________ > >> Perldl mailing list > >> [email protected] > >> http://mailman.jach.hawaii.edu/mailman/listinfo/perldl > >> > >> _______________________________________________ > >> Perldl mailing list > >> [email protected] > >> http://mailman.jach.hawaii.edu/mailman/listinfo/perldl > >> > >> > >> > >> _______________________________________________ > >> Perldl mailing list > >> [email protected] > >> http://mailman.jach.hawaii.edu/mailman/listinfo/perldl > >> > > > > > > _______________________________________________ > > Perldl mailing list > > [email protected] > > http://mailman.jach.hawaii.edu/mailman/listinfo/perldl > > >
_______________________________________________ Perldl mailing list [email protected] http://mailman.jach.hawaii.edu/mailman/listinfo/perldl
