Planet
navi homePPSaboutscreenshotsdownloaddevelopmentforum

source: code/branches/steering/src/libraries/network/PeerList.cc @ 8501

Last change on this file since 8501 was 7801, checked in by dafrick, 14 years ago

Merging presentation2 branch back to trunk.

File size: 2.4 KB
Line 
1/*
2 *   ORXONOX - the hottest 3D action shooter ever to exist
3 *                    > www.orxonox.net <
4 *
5 *
6 *   License notice:
7 *
8 *   This program is free software; you can redistribute it and/or
9 *   modify it under the terms of the GNU General Public License
10 *   as published by the Free Software Foundation; either version 2
11 *   of the License, or (at your option) any later version.
12 *
13 *   This program is distributed in the hope that it will be useful,
14 *   but WITHOUT ANY WARRANTY; without even the implied warranty of
15 *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
16 *   GNU General Public License for more details.
17 *
18 *   You should have received a copy of the GNU General Public License
19 *   along with this program; if not, write to the Free Software
20 *   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA.
21 *
22 *   Author:
23 *      Sandro 'smerkli' Merkli
24 *   Co-authors:
25 *      ...
26 *
27 */
28
29#include "PeerList.h"
30#include <network/packet/ServerInformation.h>
31#include <cstdio>
32
33namespace orxonox
34{
35  PeerList::PeerList() { }
36  PeerList::~PeerList() { }
37
38  int 
39  PeerList::addPeer( ENetPeer *toadd )
40  { /* error correction */
41    if( toadd == NULL ) 
42    { fprintf( stderr, "PeerList::addPeer: empty peer given.\n" );
43      return -1;
44    }
45
46    /* if all went well, push to back of list */
47    this->peerlist.push_back( toadd );
48    return 0;
49  }
50
51  bool sub_compAddr( ENetAddress addr1, ENetAddress addr2 )
52  { 
53    for( int i = 0; i < 16; ++i )
54      if( addr1.host.addr[i] < addr2.host.addr[i] )
55        return -i;
56      else if( addr1.host.addr[i] > addr2.host.addr[i] )
57        return i;
58
59    return 0;
60  }
61   
62
63  bool
64  PeerList::remPeerByAddr( ENetAddress addr )
65  { /* get an iterator */
66    std::list<ENetPeer *>::iterator i;
67
68    /* loop through list elements */
69    for( i = peerlist.begin(); i != peerlist.end(); ++i ) 
70      if( !sub_compAddr((*i)->address, addr ) )
71      { /* found this name, remove and quit */
72        this->peerlist.remove( *i );
73        return true;
74      }
75
76    /* not found */
77    return false;
78  }
79
80  ENetPeer *
81  PeerList::findPeerByAddr( ENetAddress addr )
82  { /* get an iterator */
83    std::list<ENetPeer *>::iterator i;
84
85    /* loop through list elements */
86    for( i = peerlist.begin(); i != peerlist.end(); ++i ) 
87      if( !sub_compAddr((*i)->address, addr ) )
88        /* found this name, remove and quit */
89        return *i;
90
91    /* not found */
92    return NULL;
93  }
94
95}
96
Note: See TracBrowser for help on using the repository browser.