epoc32/include/mw/akncustomtreeordering.h
author William Roberts <williamr@symbian.org>
Wed, 31 Mar 2010 12:33:34 +0100
branchSymbian3
changeset 4 837f303aceeb
parent 2 2fe1408b6811
permissions -rw-r--r--
Current Symbian^3 public API header files (from PDK 3.0.h)
This is the epoc32/include tree with the "platform" subtrees removed, and
all but a selected few mbg and rsg files removed.
     1 /*
     2 * Copyright (c) 2006 Nokia Corporation and/or its subsidiary(-ies).
     3 * All rights reserved.
     4 * This component and the accompanying materials are made available
     5 * under the terms of "Eclipse Public License v1.0"
     6 * which accompanies this distribution, and is available
     7 * at the URL "http://www.eclipse.org/legal/epl-v10.html".
     8 *
     9 * Initial Contributors:
    10 * Nokia Corporation - initial contribution.
    11 *
    12 * Contributors:
    13 *
    14 * Description:  Interface for implementing custom ordering for tree list.
    15 *
    16 */
    17 
    18 
    19 #ifndef M_AKNCUSTOMTREEORDERING_H
    20 #define M_AKNCUSTOMTREEORDERING_H
    21 
    22 
    23 #include <akntreelistconstants.h>
    24 
    25 
    26 /**
    27  *  Interface class for implementing custom ordering for hierarchical list.
    28  *
    29  *  Implementation of this interface class can be set to hierarchical
    30  *  list to define the ordering of items in the list. Hierarchical list
    31  *  then uses the implementation of @c MAknCustomTreeOrdering::Compare
    32  *  method in sorting the items within each node of the list.
    33  *
    34  *  @since S60 v3.2
    35  */
    36 class MAknCustomTreeOrdering
    37     {
    38 
    39 public:
    40 
    41     /**
    42      * Compares two tree list items.
    43      *
    44      * @param aFirst Item ID of the first compared hierarchical list item.
    45      *
    46      * @param aSecond Item ID of the second compared hierarchical list item.
    47      *
    48      * @return Positive, if the first item is greater than the second item;
    49      *      negative, if the first item is less than the second item;
    50      *      and zero, if the items are equal.
    51      */
    52     virtual TInt Compare( TAknTreeItemID aFirst, TAknTreeItemID aSecond ) = 0;
    53 
    54     };
    55 
    56 
    57 #endif // M_AKNCUSTOMTREEORDERING_H