forked from alicevision/AliceVision
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathstructures.cpp
More file actions
161 lines (137 loc) · 2.91 KB
/
structures.cpp
File metadata and controls
161 lines (137 loc) · 2.91 KB
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
150
151
152
153
154
155
156
157
158
159
160
161
// This file is part of the AliceVision project.
// Copyright (c) 2017 AliceVision contributors.
// This Source Code Form is subject to the terms of the Mozilla Public License,
// v. 2.0. If a copy of the MPL was not distributed with this file,
// You can obtain one at https://mozilla.org/MPL/2.0/.
#include "structures.hpp"
#include <aliceVision/mvsData/Pixel.hpp>
#include <aliceVision/mvsData/Voxel.hpp>
namespace aliceVision {
int qSortCompareFloatAsc(const void* ia, const void* ib)
{
float a = *(float*)ia;
float b = *(float*)ib;
if(a > b)
{
return 1;
}
return -1;
}
int qSortCompareIntAsc(const void* ia, const void* ib)
{
int a = *(int*)ia;
int b = *(int*)ib;
if(a > b)
{
return 1;
}
return -1;
}
int qsortCompareSortedIdDesc(const void* ia, const void* ib)
{
SortedId a = *(SortedId*)ia;
SortedId b = *(SortedId*)ib;
if(a.value > b.value)
{
return -1;
}
return 1;
}
int qsortCompareSortedIdAsc(const void* ia, const void* ib)
{
SortedId a = *(SortedId*)ia;
SortedId b = *(SortedId*)ib;
if(a.value < b.value)
{
return -1;
}
return 1;
}
int qSortCompareVoxelByXAsc(const void* ia, const void* ib)
{
Voxel a = *(Voxel*)ia;
Voxel b = *(Voxel*)ib;
if(a.x < b.x)
{
return -1;
}
return 1;
}
int qSortCompareVoxelByYAsc(const void* ia, const void* ib)
{
Voxel a = *(Voxel*)ia;
Voxel b = *(Voxel*)ib;
if(a.y < b.y)
{
return -1;
}
return 1;
}
int qSortCompareVoxelByZAsc(const void* ia, const void* ib)
{
Voxel a = *(Voxel*)ia;
Voxel b = *(Voxel*)ib;
if(a.z < b.z)
{
return -1;
}
return 1;
}
int qSortComparePixelByXDesc(const void* ia, const void* ib)
{
Pixel a = *(Pixel*)ia;
Pixel b = *(Pixel*)ib;
if(a.x > b.x)
{
return -1;
}
return 1;
}
int qSortComparePixelByXAsc(const void* ia, const void* ib)
{
Pixel a = *(Pixel*)ia;
Pixel b = *(Pixel*)ib;
if(a.x < b.x)
{
return -1;
}
return 1;
}
int indexOfSortedVoxelArrByX(int val, StaticVector<Voxel>& values, int startId, int stopId)
{
int lef = startId;
int rig = stopId;
int mid = lef + (rig - lef) / 2;
while((rig - lef) > 1)
{
if((val >= values[lef].x) && (val < values[mid].x))
{
//lef = lef;
rig = mid;
mid = lef + (rig - lef) / 2;
}
if((val >= values[mid].x) && (val <= values[rig].x))
{
lef = mid;
//rig = rig;
mid = lef + (rig - lef) / 2;
}
if((val < values[lef].x) || (val > values[rig].x))
{
lef = 0;
rig = 0;
mid = 0;
}
}
int id = -1;
if(val == values[lef].x)
{
id = lef;
}
if(val == values[rig].x)
{
id = rig;
}
return id;
}
} // namespace aliceVision