qmmp - Qmmp with Jyrki's patches

diff options

author	trialuser02 <trialuser02@90c681e8-e032-0410-971d-27865f9a5e38>	2017-10-28 12:03:40 +0000
committer	trialuser02 <trialuser02@90c681e8-e032-0410-971d-27865f9a5e38>	2017-10-28 12:03:40 +0000
commit	79d7c92077348383647e90578eb62c8b991d4dab (patch)
tree	4403f6e412e5b9865445ca834796daaaccc1809d /src/plugins/Ui/skinned/eqgraph.cpp
parent	c535c420112581b38fbf775f003eaae3edd5f1c1 (diff)
download	qmmp-79d7c92077348383647e90578eb62c8b991d4dab.tar.gz qmmp-79d7c92077348383647e90578eb62c8b991d4dab.tar.bz2 qmmp-79d7c92077348383647e90578eb62c8b991d4dab.zip

fixed documentation

git-svn-id: http://svn.code.sf.net/p/qmmp-dev/code/trunk/qmmp@7660 90c681e8-e032-0410-971d-27865f9a5e38

Diffstat (limited to 'src/plugins/Ui/skinned/eqgraph.cpp')

0 files changed, 0 insertions, 0 deletions

/*************************************************************************** * Copyright (C) 2013 by Ilya Kotov * * forkotov02@hotmail.ru * * * * This program is free software; you can redistribute it and/or modify * * it under the terms of the GNU General Public License as published by * * the Free Software Foundation; either version 2 of the License, or * * (at your option) any later version. * * * * This program 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 General Public License for more details. * * * * You should have received a copy of the GNU General Public License * * along with this program; if not, write to the * * Free Software Foundation, Inc., * * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. * ***************************************************************************/ #include "normalcontainer_p.h" NormalContainer::NormalContainer() {} NormalContainer::~NormalContainer() { clear(); } void NormalContainer::addTracks(QList<PlayListTrack *> tracks) { foreach (PlayListTrack *track, tracks) { m_items.append(track); } } void NormalContainer::insertTrack(int index, PlayListTrack *track) { if(index >= 0 && index < m_items.count()) m_items.insert(index, track); else m_items.append(track); } void NormalContainer::replaceTracks(QList<PlayListTrack *> tracks) { m_items.clear(); addTracks(tracks); } QList<PlayListGroup *> NormalContainer::groups() const { return QList<PlayListGroup *>(); } QList<PlayListTrack *> NormalContainer::tracks() const { QList<PlayListTrack *> trackList; for(int i = 0; i < m_items.count(); ++i) trackList.append(dynamic_cast<PlayListTrack *>(m_items[i])); return trackList; } QList<PlayListItem *> NormalContainer::items() const { return m_items; } int NormalContainer::count() const { return m_items.count(); } int NormalContainer::trackCount() const { return m_items.count(); } QList<PlayListItem *> NormalContainer::mid(int pos, int count) const { return m_items.mid(pos, count); } bool NormalContainer::isEmpty() const { return m_items.isEmpty(); } bool NormalContainer::isSelected(int index) const { if (0 <= index && index < m_items.count()) return m_items.at(index)->isSelected(); return false; } void NormalContainer::setSelected(int index, bool selected) { if (0 <= index && index < m_items.count()) m_items.at(index)->setSelected(selected); } void NormalContainer::clearSelection() { foreach (PlayListItem *item, m_items) { item->setSelected(false); } } int NormalContainer::indexOf(PlayListItem *item) const { return m_items.indexOf(item); } PlayListItem *NormalContainer::item(int index) const { if(index >= count() || index < 0) { qWarning("NormalContainer: index is out of range"); return 0; } return m_items.at(index); } PlayListTrack *NormalContainer::track(int index) const { PlayListItem *i = item(index); return dynamic_cast<PlayListTrack *> (i); } PlayListGroup *NormalContainer::group(int index) const { Q_UNUSED(index); return 0; } bool NormalContainer::contains(PlayListItem *item) const { return m_items.contains(item); } int NormalContainer::numberOfTrack(int index) const { return index; } PlayListTrack *NormalContainer::findTrack(int number) const { if(number >= count() || number < 0) { return 0; } return dynamic_cast<PlayListTrack *> (m_items.at(number)); } void NormalContainer::removeTrack(PlayListTrack *track) { m_items.removeAll(track); } void NormalContainer::removeTracks(QList<PlayListTrack *> tracks) { foreach(PlayListTrack *t, tracks) removeTrack(t); } bool NormalContainer::move(QList<int> indexes, int from, int to) { if (from > to) { foreach(int i, indexes) { if (i + to - from < 0) break; else m_items.move(i,i + to - from); } } else { for (int i = indexes.count() - 1; i >= 0; i--) { if (indexes[i] + to - from >= m_items.count()) break; else m_items.move(indexes[i], indexes[i] + to - from); } } return true; } QList<PlayListTrack *> NormalContainer::takeAllTracks() { QList<PlayListTrack *> tracks; while(!m_items.isEmpty()) tracks.append(dynamic_cast<PlayListTrack *>(m_items.takeFirst())); return tracks; } void NormalContainer::clear() { qDeleteAll(m_items); m_items.clear(); } void NormalContainer::reverseList() { for (int i = 0; i < m_items.size()/2; i++) m_items.swap(i, m_items.size() - i - 1); } void NormalContainer::randomizeList() { for (int i = 0; i < m_items.size(); i++) m_items.swap(qrand()%m_items.size(), qrand()%m_items.size()); }


context:
space:
mode: