File: grt_string_list_model.cpp

package info (click to toggle)
mysql-workbench 6.3.8%2Bdfsg-1
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 113,932 kB
  • ctags: 87,814
  • sloc: ansic: 955,521; cpp: 427,465; python: 59,728; yacc: 59,129; xml: 54,204; sql: 7,091; objc: 965; makefile: 638; sh: 613; java: 237; perl: 30; ruby: 6; php: 1
file content (378 lines) | stat: -rw-r--r-- 9,506 bytes parent folder | download | duplicates (2)
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
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
/* 
 * Copyright (c) 2007, 2014, Oracle and/or its affiliates. All rights reserved.
 *
 * 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; version 2 of the
 * License.
 * 
 * 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., 51 Franklin St, Fifth Floor, Boston, MA
 * 02110-1301  USA
 */

#include "grt_string_list_model.h"
#include <pcre.h>
#include "grtpp_util.h"

using namespace bec;

GrtStringListModel::GrtStringListModel()
  : _items_val_masks(NULL),
    _icon_id(0),
    _active_items_count(0),
    _invalidated(false)
{
}


void GrtStringListModel::reset()
{
  _items.clear();
  _visible_items.clear();
  invalidate();
  refresh();
}


void GrtStringListModel::reset(const std::list<std::string> &items)
{
  _items.resize(items.size());
  std::list<std::string>::const_iterator i= items.begin();
  for (size_t n= 0, count= items.size(); n < count; ++n, ++i)
    _items[n]= Item_handler(std::string(*i), n);
  std::sort(_items.begin(), _items.end());
  _visible_items.clear();
  invalidate(); // consequent call of refresh() is expected to process _visible_mask & update _visible_items
  refresh();
}


void GrtStringListModel::invalidate()
{
  _active_items_count= 0,
  _invalidated= true;
}


void GrtStringListModel::items_val_mask(const std::string items_val_mask)
{
  if (_items_val_mask != items_val_mask)
  {
    _items_val_mask= items_val_mask;
    invalidate();
  }
}


const std::string & GrtStringListModel::items_val_mask() const
{
  return _items_val_mask;
}


GrtStringListModel * GrtStringListModel::items_val_masks() const
{
  return _items_val_masks;
}


void GrtStringListModel::items_val_masks(GrtStringListModel *items_val_masks)
{
  if (_items_val_masks != items_val_masks)
  {
    _items_val_masks= items_val_masks;
    invalidate();
  }
}


size_t GrtStringListModel::count()
{
  return _visible_items.size();
}


size_t GrtStringListModel::active_items_count() const
{
  return _active_items_count;
}


size_t GrtStringListModel::total_items_count() const
{
  return _items.size();
}


size_t GrtStringListModel::get_item_id(size_t item_index)
{
  return _items[_visible_items[item_index]].iid;
}


bool GrtStringListModel::get_field(const NodeId &node, ColumnId column, std::string &value)
{
  switch ((Columns)column)
  {
  case Name:
    value= _items[_visible_items[node[0]]].val;
    return true;
  }
  return false;
}


void GrtStringListModel::icon_id(IconId icon_id)
{
  _icon_id= icon_id;
}


IconId GrtStringListModel::get_field_icon(const NodeId &node, ColumnId column, IconSize size)
{
  return _icon_id;
}


void GrtStringListModel::add_item(const grt::StringRef &item, size_t id)
{
  _items.push_back(Item_handler(*item, id));
  std::nth_element(_items.begin(), _items.end()-1, _items.end());
  invalidate(); // consequent call of refresh() is expected to process _visible_mask & update _visible_items
  // it's not called at once because of optimization for batch insert/move operations
}


void GrtStringListModel::remove_item(size_t index)
{
  std::vector<size_t>::iterator i= _visible_items.begin() + (size_t)index;
  _items.erase(_items.begin() + *i);
  _visible_items.erase(i);
  invalidate(); // consequent call of refresh() is expected to process _visible_mask & update _visible_items
}


void GrtStringListModel::remove_items(std::vector<size_t> &item_indexes)
{
  std::sort(item_indexes.begin(), item_indexes.end());
  for (std::vector<size_t>::reverse_iterator i = item_indexes.rbegin(); i != item_indexes.rend(); ++i)
    remove_item(*i);
}


void GrtStringListModel::copy_items_to_val_masks_list(std::vector<size_t> &item_indexes)
{
  if (!_items_val_masks)
    return;
  
  std::sort(item_indexes.begin(), item_indexes.end());
  for (std::vector<size_t>::iterator i = item_indexes.begin(); i != item_indexes.end(); ++i)
  {
    Item_handler &item_handler= _items[_visible_items[(size_t)*i]];
    _items_val_masks->add_item(terminate_wildcard_symbols(item_handler.val), -1);
  }
}


std::vector<std::string> GrtStringListModel::items() const
{
  // init visibility map
  std::vector<bool> items;
  items.reserve(_items.size());
  std::fill_n(std::back_inserter(items), _items.size(), true);

  // iterate all masks
  if (_items_val_masks)
  {
    std::vector<std::string> masks= _items_val_masks->items();
    for (std::vector<std::string>::iterator i= masks.begin(); i != masks.end(); ++i)
      process_mask(*i, items, false);
  }

  // determine active items
  std::vector<std::string> res;
  res.reserve(items.size());
  size_t n= 0;
  for (std::vector<bool>::const_iterator i= items.begin(); i != items.end(); ++i, ++n)
    if (*i)
      res.push_back(_items[n].val);
  return res;
}


GrtStringListModel::Items_ids GrtStringListModel::items_ids() const
{
  // init visibility map
  std::vector<bool> items;
  items.reserve(_items.size());
  std::fill_n(std::back_inserter(items), _items.size(), true);

  // iterate all masks
  if (_items_val_masks)
  {
    std::vector<std::string> masks= _items_val_masks->items();
    for (std::vector<std::string>::iterator i= masks.begin(); i != masks.end(); ++i)
      process_mask(*i, items, false);
  }

  // determine active items
  std::vector<size_t> res;
  res.reserve(items.size());
  size_t n= 0;
  for (std::vector<bool>::const_iterator i= items.begin(); i != items.end(); ++i, ++n)
    if (*i)
      res.push_back(_items[n].iid);
  return res;
}

void GrtStringListModel::refresh()
{
  if (!_invalidated)
    return;

  // if filtering is not appropriate then just mark all items as visible
  if (!_items_val_masks && _items_val_mask.empty())
  {
    _visible_items.resize(_items.size());
    size_t n= 0;
    for (Items::const_iterator i= _items.begin(); i != _items.end(); ++i, ++n)
      _visible_items[n]= n;

    _invalidated= false;
    return;
  }

  // init visibility map
  std::vector<bool> items;
  items.reserve(_items.size());
  std::fill_n(std::back_inserter(items), _items.size(), true);

  // iterate all masks
  if (_items_val_masks)
  {
    std::vector<std::string> masks= _items_val_masks->items();
    for (std::vector<std::string>::iterator i= masks.begin(); i != masks.end(); ++i)
      process_mask(*i, items, false);
  }

  _active_items_count= std::count_if(items.begin(), items.end(), std::bind2nd(std::equal_to<bool>(), true));

  // also process preview mask
  if (!_items_val_mask.empty())
    process_mask(_items_val_mask, items, true);

  // set final items visibility
  {
    _visible_items.clear();
    _visible_items.reserve(_items.size());
    size_t n= 0;
    for (std::vector<bool>::const_iterator i= items.begin(); i != items.end(); ++i, ++n)
      if (*i)
        _visible_items.push_back(n);
  }

  _invalidated= false;
}


void GrtStringListModel::process_mask(const std::string &mask, std::vector<bool> &items, bool match_means_visible) const
{
  //!static const char *ANY_SYM= "(?:\\pL(?:" UNICODE_CHAR_PCRE ")?)";
  //!static const char *ANY_SEQ= "(?:\\pL(?:" UNICODE_CHAR_PCRE ")*)";
  static const char *ANY_SYM= ".?";
  static const char *ANY_SEQ= ".*";

  // build regexp string
  std::string regexp;
  {
    static const std::string meta_symbols= "~!@#$%^&*()-+=:;`\'\"|,.<>{}[]?/";
    bool term_state= false;
    regexp.reserve(mask.size());
    for (std::string::const_iterator i= mask.begin(); i != mask.end(); ++i)
    {
      if (term_state)
      {
        term_state= false;
        regexp.push_back(*i);
      }
      else if ('\\' == *i)
      {
        term_state= true;
        regexp.push_back(*i);
      }
      else if ('?' == *i)
        regexp.append(ANY_SYM);
      else if ('*' == *i)
        regexp.append(ANY_SEQ);
      else
      {
        if (std::find(meta_symbols.begin(), meta_symbols.end(), *i) != meta_symbols.end())
          regexp.push_back('\\');
        regexp.push_back(*i);
      }
    }
  }

  // compile regexp
  pcre *patre;
  {
    const char *error;
    int erroffset;
    patre= pcre_compile(regexp.c_str(), PCRE_UTF8 | PCRE_EXTRA, &error, &erroffset, NULL);
    if (!patre)
      throw std::logic_error("error compiling regex " + std::string(error));
  }

  // sift items
  size_t n= 0;
  for (std::vector<bool>::iterator i= items.begin(); i != items.end(); ++i, ++n)
  {
    if (*i)
    {
      const Item_handler &item= _items[n];
      int patres[2];
      
      int substr_count= pcre_exec(
        patre,
        NULL,
        item.val.c_str(),
        static_cast<int>(item.val.size()),
        0,
        0,
        patres,
        sizeof(patres)/sizeof(int));

      if (substr_count > 0 && patres[1] == (int)item.val.size())
        *i= match_means_visible;
      else
        *i= !match_means_visible;
    }
  }

  pcre_free(patre);
}


std::string GrtStringListModel::terminate_wildcard_symbols(const std::string &str)
{
  std::string res;
  for (std::string::const_iterator i= str.begin(); i != str.end(); ++i)
  {
    if ('\\' == *i)
      res.append("\\\\");
    else if ('?' == *i)
      res.append("\\?");
    else if ('*' == *i)
      res.append("\\*");
    else
      res.push_back(*i);
  }
  return res;
}