gen_map_prof_inl.h

著名的 helix realplayer 基于手机 symbian 系统的 播放器全套源代码

/* ***** BEGIN LICENSE BLOCK ***** 
 * Version: RCSL 1.0/RPSL 1.0 
 *  
 * Portions Copyright (c) 1995-2002 RealNetworks, Inc. All Rights Reserved. 
 *      
 * The contents of this file, and the files included with this file, are 
 * subject to the current version of the RealNetworks Public Source License 
 * Version 1.0 (the "RPSL") available at 
 * http://www.helixcommunity.org/content/rpsl unless you have licensed 
 * the file under the RealNetworks Community Source License Version 1.0 
 * (the "RCSL") available at http://www.helixcommunity.org/content/rcsl, 
 * in which case the RCSL will apply. You may also obtain the license terms 
 * directly from RealNetworks.  You may not use this file except in 
 * compliance with the RPSL or, if you have a valid RCSL with RealNetworks 
 * applicable to this file, the RCSL.  Please see the applicable RPSL or 
 * RCSL for the rights, obligations and limitations governing use of the 
 * contents of the file.  
 *  
 * This file is part of the Helix DNA Technology. RealNetworks is the 
 * developer of the Original Code and owns the copyrights in the portions 
 * it created. 
 *  
 * This file, and the files included with this file, is distributed and made 
 * available on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER 
 * EXPRESS OR IMPLIED, AND REALNETWORKS HEREBY DISCLAIMS ALL SUCH WARRANTIES, 
 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, FITNESS 
 * FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT. 
 * 
 * Technology Compatibility Kit Test Suite(s) Location: 
 *    http://www.helixcommunity.org/content/tck 
 * 
 * Contributor(s): 
 *  
 * ***** END LICENSE BLOCK ***** */ 

#ifndef GEN_MAP_PROF_I
#define GEN_MAP_PROF_I

#include "class_ops.h"

template <class T, class K, class V>
inline
GenMapProf<T, K, V>::GenMapProf()
{}

template <class T, class K, class V>
inline
GenMapProf<T, K, V>::~GenMapProf()
{}

// Store manipulation
template <class T, class K, class V>
inline
bool GenMapProf<T, K, V>::CreateElement(int index)
{
    m_store.Create(index);

    return true;
}

template <class T, class K, class V>
inline
bool GenMapProf<T, K, V>::CreateElements(int index, int num)
{
    while (num > 0)
    {
        m_store.Create(index);
        ++index; --num;
    }

    return true;
}

template <class T, class K, class V>
inline
bool GenMapProf<T, K, V>::ClearElements()
{
    m_store.Clear();

    return true;
}

template <class T, class K, class V>
inline
void GenMapProf<T, K, V>::PrintElements()
{
    m_store.Print();
}

// Map manipulation
template <class T, class K, class V>
inline
bool GenMapProf<T, K, V>::GetCount(int expected) const
{
    bool ret = (m_map.GetCount() == expected); 
    
    if (!ret)
    {
	DPRINTF (D_ERROR,("GenMapProf<T, K, V>::GetCount() : got %d expected %d\n",
			  m_map.GetCount(), 
			  expected));
    }

    return ret;
}

template <class T, class K, class V>
inline
bool GenMapProf<T, K, V>::IsEmpty(bool expected) const
{
    bool ret = (m_map.IsEmpty() == expected);

    if (!ret)
    {
	DPRINTF (D_ERROR,("GenMapProf<T, K, V>::IsEmpty() : got %d expected %d\n",
			  m_map.IsEmpty(), 
			  expected));
    }
    return ret;
}

template <class T, class K, class V>
inline
bool GenMapProf<T, K, V>::Lookup(int index, bool expected)
{
    bool ret = false;

    V value;
    BOOL result = m_map.Lookup(m_store.GetKey(index), value);

    if (result != expected)
    {
	DPRINTF (D_ERROR,("GenMapProf<T, K, V>::Lookup() : got %d expected %d\n",
			  result,
			  expected));
    }
    else if (expected && (value != m_store.GetValue(index)))
    {
	char* pValueStr = ClassOps<V>().Print(value);
	char* pExpectStr = ClassOps<V>().Print(m_store.GetValue(index));

	DPRINTF (D_ERROR,("GenMapProf<T, K, V>::Lookup() : got '%s' expected '%s'\n",
			  pValueStr,
			  pExpectStr));

	delete [] pValueStr;
	delete [] pExpectStr;
    }
    else
	ret = true;

    return ret;
}

template <class T, class K, class V>
inline
bool GenMapProf<T, K, V>::SetAt(int index)
{
    bool ret = false;
    
    if (!m_store.IsSet(index))
    {
	DPRINTF(D_ERROR, ("GenMapProf<T, K, V>::SetAt() : value %d is not in store\n", 
			  index));
    }
    else
    {
	m_map.SetAt(m_store.GetKey(index), m_store.GetValue(index));
	ret = true;
    }

    return ret;
}

template <class T, class K, class V>
inline
bool GenMapProf<T, K, V>::RemoveKey(int index, bool expected)
{
    bool ret = false;

    if (!m_store.IsSet(index))
    {
	DPRINTF(D_ERROR, ("GenMapProf<T, K, V>::RemoveKey() : value %d is not in store\n", 
			  index));
    }
    else
    {

	bool result = m_map.RemoveKey(m_store.GetKey(index));

	if (result != expected)
	{
	    DPRINTF (D_ERROR, ("GenMapProf<T, K, V>::RemoveKey() : got %d expected %d\n",
			       result,
			       expected));
	}
	else
	    ret = true;
    }

    return ret;
}

template <class T, class K, class V>
inline
bool GenMapProf<T, K, V>::RemoveAll()
{
    m_map.RemoveAll();
    return true;
}

template <class T, class K, class V>
inline
bool GenMapProf<T, K, V>::RhsArrayOp(int index, bool expected)
{
    bool ret = false;

    if (!m_store.IsSet(index))
    {
	DPRINTF(D_ERROR, ("GenMapProf<T, K, V>::RhsArrayOp() : value %d is not in store\n", 
			  index));
    }
    else 
    {
	V result = m_map[m_store.GetKey(index)];
	V expectedVal = m_store.GetValue(index);

	if (!expected)
	{
	    // If we are not expecting the value to be in the
	    // map, then the value returned should be all zeros
	    expectedVal = ClassOps<V>().Null();
	}

	if (result != expectedVal)
	{
	    char* pValueStr = ClassOps<V>().Print(result);
	    char* pExpectStr = ClassOps<V>().Print(expectedVal);
	
	    DPRINTF (D_ERROR,("GenMapProf<T, K, V>::RhsArrayOp() : got '%s' expected '%s'\n",
			      pValueStr,
			      pExpectStr));
	    
	    delete [] pValueStr;
	    delete [] pExpectStr;
	}
	else
	    ret = true;
    }

    return ret;
}

template <class T, class K, class V>
inline
bool GenMapProf<T, K, V>::LhsArrayOp(int index)
{
    bool ret = false;

    if (!m_store.IsSet(index))
    {
	DPRINTF(D_ERROR, ("GenMapProf<T, K, V>::LhsArrayOp() : value %d is not in store\n", 
			  index));
    }
    else 
    {
	m_map[m_store.GetKey(index)] = m_store.GetValue(index);
	ret = true;
    }

    return ret;
}

template <class T, class K, class V>
inline
bool GenMapProf<T, K, V>::IsNull(int index, bool expected)
{
    bool ret = false;

    if (!m_store.IsSet(index))
    {
	DPRINTF(D_ERROR, ("GenMapProf<T, K, V>::IsNull() : value %d is not in store\n", 
			  index));
    }
    else 
    {
	V result;
	V expectedVal = ClassOps<V>().Null();

	if (!m_map.Lookup(m_store.GetKey(index), result))
	{
	    DPRINTF (D_ERROR,("GenMapProf<T, K, V>::IsNull() : lookup failed\n"));
	}
	else
	{
	    bool valuesMatch = (result == expectedVal);

	    if (valuesMatch != expected)
	    {
		DPRINTF (D_ERROR,("GenMapProf<T, K, V>::IsNull() : got %d expected %d\n",
			      valuesMatch,
			      expected));
	    }
	    else
		ret = true;
	}
    }

    return ret;
}

template <class T, class K, class V>
inline
bool GenMapProf<T, K, V>::RunMapSpecificProfs()
{
    // return MapSpecificProfs<T>()();
    return false;
}

template <class T, class K, class V>
inline
bool GenMapProf<T, K, V>::InitHashTable(int numBuckets)
{
    m_map.InitHashTable(numBuckets);
    return true;
}

template <class T, class K, class V>
inline
bool GenMapProf<T, K, V>::ProfileInsertions(const char* typeName)
{
    int len = m_store.GetCount();

    for (int i = 0; i < len; ++i)
    {
        m_map.SetAt(m_store.GetKey(i), m_store.GetValue(i));
    }

    DPRINTF (D_INFO, ("GenMapProf<T,K,V>::ProfileInsertions(%s) - size now %d\n",
                      typeName, m_map.GetCount()));

    return true;
}

#endif // GEN_MAP_PROF_I