SimpleContentModelpublic class SimpleContentModel extends Object implements ContentModelValidator
Fields Summary |
---|
public static final short | CHOICECHOICE | public static final short | SEQUENCESEQUENCE | private QName | fFirstChildThe element decl pool indices of the first (and optional second)
child node. The operation code tells us whether the second child
is used or not. | private QName | fSecondChildThe element decl pool indices of the first (and optional second)
child node. The operation code tells us whether the second child
is used or not. | private int | fOperatorThe operation that this object represents. Since this class only
does simple contents, there is only ever a single operation
involved (i.e. the children of the operation are always one or
two leafs.) This is one of the XMLDTDParams.CONTENTSPECNODE_XXX values. |
Constructors Summary |
---|
public SimpleContentModel(short operator, QName firstChild, QName secondChild)Constructs a simple content model.
/* this is the EquivClassComparator object */
//private EquivClassComparator comparator = null;
//
// Constructors
//
//
// Store away the children and operation. This is all we need to
// do the content model check.
//
// The operation is one of the ContentSpecNode.NODE_XXX values!
//
fFirstChild.setValues(firstChild);
if (secondChild != null) {
fSecondChild.setValues(secondChild);
}
else {
fSecondChild.clear();
}
fOperator = operator;
|
Methods Summary |
---|
public int | validate(com.sun.org.apache.xerces.internal.xni.QName[] children, int offset, int length)Check that the specified content is valid according to this
content model. This method can also be called to do 'what if'
testing of content models just to see if they would be valid.
A value of -1 in the children array indicates a PCDATA node. All other
indexes will be positive and represent child elements. The count can be
zero, since some elements have the EMPTY content model and that must be
confirmed.
//
// According to the type of operation, we do the correct type of
// content check.
//
switch(fOperator)
{
case XMLContentSpec.CONTENTSPECNODE_LEAF :
// If there is not a child, then report an error at index 0
if (length == 0)
return 0;
// If the 0th child is not the right kind, report an error at 0
if (children[offset].rawname != fFirstChild.rawname) {
return 0;
}
// If more than one child, report an error at index 1
if (length > 1)
return 1;
break;
case XMLContentSpec.CONTENTSPECNODE_ZERO_OR_ONE :
//
// If there is one child, make sure its the right type. If not,
// then its an error at index 0.
//
if (length == 1) {
if (children[offset].rawname != fFirstChild.rawname) {
return 0;
}
}
//
// If the child count is greater than one, then obviously
// bad, so report an error at index 1.
//
if (length > 1)
return 1;
break;
case XMLContentSpec.CONTENTSPECNODE_ZERO_OR_MORE :
//
// If the child count is zero, that's fine. If its more than
// zero, then make sure that all children are of the element
// type that we stored. If not, report the index of the first
// failed one.
//
if (length > 0)
{
for (int index = 0; index < length; index++) {
if (children[offset + index].rawname != fFirstChild.rawname) {
return index;
}
}
}
break;
case XMLContentSpec.CONTENTSPECNODE_ONE_OR_MORE :
//
// If the child count is zero, that's an error so report
// an error at index 0.
//
if (length == 0)
return 0;
//
// Otherwise we have to check them all to make sure that they
// are of the correct child type. If not, then report the index
// of the first one that is not.
//
for (int index = 0; index < length; index++) {
if (children[offset + index].rawname != fFirstChild.rawname) {
return index;
}
}
break;
case XMLContentSpec.CONTENTSPECNODE_CHOICE :
//
// There must be one and only one child, so if the element count
// is zero, return an error at index 0.
//
if (length == 0)
return 0;
// If the zeroth element isn't one of our choices, error at 0
if ((children[offset].rawname != fFirstChild.rawname) &&
(children[offset].rawname != fSecondChild.rawname)) {
return 0;
}
// If there is more than one element, then an error at 1
if (length > 1)
return 1;
break;
case XMLContentSpec.CONTENTSPECNODE_SEQ :
//
// There must be two children and they must be the two values
// we stored, in the stored order.
//
if (length == 2) {
if (children[offset].rawname != fFirstChild.rawname) {
return 0;
}
if (children[offset + 1].rawname != fSecondChild.rawname) {
return 1;
}
}
else {
if (length > 2) {
return 2;
}
return length;
}
break;
default :
throw new RuntimeException("ImplementationMessages.VAL_CST");
}
// We survived, so return success status
return -1;
|
|