morphdetect/instructionQueue.cpp at master · nastya/morphdetect · GitHub

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
#include "instructionQueue.h"
#include "compareUtils.h"

namespace detect_similar
{

InstructionQueue::InstructionQueue()
 : vector<InstructionInfo>()
{
}

void InstructionQueue::statCheck()
{
	if (_stat.empty())
		statFill();
}

void InstructionQueue::statFill()
{
	_stat.clear();
	for (auto &x : *this)
		_stat[x.hash]++;
}


int InstructionQueue::bestMatch(InstructionQueue *models, int models_count, float threshold, float *coef_out, float *ans_out)
{
	float max_coef = 0;
	int max_ans = 0, ind_max = 0;

	for (int i = 0; i < models_count; i++)
	{
		if (!diffPossible(models[i], threshold))
			continue;

		int ans = CompareUtils::longest_common_subsequence(*this, models[i]);
		float coef = ans * 1.0 / models[i].size();

		if (coef > threshold) {
			if (coef > max_coef)
			{
				max_coef = coef;
			}
			if (ans > max_ans)
			{
				max_ans = ans;
				ind_max = i;
			}
		}
	}

	if (ans_out != NULL)
		*ans_out = max_ans;

	if (coef_out != NULL)
		*coef_out = max_coef;

	return (max_coef > threshold) ? ind_max : -1;
}

bool InstructionQueue::diffPossible(InstructionQueue &model, float required)
{
	required *= model.size();
	statCheck();
	model.statCheck();

	int possible = model.size();
	for (auto &pair : model._stat) {
		possible -= _stat.count(pair.first) ? pair.second - min(pair.second, _stat[pair.first]) : pair.second;
		if (possible < required)
			return false;
	}

	return true;
}

} //namespace detect_similar