Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
/*
* 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.
*/
package org.apache.xerces.impl.xs.models;
import java.util.ArrayList;
import java.util.List;
import java.util.Vector;
import org.apache.xerces.impl.Constants;
import org.apache.xerces.impl.xs.SchemaSymbols;
import org.apache.xerces.impl.xs.SubstitutionGroupHandler;
import org.apache.xerces.impl.xs.XMLSchemaException;
import org.apache.xerces.impl.xs.XSConstraints;
import org.apache.xerces.impl.xs.XSElementDecl;
import org.apache.xerces.impl.xs.XSElementDeclHelper;
import org.apache.xerces.impl.xs.XSOpenContentDecl;
import org.apache.xerces.impl.xs.XSParticleDecl;
import org.apache.xerces.impl.xs.XSWildcardDecl;
import org.apache.xerces.xni.QName;
/**
* XSAll11CM implements XSCMValidator and handles <all>.
*
* @xerces.internal
*
* @author Khaled Noaman, IBM
* @version $Id: XS11AllCM.java 1155073 2011-08-08 20:02:50Z knoaman $
*/
public class XS11AllCM implements XSCMValidator, XS11CMRestriction.XS11CM {
//
// Constants
//
// start the content model: did not see any children
private static final short STATE_START = 0;
private static final short STATE_CHILD = 1;
private static final short STATE_SUFFIX = 2;
//
// Data
//
private final boolean fHasOptionalContent;
private final XSElementDecl fElements[];
private final XSWildcardDecl fWildcards[];
private final int fMinOccurs[], fMaxOccurs[];
private final int fNumElements, fNumTotal;
private final XSOpenContentDecl fOpenContent;
//
// Constructors
//
public XS11AllCM (boolean hasOptionalContent, int size, XSParticleDecl[] particles,
XSOpenContentDecl openContent) {
fHasOptionalContent = hasOptionalContent;
// Index 0 is not used.
int numE = 1;
for (int i = 0; i < size; i++) {
if (particles[i].fType == XSParticleDecl.PARTICLE_ELEMENT) {
numE++;
}
}
fNumElements = numE;
fNumTotal = size+1;
if (numE > 1) {
fElements = new XSElementDecl[numE];
}
else {
fElements = null;
}
if (fNumTotal > numE) {
fWildcards = new XSWildcardDecl[fNumTotal];
}
else {
fWildcards = null;
}
if (fNumTotal > 1) {
fMinOccurs = new int[fNumTotal];
fMaxOccurs = new int[fNumTotal];
}
else {
fMinOccurs = null;
fMaxOccurs = null;
}
int numW = numE;
numE = 1;
for (int i = 0; i < size; i++) {
XSParticleDecl particle = particles[i];
if (particle.fType == XSParticleDecl.PARTICLE_ELEMENT) {
fElements[numE] = (XSElementDecl)particle.fValue;
fMinOccurs[numE] = particle.fMinOccurs;
fMaxOccurs[numE] = particle.fMaxOccurs;
numE++;
}
else {
fWildcards[numW] = (XSWildcardDecl)particle.fValue;
fMinOccurs[numW] = particle.fMinOccurs;
fMaxOccurs[numW] = particle.fMaxOccurs;
numW++;
}
}
fOpenContent = openContent;
}
//
// XSCMValidator methods
//
/**
* This methods to be called on entering a first element whose type
* has this content model. It will return the initial state of the
* content model
*
* @return Start state of the content model
*/
public int[] startContentModel() {
int[] state = new int[fNumTotal];
for (int i = 0; i < fNumTotal; i++) {
state[i] = STATE_START;
}
return state;
}
// convenient method: when error occurs, to find a matching decl
// from the candidate elements.
Object findMatchingDecl(QName elementName, SubstitutionGroupHandler subGroupHandler) {
Object matchingDecl = findMatchingElemDecl(elementName, subGroupHandler);
if (matchingDecl != null) {
return matchingDecl;
}
for (int i = fNumElements; i < fNumTotal; i++) {
if (fWildcards[i].allowQName(elementName)) {
return fWildcards[i];
}
}
return null;
}
// convenient method: to find a matching element decl
public XSElementDecl findMatchingElemDecl(QName elementName, SubstitutionGroupHandler subGroupHandler) {
for (int i = 1; i < fNumElements; i++) {
final XSElementDecl matchingDecl = subGroupHandler.getMatchingElemDecl(elementName, fElements[i], Constants.SCHEMA_VERSION_1_1);
if (matchingDecl != null) {
return matchingDecl;
}
}
return null;
}
public boolean allowExpandedName(XSWildcardDecl wildcard,
QName curElem,
SubstitutionGroupHandler subGroupHandler,
XSElementDeclHelper eDeclHelper) {
if (wildcard.allowQName(curElem)) {
if (wildcard.fDisallowedSibling && findMatchingElemDecl(curElem, subGroupHandler) != null) {
return false;
}
if (wildcard.fDisallowedDefined && eDeclHelper.getGlobalElementDecl(curElem) != null) {
return false;
}
return true;
}
return false;
}
/**
* The method corresponds to one transition in the content model.
*
* @param elementName
* @param currentState Current state
* @return an element decl object
*/
public Object oneTransition (QName elementName, int[] currentState,
SubstitutionGroupHandler subGroupHandler, XSElementDeclHelper eDeclHelper) {
// error state
if (currentState[0] < 0) {
currentState[0] = XSCMValidator.SUBSEQUENT_ERROR;
return findMatchingDecl(elementName, subGroupHandler);
}
// open content - suffix mode
if (currentState[0] == STATE_SUFFIX) {
if (allowExpandedName(fOpenContent.fWildcard, elementName, subGroupHandler, eDeclHelper)) {
return fOpenContent;
}
else { // error
currentState[0] = XSCMValidator.FIRST_ERROR;
return findMatchingDecl(elementName, subGroupHandler);
}
}
// seen child
currentState[0] = STATE_CHILD;
for (int i = 1; i < fNumElements; i++) {
if (currentState[i] == fMaxOccurs[i]) {
continue;
}
Object matchingDecl = subGroupHandler.getMatchingElemDecl(elementName, fElements[i], Constants.SCHEMA_VERSION_1_1);
if (matchingDecl != null) {
// found the decl, mark this element as "seen".
++currentState[i];
return matchingDecl;
}
}
for (int i = fNumElements; i < fNumTotal; i++) {
if (currentState[i] == fMaxOccurs[i]) {
continue;
}
if (allowExpandedName(fWildcards[i], elementName, subGroupHandler, eDeclHelper)) {
// found the decl, mark this element as "seen".
++currentState[i];
return fWildcards[i];
}
}
// apply open content, if present
if (fOpenContent != null) {
if (fOpenContent.fMode == XSOpenContentDecl.MODE_SUFFIX) {
if (isFinal(currentState)) {
currentState[0] = STATE_SUFFIX;
}
else {
currentState[0] = XSCMValidator.FIRST_ERROR;
return findMatchingDecl(elementName, subGroupHandler);
}
}
if (allowExpandedName(fOpenContent.fWildcard, elementName, subGroupHandler, eDeclHelper)) {
//if (fOpenContent.fWildcard.allowQName(elementName)) {
return fOpenContent;
}
}
// couldn't find the decl, change to error state.
currentState[0] = XSCMValidator.FIRST_ERROR;
return findMatchingDecl(elementName, subGroupHandler);
}
/**
* The method indicates the end of list of children
*
* @param currentState Current state of the content model
* @return true if the last state was a valid final state
*/
public boolean endContentModel (int[] currentState) {
int state = currentState[0];
if (state == XSCMValidator.FIRST_ERROR || state == XSCMValidator.SUBSEQUENT_ERROR) {
return false;
}
return isFinal(currentState);
}
/**
* check whether this content violates UPA constraint.
*
* @param subGroupHandler the substitution group handler
* @param xsConstraints the XML Schema Constraint checker
* @return true if this content model contains other or list wildcard
*/
public boolean checkUniqueParticleAttribution(SubstitutionGroupHandler subGroupHandler, XSConstraints xsConstraints) throws XMLSchemaException {
// check whether there is conflict between any two leaves
for (int i = 1; i < fNumElements; i++) {
for (int j = i+1; j < fNumElements; j++) {
if (xsConstraints.overlapUPA(fElements[i], fElements[j], subGroupHandler)) {
// REVISIT: do we want to report all errors? or just one?
throw new XMLSchemaException("cos-nonambig", new Object[]{fElements[i].toString(),
fElements[j].toString()});
}
}
}
for (int i = fNumElements; i < fNumTotal; i++) {
for (int j = i+1; j < fNumTotal; j++) {
if (xsConstraints.overlapUPA(fWildcards[i], fWildcards[j])) {
// REVISIT: do we want to report all errors? or just one?
throw new XMLSchemaException("cos-nonambig", new Object[]{fWildcards[i].toString(),
fWildcards[j].toString()});
}
}
}
return false;
}
/**
* Check which elements are valid to appear at this point. This method also
* works if the state is in error, in which case it returns what should
* have been seen.
*
* @param state the current state
* @return a Vector whose entries are instances of
* either XSWildcardDecl or XSElementDecl.
*/
public Vector whatCanGoHere(int[] state) {
Vector ret = new Vector();
// handle element declarations
for (int i = 1; i < fNumElements; i++) {
// we only try to look for a matching decl if we have not seen
// this element yet or we have seen it less times than its maxOccurs.
if (state[i] == STATE_START || state[i] < fMaxOccurs[i]) {
ret.addElement(fElements[i]);
}
}
// only add wildcards if no element can be matched
if (ret.size() == 0) {
for (int i = fNumElements; i < fNumTotal; i++) {
if (state[i] == STATE_START || state[i] < fMaxOccurs[i]) {
ret.addElement(fWildcards[i]);
}
}
}
// if 'ret' is empty and we have an open content, add the open content to 'ret'
if (ret.size() == 0 && fOpenContent != null) {
ret.add(fOpenContent);
}
return ret;
}
public int [] occurenceInfo(int[] state) {
// REVISIT: maxOccurs > 1 is allowed by in XML Schema 1.1
return null;
}
public String getTermName(int termId) {
// REVISIT: maxOccurs > 1 is allowed by in XML Schema 1.1
return null;
}
public boolean isCompactedForUPA() {
return false;
}
private boolean isFinal(int[] currentState) {
// If has minOccurs of zero and there are
// no children to validate, it is trivially valid
//
// XML Schema 1.1
// reached final state and doing suffix validation against open content
if ((fHasOptionalContent && currentState[0] == STATE_START) || currentState[0] == STATE_SUFFIX) {
return true;
}
for (int i = 1; i < fNumTotal; i++) {
// if one element is required, but not present, then error
if (currentState[i] < fMinOccurs[i]) {
return false;
}
}
return true;
}
public XSElementDecl nextElementTransition(int[] s, int[] sn, int[] index) {
for (int idx = index[0] == -1 ? 1 : index[0] + 1; idx < fNumElements; idx++) {
if (isAllowedTransition(s, sn, idx)) {
index[0] = idx;
return fElements[idx];
}
}
index[0] = -1;
return null;
}
public XSWildcardDecl nextWildcardTransition(int[] s, int[] sn, int[] index) {
int idx = index[0] == -1 ? fNumElements : index[0] + 1;
for (; idx < fNumTotal; idx++) {
if (isAllowedTransition(s, sn, idx)) {
index[0] = idx;
return fWildcards[idx];
}
}
if (idx == fNumTotal && isOpenContentAllowed(s, sn)) {
index[0] = fNumTotal;
return fOpenContent.fWildcard;
}
index[0] = -1;
return null;
}
private boolean isAllowedTransition(int[] s, int[] sn, int index) {
// Already used suffix open content. Can't make any other transition.
if (s[0] == STATE_SUFFIX) {
return false;
}
// Already seen all allowed occurrences.
if (s[index] == fMaxOccurs[index]) {
return false;
}
// Allowed transition. Update next state.
if (sn != null) {
System.arraycopy(s, 0, sn, 0, s.length);
sn[0] = STATE_CHILD;
// Only increase count if meaningful. i.e. don't exceed minOccurs
// if max is unbounded.
if (sn[index] == 0 || sn[index] < fMinOccurs[index] || fMaxOccurs[index] != SchemaSymbols.OCCURRENCE_UNBOUNDED) {
sn[index]++;
}
}
return true;
}
private boolean isOpenContentAllowed(int[] s, int[] sn) {
if (fOpenContent == null) {
return false;
}
if (fOpenContent.fMode == XSOpenContentDecl.MODE_SUFFIX) {
// Suffix open content can only kick in on final states
if (isFinal(s)) {
sn[0] = STATE_SUFFIX;
return true;
}
return false;
}
// Interleave: keep old state
System.arraycopy(s, 0, sn, 0, s.length);
return true;
}
public boolean isOpenContent(XSWildcardDecl w) {
return fOpenContent != null && fOpenContent.fWildcard == w;
}
public List getDefinedNames(SubstitutionGroupHandler subGroupHandler) {
List ret = new ArrayList();
// Index starts at 1. Get names of all elements and their sub-groups
for (int i = 1; i < fNumElements; i++) {
XSElementDecl e = fElements[i];
ret.add(e.fTargetNamespace);
ret.add(e.fName);
if (e.fScope == XSElementDecl.SCOPE_GLOBAL) {
XSElementDecl[] es = subGroupHandler.getSubstitutionGroup(e, Constants.SCHEMA_VERSION_1_1);
for (int j = 0; j < es.length; j++) {
ret.add(es[j].fTargetNamespace);
ret.add(es[j].fName);
}
}
}
return ret;
}
public void optimizeStates(XS11CMRestriction.XS11CM base, int[] b, int[] d, int indexb) {
}
// Constructor only used by copy()
private XS11AllCM(boolean hasOptionalContent, XSElementDecl[] elements,
XSWildcardDecl[] wildcards, int[] minOccurs, int[] maxOccurs,
int numElements, int numTotal, XSOpenContentDecl openContent) {
super();
fHasOptionalContent = hasOptionalContent;
fElements = elements;
fWildcards = wildcards;
fMinOccurs = minOccurs;
fMaxOccurs = maxOccurs;
fNumElements = numElements;
fNumTotal = numTotal;
fOpenContent = openContent;
}
// Make a copy to be modified
XS11AllCM copy() {
int[] minOccurs, maxOccurs;
if (fNumTotal > 1) {
minOccurs = new int[fNumTotal];
maxOccurs = new int[fNumTotal];
System.arraycopy(fMinOccurs, 0, minOccurs, 0, fNumTotal);
System.arraycopy(fMaxOccurs, 0, maxOccurs, 0, fNumTotal);
}
else {
minOccurs = null;
maxOccurs = null;
}
return new XS11AllCM(fHasOptionalContent, fElements,
fWildcards, minOccurs, maxOccurs,
fNumElements, fNumTotal, fOpenContent);
}
// Collect occurrence information as the derived content model.
// Add min/maxOccurs of the specified derived element to the entry
// for its corresponding base element
void collectOccurs(int[] min, int[] max, int b, int d) {
min[b] += fMinOccurs[d];
if (max[b] != SchemaSymbols.OCCURRENCE_UNBOUNDED) {
if (fMaxOccurs[d] == SchemaSymbols.OCCURRENCE_UNBOUNDED) {
max[b] = SchemaSymbols.OCCURRENCE_UNBOUNDED;
}
else {
max[b] += fMaxOccurs[d];
}
}
}
// Attempt to reduce min/maxOccurs from the base content model.
boolean removeAsBase(int[] min, int[] max, int[] used) {
for (int i = 1; i < fNumElements; i++) {
// Base has more minOccurs, can't be satisfied by derived. Error.
if (fMinOccurs[i] > min[i]) {
return false;
}
// Min in base is no long significant.
fMinOccurs[i] = 0;
// 2 cases. a) If base matches a single derived, then it's OK
// for derived to have bigger maxOccurs. Reduce both to make max
// in base 0. b) If base matches more than 1 derived, then it has
// to have big enough maxOccurs to cover all derived elements,
// otherwise we can't decide which derived to consume first.
// max of the base will be whatever is left, because it's possible
// for it to match derived wildcard.
if (fMaxOccurs[i] != SchemaSymbols.OCCURRENCE_UNBOUNDED) {
if (max[i] == SchemaSymbols.OCCURRENCE_UNBOUNDED ||
fMaxOccurs[i] < max[i]) {
// Base doesn't have sufficient maxOccurs
if (used[i] > 1) {
// Not OK if there are more than one derived.
// Mark base as not usable.
used[i] = -1;
continue;
}
// OK if there is only one derived. #a case above.
// Base becomes 0; derived is subtracted.
if (max[i] != SchemaSymbols.OCCURRENCE_UNBOUNDED) {
max[i] -= fMaxOccurs[i];
}
fMaxOccurs[i] = 0;
}
else {
// Base has sufficient maxOccurs. Subtract from base and
// make derived 0.
fMaxOccurs[i] -= max[i];
max[i] = 0;
}
}
else {
// Base has sufficient maxOccurs = unbounded.
if (max[i] == SchemaSymbols.OCCURRENCE_UNBOUNDED) {
// If derived is also unbounded, make both 0
fMaxOccurs[i] = 0;
}
max[i] = 0;
}
}
return true;
}
// Attempt to reduce min/maxOccurs from the derived content model.
void removeAsDerived(int[] max, int[] used, int[] match) {
for (int i = 1; i < fNumElements; i++) {
int b = match[i];
// Only if the derived element has a base match that's usable
if (b < 0 || used[b] < 0) {
continue;
}
// min must have been satisfied. Max is 0 for 1-many matches.
// max can only be >0 for 1-1 match.
fMinOccurs[i] = 0;
fMaxOccurs[i] = max[b];
}
}
int minOccurs(int index) {
return fMinOccurs[index];
}
int maxOccurs(int index) {
return fMaxOccurs[index];
}
boolean isUnbounded(int index) {
return index < fNumTotal ? fMaxOccurs[index] == SchemaSymbols.OCCURRENCE_UNBOUNDED : true;
}
boolean hasOptionalContent() {
return fHasOptionalContent;
}
int totalMin() {
int ret = 0;
for (int i = 1; i < fNumTotal; i++) {
ret += fMinOccurs[i];
}
return ret;
}
int min(int i) {
return fMinOccurs[i];
}
XSOpenContentDecl getOpenContent() {
return fOpenContent;
}
// Called to know the size of the state machine if this is viewed as DFA
int calOccurs() {
long ret = 1;
for (int i = 1; i < fNumTotal; i++) {
// Multiply all maxOccurs. If max is unbounded, then use min.
int occ = fMaxOccurs[i];
if (occ == 0) {
continue;
}
if (occ == SchemaSymbols.OCCURRENCE_UNBOUNDED) {
occ = fMinOccurs[i] == 0 ? 1 : fMinOccurs[i];
}
ret *= occ + 1;
if (ret > Integer.MAX_VALUE) {
return -1;
}
}
return (int)ret;
}
} // class XSAll11CM
