blob: fa24f474a53682c474126072b1798b91b9970356 (
plain)
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
|
// This is the SIP interface definition for TQDawg.
//
// Copyright (c) 2007
// Riverbank Computing Limited <[email protected]>
//
// This file is part of PyTQt.
//
// This copy of PyTQt 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, or (at your option) any later
// version.
//
// PyTQt is supplied 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
// PyTQt; see the file LICENSE. If not, write to the Free Software Foundation,
// Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
// The documentation is in the main documentation file because SIP isn't clever
// enough to handle the resulting %Timeline complexity.
%If (WS_QWS)
class TQDawg
{
%TypeHeaderCode
#include <tqpe/qdawg.h>
%End
public:
TQDawg();
bool readFile(const TQString &) /ReleaseGIL/;
bool read(TQIODevice *) /ReleaseGIL/;
bool write(TQIODevice *) const /ReleaseGIL/;
bool createFromWords(TQIODevice *);
void createFromWords(const TQStringList &);
TQStringList allWords() const;
bool contains(const TQString &) const;
int countWords() const;
class Node {
public:
TQChar letter() const;
bool isWord() const;
bool isLast() const;
const TQDawg::Node *next() const;
const TQDawg::Node *jump() const;
private:
Node();
};
const TQDawg::Node *root() const;
void dump() const;
};
%End
|
