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
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
|
/*
Jabber Protocol Plugin for Miranda NG
Copyright (c) 2002-04 Santithorn Bunchua
Copyright (c) 2005-12 George Hazan
Copyright (c) 2007 Artem Shpynov
Copyright (C) 2012-22 Miranda NG team
Module implements a search according to XEP-0055: Jabber Search
http://www.xmpp.org/extensions/xep-0055.html
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.
*/
#pragma once
struct JabberSearchFieldsInfo
{
wchar_t *szFieldName;
wchar_t *szFieldCaption;
HWND hwndCaptionItem;
HWND hwndValueItem;
};
struct JabberSearchData : public MZeroedObject
{
struct CJabberProto *ppro;
JabberSearchFieldsInfo *pJSInf;
TiXmlDocument doc;
TiXmlElement *xNode;
int nJSInfCount;
int lastRequestIq;
int CurrentHeight;
int curPos;
int frameHeight;
RECT frameRect;
BOOL fSearchRequestIsXForm;
};
struct Data
{
wchar_t *Label;
wchar_t *Var;
wchar_t *defValue;
bool bHidden;
bool bReadOnly;
int Order;
};
static HWND searchHandleDlg = nullptr;
// Implementation of MAP class (the list
class UNIQUE_MAP
{
struct _RECORD
{
_RECORD(char *key, char *value = nullptr) :
_key(key),
_value(value)
{ }
char *_key;
char *_value;
int _order = 0;
};
int _nextOrder;
LIST<_RECORD> _Records;
static int _KeysEqual(const _RECORD *p1, const _RECORD *p2)
{
return mir_strcmpi(p1->_key, p2->_key);
}
inline int _remove(_RECORD *p)
{
int _itemOrder = p->_order;
if (_Records.remove(p)) {
delete(p);
_nextOrder--;
for (auto &temp : _Records)
if (temp && temp->_order > _itemOrder)
temp->_order--;
return 1;
}
return 0;
}
inline _RECORD* _getUnorderedRec(int index)
{
for (auto &rec : _Records)
if (rec->_order == index)
return rec;
return nullptr;
}
public:
UNIQUE_MAP(int incr) :_Records(incr, _KeysEqual)
{
_nextOrder = 0;
};
~UNIQUE_MAP()
{
_RECORD *record;
int i = 0;
while (record = _Records[i++]) delete record;
}
int insert(const char *Key, const char *Value)
{
_RECORD *rec = new _RECORD((char*)Key, (char*)Value);
int index = _Records.getIndex(rec);
if (index < 0) {
if (!_Records.insert(rec)) delete rec;
else {
index = _Records.getIndex(rec);
rec->_order = _nextOrder++;
}
}
else {
_Records[index]->_value = (char*)Value;
delete rec;
}
return index;
}
int insertCopyKey(const char *Key, const char *Value, char **_KeyReturn)
{
_RECORD *rec = new _RECORD((char*)Key, (char*)Value);
int index = _Records.getIndex(rec);
if (index < 0) {
char *newKey = mir_strdup(Key);
if (!_Records.insert(rec)) {
delete rec;
mir_free(newKey);
if (_KeyReturn)
*_KeyReturn = nullptr;
}
else {
rec->_key = newKey;
index = _Records.getIndex(rec);
rec->_order = _nextOrder++;
if (_KeyReturn)
*_KeyReturn = newKey;
}
}
else {
_Records[index]->_value = (char*)Value;
if (_KeyReturn)
*_KeyReturn = _Records[index]->_key;
delete rec;
}
return index;
}
inline char* operator[](const char* _KEY) const
{
_RECORD rec((char*)_KEY);
int index = _Records.getIndex(&rec);
_RECORD *rv = _Records[index];
if (rv) {
if (rv->_value)
return rv->_value;
else
return "";
}
else
return nullptr;
}
inline char* operator[](int index) const
{
_RECORD *rv = _Records[index];
if (rv) return rv->_value;
else return nullptr;
}
inline char* getKeyName(int index)
{
_RECORD *rv = _Records[index];
if (rv) return rv->_key;
else return nullptr;
}
inline char* getUnOrdered(int index)
{
_RECORD *rec = _getUnorderedRec(index);
if (rec) return rec->_value;
else return nullptr;
}
inline char* getUnOrderedKeyName(int index)
{
_RECORD *rec = _getUnorderedRec(index);
if (rec) return rec->_key;
else return nullptr;
}
inline int getCount()
{
return _Records.getCount();
}
inline int removeUnOrdered(int index)
{
_RECORD *p = _getUnorderedRec(index);
if (p) return _remove(p);
else return 0;
}
inline int remove(int index)
{
_RECORD *p = _Records[index];
if (p) return _remove(p);
else return 0;
}
inline int getIndex(char *key)
{
_RECORD temp(key);
return _Records.getIndex(&temp);
}
};
|
