src/playlist/PlaylistAlbumGroup.cpp

   1 /***************************************************************************
   2  *   Copyright (c) 2007  Nikolaj Hald Nielsen <nhnFreespirit@gmail.com>    *
   3  *                                                                         *
   4  *   This program is free software; you can redistribute it and/or modify  *
   5  *   it under the terms of the GNU General Public License as published by  *
   6  *   the Free Software Foundation; either version 2 of the License, or     *
   7  *   (at your option) any later version.                                   *
   8  *                                                                         *
   9  *   This program is distributed in the hope that it will be useful,       *
  10  *   but WITHOUT ANY WARRANTY; without even the implied warranty of        *
  11  *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the         *
  12  *   GNU General Public License for more details.                          *
  13  *                                                                         *
  14  *   You should have received a copy of the GNU General Public License     *
  15  *   along with this program; if not, write to the                         *
  16  *   Free Software Foundation, Inc.,                                       *
  17  *   51 Franklin Street, Fifth Floor, Boston, MA  02111-1307, USA.         *
  18  ***************************************************************************/
  19
  20 #include "PlaylistAlbumGroup.h"
  21
  22 #include "debug.h"
  23
  24 namespace Playlist {
  25
  26 AlbumGroup::AlbumGroup()
  27 {
  28     DEBUG_BLOCK
  29 }
  30
  31
  32 AlbumGroup::~AlbumGroup()
  33 {
  34     DEBUG_BLOCK
  35 }
  36
  37 }
  38
  39 void Playlist::AlbumGroup::addRow(int row)
  40 {
  41     DEBUG_BLOCK
  42
  43     //Does this row fit in any of our existing groups?
  44     bool inGroup = false;
  45     for ( int i = 0; i < m_groups.count(); i++ ) {
  46
  47         if ( m_groups[i].rows.last() == row - 1 ) {
  48             m_groups[i].rows.append( row );
  49             inGroup = true;
  50             break;
  51         }
  52     }
  53
  54     //no group found, create new one:
  55     if ( !inGroup ) {
  56         Group newGroup;
  57         newGroup.collapsed = false;
  58         newGroup.rows.append( row );
  59         m_groups.append( newGroup );
  60     }
  61 }
  62
  63 int Playlist::AlbumGroup::groupMode( int row )
  64 {
  65     DEBUG_BLOCK
  66
  67     foreach( Group group, m_groups ) {
  68         if ( group.rows.contains( row ) ) {
  69
  70             debug() << "row " << row << " is collapsed= " << group.collapsed;
  71
  72             if ( group.rows.count() < 2 )
  73                 return None;
  74             else if ( group.rows.first() == row ) {
  75                 if ( !group.collapsed )
  76                     return Head;
  77                 else
  78                     return Head_Collapsed;
  79             } else if ( group.rows.last() == row ) {
  80                 if ( !group.collapsed )
  81                     return End;
  82                 else
  83                 return Collapsed;
  84             } else {
  85                 if ( !group.collapsed )
  86                     return Body;
  87                 else
  88                     return Collapsed;
  89             }
  90         }
  91     }
  92
  93     return None;
  94
  95 }
  96
  97 void Playlist::AlbumGroup::setCollapsed(int row, bool collapsed)
  98 {
  99     DEBUG_BLOCK
 100     for (int i = 0; i < m_groups.count(); i++ ) {
 101         if ( m_groups[ i ].rows.contains( row ) ) {
 102             m_groups[ i ].collapsed = collapsed;
 103             debug() << "row " << row << " collapsed = " << m_groups[ i ].collapsed;
 104         }
 105     }
 106 }
 107
 108 int Playlist::AlbumGroup::elementsInGroup(int row)
 109 {
 110     DEBUG_BLOCK
 111     foreach( Group group, m_groups ) {
 112         if ( group.rows.contains( row ) ) {
 113             return group.rows.count();
 114         }
 115     }
 116
 117     return 0;
 118 }