workspace/systemsettings/menuitem.cpp

   1 /* This file is part of the KDE project
   2    Copyright 2007 Will Stephenson <wstephenson@kde.org>
   3
   4    This program is free software; you can redistribute it and/or
   5    modify it under the terms of the GNU General Public License as
   6    published by the Free Software Foundation; either version 2 of
   7    the License or (at your option) version 3 or any later version
   8    accepted by the membership of KDE e.V. (or its successor approved
   9    by the membership of KDE e.V.), which shall act as a proxy
  10    defined in Section 14 of version 3 of the license.
  11
  12    This program is distributed in the hope that it will be useful,
  13    but WITHOUT ANY WARRANTY; without even the implied warranty of
  14    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  15    GNU General Public License for more details.
  16
  17    You should have received a copy of the GNU General Public License
  18    along with this program.  If not, see <http://www.gnu.org/licenses/>.
  19 */
  20
  21 #include "menuitem.h"
  22
  23 MenuItem::MenuItem( bool isMenu, MenuItem * itsParent )
  24     : parent( itsParent ),
  25       menu( isMenu ),
  26       name( QString() ),
  27       caption( QString() ),
  28       service( NULL ),
  29       item( NULL )
  30
  31 {
  32     if ( parent ) {
  33         parent->children.append( this );
  34     }
  35 }
  36
  37 MenuItem::~MenuItem()
  38 {
  39     qDeleteAll( children );
  40 }
  41
  42 inline int weightOfService( const KService::Ptr service )
  43 {
  44     QVariant tmp = service->property( "X-KDE-Weight", QVariant::Int );
  45     return (tmp.isValid() ? tmp.toInt() : 100);
  46 }
  47
  48 static bool childIsLessThan( MenuItem *left, MenuItem *right )
  49 {
  50     return weightOfService( left->service ) < weightOfService( right->service );
  51 }
  52
  53 void MenuItem::sortChildrenByWeight()
  54 {
  55     qSort( children.begin(), children.end(), childIsLessThan );
  56 }
  57
  58 MenuItem * MenuItem::grandChildAt( int index )
  59 {
  60     int count = 0;
  61     MenuItem * foundItem = 0;
  62     foreach ( MenuItem * child, children ) {
  63         foreach ( MenuItem * grandChild, child->children ) {
  64             if ( count == index ) {
  65                 foundItem = grandChild;
  66                 break;
  67             }
  68             count++;
  69         }
  70         if ( foundItem ) {
  71             break;
  72         }
  73     }
  74     return foundItem;
  75 }
  76