68 lines
3.1 KiB
R
68 lines
3.1 KiB
R
|
#
|
||
|
# Licensed to the Apache Software Foundation (ASF) under one or more
|
||
|
# contributor license agreements. See the NOTICE file distributed with
|
||
|
# this work for additional information regarding copyright ownership.
|
||
|
# The ASF licenses this file to You under the Apache License, Version 2.0
|
||
|
# (the "License"); you may not use this file except in compliance with
|
||
|
# the License. You may obtain a copy of the License at
|
||
|
#
|
||
|
# http://www.apache.org/licenses/LICENSE-2.0
|
||
|
#
|
||
|
# Unless required by applicable law or agreed to in writing, software
|
||
|
# distributed under the License is distributed on an "AS IS" BASIS,
|
||
|
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||
|
# See the License for the specific language governing permissions and
|
||
|
# limitations under the License.
|
||
|
#
|
||
|
|
||
|
context("tests RDD function take()")
|
||
|
|
||
|
# Mock data
|
||
|
numVector <- c(-10:97)
|
||
|
numList <- list(sqrt(1), sqrt(2), sqrt(3), 4 ** 10)
|
||
|
strVector <- c("Dexter Morgan: I suppose I should be upset, even feel",
|
||
|
"violated, but I'm not. No, in fact, I think this is a friendly",
|
||
|
"message, like \"Hey, wanna play?\" and yes, I want to play. ",
|
||
|
"I really, really do.")
|
||
|
strList <- list("Dexter Morgan: Blood. Sometimes it sets my teeth on edge, ",
|
||
|
"other times it helps me control the chaos.",
|
||
|
"Dexter Morgan: Harry and Dorris Morgan did a wonderful job ",
|
||
|
"raising me. But they're both dead now. I didn't kill them. Honest.")
|
||
|
|
||
|
# JavaSparkContext handle
|
||
|
jsc <- sparkR.init()
|
||
|
|
||
|
test_that("take() gives back the original elements in correct count and order", {
|
||
|
numVectorRDD <- parallelize(jsc, numVector, 10)
|
||
|
# case: number of elements to take is less than the size of the first partition
|
||
|
expect_equal(take(numVectorRDD, 1), as.list(head(numVector, n = 1)))
|
||
|
# case: number of elements to take is the same as the size of the first partition
|
||
|
expect_equal(take(numVectorRDD, 11), as.list(head(numVector, n = 11)))
|
||
|
# case: number of elements to take is greater than all elements
|
||
|
expect_equal(take(numVectorRDD, length(numVector)), as.list(numVector))
|
||
|
expect_equal(take(numVectorRDD, length(numVector) + 1), as.list(numVector))
|
||
|
|
||
|
numListRDD <- parallelize(jsc, numList, 1)
|
||
|
numListRDD2 <- parallelize(jsc, numList, 4)
|
||
|
expect_equal(take(numListRDD, 3), take(numListRDD2, 3))
|
||
|
expect_equal(take(numListRDD, 5), take(numListRDD2, 5))
|
||
|
expect_equal(take(numListRDD, 1), as.list(head(numList, n = 1)))
|
||
|
expect_equal(take(numListRDD2, 999), numList)
|
||
|
|
||
|
strVectorRDD <- parallelize(jsc, strVector, 2)
|
||
|
strVectorRDD2 <- parallelize(jsc, strVector, 3)
|
||
|
expect_equal(take(strVectorRDD, 4), as.list(strVector))
|
||
|
expect_equal(take(strVectorRDD2, 2), as.list(head(strVector, n = 2)))
|
||
|
|
||
|
strListRDD <- parallelize(jsc, strList, 4)
|
||
|
strListRDD2 <- parallelize(jsc, strList, 1)
|
||
|
expect_equal(take(strListRDD, 3), as.list(head(strList, n = 3)))
|
||
|
expect_equal(take(strListRDD2, 1), as.list(head(strList, n = 1)))
|
||
|
|
||
|
expect_true(length(take(strListRDD, 0)) == 0)
|
||
|
expect_true(length(take(strVectorRDD, 0)) == 0)
|
||
|
expect_true(length(take(numListRDD, 0)) == 0)
|
||
|
expect_true(length(take(numVectorRDD, 0)) == 0)
|
||
|
})
|
||
|
|