blob: b26721330d398ffd2ea97e7a21873a6276c69086 (
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
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
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright 2000, 2010 Oracle and/or its affiliates.
*
* OpenOffice.org - a multi-platform office productivity suite
*
* This file is part of OpenOffice.org.
*
* OpenOffice.org is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License version 3
* only, as published by the Free Software Foundation.
*
* OpenOffice.org 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 Lesser General Public License version 3 for more details
* (a copy is included in the LICENSE file that accompanied this code).
*
* You should have received a copy of the GNU Lesser General Public License
* version 3 along with OpenOffice.org. If not, see
* <http://www.openoffice.org/license.html>
* for a copy of the LGPLv3 License.
*
************************************************************************/
#ifndef SW_ACMPLWRD_HXX
#define SW_ACMPLWRD_HXX
#include <deque>
#include <editeng/swafopt.hxx>
#include <editeng/LatinLookupTree.hxx>
class SwDoc;
class SwAutoCompleteWord_Impl;
class SwAutoCompleteClient;
class SwAutoCompleteString;
typedef std::deque<SwAutoCompleteString*> SwAutoCompleteStringPtrDeque;
class SwAutoCompleteWord
{
friend class SwAutoCompleteClient;
/// contains extended strings carrying source information
editeng::SortedAutoCompleteStrings m_WordList;
LookupTree* m_LookupTree;
SwAutoCompleteStringPtrDeque aLRULst;
SwAutoCompleteWord_Impl* pImpl;
sal_uInt16 nMaxCount, nMinWrdLen;
bool bLockWordLst;
void DocumentDying(const SwDoc& rDoc);
public:
SwAutoCompleteWord( sal_uInt16 nWords = 500, sal_uInt16 nMWrdLen = 10 );
~SwAutoCompleteWord();
bool InsertWord( const String& rWord, SwDoc& rDoc );
const String& operator[](size_t n) const
{ return m_WordList[n]->GetAutoCompleteString(); }
bool IsLockWordLstLocked() const { return bLockWordLst; }
void SetLockWordLstLocked( bool bFlag ) { bLockWordLst = bFlag; }
void SetMaxCount( sal_uInt16 n );
sal_uInt16 GetMinWordLen() const { return nMinWrdLen; }
void SetMinWordLen( sal_uInt16 n );
const editeng::SortedAutoCompleteStrings& GetWordList() const
{ return m_WordList; }
void CheckChangedList(const editeng::SortedAutoCompleteStrings& rNewLst);
// Resets the current position within the tree to its root node.
void returnToRoot();
// Advances to a given node within the AutoComplete tree.
void gotoNode(OUString sNode);
// Advances from the current position towards the node keyed with cKey.
void advance(const sal_Unicode cKey);
// Goes back one char within the tree, except if the current node is already the root node.
void goBack();
// Returns all words matching a given prefix aMatch. If bIgnoreCurrentPos is set, the current
// position within the tree is ignored and replaced by aMatch.
bool GetWordsMatching(String aMatch, std::vector<String>& aWords, bool bIgnoreCurrentPos) const;
};
#endif
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
