X-Git-Url: https://git.auder.net/?p=epclust.git;a=blobdiff_plain;f=pkg%2Ftests%2Ftestthat%2Ftest-computeSynchrones.R;fp=pkg%2Ftests%2Ftestthat%2Ftest-computeSynchrones.R;h=0a13aecbe92d2c85f653fa3d62e35ca115cdf07c;hp=0000000000000000000000000000000000000000;hb=e906736ea27105237e84c904dce6170353726292;hpb=57f337af19cd6251815bb1ff2d62f4c58e8b6078

diff --git a/pkg/tests/testthat/test-computeSynchrones.R b/pkg/tests/testthat/test-computeSynchrones.R
new file mode 100644
index 0000000..0a13aec
--- /dev/null
+++ b/pkg/tests/testthat/test-computeSynchrones.R
@@ -0,0 +1,37 @@
+context("computeSynchrones")
+
+test_that("computeSynchrones behave as expected",
+{
+	# Generate 300 sinusoïdal series of 3 kinds: all series of indices == 0 mod 3 are the same
+	# (plus noise), all series of indices == 1 mod 3 are the same (plus noise) ...
+	n <- 300
+	x <- seq(0,9.5,0.1)
+	L <- length(x) #96 1/4h
+	K <- 3
+	s1 <- cos(x)
+	s2 <- sin(x)
+	s3 <- c( s1[1:(L%/%2)] , s2[(L%/%2+1):L] )
+	#sum((s1-s2)^2) == 96
+	#sum((s1-s3)^2) == 58
+	#sum((s2-s3)^2) == 38
+	s <- list(s1, s2, s3)
+	series <- matrix(nrow=L, ncol=n)
+	for (i in seq_len(n))
+		series[,i] <- s[[I(i,K)]] + rnorm(L,sd=0.01)
+
+	getSeries <- function(indices) {
+		indices <- indices[indices <= n]
+		if (length(indices)>0) as.matrix(series[,indices]) else NULL
+	}
+
+	synchrones <- computeSynchrones(cbind(s1,s2,s3),getSeries,n,100,verbose=TRUE)
+
+	expect_equal(dim(synchrones), c(L,K))
+	for (i in 1:K)
+	{
+		# Synchrones are (for each medoid) sums of closest curves.
+		# Here, we expect exactly 100 curves of each kind to be assigned respectively to
+		# synchrone 1, 2 and 3 => division by 100 should be very close to the ref curve
+		expect_equal(synchrones[,i]/100, s[[i]], tolerance=0.01)
+	}
+})