80 lines
3.1 KiB
C++
80 lines
3.1 KiB
C++
/***************************************************************************
|
|
copyright : (C) 2002 - 2008 by Scott Wheeler
|
|
email : wheeler@kde.org
|
|
***************************************************************************/
|
|
|
|
/***************************************************************************
|
|
* This library is free software; you can redistribute it and/or modify *
|
|
* it under the terms of the GNU Lesser General Public License version *
|
|
* 2.1 as published by the Free Software Foundation. *
|
|
* *
|
|
* 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 *
|
|
* Lesser General Public License for more details. *
|
|
* *
|
|
* You should have received a copy of the GNU Lesser General Public *
|
|
* License along with this library; if not, write to the Free Software *
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA *
|
|
* 02110-1301 USA *
|
|
* *
|
|
* Alternatively, this file is available under the Mozilla Public *
|
|
* License Version 1.1. You may obtain a copy of the License at *
|
|
* http://www.mozilla.org/MPL/ *
|
|
***************************************************************************/
|
|
|
|
#include "tbytevectorlist.h"
|
|
|
|
using namespace Strawberry_TagLib::TagLib;
|
|
|
|
class ByteVectorListPrivate {};
|
|
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
// static members
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
|
|
ByteVectorList ByteVectorList::split(const ByteVector &v, const ByteVector &pattern, int byteAlign, int max) {
|
|
|
|
ByteVectorList l;
|
|
|
|
unsigned int previousOffset = 0;
|
|
for (int offset = v.find(pattern, 0, byteAlign); offset != -1 && (max == 0 || max > int(l.size()) + 1); offset = v.find(pattern, offset + pattern.size(), byteAlign)) {
|
|
if (offset - previousOffset >= 1)
|
|
l.append(v.mid(previousOffset, offset - previousOffset));
|
|
else
|
|
l.append(ByteVector());
|
|
|
|
previousOffset = offset + pattern.size();
|
|
}
|
|
|
|
if (previousOffset < v.size())
|
|
l.append(v.mid(previousOffset, v.size() - previousOffset));
|
|
|
|
return l;
|
|
|
|
}
|
|
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
// public members
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
|
|
ByteVectorList::ByteVectorList() : d(nullptr) {}
|
|
|
|
ByteVectorList::~ByteVectorList() {}
|
|
|
|
ByteVector ByteVectorList::toByteVector(const ByteVector &separator) const {
|
|
|
|
ByteVector v;
|
|
|
|
ConstIterator it = begin();
|
|
|
|
while (it != end()) {
|
|
v.append(*it);
|
|
it++;
|
|
if (it != end()) v.append(separator);
|
|
}
|
|
|
|
return v;
|
|
|
|
}
|