Planet
navi homePPSaboutscreenshotsdownloaddevelopmentforum

Ignore:
Timestamp:
Nov 7, 2015, 10:23:42 AM (9 years ago)
Author:
landauf
Message:

no space needed anymore between closing template brackets ('> >' → '>>')

Location:
code/branches/cpp11_v2/src/libraries/network
Files:
10 edited

Legend:

Unmodified
Added
Removed
  • code/branches/cpp11_v2/src/libraries/network/FunctionCallManager.cc

    r10624 r10769  
    3737
    3838std::map<uint32_t, packet::FunctionCalls*> FunctionCallManager::sPeerMap_;
    39 std::vector<std::pair<FunctionCall, std::pair<uint32_t, uint32_t> > > FunctionCallManager::sIncomingFunctionCallBuffer_;
     39std::vector<std::pair<FunctionCall, std::pair<uint32_t, uint32_t>>> FunctionCallManager::sIncomingFunctionCallBuffer_;
    4040
    4141
     
    7070void FunctionCallManager::processBufferedFunctionCalls()
    7171{
    72   std::vector<std::pair<FunctionCall, std::pair<uint32_t, uint32_t> > >::iterator it = FunctionCallManager::sIncomingFunctionCallBuffer_.begin();
     72  std::vector<std::pair<FunctionCall, std::pair<uint32_t, uint32_t>>>::iterator it = FunctionCallManager::sIncomingFunctionCallBuffer_.begin();
    7373  while( it!=FunctionCallManager::sIncomingFunctionCallBuffer_.end() )
    7474  {
  • code/branches/cpp11_v2/src/libraries/network/FunctionCallManager.h

    r10624 r10769  
    5454
    5555  static std::map<uint32_t, packet::FunctionCalls*>                           sPeerMap_;
    56   static std::vector<std::pair<FunctionCall,std::pair<uint32_t, uint32_t> > > sIncomingFunctionCallBuffer_;
     56  static std::vector<std::pair<FunctionCall,std::pair<uint32_t, uint32_t>>> sIncomingFunctionCallBuffer_;
    5757protected:
    5858  FunctionCallManager();
  • code/branches/cpp11_v2/src/libraries/network/GamestateManager.cc

    r10768 r10769  
    351351//   void GamestateManager::removeClient(ClientInformation* client){
    352352//     assert(client);
    353 //     std::map<unsigned int, std::map<unsigned int, packet::Gamestate*> >::iterator clientMap = gamestateMap_.find(client->getID());
     353//     std::map<unsigned int, std::map<unsigned int, packet::Gamestate*>>::iterator clientMap = gamestateMap_.find(client->getID());
    354354//     // first delete all remained gamestates
    355355//     std::map<unsigned int, packet::Gamestate*>::iterator it;
  • code/branches/cpp11_v2/src/libraries/network/GamestateManager.h

    r10622 r10769  
    108108    bool processGamestate(packet::Gamestate *gs);
    109109
    110 //     std::map<unsigned int, std::map<unsigned int, packet::Gamestate*> > gamestateMap_;
     110//     std::map<unsigned int, std::map<unsigned int, packet::Gamestate*>> gamestateMap_;
    111111    std::map<unsigned int, packet::Gamestate*> gamestateQueue;
    112112//     std::map<unsigned int, uint32_t> lastProcessedGamestateID_;
  • code/branches/cpp11_v2/src/libraries/network/TrafficControl.cc

    r10768 r10769  
    148148    // shortcut for maps
    149149    std::map<unsigned int, objInfo >& objectListPerm = clientListPerm_[clientID];
    150     std::map<unsigned int, std::list<obj> >& objectListTemp = clientListTemp_[clientID];
     150    std::map<unsigned int, std::list<obj>>& objectListTemp = clientListTemp_[clientID];
    151151
    152152    for(itvec = objectListTemp[gamestateID].begin(); itvec != objectListTemp[gamestateID].end(); itvec++)
     
    180180    void TrafficControl::insertinClientListPerm(unsigned int clientID, obj objinf)
    181181    {
    182       std::map<unsigned int,std::map<unsigned int, objInfo> >::iterator itperm;//iterator clientListPerm over clientIDs
     182      std::map<unsigned int,std::map<unsigned int, objInfo>>::iterator itperm;//iterator clientListPerm over clientIDs
    183183    unsigned int gsid=GAMESTATEID_INITIAL, gsdiff=currentGamestateID, prioperm=Synchronisable::getSynchronisable(objinf.objID)->getPriority(), priomom=0;
    184184    clientListPerm_[clientID][objinf.objID] = objInfo(objinf.objID, objinf.objCreatorID,gsid,gsdiff, objinf.objSize,prioperm,priomom);
  • code/branches/cpp11_v2/src/libraries/network/TrafficControl.h

    r6746 r10769  
    8282    *permanent client list: contains client ids, object ids and objectInfos (in this order)
    8383    */
    84     std::map<unsigned int, std::map<unsigned int, objInfo > > clientListPerm_;
     84    std::map<unsigned int, std::map<unsigned int, objInfo >> clientListPerm_;
    8585    //has to be created with constructor and then needs to be updated by evaluateList().
    8686
     
    8888    *temporary client list: contains client ids, gamestate ids and object ids (in this order)
    8989    */
    90     std::map<unsigned int, std::map<unsigned int, std::list<obj> > > clientListTemp_;
     90    std::map<unsigned int, std::map<unsigned int, std::list<obj>>> clientListTemp_;
    9191
    9292    /**updateReferenceList
  • code/branches/cpp11_v2/src/libraries/network/packet/ClassID.cc

    r10765 r10769  
    5252  uint32_t network_id;
    5353  flags_ = flags_ | PACKET_FLAGS_CLASSID;
    54   std::queue<std::pair<uint32_t, std::string> > tempQueue;
     54  std::queue<std::pair<uint32_t, std::string>> tempQueue;
    5555
    5656  //calculate total needed size (for all strings and integers)
  • code/branches/cpp11_v2/src/libraries/network/packet/FunctionIDs.cc

    r10624 r10769  
    5353  uint32_t networkID;
    5454  flags_ = flags_ | PACKET_FLAGS_FUNCTIONIDS;
    55   std::queue<std::pair<uint32_t, std::string> > tempQueue;
     55  std::queue<std::pair<uint32_t, std::string>> tempQueue;
    5656
    5757  //calculate total needed size (for all strings and integers)
  • code/branches/cpp11_v2/src/libraries/network/synchronisable/Serialise.h

    r10624 r10769  
    9090    {
    9191//         *const_cast<typename Loki::TypeTraits<T*>::UnqualifiedType*>(&variable) = dynamic_cast<T*>(variable->getSynchronisable( *(uint32_t*)(mem) ));
    92         *const_cast<typename Loki::TypeTraits<StrongPtr<T> >::UnqualifiedType*>(&variable) = orxonox_cast<T*>(T::getSynchronisable(*(uint32_t*)(mem)));
     92        *const_cast<typename Loki::TypeTraits<StrongPtr<T>>::UnqualifiedType*>(&variable) = orxonox_cast<T*>(T::getSynchronisable(*(uint32_t*)(mem)));
    9393        mem += returnSize( variable );
    9494    }
     
    125125    {
    126126        //         *const_cast<typename Loki::TypeTraits<T*>::UnqualifiedType*>(&variable) = dynamic_cast<T*>(variable->getSynchronisable( *(uint32_t*)(mem) ));
    127         *const_cast<typename Loki::TypeTraits<WeakPtr<T> >::UnqualifiedType*>(&variable) = orxonox_cast<T*>(T::getSynchronisable(*(uint32_t*)(mem)));
     127        *const_cast<typename Loki::TypeTraits<WeakPtr<T>>::UnqualifiedType*>(&variable) = orxonox_cast<T*>(T::getSynchronisable(*(uint32_t*)(mem)));
    128128        mem += returnSize( variable );
    129129    }
  • code/branches/cpp11_v2/src/libraries/network/synchronisable/Synchronisable.h

    r10768 r10769  
    242242    SynchronisableVariableBase* sv;
    243243    if (bidirectional)
    244       sv = new SynchronisableVariableBidirectional<std::set<T> >(variable, mode, cb);
     244      sv = new SynchronisableVariableBidirectional<std::set<T>>(variable, mode, cb);
    245245    else
    246       sv = new SynchronisableVariable<std::set<T> >(variable, mode, cb);
     246      sv = new SynchronisableVariable<std::set<T>>(variable, mode, cb);
    247247    syncList_.push_back(sv);
    248248    stringList_.push_back(sv);
     
    250250
    251251  template <> _NetworkExport void Synchronisable::registerVariable( std::string& variable, uint8_t mode, NetworkCallbackBase *cb, bool bidirectional);
    252 //   template <class T> _NetworkExport void Synchronisable::registerVariable<std::set<T> >( std::set<T>& variable, uint8_t mode, NetworkCallbackBase *cb, bool bidirectional);
     252//   template <class T> _NetworkExport void Synchronisable::registerVariable<std::set<T>>( std::set<T>& variable, uint8_t mode, NetworkCallbackBase *cb, bool bidirectional);
    253253  template <> _NetworkExport void Synchronisable::unregisterVariable( std::string& variable );
    254254
Note: See TracChangeset for help on using the changeset viewer.