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
|
//////////////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////////////
//
// copyright : (C) 2008 by Eran Ifrah
// file name : stringhighlighterjob.cpp
//
// -------------------------------------------------------------------------
// A
// _____ _ _ _ _
// / __ \ | | | | (_) |
// | / \/ ___ __| | ___| | _| |_ ___
// | | / _ \ / _ |/ _ \ | | | __/ _ )
// | \__/\ (_) | (_| | __/ |___| | || __/
// \____/\___/ \__,_|\___\_____/_|\__\___|
//
// F i l e
//
// 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.
//
//////////////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////////////
#include "stringsearcher.h"
#include "stringhighlighterjob.h"
#include <vector>
StringHighlighterJob::StringHighlighterJob(wxEvtHandler *parent, const wxChar *str, const wxChar *word, const wxChar* filename)
: Job(parent)
, m_str(str)
, m_word(word)
, m_filename(filename)
{
}
StringHighlighterJob::~StringHighlighterJob()
{
}
void StringHighlighterJob::Process(wxThread* thread)
{
wxUnusedVar(thread);
if ( m_str.IsEmpty() || m_word.IsEmpty() ) {
return;
}
int pos(0);
int match_len(0);
// remove reverse search
int offset(0);
// allocate result on the heap (will be freed by the caller)
StringHighlightOutput *results = new StringHighlightOutput;
results->filename = m_filename.c_str();
results->matches = new std::vector<std::pair<int, int> >;
while ( StringFindReplacer::Search(m_str, offset, m_word, wxSD_MATCHCASE | wxSD_MATCHWHOLEWORD, pos, match_len) ) {
// add result
std::pair<int, int> match;
match.first = pos;
match.second = match_len;
results->matches->push_back( match );
offset = pos + match_len;
}
// report the result back to parent
Post((void*) results);
}
|
