/** * Check if this object node is required by occurrences * and path of nodes for which values are submitted * * @param paths a set of path of nodes for which values submitted * @return ture if this node is required */ public boolean isRequired(Set<String> paths) { if (isRequired()) { return true; } // if any submitted value for descendant nodes for (String path : paths) { if (path.startsWith(path())) { return true; } } return false; }
/** * Check if this object node is required by occurrences * and path of nodes for which values are submitted * * @param paths a set of path of nodes for which values submitted * @return ture if this node is required */ public boolean isRequired(Set<String> paths) { if (isRequired()) { return true; } // if any submitted value for descendant nodes for (String path : paths) { if (path.startsWith(path())) { return true; } } return false; }
for(CObject cobj : children) { log.debug("looping children, required: " + cobj.isRequired()); || GenerationStrategy.MAXIMUM_EMPTY.equals(strategy) || (GenerationStrategy.MINIMUM.equals(strategy) && cobj.isRequired()))) {
&& node.isRequired(), ref.path()+atpart, ref.getTargetPath()); loadInternalRefs(child, required && node.isRequired() && attribute.isRequired(), refPath, baseTargetPath);
&& node.isRequired(), ref.path()+atpart, ref.getTargetPath()); loadInternalRefs(child, required && node.isRequired() && attribute.isRequired(), refPath, baseTargetPath);
loadMaps(child, required && node.isRequired() && attribute.isRequired());
loadMaps(child, required && node.isRequired() && attribute.isRequired());
return false; if (c1.isRequired() != c2.isRequired()) { return false;