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
//
// GENERATED FILE
//
use super::*;
use crate::SpiceContext;
use f2rust_std::*;
pub const LBCELL: i32 = -5;
/// Element of an integer set
///
/// Determine whether an item is an element of an integer set.
///
/// # Required Reading
///
/// * [SETS](crate::required_reading::sets)
///
/// # Brief I/O
///
/// ```text
/// VARIABLE I/O DESCRIPTION
/// -------- --- --------------------------------------------------
/// ITEM I Item to be tested.
/// A I Set to be tested.
///
/// The function returns .TRUE. if ITEM is an element of set A.
/// ```
///
/// # Detailed Input
///
/// ```text
/// ITEM is an item which may or may not be an element of
/// the input set.
///
/// A is a SPICE set.
/// ```
///
/// # Detailed Output
///
/// ```text
/// The function returns .TRUE. if ITEM is a member of the set A,
/// and returns .FALSE. otherwise.
/// ```
///
/// # Particulars
///
/// ```text
/// The LOGICAL functions ELEMC, ELEMD and ELEMI correspond to the
/// set operator IN in the Pascal language.
///
/// This routine uses a binary search to check for the presence in
/// the set of the specified ITEM.
/// ```
///
/// # Examples
///
/// ```text
/// The numerical results shown for this example may differ across
/// platforms. The results depend on the SPICE kernels used as
/// input, the compiler and supporting libraries, and the machine
/// specific arithmetic implementation.
///
/// 1) Check if the elements of a list of integers belong to a given
/// integer set.
///
///
/// Example code begins here.
///
///
/// PROGRAM ELEMI_EX1
/// IMPLICIT NONE
///
/// C
/// C SPICELIB functions.
/// C
/// LOGICAL ELEMI
///
/// C
/// C Local constants.
/// C
/// INTEGER LBCELL
/// PARAMETER ( LBCELL = -5 )
///
/// INTEGER LISTSZ
/// PARAMETER ( LISTSZ = 6 )
///
/// INTEGER SETDIM
/// PARAMETER ( SETDIM = 8 )
///
/// C
/// C Local variables.
/// C
/// INTEGER A ( LBCELL:SETDIM )
///
/// INTEGER I
/// INTEGER ITEMS ( LISTSZ )
///
/// C
/// C Set the values of the set and the list of integers.
/// C
/// DATA ( A(I), I=1,SETDIM) /
/// . -1, 0, 1, 1, 3, 5, 0, -3 /
///
/// DATA ITEMS / 6, -1, 0, 2, 3, -2 /
///
/// C
/// C Validate the set: Initialize the non-empty set, remove
/// C duplicates and sort the elements.
/// C
/// CALL VALIDI ( SETDIM, SETDIM, A )
///
/// C
/// C Check if the items in the list belong to the set.
/// C
/// DO I = 1, LISTSZ
///
/// IF ( ELEMI ( ITEMS(I), A ) ) THEN
///
/// WRITE(*,'(A,I4,A)') 'Item ', ITEMS(I),
/// . ' is in the set.'
///
/// ELSE
///
/// WRITE(*,'(A,I4,A)') 'Item ', ITEMS(I),
/// . ' is NOT in the set.'
///
/// END IF
///
/// END DO
///
/// END
///
///
/// When this program was executed on a Mac/Intel/gfortran/64-bit
/// platform, the output was:
///
///
/// Item 6 is NOT in the set.
/// Item -1 is in the set.
/// Item 0 is in the set.
/// Item 2 is NOT in the set.
/// Item 3 is in the set.
/// Item -2 is NOT in the set.
/// ```
///
/// # Author and Institution
///
/// ```text
/// N.J. Bachman (JPL)
/// C.A. Curzon (JPL)
/// J. Diaz del Rio (ODC Space)
/// H.A. Neilan (JPL)
/// W.L. Taber (JPL)
/// I.M. Underwood (JPL)
/// ```
///
/// # Version
///
/// ```text
/// - SPICELIB Version 1.2.0, 24-AUG-2021 (JDR)
///
/// Added IMPLICIT NONE statement.
///
/// Edited the header to comply with NAIF standard. Added complete
/// code example.
///
/// Removed unnecessary $Revisions section.
///
/// - SPICELIB Version 1.1.0, 17-MAY-1994 (HAN)
///
/// If the value of the function RETURN is .TRUE. upon execution of
/// this module, this function is assigned a default value of
/// either 0, 0.0D0, .FALSE., or blank depending on the type of
/// the function.
///
/// - SPICELIB Version 1.0.1, 10-MAR-1992 (WLT)
///
/// Comment section for permuted index source lines was added
/// following the header.
///
/// - SPICELIB Version 1.0.0, 31-JAN-1990 (CAC) (WLT) (IMU) (NJB)
/// ```
pub fn elemi(ctx: &mut SpiceContext, item: i32, a: &[i32]) -> crate::Result<bool> {
let ret = ELEMI(item, a, ctx.raw_context())?;
ctx.handle_errors()?;
Ok(ret)
}
//$Procedure ELEMI ( Element of an integer set )
pub fn ELEMI(ITEM: i32, A: &[i32], ctx: &mut Context) -> f2rust_std::Result<bool> {
let A = DummyArray::new(A, LBCELL..);
let mut ELEMI: bool = false;
//
// SPICELIB functions
//
//
// Standard error handling:
//
if RETURN(ctx) {
ELEMI = false;
return Ok(ELEMI);
} else {
CHKIN(b"ELEMI", ctx)?;
}
//
// Just a binary search.
//
ELEMI = (BSRCHI(ITEM, CARDI(A.as_slice(), ctx)?, A.subarray(1)) != 0);
CHKOUT(b"ELEMI", ctx)?;
Ok(ELEMI)
}