blob: 3370647573003e49811d93ccaa2cc0211bfc3fae (
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
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
*/
#pragma once
#include <rtl/ustrbuf.hxx>
#include <osl/diagnose.h>
namespace dbaccess
{
// TokenComposer
struct TokenComposer
{
private:
#ifdef DBG_UTIL
bool m_bUsed;
#endif
protected:
OUStringBuffer m_aBuffer;
public:
OUString getComposedAndClear()
{
#ifdef DBG_UTIL
m_bUsed = true;
#endif
return m_aBuffer.makeStringAndClear();
}
void clear()
{
#ifdef DBG_UTIL
m_bUsed = false;
#endif
m_aBuffer.setLength(0);
}
public:
TokenComposer()
#ifdef DBG_UTIL
:m_bUsed( false )
#endif
{
}
virtual ~TokenComposer()
{
}
TokenComposer(TokenComposer const &) = default;
TokenComposer(TokenComposer &&) = default;
TokenComposer & operator =(TokenComposer const &) = default;
TokenComposer & operator =(TokenComposer &&) = default;
void operator() (const OUString& lhs)
{
append(lhs);
}
void append( const OUString& lhs )
{
#ifdef DBG_UTIL
OSL_ENSURE( !m_bUsed, "FilterCreator::append: already used up!" );
#endif
if ( !lhs.isEmpty() )
{
if ( !m_aBuffer.isEmpty() )
appendNonEmptyToNonEmpty( lhs );
else
m_aBuffer.append( lhs );
}
}
/// append the given part. Only to be called when both the part and our buffer so far are not empty
virtual void appendNonEmptyToNonEmpty( const OUString& lhs ) = 0;
};
// FilterCreator
struct FilterCreator : public TokenComposer
{
virtual void appendNonEmptyToNonEmpty( const OUString& lhs ) override
{
m_aBuffer.insert( 0, ' ' );
m_aBuffer.insert( 0, '(' );
m_aBuffer.append( " ) AND ( " );
m_aBuffer.append( lhs );
m_aBuffer.append( " )" );
}
};
// FilterCreator
struct OrderCreator : public TokenComposer
{
virtual void appendNonEmptyToNonEmpty( const OUString& lhs ) override
{
m_aBuffer.append( ", " );
m_aBuffer.append( lhs );
}
};
} // namespace dbaccess
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
