examples/SFExamples/Example_RArray/SharedCode.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 "SharedCode.h"
#include <Random.h>

// ---------------------------------------------------------
// TExampleStruct* GenerateValuesLC()
// Generates a blob of randomized data
// ---------------------------------------------------------
//
TExampleStruct* GenerateValuesLC()
        {
        const TInt maxLength = sizeof(TExampleStruct) * KMaxElements;
        TExampleStruct* structs = REINTERPRET_CAST(TExampleStruct*, User::AllocLC(maxLength));
        TPtr8 tmp(REINTERPRET_CAST(TUint8*, structs), maxLength, maxLength);
        TRandom::Random(tmp);
        return structs;
        }

// ---------------------------------------------------------
// void AddElementsL(const TExampleStruct* aValues, RExampleArray& aArray)
// Adds the elements to the array without a leak
// ---------------------------------------------------------
//
void AddElementsL(const TExampleStruct* aValues, RExampleArray& aArray)
        {       
        for (TInt i=0; i < KMaxElements; i++)
                {
                User::LeaveIfError(aArray.Append(aValues[i]));
                }
        }

// ---------------------------------------------------------
// TBool TExampleStruct::IsEqual(const TExampleStruct& aLeft, const TExampleStruct& aRight)
// Checks to see if the two arras are equal
// ---------------------------------------------------------
//
TBool TExampleStruct::IsEqual(const TExampleStruct& aLeft, const TExampleStruct& aRight)
        {
        return aLeft.iA == aRight.iA && aLeft.iB == aRight.iB;
        }

// ---------------------------------------------------------
// TInt TExampleStruct::RelativeAOrdering(const TExampleStruct& aLeft, const TExampleStruct& aRight)
// Compares the two elements
// ---------------------------------------------------------
//
TInt TExampleStruct::RelativeAOrdering(const TExampleStruct& aLeft, const TExampleStruct& aRight)
        {
        if (aLeft.iA < aRight.iA)
                return -1;
        
        if (aLeft.iA > aRight.iA)
                return 1;

        return 0;
        }

// ---------------------------------------------------------
// TInt TExampleStruct::KeyCompare(const TInt* aKey, const TExampleStruct& aElement)
// Compares the iA element of the structure against the supplied key
// ---------------------------------------------------------
//
TInt TExampleStruct::KeyCompare(const TInt* aKey, const TExampleStruct& aElement)
        {
        if (*aKey < aElement.iA)
                return -1;
        
        if (*aKey > aElement.iA)
                return 1;
        
        return 0;
        }

---