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
|
/* ScummVM - Graphic Adventure Engine
*
* ScummVM is the legal property of its developers, whose names
* are too numerous to list here. Please refer to the COPYRIGHT
* file distributed with this source distribution.
*
* 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 "mohawk/riven_stack.h"
#include "mohawk/riven.h"
#include "mohawk/resource.h"
namespace Mohawk {
RivenNameList::RivenNameList() {
}
RivenNameList::RivenNameList(MohawkEngine_Riven *vm, uint16 id) {
loadResource(vm, id);
}
RivenNameList::~RivenNameList() {
}
void RivenNameList::loadResource(MohawkEngine_Riven *vm, uint16 id) {
Common::SeekableReadStream *nameStream = vm->getResource(ID_NAME, id);
uint16 namesCount = nameStream->readUint16BE();
Common::Array<uint16> stringOffsets;
stringOffsets.resize(namesCount);
for (uint16 i = 0; i < namesCount; i++) {
stringOffsets[i] = nameStream->readUint16BE();
}
_index.resize(namesCount);
for (uint16 i = 0; i < namesCount; i++) {
_index[i] = nameStream->readUint16BE();
}
int32 curNamesPos = nameStream->pos();
_names.resize(namesCount);
for (uint32 i = 0; i < namesCount; i++) {
nameStream->seek(curNamesPos + stringOffsets[i]);
Common::String name;
for (char c = nameStream->readByte(); c; c = nameStream->readByte())
name += c;
_names[i] = name;
}
delete nameStream;
}
Common::String RivenNameList::getName(uint16 nameID) const {
return _names[nameID];
}
int16 RivenNameList::getNameId(const Common::String &name) const {
int low = 0;
int high = _index.size() - 1;
int midpoint = 0;
// Binary search using the sorted _index array
while (low <= high) {
midpoint = low + (high - low) / 2;
const Common::String &midpointName = _names[_index[midpoint]];
int comparison = name.compareToIgnoreCase(midpointName);
if (comparison == 0) {
return _index[midpoint];
} else if (comparison < 0) {
high = midpoint - 1;
} else {
low = midpoint + 1;
}
}
return -1;
}
} // End of namespace Mohawk
|
