mirror of
https://github.com/bsnes-emu/bsnes.git
synced 2025-04-02 10:42:14 -04:00
84e98833ca
byuu says:
This release refines HSU1 support as a bidirectional protocol, nests SFC
manifests as "release/cartridge" and "release/information" (but release/
is not guaranteed to be finalized just yet), removes the database
integration, and adds support for ananke.
ananke represents inevitability. It's a library that, when installed,
higan can use to load files from the command-line, and also from a new
File -> Load Game menu option.
I need to change the build rules a bit for it to work on Windows (need
to make phoenix a DLL, basically), but it works now on Linux.
Right now, it only takes *.sfc file names, looks them up in the included
database, converts them to game folders, and returns the game folder
path for higan to load.
The idea is to continue expanding it to support everything we can that
I don't want in the higan core:
- load *.sfc, *.smc, *.swc, *.fig files
- remove SNES copier headers
- split apart merged firmware files
- pull in external firmware files (eg dsp1b.rom - these are staying
merged, just as SPC7110 prg+dat are merged)
- load *.zip and *.7z archives
- prompt for selection on multi-file archives
- generate manifest files based on heuristics
- apply BPS patches
The "Load" menu option has been renamed to "Library", to represent games
in your library. I'm going to add some sort of suffix to indicate
unverified games, and use a different folder icon for those (eg
manifests built on heuristics rather than from the database.)
So basically, to future end users:
File -> Load Game will be how they play games.
Library -> (specific system) can be thought of as an infinitely-sized
recent games list.
purify will likely become a simple stub that invokes ananke's functions.
No reason to duplicate all that code.
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
|