mirror of
https://gitee.com/anod/open_agb_firm.git
synced 2025-05-05 21:34:11 +08:00
使用了更纯正的no iterator处理NO_ITER的定义
This commit is contained in:
parent
15694de28c
commit
3ad07f892f
@ -11,14 +11,16 @@ const loadlist = async () => {
|
||||
return Object.entries(datas).filter(n => n[1] != "????");
|
||||
}
|
||||
// ---------------修改的代码在这里------------------
|
||||
const entries = Object.entries(datas);
|
||||
const retval = new Array(entries.length);
|
||||
let l = 0;
|
||||
for( const data of entries ){
|
||||
if( data[1] !== "????" ) retval[l++] = data;
|
||||
else {
|
||||
const entries = Object.entries(datas);
|
||||
const retval = new Array(entries.length);
|
||||
let l = 0;
|
||||
for( let i=0; i < entries.length; ++i ){
|
||||
if( entries[i][1] !== "????" ) retval[l++] = entries[i];
|
||||
}
|
||||
retval.length = l;
|
||||
return retval;
|
||||
}
|
||||
retval.length = l;
|
||||
return retval;
|
||||
// ---------------修改的代码完结处------------------
|
||||
}
|
||||
|
||||
@ -182,9 +184,10 @@ const start = async () => {
|
||||
// ---------------修改的代码在这里------------------
|
||||
else
|
||||
{
|
||||
const res = new Array(10240), idx = {};
|
||||
const res = new Array(6400), idx = {};
|
||||
let l = 0;
|
||||
for( const data of roms ){
|
||||
for( let i=0; i < roms.length; ++i ){
|
||||
const data = roms[i];
|
||||
if( !data ) continue;
|
||||
|
||||
const { serial, cheat } = data;
|
||||
|
@ -239,7 +239,8 @@ const assembleCheat = (list, dup, hole) => {
|
||||
}
|
||||
// ---------------修改的代码在这里------------------
|
||||
else {
|
||||
for( const command of list ){
|
||||
for( let i=0; i < list.length; ++i ){
|
||||
const command = list[i];
|
||||
const addr = fromTaddr(command[0]);
|
||||
const len = command.length - 1;
|
||||
for( let pos=0; pos < len; ++pos) {
|
||||
@ -276,7 +277,8 @@ const assembleCheat = (list, dup, hole) => {
|
||||
else {
|
||||
const blocks = new Array();
|
||||
let curr = null;
|
||||
for( const [addr, value] of ordered ){
|
||||
for( let i=0; i < ordered.length; ++i ){
|
||||
const [addr, value] = ordered[i];
|
||||
dup.set(addr, hole);
|
||||
if( !curr ) {
|
||||
curr = { addr, value, count: 1 };
|
||||
|
Loading…
x
Reference in New Issue
Block a user