blob: 67d0b4a1f413916a0f5e760239d81bba2c5b5116 (
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
|
/*
Copyright 2009 Last.fm Ltd.
- Primarily authored by Max Howell, Jono Cole and Doug Mansell
This file is part of liblastfm.
liblastfm 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 3 of the License, or
(at your option) any later version.
liblastfm 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 liblastfm. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef LASTFM_SCROBBLE_H
#define LASTFM_SCROBBLE_H
#include "Track.h"
namespace lastfm
{
struct Scrobble : lastfm::Track
{
Scrobble()
{}
Scrobble( const lastfm::Track& that ) : Track( that )
{}
QByteArray sourceString() const;
QByteArray ratingCharacter() const
{
return d->extras["rating"].toAscii();
}
bool isLoved() const { return ratingCharacter() == QChar('L'); }
bool isBanned() const { return ratingCharacter() == QChar('B'); }
bool isSkipped() const { return ratingCharacter() == QChar('S'); }
/** if isValid() returns false, we will not scrobble the track */
enum Invalidity
{
TooShort,
ArtistNameMissing,
TrackNameMissing,
ArtistInvalid,
NoTimestamp,
FromTheFuture,
FromTheDistantPast
};
/** @returns true if the server is unlikely to reject this scrobble */
bool isValid( Invalidity* = 0 ) const;
};
}
#endif
|