blob: 91a961e307b6ef334f31fb75098e7ead67aadfda (
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
|
//***********************************************************
// 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/>.
//
//***********************************************************
#ifndef UnRecentChooserH
#define UnRecentChooserH
#include <map>
#include <vector>
#include <string>
#include "tstring.h"
class UnRecentChooser
{
std::map<tstring, size_t> items;
std::vector<tstring> itemsList;
std::vector<tstring> newItems;
float newItemsPrio, maxOldPrio;
std::map<size_t, tstring> oldItems;
std::map<tstring, float> oldPrios;
size_t last;
int min;
static const size_t maxItems = 100;
public:
UnRecentChooser();
void AddChoice(tstring value, float prio = 1.0);
tstring Choose();
void SaveChoice(tstring choice);
};
#endif /* UnRecentChooserH */
|
