mirror/bsnes
1
0
Fork 0
mirror of https://github.com/bsnes-emu/bsnes.git synced 2025-08-29 22:39:48 +02:00
Code Issues Projects Releases Wiki Activity

Update to v094r44 release.

Browse Source 
byuu says:

Changelog:
- return open bus instead of mirroring addresses on the bus (fixes
  Mario&Luigi, Minish Cap, etc) [Jonas Quinn]
- add boolean flag to load requests for slotted game carts (fixes slot
  load prompts)
- rename BS-X Town cart from psram to ram
- icarus: add support for game database

Note: I didn't rename "bsx" to "mcc" in the database for icarus before
uploading that. But I just fixed it locally, so it'll be in the next
WIP. For now, make it create the manifest for you and then rename it
yourself. I did fix the PSRAM size to 256kbit.
This commit is contained in:
Tim Allen
2015-09-28 21:56:46 +10:00
parent 0c87bdabed
commit 483fc81356
57 changed files with 14259 additions and 719 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
nall/string/markup/find.hpp
View File

@@ -99,10 +99,10 @@ auto ManagedNode::_find(const string& query) const -> vector<Node> {
auto ManagedNode::_lookup(const string& path) const -> Node {
if(auto position = path.find("/")) {
auto name = path.slice(0, *position);
auto name = slice(path, 0, *position);
for(auto& node : _children) {
if(name == node->_name) {
return node->_lookup(path.slice(*position + 1));
return node->_lookup(slice(path, *position + 1));
}
}
} else for(auto& node : _children) {
@@ -113,14 +113,14 @@ auto ManagedNode::_lookup(const string& path) const -> Node {
auto ManagedNode::_create(const string& path) -> Node {
if(auto position = path.find("/")) {
auto name = path.slice(0, *position);
auto name = slice(path, 0, *position);
for(auto& node : _children) {
if(name == node->_name) {
return node->_create(path.slice(*position + 1));
return node->_create(slice(path, *position + 1));
}
}
_children.append(new ManagedNode(name));
return _children.last()->_create(path.slice(*position + 1));
return _children.last()->_create(slice(path, *position + 1));
}
for(auto& node : _children) {
if(path == node->_name) return node;