TweetFollow Us on Twitter

Jun 95 Challenge
Volume Number:11
Issue Number:6
Column Tag:Programmer’s Challenge

Programmer’s Challenge

By Bob Boonstra and Mike Scanlin

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

Goodbye From Mike

This month is a special month. I have decided to turn the Programmer Challenge over to Bob Boonstra. Readers of this column will recognize Bob’s name from his many excellent winning solutions to the Challenges I’ve posed. In fact, Bob is the proud owner of six 1st-place showings. I can think of no-one I’d rather turn this column over to than Bob. I will judge the last two puzzles I have posed and Bob will judge the puzzles he poses (the first of which, Check Checkmate, is in this issue).

It’s been almost three years since I first started this column. While it has been incredibly rewarding to see so much optimal code and meet so many like-minded efficiency nuts, my life has changed during those three years and I no longer have the time that this column deserves. Even though I won't be writing it any more I'm sure this column will remain my favorite part of MacTech (I may even submit an entry once in a while...).

Thanks to everyone who took the time to write to me over the years with suggestions for Challenges. I have given Bob the compiled list of ideas. I’m sure he’d love to hear from you if you have any other ideas or comments on what you want to see in this column. I leave you in Bob’s capable hands...

Optimally yours,

Mike Scanlin
scanlin@genmagic.com

Check Checkmate

This month’s Challenge deals with the game of chess. You will be given a chess position and asked to produce the list of moves and captures that it is legal for one of the sides to make in accordance with the rules of chess. The objective is to produce the legal move list in minimum time.

Here are the prototypes for the routines you should write:

typedef enum {rowA=0,rowB,rowC,rowD,rowE,rowF,rowG,rowH} Row;
typedef enum {col1=0,col2,col3,col4,col5,col6,col7,col8} Col;
typedef enum {whiteSide=0,blackSide} Side;
typedef enum {king=0,queen,rook,bishop,knight,pawn} ChessPiece ;

typedef struct Square {
 Row row;
 Col col;
} Square;

typedef struct PiecePosition {
 Square sq;
 Side side;
 ChessPiece piece;
} PiecePosition;

typedef struct ChessMove {
 Square fromSq;
 Square toSq;
 Boolean moveIsCapture;
 Boolean opponentPlacedInCheck;
} ChessMove;

short /*numberOfMoves*/ LegalChessMoves(
 PiecePosition piecePositionArray[],
 short numberOfPieces,
 Side sideToMove,
 ChessMove legalMoveArray[],
 void *privateDataPtr
);

void InitChess(void *privateDataPtr);

This Challenge will consist of one call to InitChess, followed by multiple calls to LegalChessMoves. The InitChess routine will not be timed, and may initialize up to 32K bytes of storage preallocated by my testbench and pointed to by privateDataPtr. Your program should not use any static storage besides that pointed to by privateDataPtr.

Each call to LegalChessMoves will provide a piecePositionArray containing numberOfPieces chess pieces. Each piece is described in a PiecePosition struct containing the ChessPiece, Side, and position. The position is provided as a Square struct containing a Row and a Col, where rowA represents the starting row for the White major pieces, and rowH the starting row for Black. The columns are numbered from left to right as viewed from the White side, so that (rowH, col4) is the starting square of the Black queen in a new game. The piecePositionArray will describe a legal set of chess piece positions, anything from the initial positions in a new game to an end-game position. No position will be provided that could not be reached during a chess game. Remember that due to past pawn promotions, a side may have (for example) more than one queen. You should generate the moves for the side provided in sideToMove. The privateDataPtr parameter will be the same pointer provided to InitChess.

LegalChessMoves should store in legalMoveArray the complete list of legal ChessMoves for the sideToMove. The legalMoveArray will be allocated by my testbench and will be large enough to hold all of the legal moves for the given chess position. You should describe each legal move/capture by placing the row/col location of the moving piece in fromSq and the rol/col of the destination in toSq. In addition, for each move, the Boolean moveIsCapture should be set to true if the move captures an opponent's piece (and set to false otherwise). Similarly, the Boolean opponentPlacedInCheck should be set to true if the move places the opponent in check (and set to false otherwise). The return value of the function should be the number of moves stored in legalMoveArray. In generating the list of legal moves, you should assume that castling moves or en passant pawn captures cannot occur. Remember that it is not legal to make a chess move which places or leaves the moving side's king in check. If the sideToMove has been checkmated and cannot move, LegalChessMoves should return zero.

This month brings one change to the rules of the contest. From now on, with apologies (and sympathies) to any MacPlus users still out there, the 68020 code generation option will be turned ON. This Challenge will be scored using the THINK C compiler and 68K instruction set, but future Challenges will include occasional use of the CodeWarrior compiler and/or the PowerPC instruction set. This month, you should also include the following pragmas in your code:

#pragma options (mc68020, !mc68881, require_protos)
#pragma options (pack_enums, align_arrays)

Have fun, and e-mail me if there are any questions.

Two Months Ago Winner

I guess most people spent the beginning of April working on their taxes instead of the Stock Market Database Challenge because I only received 3 entries. Of those, only two worked correctly. Despite the lack of competition, I’m happy to say that the winning solution is quite good. Congratulations to Xan Gregg (Durham, NC) for his efficient solution. And thanks to Ernst Munter for taking the time to enter. Ernst was at a bit of a disadvantage, considering he had to develop his code on a DOS-based machine that didn’t have the RAM or disk space specified in the problem.

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

Name time code

Xan Gregg (4) 3523 1766

Ernst Munter (53) 61714 3470

The key to implementing a fast database where not everything fits into RAM is to have fast RAM-based indexes to your disk-based data and to minimize disk accesses. Also, for those times when you do read/write to the disk it’s really important to do it in even sector amounts. Xan uses 8K reads/writes. Sectors on most devices are 512 bytes each so 8K is a good choice. If your application ever needs to swap data to disk then you should study Xan’s code. It could save your users a lot of time.

Top 20 Contestants Of All Time

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

1. Boonstra, Bob 176

2. Karsh, Bill 71

3. Stenger, Allen 65

4. Munter, Ernst 63

5. Larsson, Gustav 60

6. Riha, Stepan 51

7. Goebel, James 49

8. Cutts, Kevin 46

9. Nepsund, Ronald 40

10. Vineyard, Jeremy 40

11. Darrah, Dave 34

12. Mallett, Jeff 34

13. Landry, Larry 29

14. Elwertowski, Tom 24

15. Gregg, Xan 24

16. Kasparian, Raffi 24

17. Lee, Johnny 22

18. Anderson, Troy 20

19. Burgoyne, Nick 20

20. Galway, Will 20

21. Israelson, Steve 20

22. Landweber, Greg 20

23. Noll, Bob 20

24. Pinkerton, Tom 20

There are three ways to earn points: (1) by scoring in the top 5 of any challenge, (2) by 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 5 points

suggesting challenge 2 points

Here is Xan’s winning solution:

#include <OSUtils.h>
#include <Memory.h>
#include <Files.h>

/* OVERVIEW  market.c - by Xan Gregg
I cache all symbol names in memory and as many blocks
of trade data from disk as possible are cached in the rest
of the allowed memory.  For each symbol I keep a “pointer”
(block# and entry#) to the most recent trade involving that
symbol.  Each trade points to the previous trade of that
symbol.

The header includes an array of 26K entries in which each
entry points to a list of symbols.  All symbols with the
same first three letters are on the same list.  So the array
of symbol lists is indexed by the first three letters.

The trade data are stored on disk as a summary of the trade
information passed to NewTrade().  The time is stored in
a long, and the volume is stored as a daily cummulative
value.  The data is accumulated into a 8K block which
is written to disk when it gets full.

I know that there will be under 500,000 trades (since
the trade is at most 10MB and each Trade struct is 22
bytes).  And I have been told there will be about 10,000
symbols and at most 16K.  So that puts each symbol at
an average of 50 trades each.  That’s good for my approach
of indexing by the symbol name.  However, since I iterate
through the list of trades in reverse order, I am at a
disadvantage if a lot of older data is requested.

*/

typedef unsigned char uchar;
typedef unsigned short  ushort;
typedef unsigned long ulong;

typedef struct TimeStamp {
 uchar  yearsFrom1900;
 uchar  month;
 uchar  day;
 uchar  hour;
 uchar  minute;
 uchar  second;
} TimeStamp;

typedef char Str7[8];

typedef struct Trade {
 Str7   symbol;
 TimeStamptime;
 Fixed  price;
 ulong  numShares;
} Trade;

void *InitTradeDatabase(ulong maxRAM);
void NewTrade(void *privateDataPtr, Trade trade);
Fixed PriceIs(void *privateDataPtr, Str7 symbol, TimeStamp time);
ulong VolumeIs(void *privateDataPtr, Str7 symbol, TimeStamp time);

#define kBlockSize  8192L
#define kBlockEntries   (kBlockSize/16)
#define kFileSize   (8*1024L*1024L)
                /* enough to store 500,000 trades */
#define kNumBlocks  1024L

#define kNumSymbolIndices (26*32*32L)
#define kSecondsPerDay  (60L*60L*24)

typedef struct SymbolEntry SymbolEntry;

struct SymbolEntry
 {
    long        restOfSymbol;   /* last 4 chars */
    SymbolEntry *next;          /* with same 1st 3 chars */
    short       latestBlockNum; /* location on disk */
    short       latestEntryNum; /* location with block */
 };

/* 16-byte struct stored on disk for each trade */
typedef struct
 {
    ulong   seconds;      /* seconds since 1904 */
    Fixed   price;        /* same as from Trade record */
    ulong   totalShares;  /* current and previous */
    short   prevBlockNum;
    short   prevEntryNum;
 } TradeSummary;

typedef struct
 {
    TradeSummary data[kBlockEntries];
    short      blockNum;   /* where it is on disk */
    short   filler;
 } CachedBlock;

typedef struct
 {
    CachedBlock  *blockLocation[kNumBlocks]; /* 4KB */
    Ptr          symbolDataEnd;
    CachedBlock  *lowestBlockP;
    CachedBlock  *highestBlockP;
    CachedBlock  *oldestBlockP;
    CachedBlock  *currentOutBlockP;
    short        currentEntryNum;
    short        refNum;
    ParamBlockRec pb;
    ushort       symbolIndex[kNumSymbolIndices]; /* 26KB */
    SymbolEntry  symbols[1]; /* variable length */
 } Header;

/* the above struct takes less than 32K, and the
symbol data takes less than 192K (assuming a max of
16K symbols), so the cached blocks can use everything
after the first 224K */

#define gBlockLocation      dataP->blockLocation
#define gSymbolDataEnd      dataP->symbolDataEnd
#define gLowestBlockP       dataP->lowestBlockP
#define gHighestBlockP      dataP->highestBlockP
#define gOldestBlockP       dataP->oldestBlockP
#define gCurrentOutBlockP   dataP->currentOutBlockP
#define gCurrentEntryNum    dataP->currentEntryNum
#define gRefNum             dataP->refNum
#define gPB                 dataP->pb
#define gSymbolIndex        dataP->symbolIndex
#define gSymbols            dataP->symbols


void *InitTradeDatabase(ulong maxRAM)
{
    Header      *dataP;
    CachedBlock *blockP;

    maxRAM = maxRAM & -4L;  /* make sure end is aligned */
    dataP = (Header *) NewPtrClear(maxRAM);
    if (dataP == 0)
        DebugStr(“\p NO MEM”);

    /* skip the first symbol as 0 is not a valid index */
    gSymbolDataEnd = (Ptr) (gSymbols + 1);

    /* Initialize memory blocks at end of data area. */
    blockP = (CachedBlock *) (((Ptr) dataP) + maxRAM);
    gCurrentOutBlockP = blockP - 1;
    /* leaving 224K for headers and symbols */
    while ((Ptr) (blockP - 1) > ((Ptr) dataP) + 224*1024L)
     {
        blockP-;
        blockP->blockNum = -1;
     }
    gLowestBlockP = blockP;
    gHighestBlockP = gCurrentOutBlockP;
    gOldestBlockP = gHighestBlockP - 1;
    gCurrentOutBlockP->blockNum = 0;
    gBlockLocation[0] = gCurrentOutBlockP;

    { /* create swap file */
    OSErr   err;
    long    size;
    err = Create(“\pXansSwapFile”, 0, ‘xxxx’, ‘DATA’);
    if (err)
     {
        FSDelete(“\pXansSwapFile”, 0);
        err = Create(“\pXansSwapFile”, 0, ‘xxxx’, ‘DATA’);
        if (err)
            DebugStr(“\p NO FILE”);
     }
    FSOpen(“\pXansSwapFile”, 0, &gRefNum);
    if (gRefNum == 0)
        DebugStr(“\p NO FILE”);
    size = kFileSize;
    err = AllocContig(gRefNum, &size);
    size = kFileSize;
    if (err)
        err = Allocate(gRefNum, &size);
    if (err)
        DebugStr(“\p NO FILE”);
    SetEOF(gRefNum, kFileSize);
    }
    return (void *) dataP;
}


/* Take a chance and use OS trap here.  If assembly
were allowed could at least cache the address of the
code and call it with a function pointer instead of
through a trap, or we could just write this whole
routine is assembly.
*/
ulong timeToSeconds(TimeStamp *timeP)
{
    DateTimeRec dateTime;
    ulong       seconds;

    dateTime.year = 1900 + timeP->yearsFrom1900;
    dateTime.month = timeP->month;
    dateTime.day = timeP->day;
    dateTime.hour = timeP->hour;
    dateTime.minute = timeP->minute;
    dateTime.second = timeP->second;
    Date2Secs(&dateTime, &seconds);
    return seconds;
}


/* returns 0 if the symbol was not found */
SymbolEntry *findSymbolEntry(Header *dataP, Str7 symbol)
{
    register long           rest;
    register SymbolEntry    *symbolP;
    long        memRest;
    short       keyIndex;
    char        secondChar;
    char        thirdChar;
    char        *p;
    short       len = symbol[0];

        /* figure the keyIndex (first three letters) */
    if (len < 2)
     {
        secondChar = 0;
        thirdChar = 0;
     }
    else
     {
        secondChar = symbol[2] - ‘@’;
        if (len != 2)
            thirdChar = symbol[3] - ‘@’;
        else
            thirdChar = 0;
     }
    keyIndex = ((symbol[1] - ‘A’) << 10)
                        | (secondChar << 5) | thirdChar;

    /* and the ‘rest’ (last four letters) */
    memRest = 0;
    p = (char *) &memRest;
    while (len > 3)
        *p++ = symbol[len-];

    rest = memRest;
    if (gSymbolIndex[keyIndex] == 0)
        symbolP = 0;
    else
     {
        symbolP = &gSymbols[gSymbolIndex[keyIndex]];
        while ((symbolP != 0)
                 && (symbolP->restOfSymbol != rest))
            symbolP = symbolP->next;
     }
    return symbolP;
}


/* like findSymbol, but inserts it if necessary */
SymbolEntry *findInsertSymbolEntry(Header *dataP,
                                        Str7 symbol)
{
    register long           rest;
    register SymbolEntry    *symbolP;
    long        memRest;
    short       keyIndex;
    char        secondChar;
    char        thirdChar;
    char        *p;
    short       len = symbol[0];

    /* figure the keyIndex (first three letters) */
    if (len < 2)
     {
        secondChar = 0;
        thirdChar = 0;
     }
    else
     {
        secondChar = symbol[2] - ‘@’;
        if (len != 2)
            thirdChar = symbol[3] - ‘@’;
        else
            thirdChar = 0;
     }
    keyIndex = ((symbol[1] - ‘A’) << 10)
                     | (secondChar << 5) | thirdChar;

    /* and the ‘rest’ (last four letters) */
    memRest = 0;
    p = (char *) &memRest;
    while (len > 3)
        *p++ = symbol[len-];

    rest = memRest;
    if (gSymbolIndex[keyIndex] == 0)
     {  /* this is the first symbol with this key */
        symbolP = (SymbolEntry *) gSymbolDataEnd;
        gSymbolIndex[keyIndex] =
                            (ushort) (symbolP - gSymbols);
        gSymbolDataEnd += sizeof(SymbolEntry);
        symbolP->restOfSymbol = rest;
        symbolP->next = 0;
        symbolP->latestBlockNum = -1;
     }
    else
     {  /* search the list for our last four letters */
        symbolP = &gSymbols[gSymbolIndex[keyIndex]];
        while ((symbolP->next != 0) &&
                    (symbolP->restOfSymbol != rest))
            symbolP = symbolP->next;
        if (symbolP->restOfSymbol != rest)
         {  /* not found so add it */
            symbolP->next = (SymbolEntry *) gSymbolDataEnd;
            symbolP = symbolP->next;
            gSymbolDataEnd += sizeof(SymbolEntry);
            symbolP->restOfSymbol = rest;
            symbolP->next = 0;
            symbolP->latestBlockNum = -1;
         }
     }
    return symbolP;
}

/* returns a pointer to a block in memory.  If the
block is not already in memory, it is loaded from disk. */
CachedBlock *getBlock(Header *dataP, short blockNum)
{
    CachedBlock     *blockP;
    ParamBlockRec   readPB;

    blockP = gBlockLocation[blockNum];
    if (blockP == 0)
     {  /* need to load it from disk */
        if (gOldestBlockP->blockNum >= 0)
            gBlockLocation[gOldestBlockP->blockNum] = 0;
        gOldestBlockP->blockNum = blockNum;
        readPB.ioParam.ioCompletion = 0;
        readPB.ioParam.ioRefNum = gRefNum;
        readPB.ioParam.ioBuffer = (Ptr) gOldestBlockP->data;
        readPB.ioParam.ioReqCount = kBlockSize;
        readPB.ioParam.ioPosMode = fsFromStart
                             | (1 << 5); /* don’t cache */
        readPB.ioParam.ioPosOffset = ((long) blockNum)
                                         * kBlockSize;
        PBRead(&readPB, true);
        gBlockLocation[blockNum] = gOldestBlockP;

        /* find the next oldest block */
        if (gOldestBlockP == gLowestBlockP)
            gOldestBlockP = gHighestBlockP;
        else
            gOldestBlockP-;
        if (gOldestBlockP == gCurrentOutBlockP)
            if (gOldestBlockP == gLowestBlockP)
                gOldestBlockP = gHighestBlockP;
            else
                gOldestBlockP-;
        if ((gPB.ioParam.ioResult > 0)
                && (((Ptr) gOldestBlockP->data)
                         == gPB.ioParam.ioBuffer))
            if (gOldestBlockP == gLowestBlockP)
                gOldestBlockP = gHighestBlockP;
            else
                gOldestBlockP-;
        if (gOldestBlockP == gCurrentOutBlockP)
            if (gOldestBlockP == gLowestBlockP)
                gOldestBlockP = gHighestBlockP;
            else
                gOldestBlockP-;
                     /* wait for read to complete */
        while (readPB.ioParam.ioResult > 0)
            ;
     }
    return blockP;
}


void writeCurrentBlock(Header *dataP)
{
    CachedBlock *p;

    /* make sure any previous write is done */
    while (gPB.ioParam.ioResult > 0)
        ;
    gPB.ioParam.ioRefNum = gRefNum;
    gPB.ioParam.ioBuffer = (Ptr) gCurrentOutBlockP->data;
    gPB.ioParam.ioReqCount = kBlockSize;
    gPB.ioParam.ioPosMode = fsFromStart;
    gPB.ioParam.ioPosOffset =
        ((long) gCurrentOutBlockP->blockNum) * kBlockSize;
    PBWrite(&gPB, true);

    /* find the next oldest block */
    p = gOldestBlockP;
    if (gOldestBlockP == gLowestBlockP)
        gOldestBlockP = gHighestBlockP;
    else
        gOldestBlockP-;
    if (gOldestBlockP == gCurrentOutBlockP)
        if (gOldestBlockP == gLowestBlockP)
            gOldestBlockP = gHighestBlockP;
        else
            gOldestBlockP-;
    gCurrentOutBlockP = p;
}


void NewTrade(void *privateP, Trade trade)
{
    Header          *dataP = (Header *) privateP;
    ulong           seconds;
    TradeSummary    *tradeP;
    SymbolEntry     *symbolP;

    seconds = timeToSeconds(&trade.time);

    if (gCurrentEntryNum == kBlockEntries)
     {  /* current block is full, so write it out */
        short   curBlockNum = gCurrentOutBlockP->blockNum;

        writeCurrentBlock(dataP);
        gCurrentEntryNum = 0;
        if (gCurrentOutBlockP->blockNum >= 0)
            gBlockLocation[gCurrentOutBlockP->blockNum] = 0;
        gCurrentOutBlockP->blockNum = curBlockNum + 1;
        gBlockLocation[gCurrentOutBlockP->blockNum] =
                                     gCurrentOutBlockP;
     }
    symbolP = findInsertSymbolEntry(dataP, trade.symbol);
    tradeP = &gCurrentOutBlockP->data[gCurrentEntryNum];
    tradeP->seconds = seconds;
    tradeP->price = trade.price;
    tradeP->totalShares = trade.numShares;
    if (symbolP->latestBlockNum >= 0)
     {
        CachedBlock *blockP;
        TradeSummary *prevTradeP;
        ulong       todaySeconds;

        todaySeconds = seconds - (seconds % kSecondsPerDay);
        blockP = getBlock(dataP, symbolP->latestBlockNum);
        prevTradeP = &blockP->data[symbolP->latestEntryNum];
        if (prevTradeP->seconds >= todaySeconds)
            tradeP->totalShares += prevTradeP->totalShares;
     }
    tradeP->prevBlockNum = symbolP->latestBlockNum;
    tradeP->prevEntryNum = symbolP->latestEntryNum;
    symbolP->latestBlockNum = gCurrentOutBlockP->blockNum;
    symbolP->latestEntryNum = gCurrentEntryNum;
    gCurrentEntryNum++;
}


Fixed PriceIs(void *privateP, Str7 symbol, TimeStamp time)
{
    Header      *dataP = (Header *) privateP;
    ulong       seconds;
    SymbolEntry *symbolP;

    seconds = timeToSeconds(&time);
    symbolP = findSymbolEntry(dataP, symbol);
    if (symbolP)
     {
        CachedBlock     *blockP;
        TradeSummary    *tradeP;

                    /* look for the most recent trade that is before
                         or on the requested time */
        blockP = getBlock(dataP, symbolP->latestBlockNum);
        tradeP = &blockP->data[symbolP->latestEntryNum];
        while (tradeP->seconds > seconds)
         {
            if (tradeP->prevBlockNum < 0)
                return 0;
            blockP = getBlock(dataP, tradeP->prevBlockNum);
            tradeP = &blockP->data[tradeP->prevEntryNum];
         }
        return tradeP->price;
     }
    else
        return 0;
}


ulong VolumeIs(void *privateP, Str7 symbol, TimeStamp time)
{
    Header      *dataP = (Header *) privateP;
    ulong       seconds;
    SymbolEntry *symbolP;
    ulong       todaySeconds;

    seconds = timeToSeconds(&time);
    todaySeconds = seconds - (seconds % kSecondsPerDay);
    symbolP = findSymbolEntry(dataP, symbol);
    if (symbolP)
     {
        CachedBlock     *blockP;
        TradeSummary    *tradeP;

                  /* look for the most recent trade that is before
             the requested time and on the same day */
        blockP = getBlock(dataP, symbolP->latestBlockNum);
        tradeP = &blockP->data[symbolP->latestEntryNum];
        while (tradeP->seconds >= seconds)
         {
            if (tradeP->prevBlockNum < 0)
                return 0;
            blockP = getBlock(dataP, tradeP->prevBlockNum);
            tradeP = &blockP->data[tradeP->prevEntryNum];
         }
        if (tradeP->seconds < todaySeconds)
            return 0;
        else
            return tradeP->totalShares;
     }
    else
        return 0;

}

 
AAPL
$524.94
Apple Inc.
+5.93
MSFT
$40.01
Microsoft Corpora
-0.39
GOOG
$536.10
Google Inc.
-20.44

MacTech Search:
Community Search:

Software Updates via MacUpdate

VMware Fusion 6.0.3 - Run Windows apps a...
VMware Fusion allows you to create a Virtual Machine on your Mac and run Windows (including Windows 8.1) and Windows software on your Mac. Run your favorite Windows applications alongside Mac... Read more
Tweetbot 1.5.1 - Popular iOS twitter cli...
Tweetbot is a full-featured OS X Twitter client with a lot of personality. Whether it's the meticulously-crafted interface, sounds and animation, or features like multiple timelines and column views... Read more
Mac DVDRipper Pro 4.1.7 - Copy, backup,...
Mac DVDRipper Pro is the DVD backup solution that lets you protect your DVDs from scratches, save your batteries by reading your movies from your hard disk, manage your collection with just a few... Read more
PDFpenPro 6.2 - Advanced PDF toolkit for...
PDFpenPro allows users to edit PDF's easily. Add text, images and signatures. Fill out PDF forms. Merge or split PDF documents. Reorder and delete pages. Even correct text and edit graphics! Create... Read more
PDFpen 6.2 - Edit and annotate PDFs with...
PDFpen allows users to easily edit PDF's. Add text, images and signatures. Fill out PDF forms. Merge or split PDF documents. Reorder and delete pages. Even correct text and edit graphics! Features... Read more
Monolingual 1.5.9 - Remove unwanted OS X...
Monolingual is a program for removing unnecesary language resources from OS X, in order to reclaim several hundred megabytes of disk space. It requires a 64-bit capable Intel-based Mac and at least... Read more
Maya 2015 - Professional 3D modeling and...
Maya is an award-winning software and powerful, integrated 3D modeling, animation, visual effects, and rendering solution. Because Maya is based on an open architecture, all your work can be scripted... Read more
Starcraft II: Wings of Liberty 1.1.1.180...
Download the patch by launching the Starcraft II game and downloading it through the Battle.net connection within the app. Starcraft II: Wings of Liberty is a strategy game played in real-time. You... Read more
Sibelius 7.5.0 - Music notation solution...
Sibelius is the world's best-selling music notation software for Mac. It is as intuitive to use as a pen, yet so powerful that it does most things in less than the blink of an eye. The demo includes... Read more
Typinator 5.9 - 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

Latest Forum Discussions

See All

Have a Special Dead Trigger 2 Easter Bas...
Have a Special Dead Trigger 2 Easter Basket Full of Goodies, Courtesy of Madfinger Games Posted by Rob Rich on April 18th, 2014 [ permalink ] Dead Trigger 2 | Read more »
Almost All of Playdek’s Library is on Sa...
Almost All of Playdek’s Library is on Sale Right Now, and You Should Check it Out Posted by Rob Rich on April 18th, 2014 [ permalink ] Playdek has released quite a few great iOS ports of board and card games over the years, and now most of them... | Read more »
Zynga Launches Brand New Farmville Exper...
Zynga Launches Brand New Farmville Experience with Farmville 2: Country Escape Posted by Tre Lawrence on April 18th, 2014 [ permalink ] | Read more »
David. Review
David. Review By Cata Modorcea on April 18th, 2014 Our Rating: :: MINIMALISTIC IN A DIFFERENT WAYUniversal App - Designed for iPhone and iPad David is a minimalistic game wrapped inside of a soothing atmosphere in which the hero... | Read more »
Eyefi Unveils New Eyefi Cloud Service Th...
Eyefi Unveils New Eyefi Cloud Service That Allows Users to Share Media Across Personal Devices Posted by Tre Lawrence on April 18th, 2014 [ permalink ] | Read more »
Tales from the Dragon Mountain: The Lair...
Tales from the Dragon Mountain: The Lair Review By Jennifer Allen on April 18th, 2014 Our Rating: :: STEADY ADVENTURINGiPad Only App - Designed for the iPad Treading a safe path, Tales from the Dragon Mountain: The Lair is a... | Read more »
Yahoo Updates Flickr App with Advanced E...
Yahoo Updates Flickr App with Advanced Editing Features and More Posted by Tre Lawrence on April 18th, 2014 [ permalink ] | Read more »
My Incredible Body - A Kid's App to...
My Incredible Body - A Kid's App to Learn about the Human Body 1.1.00 Device: iOS Universal Category: Education Price: $2.99, Version: 1.1.00 (iTunes) Description: Wouldn’t it be cool to look inside yourself and see what was going on... | Read more »
Trials Frontier Review
Trials Frontier Review By Carter Dotson on April 18th, 2014 Our Rating: :: A ROUGH LANDINGUniversal App - Designed for iPhone and iPad Trials Frontier finally brings the famed stunt racing franchise to mobile, but how much does its... | Read more »
Evernote Business Notebook by Moleskin I...
Evernote Business Notebook by Moleskin Introduced – Support Available in Evernote for iOS Posted by Tre Lawrence on April 18th, 2014 [ permalink ] | Read more »

Price Scanner via MacPrices.net

Free HopTo 2.2 Helps Enhance Your Productivit...
The HopTo app helps you do more on your iPad by providing more and easier adaccess to files and documents. Version 2.2 adds Egnyte and HopTo’s Mac OSX File Connector. If you already have the hopTo... Read more
National Distracted Driving Awareness Month:...
As the country recognizes National Distracted Driving Awareness Month, Sprint is reminding wireless consumers to focus on driving while behind the wheel, to not text or email while driving, and to... Read more
13-inch 2.4GHz Retina MacBook Pro available f...
Abt has the 13″ 2.4GHz 128GB Retina MacBook Pro available for $1229 including free shipping. Their price is $70 off MSRP. Read more
iMacs on sale for up to $160 off MSRP this we...
Best Buy has iMacs on sale for up to $160 off MSRP for a limited time. Choose free home shipping or free instant local store pickup (if available). Prices are valid for online orders only, in-store... Read more
iPad Airs on sale this weekend for up to $100...
Best Buy has WiFi iPad Airs on sale for $50 off MSRP and WiFi + Cellular iPad Airs on sale for $100 off MSRP on their online store for a limited time, with prices now starting at $449. Choose free... Read more
Apple restocks refurbished Mac minis starting...
The Apple Store has restocked Apple Certified Refurbished Mac minis for up to $150 off the cost of new models. Apple’s one-year warranty is included with each mini, and shipping is free: - 2.5GHz Mac... Read more
Hyundai Brings Apple CarPlay To The 2015 Sona...
Hyundai Motor America has announced it will bring Apple CarPlay functionality to the 2015 Sonata. CarPlay is pitched as a smarter, safer and easier way to use iPhone in the car and gives iPhone users... Read more
Updated iPads Coming Sooner Than We Had Thoug...
MacRumors, cites KGI securities analyst Ming Chi Kuo, well-respected as an Apple product prognisticator, saying that Apple will introduce an upgraded iPad Air and iPad mini in 2014/Q3, meaning the... Read more
Toshiba Unveils New High And Low End Laptop M...
Toshiba has announced new laptop models covering both the high-end and low-end of the notebook computer spectrum. Toshiba 4K Ultra HD Laptop Toshiba’s new Satellite P55t features one of the world’s... Read more
Save up to $270 with Apple refurbished 13-inc...
The Apple Store has Apple Certified Refurbished October 2013 13″ Retina MacBook Pros available starting at $1099, with models up to $270 off MSRP. Apple’s one-year warranty is standard, and shipping... Read more

Jobs Board

*Apple* Automotive Parts Department position...
Apple Automotive is one of the fastest growing dealer…and it shows. Consider making the switch to the Apple Automotive Group today! At Apple Automotive, we Read more
*Apple* Solutions Consultant (ASC) - Apple (...
**Job Summary** The ASC is an Apple employee who serves as an Apple brand ambassador and influencer in a Reseller's store. The ASC's role is to grow Apple Read more
*Apple* Retail - Manager - Holyoke - Apple I...
Job Summary Keeping an Apple Store thriving requires a diverse set of leadership skills, and as a Manager, you’re a master of them all. In the store’s fast-paced, Read more
*Apple* Retail - Manager - Apple (United Sta...
Job SummaryKeeping an Apple Store thriving requires a diverse set of leadership skills, and as a Manager, you're a master of them all. In the store's fast-paced, dynamic Read more
*Apple* Solutions Consultant (ASC) - Apple (...
**Job Summary** The ASC is an Apple employee who serves as an Apple brand ambassador and influencer in a Reseller's store. The ASC's role is to grow Apple Read more
All contents are Copyright 1984-2011 by Xplain Corporation. All rights reserved. Theme designed by Icreon.