1 /***************************************************************************
2 copyright : (C) 2002 - 2008 by Scott Wheeler
3 email : wheeler@kde.org
4 ***************************************************************************/
6 /***************************************************************************
7 * This library is free software; you can redistribute it and/or modify *
8 * it under the terms of the GNU Lesser General Public License version *
9 * 2.1 as published by the Free Software Foundation. *
11 * This library is distributed in the hope that it will be useful, but *
12 * WITHOUT ANY WARRANTY; without even the implied warranty of *
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU *
14 * Lesser General Public License for more details. *
16 * You should have received a copy of the GNU Lesser General Public *
17 * License along with this library; if not, write to the Free Software *
18 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 *
21 * Alternatively, this file is available under the Mozilla Public *
22 * License Version 1.1. You may obtain a copy of the License at *
23 * http://www.mozilla.org/MPL/ *
24 ***************************************************************************/
26 #include "tbytevectorlist.h"
28 using namespace TagLib;
30 class ByteVectorListPrivate
35 ////////////////////////////////////////////////////////////////////////////////
37 ////////////////////////////////////////////////////////////////////////////////
39 ByteVectorList ByteVectorList::split(const ByteVector &v, const ByteVector &pattern,
42 return split(v, pattern, byteAlign, 0);
45 ByteVectorList ByteVectorList::split(const ByteVector &v, const ByteVector &pattern,
46 int byteAlign, int max)
50 uint previousOffset = 0;
51 for(int offset = v.find(pattern, 0, byteAlign);
52 offset != -1 && (max == 0 || max > int(l.size()) + 1);
53 offset = v.find(pattern, offset + pattern.size(), byteAlign))
55 if(offset - previousOffset >= 1)
56 l.append(v.mid(previousOffset, offset - previousOffset));
58 l.append(ByteVector::null);
60 previousOffset = offset + pattern.size();
63 if(previousOffset < v.size())
64 l.append(v.mid(previousOffset, v.size() - previousOffset));
69 ////////////////////////////////////////////////////////////////////////////////
71 ////////////////////////////////////////////////////////////////////////////////
73 ByteVectorList::ByteVectorList() : List<ByteVector>()
78 ByteVectorList::ByteVectorList(const ByteVectorList &l) : List<ByteVector>(l)
83 ByteVectorList::~ByteVectorList()
88 ByteVector ByteVectorList::toByteVector(const ByteVector &separator) const
92 ConstIterator it = begin();