-rw-r--r-- | library/qdawg.cpp | 2 |
1 files changed, 0 insertions, 2 deletions
diff --git a/library/qdawg.cpp b/library/qdawg.cpp index af5dc82..2ea5734 100644 --- a/library/qdawg.cpp +++ b/library/qdawg.cpp | |||
@@ -1,71 +1,69 @@ | |||
1 | /********************************************************************** | 1 | /********************************************************************** |
2 | ** Copyright (C) 2000-2002 Trolltech AS. All rights reserved. | 2 | ** Copyright (C) 2000-2002 Trolltech AS. All rights reserved. |
3 | ** | 3 | ** |
4 | ** This file is part of the Qtopia Environment. | 4 | ** This file is part of the Qtopia Environment. |
5 | ** | 5 | ** |
6 | ** This file may be distributed and/or modified under the terms of the | 6 | ** This file may be distributed and/or modified under the terms of the |
7 | ** GNU General Public License version 2 as published by the Free Software | 7 | ** GNU General Public License version 2 as published by the Free Software |
8 | ** Foundation and appearing in the file LICENSE.GPL included in the | 8 | ** Foundation and appearing in the file LICENSE.GPL included in the |
9 | ** packaging of this file. | 9 | ** packaging of this file. |
10 | ** | 10 | ** |
11 | ** This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE | 11 | ** This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE |
12 | ** WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. | 12 | ** WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. |
13 | ** | 13 | ** |
14 | ** See http://www.trolltech.com/gpl/ for GPL licensing information. | 14 | ** See http://www.trolltech.com/gpl/ for GPL licensing information. |
15 | ** | 15 | ** |
16 | ** Contact info@trolltech.com if any conditions of this licensing are | 16 | ** Contact info@trolltech.com if any conditions of this licensing are |
17 | ** not clear to you. | 17 | ** not clear to you. |
18 | ** | 18 | ** |
19 | **********************************************************************/ | 19 | **********************************************************************/ |
20 | #include "qdawg.h" | 20 | #include "qdawg.h" |
21 | #include <qintdict.h> | 21 | #include <qintdict.h> |
22 | #include <qvaluelist.h> | ||
23 | #include <qtextstream.h> | ||
24 | #include <qfile.h> | 22 | #include <qfile.h> |
25 | #include <qtl.h> | 23 | #include <qtl.h> |
26 | 24 | ||
27 | #include <limits.h> | 25 | #include <limits.h> |
28 | #include <stdio.h> | 26 | #include <stdio.h> |
29 | 27 | ||
30 | // for mmap | 28 | // for mmap |
31 | #include <sys/types.h> | 29 | #include <sys/types.h> |
32 | #include <sys/stat.h> | 30 | #include <sys/stat.h> |
33 | #include <sys/mman.h> | 31 | #include <sys/mman.h> |
34 | #include <fcntl.h> | 32 | #include <fcntl.h> |
35 | #include <errno.h> | 33 | #include <errno.h> |
36 | #include <unistd.h> | 34 | #include <unistd.h> |
37 | 35 | ||
38 | class QDawgPrivate; | 36 | class QDawgPrivate; |
39 | class QTrie; | 37 | class QTrie; |
40 | 38 | ||
41 | typedef QValueList<QTrie*> TrieClub; | 39 | typedef QValueList<QTrie*> TrieClub; |
42 | typedef QIntDict<TrieClub> TrieClubDirectory; | 40 | typedef QIntDict<TrieClub> TrieClubDirectory; |
43 | 41 | ||
44 | class TriePtr { | 42 | class TriePtr { |
45 | public: | 43 | public: |
46 | QChar letter; | 44 | QChar letter; |
47 | QTrie* p; | 45 | QTrie* p; |
48 | int operator <(const TriePtr& o) const; | 46 | int operator <(const TriePtr& o) const; |
49 | int operator >(const TriePtr& o) const; | 47 | int operator >(const TriePtr& o) const; |
50 | int operator <=(const TriePtr& o) const; | 48 | int operator <=(const TriePtr& o) const; |
51 | }; | 49 | }; |
52 | 50 | ||
53 | class TrieList : public QValueList<TriePtr> { | 51 | class TrieList : public QValueList<TriePtr> { |
54 | bool sorted; | 52 | bool sorted; |
55 | public: | 53 | public: |
56 | TrieList() | 54 | TrieList() |
57 | { | 55 | { |
58 | sorted=TRUE; | 56 | sorted=TRUE; |
59 | } | 57 | } |
60 | 58 | ||
61 | QTrie* findAdd(QChar c); | 59 | QTrie* findAdd(QChar c); |
62 | bool equal(TrieList& l); | 60 | bool equal(TrieList& l); |
63 | 61 | ||
64 | void sort() | 62 | void sort() |
65 | { | 63 | { |
66 | if ( !sorted ) { | 64 | if ( !sorted ) { |
67 | qHeapSort(*this); | 65 | qHeapSort(*this); |
68 | sorted = TRUE; | 66 | sorted = TRUE; |
69 | } | 67 | } |
70 | } | 68 | } |
71 | }; | 69 | }; |