examples/SFExamples/OandXViewArch/S60/src/oandxengine.cpp

/*
Copyright (c) 2002-2011 Nokia Corporation and/or its subsidiary(-ies). All rights reserved.

Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:

* Redistributions of source code must retain the above copyright notice, this
  list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
  this list of conditions and the following disclaimer in the documentation
  and/or other materials provided with the distribution.
* Neither the name of Nokia Corporation nor the names of its contributors
  may be used to endorse or promote products derived from this software
  without specific prior written permission.

THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

Description:  
*/

#include <e32math.h>

#include "oandxdefs.h"
#include "oandxengine.h"


COandXEngine* COandXEngine::NewL()
        {
        return new(ELeave) COandXEngine;
        }

COandXEngine::COandXEngine()
        {
        Reset();
        }

COandXEngine::~COandXEngine()
        {
        // empty.
        }

void COandXEngine::Reset()
        {
        for (TInt i=0; i<KNumberOfTiles; i++)
                {
                iTileStates[i] = ETileBlank;
                }
        }

TTileState COandXEngine::TileStatus(TInt aIndex) const
        {
        return iTileStates[aIndex];
        }

TBool COandXEngine::TryMakeMove(TInt aIndex, TBool aCrossTurn)
        {
        if (iTileStates[aIndex] == ETileBlank)
                {
                iTileStates[aIndex] = aCrossTurn ? ETileCross : ETileNought;
                return ETrue;
                }
        return EFalse;
        }
        
TInt COandXEngine::TileState(TInt aX, TInt aY) const
        {
        ASSERT(aX >= 0 && aX < KTilesPerSide);
        ASSERT(aY >= 0 && aY < KTilesPerSide);
        
        return iTileStates[aY * KTilesPerSide + aX];
        }

TTileState COandXEngine::GameWonBy() const
        {
        const TInt KNoughtWinSum = KTilesPerSide * ETileNought;
        const TInt KCrossWinSum = KTilesPerSide * ETileCross;
        
        // is there a row or column of matching tiles?
        for (TInt i = 0; i < KTilesPerSide; ++i)
                {
                TInt rowSum = 0;
                TInt colSum = 0;
                for (TInt j = 0; j < KTilesPerSide; ++j)
                        {
                        rowSum += TileState(j, i);
                        colSum += TileState(i, j);
                        }
                
                if (rowSum == KNoughtWinSum || colSum == KNoughtWinSum)
                        {
                        return ETileNought;
                        }
                if (rowSum == KCrossWinSum || colSum == KCrossWinSum)
                        {
                        return ETileCross;
                        }
                }

        // is there a diagonal of matching tiles?
        TInt blTrSum = 0;               // bottom left to top right
        TInt tlBrSum = 0;               // top left to bottom right
        for (TInt i = 0; i < KTilesPerSide; ++i)
                {
                tlBrSum += TileState(i,i);
                blTrSum += TileState(i,KTilesPerSide - 1 - i);
                }
                
        if (blTrSum == KNoughtWinSum || tlBrSum == KNoughtWinSum)
                {
                return ETileNought;
                }
        
        if (blTrSum == KCrossWinSum || tlBrSum == KCrossWinSum)
                {
                return ETileCross;
                }
        
        return ETileBlank; // No winner
        }


void COandXEngine::ExternalizeL(RWriteStream& aStream) const
        {
        for (TInt i = 0; i<KNumberOfTiles; i++)
                {
                aStream.WriteInt8L(iTileStates[i]);
                }
        }

void COandXEngine::InternalizeL(RReadStream& aStream)
        {
        for (TInt i = 0; i<KNumberOfTiles; i++)
                {
                iTileStates[i] = static_cast<TTileState>(aStream.ReadInt8L());
                }
        }

---