Всем привет. Мой друг написал для меня код Java, и я легко могу преобразовать его в C ++, но мне очень любопытно узнать об эквиваленте итератора Java на C ++. Вот код, и я, скорее всего, хотел бы, чтобы данные возвращались в вектор. Приветствуется любая помощь
public class RLEIterator
extends RegionIterator
{
public int reg = 0;
public int mode = 0;
public int skip = 0;
// mode is the number of IDs that are valid still (count down)
// skip is used after we run out of mode IDs, and move forward
// The goal is, to always have a valid 'hasNext' state, after
// an ID is read via 'next'. Thus, the initial search, and then
// the reading forward if mode == 0, after the ID is found.
public int i;
public RLEIterator()
{
// Need to set up the skip of an initial part, so we can
// correctly handle there not being anything, despite there
// being data encoded.
int comp;
i = 0;
while ((mode == 0) && (i<nearRLE.length))
{
// set up the next code
comp = ((int)nearRLE[i]) & 0xff;
if ((comp > 0) && (comp <= 0x3e))
{
// skip forward by comp;
reg += comp;
i++;
mode = 0; // have to keep on reading
}
else if (comp == 0x3f)
{
// skip forward by the following 16 bit word;
// second byte is hi-byte of the word
reg += ((int)nearRLE[i+1]) & 0xff;
reg += (((int)nearRLE[i+2]) & 0xff) << 8;
i+=3;
}
else if (comp == 0xff)
{
// include the following WORD of regions
mode = ((int)nearRLE[i+1]) & 0xff;
mode += (((int)nearRLE[i+2]) & 0xff) << 8;
i += 3;
}
else if ((comp >= 0xc0) && (comp <= 0xfe))
{
// comp - 0xc0 regions are nearby
mode = comp - 0xc0; // +1 perhaps?
i++;
}
else if ((comp >= 0x40) && (comp <= 0x7f))
{
// skip bits 3-5 IDs and then include bits 0-2
reg += (comp & 0x38) >> 3;
mode = (comp & 0x7);
i++;
}
else if ((comp >= 0x80) && (comp <= 0xbf))
{
// include IDs bits 3-5, then skip bits 0-2
mode = (comp & 0x38) >> 3;
skip = (comp & 0x7);
i++;
}
}
}
public boolean hasNext()
{
// not at the end of the RLE, and not currently processing a
// directive. (mode)
return (mode > 0);
}
public int next()
{
int ret = -1;
int comp;
// sanity check first. Shouldn't truthfully get called if mode
// isn't >0
if (mode <= 0)
return -1;
ret = reg;
reg++;
mode--;
if (mode == 0)
{
// skip forward
reg += skip;
skip = 0;
while ((mode == 0) && (i<nearRLE.length))
{
// set up the next code
comp = ((int)nearRLE[i]) & 0xff;
if ((comp > 0) && (comp <= 0x3e))
{
// skip forward by comp;
reg += comp;
i++;
mode = 0; // have to keep on reading
}
else if (comp == 0x3f)
{
// skip forward by the following 16 bit word;
// second byte is hi-byte of the word
reg += ((int)nearRLE[i+1]) & 0xff;
reg += (((int)nearRLE[i+2]) & 0xff) << 8;
i+=3;
}
else if (comp == 0xff)
{
// include the following WORD of regions
mode = ((int)nearRLE[i+1]) & 0xff;
mode += (((int)nearRLE[i+2]) & 0xff) << 8;
i += 3;
}
else if ((comp >= 0xc0) && (comp <= 0xfe))
{
// comp - 0xc0 regions are nearby
mode = comp - 0xc0; // +1 perhaps?
i++;
}
else if ((comp >= 0x40) && (comp <= 0x7f))
{
// skip bits 3-5 IDs and then include bits 0-2
reg += (comp & 0x38) >> 3;
mode = (comp & 0x7);
i++;
}
else if ((comp >= 0x80) && (comp <= 0xbf))
{
// include IDs bits 3-5, then skip bits 0-2
mode = (comp & 0x38) >> 3;
skip = (comp & 0x7);
i++;
}
}
}
return ret;
}
}
. Опять же, любая помощь в том, как это вписывается в схему единственной функции (если возможно) в C ++, была бы фантастической. Спасибо!