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
|
#pragma once
#include <set>
#include <list>
#include <vector>
#include <string>
#include <stdexcept>
#include <boost/noncopyable.hpp>
#include "fs.hh"
#include "player.hh"
#include "animvalue.hh"
namespace xmlpp { class Node; class Element; typedef std::vector<Node*>NodeSet; }
/**Exception which will be thrown when loading or
saving Players fails.*/
struct PlayersException: public std::runtime_error {
PlayersException (std::string const& msg) :
runtime_error(msg)
{}
};
/**A collection of all Players.
The current players plugged in a song can
be retrieved with Engine::getPlayers().
There are 3 different views united in that collection.
There is a full players list which are used by the
database, but also for the filtering.
The filtered list is used to show players in
the screen_players.
*/
class Players: boost::noncopyable {
private:
typedef std::set<PlayerItem> players_t;
typedef std::vector<PlayerItem> fplayers_t;
private:
players_t m_players;
fplayers_t m_filtered;
std::string m_filter;
AnimAcceleration math_cover;
bool m_dirty;
public:
Players();
~Players();
void load(xmlpp::NodeSet const& n);
void save(xmlpp::Element *players);
void update();
/// lookup a playerid using the players name
int lookup(std::string const& name) const;
/** lookup a players name using the playerid.
@return the players name or "Unkown Player"
*/
std::string lookup(int id) const;
/// add a player with a displayed name and an optional picture; if no id is given one will be assigned
void addPlayer (std::string const& name, std::string const& picture = "", int id = -1);
/// const array access
PlayerItem operator[](std::size_t pos) const {
if (pos < m_filtered.size()) return m_filtered[pos];
else return PlayerItem();
}
/// number of songs
size_t size() const { return m_filtered.size(); };
/// true if empty
int empty() const { return m_filtered.empty(); };
/// advances to next player
void advance(int diff) {
int size = m_filtered.size();
if (size == 0) return; // Do nothing if no songs are available
int _current = size ? (int(math_cover.getTarget()) + diff) % size : 0;
if (_current < 0) _current += m_filtered.size();
math_cover.setTarget(_current,this->size());
}
/// get current id
int currentId() const { return math_cover.getTarget(); }
/// gets current position
double currentPosition() { return math_cover.getValue(); }
/// gets current velocity
double currentVelocity() const { return math_cover.getVelocity(); }
/// sets margins for animation
void setAnimMargins(double left, double right) { math_cover.setMargins(left, right); }
/// @return current PlayerItem (the copy is very cheap at the moment)
PlayerItem current() const {
if (math_cover.getTarget() < m_filtered.size()) return m_filtered[math_cover.getTarget()];
else return PlayerItem();
}
/// filters playerlist by regular expression
void setFilter(std::string const& regex);
private:
int assign_id_internal(); /// returns the next available id
void filter_internal();
};
|
