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
|
/*=========================================================================
*
* Copyright UMC Utrecht and contributors
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0.txt
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
*=========================================================================*/
#include "itkANNBinaryTreeCreator.h"
namespace itk
{
unsigned int ANNBinaryTreeCreator::m_NumberOfANNBinaryTrees = 0;
/**
* ************************ CreateANNkDTree *************************
*/
ANNBinaryTreeCreator::ANNkDTreeType *
ANNBinaryTreeCreator::CreateANNkDTree(ANNPointArrayType pa, int n, int d, int bs, ANNSplitRuleType split)
{
IncreaseReferenceCount();
return new ANNkd_tree(pa, n, d, bs, split);
} // end CreateANNkDTree
/**
* ************************ CreateANNbdTree *************************
*/
ANNBinaryTreeCreator::ANNbdTreeType *
ANNBinaryTreeCreator::CreateANNbdTree(ANNPointArrayType pa,
int n,
int d,
int bs,
ANNSplitRuleType split,
ANNShrinkRuleType shrink)
{
IncreaseReferenceCount();
return new ANNbd_tree(pa, n, d, bs, split, shrink);
} // end CreateANNbdTree
/**
* ************************ CreateANNBruteForceTree *************************
*/
ANNBinaryTreeCreator::ANNBruteForceTreeType *
ANNBinaryTreeCreator::CreateANNBruteForceTree(ANNPointArrayType pa, int n, int d)
{
IncreaseReferenceCount();
return new ANNbruteForce(pa, n, d);
} // end CreateANNBruteForceTree
/**
* ************************ DeleteANNkDTree *************************
*/
void
ANNBinaryTreeCreator::DeleteANNkDTree(ANNkDTreeType *& tree)
{
if (tree)
{
delete tree;
tree = nullptr;
DecreaseReferenceCount();
}
} // end DeleteANNkDTree
/**
* ************************ DeleteANNBruteForceTree *************************
*/
void
ANNBinaryTreeCreator::DeleteANNBruteForceTree(ANNBruteForceTreeType *& tree)
{
if (tree)
{
delete tree;
tree = nullptr;
DecreaseReferenceCount();
}
} // end DeleteANNBruteForceTree
/**
* ************************ IncreaseReferenceCount *************************
*/
void
ANNBinaryTreeCreator::IncreaseReferenceCount()
{
++m_NumberOfANNBinaryTrees;
} // end IncreaseReferenceCount
/**
* ************************ DecreaseReferenceCount *************************
*/
void
ANNBinaryTreeCreator::DecreaseReferenceCount()
{
--m_NumberOfANNBinaryTrees;
if (m_NumberOfANNBinaryTrees == 0)
{
annClose();
}
} // end DecreaseReferenceCount
} // end namespace itk
|
