mirror of
https://github.com/bsnes-emu/bsnes.git
synced 2025-02-23 22:52:34 +01:00
4e2eb23835
byuu says: Changelog: - added Cocoa target: higan can now be compiled for OS X Lion [Cydrak, byuu] - SNES/accuracy profile hires color blending improvements - fixes Marvelous text [AWJ] - fixed a slight bug in SNES/SA-1 VBR support caused by a typo - added support for multi-pass shaders that can load external textures (requires OpenGL 3.2+) - added game library path (used by ananke->Import Game) to Settings->Advanced - system profiles, shaders and cheats database can be stored in "all users" shared folders now (eg /usr/share on Linux) - all configuration files are in BML format now, instead of XML (much easier to read and edit this way) - main window supports drag-and-drop of game folders (but not game files / ZIP archives) - audio buffer clears when entering a modal loop on Windows (prevents audio repetition with DirectSound driver) - a substantial amount of code clean-up (probably the biggest refactoring to date) One highly desired target for this release was to default to the optimal drivers instead of the safest drivers, but because AMD drivers don't seem to like my OpenGL 3.2 driver, I've decided to postpone that. AMD has too big a market share. Hopefully with v093 officially released, we can get some public input on what AMD doesn't like.
60 lines
2.1 KiB
C++
60 lines
2.1 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;
|
|
bool operator< (const node_t& source) const { return key < source.key; }
|
|
bool operator==(const node_t& source) const { return key == source.key; }
|
|
node_t() = default;
|
|
node_t(const T& key) : key(key) {}
|
|
node_t(const T& key, const U& value) : key(key), value(value) {}
|
|
};
|
|
|
|
optional<U> find(const T& key) const {
|
|
if(auto node = root.find({key})) return {true, node().value};
|
|
return false;
|
|
}
|
|
|
|
void insert(const T& key, const U& value) { root.insert({key, value}); }
|
|
void remove(const T& key) { root.remove({key}); }
|
|
unsigned size() const { return root.size(); }
|
|
void reset() { root.reset(); }
|
|
|
|
typename set<node_t>::iterator begin() { return root.begin(); }
|
|
typename set<node_t>::iterator end() { return root.end(); }
|
|
const typename set<node_t>::iterator begin() const { return root.begin(); }
|
|
const typename set<node_t>::iterator end() const { return root.end(); }
|
|
|
|
protected:
|
|
set<node_t> root;
|
|
};
|
|
|
|
template<typename T, typename U> struct bimap {
|
|
optional<U> find(const T& key) const { return tmap.find(key); }
|
|
optional<T> find(const U& key) const { return umap.find(key); }
|
|
void insert(const T& key, const U& value) { tmap.insert(key, value); umap.insert(value, key); }
|
|
void remove(const T& key) { if(auto p = tmap.find(key)) { umap.remove(p().value); tmap.remove(key); } }
|
|
void remove(const U& key) { if(auto p = umap.find(key)) { tmap.remove(p().value); umap.remove(key); } }
|
|
unsigned size() const { return tmap.size(); }
|
|
void reset() { tmap.reset(); umap.reset(); }
|
|
|
|
typename set<typename map<T, U>::node_t>::iterator begin() { return tmap.begin(); }
|
|
typename set<typename map<T, U>::node_t>::iterator end() { return tmap.end(); }
|
|
const typename set<typename map<T, U>::node_t>::iterator begin() const { return tmap.begin(); }
|
|
const typename set<typename map<T, U>::node_t>::iterator end() const { return tmap.end(); }
|
|
|
|
protected:
|
|
map<T, U> tmap;
|
|
map<U, T> umap;
|
|
};
|
|
|
|
}
|
|
|
|
#endif
|