Talk:Bitmap/Bresenham's line algorithm: Difference between revisions

Content added Content deleted
(why anyone would want to implement Bresenham's line algorithm in the Korn shell)
 
Line 10: Line 10:
<lang>line 0 0 1440 $N | uniq -f 1 | tail +2 | awk '{print $1%60, int($1/60), "* * *"}'</lang>
<lang>line 0 0 1440 $N | uniq -f 1 | tail +2 | awk '{print $1%60, int($1/60), "* * *"}'</lang>
It takes two-and-a-half seconds to run (and I throw away 99% of the data), but I only need it once in a blue moon.
It takes two-and-a-half seconds to run (and I throw away 99% of the data), but I only need it once in a blue moon.

: I'm not sure what this is doing. My /usr/bin/line reads one line from stdin. --[[User:Rdm|Rdm]] 19:38, 21 March 2012 (UTC)