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
//
// GENERATED FILE
//
use super::*;
use crate::SpiceContext;
use f2rust_std::*;
/// Is a number odd?
///
/// Determine whether an integer is odd.
///
/// # Brief I/O
///
/// ```text
/// VARIABLE I/O DESCRIPTION
/// -------- --- --------------------------------------------------
/// IVAL I The integer in question.
///
/// The function returns .TRUE. if IVAL is odd, otherwise .FALSE.
/// ```
///
/// # Detailed Input
///
/// ```text
/// IVAL is the integer to be tested for oddness.
/// ```
///
/// # Detailed Output
///
/// ```text
/// The function returns .TRUE. if IVAL is odd, .FALSE. if IVAL is
/// even.
/// ```
///
/// # Exceptions
///
/// ```text
/// Error free.
/// ```
///
/// # Particulars
///
/// ```text
/// Divide IVAL by two. If the remainder is one, IVAL is odd.
/// ```
///
/// # Examples
///
/// ```text
/// Let ENDPTS contain a series of endpoints,
///
/// a , b , ..., a , b
/// 1 1 n n
///
/// representing an ordered collection of disjoint intervals,
///
/// a < b < a
/// i - i i+1
///
/// The following code fragment uses ODD to determine whether
/// an arbitrary value X is contained in any of the intervals.
///
/// CONTAINED = .FALSE.
///
/// DO I = 1, N-1
/// IF ( X .GE. ENDPTS(I) .AND. X .LE. ENDPTS(I+1) ) THEN
/// CONTAINED = ( ODD ( I ) )
/// END IF
/// END DO
/// ```
///
/// # Author and Institution
///
/// ```text
/// J. Diaz del Rio (ODC Space)
/// B.V. Semenov (JPL)
/// W.L. Taber (JPL)
/// I.M. Underwood (JPL)
/// ```
///
/// # Version
///
/// ```text
/// - SPICELIB Version 1.1.0, 08-APR-2021 (JDR)
///
/// Added IMPLICIT NONE statement.
///
/// Changed the input argument name "I" to "IVAL" for consistency
/// with other routines.
///
/// Edited the header to comply with NAIF standard. Removed
/// unnecessary $Revisions section.
///
/// - SPICELIB Version 1.0.2, 07-NOV-2005 (BVS)
///
/// Fixed a few typos in the header.
///
/// - 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 (IMU)
/// ```
pub fn odd(ival: i32) -> bool {
let ret = ODD(ival);
ret
}
//$Procedure ODD ( Is a number odd? )
pub fn ODD(IVAL: i32) -> bool {
let mut ODD: bool = false;
//
// Self-explanatory.
//
ODD = (intrinsics::MOD(IVAL, 2) != 0);
ODD
}