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
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
|
/*
Jabber Protocol Plugin for Miranda NG
Copyright (c) 2002-04 Santithorn Bunchua
Copyright (c) 2005-12 George Hazan
Copyright (c) 2007 Artem Shpynov
Copyright (ñ) 2012-16 Miranda NG project
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.
*/
typedef struct _tagJabberSearchFieldsInfo
{
TCHAR * szFieldName;
TCHAR * szFieldCaption;
HWND hwndCaptionItem;
HWND hwndValueItem;
} JabberSearchFieldsInfo;
typedef struct _tagJabberSearchData
{
struct CJabberProto *ppro;
JabberSearchFieldsInfo * pJSInf;
HXML xNode;
int nJSInfCount;
int lastRequestIq;
int CurrentHeight;
int curPos;
int frameHeight;
RECT frameRect;
BOOL fSearchRequestIsXForm;
}JabberSearchData;
typedef struct tag_Data
{
TCHAR *Label;
TCHAR * Var;
TCHAR * defValue;
BOOL bHidden;
BOOL bReadOnly;
int Order;
} Data;
static HWND searchHandleDlg=NULL;
//local functions declarations
static int JabberSearchFrameProc(HWND hwnd, int msg, WPARAM wParam, LPARAM lParam);
static int JabberSearchAddField(HWND hwndDlg, Data* FieldDat);
static void JabberIqResultGetSearchFields(HXML iqNode, void *userdata);
static void JabberSearchFreeData(HWND hwndDlg, JabberSearchData * dat);
static void JabberSearchRefreshFrameScroll(HWND hwndDlg, JabberSearchData * dat);
static INT_PTR CALLBACK JabberSearchAdvancedDlgProc(HWND hwndDlg, UINT msg, WPARAM wParam, LPARAM lParam);
static void JabberSearchDeleteFromRecent(TCHAR * szAddr,BOOL deleteLastFromDB);
void SearchAddToRecent(TCHAR * szAddr, HWND hwnd);
// Implementation of MAP class (the list
template <typename _KEYTYPE , int (*COMPARATOR)(_KEYTYPE*, _KEYTYPE*) >
class UNIQUE_MAP
{
public:
typedef _KEYTYPE* (*COPYKEYPROC)(_KEYTYPE*);
typedef void (*DESTROYKEYPROC)(_KEYTYPE*);
private:
typedef struct _tagRECORD
{
_tagRECORD(_KEYTYPE * key, TCHAR * value=NULL) { _key=key; _value=value; _order=0; _destroyKeyProc=NULL; }
~_tagRECORD()
{
if (_key && _destroyKeyProc)
_destroyKeyProc(_key);
_key=NULL;
_destroyKeyProc=NULL;
}
_KEYTYPE *_key;
TCHAR * _value;
int _order;
DESTROYKEYPROC _destroyKeyProc;
} _RECORD;
int _nextOrder;
LIST<_RECORD> _Records;
static int _KeysEqual(const _RECORD* p1, const _RECORD* p2)
{
if (COMPARATOR)
return (int)(COMPARATOR((p1->_key),(p2->_key)));
else
return (int) (p1->_key < p2->_key);
}
inline int _remove(_RECORD* p)
{
int _itemOrder=p->_order;
if (_Records.remove(p))
{
delete(p);
_nextOrder--;
for (int i=0; i<_Records.getCount(); i++)
{
_RECORD * temp=_Records[i];
if (temp && temp->_order>_itemOrder)
temp->_order--;
}
return 1;
}
return 0;
}
inline _RECORD * _getUnorderedRec (int index)
{
for (int i=0; i<_Records.getCount(); i++)
{
_RECORD * rec=_Records[i];
if (rec->_order==index) return rec;
}
return NULL;
}
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(_KEYTYPE* Key, TCHAR *Value)
{
_RECORD * rec= new _RECORD(Key,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=Value;
delete rec;
}
return index;
}
int insertCopyKey(_KEYTYPE* Key, TCHAR *Value, _KEYTYPE** _KeyReturn, COPYKEYPROC CopyProc, DESTROYKEYPROC DestroyProc)
{
_RECORD * rec= new _RECORD(Key,Value);
int index=_Records.getIndex(rec);
if (index<0)
{
_KEYTYPE* newKey=CopyProc(Key);
if (!_Records.insert(rec))
{
delete rec;
DestroyProc(newKey);
if (_KeyReturn) *_KeyReturn=NULL;
}
else
{
rec->_key=newKey;
rec->_destroyKeyProc=DestroyProc;
index=_Records.getIndex(rec);
rec->_order=_nextOrder++;
if (_KeyReturn) *_KeyReturn=newKey;
}
}
else
{
_Records[index]->_value=Value;
if (_KeyReturn) *_KeyReturn=_Records[index]->_key;
delete rec;
}
return index;
}
inline TCHAR* operator[](_KEYTYPE* _KEY) const
{
_RECORD rec(_KEY);
int index=_Records.getIndex(&rec);
_RECORD * rv=_Records[index];
if (rv)
{
if (rv->_value)
return rv->_value;
else
return _T("");
}
else
return NULL;
}
inline TCHAR* operator[](int index) const
{
_RECORD * rv=_Records[index];
if (rv) return rv->_value;
else return NULL;
}
inline _KEYTYPE* getKeyName(int index)
{
_RECORD * rv=_Records[index];
if (rv) return rv->_key;
else return NULL;
}
inline TCHAR * getUnOrdered(int index)
{
_RECORD * rec=_getUnorderedRec(index);
if (rec) return rec->_value;
else return NULL;
}
inline _KEYTYPE * getUnOrderedKeyName(int index)
{
_RECORD * rec=_getUnorderedRec(index);
if (rec) return rec->_key;
else return NULL;
}
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(_KEYTYPE * key)
{
_RECORD temp(key);
return _Records.getIndex(&temp);
}
};
inline int TCharKeyCmp(TCHAR* a, TCHAR* b)
{
return (int)(mir_tstrcmpi(a,b));
}
|
