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
|
// Copyright ©2011-2012 The bíogo Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
package dp
// Sort DPHits on start position.
type starts Hits
func (s starts) Len() int {
return len(s)
}
func (s starts) Less(i, j int) bool {
return s[i].Abpos < s[j].Abpos
}
func (s starts) Swap(i, j int) {
s[i], s[j] = s[j], s[i]
}
// Sort DPHits on end position.
type ends Hits
func (e ends) Len() int {
return len(e)
}
func (e ends) Less(i, j int) bool {
return e[i].Aepos < e[j].Aepos
}
func (e ends) Swap(i, j int) {
e[i], e[j] = e[j], e[i]
}
|
