You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
76 lines
1.7 KiB
76 lines
1.7 KiB
/*********
|
|
*
|
|
* This file is part of BibleTime's source code, http://www.bibletime.info/.
|
|
*
|
|
* Copyright 1999-2006 by the BibleTime developers.
|
|
* The BibleTime source code is licensed under the GNU General Public License version 2.0.
|
|
*
|
|
**********/
|
|
|
|
|
|
|
|
//BibleTime includes
|
|
#include "cswordbookmoduleinfo.h"
|
|
#include "cswordtreekey.h"
|
|
|
|
//Sword includes
|
|
#include <treekeyidx.h>
|
|
#include <treekey.h>
|
|
|
|
#include <iostream>
|
|
#include <string>
|
|
using std::cout;
|
|
using std::endl;
|
|
|
|
CSwordBookModuleInfo::CSwordBookModuleInfo( sword::SWModule* module, CSwordBackend* const usedBackend )
|
|
: CSwordModuleInfo(module, usedBackend),
|
|
m_depth(-1) {}
|
|
|
|
CSwordBookModuleInfo::CSwordBookModuleInfo( const CSwordBookModuleInfo& module )
|
|
: CSwordModuleInfo(module) {
|
|
m_depth = module.m_depth;
|
|
}
|
|
|
|
CSwordBookModuleInfo::~CSwordBookModuleInfo() {}
|
|
|
|
const int CSwordBookModuleInfo::depth() {
|
|
if (m_depth == -1) {
|
|
sword::TreeKeyIdx* key = tree();
|
|
|
|
if (key) {
|
|
key->root();
|
|
computeDepth(key, 0);
|
|
}
|
|
}
|
|
|
|
return m_depth;
|
|
}
|
|
|
|
void CSwordBookModuleInfo::computeDepth(sword::TreeKeyIdx* key, int level ) {
|
|
std::string savedKey;
|
|
// savedKey = key->getFullName(); //sword 1.5.8
|
|
savedKey = key->getText();
|
|
|
|
if (level > m_depth) {
|
|
m_depth = level;
|
|
}
|
|
|
|
if (key->hasChildren()) {
|
|
key->firstChild();
|
|
computeDepth(key, level+1);
|
|
|
|
key->setText( savedKey.c_str() );//return to the initial value
|
|
}
|
|
|
|
if (key->nextSibling()) {
|
|
computeDepth(key, level);
|
|
}
|
|
}
|
|
|
|
/** Returns a treekey filled with the structure of this module */
|
|
sword::TreeKeyIdx* const CSwordBookModuleInfo::tree() const {
|
|
sword::TreeKeyIdx* treeKey = dynamic_cast<sword::TreeKeyIdx*>((sword::SWKey*)*(module()));
|
|
Q_ASSERT(treeKey);
|
|
return treeKey;
|
|
}
|