@@ -86,7 +86,7 @@ predecessorInFm m successor
8686 then predecessorOfOneFirstInFm m
8787 else
8888 let refPoint = ceiling (toRational (numerator successor * m) / toRational (denominator successor))
89- in getNumeratorAndReturnPredecesssor (findNumeratorOfPredecessor (refPoint - numerator successor, refPoint - 1 ) successor) successor
89+ in getNumeratorAndReturnPredecessor (findNumeratorOfPredecessor (refPoint - numerator successor, refPoint - 1 ) successor) successor
9090
9191successorInFm :: Integer -> Rational -> Rational
9292-- See Lemma 2.9(ii) and Table 2.3 of the monograph. Call for instance:
@@ -120,10 +120,10 @@ predecessorInFml m l successor
120120 then predecessorOfOneFirstInFml m l
121121 else
122122 if numerator successor * m - denominator successor * l >= 1
123- then getNumeratorAndReturnPredecesssor (findNumeratorOfPredecessor (l - numerator successor + 1 , l) successor) successor
123+ then getNumeratorAndReturnPredecessor (findNumeratorOfPredecessor (l - numerator successor + 1 , l) successor) successor
124124 else
125125 let refPoint = ceiling (toRational (numerator successor * m) / toRational (denominator successor))
126- in getNumeratorAndReturnPredecesssor (findNumeratorOfPredecessor (refPoint - numerator successor, refPoint - 1 ) successor) successor
126+ in getNumeratorAndReturnPredecessor (findNumeratorOfPredecessor (refPoint - numerator successor, refPoint - 1 ) successor) successor
127127
128128successorInFml :: Integer -> Integer -> Rational -> Rational
129129-- See Lemma 2.13(ii)(a)-(b) and Table 2.3 of the monograph. Call for instance:
@@ -164,10 +164,10 @@ predecessorInGml m l successor
164164 if numerator successor * m - denominator successor * l >= 1
165165 then
166166 let refPoint = ceiling (toRational (numerator successor * m) / toRational (denominator successor))
167- in getNumeratorAndReturnPredecesssor (findNumeratorOfPredecessor (refPoint - numerator successor, refPoint - 1 ) successor) successor
167+ in getNumeratorAndReturnPredecessor (findNumeratorOfPredecessor (refPoint - numerator successor, refPoint - 1 ) successor) successor
168168 else
169169 let refPoint = ceiling (toRational (numerator successor * (m - l)) / toRational (denominator successor - numerator successor))
170- in getNumeratorAndReturnPredecesssor (findNumeratorOfPredecessor (refPoint - numerator successor, refPoint - 1 ) successor) successor
170+ in getNumeratorAndReturnPredecessor (findNumeratorOfPredecessor (refPoint - numerator successor, refPoint - 1 ) successor) successor
171171
172172successorInGml :: Integer -> Integer -> Rational -> Rational
173173-- See Lemma 2.15(ii)(a)-(b) and Table 2.3 of the monograph. Call for instance:
@@ -214,10 +214,10 @@ predecessorInFB2mm m successor
214214 | successor == 1 % 3 -> predecessorOfOneThirdInFB2mm m
215215 | otherwise ->
216216 if successor > 1 % 2
217- then getNumeratorAndReturnPredecesssor (findNumeratorOfPredecessor (m - numerator successor + 1 , m) successor) successor
217+ then getNumeratorAndReturnPredecessor (findNumeratorOfPredecessor (m - numerator successor + 1 , m) successor) successor
218218 else
219219 let refPoint = ceiling (toRational (numerator successor * m) / toRational (denominator successor - numerator successor))
220- in getNumeratorAndReturnPredecesssor (findNumeratorOfPredecessor (refPoint - numerator successor, refPoint - 1 ) successor) successor
220+ in getNumeratorAndReturnPredecessor (findNumeratorOfPredecessor (refPoint - numerator successor, refPoint - 1 ) successor) successor
221221
222222successorInFB2mm :: Integer -> Rational -> Rational
223223-- See Renark 1.17 and Table 1.5;
@@ -273,19 +273,19 @@ predecessorInFBnm n m successor
273273 if n < 2 * m
274274 then
275275 ( if (successor > 1 % 2 ) && (numerator successor * n - denominator successor * m >= 1 )
276- then getNumeratorAndReturnPredecesssor (findNumeratorOfPredecessor (m - numerator successor + 1 , m) successor) successor
276+ then getNumeratorAndReturnPredecessor (findNumeratorOfPredecessor (m - numerator successor + 1 , m) successor) successor
277277 else
278278 ( let refPoint = ceiling (toRational (numerator successor * (n - m)) / toRational (denominator successor - numerator successor))
279- in getNumeratorAndReturnPredecesssor (findNumeratorOfPredecessor (refPoint - numerator successor, refPoint - 1 ) successor) successor
279+ in getNumeratorAndReturnPredecessor (findNumeratorOfPredecessor (refPoint - numerator successor, refPoint - 1 ) successor) successor
280280 )
281281 )
282282 else -- n > 2 * m
283283
284284 ( if (successor > 1 % 2 ) || ((numerator successor * n - denominator successor * m) >= 1 )
285- then getNumeratorAndReturnPredecesssor (findNumeratorOfPredecessor (m - numerator successor + 1 , m) successor) successor
285+ then getNumeratorAndReturnPredecessor (findNumeratorOfPredecessor (m - numerator successor + 1 , m) successor) successor
286286 else
287287 ( let refPoint = ceiling (toRational (numerator successor * (n - m)) / toRational (denominator successor - numerator successor))
288- in getNumeratorAndReturnPredecesssor (findNumeratorOfPredecessor (refPoint - numerator successor, refPoint - 1 ) successor) successor
288+ in getNumeratorAndReturnPredecessor (findNumeratorOfPredecessor (refPoint - numerator successor, refPoint - 1 ) successor) successor
289289 )
290290 )
291291
@@ -332,8 +332,8 @@ successorInFBnm n m predecessor
332332 )
333333 )
334334
335- getNumeratorAndReturnPredecesssor :: Integer -> Rational -> Rational
336- getNumeratorAndReturnPredecesssor a successor = a % ((denominator successor * a + 1 ) `div` numerator successor)
335+ getNumeratorAndReturnPredecessor :: Integer -> Rational -> Rational
336+ getNumeratorAndReturnPredecessor a successor = a % ((denominator successor * a + 1 ) `div` numerator successor)
337337
338338getNumeratorAndReturnSuccessor :: Integer -> Rational -> Rational
339339getNumeratorAndReturnSuccessor a predecessor = a % ((denominator predecessor * a - 1 ) `div` numerator predecessor)
0 commit comments