java 遍历dataset_Java Dataset.count方法代码示例

import org.apache.spark.sql.Dataset; //导入方法依赖的package包/类

/**

* Returns a new ValueSets instance that includes the given value sets.

*

* @param valueSets the value sets to add to the returned collection.

* @return a new ValueSets instance with the added value sets.

*/

public ValueSets withValueSets(Dataset valueSets) {

Dataset newMembers = getUrlAndVersions(valueSets);

// Ensure that there are no duplicates among the value sets

if (hasDuplicateUrlAndVersions(newMembers) || valueSets.count() != newMembers.count()) {

throw new IllegalArgumentException(

"Cannot add value sets having duplicate valueSetUri and valueSetVersion");

}

// The value set concepts will be stored in the values table for persistence, so we remove

// them from the individual value sets. This can be done most easily by setting concepts to an

// empty list.

Dataset withoutConcepts = valueSets.map((MapFunction) valueSet -> {

ValueSet valueSetWithoutConcepts = valueSet.copy();

List updatedInclusions = new ArrayList<>();

for (ConceptSetComponent inclusion: valueSet.getCompose().getInclude()) {

ConceptSetComponent inclusionWithoutConcepts = inclusion.copy();

inclusionWithoutConcepts.setConcept(new ArrayList<>());

updatedInclusions.add(inclusionWithoutConcepts);

}

valueSetWithoutConcepts.getCompose().setInclude(updatedInclusions);

return valueSetWithoutConcepts;

}, VALUE_SET_ENCODER);

Dataset newValues = valueSets.flatMap(ValueSets::expandValuesIterator, VALUE_ENCODER);

return withValueSets(withoutConcepts, newValues);

}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值