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
|
/*
Copyright (C) 2014 Paul Davis
Author: David Robillard
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.
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., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
#ifndef __ardour_item_counts_h__
#define __ardour_item_counts_h__
#include <cstddef>
#include <map>
#include <utility>
#include "ardour/data_type.h"
#include "evoral/Parameter.hpp"
/** A count of various GUI items.
*
* This is used to keep track of 'consumption' of a selection when pasting, but
* may be useful elsewhere.
*/
class ItemCounts
{
public:
ItemCounts() : _notes(0) {}
size_t n_playlists(ARDOUR::DataType t) const { return get_n(t, _playlists); }
size_t n_regions(ARDOUR::DataType t) const { return get_n(t, _regions); }
size_t n_lines(Evoral::Parameter t) const { return get_n(t, _lines); }
size_t n_notes() const { return _notes; }
void increase_n_playlists(ARDOUR::DataType t, size_t delta=1) {
increase_n(t, _playlists, delta);
}
void increase_n_regions(ARDOUR::DataType t, size_t delta=1) {
increase_n(t, _regions, delta);
}
void increase_n_lines(Evoral::Parameter t, size_t delta=1) {
increase_n(t, _lines, delta);
}
void increase_n_notes(size_t delta=1) { _notes += delta; }
private:
template<typename Key>
size_t
get_n(const Key& key, const typename std::map<Key, size_t>& counts) const {
typename std::map<Key, size_t>::const_iterator i = counts.find(key);
return (i == counts.end()) ? 0 : i->second;
}
template<typename Key>
void
increase_n(const Key& key, typename std::map<Key, size_t>& counts, size_t delta) {
typename std::map<Key, size_t>::iterator i = counts.find(key);
if (i != counts.end()) {
i->second += delta;
} else {
counts.insert(std::make_pair(key, delta));
}
}
std::map<ARDOUR::DataType, size_t> _playlists;
std::map<ARDOUR::DataType, size_t> _regions;
std::map<Evoral::Parameter, size_t> _lines;
size_t _notes;
};
#endif /* __ardour_item_counts_h__ */
|
