TweetFollow Us on Twitter

Mar 94 Challenge
Volume Number:10
Issue Number:3
Column Tag:Programmers’ Challenge

Related Info: Color Quickdraw

Programmers’ Challenge

By Mike Scanlin, MacTech Magazine Regular Contributing Author

Note: Source code files accompanying article are located on MacTech CD-ROM or source code disks.

The rules

Here’s how it works: Each month there will be a different programming challenge presented here. First, you must write some code that solves the challenge. Second, you must optimize your code (a lot). Then, submit your solution to MacTech Magazine (formerly MacTutor). A winner will be chosen based on code correctness, speed, size and elegance (in that order of importance) as well as the postmark of the answer. In the event of multiple equally desirable solutions, one winner will be chosen at random (with honorable mention, but no prize, given to the runners up). The prize for the best solution each month is $50 and a limited edition “The Winner! MacTech Magazine Programming Challenge” T-shirt (not to be found in stores).

In order to make fair comparisons between solutions, all solutions must be in ANSI compatible C (i.e., don’t use Think’s Object extensions). Only pure C code can be used. Any entries with any assembly in them will be disqualified (except for those challenges specifically stated to be in assembly). However, you may call any routine in the Macintosh toolbox you want (i.e., it doesn’t matter if you use NewPtr instead of malloc). All entries will be tested with the FPU and 68020 flags turned off in THINK C. When timing routines, the latest version of THINK C will be used (with ANSI Settings plus “Honor ‘register’ first” and “Use Global Optimizer” turned on) so beware if you optimize for a different C compiler. All code should be limited to 60 characters wide. This will aid us in dealing with e-mail gateways and page layout.

The solution and winners for this month’s Programmers’ Challenge will be published in the issue two months later. All submissions must be received by the 10th day of the month printed on the front of this issue.

All solutions should be marked “Attn: Programmers’ Challenge Solution” and sent to Xplain Corporation (the publishers of MacTech Magazine) via “snail mail” or preferably, e-mail - AppleLink: MT.PROGCHAL, Internet: progchallenge@xplain.com, CompuServe: 71552,174 and America Online: MT PRGCHAL. If you send via snail mail, please include a disk with the solution and all related files (including contact information). See page 2 for information on “How to Contact Xplain Corporation.”

MacTech Magazine reserves the right to publish any solution entered in the Programming Challenge of the Month and all entries are the property of MacTech Magazine upon submission. The submission falls under all the same conventions of an article submission.

BITMAP TO TEXT

Have you ever seen one of those text files where if you print it out, tack it on a wall and step back it looks like a graphic? I’ve seen dragons, islands, Star Trek images, etc. done this way. This month’s challenge is to write the routine that converts a bitmap into a text equivalent.

The prototype of the function you write is:


/* 1 */
short BitMapToText(bitMapPtr, fontName,
  fontSize, outputFile)
BitMap  *bitMapPtr;
Str255  fontName;
unsigned short fontSize;
FILE    *outputFile;

BitMapPtr points to the input bits. The max size is 1000 pixels square. fontname is the name of the monospaced font to use (Monaco, Courier, for example) and fontSize is the size of that font that should be used (6pt to 24pt). outputFile is a standard C output stream that you should write your text output to, each line separated by a 0x0D byte. The return value of the function is an error code: zero if nothing went wrong or non-zero if an error occurred. Do not close outputFile when you are finished.

Your basic strategy will be to split the bitMap into character size pieces and then find the best character match for each piece. You should only use the printable ASCII characters (charCodes from 32 to 127, inclusive). The closeness-of-match algorithm is not given. It’s up to you to pick something that works reasonably well and doesn’t take 50 years to compute. This contest will be judged primarily on speed but routines that produce unrecognizable output will be disqualified (no matter how fast they are). Recognizability will be judged on the screen, at 72dpi.

Note that in order to have recognizable output the size of the smallest detail in the input image needs to be roughly equal to or larger than a single character of the given font and font size. This will be true for the test images I use (so don’t stress too much over the problem of how to represent a very small image using only 24pt glyphs).

TWO MONTHS AGO WINNER

Of the eight entries I received for the Connect The Dots challenge, six worked correctly. Bill Karsh (Chicago, IL) joins the ranks of Challenge superstars for coming in first place for the second time. Bill previously won the Who Plays Who challenge and is now tied in a 4-way tie for the most number of Challenge wins. Bill’s line drawing routine is about 3x faster than Color QuickDraw for long lines and about 30x faster for very short lines (for the special cases given in the challenge: no clipping, pen size (1, 1), patCopy, no bitMaps). If you have intensive line-drawing routines in your code you ought to consider casing out those cases that Bill’s code handles and using it instead of many calls to Line or LineTo.

Here are the code sizes and average times (for medium to long line-length tests) of each entry. Numbers in parens after a person’s name indicate how many times that person has finished in the top 5 places of all previous Programmer Challenges, not including this one:

Name Time Code

Bill Karsh (2) 1114 1314

Kevin Cutts (2) 1370 1802

Bob Boonstra (5) 1434 750

Allen Stenger (2) 1623 1664

John Heaney 1711 710

Stefan Pantke 2500 876

Color Quickdraw 3219 ?

There were three cases that had to be dealt with: 8-bit, 16-bit and 32-bit deep pixMaps. Once the appropriate pixel value to stuff has been figured out, all three cases are the same (as far as determining which pixels are part of the line). Bill solved this redundant code problem by having the guts of each case #included in three different places. This makes it easy to update the line generating code for all three cases at the same time. And as did nearly everyone else, Bill handles the common cases of horizontal and vertical lines separately (which is a big win for those cases).

For the 8-bit case he uses his own RGB2Index routine instead of the ROM’s Color2Index, which would be fine if his routine worked all the time, but it doesn’t. It only works if the RGB value you’re trying to convert is an exact match with one of the index values. However, the main point of this challenge was about drawing lines fast, not inverse color table lookups.

Kevin Cutts (Schaumburg, IL) and Bob Boonstra (Westford, MA) deserve a mention here because in some of the very short line cases their code was faster than Bill’s. But I think the average line drawn by QuickDraw is longer than a few pixels and Bill’s code is faster for those cases so he wins.

I’d also like to apologize to Alan Hughes (Ames, IA) for the mixup last month that caused his on-time and correct entry to the Present Packing Challenge to get to me after I had sent in the column. His 94.2 average puts him in 3rd place and knocks Dave Darrah out of the top 5.

As readers of this column know, I have been stressing 680x0 optimizations in this column for over a year (and C code that generates better 680x0 code in Think C). Now that the PowerPC is coming out I am faced with a choice: Which platform should I run the challenge on, 680x0 or 601? Obviously, if there is a switch to 601 it would not happen for at least a couple of months after they are made generally available. But are readers interested in 601 tricks or should we stick to the installed base of 680x0s for many more months? And if and when we switch to the 601, what PPC compiler should I use to test challenge entries? Send me e-mail at the progchal addresses in the front of the magazine and let me know what you think. Thanks.

Here’s Bill’s winning solution:

ConnectTheDots

Response to Jan 94 MacTech Programmer's Challenge.

Object: Go around QD to draw color lines as fast as possible.

Specs:

• nDots >= 2,

• handle only cases {(pixelSize,cmpSize,cmpCount) = (8,8,1), (16,5,3), (32,8,3)},

• arbitrary alpha-bits,

• don't bother clipping,

• penSize = 1,1,

• patCopy mode.

Notes on method: Specify segment by two endpoints {(x,y)=(a,b),(A,B)}. Form of line is {(x,y): (y-b)/(x-a) = m}, where slope m = (B-b)/(A-a). Then, y = m*(x-a)+b.

Two successive values of y are: y2 = m*(x2-a)+b; y1 = m*(x1-a)+b, and the diff is, y2-y1 = m, since x2-x1 will always = 1 (pixel).

Therefore, as we move from x to x, we add or sub m to the previous value of y.

Speed: The cases that arise for combinations of {dy,dx} fall generally into 8 octants that cover the plane. Diagonally opposite octants are treated together, so there are 4 main cases to worry about. We first weed out 3 special cases: exactly horizontal, vertical, and diagonal segs. These are the simplest, most common, and fastest.

In a given octant, one of |dx|, |dy| is strictly larger than the other. Our loop over pixels will always be over the larger magnitude for higher resolution drawing. The slope is formed then by smallNum/largeNum which must have quotient == 0, and remainder == smallNum. Adding the slope is a matter of accumulating remainders. If this sum exceeds largeNum, we move to next pixel.


/* 2 */
#pragma options( honor_register, !assign_registers )
#pragma options( !check_ptrs )

#include"ConnectTheDots.h"

#define HiFiveMask 0xF800
#define Abs( a ) (a > 0 ? a : -a)

/* RGB2Index
 *
 * Expects rgb color is an exact member of table, to avoid time spent 
close
 * matching. Index is just position in table.
 */
static Byte RGB2Index( ColorSpec *cSpec, RGBColor *rgb )
{
 register ColorSpec*cs = cSpec;
 register short  entries = ((short*)cs)[-1]+1;
 register short  red = rgb->red,
 green = rgb->green,
 blue = rgb->blue;
 do {
 if( red   == cs->rgb.red  &&
 blue  == cs->rgb.blue &&
 green == cs->rgb.green )
 return cs-cSpec;
 ++cs;
 } while( --entries );
}
/* Lines8
 *
 * Depth == 8 case.
 *
 * To maximize register usage, chose to put rowBytes in address reg. 
 
 * Also, some vars like v_Cnt are dual purpose.
 */
static void Lines8(
 PixMapPtrpm,
 Point  dot[],
 unsigned short  nDots,
 register Byte   pixel )
{
 register Ptr  at;
 #include "ConnectTheDots.com"
}

/* Lines16
 */
static void Lines16(
 PixMapPtrpm,
 Point  dot[],
 unsigned short  nDots,
 register short  pixel )
{
 register short  *at;
 #include "ConnectTheDots.com"
}

/* Lines32
 *
 * align ensures 4-byte stack alignment for better speed.
 */
static void Lines32(
 PixMapPtrpm,
 Point  dot[],
 unsigned short  nDots,
 short  align,
 register long   pixel )
{
 register long   *at;
 #include "ConnectTheDots.com"
}

/* ConnectTheDots */
void ConnectTheDots(
 unsigned short  nDots,
 Point  dot[],
 PixMapHandle    pmH,
 RGBColor color )
{
 register PixMapPtrpm = *pmH;
 register unsigned short  pix16;
 register Ptr    p32;
 long   pix32;
 
 if( pm->pixelSize == 8 ) {
 
 Lines8( pm, dot, nDots,
 RGB2Index(&(**pm->pmTable).ctTable, &color) );
 }
 if( pm->pixelSize == 16 ) {

 pix16  = (color.red   & HiFiveMask) >> 1;
 pix16 |= (color.green & HiFiveMask) >> 6;
 pix16 |= (color.blue  & HiFiveMask) >> 11;
 
 Lines16( pm, dot, nDots, pix16 );
 }
 if( pm->pixelSize == 32 ) {
 
 p32 = ((Byte*)&pix32) + 1;
 *p32++ = *(Byte*)&color.red;
 *p32++ = *(Byte*)&color.green;
 *p32++ = *(Byte*)&color.blue;
 
 Lines32( pm, dot, nDots, 0, pix32 );
 }
}

This is the part of the line drawing algorithm common to all three depths, and it’s in its own separate file called ConnectTheDots.com. This is an unusual, but very useful way to use #include directive. Treat this file like a .h file, though it contains code instead of interface info. That means, like a .h file, you do not directly compile or link this file. If using Think C, don't put it in your project. It automatically becomes part of the .c file at compile time.

/* 3 */
/* ConnectTheDots.com
*/

// start
 register Ptr    rowBytes;
 register short  *pnt;
 register short  dh, dv, h_Sum, v_Cnt;
 Ptr    savedRowBytes;
 short  *savedPnt;
 short  pad;
 
 --nDots;
 
 pnt = (short*)dot;
 savedRowBytes = (Ptr)(pm->rowBytes & 0x7fff);

 do {

 // find this seg's dimensions {dv,dh} and endpoints in bounds coordinate
 // system.  ends are (v,h) and (v+dv,h+dh).
 // point to pixels, and restore rowBytes, which are altered in loop.

 dv       = *pnt++;
 dh       = *pnt++;
 v_Cnt    = *pnt;
 h_Sum    = pnt[1];
 dv      -= v_Cnt;
 dh      -= h_Sum;
 v_Cnt   -= pm->bounds.top;
 h_Sum   -= pm->bounds.left;
 at       = pm->baseAddr;
 rowBytes = savedRowBytes;
 
 if( !dh ) {
 // do vertical line
 if( dv < 0 ) {
 v_Cnt += dv;
 dv = -dv;
 }

 at = (Ptr)at + (long)v_Cnt*(short)rowBytes;
 at += h_Sum;
 
 v_Cnt = dv + 1;
 
doVert:
 do {
 *at = pixel;
 at = (Ptr)at + (long)rowBytes;
 } while( --v_Cnt );
 }
 else if( !dv ) {
 
 // do horizontal line
 
 if( dh < 0 ) {
 h_Sum += dh;
 dh = -dh;
 }
 
 at = (Ptr)at + (long)v_Cnt*(short)rowBytes;
 at += h_Sum;
 
 ++dh;
 
 do {
 *at++ = pixel;
 } while( --dh );
 }
 else if( Abs( dv ) >= Abs( dh ) ) {
 
 // more vertical or diagonal
 
 if( dv < 0 ) {
 v_Cnt += dv;
 h_Sum += dh;
 dv = -dv;
 dh = -dh;
 }
 
 at = (Ptr)at + (long)v_Cnt*(short)rowBytes;
 at += h_Sum;
 
 v_Cnt = dv + 1;
 
 if( dh == dv ) {
 rowBytes += sizeof(pixel);
 goto doVert;
 }
 else if( -dh == dv ) {
 rowBytes -= sizeof(pixel);
 goto doVert;
 }
 else {

 h_Sum = 0;
 
 savedPnt = pnt;
 pnt = (short*)sizeof(pixel);
 
 if( dh < 0 ) {
 dh = -dh;
 pnt = (short*)-sizeof(pixel);
 }

 do {
 *at = pixel;
 at = (Ptr)at + (long)rowBytes;
 
 h_Sum += dh;
 
 if( h_Sum >= dv ) {
 h_Sum -= dv;
 at = (Ptr)at + (long)pnt;
 }
 } while( --v_Cnt );
 
 pnt = savedPnt;
 }
 }
 else {
 
 // more horizontal
 
 if( dh < 0 ) {
 v_Cnt += dv;
 h_Sum += dh;
 dv = -dv;
 dh = -dh;
 }
 
 at = (Ptr)at + (long)v_Cnt*(short)rowBytes;
 at += h_Sum;
 
 v_Cnt = dh + 1;
 h_Sum = 0;

 if( dv < 0 ) {
 dv = -dv;
 rowBytes = (Ptr)(-(short)rowBytes);
 }
 
 do {
 *at++ = pixel;
 
 h_Sum += dv;
 
 if( h_Sum >= dh ) {
 h_Sum -= dh;
 at = (Ptr)at + (long)rowBytes;
 }
 } while( --v_Cnt );
 }
 } while( --nDots );
 
// end







  
 

Community Search:
MacTech Search:

Software Updates via MacUpdate

Backblaze 4.3.0.44 - Online backup servi...
Backblaze is an online backup service designed from the ground-up for the Mac. With unlimited storage available for $5 per month, as well as a free 15-day trial, peace of mind is within reach with... Read more
Numi 3.15 - Menu-bar calculator supports...
Numi is a calculator that magically combines calculations with text, and allows you to freely share your computations. Numi combines text editor and calculator Support plain English. For example, '5... Read more
EtreCheck 3.3.3 - For troubleshooting yo...
EtreCheck is an app that displays the important details of your system configuration and allow you to copy that information to the Clipboard. It is meant to be used with Apple Support Communities to... Read more
BusyContacts 1.1.8 - Fast, efficient con...
BusyContacts is a contact manager for OS X that makes creating, finding, and managing contacts faster and more efficient. It brings to contact management the same power, flexibility, and sharing... Read more
TunnelBear 3.0.14 - Subscription-based p...
TunnelBear is a subscription-based virtual private network (VPN) service and companion app, enabling you to browse the internet privately and securely. Features Browse privately - Secure your data... Read more
Apple Final Cut Pro X 10.3.4 - Professio...
Apple Final Cut Pro X is a professional video editing solution.Completely redesigned from the ground up, Final Cut Pro adds extraordinary speed, quality, and flexibility to every part of the post-... Read more
Hopper Disassembler 4.2.1- - Binary disa...
Hopper Disassembler is a binary disassembler, decompiler, and debugger for 32-bit and 64-bit executables. It will let you disassemble any binary you want, and provide you all the information about... Read more
Slack 2.6.2 - Collaborative communicatio...
Slack is a collaborative communication app that simplifies real-time messaging, archiving, and search for modern working teams. Version 2.6.2: Fixed Inexplicably, context menus and spell-check... Read more
Arq 5.8.5 - Online backup to Google Driv...
Arq is super-easy online backup for Mac and Windows computers. Back up to your own cloud account (Amazon Cloud Drive, Google Drive, Dropbox, OneDrive, Google Cloud Storage, any S3-compatible server... Read more
Instaradio 7.1 - Listen to your favorite...
Instaradio is fast, and it could be the radio player you have been waiting for. Try the app thousands of people rely on for listening to radio. Features Listen to radio from all around the world... Read more

Latest Forum Discussions

See All

Goat Simulator PAYDAY (Games)
Goat Simulator PAYDAY 1.0 Device: iOS Universal Category: Games Price: $4.99, Version: 1.0 (iTunes) Description: ** IMPORTANT - SUPPORTED DEVICES **iPhone 4S, iPad 2, iPod Touch 5 or better Goat Simulator: Payday is the most... | Read more »
Zombie Gunship Survival Beginner's...
The much anticipated Zombie Gunship Survival is here. In this latest entry in the Zombie Gunship franchise, you're tasked with supporting ground troops and protecting your base from the zombie horde. There's a lot of rich base building fun, and... | Read more »
Mordheim: Warband Skirmish (Games)
Mordheim: Warband Skirmish 1.2.2 Device: iOS Universal Category: Games Price: $3.99, Version: 1.2.2 (iTunes) Description: Explore the ruins of the City of Mordheim, clash with other scavenging warbands and collect Wyrdstone -... | Read more »
Mordheim: Warband Skirmish brings tablet...
Legendary Games has just launched Mordheim: Warband Skirmish, a new turn-based action game for iOS and Android. | Read more »
Magikarp Jump splashes onto Android worl...
If you're tired ofPokémon GObut still want something to satisfy your mobilePokémon fix,Magikarp Jumpmay just do the trick. It's out now on Android devices the world over. While it looks like a simple arcade jumper, there's quite a bit more to it... | Read more »
Purrfectly charming open-world RPG Cat Q...
Cat Quest, an expansive open-world RPG from former Koei-Tecmo developers, got a new gameplay trailer today. The video showcases the combat and exploration features of this feline-themed RPG. Cat puns abound as you travel across a large map in a... | Read more »
Jaipur: A Card Game of Duels (Games)
Jaipur: A Card Game of Duels 1.0 Device: iOS Universal Category: Games Price: $1.99, Version: 1.0 (iTunes) Description: ** WARNING: iPad 2, iPad Mini 1 & iPhone 4S are NOT compatible. ** *** Special Launch Price for a limited... | Read more »
Subdivision Infinity (Games)
Subdivision Infinity 1.03 Device: iOS Universal Category: Games Price: $2.99, Version: 1.03 (iTunes) Description: Launch sale! 40% Off! Subdivision Infinity is an immersive and pulse pounding sci-fi 3D space shooter. https://www.... | Read more »
Clash of Clans' gets a huge new upd...
Clash of Clans just got a massive new update, and that's not hyperbole. The update easily tacks on a whole new game's worth of content to the hit base building game. In the update, that mysterious boat on the edge of the map has been repaired and... | Read more »
Thimbleweed Park officially headed to iO...
Welp, it's official. Thimbleweed Park will be getting a mobile version. After lots of wondering and speculation, the developers confirmed it today. Thimbleweed Park will be available on both iOS and Android sometime in the near future. There's no... | Read more »

Price Scanner via MacPrices.net

Apple refurbished 13-inch MacBook Airs availa...
Apple has Certified Refurbished 2016 13″ MacBook Airs available starting at $849. An Apple one-year warranty is included with each MacBook, and shipping is free: - 13″ 1.6GHz/8GB/128GB MacBook Air: $... Read more
Apple restocks refurbished 11-inch MacBook Ai...
Apple has Certified Refurbished 11″ MacBook Airs (the latest models recently discontinued by Apple), available for up to $170 off original MSRP. An Apple one-year warranty is included with each... Read more
12-inch 1.2GHz Retina MacBooks on sale for up...
B&H has 12″ 1.2GHz Retina MacBooks on sale for up to $150 off MSRP. Shipping is free, and B&H charges NY & NJ sales tax only: - 12″ 1.2GHz Space Gray Retina MacBook: $1449.99 $150 off... Read more
15-inch 2.7GHz Silver Touch Bar MacBook Pro o...
MacMall has the 15-inch 2.7GHz Silver Touch Bar MacBook Pro (MLW82LL/A) on sale for $2569 as part of their Memorial Day sale. Shipping is free. Their price is $230 off MSRP. Read more
Free Tread Wisely Mobile App Endorsed By Fath...
Just in time for the summer driving season, Cooper Tire & Rubber Company has announced the launch of a new Tread Wisely mobile app. Designed to promote tire and vehicle safety among teens and... Read more
Commercial Notebooks And Detachable Tablets W...
Worldwide shipments of personal computing devices (PCDs), comprised of traditional PCs (a combination of desktop, notebook, and workstations) and tablets (slates and detachables), are forecast to... Read more
Best value this Memorial Day weekend: Touch B...
Apple has Certified Refurbished 2016 15″ and 13″ MacBook Pros available for $230 to $420 off original MSRP. An Apple one-year warranty is included with each model, and shipping is free: - 15″ 2.6GHz... Read more
13-inch MacBook Airs on sale for up to $130 o...
Overstock.com has 13″ MacBook Airs on sale for up to $130 off MSRP including free shipping: - 13″ 1.6GHz/128GB MacBook Air (sku MMGF2LL/A): $869.99 $130 off MSRP - 13″ 1.6GHz/256GB MacBook Air (sku... Read more
2.8GHz Mac mini available for $973 with free...
Adorama has the 2.8GHz Mac mini available for $973, $16 off MSRP, including a free copy of Apple’s 3-Year AppleCare Protection Plan. Shipping is free, and Adorama charges sales tax in NY & NJ... Read more
15-inch 2.2GHz Retina MacBook Pro on sale for...
Amazon has 15″ 2.2GHz Retina MacBook Pros (MJLQ2LL/A) available for $1749.99 including free shipping. Apple charges $1999 for this model, so Amazon’s price is represents a $250 savings. Note that... Read more

Jobs Board

*Apple* Media Products - Commerce Engineerin...
Apple Media Products - Commerce Engineering Manager Job Number: 57037480 Santa Clara Valley, California, United States Posted: Apr. 18, 2017 Weekly Hours: 40.00 Job Read more
*Apple* Mac and Mobility Engineer - Infogrou...
Title: Apple Mac and Mobility Engineer Location: Portland, OR Area Type: 12 month contract Job: 17412 Here's a chance to take your skills to the limit, learn new Read more
*Apple* Retail - Multiple Positions, White P...
Sales Specialist - Retail Customer Service and Sales Transform Apple Store visitors into loyal Apple customers. When customers enter the store, you're also the Read more
Best Buy *Apple* Computing Master - Best Bu...
**509110BR** **Job Title:** Best Buy Apple Computing Master **Location Number:** 000048-Topeka-Store **Job Description:** **What does a Best Buy Apple Computing Read more
*Apple* Retail - Multiple Positions - Apple,...
Job Description: Sales Specialist - Retail Customer Service and Sales Transform Apple Store visitors into loyal Apple customers. When customers enter the store, Read more
All contents are Copyright 1984-2011 by Xplain Corporation. All rights reserved. Theme designed by Icreon.