~ubuntu-branches/ubuntu/raring/notecase/raring

« back to all changes in this revision

Viewing changes to src/lib/DocumentIterator.cpp

Committer: Bazaar Package Importer
Author(s): Nathan Handler
Date: 2008-12-21 13:09:58 UTC
mfrom: (1.1.6 upstream)
Revision ID: james.westby@ubuntu.com-20081221130958-0ri77h0x7j1dclkq

Tags: 1.9.8-0ubuntu1

https://launchpad.net/bugs/307752

New upstream release (LP: #307752)

files removed:
Makefile~

files modified:
Makefile

NoteCase.dsp

NoteCase.vcproj

deb/control

debian/changelog

docs/control

docs/help.ncd

docs/install.iss

docs/notecase.spec

po/de.po

po/hr.po

po/it.po

po/notecase.pot

po/ro.po

readme.txt

src/AboutDlg.cpp

src/AboutDlg.h

src/DateTimeDlg.cpp

src/DateTimeDlg.h

src/DocAction.cpp

src/DocAction.h

src/DocActionAtt.cpp

src/DocActionAtt.h

src/DocActionFinish.cpp

src/DocActionFinish.h

src/DocActionFinishDel.cpp

src/DocActionFinishDel.h

src/DocActionFmt.cpp

src/DocActionFmt.h

src/DocActionPix.cpp

src/DocActionPix.h

src/DocActionSort.cpp

src/DocActionSort.h

src/EditDlg.cpp

src/EditDlg.h

src/ExecuteFile.h

src/FileAttachmentDlg.cpp

src/FileAttachmentDlg.h

src/FileExportDlg.cpp

src/FileExportDlg.h

src/FileSaveAsDlg.cpp

src/FileSaveAsDlg.h

src/FindDialog.cpp

src/FindDialog.h

src/FindReplaceDlg.cpp

src/FindReplaceDlg.h

src/FindReplaceInfo.cpp

src/FindReplaceInfo.h

src/LinkPropertiesDlg.cpp

src/LinkPropertiesDlg.h

src/MainWnd.cpp

src/MainWnd.h

src/NodePropertiesDlg.cpp

src/NodePropertiesDlg.h

src/OptionsDialog.cpp

src/OptionsDialog.h

src/PasswordDialog.cpp

src/PasswordDialog.h

src/PixPropertiesDlg.cpp

src/PixPropertiesDlg.h

src/PortableTrayIcon.cpp

src/PortableTrayIcon.h

src/ShortcutsList.cpp

src/ShortcutsList.h

src/ShortcutsListDlg.cpp

src/ShortcutsListDlg.h

src/TextView.cpp

src/TextView.h

src/TreeView.cpp

src/TreeView.h

src/callbacks.cpp

src/callbacks.h

src/config.h

src/gui/Dialog.cpp

src/gui/Dialog.h

src/gui/FileDialog.cpp

src/gui/FileDialog.h

src/gui/GuiLanguage.cpp

src/gui/GuiLanguage.h

src/gui/ProgressDlg.cpp

src/gui/ProgressDlg.h

src/interface.cpp

src/interface.h

src/lib/Base64.cpp

src/lib/Base64.h

src/lib/CircularBuffer.cpp

src/lib/CircularBuffer.h

src/lib/DocActionBase.h

src/lib/DocActionManager.cpp

src/lib/DocActionManager.h

src/lib/DocumentIterator.cpp

src/lib/DocumentIterator.h

src/lib/EnumDirectory.cpp

src/lib/EnumDirectory.h

src/lib/File64.cpp

src/lib/File64.h

src/lib/FilePath.cpp

src/lib/FilePath.h

src/lib/FmtInfo.cpp

src/lib/FmtInfo.h

src/lib/FormatIOBase.cpp

src/lib/FormatIOBase.h

src/lib/FormatIOEncHtml.cpp

src/lib/FormatIOEncHtml.h

src/lib/FormatIOExecutable.cpp

src/lib/FormatIOExecutable.h

src/lib/FormatIOGjots2.cpp

src/lib/FormatIOGjots2.h

src/lib/FormatIOHtml.cpp

src/lib/FormatIOHtml.h

src/lib/FormatIOMMLX.cpp

src/lib/FormatIOMMLX.h

src/lib/FormatIOStickyNotes.cpp

src/lib/FormatIOStickyNotes.h

src/lib/FormatIOTxt.cpp

src/lib/FormatIOTxt.h

src/lib/HtmlParser.cpp

src/lib/HtmlParser.h

src/lib/IOLayerBase.cpp

src/lib/IOLayerBase.h

src/lib/IOLayerEnc.cpp

src/lib/IOLayerEnc.h

src/lib/IOLayerFile64.cpp

src/lib/IOLayerFile64.h

src/lib/IOLayerRedirect.cpp

src/lib/IOLayerRedirect.h

src/lib/IOLayerZlib.cpp

src/lib/IOLayerZlib.h

src/lib/IOProcess.cpp

src/lib/IOProcess.h

src/lib/IniFile.cpp

src/lib/IniFile.h

src/lib/LinkInfo.cpp

src/lib/LinkInfo.h

src/lib/NoteDocument.cpp

src/lib/NoteDocument.h

src/lib/NoteNode.cpp

src/lib/NoteNode.h

src/lib/SHA1.cpp

src/lib/SHA1.h

src/lib/TextSearch.cpp

src/lib/TextSearch.h

src/lib/Thread.cpp

src/lib/Thread.h

src/lib/blowfish.cpp

src/lib/blowfish.h

src/lib/blowfish2.h

src/lib/debug.cpp

src/lib/debug.h

src/lib/types.h

src/main.cpp

src/mru.cpp

src/mru.h

src/support.cpp

src/support.h

Show diffs side-by-side

added added

removed removed

src/lib/DocumentIterator.cpp

////////////////////////////////////////////////////////////////////////////

// NoteCase notes manager project <http://notecase.sf.net>

// This code is licensed under BSD license.See "license.txt" for more details.

// File: Implements iterator/helper methods for traversing NoteDocument object

////////////////////////////////////////////////////////////////////////////

#include "DocumentIterator.h"

#include "debug.h"

DocumentIterator::DocumentIterator(NoteDocument &doc) : m_doc(doc)

{

}

DocumentIterator::~DocumentIterator()

{

}

int DocumentIterator::GetChildCount(int nParentID, bool bRecursive)

{

int nCount = 0;

for(unsigned int i=0; i<m_doc.GetNodeCount(); i++)

{

if(m_doc.m_lstNodes[i].m_nParentID == nParentID)

{

nCount++;

if(bRecursive)

nCount += GetChildCount(m_doc.m_lstNodes[i].m_nID, true);

}

return nCount;

}

int DocumentIterator::GetChildIdx(int nParentID, int nSiblingIdx)

{

for(unsigned int i=0; i<m_doc.GetNodeCount(); i++)

{

if(m_doc.m_lstNodes[i].m_nParentID == nParentID)

{

if(m_doc.m_lstNodes[i].m_nSiblingIdx == nSiblingIdx)

return i;

}

return -1;

}

int DocumentIterator::NodeIdx2RecursiveIdx(int nIdx)

{

int nRecursiveIdx = -1;

while(nIdx >= 0)

{

int nParentID = m_doc.GetNodeByIdx(nIdx).m_nParentID;

int nSiblingIdx = m_doc.GetNodeByIdx(nIdx).m_nSiblingIdx;

//count the current node

nRecursiveIdx ++;

//get "previous" node

nIdx = -1;

if(nSiblingIdx > 0){

nIdx = GetChildIdx(nParentID, nSiblingIdx-1); //previous sibling

//recursively go to the last node child

int nID = m_doc.GetNodeByIdx(nIdx).m_nID;

int nChildCount = GetChildCount(nID);

while(nChildCount > 0)

{

nIdx = GetChildIdx(nID, nChildCount-1);

nID = m_doc.GetNodeByIdx(nIdx).m_nID;

nChildCount = GetChildCount(nID);

}

else

nIdx = m_doc.GetIdxFromID(nParentID); //

if(nIdx < 0)

break;

}

return nRecursiveIdx;

}

int DocumentIterator::RecursiveIdx2NodeIdx(int nIdx)

{

int nCounter = -1;

return RecursiveGetIdx(nIdx, ROOT_PARENT_ID, nCounter);

}

int DocumentIterator::RecursiveGetIdx(int nRIdx, int nParentID, int &nCounter)

{

int nChildCnt = GetChildCount(nParentID);

if(nChildCnt > 0)

{

//recurse into children

for(int i=0; i<nChildCnt; i++)

{

nCounter ++;

100

101

int nChildIdx = GetChildIdx(nParentID, i);

102

if(nChildIdx >= 0)

103

{

104

if(nCounter == nRIdx)

105

return nChildIdx;

106

107

int nChildID = m_doc.GetNodeByIdx(nChildIdx).m_nID;

108

int nIdxNode = RecursiveGetIdx(nRIdx, nChildID, nCounter);

109

if(nIdxNode >= 0)

110

return nIdxNode;

111

}

112

}

113

}

114

115

return -1; //not found at this level

116

}

117

118

bool DocumentIterator::IsSiblingByIdx(int nIdx1, int nIdx2)

119

{

120

//siblings are nodes with the same aprent

121

return (m_doc.GetNodeByIdx(nIdx1).m_nParentID == m_doc.GetNodeByIdx(nIdx2).m_nParentID);

122

}

123

124

bool DocumentIterator::IsAncestorByIdx(int nAncestorIdx, int nIdx)

125

{

126

int nAncestorID = m_doc.GetNodeByIdx(nAncestorIdx).m_nID;

127

128

//check each parent node up to the tree root

129

int nNodeIdx = nIdx;

130

while (nNodeIdx >= 0)

131

{

132

int nPID = m_doc.GetNodeByIdx(nNodeIdx).m_nParentID;

133

if(nPID == nAncestorID)

134

return true; //parent or grandparent or ...

135

136

nNodeIdx = m_doc.GetIdxFromID(nPID); //recurse to the parent node

137

}

138

139

return false; //not an ancestor

140

}

141

142

NoteNode &DocumentIterator::GetNodeByID(int nID)

143

{

144

int nIdx = m_doc.GetIdxFromID(nID);

145

ASSERT(nIdx >= 0);

146

return m_doc.GetNodeByIdx(nIdx);

147

}

148

149

int DocumentIterator::CalcNodeLevel(int nIdx)

150

{

151

int nLevel = 0;

152

int nParentID = m_doc.GetNodeByIdx(nIdx).m_nParentID;

153

while(nParentID >= 0){

154

nLevel ++;

155

nParentID = GetNodeByID(nParentID).m_nParentID;

156

}

157

return nLevel;

158

}

////////////////////////////////////////////////////////////////////////////

// NoteCase notes manager project <http://notecase.sf.net>

// This code is licensed under BSD license.See "license.txt" for more details.

// File: Implements iterator/helper methods for traversing NoteDocument object

////////////////////////////////////////////////////////////////////////////

#include "DocumentIterator.h"

#include "debug.h"

DocumentIterator::DocumentIterator(NoteDocument &doc) : m_doc(doc)

{

}

DocumentIterator::~DocumentIterator()

{

}

int DocumentIterator::GetChildCount(int nParentID, bool bRecursive)

{

int nCount = 0;

for(unsigned int i=0; i<m_doc.GetNodeCount(); i++)

{

if(m_doc.m_lstNodes[i].m_nParentID == nParentID)

{

nCount++;

if(bRecursive)

nCount += GetChildCount(m_doc.m_lstNodes[i].m_nID, true);

}

return nCount;

}

int DocumentIterator::GetChildIdx(int nParentID, int nSiblingIdx)

{

for(unsigned int i=0; i<m_doc.GetNodeCount(); i++)

{

if(m_doc.m_lstNodes[i].m_nParentID == nParentID)

{

if(m_doc.m_lstNodes[i].m_nSiblingIdx == nSiblingIdx)

return i;

}

return -1;

}

int DocumentIterator::NodeIdx2RecursiveIdx(int nIdx)

{

int nRecursiveIdx = -1;

while(nIdx >= 0)

{

int nParentID = m_doc.GetNodeByIdx(nIdx).m_nParentID;

int nSiblingIdx = m_doc.GetNodeByIdx(nIdx).m_nSiblingIdx;

//count the current node

nRecursiveIdx ++;

//get "previous" node

nIdx = -1;

if(nSiblingIdx > 0){

nIdx = GetChildIdx(nParentID, nSiblingIdx-1); //previous sibling

//recursively go to the last node child

int nID = m_doc.GetNodeByIdx(nIdx).m_nID;

int nChildCount = GetChildCount(nID);

while(nChildCount > 0)

{

nIdx = GetChildIdx(nID, nChildCount-1);

nID = m_doc.GetNodeByIdx(nIdx).m_nID;

nChildCount = GetChildCount(nID);

}

else

nIdx = m_doc.GetIdxFromID(nParentID); //

if(nIdx < 0)

break;

}

return nRecursiveIdx;

}

int DocumentIterator::RecursiveIdx2NodeIdx(int nIdx)

{

int nCounter = -1;

return RecursiveGetIdx(nIdx, ROOT_PARENT_ID, nCounter);

}

int DocumentIterator::RecursiveGetIdx(int nRIdx, int nParentID, int &nCounter)

{

int nChildCnt = GetChildCount(nParentID);

if(nChildCnt > 0)

{

//recurse into children

for(int i=0; i<nChildCnt; i++)

{

nCounter ++;

100

101

int nChildIdx = GetChildIdx(nParentID, i);

102

if(nChildIdx >= 0)

103

{

104

if(nCounter == nRIdx)

105

return nChildIdx;

106

107

int nChildID = m_doc.GetNodeByIdx(nChildIdx).m_nID;

108

int nIdxNode = RecursiveGetIdx(nRIdx, nChildID, nCounter);

109

if(nIdxNode >= 0)

110

return nIdxNode;

111

}

112

}

113

}

114

115

return -1; //not found at this level

116

}

117

118

bool DocumentIterator::IsSiblingByIdx(int nIdx1, int nIdx2)

119

{

120

//siblings are nodes with the same aprent

121

return (m_doc.GetNodeByIdx(nIdx1).m_nParentID == m_doc.GetNodeByIdx(nIdx2).m_nParentID);

122

}

123

124

bool DocumentIterator::IsAncestorByIdx(int nAncestorIdx, int nIdx)

125

{

126

int nAncestorID = m_doc.GetNodeByIdx(nAncestorIdx).m_nID;

127

128

//check each parent node up to the tree root

129

int nNodeIdx = nIdx;

130

while (nNodeIdx >= 0)

131

{

132

int nPID = m_doc.GetNodeByIdx(nNodeIdx).m_nParentID;

133

if(nPID == nAncestorID)

134

return true; //parent or grandparent or ...

135

136

nNodeIdx = m_doc.GetIdxFromID(nPID); //recurse to the parent node

137

}

138

139

return false; //not an ancestor

140

}

141

142

NoteNode &DocumentIterator::GetNodeByID(int nID)

143

{

144

int nIdx = m_doc.GetIdxFromID(nID);

145

ASSERT(nIdx >= 0);

146

return m_doc.GetNodeByIdx(nIdx);

147

}

148

149

int DocumentIterator::CalcNodeLevel(int nIdx)

150

{

151

int nLevel = 0;

152

int nParentID = m_doc.GetNodeByIdx(nIdx).m_nParentID;

153

while(nParentID >= 0){

154

nLevel ++;

155

nParentID = GetNodeByID(nParentID).m_nParentID;

156

}

157

return nLevel;

158

}

Older »