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
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
//
// GENERATED FILE
//
use super::*;
use crate::SpiceContext;
use f2rust_std::*;
const MAXREC: i32 = 198;
const STATSZ: i32 = 6;
const SIZIDX: i32 = 1;
const BEGIDX: i32 = 2;
const STPIDX: i32 = 3;
const STAIDX: i32 = 4;
struct SaveVars {
LOCREC: StackArray<f64, 198>,
WORK: StackArray<f64, 198>,
}
impl SaveInit for SaveVars {
fn new() -> Self {
let mut LOCREC = StackArray::<f64, 198>::new(1..=MAXREC);
let mut WORK = StackArray::<f64, 198>::new(1..=MAXREC);
{
use f2rust_std::data::Val;
let mut clist = []
.into_iter()
.chain(std::iter::repeat_n(Val::D(0.0), MAXREC as usize))
.chain([]);
WORK.iter_mut()
.for_each(|n| *n = clist.next().unwrap().into_f64());
debug_assert!(clist.next().is_none(), "DATA not fully initialised");
}
Self { LOCREC, WORK }
}
}
/// S/P Kernel, evaluate, type 8
///
/// Evaluate a single SPK data record from a segment of type 8
/// (equally spaced discrete states, interpolated by Lagrange
/// polynomials).
///
/// # Required Reading
///
/// * [SPK](crate::required_reading::spk)
/// * [TIME](crate::required_reading::time)
///
/// # Brief I/O
///
/// ```text
/// VARIABLE I/O DESCRIPTION
/// -------- --- --------------------------------------------------
/// ET I Target epoch.
/// RECORD I Data record.
/// STATE O State (position and velocity).
/// ```
///
/// # Detailed Input
///
/// ```text
/// ET is a target epoch, at which a state vector is to
/// be computed.
///
/// RECORD is a data record which, when evaluated at epoch ET,
/// will give the state (position and velocity) of some
/// body, relative to some center, in some inertial
/// reference frame. Normally, the caller of this routine
/// will obtain RECORD by calling SPKR08.
///
/// The structure of the record is as follows:
///
/// +----------------------+
/// | number of states (n) |
/// +----------------------+
/// | start epoch |
/// +----------------------+
/// | step size |
/// +----------------------+
/// | state 1 (6 elts.) |
/// +----------------------+
/// | state 2 (6 elts.) |
/// +----------------------+
/// .
/// .
/// .
/// +----------------------+
/// | state n (6 elts.) |
/// +----------------------+
/// ```
///
/// # Detailed Output
///
/// ```text
/// STATE is the state. In order, the elements are
///
/// X, Y, Z, X', Y', and Z'
///
/// Units are km and km/sec.
/// ```
///
/// # Exceptions
///
/// ```text
/// 1) The caller of this routine must ensure that the input record
/// is appropriate for the supplied ET value. Otherwise,
/// arithmetic overflow may result.
/// ```
///
/// # Particulars
///
/// ```text
/// The exact format and structure of type 8 (equally spaced discrete
/// states, interpolated by Lagrange polynomials) segments are
/// described in the SPK Required Reading file.
/// ```
///
/// # Examples
///
/// ```text
/// The SPKEnn routines are almost always used in conjunction with
/// the corresponding SPKRnn routines, which read the records from
/// SPK files.
///
/// The data returned by the SPKRnn routine is in its rawest form,
/// taken directly from the segment. As such, it will be meaningless
/// to a user unless he/she understands the structure of the data type
/// completely. Given that understanding, however, the SPKRnn
/// routines might be used to examine raw segment data before
/// evaluating it with the SPKEnn routines.
///
///
/// C
/// C Get a segment applicable to a specified body and epoch.
/// C
/// CALL SPKSFS ( BODY, ET, HANDLE, DESCR, IDENT, FOUND )
///
/// C
/// C Look at parts of the descriptor.
/// C
/// CALL DAFUS ( DESCR, 2, 6, DCD, ICD )
/// CENTER = ICD( 2 )
/// REF = ICD( 3 )
/// TYPE = ICD( 4 )
///
/// IF ( TYPE .EQ. 8 ) THEN
///
/// CALL SPKR08 ( HANDLE, DESCR, ET, RECORD )
/// .
/// . Look at the RECORD data.
/// .
/// CALL SPKE08 ( ET, RECORD, STATE )
/// .
/// . Check out the evaluated state.
/// .
/// END IF
/// ```
///
/// # Author and Institution
///
/// ```text
/// N.J. Bachman (JPL)
/// J. Diaz del Rio (ODC Space)
/// ```
///
/// # Version
///
/// ```text
/// - SPICELIB Version 2.0.1, 12-AUG-2021 (JDR)
///
/// Edited the header to comply with NAIF standard.
///
/// - SPICELIB Version 2.0.0, 10-DEC-2013 (NJB)
///
/// RECORD is now strictly an input; it is not overwritten by this
/// routine. Formerly RECORD was used as a workspace array.
///
/// - SPICELIB Version 1.1.0, 25-AUG-2005 (NJB)
///
/// Updated to remove non-standard use of duplicate arguments
/// in XPOSEG and LGRESP calls.
///
/// - SPICELIB Version 1.0.0, 14-AUG-1993 (NJB)
/// ```
///
/// # Revisions
///
/// ```text
/// - SPICELIB Version 1.1.0, 25-AUG-2005 (NJB)
///
/// Updated to remove non-standard use of duplicate arguments
/// in XPOSEG and LGRESP calls.
/// ```
pub fn spke08(
ctx: &mut SpiceContext,
et: f64,
record: &[f64],
state: &mut [f64; 6],
) -> crate::Result<()> {
SPKE08(et, record, state, ctx.raw_context())?;
ctx.handle_errors()?;
Ok(())
}
//$Procedure SPKE08 ( S/P Kernel, evaluate, type 8 )
pub fn SPKE08(
ET: f64,
RECORD: &[f64],
STATE: &mut [f64],
ctx: &mut Context,
) -> f2rust_std::Result<()> {
let save = ctx.get_vars::<SaveVars>();
let save = &mut *save.borrow_mut();
let RECORD = DummyArray::new(RECORD, 1..);
let mut STATE = DummyArrayMut::new(STATE, 1..=6);
let mut N: i32 = 0;
let mut YSTART: i32 = 0;
//
// SPICELIB functions
//
//
// Local parameters
//
//
// Size of a state vector:
//
//
// Indices of input record elements:
//
// -- size
// -- start epoch
// -- step size
// -- start of state information
//
//
// Local variables
//
//
// Saved values
//
// Save arrays to prevent stack overflow problems on some
// platforms.
//
//
// Initial values
//
//
// Initialize the workspace array to suppress compiler warnings.
//
//
// Use discovery check-in.
//
if RETURN(ctx) {
return Ok(());
}
//
// We'll transpose the state information in the input record
// so that contiguous pieces of it can be shoved directly into the
// interpolation routine LGRESP.
//
N = intrinsics::IDNINT(RECORD[SIZIDX]);
XPOSEG(
RECORD.subarray(STAIDX),
STATSZ,
N,
save.LOCREC.as_slice_mut(),
);
//
// We interpolate each state component in turn.
//
for I in 1..=STATSZ {
YSTART = (1 + ((I - 1) * N));
STATE[I] = LGRESP(
N,
RECORD[BEGIDX],
RECORD[STPIDX],
save.LOCREC.subarray(YSTART),
save.WORK.as_slice_mut(),
ET,
ctx,
)?;
}
Ok(())
}