-
Notifications
You must be signed in to change notification settings - Fork 0
/
BSF-ProblemFunctions.h
154 lines (153 loc) · 3.6 KB
/
BSF-ProblemFunctions.h
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
/*==============================================================================
Project: CoFePro
Theme: Projection Algorithm for Solving Convex Feasibility Problems
Module: BSF-ProblemFunctions.h (Predefined Problem Function Forwards)
Author: Leonid B. Sokolinsky
This source code is a part of BSF Skeleton (https://github.com/leonid-sokolinsky/BSF-skeleton)
==============================================================================*/
#include "Problem-bsfTypes.h" // Predefined Problem Types
void PC_bsf_CopyParameter(
PT_bsf_parameter_T parameterIn,
PT_bsf_parameter_T* parameterOutP
);
void PC_bsf_Init(
bool* success
);
void PC_bsf_IterOutput(
PT_bsf_reduceElem_T* reduceResult,
int reduceCounter,
PT_bsf_parameter_T parameter,
double elapsedTime,
int nextJob
);
void PC_bsf_IterOutput_1(
PT_bsf_reduceElem_T_1* reduceResult,
int reduceCounter,
PT_bsf_parameter_T parameter,
double elapsedTime,
int nextJob
);
void PC_bsf_IterOutput_2(
PT_bsf_reduceElem_T_2* reduceResult,
int reduceCounter,
PT_bsf_parameter_T parameter,
double elapsedTime,
int nextJob
);
void PC_bsf_IterOutput_3(
PT_bsf_reduceElem_T_3* reduceResult,
int reduceCounter,
PT_bsf_parameter_T parameter,
double elapsedTime,
int nextJob
);
void PC_bsf_JobDispatcher(
PT_bsf_parameter_T* parameter,
int* job,
bool* exit
);
void PC_bsf_MapF(
PT_bsf_mapElem_T* mapElem,
PT_bsf_reduceElem_T* reduceElem,
int* success
);
void PC_bsf_MapF_1(
PT_bsf_mapElem_T* mapElem,
PT_bsf_reduceElem_T_1* reduceElem,
int* success
);
void PC_bsf_MapF_2(
PT_bsf_mapElem_T* mapElem,
PT_bsf_reduceElem_T_2* reduceElem,
int* success
);
void PC_bsf_MapF_3(
PT_bsf_mapElem_T* mapElem,
PT_bsf_reduceElem_T_3* reduceElem,
int* success
);
void PC_bsf_ParametersOutput(
PT_bsf_parameter_T parameter
);
void PC_bsf_ProblemOutput(
PT_bsf_reduceElem_T* reduceResult,
int reduceCounter,
PT_bsf_parameter_T parameter,
double t
);
void PC_bsf_ProblemOutput_1(
PT_bsf_reduceElem_T_1* reduceResult,
int reduceCounter,
PT_bsf_parameter_T parameter,
double t
);
void PC_bsf_ProblemOutput_2(
PT_bsf_reduceElem_T_2* reduceResult,
int reduceCounter,
PT_bsf_parameter_T parameter,
double t
);
void PC_bsf_ProblemOutput_3(
PT_bsf_reduceElem_T_3* reduceResult,
int reduceCounter,
PT_bsf_parameter_T parameter,
double t
);
void PC_bsf_ProcessResults(
PT_bsf_reduceElem_T* reduceResult,
int reduceCounter,
PT_bsf_parameter_T* parameter,
int* nextJob,
bool* exit
);
void PC_bsf_ProcessResults_1(
PT_bsf_reduceElem_T_1* reduceResult,
int reduceCounter,
PT_bsf_parameter_T* parameter,
int* nextJob,
bool* exit
);
void PC_bsf_ProcessResults_2(
PT_bsf_reduceElem_T_2* reduceResult,
int reduceCounter,
PT_bsf_parameter_T* parameter,
int* nextJob,
bool* exit
);
void PC_bsf_ProcessResults_3(
PT_bsf_reduceElem_T_3* reduceResult,
int reduceCounter,
PT_bsf_parameter_T* parameter,
int* nextJob,
bool* exit
);
void PC_bsf_ReduceF(
PT_bsf_reduceElem_T* x,
PT_bsf_reduceElem_T* y,
PT_bsf_reduceElem_T* z
);
void PC_bsf_ReduceF_1(
PT_bsf_reduceElem_T_1* x,
PT_bsf_reduceElem_T_1* y,
PT_bsf_reduceElem_T_1* z
);
void PC_bsf_ReduceF_2(
PT_bsf_reduceElem_T_2* x,
PT_bsf_reduceElem_T_2* y,
PT_bsf_reduceElem_T_2* z
);
void PC_bsf_ReduceF_3(
PT_bsf_reduceElem_T_3* x,
PT_bsf_reduceElem_T_3* y,
PT_bsf_reduceElem_T_3* z
);
void PC_bsf_SetListSize(
int* listSize
);
void PC_bsf_SetInitParameter(
PT_bsf_parameter_T* parameter
);
void PC_bsf_SetMapListElem(
PT_bsf_mapElem_T* elem,
int i
);