/** * @see org.apache.xerces.xni.NamespaceContext#getAllPrefixes() */ public Enumeration getAllPrefixes() { int count = 0; if (fPrefixes.length < (fNamespace.length/2)) { // resize prefix array String[] prefixes = new String[fNamespaceSize]; fPrefixes = prefixes; } String prefix = null; boolean unique = true; for (int i = 2; i < (fNamespaceSize-2); i += 2) { prefix = fNamespace[i + 2]; for (int k=0;k<count;k++){ if (fPrefixes[k]==prefix){ unique = false; break; } } if (unique){ fPrefixes[count++] = prefix; } unique = true; } return new Prefixes(fPrefixes, count); }
/** * @see org.apache.xerces.xni.NamespaceContext#getAllPrefixes() */ public Enumeration getAllPrefixes() { int count = 0; if (fPrefixes.length < (fNamespace.length/2)) { // resize prefix array String[] prefixes = new String[fNamespaceSize]; fPrefixes = prefixes; } String prefix = null; boolean unique = true; for (int i = 2; i < (fNamespaceSize-2); i += 2) { prefix = fNamespace[i + 2]; for (int k=0;k<count;k++){ if (fPrefixes[k]==prefix){ unique = false; break; } } if (unique){ fPrefixes[count++] = prefix; } unique = true; } return new Prefixes(fPrefixes, count); }
/** * @see org.apache.xerces.xni.NamespaceContext#getAllPrefixes() */ public Enumeration getAllPrefixes() { int count = 0; if (fPrefixes.length < (fNamespace.length/2)) { // resize prefix array String[] prefixes = new String[fNamespaceSize]; fPrefixes = prefixes; } String prefix = null; boolean unique = true; for (int i = 2; i < (fNamespaceSize-2); i += 2) { prefix = fNamespace[i + 2]; for (int k=0;k<count;k++){ if (fPrefixes[k]==prefix){ unique = false; break; } } if (unique){ fPrefixes[count++] = prefix; } unique = true; } return new Prefixes(fPrefixes, count); }
/** * @see org.apache.xerces.xni.NamespaceContext#getAllPrefixes() */ public Enumeration getAllPrefixes() { int count = 0; if (fPrefixes.length < (fNamespace.length/2)) { // resize prefix array String[] prefixes = new String[fNamespaceSize]; fPrefixes = prefixes; } String prefix = null; boolean unique = true; for (int i = 2; i < (fNamespaceSize-2); i += 2) { prefix = fNamespace[i + 2]; for (int k=0;k<count;k++){ if (fPrefixes[k]==prefix){ unique = false; break; } } if (unique){ fPrefixes[count++] = prefix; } unique = true; } return new Prefixes(fPrefixes, count); }
/** * @see org.apache.xerces.xni.NamespaceContext#getAllPrefixes() */ public Enumeration getAllPrefixes() { int count = 0; if (fPrefixes.length < (fNamespace.length/2)) { // resize prefix array String[] prefixes = new String[fNamespaceSize]; fPrefixes = prefixes; } String prefix = null; boolean unique = true; for (int i = 2; i < (fNamespaceSize-2); i += 2) { prefix = fNamespace[i + 2]; for (int k=0;k<count;k++){ if (fPrefixes[k]==prefix){ unique = false; break; } } if (unique){ fPrefixes[count++] = prefix; } unique = true; } return new Prefixes(fPrefixes, count); }
/** * @see org.apache.xerces.xni.NamespaceContext#getAllPrefixes() */ public Enumeration getAllPrefixes() { int count = 0; if (fPrefixes.length < (fNamespace.length/2)) { // resize prefix array String[] prefixes = new String[fNamespaceSize]; fPrefixes = prefixes; } String prefix = null; boolean unique = true; for (int i = 2; i < (fNamespaceSize-2); i += 2) { prefix = fNamespace[i + 2]; for (int k=0;k<count;k++){ if (fPrefixes[k]==prefix){ unique = false; break; } } if (unique){ fPrefixes[count++] = prefix; } unique = true; } return new Prefixes(fPrefixes, count); }
/** * @see org.apache.xerces.xni.NamespaceContext#getAllPrefixes() */ public Enumeration getAllPrefixes() { int count = 0; if (fPrefixes.length < (fNamespace.length/2)) { // resize prefix array String[] prefixes = new String[fNamespaceSize]; fPrefixes = prefixes; } String prefix = null; boolean unique = true; for (int i = 2; i < (fNamespaceSize-2); i += 2) { prefix = fNamespace[i + 2]; for (int k=0;k<count;k++){ if (fPrefixes[k]==prefix){ unique = false; break; } } if (unique){ fPrefixes[count++] = prefix; } unique = true; } return new Prefixes(fPrefixes, count); }
/** * @see org.apache.xerces.xni.NamespaceContext#getAllPrefixes() */ public Enumeration getAllPrefixes() { int count = 0; if (fPrefixes.length < (fNamespace.length/2)) { // resize prefix array String[] prefixes = new String[fNamespaceSize]; fPrefixes = prefixes; } String prefix = null; boolean unique = true; for (int i = 2; i < (fNamespaceSize-2); i += 2) { prefix = fNamespace[i + 2]; for (int k=0;k<count;k++){ if (fPrefixes[k]==prefix){ unique = false; break; } } if (unique){ fPrefixes[count++] = prefix; } unique = true; } return new Prefixes(fPrefixes, count); }
/** * @see org.apache.xerces.xni.NamespaceContext#getAllPrefixes() */ public Enumeration getAllPrefixes() { int count = 0; if (fPrefixes.length < (fNamespace.length/2)) { // resize prefix array String[] prefixes = new String[fNamespaceSize]; fPrefixes = prefixes; } String prefix = null; boolean unique = true; for (int i = 2; i < (fNamespaceSize-2); i += 2) { prefix = fNamespace[i + 2]; for (int k=0;k<count;k++){ if (fPrefixes[k]==prefix){ unique = false; break; } } if (unique){ fPrefixes[count++] = prefix; } unique = true; } return new Prefixes(fPrefixes, count); }
/** * @see org.apache.xerces.xni.NamespaceContext#getAllPrefixes() */ public Enumeration getAllPrefixes() { int count = 0; if (fPrefixes.length < (fNamespace.length/2)) { // resize prefix array String[] prefixes = new String[fNamespaceSize]; fPrefixes = prefixes; } String prefix = null; boolean unique = true; for (int i = 2; i < (fNamespaceSize-2); i += 2) { prefix = fNamespace[i + 2]; for (int k=0;k<count;k++){ if (fPrefixes[k]==prefix){ unique = false; break; } } if (unique){ fPrefixes[count++] = prefix; } unique = true; } return new Prefixes(fPrefixes, count); }
/** * @see org.apache.xerces.xni.NamespaceContext#getAllPrefixes() */ public Enumeration getAllPrefixes() { int count = 0; if (fPrefixes.length < (fNamespace.length/2)) { // resize prefix array String[] prefixes = new String[fNamespaceSize]; fPrefixes = prefixes; } String prefix = null; boolean unique = true; for (int i = 2; i < (fNamespaceSize-2); i += 2) { prefix = fNamespace[i + 2]; for (int k=0;k<count;k++){ if (fPrefixes[k]==prefix){ unique = false; break; } } if (unique){ fPrefixes[count++] = prefix; } unique = true; } return new Prefixes(fPrefixes, count); }