mg_content_interface.c


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229

/*! \file  mg_content_interface.c
 *  \brief  Data Objects for content (e.g. mp3 files, movies) for the vdr muggle plugin
 *
 * \version $Revision: 1.6 $
 * \date    $Date$
 * \author  Ralf Klueber, Lars von Wedel, Andreas Kellner
 * \author  Responsible author: $Author$
 *
 * Implements main classes of for content items and abstract interfaces to media access
 *
 * This file implements the following classes 
 *   - mgContentItem
 *   - mgTracklist
 *   - mgSelectionTreeNode
 */
#define DEBUG

#include "mg_content_interface.h"
#include "mg_tools.h"

using namespace std;

//! \brief a special item representing an undefined state
mgContentItem mgContentItem::UNDEFINED = mgContentItem();

mgTracklist::mgTracklist()
{
 
}

mgTracklist::~mgTracklist()
{
  mgContentItem* ptr;
  vector<mgContentItem*>::iterator iter;
  
  for( iter = m_list.begin(); iter != m_list.end(); iter++ )
  {
    ptr = *iter;
    delete ptr;
  }
  m_list.clear();
}

vector<mgContentItem*> *mgTracklist::getAll()
{
  return &m_list;
}

unsigned int mgTracklist::getNumItems()
{
  return m_list.size();
}

void mgTracklist::shuffle()
{
  random_shuffle( m_list.begin(), m_list.end () );
}

void mgTracklist::sortBy(int col, bool direction)
{
}

void mgTracklist::setDisplayColumns(vector<int> cols)
{    
  m_columns = cols;
}

unsigned int mgTracklist::getNumColumns()
{
  return m_columns.size();
}

string mgTracklist::getLabel(unsigned int position, const string separator)
{
    string label = "";
    mgContentItem* item;

    if( position >= m_list.size() )
      {
	return "";
      }
    else 
      {
	item = *( m_list.begin() + position );
      }     

    for( vector<int>::iterator iter = m_columns.begin();
	 iter != m_columns.end(); iter++ )
      {
	if( iter != m_columns.begin() )
	  {
	    label += separator;
	  }
	label += item->getLabel(*iter);
      }
    return label;
}
  
mgContentItem* mgTracklist::getItem(unsigned int position)
{
  if( position >= m_list.size() )
    {
      return &(mgContentItem::UNDEFINED); //invalid
    }
  return *( m_list.begin() + position);
}

bool mgTracklist::remove(unsigned int position)       
{
  bool result = false;

  if( position < m_list.size() ) 
    {
      vector<mgContentItem*>::iterator iter;
      
      iter = m_list.begin() + position;
      m_list.erase(iter);
      
      result = true;
    }
  
  return result;
}

int mgTracklist::remove(mgContentItem* item) 
{
  int retval = 0;
  vector<mgContentItem*>::iterator iter;
  
  for( iter = m_list.begin(); iter != m_list.end (); iter++ )
    {
      if( *iter == item ) 
	{
	  m_list.erase(iter);
	  retval++;
	  break;
	}
    }
  return retval;
}

mgSelectionTreeNode::mgSelectionTreeNode(MYSQL db, int view)
{
    m_db = db;
    m_parent = NULL;
    m_level = 0;
    m_view = view;
    m_id = "";
    m_label = "ROOT";
    m_expanded = false;
}
mgSelectionTreeNode::mgSelectionTreeNode(mgSelectionTreeNode* parent, string id, string label)
{
    m_parent = parent;
    m_level  = m_parent->m_level+1;
    m_view   = m_parent->m_view;
    m_db     = m_parent->m_db;
    m_id = id;
    m_label = label;
    m_expanded = false;
}

mgSelectionTreeNode::~mgSelectionTreeNode() 
{
  collapse();
  // TODO - lvw
  //    _children.clear();
}

mgSelectionTreeNode*  mgSelectionTreeNode::getParent()
{
  if (m_view < 100 || m_level > 1) 
    {
      return  m_parent;
    } 
  else 
    {
      return NULL;
    }
}

void mgSelectionTreeNode::collapse() // removes all children (recursively)
{
  vector <mgSelectionTreeNode*>::iterator iter;
  mgSelectionTreeNode* ptr;

  for(iter = m_children.begin(); iter != m_children.end();iter++)
    {
      ptr = *iter;
      delete ptr;
    }
  m_expanded = false;
  m_children.clear();
}

vector<mgSelectionTreeNode*> &mgSelectionTreeNode::getChildren()
{
  // mgDebug(5," returning %d children", m_children.size());
  return m_children;
}

string mgSelectionTreeNode::getID()
{
  return m_id;
}

string mgSelectionTreeNode::getLabel()
{
  return m_label;
}

string mgSelectionTreeNode::getLabel(int n)
{
  mgSelectionTreeNode* node = this;
  int d = m_level;
  while(n < d)
    {
      // TODO: check for NULL
      node = node->m_parent;
      d--;
    }
  
  return node->m_label;
} 

string mgSelectionTreeNode::getRestrictions()
{
  return m_restriction;
}