TweetFollow Us on Twitter

Apr 96 Challenge
Volume Number:12
Issue Number:4
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.

Mutant Life

Time for a little nostalgia this month. Most of you probably remember John Conway’s exploration of cellular automata known as the game of Life. The game is played on a grid of square cells. A cell has one of two states - it can be occupied (“alive”) or empty (“dead”). Time proceeds in discrete increments, or generations, and the state of a cell at time N+1 is determined by its state and that of its eight neighbors at time N. In the simplest variations of the game, a “birth” occurs in an empty cell if exactly three of its neighbors were alive in the previous generation. A “death” occurs in an occupied cell surrounded by four or more living cells, or by fewer than two living cells.

This month, the challenge is to write code that will compute the state of a Life-like world some number of generations into the future. The prototype for the code you should write is:

pascal long PropagateLife(
 BitMap cells,   /* the boundaries and population of your automata */
 long numGenerations,/* number of generations to propagate */
 short birthRules, /* defines when cells become alive */
 short deathRules/* defines when cells die */
);

Your automata live in a world defined by the rectangle cells.bounds (with top and left coordinates guaranteed to be 0). Their world is actually a torus instead of a rectangle: the cells.bounds.right-1 column of cells is adjacent to column 0, and the cells.bounds.bottom-1 row of cells is adjacent to row 0. The rules for birth and death are generalized from those in the first paragraph and defined by birthRules and deathRules. An empty cell with X occupied neighbors becomes alive in the next generation if the bit (birthRules & (1<<X)) is set. An occupied cell with Y occupied neighbors dies in the next generation if the bit (deathRules & (1<<Y)) is set. Any other cell retains its previous state (occupied or empty) from one generation to the next. As an example, the version of the game described in the first paragraph would have birthRules=0x0008 and deathRules=0x01F3.

The initial population of automata is pointed to by cells.baseAddr, one bit per cell, when PropagateLife is called. An occupied cell has the value 1, and an empty cell has the value 0. The cells BitMap is defined in the usual way, with row R found starting at *(cells.baseAddr + R*cells.rowBytes). You are to use birthRules and deathRules to propagate this population ahead for numGenerations generations, stopping only in the event that the population of generation N is identical to that of the immediately preceeding generation. Your code must return the number of generations processed (which will be numGenerations unless a static population was reached). When you return, the memory pointed to by cells.baseAddr must contain the propagated population.

You may allocate a reasonable amount of auxiliary storage if that is helpful, provided (as always) that you deallocate any memory before returning, as I will be calling your code many times.

This month, we continue the language experiment that permits your solution to the Challenge to be coded in C, C++, or Pascal, using your choice among the MPW, Metrowerks, or Symantec compilers for these languages. The environment you choose must support linking your solution with test code written in C. Along with your solution, you should provide a project file or make file that will generate a stand-alone application that calls your solution from C test code.

This will be a native PowerPC Challenge. Now, start propagating

Two Months Ago Winner

Congratulations to Ernst Munter (Kanata, Ontario) for submitting the fastest entry to the Intersecting Rectangles Challenge. Of the eighteen contestants who submitted entries, sixteen provided correct solutions. Recall that the Challenge was to provide code that would return a set of output rectangles containing all points inside in an odd number (or an even number, depending on an input parameter) of input rectangles.

A number of solutions scanned the list of input rectangles and created a list of rectangles formed by the intersections, keeping track of whether the resulting subrectangles were inside an odd or an even number of input rectangles. Other solutions used a bitmap approach, calculating the exclusive OR of the input rectangles (for the odd parity case). The bitmap technique tended to suffer when the rectangles spanned a large x/y space.

The winning solution combines these techniques in an interesting way. Ernst first scans the input rectangles to collect and sort the unique x and y vertex coordinates. He then forms a reduced-scale bitmap using these virtual pixels (dubbed “vixels”), applying the XOR technique to compute the odd or even parity intersections of the input rectangles. Finally, Ernst scans the “vixelMap” to form output rectangles of the appropriate parity. An innovative technique that was not only fast but also space-efficient compared with many of the other entries.

The table below summarizes the results for entries that worked correctly. It shows the total time required for 60 test cases of up to 250 input rectangles per test case, the number of output rectangles produced, and the total code/data size of each entry. (The limit of 250 input rectangles resulted from the large memory requirements of some of the solutions.) Numbers in parentheses after a person’s name indicate that person’s cumulative point total for all previous Challenges, not including this one.

Nametime# of rectssize
Ernst Munter (112)3121054602264
ACC Murphy3984465561210
John Nevard (10)551988043092
Miguel Cruz Picão (7)10322615621328
Xan Gregg (88)17161036731232
Cathy Saxton18544575081148
David Cary43614369932205
Elden Wood582417857101012
Bob Clark601617897491572
Randy Boring60334465562589
Alex Kipnis1015817857101218
Tom Saxton (10)15206980411264
Richard Cann231032821243581
Erik Sea548384350491125
Rishi Khan18020527951361288
Michael White9381912399241796

Top 20 Contestants of All Time

Here are the Top Contestants for the Programmer’s Challenges to date, including everyone who has accumulated more than 20 points. The numbers below include points awarded for this month’s entrants.

Rank Name Points Rank Name Points

1. [Name deleted] 176 11. Mallett, Jeff 44

2. Munter, Ernst 132 12. Kasparian, Raffi 42

3. Gregg, Xan 92 13. Vineyard, Jeremy 42

4. Larsson, Gustav 87 14. Lengyel, Eric 40

5. Karsh, Bill 80 15. Darrah, Dave 31

6. Stenger, Allen 65 16. Brown, Jorg 30

7. Riha, Stepan 51 17. Landry, Larry 29

8. Cutts, Kevin 50 18. Elwertowski, Tom 24

9. Goebel, James 49 19. Lee, Johnny 22

10. Nepsund, Ronald 47 20. Noll, Robert 22

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 5th place 2 points

2nd place 10 points finding bug 2 points

3rd place 7 points suggesting Challenge 2 points

4th place 4 points

Xan Gregg earns two points this month for being the first to point out an error in the winning Find Again and Again solution by Gustav Larsson published in the February issue. The error occurs because the routines BMH_Search() and SimpleSearch() use signed declarations char * when they ought to use unsigned char *. As a result, processing is not correct in some cases when the textToSearch contains characters >= 0x80. There was confusion on this point in a number of the entries, and I did not penalize any of the solutions for making this error.

Here is Ernst’s winning Intersecting Rectangles solution:

IntersectRects.c

Copyright 1996, Ernst Munter, Kanata, ON, Canada

/*
  The Problem
  -----------
  Given a bunch of overlapping rectangles, compute a set
  of rectangles which covers the area of either an odd or
  an even number of overlaps.  The output rects should only
  use edges from the repertoire of edges contained in the
  input set of rects.

  General Strategy
  ----------------
  We create a virtual raster with a (variable) resolution,
  where each x or y coordinate value corresponds to an
  edge of at least one input rectangle.  Depending on the
  number of input rects, and their coincidence of edges,
  this raster may be very small, or fairly large, but never
  larger than the screen it represents.

  We then paint rectangles into the raster, each raster
  point being represented by 1 bit, regardless how many
  pixels are within the corresponding edges on the real
  screen.  I call these bits “virtual pixels” or “vixels”.

  After all vixels are painted, the bit map is scanned
  to identify rectangular areas of set bits.

  The vertical extent of each output rect is at least equal
  to the distance between the two neighboring input edges.

  We then follow the slice down over as many slices as
  possible to maximize the height of the rectangle.

  Memory Use
  ----------
  The maximum amount of memory allocated dynamically is
  determined by the number of input rects.  The actual
  amount will be less if some input rects share edge
  coordinate values.

  Approximate size of the index heap:
  (16 * numRectsIn)  bytes
     plus a few overhead bytes

  Approximate combined size of the two vixel maps:
  (numRectsIn * numRectsIn) bytes
     plus a few overhead bytes,
     minus gain from elimination of duplicate values

  A double size vixel map is always allocated although
  only the even parity case needs both.

  For example, total dynamic memory for 100 rectangles will
  be about 16K.  1000 rectangles might need 1MB, but on
  any reasonable size screen, 1000 rectangles will share
  a very large number of edges, and will have considerably
  less memory allocated.


  Other assumptions (these are not checked)
  -----------------------------------------
  There is at least one input rect.

  All input rects are legal and not empty, that is:
      top<bottom, and left<right.
*/

#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#define MAXLONG 0x7fffffff

void RectangleIntersections(
     const Rect inputRects[],
     const long numRectsIn,
     Rect  outputRects[],
     long  *numRectsOut,
     const Boolean oddParity);

// Local function prototypes:
void  PaintOdd(long* vm,long H,long L,long R,long mapWidth);
void  PaintEven(long* vm,long H,long L,long R,long mapWidth);
void  PackMap(long* vm,long mapSize);
void  Insert(long* h,long size,long x);
long* Sort(long* h,long size);
long  GetIndex(long size,long* index,long z);

//Some shorthand macros:
#define IRT (inputRects[i].top)
#define IRL (inputRects[i].left)
#define IRB (inputRects[i].bottom)
#define IRR (inputRects[i].right)

#define ORT (ORptr->top)
#define ORL (ORptr->left)
#define ORB (ORptr->bottom)
#define ORR (ORptr->right)

/* Masks needed to process the edges of vixel blocks
   which are not necessarily aligned with bitmap words.
*/
long leftMask[32] =
   {0xFFFFFFFF, 0x7FFFFFFF, 0x3FFFFFFF, 0x1FFFFFFF,
    0x0FFFFFFF, 0x07FFFFFF, 0x03FFFFFF, 0x01FFFFFF,
    0x00FFFFFF, 0x007FFFFF, 0x003FFFFF, 0x001FFFFF,
    0x000FFFFF, 0x0007FFFF, 0x0003FFFF, 0x0001FFFF,
    0x0000FFFF, 0x00007FFF, 0x00003FFF, 0x00001FFF,
    0x00000FFF, 0x000007FF, 0x000003FF, 0x000001FF,
    0x000000FF, 0x0000007F, 0x0000003F, 0x0000001F,
    0x0000000F, 0x00000007, 0x00000003, 0x00000001};

long rightMask[32] =
   {0x80000000, 0xC0000000, 0xE0000000, 0xF0000000,
    0xF8000000, 0xFC000000, 0xFE000000, 0xFF000000,
    0xFF800000, 0xFFC00000, 0xFFE00000, 0xFFF00000,
    0xFFF80000, 0xFFFC0000, 0xFFFE0000, 0xFFFF0000,
    0xFFFF8000, 0xFFFFC000, 0xFFFFE000, 0xFFFFF000,
    0xFFFFF800, 0xFFFFFC00, 0xFFFFFE00, 0xFFFFFF00,
    0xFFFFFF80, 0xFFFFFFC0, 0xFFFFFFE0, 0xFFFFFFF0,
    0xFFFFFFF8, 0xFFFFFFFC, 0xFFFFFFFE, 0xFFFFFFFF};


RectangleIntersections
void RectangleIntersections(
     const Rect inputRects[],
     const long numRectsIn,
     Rect  outputRects[],
     long  *numRectsOut,
     const Boolean oddParity) {

    long* xHeap;
    long* yHeap;
    long* vixelMap;

    long* xIndex;
    long* yIndex;
    long  xIndexMax;
    long  yIndexMax;
    long  xHeapSize;
    long  yHeapSize;

    long  i;
    long  mapWidth;
    long  mapSize;
    Rect* ORptr = outputRects;

//  First, we collect all X and Y coordinate values of
//  all input rectangles in a heap (priority queue), which
//  is then sorted into an index without duplicates for each
//  dimension, using a modified form of Heapsort.

    *numRectsOut=0;
    if (0==(yHeap=(long*)malloc((numRectsIn+3)*sizeof(long)*4)))
      return;
    xHeap=yHeap+(numRectsIn+3)*2;

    *xHeap=*yHeap=MAXLONG;
    xHeapSize=yHeapSize=1;

    for (i=0;i<numRectsIn;i++) {
      Insert(yHeap,yHeapSize,IRT);    yHeapSize++;
      Insert(yHeap,yHeapSize,IRB);    yHeapSize++;
      Insert(xHeap,xHeapSize,IRL);    xHeapSize++;
      Insert(xHeap,xHeapSize,IRR);    xHeapSize++;
    }

    xIndex=Sort(xHeap,xHeapSize);
    xIndexMax=xHeapSize-(xIndex-xHeap);
    yIndex=Sort(yHeap,yHeapSize);
    yIndexMax=yHeapSize-(yIndex-yHeap);

//note: IndexMax indexes to the last entry index[indexMax]
//      in each index list.  index[0] and index[indexMax]
//      are the edges of the enclosing rectangle.

//  Each block of real pixels that is defined by adjacent
//  X and Y edges (from any input rectangle) is considered
//  as a single virtual pixel (“vixel”).  The map of these
//  vixels will then be populated by the input rectangles.
//  Each vixel is represented by a bit in vixelMap.

//  We get memory for the vixel map and clear it to 0.
//  Vixels are stored as bitmaps in 32-bit words.

//  The vixel map is initially organized as either 1 word
//  per 32 vixels (odd parity) or 2 words (even parity).

    mapWidth=(32+xIndexMax) >> 5;
    mapSize=mapWidth*(yIndexMax+1);
    if (0==(vixelMap=
       (long*)malloc(2*mapSize*sizeof(long)))) return;
    if (oddParity) memset(vixelMap,0,mapSize*sizeof(long));
    else memset(vixelMap,0,2*mapSize*sizeof(long));

//  With odd parity, it is only necessary to XOR the vixels
//  of all input rects (PaintOdd).

//  With even parity, we also need to OR all vixels.  This
//  is done in the alternate words of vixelMap (PaintEven);
//  hence the vixelMap is stretched with even parity.

//  Accumulate the enclosed vixels of each input rect:

    for (i=0;i<numRectsIn;i++) {
      long  T,L,B,R,x,y;
      long* vm;
      T=GetIndex(yIndexMax,yIndex,IRT);
      L=GetIndex(xIndexMax,xIndex,IRL);
      B=GetIndex(yIndexMax,yIndex,IRB);
      R=GetIndex(xIndexMax,xIndex,IRR);
      if (oddParity) {
        vm=vixelMap+mapWidth*T+(L>>5);
        PaintOdd(vm,B-T,L,R-1,mapWidth);
      } else {
        vm=vixelMap+2*(mapWidth*T+(L>>5));
        PaintEven(vm,B-T,L,R-1,mapWidth);
      }
    }

//  For even parity, XOR all pairs of words in the vixelMap
//  to pack it into the same format as the odd parity
//  vixelMap.

    if (!oddParity) PackMap(vixelMap,mapSize);

//  Now the vixelMap (the bitmap of all vixels, that is
//  areas of the screen), is set to 1 for every vixel
//  meeting the criteria of either odd or even parity.

//  We scan the vixel map to find contiguous regions of
//  non-zero vixels in order to generate the output
//  rectangles.  For each row, we successively look for
//  blocks of set vixels. This will define one output rect.
//  The X/Y index arrays serve to convert the vixel
//  coordinates back to the real pixel coordinates which
//  define the output rectangles.

  { long word,bit,bb,c,u,L,B;
    long* vm=vixelMap;
    for (i=0;i<yIndexMax;i++) {
      bit=0;
      c=0;
      for (word=0;word<mapWidth;word++) {
        u=vm[word];c=0;
        if (u) {
          long* vmBelow=vm+word+mapWidth;
          bb=0;
          do {
            while (u>0) {bb++;u<<=1;}
            if (c==0) {
              L=bb;
              ORL=xIndex[bit+L]; c--;
            } else {
              long* vmx=vmBelow;
              long mask=~(leftMask[L] & rightMask[bb-1]);
              B=i+1;
//Default: the rectangle is 1 vixel high.
//We try to extend rectangle down as far as possible:
              while (-1==(mask | *vmx)) {
                B++;*vmx &= mask;vmx+=mapWidth;
              }
              ORB=yIndex[B];
              ORR=xIndex[bit+bb];
              ORT=yIndex[i];
              ORptr++;
              c=0;
            }
            if (0==(u=(~u) & rightMask[31-bb])) break;
          } while(bb<32);
          if (c) {
            long* vmx=vmBelow;
            long mask=~leftMask[L];
            B=i+1;
            while (-1==(mask | *vmx)) {
              B++;*vmx &= mask;vmx+=mapWidth;
            }
            ORB=yIndex[B];
            ORR=xIndex[bit+32];
            ORT=yIndex[i];
            ORptr++;
          }
        }
        bit+=32;
      }
      vm+=mapWidth;
    }

  }
  free(yHeap);                  //free allocated memory
  free(vixelMap);
  *numRectsOut=ORptr-outputRects;
}

//////////////////////////////////////////////////////////////////
// Auxiliary functions called by RectangleIntersections: //
/////////////////////////////////////////////////////////////////

Insert
/* Insert grows a heap, that is a partially sorted balanced
   binary tree, where each node’s children must be less or
   equal, but not in any particular order.

   Each value x is inserted by appending it as the last node
   and then sifting it up (exchanging father and child
   nodes) until the heap property is restored.
*/
void Insert(long* h,long size,long x) {
  long i,j,z;
  i=size;
  do {
    j=i>>1;
    if (x<=(z=h[j])) break;
    h[i]=z;
    i=j;
  } while(1);
  h[i]=x;
}

Sort
/* The heap keeps the largest value at the root, at h[1].
   We sort as follows: each root value is removed and put
   at the end of the array;  then the last item in the heap
   is put into the root and sifted down until the heap
   property is restored.
   When we are done, the array is sorted.
   As we go along, we recognize duplicate values and remove
   them but do not put them back.  The result is that the
   start of the sorted list may be further up in the array.
*/
long* Sort(long* h,long size) {
  long  x,z,i,j;
  long* b=h+size+1;
  *b=MAXLONG;
  if (size>1) do {
    size--;
    i=1;
    j=2;
    if (*b != (z=h[1])) *(--b) = z;
    if (size<=1) break;
    x=h[size];
    h[size]=-MAXLONG;
    while (j<size) {
      long h0=h[j],h1=h[1+j];
      if (h0<h1) {j++; h0=h1;}
      if (x>=h0) break;
      h[i]=h0;
      i=j;
      j+=j;
    }
    h[i]=x;
  } while(1);
  return b;
}

GetIndex
/* GetIndex uses a binary search to locate a particular
   entry and returns its index.
*/
long GetIndex(long r,long* index,long z) {
  long l=0,m=r>>1,y;
  do {
    if (z>(y=index[m])) l=m+1;
    else if (z<y)       r=m-1;
    else return m;
    m=(l+r)>>1;
  } while (l<r);
  return r;
}


PaintOdd
/* The PaintOdd and PaintEven routines paint rectangles
   into the vixel map.
   PaintOdd only XORs a single bit map with a rectangle.
   PaintEven also ORs a second bit map with the same
   rectangle.  The 2 bit maps are word interleaved.
   It is hoped that this reduces cache misses by keeping
   to one area of memory for each row of a rectangle.
*/
void  PaintOdd(long* vm,long H,long L,long R,long mapWidth) {
long LM=leftMask[L & 31];
long RM=rightMask[R & 31];
long numMid=(>>R5)-(L>>5)-1;
long x,y,pad=mapWidth-numMid-2;

  if (numMid<0) {LM&=RM;RM=0;}

  for (y=0;y<H;y++) {
    *vm ^= LM; vm++;
    for (x=0;x<numMid;x++) {
      *vm ^= 0xFFFFFFFF; vm++;
    }
    if (RM) {
      *vm ^= RM; vm++;
    }
    vm+=pad;
  }
}

PaintEven 
void  PaintEven (long* vm,long H,long L,long R,long mapWidth) {
long LM=leftMask[L & 31];
long RM=rightMask[R & 31];
long numMid=(>>R5)-(L>>5)-1;
long x,y,pad=(mapWidth-numMid-2)<<1;

  if (numMid<0) {LM&=RM;RM=0;}

  for (y=0;y<H;y++) {
    *vm ^= LM; vm++;
    *vm |= LM; vm++;
    for (x=0;x<numMid;x++) {
      *vm ^= 0xFFFFFFFF; vm++;
      *vm |= 0xFFFFFFFF; vm++;
    }
    if (RM) {
      *vm ^= RM; vm++;
      *vm |= RM; vm++;
    }
    vm+=pad;
  }
}

PackMap
/* PackMap reduces the two interleaved bit maps used for
   the even parity case, into a single bit map.  Each
   pair of words, of the entire bitmap, is XORed together
   regardless of rectangle boundaries.
*/
void PackMap(long* vm,long mapSize) {
long* vmE=vm;
long* endOfMap=vm+mapSize;
  while (vm<endOfMap) {
    *vm++ = *vmE ^ vmE[1];
    vmE+=2;
  }
}

 
AAPL
$118.68
Apple Inc.
+1.08
MSFT
$47.91
Microsoft Corpora
+0.44
GOOG
$538.63
Google Inc.
-2.45

MacTech Search:
Community Search:

Software Updates via MacUpdate

RapidWeaver 6.0.3 - Create template-base...
RapidWeaver is a next-generation Web design application to help you easily create professional-looking Web sites in minutes. No knowledge of complex code is required, RapidWeaver will take care of... Read more
iPhoto Library Manager 4.1.10 - Manage m...
iPhoto Library Manager lets you organize your photos into multiple iPhoto libraries. Separate your high school and college photos from your latest summer vacation pictures. Or keep some photo... Read more
iExplorer 3.5.1.9 - View and transfer al...
iExplorer is an iPhone browser for Mac lets you view the files on your iOS device. By using a drag and drop interface, you can quickly copy files and folders between your Mac and your iPhone or... Read more
MacUpdate Desktop 6.0.3 - Discover and i...
MacUpdate Desktop 6 brings seamless 1-click installs and version updates to your Mac. With a free MacUpdate account and MacUpdate Desktop 6, Mac users can now install almost any Mac app on macupdate.... Read more
SteerMouse 4.2.2 - Powerful third-party...
SteerMouse is an advanced driver for USB and Bluetooth mice. It also supports Apple Mighty Mouse very well. SteerMouse can assign various functions to buttons that Apple's software does not allow,... Read more
iMazing 1.1 - Complete iOS device manage...
iMazing (was DiskAid) is the ultimate iOS device manager with capabilities far beyond what iTunes offers. With iMazing and your iOS device (iPhone, iPad, or iPod), you can: Copy music to and from... Read more
PopChar X 7.0 - Floating window shows av...
PopChar X helps you get the most out of your font collection. With its crystal-clear interface, PopChar X provides a frustration-free way to access any font's special characters. Expanded... Read more
Carbon Copy Cloner 4.0.3 - 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
ForeverSave 2.1.3 - Universal auto-save...
ForeverSave auto-saves all documents you're working on while simultaneously doing backup versioning in the background. Lost data can be quickly restored at any time. Losing data, caused by... Read more
Voila 3.8.1 - Capture, annotate, organiz...
Voila is a screen-capture, recording, and annotation tool that is a full-featured replacement for Mac's screen-capture and screen-recording capabilities. It has a large and robust set of editing,... Read more

Latest Forum Discussions

See All

You Can Play the Final Chapter of Lone W...
You Can Play the Final Chapter of Lone Wolf: Dawn Over V’taag Right Now Posted by Jessica Fisher on November 26th, 2014 [ permalink ] Universal App - Designed for iPhone and iPad | Read more »
Tales from the Borderland​s Will be Comi...
Tales from the Borderland​s Will be Coming to iOS by the End of the Year Posted by Jessica Fisher on November 26th, 2014 [ permalink ] Telltale Games has announced | Read more »
Sunburn! Review
Sunburn! Review By Campbell Bird on November 26th, 2014 Our Rating: :: DON'T DIE ALONEUniversal App - Designed for iPhone and iPad Platform through the depths of space to make sure your entire crew dies together in this satisfying... | Read more »
Black Friday has Started Early – Lots an...
It’s almost turkey time! Which means lots and lots of food but also lots and lots of sales. Some sales have even started a few days early, which is why we’ve put together a list of iOS games that are currently discounted (sometimes by a lot).... | Read more »
Loose Leaf Review
Loose Leaf Review By Jennifer Allen on November 26th, 2014 Our Rating: :: SIMPLE SKETCHINGiPad Only App - Designed for the iPad Sketch out ideas with simple drawing tools, courtesy of Loose Leaf.   | Read more »
Screeny (Utilities)
Screeny 1.0 Device: iOS iPhone Category: Utilities Price: $.99, Version: 1.0 (iTunes) Description: Screeny is an utility app that helps you save space consumed by screenshots. It screens your camera roll and helps you to filter and... | Read more »
Tilt to Live Bundle Set to Arrive This T...
Tilt to Live Bundle Set to Arrive This Thanksgiving Posted by Ellis Spice on November 25th, 2014 [ permalink ] One Man Left has unveiled an upcoming Tilt to Live bundle, allowing players to get the series for a di | Read more »
BattleLore: Command (Entertainment)
BattleLore: Command 1.0 Device: iOS Universal Category: Entertainment Price: $9.99, Version: 1.0 (iTunes) Description: ***NOTE: Compatible with iPad 2/iPad mini, iPod touch 5 and up and iPhone 4S and up – WILL NOT RUN ON EARLIER... | Read more »
Weather Or Not Review
Weather Or Not Review By Jennifer Allen on November 25th, 2014 Our Rating: :: STYLISH WEATHER REPORTINGiPhone App - Designed for the iPhone, compatible with the iPad Check the weather quickly and conveniently with Weather or Not... | Read more »
The All-New Football Manager Handheld 20...
The All-New Football Manager Handheld 2015 is Available Now Posted by Jessica Fisher on November 25th, 2014 [ permalink ] Universal App - Designed for iPhone and iPad | Read more »

Price Scanner via MacPrices.net

Early Black Friday MacBook Air sale prices, $...
 MacMall has posted early Black Friday MacBook Air sale prices. Save $101 on all models for a limited time: - 11″ 1.4GHz/128GB MacBook Air: $798 - 11″ 1.4GHz/256GB MacBook Air: $998 - 13″ 1.4GHz/... Read more
Why iPhone 6 Tablet/Laptop Cannibalization Is...
247wallst.com blogger Douglas A. McIntyre noted last week that according to research posted on the Applovin blog site the iPhone 6 is outselling the iPhone 6 Plus by a wide margin . Hardly a surprise... Read more
Worldwide Tablet Growth Expected to Slow to 7...
The global tablet market is expected to record massive deceleration in 2014 with year-over-year growth slowing to 7.2%, down from 52.5% in 2013, according to a new forecast from International Data... Read more
Touchscreen Glove Company Announces New Produ...
Surrey, United Kingdom based TouchAbility specializes in design and manufacture of a wide variety of products compatible with touchscreen devices including smartphones, tablets and computers. Their... Read more
OtterBox Alpha Glass Screen Protectors for iP...
To complement the bigger, sharper displays on the latest Apple devices, OtterBox has introduced Alpha Glass screen protectors to the iPhone 6 and iPhone 6 Plus. The fortified glass screen protectors... Read more
Early Black Friday Mac Pro sale, 6-Core 3.5GH...
 B&H Photo has the 6-Core 3.5GHz Mac Pro on sale today for $3499 including free shipping plus NY sales tax. Their price is $500 off MSRP, and it’s the lowest price available for this model from... Read more
Early Black Friday sale price: 15-inch 2.2GHz...
 B&H Photo has the 2014 15″ 2.2GHz Retina MacBook Pro on sale today for $1699.99. Shipping is free, and B&H charges NY sales tax only. Their price is $300 off MSRP, equalling Best Buy’s price... Read more
13-inch 2.5GHz MacBook Pro (refurbished) avai...
The Apple Store has Apple Certified Refurbished 13″ 2.5GHz MacBook Pros available for $170 off the cost of new models. Apple’s one-year warranty is standard, and shipping is free: - 13″ 2.5GHz... Read more
Early Black Friday iPad mini 3 sale: $75 off...
 Best Buy has iPad mini 3s on sale for $75 off MSRP on their online store for a limited time. Choose free shipping or free local store pickup (if available). Sale prices available for online orders... Read more
Early Black Friday MacBook Pro sale: 15-inch...
 Best Buy has posted early Black Friday prices on 15″ Retina MacBook Pros, with models on sale for $300 off MSRP on their online store for a limited time. Choose free local store pickup (if available... Read more

Jobs Board

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