Added old abandoned KDE3 version of koffice

git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/applications/koffice@1077364 283d02a7-25f6-0310-bc7c-ecb5cbfe19da

1 files changed, 193 insertions, 0 deletions

diff --git a/kplato/kpteffortcostmap.h b/kplato/kpteffortcostmap.h
new file mode 100644
index 00000000..7317d400
--- /dev/null
+++ b/kplato/kpteffortcostmap.h
@@ -0,0 +1,193 @@
+/* This file is part of the KDE project
+   Copyright (C) 2005 Dag Andersen <danders@get2net.dk>
+
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Library General Public
+   License as published by the Free Software Foundation;
+   version 2 of the License.
+
+   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
+   Library General Public License for more details.
+
+   You should have received a copy of the GNU Library General Public License
+   along with this library; see the file COPYING.LIB.  If not, write to
+   the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
+   Boston, MA 02110-1301, USA.
+*/
+
+#ifndef KPTEFFORTCOST_H
+#define KPTEFFORTCOST_H
+
+#include <qdatetime.h>
+#include <qmap.h>
+
+#include "kptduration.h"
+
+#include <kdebug.h>
+
+namespace KPlato
+{
+
+class EffortCost
+{
+public:
+    EffortCost()
+        : m_effort(Duration::zeroDuration),
+          m_cost(0)
+    {}
+    EffortCost(const Duration &effort, const double cost)
+        : m_effort(effort),
+          m_cost(cost) {
+        //kdDebug()<<k_funcinfo<<endl;
+    }
+    ~EffortCost() {
+        //kdDebug()<<k_funcinfo<<endl;
+    }
+    Duration effort() const { return m_effort; }
+    double cost() const { return m_cost; }
+    void setCost(double cost) { m_cost = cost; }
+    void add(const Duration &effort, const double cost) {
+        m_effort += effort;
+        m_cost += cost;
+    }
+    EffortCost &operator+=(const EffortCost &ec) {
+        add(ec.effort(), ec.cost());
+        return *this;
+    }
+private:
+    Duration m_effort;
+    double m_cost;
+};
+typedef QMap<QDate, EffortCost> EffortCostDayMap;
+class EffortCostMap
+{
+public:
+    EffortCostMap()
+        : m_days() {
+        //kdDebug()<<k_funcinfo<<endl; 
+    }
+    ~EffortCostMap() {
+        //kdDebug()<<k_funcinfo<<endl;
+        m_days.clear();
+    }
+    
+    EffortCost effortCost(const QDate &date) const {
+        EffortCost ec;
+        if (!date.isValid()) {
+            kdError()<<k_funcinfo<<"Date not valid"<<endl;
+            return ec;
+        }
+        EffortCostDayMap::const_iterator it = m_days.find(date);
+        if (it != m_days.end())
+            ec = it.data();
+        return ec;
+    }
+    void insert(const QDate &date, const Duration &effort, const double cost) {
+        if (!date.isValid()) {
+            kdError()<<k_funcinfo<<"Date not valid"<<endl;
+            return;
+        }
+        m_days.insert(date, EffortCost(effort, cost));
+    }
+    /** 
+     * If data for this date allready exists add the new values to the old,
+     * else the new values are inserted.
+     */
+    EffortCost &add(const QDate &date, const Duration &effort, const double cost) {
+        return add(date, EffortCost(effort, cost));
+    }
+    /** 
+     * If data for this date allready exists add the new values to the old,
+     * else the new value is inserted.
+     */
+    EffortCost &add(const QDate &date, const EffortCost &ec) {
+        if (!date.isValid()) {
+            kdError()<<k_funcinfo<<"Date not valid"<<endl;
+            return zero();
+        }
+        //kdDebug()<<k_funcinfo<<date.toString()<<endl;
+        return m_days[date] += ec;
+    }
+    
+    bool isEmpty() const {
+        return m_days.isEmpty();
+    }
+    
+    EffortCostDayMap days() const { return m_days; }
+    
+    EffortCostMap &operator+=(const EffortCostMap &ec) {
+        //kdDebug()<<k_funcinfo<<"me="<<m_days.count()<<" ec="<<ec.days().count()<<endl;
+        if (ec.isEmpty()) {
+            return *this;
+        }
+        if (isEmpty()) {
+            m_days = ec.days();
+            return *this;
+        }
+        EffortCostDayMap::const_iterator it;
+        for(it = ec.days().constBegin(); it != ec.days().constEnd(); ++it) {
+            add(it.key(), it.data());
+        }
+        return *this;
+    }
+    EffortCost &effortCostOnDate(const QDate &date) {
+        return m_days[date];
+    }
+    /// Return total cost for the next num days starting at date
+    double cost(const QDate &date, int num=7) {
+        double r=0.0;
+        for (int i=0; i < num; ++i) {
+            r += costOnDate(date.addDays(i));
+        }
+        return r;
+    }
+    double costOnDate(const QDate &date) const {
+        if (!date.isValid()) {
+            kdError()<<k_funcinfo<<"Date not valid"<<endl;
+            return 0.0;
+        }
+        if (m_days.contains(date)) {
+            return m_days[date].cost();
+        }
+        return 0.0;
+    }
+    Duration effortOnDate(const QDate &date) const {
+        if (!date.isValid()) {
+            kdError()<<k_funcinfo<<"Date not valid"<<endl;
+            return Duration::zeroDuration;
+        }
+        if (m_days.contains(date)) {
+            return m_days[date].effort();
+        }
+        return Duration::zeroDuration;
+    }
+    double totalCost() const {
+        double cost = 0.0;
+        EffortCostDayMap::const_iterator it;
+        for(it = m_days.constBegin(); it != m_days.constEnd(); ++it) {
+            cost += it.data().cost();
+        }
+        return cost;
+    }
+    Duration totalEffort() const {
+        Duration eff;
+        EffortCostDayMap::const_iterator it;
+        for(it = m_days.constBegin(); it != m_days.constEnd(); ++it) {
+            eff += it.data().effort();
+        }
+        return eff;
+    }
+    
+private:
+    EffortCost &zero() { return m_zero; }
+    
+private:
+    EffortCost m_zero;
+    EffortCostDayMap m_days;
+};
+
+} //namespace KPlato
+
+#endif