summaryrefslogtreecommitdiffstats
path: root/src/base/ViewElement.cpp
diff options
context:
space:
mode:
authortpearson <tpearson@283d02a7-25f6-0310-bc7c-ecb5cbfe19da>2010-03-01 18:37:05 +0000
committertpearson <tpearson@283d02a7-25f6-0310-bc7c-ecb5cbfe19da>2010-03-01 18:37:05 +0000
commit145364a8af6a1fec06556221e66d4b724a62fc9a (patch)
tree53bd71a544008c518034f208d64c932dc2883f50 /src/base/ViewElement.cpp
downloadrosegarden-145364a8af6a1fec06556221e66d4b724a62fc9a.tar.gz
rosegarden-145364a8af6a1fec06556221e66d4b724a62fc9a.zip
Added old abandoned KDE3 version of the RoseGarden MIDI tool
git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/applications/rosegarden@1097595 283d02a7-25f6-0310-bc7c-ecb5cbfe19da
Diffstat (limited to 'src/base/ViewElement.cpp')
-rw-r--r--src/base/ViewElement.cpp172
1 files changed, 172 insertions, 0 deletions
diff --git a/src/base/ViewElement.cpp b/src/base/ViewElement.cpp
new file mode 100644
index 0000000..425bdc1
--- /dev/null
+++ b/src/base/ViewElement.cpp
@@ -0,0 +1,172 @@
+// -*- c-basic-offset: 4 -*-
+
+/*
+ Rosegarden
+ A sequencer and musical notation editor.
+
+ This program is Copyright 2000-2008
+ Guillaume Laurent <[email protected]>,
+ Chris Cannam <[email protected]>,
+ Richard Bown <[email protected]>
+
+ The moral right of the authors to claim authorship of this work
+ has been asserted.
+
+ 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. See the file
+ COPYING included with this distribution for more information.
+*/
+
+#include "ViewElement.h"
+#include <iostream>
+#include <cassert>
+
+namespace Rosegarden
+{
+
+extern const int MIN_SUBORDERING;
+
+ViewElement::ViewElement(Event *e) :
+ m_layoutX(0.0),
+ m_layoutY(0.0),
+ m_event(e)
+{
+ // nothing
+}
+
+ViewElement::~ViewElement()
+{
+ // nothing
+}
+
+//////////////////////////////////////////////////////////////////////
+
+bool
+operator<(const ViewElement &a, const ViewElement &b)
+{
+ timeT at = a.getViewAbsoluteTime(), bt = b.getViewAbsoluteTime();
+/*
+ if (at < bt) {
+ if (!(*(a.event()) < *(b.event()))) {
+ std::cerr << " types: a: " << a.event()->getType() << " b: " << b.event()->getType() << std::endl;
+ std::cerr << "performed: a: " << a.event()->getAbsoluteTime() << " b: " << b.event()->getAbsoluteTime() << std::endl;
+ std::cerr << " notated: a: " << a.getViewAbsoluteTime() << " b: " << b.getViewAbsoluteTime() << std::endl;
+// assert(*(a.event()) < *(b.event()));
+ }
+ }
+ else if (at > bt) {
+ if (*(a.event()) < *(b.event())) {
+ std::cerr << " types: a: " << a.event()->getType() << " b: " << b.event()->getType() << std::endl;
+ std::cerr << "performed: a: " << a.event()->getAbsoluteTime() << " b: " << b.event()->getAbsoluteTime() << std::endl;
+ std::cerr << " notated: a: " << a.getViewAbsoluteTime() << " b: " << b.getViewAbsoluteTime() << std::endl;
+// assert(!(*(a.event()) < *(b.event())));
+ }
+ }
+*/
+ if (at == bt) return *(a.event()) < *(b.event());
+ else return (at < bt);
+}
+
+//////////////////////////////////////////////////////////////////////
+
+
+ViewElementList::~ViewElementList()
+{
+ for (iterator i = begin(); i != end(); ++i) {
+ delete (*i);
+ }
+}
+
+void
+ViewElementList::insert(ViewElement* el)
+{
+ set_type::insert(el);
+}
+
+void
+ViewElementList::erase(iterator pos)
+{
+ delete *pos;
+ set_type::erase(pos);
+}
+
+void
+ViewElementList::erase(iterator from, iterator to)
+{
+ for (iterator i = from; i != to; ++i) {
+ delete *i;
+ }
+
+ set_type::erase(from, to);
+}
+
+void
+ViewElementList::eraseSingle(ViewElement *el)
+{
+ iterator elPos = findSingle(el);
+ if (elPos != end()) erase(elPos);
+}
+
+ViewElementList::iterator
+ViewElementList::findPrevious(const std::string &type, iterator i)
+
+{
+ // what to return on failure? I think probably
+ // end(), as begin() could be a success case
+ if (i == begin()) return end();
+ --i;
+ for (;;) {
+ if ((*i)->event()->isa(type)) return i;
+ if (i == begin()) return end();
+ --i;
+ }
+}
+
+ViewElementList::iterator
+ViewElementList::findNext(const std::string &type, iterator i)
+{
+ if (i == end()) return i;
+ for (++i; i != end() && !(*i)->event()->isa(type); ++i);
+ return i;
+}
+
+ViewElementList::iterator
+ViewElementList::findSingle(ViewElement *el)
+{
+ iterator res = end();
+
+ std::pair<iterator, iterator> interval = equal_range(el);
+
+ for (iterator i = interval.first; i != interval.second; ++i) {
+ if (*i == el) {
+ res = i;
+ break;
+ }
+ }
+
+ return res;
+}
+
+ViewElementList::iterator
+ViewElementList::findTime(timeT time)
+{
+ Event dummy("dummy", time, 0, MIN_SUBORDERING);
+ ViewElement dummyT(&dummy);
+ return lower_bound(&dummyT);
+}
+
+ViewElementList::iterator
+ViewElementList::findNearestTime(timeT t)
+{
+ iterator i = findTime(t);
+ if (i == end() || (*i)->getViewAbsoluteTime() > t) {
+ if (i == begin()) return end();
+ else --i;
+ }
+ return i;
+}
+
+}
+