stale/intervals
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Added gaps testcases. Fixed calculateGaps function.

Browse Source
This commit is contained in:
Daniel Gil
2018-05-30 11:41:13 +02:00
parent 90c4e64922
commit 5128012518
6 changed files with 1163 additions and 21 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
merge.go
View File

@@ -1,6 +1,6 @@
package interval
import "github.com/labstack/gommon/log"
import "fmt"
func (intvls *intervals) Merge() []*Interval {
if intvls.MergeList == nil {
@@ -25,7 +25,7 @@ func (intvls *intervals) calculateMerged() []*Interval {
// convert if necessary exclusive low/high values into inclusive ones
low, high, err := intvls.getInclusives(intvl.Low, intvl.High)
if err != nil {
log.Errorf("calculateMerged - unable to get inclusives: %v", err)
fmt.Printf("calculateMerged - unable to get inclusives: %v", err)
continue
}
@@ -62,6 +62,14 @@ func (intvls *intervals) calculateMerged() []*Interval {
return list
}
func areSegmentsConsecutivesOrOverlapped(low, high, lastLow, lastHigh int) bool {
return areSegmentsOverlapped(low, high, lastLow, lastHigh) || areSegmentsConsecutives(low, high, lastLow, lastHigh)
}
func areSegmentsConsecutives(low, high, lastLow, lastHigh int) bool {
return ((lastHigh + 1) == low) || ((high + 1) == lastLow)
}
func areSegmentsOverlapped(low, high, lastLow, lastHigh int) bool {
if isLowInBetweenInclusive(low, high, lastLow, lastHigh) {
return true
@@ -71,11 +79,3 @@ func areSegmentsOverlapped(low, high, lastLow, lastHigh int) bool {
}
return false
}
func areSegmentsConsecutives(low, high, lastLow, lastHigh int) bool {
return ((lastHigh + 1) == low) || ((high + 1) == lastLow)
}
func areSegmentsConsecutivesOrOverlapped(low, high, lastLow, lastHigh int) bool {
return areSegmentsOverlapped(low, high, lastLow, lastHigh) || areSegmentsConsecutives(low, high, lastLow, lastHigh)
}