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
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
|
/*
* Copyright 2003-2021 The Music Player Daemon Project
* http://www.musicpd.org
*
* 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.,
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
#include "Count.hxx"
#include "Selection.hxx"
#include "Interface.hxx"
#include "Partition.hxx"
#include "client/Response.hxx"
#include "song/LightSong.hxx"
#include "tag/Tag.hxx"
#include "tag/VisitFallback.hxx"
#include "TagPrint.hxx"
#include <functional>
#include <map>
struct SearchStats {
unsigned n_songs{0};
std::chrono::duration<std::uint64_t, SongTime::period> total_duration;
constexpr SearchStats()
: total_duration(0) {}
};
class TagCountMap : public std::map<std::string, SearchStats> {
};
static void
PrintSearchStats(Response &r, const SearchStats &stats) noexcept
{
unsigned total_duration_s =
std::chrono::duration_cast<std::chrono::seconds>(stats.total_duration).count();
r.Format("songs: %u\n"
"playtime: %u\n",
stats.n_songs, total_duration_s);
}
static void
Print(Response &r, TagType group, const TagCountMap &m) noexcept
{
assert(unsigned(group) < TAG_NUM_OF_ITEM_TYPES);
for (const auto &i : m) {
tag_print(r, group, i.first.c_str());
PrintSearchStats(r, i.second);
}
}
static void
stats_visitor_song(SearchStats &stats, const LightSong &song) noexcept
{
stats.n_songs++;
const auto duration = song.GetDuration();
if (!duration.IsNegative())
stats.total_duration += duration;
}
static void
CollectGroupCounts(TagCountMap &map, const Tag &tag,
const char *value) noexcept
{
auto r = map.insert(std::make_pair(value, SearchStats()));
SearchStats &s = r.first->second;
++s.n_songs;
if (!tag.duration.IsNegative())
s.total_duration += tag.duration;
}
static void
GroupCountVisitor(TagCountMap &map, TagType group,
const LightSong &song) noexcept
{
const Tag &tag = song.tag;
VisitTagWithFallbackOrEmpty(tag, group, [&](const auto &val)
{ return CollectGroupCounts(map, tag, val); });
}
void
PrintSongCount(Response &r, const Partition &partition, const char *name,
const SongFilter *filter,
TagType group)
{
const Database &db = partition.GetDatabaseOrThrow();
const DatabaseSelection selection(name, true, filter);
if (group == TAG_NUM_OF_ITEM_TYPES) {
/* no grouping */
SearchStats stats;
const auto f = [&](const auto &song)
{ return stats_visitor_song(stats, song); };
db.Visit(selection, f);
PrintSearchStats(r, stats);
} else {
/* group by the specified tag: store counts in a
std::map */
TagCountMap map;
const auto f = [&map,group](const auto &song)
{ return GroupCountVisitor(map, group, song); };
db.Visit(selection, f);
Print(r, group, map);
}
}
|
