finfodlg.h File Reference

(r1785/r1765)

#include "fontbase.h"
#include "fileinfolist.h"

Go to the source code of this file.

Classes
class	FileInfo
	The file info dialogue shows information on the selected document. More...
class	RefItem
	Item class for the Reference sorting system. More...
Defines
#define	OPTOKEN_FINFODLG   _T("FileInfo")
Functions
Node *	StartTreeScan (Document *pDoc)
	To scan a tree "not depth first". Instead of skipping to the bottom of the tree and scanning back up I want to scan to the bottom and skip back up. Initialises the scan of the document. See also: GetNextTreeNode.
Node *	GetNextTreeNode (Node *Current)
	To scan a tree "not depth first". Instead of skipping to the bottom of the tree and scanning back up I want to scan to the bottom and skip back up. Gets the node after the current one. Returns NULL if no more See also: StartTreeScan, SkipSubTreeScan.
Node *	SkipSubtreeScan (Node *Current)
	To skip the scan of the children of the current node. The node returned is either a sibling or a parent of the current node. Can return NULL. See also: GetNextTreeNode.

---

Define Documentation

#define OPTOKEN_FINFODLG   _T("FileInfo")

Definition at line 106 of file finfodlg.h.

---

Function Documentation

Node* GetNextTreeNode (  Node *  Current  )

To scan a tree "not depth first". Instead of skipping to the bottom of the tree and scanning back up I want to scan to the bottom and skip back up. Gets the node after the current one. Returns NULL if no more See also: StartTreeScan, SkipSubTreeScan. Author: Peter_Arnold (Xara Group Ltd) <camelotdev@xara.com> Date: 31th August 1994 Parameters: The  current node. [INPUTS] Returns: Pointer to the next node. Definition at line 1091 of file finfodlg.cpp. { if (Current == NULL) { ENSURE(FALSE,"NULL node pointer passed to GetNextTreeNode"); return NULL; } // first try going down one level if (Current->FindFirstChild() != NULL) { return Current->FindFirstChild(); } // now try going right one if (Current->FindNext() != NULL) { return Current->FindNext(); } // if we get this far we need to go up and to the right. Node* Temp = Current->FindParent();; while (Temp != NULL) { if (Temp->FindNext() != NULL) { return Temp->FindNext(); } Temp = Temp->FindParent(); } // no more nodes left in the document return NULL; }

Node* SkipSubtreeScan (  Node *  Current  )

To skip the scan of the children of the current node. The node returned is either a sibling or a parent of the current node. Can return NULL. See also: GetNextTreeNode. Author: Peter_Arnold (Xara Group Ltd) <camelotdev@xara.com> Date: 31th August 1994 Parameters: The  current node. [INPUTS] Returns: Pointer to the next node. Definition at line 1135 of file finfodlg.cpp. { if (Current == NULL) { ENSURE(FALSE,"NULL node pointer passed to SkipSubTreeScan"); return NULL; } if (Current->FindNext() != NULL) { return Current->FindNext(); } // now we need to go up and to the right. Node* Temp = Current->FindParent(); while (Temp != NULL) { if (Temp->FindNext() != NULL) { return Temp->FindNext(); } Temp = Temp->FindParent(); } return NULL; }

Node* StartTreeScan (  Document *  pDoc  )

To scan a tree "not depth first". Instead of skipping to the bottom of the tree and scanning back up I want to scan to the bottom and skip back up. Initialises the scan of the document. See also: GetNextTreeNode. Author: Peter_Arnold (Xara Group Ltd) <camelotdev@xara.com> Date: 31th August 1994 Parameters: Pointer  to the document to scan. [INPUTS] Returns: Pointer to the first node. Definition at line 1067 of file finfodlg.cpp. { if (pDoc == NULL) { ENSURE(FALSE,"NULL document pointer passed to StartTreeScan"); return NULL; } return pDoc->GetFirstNode(); }

---