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
|
/*=========================================================================
Program: Insight Segmentation & Registration Toolkit
Module: itkObjectStoreTest.cxx
Language: C++
Date: $Date$
Version: $Revision$
Copyright (c) Insight Software Consortium. All rights reserved.
See ITKCopyright.txt or http://www.itk.org/HTML/Copyright.htm for details.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the above copyright notices for more information.
=========================================================================*/
#if defined(_MSC_VER)
#pragma warning ( disable : 4786 )
#endif
#include "itkObjectStore.h"
#include <iostream>
#include <list>
struct TestObject
{
float vector[3];
int counter;
};
int itkObjectStoreTest( int , char * [] )
{
unsigned i, j;
itk::ObjectStore<TestObject>::Pointer store
= itk::ObjectStore<TestObject>::New();
std::list<TestObject *> borrowed_list;
store->SetGrowthStrategyToExponential();
store->Reserve(40000);
// for increased code coverage
store->SetLinearGrowthSize( store->GetLinearGrowthSize() );
store->SetGrowthStrategy( store->GetGrowthStrategy() );
for (j = 0; j< 2; j++)
{
std::cout << "_______________________" << std::endl;
store->Print(std::cout);
// Borrow some items
for (i = 0; i < 30000; i++)
{
borrowed_list.push_back(store->Borrow());
}
store->Print(std::cout);
// Force allocation of a more memory
for (i = 0; i < 1000000; i++)
{
borrowed_list.push_back(store->Borrow());
}
store->Print(std::cout);
// Return all items
unsigned int sz = static_cast< unsigned int>( borrowed_list.size() );
for (i = 0; i < sz; ++i)
{
store->Return(borrowed_list.back());
borrowed_list.pop_back();
}
store->Print(std::cout);
store->Clear();
store->Squeeze();
}
return EXIT_SUCCESS;
}
|
