# HG changeset patch
# User Sascha L. Teichmann <teichmann@intevation.de>
# Date 1571502857 -7200
# Node ID c93c8a837af8dd0e3821fc417fc16bd696c5c465
# Parent  a5ff1bbac4dce092e60dd8989c5e688a95a08b25
Removed unused code that interplolated height levels between class breaks.

diff -r a5ff1bbac4dc -r c93c8a837af8 pkg/controllers/diff.go
--- a/pkg/controllers/diff.go	Sat Oct 19 18:13:56 2019 +0200
+++ b/pkg/controllers/diff.go	Sat Oct 19 18:34:17 2019 +0200
@@ -278,7 +278,6 @@
 		heights = octree.SampleDiffHeights(tin.Min.Z, tin.Max.Z, contourStep)
 	} else {
 		heights = octree.ExtrapolateClassBreaks(heights, tin.Min.Z, tin.Max.Z)
-		// heights = octree.InBetweenClassBreaks(heights, 0.05, 2)
 	}
 
 	log.Printf("info: z range: %.3f - %.3f\n", tin.Min.Z, tin.Max.Z)
diff -r a5ff1bbac4dc -r c93c8a837af8 pkg/imports/sr.go
--- a/pkg/imports/sr.go	Sat Oct 19 18:13:56 2019 +0200
+++ b/pkg/imports/sr.go	Sat Oct 19 18:34:17 2019 +0200
@@ -864,12 +864,6 @@
 		}
 	} else {
 		heights = octree.ExtrapolateClassBreaks(heights, minZ, maxZ)
-		// We set steps for InBetweenClassBreaks to 1, so it
-		// becomes a null operation.  The extra class breaks
-		// were considered unexpected and confusing by the
-		// users.  Once we get filled polygones the visual will
-		// be considerably different anyway. -- sw
-		// heights = octree.InBetweenClassBreaks(heights, 0.05, 1)
 	}
 
 	/*
diff -r a5ff1bbac4dc -r c93c8a837af8 pkg/octree/classbreaks.go
--- a/pkg/octree/classbreaks.go	Sat Oct 19 18:13:56 2019 +0200
+++ b/pkg/octree/classbreaks.go	Sat Oct 19 18:34:17 2019 +0200
@@ -148,35 +148,3 @@
 
 	return n
 }
-
-func InBetweenClassBreaks(cbs []float64, min float64, steps int) []float64 {
-	if len(cbs) < 2 || steps < 2 {
-		return cbs
-	}
-
-	out := make([]float64, 1, len(cbs)*steps)
-
-	out[0] = cbs[0]
-
-	_1steps := 1 / float64(steps)
-
-	for i := 1; i < len(cbs); i++ {
-		last, curr := cbs[i-1], cbs[i]
-
-		// Gap already too small -> proceed with next gap.
-		diff := curr - last
-		if math.Abs(diff) < min {
-			out = append(out, curr)
-			continue
-		}
-
-		delta := diff * _1steps
-		for p := last + delta; p < curr; p += delta {
-			out = append(out, p)
-		}
-
-		out = append(out, curr)
-	}
-
-	return out
-}