File: int_array.h

package info (click to toggle)
scummvm 2.9.1%2Bdfsg-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 450,580 kB
  • sloc: cpp: 4,299,825; asm: 28,322; python: 12,901; sh: 11,302; java: 9,289; xml: 7,895; perl: 2,639; ansic: 2,465; yacc: 1,670; javascript: 1,020; makefile: 933; lex: 578; awk: 275; objc: 82; sed: 11; php: 1
file content (71 lines) | stat: -rw-r--r-- 1,665 bytes parent folder | download | duplicates (2)
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
/* 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 3 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, see <http://www.gnu.org/licenses/>.
 *
 */

#ifndef MM1_DATA_INT_ARRAY_H
#define MM1_DATA_INT_ARRAY_H

#include "common/array.h"

namespace MM {
namespace MM1 {

class IntArray : public Common::Array<uint> {
public:
	IntArray() : Common::Array<uint>() {}

	int indexOf(uint val) const {
		for (uint i = 0; i < size(); ++i) {
			if ((*this)[i] == val)
				return i;
		}

		return -1;
	}

	/**
	 * Returns true if the array contains the value
	 */
	bool contains(uint val) {
		return indexOf(val) != -1;
	}

	/**
	 * Removes a given item from the array
	 */
	void remove(uint val) {
		int idx = indexOf(val);
		if (idx != -1)
			remove_at(idx);
	}

	/**
	 * Adds an item to the array
	 */
	void push_back(uint val) {
		assert(!contains(val));
		Common::Array<uint>::push_back(val);
	}
};

} // namespace MM1
} // namespace MM

#endif