mirror of
https://github.com/bsnes-emu/bsnes.git
synced 2025-02-23 14:42:33 +01:00
092cac9073
byuu says:
Changelog:
- synchronizes lots of nall changes
- changes displayed program title from tomoko to higan(*)
- browser dialog sort is case-insensitive
- .sys folders look at user-selected library path; no longer hard-coded
Tried to get rid of the file modes from the Windows browser dialog, but
it was being a bitch so I left it on for now.
- The storage locations and binary still use tomoko. I'm not really sure
what to do here. The idea is there may be more than one "higan" UI in
the future, but I don't want people to go around calling the entire
program by the UI name. For official Windows releases, I can rename
the binaries to "higan-{profile}.exe", and by putting the config files
with the binary, they won't ever see the tomoko folder. Linux is of
course trickier.
Note: Windows users will need to edit hiro/components.hpp and comment
out these lines:
#define Hiro_Console
#define Hiro_IconView
#define Hiro_SourceView
#define Hiro_TreeView
I forgot to do that, and too lazy to upload another WIP.
62 lines
2.2 KiB
C++
62 lines
2.2 KiB
C++
#ifndef NALL_MAP_HPP
|
|
#define NALL_MAP_HPP
|
|
|
|
#include <nall/set.hpp>
|
|
|
|
namespace nall {
|
|
|
|
template<typename T, typename U> struct map {
|
|
struct node_t {
|
|
T key;
|
|
U value;
|
|
node_t() = default;
|
|
node_t(const T& key) : key(key) {}
|
|
node_t(const T& key, const U& value) : key(key), value(value) {}
|
|
auto operator< (const node_t& source) const -> bool { return key < source.key; }
|
|
auto operator==(const node_t& source) const -> bool { return key == source.key; }
|
|
};
|
|
|
|
auto find(const T& key) const -> maybe<U&> {
|
|
if(auto node = root.find({key})) return node().value;
|
|
return nothing;
|
|
}
|
|
|
|
auto insert(const T& key, const U& value) -> void { root.insert({key, value}); }
|
|
auto remove(const T& key) -> void { root.remove({key}); }
|
|
auto size() const -> unsigned { return root.size(); }
|
|
auto reset() -> void { root.reset(); }
|
|
|
|
auto begin() -> typename set<node_t>::iterator { return root.begin(); }
|
|
auto end() -> typename set<node_t>::iterator { return root.end(); }
|
|
|
|
auto begin() const -> const typename set<node_t>::iterator { return root.begin(); }
|
|
auto end() const -> const typename set<node_t>::iterator { return root.end(); }
|
|
|
|
protected:
|
|
set<node_t> root;
|
|
};
|
|
|
|
template<typename T, typename U> struct bimap {
|
|
auto find(const T& key) const -> maybe<U&> { return tmap.find(key); }
|
|
auto find(const U& key) const -> maybe<T&> { return umap.find(key); }
|
|
auto insert(const T& key, const U& value) -> void { tmap.insert(key, value); umap.insert(value, key); }
|
|
auto remove(const T& key) -> void { if(auto p = tmap.find(key)) { umap.remove(p().value); tmap.remove(key); } }
|
|
auto remove(const U& key) -> void { if(auto p = umap.find(key)) { tmap.remove(p().value); umap.remove(key); } }
|
|
auto size() const -> unsigned { return tmap.size(); }
|
|
auto reset() -> void { tmap.reset(); umap.reset(); }
|
|
|
|
auto begin() -> typename set<typename map<T, U>::node_t>::iterator { return tmap.begin(); }
|
|
auto end() -> typename set<typename map<T, U>::node_t>::iterator { return tmap.end(); }
|
|
|
|
auto begin() const -> const typename set<typename map<T, U>::node_t>::iterator { return tmap.begin(); }
|
|
auto end() const -> const typename set<typename map<T, U>::node_t>::iterator { return tmap.end(); }
|
|
|
|
protected:
|
|
map<T, U> tmap;
|
|
map<U, T> umap;
|
|
};
|
|
|
|
}
|
|
|
|
#endif
|