guid2ptr_tests.cpp

来自「symbian 下的helix player源代码」· C++ 代码 · 共 274 行

/* ***** BEGIN LICENSE BLOCK *****
 * Source last modified: $Id: guid2ptr_tests.cpp,v 1.1.1.1.50.3 2004/07/09 01:45:54 hubbe Exp $
 * 
 * Portions Copyright (c) 1995-2004 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 (the "RPSL") available at
 * http://www.helixcommunity.org/content/rpsl unless you have licensed
 * the file under the current version of the RealNetworks Community
 * Source License (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.
 * 
 * Alternatively, the contents of this file may be used under the
 * terms of the GNU General Public License Version 2 or later (the
 * "GPL") in which case the provisions of the GPL are applicable
 * instead of those above. If you wish to allow use of your version of
 * this file only under the terms of the GPL, and not to allow others
 * to use your version of this file under the terms of either the RPSL
 * or RCSL, indicate your decision by deleting the provisions above
 * and replace them with the notice and other provisions required by
 * the GPL. If you do not delete the provisions above, a recipient may
 * use your version of this file under the terms of any one of the
 * RPSL, the RCSL or the GPL.
 * 
 * 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 ***** */

#include "./map_spec_tests.h"

//#include "hxguidmap.h"
#include "chxmapguidtoobj.h"
#include "hx_ut_debug.h"
#include "./hxlist.h"
#include "./kv_store.h"
#include "./find_match.h"

template<>
class MapSpecificTests<CHXMapGUIDToObj>
{
 public:
    bool operator()();

private:
    bool TestIterator();
    bool TestIterator2();
    bool TestGetStartPosition();
    bool TestGetNextAssoc();
};

bool MapSpecificTests<CHXMapGUIDToObj>::operator() ()
{
    bool ret = (TestIterator() &&
		TestIterator2() &&
		TestGetStartPosition() &&
		TestGetNextAssoc());

    DPRINTF (D_ERROR, ("MapSpecificTests<CHXMapGUIDToObj> : %d\n",
		       ret));
    return ret;
}

bool MapSpecificTests<CHXMapGUIDToObj>::TestIterator()
{
    bool ret = true;

    CHXMapGUIDToObj map;
    KeyValueStore<GUID, void*> store;

    for (int i = 0; i < 10; i++)
	store.Create(i);

    for (int j = 0; j < store.GetCount(); j++)
	map.SetAt(store.GetKey(j), store.GetValue(j));


    CHXMapGUIDToObj::Iterator itr = map.Begin(); 

    HLXList<int> matchList;

    for (; ret && (itr != map.End()); ++itr)
    {
	int index = 0;

	if (!FindMatch<GUID, void*>()(store, *itr.get_key(), *itr, index))
	{
	    DPRINTF (D_ERROR,
		     ("MapSpecificTests<CHXMapGUIDToObj>::TestIterator() : Failed to find key/value pair\n"));
	    ret = false;
	}
	else if (matchList.Find(index))
	{
	    DPRINTF (D_ERROR,
		     ("MapSpecificTests<CHXMapGUIDToObj>::TestIterator() : Index already in match list\n"));
	    ret = false;
	}
	else
	{
	    matchList.AddTail(index);
	}

    }

    if (ret && (matchList.GetCount() != map.GetCount()))
    {
	DPRINTF (D_ERROR,
		 ("MapSpecificTests<CHXMapGUIDToObj>::TestIterator() : match list count does not match map count\n"));
	ret = false;
    }

    return ret;
}

bool MapSpecificTests<CHXMapGUIDToObj>::TestIterator2()
{
    // This test is the same as TestIterator() except that
    // it uses the default constructor of the iterator.
    bool ret = true;

    CHXMapGUIDToObj map;
    KeyValueStore<GUID, void*> store;

    for (int i = 0; i < 10; i++)
	store.Create(i);

    for (int j = 0; j < store.GetCount(); j++)
	map.SetAt(store.GetKey(j), store.GetValue(j));


    CHXMapGUIDToObj::Iterator itr; 

    HLXList<int> matchList;

    for (itr = map.Begin(); ret && (itr != map.End()); ++itr)
    {
	int index = 0;

	if (!FindMatch<GUID, void*>()(store, *itr.get_key(), *itr, index))
	{
	    DPRINTF (D_ERROR,
		     ("MapSpecificTests<CHXMapGUIDToObj>::TestIterator2() : Failed to find key/value pair\n"));
	    ret = false;
	}
	else if (matchList.Find(index))
	{
	    DPRINTF (D_ERROR,
		     ("MapSpecificTests<CHXMapGUIDToObj>::TestIterator2() : Index already in match list\n"));
	    ret = false;
	}
	else
	{
	    matchList.AddTail(index);
	}

    }

    if (ret && (matchList.GetCount() != map.GetCount()))
    {
	DPRINTF (D_ERROR,
		 ("MapSpecificTests<CHXMapGUIDToObj>::TestIterator2() : match list count does not match map count\n"));
	ret = false;
    }

    return ret;
}

bool MapSpecificTests<CHXMapGUIDToObj>::TestGetStartPosition()
{
    bool ret = false;

    CHXMapGUIDToObj map;

    POSITION pos = map.GetStartPosition();

    if (!pos)
    {
	KeyValueStore<GUID, void*> store;
	store.Create(0);
	
	map.SetAt(store.GetKey(0), store.GetValue(0));

	pos = map.GetStartPosition();

	if (pos)
	    ret = true;
	else
	{
	    DPRINTF (D_ERROR, ("MapSpecificTests<CHXMapGUIDToObj>::TestGetStartPosition() : pos NULL for a non-empty map\n"));
	}
    }
    else
    {
	DPRINTF (D_ERROR, ("MapSpecificTests<CHXMapGUIDToObj>::TestGetStartPosition() : pos not NULL for an empty map\n"));
    }

    return ret;
}

bool MapSpecificTests<CHXMapGUIDToObj>::TestGetNextAssoc()
{
    bool ret = true;

    CHXMapGUIDToObj map;
    KeyValueStore<GUID, void*> store;

    for (int i = 0; i < 10; i++)
	store.Create(i);

    for (int j = 0; j < store.GetCount(); j++)
	map.SetAt(store.GetKey(j), store.GetValue(j));

#ifdef DO_MAP_DUMP
    map.Dump();
#endif /* DO_MAP_DUMP */

    POSITION pos = map.GetStartPosition();

    HLXList<int> matchList;

    while (ret && pos)
    {
	GUID* pKey;
	void* value = 0;
	int index = 0;
	
	map.GetNextAssoc(pos, pKey, value);

	if (!FindMatch<GUID, void*>()(store, *pKey, value, index))
	{
	    DPRINTF (D_ERROR, ("MapSpecificTests<CHXMapGUIDToObj>::TestGetNextAssoc() : failed to find the key/value pair\n"));
	    
	    ret = false;
	}
	else if (matchList.Find(index))
	{
	    DPRINTF (D_ERROR, ("MapSpecificTests<CHXMapGUIDToObj>::TestGetNextAssoc() : Item %d already visited\n", index));
	    ret = false;
	}	
	else
	    matchList.AddTail(index);
    }

    if (ret && (matchList.GetCount() != map.GetCount()))
    {
	DPRINTF (D_ERROR, ("MapSpecificTests<CHXMapGUIDToObj>::TestGetNextAssoc() : items visited count doesn't match map item count\n"));
	ret = false;
    }

    
    
    return ret;
}