blob: bd2873619a5f227337509122ce2a0aea1eb1bc14 (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
|
/******************************************************************************
* versekey.h - code for class 'versekey'- a standard Biblical verse key
*
* $Id: treekeyidx.h,v 1.3 2002/07/28 01:48:38 scribe Exp $
*
* Copyright 1998 CrossWire Bible Society (http://www.crosswire.org)
* CrossWire Bible Society
* P. O. Box 2528
* Tempe, AZ 85280-2528
*
* 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 version 2.
*
* 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.
*
*/
#ifndef TREEKEYIDX_H
#define TREEKEYIDX_H
#include <treekey.h>
#include <sysdata.h>
#include <filemgr.h>
/**
* Class VerseKey
* The SWKey implementation used for verse based modules like Bibles or commentaries.
*/
class SWDLLEXPORT TreeKeyIdx : public TreeKey {
class TreeNode {
public:
TreeNode();
~TreeNode();
void clear();
__u32 offset;
__s32 parent;
__s32 next;
__s32 firstChild;
char *name;
__u16 dsize;
char *userData;
} currentNode;
static SWClass classdef;
char *path;
FileDesc *idxfd;
FileDesc *datfd;
void getTreeNodeFromDatOffset(long ioffset, TreeNode *buf) const;
char getTreeNodeFromIdxOffset(long ioffset, TreeNode *node) const;
void saveTreeNode(TreeNode *node);
void saveTreeNodeOffsets(TreeNode *node);
void init();
public:
TreeKeyIdx(const TreeKeyIdx &ikey);
TreeKeyIdx (const char *idxPath, int fileMode = -1);
~TreeKeyIdx ();
virtual const char *getLocalName();
virtual const char *setLocalName(const char *);
virtual const char *getUserData(int *size = 0);
virtual void setUserData(const char *userData, int size = 0);
virtual const char *getFullName() const;
virtual void root();
virtual bool parent();
virtual bool firstChild();
virtual bool nextSibling();
virtual bool previousSibling();
virtual bool hasChildren();
virtual void append();
virtual void appendChild();
virtual void insertBefore();
virtual void remove();
virtual void save();
virtual void copyFrom(const TreeKeyIdx &ikey);
virtual void copyFrom(const SWKey & ikey);
void setOffset(unsigned long offset);
unsigned long getOffset() const;
// OPERATORS ------------------------------------------------------------
virtual SWKey &operator = (const TreeKeyIdx &ikey) { copyFrom(ikey); return *this; }
SWKEY_OPERATORS
virtual void setText(const char *ikey);
virtual void setPosition(SW_POSITION p);
virtual const char *getText() const;
virtual int _compare (const TreeKeyIdx & ikey);
virtual int compare(const SWKey &ikey);
virtual void decrement(int steps = 1);
virtual void increment(int steps = 1);
virtual char Traversable () { return 1; }
static signed char create(const char *path);
};
#endif
|
