clientdatamap.h

/***************************************************************************
 * The contents of this file are subject to the Mozilla Public             *
 * License Version 1.1 (the "License"); you may not use this file          *
 * except in compliance with the License. You may obtain a copy of         *
 * the License at http://www.mozilla.org/MPL/                              *
 *                                                                         *
 * Software distributed under the License is distributed on an "AS         *
 * IS" basis, WITHOUT WARRANTY OF ANY KIND, either express or              *
 * implied. See the License for the specific language governing            *
 * rights and limitations under the License.                               *
 *                                                                         *
 * The Original Code is Game Network Framework (GaNeF).                    *
 *                                                                         *
 * The Initial Developers of the Original Code are                         *
 * Lars Langer and Emanuel Greisen                                         *
 * Copyright (C) 2005. Lars Langer & Emanuel Greisen                       *
 * All Rights Reserved.                                                    *
 *                                                                         *
 * Contributor(s):                                                         *
 *   none yet....                                                          *
 *                                                                         *
 ***************************************************************************/
#ifndef CLIENTDATAMAP_H
#define CLIENTDATAMAP_H

#include <map>
#include <vector>

class ClientData;

typedef std::vector<ClientData **> PtrPtrVec;
typedef std::map<unsigned int,  PtrPtrVec> PPMap;

struct PointingMapStruct
{
   PPMap ppmap;
   std::map<ClientData **, unsigned int> ptr2pointee;
   bool isEmpty() const
   {
      return ppmap.size() == 0 && ptr2pointee.size() == 0;
   }
};
typedef std::map<const unsigned int,  PPMap > PointeeMap;
typedef std::map<const unsigned int,  PointingMapStruct > PointingMap;

/**
 * @ingroup Client
 * @brief This class is used for handling the data elements of the client.
 * It will make sure that elements pointing to objects which haven't been
 * initilized will be set to point at the correct element after it has been
 * initilized. It will also manage the deletion of objects and ensure that objects
 * pointing to deleted objects will recieve a null poiter
 *
 * @author Lars Langer and Emanuel Greisen
*/
class ClientDataMap
{
public:
   ///  &lt; id of object missing a pointer, vetor of objects it is missing a pointer to and the pointer &gt;
   PointingMap pointing_map;
   /// &lt; id of object being missed, a vetor of objects missing this pointer and the pointer to set &gt;
   PointeeMap pointee_map;


   // Lars - please see report!

public:
   ClientDataMap();
   ~ClientDataMap();

public:
   void unregisterData( ClientData * data);
   void registerPointer( unsigned int receiver, unsigned int missing, ClientData ** ptrptr );
   bool unregisterPointer(unsigned int receiver, unsigned int new_objid, ClientData **ptrptr);
   void printDebug();


};

#endif

---