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
|
/*
* Copyright (C) 2003-2013 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.
*/
#ifndef MPD_ID_TABLE_HXX
#define MPD_ID_TABLE_HXX
#include "gcc.h"
#include <algorithm>
#include <assert.h>
/**
* A table that maps id numbers to position numbers.
*/
class IdTable {
unsigned size;
unsigned next;
int *data;
public:
IdTable(unsigned _size):size(_size), next(1), data(new int[size]) {
std::fill_n(data, size, -1);
}
~IdTable() {
delete[] data;
}
int IdToPosition(unsigned id) const {
return id < size
? data[id]
: -1;
}
unsigned GenerateId() {
assert(next > 0);
assert(next < size);
while (true) {
unsigned id = next;
++next;
if (next == size)
next = 1;
if (data[id] < 0)
return id;
}
}
unsigned Insert(unsigned position) {
unsigned id = GenerateId();
data[id] = position;
return id;
}
void Move(unsigned id, unsigned position) {
assert(id < size);
assert(data[id] >= 0);
data[id] = position;
}
void Erase(unsigned id) {
assert(id < size);
assert(data[id] >= 0);
data[id] = -1;
}
};
#endif
|
