/* * Copyright (C) 2004 by Thorsten Staerk * * 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. * */ /* this class is here to import tasks from a planner project file to ktimetracker. the import shall not be limited to ktimetracker (kPlaTo sends greetings) it imports planner's top-level-tasks on the same level-depth as currentItem. if there is no currentItem, planner's top-level-tasks will become top-level-tasks in ktimetracker. it imports as well the level-depth of each task, as its name, as its percent-complete. test cases: - deleting all tasks away, then import! - having started with an empty ics, import! - with currentItem being a top-level-task, import! - with currentItem being a subtask, import! */ #include "plannerparser.h" #include "task.h" #include "taskview.h" #include PlannerParser::PlannerParser(TaskView * tv) // if there is a task one level above currentItem, make it the father of all imported tasks. Set level accordingly. // import as well if there a no task in the taskview as if there are. // if there are, put the top-level tasks of planner on the same level as currentItem. // So you have the chance as well to have the planner tasks at top-level as at a whatever-so-deep sublevel. { kDebug() <<"entering constructor to import planner tasks"; _taskView=tv; level=0; if (_taskView->currentItem()) if (_taskView->currentItem()->parent()) { task = _taskView->currentItem()->parent(); level=1; } } bool PlannerParser::startDocument() { withInTasks=false; // becomes true as soon as parsing occurres return true; } bool PlannerParser::startElement( const QString&, const QString&, const QString& qName, const QXmlAttributes& att ) { kDebug() << "entering function"; QString taskName; int taskComplete=0; // only s within are processed if (qName == QString::fromLatin1("tasks")) withInTasks=true; if ((qName == QString::fromLatin1("task")) && (withInTasks)) { // find out name and percent-complete for (int i=0; i0) { parentTask=task; task = new Task(taskName, QString(), 0, 0, dl, parentTask); task->setUid(_taskView->storage()->addTask(task, parentTask)); } else { task = new Task(taskName, QString(), 0, 0, dl, _taskView); kDebug() <<"added" << taskName; task->setUid(_taskView->storage()->addTask(task, 0)); } task->setPercentComplete(taskComplete, _taskView->storage()); } return true; } bool PlannerParser::endElement( const QString&, const QString&, const QString& qName) { // only s within increased level, so only decrease for s within if (withInTasks) { if (qName=="task") if (level-->=0) task=task->parent(); if (qName=="tasks") withInTasks=false; } return true; }