#include <UnitTest.h>

类 TemplateMapTest 继承关系图:

TemplateMapTest 的协作图:

Public 成员函数
	CREATE_FUNC (TemplateMapTest)

virtual void	onEnter () override

virtual std::string	subtitle () const override

void	constFunc (const cocos2d::Map< std::string, cocos2d::Node * > &map) const

Public 成员函数继承自 UnitTestDemo
virtual std::string	title () const override

Public 成员函数继承自 TestCase
	TestCase ()

	~TestCase ()

virtual Type	getTestType () const

virtual float	getDuration () const

virtual std::string	getExpectedOutput () const

virtual std::string	getActualOutput () const

virtual void	restartTestCallback (cocos2d::Ref *sender)

virtual void	nextTestCallback (cocos2d::Ref *sender)

virtual void	priorTestCallback (cocos2d::Ref *sender)

virtual void	onBackCallback (cocos2d::Ref *sender)

void	setTestSuite (TestSuite *testSuite)

TestSuite *	getTestSuite () const

float	getRunTime () const

void	setTestCaseName (const std::string &name)

std::string	getTestCaseName () const

const cocos2d::Label *	getSubtitleLable () const

const cocos2d::MenuItemImage *	getRestartTestItem () const

额外继承的成员函数
Public 类型继承自 TestCase
enum class	Type { ROBUSTNESS , UNIT , GRAPHICAL_STATIC , MANUAL }

Public 属性继承自 TestCase
CC_CONSTRUCTOR_ACCESS	__pad0__: virtual bool init() override

Protected 属性继承自 TestCase
cocos2d::MenuItemImage *	_priorTestItem

cocos2d::MenuItemImage *	_restartTestItem

cocos2d::MenuItemImage *	_nextTestItem

cocos2d::Label *	_titleLabel

cocos2d::Label *	_subtitleLabel

详细描述

在文件 UnitTest.h 第 49 行定义.

成员函数说明

◆ constFunc()

void TemplateMapTest::constFunc ( const cocos2d::Map< std::string, cocos2d::Node * > & map ) const

在文件 UnitTest.cpp 第 562 行定义.

{
    log("[%s]=(tag)%d", "0", map.at("0")->getTag());
    log("[%s]=(tag)%d", "1", map.find("1")->second->getTag());
}

被这些函数引用 onEnter().

这是这个函数的调用关系图:

◆ CREATE_FUNC()

TemplateMapTest::CREATE_FUNC ( TemplateMapTest )

◆ onEnter()

void TemplateMapTest::onEnter ( )

overridevirtual

重载 TestCase .

在文件 UnitTest.cpp 第 371 行定义.

{
    UnitTestDemo::onEnter();
 
    auto createMap = [](){
        Map<std::string, Node*> ret;
        for (int i = 0; i < 20; ++i)
        {
            auto node = Node::create();
            node->setTag(1000 + i);
            ret.insert(StringUtils::toString(i), node);
        }
 
        return ret;
    };
 
    // Default constructor
    Map<std::string, Node*> map1;
    CCASSERT(map1.empty(), "map1 is empty.");
    CCASSERT(map1.size() == 0, "map1's size is 0.");
    CCASSERT(map1.keys().empty(), "map1's keys are empty.");
    CCASSERT(map1.keys(Node::create()).empty(), "map1's keys don't contain a empty Node.");
 
    // Move constructor
    Map<std::string, Node*> map2 = createMap();
    for (const auto& e : map2)
    {
        CC_UNUSED_PARAM(e);
        CCASSERT(e.second->getReferenceCount() == 2, "e.second element's reference count is 2.");
    }
 
    // Copy constructor
    Map<std::string, Node*> map3(map2);
    for (const auto& e : map3)
    {
        CC_UNUSED_PARAM(e);
        CCASSERT(e.second->getReferenceCount() == 3, "e.second's reference count is 3.");
    }
 
    // Move assignment operator
    Map<std::string, Node*> map4;
    auto unusedNode = Node::create();
    map4.insert("unused",unusedNode);
    map4 = createMap();
    CCASSERT(unusedNode->getReferenceCount() == 1, "unusedNode's reference count is 1.");
    for (const auto& e : map4)
    {
        CC_UNUSED_PARAM(e);
        CCASSERT(e.second->getReferenceCount() == 2, "e.second's reference count is 2.");
    }
 
    // Copy assignment operator
    Map<std::string, Node*> map5;
    map5 = map4;
    for (const auto& e : map5)
    {
        CC_UNUSED_PARAM(e);
        CCASSERT(e.second->getReferenceCount() == 3, "e.second's reference count is 3.");
    }
 
    // Check size
    CCASSERT(map4.size() == map5.size(), "map4's size is equal to map5.size.");
 
    for (const auto& e : map4)
    {
        CC_UNUSED_PARAM(e);
        CCASSERT(e.second == map5.find(e.first)->second, "e.second can't be found in map5.");
    }
 
    // bucket_count, bucket_size(n), bucket
    log("--------------");
    log("bucket_count = %d", static_cast<int>(map4.bucketCount()));
    log("size = %d", static_cast<int>(map4.size()));
    for (int i = 0; i < map4.bucketCount(); ++i)
    {
        log("bucket_size(%d) = %d", i, static_cast<int>(map4.bucketSize(i)));
    }
    for (const auto& e : map4)
    {
        log("bucket(\"%s\"), bucket index = %d", e.first.c_str(), static_cast<int>(map4.bucket(e.first)));
    }
 
    log("----- all keys---------");
 
    // keys and at
    auto keys = map4.keys();
    for (const auto& key : keys)
    {
        log("key = %s", key.c_str());
    }
 
    auto node10Key = map4.at("10");
    map4.insert("100", node10Key);
    map4.insert("101", node10Key);
    map4.insert("102", node10Key);
 
    log("------ keys for object --------");
    auto keysForObject = map4.keys(node10Key);
    for (const auto& key : keysForObject)
    {
        log("key = %s", key.c_str());
    }
    log("--------------");
 
    // at in const function
    constFunc(map4);
 
    // find
    auto nodeToFind = map4.find("10");
    CC_UNUSED_PARAM(nodeToFind);
    CCASSERT(nodeToFind->second->getTag() == 1010, "nodeToFind's tag value is 1010.");
 
    // insert
    Map<std::string, Node*> map6;
    auto node1 = Node::create();
    node1->setTag(101);
    auto node2 = Node::create();
    node2->setTag(102);
    auto node3 = Node::create();
    node3->setTag(103);
    map6.insert("insert01", node1);
    map6.insert("insert02", node2);
    map6.insert("insert03", node3);
 
    CCASSERT(node1->getReferenceCount() == 2, "node1's reference count is 2.");
    CCASSERT(node2->getReferenceCount() == 2, "node2's reference count is 2.");
    CCASSERT(node3->getReferenceCount() == 2, "node3's reference count is 2.");
    CCASSERT(map6.at("insert01") == node1, "The element at insert01 is equal to node1.");
    CCASSERT(map6.at("insert02") == node2, "The element at insert02 is equal to node2.");
    CCASSERT(map6.at("insert03") == node3, "The element at insert03 is equal to node3.");
 
    // erase
    Map<std::string, Node*> mapForErase = createMap();
    mapForErase.erase(mapForErase.find("9"));
    CCASSERT(mapForErase.find("9") == mapForErase.end(), "9 is already removed.");
    CCASSERT(mapForErase.size() == 19, "mapForErase's size is 19.");
 
    mapForErase.erase("7");
    CCASSERT(mapForErase.find("7") == mapForErase.end(), "7 is already removed.");
    CCASSERT(mapForErase.size() == 18, "mapForErase's size is 18.");
 
    std::vector<std::string> itemsToRemove;
    itemsToRemove.push_back("2");
    itemsToRemove.push_back("3");
    itemsToRemove.push_back("4");
    mapForErase.erase(itemsToRemove);
    CCASSERT(mapForErase.size() == 15, "mapForErase's size is 15.");
 
    // clear
    Map<std::string, Node*> mapForClear = createMap();
    auto mapForClearCopy = mapForClear;
    mapForClear.clear();
 
    for (const auto& e : mapForClearCopy)
    {
        CC_UNUSED_PARAM(e);
        CCASSERT(e.second->getReferenceCount() == 2, "e.second's reference count is 2.");
    }
 
    // get random object
    // Set the seed by time
    std::srand((unsigned)time(nullptr));
    Map<std::string, Node*> mapForRandom = createMap();
    log("<--- begin ---->");
    for (int i = 0; i < mapForRandom.size(); ++i)
    {
        log("Map: random object tag = %d", mapForRandom.getRandomObject()->getTag());
    }
    log("<---- end  ---->");
 
    // Self assignment
    Map<std::string, Node*> mapForSelfAssign = createMap();
    mapForSelfAssign = mapForSelfAssign;
    CCASSERT(mapForSelfAssign.size() == 20, "mapForSelfAssign's size is 20.");
 
    for (const auto& e : mapForSelfAssign)
    {
        CC_UNUSED_PARAM(e);
        CCASSERT(e.second->getReferenceCount() == 2, "e.second's reference count is 2.");
    }
 
    mapForSelfAssign = std::move(mapForSelfAssign);
    CCASSERT(mapForSelfAssign.size() == 20, "mapForSelfAssign's size is 20.");
 
    for (const auto& e : mapForSelfAssign)
    {
        CC_UNUSED_PARAM(e);
        CCASSERT(e.second->getReferenceCount() == 2, "e.second's reference's count is 2.");
    }
}

引用了 constFunc() , 以及 TestCase::onEnter().

函数调用图:

◆ subtitle()

std::string TemplateMapTest::subtitle ( ) const

overridevirtual

重载 TestCase .

在文件 UnitTest.cpp 第 568 行定义.

{
    return "Map<K, V>, should not crash";
}

该类的文档由以下文件生成:

/Users/yujizhu/Documents/Git/cocos2d-x-4.0/tests/cpp-tests/Classes/UnitTest/UnitTest.h
/Users/yujizhu/Documents/Git/cocos2d-x-4.0/tests/cpp-tests/Classes/UnitTest/UnitTest.cpp