2012-10-02 09:12:39 +02:00
|
|
|
/****************************************************************************
|
2011-12-13 12:15:30 +01:00
|
|
|
**
|
2013-01-28 17:12:19 +01:00
|
|
|
** Copyright (C) 2013 Digia Plc and/or its subsidiary(-ies).
|
2012-10-02 09:12:39 +02:00
|
|
|
** Contact: http://www.qt-project.org/legal
|
2011-12-13 12:15:30 +01:00
|
|
|
**
|
2012-10-02 09:12:39 +02:00
|
|
|
** This file is part of Qt Creator.
|
2011-12-13 12:15:30 +01:00
|
|
|
**
|
2012-10-02 09:12:39 +02:00
|
|
|
** Commercial License Usage
|
|
|
|
|
** Licensees holding valid commercial Qt licenses may use this file in
|
|
|
|
|
** accordance with the commercial license agreement provided with the
|
|
|
|
|
** Software or, alternatively, in accordance with the terms contained in
|
|
|
|
|
** a written agreement between you and Digia. For licensing terms and
|
|
|
|
|
** conditions see http://qt.digia.com/licensing. For further information
|
|
|
|
|
** use the contact form at http://qt.digia.com/contact-us.
|
2011-12-13 12:15:30 +01:00
|
|
|
**
|
|
|
|
|
** GNU Lesser General Public License Usage
|
2012-10-02 09:12:39 +02:00
|
|
|
** Alternatively, this file may be used under the terms of the GNU Lesser
|
|
|
|
|
** General Public License version 2.1 as published by the Free Software
|
|
|
|
|
** Foundation and appearing in the file LICENSE.LGPL included in the
|
|
|
|
|
** packaging of this file. Please review the following information to
|
|
|
|
|
** ensure the GNU Lesser General Public License version 2.1 requirements
|
|
|
|
|
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
|
|
|
|
|
**
|
|
|
|
|
** In addition, as a special exception, Digia gives you certain additional
|
|
|
|
|
** rights. These rights are described in the Digia Qt LGPL Exception
|
2011-12-13 12:15:30 +01:00
|
|
|
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
|
|
|
|
|
**
|
2012-10-02 09:12:39 +02:00
|
|
|
****************************************************************************/
|
2011-12-13 12:15:30 +01:00
|
|
|
|
|
|
|
|
#include "circularclipboard.h"
|
|
|
|
|
|
|
|
|
|
using namespace TextEditor::Internal;
|
|
|
|
|
|
|
|
|
|
static const int kMaxSize = 10;
|
|
|
|
|
|
|
|
|
|
CircularClipboard::CircularClipboard()
|
|
|
|
|
: m_current(-1)
|
|
|
|
|
{}
|
|
|
|
|
|
|
|
|
|
CircularClipboard::~CircularClipboard()
|
|
|
|
|
{
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
CircularClipboard *CircularClipboard::instance()
|
|
|
|
|
{
|
|
|
|
|
static CircularClipboard clipboard;
|
|
|
|
|
return &clipboard;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void CircularClipboard::collect(const QMimeData *mimeData)
|
2012-03-12 17:38:54 +01:00
|
|
|
{
|
|
|
|
|
collect(QSharedPointer<const QMimeData>(mimeData));
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void CircularClipboard::collect(const QSharedPointer<const QMimeData> &mimeData)
|
2011-12-13 12:15:30 +01:00
|
|
|
{
|
2012-03-12 17:34:07 +01:00
|
|
|
//Avoid duplicates
|
|
|
|
|
const QString text = mimeData->text();
|
2012-03-12 17:38:54 +01:00
|
|
|
for (QList< QSharedPointer<const QMimeData> >::iterator i = m_items.begin(); i != m_items.end(); ++i) {
|
2012-03-12 17:34:07 +01:00
|
|
|
if (mimeData == *i || text == (*i)->text()) {
|
|
|
|
|
m_items.erase(i);
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
2012-03-12 17:38:54 +01:00
|
|
|
if (m_items.size() >= kMaxSize)
|
2011-12-13 12:15:30 +01:00
|
|
|
m_items.removeLast();
|
|
|
|
|
m_items.prepend(mimeData);
|
|
|
|
|
}
|
|
|
|
|
|
2012-03-12 17:38:54 +01:00
|
|
|
QSharedPointer<const QMimeData> CircularClipboard::next() const
|
2011-12-13 12:15:30 +01:00
|
|
|
{
|
|
|
|
|
if (m_items.isEmpty())
|
2012-03-12 17:38:54 +01:00
|
|
|
return QSharedPointer<const QMimeData>();
|
2011-12-13 12:15:30 +01:00
|
|
|
|
|
|
|
|
if (m_current == m_items.length() - 1)
|
|
|
|
|
m_current = 0;
|
|
|
|
|
else
|
|
|
|
|
++m_current;
|
|
|
|
|
|
|
|
|
|
return m_items.at(m_current);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void CircularClipboard::toLastCollect()
|
|
|
|
|
{
|
|
|
|
|
m_current = -1;
|
|
|
|
|
}
|
2012-03-12 17:38:54 +01:00
|
|
|
|
|
|
|
|
int CircularClipboard::size() const
|
|
|
|
|
{
|
|
|
|
|
return m_items.size();
|
|
|
|
|
}
|