mirror of
https://github.com/luanti-org/luanti.git
synced 2025-06-27 16:36:03 +00:00
Change i++ to ++i
This commit is contained in:
parent
2480f2d06f
commit
34b7a147dc
41 changed files with 125 additions and 125 deletions
|
@ -294,7 +294,7 @@ BufferedPacket ReliablePacketBuffer::popSeqnum(u16 seqnum)
|
|||
|
||||
|
||||
RPBSearchResult next = r;
|
||||
next++;
|
||||
++next;
|
||||
if (next != notFound()) {
|
||||
u16 s = readU16(&(next->data[BASE_HEADER_SIZE+1]));
|
||||
m_oldest_non_answered_ack = s;
|
||||
|
@ -358,7 +358,7 @@ void ReliablePacketBuffer::insert(BufferedPacket &p,u16 next_expected)
|
|||
/* this is true e.g. on wrap around */
|
||||
if (seqnum < next_expected) {
|
||||
while(((s < seqnum) || (s >= next_expected)) && (i != m_list.end())) {
|
||||
i++;
|
||||
++i;
|
||||
if (i != m_list.end())
|
||||
s = readU16(&(i->data[BASE_HEADER_SIZE+1]));
|
||||
}
|
||||
|
@ -367,7 +367,7 @@ void ReliablePacketBuffer::insert(BufferedPacket &p,u16 next_expected)
|
|||
else
|
||||
{
|
||||
while(((s < seqnum) && (s >= next_expected)) && (i != m_list.end())) {
|
||||
i++;
|
||||
++i;
|
||||
if (i != m_list.end())
|
||||
s = readU16(&(i->data[BASE_HEADER_SIZE+1]));
|
||||
}
|
||||
|
@ -1760,7 +1760,7 @@ void ConnectionSendThread::disconnect()
|
|||
|
||||
for (std::list<u16>::iterator i = peerids.begin();
|
||||
i != peerids.end();
|
||||
i++)
|
||||
++i)
|
||||
{
|
||||
sendAsPacket(*i, 0,data,false);
|
||||
}
|
||||
|
@ -1840,7 +1840,7 @@ void ConnectionSendThread::sendToAll(u8 channelnum, SharedBuffer<u8> data)
|
|||
|
||||
for (std::list<u16>::iterator i = peerids.begin();
|
||||
i != peerids.end();
|
||||
i++)
|
||||
++i)
|
||||
{
|
||||
send(*i, channelnum, data);
|
||||
}
|
||||
|
@ -1852,7 +1852,7 @@ void ConnectionSendThread::sendToAllReliable(ConnectionCommand &c)
|
|||
|
||||
for (std::list<u16>::iterator i = peerids.begin();
|
||||
i != peerids.end();
|
||||
i++)
|
||||
++i)
|
||||
{
|
||||
PeerHelper peer = m_connection->getPeerNoEx(*i);
|
||||
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue