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.
/* This file is part of the OWL API.
* The contents of this file are subject to the LGPL License, Version 3.0.
* Copyright 2014, The University of Manchester
*
* This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.
* This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
* You should have received a copy of the GNU General Public License along with this program. If not, see http://www.gnu.org/licenses/.
*
* Alternatively, the contents of this file may be used under the terms of the Apache License, Version 2.0 in which case, the provisions of the Apache License Version 2.0 are applicable instead of those above.
* Licensed 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.semanticweb.owlapi.io;
import javax.annotation.Nonnull;
import javax.annotation.Nullable;
/**
* This class contains various methods for checking QNames, NCNames etc. The implementation is based
* on the W3C namespaces in XML specification.
*
* @author Matthew Horridge, The University of Manchester, Bio-Health Informatics Group
* @since 3.3.0
*/
public final class XMLUtils {
/** < shortcut. */
public static final String LT = "<";
/** > shortcut. */
public static final String GT = ">";
/** " shortcut. */
public static final String QUOT = """;
/** & shortcut. */
public static final String AMP = "&";
/** ' shortcut. */
public static final String APOS = "'";
// For some point in the future
/** OWL processing instruction. */
public static final String OWL_PROCESSING_INSTRUCTION_NAME = "owl";
private XMLUtils() {}
/**
* Determines if a character is an XML name start character.
*
* @param codePoint The code point of the character to be tested. For UTF-16 characters the code
* point corresponds to the value of the char that represents the character.
* @return {@code true} if {@code codePoint} is an XML name start character, otherwise
* {@code false}
*/
public static boolean isXMLNameStartCharacter(int codePoint) {
return codePoint == ':' || codePoint >= 'A' && codePoint <= 'Z' || codePoint == '_'
|| codePoint >= 'a' && codePoint <= 'z' || codePoint >= 0xC0 && codePoint <= 0xD6
|| codePoint >= 0xD8 && codePoint <= 0xF6 || codePoint >= 0xF8 && codePoint <= 0x2FF
|| codePoint >= 0x370 && codePoint <= 0x37D || codePoint >= 0x37F && codePoint <= 0x1FFF
|| codePoint >= 0x200C && codePoint <= 0x200D
|| codePoint >= 0x2070 && codePoint <= 0x218F
|| codePoint >= 0x2C00 && codePoint <= 0x2FEF
|| codePoint >= 0x3001 && codePoint <= 0xD7FF
|| codePoint >= 0xF900 && codePoint <= 0xFDCF
|| codePoint >= 0xFDF0 && codePoint <= 0xFFFD
|| codePoint >= 0x10000 && codePoint <= 0xEFFFF;
}
/**
* Determines if a character is an XML name character.
*
* @param codePoint The code point of the character to be tested. For UTF-8 and UTF-16
* characters the code point corresponds to the value of the char that represents the
* character.
* @return {@code true} if {@code codePoint} is an XML name start character, otherwise
* {@code false}
*/
public static boolean isXMLNameChar(int codePoint) {
return isXMLNameStartCharacter(codePoint) || codePoint == '-' || codePoint == '.'
|| codePoint >= '0' && codePoint <= '9' || codePoint == 0xB7
|| codePoint >= 0x0300 && codePoint <= 0x036F
|| codePoint >= 0x203F && codePoint <= 0x2040;
}
/**
* Determines if a character is an NCName (Non-Colonised Name) start character.
*
* @param codePoint The code point of the character to be tested. For UTF-8 and UTF-16
* characters the code point corresponds to the value of the char that represents the
* character.
* @return {@code true} if {@code codePoint} is a NCName start character, otherwise
* {@code false}.
*/
public static boolean isNCNameStartChar(int codePoint) {
return codePoint != ':' && isXMLNameStartCharacter(codePoint);
}
/**
* Determines if a character is an NCName (Non-Colonised Name) character.
*
* @param codePoint The code point of the character to be tested. For UTF-8 and UTF-16
* characters the code point corresponds to the value of the char that represents the
* character.
* @return {@code true} if {@code codePoint} is a NCName character, otherwise {@code false}.
*/
public static boolean isNCNameChar(int codePoint) {
return codePoint != ':' && isXMLNameChar(codePoint);
}
/**
* Determines if a character sequence is an NCName (Non-Colonised Name). An NCName is a string
* which starts with an NCName start character and is followed by zero or more NCName
* characters.
*
* @param s The character sequence to be tested.
* @return {@code true} if {@code s} is an NCName, otherwise {@code false}.
*/
public static boolean isNCName(CharSequence s) {
if (isNullOrEmpty(s)) {
return false;
}
int firstCodePoint = Character.codePointAt(s, 0);
if (!isNCNameStartChar(firstCodePoint)) {
return false;
}
for (int i = Character.charCount(firstCodePoint); i < s.length();) {
int codePoint = Character.codePointAt(s, i);
if (!isNCNameChar(codePoint)) {
return false;
}
i += Character.charCount(codePoint);
}
return true;
}
/**
* Determines if a character sequence is a QName. A QName is either an NCName (LocalName), or an
* NCName followed by a colon followed by another NCName (where the first NCName is referred to
* as the 'Prefix Name' and the second NCName is referred to as the 'Local Name' - i.e.
* PrefixName:LocalName).
*
* @param s The character sequence to be tested.
* @return {@code true} if {@code s} is a QName, otherwise {@code false}.
*/
public static boolean isQName(CharSequence s) {
return isQName(s, 0);
}
/**
* Determines if a character sequence is a QName. A QName is either an NCName (LocalName), or an
* NCName followed by a colon followed by another NCName (where the first NCName is referred to
* as the 'Prefix Name' and the second NCName is referred to as the 'Local Name' - i.e.
* PrefixName:LocalName).
*
* @param s The character sequence to be tested.
* @param start start index to check
* @return {@code true} if {@code s} is a QName, otherwise {@code false}.
*/
public static boolean isQName(CharSequence s, int start) {
if (isNullOrEmpty(s) || start >= s.length()) {
return false;
}
boolean foundColon = false;
boolean inNCName = false;
for (int i = start; i < s.length();) {
int codePoint = Character.codePointAt(s, i);
if (codePoint == ':') {
if (foundColon) {
return false;
}
foundColon = true;
if (!inNCName) {
return false;
}
inNCName = false;
} else {
if (!inNCName) {
if (!isXMLNameStartCharacter(codePoint)) {
return false;
}
inNCName = true;
} else {
if (!isXMLNameChar(codePoint)) {
return false;
}
}
}
i += Character.charCount(codePoint);
}
return true;
}
/**
* Determines if a character sequence has a suffix that is an NCName.
*
* @param s The character sequence.
* @return {@code true} if the character sequence {@code s} has a suffix that is an NCName.
*/
public static boolean hasNCNameSuffix(CharSequence s) {
return getNCNameSuffixIndex(s) != -1;
}
/**
* Gets the index of the longest NCName that is the suffix of a character sequence.
*
* @param s The character sequence.
* @return The index of the longest suffix of the specified character sequence {@code s} that is
* an NCName, or -1 if the character sequence {@code s} does not have a suffix that is
* an NCName.
*/
public static int getNCNameSuffixIndex(CharSequence s) {
// identify bnode labels and do not try to split them
if (s.length() > 1 && s.charAt(0) == '_' && s.charAt(1) == ':') {
return -1;
}
int index = -1;
for (int i = s.length() - 1; i > -1; i--) {
if (!Character.isLowSurrogate(s.charAt(i))) {
int codePoint = Character.codePointAt(s, i);
if (isNCNameStartChar(codePoint)) {
index = i;
}
if (!isNCNameChar(codePoint)) {
break;
}
}
}
return index;
}
/**
* Get the longest NCName that is a suffix of a character sequence.
*
* @param s The character sequence.
* @return The String which is the longest suffix of the character sequence {@code s} that is an
* NCName, or {@code null} if the character sequence {@code s} does not have a suffix
* that is an NCName.
*/
@Nullable
public static String getNCNameSuffix(CharSequence s) {
if (s.length() > 1 && s.charAt(0) == '_' && s.charAt(1) == ':') {
return null;
}
int localPartStartIndex = getNCNameSuffixIndex(s);
if (localPartStartIndex > -1) {
return s.toString().substring(localPartStartIndex);
} else {
return null;
}
}
/**
* @param s string
* @return true if the input is null, empty or blank, i.e., only containing whitespace
* characters
*/
public static boolean isEmpty(@Nullable CharSequence s) {
if (s == null || s.length() == 0) {
return true;
}
return s.chars().allMatch(Character::isWhitespace);
}
/**
* utility to get the part of a char sequence that is not the NCName fragment.
*
* @param s the char sequence to split
* @return the prefix split at the last non-ncname character, or the whole input if no ncname is
* found
*/
@Nonnull
public static String getNCNamePrefix(CharSequence s) {
if (isEmpty(s)) {
return "";
}
if (s.length() > 1 && s.charAt(0) == '_' && s.charAt(1) == ':') {
return s.toString();
}
int localPartStartIndex = getNCNameSuffixIndex(s);
int firstNonBlank = 0;
while (Character.isWhitespace(s.charAt(firstNonBlank))) {
firstNonBlank++;
}
if (localPartStartIndex > -1) {
return s.toString().substring(firstNonBlank, localPartStartIndex);
} else {
return s.toString().substring(firstNonBlank);
}
}
/**
* Escapes a character sequence so that it is valid XML.
*
* @param s The character sequence.
* @return The escaped version of the character sequence.
*/
@Nonnull
public static String escapeXML(CharSequence s) {
// double quote -- quot
// ampersand -- amp
// less than -- lt
// greater than -- gt
// apostrophe -- apos
StringBuilder sb = new StringBuilder(s.length() * 2);
for (int i = 0; i < s.length();) {
int codePoint = Character.codePointAt(s, i);
if (codePoint == '<') {
sb.append(LT);
} else if (codePoint == '>') {
sb.append(GT);
} else if (codePoint == '\"') {
sb.append(QUOT);
} else if (codePoint == '&') {
sb.append(AMP);
} else if (codePoint == '\'') {
sb.append(APOS);
} else {
sb.appendCodePoint(codePoint);
}
i += Character.charCount(codePoint);
}
return sb.toString();
}
/**
* Escapes a subset of a char sequence so that it is valid XML. Escaped or unchanged characters
* are added to destination.
*
* @param chars chars to check
* @param start start index (inclusive)
* @param count number of characters
* @param destination destination for escaped chars
* @return The modified destination.
*/
public static StringBuilder escapeXML(char[] chars, int start, int count,
StringBuilder destination) {
// double quote -- quot
// ampersand -- amp
// less than -- lt
// greater than -- gt
// apostrophe -- apos
for (int i = 0; i < count; i++) {
char codePoint = chars[start + i];
if (codePoint == '<') {
destination.append(LT);
} else if (codePoint == '>') {
destination.append(GT);
} else if (codePoint == '\"') {
destination.append(QUOT);
} else if (codePoint == '&') {
destination.append(AMP);
} else if (codePoint == '\'') {
destination.append(APOS);
} else {
destination.append(codePoint);
}
}
return destination;
}
/**
* Escapes a string builder so that it is valid XML.
*
* @param sb The string builder to escape.
*/
public static void escapeXML(StringBuilder sb) {
// double quote -- quot
// ampersand -- amp
// less than -- lt
// greater than -- gt
// apostrophe -- apos
for (int i = 0; i < sb.length();) {
int codePoint = Character.codePointAt(sb, i);
int length = Character.charCount(codePoint);
if (codePoint == '<') {
sb.replace(i, i + length, LT);
i += LT.length();
} else if (codePoint == '>') {
sb.replace(i, i + length, GT);
i += GT.length();
} else if (codePoint == '\"') {
sb.replace(i, i + length, QUOT);
i += QUOT.length();
} else if (codePoint == '&') {
sb.replace(i, i + length, AMP);
i += AMP.length();
} else if (codePoint == '\'') {
sb.replace(i, i + length, APOS);
i += APOS.length();
} else {
i += length;
}
}
}
/**
* Determines if a character sequence is {@code null} or empty.
*
* @param s The character sequence.
* @return {@code true} if the character sequence is {@code null}, {@code true} if the character
* sequence is empty, otherwise {@code false}.
*/
public static boolean isNullOrEmpty(CharSequence s) {
return s == null || s.length() == 0;
}
/**
* @param iri input to check and terminate with a hash
* @return input plus a hash if the input does not terminate with hash or slash; if the input
* contains a hash in a position aside from the last character, it is returned
* unchanged. If null is received, return {@code "#"}.
*/
public static String iriWithTerminatingHash(@Nullable String iri) {
if (iri == null) {
return "#";
}
char c = iri.charAt(iri.length() - 1);
if (c == '/' || c == '#') {
return iri;
}
if (iri.indexOf('#') > -1) {
return iri;
}
return iri + '#';
}
}
