mirror of
https://github.com/bsnes-emu/bsnes.git
synced 2025-04-02 10:42:14 -04:00
47dffcae85
byuu says: Most notably, this release adds Nintendo DS emulation. The Nintendo DS module was written entirely by Cydrak, so please give him all of the credit for it. I for one am extremely grateful to be allowed to use his module in bsnes. The Nintendo DS emulator's standalone name is dasShiny. You will need the Nintendo DS firmware, which I cannot provide, in order to use it. It also cannot (currently?) detect the save type used by NDS games. As such, manifest.xml files must be created manually for this purpose. The long-term plan is to create a database of save types for each game. Also, you will need an analog input device for the touch screen for now (joypad axes work well.) There have also been a lot of changes from my end: a unified manifest.xml format across all systems, major improvements to SPC7110 emulation, enhancements to RTC emulation, MSU1 enhancements, icons in the file browser list, improvements to SNES coprocessor memory mapping, cleanups and improvements in the libraries used to build bsnes, etc. I've also included kaijuu (which allows launching game folders directly with bsnes) and purify (which allows opening images that are compressed, have copier headers, and have wrong extensions); both of which are fully GUI-based. This release only loads game folders, not files. Use purify to load ROM files in bsnes. Note that this will likely be the last release for a long time, and that I will probably rename the emulator for the next release, due to how many additional systems it now supports.
117 lines
2.7 KiB
C++
117 lines
2.7 KiB
C++
#ifndef NALL_MAP_HPP
|
|
#define NALL_MAP_HPP
|
|
|
|
#include <nall/vector.hpp>
|
|
|
|
namespace nall {
|
|
|
|
template<typename LHS, typename RHS>
|
|
struct map {
|
|
struct pair {
|
|
LHS name;
|
|
RHS data;
|
|
};
|
|
|
|
inline void reset() {
|
|
list.reset();
|
|
}
|
|
|
|
inline unsigned size() const {
|
|
return list.size();
|
|
}
|
|
|
|
//O(log n) find
|
|
inline optional<unsigned> find(const LHS &name) const {
|
|
signed first = 0, last = size() - 1;
|
|
while(first <= last) {
|
|
signed middle = (first + last) / 2;
|
|
if(name < list[middle].name) last = middle - 1; //search lower half
|
|
else if(list[middle].name < name) first = middle + 1; //search upper half
|
|
else return { true, (unsigned)middle }; //match found
|
|
}
|
|
return { false, 0u };
|
|
}
|
|
|
|
//O(n) insert + O(log n) find
|
|
inline RHS& insert(const LHS &name, const RHS &data) {
|
|
if(auto position = find(name)) {
|
|
list[position()].data = data;
|
|
return list[position()].data;
|
|
}
|
|
signed offset = size();
|
|
for(unsigned n = 0; n < size(); n++) {
|
|
if(name < list[n].name) { offset = n; break; }
|
|
}
|
|
list.insert(offset, { name, data });
|
|
return list[offset].data;
|
|
}
|
|
|
|
//O(log n) find
|
|
inline void modify(const LHS &name, const RHS &data) {
|
|
if(auto position = find(name)) list[position()].data = data;
|
|
}
|
|
|
|
//O(n) remove + O(log n) find
|
|
inline void remove(const LHS &name) {
|
|
if(auto position = find(name)) list.remove(position());
|
|
}
|
|
|
|
//O(log n) find
|
|
inline RHS& operator[](const LHS &name) {
|
|
if(auto position = find(name)) return list[position()].data;
|
|
throw;
|
|
}
|
|
|
|
inline const RHS& operator[](const LHS &name) const {
|
|
if(auto position = find(name)) return list[position()].data;
|
|
throw;
|
|
}
|
|
|
|
inline RHS& operator()(const LHS &name) {
|
|
if(auto position = find(name)) return list[position()].data;
|
|
return insert(name, RHS());
|
|
}
|
|
|
|
inline const RHS& operator()(const LHS &name, const RHS &data) const {
|
|
if(auto position = find(name)) return list[position()].data;
|
|
return data;
|
|
}
|
|
|
|
inline pair* begin() { return list.begin(); }
|
|
inline pair* end() { return list.end(); }
|
|
inline const pair* begin() const { return list.begin(); }
|
|
inline const pair* end() const { return list.end(); }
|
|
|
|
protected:
|
|
vector<pair> list;
|
|
};
|
|
|
|
template<typename LHS, typename RHS>
|
|
struct bidirectional_map {
|
|
const map<LHS, RHS> &lhs;
|
|
const map<RHS, LHS> &rhs;
|
|
|
|
inline void reset() {
|
|
llist.reset();
|
|
rlist.reset();
|
|
}
|
|
|
|
inline unsigned size() const {
|
|
return llist.size();
|
|
}
|
|
|
|
inline void insert(const LHS &ldata, const RHS &rdata) {
|
|
llist.insert(ldata, rdata);
|
|
rlist.insert(rdata, ldata);
|
|
}
|
|
|
|
inline bidirectional_map() : lhs(llist), rhs(rlist) {}
|
|
|
|
protected:
|
|
map<LHS, RHS> llist;
|
|
map<RHS, LHS> rlist;
|
|
};
|
|
|
|
}
|
|
|
|
#endif
|