TweetFollow Us on Twitter

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 */
 char   *srcAddr, *dstAddr;
 /* 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;
 srcAddr = src->baseAddr;
 dstAddr = dst->baseAddr;
 
 /* 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;
 
 dstPos = (unsigned short *)dstBitMapPtr->baseAddr;
 srcPos = baseSrcPtr =
   (unsigned short *)srcBitMapPtr->baseAddr;
 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:

Software Updates via MacUpdate

Smultron 9.4.2 - Easy-to-use, powerful t...
Smultron 9 is an elegant and powerful text editor that is easy to use. Use it to create or edit any text document. Everything from a web page, a note or a script to any single piece of text or code.... Read more
Xcode 9.0 - Integrated development envir...
Xcode includes everything developers need to create great applications for Mac, iPhone, iPad, and Apple Watch. Xcode provides developers a unified workflow for user interface design, coding, testing... Read more
iShowU Instant 1.2.0 - Full-featured scr...
iShowU Instant gives you real-time screen recording like you've never seen before! It is the fastest, most feature-filled real-time screen capture tool from shinywhitebox yet. All of the features you... Read more
Apple Safari 11.0 - Apple's Web bro...
Note: The direct download link is currently unavailable. It is available in the OS X 10.12.6 release, as well as in the Apple Security Updates. Apple Safari is Apple's web browser that comes with... Read more
Typinator 7.3 - Speedy and reliable text...
Typinator turbo-charges your typing productivity. Type a little. Typinator does the rest. We've all faced projects that require repetitive typing tasks. With Typinator, you can store commonly used... Read more
ExpanDrive 6.0.16 - Access cloud storage...
ExpanDrive builds cloud storage in every application, acts just like a USB drive plugged into your Mac. With ExpanDrive, you can securely access any remote file server directly from the Finder or... Read more
coconutBattery 3.6.4 - Displays info abo...
With coconutBattery you're always aware of your current battery health. It shows you live information about your battery such as how often it was charged and how is the current maximum capacity in... Read more
NTFS 15.0.911 - $19.95
NTFS breaks down the barriers between Windows and macOS. Paragon NTFS effectively solves the communication problems between the Mac system and NTFS. Write, edit, copy, move, delete files on NTFS... Read more
Apple iOS 11 - The latest version of App...
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
BetterTouchTool 2.302 - 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

The best games to play while you wait fo...
SteamWorld Dig 2 is out this week on PC and Switch, and people are understandably excited. This clever series by Image and Form combines our favorite metroidvania mechanics with an esquisite universe, excellent storytelling, and true wit. While... | Read more »
Drag'n'Boom beginner's gu...
Have you ever wanted to burn and pillage a village as a bloodthirsty dragon? If you answered yes to that question, Drag'n'Boom offers you the perfect chance to do so, casting you as an adorable little dragon that wants to set humankind aflame. It... | Read more »
Thimbleweed Park (Games)
Thimbleweed Park 1.0.0 Device: iOS Universal Category: Games Price: $9.99, Version: 1.0.0 (iTunes) Description: A brand new adventure game from Ron Gilbert and Gary Winnick, creators of the classics Monkey Island and Maniac Mansion!... | Read more »
The best simulation games on mobile
There's nothing like a good sim -- from the seemingly ridiculous to the incredibly mundane, you can be there's a simulation game out there for your every whim. [Read more] | Read more »
INKS guide - how to create works of pinb...
INKS puts a clever new spin on everyone's favorite classic arcade game, pinball. The core mechanics are the same -- keep a little ball pinging around the board for as long as possible without letting it fall into the precarious holes in the board.... | Read more »
Warbands: Bushido (Games)
Warbands: Bushido 1.0 Device: iOS Universal Category: Games Price: $3.99, Version: 1.0 (iTunes) Description: Warbands:Bushido is a miniatures board game with cards, miniatures, dice and beautiful terrains to fight on, with both... | Read more »
The best mobile games like Divinity: Ori...
Divinity: Original Sin 2 launched this week to the excitement of RPG fans everywhere. The game, which derives a lot of of its story and mechanics from old-school isometric RPGs and Dungeons & Dragons, has unseated PlayerUnknown's... | Read more »
Iron Marines guide - beginner tips and t...
Iron Marines is a brilliant RTS title that feels a bit like Starcraft. It's got a sci-fi setting and some of the most spectacular strategy mechanics we've seen in mobile games to date. With that said, the RTS genre can be a bit tricky to break... | Read more »
The best new games we played this week -...
The work week can be tough, but on the bright side, it's almost overandthere are bunches of brand new games to try out this weekend. This week definitely makes up for last week's sleepiness ten-fold. We've got one of the finest RTS game on mobile... | Read more »
Through the Ages (Games)
Through the Ages 1.0.60 Device: iOS Universal Category: Games Price: $9.99, Version: 1.0.60 (iTunes) Description: The offical adaptation of Vlaada Chvátil’s strategy classic, the second best board game ever by Board Game Geek website... | Read more »

Price Scanner via MacPrices.net

Apple Refurbished 3TB Time Capsule for $279,...
Apple has Certified Refurbished 3TB Time Capsules available for $279 including free shipping plus Apple’s standard one-year warranty. Their price is $120 off MSRP. Read more
19% off Smart Battery Cases for iPhone 7
Amazon has both Black and White Smart Battery Cases for iPhone 7s available for $80.41 including free shipping. Their price is $18.59, or 19%, off MSRP. Read more
Back on sale: 10.5-inch 64GB iPad Pros for $5...
MacMall has 10.5″ 64GB Apple iPad Pros on sale again for $599 including free shipping. That’s $50 off MSRP and the lowest price available for this model from any reseller. Read more
Verizon offers Certified Preowned 16GB iPhone...
Verizon has the 16GB iPhone 6, Certified Preowned, available for $259.99 or $10.83 per month for 24 months. Service plan required. According to Verizon, “All CPO devices have been reconditioned to... Read more
Preorder new iPhone 8 at US Cellular, and tak...
Preorder the new iPhone 8 or iPhone 8 Plus at US Cellular, and take $50 off the prepaid price: – 64GB iPhone 8: $649.99 – 128GB iPhone 8: $799.99 – 64GB iPhone 8 Plus: $749.99 – 128GB iPhone 8 Plus... Read more
12-inch and 9-inch Apple iPad Pros, Certified...
Apple has Certified Refurbished 2016 12″ WiFi iPad Pros available starting at $589. An Apple one-year warranty is included with each model, and shipping is free: – 32GB 12″ iPad Pro WiFi: $589... Read more
QuickerTek Announces Solar PV Chargers for US...
Wichita, Kansas based QuickerTek has announced its new 30 Watt and 60 Watt USB Type-C Solar Juicz Chargers. These solar panels are the only products of their kind, featuring the USB 3.1 adapter cable... Read more
Apple refurbished 128GB iPhone 6s and 6s Plus...
Apple has Certified Refurbished 128GB iPhone 6s and 6s Plus’ available for up to $100 off the price of new models. Space Gray, Silver, Gold, and Rose Gold models are available. Each phone comes... Read more
13-inch 2.3GHz Silver MacBook Pros on sale fo...
B&H Photo has 2017 13″ 2.3GHz Silver 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 Silver... Read more
12-inch 64GB iPad Pros available for $749, $5...
MacMall has 12″ 64GB iPad Pros on sale for $749 including free shipping. Their price is $50 off MSRP. Read more

Jobs Board

Development Operations and Site Reliability E...
Development Operations and Site Reliability Engineer, Apple Payment Gateway Job Number: 57572631 Santa Clara Valley, California, United States Posted: Jul. 27, 2017 Read more
*Apple* Solutions Consultant - Apple Inc. (U...
…about helping others on a team while also delighting customers? As an Apple Solutions Consultant (ASC), you will discover customers needs and help connect them Read more
Software/Data Engineer, *Apple* Media Produ...
Job Summary Apple Media Products is the team behind the App Store, Apple Music, iTunes, and many other high profile products on iPhone, Mac and AppleTV. Our Data Read more
SW Engineer , *Apple* Media - Apple Inc. (U...
Job Summary Our team is responsible for exposing Apple Media content and services to the world, and building the infrastructure for next generation internal and Read more
*Apple* Data Center Site Selection and Strat...
Job Summary As Apple 's products and services scale the globe, the Data Center Affairs team works behind the scenes to secure infrastructure for Apple 's data Read more
All contents are Copyright 1984-2011 by Xplain Corporation. All rights reserved. Theme designed by Icreon.