Skip to content

Commit 68f4a5b

Browse files
committed
fix warnings
1 parent 45fb57e commit 68f4a5b

File tree

4 files changed

+25
-25
lines changed

4 files changed

+25
-25
lines changed

CommonTypes/RangeSets.fs

Lines changed: 20 additions & 20 deletions
Original file line numberDiff line numberDiff line change
@@ -195,11 +195,11 @@ let rec compareRanges (r1:Range<'v>) (r2:Range<'v>) =
195195
IntersectedRanges(Range_AB (a, x0.not.toRP), Range_AB (x0, b), Range_B_PI b.not.toLP)
196196
| Range_AB _, Range_NI_A _ -> compareRanges r2 r1
197197
| Range_AB _, Range_B_PI _ -> compareRanges r2 r1
198-
| Range_AB (A1,A2), Range_AB (B1,B2) ->
199-
let a1 = LPoint A1
200-
let b1 = LPoint B1
201-
let a2 = RPoint A2
202-
let b2 = RPoint B2
198+
| Range_AB (_A1,_A2), Range_AB (_B1,_B2) ->
199+
let a1 = LPoint _A1
200+
let b1 = LPoint _B1
201+
let a2 = RPoint _A2
202+
let b2 = RPoint _B2
203203
// case 1 : a1------a2 , condition a2 < b1, --> empty set
204204
// b1-----b2
205205
// case 2 : a1------a2
@@ -221,12 +221,12 @@ let rec compareRanges (r1:Range<'v>) (r2:Range<'v>) =
221221
// b1-----b2 , condition b2 < a1, --> empty set
222222

223223
if a2 < b1 then NonIntersectedRanges (r1, r2)
224-
elif a2 = b1 then IntersectedRanges(Range_AB (A1,A2.not), Range_AB (B1,A2), Range_AB (B1.not,B2))
225-
elif a1 <= b1 && a2 <= b2 then IntersectedRanges(Range_AB (A1,B1.not.toRP), Range_AB (B1,A2), Range_AB (A2.not.toLP,B2))
226-
elif a1 <= b1 && b2 <= a2 then IntersectedRanges(Range_AB (A1,B1.not.toRP), r2, Range_AB (B2.not.toLP,A2))
227-
elif b1 <= a1 && a2 <= b2 then IntersectedRanges(Range_AB (B1,A1.not.toRP), r1, Range_AB (A2.not.toLP,B2))
228-
elif b1 <= a1 && b2 <= a2 then IntersectedRanges(Range_AB (B1,A1.not.toRP), Range_AB(A1,B2), Range_AB (B2.not.toLP,A2))
229-
elif a1 = b2 then IntersectedRanges(Range_AB (B1,A1.not.toRP), Range_AB(A1,B2), Range_AB (B2.not.toLP,A2))
224+
elif a2 = b1 then IntersectedRanges(Range_AB (_A1,_A2.not), Range_AB (_B1,_A2), Range_AB (_B1.not,_B2))
225+
elif a1 <= b1 && a2 <= b2 then IntersectedRanges(Range_AB (_A1,_B1.not.toRP), Range_AB (_B1,_A2), Range_AB (_A2.not.toLP,_B2))
226+
elif a1 <= b1 && b2 <= a2 then IntersectedRanges(Range_AB (_A1,_B1.not.toRP), r2, Range_AB (_B2.not.toLP,_A2))
227+
elif b1 <= a1 && a2 <= b2 then IntersectedRanges(Range_AB (_B1,_A1.not.toRP), r1, Range_AB (_A2.not.toLP,_B2))
228+
elif b1 <= a1 && b2 <= a2 then IntersectedRanges(Range_AB (_B1,_A1.not.toRP), Range_AB(_A1,_B2), Range_AB (_B2.not.toLP,_A2))
229+
elif a1 = b2 then IntersectedRanges(Range_AB (_B1,_A1.not.toRP), Range_AB(_A1,_B2), Range_AB (_B2.not.toLP,_A2))
230230
else NonIntersectedRanges(r2,r1)
231231

232232

@@ -376,11 +376,11 @@ type Range<'v when 'v : comparison> with
376376
| V_LT -> One (this)
377377
| Range_AB _, Range_NI_A _ -> other.union this
378378
| Range_AB _, Range_B_PI _ -> other.union this
379-
| Range_AB (A1,A2), Range_AB (B1,B2) ->
380-
let a1 = LPoint A1
381-
let b1 = LPoint B1
382-
let a2 = RPoint A2
383-
let b2 = RPoint B2
379+
| Range_AB (_A1,_A2), Range_AB (_B1,_B2) ->
380+
let a1 = LPoint _A1
381+
let b1 = LPoint _B1
382+
let a2 = RPoint _A2
383+
let b2 = RPoint _B2
384384
// case 1 : a1------a2 , condition a2 < b1, --> empty set
385385
// b1-----b2
386386
// case 2 : a1------a2
@@ -402,12 +402,12 @@ type Range<'v when 'v : comparison> with
402402
// b1-----b2 , condition b2 < a1, --> empty set
403403

404404
if a2 < b1 then Two(this, other) // case 1
405-
elif a2 = b1 then One (Range_AB (A1,B2)) // case 2
406-
elif a1 <= b1 && a2 <= b2 then One (Range_AB (A1,B2)) // case 3
405+
elif a2 = b1 then One (Range_AB (_A1,_B2)) // case 2
406+
elif a1 <= b1 && a2 <= b2 then One (Range_AB (_A1,_B2)) // case 3
407407
elif a1 <= b1 && b2 <= a2 then One (this) // case 4
408408
elif b1 <= a1 && a2 <= b2 then One (other) // case 5
409-
elif b1 <= a1 && b2 <= a2 then One (Range_AB(B1,A2)) // case 6
410-
elif a1 = b2 then One (Range_AB(B1,A2)) // case 7
409+
elif b1 <= a1 && b2 <= a2 then One (Range_AB(_B1,_A2)) // case 6
410+
elif a1 = b2 then One (Range_AB(_B1,_A2)) // case 7
411411
else Two(other, this) // case 8
412412

413413
member this.isBefore other =

CommonTypes/SimpleSets.fs

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -251,9 +251,9 @@ let value_set_union s1 s2=
251251
| SsValues a , SsExceptValues b ->
252252
//Union (A, Complement(B)) = Complement (B -A)
253253
value_set_complement (value_set_difference (SsValues b) s1)
254-
| SsExceptValues B , SsValues A ->
254+
| SsExceptValues _B , SsValues _ ->
255255
//Union (Complement(B), A ) = Complement (B -A)
256-
value_set_complement (value_set_difference (SsValues B) s2)
256+
value_set_complement (value_set_difference (SsValues _B) s2)
257257

258258
type SsValueSet<'v when 'v : comparison> with
259259
member this.Complement = value_set_complement this

CommonTypes/ValueSets.fs

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -90,9 +90,9 @@ let value_set_union s1 s2=
9090
| SsValues a , SsExceptValues b ->
9191
//Union (A, Complement(B)) = Complement (B -A)
9292
value_set_complement (value_set_difference (SsValues b) s1)
93-
| SsExceptValues B , SsValues A ->
93+
| SsExceptValues _B , SsValues _ ->
9494
//Union (Complement(B), A ) = Complement (B -A)
95-
value_set_complement (value_set_difference (SsValues B) s2)
95+
value_set_complement (value_set_difference (SsValues _B) s2)
9696

9797
type ValueSet<'v when 'v : equality> with
9898
member this.complement = value_set_complement this

asn1scc/Program.fs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -124,7 +124,7 @@ let printVersion () =
124124
//let fvi = System.Diagnostics.FileVersionInfo.GetVersionInfo(assembly.Location);
125125
//let version = fvi.FileVersion;
126126

127-
let version = "4.6.0.17"
127+
let version = "4.6.0.18"
128128
printfn "asn1scc version %s\n" version
129129
()
130130

0 commit comments

Comments
 (0)