#include <UnitTest.h>

类 TemplateVectorTest 继承关系图:

TemplateVectorTest 的协作图:

Public 成员函数
	CREATE_FUNC (TemplateVectorTest)

virtual void	onEnter () override

virtual std::string	subtitle () const override

void	constFunc (const cocos2d::Vector< Node * > &vec) 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 第 40 行定义.

成员函数说明

◆ constFunc()

void TemplateVectorTest::constFunc ( const cocos2d::Vector< Node * > & vec ) const

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

{
    log("vec[8] = %d", vec.at(8)->getTag());
}

被这些函数引用 onEnter().

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

◆ CREATE_FUNC()

TemplateVectorTest::CREATE_FUNC ( TemplateVectorTest )

◆ onEnter()

void TemplateVectorTest::onEnter ( )

overridevirtual

重载 TestCase .

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

{
    UnitTestDemo::onEnter();
 
    Vector<Node*> vec;
    CCASSERT(vec.empty(), "vec should be empty.");
    CCASSERT(vec.capacity() == 0, "vec.capacity should be 0.");
    CCASSERT(vec.size() == 0, "vec.size should be 0.");
    CCASSERT(vec.max_size() > 0, "vec.max_size should > 0.");
 
    auto node1 = Node::create();
    node1->setTag(1);
    vec.pushBack(node1);
    CCASSERT(node1->getReferenceCount() == 2, "node1->getReferenceCount should be 2.");
 
    auto node2 = Node::create();
    node2->setTag(2);
    vec.pushBack(node2);
    CCASSERT(vec.getIndex(node1) == 0, "node1 should at index 0 in vec.");
    CCASSERT(vec.getIndex(node2) == 1, "node2 should at index 1 in vec.");
 
    auto node3 = Node::create();
    node3->setTag(3);
    vec.insert(1, node3);
    CCASSERT(vec.at(0)->getTag() == 1, "The element at 0, tag should be 1.");
    CCASSERT(vec.at(1)->getTag() == 3, "The element at 1, tag should be 3.");
    CCASSERT(vec.at(2)->getTag() == 2, "The element at 2, tag should be 2.");
 
    // Test copy constructor
    Vector<Node*> vec2(vec);
    CCASSERT(vec2.size() == vec.size(), "vec2 and vec should have equal size.");
    ssize_t size = vec.size();
    for (ssize_t i = 0; i < size; ++i)
    {
        CCASSERT(vec2.at(i) == vec.at(i), "The element at the same index in vec2 and vec2 should be equal.");
        CCASSERT(vec.at(i)->getReferenceCount() == 3, "The reference count of element in vec is 3. ");
        CCASSERT(vec2.at(i)->getReferenceCount() == 3, "The reference count of element in vec2 is 3. ");
    }
 
    // Test copy assignment operator
    Vector<Node*> vec3;
    vec3 = vec2;
    CCASSERT(vec3.size() == vec2.size(), "vec3 and vec2 should have equal size.");
    size = vec3.size();
    for (ssize_t i = 0; i < size; ++i)
    {
        CCASSERT(vec3.at(i) == vec2.at(i), "The element at the same index in vec3 and vec2 should be equal.");
        CCASSERT(vec3.at(i)->getReferenceCount() == 4, "The reference count of element in vec3 is 4. ");
        CCASSERT(vec2.at(i)->getReferenceCount() == 4, "The reference count of element in vec2 is 4. ");
        CCASSERT(vec.at(i)->getReferenceCount() == 4, "The reference count of element in vec is 4. ");
    }
 
    // Test move constructor
 
    auto createVector = [](){
        Vector<Node*> ret;
 
        for (int i = 0; i < 20; i++)
        {
            ret.pushBack(Node::create());
        }
 
        int j = 1000;
        for (auto& child : ret)
        {
            child->setTag(j++);
        }
 
        return ret;
    };
 
    Vector<Node*> vec4(createVector());
    for (const auto& child : vec4)
    {
        CC_UNUSED_PARAM(child);
        CCASSERT(child->getReferenceCount() == 2, "child's reference count should be 2.");
    }
 
    // Test init Vector<T> with capacity
    Vector<Node*> vec5(10);
    CCASSERT(vec5.capacity() == 10, "vec5's capacity should be 10.");
    vec5.reserve(20);
    CCASSERT(vec5.capacity() == 20, "vec5's capacity should be 20.");
 
    CCASSERT(vec5.size() == 0, "vec5's size should be 0.");
    CCASSERT(vec5.empty(), "vec5 is empty now.");
 
    auto toRemovedNode = Node::create();
    vec5.pushBack(toRemovedNode);
    CCASSERT(toRemovedNode->getReferenceCount() == 2, "toRemovedNode's reference count is 2.");
 
    // Test move assignment operator
    vec5 = createVector();
    CCASSERT(toRemovedNode->getReferenceCount() == 1, "toRemovedNode's reference count is 1.");
    CCASSERT(vec5.size() == 20, "size should be 20");
 
    for (const auto& child : vec5)
    {
        CC_UNUSED_PARAM(child);
        CCASSERT(child->getReferenceCount() == 2, "child's reference count is 2.");
    }
 
    // Test Vector<T>::find
    CCASSERT(vec.find(node3) == (vec.begin() + 1), "node3 is the 2nd element in vec.");
    CCASSERT(std::find(std::begin(vec), std::end(vec), node2) == (vec.begin() + 2), "node2 is the 3rd element in vec.");
 
    CCASSERT(vec.front()->getTag() == 1, "vec's front element's tag is 1.");
    CCASSERT(vec.back()->getTag() == 2, "vec's back element's tag is 2.");
 
    CCASSERT(vec.getRandomObject(), "vec getRandomObject should return true.");
    CCASSERT(!vec.contains(Node::create()), "vec doesn't contain a empty Node instance.");
    CCASSERT(vec.contains(node1), "vec contains node1.");
    CCASSERT(vec.contains(node2), "vec contains node2.");
    CCASSERT(vec.contains(node3), "vec contains node3.");
    CCASSERT(vec.equals(vec2), "vec is equal to vec2.");
    CCASSERT(vec.equals(vec3), "vec is equal to vec3.");
 
    // Insert
    vec5.insert(2, node1);
    CCASSERT(vec5.at(2)->getTag() == 1, "vec5's 3rd element's tag is 1.");
    CCASSERT(vec5.size() == 21, "vec5's size is 21.");
    vec5.back()->setTag(100);
    vec5.popBack();
    CCASSERT(vec5.size() == 20, "vec5's size is 20.");
    CCASSERT(vec5.back()->getTag() != 100, "the back element of vec5's tag is 100.");
 
    // Erase and clear
    Vector<Node*> vec6 = createVector();
    Vector<Node*> vec7 = vec6;  // Copy for check
 
    CCASSERT(vec6.size() == 20, "vec6's size is 20.");
    vec6.erase(vec6.begin() + 1);  //
    CCASSERT(vec6.size() == 19, "vec6's size is 19.");
    CCASSERT((*(vec6.begin() + 1))->getTag() == 1002, "The 2rd element in vec6's tag is 1002.");
    vec6.erase(vec6.begin() + 2, vec6.begin() + 10);
    CCASSERT(vec6.size() == 11, "vec6's size is 11.");
    CCASSERT(vec6.at(0)->getTag() == 1000, "vec6's first element's tag is 1000.");
    CCASSERT(vec6.at(1)->getTag() == 1002, "vec6's second element's tag is 1002.");
    CCASSERT(vec6.at(2)->getTag() == 1011, "vec6's third element's tag is 1011.");
    CCASSERT(vec6.at(3)->getTag() == 1012, "vec6's fouth element's tag is 1012.");
    vec6.erase(3);
    CCASSERT(vec6.at(3)->getTag() == 1013, "vec6's 4th element's tag is 1013.");
    vec6.eraseObject(vec6.at(2));
    CCASSERT(vec6.at(2)->getTag() == 1013, "vec6's 3rd element's tag is 1013.");
    vec6.clear();
    
    auto objA = Node::create(); // retain count is 1
    auto objB = Node::create();
    auto objC = Node::create();
    {
        Vector<Node*> array1;
        Vector<Node*> array2;
        
        // push back objA 3 times
        array1.pushBack(objA); // retain count is 2
        array1.pushBack(objA); // retain count is 3
        array1.pushBack(objA); // retain count is 4
        
        array2.pushBack(objA); // retain count is 5
        array2.pushBack(objB);
        array2.pushBack(objC);
        
        for (auto obj : array1) {
            array2.eraseObject(obj);
        }
        CCASSERT(objA->getReferenceCount() == 4, "objA's reference count is 4.");
    }
    CCASSERT(objA->getReferenceCount() == 1, "objA's reference count is 1.");
    
    {
        Vector<Node*> array1;
        // push back objA 3 times
        array1.pushBack(objA); // retain count is 2
        array1.pushBack(objA); // retain count is 3
        array1.pushBack(objA); // retain count is 4
        CCASSERT(objA->getReferenceCount() == 4, "objA's reference count is 4.");
        array1.eraseObject(objA, true); // Remove all occurrences in the Vector.
        CCASSERT(objA->getReferenceCount() == 1, "objA's reference count is 1.");
        
        array1.pushBack(objA); // retain count is 2
        array1.pushBack(objA); // retain count is 3
        array1.pushBack(objA); // retain count is 4
        
        array1.eraseObject(objA, false);
        CCASSERT(objA->getReferenceCount() == 3, "objA's reference count is 3."); // Only remove the first occurrence in the Vector.
    }
 
    // Check the retain count in vec7
    CCASSERT(vec7.size() == 20, "vec7's size is 20.");
    for (const auto& child : vec7)
    {
        CC_UNUSED_PARAM(child);
        CCASSERT(child->getReferenceCount() == 2, "child's reference count is 2.");
    }
 
    // Sort
    Vector<Node*> vecForSort = createVector();
    std::sort(vecForSort.begin(), vecForSort.end(), [](Node* a, Node* b){
        return a->getTag() >= b->getTag();
    });
 
    for (int i = 0; i < 20; ++i)
    {
        CCASSERT(vecForSort.at(i)->getTag() - 1000 == (19 - i), "vecForSort's element's tag is invalid.");
    }
 
    // Reverse
    vecForSort.reverse();
    for (int i = 0; i < 20; ++i)
    {
        CCASSERT(vecForSort.at(i)->getTag() - 1000 == i, "vecForSort's element's tag is invalid.");
    }
 
    // Swap
    Vector<Node*> vecForSwap = createVector();
    vecForSwap.swap(2, 4);
    CCASSERT(vecForSwap.at(2)->getTag() == 1004, "vecForSwap's 3nd element's tag is 1004.");
    CCASSERT(vecForSwap.at(4)->getTag() == 1002, "vecForSwap's 5rd element's tag is 1002.");
    vecForSwap.swap(vecForSwap.at(2), vecForSwap.at(4));
    CCASSERT(vecForSwap.at(2)->getTag() == 1002, "vecForSwap's 3rd element's tag is 1002.");
    CCASSERT(vecForSwap.at(4)->getTag() == 1004, "vecForSwap's 5rd element's tag is 1004.");
 
    // shrinkToFit
    Vector<Node*> vecForShrink = createVector();
    vecForShrink.reserve(100);
    CCASSERT(vecForShrink.capacity() == 100, "vecForShrink's capacity is 100.");
    vecForShrink.pushBack(Node::create());
    vecForShrink.shrinkToFit();
    CCASSERT(vecForShrink.capacity() == 21, "vecForShrink's capacity is 21.");
 
    // get random object
    // Set the seed by time
    std::srand((unsigned)time(nullptr));
    Vector<Node*> vecForRandom = createVector();
    log("<--- begin ---->");
    for (int i = 0; i < vecForRandom.size(); ++i)
    {
        log("Vector: random object tag = %d", vecForRandom.getRandomObject()->getTag());
    }
    log("<---- end  ---->");
 
    // Self assignment
    Vector<Node*> vecSelfAssign = createVector();
    vecSelfAssign = vecSelfAssign;
    CCASSERT(vecSelfAssign.size() == 20, "vecSelfAssign's size is 20.");
 
    for (const auto& child : vecSelfAssign)
    {
        CC_UNUSED_PARAM(child);
        CCASSERT(child->getReferenceCount() == 2, "child's reference count is 2.");
    }
 
    vecSelfAssign = std::move(vecSelfAssign);
    CCASSERT(vecSelfAssign.size() == 20, "vecSelfAssign's size is 20.");
 
    for (const auto& child : vecSelfAssign)
    {
        CC_UNUSED_PARAM(child);
        CCASSERT(child->getReferenceCount() == 2, "child's reference count is 2.");
    }
 
    // const at
    Vector<Node*> vecConstAt = createVector();
    constFunc(vecConstAt);
}

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

函数调用图:

◆ subtitle()

std::string TemplateVectorTest::subtitle ( ) const

overridevirtual

重载 TestCase .

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

{
    return "Vector<T>, 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