Jun 93 Challenge
 Volume Number: 9 Issue Number: 6 Column Tag: Programmers’ Challenge

# 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.

## WHERE IN THE WORLD?

This month’s Challenge is a real world problem previously solved without reals by real MacTech reader Allen Stenger (Gardena, CA): You are given a large array of unique city names in alphabetical order ending with a sentinel of ‘ZZZ’ and a single city name to find in this array. You are to return the index of the desired city, or if it doesn’t match exactly, a list of the five closest matches. If there are more than five closest ones, return any five of them. The closeness-of-match algorithm, for purposes of this challenge, is “differing in the fewest positions from the desired name.” Take the longest of the two strings you’re comparing and each time a position doesn’t match (or is beyond the end of the shorter string) add 1 to your difference count; the smallest difference count is considered closest.

The input city list is an array of Str255s (pascal strings) in one big block where there will be, say, 200 to 1000 unique city names (in alphabetical order, all uppercase, with the ‘ZZZ’ sentinel as the last element). The city you are to find is the uppercase string pointed to by cityToFindNamePtr. The prototype of the function you write is:

```Boolean FindCity(cityNames,
cityToFindNamePtr, closestMatches)
Str255  cityNames[];
Str255  *cityToFindNamePtr;
unsigned short   closestMatches[];
```

If there is an exact match, return TRUE and set closestMatches[0] equal to the zero-based index of the match. If there is not an exact match, return FALSE and set closestMatches[0..4] to the five closest matches (in order of closeness, or, if they are equally close, in any order).

Allen says that this problem came up while working on the American Airlines reservation system, SABRE, a long time ago. He says that his tests then showed that city names were misspelled about 1/3rd of the time due to either poor spelling or typing by the reservation agents (no offense intended). You can use that information in your solution if you like; I will be simulating it with test data (exact matches will occur only 33% of the time I call your routine from my test bench).

## TWO MONTHS AGO WINNER

Congratulations to Steve Israelson (Vancouver, B.C.) for winning the “Rotated Bits” challenge. Right on his heels is Andy Scheck (location unknown) with an entry that was half as many bytes but which was just a little too slow in some cases to win. Jeff Mallett (Hickory, NC) deserves praise for his extremely small solution which was also near the top in terms of speed. Because it is so small, it is listed here as well, after Steve’s winning solution.

There were 16 entries to this challenge. Two of them were disqualified immediately because they were in assembly (nice try) and six others were disqualified for giving incorrect results (try testing with a 9x17 bitmap). Many people e-mailed me and asked if they could assume that rowBytes was divisible by four. The answer is: no. However, you could always case out on that case early on in your routine and then call one of two rotate functions based on if (rowBytes % 4 == 0) or not. Just so long as your solution has one entry point you can do whatever you like inside.

Here’s a summary of the eight entries that gave correct results. The bytes column is the code size, test 1 is the ticks to rotate 4000 small bitmaps (20x30 and smaller) and test 2 is the ticks to rotate 400 medium size bitmaps (300x400 pixels, approx). In all cases, the bitmaps were filled with the same random data before rotating:

Name bytes test 1 test 2

Steve Israelson 740 72 638

Andy Scheck 386 75 778

Jeff Mallett 194 91 936

Patrick Breen 668 125 902

Stepan Riha 656 122 1186

Dave Darrah 362 138 1453

Jan Bruyndonckx 490 205 1785

Dominic Mazzoni 244 630 6687

Steve’s winning solution is reasonably commented so I won’t go into detail here describing how it works. I will, however, offer some peephole optimizations to make it even better.

The first thing that the optimized eye notices about his code is that he multiplies, divides and mods by 8. It’s a dangerous assumption to make that the compiler will be smart and substitute shifts and ands where it can. I always prefer to make them explicit. Thus, I would change these lines:

``` srcRowX8 = srcRowBytes * 8;
srcData = const1 + srcX / 8;
if (remainder = (srcWidth % 8))
```

to these:

``` srcRowX8 = srcRowBytes << 3;
srcData = const1 + (srcX >> 3);
if (remainder = (srcWidth & (8 - 1)))
```

In addition to those, there is one point in his code where he multiplies by 7. He’d be better off by multiplying by 8 (using a shift) and then subtracting one. This:

``` src += srcOffset * 7;
is faster as:

src += srcOffset << 3;
src -= srcOffset;

```

After I made these changes and then ran test 2, the time went from 638 ticks to 542 ticks (it reduced the code size by 18 bytes, too).

Here’s Steve’s winning solution, followed by Jeff’s tiny solution:

```/*-------------------------------------------------
Steve Israelson
Motion Works Corp.
-------------------------------------------------*/
void RotateBitMapClockwise(BitMap *, BitMap *);
void rotateBlock(unsigned long *,unsigned char *,
long,unsigned char *,long);
void rotateLimitedBlock(unsigned long *,
unsigned char *, long,unsigned char *,long,
short);

/*-------------------------------------------------
Rotate the bitmap from src to dst by +90 degrees.  Make
a table for use in the rotate block routine.  Step through
the src in 8x8 blocks, starting from the bottom left.  Step
through dst in 8x8 blocks,  starting from the top left.
Handle the right edge of the bitmap specially to prevent bits
from being rotated into memory outside of the destination.

-------------------------------------------------*/
void RotateBitMapClockwise(BitMap *src, BitMap *dst)
{
unsigned long table[16] =
{0x00000000, 0x00000001, 0x00000100, 0x00000101,
0x00010000, 0x00010001, 0x00010100, 0x00010101,
0x01000000, 0x01000001, 0x01000100, 0x01000101,
0x01010000, 0x01010001, 0x01010100, 0x01010101};
/* x,y co-ord of source block */
register short  srcX, srcY;
/* row bytes, dereferenced for speed */
short  srcRowBytes, dstRowBytes;
/* src rowbytes * 8, for speed */
short  srcRowX8;
/* width and height of src */
short  srcWidth, srcHeight;
/* pointer to src and dst 8x8 blocks */
char   *srcData, *dstData;
/* pointer to bitmaps de-referenced for speed */
/* last few pixels to do specially */
short  remainder;
/* a constant, pre-calculated for speed */
char   *const1;

/* de-reference some constants */
srcRowBytes = src->rowBytes;
dstRowBytes = dst->rowBytes;

/* calculate some values */
srcWidth = src->bounds.right - src->bounds.left;
srcHeight = src->bounds.bottom - src->bounds.top;

srcRowX8 = srcRowBytes * 8;
const1 = srcAddr + (srcHeight - 8) * srcRowBytes;

/* loop through the source doing vertical
* slices starting at the left */
for (srcX = 0; srcX < srcWidth - 7; srcX += 8) {
/* bottom edge */
srcData = const1 + srcX / 8;
/* left edge */
dstData = dstAddr + srcX * dstRowBytes;
for (srcY = srcHeight - 1; srcY >= 0;
srcY -= 8 ) {
rotateBlock(table, (unsigned char *)srcData,
srcRowBytes, (unsigned char *)dstData,
dstRowBytes);
srcData -= srcRowX8; /* next vert block */
++dstData; /* next horiz block */
}
}

/* handle the last partial row by calling
* rotateLimitedBlock() */
if (remainder = (srcWidth % 8)) {
/* bottom edge */
srcData = const1 + srcX / 8;
/* left edge */
dstData = dstAddr + srcX * dstRowBytes;
for (srcY = srcHeight - 1; srcY >= 0;
srcY -= 8 ) {
rotateLimitedBlock(table,
(unsigned char *)srcData, srcRowBytes,
(unsigned char *)dstData, dstRowBytes,
remainder);
srcData -= srcRowX8;
++dstData;
}
}
}

/*-------------------------------------------------
Rotate an 8x8 block of pixels by treating the destination
block as 2 unsigned longs (64 bits!) and using a lookup
table to get a mask for the value of each row in the src
block.  The table essentially stretches out the source byte
to 8 times its size and then ORs it into the destination
64bits.  Since the bits are in the low bit of each byte,
the destination has to be shifted one position to the left
before each OR operation. The offset values are the
difference to rowBytes. If we had a 64bit data type, this
would be easier.
-------------------------------------------------*/
void rotateBlock(unsigned long *table,
unsigned char *src, long srcOffset,
unsigned char *dst, long dstOffset)
{
register unsigned long   resultLO, resultHi;
short  x;

resultLO = resultHi = 0;
src += srcOffset * 7;
/* compute the rotated result */
for (x = 0; x < 8; ++x) {
resultLO = resultLO << 1;
resultHi = resultHi << 1;
resultLO |= table[(*src) >> 4];
resultHi |= table[(*src) & 0x0F];
src -= srcOffset;
}

/* store the rotated result */
*dst = (resultLO & 0xFF000000) >> 24;
dst += dstOffset;
*dst = (resultLO & 0x00FF0000) >> 16;
dst += dstOffset;
*dst = (resultLO & 0x0000FF00) >> 8;
dst += dstOffset;
*dst = resultLO & 0x000000FF;
dst += dstOffset;
*dst = (resultHi & 0xFF000000) >> 24;
dst += dstOffset;
*dst = (resultHi & 0x00FF0000) >> 16;
dst += dstOffset;
*dst = (resultHi & 0x0000FF00) >> 8;
dst += dstOffset;
*dst = resultHi & 0x000000FF;
}

/*-------------------------------------------------
Same as other rotateBlock, except will do a
partial block. Useful to prevent the overwriting
of memory outside the bitmap!
-------------------------------------------------*/
void rotateLimitedBlock(unsigned long *table,
unsigned char *src, long srcOffset,
unsigned char *dst, long dstOffset, short lines)
{
register unsigned long   resultLO, resultHi;
short  x;

resultLO = resultHi = 0;
src += srcOffset * 7;
for (x = 0; x < 8; ++x) {
resultLO = resultLO << 1;
resultHi = resultHi << 1;
resultLO |= table[(*src) >> 4];
resultHi |= table[(*src) & 0x0F];
src -= srcOffset;
}
*dst = (resultLO & 0xFF000000) >> 24;
dst += dstOffset; if (lines == 1) return;
*dst = (resultLO & 0x00FF0000) >> 16;
dst += dstOffset; if (lines == 2) return;
*dst = (resultLO & 0x0000FF00) >> 8;
dst += dstOffset; if (lines == 3) return;
*dst = resultLO & 0x000000FF;
dst += dstOffset; if (lines == 4) return;
*dst = (resultHi & 0xFF000000) >> 24;
dst += dstOffset; if (lines == 5) return;
*dst = (resultHi & 0x00FF0000) >> 16;
dst += dstOffset; if (lines == 6) return;
*dst = (resultHi & 0x0000FF00) >> 8;
dst += dstOffset; if (lines == 7) return;
*dst = resultHi & 0x000000FF;
}

//*********************************************************
// RotateBitMapClockwise
// By Jeff Mallett
//
// Rotates the significant bits of the srcBitMapPtr 90°
// clockwise and stores the result in dstBitMapPtr.
//*********************************************************

#define kHighShortBit0x8000
#define kBitsPerShort16

// Creates a short from bits in different rows of
// the source bitmap.  Then copies this short into
// the destination bitmap.
#define COPY_TWO_BYTES(stopValue)  \
data = 0, bit = kHighShortBit;    \
do {   \
if (*srcPos & srcBit) data |= bit;\
srcPos += srcRowShorts;  \
} while ( (bit >>= 1) != stopValue ); \
*(dstPos++) = data

void RotateBitMapClockwise(BitMap *srcBitMapPtr,
BitMap *dstBitMapPtr)
{
register unsigned short data, *srcPos, bit;
register int j;
register unsigned short srcBit, *dstPos, stopBit;
register int i;
unsigned short *baseSrcPtr;
// shorts per row of source
const int srcRowShorts =
srcBitMapPtr->rowBytes >> 1;
const int numSrcRows =
srcBitMapPtr->bounds.bottom - srcBitMapPtr->bounds.top;

srcPos = baseSrcPtr =
srcBit = kHighShortBit;

for (i = srcBitMapPtr->bounds.right -
srcBitMapPtr->bounds.left; i; --i) {
// Copy one column of source to a row of destination
for (j = numSrcRows / kBitsPerShort; j; --j) {
COPY_TWO_BYTES(0);
}
if (j = numSrcRows % kBitsPerShort) {
stopBit = kHighShortBit >> j;
COPY_TWO_BYTES(stopBit); // Final 2 bytes
}
// Prepare to copy next column of source
if ( !(srcBit >>= 1) ) {
srcBit = kHighShortBit;
++baseSrcPtr;
}
srcPos = baseSrcPtr;
}
}
```

## 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. 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, and CompuServe: 71552,174. 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.

Community Search:
MacTech Search:

ffWorks 1.0.6 - Convert multimedia files...
ffWorks (was iFFmpeg), focused on simplicity, brings a fresh approach to the use of FFmpeg, allowing you to create ultra-high-quality movies without the need to write a single line of code on the... Read more
Adobe Acrobat 18.011.20035 - Powerful PD...
Acrobat DC is available only as a part of Adobe Creative Cloud, and can only be installed and/or updated through Adobe's Creative Cloud app. Adobe Acrobat DC with Adobe Document Cloud services is... Read more
Adobe Acrobat Reader allows users to view PDF documents. You may not know what a PDF file is, but you've probably come across one at some point. PDF files are used by companies and even the IRS to... Read more
EtreCheck 4.0.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
Yummy FTP Pro 2.0 - \$29.99
Yummy FTP Pro is an advanced Mac file transfer app which provides a full-featured professional toolkit combined with blazing speeds and impeccable reliability, so whether you want to transfer a few... Read more
Opera 51.0.2830.34 - High-performance We...
Opera is a fast and secure browser trusted by millions of users. With the intuitive interface, Speed Dial and visual bookmarks for organizing favorite sites, news feature with fresh, relevant content... Read more
iOS 11 sets a new standard for what is already the world’s most advanced mobile operating system. It makes iPhone better than before. It makes iPad more capable than ever. And now it opens up both to... Read more
Google Chrome 64.0.3282.167 - Modern and...
Google Chrome is a Web browser by Google, created to be a modern platform for Web pages and applications. It utilizes very fast loading of Web pages and has a V8 engine, which is a custom built... Read more
Adobe Photoshop CC 2018 19.1.1 - Profess...
Photoshop CC 2018 is available as part of Adobe Creative Cloud for as little as \$19.99/month (or \$9.99/month if you're a previous Photoshop customer). Adobe Photoshop CC 2018, the industry standard... Read more
iOS 11 sets a new standard for what is already the world’s most advanced mobile operating system. It makes iPhone better than before. It makes iPad more capable than ever. And now it opens up both to... Read more

## Latest Forum Discussions

Check out these 5 games that are a lot l...
So you're in love with Minecraft, but you're looking for something else to play as well? You've come to the right place then, because this list is all about games that are a bit like Minecraft. Some of them, more than others. [Read more] | Read more »
Our top 5 characters from casual RPG Cre...
Creature Quest definitely lives up to its name with a host of collectible creatures based on fantasy tales and world mythologies. To celebrate Creature Quest’s first birthday, we’re going to lay out what we think are the five best characters in the... | Read more »
Around the Empire: What have you missed...
Did you know that Steel Media has a whole swathe of other sites dedicated to all aspects of mobile gaming? Sure you'll get the very best iPhone news, reviews, and opinions right here at 148Apps, but we don't want you missing out on a single piece... | Read more »
All the best games on sale for iPhone an...
Oh hi there, and welcome to our round-up of the best games that are currently on sale for iPhone and iPad. You thought I didn't see you there, did you, skulking behind the bushes? Trust me though, the bushes aren't where the best deals are. The... | Read more »
The Battle of Polytopia Guide - How to H...
A new update just released for The Battle of Polytopia (formerly Super Tribes), which introduces online multiplayer. For all the fans of Midjiwan’s lite take on Civilization, this is certainly welcome news, but playing online isn’t as easy and... | Read more »
Here are the very best mobile games to p...
It's Valentine's Day! Did you get loads of cards and chocolates and other tacky, simple expressions of human affection? Did you send out tat because you find it almost impossible to express emotion unless there's a section dedicated to it at your... | Read more »
Florence (Games)
Florence 1.0 Device: iOS Universal Category: Games Price: \$2.99, Version: 1.0 (iTunes) Description: Florence is an interactive storybook from the award-winning lead designer of Monument Valley about the heart-racing highs and... | Read more »
Purrfect Date (Games)
Purrfect Date 1.0 Device: iOS Universal Category: Games Price: \$4.99, Version: 1.0 (iTunes) Description: Cats are a lil’ like marmite. Either you absolutely head-over-heels love’ em, or… nahhh, who are we kidding?! Everyone... | Read more »
More monsters to collect and evolve in C...
A laid-back mix of RPG and TCG, Creature Quest is all about building your deck, evolving your creatures and winning in battle. It’s the creation of VC Mobile, set up by Might and Magic producer Jon Van Caneghem. There are elements of that classic... | Read more »
Check out this awesome hands-on with the...
Well, PlayerUnknown's Battlegrounds has come out on mobile. This isn't a clone, this isn't a riff on the battleroyale mechanics of the game, it's the official mobile port by Tencent. But there's a little bit of a hitch. [Read more] | Read more »

## Price Scanner via MacPrices.net

Save up to \$350 with these Apple Certified Re...
Apple has a full line of Certified Refurbished iMacs available for up to \$350 off original MSRP. Apple’s one-year warranty is standard, and shipping is free. The following models are available: – 27... Read more
B&H offers \$200 discount on Silver 15″ Ma...
B&H Photo has Silver 15″ Apple MacBook Pros on sale for \$200 off MSRP. Shipping is free, and B&H charges sales tax for NY & NJ residents only: – 15″ 2.8GHz Touch Bar MacBook Pro Silver (... Read more
12″ Apple iPad Pro Sale of the Year! Models u...
B&H Photo has 12″ #iPad Pros on sale for up to \$150 off MSRP. Shipping is free, and B&H charges sales tax in NY & NJ only: – 12″ 64GB WiFi iPad Pro: \$719 \$80 off MSRP – 12″ 256GB WiFi... Read more
Deals on 32GB 9″ iPads: Up to \$50 off MSRP, s...
B&H Photo has 2017 9.7″ 32GB iPads on sale for \$299 including free shipping plus NY & NJ sales tax only. Their price is \$30 off MSRP, and it’s currently the lowest price available for these... Read more
15″ 2.2GHz Retina MacBook Pro available for o...
Apple has Certified Refurbished 15″ 2.2GHz Retina MacBook Pros available for \$1699. That’s \$300 off MSRP for this model, and it’s the lowest price available for a 15″ MacBook Pro currently offered by... Read more
13″ 3.1GHz/256GB Silver Touch Bar MacBook Pro...
Amazon has the Silver 13″ 3.1GHz/256GB Touch Bar MacBook Pro (MPXX2LL/A) on sale for \$1649.99 including free shipping. Their price is \$150 off MSRP, and it’s the lowest price available for a new 13″... Read more
Saturday Sale: Amazon offers 13″ 1.8GHz/256GB...
Amazon has the 13″ 1.8GHz/256B Apple MacBook Air on sale today for \$250 off MSRP including free shipping: – 13″ 1.8GHz/256GB MacBook Air (MQD42LL/A): \$949.99, \$250 off MSRP Their price is the lowest... Read more
Roundup of Apple Certified Refurbished 12″ Ma...
Apple has Certified Refurbished 2017 12″ Retina MacBooks available for \$200-\$240 off the cost of new models. Apple will include a standard one-year warranty with each MacBook, and shipping is free.... Read more
Apple offers Certified Refurbished 10″ and 12...
Apple is now offering Certified Refurbished 2017 10″ and 12″ iPad Pros for \$100-\$190 off MSRP, depending on the model. An Apple one-year warranty is included with each model, and shipping is free: –... Read more
Apple Canada offers Certified Refurbished Mac...
Canadian shoppers can save up to \$560 on the purchase of a 2017 current-generation MacBook Pro, MacBook, or MacBook Air with Certified Refurbished models at Apple Canada. Apple’s refurbished prices... Read more

## Jobs Board

*Apple* Store Leader - Retail District Manag...
Job Description:Job SummaryAs more and more people discover Apple , they visit our retail stores seeking ways to incorporate our products into their lives. It's your Read more
*Apple* Retail - Multiple Positions - Apple,...
Job Description:SalesSpecialist - Retail Customer Service and SalesTransform Apple Store visitors into loyal Apple customers. When customers enter the store, 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
*Apple* Retail - Multiple Positions - Apple,...
Job Description:SalesSpecialist - Retail Customer Service and SalesTransform Apple Store visitors into loyal Apple customers. When customers enter the store, 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