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

BetterTouchTool 2.305 - Customize multi-...
BetterTouchTool adds many new, fully customizable gestures to the Magic Mouse, Multi-Touch MacBook trackpad, and Magic Trackpad. These gestures are customizable: Magic Mouse: Pinch in / out (zoom... Read more
calibre 3.8.0 - Complete e-book library...
Calibre is a complete e-book library manager. Organize your collection, convert your books to multiple formats, and sync with all of your devices. Let Calibre be your multi-tasking digital librarian... Read more
Carbon Copy Cloner 5.0.2 - Easy-to-use b...
Carbon Copy Cloner backups are better than ordinary backups. Suppose the unthinkable happens while you're under deadline to finish a project: your Mac is unresponsive and all you hear is an ominous,... Read more
Evernote 6.12.3 - Create searchable note...
Evernote allows you to easily capture information in any environment using whatever device or platform you find most convenient, and makes this information accessible and searchable at anytime, from... Read more
Default Folder X 5.1.6 - Enhances Open a...
Default Folder X attaches a toolbar to the right side of the Open and Save dialogs in any OS X-native application. The toolbar gives you fast access to various folders and commands. You just click on... Read more
Geekbench 4.1.2 - Measure processor and...
Geekbench provides a comprehensive set of benchmarks engineered to quickly and accurately measure processor and memory performance. Designed to make benchmarks easy to run and easy to understand,... Read more
GraphicConverter 10.5 - $39.95
GraphicConverter is an all-purpose image-editing program that can import 200 different graphic-based formats, edit the image, and export it to any of 80 available file formats. The high-end editing... Read more
Dropbox 35.4.20 - Cloud backup and synch...
Dropbox is an application that creates a special Finder folder that automatically syncs online and between your computers. It allows you to both backup files and keep them up-to-date between systems... Read more
XMind 8 Update 4 - Popular mind mapping...
XMind is the most popular mind mapping tool. Millions of people use XMind to clarify thinking, manage complex information, run brainstorming and get work organized. It couldn't be easier to get... Read more
Safari Technology Preview 11.1 - The new...
Safari Technology Preview contains the most recent additions and improvements to WebKit and the latest advances in Safari web technologies. And once installed, you will receive notifications of... Read more

The best new games we played this week -...
It's pretty much been one big release after another. We were privy to a bunch of surprises this week, with a lot of games we'd been waiting for quite some time dropping unexpectedly. We hope you're free this weekend, because there is a lot for... | Read more »
Stormbound: Kingdom Wars guide - how to...
Stormbound: Kingdom Wars is an excellent new RTS turned card battler out now on iOS and Android. Lovers of strategy will get a lot of enjoyment out of Stormbound's chess-like mechanics, and it's cardbased units are perfect for anyone who loves the... | Read more »
The best AR apps and games on iOS right...
iOS 11 has officially launched, and with it comes Apple's ARKit, a helpful framework that makes it easier than ever for developers to create mobile AR experiences. To celebrate the occassion, we're featuring some of the best AR apps and games on... | Read more »
Phoenix Wright: Ace Attorney - Spirit of...
Phoenix Wright: Ace Attorney - Spirit of Justice 1.00.00 Device: iOS Universal Category: Games Price: $.99, Version: 1.00.00 (iTunes) Description: ************************************************※IMPORTANT※・Please read the “When... | Read more »
Kpressor (Utilities)
Kpressor 1.0.0 Device: iOS Universal Category: Utilities Price: $4.99, Version: 1.0.0 (iTunes) Description: The ultimate ZIP compression application for iPhone and iPad. - Full integration of iOS 11 with support for multitasking.-... | Read more »
Find out how you can save £35 and win a...
Nothing raises excitement like a good competition, and we’re thrilled to announce our latest contest. We’ll be sending one lucky reader and a friend to the Summoners War World Arena Championship at Le Comedia in Paris on October 7th. It’s the... | Read more »
Another Lost Phone: Laura's Story...
Another Lost Phone: Laura's Story 1.0 Device: iOS Universal Category: Games Price: $2.99, Version: 1.0 (iTunes) Description: Another Lost Phone is a game about exploring the social life of a young woman whose phone you have just... | Read more »
The Witness (Games)
The Witness 1.0 Device: iOS Universal Category: Games Price: $9.99, Version: 1.0 (iTunes) Description: You wake up, alone, on a strange island full of puzzles that will challenge and surprise you. You don't remember who you are, and... | Read more »
Egg, Inc. guide - how to build your gold...
Egg, Inc.'s been around for some time now, but don't you believe for one second that this quirky clicker game has gone out of style. The game keeps popping up on Reddit and other community forums thanks to the outlandish gameplay (plus, the... | Read more »
The best deals on the App Store this wee...
Good news, everyone! Your favorite day of the week has arrived at last -- it's discount roundup day! This fine Wednesday evening we're gathering up the hottest deals on the App Store. We've got action platformers, we've got puzzle games, we've got... | Read more »

Price Scanner via MacPrices.net

Apple Offering Up To $455 Credit Toward iPhon...
iPhone 8 and 8 Plus are now available at the Apple Store, and you can receive up to $375 credit toward a new iPhone purchase when you trade in your eligible smartphone. Photo Courtesy Apple Just... Read more
AnyTrans Offers iOS Users Three Ways For Movi...
iMobie Inc. today announceed AnyTrans v6.0.1, which now can help iOS users move all data to iPhone 8/8 Plus seamlessly. The software is available both on Mac and Windows and fully able to move all... Read more
Snag a 13-inch 2.3GHz MacBook Pro for $100 of...
B&H Photo has 2017 13″ 2.3GHz MacBook Pros in stock today and on sale for $100 off MSRP, each including free shipping plus NY & NJ sales tax only: – 13-inch 2.3GHz/128GB Space Gray MacBook... Read more
Verizon offers new iPhone 8 for $100-$300 off...
Verizon is offering the new iPhone 8 for up to $300 off MSRP with an eligible trade-in: • $300 off: iPhone 6S/6S Plus/7/7 Plus, Google Pixel XL, LG G6, Moto Z2 Force, Samsung Galaxy S7/S7 edge/S8/S8... Read more
Apple Refurbished 2017 13-inch MacBook Pros a...
Apple has Certified Refurbished 2017 13″ Touch Bar MacBook Pros in stock today and available for $200-$300 off MSRP. A standard Apple one-year warranty is included with each MacBook, and shipping is... Read more
OWC USB-C Travel Dock with 5 Ports Connectivi...
OWC have announced the new OWC USB-C Travel Dock, the latest addition to their line of connectivity solutions. The USB-C Travel Dock lets you connect its integrated USB-C cable to a Mac or PC laptop... Read more
Pelican Products, Inc. Unveils Cases For All...
Pelican Products, Inc. has announced the launch of its full line of cases including Voyager, Adventurer, Protector, Ambassador, Interceptor (for the Apple iPhone 8 and 8 Plus backwards compatible... Read more
$100 off new 2017 13-inch MacBook Airs
B&H Photo has 2017 13″ MacBook Airs on sale today for $100 off MSRP including free shipping. B&H charges NY & NJ sales tax only: – 13″ 1.8GHz/128GB MacBook Air (MQD32LL/A): $899, $100 off... Read more
Apple restocks Certified Refurbished 13-inch...
Apple has Certified Refurbished 2015 13″ MacBook Airs available starting at $719 and 2016 models available starting at $809. An Apple one-year warranty is included with each MacBook, and shipping is... Read more
Is iPhone X Really The Future Of The Smartpho...
Should iPhone X even be called a telephone? It does of course support telephony and texting, but its main feature set is oriented to other things. It is also debatable whether it makes any rational... Read more

Jobs Board

Specialist - Retail Customer Services and Sal...
The position listed below is not with Tennessee Interviews but with Apple , Inc. Tennessee Interviews is a private organization that works in collaboration with Read more
Specialist - Retail Customer Services and Sal...
The position listed below is not with South Carolina Interviews but with Apple , Inc. South Carolina Interviews is a private organization that works in collaboration Read more
Behavior Technician with *Apple* Consulting...
The position listed below is not with Washington Interviews but with APPLE CONSULTING Washington Interviews is a private organization that works in collaboration Read more
Infection Control RN with *Apple* Rehab - A...
The position listed below is not with Georgia Interviews but with Apple Rehab Georgia Interviews is a private organization that works in collaboration with Read more
Specialist - Retail Customer Services and Sal...
The position listed below is not with South Carolina Interviews but with Apple , Inc. South Carolina Interviews is a private organization that works in collaboration Read more
All contents are Copyright 1984-2011 by Xplain Corporation. All rights reserved. Theme designed by Icreon.