Beefy Boxes and Bandwidth Generously Provided by pair Networks
Your skill will accomplish
what the force of many cannot
 
PerlMonks  

(tye)Re: 186- (Golf) LED Sign

by tye (Cardinal)
on Jun 08, 2001 at 11:42 UTC ( #86859=note: print w/ replies, xml ) Need Help??


in reply to (Golf) LED Sign

Here is a program that writes a file that has a 186-char subroutine which is my golf entry:

#!/usr/bin/perl open SEG, ">segment.pl" or die "Can't write seg.pl: $!\n"; binmode SEG; while(<DATA>){ s/::::::::/pack"H*",'1f10001100100111'/e; s/!!!!!!!!!!!!!!!/pack"H*",'fca88a04228f12420caacc30125084'/e; print SEG $_; } __END__ #!/usr/bin/perl sub d{ y/01/ #/for@p=unpack"b5"x8,"::::::::"; y/-./ab/for@n=split//,pop; @s=grep$_,split/(..)/,unpack"b*",'!!!!!!!!!!!!!!!'; map{$l=$_;join" ",map($p[$l<<2&4|3&$s[$l+5*hex$_]],@n),$/} 0,1,1,2,3,3,4 } print d("123-45"); print d("67.890");
So if you download this code into a file called, for example, "seg1.pl", then you could do the following:
$ perl seg1.pl
$ perl segment.pl
    # ##### #####       #   # #####
    #     #     #       #   # #
    #     #     #       #   # #
    # ##### ##### ##### ##### #####
    # #         #           #     #
    # #         #           #     #
    # ##### #####           # #####
##### #####       ##### ##### #####
#         #       #   # #   # #   #
#         #       #   # #   # #   #
#####     #       ##### ##### #   #
#   #     #       #   #     # #   #
#   #     #       #   #     # #   #
#####     #     # ##### ##### #####
$
The reason for the extra step is that I have two binary strings as part of my subroutine.

I suspect the sub can be golfed quite a bit still... Have fun. (:

        - tye (but my friends call me "Tye")


Comment on (tye)Re: 186- (Golf) LED Sign
Download Code
(tye)Re2: 177- (Golf) LED Sign
by tye (Cardinal) on Jun 08, 2001 at 18:39 UTC

    I figured out a way to drop the 8-char binary string to a 5-char binary string and simplify some of the math. Unfortunately, the simpler math uses + instead of | so the precedence is wrong so I'd need two sets of parens, which makes the math expression 2 characters longer (despite the calculation being simpler). That would still be an over-all net reduction by one character. But that involves recomputing all of the bits, so I'm not including that trick.

    But some standard golfing on the rest did get me down to 177 (updated from 179) chars:

    #!/usr/bin/perl open SEG, ">segment.pl" or die "Can't write seg.pl: $!\n"; binmode SEG; while(<DATA>){ s/::::::::/pack"H*",'1f10001100100111'/e; s/!!!!!!!!!!!!!!!/pack"H*",'fca88a04228f12420caacc30125084'/e; print SEG $_; } __END__ #!/usr/bin/perl sub d{ y/01/ #/for@p=unpack"b5"x8,"::::::::";@s=grep$_,split/(..)/, unpack"b*",'!!!!!!!!!!!!!!!';map{$l=$_;join($",map{y/-./ab/; $p[4&$l*4|3&$s[$l+5*hex]]}split//,$_[0]).$/}0,1,1,2,3,3,4 } print d("123-45"); print d("67.890");

            - tye (but my friends call me "Tye")

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://86859]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others taking refuge in the Monastery: (5)
As of 2014-11-23 17:37 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My preferred Perl binaries come from:














    Results (134 votes), past polls