mirror of
https://github.com/taglib/taglib.git
synced 2025-05-27 21:20:26 -04:00
Many shadowFunction, some useStlAlgorithm, and others. cppcheck --enable=all --inline-suppr \ --suppress=noExplicitConstructor --suppress=unusedFunction \ --suppress=missingIncludeSystem --project=compile_commands.json
237 lines
6.7 KiB
C++
237 lines
6.7 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 "tagunion.h"
|
|
|
|
#include <array>
|
|
|
|
#include "tstringlist.h"
|
|
#include "tpropertymap.h"
|
|
|
|
using namespace TagLib;
|
|
|
|
#define stringUnion(method) \
|
|
do { \
|
|
if(tag(0) && !tag(0)->method().isEmpty()) \
|
|
return tag(0)->method(); \
|
|
if(tag(1) && !tag(1)->method().isEmpty()) \
|
|
return tag(1)->method(); \
|
|
if(tag(2) && !tag(2)->method().isEmpty()) \
|
|
return tag(2)->method(); \
|
|
return String(); \
|
|
} while(0)
|
|
|
|
#define numberUnion(method) \
|
|
do { \
|
|
if(tag(0) && tag(0)->method() > 0) \
|
|
return tag(0)->method(); \
|
|
if(tag(1) && tag(1)->method() > 0) \
|
|
return tag(1)->method(); \
|
|
if(tag(2) && tag(2)->method() > 0) \
|
|
return tag(2)->method(); \
|
|
return 0; \
|
|
} while(0)
|
|
|
|
#define setUnion(method, value) \
|
|
do { \
|
|
if(tag(0)) \
|
|
tag(0)->set##method(value); \
|
|
if(tag(1)) \
|
|
tag(1)->set##method(value); \
|
|
if(tag(2)) \
|
|
tag(2)->set##method(value); \
|
|
} while(0)
|
|
|
|
class TagUnion::TagUnionPrivate
|
|
{
|
|
public:
|
|
TagUnionPrivate() = default;
|
|
~TagUnionPrivate()
|
|
{
|
|
for(Tag *tag : tags)
|
|
delete tag;
|
|
}
|
|
|
|
TagUnionPrivate(const TagUnionPrivate &) = delete;
|
|
TagUnionPrivate &operator=(const TagUnionPrivate &) = delete;
|
|
|
|
std::array<Tag *, 3> tags { nullptr, nullptr, nullptr };
|
|
};
|
|
|
|
TagUnion::TagUnion(Tag *first, Tag *second, Tag *third) :
|
|
d(std::make_unique<TagUnionPrivate>())
|
|
{
|
|
d->tags = { first, second, third };
|
|
}
|
|
|
|
TagUnion::~TagUnion() = default;
|
|
|
|
Tag *TagUnion::operator[](int index) const
|
|
{
|
|
return tag(index);
|
|
}
|
|
|
|
Tag *TagUnion::tag(int index) const
|
|
{
|
|
return d->tags[index];
|
|
}
|
|
|
|
void TagUnion::set(int index, Tag *tag)
|
|
{
|
|
delete d->tags[index];
|
|
d->tags[index] = tag;
|
|
}
|
|
|
|
PropertyMap TagUnion::properties() const
|
|
{
|
|
auto it = std::find_if(d->tags.cbegin(), d->tags.cend(), [](Tag *t) {
|
|
return t && !t->isEmpty();
|
|
});
|
|
return it != d->tags.cend() ? (*it)->properties() : PropertyMap();
|
|
}
|
|
|
|
void TagUnion::removeUnsupportedProperties(const StringList &unsupported)
|
|
{
|
|
for(const auto &t : d->tags) {
|
|
if(t) {
|
|
t->removeUnsupportedProperties(unsupported);
|
|
}
|
|
}
|
|
}
|
|
|
|
StringList TagUnion::complexPropertyKeys() const
|
|
{
|
|
for(const auto &t : d->tags) {
|
|
if(t) {
|
|
const StringList keys = t->complexPropertyKeys();
|
|
if(!keys.isEmpty()) {
|
|
return keys;
|
|
}
|
|
}
|
|
}
|
|
return StringList();
|
|
}
|
|
|
|
List<VariantMap> TagUnion::complexProperties(const String &key) const
|
|
{
|
|
for(const auto &t : d->tags) {
|
|
if(t) {
|
|
const List<VariantMap> props = t->complexProperties(key);
|
|
if(!props.isEmpty()) {
|
|
return props;
|
|
}
|
|
}
|
|
}
|
|
return List<VariantMap>();
|
|
}
|
|
|
|
bool TagUnion::setComplexProperties(const String &key, const List<VariantMap> &value)
|
|
{
|
|
bool combinedResult = false;
|
|
for(const auto &t : d->tags) {
|
|
if(t) {
|
|
if(t->setComplexProperties(key, value)) {
|
|
combinedResult = true;
|
|
}
|
|
}
|
|
}
|
|
return combinedResult;
|
|
}
|
|
|
|
String TagUnion::title() const
|
|
{
|
|
stringUnion(title);
|
|
}
|
|
|
|
String TagUnion::artist() const
|
|
{
|
|
stringUnion(artist);
|
|
}
|
|
|
|
String TagUnion::album() const
|
|
{
|
|
stringUnion(album);
|
|
}
|
|
|
|
String TagUnion::comment() const
|
|
{
|
|
stringUnion(comment);
|
|
}
|
|
|
|
String TagUnion::genre() const
|
|
{
|
|
stringUnion(genre);
|
|
}
|
|
|
|
unsigned int TagUnion::year() const
|
|
{
|
|
numberUnion(year);
|
|
}
|
|
|
|
unsigned int TagUnion::track() const
|
|
{
|
|
numberUnion(track);
|
|
}
|
|
|
|
void TagUnion::setTitle(const String &s)
|
|
{
|
|
setUnion(Title, s);
|
|
}
|
|
|
|
void TagUnion::setArtist(const String &s)
|
|
{
|
|
setUnion(Artist, s);
|
|
}
|
|
|
|
void TagUnion::setAlbum(const String &s)
|
|
{
|
|
setUnion(Album, s);
|
|
}
|
|
|
|
void TagUnion::setComment(const String &s)
|
|
{
|
|
setUnion(Comment, s);
|
|
}
|
|
|
|
void TagUnion::setGenre(const String &s)
|
|
{
|
|
setUnion(Genre, s);
|
|
}
|
|
|
|
void TagUnion::setYear(unsigned int i)
|
|
{
|
|
setUnion(Year, i);
|
|
}
|
|
|
|
void TagUnion::setTrack(unsigned int i)
|
|
{
|
|
setUnion(Track, i);
|
|
}
|
|
|
|
bool TagUnion::isEmpty() const
|
|
{
|
|
return std::none_of(d->tags.begin(), d->tags.end(), [](auto t) { return t && !t->isEmpty(); });
|
|
}
|