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
$102.50
Apple Inc.
+0.25
MSFT
$45.43
Microsoft Corpora
+0.55
GOOG
$571.60
Google Inc.
+2.40

MacTech Search:
Community Search:

Software Updates via MacUpdate

VueScan 9.4.41 - Scanner software with a...
VueScan is a scanning program that works with most high-quality flatbed and film scanners to produce scans that have excellent color fidelity and color balance. VueScan is easy to use, and has... Read more
Cloud 3.0.0 - File sharing from your men...
Cloud is simple file sharing for the Mac. Drag a file from your Mac to the CloudApp icon in the menubar and we take care of the rest. A link to the file will automatically be copied to your clipboard... Read more
LibreOffice 4.3.1.2 - Free Open Source o...
LibreOffice is an office suite (word processor, spreadsheet, presentations, drawing tool) compatible with other major office suites. The Document Foundation is coordinating development and... Read more
SlingPlayer Plugin 3.3.20.505 - Browser...
SlingPlayer is the screen interface software that works hand-in-hand with the hardware inside the Slingbox to make your TV viewing experience just like that at home. It features an array of... Read more
Get Lyrical 3.8 - Auto-magically adds ly...
Get Lyrical auto-magically add lyrics to songs in iTunes. You can choose either a selection of tracks, or the current track. Or turn on "Active Tagging" to get lyrics for songs as you play them.... Read more
Viber 4.2.2 - Send messages and make cal...
Viber lets you send free messages and make free calls to other Viber users, on any device and network, in any country! Viber syncs your contacts, messages and call history with your mobile device,... Read more
Cocktail 7.6 - General maintenance and o...
Cocktail is a general purpose utility for OS X that lets you clean, repair and optimize your Mac. It is a powerful digital toolset that helps hundreds of thousands of Mac users around the world get... Read more
LaunchBar 6.1 - Powerful file/URL/email...
LaunchBar is an award-winning productivity utility that offers an amazingly intuitive and efficient way to search and access any kind of information stored on your computer or on the Web. It provides... 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
BBEdit 10.5.12 - Powerful text and HTML...
BBEdit is the leading professional HTML and text editor for the Mac. Specifically crafted in response to the needs of Web authors and software developers, this award-winning product provides a... Read more

Latest Forum Discussions

See All

Rhonna Designs Magic (Photography)
Rhonna Designs Magic 1.0 Device: iOS Universal Category: Photography Price: $1.99, Version: 1.0 (iTunes) Description: Want to sprinkle *magic* on your photos? With RD Magic, you can add colors, filters, light leaks, bokeh, edges,... | Read more »
This Week at 148Apps: August 25-29, 2014
Shiny Happy App Reviews   | Read more »
Qube Kingdom – Tips, Tricks, Strategies,...
Qube Kingdom is a tower defense game from DeNA. You rally your troops – magicians, archers, knights, barbarians, and others – and fight against an evil menace looking to dominate your kingdom of tiny squares. Planning a war isn’t easy, so here are a... | Read more »
Qube Kingdom Review
Qube Kingdom Review By Nadia Oxford on August 29th, 2014 Our Rating: :: KIND OF A SQUARE KINGDOMUniversal App - Designed for iPhone and iPad Qube Kingdom has cute visuals, but it’s a pretty basic tower defense game at heart.   | Read more »
Fire in the Hole Review
Fire in the Hole Review By Rob Thomas on August 29th, 2014 Our Rating: :: WALK THE PLANKUniversal App - Designed for iPhone and iPad Seafoam’s Fire in the Hole looks like a bright, 8-bit throwback, but there’s not enough booty to... | Read more »
Alien Creeps TD is Now Available Worldwi...
Alien Creeps TD is Now Available Worldwide Posted by Ellis Spice on August 29th, 2014 [ permalink ] Universal App - Designed for iPhone and iPad | Read more »
Dodo Master Review
Dodo Master Review By Jordan Minor on August 29th, 2014 Our Rating: :: NEST EGGiPad Only App - Designed for the iPad Dodo Master is tough but fair, and that’s what makes it a joy to play.   | Read more »
Motorsport Manager Review
Motorsport Manager Review By Lee Hamlet on August 29th, 2014 Our Rating: :: MARVELOUS MANAGEMENTUniversal App - Designed for iPhone and iPad Despite its depth and sense of tactical freedom, Motorsport Manager is one of the most... | Read more »
Motorsport Manager – Beginner Tips, Tric...
The world of Motorsport management can be an unforgiving and merciless one, so to help with some of the stress that comes with running a successful race team, here are a few hints and tips to leave your opponents in the dust. | Read more »
CalPal Update Brings the App to 2.0, Add...
CalPal Update Brings the App to 2.0, Adds Lots of New Stuff Posted by Ellis Spice on August 29th, 2014 [ permalink ] | Read more »

Price Scanner via MacPrices.net

The Rise of Phablets
Carlisle & Gallagher Consulting Group, a businesses and technology consulting firm focused solely on the financial services industry, has released an infographic depicting the convergence of... Read more
Eddy – Cloud Music Player for iPhone/iPad Fre...
Ukraine based CapableBits announces the release of Eddy, its tiny, but smart and powerful cloud music player for iPhone and iPad that allows users to stream or download music directly from cloud... Read more
A&D Medical Launches Its WellnessConnecte...
For consumers and the healthcare providers and loved ones who care for them, A&D Medical, a leader in connected health and biometric measurement devices and services, has launched its... Read more
Anand Lal Shimpi Retires From AnandTech
Anand Lal Shimpi, whose AnandTech Website is famous for its meticulously detailed and thoroughgoing reviews and analysis, is packing it in. Lal Shimpi, who founded the tech site at age 14 in 1997,... Read more
2.5GHz Mac mini, Apple refurbished, in stock...
The Apple Store has Apple Certified Refurbished 2.5GHz Mac minis available for $509, $90 off MSRP. Apple’s one-year warranty is included, and shipping is free. Read more
13-inch 2.5GHz MacBook Pro on sale for $999,...
B&H Photo has the 13″ 2.5GHz MacBook Pro on sale for $999.99 including free shipping plus NY sales tax only. Their price is $100 off MSRP. Read more
Labor Day Weekend MacBook Pro sale; 15-inch m...
B&H Photo has the new 2014 15″ Retina MacBook Pros on sale for up to $125 off MSRP. Shipping is free, and B&H charges NY sales tax only. They’ll also include free copies of Parallels Desktop... Read more
Labor Day Weekend iPad mini sale; $50 to $100...
Best Buy has the iPad mini with Retina Display (WiFi models) on sale for $50 off MSRP on their online store for Labor Day Weekend. Choose free shipping or free local store pick up. Price is for... Read more
13-inch 1.4GHz MacBook Air on sale for $899,...
Adorama has the new 2014 13″ 1.4GHz/128GB MacBook Air on sale for $899.99 including free shipping plus NY & NJ tax only. Their price is $100 off MSRP. Read more
It’s Official: Apple Issues Invitations To Se...
Apple has issued one of its characteristically cryptic press invitations for a special event to be held at the Flint Center for the Performing Arts in hometown Cupertino on Sept. 9, 2014 at 10:00 am... Read more

Jobs Board

*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* 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* 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* 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
Senior Event Manager, *Apple* Retail Market...
…This senior level position is responsible for leading and imagining the Apple Retail Team's global event strategy. Delivering an overarching brand story; in-store, Read more
All contents are Copyright 1984-2011 by Xplain Corporation. All rights reserved. Theme designed by Icreon.