mirrors/bgfx
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Use tinystl/unordered_map instead of c++11 only implementation

Browse Source
This commit is contained in:
m.milanovic@levi9.com 2014-08-22 16:35:30 +02:00
parent 1baf1c0734
commit 5aaddfccb9
3 changed files with 16 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
examples/14-shadowvolumes/shadowvolumes.cpp
View File

@ -8,8 +8,10 @@
#include <string>
#include <vector>
#include <unordered_map>
#include <map>
#include <tinystl/allocator.h>
#include <tinystl/unordered_map.h>
namespace stl = tinystl;
namespace std { namespace tr1 {} }
using namespace std::tr1;
@ -695,7 +697,7 @@ struct HalfEdges
{
m_data = (HalfEdge*)malloc(2 * _numIndices * sizeof(HalfEdge) );
std::unordered_map<uint16_t, std::vector<uint16_t> > edges;
stl::unordered_map<uint16_t, std::vector<uint16_t> > edges;
for (uint32_t ii = 0; ii < _numIndices; ii+=3)
{
uint16_t idx0 = _indices[ii];

8
examples/common/entry/cmd.cpp
View File

@ -13,7 +13,9 @@
#include "dbg.h"
#include "cmd.h"
#include <string>
#include <unordered_map>
#include <tinystl/allocator.h>
#include <tinystl/unordered_map.h>
namespace stl = tinystl;
struct CmdContext
{
@ -30,7 +32,7 @@ struct CmdContext
uint32_t cmd = bx::hashMurmur2A(_name, (uint32_t)strlen(_name) );
BX_CHECK(m_lookup.end() == m_lookup.find(cmd), "Command \"%s\" already exist.", _name);
Func fn = { _fn, _userData };
m_lookup.insert(std::make_pair(cmd, fn) );
m_lookup.insert(stl::make_pair(cmd, fn) );
}
void exec(const char* _cmd)
@ -82,7 +84,7 @@ struct CmdContext
void* m_userData;
};
typedef std::unordered_map<uint32_t, Func> CmdLookup;
typedef stl::unordered_map<uint32_t, Func> CmdLookup;
CmdLookup m_lookup;
};

11
examples/common/entry/input.cpp
View File

@ -5,11 +5,14 @@
#include <memory.h>
#include <string>
#include <unordered_map>
#include "entry_p.h"
#include "input.h"
#include <tinystl/allocator.h>
#include <tinystl/unordered_map.h>
namespace stl = tinystl;
struct Mouse
{
Mouse()
@ -112,12 +115,12 @@ struct Input
void addBindings(const char* _name, const InputBinding* _bindings)
{
m_inputBindingsMap.insert(std::make_pair(_name, _bindings) );
m_inputBindingsMap.insert(stl::make_pair(_name, _bindings) );
}
void removeBindings(const char* _name)
{
m_inputBindingsMap.erase(_name);
m_inputBindingsMap.erase(m_inputBindingsMap.find(_name));
}
void process(const InputBinding* _bindings)
@ -169,7 +172,7 @@ struct Input
m_keyboard.reset();
}
typedef std::unordered_map<std::string, const InputBinding*> InputBindingMap;
typedef stl::unordered_map<const char*, const InputBinding*> InputBindingMap;
InputBindingMap m_inputBindingsMap;
Mouse m_mouse;
Keyboard m_keyboard;