blob: 5a3d4f7fd10370c0d75ea5b354cb96904ca1ce9d (
plain)
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
|
//***********************************************************
// Copyright © 2008 Valentin Pavlyuchenko
//
// This file is part of Boltun.
//
// Boltun 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.
//
// Boltun 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 Boltun. If not, see <http://www.gnu.org/licenses/>.
//
//***********************************************************
#include "..\boltun.h"
using namespace std;
UnRecentChooser::UnRecentChooser()
:last(-1), minimum(-1), newItemsPrio(-1), maxOldPrio(-1)
{
}
void UnRecentChooser::AddChoice(tstring value, float prio)
{
if (items.count(value) != 0)
{
int val = (int)items[value];
oldItems.insert(make_pair(val, value));
oldPrios.insert(make_pair(value, prio));
if (minimum > val || minimum == -1)
minimum = val;
if (maxOldPrio < prio)
maxOldPrio = prio;
}
else
{
if (prio > newItemsPrio)
{
newItems.push_back(value);
newItemsPrio = prio;
}
}
}
tstring UnRecentChooser::Choose()
{
tstring res;
//Find answer
if (newItemsPrio != -1)
{
int num = rand() % newItems.size();
res = newItems[num];
}
else
if (minimum == -1)
res = _T("");
else
{
float minprio = maxOldPrio / 1.5F;
while (oldPrios[oldItems[minimum]] < minprio)
minimum++;
res = oldItems[minimum];
}
//Clean items
minimum = -1;
newItemsPrio = -1;
maxOldPrio = -1;
oldItems.clear();
oldPrios.clear();
newItems.clear();
return res;
}
void UnRecentChooser::SaveChoice(tstring choice)
{
//Add answer
if (items.find(choice) != items.end())
{
for (vector<tstring>::iterator it = itemsList.begin(); it != itemsList.end(); ++it)
if (*it == choice)
{
itemsList.erase(it);
break;
}
}
items[choice] = ++last;
itemsList.push_back(choice);
if (itemsList.size() > maxItems)
{
items.erase(*itemsList.begin());
itemsList.erase(itemsList.begin());
}
}
|
