-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathgranges_sort.go
81 lines (70 loc) · 2.02 KB
/
granges_sort.go
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
/* Copyright (C) 2021 Philipp Benner
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
package gonetics
/* -------------------------------------------------------------------------- */
//import "fmt"
/* -------------------------------------------------------------------------- */
type grangesSort struct {
GRanges
indices []int
}
/* -------------------------------------------------------------------------- */
func newGRangesSort(g GRanges) grangesSort {
indices := make([]int, g.Length())
for i := 0; i < len(indices); i++ {
indices[i] = i
}
return grangesSort{g, indices}
}
/* -------------------------------------------------------------------------- */
func (r grangesSort) Len() int {
return r.Length()
}
func (r grangesSort) Less(i, j int) bool {
si := r.Seqnames[r.indices[i]]
sj := r.Seqnames[r.indices[j]]
li := len(si)
lj := len(sj)
if li < lj {
return true
} else
if li > lj {
return false
} else {
if si < sj {
return true
} else
if si > sj {
return false
} else {
fi := r.Ranges[r.indices[i]].From
fj := r.Ranges[r.indices[j]].From
if fi < fj {
return true
} else
if fi > fj {
return false
} else {
ti := r.Ranges[r.indices[i]].To
tj := r.Ranges[r.indices[j]].To
return ti < tj
}
}
}
}
func (r grangesSort) Swap(i, j int) {
r.indices[i], r.indices[j] = r.indices[j], r.indices[i]
}