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
230
231
232
233
234
235
236
237
238
239
|
// $Id: tag_find.cpp,v 1.28 2003/03/02 14:39:25 t1mpy Exp $
// id3lib: a C++ library for creating and manipulating id3v1/v2 tags
// Copyright 1999, 2000 Scott Thomas Haug
// This library is free software; you can redistribute it and/or modify it
// under the terms of the GNU Library General Public License as published by
// the Free Software Foundation; either version 2 of the License, or (at your
// option) any later version.
//
// This library is distributed in the hope that it will be useful, but WITHOUT
// ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
// FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public
// License for more details.
//
// You should have received a copy of the GNU Library General Public License
// along with this library; if not, write to the Free Software Foundation,
// Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
// The id3lib authors encourage improvements and optimisations to be sent to
// the id3lib coordinator. Please see the README file for details on where to
// send such submissions. See the AUTHORS file for a list of people who have
// contributed to id3lib. See the ChangeLog file for a list of changes to
// id3lib. These files are distributed with id3lib at
// http://download.sourceforge.net/id3lib/
#include "tag_impl.h" //has <stdio.h> "tag.h" "header_tag.h" "frame.h" "field.h" "spec.h" "id3lib_strings.h" "utils.h"
using namespace dami;
ID3_TagImpl::const_iterator ID3_TagImpl::Find(const ID3_Frame *frame) const
{
const_iterator cur = _frames.begin();
for (; cur != _frames.end(); ++cur)
{
if (*cur == frame)
{
break;
}
}
return cur;
}
ID3_TagImpl::iterator ID3_TagImpl::Find(const ID3_Frame *frame)
{
iterator cur = _frames.begin();
for (; cur != _frames.end(); ++cur)
{
if (*cur == frame)
{
break;
}
}
return cur;
}
ID3_Frame *ID3_TagImpl::Find(ID3_FrameID id) const
{
ID3_Frame *frame = NULL;
// reset the cursor if it isn't set
if (_frames.end() == _cursor)
{
_cursor = _frames.begin();
}
for (int iCount = 0; iCount < 2 && frame == NULL; iCount++)
{
// We want to cycle through the list to find the matching frame. We
// should begin from the cursor, search each successive frame, wrapping
// if necessary. The enclosing loop and the assignment statments below
// ensure that we first begin at the cursor and search to the end of the
// list and, if unsuccessful, start from the beginning of the list and
// search to the cursor.
const_iterator
begin = (0 == iCount ? _cursor : _frames.begin()),
end = (0 == iCount ? _frames.end() : _cursor);
// search from the cursor to the end
for (const_iterator cur = begin; cur != end; ++cur)
{
if ((*cur != NULL) && ((*cur)->GetID() == id))
{
// We've found a valid frame. Set the cursor to be the next element
frame = *cur;
_cursor = ++cur;
break;
}
}
}
return frame;
}
ID3_Frame *ID3_TagImpl::Find(ID3_FrameID id, ID3_FieldID fldID, String data) const
{
ID3_Frame *frame = NULL;
ID3D_NOTICE( "Find: looking for comment with data = " << data.c_str() );
// reset the cursor if it isn't set
if (_frames.end() == _cursor)
{
_cursor = _frames.begin();
ID3D_NOTICE( "Find: resetting cursor" );
}
for (int iCount = 0; iCount < 2 && frame == NULL; iCount++)
{
ID3D_NOTICE( "Find: iCount = " << iCount );
// We want to cycle through the list to find the matching frame. We
// should begin from the cursor, search each successive frame, wrapping
// if necessary. The enclosing loop and the assignment statments below
// ensure that we first begin at the cursor and search to the end of the
// list and, if unsuccessful, start from the beginning of the list and
// search to the cursor.
const_iterator
begin = (0 == iCount ? _cursor : _frames.begin()),
end = (0 == iCount ? _frames.end() : _cursor);
// search from the cursor to the end
for (const_iterator cur = begin; cur != end; ++cur)
{
ID3D_NOTICE( "Find: frame = 0x" << hex << (uint32) *cur << dec );
if ((*cur != NULL) && ((*cur)->GetID() == id) &&
(*cur)->Contains(fldID))
{
ID3_Field* fld = (*cur)->GetField(fldID);
if (NULL == fld)
{
continue;
ID3D_NOTICE( "Find: didn't have the right field" );
}
String text( NULL == fld->GetRawText() ? "" : fld->GetRawText() , fld->Size()); //PHF
ID3D_NOTICE( "Find: text = " << text.c_str() );
if (text == data)
{
// We've found a valid frame. Set cursor to be the next element
frame = *cur;
_cursor = ++cur;
break;
}
}
}
}
return frame;
}
ID3_Frame *ID3_TagImpl::Find(ID3_FrameID id, ID3_FieldID fldID, WString data) const
{
ID3_Frame *frame = NULL;
// reset the cursor if it isn't set
if (_frames.end() == _cursor)
{
_cursor = _frames.begin();
}
for (int iCount = 0; iCount < 2 && frame == NULL; iCount++)
{
// We want to cycle through the list to find the matching frame. We
// should begin from the cursor, search each successive frame, wrapping
// if necessary. The enclosing loop and the assignment statments below
// ensure that we first begin at the cursor and search to the end of the
// list and, if unsuccessful, start from the beginning of the list and
// search to the cursor.
const_iterator
begin = (0 == iCount ? _cursor : _frames.begin()),
end = (0 == iCount ? _frames.end() : _cursor);
// search from the cursor to the end
for (const_iterator cur = begin; cur != end; ++cur)
{
if ((*cur != NULL) && ((*cur)->GetID() == id) &&
(*cur)->Contains(fldID))
{
ID3_Field* fld = (*cur)->GetField(fldID);
if (NULL == fld)
{
continue;
}
WString text = toWString(fld->GetRawUnicodeText(), fld->Size());
if (text == data)
{
// We've found a valid frame. Set cursor to be the next element
frame = *cur;
_cursor = ++cur;
break;
}
}
}
}
return frame;
}
ID3_Frame *ID3_TagImpl::Find(ID3_FrameID id, ID3_FieldID fldID, uint32 data) const
{
ID3_Frame *frame = NULL;
// reset the cursor if it isn't set
if (_frames.end() == _cursor)
{
_cursor = _frames.begin();
}
for (int iCount = 0; iCount < 2 && frame == NULL; iCount++)
{
// We want to cycle through the list to find the matching frame. We
// should begin from the cursor, search each successive frame, wrapping
// if necessary. The enclosing loop and the assignment statments below
// ensure that we first begin at the cursor and search to the end of the
// list and, if unsuccessful, start from the beginning of the list and
// search to the cursor.
const_iterator
begin = (0 == iCount ? _cursor : _frames.begin()),
end = (0 == iCount ? _frames.end() : _cursor);
// search from the cursor to the end
for (const_iterator cur = begin; cur != end; ++cur)
{
if ((*cur != NULL) && ((*cur)->GetID() == id) &&
((*cur)->GetField(fldID)->Get() == data))
{
// We've found a valid frame. Set the cursor to be the next element
frame = *cur;
_cursor = ++cur;
break;
}
}
}
return frame;
}
|