Sep 95 Challenge
 Volume Number: 11 Issue Number: 9 Column Tag: Programmer’s Challenge

# Programmer’s Challenge

By Bob Boonstra, Westford, Massachusetts

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

## Reversible Scrambling Algorithm

According to tradition, September is Assembly Language Challenge month here at MacTech, and we continue that tradition this month. Your challenge is to do some simple arithmetic - raising a number to a power, and taking the remainder of the result modulo another number. Simple, right? To make things interesting, though, the numbers are going to be a little larger than you are used to dealing with. Hundreds of decimal digits long, in fact. “Why,” you may ask? We’ll get into that in a minute, but there are a couple of hints in the title of this month’s challenge.

The data structure to be used for the large numbers in this Challenge, and the prototype for the code you should write are:

```typedef struct BigNum {
short numDig;   /* the number of bytes in the BigNum */
unsigned char *dig; /* dig[0] is the most significant byte */
/* dig[numDig-1] is least significant */
} BigNum;

void PowerAndRemainder(
BigNum *msg,
BigNum *exp,    /* calculate msg to the exp power, */
BigNum *n, /* take the remainder modulo n */
BigNum *res/* and store the result in res */
);

```

For example, the value 1048573 (0xFFFFD) would be provided to you in a BigNum b with the values b.numDig=3, b.dig[0] = 0x0F, b.dig[1]=0xFF, and b.dig[2]=0xFD. The first three arguments will be provided as input when PowerAndRemainder is called; you are to generate both elements of the BigNum struct for the res argument. The storage for all of the BigNums in the call to PowerAndRemainder will be allocated by the caller. All BigNums will be positive integers, and none of the BigNums will be larger than 128 bytes in length (i.e., b.numDig will be no larger than 128). There is no restriction on the amount of memory you may use (within reason).

Those of you with some number theory in your background may recognize what a function like this might be used for. If the modulus n is the product of two large primes p and q, one can find values e and d for the exponent with the property that they are inverses of one another, but that neither can be easily derived from the other, provided prime numbers p and q are not divulged. If you calculate PowerAndRemainder(msg,e,n,c), and I then calculate PowerAndRemainder(c,d,n,x), then the result x turns out to be identical to the original value msg if e and d are relatively prime to (p-1)*(q-1). Now what do you suppose such a function might be useful for?

Your solution may use any combination of ANSI C and/or 68K assembly language, along with your choice of either the THINK C or MetroWerks C 68K compilers. I considered making this a PowerPC challenge, but I wasn’t confident that enough people are proficient with PPC assembly just yet - perhaps next September. In the meantime, you can look forward to a native PPC challenge next month.

If you are interested in some sample values to test your code, send me email and I’ll provide some.

Several people wrote to point out that the deadline for submitting Challenge solutions was missing from the Rules box during July and August. Unfortunately, when the rules were revised to accommodate multiple compilers and target instruction sets, the deadline was inadvertently omitted. The Challenge deadline remains the 10th of the month printed on the cover of the magazine. I received several submissions for the Chess challenge after the deadline (and after the article was submitted for publication). Because of the problem with the deadline, I would have awarded points to any fast and correct entries, but all of the late entries had problems with correctness so no additional points were awarded.

## Two Months Ago Winner

Of the nine entries to the Sprite Blitz challenge, seven of them worked correctly. Congratulations to Xan Gregg (Durham, NC) for having the fastest solution, some 30% faster than the second place entry, submitted by John Nevard. Despite the variation in run time performance, there were a number of clever and creative solutions among the top entries.

Here are the times and code sizes for the entries that worked correctly. Numbers in parens after a person’s name indicate that person’s cumulative point total for all previous Challenges, not including this one.

Name time (68K)

Xan Gregg (31) 908

John Nevard 1300

Bill Karsh (71) 3363

Jim Bumgardner (4) 3495

Jeremy Vineyard (40) 5789

Norman Basham 10164

Steve Israelson 75846

Like most of the top entries, Xan composed his screen updates offscreen. Xan uses one offscreen GWorld to hold the background and another to prepare the next animation frame. One clever trick is that the offscreen image is large enough to contain all of a sprite that overlaps a window boundary, so that clipping need only be done when updating the window. Drawing is done directly to the screen, taking advantage of alignment conditions guaranteed to hold by the problem statement. Xan does all of his copying to the screen using unrolled loops, avoiding the overhead incurred when using CopyBits or CopyMask for small copies. When reading the code, take note of the switch statement in the COPY4 macro that copies the icon based on the value of the mask, and of the longword copies in the FastCopyChunk routine.

Bill Karsh pointed out in his entry that the relative performance of CopyBits and CopyMask varies between his 68K machine and his PPC 7100, with CopyBits being faster on the former machine and CopyMask being faster on the latter. I didn’t have time to measure native performance on the PowerPC, but there was a 15% difference between the two versions in my 68K tests. Of course, as Xan’s solution shows, avoiding both can have its advantages also.

## Does Performance Matter?

I’ve received some email suggesting that the emphasis on performance in this column ought to be replaced by emphases on other things, like code portability, readability, reliability, encapsulation, or object orientation. The argument is that improvements in hardware performance make efficiency less important than it has been in the past. This is certainly a valid point of view, and there is no question that processor improvements have enabled us to sacrifice some machine cycles to achieve objectives other than performance. However, I contend that the performance of several popular personal computer applications demonstrates that software developers are capable of adding enough functionality (or generating poor enough code) to degrade performance to an unacceptable level, despite hardware advances. In my opinion, this will always be so. Certainly the techniques demonstrated in this column should not be used in all software, but they have their place in time-critical areas, and it is worth devoting more attention to efficiency than we typically do. Besides, squeezing instructions out of code is great fun! But if you are interested in seeing a column that focuses on something besides efficiency, drop me a note.

## Top 20 Contestants of All Time

Here are the Top 20 Contestants for the Programmer’s Challenges to date. The numbers below include points awarded for this month’s entrants. (Note: ties are listed alphabetically by last name - there are more than 20 people listed this month because of ties.)

1. [Name deleted] 176

2. Karsh, Bill 78

3. Munter, Ernst 70

4. Stenger, Allen 65

6. Gregg, Xan 51

7. Riha, Stepan 51

8. Goebel, James 49

9. Nepsund, Ronald 47

10. Cutts, Kevin 46

11. Mallett, Jeff 44

12. Kasparian, Raffi 42

13. Vineyard, Jeremy 42

14. Darrah, Dave 31

15. Landry, Larry 29

16. Elwertowski, Tom 24

17. Lee, Johnny 22

18. Noll, Robert 22

19. Anderson, Troy 20

20. Beith, Gary 20

21. Burgoyne, Nick 20

22. Galway, Will 20

23. Israelson, Steve 20

24. Landweber, Greg 20

25. Pinkerton, Tom 20

There are three ways to earn points: (1) scoring in the top 5 of any Challenge, (2) being the first person to find a bug in a published winning solution or, (3) being the first person to suggest a Challenge that I use. The points you can win are:

1st place 20 points

2nd place 10 points

3rd place 7 points

4th place 4 points

5th place 2 points

finding bug 2 points

suggesting Challenge 2 points

Here is Xan’s winning solution:

## Sprite Blitz

```Xan Gregg, July 1995
/*
Since “correctness” is considered before speed in judging solutions, this solution makes correctness the
top priority at the cost of speed.

I use two offscreen GWorlds.  One has the background, and another has the image to be displayed on the
screen next.  The “on deck” image is updated sprite by sprite, then it is copied to the screen for minimum
flicker.

The GWorlds are a little bigger than the screen so I don’t have to worry about sprites that overlap the edges
until copying to the screen.

Memory usage:
2 GWorlds, each 64 pixels wider and taller than window.
1K of pixel data for each sprite.
128 bytes of mask data for each sprite.
16 bytes of info for each sprite.
I set the number of sprites to 400.  The problem states a maximum of 200 present at a time, but because
a deleted sprite stays around until the next UpdateScreen() call,
I allow for 400 in case you delete all 200 then add 200 more before calling UpdateScreen().  Paranoid, but
if you’ve got the memory...

Assumptions not stated in the problem:
Enough memory available for above usage.
Window width is a multiple of 4 (confirmed by BB).
Window does not move during play.

*/

#include <QDOffscreen.h>

typedef struct
{
short  nextSlot;
short  status;
short  width;
short  height;
Point  position;
Point  lastPosition;
} SpriteInfo, *SpriteInfoPtr;

typedef struct
{
char pixData[1024];
} SpritePixData, *SpritePixDataPtr;

typedef struct
{

#define kMaxSprites400L
#define kMaxSpriteWidth   32L
#define kMaxSpriteHeight  32L

static CWindowPtrgScreenWindowP;
static GWorldPtr gBackgroundGW;
static PixMapHandlegBackgroundPixMapH;
static GWorldPtr gOnDeckGW;
static PixMapHandlegOnDeckPixMapH;
static shortgLastSpriteSlot;
static shortgFirstSpriteSlot;
static shortgSpriteCount;
static shortgWindowWidth;
static shortgWindowHeight;
static SpriteInfoPtr gSpriteInfo;
static SpritePixDataPtr gSpritePixData;
static long gOnDeckRowBytes;
static long gBkgRowBytes;
static long gScreenRowBytes;
static shortgDeletionCount;

StartGame
void StartGame(CWindowPtr windowP)
{
Rect   r;
PixMapPtrbkgPixMapP;
PixMapPtronDeckPixMapP;
PixMapPtrscreenPixMapP;

gLastSpriteSlot = -1;
gFirstSpriteSlot = -1;
gSpriteCount = 0;
gDeletionCount = 0;
gScreenWindowP = windowP;
r = windowP->portRect;
OffsetRect(&r, -r.left, -r.top);
gWindowWidth = r.right;
gWindowHeight = r.bottom;

InsetRect(&r, -kMaxSpriteWidth, -kMaxSpriteHeight);
NewGWorld(&gBackgroundGW, 0, &r, 0, 0, 0);
gBackgroundPixMapH = GetGWorldPixMap(gBackgroundGW);
LockPixels(gBackgroundPixMapH); /* always locked */
NewGWorld(&gOnDeckGW, 0, &r, 0, 0, 0);
gOnDeckPixMapH = GetGWorldPixMap(gOnDeckGW);
LockPixels(gOnDeckPixMapH);/* always locked */

gSpriteInfo = (SpriteInfoPtr) NewPtrClear
(sizeof(SpriteInfo) * kMaxSprites);
gSpritePixData = (SpritePixDataPtr) NewPtrClear
(sizeof(SpritePixData) * kMaxSprites);
gBkgRowAddr = (Ptr *) NewPtr(sizeof(Ptr) *
(gWindowHeight + kMaxSpriteHeight * 2));
gOnDeckRowAddr = (Ptr *) NewPtr(sizeof(Ptr) *
(gWindowHeight + kMaxSpriteHeight * 2));
* (long) gWindowHeight);
if (gSpriteInfo == 0 || gSpritePixData == 0
|| gBackgroundGW == 0 || gOnDeckGW == 0)
DebugStr("\p out of memory!");
InsetRect(&r, kMaxSpriteWidth, kMaxSpriteHeight);
OffsetRect(&r, kMaxSpriteWidth, kMaxSpriteHeight);
CopyBits(&((WindowPtr)windowP)->portBits,
&((WindowPtr)gBackgroundGW)->portBits,
&windowP->portRect, &r, srcCopy, NULL);
CopyBits(&((WindowPtr)windowP)->portBits,
&((WindowPtr)gOnDeckGW)->portBits,
&windowP->portRect, &r, srcCopy, NULL);

bkgPixMapP = *gBackgroundPixMapH;
onDeckPixMapP = *gOnDeckPixMapH;
gOnDeckRowBytes = onDeckPixMapP->rowBytes & 0x7fff;
+ gOnDeckRowBytes * kMaxSpriteHeight
+ kMaxSpriteWidth;
gBkgRowBytes = bkgPixMapP->rowBytes & 0x7fff;
+ gBkgRowBytes * kMaxSpriteHeight
+ kMaxSpriteWidth;
screenPixMapP = *gScreenWindowP->portPixMap;
gScreenRowBytes = screenPixMapP->rowBytes & 0x7fff;
- screenPixMapP->bounds.left
- screenPixMapP->bounds.top
* gScreenRowBytes;

long row;

for (row = -kMaxSpriteHeight;
row < gWindowHeight + kMaxSpriteHeight; row++)
{
+ row * gBkgRowBytes;
+ row * gOnDeckRowBytes;
}
for (row = 0; row < gWindowHeight; row++)
+ row * gScreenRowBytes;
}
}

/* make a copy of CIcon’s pixel and mask data */
{
short  slot;
short  i;
short  pixWidth;
short  pixBytes;
short  bitBytes;
short  height;

slot = gLastSpriteSlot + 1;
if (slot == kMaxSprites)
slot = 0;
while (gSpriteInfo[slot].status != 0)
{
slot++;
if (slot == kMaxSprites)
slot = 0;
}
gSpriteInfo[slot].status = 1;/* occupied */
height = cIconP->iconPMap.bounds.bottom
- cIconP->iconPMap.bounds.top;
pixWidth = cIconP->iconPMap.bounds.right
- cIconP->iconPMap.bounds.left;
maskWidth = (pixWidth + 7) >> 3;
gSpriteInfo[slot].width = pixWidth;
gSpriteInfo[slot].height = height;
pixBytes = cIconP->iconPMap.rowBytes & 0x7fff;
bitBytes = cIconP->iconBMap.rowBytes;
+ bitBytes * height
+ 256 * 8 + 8;  /* 8-bit color table */

pixWidth = pixWidth >> 2;
for (i = 0; i < height; i++)
{
{
register long *q = (long *) pixDstAddr;
register long *p = (long *) pixSrcAddr;
register short  j = pixWidth;
while (j > 0)
{
*q++ = *p++;
j--;
}
}
}

if (gLastSpriteSlot >= 0)
{
gSpriteInfo[gLastSpriteSlot].nextSlot = slot;
}
else
{
gFirstSpriteSlot = slot;
}
gLastSpriteSlot = slot;
gSpriteInfo[slot].nextSlot = -1;
gSpriteInfo[slot].position = startPt;
gSpriteInfo[slot].lastPosition = startPt;
gSpriteCount ++;
return slot;
}

EraseSprite
/* replace sprite with chunk from the bkg gworld */
static void EraseSprite(SpriteInfoPtr spriteInfoP)
{
short  numRows;
short  numCols;
register long *p;
register long *q;
short  h, v;
register long srcRowBytes;
register long dstRowBytes;

numRows = spriteInfoP->height;
numCols = spriteInfoP->width;
h = spriteInfoP->lastPosition.h;
v = spriteInfoP->lastPosition.v;
if (h + numCols <= 0 || h >= gWindowWidth
|| v + numRows <= 0 || v >= gWindowHeight)
return;/* totally offscreen, so skip it */

p = (long *) (gBkgRowAddr[v] + h);
q = (long *) (gOnDeckRowAddr[v] + h);
srcRowBytes = gBkgRowBytes - numCols;
dstRowBytes = gOnDeckRowBytes - numCols;
if (numCols >= 16)
if (numCols == 32)
{
while (numRows != 0)
{
numRows--;
*q++ = *p++;
*q++ = *p++;
*q++ = *p++;
*q++ = *p++;
*q++ = *p++;
*q++ = *p++;
*q++ = *p++;
*q++ = *p++;
p = (long *) (((Ptr) p) + srcRowBytes);
q = (long *) (((Ptr) q) + dstRowBytes);
}
}
else
{
while (numRows != 0)
{
numRows--;
*q++ = *p++;
*q++ = *p++;
*q++ = *p++;
*q++ = *p++;
p = (long *) (((Ptr) p) + srcRowBytes);
q = (long *) (((Ptr) q) + dstRowBytes);
}
}
else
{
if (numCols < 8)
while (numRows != 0)
{
numRows--;
*q = *p;
p = (long *) (((Ptr) p) + gBkgRowBytes);
q = (long *) (((Ptr) q) + gOnDeckRowBytes);
}
else /* erase 4 pixels, even if its smaller */
while (numRows != 0)
{
numRows--;
*q++ = *p++;
*q++ = *p++;
p = (long *) (((Ptr) p) + srcRowBytes);
q = (long *) (((Ptr) q) + dstRowBytes);
}
}
}

DeleteSprite

/* Don’t actually do the delete, just mark for deletion -- because we still
need to erase it in UpdateScreen()
*/
void DeleteSprite(short spriteID)
{
gSpriteInfo[spriteID].status = -1;/* to be deleted */
gDeletionCount++;
}

RemoveDeletedSprites
/* only called when there is at least one deletion */
static void RemoveDeletedSprites(void)
{
short  prevSlot = -1;
short  slot = gFirstSpriteSlot;
short  count = gDeletionCount;

while (1)
{
if (gSpriteInfo[slot].status < 0)
{/* needs to be removed */
if (prevSlot >= 0)
gSpriteInfo[prevSlot].nextSlot
= gSpriteInfo[slot].nextSlot;
else
gFirstSpriteSlot
= gSpriteInfo[slot].nextSlot;
if (slot == gLastSpriteSlot)
gLastSpriteSlot = prevSlot;
gSpriteInfo[slot].status = 0;/* available */
gSpriteCount--;
count--;
if (count == 0)
break;
}
else
{
prevSlot = slot;
}
slot = gSpriteInfo[slot].nextSlot;
}
gDeletionCount = 0;
}

MoveSprite
void MoveSprite(short spriteID, Point deltaPt)
{
gSpriteInfo[spriteID].position.h += deltaPt.h;
gSpriteInfo[spriteID].position.v += deltaPt.v;
}

EraseOldSprites
static void EraseOldSprites(void)
{
short  slot;
SpriteInfoPtr spriteInfoP;

slot = gFirstSpriteSlot;
while (slot >= 0)
{
spriteInfoP = &gSpriteInfo[slot];
EraseSprite(spriteInfoP);
slot = spriteInfoP->nextSlot;
}

}

COPY4
/* copy 4 pixels based on bits of the mask */
#define COPY4(q,p,m) \
switch ((m) & 0x0f)\
{ \
case 0x0: break;\
case 0x1: *(q+3) = *(p+3); break; \
case 0x2: *(q+2) = *(p+2); break; \
case 0x3: *(short*)(q+2) = *(short*)(p+2); break; \
case 0x4: *(q+1) = *(p+1); break; \
case 0x5: *(q+1) = *(p+1); *(q+3) = *(p+3); break;      \
case 0x6: *(short*)(q+1) = *(short*)(p+1); break; \
case 0x7: *(q+1) = *(p+1); \
*(short*)(q+2) = *(short*)(p+2); break;   \
case 0x8: *(q) = *(p); break;\
case 0x9: *(q) = *(p); *(q+3) = *(p+3); break;    \
case 0xA: *(q) = *(p); *(q+2) = *(p+2); break;    \
case 0xB: *(q) = *(p);   \
*(short*)(q+2) = *(short*)(p+2); break;   \
case 0xC: *(short*)(q) = *(short*)(p); break;     \
case 0xD: *(short*)(q) = *(short*)(p);\
*(q+3) = *(p+3); break;\
case 0xE: *(short*)(q) = *(short*)(p);\
*(q+2) = *(p+2); break;\
case 0xF: *(long*)(q) = *(long*)(p); break; \
}

COPY8
COPY4(q, p, mask >> 4)   \

DrawSprite
static void DrawSprite(short slot)
{
SpriteInfoPtr spriteInfoP;
short  numRows;
short  numCols;
register Ptr  p;
register Ptr  q;
short  srcRowBytes;
short  h, v;
short  i;
long   dstRowBytes;

spriteInfoP = &gSpriteInfo[slot];
h = spriteInfoP->position.h;
v = spriteInfoP->position.v;
numRows = spriteInfoP->height;
numCols = spriteInfoP->width;
p = (char *) &gSpritePixData[slot];

if (numCols >= 8)
{
srcRowBytes = 40 - numCols;
dstRowBytes = gOnDeckRowBytes - numCols + 8;
while (1)
{
while (1)
{
if (--i == 0)
break;
p += 8;
q += 8;
}
if (--numRows == 0)
break;
p += srcRowBytes;
q += dstRowBytes;
}
}
else
{
while (1)
{
if (--numRows == 0)
break;
p += 32;
q += gOnDeckRowBytes;
}
}
}

DrawNewSprites
static void DrawNewSprites(void)
{
register short  slot;
SpriteInfoPtr spriteInfoP;

slot = gFirstSpriteSlot;
while (slot >= 0)
{
register short  numRows;
register short  numCols;
register short  h;
register short  v;

spriteInfoP = &gSpriteInfo[slot];
if (spriteInfoP->status < 0)
goto nextSlot;  /* deleted, so skip it */
numRows = spriteInfoP->height;
numCols = spriteInfoP->width;
h = spriteInfoP->position.h;
v = spriteInfoP->position.v;
if (h + numCols <= 0 || h >= gWindowWidth
|| v + numRows <= 0 || v >= gWindowHeight)
goto nextSlot;  /* totally offscreen */

DrawSprite(slot);
nextSlot:
slot = spriteInfoP->nextSlot;
}
}

FastCopyChunk
/* count is a multiple of 4 in the range [4..44] */
static void FastCopyChunk(long *q, long *p,
short count, short rows)
{
register short  srcRowBytes;
register short  dstRowBytes;
register short  rowsLeft = rows;
register short  copy8 = count & 8;
register short  copy4 = count & 4;

srcRowBytes = gOnDeckRowBytes - count;
dstRowBytes = gScreenRowBytes - count;
if (count & 32)
{
while (rowsLeft > 0)
{
rowsLeft--;
*q++ = *p++;
*q++ = *p++;
*q++ = *p++;
*q++ = *p++;
*q++ = *p++;
*q++ = *p++;
*q++ = *p++;
*q++ = *p++;
if (copy8)
{
*q++ = *p++;
*q++ = *p++;
}
if (copy4)
*q++ = *p++;
p = (long *) (((Ptr) p) + srcRowBytes);
q = (long *) (((Ptr) q) + dstRowBytes);
}
}
else if (count & 16)
{
while (rowsLeft > 0)
{
rowsLeft--;
*q++ = *p++;
*q++ = *p++;
*q++ = *p++;
*q++ = *p++;
if (copy8)
{
*q++ = *p++;
*q++ = *p++;
}
if (copy4)
*q++ = *p++;
p = (long *) (((Ptr) p) + srcRowBytes);
q = (long *) (((Ptr) q) + dstRowBytes);
}
}
else
{
while (rowsLeft > 0)
{
rowsLeft--;
if (copy8)
{
*q++ = *p++;
*q++ = *p++;
}
if (copy4)
*q++ = *p++;
p = (long *) (((Ptr) p) + srcRowBytes);
q = (long *) (((Ptr) q) + dstRowBytes);
}
}
}

DrawNewSpritesToScreen

/* Here we do have to watch out for sprites that overlap the edges of the window.  We copy a rectangluar
region that includes the sprites previous and current positions.  We know they will be close sionce sprites
move at most 8 pixels per turn.
*/
static void DrawNewSpritesToScreen(void)
{
short  slot;
SpriteInfoPtr spriteInfoP;
short  numRows;
short  numCols;
register long   *p;
register long   *q;
short  hStart, hEnd;
short  vStart, vEnd;

slot = gFirstSpriteSlot;
while (slot >= 0)
{
spriteInfoP = &gSpriteInfo[slot];
numRows = spriteInfoP->height;
numCols = spriteInfoP->width;
if (spriteInfoP->position.h
< spriteInfoP->lastPosition.h)
{
hStart = spriteInfoP->position.h;
hEnd = spriteInfoP->lastPosition.h + numCols;
}
else
{
hStart = spriteInfoP->lastPosition.h;
hEnd = spriteInfoP->position.h + numCols;
}
if (hStart < 0)
hStart = 0;
else if (hEnd > gWindowWidth)
hEnd = gWindowWidth;
if (spriteInfoP->position.v
< spriteInfoP->lastPosition.v)
{
vStart = spriteInfoP->position.v;
vEnd = spriteInfoP->lastPosition.v + numRows;
}
else
{
vStart = spriteInfoP->lastPosition.v;
vEnd = spriteInfoP->position.v + numRows;
}
if (vStart < 0)
vStart = 0;
else if (vEnd > gWindowHeight)
vEnd = gWindowHeight;
hStart = hStart & -4;  /* make it a mult of 4 */
hEnd = (hEnd + 3) & -4;  /* make it a mult of 4 */

p = (long *) (gOnDeckRowAddr[vStart] + hStart);
q = (long *) (gScreenRowAddr[vStart] + hStart);

vEnd -= vStart; /* now it’s a count */
hEnd -= hStart; /* now it’s a count */
if (hEnd >= 0)
FastCopyChunk(q, p, hEnd, vEnd);

spriteInfoP->lastPosition = spriteInfoP->position;
slot = spriteInfoP->nextSlot;
}
}

{
EraseOldSprites();
DrawNewSprites();
DrawNewSpritesToScreen();
if (gDeletionCount != 0)
RemoveDeletedSprites();
}
```

Community Search:
MacTech Search:

Box Sync 4.0.6567 - Online synchronizati...
Box Sync gives you a hard-drive in the Cloud for online storage. Note: You must first sign up to use Box. What if the files you need are on your laptop -- but you're on the road with your iPhone? No... Read more
Carbon Copy Cloner 4.1.4 - 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
OmniGraffle Pro 6.3.1 - Create diagrams,...
OmniGraffle Pro helps you draw beautiful diagrams, family trees, flow charts, org charts, layouts, and (mathematically speaking) any other directed or non-directed graphs. We've had people use... Read more
Monosnap 3.1.2 - Versatile screenshot ut...
Monosnap lets you capture screenshots, share files, and record video and .gifs! Capture: Capture full screen, just part of the screen, or a selected window Make your crop area pixel perfect with... Read more
Alfred 2.7.2 - Quick launcher for apps a...
Alfred is an award-winning productivity application for OS X. Alfred saves you time when you search for files online or on your Mac. Be more productive with hotkeys, keywords, and file actions at... Read more
Microsoft Remote Desktop 8.0.19 - Connec...
With Microsoft Remote Desktop, you can connect to a remote PC and your work resources from almost anywhere. Experience the power of Windows with RemoteFX in a Remote Desktop client designed to help... Read more
OmniGraffle 6.3 - Create diagrams, flow...
OmniGraffle helps you draw beautiful diagrams, family trees, flow charts, org charts, layouts, and (mathematically speaking) any other directed or non-directed graphs. We've had people use Graffle to... Read more
PDFKey Pro 4.3.2 - Edit and print passwo...
PDFKey Pro can unlock PDF documents protected for printing and copying when you've forgotten your password. It can now also protect your PDF files with a password to prevent unauthorized access and/... Read more
Ableton Live 9.2.2 - Record music using...
Ableton Live lets you create and record music on your Mac. Use digital instruments, pre-recorded sounds, and sampled loops to arrange, produce, and perform your music like never before. Ableton Live... Read more
Macs Fan Control 1.3.1.0 - Monitor and c...
Macs Fan Control allows you to monitor and control almost any aspect of your computer's fans, with support for controlling fan speed, temperature sensors pane, menu-bar icon, and autostart with... Read more

## Latest Forum Discussions

This Week at 148Apps: August 24-28, 2015
The Apps of August With 148Apps How do you know what apps are worth your time and money? Just look to the review team at 148Apps. We sort through the chaos and find the apps you're looking for. The ones we love become Editor’s Choice, standing out... | Read more »
NASCAR in Real Racing 3? Sure, Why Not?
I have to give Firemonkeys credit - it's very cool of them to add NASCAR to Real Racing 3 via an update rather than making a separate game for it. But that's a different discussion for another time; for now let's sit back and enjoy driving in... | Read more »
The nuyu is an Inexpensive Activity Moni...
Today, Health o Meter nuyu has announced a series of health and fitness-related products, including the aforementioned activity monitor along with a wireless scale. All at a decent pricepoint, no less. [Read more] | Read more »
The Makers of Overkill are Trying Someth...
Craneballs, the studio responsible for the Overkill series, is taking a little break from all that violence (a little break) to bring us Cube Worm - a 3D take on one of the most classic PC/calculator games in existence. [Read more] | Read more »
The Sandbox Welcomes Cutethulu in its La...
Another month, another update to Pixowl's The Sandbox. This time players can say hello to "Cutethulu" - an adorable little rendition of perhaps the most well known (and infamous) of the Elder Gods. [Read more] | Read more »
ReBoard: Revolutionary Keyboard (Utilit...
ReBoard: Revolutionary Keyboard 1.0 Device: iOS Universal Category: Utilities Price: \$1.99, Version: 1.0 (iTunes) Description: Do everything within the keyboard without switching apps! If you are in WhatsApp, how do you schedule a... | Read more »
Tiny Empire (Games)
Tiny Empire 1.1.3 Device: iOS Universal Category: Games Price: \$2.99, Version: 1.1.3 (iTunes) Description: Launch cannonballs and blow tiny orcs into thousands of pieces in this intuitive fantasy-themed puzzle shooter! Embark on an... | Read more »
Astropad Mini 1.0 Device: iOS iPhone Category: Productivity Price: \$4.99, Version: 1.0 (iTunes) Description: *** 50% off introductory price! ​*** Get the high-end experience of a Wacom tablet at a fraction of the price with Astropad... | Read more »
Emo Chorus (Music)
Emo Chorus 1.0.0 Device: iOS Universal Category: Music Price: \$1.99, Version: 1.0.0 (iTunes) Description: Realistic Choir simulator ranging from simple Chorus emulation to full ensemble Choir with 128 members. ### introductory offer... | Read more »
Forest Spirit (Games)
Forest Spirit 1.0.5 Device: iOS Universal Category: Games Price: \$2.99, Version: 1.0.5 (iTunes) Description: | Read more »

## Price Scanner via MacPrices.net

San Francisco’s WaterField Designs today unveiled their all-leather Cozmo 2.0 — an elegant attach laptop bag with carefully-designed features to suit any business environment. The Cozmo 2.0 is... Read more
Apple’s 2015 Back to School promotion: Free B...
Purchase a new Mac or iPad at The Apple Store for Education and take up to \$300 off MSRP. All teachers, students, and staff of any educational institution qualify for the discount. Shipping is free,... Read more
128GB MacBook Airs on sale for \$100 off MSRP,...
B&H Photo has 11″ & 13″ MacBook Airs with 128GB SSDs on sale for \$100 off MSRP. Shipping is free, and B&H charges NY sales tax only: - 11″ 1.6GHz/128GB MacBook Air: \$799.99, \$100 off MSRP... Read more
13-inch 2.5GHz MacBook Pro (refurbished) avai...
The Apple Store has Apple Certified Refurbished 13″ 2.5GHz MacBook Pros available for \$829, or \$270 off the cost of new models. Apple’s one-year warranty is standard, and shipping is free: - 13″ 2.... Read more
27-inch 3.2GHz iMac on sale for \$1679, save \$...
B&H Photo has the 27″ 3.2GHz iMac on sale for \$1679.99 including free shipping plus NY sales tax only. Their price is \$120 off MSRP. Read more
Apple and Cisco Partner to Deliver Fast-Lane...
Apple and Cisco have announced a partnership to create a “fast lane” for iOS business users by optimizing Cisco networks for iOS devices and apps. The alliance integrates iPhone with Cisco enterprise... Read more
Apple offering refurbished 2015 13-inch Retin...
The Apple Store is offering Apple Certified Refurbished 2015 13″ Retina MacBook Pros for up to \$270 (15%) off the cost of new models. An Apple one-year warranty is included with each model, and... Read more
Apple refurbished 2015 MacBook Airs available...
The Apple Store has Apple Certified Refurbished 2015 11″ and 13″ MacBook Airs (the latest models), available for up to \$180 off the cost of new models. An Apple one-year warranty is included with... Read more
21-inch iMacs on sale for up to \$120 off MSRP
B&H Photo has 21″ iMacs on sale for up to \$120 off MSRP including free shipping plus NY sales tax only: - 21″ 1.4GHz iMac: \$999.99 \$100 off - 21″ 2.7GHz iMac: \$1199.99 \$100 off - 21″ 2.9GHz iMac... Read more
5K iMacs on sale for up to \$150 off MSRP, fre...
B&H Photo has the 27″ 3.3GHz 5K iMac on sale for \$1899.99 including free shipping plus NY tax only. Their price is \$100 off MSRP. They have the 27″ 3.5GHz 5K iMac on sale for \$2149.99 \$2199.99, \$... Read more

## Jobs Board

*Apple* Evangelist - JAMF Software (United S...
The Apple Evangelist is responsible for building and cultivating strategic relationships with Apple 's small and mid-market business development field teams. This Read more
*Apple* Retail - Multiple Positions (US) - A...
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
*Apple* Desktop Analyst - KDS Staffing (Unit...
…field and consistent professional recruiting achievement. Job Description: Title: Apple Desktop AnalystPosition Type: Full-time PermanentLocation: White Plains, NYHot Read more
*Apple* Systems Engineer (Mclean, VA and NYC...
Title: Apple Systems Engineer (Mclean, VA and NYC) Location: United States-New York-New York-200 Park Ave (22005) Other Locations: United States-Virginia-Vienna-Towers Read more
*Apple* Systems Engineer (Mclean, VA and NYC...
…Assist in providing strategic direction and technical leadership within the Apple portfolio, including desktops, laptops, and printing environment. This person will Read more