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
|
/***************************************************************************
* Copyright (C) 2004-2009 by Thomas Fischer *
* [email protected] *
* *
* 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; either version 2 of the License, or *
* (at your option) any later version. *
* *
* 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. *
* *
* You should have received a copy of the GNU General Public License *
* along with this program; if not, write to the *
* Free Software Foundation, Inc., *
* 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *
***************************************************************************/
#include <ntqregexp.h>
#include <ntqstringlist.h>
#include "preamble.h"
namespace BibTeX
{
Preamble::Preamble() : Element(), m_value( new Value() )
{
// TODO
}
Preamble::Preamble( const TQString& text ) : Element()
{
m_value = new Value( text, false );
}
Preamble::Preamble( Preamble *other ): Element(), m_value( NULL )
{
copyFrom( other );
}
Preamble::~Preamble()
{
delete m_value;
}
Value *Preamble::value() const
{
return m_value;
}
void Preamble::setValue( Value *value )
{
if ( value != m_value )
{
delete m_value;
if ( value != NULL )
m_value = new Value( value );
else
m_value = NULL;
}
}
bool Preamble::containsPattern( const TQString& pattern, EntryField::FieldType fieldType, FilterType filterType, bool caseSensitive ) const
{
TQString text = m_value->simplifiedText();
if ( filterType == ftExact )
{
/** check for exact match */
return fieldType == EntryField::ftUnknown && text.contains( pattern, caseSensitive );
}
else
{
/** for each word in the search pattern ... */
TQStringList words = TQStringList::split( TQRegExp( "\\s+" ), pattern );
unsigned int hits = 0;
for ( TQStringList::Iterator it = words.begin(); it != words.end(); ++it )
{
/** check if word is contained in text */
if ( fieldType == EntryField::ftUnknown && text.contains( *it, caseSensitive ) )
++hits;
}
/** return success depending on filter type and number of hits */
return (( filterType == ftAnyWord && hits > 0 ) || ( filterType == ftEveryWord && hits == words.count() ) );
}
}
Element* Preamble::clone()
{
return new Preamble( this );
}
void Preamble::copyFrom( Preamble *other )
{
if ( m_value != NULL ) delete m_value;
m_value = new Value( other->m_value );
}
TQString Preamble::text() const
{
return "Preamble: " + m_value->text();
}
}
|
