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

extern CConsoleBase* console;

// ---------------------------------------------------------
// void SortExistingArrayL()
// Sorts a prepopulated array using the supplied ordering
// function
// ---------------------------------------------------------
//
LOCAL_C void SortExistingArrayL()
        {
        TExampleStruct* values = GenerateValuesLC();

        RExampleArray array(sizeof(TExampleStruct), values, KMaxElements);      // First we sort the array
        CleanupStack::Pop(values);
        CleanupClosePushL(array);
        
        // now sort the array by the first Key
        TLinearOrder<TExampleStruct> ordering(TExampleStruct::RelativeAOrdering);
        array.Sort(ordering);

        // now verify that we are sorted correctly in order
        for (TInt i = 0; i < array.Count()-1; i++)
                {
                if (TExampleStruct::RelativeAOrdering(array[i], array[i+1]) > 0)
                        User::Leave(KErrGeneral);
                }
        
        CleanupStack::PopAndDestroy(&array);
        }


// ---------------------------------------------------------
// void SortExistingArrayUsingKeyOffsetsL()
// This example sorts the array of random values
// using the 2nd field of the structure.
// This uses the offset functions of RArray
// ---------------------------------------------------------
//
LOCAL_C void SortExistingArrayUsingKeyOffsetsL()
        {
        TExampleStruct* values = GenerateValuesLC();

        RArray<TExampleStruct> array(KDefaultGranularity, _FOFF(TExampleStruct, iB));
        CleanupClosePushL(array);
        
        // Fill the array but not in any order
        for (TInt i=0; i < KMaxElements; i++)
                User::LeaveIfError(array.Append(values[i]));
                
        // now sort it based on the iB key of TExampleStruct
        array.SortSigned();
        for (TInt i=0; i < array.Count()-1; i++)
                {
                // Should be sorted in ascending order
                // with duplicates based on the iB field.
                if (array[i].iB > array[i+1].iB)
                        User::Leave(KErrGeneral);
                }

        CleanupStack::PopAndDestroy(2, values);
        }

// ---------------------------------------------------------
// void SortingExamplesL()
// Holdds the sorting functions
// ---------------------------------------------------------
//
void SortingExamplesL()
        {
        console->Printf(_L("Sort an existing array\n"));
        SortExistingArrayL();
        User::After(0);
        
        console->Printf(_L("Sort an existing array using a field offset\n"));
        SortExistingArrayUsingKeyOffsetsL();
        User::After(0);
        }

---