File size: 5,858 Bytes
68ce2fc
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*-    */
/* ex: set filetype=cpp softtabstop=4 shiftwidth=4 tabstop=4 cindent expandtab: */

/*

  Author(s):  Anton Deguet
  Created on: 2009-04-29

  (C) Copyright 2009-2026 Johns Hopkins University (JHU), All Rights Reserved.

--- begin cisst license - do not edit ---

This software is provided "as is" under an open source license, with
no warranty.  The complete license can be found in license.txt and
http://www.cisst.org/cisst/license.txt.

--- end cisst license ---
*/

#include "mtsQueueTest.h"
#include "mtsMacrosTestClasses.h"
#include <cisstVector/vctRandom.h>

void mtsQueueTest::TestQueue_mtsDouble(void)
{
    // test default constructor
    mtsQueueGeneric queue;
    CPPUNIT_ASSERT_EQUAL(queue.GetSize(), static_cast<size_t>(0));
    CPPUNIT_ASSERT_EQUAL(queue.GetAvailable(), static_cast<size_t>(0));
    CPPUNIT_ASSERT(queue.IsEmpty());
    CPPUNIT_ASSERT(queue.IsFull());

    // test resize
    const mtsDouble original = 1.2345;
    const size_t size = 100;
    queue.SetSize(size, original);
    CPPUNIT_ASSERT_EQUAL(queue.GetSize(), size);
    CPPUNIT_ASSERT_EQUAL(queue.GetAvailable(), static_cast<size_t>(0));
    CPPUNIT_ASSERT(queue.IsEmpty());
    CPPUNIT_ASSERT(!queue.IsFull());

    mtsDouble element;
    mtsGenericObject * basePointer;
    mtsDouble * retrieved;

    // test with one element, fill the queue at least twice to test circular buffer
    size_t index;
    for (index = 0; index < 3 * queue.GetSize(); index++) {
        element = static_cast<double>(index);
        queue.Put(element);
        CPPUNIT_ASSERT_EQUAL(queue.GetAvailable(), static_cast<size_t>(1));
        basePointer = queue.Peek();
        CPPUNIT_ASSERT(basePointer);
        CPPUNIT_ASSERT_EQUAL(queue.GetAvailable(), static_cast<size_t>(1));
        retrieved = dynamic_cast<mtsDouble *>(basePointer);
        CPPUNIT_ASSERT(retrieved);
        CPPUNIT_ASSERT_EQUAL(retrieved->Data, static_cast<double>(index));
        basePointer = queue.Get();
        CPPUNIT_ASSERT(basePointer);
        CPPUNIT_ASSERT_EQUAL(queue.GetAvailable(), static_cast<size_t>(0));
        retrieved = dynamic_cast<mtsDouble *>(basePointer);
        CPPUNIT_ASSERT(retrieved);
        CPPUNIT_ASSERT_EQUAL(retrieved->Data, static_cast<double>(index));
    }

    CPPUNIT_ASSERT(queue.IsEmpty());
    CPPUNIT_ASSERT_EQUAL(queue.GetAvailable(), static_cast<size_t>(0));

    // test filling it up
    for (index = 0; index < queue.GetSize(); index++) {
        element = static_cast<double>(index);
        CPPUNIT_ASSERT(queue.Put(element));
        CPPUNIT_ASSERT_EQUAL(queue.GetAvailable(), index + 1);
        CPPUNIT_ASSERT(!queue.IsEmpty());
    }
    CPPUNIT_ASSERT(queue.IsFull());

    // test peek and empty
    for (index = 0; index < queue.GetSize(); index++) {
        // peek only
        basePointer = queue.Peek();
        CPPUNIT_ASSERT(basePointer);
        CPPUNIT_ASSERT_EQUAL(queue.GetAvailable(), queue.GetSize() - index);
        retrieved = dynamic_cast<mtsDouble *>(basePointer);
        CPPUNIT_ASSERT(retrieved);
        CPPUNIT_ASSERT_EQUAL(retrieved->Data, static_cast<double>(index));
        // get element
        basePointer = queue.Get();
        CPPUNIT_ASSERT(basePointer);
        CPPUNIT_ASSERT_EQUAL(queue.GetAvailable(), queue.GetSize() - index - 1);
        retrieved = dynamic_cast<mtsDouble *>(basePointer);
        CPPUNIT_ASSERT(retrieved);
        CPPUNIT_ASSERT_EQUAL(retrieved->Data, static_cast<double>(index));
    }
    CPPUNIT_ASSERT(queue.IsEmpty());
}


void mtsQueueTest::TestConstructorDestructorCalls(void)
{
    // reset all counters
    mtsMacrosTestClassB::ResetAllCounters();
    mtsMacrosTestClassBProxy original;
    CPPUNIT_ASSERT_EQUAL(mtsMacrosTestClassB::DefaultConstructorCalls, static_cast<size_t>(1));
    CPPUNIT_ASSERT_EQUAL(mtsMacrosTestClassB::CopyConstructorCalls, static_cast<size_t>(0));
    CPPUNIT_ASSERT_EQUAL(mtsMacrosTestClassB::DestructorCalls, static_cast<size_t>(0));

    // test default constructor
    mtsQueueGeneric * queue = new mtsQueueGeneric;

    // test constructor call when set size
    const size_t size = 100;
    size_t index;
    mtsMacrosTestClassB::ResetAllCounters();
    queue->SetSize(size, original);
    CPPUNIT_ASSERT_EQUAL(mtsMacrosTestClassB::DefaultConstructorCalls, static_cast<size_t>(0));
    CPPUNIT_ASSERT_EQUAL(mtsMacrosTestClassB::CopyConstructorCalls, size + 1);
    CPPUNIT_ASSERT_EQUAL(mtsMacrosTestClassB::DestructorCalls, static_cast<size_t>(0));

    // test a couple of Put and Get
    mtsMacrosTestClassB::ResetAllCounters();
    for (index = 0; index < size; index++) {
        CPPUNIT_ASSERT(queue->Put(original));
    }
    mtsGenericObject * basePointer;
    for (index = 0; index < size; index++) {
        basePointer = queue->Get();
        CPPUNIT_ASSERT(basePointer);
    }
    CPPUNIT_ASSERT_EQUAL(mtsMacrosTestClassB::DefaultConstructorCalls, static_cast<size_t>(0));
    CPPUNIT_ASSERT_EQUAL(mtsMacrosTestClassB::CopyConstructorCalls, size);
    CPPUNIT_ASSERT_EQUAL(mtsMacrosTestClassB::DestructorCalls, static_cast<size_t>(100));

    // test resize
    mtsMacrosTestClassB::ResetAllCounters();
    queue->SetSize(size * 2, original);
    CPPUNIT_ASSERT_EQUAL(mtsMacrosTestClassB::DefaultConstructorCalls, static_cast<size_t>(0));
    CPPUNIT_ASSERT_EQUAL(mtsMacrosTestClassB::CopyConstructorCalls, 2 * size + 1);
    CPPUNIT_ASSERT_EQUAL(mtsMacrosTestClassB::DestructorCalls, size + 1);


    // test final delete
    mtsMacrosTestClassB::ResetAllCounters();
    delete queue;
    CPPUNIT_ASSERT_EQUAL(mtsMacrosTestClassB::DefaultConstructorCalls, static_cast<size_t>(0));
    CPPUNIT_ASSERT_EQUAL(mtsMacrosTestClassB::CopyConstructorCalls, static_cast<size_t>(0));
    CPPUNIT_ASSERT_EQUAL(mtsMacrosTestClassB::DestructorCalls, 2 * size + 1);
}