aboutsummaryrefslogtreecommitdiff
path: root/engines/sword25/kernel/string.h
blob: 948c5f31e4cc82e8894af2f38646813e1084e9d4 (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
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
/* 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.
 *
 * $URL$
 * $Id$
 *
 */

/*
 * This code is based on Broken Sword 2.5 engine
 *
 * Copyright (c) Malte Thiesen, Daniel Queteschiner and Michael Elsdoerfer
 *
 * Licensed under GNU GPL v2
 *
 */

#ifndef SWORD25_STRING
#define SWORD25_STRING

#include "common/str.h"

namespace BS_String {

inline uint getHash(const Common::String &str) {
	uint result = 0;

	for (uint i = 0; i < str.size(); i++)
		result = ((result << 5) - result) + str[i];

	return result;
}

inline bool toInt(const Common::String &str, int &result) {
	Common::String::const_iterator iter = str.begin();

	// Skip whitespaces
	while (*iter && (*iter == ' ' || *iter == '\t')) {
		++iter;
	}
	if (iter == str.end())
		return false;

	// Read sign, if available
	bool isNegative = false;
	if (*iter == '-') {
		isNegative = true;
		++iter;
	} else if (*iter == '+')
		++iter;

	// Skip whitespaces
	while (*iter && (*iter == ' ' || *iter == '\t')) {
		++iter;
	}
	if (iter == str.end())
		return false;

	// Convert string to integer
	result = 0;
	while (iter != str.end()) {
		if (*iter < '0' || *iter > '9') {
			while (*iter && (*iter == ' ' || *iter == '\t')) {
				++iter;
			}
			if (iter != str.end())
				return false;
			break;
		}
		result = (result * 10) + (*iter - '0');
		++iter;
	}

	if (isNegative)
		result = -result;

	return true;
}

inline bool toBool(const Common::String &str, bool &result) {
	if (str == "true" || str == "TRUE") {
		result = true;
		return true;
	} else if (str == "false" || str == "FALSE") {
		result = false;
		return true;
	}

	return false;
}

inline void toLower(Common::String &str) {
	str.toLowercase();
}

} // End of namespace BS_String

#endif