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
116
117
118
119
120
121
122
123
124
|
////////////////////////////////////////////////////////////////////////////////////////
//
// Nestopia - NES/Famicom emulator written in C++
//
// Copyright (C) 2003-2008 Martin Freij
//
// This file is part of Nestopia.
//
// Nestopia 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.
//
// Nestopia 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 Nestopia; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
//
////////////////////////////////////////////////////////////////////////////////////////
#include <string>
#include <map>
#include "NstAssert.hpp"
#include "NstChips.hpp"
namespace Nes
{
namespace Core
{
#ifdef NST_MSVC_OPTIMIZE
#pragma optimize("s", on)
#endif
struct Chips::Container
{
struct Less
{
bool operator () (const std::wstring& a,const std::wstring& b) const
{
return Core::StringCompare( a.c_str(), b.c_str() ) < 0;
}
};
typedef std::multimap<std::wstring,Type,Less> Map;
Map map;
};
Chips::Chips(const Chips& chips)
: container(chips.container ? new Container(*chips.container) : NULL) {}
Chips::~Chips()
{
Clear();
}
Chips& Chips::operator = (const Chips& chips)
{
if (this != &chips)
{
Clear();
if (chips.container)
container = new Container(*chips.container);
}
return *this;
}
Chips::Type& Chips::Add(wcstring type)
{
if (container == NULL)
container = new Container;
return container->map.insert( Container::Map::value_type(type,Type()) )->second;
}
void Chips::Clear()
{
if (Container* tmp = container)
{
container = NULL;
delete tmp;
}
}
Chips::Type* Chips::Find(wcstring type)
{
NST_ASSERT( type );
if (container)
{
Container::Map::iterator it(container->map.find(type));
if (it != container->map.end())
return &it->second;
}
return NULL;
}
const Chips::Type* Chips::Find(wcstring type) const
{
NST_ASSERT( type );
if (container)
{
Container::Map::const_iterator it(static_cast<const Container::Map&>(container->map).find(type));
if (it != container->map.end())
return &it->second;
}
return NULL;
}
#ifdef NST_MSVC_OPTIMIZE
#pragma optimize("", on)
#endif
}
}
|
