SEO		[PR] 爆速!無料ブログ 無料ホームページ開設 無料ライブ放送

               

---

dKingyoDataWrapper.h

解説を見る。

 
#ifndef dKingyoDataWrapper_H_
#define dKingyoDataWrapper_H_


#include "dKingyoMemoryManager.h"
#include "dKingyoArrayManager.h"


namespace dkutil{//begin dkutil
namespace memory{//begin memory

/*
http://wwwinfo.cern.ch/asd/lhc++/ObjectSpace/doc/2.1/stdusr/1stclass.8.html
から拾ってきたもの。説明が非常にためになりました。ありがとうございます。
#include <iostream>
#include <functional>
#include <ospace/stl/hashmap.h>

typedef hash_map< char, int, hash<char>, equal_to<char> > map_type;

void
main()
  {
  map_type m;

  // Store mappings between roman numerals and decimals.
  m[ 'l' ] = 50;
  m[ 'x' ] = 20; // Deliberate mistake.
  m[ 'v' ] = 5;
  m[ 'i' ] = 1;
  cout << "m[ 'x' ] = " << m[ 'x' ] << "\n";

  m[ 'x' ] = 10; // Correct mistake.
  cout << "m[ 'x' ] = " << m[ 'x' ] << "\n";

  // Note default value ( 0 ) is added.
  cout << "m[ 'z' ] = " << m[ 'z' ] << "\n";
  cout << "m.count( 'z' ) = " << m.count( 'z' ) << "\n";

  pair< map_type::iterator, bool > p;
  p = m.insert( pair< char, int >( char, int )( 'c', 100 ) );
  if ( p.second )
    cout << "First insertion successful\n";

  p = m.insert( pair< char, int >( char, int )( 'c', 100 ) );
  if ( p.second )
    cout << "Second insertion successful\n";
  else
    cout
      << "Existing pair "
      << ( *( p.first ) ).first
      << " -> "
      << ( *( p.first ) ).second
      << "\n";
  }
*/



template<class K,class V>//V = value K = key
class dKingyoDataWrapperSTLPortHashMap : public IdKingyoDataWrapper<V,K>{
protected:
    typedef DKUTIL_HASHMAP<K,V> hashmap;
    hashmap m;//map
    typedef hashmap::iterator hash_map_it;
    typedef std::pair<hash_map_it,bool> hash_map_result;
    typedef std::pair<K,V> hash_map_data;
public:
    dKingyoDataWrapperSTLPortHashMap(){}
    virtual ~dKingyoDataWrapperSTLPortHashMap(){}

    virtual V GetData(K key){
        hash_map_it it = m.find(key);
        if(it==m.end()){
            throw -1;//だめだめよ！
        }
        return (*it).second;
    }

    virtual bool SetData(K key,V value){
        hash_map_result result;
        hash_map_data data(key,value);
        result=m.insert(data);
        //if(result.second==true){
        //  (*result.first).first=key;
        //}//ぐわあああああああhash_mapが分からない！！！
        return result.second;
    }

    virtual bool DeleteDataByKey(K key){
        m.erase(key);//何が帰るか良く分からない(泣　だれかおしえて〜な
        return true;
    }

    virtual bool DeleteDataByValue(V value){
        hash_map_it it=m.begin();
        while(it!=m.end()){
            if(value==(*it).second){
                m.erase(it);//これでいいんかいな！？だれかhash_mapの関数リファレンスおしえてーな
                return true;
            }
            it++;
        }
        return false;
    }

};


template<class K,class V>//V = value K = key
class dKingyoDataWrapperMap : public IdKingyoDataWrapper<V,K>{
protected:
    std::map<K,V> m;//map
    typedef std::map<K,V>::iterator map_it;
    typedef std::pair<map_it,bool> map_result;
    typedef std::pair<K,V> map_data;
public:
    dKingyoDataWrapperMap(){}
    virtual ~dKingyoDataWrapperMap(){}

    virtual V GetData(K key){
        map_it it = m.find(key);
        if(it==m.end())
            throw -1;//だめだめよ！
        return m[(*it).first];
        //for ( iter = mapSS.begin( ); iter != mapSS.end( ); iter++ ) {
            //cout << iter->first << " : " << mapSS[iter->first] << endl;
        //}
    }

    virtual bool SetData(K key,V value){
        map_result result;
        map_data data(key,value);
        result=m.insert(data);
        return result.second;
    }

    virtual bool DeleteDataByKey(K key){
        m.erase(key);//何が帰るか良く分からない(泣　だれかおしえて〜な
        return true;
    }

    virtual bool DeleteDataByValue(V value){
        map_it it=m.begin();
        while(it!=m.end()){
            if(value==m[(*it).first]){
                m.erase(it);//これでいいんかいな！？だれかhash_mapの関数リファレンスおしえてーな
                return true;
            }
            it++;
        }
        return false;
    }
};      

template<class K,class V>//V = value K = key 
class dKingyoDataWrapperOverwriteAcceptMap : public dKingyoDataWrapperMap<K,V>{
public:
    virtual bool SetData(K key,V value){
        map_result result;
        map_data data(key,value);
        result=m.insert(data);
        if(result.second==false){
            m[key]=value;
            throw DKINGYO_DATA_WRAPPER_OVERWRITE;//投げます＾＾；
        }
        return true;//常にTRUEしかないでしょう＾＾；
    }
};



template<class V>
class dKingyoDataWrapperArrayWarehouse : public IdKingyoDataWrapper<V,DWORD *>{
protected:
    dkutil::memory::dKingyoArrayOneByOneDynamic<V> m;
public:
    dKingyoDataWrapperArrayWarehouse(){}
    virtual ~dKingyoDataWrapperArrayWarehouse(){}
    virtual V GetData(DWORD *setkey){
//#ifdef _DEBUG
        if(m.DataMax()<=(*setkey))//what are you doing abou!!! マックスよりキーがでかいとエラー
            return NULL;
//#endif
        return m.Data()[(*setkey)];
    }
    virtual bool SetData(DWORD *getkey,V value){
        V *temp=m.GetArray(getkey);
        if(temp==NULL)
            return false;
        *temp=value;//ぶち込む
        
        return true;
    }
    virtual bool DeleteDataByKey(DWORD *setkey){
        m.ReleaseArray(setkey);
        return true;//常にTRUEってのはなぁ＾＾；
    }
    virtual bool DeleteDataByValue(V value){
        DWORD max=m.DataMax();
        V *a=m.Data();
        bool r=false;
        for(DWORD i=0;i<max;i++){//線型？線形探索かよ〜〜　めんど〜〜 O(N)ってなんなのよ〜〜遅すぎ！
            if(a[i]==value){//同じ奴を見つけた！！
                m.ReleaseArray(&i);//すごく邪道な開放の仕方^^;
                r=true;
                break;
            }
        }
        return r;
    }
};

        

/*
class dKingyoDataWrapperBoostPropertyMap{
protected:
    boost::
}
*/



#ifdef USE_DKINGYO_OBJECT_TEST

extern void dKingyoDataWrapperMapTest();
extern void dKingyoDataWrapperHashMapExpectionTest();

#endif //end of USE_DKINGYO_OBJECT_TEST



}//end of memory
}//end of dkutil

#endif // end of once include

---